2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "tree-inline.h"
34 #include "insn-config.h"
36 #include "langhooks.h"
37 #include "basic-block.h"
38 #include "tree-iterator.h"
41 #include "tree-mudflap.h"
42 #include "tree-flow.h"
45 #include "tree-flow.h"
46 #include "diagnostic.h"
49 #include "pointer-set.h"
51 #include "value-prof.h"
52 #include "tree-pass.h"
54 #include "integrate.h"
56 /* I'm not real happy about this, but we need to handle gimple and
60 /* Inlining, Cloning, Versioning, Parallelization
62 Inlining: a function body is duplicated, but the PARM_DECLs are
63 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
64 MODIFY_EXPRs that store to a dedicated returned-value variable.
65 The duplicated eh_region info of the copy will later be appended
66 to the info for the caller; the eh_region info in copied throwing
67 statements and RESX statements are adjusted accordingly.
69 Cloning: (only in C++) We have one body for a con/de/structor, and
70 multiple function decls, each with a unique parameter list.
71 Duplicate the body, using the given splay tree; some parameters
72 will become constants (like 0 or 1).
74 Versioning: a function body is duplicated and the result is a new
75 function rather than into blocks of an existing function as with
76 inlining. Some parameters will become constants.
78 Parallelization: a region of a function is duplicated resulting in
79 a new function. Variables may be replaced with complex expressions
80 to enable shared variable semantics.
82 All of these will simultaneously lookup any callgraph edges. If
83 we're going to inline the duplicated function body, and the given
84 function has some cloned callgraph nodes (one for each place this
85 function will be inlined) those callgraph edges will be duplicated.
86 If we're cloning the body, those callgraph edges will be
87 updated to point into the new body. (Note that the original
88 callgraph node and edge list will not be altered.)
90 See the CALL_EXPR handling case in copy_tree_body_r (). */
94 o In order to make inlining-on-trees work, we pessimized
95 function-local static constants. In particular, they are now
96 always output, even when not addressed. Fix this by treating
97 function-local static constants just like global static
98 constants; the back-end already knows not to output them if they
101 o Provide heuristics to clamp inlining of recursive template
105 /* Weights that estimate_num_insns uses for heuristics in inlining. */
107 eni_weights eni_inlining_weights;
109 /* Weights that estimate_num_insns uses to estimate the size of the
112 eni_weights eni_size_weights;
114 /* Weights that estimate_num_insns uses to estimate the time necessary
115 to execute the produced code. */
117 eni_weights eni_time_weights;
121 static tree declare_return_variable (copy_body_data *, tree, tree);
122 static void remap_block (tree *, copy_body_data *);
123 static void copy_bind_expr (tree *, int *, copy_body_data *);
124 static tree mark_local_for_remap_r (tree *, int *, void *);
125 static void unsave_expr_1 (tree);
126 static tree unsave_r (tree *, int *, void *);
127 static void declare_inline_vars (tree, tree);
128 static void remap_save_expr (tree *, void *, int *);
129 static void prepend_lexical_block (tree current_block, tree new_block);
130 static tree copy_decl_to_var (tree, copy_body_data *);
131 static tree copy_result_decl_to_var (tree, copy_body_data *);
132 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
133 static gimple remap_gimple_stmt (gimple, copy_body_data *);
134 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
136 /* Insert a tree->tree mapping for ID. Despite the name suggests
137 that the trees should be variables, it is used for more than that. */
140 insert_decl_map (copy_body_data *id, tree key, tree value)
142 *pointer_map_insert (id->decl_map, key) = value;
144 /* Always insert an identity map as well. If we see this same new
145 node again, we won't want to duplicate it a second time. */
147 *pointer_map_insert (id->decl_map, value) = value;
150 /* Insert a tree->tree mapping for ID. This is only used for
154 insert_debug_decl_map (copy_body_data *id, tree key, tree value)
156 if (!gimple_in_ssa_p (id->src_cfun))
159 if (!MAY_HAVE_DEBUG_STMTS)
162 if (!target_for_debug_bind (key))
165 gcc_assert (TREE_CODE (key) == PARM_DECL);
166 gcc_assert (TREE_CODE (value) == VAR_DECL);
169 id->debug_map = pointer_map_create ();
171 *pointer_map_insert (id->debug_map, key) = value;
174 /* If nonzero, we're remapping the contents of inlined debug
175 statements. If negative, an error has occurred, such as a
176 reference to a variable that isn't available in the inlined
178 static int processing_debug_stmt = 0;
180 /* Construct new SSA name for old NAME. ID is the inline context. */
183 remap_ssa_name (tree name, copy_body_data *id)
188 gcc_assert (TREE_CODE (name) == SSA_NAME);
190 n = (tree *) pointer_map_contains (id->decl_map, name);
192 return unshare_expr (*n);
194 if (processing_debug_stmt)
196 processing_debug_stmt = -1;
200 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
202 new_tree = remap_decl (SSA_NAME_VAR (name), id);
204 /* We might've substituted constant or another SSA_NAME for
207 Replace the SSA name representing RESULT_DECL by variable during
208 inlining: this saves us from need to introduce PHI node in a case
209 return value is just partly initialized. */
210 if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
211 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
212 || !id->transform_return_to_modify))
214 new_tree = make_ssa_name (new_tree, NULL);
215 insert_decl_map (id, name, new_tree);
216 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
217 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
218 TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
219 if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
221 /* By inlining function having uninitialized variable, we might
222 extend the lifetime (variable might get reused). This cause
223 ICE in the case we end up extending lifetime of SSA name across
224 abnormal edge, but also increase register pressure.
226 We simply initialize all uninitialized vars by 0 except
227 for case we are inlining to very first BB. We can avoid
228 this for all BBs that are not inside strongly connected
229 regions of the CFG, but this is expensive to test. */
231 && is_gimple_reg (SSA_NAME_VAR (name))
232 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
233 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
234 || EDGE_COUNT (id->entry_bb->preds) != 1))
236 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
239 init_stmt = gimple_build_assign (new_tree,
240 fold_convert (TREE_TYPE (new_tree),
242 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
243 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
247 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
248 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
250 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
255 insert_decl_map (id, name, new_tree);
259 /* Remap DECL during the copying of the BLOCK tree for the function. */
262 remap_decl (tree decl, copy_body_data *id)
266 /* We only remap local variables in the current function. */
268 /* See if we have remapped this declaration. */
270 n = (tree *) pointer_map_contains (id->decl_map, decl);
272 if (!n && processing_debug_stmt)
274 processing_debug_stmt = -1;
278 /* If we didn't already have an equivalent for this declaration,
282 /* Make a copy of the variable or label. */
283 tree t = id->copy_decl (decl, id);
285 /* Remember it, so that if we encounter this local entity again
286 we can reuse this copy. Do this early because remap_type may
287 need this decl for TYPE_STUB_DECL. */
288 insert_decl_map (id, decl, t);
293 /* Remap types, if necessary. */
294 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
295 if (TREE_CODE (t) == TYPE_DECL)
296 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
298 /* Remap sizes as necessary. */
299 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
300 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
302 /* If fields, do likewise for offset and qualifier. */
303 if (TREE_CODE (t) == FIELD_DECL)
305 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
306 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
307 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
310 if (cfun && gimple_in_ssa_p (cfun)
311 && (TREE_CODE (t) == VAR_DECL
312 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
314 tree def = gimple_default_def (id->src_cfun, decl);
316 if (TREE_CODE (decl) != PARM_DECL && def)
318 tree map = remap_ssa_name (def, id);
319 /* Watch out RESULT_DECLs whose SSA names map directly
321 if (TREE_CODE (map) == SSA_NAME
322 && gimple_nop_p (SSA_NAME_DEF_STMT (map)))
323 set_default_def (t, map);
325 add_referenced_var (t);
330 if (id->do_not_unshare)
333 return unshare_expr (*n);
337 remap_type_1 (tree type, copy_body_data *id)
341 /* We do need a copy. build and register it now. If this is a pointer or
342 reference type, remap the designated type and make a new pointer or
344 if (TREE_CODE (type) == POINTER_TYPE)
346 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
348 TYPE_REF_CAN_ALIAS_ALL (type));
349 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
350 new_tree = build_type_attribute_qual_variant (new_tree,
351 TYPE_ATTRIBUTES (type),
353 insert_decl_map (id, type, new_tree);
356 else if (TREE_CODE (type) == REFERENCE_TYPE)
358 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
360 TYPE_REF_CAN_ALIAS_ALL (type));
361 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
362 new_tree = build_type_attribute_qual_variant (new_tree,
363 TYPE_ATTRIBUTES (type),
365 insert_decl_map (id, type, new_tree);
369 new_tree = copy_node (type);
371 insert_decl_map (id, type, new_tree);
373 /* This is a new type, not a copy of an old type. Need to reassociate
374 variants. We can handle everything except the main variant lazily. */
375 t = TYPE_MAIN_VARIANT (type);
378 t = remap_type (t, id);
379 TYPE_MAIN_VARIANT (new_tree) = t;
380 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
381 TYPE_NEXT_VARIANT (t) = new_tree;
385 TYPE_MAIN_VARIANT (new_tree) = new_tree;
386 TYPE_NEXT_VARIANT (new_tree) = NULL;
389 if (TYPE_STUB_DECL (type))
390 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
392 /* Lazily create pointer and reference types. */
393 TYPE_POINTER_TO (new_tree) = NULL;
394 TYPE_REFERENCE_TO (new_tree) = NULL;
396 switch (TREE_CODE (new_tree))
400 case FIXED_POINT_TYPE:
403 t = TYPE_MIN_VALUE (new_tree);
404 if (t && TREE_CODE (t) != INTEGER_CST)
405 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
407 t = TYPE_MAX_VALUE (new_tree);
408 if (t && TREE_CODE (t) != INTEGER_CST)
409 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
413 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
414 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
418 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
419 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
424 case QUAL_UNION_TYPE:
428 for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f))
430 t = remap_decl (f, id);
431 DECL_CONTEXT (t) = new_tree;
435 TYPE_FIELDS (new_tree) = nreverse (nf);
441 /* Shouldn't have been thought variable sized. */
445 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
446 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
452 remap_type (tree type, copy_body_data *id)
460 /* See if we have remapped this type. */
461 node = (tree *) pointer_map_contains (id->decl_map, type);
465 /* The type only needs remapping if it's variably modified. */
466 if (! variably_modified_type_p (type, id->src_fn))
468 insert_decl_map (id, type, type);
472 id->remapping_type_depth++;
473 tmp = remap_type_1 (type, id);
474 id->remapping_type_depth--;
479 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
480 is NULL or TYPE has not been remapped before. */
483 remapped_type (tree type, copy_body_data *id)
490 /* See if we have remapped this type. */
491 node = (tree *) pointer_map_contains (id->decl_map, type);
498 /* The type only needs remapping if it's variably modified. */
499 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
502 can_be_nonlocal (tree decl, copy_body_data *id)
504 /* We can not duplicate function decls. */
505 if (TREE_CODE (decl) == FUNCTION_DECL)
508 /* Local static vars must be non-local or we get multiple declaration
510 if (TREE_CODE (decl) == VAR_DECL
511 && !auto_var_in_fn_p (decl, id->src_fn))
514 /* At the moment dwarf2out can handle only these types of nodes. We
515 can support more later. */
516 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
519 /* We must use global type. We call remapped_type instead of
520 remap_type since we don't want to remap this type here if it
521 hasn't been remapped before. */
522 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
525 /* Wihtout SSA we can't tell if variable is used. */
526 if (!gimple_in_ssa_p (cfun))
529 /* Live variables must be copied so we can attach DECL_RTL. */
537 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
540 tree new_decls = NULL_TREE;
542 /* Remap its variables. */
543 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
546 tree origin_var = DECL_ORIGIN (old_var);
548 if (can_be_nonlocal (old_var, id))
550 if (TREE_CODE (old_var) == VAR_DECL
551 && ! DECL_EXTERNAL (old_var)
552 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
553 cfun->local_decls = tree_cons (NULL_TREE, old_var,
555 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
556 && !DECL_IGNORED_P (old_var)
557 && nonlocalized_list)
558 VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
562 /* Remap the variable. */
563 new_var = remap_decl (old_var, id);
565 /* If we didn't remap this variable, we can't mess with its
566 TREE_CHAIN. If we remapped this variable to the return slot, it's
567 already declared somewhere else, so don't declare it here. */
569 if (new_var == id->retvar)
573 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
574 && !DECL_IGNORED_P (old_var)
575 && nonlocalized_list)
576 VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
580 gcc_assert (DECL_P (new_var));
581 TREE_CHAIN (new_var) = new_decls;
586 return nreverse (new_decls);
589 /* Copy the BLOCK to contain remapped versions of the variables
590 therein. And hook the new block into the block-tree. */
593 remap_block (tree *block, copy_body_data *id)
598 /* Make the new block. */
600 new_block = make_node (BLOCK);
601 TREE_USED (new_block) = TREE_USED (old_block);
602 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
603 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
604 BLOCK_NONLOCALIZED_VARS (new_block)
605 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
608 /* Remap its variables. */
609 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
610 &BLOCK_NONLOCALIZED_VARS (new_block),
613 if (id->transform_lang_insert_block)
614 id->transform_lang_insert_block (new_block);
616 /* Remember the remapped block. */
617 insert_decl_map (id, old_block, new_block);
620 /* Copy the whole block tree and root it in id->block. */
622 remap_blocks (tree block, copy_body_data *id)
625 tree new_tree = block;
630 remap_block (&new_tree, id);
631 gcc_assert (new_tree != block);
632 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
633 prepend_lexical_block (new_tree, remap_blocks (t, id));
634 /* Blocks are in arbitrary order, but make things slightly prettier and do
635 not swap order when producing a copy. */
636 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
641 copy_statement_list (tree *tp)
643 tree_stmt_iterator oi, ni;
646 new_tree = alloc_stmt_list ();
647 ni = tsi_start (new_tree);
648 oi = tsi_start (*tp);
649 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
652 for (; !tsi_end_p (oi); tsi_next (&oi))
654 tree stmt = tsi_stmt (oi);
655 if (TREE_CODE (stmt) == STATEMENT_LIST)
656 copy_statement_list (&stmt);
657 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
662 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
664 tree block = BIND_EXPR_BLOCK (*tp);
665 /* Copy (and replace) the statement. */
666 copy_tree_r (tp, walk_subtrees, NULL);
669 remap_block (&block, id);
670 BIND_EXPR_BLOCK (*tp) = block;
673 if (BIND_EXPR_VARS (*tp))
674 /* This will remap a lot of the same decls again, but this should be
676 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
680 /* Create a new gimple_seq by remapping all the statements in BODY
681 using the inlining information in ID. */
684 remap_gimple_seq (gimple_seq body, copy_body_data *id)
686 gimple_stmt_iterator si;
687 gimple_seq new_body = NULL;
689 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
691 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
692 gimple_seq_add_stmt (&new_body, new_stmt);
699 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
700 block using the mapping information in ID. */
703 copy_gimple_bind (gimple stmt, copy_body_data *id)
706 tree new_block, new_vars;
707 gimple_seq body, new_body;
709 /* Copy the statement. Note that we purposely don't use copy_stmt
710 here because we need to remap statements as we copy. */
711 body = gimple_bind_body (stmt);
712 new_body = remap_gimple_seq (body, id);
714 new_block = gimple_bind_block (stmt);
716 remap_block (&new_block, id);
718 /* This will remap a lot of the same decls again, but this should be
720 new_vars = gimple_bind_vars (stmt);
722 new_vars = remap_decls (new_vars, NULL, id);
724 new_bind = gimple_build_bind (new_vars, new_body, new_block);
730 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
731 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
732 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
733 recursing into the children nodes of *TP. */
736 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
738 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
739 copy_body_data *id = (copy_body_data *) wi_p->info;
740 tree fn = id->src_fn;
742 if (TREE_CODE (*tp) == SSA_NAME)
744 *tp = remap_ssa_name (*tp, id);
748 else if (auto_var_in_fn_p (*tp, fn))
750 /* Local variables and labels need to be replaced by equivalent
751 variables. We don't want to copy static variables; there's
752 only one of those, no matter how many times we inline the
753 containing function. Similarly for globals from an outer
757 /* Remap the declaration. */
758 new_decl = remap_decl (*tp, id);
759 gcc_assert (new_decl);
760 /* Replace this variable with the copy. */
761 STRIP_TYPE_NOPS (new_decl);
762 /* ??? The C++ frontend uses void * pointer zero to initialize
763 any other type. This confuses the middle-end type verification.
764 As cloned bodies do not go through gimplification again the fixup
765 there doesn't trigger. */
766 if (TREE_CODE (new_decl) == INTEGER_CST
767 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
768 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
772 else if (TREE_CODE (*tp) == STATEMENT_LIST)
774 else if (TREE_CODE (*tp) == SAVE_EXPR)
776 else if (TREE_CODE (*tp) == LABEL_DECL
777 && (!DECL_CONTEXT (*tp)
778 || decl_function_context (*tp) == id->src_fn))
779 /* These may need to be remapped for EH handling. */
780 *tp = remap_decl (*tp, id);
781 else if (TYPE_P (*tp))
782 /* Types may need remapping as well. */
783 *tp = remap_type (*tp, id);
784 else if (CONSTANT_CLASS_P (*tp))
786 /* If this is a constant, we have to copy the node iff the type
787 will be remapped. copy_tree_r will not copy a constant. */
788 tree new_type = remap_type (TREE_TYPE (*tp), id);
790 if (new_type == TREE_TYPE (*tp))
793 else if (TREE_CODE (*tp) == INTEGER_CST)
794 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
795 TREE_INT_CST_HIGH (*tp));
798 *tp = copy_node (*tp);
799 TREE_TYPE (*tp) = new_type;
804 /* Otherwise, just copy the node. Note that copy_tree_r already
805 knows not to copy VAR_DECLs, etc., so this is safe. */
806 if (TREE_CODE (*tp) == INDIRECT_REF)
808 /* Get rid of *& from inline substitutions that can happen when a
809 pointer argument is an ADDR_EXPR. */
810 tree decl = TREE_OPERAND (*tp, 0);
813 n = (tree *) pointer_map_contains (id->decl_map, decl);
816 tree type, new_tree, old;
818 /* If we happen to get an ADDR_EXPR in n->value, strip
819 it manually here as we'll eventually get ADDR_EXPRs
820 which lie about their types pointed to. In this case
821 build_fold_indirect_ref wouldn't strip the
822 INDIRECT_REF, but we absolutely rely on that. As
823 fold_indirect_ref does other useful transformations,
824 try that first, though. */
825 type = TREE_TYPE (TREE_TYPE (*n));
826 new_tree = unshare_expr (*n);
828 *tp = gimple_fold_indirect_ref (new_tree);
831 if (TREE_CODE (new_tree) == ADDR_EXPR)
833 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
835 /* ??? We should either assert here or build
836 a VIEW_CONVERT_EXPR instead of blindly leaking
837 incompatible types to our IL. */
839 *tp = TREE_OPERAND (new_tree, 0);
843 *tp = build1 (INDIRECT_REF, type, new_tree);
844 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
845 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
853 /* Here is the "usual case". Copy this tree node, and then
854 tweak some special cases. */
855 copy_tree_r (tp, walk_subtrees, NULL);
857 /* Global variables we haven't seen yet need to go into referenced
858 vars. If not referenced from types only. */
859 if (gimple_in_ssa_p (cfun)
860 && TREE_CODE (*tp) == VAR_DECL
861 && id->remapping_type_depth == 0
862 && !processing_debug_stmt)
863 add_referenced_var (*tp);
865 /* We should never have TREE_BLOCK set on non-statements. */
867 gcc_assert (!TREE_BLOCK (*tp));
869 if (TREE_CODE (*tp) != OMP_CLAUSE)
870 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
872 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
874 /* The copied TARGET_EXPR has never been expanded, even if the
875 original node was expanded already. */
876 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
877 TREE_OPERAND (*tp, 3) = NULL_TREE;
879 else if (TREE_CODE (*tp) == ADDR_EXPR)
881 /* Variable substitution need not be simple. In particular,
882 the INDIRECT_REF substitution above. Make sure that
883 TREE_CONSTANT and friends are up-to-date. But make sure
884 to not improperly set TREE_BLOCK on some sub-expressions. */
885 int invariant = is_gimple_min_invariant (*tp);
886 tree block = id->block;
887 id->block = NULL_TREE;
888 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
891 /* Handle the case where we substituted an INDIRECT_REF
892 into the operand of the ADDR_EXPR. */
893 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
894 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
896 recompute_tree_invariant_for_addr_expr (*tp);
898 /* If this used to be invariant, but is not any longer,
899 then regimplification is probably needed. */
900 if (invariant && !is_gimple_min_invariant (*tp))
901 id->regimplify = true;
907 /* Keep iterating. */
912 /* Called from copy_body_id via walk_tree. DATA is really a
913 `copy_body_data *'. */
916 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
918 copy_body_data *id = (copy_body_data *) data;
919 tree fn = id->src_fn;
922 /* Begin by recognizing trees that we'll completely rewrite for the
923 inlining context. Our output for these trees is completely
924 different from out input (e.g. RETURN_EXPR is deleted, and morphs
925 into an edge). Further down, we'll handle trees that get
926 duplicated and/or tweaked. */
928 /* When requested, RETURN_EXPRs should be transformed to just the
929 contained MODIFY_EXPR. The branch semantics of the return will
930 be handled elsewhere by manipulating the CFG rather than a statement. */
931 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
933 tree assignment = TREE_OPERAND (*tp, 0);
935 /* If we're returning something, just turn that into an
936 assignment into the equivalent of the original RESULT_DECL.
937 If the "assignment" is just the result decl, the result
938 decl has already been set (e.g. a recent "foo (&result_decl,
939 ...)"); just toss the entire RETURN_EXPR. */
940 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
942 /* Replace the RETURN_EXPR with (a copy of) the
943 MODIFY_EXPR hanging underneath. */
944 *tp = copy_node (assignment);
946 else /* Else the RETURN_EXPR returns no value. */
949 return (tree) (void *)1;
952 else if (TREE_CODE (*tp) == SSA_NAME)
954 *tp = remap_ssa_name (*tp, id);
959 /* Local variables and labels need to be replaced by equivalent
960 variables. We don't want to copy static variables; there's only
961 one of those, no matter how many times we inline the containing
962 function. Similarly for globals from an outer function. */
963 else if (auto_var_in_fn_p (*tp, fn))
967 /* Remap the declaration. */
968 new_decl = remap_decl (*tp, id);
969 gcc_assert (new_decl);
970 /* Replace this variable with the copy. */
971 STRIP_TYPE_NOPS (new_decl);
975 else if (TREE_CODE (*tp) == STATEMENT_LIST)
976 copy_statement_list (tp);
977 else if (TREE_CODE (*tp) == SAVE_EXPR
978 || TREE_CODE (*tp) == TARGET_EXPR)
979 remap_save_expr (tp, id->decl_map, walk_subtrees);
980 else if (TREE_CODE (*tp) == LABEL_DECL
981 && (! DECL_CONTEXT (*tp)
982 || decl_function_context (*tp) == id->src_fn))
983 /* These may need to be remapped for EH handling. */
984 *tp = remap_decl (*tp, id);
985 else if (TREE_CODE (*tp) == BIND_EXPR)
986 copy_bind_expr (tp, walk_subtrees, id);
987 /* Types may need remapping as well. */
988 else if (TYPE_P (*tp))
989 *tp = remap_type (*tp, id);
991 /* If this is a constant, we have to copy the node iff the type will be
992 remapped. copy_tree_r will not copy a constant. */
993 else if (CONSTANT_CLASS_P (*tp))
995 tree new_type = remap_type (TREE_TYPE (*tp), id);
997 if (new_type == TREE_TYPE (*tp))
1000 else if (TREE_CODE (*tp) == INTEGER_CST)
1001 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
1002 TREE_INT_CST_HIGH (*tp));
1005 *tp = copy_node (*tp);
1006 TREE_TYPE (*tp) = new_type;
1010 /* Otherwise, just copy the node. Note that copy_tree_r already
1011 knows not to copy VAR_DECLs, etc., so this is safe. */
1014 /* Here we handle trees that are not completely rewritten.
1015 First we detect some inlining-induced bogosities for
1017 if (TREE_CODE (*tp) == MODIFY_EXPR
1018 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1019 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1021 /* Some assignments VAR = VAR; don't generate any rtl code
1022 and thus don't count as variable modification. Avoid
1023 keeping bogosities like 0 = 0. */
1024 tree decl = TREE_OPERAND (*tp, 0), value;
1027 n = (tree *) pointer_map_contains (id->decl_map, decl);
1031 STRIP_TYPE_NOPS (value);
1032 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1034 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1035 return copy_tree_body_r (tp, walk_subtrees, data);
1039 else if (TREE_CODE (*tp) == INDIRECT_REF)
1041 /* Get rid of *& from inline substitutions that can happen when a
1042 pointer argument is an ADDR_EXPR. */
1043 tree decl = TREE_OPERAND (*tp, 0);
1046 n = (tree *) pointer_map_contains (id->decl_map, decl);
1051 /* If we happen to get an ADDR_EXPR in n->value, strip
1052 it manually here as we'll eventually get ADDR_EXPRs
1053 which lie about their types pointed to. In this case
1054 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1055 but we absolutely rely on that. As fold_indirect_ref
1056 does other useful transformations, try that first, though. */
1057 tree type = TREE_TYPE (TREE_TYPE (*n));
1058 if (id->do_not_unshare)
1061 new_tree = unshare_expr (*n);
1063 *tp = gimple_fold_indirect_ref (new_tree);
1066 if (TREE_CODE (new_tree) == ADDR_EXPR)
1068 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1070 /* ??? We should either assert here or build
1071 a VIEW_CONVERT_EXPR instead of blindly leaking
1072 incompatible types to our IL. */
1074 *tp = TREE_OPERAND (new_tree, 0);
1078 *tp = build1 (INDIRECT_REF, type, new_tree);
1079 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1080 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1088 /* Here is the "usual case". Copy this tree node, and then
1089 tweak some special cases. */
1090 copy_tree_r (tp, walk_subtrees, NULL);
1092 /* Global variables we haven't seen yet needs to go into referenced
1093 vars. If not referenced from types or debug stmts only. */
1094 if (gimple_in_ssa_p (cfun)
1095 && TREE_CODE (*tp) == VAR_DECL
1096 && id->remapping_type_depth == 0
1097 && !processing_debug_stmt)
1098 add_referenced_var (*tp);
1100 /* If EXPR has block defined, map it to newly constructed block.
1101 When inlining we want EXPRs without block appear in the block
1102 of function call if we are not remapping a type. */
1105 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1106 if (TREE_BLOCK (*tp))
1109 n = (tree *) pointer_map_contains (id->decl_map,
1114 TREE_BLOCK (*tp) = new_block;
1117 if (TREE_CODE (*tp) != OMP_CLAUSE)
1118 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1120 /* The copied TARGET_EXPR has never been expanded, even if the
1121 original node was expanded already. */
1122 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1124 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1125 TREE_OPERAND (*tp, 3) = NULL_TREE;
1128 /* Variable substitution need not be simple. In particular, the
1129 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1130 and friends are up-to-date. */
1131 else if (TREE_CODE (*tp) == ADDR_EXPR)
1133 int invariant = is_gimple_min_invariant (*tp);
1134 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1136 /* Handle the case where we substituted an INDIRECT_REF
1137 into the operand of the ADDR_EXPR. */
1138 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1139 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1141 recompute_tree_invariant_for_addr_expr (*tp);
1143 /* If this used to be invariant, but is not any longer,
1144 then regimplification is probably needed. */
1145 if (invariant && !is_gimple_min_invariant (*tp))
1146 id->regimplify = true;
1152 /* Keep iterating. */
1156 /* Helper for remap_gimple_stmt. Given an EH region number for the
1157 source function, map that to the duplicate EH region number in
1158 the destination function. */
1161 remap_eh_region_nr (int old_nr, copy_body_data *id)
1163 eh_region old_r, new_r;
1166 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1167 slot = pointer_map_contains (id->eh_map, old_r);
1168 new_r = (eh_region) *slot;
1170 return new_r->index;
1173 /* Similar, but operate on INTEGER_CSTs. */
1176 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1180 old_nr = tree_low_cst (old_t_nr, 0);
1181 new_nr = remap_eh_region_nr (old_nr, id);
1183 return build_int_cst (NULL, new_nr);
1186 /* Helper for copy_bb. Remap statement STMT using the inlining
1187 information in ID. Return the new statement copy. */
1190 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1193 struct walk_stmt_info wi;
1195 bool skip_first = false;
1197 /* Begin by recognizing trees that we'll completely rewrite for the
1198 inlining context. Our output for these trees is completely
1199 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1200 into an edge). Further down, we'll handle trees that get
1201 duplicated and/or tweaked. */
1203 /* When requested, GIMPLE_RETURNs should be transformed to just the
1204 contained GIMPLE_ASSIGN. The branch semantics of the return will
1205 be handled elsewhere by manipulating the CFG rather than the
1207 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1209 tree retval = gimple_return_retval (stmt);
1211 /* If we're returning something, just turn that into an
1212 assignment into the equivalent of the original RESULT_DECL.
1213 If RETVAL is just the result decl, the result decl has
1214 already been set (e.g. a recent "foo (&result_decl, ...)");
1215 just toss the entire GIMPLE_RETURN. */
1216 if (retval && TREE_CODE (retval) != RESULT_DECL)
1218 copy = gimple_build_assign (id->retvar, retval);
1219 /* id->retvar is already substituted. Skip it on later remapping. */
1223 return gimple_build_nop ();
1225 else if (gimple_has_substatements (stmt))
1229 /* When cloning bodies from the C++ front end, we will be handed bodies
1230 in High GIMPLE form. Handle here all the High GIMPLE statements that
1231 have embedded statements. */
1232 switch (gimple_code (stmt))
1235 copy = copy_gimple_bind (stmt, id);
1239 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1240 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1243 case GIMPLE_EH_FILTER:
1244 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1245 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1249 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1250 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1251 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1254 case GIMPLE_WITH_CLEANUP_EXPR:
1255 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1256 copy = gimple_build_wce (s1);
1259 case GIMPLE_OMP_PARALLEL:
1260 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1261 copy = gimple_build_omp_parallel
1263 gimple_omp_parallel_clauses (stmt),
1264 gimple_omp_parallel_child_fn (stmt),
1265 gimple_omp_parallel_data_arg (stmt));
1268 case GIMPLE_OMP_TASK:
1269 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1270 copy = gimple_build_omp_task
1272 gimple_omp_task_clauses (stmt),
1273 gimple_omp_task_child_fn (stmt),
1274 gimple_omp_task_data_arg (stmt),
1275 gimple_omp_task_copy_fn (stmt),
1276 gimple_omp_task_arg_size (stmt),
1277 gimple_omp_task_arg_align (stmt));
1280 case GIMPLE_OMP_FOR:
1281 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1282 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1283 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1284 gimple_omp_for_collapse (stmt), s2);
1287 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1289 gimple_omp_for_set_index (copy, i,
1290 gimple_omp_for_index (stmt, i));
1291 gimple_omp_for_set_initial (copy, i,
1292 gimple_omp_for_initial (stmt, i));
1293 gimple_omp_for_set_final (copy, i,
1294 gimple_omp_for_final (stmt, i));
1295 gimple_omp_for_set_incr (copy, i,
1296 gimple_omp_for_incr (stmt, i));
1297 gimple_omp_for_set_cond (copy, i,
1298 gimple_omp_for_cond (stmt, i));
1303 case GIMPLE_OMP_MASTER:
1304 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1305 copy = gimple_build_omp_master (s1);
1308 case GIMPLE_OMP_ORDERED:
1309 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1310 copy = gimple_build_omp_ordered (s1);
1313 case GIMPLE_OMP_SECTION:
1314 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1315 copy = gimple_build_omp_section (s1);
1318 case GIMPLE_OMP_SECTIONS:
1319 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1320 copy = gimple_build_omp_sections
1321 (s1, gimple_omp_sections_clauses (stmt));
1324 case GIMPLE_OMP_SINGLE:
1325 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1326 copy = gimple_build_omp_single
1327 (s1, gimple_omp_single_clauses (stmt));
1330 case GIMPLE_OMP_CRITICAL:
1331 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1333 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1342 if (gimple_assign_copy_p (stmt)
1343 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1344 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1346 /* Here we handle statements that are not completely rewritten.
1347 First we detect some inlining-induced bogosities for
1350 /* Some assignments VAR = VAR; don't generate any rtl code
1351 and thus don't count as variable modification. Avoid
1352 keeping bogosities like 0 = 0. */
1353 tree decl = gimple_assign_lhs (stmt), value;
1356 n = (tree *) pointer_map_contains (id->decl_map, decl);
1360 STRIP_TYPE_NOPS (value);
1361 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1362 return gimple_build_nop ();
1366 if (gimple_debug_bind_p (stmt))
1368 copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1369 gimple_debug_bind_get_value (stmt),
1371 VEC_safe_push (gimple, heap, id->debug_stmts, copy);
1375 /* Create a new deep copy of the statement. */
1376 copy = gimple_copy (stmt);
1378 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1379 RESX and EH_DISPATCH. */
1381 switch (gimple_code (copy))
1385 tree r, fndecl = gimple_call_fndecl (copy);
1386 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1387 switch (DECL_FUNCTION_CODE (fndecl))
1389 case BUILT_IN_EH_COPY_VALUES:
1390 r = gimple_call_arg (copy, 1);
1391 r = remap_eh_region_tree_nr (r, id);
1392 gimple_call_set_arg (copy, 1, r);
1395 case BUILT_IN_EH_POINTER:
1396 case BUILT_IN_EH_FILTER:
1397 r = gimple_call_arg (copy, 0);
1398 r = remap_eh_region_tree_nr (r, id);
1399 gimple_call_set_arg (copy, 0, r);
1410 int r = gimple_resx_region (copy);
1411 r = remap_eh_region_nr (r, id);
1412 gimple_resx_set_region (copy, r);
1416 case GIMPLE_EH_DISPATCH:
1418 int r = gimple_eh_dispatch_region (copy);
1419 r = remap_eh_region_nr (r, id);
1420 gimple_eh_dispatch_set_region (copy, r);
1429 /* If STMT has a block defined, map it to the newly constructed
1430 block. When inlining we want statements without a block to
1431 appear in the block of the function call. */
1432 new_block = id->block;
1433 if (gimple_block (copy))
1436 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1441 gimple_set_block (copy, new_block);
1443 if (gimple_debug_bind_p (copy))
1446 /* Remap all the operands in COPY. */
1447 memset (&wi, 0, sizeof (wi));
1450 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1452 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1454 /* Clear the copied virtual operands. We are not remapping them here
1455 but are going to recreate them from scratch. */
1456 if (gimple_has_mem_ops (copy))
1458 gimple_set_vdef (copy, NULL_TREE);
1459 gimple_set_vuse (copy, NULL_TREE);
1466 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1470 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1471 gcov_type count_scale)
1473 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1474 basic_block copy_basic_block;
1478 /* create_basic_block() will append every new block to
1479 basic_block_info automatically. */
1480 copy_basic_block = create_basic_block (NULL, (void *) 0,
1481 (basic_block) bb->prev_bb->aux);
1482 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1484 /* We are going to rebuild frequencies from scratch. These values
1485 have just small importance to drive canonicalize_loop_headers. */
1486 freq = ((gcov_type)bb->frequency * frequency_scale / REG_BR_PROB_BASE);
1488 /* We recompute frequencies after inlining, so this is quite safe. */
1489 if (freq > BB_FREQ_MAX)
1491 copy_basic_block->frequency = freq;
1493 copy_gsi = gsi_start_bb (copy_basic_block);
1495 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1497 gimple stmt = gsi_stmt (gsi);
1498 gimple orig_stmt = stmt;
1500 id->regimplify = false;
1501 stmt = remap_gimple_stmt (stmt, id);
1502 if (gimple_nop_p (stmt))
1505 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1508 /* With return slot optimization we can end up with
1509 non-gimple (foo *)&this->m, fix that here. */
1510 if (is_gimple_assign (stmt)
1511 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1512 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1515 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1516 gimple_assign_rhs1 (stmt),
1517 true, NULL, false, GSI_NEW_STMT);
1518 gimple_assign_set_rhs1 (stmt, new_rhs);
1519 id->regimplify = false;
1522 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1525 gimple_regimplify_operands (stmt, &seq_gsi);
1527 /* If copy_basic_block has been empty at the start of this iteration,
1528 call gsi_start_bb again to get at the newly added statements. */
1529 if (gsi_end_p (copy_gsi))
1530 copy_gsi = gsi_start_bb (copy_basic_block);
1532 gsi_next (©_gsi);
1534 /* Process the new statement. The call to gimple_regimplify_operands
1535 possibly turned the statement into multiple statements, we
1536 need to process all of them. */
1541 stmt = gsi_stmt (copy_gsi);
1542 if (is_gimple_call (stmt)
1543 && gimple_call_va_arg_pack_p (stmt)
1546 /* __builtin_va_arg_pack () should be replaced by
1547 all arguments corresponding to ... in the caller. */
1550 VEC(tree, heap) *argarray;
1551 size_t nargs = gimple_call_num_args (id->gimple_call);
1554 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1557 /* Create the new array of arguments. */
1558 n = nargs + gimple_call_num_args (stmt);
1559 argarray = VEC_alloc (tree, heap, n);
1560 VEC_safe_grow (tree, heap, argarray, n);
1562 /* Copy all the arguments before '...' */
1563 memcpy (VEC_address (tree, argarray),
1564 gimple_call_arg_ptr (stmt, 0),
1565 gimple_call_num_args (stmt) * sizeof (tree));
1567 /* Append the arguments passed in '...' */
1568 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1569 gimple_call_arg_ptr (id->gimple_call, 0)
1570 + (gimple_call_num_args (id->gimple_call) - nargs),
1571 nargs * sizeof (tree));
1573 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1576 VEC_free (tree, heap, argarray);
1578 /* Copy all GIMPLE_CALL flags, location and block, except
1579 GF_CALL_VA_ARG_PACK. */
1580 gimple_call_copy_flags (new_call, stmt);
1581 gimple_call_set_va_arg_pack (new_call, false);
1582 gimple_set_location (new_call, gimple_location (stmt));
1583 gimple_set_block (new_call, gimple_block (stmt));
1584 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1586 gsi_replace (©_gsi, new_call, false);
1587 gimple_set_bb (stmt, NULL);
1590 else if (is_gimple_call (stmt)
1592 && (decl = gimple_call_fndecl (stmt))
1593 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1594 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1596 /* __builtin_va_arg_pack_len () should be replaced by
1597 the number of anonymous arguments. */
1598 size_t nargs = gimple_call_num_args (id->gimple_call);
1602 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1605 count = build_int_cst (integer_type_node, nargs);
1606 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1607 gsi_replace (©_gsi, new_stmt, false);
1611 /* Statements produced by inlining can be unfolded, especially
1612 when we constant propagated some operands. We can't fold
1613 them right now for two reasons:
1614 1) folding require SSA_NAME_DEF_STMTs to be correct
1615 2) we can't change function calls to builtins.
1616 So we just mark statement for later folding. We mark
1617 all new statements, instead just statements that has changed
1618 by some nontrivial substitution so even statements made
1619 foldable indirectly are updated. If this turns out to be
1620 expensive, copy_body can be told to watch for nontrivial
1622 if (id->statements_to_fold)
1623 pointer_set_insert (id->statements_to_fold, stmt);
1625 /* We're duplicating a CALL_EXPR. Find any corresponding
1626 callgraph edges and update or duplicate them. */
1627 if (is_gimple_call (stmt))
1629 struct cgraph_edge *edge;
1632 switch (id->transform_call_graph_edges)
1634 case CB_CGE_DUPLICATE:
1635 edge = cgraph_edge (id->src_node, orig_stmt);
1638 int edge_freq = edge->frequency;
1639 edge = cgraph_clone_edge (edge, id->dst_node, stmt,
1641 REG_BR_PROB_BASE, CGRAPH_FREQ_BASE,
1642 edge->frequency, true);
1643 /* We could also just rescale the frequency, but
1644 doing so would introduce roundoff errors and make
1645 verifier unhappy. */
1647 = compute_call_stmt_bb_frequency (id->dst_node->decl,
1650 && profile_status_for_function (cfun) != PROFILE_ABSENT
1651 && (edge_freq > edge->frequency + 10
1652 || edge_freq < edge->frequency - 10))
1654 fprintf (dump_file, "Edge frequency estimated by "
1655 "cgraph %i diverge from inliner's estimate %i\n",
1659 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
1662 copy_basic_block->frequency);
1667 case CB_CGE_MOVE_CLONES:
1668 cgraph_set_call_stmt_including_clones (id->dst_node,
1670 edge = cgraph_edge (id->dst_node, stmt);
1674 edge = cgraph_edge (id->dst_node, orig_stmt);
1676 cgraph_set_call_stmt (edge, stmt);
1683 /* Constant propagation on argument done during inlining
1684 may create new direct call. Produce an edge for it. */
1686 || (edge->indirect_call
1687 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1688 && is_gimple_call (stmt)
1689 && (fn = gimple_call_fndecl (stmt)) != NULL)
1691 struct cgraph_node *dest = cgraph_node (fn);
1693 /* We have missing edge in the callgraph. This can happen
1694 when previous inlining turned an indirect call into a
1695 direct call by constant propagating arguments or we are
1696 producing dead clone (for further clonning). In all
1697 other cases we hit a bug (incorrect node sharing is the
1698 most common reason for missing edges). */
1699 gcc_assert (dest->needed || !dest->analyzed
1700 || !id->src_node->analyzed);
1701 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1702 cgraph_create_edge_including_clones
1703 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1704 compute_call_stmt_bb_frequency (id->dst_node->decl,
1706 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1708 cgraph_create_edge (id->dst_node, dest, stmt,
1710 compute_call_stmt_bb_frequency
1711 (id->dst_node->decl, copy_basic_block),
1712 bb->loop_depth)->inline_failed
1713 = CIF_ORIGINALLY_INDIRECT_CALL;
1716 fprintf (dump_file, "Created new direct edge to %s",
1717 cgraph_node_name (dest));
1721 flags = gimple_call_flags (stmt);
1722 if (flags & ECF_MAY_BE_ALLOCA)
1723 cfun->calls_alloca = true;
1724 if (flags & ECF_RETURNS_TWICE)
1725 cfun->calls_setjmp = true;
1728 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1729 id->eh_map, id->eh_lp_nr);
1731 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1736 find_new_referenced_vars (gsi_stmt (copy_gsi));
1737 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1738 if (TREE_CODE (def) == SSA_NAME)
1739 SSA_NAME_DEF_STMT (def) = stmt;
1742 gsi_next (©_gsi);
1744 while (!gsi_end_p (copy_gsi));
1746 copy_gsi = gsi_last_bb (copy_basic_block);
1749 return copy_basic_block;
1752 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1753 form is quite easy, since dominator relationship for old basic blocks does
1756 There is however exception where inlining might change dominator relation
1757 across EH edges from basic block within inlined functions destinating
1758 to landing pads in function we inline into.
1760 The function fills in PHI_RESULTs of such PHI nodes if they refer
1761 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1762 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1763 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1764 set, and this means that there will be no overlapping live ranges
1765 for the underlying symbol.
1767 This might change in future if we allow redirecting of EH edges and
1768 we might want to change way build CFG pre-inlining to include
1769 all the possible edges then. */
1771 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1772 bool can_throw, bool nonlocal_goto)
1777 FOR_EACH_EDGE (e, ei, bb->succs)
1779 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1782 gimple_stmt_iterator si;
1785 gcc_assert (e->flags & EDGE_EH);
1788 gcc_assert (!(e->flags & EDGE_EH));
1790 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1794 phi = gsi_stmt (si);
1796 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1797 gcc_assert (!e->dest->aux);
1799 gcc_assert ((e->flags & EDGE_EH)
1800 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1802 if (!is_gimple_reg (PHI_RESULT (phi)))
1804 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1808 re = find_edge (ret_bb, e->dest);
1810 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1811 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1813 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1814 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1820 /* Copy edges from BB into its copy constructed earlier, scale profile
1821 accordingly. Edges will be taken care of later. Assume aux
1822 pointers to point to the copies of each BB. */
1825 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1827 basic_block new_bb = (basic_block) bb->aux;
1830 gimple_stmt_iterator si;
1833 /* Use the indices from the original blocks to create edges for the
1835 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1836 if (!(old_edge->flags & EDGE_EH))
1840 flags = old_edge->flags;
1842 /* Return edges do get a FALLTHRU flag when the get inlined. */
1843 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1844 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1845 flags |= EDGE_FALLTHRU;
1846 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1847 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1848 new_edge->probability = old_edge->probability;
1851 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1854 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1857 bool can_throw, nonlocal_goto;
1859 copy_stmt = gsi_stmt (si);
1860 if (!is_gimple_debug (copy_stmt))
1862 update_stmt (copy_stmt);
1863 if (gimple_in_ssa_p (cfun))
1864 mark_symbols_for_renaming (copy_stmt);
1867 /* Do this before the possible split_block. */
1870 /* If this tree could throw an exception, there are two
1871 cases where we need to add abnormal edge(s): the
1872 tree wasn't in a region and there is a "current
1873 region" in the caller; or the original tree had
1874 EH edges. In both cases split the block after the tree,
1875 and add abnormal edge(s) as needed; we need both
1876 those from the callee and the caller.
1877 We check whether the copy can throw, because the const
1878 propagation can change an INDIRECT_REF which throws
1879 into a COMPONENT_REF which doesn't. If the copy
1880 can throw, the original could also throw. */
1881 can_throw = stmt_can_throw_internal (copy_stmt);
1882 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1884 if (can_throw || nonlocal_goto)
1886 if (!gsi_end_p (si))
1887 /* Note that bb's predecessor edges aren't necessarily
1888 right at this point; split_block doesn't care. */
1890 edge e = split_block (new_bb, copy_stmt);
1893 new_bb->aux = e->src->aux;
1894 si = gsi_start_bb (new_bb);
1898 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1899 make_eh_dispatch_edges (copy_stmt);
1901 make_eh_edges (copy_stmt);
1904 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1906 if ((can_throw || nonlocal_goto)
1907 && gimple_in_ssa_p (cfun))
1908 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1909 can_throw, nonlocal_goto);
1913 /* Copy the PHIs. All blocks and edges are copied, some blocks
1914 was possibly split and new outgoing EH edges inserted.
1915 BB points to the block of original function and AUX pointers links
1916 the original and newly copied blocks. */
1919 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1921 basic_block const new_bb = (basic_block) bb->aux;
1924 gimple_stmt_iterator si;
1926 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1932 phi = gsi_stmt (si);
1933 res = PHI_RESULT (phi);
1935 if (is_gimple_reg (res))
1937 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1938 SSA_NAME_DEF_STMT (new_res)
1939 = new_phi = create_phi_node (new_res, new_bb);
1940 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1943 = find_edge ((basic_block) new_edge->src->aux, bb);
1944 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1946 tree block = id->block;
1947 id->block = NULL_TREE;
1948 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1950 gcc_assert (new_arg);
1951 /* With return slot optimization we can end up with
1952 non-gimple (foo *)&this->m, fix that here. */
1953 if (TREE_CODE (new_arg) != SSA_NAME
1954 && TREE_CODE (new_arg) != FUNCTION_DECL
1955 && !is_gimple_val (new_arg))
1957 gimple_seq stmts = NULL;
1958 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1959 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1961 add_phi_arg (new_phi, new_arg, new_edge,
1962 gimple_phi_arg_location_from_edge (phi, old_edge));
1969 /* Wrapper for remap_decl so it can be used as a callback. */
1972 remap_decl_1 (tree decl, void *data)
1974 return remap_decl (decl, (copy_body_data *) data);
1977 /* Build struct function and associated datastructures for the new clone
1978 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1981 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
1983 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1984 gcov_type count_scale;
1986 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1987 count_scale = (REG_BR_PROB_BASE * count
1988 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1990 count_scale = REG_BR_PROB_BASE;
1992 /* Register specific tree functions. */
1993 gimple_register_cfg_hooks ();
1995 /* Get clean struct function. */
1996 push_struct_function (new_fndecl);
1998 /* We will rebuild these, so just sanity check that they are empty. */
1999 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2000 gcc_assert (cfun->local_decls == NULL);
2001 gcc_assert (cfun->cfg == NULL);
2002 gcc_assert (cfun->decl == new_fndecl);
2004 /* Copy items we preserve during clonning. */
2005 cfun->static_chain_decl = src_cfun->static_chain_decl;
2006 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2007 cfun->function_end_locus = src_cfun->function_end_locus;
2008 cfun->curr_properties = src_cfun->curr_properties;
2009 cfun->last_verified = src_cfun->last_verified;
2010 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2011 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2012 cfun->function_frequency = src_cfun->function_frequency;
2013 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2014 cfun->stdarg = src_cfun->stdarg;
2015 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
2016 cfun->after_inlining = src_cfun->after_inlining;
2017 cfun->returns_struct = src_cfun->returns_struct;
2018 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2019 cfun->after_tree_profile = src_cfun->after_tree_profile;
2021 init_empty_tree_cfg ();
2023 profile_status_for_function (cfun) = profile_status_for_function (src_cfun);
2024 ENTRY_BLOCK_PTR->count =
2025 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2027 ENTRY_BLOCK_PTR->frequency
2028 = ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2029 EXIT_BLOCK_PTR->count =
2030 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
2032 EXIT_BLOCK_PTR->frequency =
2033 EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency;
2035 init_eh_for_function ();
2037 if (src_cfun->gimple_df)
2039 init_tree_ssa (cfun);
2040 cfun->gimple_df->in_ssa_p = true;
2041 init_ssa_operands ();
2046 /* Make a copy of the body of FN so that it can be inserted inline in
2047 another function. Walks FN via CFG, returns new fndecl. */
2050 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency_scale,
2051 basic_block entry_block_map, basic_block exit_block_map)
2053 tree callee_fndecl = id->src_fn;
2054 /* Original cfun for the callee, doesn't change. */
2055 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2056 struct function *cfun_to_copy;
2058 tree new_fndecl = NULL;
2059 gcov_type count_scale;
2062 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
2063 count_scale = (REG_BR_PROB_BASE * count
2064 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
2066 count_scale = REG_BR_PROB_BASE;
2068 /* Register specific tree functions. */
2069 gimple_register_cfg_hooks ();
2071 /* Must have a CFG here at this point. */
2072 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
2073 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2075 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2077 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
2078 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
2079 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2080 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
2082 /* Duplicate any exception-handling regions. */
2084 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2087 /* Use aux pointers to map the original blocks to copy. */
2088 FOR_EACH_BB_FN (bb, cfun_to_copy)
2090 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
2095 last = last_basic_block;
2097 /* Now that we've duplicated the blocks, duplicate their edges. */
2098 FOR_ALL_BB_FN (bb, cfun_to_copy)
2099 copy_edges_for_bb (bb, count_scale, exit_block_map);
2101 if (gimple_in_ssa_p (cfun))
2102 FOR_ALL_BB_FN (bb, cfun_to_copy)
2103 copy_phis_for_bb (bb, id);
2105 FOR_ALL_BB_FN (bb, cfun_to_copy)
2107 ((basic_block)bb->aux)->aux = NULL;
2111 /* Zero out AUX fields of newly created block during EH edge
2113 for (; last < last_basic_block; last++)
2114 BASIC_BLOCK (last)->aux = NULL;
2115 entry_block_map->aux = NULL;
2116 exit_block_map->aux = NULL;
2120 pointer_map_destroy (id->eh_map);
2127 /* Copy the debug STMT using ID. We deal with these statements in a
2128 special way: if any variable in their VALUE expression wasn't
2129 remapped yet, we won't remap it, because that would get decl uids
2130 out of sync, causing codegen differences between -g and -g0. If
2131 this arises, we drop the VALUE expression altogether. */
2134 copy_debug_stmt (gimple stmt, copy_body_data *id)
2137 struct walk_stmt_info wi;
2140 if (gimple_block (stmt))
2143 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (stmt));
2147 gimple_set_block (stmt, t);
2149 /* Remap all the operands in COPY. */
2150 memset (&wi, 0, sizeof (wi));
2153 processing_debug_stmt = 1;
2155 t = gimple_debug_bind_get_var (stmt);
2157 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2158 && (n = (tree *) pointer_map_contains (id->debug_map, t)))
2160 gcc_assert (TREE_CODE (*n) == VAR_DECL);
2163 else if (TREE_CODE (t) == VAR_DECL
2165 && gimple_in_ssa_p (cfun)
2166 && !pointer_map_contains (id->decl_map, t)
2168 /* T is a non-localized variable. */;
2170 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2172 gimple_debug_bind_set_var (stmt, t);
2174 if (gimple_debug_bind_has_value_p (stmt))
2175 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2176 remap_gimple_op_r, &wi, NULL);
2178 /* Punt if any decl couldn't be remapped. */
2179 if (processing_debug_stmt < 0)
2180 gimple_debug_bind_reset_value (stmt);
2182 processing_debug_stmt = 0;
2185 if (gimple_in_ssa_p (cfun))
2186 mark_symbols_for_renaming (stmt);
2189 /* Process deferred debug stmts. In order to give values better odds
2190 of being successfully remapped, we delay the processing of debug
2191 stmts until all other stmts that might require remapping are
2195 copy_debug_stmts (copy_body_data *id)
2200 if (!id->debug_stmts)
2203 for (i = 0; VEC_iterate (gimple, id->debug_stmts, i, stmt); i++)
2204 copy_debug_stmt (stmt, id);
2206 VEC_free (gimple, heap, id->debug_stmts);
2209 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2210 another function. */
2213 copy_tree_body (copy_body_data *id)
2215 tree fndecl = id->src_fn;
2216 tree body = DECL_SAVED_TREE (fndecl);
2218 walk_tree (&body, copy_tree_body_r, id, NULL);
2223 /* Make a copy of the body of FN so that it can be inserted inline in
2224 another function. */
2227 copy_body (copy_body_data *id, gcov_type count, int frequency_scale,
2228 basic_block entry_block_map, basic_block exit_block_map)
2230 tree fndecl = id->src_fn;
2233 /* If this body has a CFG, walk CFG and copy. */
2234 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2235 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map);
2236 copy_debug_stmts (id);
2241 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2242 defined in function FN, or of a data member thereof. */
2245 self_inlining_addr_expr (tree value, tree fn)
2249 if (TREE_CODE (value) != ADDR_EXPR)
2252 var = get_base_address (TREE_OPERAND (value, 0));
2254 return var && auto_var_in_fn_p (var, fn);
2257 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
2258 lexical block and line number information from base_stmt, if given,
2259 or from the last stmt of the block otherwise. */
2262 insert_init_debug_bind (copy_body_data *id,
2263 basic_block bb, tree var, tree value,
2267 gimple_stmt_iterator gsi;
2270 if (!gimple_in_ssa_p (id->src_cfun))
2273 if (!MAY_HAVE_DEBUG_STMTS)
2276 tracked_var = target_for_debug_bind (var);
2282 gsi = gsi_last_bb (bb);
2283 if (!base_stmt && !gsi_end_p (gsi))
2284 base_stmt = gsi_stmt (gsi);
2287 note = gimple_build_debug_bind (tracked_var, value, base_stmt);
2291 if (!gsi_end_p (gsi))
2292 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
2294 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
2301 insert_init_stmt (copy_body_data *id, basic_block bb, gimple init_stmt)
2303 /* If VAR represents a zero-sized variable, it's possible that the
2304 assignment statement may result in no gimple statements. */
2307 gimple_stmt_iterator si = gsi_last_bb (bb);
2309 /* We can end up with init statements that store to a non-register
2310 from a rhs with a conversion. Handle that here by forcing the
2311 rhs into a temporary. gimple_regimplify_operands is not
2312 prepared to do this for us. */
2313 if (!is_gimple_debug (init_stmt)
2314 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
2315 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2316 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2318 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2319 gimple_expr_type (init_stmt),
2320 gimple_assign_rhs1 (init_stmt));
2321 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2323 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2324 gimple_assign_set_rhs1 (init_stmt, rhs);
2326 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2327 gimple_regimplify_operands (init_stmt, &si);
2328 mark_symbols_for_renaming (init_stmt);
2330 if (!is_gimple_debug (init_stmt) && MAY_HAVE_DEBUG_STMTS)
2332 tree var, def = gimple_assign_lhs (init_stmt);
2334 if (TREE_CODE (def) == SSA_NAME)
2335 var = SSA_NAME_VAR (def);
2339 insert_init_debug_bind (id, bb, var, def, init_stmt);
2344 /* Initialize parameter P with VALUE. If needed, produce init statement
2345 at the end of BB. When BB is NULL, we return init statement to be
2348 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2349 basic_block bb, tree *vars)
2351 gimple init_stmt = NULL;
2354 tree def = (gimple_in_ssa_p (cfun)
2355 ? gimple_default_def (id->src_cfun, p) : NULL);
2358 && value != error_mark_node
2359 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2361 if (fold_convertible_p (TREE_TYPE (p), value))
2362 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2364 /* ??? For valid (GIMPLE) programs we should not end up here.
2365 Still if something has gone wrong and we end up with truly
2366 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2367 to not leak invalid GIMPLE to the following passes. */
2368 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2371 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2372 here since the type of this decl must be visible to the calling
2374 var = copy_decl_to_var (p, id);
2376 /* We're actually using the newly-created var. */
2377 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2380 add_referenced_var (var);
2383 /* Declare this new variable. */
2384 TREE_CHAIN (var) = *vars;
2387 /* Make gimplifier happy about this variable. */
2388 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2390 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2391 we would not need to create a new variable here at all, if it
2392 weren't for debug info. Still, we can just use the argument
2394 if (TREE_READONLY (p)
2395 && !TREE_ADDRESSABLE (p)
2396 && value && !TREE_SIDE_EFFECTS (value)
2399 /* We may produce non-gimple trees by adding NOPs or introduce
2400 invalid sharing when operand is not really constant.
2401 It is not big deal to prohibit constant propagation here as
2402 we will constant propagate in DOM1 pass anyway. */
2403 if (is_gimple_min_invariant (value)
2404 && useless_type_conversion_p (TREE_TYPE (p),
2406 /* We have to be very careful about ADDR_EXPR. Make sure
2407 the base variable isn't a local variable of the inlined
2408 function, e.g., when doing recursive inlining, direct or
2409 mutually-recursive or whatever, which is why we don't
2410 just test whether fn == current_function_decl. */
2411 && ! self_inlining_addr_expr (value, fn))
2413 insert_decl_map (id, p, value);
2414 insert_debug_decl_map (id, p, var);
2415 return insert_init_debug_bind (id, bb, var, value, NULL);
2419 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2420 that way, when the PARM_DECL is encountered, it will be
2421 automatically replaced by the VAR_DECL. */
2422 insert_decl_map (id, p, var);
2424 /* Even if P was TREE_READONLY, the new VAR should not be.
2425 In the original code, we would have constructed a
2426 temporary, and then the function body would have never
2427 changed the value of P. However, now, we will be
2428 constructing VAR directly. The constructor body may
2429 change its value multiple times as it is being
2430 constructed. Therefore, it must not be TREE_READONLY;
2431 the back-end assumes that TREE_READONLY variable is
2432 assigned to only once. */
2433 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2434 TREE_READONLY (var) = 0;
2436 /* If there is no setup required and we are in SSA, take the easy route
2437 replacing all SSA names representing the function parameter by the
2438 SSA name passed to function.
2440 We need to construct map for the variable anyway as it might be used
2441 in different SSA names when parameter is set in function.
2443 Do replacement at -O0 for const arguments replaced by constant.
2444 This is important for builtin_constant_p and other construct requiring
2445 constant argument to be visible in inlined function body. */
2446 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2448 || (TREE_READONLY (p)
2449 && is_gimple_min_invariant (rhs)))
2450 && (TREE_CODE (rhs) == SSA_NAME
2451 || is_gimple_min_invariant (rhs))
2452 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2454 insert_decl_map (id, def, rhs);
2455 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2458 /* If the value of argument is never used, don't care about initializing
2460 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2462 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2463 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2466 /* Initialize this VAR_DECL from the equivalent argument. Convert
2467 the argument to the proper type in case it was promoted. */
2470 if (rhs == error_mark_node)
2472 insert_decl_map (id, p, var);
2473 return insert_init_debug_bind (id, bb, var, rhs, NULL);
2476 STRIP_USELESS_TYPE_CONVERSION (rhs);
2478 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2479 keep our trees in gimple form. */
2480 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2482 def = remap_ssa_name (def, id);
2483 init_stmt = gimple_build_assign (def, rhs);
2484 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2485 set_default_def (var, NULL);
2488 init_stmt = gimple_build_assign (var, rhs);
2490 if (bb && init_stmt)
2491 insert_init_stmt (id, bb, init_stmt);
2496 /* Generate code to initialize the parameters of the function at the
2497 top of the stack in ID from the GIMPLE_CALL STMT. */
2500 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2501 tree fn, basic_block bb)
2506 tree vars = NULL_TREE;
2507 tree static_chain = gimple_call_chain (stmt);
2509 /* Figure out what the parameters are. */
2510 parms = DECL_ARGUMENTS (fn);
2512 /* Loop through the parameter declarations, replacing each with an
2513 equivalent VAR_DECL, appropriately initialized. */
2514 for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2517 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2518 setup_one_parameter (id, p, val, fn, bb, &vars);
2521 /* Initialize the static chain. */
2522 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2523 gcc_assert (fn != current_function_decl);
2526 /* No static chain? Seems like a bug in tree-nested.c. */
2527 gcc_assert (static_chain);
2529 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2532 declare_inline_vars (id->block, vars);
2536 /* Declare a return variable to replace the RESULT_DECL for the
2537 function we are calling. An appropriate DECL_STMT is returned.
2538 The USE_STMT is filled to contain a use of the declaration to
2539 indicate the return value of the function.
2541 RETURN_SLOT, if non-null is place where to store the result. It
2542 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2543 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2545 The return value is a (possibly null) value that holds the result
2546 as seen by the caller. */
2549 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest)
2551 tree callee = id->src_fn;
2552 tree caller = id->dst_fn;
2553 tree result = DECL_RESULT (callee);
2554 tree callee_type = TREE_TYPE (result);
2555 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
2558 /* We don't need to do anything for functions that don't return
2560 if (!result || VOID_TYPE_P (callee_type))
2563 /* If there was a return slot, then the return value is the
2564 dereferenced address of that object. */
2567 /* The front end shouldn't have used both return_slot and
2568 a modify expression. */
2569 gcc_assert (!modify_dest);
2570 if (DECL_BY_REFERENCE (result))
2572 tree return_slot_addr = build_fold_addr_expr (return_slot);
2573 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2575 /* We are going to construct *&return_slot and we can't do that
2576 for variables believed to be not addressable.
2578 FIXME: This check possibly can match, because values returned
2579 via return slot optimization are not believed to have address
2580 taken by alias analysis. */
2581 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2582 if (gimple_in_ssa_p (cfun))
2584 HOST_WIDE_INT bitsize;
2585 HOST_WIDE_INT bitpos;
2587 enum machine_mode mode;
2591 base = get_inner_reference (return_slot, &bitsize, &bitpos,
2593 &mode, &unsignedp, &volatilep,
2595 if (TREE_CODE (base) == INDIRECT_REF)
2596 base = TREE_OPERAND (base, 0);
2597 if (TREE_CODE (base) == SSA_NAME)
2598 base = SSA_NAME_VAR (base);
2599 mark_sym_for_renaming (base);
2601 var = return_slot_addr;
2606 gcc_assert (TREE_CODE (var) != SSA_NAME);
2607 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2609 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2610 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2611 && !DECL_GIMPLE_REG_P (result)
2613 DECL_GIMPLE_REG_P (var) = 0;
2618 /* All types requiring non-trivial constructors should have been handled. */
2619 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2621 /* Attempt to avoid creating a new temporary variable. */
2623 && TREE_CODE (modify_dest) != SSA_NAME)
2625 bool use_it = false;
2627 /* We can't use MODIFY_DEST if there's type promotion involved. */
2628 if (!useless_type_conversion_p (callee_type, caller_type))
2631 /* ??? If we're assigning to a variable sized type, then we must
2632 reuse the destination variable, because we've no good way to
2633 create variable sized temporaries at this point. */
2634 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2637 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2638 reuse it as the result of the call directly. Don't do this if
2639 it would promote MODIFY_DEST to addressable. */
2640 else if (TREE_ADDRESSABLE (result))
2644 tree base_m = get_base_address (modify_dest);
2646 /* If the base isn't a decl, then it's a pointer, and we don't
2647 know where that's going to go. */
2648 if (!DECL_P (base_m))
2650 else if (is_global_var (base_m))
2652 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2653 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2654 && !DECL_GIMPLE_REG_P (result)
2655 && DECL_GIMPLE_REG_P (base_m))
2657 else if (!TREE_ADDRESSABLE (base_m))
2669 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2671 var = copy_result_decl_to_var (result, id);
2672 if (gimple_in_ssa_p (cfun))
2675 add_referenced_var (var);
2678 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2679 DECL_STRUCT_FUNCTION (caller)->local_decls
2680 = tree_cons (NULL_TREE, var,
2681 DECL_STRUCT_FUNCTION (caller)->local_decls);
2683 /* Do not have the rest of GCC warn about this variable as it should
2684 not be visible to the user. */
2685 TREE_NO_WARNING (var) = 1;
2687 declare_inline_vars (id->block, var);
2689 /* Build the use expr. If the return type of the function was
2690 promoted, convert it back to the expected type. */
2692 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2693 use = fold_convert (caller_type, var);
2695 STRIP_USELESS_TYPE_CONVERSION (use);
2697 if (DECL_BY_REFERENCE (result))
2699 TREE_ADDRESSABLE (var) = 1;
2700 var = build_fold_addr_expr (var);
2704 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2705 way, when the RESULT_DECL is encountered, it will be
2706 automatically replaced by the VAR_DECL. */
2707 insert_decl_map (id, result, var);
2709 /* Remember this so we can ignore it in remap_decls. */
2715 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2716 to a local label. */
2719 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2722 tree fn = (tree) fnp;
2724 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2733 /* Determine if the function can be copied. If so return NULL. If
2734 not return a string describng the reason for failure. */
2737 copy_forbidden (struct function *fun, tree fndecl)
2739 const char *reason = fun->cannot_be_copied_reason;
2742 /* Only examine the function once. */
2743 if (fun->cannot_be_copied_set)
2746 /* We cannot copy a function that receives a non-local goto
2747 because we cannot remap the destination label used in the
2748 function that is performing the non-local goto. */
2749 /* ??? Actually, this should be possible, if we work at it.
2750 No doubt there's just a handful of places that simply
2751 assume it doesn't happen and don't substitute properly. */
2752 if (fun->has_nonlocal_label)
2754 reason = G_("function %q+F can never be copied "
2755 "because it receives a non-local goto");
2759 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2761 tree decl = TREE_VALUE (step);
2763 if (TREE_CODE (decl) == VAR_DECL
2764 && TREE_STATIC (decl)
2765 && !DECL_EXTERNAL (decl)
2766 && DECL_INITIAL (decl)
2767 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2768 has_label_address_in_static_1,
2771 reason = G_("function %q+F can never be copied because it saves "
2772 "address of local label in a static variable");
2778 fun->cannot_be_copied_reason = reason;
2779 fun->cannot_be_copied_set = true;
2784 static const char *inline_forbidden_reason;
2786 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2787 iff a function can not be inlined. Also sets the reason why. */
2790 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2791 struct walk_stmt_info *wip)
2793 tree fn = (tree) wip->info;
2795 gimple stmt = gsi_stmt (*gsi);
2797 switch (gimple_code (stmt))
2800 /* Refuse to inline alloca call unless user explicitly forced so as
2801 this may change program's memory overhead drastically when the
2802 function using alloca is called in loop. In GCC present in
2803 SPEC2000 inlining into schedule_block cause it to require 2GB of
2804 RAM instead of 256MB. */
2805 if (gimple_alloca_call_p (stmt)
2806 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2808 inline_forbidden_reason
2809 = G_("function %q+F can never be inlined because it uses "
2810 "alloca (override using the always_inline attribute)");
2811 *handled_ops_p = true;
2815 t = gimple_call_fndecl (stmt);
2819 /* We cannot inline functions that call setjmp. */
2820 if (setjmp_call_p (t))
2822 inline_forbidden_reason
2823 = G_("function %q+F can never be inlined because it uses setjmp");
2824 *handled_ops_p = true;
2828 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2829 switch (DECL_FUNCTION_CODE (t))
2831 /* We cannot inline functions that take a variable number of
2833 case BUILT_IN_VA_START:
2834 case BUILT_IN_NEXT_ARG:
2835 case BUILT_IN_VA_END:
2836 inline_forbidden_reason
2837 = G_("function %q+F can never be inlined because it "
2838 "uses variable argument lists");
2839 *handled_ops_p = true;
2842 case BUILT_IN_LONGJMP:
2843 /* We can't inline functions that call __builtin_longjmp at
2844 all. The non-local goto machinery really requires the
2845 destination be in a different function. If we allow the
2846 function calling __builtin_longjmp to be inlined into the
2847 function calling __builtin_setjmp, Things will Go Awry. */
2848 inline_forbidden_reason
2849 = G_("function %q+F can never be inlined because "
2850 "it uses setjmp-longjmp exception handling");
2851 *handled_ops_p = true;
2854 case BUILT_IN_NONLOCAL_GOTO:
2856 inline_forbidden_reason
2857 = G_("function %q+F can never be inlined because "
2858 "it uses non-local goto");
2859 *handled_ops_p = true;
2862 case BUILT_IN_RETURN:
2863 case BUILT_IN_APPLY_ARGS:
2864 /* If a __builtin_apply_args caller would be inlined,
2865 it would be saving arguments of the function it has
2866 been inlined into. Similarly __builtin_return would
2867 return from the function the inline has been inlined into. */
2868 inline_forbidden_reason
2869 = G_("function %q+F can never be inlined because "
2870 "it uses __builtin_return or __builtin_apply_args");
2871 *handled_ops_p = true;
2880 t = gimple_goto_dest (stmt);
2882 /* We will not inline a function which uses computed goto. The
2883 addresses of its local labels, which may be tucked into
2884 global storage, are of course not constant across
2885 instantiations, which causes unexpected behavior. */
2886 if (TREE_CODE (t) != LABEL_DECL)
2888 inline_forbidden_reason
2889 = G_("function %q+F can never be inlined "
2890 "because it contains a computed goto");
2891 *handled_ops_p = true;
2900 *handled_ops_p = false;
2904 /* Return true if FNDECL is a function that cannot be inlined into
2908 inline_forbidden_p (tree fndecl)
2910 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2911 struct walk_stmt_info wi;
2912 struct pointer_set_t *visited_nodes;
2914 bool forbidden_p = false;
2916 /* First check for shared reasons not to copy the code. */
2917 inline_forbidden_reason = copy_forbidden (fun, fndecl);
2918 if (inline_forbidden_reason != NULL)
2921 /* Next, walk the statements of the function looking for
2922 constraucts we can't handle, or are non-optimal for inlining. */
2923 visited_nodes = pointer_set_create ();
2924 memset (&wi, 0, sizeof (wi));
2925 wi.info = (void *) fndecl;
2926 wi.pset = visited_nodes;
2928 FOR_EACH_BB_FN (bb, fun)
2931 gimple_seq seq = bb_seq (bb);
2932 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
2933 forbidden_p = (ret != NULL);
2938 pointer_set_destroy (visited_nodes);
2942 /* Returns nonzero if FN is a function that does not have any
2943 fundamental inline blocking properties. */
2946 tree_inlinable_function_p (tree fn)
2948 bool inlinable = true;
2952 /* If we've already decided this function shouldn't be inlined,
2953 there's no need to check again. */
2954 if (DECL_UNINLINABLE (fn))
2957 /* We only warn for functions declared `inline' by the user. */
2958 do_warning = (warn_inline
2959 && DECL_DECLARED_INLINE_P (fn)
2960 && !DECL_NO_INLINE_WARNING_P (fn)
2961 && !DECL_IN_SYSTEM_HEADER (fn));
2963 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2966 && always_inline == NULL)
2969 warning (OPT_Winline, "function %q+F can never be inlined because it "
2970 "is suppressed using -fno-inline", fn);
2974 /* Don't auto-inline anything that might not be bound within
2975 this unit of translation. */
2976 else if (!DECL_DECLARED_INLINE_P (fn)
2977 && DECL_REPLACEABLE_P (fn))
2980 else if (!function_attribute_inlinable_p (fn))
2983 warning (OPT_Winline, "function %q+F can never be inlined because it "
2984 "uses attributes conflicting with inlining", fn);
2988 else if (inline_forbidden_p (fn))
2990 /* See if we should warn about uninlinable functions. Previously,
2991 some of these warnings would be issued while trying to expand
2992 the function inline, but that would cause multiple warnings
2993 about functions that would for example call alloca. But since
2994 this a property of the function, just one warning is enough.
2995 As a bonus we can now give more details about the reason why a
2996 function is not inlinable. */
2998 sorry (inline_forbidden_reason, fn);
2999 else if (do_warning)
3000 warning (OPT_Winline, inline_forbidden_reason, fn);
3005 /* Squirrel away the result so that we don't have to check again. */
3006 DECL_UNINLINABLE (fn) = !inlinable;
3011 /* Estimate the cost of a memory move. Use machine dependent
3012 word size and take possible memcpy call into account. */
3015 estimate_move_cost (tree type)
3019 gcc_assert (!VOID_TYPE_P (type));
3021 size = int_size_in_bytes (type);
3023 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3024 /* Cost of a memcpy call, 3 arguments and the call. */
3027 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3030 /* Returns cost of operation CODE, according to WEIGHTS */
3033 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3034 tree op1 ATTRIBUTE_UNUSED, tree op2)
3038 /* These are "free" conversions, or their presumed cost
3039 is folded into other operations. */
3046 /* Assign cost of 1 to usual operations.
3047 ??? We may consider mapping RTL costs to this. */
3052 case POINTER_PLUS_EXPR:
3056 case ADDR_SPACE_CONVERT_EXPR:
3057 case FIXED_CONVERT_EXPR:
3058 case FIX_TRUNC_EXPR:
3070 case VEC_LSHIFT_EXPR:
3071 case VEC_RSHIFT_EXPR:
3078 case TRUTH_ANDIF_EXPR:
3079 case TRUTH_ORIF_EXPR:
3080 case TRUTH_AND_EXPR:
3082 case TRUTH_XOR_EXPR:
3083 case TRUTH_NOT_EXPR:
3092 case UNORDERED_EXPR:
3103 case PREDECREMENT_EXPR:
3104 case PREINCREMENT_EXPR:
3105 case POSTDECREMENT_EXPR:
3106 case POSTINCREMENT_EXPR:
3108 case REALIGN_LOAD_EXPR:
3110 case REDUC_MAX_EXPR:
3111 case REDUC_MIN_EXPR:
3112 case REDUC_PLUS_EXPR:
3113 case WIDEN_SUM_EXPR:
3114 case WIDEN_MULT_EXPR:
3117 case VEC_WIDEN_MULT_HI_EXPR:
3118 case VEC_WIDEN_MULT_LO_EXPR:
3119 case VEC_UNPACK_HI_EXPR:
3120 case VEC_UNPACK_LO_EXPR:
3121 case VEC_UNPACK_FLOAT_HI_EXPR:
3122 case VEC_UNPACK_FLOAT_LO_EXPR:
3123 case VEC_PACK_TRUNC_EXPR:
3124 case VEC_PACK_SAT_EXPR:
3125 case VEC_PACK_FIX_TRUNC_EXPR:
3126 case VEC_EXTRACT_EVEN_EXPR:
3127 case VEC_EXTRACT_ODD_EXPR:
3128 case VEC_INTERLEAVE_HIGH_EXPR:
3129 case VEC_INTERLEAVE_LOW_EXPR:
3133 /* Few special cases of expensive operations. This is useful
3134 to avoid inlining on functions having too many of these. */
3135 case TRUNC_DIV_EXPR:
3137 case FLOOR_DIV_EXPR:
3138 case ROUND_DIV_EXPR:
3139 case EXACT_DIV_EXPR:
3140 case TRUNC_MOD_EXPR:
3142 case FLOOR_MOD_EXPR:
3143 case ROUND_MOD_EXPR:
3145 if (TREE_CODE (op2) != INTEGER_CST)
3146 return weights->div_mod_cost;
3150 /* We expect a copy assignment with no operator. */
3151 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3157 /* Estimate number of instructions that will be created by expanding
3158 the statements in the statement sequence STMTS.
3159 WEIGHTS contains weights attributed to various constructs. */
3162 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3165 gimple_stmt_iterator gsi;
3168 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3169 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3175 /* Estimate number of instructions that will be created by expanding STMT.
3176 WEIGHTS contains weights attributed to various constructs. */
3179 estimate_num_insns (gimple stmt, eni_weights *weights)
3182 enum gimple_code code = gimple_code (stmt);
3189 /* Try to estimate the cost of assignments. We have three cases to
3191 1) Simple assignments to registers;
3192 2) Stores to things that must live in memory. This includes
3193 "normal" stores to scalars, but also assignments of large
3194 structures, or constructors of big arrays;
3196 Let us look at the first two cases, assuming we have "a = b + C":
3197 <GIMPLE_ASSIGN <var_decl "a">
3198 <plus_expr <var_decl "b"> <constant C>>
3199 If "a" is a GIMPLE register, the assignment to it is free on almost
3200 any target, because "a" usually ends up in a real register. Hence
3201 the only cost of this expression comes from the PLUS_EXPR, and we
3202 can ignore the GIMPLE_ASSIGN.
3203 If "a" is not a GIMPLE register, the assignment to "a" will most
3204 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3205 of moving something into "a", which we compute using the function
3206 estimate_move_cost. */
3207 lhs = gimple_assign_lhs (stmt);
3208 rhs = gimple_assign_rhs1 (stmt);
3210 if (is_gimple_reg (lhs))
3213 cost = estimate_move_cost (TREE_TYPE (lhs));
3215 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3216 cost += estimate_move_cost (TREE_TYPE (rhs));
3218 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3219 gimple_assign_rhs1 (stmt),
3220 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3221 == GIMPLE_BINARY_RHS
3222 ? gimple_assign_rhs2 (stmt) : NULL);
3226 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3227 gimple_op (stmt, 0),
3228 gimple_op (stmt, 1));
3232 /* Take into account cost of the switch + guess 2 conditional jumps for
3235 TODO: once the switch expansion logic is sufficiently separated, we can
3236 do better job on estimating cost of the switch. */
3237 if (weights->time_based)
3238 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3240 cost = gimple_switch_num_labels (stmt) * 2;
3245 tree decl = gimple_call_fndecl (stmt);
3246 tree addr = gimple_call_fn (stmt);
3247 tree funtype = TREE_TYPE (addr);
3249 if (POINTER_TYPE_P (funtype))
3250 funtype = TREE_TYPE (funtype);
3252 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3253 cost = weights->target_builtin_call_cost;
3255 cost = weights->call_cost;
3257 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3258 switch (DECL_FUNCTION_CODE (decl))
3260 case BUILT_IN_CONSTANT_P:
3262 case BUILT_IN_EXPECT:
3265 /* Prefetch instruction is not expensive. */
3266 case BUILT_IN_PREFETCH:
3267 cost = weights->target_builtin_call_cost;
3270 /* Exception state returns or moves registers around. */
3271 case BUILT_IN_EH_FILTER:
3272 case BUILT_IN_EH_POINTER:
3273 case BUILT_IN_EH_COPY_VALUES:
3281 funtype = TREE_TYPE (decl);
3283 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3284 cost += estimate_move_cost (TREE_TYPE (funtype));
3285 /* Our cost must be kept in sync with
3286 cgraph_estimate_size_after_inlining that does use function
3287 declaration to figure out the arguments. */
3288 if (decl && DECL_ARGUMENTS (decl))
3291 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3292 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3293 cost += estimate_move_cost (TREE_TYPE (arg));
3295 else if (funtype && prototype_p (funtype))
3298 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3300 if (!VOID_TYPE_P (TREE_VALUE (t)))
3301 cost += estimate_move_cost (TREE_VALUE (t));
3305 for (i = 0; i < gimple_call_num_args (stmt); i++)
3307 tree arg = gimple_call_arg (stmt, i);
3308 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3309 cost += estimate_move_cost (TREE_TYPE (arg));
3321 case GIMPLE_PREDICT:
3326 return asm_str_count (gimple_asm_string (stmt));
3329 /* This is either going to be an external function call with one
3330 argument, or two register copy statements plus a goto. */
3333 case GIMPLE_EH_DISPATCH:
3334 /* ??? This is going to turn into a switch statement. Ideally
3335 we'd have a look at the eh region and estimate the number of
3340 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3342 case GIMPLE_EH_FILTER:
3343 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3346 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3349 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3350 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3352 /* OpenMP directives are generally very expensive. */
3354 case GIMPLE_OMP_RETURN:
3355 case GIMPLE_OMP_SECTIONS_SWITCH:
3356 case GIMPLE_OMP_ATOMIC_STORE:
3357 case GIMPLE_OMP_CONTINUE:
3358 /* ...except these, which are cheap. */
3361 case GIMPLE_OMP_ATOMIC_LOAD:
3362 return weights->omp_cost;
3364 case GIMPLE_OMP_FOR:
3365 return (weights->omp_cost
3366 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3367 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3369 case GIMPLE_OMP_PARALLEL:
3370 case GIMPLE_OMP_TASK:
3371 case GIMPLE_OMP_CRITICAL:
3372 case GIMPLE_OMP_MASTER:
3373 case GIMPLE_OMP_ORDERED:
3374 case GIMPLE_OMP_SECTION:
3375 case GIMPLE_OMP_SECTIONS:
3376 case GIMPLE_OMP_SINGLE:
3377 return (weights->omp_cost
3378 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3387 /* Estimate number of instructions that will be created by expanding
3388 function FNDECL. WEIGHTS contains weights attributed to various
3392 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3394 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3395 gimple_stmt_iterator bsi;
3399 gcc_assert (my_function && my_function->cfg);
3400 FOR_EACH_BB_FN (bb, my_function)
3402 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3403 n += estimate_num_insns (gsi_stmt (bsi), weights);
3410 /* Initializes weights used by estimate_num_insns. */
3413 init_inline_once (void)
3415 eni_size_weights.call_cost = 1;
3416 eni_size_weights.target_builtin_call_cost = 1;
3417 eni_size_weights.div_mod_cost = 1;
3418 eni_size_weights.omp_cost = 40;
3419 eni_size_weights.time_based = false;
3421 /* Estimating time for call is difficult, since we have no idea what the
3422 called function does. In the current uses of eni_time_weights,
3423 underestimating the cost does less harm than overestimating it, so
3424 we choose a rather small value here. */
3425 eni_time_weights.call_cost = 10;
3426 eni_time_weights.target_builtin_call_cost = 10;
3427 eni_time_weights.div_mod_cost = 10;
3428 eni_time_weights.omp_cost = 40;
3429 eni_time_weights.time_based = true;
3432 /* Estimate the number of instructions in a gimple_seq. */
3435 count_insns_seq (gimple_seq seq, eni_weights *weights)
3437 gimple_stmt_iterator gsi;
3439 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3440 n += estimate_num_insns (gsi_stmt (gsi), weights);
3446 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3449 prepend_lexical_block (tree current_block, tree new_block)
3451 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3452 BLOCK_SUBBLOCKS (current_block) = new_block;
3453 BLOCK_SUPERCONTEXT (new_block) = current_block;
3456 /* Fetch callee declaration from the call graph edge going from NODE and
3457 associated with STMR call statement. Return NULL_TREE if not found. */
3459 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3461 struct cgraph_edge *cs;
3463 cs = cgraph_edge (node, stmt);
3465 return cs->callee->decl;
3470 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3473 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3477 struct pointer_map_t *st, *dst;
3480 location_t saved_location;
3481 struct cgraph_edge *cg_edge;
3482 cgraph_inline_failed_t reason;
3483 basic_block return_block;
3485 gimple_stmt_iterator gsi, stmt_gsi;
3486 bool successfully_inlined = FALSE;
3487 bool purge_dead_abnormal_edges;
3491 /* Set input_location here so we get the right instantiation context
3492 if we call instantiate_decl from inlinable_function_p. */
3493 saved_location = input_location;
3494 if (gimple_has_location (stmt))
3495 input_location = gimple_location (stmt);
3497 /* From here on, we're only interested in CALL_EXPRs. */
3498 if (gimple_code (stmt) != GIMPLE_CALL)
3501 /* First, see if we can figure out what function is being called.
3502 If we cannot, then there is no hope of inlining the function. */
3503 fn = gimple_call_fndecl (stmt);
3506 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3511 /* Turn forward declarations into real ones. */
3512 fn = cgraph_node (fn)->decl;
3514 /* If FN is a declaration of a function in a nested scope that was
3515 globally declared inline, we don't set its DECL_INITIAL.
3516 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3517 C++ front-end uses it for cdtors to refer to their internal
3518 declarations, that are not real functions. Fortunately those
3519 don't have trees to be saved, so we can tell by checking their
3521 if (!DECL_INITIAL (fn)
3522 && DECL_ABSTRACT_ORIGIN (fn)
3523 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3524 fn = DECL_ABSTRACT_ORIGIN (fn);
3526 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3527 Kill this check once this is fixed. */
3528 if (!id->dst_node->analyzed)
3531 cg_edge = cgraph_edge (id->dst_node, stmt);
3533 /* Don't inline functions with different EH personalities. */
3534 if (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3535 && DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)
3536 && (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3537 != DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)))
3540 /* Don't try to inline functions that are not well-suited to
3542 if (!cgraph_inline_p (cg_edge, &reason))
3544 /* If this call was originally indirect, we do not want to emit any
3545 inlining related warnings or sorry messages because there are no
3546 guarantees regarding those. */
3547 if (cg_edge->indirect_call)
3550 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3551 /* Avoid warnings during early inline pass. */
3552 && cgraph_global_info_ready)
3554 sorry ("inlining failed in call to %q+F: %s", fn,
3555 cgraph_inline_failed_string (reason));
3556 sorry ("called from here");
3558 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3559 && !DECL_IN_SYSTEM_HEADER (fn)
3560 && reason != CIF_UNSPECIFIED
3561 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3562 /* Avoid warnings during early inline pass. */
3563 && cgraph_global_info_ready)
3565 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3566 fn, cgraph_inline_failed_string (reason));
3567 warning (OPT_Winline, "called from here");
3571 fn = cg_edge->callee->decl;
3573 #ifdef ENABLE_CHECKING
3574 if (cg_edge->callee->decl != id->dst_node->decl)
3575 verify_cgraph_node (cg_edge->callee);
3578 /* We will be inlining this callee. */
3579 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3581 /* Update the callers EH personality. */
3582 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3583 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3584 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3586 /* Split the block holding the GIMPLE_CALL. */
3587 e = split_block (bb, stmt);
3589 return_block = e->dest;
3592 /* split_block splits after the statement; work around this by
3593 moving the call into the second block manually. Not pretty,
3594 but seems easier than doing the CFG manipulation by hand
3595 when the GIMPLE_CALL is in the last statement of BB. */
3596 stmt_gsi = gsi_last_bb (bb);
3597 gsi_remove (&stmt_gsi, false);
3599 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3600 been the source of abnormal edges. In this case, schedule
3601 the removal of dead abnormal edges. */
3602 gsi = gsi_start_bb (return_block);
3603 if (gsi_end_p (gsi))
3605 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3606 purge_dead_abnormal_edges = true;
3610 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3611 purge_dead_abnormal_edges = false;
3614 stmt_gsi = gsi_start_bb (return_block);
3616 /* Build a block containing code to initialize the arguments, the
3617 actual inline expansion of the body, and a label for the return
3618 statements within the function to jump to. The type of the
3619 statement expression is the return type of the function call. */
3620 id->block = make_node (BLOCK);
3621 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3622 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3623 prepend_lexical_block (gimple_block (stmt), id->block);
3625 /* Local declarations will be replaced by their equivalents in this
3628 id->decl_map = pointer_map_create ();
3629 dst = id->debug_map;
3630 id->debug_map = NULL;
3632 /* Record the function we are about to inline. */
3634 id->src_node = cg_edge->callee;
3635 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3636 id->gimple_call = stmt;
3638 gcc_assert (!id->src_cfun->after_inlining);
3641 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3643 gimple_stmt_iterator si = gsi_last_bb (bb);
3644 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3648 initialize_inlined_parameters (id, stmt, fn, bb);
3650 if (DECL_INITIAL (fn))
3651 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3653 /* Return statements in the function body will be replaced by jumps
3654 to the RET_LABEL. */
3655 gcc_assert (DECL_INITIAL (fn));
3656 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3658 /* Find the LHS to which the result of this call is assigned. */
3660 if (gimple_call_lhs (stmt))
3662 modify_dest = gimple_call_lhs (stmt);
3664 /* The function which we are inlining might not return a value,
3665 in which case we should issue a warning that the function
3666 does not return a value. In that case the optimizers will
3667 see that the variable to which the value is assigned was not
3668 initialized. We do not want to issue a warning about that
3669 uninitialized variable. */
3670 if (DECL_P (modify_dest))
3671 TREE_NO_WARNING (modify_dest) = 1;
3673 if (gimple_call_return_slot_opt_p (stmt))
3675 return_slot = modify_dest;
3682 /* If we are inlining a call to the C++ operator new, we don't want
3683 to use type based alias analysis on the return value. Otherwise
3684 we may get confused if the compiler sees that the inlined new
3685 function returns a pointer which was just deleted. See bug
3687 if (DECL_IS_OPERATOR_NEW (fn))
3693 /* Declare the return variable for the function. */
3694 use_retvar = declare_return_variable (id, return_slot, modify_dest);
3696 /* Add local vars in this inlined callee to caller. */
3697 t_step = id->src_cfun->local_decls;
3698 for (; t_step; t_step = TREE_CHAIN (t_step))
3700 var = TREE_VALUE (t_step);
3701 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3703 if (var_ann (var) && add_referenced_var (var))
3704 cfun->local_decls = tree_cons (NULL_TREE, var,
3707 else if (!can_be_nonlocal (var, id))
3708 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3712 if (dump_file && (dump_flags & TDF_DETAILS))
3714 fprintf (dump_file, "Inlining ");
3715 print_generic_expr (dump_file, id->src_fn, 0);
3716 fprintf (dump_file, " to ");
3717 print_generic_expr (dump_file, id->dst_fn, 0);
3718 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3721 /* This is it. Duplicate the callee body. Assume callee is
3722 pre-gimplified. Note that we must not alter the caller
3723 function in any way before this point, as this CALL_EXPR may be
3724 a self-referential call; if we're calling ourselves, we need to
3725 duplicate our body before altering anything. */
3726 copy_body (id, bb->count,
3727 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3730 /* Reset the escaped and callused solutions. */
3731 if (cfun->gimple_df)
3733 pt_solution_reset (&cfun->gimple_df->escaped);
3734 pt_solution_reset (&cfun->gimple_df->callused);
3740 pointer_map_destroy (id->debug_map);
3741 id->debug_map = dst;
3743 pointer_map_destroy (id->decl_map);
3746 /* Unlink the calls virtual operands before replacing it. */
3747 unlink_stmt_vdef (stmt);
3749 /* If the inlined function returns a result that we care about,
3750 substitute the GIMPLE_CALL with an assignment of the return
3751 variable to the LHS of the call. That is, if STMT was
3752 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3753 if (use_retvar && gimple_call_lhs (stmt))
3755 gimple old_stmt = stmt;
3756 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3757 gsi_replace (&stmt_gsi, stmt, false);
3758 if (gimple_in_ssa_p (cfun))
3759 mark_symbols_for_renaming (stmt);
3760 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3764 /* Handle the case of inlining a function with no return
3765 statement, which causes the return value to become undefined. */
3766 if (gimple_call_lhs (stmt)
3767 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3769 tree name = gimple_call_lhs (stmt);
3770 tree var = SSA_NAME_VAR (name);
3771 tree def = gimple_default_def (cfun, var);
3775 /* If the variable is used undefined, make this name
3776 undefined via a move. */
3777 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3778 gsi_replace (&stmt_gsi, stmt, true);
3782 /* Otherwise make this variable undefined. */
3783 gsi_remove (&stmt_gsi, true);
3784 set_default_def (var, name);
3785 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3789 gsi_remove (&stmt_gsi, true);
3792 if (purge_dead_abnormal_edges)
3793 gimple_purge_dead_abnormal_call_edges (return_block);
3795 /* If the value of the new expression is ignored, that's OK. We
3796 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3797 the equivalent inlined version either. */
3798 if (is_gimple_assign (stmt))
3800 gcc_assert (gimple_assign_single_p (stmt)
3801 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3802 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3805 /* Output the inlining info for this abstract function, since it has been
3806 inlined. If we don't do this now, we can lose the information about the
3807 variables in the function when the blocks get blown away as soon as we
3808 remove the cgraph node. */
3809 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3811 /* Update callgraph if needed. */
3812 cgraph_remove_node (cg_edge->callee);
3814 id->block = NULL_TREE;
3815 successfully_inlined = TRUE;
3818 input_location = saved_location;
3819 return successfully_inlined;
3822 /* Expand call statements reachable from STMT_P.
3823 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3824 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3825 unfortunately not use that function here because we need a pointer
3826 to the CALL_EXPR, not the tree itself. */
3829 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
3831 gimple_stmt_iterator gsi;
3833 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3835 gimple stmt = gsi_stmt (gsi);
3837 if (is_gimple_call (stmt)
3838 && expand_call_inline (bb, stmt, id))
3846 /* Walk all basic blocks created after FIRST and try to fold every statement
3847 in the STATEMENTS pointer set. */
3850 fold_marked_statements (int first, struct pointer_set_t *statements)
3852 for (; first < n_basic_blocks; first++)
3853 if (BASIC_BLOCK (first))
3855 gimple_stmt_iterator gsi;
3857 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
3860 if (pointer_set_contains (statements, gsi_stmt (gsi)))
3862 gimple old_stmt = gsi_stmt (gsi);
3863 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
3865 if (old_decl && DECL_BUILT_IN (old_decl))
3867 /* Folding builtins can create multiple instructions,
3868 we need to look at all of them. */
3869 gimple_stmt_iterator i2 = gsi;
3871 if (fold_stmt (&gsi))
3875 i2 = gsi_start_bb (BASIC_BLOCK (first));
3880 new_stmt = gsi_stmt (i2);
3881 update_stmt (new_stmt);
3882 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3885 if (new_stmt == gsi_stmt (gsi))
3887 /* It is okay to check only for the very last
3888 of these statements. If it is a throwing
3889 statement nothing will change. If it isn't
3890 this can remove EH edges. If that weren't
3891 correct then because some intermediate stmts
3892 throw, but not the last one. That would mean
3893 we'd have to split the block, which we can't
3894 here and we'd loose anyway. And as builtins
3895 probably never throw, this all
3897 if (maybe_clean_or_replace_eh_stmt (old_stmt,
3899 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3906 else if (fold_stmt (&gsi))
3908 /* Re-read the statement from GSI as fold_stmt() may
3910 gimple new_stmt = gsi_stmt (gsi);
3911 update_stmt (new_stmt);
3913 if (is_gimple_call (old_stmt)
3914 || is_gimple_call (new_stmt))
3915 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3918 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
3919 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3925 /* Return true if BB has at least one abnormal outgoing edge. */
3928 has_abnormal_outgoing_edge_p (basic_block bb)
3933 FOR_EACH_EDGE (e, ei, bb->succs)
3934 if (e->flags & EDGE_ABNORMAL)
3940 /* Expand calls to inline functions in the body of FN. */
3943 optimize_inline_calls (tree fn)
3947 int last = n_basic_blocks;
3948 struct gimplify_ctx gctx;
3950 /* There is no point in performing inlining if errors have already
3951 occurred -- and we might crash if we try to inline invalid
3953 if (errorcount || sorrycount)
3957 memset (&id, 0, sizeof (id));
3959 id.src_node = id.dst_node = cgraph_node (fn);
3961 /* Or any functions that aren't finished yet. */
3962 if (current_function_decl)
3963 id.dst_fn = current_function_decl;
3965 id.copy_decl = copy_decl_maybe_to_var;
3966 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3967 id.transform_new_cfg = false;
3968 id.transform_return_to_modify = true;
3969 id.transform_lang_insert_block = NULL;
3970 id.statements_to_fold = pointer_set_create ();
3972 push_gimplify_context (&gctx);
3974 /* We make no attempts to keep dominance info up-to-date. */
3975 free_dominance_info (CDI_DOMINATORS);
3976 free_dominance_info (CDI_POST_DOMINATORS);
3978 /* Register specific gimple functions. */
3979 gimple_register_cfg_hooks ();
3981 /* Reach the trees by walking over the CFG, and note the
3982 enclosing basic-blocks in the call edges. */
3983 /* We walk the blocks going forward, because inlined function bodies
3984 will split id->current_basic_block, and the new blocks will
3985 follow it; we'll trudge through them, processing their CALL_EXPRs
3988 gimple_expand_calls_inline (bb, &id);
3990 pop_gimplify_context (NULL);
3992 #ifdef ENABLE_CHECKING
3994 struct cgraph_edge *e;
3996 verify_cgraph_node (id.dst_node);
3998 /* Double check that we inlined everything we are supposed to inline. */
3999 for (e = id.dst_node->callees; e; e = e->next_callee)
4000 gcc_assert (e->inline_failed);
4004 /* Fold the statements before compacting/renumbering the basic blocks. */
4005 fold_marked_statements (last, id.statements_to_fold);
4006 pointer_set_destroy (id.statements_to_fold);
4008 gcc_assert (!id.debug_stmts);
4010 /* Renumber the (code) basic_blocks consecutively. */
4012 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4015 fold_cond_expr_cond ();
4016 delete_unreachable_blocks_update_callgraph (&id);
4017 #ifdef ENABLE_CHECKING
4018 verify_cgraph_node (id.dst_node);
4021 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4022 not possible yet - the IPA passes might make various functions to not
4023 throw and they don't care to proactively update local EH info. This is
4024 done later in fixup_cfg pass that also execute the verification. */
4025 return (TODO_update_ssa
4027 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4028 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4031 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4034 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4036 enum tree_code code = TREE_CODE (*tp);
4037 enum tree_code_class cl = TREE_CODE_CLASS (code);
4039 /* We make copies of most nodes. */
4040 if (IS_EXPR_CODE_CLASS (cl)
4041 || code == TREE_LIST
4043 || code == TYPE_DECL
4044 || code == OMP_CLAUSE)
4046 /* Because the chain gets clobbered when we make a copy, we save it
4048 tree chain = NULL_TREE, new_tree;
4050 chain = TREE_CHAIN (*tp);
4052 /* Copy the node. */
4053 new_tree = copy_node (*tp);
4055 /* Propagate mudflap marked-ness. */
4056 if (flag_mudflap && mf_marked_p (*tp))
4061 /* Now, restore the chain, if appropriate. That will cause
4062 walk_tree to walk into the chain as well. */
4063 if (code == PARM_DECL
4064 || code == TREE_LIST
4065 || code == OMP_CLAUSE)
4066 TREE_CHAIN (*tp) = chain;
4068 /* For now, we don't update BLOCKs when we make copies. So, we
4069 have to nullify all BIND_EXPRs. */
4070 if (TREE_CODE (*tp) == BIND_EXPR)
4071 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4073 else if (code == CONSTRUCTOR)
4075 /* CONSTRUCTOR nodes need special handling because
4076 we need to duplicate the vector of elements. */
4079 new_tree = copy_node (*tp);
4081 /* Propagate mudflap marked-ness. */
4082 if (flag_mudflap && mf_marked_p (*tp))
4085 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4086 CONSTRUCTOR_ELTS (*tp));
4089 else if (TREE_CODE_CLASS (code) == tcc_type)
4091 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4093 else if (TREE_CODE_CLASS (code) == tcc_constant)
4096 gcc_assert (code != STATEMENT_LIST);
4100 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4101 information indicating to what new SAVE_EXPR this one should be mapped,
4102 use that one. Otherwise, create a new node and enter it in ST. FN is
4103 the function into which the copy will be placed. */
4106 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4108 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4112 /* See if we already encountered this SAVE_EXPR. */
4113 n = (tree *) pointer_map_contains (st, *tp);
4115 /* If we didn't already remap this SAVE_EXPR, do so now. */
4118 t = copy_node (*tp);
4120 /* Remember this SAVE_EXPR. */
4121 *pointer_map_insert (st, *tp) = t;
4122 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4123 *pointer_map_insert (st, t) = t;
4127 /* We've already walked into this SAVE_EXPR; don't do it again. */
4132 /* Replace this SAVE_EXPR with the copy. */
4136 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4137 copies the declaration and enters it in the splay_tree in DATA (which is
4138 really an `copy_body_data *'). */
4141 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4144 copy_body_data *id = (copy_body_data *) data;
4146 /* Don't walk into types. */
4150 else if (TREE_CODE (*tp) == LABEL_EXPR)
4152 tree decl = TREE_OPERAND (*tp, 0);
4154 /* Copy the decl and remember the copy. */
4155 insert_decl_map (id, decl, id->copy_decl (decl, id));
4161 /* Perform any modifications to EXPR required when it is unsaved. Does
4162 not recurse into EXPR's subtrees. */
4165 unsave_expr_1 (tree expr)
4167 switch (TREE_CODE (expr))
4170 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4171 It's OK for this to happen if it was part of a subtree that
4172 isn't immediately expanded, such as operand 2 of another
4174 if (TREE_OPERAND (expr, 1))
4177 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4178 TREE_OPERAND (expr, 3) = NULL_TREE;
4186 /* Called via walk_tree when an expression is unsaved. Using the
4187 splay_tree pointed to by ST (which is really a `splay_tree'),
4188 remaps all local declarations to appropriate replacements. */
4191 unsave_r (tree *tp, int *walk_subtrees, void *data)
4193 copy_body_data *id = (copy_body_data *) data;
4194 struct pointer_map_t *st = id->decl_map;
4197 /* Only a local declaration (variable or label). */
4198 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4199 || TREE_CODE (*tp) == LABEL_DECL)
4201 /* Lookup the declaration. */
4202 n = (tree *) pointer_map_contains (st, *tp);
4204 /* If it's there, remap it. */
4209 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4211 else if (TREE_CODE (*tp) == BIND_EXPR)
4212 copy_bind_expr (tp, walk_subtrees, id);
4213 else if (TREE_CODE (*tp) == SAVE_EXPR
4214 || TREE_CODE (*tp) == TARGET_EXPR)
4215 remap_save_expr (tp, st, walk_subtrees);
4218 copy_tree_r (tp, walk_subtrees, NULL);
4220 /* Do whatever unsaving is required. */
4221 unsave_expr_1 (*tp);
4224 /* Keep iterating. */
4228 /* Copies everything in EXPR and replaces variables, labels
4229 and SAVE_EXPRs local to EXPR. */
4232 unsave_expr_now (tree expr)
4236 /* There's nothing to do for NULL_TREE. */
4241 memset (&id, 0, sizeof (id));
4242 id.src_fn = current_function_decl;
4243 id.dst_fn = current_function_decl;
4244 id.decl_map = pointer_map_create ();
4245 id.debug_map = NULL;
4247 id.copy_decl = copy_decl_no_change;
4248 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4249 id.transform_new_cfg = false;
4250 id.transform_return_to_modify = false;
4251 id.transform_lang_insert_block = NULL;
4253 /* Walk the tree once to find local labels. */
4254 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4256 /* Walk the tree again, copying, remapping, and unsaving. */
4257 walk_tree (&expr, unsave_r, &id, NULL);
4260 pointer_map_destroy (id.decl_map);
4262 pointer_map_destroy (id.debug_map);
4267 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4268 label, copies the declaration and enters it in the splay_tree in DATA (which
4269 is really a 'copy_body_data *'. */
4272 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4273 bool *handled_ops_p ATTRIBUTE_UNUSED,
4274 struct walk_stmt_info *wi)
4276 copy_body_data *id = (copy_body_data *) wi->info;
4277 gimple stmt = gsi_stmt (*gsip);
4279 if (gimple_code (stmt) == GIMPLE_LABEL)
4281 tree decl = gimple_label_label (stmt);
4283 /* Copy the decl and remember the copy. */
4284 insert_decl_map (id, decl, id->copy_decl (decl, id));
4291 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4292 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4293 remaps all local declarations to appropriate replacements in gimple
4297 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4299 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4300 copy_body_data *id = (copy_body_data *) wi->info;
4301 struct pointer_map_t *st = id->decl_map;
4305 /* Only a local declaration (variable or label). */
4306 if ((TREE_CODE (expr) == VAR_DECL
4307 && !TREE_STATIC (expr))
4308 || TREE_CODE (expr) == LABEL_DECL)
4310 /* Lookup the declaration. */
4311 n = (tree *) pointer_map_contains (st, expr);
4313 /* If it's there, remap it. */
4318 else if (TREE_CODE (expr) == STATEMENT_LIST
4319 || TREE_CODE (expr) == BIND_EXPR
4320 || TREE_CODE (expr) == SAVE_EXPR)
4322 else if (TREE_CODE (expr) == TARGET_EXPR)
4324 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4325 It's OK for this to happen if it was part of a subtree that
4326 isn't immediately expanded, such as operand 2 of another
4328 if (!TREE_OPERAND (expr, 1))
4330 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4331 TREE_OPERAND (expr, 3) = NULL_TREE;
4335 /* Keep iterating. */
4340 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4341 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4342 remaps all local declarations to appropriate replacements in gimple
4346 replace_locals_stmt (gimple_stmt_iterator *gsip,
4347 bool *handled_ops_p ATTRIBUTE_UNUSED,
4348 struct walk_stmt_info *wi)
4350 copy_body_data *id = (copy_body_data *) wi->info;
4351 gimple stmt = gsi_stmt (*gsip);
4353 if (gimple_code (stmt) == GIMPLE_BIND)
4355 tree block = gimple_bind_block (stmt);
4359 remap_block (&block, id);
4360 gimple_bind_set_block (stmt, block);
4363 /* This will remap a lot of the same decls again, but this should be
4365 if (gimple_bind_vars (stmt))
4366 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4369 /* Keep iterating. */
4374 /* Copies everything in SEQ and replaces variables and labels local to
4375 current_function_decl. */
4378 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4381 struct walk_stmt_info wi;
4382 struct pointer_set_t *visited;
4385 /* There's nothing to do for NULL_TREE. */
4390 memset (&id, 0, sizeof (id));
4391 id.src_fn = current_function_decl;
4392 id.dst_fn = current_function_decl;
4393 id.decl_map = pointer_map_create ();
4394 id.debug_map = NULL;
4396 id.copy_decl = copy_decl_no_change;
4397 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4398 id.transform_new_cfg = false;
4399 id.transform_return_to_modify = false;
4400 id.transform_lang_insert_block = NULL;
4402 /* Walk the tree once to find local labels. */
4403 memset (&wi, 0, sizeof (wi));
4404 visited = pointer_set_create ();
4407 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4408 pointer_set_destroy (visited);
4410 copy = gimple_seq_copy (seq);
4412 /* Walk the copy, remapping decls. */
4413 memset (&wi, 0, sizeof (wi));
4415 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4418 pointer_map_destroy (id.decl_map);
4420 pointer_map_destroy (id.debug_map);
4426 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4429 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4438 debug_find_tree (tree top, tree search)
4440 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4444 /* Declare the variables created by the inliner. Add all the variables in
4445 VARS to BIND_EXPR. */
4448 declare_inline_vars (tree block, tree vars)
4451 for (t = vars; t; t = TREE_CHAIN (t))
4453 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4454 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4455 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4459 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4462 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4463 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4464 VAR_DECL translation. */
4467 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4469 /* Don't generate debug information for the copy if we wouldn't have
4470 generated it for the copy either. */
4471 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4472 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4474 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4475 declaration inspired this copy. */
4476 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4478 /* The new variable/label has no RTL, yet. */
4479 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4480 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4481 SET_DECL_RTL (copy, NULL_RTX);
4483 /* These args would always appear unused, if not for this. */
4484 TREE_USED (copy) = 1;
4486 /* Set the context for the new declaration. */
4487 if (!DECL_CONTEXT (decl))
4488 /* Globals stay global. */
4490 else if (DECL_CONTEXT (decl) != id->src_fn)
4491 /* Things that weren't in the scope of the function we're inlining
4492 from aren't in the scope we're inlining to, either. */
4494 else if (TREE_STATIC (decl))
4495 /* Function-scoped static variables should stay in the original
4499 /* Ordinary automatic local variables are now in the scope of the
4501 DECL_CONTEXT (copy) = id->dst_fn;
4507 copy_decl_to_var (tree decl, copy_body_data *id)
4511 gcc_assert (TREE_CODE (decl) == PARM_DECL
4512 || TREE_CODE (decl) == RESULT_DECL);
4514 type = TREE_TYPE (decl);
4516 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4517 VAR_DECL, DECL_NAME (decl), type);
4518 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4519 TREE_READONLY (copy) = TREE_READONLY (decl);
4520 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4521 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4523 return copy_decl_for_dup_finish (id, decl, copy);
4526 /* Like copy_decl_to_var, but create a return slot object instead of a
4527 pointer variable for return by invisible reference. */
4530 copy_result_decl_to_var (tree decl, copy_body_data *id)
4534 gcc_assert (TREE_CODE (decl) == PARM_DECL
4535 || TREE_CODE (decl) == RESULT_DECL);
4537 type = TREE_TYPE (decl);
4538 if (DECL_BY_REFERENCE (decl))
4539 type = TREE_TYPE (type);
4541 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4542 VAR_DECL, DECL_NAME (decl), type);
4543 TREE_READONLY (copy) = TREE_READONLY (decl);
4544 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4545 if (!DECL_BY_REFERENCE (decl))
4547 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4548 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4551 return copy_decl_for_dup_finish (id, decl, copy);
4555 copy_decl_no_change (tree decl, copy_body_data *id)
4559 copy = copy_node (decl);
4561 /* The COPY is not abstract; it will be generated in DST_FN. */
4562 DECL_ABSTRACT (copy) = 0;
4563 lang_hooks.dup_lang_specific_decl (copy);
4565 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4566 been taken; it's for internal bookkeeping in expand_goto_internal. */
4567 if (TREE_CODE (copy) == LABEL_DECL)
4569 TREE_ADDRESSABLE (copy) = 0;
4570 LABEL_DECL_UID (copy) = -1;
4573 return copy_decl_for_dup_finish (id, decl, copy);
4577 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4579 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4580 return copy_decl_to_var (decl, id);
4582 return copy_decl_no_change (decl, id);
4585 /* Return a copy of the function's argument tree. */
4587 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4588 bitmap args_to_skip, tree *vars)
4591 tree new_parm = NULL;
4596 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4597 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4599 tree new_tree = remap_decl (arg, id);
4600 lang_hooks.dup_lang_specific_decl (new_tree);
4602 parg = &TREE_CHAIN (new_tree);
4604 else if (!pointer_map_contains (id->decl_map, arg))
4606 /* Make an equivalent VAR_DECL. If the argument was used
4607 as temporary variable later in function, the uses will be
4608 replaced by local variable. */
4609 tree var = copy_decl_to_var (arg, id);
4611 add_referenced_var (var);
4612 insert_decl_map (id, arg, var);
4613 /* Declare this new variable. */
4614 TREE_CHAIN (var) = *vars;
4620 /* Return a copy of the function's static chain. */
4622 copy_static_chain (tree static_chain, copy_body_data * id)
4624 tree *chain_copy, *pvar;
4626 chain_copy = &static_chain;
4627 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4629 tree new_tree = remap_decl (*pvar, id);
4630 lang_hooks.dup_lang_specific_decl (new_tree);
4631 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4634 return static_chain;
4637 /* Return true if the function is allowed to be versioned.
4638 This is a guard for the versioning functionality. */
4641 tree_versionable_function_p (tree fndecl)
4643 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4644 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4647 /* Delete all unreachable basic blocks and update callgraph.
4648 Doing so is somewhat nontrivial because we need to update all clones and
4649 remove inline function that become unreachable. */
4652 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4654 bool changed = false;
4655 basic_block b, next_bb;
4657 find_unreachable_blocks ();
4659 /* Delete all unreachable basic blocks. */
4661 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4663 next_bb = b->next_bb;
4665 if (!(b->flags & BB_REACHABLE))
4667 gimple_stmt_iterator bsi;
4669 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4670 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4672 struct cgraph_edge *e;
4673 struct cgraph_node *node;
4675 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4677 if (!e->inline_failed)
4678 cgraph_remove_node_and_inline_clones (e->callee);
4680 cgraph_remove_edge (e);
4682 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4683 && id->dst_node->clones)
4684 for (node = id->dst_node->clones; node != id->dst_node;)
4686 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4688 if (!e->inline_failed)
4689 cgraph_remove_node_and_inline_clones (e->callee);
4691 cgraph_remove_edge (e);
4695 node = node->clones;
4696 else if (node->next_sibling_clone)
4697 node = node->next_sibling_clone;
4700 while (node != id->dst_node && !node->next_sibling_clone)
4701 node = node->clone_of;
4702 if (node != id->dst_node)
4703 node = node->next_sibling_clone;
4707 delete_basic_block (b);
4713 tidy_fallthru_edges ();
4717 /* Update clone info after duplication. */
4720 update_clone_info (copy_body_data * id)
4722 struct cgraph_node *node;
4723 if (!id->dst_node->clones)
4725 for (node = id->dst_node->clones; node != id->dst_node;)
4727 /* First update replace maps to match the new body. */
4728 if (node->clone.tree_map)
4731 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4733 struct ipa_replace_map *replace_info;
4734 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4735 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4736 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4740 node = node->clones;
4741 else if (node->next_sibling_clone)
4742 node = node->next_sibling_clone;
4745 while (node != id->dst_node && !node->next_sibling_clone)
4746 node = node->clone_of;
4747 if (node != id->dst_node)
4748 node = node->next_sibling_clone;
4753 /* Create a copy of a function's tree.
4754 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4755 of the original function and the new copied function
4756 respectively. In case we want to replace a DECL
4757 tree with another tree while duplicating the function's
4758 body, TREE_MAP represents the mapping between these
4759 trees. If UPDATE_CLONES is set, the call_stmt fields
4760 of edges of clones of the function will be updated. */
4762 tree_function_versioning (tree old_decl, tree new_decl,
4763 VEC(ipa_replace_map_p,gc)* tree_map,
4764 bool update_clones, bitmap args_to_skip)
4766 struct cgraph_node *old_version_node;
4767 struct cgraph_node *new_version_node;
4771 struct ipa_replace_map *replace_info;
4772 basic_block old_entry_block, bb;
4773 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4776 tree old_current_function_decl = current_function_decl;
4777 tree vars = NULL_TREE;
4779 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4780 && TREE_CODE (new_decl) == FUNCTION_DECL);
4781 DECL_POSSIBLY_INLINED (old_decl) = 1;
4783 old_version_node = cgraph_node (old_decl);
4784 new_version_node = cgraph_node (new_decl);
4786 /* Output the inlining info for this abstract function, since it has been
4787 inlined. If we don't do this now, we can lose the information about the
4788 variables in the function when the blocks get blown away as soon as we
4789 remove the cgraph node. */
4790 (*debug_hooks->outlining_inline_function) (old_decl);
4792 DECL_ARTIFICIAL (new_decl) = 1;
4793 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4794 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
4796 /* Prepare the data structures for the tree copy. */
4797 memset (&id, 0, sizeof (id));
4799 /* Generate a new name for the new version. */
4800 id.statements_to_fold = pointer_set_create ();
4802 id.decl_map = pointer_map_create ();
4803 id.debug_map = NULL;
4804 id.src_fn = old_decl;
4805 id.dst_fn = new_decl;
4806 id.src_node = old_version_node;
4807 id.dst_node = new_version_node;
4808 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4809 if (id.src_node->ipa_transforms_to_apply)
4811 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
4814 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
4815 id.src_node->ipa_transforms_to_apply);
4816 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
4817 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
4818 VEC_index (ipa_opt_pass,
4819 old_transforms_to_apply,
4823 id.copy_decl = copy_decl_no_change;
4824 id.transform_call_graph_edges
4825 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
4826 id.transform_new_cfg = true;
4827 id.transform_return_to_modify = false;
4828 id.transform_lang_insert_block = NULL;
4830 current_function_decl = new_decl;
4831 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
4832 (DECL_STRUCT_FUNCTION (old_decl));
4833 initialize_cfun (new_decl, old_decl,
4834 old_entry_block->count);
4835 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
4837 /* Copy the function's static chain. */
4838 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
4840 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
4841 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
4844 /* If there's a tree_map, prepare for substitution. */
4846 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
4849 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
4850 if (replace_info->replace_p)
4852 tree op = replace_info->new_tree;
4856 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
4857 op = TREE_OPERAND (op, 0);
4859 if (TREE_CODE (op) == ADDR_EXPR)
4861 op = TREE_OPERAND (op, 0);
4862 while (handled_component_p (op))
4863 op = TREE_OPERAND (op, 0);
4864 if (TREE_CODE (op) == VAR_DECL)
4865 add_referenced_var (op);
4867 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
4868 init = setup_one_parameter (&id, replace_info->old_tree,
4869 replace_info->new_tree, id.src_fn,
4873 VEC_safe_push (gimple, heap, init_stmts, init);
4876 /* Copy the function's arguments. */
4877 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
4878 DECL_ARGUMENTS (new_decl) =
4879 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
4880 args_to_skip, &vars);
4882 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
4884 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4885 number_blocks (id.dst_fn);
4887 declare_inline_vars (DECL_INITIAL (new_decl), vars);
4889 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
4890 /* Add local vars. */
4891 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
4892 t_step; t_step = TREE_CHAIN (t_step))
4894 tree var = TREE_VALUE (t_step);
4895 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
4896 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
4897 else if (!can_be_nonlocal (var, &id))
4899 tree_cons (NULL_TREE, remap_decl (var, &id),
4903 /* Copy the Function's body. */
4904 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
4905 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
4907 if (DECL_RESULT (old_decl) != NULL_TREE)
4909 tree *res_decl = &DECL_RESULT (old_decl);
4910 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
4911 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
4914 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4915 number_blocks (new_decl);
4917 /* We want to create the BB unconditionally, so that the addition of
4918 debug stmts doesn't affect BB count, which may in the end cause
4919 codegen differences. */
4920 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
4921 while (VEC_length (gimple, init_stmts))
4922 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
4923 update_clone_info (&id);
4925 /* Remap the nonlocal_goto_save_area, if any. */
4926 if (cfun->nonlocal_goto_save_area)
4928 struct walk_stmt_info wi;
4930 memset (&wi, 0, sizeof (wi));
4932 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
4936 pointer_map_destroy (id.decl_map);
4938 pointer_map_destroy (id.debug_map);
4939 free_dominance_info (CDI_DOMINATORS);
4940 free_dominance_info (CDI_POST_DOMINATORS);
4942 fold_marked_statements (0, id.statements_to_fold);
4943 pointer_set_destroy (id.statements_to_fold);
4944 fold_cond_expr_cond ();
4945 delete_unreachable_blocks_update_callgraph (&id);
4946 update_ssa (TODO_update_ssa);
4947 free_dominance_info (CDI_DOMINATORS);
4948 free_dominance_info (CDI_POST_DOMINATORS);
4950 gcc_assert (!id.debug_stmts);
4951 VEC_free (gimple, heap, init_stmts);
4953 current_function_decl = old_current_function_decl;
4954 gcc_assert (!current_function_decl
4955 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
4959 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
4960 the callee and return the inlined body on success. */
4963 maybe_inline_call_in_expr (tree exp)
4965 tree fn = get_callee_fndecl (exp);
4967 /* We can only try to inline "const" functions. */
4968 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
4970 struct pointer_map_t *decl_map = pointer_map_create ();
4971 call_expr_arg_iterator iter;
4975 /* Remap the parameters. */
4976 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
4978 param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter))
4979 *pointer_map_insert (decl_map, param) = arg;
4981 memset (&id, 0, sizeof (id));
4983 id.dst_fn = current_function_decl;
4984 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
4985 id.decl_map = decl_map;
4987 id.copy_decl = copy_decl_no_change;
4988 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4989 id.transform_new_cfg = false;
4990 id.transform_return_to_modify = true;
4991 id.transform_lang_insert_block = false;
4993 /* Make sure not to unshare trees behind the front-end's back
4994 since front-end specific mechanisms may rely on sharing. */
4995 id.regimplify = false;
4996 id.do_not_unshare = true;
4998 /* We're not inside any EH region. */
5001 t = copy_tree_body (&id);
5002 pointer_map_destroy (decl_map);
5004 /* We can only return something suitable for use in a GENERIC
5006 if (TREE_CODE (t) == MODIFY_EXPR)
5007 return TREE_OPERAND (t, 1);
5013 /* Duplicate a type, fields and all. */
5016 build_duplicate_type (tree type)
5018 struct copy_body_data id;
5020 memset (&id, 0, sizeof (id));
5021 id.src_fn = current_function_decl;
5022 id.dst_fn = current_function_decl;
5024 id.decl_map = pointer_map_create ();
5025 id.debug_map = NULL;
5026 id.copy_decl = copy_decl_no_change;
5028 type = remap_type_1 (type, &id);
5030 pointer_map_destroy (id.decl_map);
5032 pointer_map_destroy (id.debug_map);
5034 TYPE_CANONICAL (type) = type;
5039 /* Return whether it is safe to inline a function because it used different
5040 target specific options or call site actual types mismatch parameter types.
5041 E is the call edge to be checked. */
5043 tree_can_inline_p (struct cgraph_edge *e)
5046 /* This causes a regression in SPEC in that it prevents a cold function from
5047 inlining a hot function. Perhaps this should only apply to functions
5048 that the user declares hot/cold/optimize explicitly. */
5050 /* Don't inline a function with a higher optimization level than the
5051 caller, or with different space constraints (hot/cold functions). */
5052 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5053 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5055 if (caller_tree != callee_tree)
5057 struct cl_optimization *caller_opt
5058 = TREE_OPTIMIZATION ((caller_tree)
5060 : optimization_default_node);
5062 struct cl_optimization *callee_opt
5063 = TREE_OPTIMIZATION ((callee_tree)
5065 : optimization_default_node);
5067 if ((caller_opt->optimize > callee_opt->optimize)
5068 || (caller_opt->optimize_size != callee_opt->optimize_size))
5072 tree caller, callee;
5074 caller = e->caller->decl;
5075 callee = e->callee->decl;
5077 /* We cannot inline a function that uses a different EH personality
5079 if (DECL_FUNCTION_PERSONALITY (caller)
5080 && DECL_FUNCTION_PERSONALITY (callee)
5081 && (DECL_FUNCTION_PERSONALITY (caller)
5082 != DECL_FUNCTION_PERSONALITY (callee)))
5084 e->inline_failed = CIF_UNSPECIFIED;
5085 gimple_call_set_cannot_inline (e->call_stmt, true);
5089 /* Allow the backend to decide if inlining is ok. */
5090 if (!targetm.target_option.can_inline_p (caller, callee))
5092 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5093 gimple_call_set_cannot_inline (e->call_stmt, true);
5094 e->call_stmt_cannot_inline_p = true;
5099 && !gimple_check_call_args (e->call_stmt))
5101 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5102 gimple_call_set_cannot_inline (e->call_stmt, true);
5103 e->call_stmt_cannot_inline_p = true;