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"
44 #include "tree-flow.h"
45 #include "diagnostic.h"
48 #include "pointer-set.h"
50 #include "value-prof.h"
51 #include "tree-pass.h"
53 #include "integrate.h"
55 /* I'm not real happy about this, but we need to handle gimple and
59 /* Inlining, Cloning, Versioning, Parallelization
61 Inlining: a function body is duplicated, but the PARM_DECLs are
62 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
63 MODIFY_EXPRs that store to a dedicated returned-value variable.
64 The duplicated eh_region info of the copy will later be appended
65 to the info for the caller; the eh_region info in copied throwing
66 statements and RESX statements are adjusted accordingly.
68 Cloning: (only in C++) We have one body for a con/de/structor, and
69 multiple function decls, each with a unique parameter list.
70 Duplicate the body, using the given splay tree; some parameters
71 will become constants (like 0 or 1).
73 Versioning: a function body is duplicated and the result is a new
74 function rather than into blocks of an existing function as with
75 inlining. Some parameters will become constants.
77 Parallelization: a region of a function is duplicated resulting in
78 a new function. Variables may be replaced with complex expressions
79 to enable shared variable semantics.
81 All of these will simultaneously lookup any callgraph edges. If
82 we're going to inline the duplicated function body, and the given
83 function has some cloned callgraph nodes (one for each place this
84 function will be inlined) those callgraph edges will be duplicated.
85 If we're cloning the body, those callgraph edges will be
86 updated to point into the new body. (Note that the original
87 callgraph node and edge list will not be altered.)
89 See the CALL_EXPR handling case in copy_tree_body_r (). */
93 o In order to make inlining-on-trees work, we pessimized
94 function-local static constants. In particular, they are now
95 always output, even when not addressed. Fix this by treating
96 function-local static constants just like global static
97 constants; the back-end already knows not to output them if they
100 o Provide heuristics to clamp inlining of recursive template
104 /* Weights that estimate_num_insns uses to estimate the size of the
107 eni_weights eni_size_weights;
109 /* Weights that estimate_num_insns uses to estimate the time necessary
110 to execute the produced code. */
112 eni_weights eni_time_weights;
116 static tree declare_return_variable (copy_body_data *, tree, tree);
117 static void remap_block (tree *, copy_body_data *);
118 static void copy_bind_expr (tree *, int *, copy_body_data *);
119 static tree mark_local_for_remap_r (tree *, int *, void *);
120 static void unsave_expr_1 (tree);
121 static tree unsave_r (tree *, int *, void *);
122 static void declare_inline_vars (tree, tree);
123 static void remap_save_expr (tree *, void *, int *);
124 static void prepend_lexical_block (tree current_block, tree new_block);
125 static tree copy_decl_to_var (tree, copy_body_data *);
126 static tree copy_result_decl_to_var (tree, copy_body_data *);
127 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
128 static gimple remap_gimple_stmt (gimple, copy_body_data *);
129 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
131 /* Insert a tree->tree mapping for ID. Despite the name suggests
132 that the trees should be variables, it is used for more than that. */
135 insert_decl_map (copy_body_data *id, tree key, tree value)
137 *pointer_map_insert (id->decl_map, key) = value;
139 /* Always insert an identity map as well. If we see this same new
140 node again, we won't want to duplicate it a second time. */
142 *pointer_map_insert (id->decl_map, value) = value;
145 /* Insert a tree->tree mapping for ID. This is only used for
149 insert_debug_decl_map (copy_body_data *id, tree key, tree value)
151 if (!gimple_in_ssa_p (id->src_cfun))
154 if (!MAY_HAVE_DEBUG_STMTS)
157 if (!target_for_debug_bind (key))
160 gcc_assert (TREE_CODE (key) == PARM_DECL);
161 gcc_assert (TREE_CODE (value) == VAR_DECL);
164 id->debug_map = pointer_map_create ();
166 *pointer_map_insert (id->debug_map, key) = value;
169 /* If nonzero, we're remapping the contents of inlined debug
170 statements. If negative, an error has occurred, such as a
171 reference to a variable that isn't available in the inlined
173 static int processing_debug_stmt = 0;
175 /* Construct new SSA name for old NAME. ID is the inline context. */
178 remap_ssa_name (tree name, copy_body_data *id)
183 gcc_assert (TREE_CODE (name) == SSA_NAME);
185 n = (tree *) pointer_map_contains (id->decl_map, name);
187 return unshare_expr (*n);
189 if (processing_debug_stmt)
191 processing_debug_stmt = -1;
195 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
197 new_tree = remap_decl (SSA_NAME_VAR (name), id);
199 /* We might've substituted constant or another SSA_NAME for
202 Replace the SSA name representing RESULT_DECL by variable during
203 inlining: this saves us from need to introduce PHI node in a case
204 return value is just partly initialized. */
205 if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
206 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
207 || !id->transform_return_to_modify))
209 struct ptr_info_def *pi;
210 new_tree = make_ssa_name (new_tree, NULL);
211 insert_decl_map (id, name, new_tree);
212 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
213 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
214 TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
215 /* At least IPA points-to info can be directly transferred. */
216 if (id->src_cfun->gimple_df
217 && id->src_cfun->gimple_df->ipa_pta
218 && (pi = SSA_NAME_PTR_INFO (name))
221 struct ptr_info_def *new_pi = get_ptr_info (new_tree);
224 if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
226 /* By inlining function having uninitialized variable, we might
227 extend the lifetime (variable might get reused). This cause
228 ICE in the case we end up extending lifetime of SSA name across
229 abnormal edge, but also increase register pressure.
231 We simply initialize all uninitialized vars by 0 except
232 for case we are inlining to very first BB. We can avoid
233 this for all BBs that are not inside strongly connected
234 regions of the CFG, but this is expensive to test. */
236 && is_gimple_reg (SSA_NAME_VAR (name))
237 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
238 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
239 || EDGE_COUNT (id->entry_bb->preds) != 1))
241 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
244 init_stmt = gimple_build_assign (new_tree,
245 fold_convert (TREE_TYPE (new_tree),
247 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
248 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
252 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
253 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
255 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
260 insert_decl_map (id, name, new_tree);
264 /* Remap DECL during the copying of the BLOCK tree for the function. */
267 remap_decl (tree decl, copy_body_data *id)
271 /* We only remap local variables in the current function. */
273 /* See if we have remapped this declaration. */
275 n = (tree *) pointer_map_contains (id->decl_map, decl);
277 if (!n && processing_debug_stmt)
279 processing_debug_stmt = -1;
283 /* If we didn't already have an equivalent for this declaration,
287 /* Make a copy of the variable or label. */
288 tree t = id->copy_decl (decl, id);
290 /* Remember it, so that if we encounter this local entity again
291 we can reuse this copy. Do this early because remap_type may
292 need this decl for TYPE_STUB_DECL. */
293 insert_decl_map (id, decl, t);
298 /* Remap types, if necessary. */
299 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
300 if (TREE_CODE (t) == TYPE_DECL)
301 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
303 /* Remap sizes as necessary. */
304 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
305 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
307 /* If fields, do likewise for offset and qualifier. */
308 if (TREE_CODE (t) == FIELD_DECL)
310 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
311 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
312 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
315 if (cfun && gimple_in_ssa_p (cfun)
316 && (TREE_CODE (t) == VAR_DECL
317 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
320 add_referenced_var (t);
325 if (id->do_not_unshare)
328 return unshare_expr (*n);
332 remap_type_1 (tree type, copy_body_data *id)
336 /* We do need a copy. build and register it now. If this is a pointer or
337 reference type, remap the designated type and make a new pointer or
339 if (TREE_CODE (type) == POINTER_TYPE)
341 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
343 TYPE_REF_CAN_ALIAS_ALL (type));
344 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
345 new_tree = build_type_attribute_qual_variant (new_tree,
346 TYPE_ATTRIBUTES (type),
348 insert_decl_map (id, type, new_tree);
351 else if (TREE_CODE (type) == REFERENCE_TYPE)
353 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
355 TYPE_REF_CAN_ALIAS_ALL (type));
356 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
357 new_tree = build_type_attribute_qual_variant (new_tree,
358 TYPE_ATTRIBUTES (type),
360 insert_decl_map (id, type, new_tree);
364 new_tree = copy_node (type);
366 insert_decl_map (id, type, new_tree);
368 /* This is a new type, not a copy of an old type. Need to reassociate
369 variants. We can handle everything except the main variant lazily. */
370 t = TYPE_MAIN_VARIANT (type);
373 t = remap_type (t, id);
374 TYPE_MAIN_VARIANT (new_tree) = t;
375 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
376 TYPE_NEXT_VARIANT (t) = new_tree;
380 TYPE_MAIN_VARIANT (new_tree) = new_tree;
381 TYPE_NEXT_VARIANT (new_tree) = NULL;
384 if (TYPE_STUB_DECL (type))
385 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
387 /* Lazily create pointer and reference types. */
388 TYPE_POINTER_TO (new_tree) = NULL;
389 TYPE_REFERENCE_TO (new_tree) = NULL;
391 switch (TREE_CODE (new_tree))
395 case FIXED_POINT_TYPE:
398 t = TYPE_MIN_VALUE (new_tree);
399 if (t && TREE_CODE (t) != INTEGER_CST)
400 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
402 t = TYPE_MAX_VALUE (new_tree);
403 if (t && TREE_CODE (t) != INTEGER_CST)
404 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
408 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
409 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
413 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
414 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
419 case QUAL_UNION_TYPE:
423 for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f))
425 t = remap_decl (f, id);
426 DECL_CONTEXT (t) = new_tree;
430 TYPE_FIELDS (new_tree) = nreverse (nf);
436 /* Shouldn't have been thought variable sized. */
440 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
441 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
447 remap_type (tree type, copy_body_data *id)
455 /* See if we have remapped this type. */
456 node = (tree *) pointer_map_contains (id->decl_map, type);
460 /* The type only needs remapping if it's variably modified. */
461 if (! variably_modified_type_p (type, id->src_fn))
463 insert_decl_map (id, type, type);
467 id->remapping_type_depth++;
468 tmp = remap_type_1 (type, id);
469 id->remapping_type_depth--;
474 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
475 is NULL or TYPE has not been remapped before. */
478 remapped_type (tree type, copy_body_data *id)
485 /* See if we have remapped this type. */
486 node = (tree *) pointer_map_contains (id->decl_map, type);
493 /* The type only needs remapping if it's variably modified. */
494 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
497 can_be_nonlocal (tree decl, copy_body_data *id)
499 /* We can not duplicate function decls. */
500 if (TREE_CODE (decl) == FUNCTION_DECL)
503 /* Local static vars must be non-local or we get multiple declaration
505 if (TREE_CODE (decl) == VAR_DECL
506 && !auto_var_in_fn_p (decl, id->src_fn))
509 /* At the moment dwarf2out can handle only these types of nodes. We
510 can support more later. */
511 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
514 /* We must use global type. We call remapped_type instead of
515 remap_type since we don't want to remap this type here if it
516 hasn't been remapped before. */
517 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
520 /* Wihtout SSA we can't tell if variable is used. */
521 if (!gimple_in_ssa_p (cfun))
524 /* Live variables must be copied so we can attach DECL_RTL. */
532 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
535 tree new_decls = NULL_TREE;
537 /* Remap its variables. */
538 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
542 if (can_be_nonlocal (old_var, id))
544 if (TREE_CODE (old_var) == VAR_DECL
545 && ! DECL_EXTERNAL (old_var)
546 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
547 cfun->local_decls = tree_cons (NULL_TREE, old_var,
549 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
550 && !DECL_IGNORED_P (old_var)
551 && nonlocalized_list)
552 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
556 /* Remap the variable. */
557 new_var = remap_decl (old_var, id);
559 /* If we didn't remap this variable, we can't mess with its
560 TREE_CHAIN. If we remapped this variable to the return slot, it's
561 already declared somewhere else, so don't declare it here. */
563 if (new_var == id->retvar)
567 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
568 && !DECL_IGNORED_P (old_var)
569 && nonlocalized_list)
570 VEC_safe_push (tree, gc, *nonlocalized_list, old_var);
574 gcc_assert (DECL_P (new_var));
575 TREE_CHAIN (new_var) = new_decls;
580 return nreverse (new_decls);
583 /* Copy the BLOCK to contain remapped versions of the variables
584 therein. And hook the new block into the block-tree. */
587 remap_block (tree *block, copy_body_data *id)
592 /* Make the new block. */
594 new_block = make_node (BLOCK);
595 TREE_USED (new_block) = TREE_USED (old_block);
596 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
597 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
598 BLOCK_NONLOCALIZED_VARS (new_block)
599 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
602 /* Remap its variables. */
603 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
604 &BLOCK_NONLOCALIZED_VARS (new_block),
607 if (id->transform_lang_insert_block)
608 id->transform_lang_insert_block (new_block);
610 /* Remember the remapped block. */
611 insert_decl_map (id, old_block, new_block);
614 /* Copy the whole block tree and root it in id->block. */
616 remap_blocks (tree block, copy_body_data *id)
619 tree new_tree = block;
624 remap_block (&new_tree, id);
625 gcc_assert (new_tree != block);
626 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
627 prepend_lexical_block (new_tree, remap_blocks (t, id));
628 /* Blocks are in arbitrary order, but make things slightly prettier and do
629 not swap order when producing a copy. */
630 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
635 copy_statement_list (tree *tp)
637 tree_stmt_iterator oi, ni;
640 new_tree = alloc_stmt_list ();
641 ni = tsi_start (new_tree);
642 oi = tsi_start (*tp);
643 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
646 for (; !tsi_end_p (oi); tsi_next (&oi))
648 tree stmt = tsi_stmt (oi);
649 if (TREE_CODE (stmt) == STATEMENT_LIST)
650 copy_statement_list (&stmt);
651 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
656 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
658 tree block = BIND_EXPR_BLOCK (*tp);
659 /* Copy (and replace) the statement. */
660 copy_tree_r (tp, walk_subtrees, NULL);
663 remap_block (&block, id);
664 BIND_EXPR_BLOCK (*tp) = block;
667 if (BIND_EXPR_VARS (*tp))
668 /* This will remap a lot of the same decls again, but this should be
670 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
674 /* Create a new gimple_seq by remapping all the statements in BODY
675 using the inlining information in ID. */
678 remap_gimple_seq (gimple_seq body, copy_body_data *id)
680 gimple_stmt_iterator si;
681 gimple_seq new_body = NULL;
683 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
685 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
686 gimple_seq_add_stmt (&new_body, new_stmt);
693 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
694 block using the mapping information in ID. */
697 copy_gimple_bind (gimple stmt, copy_body_data *id)
700 tree new_block, new_vars;
701 gimple_seq body, new_body;
703 /* Copy the statement. Note that we purposely don't use copy_stmt
704 here because we need to remap statements as we copy. */
705 body = gimple_bind_body (stmt);
706 new_body = remap_gimple_seq (body, id);
708 new_block = gimple_bind_block (stmt);
710 remap_block (&new_block, id);
712 /* This will remap a lot of the same decls again, but this should be
714 new_vars = gimple_bind_vars (stmt);
716 new_vars = remap_decls (new_vars, NULL, id);
718 new_bind = gimple_build_bind (new_vars, new_body, new_block);
724 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
725 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
726 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
727 recursing into the children nodes of *TP. */
730 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
732 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
733 copy_body_data *id = (copy_body_data *) wi_p->info;
734 tree fn = id->src_fn;
736 if (TREE_CODE (*tp) == SSA_NAME)
738 *tp = remap_ssa_name (*tp, id);
742 else if (auto_var_in_fn_p (*tp, fn))
744 /* Local variables and labels need to be replaced by equivalent
745 variables. We don't want to copy static variables; there's
746 only one of those, no matter how many times we inline the
747 containing function. Similarly for globals from an outer
751 /* Remap the declaration. */
752 new_decl = remap_decl (*tp, id);
753 gcc_assert (new_decl);
754 /* Replace this variable with the copy. */
755 STRIP_TYPE_NOPS (new_decl);
756 /* ??? The C++ frontend uses void * pointer zero to initialize
757 any other type. This confuses the middle-end type verification.
758 As cloned bodies do not go through gimplification again the fixup
759 there doesn't trigger. */
760 if (TREE_CODE (new_decl) == INTEGER_CST
761 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
762 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
766 else if (TREE_CODE (*tp) == STATEMENT_LIST)
768 else if (TREE_CODE (*tp) == SAVE_EXPR)
770 else if (TREE_CODE (*tp) == LABEL_DECL
771 && (!DECL_CONTEXT (*tp)
772 || decl_function_context (*tp) == id->src_fn))
773 /* These may need to be remapped for EH handling. */
774 *tp = remap_decl (*tp, id);
775 else if (TYPE_P (*tp))
776 /* Types may need remapping as well. */
777 *tp = remap_type (*tp, id);
778 else if (CONSTANT_CLASS_P (*tp))
780 /* If this is a constant, we have to copy the node iff the type
781 will be remapped. copy_tree_r will not copy a constant. */
782 tree new_type = remap_type (TREE_TYPE (*tp), id);
784 if (new_type == TREE_TYPE (*tp))
787 else if (TREE_CODE (*tp) == INTEGER_CST)
788 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
789 TREE_INT_CST_HIGH (*tp));
792 *tp = copy_node (*tp);
793 TREE_TYPE (*tp) = new_type;
798 /* Otherwise, just copy the node. Note that copy_tree_r already
799 knows not to copy VAR_DECLs, etc., so this is safe. */
800 if (TREE_CODE (*tp) == INDIRECT_REF)
802 /* Get rid of *& from inline substitutions that can happen when a
803 pointer argument is an ADDR_EXPR. */
804 tree decl = TREE_OPERAND (*tp, 0);
807 n = (tree *) pointer_map_contains (id->decl_map, decl);
810 tree type, new_tree, old;
812 /* If we happen to get an ADDR_EXPR in n->value, strip
813 it manually here as we'll eventually get ADDR_EXPRs
814 which lie about their types pointed to. In this case
815 build_fold_indirect_ref wouldn't strip the
816 INDIRECT_REF, but we absolutely rely on that. As
817 fold_indirect_ref does other useful transformations,
818 try that first, though. */
819 type = TREE_TYPE (TREE_TYPE (*n));
820 new_tree = unshare_expr (*n);
822 *tp = gimple_fold_indirect_ref (new_tree);
825 if (TREE_CODE (new_tree) == ADDR_EXPR)
827 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
829 /* ??? We should either assert here or build
830 a VIEW_CONVERT_EXPR instead of blindly leaking
831 incompatible types to our IL. */
833 *tp = TREE_OPERAND (new_tree, 0);
837 *tp = build1 (INDIRECT_REF, type, new_tree);
838 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
839 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
847 /* Here is the "usual case". Copy this tree node, and then
848 tweak some special cases. */
849 copy_tree_r (tp, walk_subtrees, NULL);
851 /* Global variables we haven't seen yet need to go into referenced
852 vars. If not referenced from types only. */
853 if (gimple_in_ssa_p (cfun)
854 && TREE_CODE (*tp) == VAR_DECL
855 && id->remapping_type_depth == 0
856 && !processing_debug_stmt)
857 add_referenced_var (*tp);
859 /* We should never have TREE_BLOCK set on non-statements. */
861 gcc_assert (!TREE_BLOCK (*tp));
863 if (TREE_CODE (*tp) != OMP_CLAUSE)
864 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
866 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
868 /* The copied TARGET_EXPR has never been expanded, even if the
869 original node was expanded already. */
870 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
871 TREE_OPERAND (*tp, 3) = NULL_TREE;
873 else if (TREE_CODE (*tp) == ADDR_EXPR)
875 /* Variable substitution need not be simple. In particular,
876 the INDIRECT_REF substitution above. Make sure that
877 TREE_CONSTANT and friends are up-to-date. But make sure
878 to not improperly set TREE_BLOCK on some sub-expressions. */
879 int invariant = is_gimple_min_invariant (*tp);
880 tree block = id->block;
881 id->block = NULL_TREE;
882 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
885 /* Handle the case where we substituted an INDIRECT_REF
886 into the operand of the ADDR_EXPR. */
887 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
888 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
890 recompute_tree_invariant_for_addr_expr (*tp);
892 /* If this used to be invariant, but is not any longer,
893 then regimplification is probably needed. */
894 if (invariant && !is_gimple_min_invariant (*tp))
895 id->regimplify = true;
901 /* Keep iterating. */
906 /* Called from copy_body_id via walk_tree. DATA is really a
907 `copy_body_data *'. */
910 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
912 copy_body_data *id = (copy_body_data *) data;
913 tree fn = id->src_fn;
916 /* Begin by recognizing trees that we'll completely rewrite for the
917 inlining context. Our output for these trees is completely
918 different from out input (e.g. RETURN_EXPR is deleted, and morphs
919 into an edge). Further down, we'll handle trees that get
920 duplicated and/or tweaked. */
922 /* When requested, RETURN_EXPRs should be transformed to just the
923 contained MODIFY_EXPR. The branch semantics of the return will
924 be handled elsewhere by manipulating the CFG rather than a statement. */
925 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
927 tree assignment = TREE_OPERAND (*tp, 0);
929 /* If we're returning something, just turn that into an
930 assignment into the equivalent of the original RESULT_DECL.
931 If the "assignment" is just the result decl, the result
932 decl has already been set (e.g. a recent "foo (&result_decl,
933 ...)"); just toss the entire RETURN_EXPR. */
934 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
936 /* Replace the RETURN_EXPR with (a copy of) the
937 MODIFY_EXPR hanging underneath. */
938 *tp = copy_node (assignment);
940 else /* Else the RETURN_EXPR returns no value. */
943 return (tree) (void *)1;
946 else if (TREE_CODE (*tp) == SSA_NAME)
948 *tp = remap_ssa_name (*tp, id);
953 /* Local variables and labels need to be replaced by equivalent
954 variables. We don't want to copy static variables; there's only
955 one of those, no matter how many times we inline the containing
956 function. Similarly for globals from an outer function. */
957 else if (auto_var_in_fn_p (*tp, fn))
961 /* Remap the declaration. */
962 new_decl = remap_decl (*tp, id);
963 gcc_assert (new_decl);
964 /* Replace this variable with the copy. */
965 STRIP_TYPE_NOPS (new_decl);
969 else if (TREE_CODE (*tp) == STATEMENT_LIST)
970 copy_statement_list (tp);
971 else if (TREE_CODE (*tp) == SAVE_EXPR
972 || TREE_CODE (*tp) == TARGET_EXPR)
973 remap_save_expr (tp, id->decl_map, walk_subtrees);
974 else if (TREE_CODE (*tp) == LABEL_DECL
975 && (! DECL_CONTEXT (*tp)
976 || decl_function_context (*tp) == id->src_fn))
977 /* These may need to be remapped for EH handling. */
978 *tp = remap_decl (*tp, id);
979 else if (TREE_CODE (*tp) == BIND_EXPR)
980 copy_bind_expr (tp, walk_subtrees, id);
981 /* Types may need remapping as well. */
982 else if (TYPE_P (*tp))
983 *tp = remap_type (*tp, id);
985 /* If this is a constant, we have to copy the node iff the type will be
986 remapped. copy_tree_r will not copy a constant. */
987 else if (CONSTANT_CLASS_P (*tp))
989 tree new_type = remap_type (TREE_TYPE (*tp), id);
991 if (new_type == TREE_TYPE (*tp))
994 else if (TREE_CODE (*tp) == INTEGER_CST)
995 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
996 TREE_INT_CST_HIGH (*tp));
999 *tp = copy_node (*tp);
1000 TREE_TYPE (*tp) = new_type;
1004 /* Otherwise, just copy the node. Note that copy_tree_r already
1005 knows not to copy VAR_DECLs, etc., so this is safe. */
1008 /* Here we handle trees that are not completely rewritten.
1009 First we detect some inlining-induced bogosities for
1011 if (TREE_CODE (*tp) == MODIFY_EXPR
1012 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1013 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1015 /* Some assignments VAR = VAR; don't generate any rtl code
1016 and thus don't count as variable modification. Avoid
1017 keeping bogosities like 0 = 0. */
1018 tree decl = TREE_OPERAND (*tp, 0), value;
1021 n = (tree *) pointer_map_contains (id->decl_map, decl);
1025 STRIP_TYPE_NOPS (value);
1026 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1028 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1029 return copy_tree_body_r (tp, walk_subtrees, data);
1033 else if (TREE_CODE (*tp) == INDIRECT_REF)
1035 /* Get rid of *& from inline substitutions that can happen when a
1036 pointer argument is an ADDR_EXPR. */
1037 tree decl = TREE_OPERAND (*tp, 0);
1040 n = (tree *) pointer_map_contains (id->decl_map, decl);
1045 /* If we happen to get an ADDR_EXPR in n->value, strip
1046 it manually here as we'll eventually get ADDR_EXPRs
1047 which lie about their types pointed to. In this case
1048 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1049 but we absolutely rely on that. As fold_indirect_ref
1050 does other useful transformations, try that first, though. */
1051 tree type = TREE_TYPE (TREE_TYPE (*n));
1052 if (id->do_not_unshare)
1055 new_tree = unshare_expr (*n);
1057 *tp = gimple_fold_indirect_ref (new_tree);
1060 if (TREE_CODE (new_tree) == ADDR_EXPR)
1062 *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1064 /* ??? We should either assert here or build
1065 a VIEW_CONVERT_EXPR instead of blindly leaking
1066 incompatible types to our IL. */
1068 *tp = TREE_OPERAND (new_tree, 0);
1072 *tp = build1 (INDIRECT_REF, type, new_tree);
1073 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1074 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1082 /* Here is the "usual case". Copy this tree node, and then
1083 tweak some special cases. */
1084 copy_tree_r (tp, walk_subtrees, NULL);
1086 /* Global variables we haven't seen yet needs to go into referenced
1087 vars. If not referenced from types or debug stmts only. */
1088 if (gimple_in_ssa_p (cfun)
1089 && TREE_CODE (*tp) == VAR_DECL
1090 && id->remapping_type_depth == 0
1091 && !processing_debug_stmt)
1092 add_referenced_var (*tp);
1094 /* If EXPR has block defined, map it to newly constructed block.
1095 When inlining we want EXPRs without block appear in the block
1096 of function call if we are not remapping a type. */
1099 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1100 if (TREE_BLOCK (*tp))
1103 n = (tree *) pointer_map_contains (id->decl_map,
1108 TREE_BLOCK (*tp) = new_block;
1111 if (TREE_CODE (*tp) != OMP_CLAUSE)
1112 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1114 /* The copied TARGET_EXPR has never been expanded, even if the
1115 original node was expanded already. */
1116 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1118 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1119 TREE_OPERAND (*tp, 3) = NULL_TREE;
1122 /* Variable substitution need not be simple. In particular, the
1123 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1124 and friends are up-to-date. */
1125 else if (TREE_CODE (*tp) == ADDR_EXPR)
1127 int invariant = is_gimple_min_invariant (*tp);
1128 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1130 /* Handle the case where we substituted an INDIRECT_REF
1131 into the operand of the ADDR_EXPR. */
1132 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1133 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1135 recompute_tree_invariant_for_addr_expr (*tp);
1137 /* If this used to be invariant, but is not any longer,
1138 then regimplification is probably needed. */
1139 if (invariant && !is_gimple_min_invariant (*tp))
1140 id->regimplify = true;
1146 /* Keep iterating. */
1150 /* Helper for remap_gimple_stmt. Given an EH region number for the
1151 source function, map that to the duplicate EH region number in
1152 the destination function. */
1155 remap_eh_region_nr (int old_nr, copy_body_data *id)
1157 eh_region old_r, new_r;
1160 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1161 slot = pointer_map_contains (id->eh_map, old_r);
1162 new_r = (eh_region) *slot;
1164 return new_r->index;
1167 /* Similar, but operate on INTEGER_CSTs. */
1170 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1174 old_nr = tree_low_cst (old_t_nr, 0);
1175 new_nr = remap_eh_region_nr (old_nr, id);
1177 return build_int_cst (NULL, new_nr);
1180 /* Helper for copy_bb. Remap statement STMT using the inlining
1181 information in ID. Return the new statement copy. */
1184 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1187 struct walk_stmt_info wi;
1189 bool skip_first = false;
1191 /* Begin by recognizing trees that we'll completely rewrite for the
1192 inlining context. Our output for these trees is completely
1193 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1194 into an edge). Further down, we'll handle trees that get
1195 duplicated and/or tweaked. */
1197 /* When requested, GIMPLE_RETURNs should be transformed to just the
1198 contained GIMPLE_ASSIGN. The branch semantics of the return will
1199 be handled elsewhere by manipulating the CFG rather than the
1201 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1203 tree retval = gimple_return_retval (stmt);
1205 /* If we're returning something, just turn that into an
1206 assignment into the equivalent of the original RESULT_DECL.
1207 If RETVAL is just the result decl, the result decl has
1208 already been set (e.g. a recent "foo (&result_decl, ...)");
1209 just toss the entire GIMPLE_RETURN. */
1210 if (retval && TREE_CODE (retval) != RESULT_DECL)
1212 copy = gimple_build_assign (id->retvar, retval);
1213 /* id->retvar is already substituted. Skip it on later remapping. */
1217 return gimple_build_nop ();
1219 else if (gimple_has_substatements (stmt))
1223 /* When cloning bodies from the C++ front end, we will be handed bodies
1224 in High GIMPLE form. Handle here all the High GIMPLE statements that
1225 have embedded statements. */
1226 switch (gimple_code (stmt))
1229 copy = copy_gimple_bind (stmt, id);
1233 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1234 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1237 case GIMPLE_EH_FILTER:
1238 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1239 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1243 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1244 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1245 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1248 case GIMPLE_WITH_CLEANUP_EXPR:
1249 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1250 copy = gimple_build_wce (s1);
1253 case GIMPLE_OMP_PARALLEL:
1254 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1255 copy = gimple_build_omp_parallel
1257 gimple_omp_parallel_clauses (stmt),
1258 gimple_omp_parallel_child_fn (stmt),
1259 gimple_omp_parallel_data_arg (stmt));
1262 case GIMPLE_OMP_TASK:
1263 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1264 copy = gimple_build_omp_task
1266 gimple_omp_task_clauses (stmt),
1267 gimple_omp_task_child_fn (stmt),
1268 gimple_omp_task_data_arg (stmt),
1269 gimple_omp_task_copy_fn (stmt),
1270 gimple_omp_task_arg_size (stmt),
1271 gimple_omp_task_arg_align (stmt));
1274 case GIMPLE_OMP_FOR:
1275 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1276 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1277 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1278 gimple_omp_for_collapse (stmt), s2);
1281 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1283 gimple_omp_for_set_index (copy, i,
1284 gimple_omp_for_index (stmt, i));
1285 gimple_omp_for_set_initial (copy, i,
1286 gimple_omp_for_initial (stmt, i));
1287 gimple_omp_for_set_final (copy, i,
1288 gimple_omp_for_final (stmt, i));
1289 gimple_omp_for_set_incr (copy, i,
1290 gimple_omp_for_incr (stmt, i));
1291 gimple_omp_for_set_cond (copy, i,
1292 gimple_omp_for_cond (stmt, i));
1297 case GIMPLE_OMP_MASTER:
1298 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1299 copy = gimple_build_omp_master (s1);
1302 case GIMPLE_OMP_ORDERED:
1303 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1304 copy = gimple_build_omp_ordered (s1);
1307 case GIMPLE_OMP_SECTION:
1308 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1309 copy = gimple_build_omp_section (s1);
1312 case GIMPLE_OMP_SECTIONS:
1313 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1314 copy = gimple_build_omp_sections
1315 (s1, gimple_omp_sections_clauses (stmt));
1318 case GIMPLE_OMP_SINGLE:
1319 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1320 copy = gimple_build_omp_single
1321 (s1, gimple_omp_single_clauses (stmt));
1324 case GIMPLE_OMP_CRITICAL:
1325 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1327 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1336 if (gimple_assign_copy_p (stmt)
1337 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1338 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1340 /* Here we handle statements that are not completely rewritten.
1341 First we detect some inlining-induced bogosities for
1344 /* Some assignments VAR = VAR; don't generate any rtl code
1345 and thus don't count as variable modification. Avoid
1346 keeping bogosities like 0 = 0. */
1347 tree decl = gimple_assign_lhs (stmt), value;
1350 n = (tree *) pointer_map_contains (id->decl_map, decl);
1354 STRIP_TYPE_NOPS (value);
1355 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1356 return gimple_build_nop ();
1360 if (gimple_debug_bind_p (stmt))
1362 copy = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1363 gimple_debug_bind_get_value (stmt),
1365 VEC_safe_push (gimple, heap, id->debug_stmts, copy);
1369 /* Create a new deep copy of the statement. */
1370 copy = gimple_copy (stmt);
1372 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1373 RESX and EH_DISPATCH. */
1375 switch (gimple_code (copy))
1379 tree r, fndecl = gimple_call_fndecl (copy);
1380 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1381 switch (DECL_FUNCTION_CODE (fndecl))
1383 case BUILT_IN_EH_COPY_VALUES:
1384 r = gimple_call_arg (copy, 1);
1385 r = remap_eh_region_tree_nr (r, id);
1386 gimple_call_set_arg (copy, 1, r);
1389 case BUILT_IN_EH_POINTER:
1390 case BUILT_IN_EH_FILTER:
1391 r = gimple_call_arg (copy, 0);
1392 r = remap_eh_region_tree_nr (r, id);
1393 gimple_call_set_arg (copy, 0, r);
1400 /* Reset alias info if we didn't apply measures to
1401 keep it valid over inlining by setting DECL_PT_UID. */
1402 if (!id->src_cfun->gimple_df
1403 || !id->src_cfun->gimple_df->ipa_pta)
1404 gimple_call_reset_alias_info (copy);
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);
1664 stmt = cgraph_redirect_edge_call_stmt_to_callee (edge);
1668 case CB_CGE_MOVE_CLONES:
1669 cgraph_set_call_stmt_including_clones (id->dst_node,
1671 edge = cgraph_edge (id->dst_node, stmt);
1675 edge = cgraph_edge (id->dst_node, orig_stmt);
1677 cgraph_set_call_stmt (edge, stmt);
1684 /* Constant propagation on argument done during inlining
1685 may create new direct call. Produce an edge for it. */
1687 || (edge->indirect_call
1688 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1689 && is_gimple_call (stmt)
1690 && (fn = gimple_call_fndecl (stmt)) != NULL)
1692 struct cgraph_node *dest = cgraph_node (fn);
1694 /* We have missing edge in the callgraph. This can happen
1695 when previous inlining turned an indirect call into a
1696 direct call by constant propagating arguments or we are
1697 producing dead clone (for further clonning). In all
1698 other cases we hit a bug (incorrect node sharing is the
1699 most common reason for missing edges). */
1700 gcc_assert (dest->needed || !dest->analyzed
1701 || !id->src_node->analyzed);
1702 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1703 cgraph_create_edge_including_clones
1704 (id->dst_node, dest, orig_stmt, stmt, bb->count,
1705 compute_call_stmt_bb_frequency (id->dst_node->decl,
1707 bb->loop_depth, CIF_ORIGINALLY_INDIRECT_CALL);
1709 cgraph_create_edge (id->dst_node, dest, stmt,
1711 compute_call_stmt_bb_frequency
1712 (id->dst_node->decl, copy_basic_block),
1713 bb->loop_depth)->inline_failed
1714 = CIF_ORIGINALLY_INDIRECT_CALL;
1717 fprintf (dump_file, "Created new direct edge to %s",
1718 cgraph_node_name (dest));
1722 flags = gimple_call_flags (stmt);
1723 if (flags & ECF_MAY_BE_ALLOCA)
1724 cfun->calls_alloca = true;
1725 if (flags & ECF_RETURNS_TWICE)
1726 cfun->calls_setjmp = true;
1729 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
1730 id->eh_map, id->eh_lp_nr);
1732 if (gimple_in_ssa_p (cfun) && !is_gimple_debug (stmt))
1737 find_new_referenced_vars (gsi_stmt (copy_gsi));
1738 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1739 if (TREE_CODE (def) == SSA_NAME)
1740 SSA_NAME_DEF_STMT (def) = stmt;
1743 gsi_next (©_gsi);
1745 while (!gsi_end_p (copy_gsi));
1747 copy_gsi = gsi_last_bb (copy_basic_block);
1750 return copy_basic_block;
1753 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1754 form is quite easy, since dominator relationship for old basic blocks does
1757 There is however exception where inlining might change dominator relation
1758 across EH edges from basic block within inlined functions destinating
1759 to landing pads in function we inline into.
1761 The function fills in PHI_RESULTs of such PHI nodes if they refer
1762 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1763 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1764 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1765 set, and this means that there will be no overlapping live ranges
1766 for the underlying symbol.
1768 This might change in future if we allow redirecting of EH edges and
1769 we might want to change way build CFG pre-inlining to include
1770 all the possible edges then. */
1772 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1773 bool can_throw, bool nonlocal_goto)
1778 FOR_EACH_EDGE (e, ei, bb->succs)
1780 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1783 gimple_stmt_iterator si;
1786 gcc_assert (e->flags & EDGE_EH);
1789 gcc_assert (!(e->flags & EDGE_EH));
1791 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1795 phi = gsi_stmt (si);
1797 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1798 gcc_assert (!e->dest->aux);
1800 gcc_assert ((e->flags & EDGE_EH)
1801 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1803 if (!is_gimple_reg (PHI_RESULT (phi)))
1805 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1809 re = find_edge (ret_bb, e->dest);
1811 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1812 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1814 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1815 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1821 /* Copy edges from BB into its copy constructed earlier, scale profile
1822 accordingly. Edges will be taken care of later. Assume aux
1823 pointers to point to the copies of each BB. */
1826 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1828 basic_block new_bb = (basic_block) bb->aux;
1831 gimple_stmt_iterator si;
1834 /* Use the indices from the original blocks to create edges for the
1836 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1837 if (!(old_edge->flags & EDGE_EH))
1841 flags = old_edge->flags;
1843 /* Return edges do get a FALLTHRU flag when the get inlined. */
1844 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1845 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1846 flags |= EDGE_FALLTHRU;
1847 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1848 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1849 new_edge->probability = old_edge->probability;
1852 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1855 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1858 bool can_throw, nonlocal_goto;
1860 copy_stmt = gsi_stmt (si);
1861 if (!is_gimple_debug (copy_stmt))
1863 update_stmt (copy_stmt);
1864 if (gimple_in_ssa_p (cfun))
1865 mark_symbols_for_renaming (copy_stmt);
1868 /* Do this before the possible split_block. */
1871 /* If this tree could throw an exception, there are two
1872 cases where we need to add abnormal edge(s): the
1873 tree wasn't in a region and there is a "current
1874 region" in the caller; or the original tree had
1875 EH edges. In both cases split the block after the tree,
1876 and add abnormal edge(s) as needed; we need both
1877 those from the callee and the caller.
1878 We check whether the copy can throw, because the const
1879 propagation can change an INDIRECT_REF which throws
1880 into a COMPONENT_REF which doesn't. If the copy
1881 can throw, the original could also throw. */
1882 can_throw = stmt_can_throw_internal (copy_stmt);
1883 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1885 if (can_throw || nonlocal_goto)
1887 if (!gsi_end_p (si))
1888 /* Note that bb's predecessor edges aren't necessarily
1889 right at this point; split_block doesn't care. */
1891 edge e = split_block (new_bb, copy_stmt);
1894 new_bb->aux = e->src->aux;
1895 si = gsi_start_bb (new_bb);
1899 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
1900 make_eh_dispatch_edges (copy_stmt);
1902 make_eh_edges (copy_stmt);
1905 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1907 if ((can_throw || nonlocal_goto)
1908 && gimple_in_ssa_p (cfun))
1909 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1910 can_throw, nonlocal_goto);
1914 /* Copy the PHIs. All blocks and edges are copied, some blocks
1915 was possibly split and new outgoing EH edges inserted.
1916 BB points to the block of original function and AUX pointers links
1917 the original and newly copied blocks. */
1920 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1922 basic_block const new_bb = (basic_block) bb->aux;
1925 gimple_stmt_iterator si;
1927 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1933 phi = gsi_stmt (si);
1934 res = PHI_RESULT (phi);
1936 if (is_gimple_reg (res))
1938 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1939 SSA_NAME_DEF_STMT (new_res)
1940 = new_phi = create_phi_node (new_res, new_bb);
1941 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1944 = find_edge ((basic_block) new_edge->src->aux, bb);
1945 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1947 tree block = id->block;
1948 id->block = NULL_TREE;
1949 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1951 gcc_assert (new_arg);
1952 /* With return slot optimization we can end up with
1953 non-gimple (foo *)&this->m, fix that here. */
1954 if (TREE_CODE (new_arg) != SSA_NAME
1955 && TREE_CODE (new_arg) != FUNCTION_DECL
1956 && !is_gimple_val (new_arg))
1958 gimple_seq stmts = NULL;
1959 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1960 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1962 add_phi_arg (new_phi, new_arg, new_edge,
1963 gimple_phi_arg_location_from_edge (phi, old_edge));
1970 /* Wrapper for remap_decl so it can be used as a callback. */
1973 remap_decl_1 (tree decl, void *data)
1975 return remap_decl (decl, (copy_body_data *) data);
1978 /* Build struct function and associated datastructures for the new clone
1979 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1982 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count)
1984 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1985 gcov_type count_scale;
1987 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1988 count_scale = (REG_BR_PROB_BASE * count
1989 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1991 count_scale = REG_BR_PROB_BASE;
1993 /* Register specific tree functions. */
1994 gimple_register_cfg_hooks ();
1996 /* Get clean struct function. */
1997 push_struct_function (new_fndecl);
1999 /* We will rebuild these, so just sanity check that they are empty. */
2000 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2001 gcc_assert (cfun->local_decls == NULL);
2002 gcc_assert (cfun->cfg == NULL);
2003 gcc_assert (cfun->decl == new_fndecl);
2005 /* Copy items we preserve during clonning. */
2006 cfun->static_chain_decl = src_cfun->static_chain_decl;
2007 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2008 cfun->function_end_locus = src_cfun->function_end_locus;
2009 cfun->curr_properties = src_cfun->curr_properties;
2010 cfun->last_verified = src_cfun->last_verified;
2011 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2012 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
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);
2558 /* Handle type-mismatches in the function declaration return type
2559 vs. the call expression. */
2561 caller_type = TREE_TYPE (modify_dest);
2563 caller_type = TREE_TYPE (TREE_TYPE (callee));
2565 /* We don't need to do anything for functions that don't return
2567 if (!result || VOID_TYPE_P (callee_type))
2570 /* If there was a return slot, then the return value is the
2571 dereferenced address of that object. */
2574 /* The front end shouldn't have used both return_slot and
2575 a modify expression. */
2576 gcc_assert (!modify_dest);
2577 if (DECL_BY_REFERENCE (result))
2579 tree return_slot_addr = build_fold_addr_expr (return_slot);
2580 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2582 /* We are going to construct *&return_slot and we can't do that
2583 for variables believed to be not addressable.
2585 FIXME: This check possibly can match, because values returned
2586 via return slot optimization are not believed to have address
2587 taken by alias analysis. */
2588 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2589 if (gimple_in_ssa_p (cfun))
2591 HOST_WIDE_INT bitsize;
2592 HOST_WIDE_INT bitpos;
2594 enum machine_mode mode;
2598 base = get_inner_reference (return_slot, &bitsize, &bitpos,
2600 &mode, &unsignedp, &volatilep,
2602 if (TREE_CODE (base) == INDIRECT_REF)
2603 base = TREE_OPERAND (base, 0);
2604 if (TREE_CODE (base) == SSA_NAME)
2605 base = SSA_NAME_VAR (base);
2606 mark_sym_for_renaming (base);
2608 var = return_slot_addr;
2613 gcc_assert (TREE_CODE (var) != SSA_NAME);
2614 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2616 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2617 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2618 && !DECL_GIMPLE_REG_P (result)
2620 DECL_GIMPLE_REG_P (var) = 0;
2625 /* All types requiring non-trivial constructors should have been handled. */
2626 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2628 /* Attempt to avoid creating a new temporary variable. */
2630 && TREE_CODE (modify_dest) != SSA_NAME)
2632 bool use_it = false;
2634 /* We can't use MODIFY_DEST if there's type promotion involved. */
2635 if (!useless_type_conversion_p (callee_type, caller_type))
2638 /* ??? If we're assigning to a variable sized type, then we must
2639 reuse the destination variable, because we've no good way to
2640 create variable sized temporaries at this point. */
2641 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2644 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2645 reuse it as the result of the call directly. Don't do this if
2646 it would promote MODIFY_DEST to addressable. */
2647 else if (TREE_ADDRESSABLE (result))
2651 tree base_m = get_base_address (modify_dest);
2653 /* If the base isn't a decl, then it's a pointer, and we don't
2654 know where that's going to go. */
2655 if (!DECL_P (base_m))
2657 else if (is_global_var (base_m))
2659 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2660 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2661 && !DECL_GIMPLE_REG_P (result)
2662 && DECL_GIMPLE_REG_P (base_m))
2664 else if (!TREE_ADDRESSABLE (base_m))
2676 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2678 var = copy_result_decl_to_var (result, id);
2679 if (gimple_in_ssa_p (cfun))
2682 add_referenced_var (var);
2685 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2686 DECL_STRUCT_FUNCTION (caller)->local_decls
2687 = tree_cons (NULL_TREE, var,
2688 DECL_STRUCT_FUNCTION (caller)->local_decls);
2690 /* Do not have the rest of GCC warn about this variable as it should
2691 not be visible to the user. */
2692 TREE_NO_WARNING (var) = 1;
2694 declare_inline_vars (id->block, var);
2696 /* Build the use expr. If the return type of the function was
2697 promoted, convert it back to the expected type. */
2699 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2700 use = fold_convert (caller_type, var);
2702 STRIP_USELESS_TYPE_CONVERSION (use);
2704 if (DECL_BY_REFERENCE (result))
2706 TREE_ADDRESSABLE (var) = 1;
2707 var = build_fold_addr_expr (var);
2711 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2712 way, when the RESULT_DECL is encountered, it will be
2713 automatically replaced by the VAR_DECL. */
2714 insert_decl_map (id, result, var);
2716 /* Remember this so we can ignore it in remap_decls. */
2722 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2723 to a local label. */
2726 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2729 tree fn = (tree) fnp;
2731 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2740 /* Determine if the function can be copied. If so return NULL. If
2741 not return a string describng the reason for failure. */
2744 copy_forbidden (struct function *fun, tree fndecl)
2746 const char *reason = fun->cannot_be_copied_reason;
2749 /* Only examine the function once. */
2750 if (fun->cannot_be_copied_set)
2753 /* We cannot copy a function that receives a non-local goto
2754 because we cannot remap the destination label used in the
2755 function that is performing the non-local goto. */
2756 /* ??? Actually, this should be possible, if we work at it.
2757 No doubt there's just a handful of places that simply
2758 assume it doesn't happen and don't substitute properly. */
2759 if (fun->has_nonlocal_label)
2761 reason = G_("function %q+F can never be copied "
2762 "because it receives a non-local goto");
2766 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2768 tree decl = TREE_VALUE (step);
2770 if (TREE_CODE (decl) == VAR_DECL
2771 && TREE_STATIC (decl)
2772 && !DECL_EXTERNAL (decl)
2773 && DECL_INITIAL (decl)
2774 && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2775 has_label_address_in_static_1,
2778 reason = G_("function %q+F can never be copied because it saves "
2779 "address of local label in a static variable");
2785 fun->cannot_be_copied_reason = reason;
2786 fun->cannot_be_copied_set = true;
2791 static const char *inline_forbidden_reason;
2793 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2794 iff a function can not be inlined. Also sets the reason why. */
2797 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2798 struct walk_stmt_info *wip)
2800 tree fn = (tree) wip->info;
2802 gimple stmt = gsi_stmt (*gsi);
2804 switch (gimple_code (stmt))
2807 /* Refuse to inline alloca call unless user explicitly forced so as
2808 this may change program's memory overhead drastically when the
2809 function using alloca is called in loop. In GCC present in
2810 SPEC2000 inlining into schedule_block cause it to require 2GB of
2811 RAM instead of 256MB. */
2812 if (gimple_alloca_call_p (stmt)
2813 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2815 inline_forbidden_reason
2816 = G_("function %q+F can never be inlined because it uses "
2817 "alloca (override using the always_inline attribute)");
2818 *handled_ops_p = true;
2822 t = gimple_call_fndecl (stmt);
2826 /* We cannot inline functions that call setjmp. */
2827 if (setjmp_call_p (t))
2829 inline_forbidden_reason
2830 = G_("function %q+F can never be inlined because it uses setjmp");
2831 *handled_ops_p = true;
2835 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2836 switch (DECL_FUNCTION_CODE (t))
2838 /* We cannot inline functions that take a variable number of
2840 case BUILT_IN_VA_START:
2841 case BUILT_IN_NEXT_ARG:
2842 case BUILT_IN_VA_END:
2843 inline_forbidden_reason
2844 = G_("function %q+F can never be inlined because it "
2845 "uses variable argument lists");
2846 *handled_ops_p = true;
2849 case BUILT_IN_LONGJMP:
2850 /* We can't inline functions that call __builtin_longjmp at
2851 all. The non-local goto machinery really requires the
2852 destination be in a different function. If we allow the
2853 function calling __builtin_longjmp to be inlined into the
2854 function calling __builtin_setjmp, Things will Go Awry. */
2855 inline_forbidden_reason
2856 = G_("function %q+F can never be inlined because "
2857 "it uses setjmp-longjmp exception handling");
2858 *handled_ops_p = true;
2861 case BUILT_IN_NONLOCAL_GOTO:
2863 inline_forbidden_reason
2864 = G_("function %q+F can never be inlined because "
2865 "it uses non-local goto");
2866 *handled_ops_p = true;
2869 case BUILT_IN_RETURN:
2870 case BUILT_IN_APPLY_ARGS:
2871 /* If a __builtin_apply_args caller would be inlined,
2872 it would be saving arguments of the function it has
2873 been inlined into. Similarly __builtin_return would
2874 return from the function the inline has been inlined into. */
2875 inline_forbidden_reason
2876 = G_("function %q+F can never be inlined because "
2877 "it uses __builtin_return or __builtin_apply_args");
2878 *handled_ops_p = true;
2887 t = gimple_goto_dest (stmt);
2889 /* We will not inline a function which uses computed goto. The
2890 addresses of its local labels, which may be tucked into
2891 global storage, are of course not constant across
2892 instantiations, which causes unexpected behavior. */
2893 if (TREE_CODE (t) != LABEL_DECL)
2895 inline_forbidden_reason
2896 = G_("function %q+F can never be inlined "
2897 "because it contains a computed goto");
2898 *handled_ops_p = true;
2907 *handled_ops_p = false;
2911 /* Return true if FNDECL is a function that cannot be inlined into
2915 inline_forbidden_p (tree fndecl)
2917 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2918 struct walk_stmt_info wi;
2919 struct pointer_set_t *visited_nodes;
2921 bool forbidden_p = false;
2923 /* First check for shared reasons not to copy the code. */
2924 inline_forbidden_reason = copy_forbidden (fun, fndecl);
2925 if (inline_forbidden_reason != NULL)
2928 /* Next, walk the statements of the function looking for
2929 constraucts we can't handle, or are non-optimal for inlining. */
2930 visited_nodes = pointer_set_create ();
2931 memset (&wi, 0, sizeof (wi));
2932 wi.info = (void *) fndecl;
2933 wi.pset = visited_nodes;
2935 FOR_EACH_BB_FN (bb, fun)
2938 gimple_seq seq = bb_seq (bb);
2939 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
2940 forbidden_p = (ret != NULL);
2945 pointer_set_destroy (visited_nodes);
2949 /* Returns nonzero if FN is a function that does not have any
2950 fundamental inline blocking properties. */
2953 tree_inlinable_function_p (tree fn)
2955 bool inlinable = true;
2959 /* If we've already decided this function shouldn't be inlined,
2960 there's no need to check again. */
2961 if (DECL_UNINLINABLE (fn))
2964 /* We only warn for functions declared `inline' by the user. */
2965 do_warning = (warn_inline
2966 && DECL_DECLARED_INLINE_P (fn)
2967 && !DECL_NO_INLINE_WARNING_P (fn)
2968 && !DECL_IN_SYSTEM_HEADER (fn));
2970 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2973 && always_inline == NULL)
2976 warning (OPT_Winline, "function %q+F can never be inlined because it "
2977 "is suppressed using -fno-inline", fn);
2981 /* Don't auto-inline anything that might not be bound within
2982 this unit of translation. */
2983 else if (!DECL_DECLARED_INLINE_P (fn)
2984 && DECL_REPLACEABLE_P (fn))
2987 else if (!function_attribute_inlinable_p (fn))
2990 warning (OPT_Winline, "function %q+F can never be inlined because it "
2991 "uses attributes conflicting with inlining", fn);
2995 else if (inline_forbidden_p (fn))
2997 /* See if we should warn about uninlinable functions. Previously,
2998 some of these warnings would be issued while trying to expand
2999 the function inline, but that would cause multiple warnings
3000 about functions that would for example call alloca. But since
3001 this a property of the function, just one warning is enough.
3002 As a bonus we can now give more details about the reason why a
3003 function is not inlinable. */
3005 sorry (inline_forbidden_reason, fn);
3006 else if (do_warning)
3007 warning (OPT_Winline, inline_forbidden_reason, fn);
3012 /* Squirrel away the result so that we don't have to check again. */
3013 DECL_UNINLINABLE (fn) = !inlinable;
3018 /* Estimate the cost of a memory move. Use machine dependent
3019 word size and take possible memcpy call into account. */
3022 estimate_move_cost (tree type)
3026 gcc_assert (!VOID_TYPE_P (type));
3028 size = int_size_in_bytes (type);
3030 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
3031 /* Cost of a memcpy call, 3 arguments and the call. */
3034 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3037 /* Returns cost of operation CODE, according to WEIGHTS */
3040 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3041 tree op1 ATTRIBUTE_UNUSED, tree op2)
3045 /* These are "free" conversions, or their presumed cost
3046 is folded into other operations. */
3053 /* Assign cost of 1 to usual operations.
3054 ??? We may consider mapping RTL costs to this. */
3059 case POINTER_PLUS_EXPR:
3063 case ADDR_SPACE_CONVERT_EXPR:
3064 case FIXED_CONVERT_EXPR:
3065 case FIX_TRUNC_EXPR:
3077 case VEC_LSHIFT_EXPR:
3078 case VEC_RSHIFT_EXPR:
3085 case TRUTH_ANDIF_EXPR:
3086 case TRUTH_ORIF_EXPR:
3087 case TRUTH_AND_EXPR:
3089 case TRUTH_XOR_EXPR:
3090 case TRUTH_NOT_EXPR:
3099 case UNORDERED_EXPR:
3110 case PREDECREMENT_EXPR:
3111 case PREINCREMENT_EXPR:
3112 case POSTDECREMENT_EXPR:
3113 case POSTINCREMENT_EXPR:
3115 case REALIGN_LOAD_EXPR:
3117 case REDUC_MAX_EXPR:
3118 case REDUC_MIN_EXPR:
3119 case REDUC_PLUS_EXPR:
3120 case WIDEN_SUM_EXPR:
3121 case WIDEN_MULT_EXPR:
3124 case VEC_WIDEN_MULT_HI_EXPR:
3125 case VEC_WIDEN_MULT_LO_EXPR:
3126 case VEC_UNPACK_HI_EXPR:
3127 case VEC_UNPACK_LO_EXPR:
3128 case VEC_UNPACK_FLOAT_HI_EXPR:
3129 case VEC_UNPACK_FLOAT_LO_EXPR:
3130 case VEC_PACK_TRUNC_EXPR:
3131 case VEC_PACK_SAT_EXPR:
3132 case VEC_PACK_FIX_TRUNC_EXPR:
3133 case VEC_EXTRACT_EVEN_EXPR:
3134 case VEC_EXTRACT_ODD_EXPR:
3135 case VEC_INTERLEAVE_HIGH_EXPR:
3136 case VEC_INTERLEAVE_LOW_EXPR:
3140 /* Few special cases of expensive operations. This is useful
3141 to avoid inlining on functions having too many of these. */
3142 case TRUNC_DIV_EXPR:
3144 case FLOOR_DIV_EXPR:
3145 case ROUND_DIV_EXPR:
3146 case EXACT_DIV_EXPR:
3147 case TRUNC_MOD_EXPR:
3149 case FLOOR_MOD_EXPR:
3150 case ROUND_MOD_EXPR:
3152 if (TREE_CODE (op2) != INTEGER_CST)
3153 return weights->div_mod_cost;
3157 /* We expect a copy assignment with no operator. */
3158 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
3164 /* Estimate number of instructions that will be created by expanding
3165 the statements in the statement sequence STMTS.
3166 WEIGHTS contains weights attributed to various constructs. */
3169 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
3172 gimple_stmt_iterator gsi;
3175 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
3176 cost += estimate_num_insns (gsi_stmt (gsi), weights);
3182 /* Estimate number of instructions that will be created by expanding STMT.
3183 WEIGHTS contains weights attributed to various constructs. */
3186 estimate_num_insns (gimple stmt, eni_weights *weights)
3189 enum gimple_code code = gimple_code (stmt);
3196 /* Try to estimate the cost of assignments. We have three cases to
3198 1) Simple assignments to registers;
3199 2) Stores to things that must live in memory. This includes
3200 "normal" stores to scalars, but also assignments of large
3201 structures, or constructors of big arrays;
3203 Let us look at the first two cases, assuming we have "a = b + C":
3204 <GIMPLE_ASSIGN <var_decl "a">
3205 <plus_expr <var_decl "b"> <constant C>>
3206 If "a" is a GIMPLE register, the assignment to it is free on almost
3207 any target, because "a" usually ends up in a real register. Hence
3208 the only cost of this expression comes from the PLUS_EXPR, and we
3209 can ignore the GIMPLE_ASSIGN.
3210 If "a" is not a GIMPLE register, the assignment to "a" will most
3211 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3212 of moving something into "a", which we compute using the function
3213 estimate_move_cost. */
3214 lhs = gimple_assign_lhs (stmt);
3215 rhs = gimple_assign_rhs1 (stmt);
3217 if (is_gimple_reg (lhs))
3220 cost = estimate_move_cost (TREE_TYPE (lhs));
3222 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3223 cost += estimate_move_cost (TREE_TYPE (rhs));
3225 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3226 gimple_assign_rhs1 (stmt),
3227 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3228 == GIMPLE_BINARY_RHS
3229 ? gimple_assign_rhs2 (stmt) : NULL);
3233 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3234 gimple_op (stmt, 0),
3235 gimple_op (stmt, 1));
3239 /* Take into account cost of the switch + guess 2 conditional jumps for
3242 TODO: once the switch expansion logic is sufficiently separated, we can
3243 do better job on estimating cost of the switch. */
3244 if (weights->time_based)
3245 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3247 cost = gimple_switch_num_labels (stmt) * 2;
3252 tree decl = gimple_call_fndecl (stmt);
3253 tree addr = gimple_call_fn (stmt);
3254 tree funtype = TREE_TYPE (addr);
3256 if (POINTER_TYPE_P (funtype))
3257 funtype = TREE_TYPE (funtype);
3259 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3260 cost = weights->target_builtin_call_cost;
3262 cost = weights->call_cost;
3264 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3265 switch (DECL_FUNCTION_CODE (decl))
3267 /* Builtins that expand to constants. */
3268 case BUILT_IN_CONSTANT_P:
3269 case BUILT_IN_EXPECT:
3270 case BUILT_IN_OBJECT_SIZE:
3271 case BUILT_IN_UNREACHABLE:
3272 /* Simple register moves or loads from stack. */
3273 case BUILT_IN_RETURN_ADDRESS:
3274 case BUILT_IN_EXTRACT_RETURN_ADDR:
3275 case BUILT_IN_FROB_RETURN_ADDR:
3276 case BUILT_IN_RETURN:
3277 case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
3278 case BUILT_IN_FRAME_ADDRESS:
3279 case BUILT_IN_VA_END:
3280 case BUILT_IN_STACK_SAVE:
3281 case BUILT_IN_STACK_RESTORE:
3282 /* Exception state returns or moves registers around. */
3283 case BUILT_IN_EH_FILTER:
3284 case BUILT_IN_EH_POINTER:
3285 case BUILT_IN_EH_COPY_VALUES:
3288 /* builtins that are not expensive (that is they are most probably
3289 expanded inline into resonably simple code). */
3291 case BUILT_IN_ALLOCA:
3292 case BUILT_IN_BSWAP32:
3293 case BUILT_IN_BSWAP64:
3295 case BUILT_IN_CLZIMAX:
3297 case BUILT_IN_CLZLL:
3299 case BUILT_IN_CTZIMAX:
3301 case BUILT_IN_CTZLL:
3303 case BUILT_IN_FFSIMAX:
3305 case BUILT_IN_FFSLL:
3306 case BUILT_IN_IMAXABS:
3307 case BUILT_IN_FINITE:
3308 case BUILT_IN_FINITEF:
3309 case BUILT_IN_FINITEL:
3310 case BUILT_IN_FINITED32:
3311 case BUILT_IN_FINITED64:
3312 case BUILT_IN_FINITED128:
3313 case BUILT_IN_FPCLASSIFY:
3314 case BUILT_IN_ISFINITE:
3315 case BUILT_IN_ISINF_SIGN:
3316 case BUILT_IN_ISINF:
3317 case BUILT_IN_ISINFF:
3318 case BUILT_IN_ISINFL:
3319 case BUILT_IN_ISINFD32:
3320 case BUILT_IN_ISINFD64:
3321 case BUILT_IN_ISINFD128:
3322 case BUILT_IN_ISNAN:
3323 case BUILT_IN_ISNANF:
3324 case BUILT_IN_ISNANL:
3325 case BUILT_IN_ISNAND32:
3326 case BUILT_IN_ISNAND64:
3327 case BUILT_IN_ISNAND128:
3328 case BUILT_IN_ISNORMAL:
3329 case BUILT_IN_ISGREATER:
3330 case BUILT_IN_ISGREATEREQUAL:
3331 case BUILT_IN_ISLESS:
3332 case BUILT_IN_ISLESSEQUAL:
3333 case BUILT_IN_ISLESSGREATER:
3334 case BUILT_IN_ISUNORDERED:
3335 case BUILT_IN_VA_ARG_PACK:
3336 case BUILT_IN_VA_ARG_PACK_LEN:
3337 case BUILT_IN_VA_COPY:
3339 case BUILT_IN_SAVEREGS:
3340 case BUILT_IN_POPCOUNTL:
3341 case BUILT_IN_POPCOUNTLL:
3342 case BUILT_IN_POPCOUNTIMAX:
3343 case BUILT_IN_POPCOUNT:
3344 case BUILT_IN_PARITYL:
3345 case BUILT_IN_PARITYLL:
3346 case BUILT_IN_PARITYIMAX:
3347 case BUILT_IN_PARITY:
3349 case BUILT_IN_LLABS:
3350 case BUILT_IN_PREFETCH:
3351 cost = weights->target_builtin_call_cost;
3359 funtype = TREE_TYPE (decl);
3361 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3362 cost += estimate_move_cost (TREE_TYPE (funtype));
3363 /* Our cost must be kept in sync with
3364 cgraph_estimate_size_after_inlining that does use function
3365 declaration to figure out the arguments. */
3366 if (decl && DECL_ARGUMENTS (decl))
3369 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3370 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3371 cost += estimate_move_cost (TREE_TYPE (arg));
3373 else if (funtype && prototype_p (funtype))
3376 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3378 if (!VOID_TYPE_P (TREE_VALUE (t)))
3379 cost += estimate_move_cost (TREE_VALUE (t));
3383 for (i = 0; i < gimple_call_num_args (stmt); i++)
3385 tree arg = gimple_call_arg (stmt, i);
3386 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3387 cost += estimate_move_cost (TREE_TYPE (arg));
3399 case GIMPLE_PREDICT:
3404 return asm_str_count (gimple_asm_string (stmt));
3407 /* This is either going to be an external function call with one
3408 argument, or two register copy statements plus a goto. */
3411 case GIMPLE_EH_DISPATCH:
3412 /* ??? This is going to turn into a switch statement. Ideally
3413 we'd have a look at the eh region and estimate the number of
3418 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3420 case GIMPLE_EH_FILTER:
3421 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3424 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3427 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3428 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3430 /* OpenMP directives are generally very expensive. */
3432 case GIMPLE_OMP_RETURN:
3433 case GIMPLE_OMP_SECTIONS_SWITCH:
3434 case GIMPLE_OMP_ATOMIC_STORE:
3435 case GIMPLE_OMP_CONTINUE:
3436 /* ...except these, which are cheap. */
3439 case GIMPLE_OMP_ATOMIC_LOAD:
3440 return weights->omp_cost;
3442 case GIMPLE_OMP_FOR:
3443 return (weights->omp_cost
3444 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3445 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3447 case GIMPLE_OMP_PARALLEL:
3448 case GIMPLE_OMP_TASK:
3449 case GIMPLE_OMP_CRITICAL:
3450 case GIMPLE_OMP_MASTER:
3451 case GIMPLE_OMP_ORDERED:
3452 case GIMPLE_OMP_SECTION:
3453 case GIMPLE_OMP_SECTIONS:
3454 case GIMPLE_OMP_SINGLE:
3455 return (weights->omp_cost
3456 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3465 /* Estimate number of instructions that will be created by expanding
3466 function FNDECL. WEIGHTS contains weights attributed to various
3470 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3472 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3473 gimple_stmt_iterator bsi;
3477 gcc_assert (my_function && my_function->cfg);
3478 FOR_EACH_BB_FN (bb, my_function)
3480 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3481 n += estimate_num_insns (gsi_stmt (bsi), weights);
3488 /* Initializes weights used by estimate_num_insns. */
3491 init_inline_once (void)
3493 eni_size_weights.call_cost = 1;
3494 eni_size_weights.target_builtin_call_cost = 1;
3495 eni_size_weights.div_mod_cost = 1;
3496 eni_size_weights.omp_cost = 40;
3497 eni_size_weights.time_based = false;
3499 /* Estimating time for call is difficult, since we have no idea what the
3500 called function does. In the current uses of eni_time_weights,
3501 underestimating the cost does less harm than overestimating it, so
3502 we choose a rather small value here. */
3503 eni_time_weights.call_cost = 10;
3504 eni_time_weights.target_builtin_call_cost = 10;
3505 eni_time_weights.div_mod_cost = 10;
3506 eni_time_weights.omp_cost = 40;
3507 eni_time_weights.time_based = true;
3510 /* Estimate the number of instructions in a gimple_seq. */
3513 count_insns_seq (gimple_seq seq, eni_weights *weights)
3515 gimple_stmt_iterator gsi;
3517 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3518 n += estimate_num_insns (gsi_stmt (gsi), weights);
3524 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3527 prepend_lexical_block (tree current_block, tree new_block)
3529 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3530 BLOCK_SUBBLOCKS (current_block) = new_block;
3531 BLOCK_SUPERCONTEXT (new_block) = current_block;
3534 /* Fetch callee declaration from the call graph edge going from NODE and
3535 associated with STMR call statement. Return NULL_TREE if not found. */
3537 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3539 struct cgraph_edge *cs;
3541 cs = cgraph_edge (node, stmt);
3543 return cs->callee->decl;
3548 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3551 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3555 struct pointer_map_t *st, *dst;
3558 location_t saved_location;
3559 struct cgraph_edge *cg_edge;
3560 cgraph_inline_failed_t reason;
3561 basic_block return_block;
3563 gimple_stmt_iterator gsi, stmt_gsi;
3564 bool successfully_inlined = FALSE;
3565 bool purge_dead_abnormal_edges;
3569 /* Set input_location here so we get the right instantiation context
3570 if we call instantiate_decl from inlinable_function_p. */
3571 saved_location = input_location;
3572 if (gimple_has_location (stmt))
3573 input_location = gimple_location (stmt);
3575 /* From here on, we're only interested in CALL_EXPRs. */
3576 if (gimple_code (stmt) != GIMPLE_CALL)
3579 /* First, see if we can figure out what function is being called.
3580 If we cannot, then there is no hope of inlining the function. */
3581 fn = gimple_call_fndecl (stmt);
3584 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3589 /* Turn forward declarations into real ones. */
3590 fn = cgraph_node (fn)->decl;
3592 /* If FN is a declaration of a function in a nested scope that was
3593 globally declared inline, we don't set its DECL_INITIAL.
3594 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3595 C++ front-end uses it for cdtors to refer to their internal
3596 declarations, that are not real functions. Fortunately those
3597 don't have trees to be saved, so we can tell by checking their
3599 if (!DECL_INITIAL (fn)
3600 && DECL_ABSTRACT_ORIGIN (fn)
3601 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3602 fn = DECL_ABSTRACT_ORIGIN (fn);
3604 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3605 Kill this check once this is fixed. */
3606 if (!id->dst_node->analyzed)
3609 cg_edge = cgraph_edge (id->dst_node, stmt);
3611 /* Don't inline functions with different EH personalities. */
3612 if (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3613 && DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)
3614 && (DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3615 != DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl)))
3618 /* Don't try to inline functions that are not well-suited to
3620 if (!cgraph_inline_p (cg_edge, &reason))
3622 /* If this call was originally indirect, we do not want to emit any
3623 inlining related warnings or sorry messages because there are no
3624 guarantees regarding those. */
3625 if (cg_edge->indirect_call)
3628 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3629 /* Avoid warnings during early inline pass. */
3630 && cgraph_global_info_ready)
3632 sorry ("inlining failed in call to %q+F: %s", fn,
3633 cgraph_inline_failed_string (reason));
3634 sorry ("called from here");
3636 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3637 && !DECL_IN_SYSTEM_HEADER (fn)
3638 && reason != CIF_UNSPECIFIED
3639 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3640 /* Avoid warnings during early inline pass. */
3641 && cgraph_global_info_ready)
3643 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3644 fn, cgraph_inline_failed_string (reason));
3645 warning (OPT_Winline, "called from here");
3649 fn = cg_edge->callee->decl;
3651 #ifdef ENABLE_CHECKING
3652 if (cg_edge->callee->decl != id->dst_node->decl)
3653 verify_cgraph_node (cg_edge->callee);
3656 /* We will be inlining this callee. */
3657 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
3659 /* Update the callers EH personality. */
3660 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
3661 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
3662 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
3664 /* Split the block holding the GIMPLE_CALL. */
3665 e = split_block (bb, stmt);
3667 return_block = e->dest;
3670 /* split_block splits after the statement; work around this by
3671 moving the call into the second block manually. Not pretty,
3672 but seems easier than doing the CFG manipulation by hand
3673 when the GIMPLE_CALL is in the last statement of BB. */
3674 stmt_gsi = gsi_last_bb (bb);
3675 gsi_remove (&stmt_gsi, false);
3677 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3678 been the source of abnormal edges. In this case, schedule
3679 the removal of dead abnormal edges. */
3680 gsi = gsi_start_bb (return_block);
3681 if (gsi_end_p (gsi))
3683 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3684 purge_dead_abnormal_edges = true;
3688 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3689 purge_dead_abnormal_edges = false;
3692 stmt_gsi = gsi_start_bb (return_block);
3694 /* Build a block containing code to initialize the arguments, the
3695 actual inline expansion of the body, and a label for the return
3696 statements within the function to jump to. The type of the
3697 statement expression is the return type of the function call. */
3698 id->block = make_node (BLOCK);
3699 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3700 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3701 prepend_lexical_block (gimple_block (stmt), id->block);
3703 /* Local declarations will be replaced by their equivalents in this
3706 id->decl_map = pointer_map_create ();
3707 dst = id->debug_map;
3708 id->debug_map = NULL;
3710 /* Record the function we are about to inline. */
3712 id->src_node = cg_edge->callee;
3713 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3714 id->gimple_call = stmt;
3716 gcc_assert (!id->src_cfun->after_inlining);
3719 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3721 gimple_stmt_iterator si = gsi_last_bb (bb);
3722 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3726 initialize_inlined_parameters (id, stmt, fn, bb);
3728 if (DECL_INITIAL (fn))
3729 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3731 /* Return statements in the function body will be replaced by jumps
3732 to the RET_LABEL. */
3733 gcc_assert (DECL_INITIAL (fn));
3734 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3736 /* Find the LHS to which the result of this call is assigned. */
3738 if (gimple_call_lhs (stmt))
3740 modify_dest = gimple_call_lhs (stmt);
3742 /* The function which we are inlining might not return a value,
3743 in which case we should issue a warning that the function
3744 does not return a value. In that case the optimizers will
3745 see that the variable to which the value is assigned was not
3746 initialized. We do not want to issue a warning about that
3747 uninitialized variable. */
3748 if (DECL_P (modify_dest))
3749 TREE_NO_WARNING (modify_dest) = 1;
3751 if (gimple_call_return_slot_opt_p (stmt))
3753 return_slot = modify_dest;
3760 /* If we are inlining a call to the C++ operator new, we don't want
3761 to use type based alias analysis on the return value. Otherwise
3762 we may get confused if the compiler sees that the inlined new
3763 function returns a pointer which was just deleted. See bug
3765 if (DECL_IS_OPERATOR_NEW (fn))
3771 /* Declare the return variable for the function. */
3772 use_retvar = declare_return_variable (id, return_slot, modify_dest);
3774 /* Add local vars in this inlined callee to caller. */
3775 t_step = id->src_cfun->local_decls;
3776 for (; t_step; t_step = TREE_CHAIN (t_step))
3778 var = TREE_VALUE (t_step);
3779 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3781 if (var_ann (var) && add_referenced_var (var))
3782 cfun->local_decls = tree_cons (NULL_TREE, var,
3785 else if (!can_be_nonlocal (var, id))
3786 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3790 if (dump_file && (dump_flags & TDF_DETAILS))
3792 fprintf (dump_file, "Inlining ");
3793 print_generic_expr (dump_file, id->src_fn, 0);
3794 fprintf (dump_file, " to ");
3795 print_generic_expr (dump_file, id->dst_fn, 0);
3796 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
3799 /* This is it. Duplicate the callee body. Assume callee is
3800 pre-gimplified. Note that we must not alter the caller
3801 function in any way before this point, as this CALL_EXPR may be
3802 a self-referential call; if we're calling ourselves, we need to
3803 duplicate our body before altering anything. */
3804 copy_body (id, bb->count,
3805 cg_edge->frequency * REG_BR_PROB_BASE / CGRAPH_FREQ_BASE,
3808 /* Reset the escaped solution. */
3809 if (cfun->gimple_df)
3810 pt_solution_reset (&cfun->gimple_df->escaped);
3815 pointer_map_destroy (id->debug_map);
3816 id->debug_map = dst;
3818 pointer_map_destroy (id->decl_map);
3821 /* Unlink the calls virtual operands before replacing it. */
3822 unlink_stmt_vdef (stmt);
3824 /* If the inlined function returns a result that we care about,
3825 substitute the GIMPLE_CALL with an assignment of the return
3826 variable to the LHS of the call. That is, if STMT was
3827 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3828 if (use_retvar && gimple_call_lhs (stmt))
3830 gimple old_stmt = stmt;
3831 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3832 gsi_replace (&stmt_gsi, stmt, false);
3833 if (gimple_in_ssa_p (cfun))
3834 mark_symbols_for_renaming (stmt);
3835 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3839 /* Handle the case of inlining a function with no return
3840 statement, which causes the return value to become undefined. */
3841 if (gimple_call_lhs (stmt)
3842 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3844 tree name = gimple_call_lhs (stmt);
3845 tree var = SSA_NAME_VAR (name);
3846 tree def = gimple_default_def (cfun, var);
3850 /* If the variable is used undefined, make this name
3851 undefined via a move. */
3852 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3853 gsi_replace (&stmt_gsi, stmt, true);
3857 /* Otherwise make this variable undefined. */
3858 gsi_remove (&stmt_gsi, true);
3859 set_default_def (var, name);
3860 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3864 gsi_remove (&stmt_gsi, true);
3867 if (purge_dead_abnormal_edges)
3868 gimple_purge_dead_abnormal_call_edges (return_block);
3870 /* If the value of the new expression is ignored, that's OK. We
3871 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3872 the equivalent inlined version either. */
3873 if (is_gimple_assign (stmt))
3875 gcc_assert (gimple_assign_single_p (stmt)
3876 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3877 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3880 /* Output the inlining info for this abstract function, since it has been
3881 inlined. If we don't do this now, we can lose the information about the
3882 variables in the function when the blocks get blown away as soon as we
3883 remove the cgraph node. */
3884 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3886 /* Update callgraph if needed. */
3887 cgraph_remove_node (cg_edge->callee);
3889 id->block = NULL_TREE;
3890 successfully_inlined = TRUE;
3893 input_location = saved_location;
3894 return successfully_inlined;
3897 /* Expand call statements reachable from STMT_P.
3898 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3899 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3900 unfortunately not use that function here because we need a pointer
3901 to the CALL_EXPR, not the tree itself. */
3904 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
3906 gimple_stmt_iterator gsi;
3908 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3910 gimple stmt = gsi_stmt (gsi);
3912 if (is_gimple_call (stmt)
3913 && expand_call_inline (bb, stmt, id))
3921 /* Walk all basic blocks created after FIRST and try to fold every statement
3922 in the STATEMENTS pointer set. */
3925 fold_marked_statements (int first, struct pointer_set_t *statements)
3927 for (; first < n_basic_blocks; first++)
3928 if (BASIC_BLOCK (first))
3930 gimple_stmt_iterator gsi;
3932 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
3935 if (pointer_set_contains (statements, gsi_stmt (gsi)))
3937 gimple old_stmt = gsi_stmt (gsi);
3938 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
3940 if (old_decl && DECL_BUILT_IN (old_decl))
3942 /* Folding builtins can create multiple instructions,
3943 we need to look at all of them. */
3944 gimple_stmt_iterator i2 = gsi;
3946 if (fold_stmt (&gsi))
3950 i2 = gsi_start_bb (BASIC_BLOCK (first));
3955 new_stmt = gsi_stmt (i2);
3956 update_stmt (new_stmt);
3957 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3960 if (new_stmt == gsi_stmt (gsi))
3962 /* It is okay to check only for the very last
3963 of these statements. If it is a throwing
3964 statement nothing will change. If it isn't
3965 this can remove EH edges. If that weren't
3966 correct then because some intermediate stmts
3967 throw, but not the last one. That would mean
3968 we'd have to split the block, which we can't
3969 here and we'd loose anyway. And as builtins
3970 probably never throw, this all
3972 if (maybe_clean_or_replace_eh_stmt (old_stmt,
3974 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3981 else if (fold_stmt (&gsi))
3983 /* Re-read the statement from GSI as fold_stmt() may
3985 gimple new_stmt = gsi_stmt (gsi);
3986 update_stmt (new_stmt);
3988 if (is_gimple_call (old_stmt)
3989 || is_gimple_call (new_stmt))
3990 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
3993 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
3994 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
4000 /* Return true if BB has at least one abnormal outgoing edge. */
4003 has_abnormal_outgoing_edge_p (basic_block bb)
4008 FOR_EACH_EDGE (e, ei, bb->succs)
4009 if (e->flags & EDGE_ABNORMAL)
4015 /* Expand calls to inline functions in the body of FN. */
4018 optimize_inline_calls (tree fn)
4022 int last = n_basic_blocks;
4023 struct gimplify_ctx gctx;
4025 /* There is no point in performing inlining if errors have already
4026 occurred -- and we might crash if we try to inline invalid
4028 if (errorcount || sorrycount)
4032 memset (&id, 0, sizeof (id));
4034 id.src_node = id.dst_node = cgraph_node (fn);
4036 /* Or any functions that aren't finished yet. */
4037 if (current_function_decl)
4038 id.dst_fn = current_function_decl;
4040 id.copy_decl = copy_decl_maybe_to_var;
4041 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4042 id.transform_new_cfg = false;
4043 id.transform_return_to_modify = true;
4044 id.transform_lang_insert_block = NULL;
4045 id.statements_to_fold = pointer_set_create ();
4047 push_gimplify_context (&gctx);
4049 /* We make no attempts to keep dominance info up-to-date. */
4050 free_dominance_info (CDI_DOMINATORS);
4051 free_dominance_info (CDI_POST_DOMINATORS);
4053 /* Register specific gimple functions. */
4054 gimple_register_cfg_hooks ();
4056 /* Reach the trees by walking over the CFG, and note the
4057 enclosing basic-blocks in the call edges. */
4058 /* We walk the blocks going forward, because inlined function bodies
4059 will split id->current_basic_block, and the new blocks will
4060 follow it; we'll trudge through them, processing their CALL_EXPRs
4063 gimple_expand_calls_inline (bb, &id);
4065 pop_gimplify_context (NULL);
4067 #ifdef ENABLE_CHECKING
4069 struct cgraph_edge *e;
4071 verify_cgraph_node (id.dst_node);
4073 /* Double check that we inlined everything we are supposed to inline. */
4074 for (e = id.dst_node->callees; e; e = e->next_callee)
4075 gcc_assert (e->inline_failed);
4079 /* Fold the statements before compacting/renumbering the basic blocks. */
4080 fold_marked_statements (last, id.statements_to_fold);
4081 pointer_set_destroy (id.statements_to_fold);
4083 gcc_assert (!id.debug_stmts);
4085 /* Renumber the (code) basic_blocks consecutively. */
4087 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4090 fold_cond_expr_cond ();
4091 delete_unreachable_blocks_update_callgraph (&id);
4092 #ifdef ENABLE_CHECKING
4093 verify_cgraph_node (id.dst_node);
4096 /* It would be nice to check SSA/CFG/statement consistency here, but it is
4097 not possible yet - the IPA passes might make various functions to not
4098 throw and they don't care to proactively update local EH info. This is
4099 done later in fixup_cfg pass that also execute the verification. */
4100 return (TODO_update_ssa
4102 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
4103 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
4106 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
4109 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
4111 enum tree_code code = TREE_CODE (*tp);
4112 enum tree_code_class cl = TREE_CODE_CLASS (code);
4114 /* We make copies of most nodes. */
4115 if (IS_EXPR_CODE_CLASS (cl)
4116 || code == TREE_LIST
4118 || code == TYPE_DECL
4119 || code == OMP_CLAUSE)
4121 /* Because the chain gets clobbered when we make a copy, we save it
4123 tree chain = NULL_TREE, new_tree;
4125 chain = TREE_CHAIN (*tp);
4127 /* Copy the node. */
4128 new_tree = copy_node (*tp);
4130 /* Propagate mudflap marked-ness. */
4131 if (flag_mudflap && mf_marked_p (*tp))
4136 /* Now, restore the chain, if appropriate. That will cause
4137 walk_tree to walk into the chain as well. */
4138 if (code == PARM_DECL
4139 || code == TREE_LIST
4140 || code == OMP_CLAUSE)
4141 TREE_CHAIN (*tp) = chain;
4143 /* For now, we don't update BLOCKs when we make copies. So, we
4144 have to nullify all BIND_EXPRs. */
4145 if (TREE_CODE (*tp) == BIND_EXPR)
4146 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
4148 else if (code == CONSTRUCTOR)
4150 /* CONSTRUCTOR nodes need special handling because
4151 we need to duplicate the vector of elements. */
4154 new_tree = copy_node (*tp);
4156 /* Propagate mudflap marked-ness. */
4157 if (flag_mudflap && mf_marked_p (*tp))
4160 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
4161 CONSTRUCTOR_ELTS (*tp));
4164 else if (TREE_CODE_CLASS (code) == tcc_type)
4166 else if (TREE_CODE_CLASS (code) == tcc_declaration)
4168 else if (TREE_CODE_CLASS (code) == tcc_constant)
4171 gcc_assert (code != STATEMENT_LIST);
4175 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
4176 information indicating to what new SAVE_EXPR this one should be mapped,
4177 use that one. Otherwise, create a new node and enter it in ST. FN is
4178 the function into which the copy will be placed. */
4181 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
4183 struct pointer_map_t *st = (struct pointer_map_t *) st_;
4187 /* See if we already encountered this SAVE_EXPR. */
4188 n = (tree *) pointer_map_contains (st, *tp);
4190 /* If we didn't already remap this SAVE_EXPR, do so now. */
4193 t = copy_node (*tp);
4195 /* Remember this SAVE_EXPR. */
4196 *pointer_map_insert (st, *tp) = t;
4197 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
4198 *pointer_map_insert (st, t) = t;
4202 /* We've already walked into this SAVE_EXPR; don't do it again. */
4207 /* Replace this SAVE_EXPR with the copy. */
4211 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
4212 copies the declaration and enters it in the splay_tree in DATA (which is
4213 really an `copy_body_data *'). */
4216 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4219 copy_body_data *id = (copy_body_data *) data;
4221 /* Don't walk into types. */
4225 else if (TREE_CODE (*tp) == LABEL_EXPR)
4227 tree decl = TREE_OPERAND (*tp, 0);
4229 /* Copy the decl and remember the copy. */
4230 insert_decl_map (id, decl, id->copy_decl (decl, id));
4236 /* Perform any modifications to EXPR required when it is unsaved. Does
4237 not recurse into EXPR's subtrees. */
4240 unsave_expr_1 (tree expr)
4242 switch (TREE_CODE (expr))
4245 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4246 It's OK for this to happen if it was part of a subtree that
4247 isn't immediately expanded, such as operand 2 of another
4249 if (TREE_OPERAND (expr, 1))
4252 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4253 TREE_OPERAND (expr, 3) = NULL_TREE;
4261 /* Called via walk_tree when an expression is unsaved. Using the
4262 splay_tree pointed to by ST (which is really a `splay_tree'),
4263 remaps all local declarations to appropriate replacements. */
4266 unsave_r (tree *tp, int *walk_subtrees, void *data)
4268 copy_body_data *id = (copy_body_data *) data;
4269 struct pointer_map_t *st = id->decl_map;
4272 /* Only a local declaration (variable or label). */
4273 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
4274 || TREE_CODE (*tp) == LABEL_DECL)
4276 /* Lookup the declaration. */
4277 n = (tree *) pointer_map_contains (st, *tp);
4279 /* If it's there, remap it. */
4284 else if (TREE_CODE (*tp) == STATEMENT_LIST)
4286 else if (TREE_CODE (*tp) == BIND_EXPR)
4287 copy_bind_expr (tp, walk_subtrees, id);
4288 else if (TREE_CODE (*tp) == SAVE_EXPR
4289 || TREE_CODE (*tp) == TARGET_EXPR)
4290 remap_save_expr (tp, st, walk_subtrees);
4293 copy_tree_r (tp, walk_subtrees, NULL);
4295 /* Do whatever unsaving is required. */
4296 unsave_expr_1 (*tp);
4299 /* Keep iterating. */
4303 /* Copies everything in EXPR and replaces variables, labels
4304 and SAVE_EXPRs local to EXPR. */
4307 unsave_expr_now (tree expr)
4311 /* There's nothing to do for NULL_TREE. */
4316 memset (&id, 0, sizeof (id));
4317 id.src_fn = current_function_decl;
4318 id.dst_fn = current_function_decl;
4319 id.decl_map = pointer_map_create ();
4320 id.debug_map = NULL;
4322 id.copy_decl = copy_decl_no_change;
4323 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4324 id.transform_new_cfg = false;
4325 id.transform_return_to_modify = false;
4326 id.transform_lang_insert_block = NULL;
4328 /* Walk the tree once to find local labels. */
4329 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
4331 /* Walk the tree again, copying, remapping, and unsaving. */
4332 walk_tree (&expr, unsave_r, &id, NULL);
4335 pointer_map_destroy (id.decl_map);
4337 pointer_map_destroy (id.debug_map);
4342 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
4343 label, copies the declaration and enters it in the splay_tree in DATA (which
4344 is really a 'copy_body_data *'. */
4347 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
4348 bool *handled_ops_p ATTRIBUTE_UNUSED,
4349 struct walk_stmt_info *wi)
4351 copy_body_data *id = (copy_body_data *) wi->info;
4352 gimple stmt = gsi_stmt (*gsip);
4354 if (gimple_code (stmt) == GIMPLE_LABEL)
4356 tree decl = gimple_label_label (stmt);
4358 /* Copy the decl and remember the copy. */
4359 insert_decl_map (id, decl, id->copy_decl (decl, id));
4366 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4367 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4368 remaps all local declarations to appropriate replacements in gimple
4372 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4374 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4375 copy_body_data *id = (copy_body_data *) wi->info;
4376 struct pointer_map_t *st = id->decl_map;
4380 /* Only a local declaration (variable or label). */
4381 if ((TREE_CODE (expr) == VAR_DECL
4382 && !TREE_STATIC (expr))
4383 || TREE_CODE (expr) == LABEL_DECL)
4385 /* Lookup the declaration. */
4386 n = (tree *) pointer_map_contains (st, expr);
4388 /* If it's there, remap it. */
4393 else if (TREE_CODE (expr) == STATEMENT_LIST
4394 || TREE_CODE (expr) == BIND_EXPR
4395 || TREE_CODE (expr) == SAVE_EXPR)
4397 else if (TREE_CODE (expr) == TARGET_EXPR)
4399 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4400 It's OK for this to happen if it was part of a subtree that
4401 isn't immediately expanded, such as operand 2 of another
4403 if (!TREE_OPERAND (expr, 1))
4405 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4406 TREE_OPERAND (expr, 3) = NULL_TREE;
4410 /* Keep iterating. */
4415 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4416 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4417 remaps all local declarations to appropriate replacements in gimple
4421 replace_locals_stmt (gimple_stmt_iterator *gsip,
4422 bool *handled_ops_p ATTRIBUTE_UNUSED,
4423 struct walk_stmt_info *wi)
4425 copy_body_data *id = (copy_body_data *) wi->info;
4426 gimple stmt = gsi_stmt (*gsip);
4428 if (gimple_code (stmt) == GIMPLE_BIND)
4430 tree block = gimple_bind_block (stmt);
4434 remap_block (&block, id);
4435 gimple_bind_set_block (stmt, block);
4438 /* This will remap a lot of the same decls again, but this should be
4440 if (gimple_bind_vars (stmt))
4441 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4444 /* Keep iterating. */
4449 /* Copies everything in SEQ and replaces variables and labels local to
4450 current_function_decl. */
4453 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4456 struct walk_stmt_info wi;
4457 struct pointer_set_t *visited;
4460 /* There's nothing to do for NULL_TREE. */
4465 memset (&id, 0, sizeof (id));
4466 id.src_fn = current_function_decl;
4467 id.dst_fn = current_function_decl;
4468 id.decl_map = pointer_map_create ();
4469 id.debug_map = NULL;
4471 id.copy_decl = copy_decl_no_change;
4472 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4473 id.transform_new_cfg = false;
4474 id.transform_return_to_modify = false;
4475 id.transform_lang_insert_block = NULL;
4477 /* Walk the tree once to find local labels. */
4478 memset (&wi, 0, sizeof (wi));
4479 visited = pointer_set_create ();
4482 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4483 pointer_set_destroy (visited);
4485 copy = gimple_seq_copy (seq);
4487 /* Walk the copy, remapping decls. */
4488 memset (&wi, 0, sizeof (wi));
4490 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4493 pointer_map_destroy (id.decl_map);
4495 pointer_map_destroy (id.debug_map);
4501 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4504 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4513 debug_find_tree (tree top, tree search)
4515 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4519 /* Declare the variables created by the inliner. Add all the variables in
4520 VARS to BIND_EXPR. */
4523 declare_inline_vars (tree block, tree vars)
4526 for (t = vars; t; t = TREE_CHAIN (t))
4528 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4529 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4530 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4534 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4537 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4538 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4539 VAR_DECL translation. */
4542 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4544 /* Don't generate debug information for the copy if we wouldn't have
4545 generated it for the copy either. */
4546 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4547 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4549 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4550 declaration inspired this copy. */
4551 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4553 /* The new variable/label has no RTL, yet. */
4554 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4555 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4556 SET_DECL_RTL (copy, NULL_RTX);
4558 /* These args would always appear unused, if not for this. */
4559 TREE_USED (copy) = 1;
4561 /* Set the context for the new declaration. */
4562 if (!DECL_CONTEXT (decl))
4563 /* Globals stay global. */
4565 else if (DECL_CONTEXT (decl) != id->src_fn)
4566 /* Things that weren't in the scope of the function we're inlining
4567 from aren't in the scope we're inlining to, either. */
4569 else if (TREE_STATIC (decl))
4570 /* Function-scoped static variables should stay in the original
4574 /* Ordinary automatic local variables are now in the scope of the
4576 DECL_CONTEXT (copy) = id->dst_fn;
4582 copy_decl_to_var (tree decl, copy_body_data *id)
4586 gcc_assert (TREE_CODE (decl) == PARM_DECL
4587 || TREE_CODE (decl) == RESULT_DECL);
4589 type = TREE_TYPE (decl);
4591 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4592 VAR_DECL, DECL_NAME (decl), type);
4593 if (DECL_PT_UID_SET_P (decl))
4594 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4595 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4596 TREE_READONLY (copy) = TREE_READONLY (decl);
4597 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4598 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4600 return copy_decl_for_dup_finish (id, decl, copy);
4603 /* Like copy_decl_to_var, but create a return slot object instead of a
4604 pointer variable for return by invisible reference. */
4607 copy_result_decl_to_var (tree decl, copy_body_data *id)
4611 gcc_assert (TREE_CODE (decl) == PARM_DECL
4612 || TREE_CODE (decl) == RESULT_DECL);
4614 type = TREE_TYPE (decl);
4615 if (DECL_BY_REFERENCE (decl))
4616 type = TREE_TYPE (type);
4618 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4619 VAR_DECL, DECL_NAME (decl), type);
4620 if (DECL_PT_UID_SET_P (decl))
4621 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
4622 TREE_READONLY (copy) = TREE_READONLY (decl);
4623 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4624 if (!DECL_BY_REFERENCE (decl))
4626 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4627 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4630 return copy_decl_for_dup_finish (id, decl, copy);
4634 copy_decl_no_change (tree decl, copy_body_data *id)
4638 copy = copy_node (decl);
4640 /* The COPY is not abstract; it will be generated in DST_FN. */
4641 DECL_ABSTRACT (copy) = 0;
4642 lang_hooks.dup_lang_specific_decl (copy);
4644 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4645 been taken; it's for internal bookkeeping in expand_goto_internal. */
4646 if (TREE_CODE (copy) == LABEL_DECL)
4648 TREE_ADDRESSABLE (copy) = 0;
4649 LABEL_DECL_UID (copy) = -1;
4652 return copy_decl_for_dup_finish (id, decl, copy);
4656 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4658 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4659 return copy_decl_to_var (decl, id);
4661 return copy_decl_no_change (decl, id);
4664 /* Return a copy of the function's argument tree. */
4666 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4667 bitmap args_to_skip, tree *vars)
4670 tree new_parm = NULL;
4675 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4676 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4678 tree new_tree = remap_decl (arg, id);
4679 lang_hooks.dup_lang_specific_decl (new_tree);
4681 parg = &TREE_CHAIN (new_tree);
4683 else if (!pointer_map_contains (id->decl_map, arg))
4685 /* Make an equivalent VAR_DECL. If the argument was used
4686 as temporary variable later in function, the uses will be
4687 replaced by local variable. */
4688 tree var = copy_decl_to_var (arg, id);
4690 add_referenced_var (var);
4691 insert_decl_map (id, arg, var);
4692 /* Declare this new variable. */
4693 TREE_CHAIN (var) = *vars;
4699 /* Return a copy of the function's static chain. */
4701 copy_static_chain (tree static_chain, copy_body_data * id)
4703 tree *chain_copy, *pvar;
4705 chain_copy = &static_chain;
4706 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4708 tree new_tree = remap_decl (*pvar, id);
4709 lang_hooks.dup_lang_specific_decl (new_tree);
4710 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4713 return static_chain;
4716 /* Return true if the function is allowed to be versioned.
4717 This is a guard for the versioning functionality. */
4720 tree_versionable_function_p (tree fndecl)
4722 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
4723 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL);
4726 /* Delete all unreachable basic blocks and update callgraph.
4727 Doing so is somewhat nontrivial because we need to update all clones and
4728 remove inline function that become unreachable. */
4731 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4733 bool changed = false;
4734 basic_block b, next_bb;
4736 find_unreachable_blocks ();
4738 /* Delete all unreachable basic blocks. */
4740 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4742 next_bb = b->next_bb;
4744 if (!(b->flags & BB_REACHABLE))
4746 gimple_stmt_iterator bsi;
4748 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4749 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4751 struct cgraph_edge *e;
4752 struct cgraph_node *node;
4754 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4756 if (!e->inline_failed)
4757 cgraph_remove_node_and_inline_clones (e->callee);
4759 cgraph_remove_edge (e);
4761 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4762 && id->dst_node->clones)
4763 for (node = id->dst_node->clones; node != id->dst_node;)
4765 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4767 if (!e->inline_failed)
4768 cgraph_remove_node_and_inline_clones (e->callee);
4770 cgraph_remove_edge (e);
4774 node = node->clones;
4775 else if (node->next_sibling_clone)
4776 node = node->next_sibling_clone;
4779 while (node != id->dst_node && !node->next_sibling_clone)
4780 node = node->clone_of;
4781 if (node != id->dst_node)
4782 node = node->next_sibling_clone;
4786 delete_basic_block (b);
4792 tidy_fallthru_edges ();
4796 /* Update clone info after duplication. */
4799 update_clone_info (copy_body_data * id)
4801 struct cgraph_node *node;
4802 if (!id->dst_node->clones)
4804 for (node = id->dst_node->clones; node != id->dst_node;)
4806 /* First update replace maps to match the new body. */
4807 if (node->clone.tree_map)
4810 for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4812 struct ipa_replace_map *replace_info;
4813 replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4814 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4815 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4819 node = node->clones;
4820 else if (node->next_sibling_clone)
4821 node = node->next_sibling_clone;
4824 while (node != id->dst_node && !node->next_sibling_clone)
4825 node = node->clone_of;
4826 if (node != id->dst_node)
4827 node = node->next_sibling_clone;
4832 /* Create a copy of a function's tree.
4833 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4834 of the original function and the new copied function
4835 respectively. In case we want to replace a DECL
4836 tree with another tree while duplicating the function's
4837 body, TREE_MAP represents the mapping between these
4838 trees. If UPDATE_CLONES is set, the call_stmt fields
4839 of edges of clones of the function will be updated. */
4841 tree_function_versioning (tree old_decl, tree new_decl,
4842 VEC(ipa_replace_map_p,gc)* tree_map,
4843 bool update_clones, bitmap args_to_skip)
4845 struct cgraph_node *old_version_node;
4846 struct cgraph_node *new_version_node;
4850 struct ipa_replace_map *replace_info;
4851 basic_block old_entry_block, bb;
4852 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4855 tree old_current_function_decl = current_function_decl;
4856 tree vars = NULL_TREE;
4858 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4859 && TREE_CODE (new_decl) == FUNCTION_DECL);
4860 DECL_POSSIBLY_INLINED (old_decl) = 1;
4862 old_version_node = cgraph_node (old_decl);
4863 new_version_node = cgraph_node (new_decl);
4865 /* Output the inlining info for this abstract function, since it has been
4866 inlined. If we don't do this now, we can lose the information about the
4867 variables in the function when the blocks get blown away as soon as we
4868 remove the cgraph node. */
4869 (*debug_hooks->outlining_inline_function) (old_decl);
4871 DECL_ARTIFICIAL (new_decl) = 1;
4872 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4873 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
4875 /* Prepare the data structures for the tree copy. */
4876 memset (&id, 0, sizeof (id));
4878 /* Generate a new name for the new version. */
4879 id.statements_to_fold = pointer_set_create ();
4881 id.decl_map = pointer_map_create ();
4882 id.debug_map = NULL;
4883 id.src_fn = old_decl;
4884 id.dst_fn = new_decl;
4885 id.src_node = old_version_node;
4886 id.dst_node = new_version_node;
4887 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4888 if (id.src_node->ipa_transforms_to_apply)
4890 VEC(ipa_opt_pass,heap) * old_transforms_to_apply = id.dst_node->ipa_transforms_to_apply;
4893 id.dst_node->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
4894 id.src_node->ipa_transforms_to_apply);
4895 for (i = 0; i < VEC_length (ipa_opt_pass, old_transforms_to_apply); i++)
4896 VEC_safe_push (ipa_opt_pass, heap, id.dst_node->ipa_transforms_to_apply,
4897 VEC_index (ipa_opt_pass,
4898 old_transforms_to_apply,
4902 id.copy_decl = copy_decl_no_change;
4903 id.transform_call_graph_edges
4904 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
4905 id.transform_new_cfg = true;
4906 id.transform_return_to_modify = false;
4907 id.transform_lang_insert_block = NULL;
4909 current_function_decl = new_decl;
4910 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
4911 (DECL_STRUCT_FUNCTION (old_decl));
4912 initialize_cfun (new_decl, old_decl,
4913 old_entry_block->count);
4914 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
4916 /* Copy the function's static chain. */
4917 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
4919 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
4920 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
4923 /* If there's a tree_map, prepare for substitution. */
4925 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
4928 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
4929 if (replace_info->replace_p)
4931 tree op = replace_info->new_tree;
4935 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
4936 op = TREE_OPERAND (op, 0);
4938 if (TREE_CODE (op) == ADDR_EXPR)
4940 op = TREE_OPERAND (op, 0);
4941 while (handled_component_p (op))
4942 op = TREE_OPERAND (op, 0);
4943 if (TREE_CODE (op) == VAR_DECL)
4944 add_referenced_var (op);
4946 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
4947 init = setup_one_parameter (&id, replace_info->old_tree,
4948 replace_info->new_tree, id.src_fn,
4952 VEC_safe_push (gimple, heap, init_stmts, init);
4955 /* Copy the function's arguments. */
4956 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
4957 DECL_ARGUMENTS (new_decl) =
4958 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
4959 args_to_skip, &vars);
4961 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
4963 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4964 number_blocks (id.dst_fn);
4966 declare_inline_vars (DECL_INITIAL (new_decl), vars);
4968 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
4969 /* Add local vars. */
4970 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
4971 t_step; t_step = TREE_CHAIN (t_step))
4973 tree var = TREE_VALUE (t_step);
4974 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
4975 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
4976 else if (!can_be_nonlocal (var, &id))
4978 tree_cons (NULL_TREE, remap_decl (var, &id),
4982 /* Copy the Function's body. */
4983 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
4984 ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
4986 if (DECL_RESULT (old_decl) != NULL_TREE)
4988 tree *res_decl = &DECL_RESULT (old_decl);
4989 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
4990 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
4993 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4994 number_blocks (new_decl);
4996 /* We want to create the BB unconditionally, so that the addition of
4997 debug stmts doesn't affect BB count, which may in the end cause
4998 codegen differences. */
4999 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
5000 while (VEC_length (gimple, init_stmts))
5001 insert_init_stmt (&id, bb, VEC_pop (gimple, init_stmts));
5002 update_clone_info (&id);
5004 /* Remap the nonlocal_goto_save_area, if any. */
5005 if (cfun->nonlocal_goto_save_area)
5007 struct walk_stmt_info wi;
5009 memset (&wi, 0, sizeof (wi));
5011 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
5015 pointer_map_destroy (id.decl_map);
5017 pointer_map_destroy (id.debug_map);
5018 free_dominance_info (CDI_DOMINATORS);
5019 free_dominance_info (CDI_POST_DOMINATORS);
5021 fold_marked_statements (0, id.statements_to_fold);
5022 pointer_set_destroy (id.statements_to_fold);
5023 fold_cond_expr_cond ();
5024 delete_unreachable_blocks_update_callgraph (&id);
5025 update_ssa (TODO_update_ssa);
5026 free_dominance_info (CDI_DOMINATORS);
5027 free_dominance_info (CDI_POST_DOMINATORS);
5029 gcc_assert (!id.debug_stmts);
5030 VEC_free (gimple, heap, init_stmts);
5032 current_function_decl = old_current_function_decl;
5033 gcc_assert (!current_function_decl
5034 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
5038 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
5039 the callee and return the inlined body on success. */
5042 maybe_inline_call_in_expr (tree exp)
5044 tree fn = get_callee_fndecl (exp);
5046 /* We can only try to inline "const" functions. */
5047 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
5049 struct pointer_map_t *decl_map = pointer_map_create ();
5050 call_expr_arg_iterator iter;
5054 /* Remap the parameters. */
5055 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
5057 param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter))
5058 *pointer_map_insert (decl_map, param) = arg;
5060 memset (&id, 0, sizeof (id));
5062 id.dst_fn = current_function_decl;
5063 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
5064 id.decl_map = decl_map;
5066 id.copy_decl = copy_decl_no_change;
5067 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5068 id.transform_new_cfg = false;
5069 id.transform_return_to_modify = true;
5070 id.transform_lang_insert_block = false;
5072 /* Make sure not to unshare trees behind the front-end's back
5073 since front-end specific mechanisms may rely on sharing. */
5074 id.regimplify = false;
5075 id.do_not_unshare = true;
5077 /* We're not inside any EH region. */
5080 t = copy_tree_body (&id);
5081 pointer_map_destroy (decl_map);
5083 /* We can only return something suitable for use in a GENERIC
5085 if (TREE_CODE (t) == MODIFY_EXPR)
5086 return TREE_OPERAND (t, 1);
5092 /* Duplicate a type, fields and all. */
5095 build_duplicate_type (tree type)
5097 struct copy_body_data id;
5099 memset (&id, 0, sizeof (id));
5100 id.src_fn = current_function_decl;
5101 id.dst_fn = current_function_decl;
5103 id.decl_map = pointer_map_create ();
5104 id.debug_map = NULL;
5105 id.copy_decl = copy_decl_no_change;
5107 type = remap_type_1 (type, &id);
5109 pointer_map_destroy (id.decl_map);
5111 pointer_map_destroy (id.debug_map);
5113 TYPE_CANONICAL (type) = type;
5118 /* Return whether it is safe to inline a function because it used different
5119 target specific options or call site actual types mismatch parameter types.
5120 E is the call edge to be checked. */
5122 tree_can_inline_p (struct cgraph_edge *e)
5125 /* This causes a regression in SPEC in that it prevents a cold function from
5126 inlining a hot function. Perhaps this should only apply to functions
5127 that the user declares hot/cold/optimize explicitly. */
5129 /* Don't inline a function with a higher optimization level than the
5130 caller, or with different space constraints (hot/cold functions). */
5131 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
5132 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
5134 if (caller_tree != callee_tree)
5136 struct cl_optimization *caller_opt
5137 = TREE_OPTIMIZATION ((caller_tree)
5139 : optimization_default_node);
5141 struct cl_optimization *callee_opt
5142 = TREE_OPTIMIZATION ((callee_tree)
5144 : optimization_default_node);
5146 if ((caller_opt->optimize > callee_opt->optimize)
5147 || (caller_opt->optimize_size != callee_opt->optimize_size))
5151 tree caller, callee, lhs;
5153 caller = e->caller->decl;
5154 callee = e->callee->decl;
5156 /* We cannot inline a function that uses a different EH personality
5158 if (DECL_FUNCTION_PERSONALITY (caller)
5159 && DECL_FUNCTION_PERSONALITY (callee)
5160 && (DECL_FUNCTION_PERSONALITY (caller)
5161 != DECL_FUNCTION_PERSONALITY (callee)))
5163 e->inline_failed = CIF_UNSPECIFIED;
5164 gimple_call_set_cannot_inline (e->call_stmt, true);
5168 /* Allow the backend to decide if inlining is ok. */
5169 if (!targetm.target_option.can_inline_p (caller, callee))
5171 e->inline_failed = CIF_TARGET_OPTION_MISMATCH;
5172 gimple_call_set_cannot_inline (e->call_stmt, true);
5173 e->call_stmt_cannot_inline_p = true;
5177 /* Do not inline calls where we cannot triviall work around mismatches
5178 in argument or return types. */
5180 && ((DECL_RESULT (callee)
5181 && !DECL_BY_REFERENCE (DECL_RESULT (callee))
5182 && (lhs = gimple_call_lhs (e->call_stmt)) != NULL_TREE
5183 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)),
5185 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs))
5186 || !gimple_check_call_args (e->call_stmt)))
5188 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
5189 gimple_call_set_cannot_inline (e->call_stmt, true);
5190 e->call_stmt_cannot_inline_p = true;