2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
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"
37 #include "langhooks.h"
38 #include "basic-block.h"
39 #include "tree-iterator.h"
42 #include "tree-mudflap.h"
43 #include "tree-flow.h"
46 #include "tree-flow.h"
47 #include "diagnostic.h"
50 #include "pointer-set.h"
52 #include "value-prof.h"
53 #include "tree-pass.h"
55 #include "integrate.h"
57 /* I'm not real happy about this, but we need to handle gimple and
61 /* Inlining, Cloning, Versioning, Parallelization
63 Inlining: a function body is duplicated, but the PARM_DECLs are
64 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
65 MODIFY_EXPRs that store to a dedicated returned-value variable.
66 The duplicated eh_region info of the copy will later be appended
67 to the info for the caller; the eh_region info in copied throwing
68 statements and RESX_EXPRs is adjusted accordingly.
70 Cloning: (only in C++) We have one body for a con/de/structor, and
71 multiple function decls, each with a unique parameter list.
72 Duplicate the body, using the given splay tree; some parameters
73 will become constants (like 0 or 1).
75 Versioning: a function body is duplicated and the result is a new
76 function rather than into blocks of an existing function as with
77 inlining. Some parameters will become constants.
79 Parallelization: a region of a function is duplicated resulting in
80 a new function. Variables may be replaced with complex expressions
81 to enable shared variable semantics.
83 All of these will simultaneously lookup any callgraph edges. If
84 we're going to inline the duplicated function body, and the given
85 function has some cloned callgraph nodes (one for each place this
86 function will be inlined) those callgraph edges will be duplicated.
87 If we're cloning the body, those callgraph edges will be
88 updated to point into the new body. (Note that the original
89 callgraph node and edge list will not be altered.)
91 See the CALL_EXPR handling case in copy_tree_body_r (). */
95 o In order to make inlining-on-trees work, we pessimized
96 function-local static constants. In particular, they are now
97 always output, even when not addressed. Fix this by treating
98 function-local static constants just like global static
99 constants; the back-end already knows not to output them if they
102 o Provide heuristics to clamp inlining of recursive template
106 /* Weights that estimate_num_insns uses for heuristics in inlining. */
108 eni_weights eni_inlining_weights;
110 /* Weights that estimate_num_insns uses to estimate the size of the
113 eni_weights eni_size_weights;
115 /* Weights that estimate_num_insns uses to estimate the time necessary
116 to execute the produced code. */
118 eni_weights eni_time_weights;
122 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
123 static bool inlinable_function_p (tree);
124 static void remap_block (tree *, copy_body_data *);
125 static void copy_bind_expr (tree *, int *, copy_body_data *);
126 static tree mark_local_for_remap_r (tree *, int *, void *);
127 static void unsave_expr_1 (tree);
128 static tree unsave_r (tree *, int *, void *);
129 static void declare_inline_vars (tree, tree);
130 static void remap_save_expr (tree *, void *, int *);
131 static void prepend_lexical_block (tree current_block, tree new_block);
132 static tree copy_decl_to_var (tree, copy_body_data *);
133 static tree copy_result_decl_to_var (tree, copy_body_data *);
134 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
135 static gimple remap_gimple_stmt (gimple, copy_body_data *);
137 /* Insert a tree->tree mapping for ID. Despite the name suggests
138 that the trees should be variables, it is used for more than that. */
141 insert_decl_map (copy_body_data *id, tree key, tree value)
143 *pointer_map_insert (id->decl_map, key) = value;
145 /* Always insert an identity map as well. If we see this same new
146 node again, we won't want to duplicate it a second time. */
148 *pointer_map_insert (id->decl_map, value) = value;
151 /* Construct new SSA name for old NAME. ID is the inline context. */
154 remap_ssa_name (tree name, copy_body_data *id)
159 gcc_assert (TREE_CODE (name) == SSA_NAME);
161 n = (tree *) pointer_map_contains (id->decl_map, name);
163 return unshare_expr (*n);
165 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
167 new_tree = remap_decl (SSA_NAME_VAR (name), id);
169 /* We might've substituted constant or another SSA_NAME for
172 Replace the SSA name representing RESULT_DECL by variable during
173 inlining: this saves us from need to introduce PHI node in a case
174 return value is just partly initialized. */
175 if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
176 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
177 || !id->transform_return_to_modify))
179 new_tree = make_ssa_name (new_tree, NULL);
180 insert_decl_map (id, name, new_tree);
181 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
182 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
183 TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
184 if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
186 /* By inlining function having uninitialized variable, we might
187 extend the lifetime (variable might get reused). This cause
188 ICE in the case we end up extending lifetime of SSA name across
189 abnormal edge, but also increase register pressure.
191 We simply initialize all uninitialized vars by 0 except
192 for case we are inlining to very first BB. We can avoid
193 this for all BBs that are not inside strongly connected
194 regions of the CFG, but this is expensive to test. */
196 && is_gimple_reg (SSA_NAME_VAR (name))
197 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
198 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
199 || EDGE_COUNT (id->entry_bb->preds) != 1))
201 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
204 init_stmt = gimple_build_assign (new_tree,
205 fold_convert (TREE_TYPE (new_tree),
207 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
208 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
212 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
213 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
215 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
220 insert_decl_map (id, name, new_tree);
224 /* Remap DECL during the copying of the BLOCK tree for the function. */
227 remap_decl (tree decl, copy_body_data *id)
232 /* We only remap local variables in the current function. */
235 /* See if we have remapped this declaration. */
237 n = (tree *) pointer_map_contains (id->decl_map, decl);
239 /* If we didn't already have an equivalent for this declaration,
243 /* Make a copy of the variable or label. */
244 tree t = id->copy_decl (decl, id);
246 /* Remember it, so that if we encounter this local entity again
247 we can reuse this copy. Do this early because remap_type may
248 need this decl for TYPE_STUB_DECL. */
249 insert_decl_map (id, decl, t);
254 /* Remap types, if necessary. */
255 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
256 if (TREE_CODE (t) == TYPE_DECL)
257 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
259 /* Remap sizes as necessary. */
260 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
261 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
263 /* If fields, do likewise for offset and qualifier. */
264 if (TREE_CODE (t) == FIELD_DECL)
266 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
267 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
268 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
271 if (cfun && gimple_in_ssa_p (cfun)
272 && (TREE_CODE (t) == VAR_DECL
273 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
275 tree def = gimple_default_def (id->src_cfun, decl);
277 if (TREE_CODE (decl) != PARM_DECL && def)
279 tree map = remap_ssa_name (def, id);
280 /* Watch out RESULT_DECLs whose SSA names map directly
282 if (TREE_CODE (map) == SSA_NAME
283 && gimple_nop_p (SSA_NAME_DEF_STMT (map)))
284 set_default_def (t, map);
286 add_referenced_var (t);
291 return unshare_expr (*n);
295 remap_type_1 (tree type, copy_body_data *id)
299 /* We do need a copy. build and register it now. If this is a pointer or
300 reference type, remap the designated type and make a new pointer or
302 if (TREE_CODE (type) == POINTER_TYPE)
304 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
306 TYPE_REF_CAN_ALIAS_ALL (type));
307 insert_decl_map (id, type, new_tree);
310 else if (TREE_CODE (type) == REFERENCE_TYPE)
312 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
314 TYPE_REF_CAN_ALIAS_ALL (type));
315 insert_decl_map (id, type, new_tree);
319 new_tree = copy_node (type);
321 insert_decl_map (id, type, new_tree);
323 /* This is a new type, not a copy of an old type. Need to reassociate
324 variants. We can handle everything except the main variant lazily. */
325 t = TYPE_MAIN_VARIANT (type);
328 t = remap_type (t, id);
329 TYPE_MAIN_VARIANT (new_tree) = t;
330 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
331 TYPE_NEXT_VARIANT (t) = new_tree;
335 TYPE_MAIN_VARIANT (new_tree) = new_tree;
336 TYPE_NEXT_VARIANT (new_tree) = NULL;
339 if (TYPE_STUB_DECL (type))
340 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
342 /* Lazily create pointer and reference types. */
343 TYPE_POINTER_TO (new_tree) = NULL;
344 TYPE_REFERENCE_TO (new_tree) = NULL;
346 switch (TREE_CODE (new_tree))
350 case FIXED_POINT_TYPE:
353 t = TYPE_MIN_VALUE (new_tree);
354 if (t && TREE_CODE (t) != INTEGER_CST)
355 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
357 t = TYPE_MAX_VALUE (new_tree);
358 if (t && TREE_CODE (t) != INTEGER_CST)
359 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
363 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
364 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
368 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
369 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
374 case QUAL_UNION_TYPE:
378 for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f))
380 t = remap_decl (f, id);
381 DECL_CONTEXT (t) = new_tree;
385 TYPE_FIELDS (new_tree) = nreverse (nf);
391 /* Shouldn't have been thought variable sized. */
395 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
396 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
402 remap_type (tree type, copy_body_data *id)
410 /* See if we have remapped this type. */
411 node = (tree *) pointer_map_contains (id->decl_map, type);
415 /* The type only needs remapping if it's variably modified. */
416 if (! variably_modified_type_p (type, id->src_fn))
418 insert_decl_map (id, type, type);
422 id->remapping_type_depth++;
423 tmp = remap_type_1 (type, id);
424 id->remapping_type_depth--;
429 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
430 is NULL or TYPE has not been remapped before. */
433 remapped_type (tree type, copy_body_data *id)
440 /* See if we have remapped this type. */
441 node = (tree *) pointer_map_contains (id->decl_map, type);
448 /* The type only needs remapping if it's variably modified. */
449 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
452 can_be_nonlocal (tree decl, copy_body_data *id)
454 /* We can not duplicate function decls. */
455 if (TREE_CODE (decl) == FUNCTION_DECL)
458 /* Local static vars must be non-local or we get multiple declaration
460 if (TREE_CODE (decl) == VAR_DECL
461 && !auto_var_in_fn_p (decl, id->src_fn))
464 /* At the moment dwarf2out can handle only these types of nodes. We
465 can support more later. */
466 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
469 /* We must use global type. We call remapped_type instead of
470 remap_type since we don't want to remap this type here if it
471 hasn't been remapped before. */
472 if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
475 /* Wihtout SSA we can't tell if variable is used. */
476 if (!gimple_in_ssa_p (cfun))
479 /* Live variables must be copied so we can attach DECL_RTL. */
487 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
490 tree new_decls = NULL_TREE;
492 /* Remap its variables. */
493 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
496 tree origin_var = DECL_ORIGIN (old_var);
498 if (can_be_nonlocal (old_var, id))
500 if (TREE_CODE (old_var) == VAR_DECL
501 && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
502 cfun->local_decls = tree_cons (NULL_TREE, old_var,
504 if (debug_info_level > DINFO_LEVEL_TERSE
505 && !DECL_IGNORED_P (old_var)
506 && nonlocalized_list)
507 VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
511 /* Remap the variable. */
512 new_var = remap_decl (old_var, id);
514 /* If we didn't remap this variable, we can't mess with its
515 TREE_CHAIN. If we remapped this variable to the return slot, it's
516 already declared somewhere else, so don't declare it here. */
518 if (new_var == id->retvar)
522 if (debug_info_level > DINFO_LEVEL_TERSE
523 && !DECL_IGNORED_P (old_var)
524 && nonlocalized_list)
525 VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
529 gcc_assert (DECL_P (new_var));
530 TREE_CHAIN (new_var) = new_decls;
535 return nreverse (new_decls);
538 /* Copy the BLOCK to contain remapped versions of the variables
539 therein. And hook the new block into the block-tree. */
542 remap_block (tree *block, copy_body_data *id)
548 /* Make the new block. */
550 new_block = make_node (BLOCK);
551 TREE_USED (new_block) = TREE_USED (old_block);
552 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
553 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
554 BLOCK_NONLOCALIZED_VARS (new_block)
555 = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
558 /* Remap its variables. */
559 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
560 &BLOCK_NONLOCALIZED_VARS (new_block),
565 if (id->transform_lang_insert_block)
566 id->transform_lang_insert_block (new_block);
568 /* Remember the remapped block. */
569 insert_decl_map (id, old_block, new_block);
572 /* Copy the whole block tree and root it in id->block. */
574 remap_blocks (tree block, copy_body_data *id)
577 tree new_tree = block;
582 remap_block (&new_tree, id);
583 gcc_assert (new_tree != block);
584 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
585 prepend_lexical_block (new_tree, remap_blocks (t, id));
586 /* Blocks are in arbitrary order, but make things slightly prettier and do
587 not swap order when producing a copy. */
588 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
593 copy_statement_list (tree *tp)
595 tree_stmt_iterator oi, ni;
598 new_tree = alloc_stmt_list ();
599 ni = tsi_start (new_tree);
600 oi = tsi_start (*tp);
603 for (; !tsi_end_p (oi); tsi_next (&oi))
604 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
608 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
610 tree block = BIND_EXPR_BLOCK (*tp);
611 /* Copy (and replace) the statement. */
612 copy_tree_r (tp, walk_subtrees, NULL);
615 remap_block (&block, id);
616 BIND_EXPR_BLOCK (*tp) = block;
619 if (BIND_EXPR_VARS (*tp))
620 /* This will remap a lot of the same decls again, but this should be
622 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
626 /* Create a new gimple_seq by remapping all the statements in BODY
627 using the inlining information in ID. */
630 remap_gimple_seq (gimple_seq body, copy_body_data *id)
632 gimple_stmt_iterator si;
633 gimple_seq new_body = NULL;
635 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
637 gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
638 gimple_seq_add_stmt (&new_body, new_stmt);
645 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
646 block using the mapping information in ID. */
649 copy_gimple_bind (gimple stmt, copy_body_data *id)
652 tree new_block, new_vars;
653 gimple_seq body, new_body;
655 /* Copy the statement. Note that we purposely don't use copy_stmt
656 here because we need to remap statements as we copy. */
657 body = gimple_bind_body (stmt);
658 new_body = remap_gimple_seq (body, id);
660 new_block = gimple_bind_block (stmt);
662 remap_block (&new_block, id);
664 /* This will remap a lot of the same decls again, but this should be
666 new_vars = gimple_bind_vars (stmt);
668 new_vars = remap_decls (new_vars, NULL, id);
670 new_bind = gimple_build_bind (new_vars, new_body, new_block);
676 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
677 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
678 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
679 recursing into the children nodes of *TP. */
682 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
684 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
685 copy_body_data *id = (copy_body_data *) wi_p->info;
686 tree fn = id->src_fn;
688 if (TREE_CODE (*tp) == SSA_NAME)
690 *tp = remap_ssa_name (*tp, id);
694 else if (auto_var_in_fn_p (*tp, fn))
696 /* Local variables and labels need to be replaced by equivalent
697 variables. We don't want to copy static variables; there's
698 only one of those, no matter how many times we inline the
699 containing function. Similarly for globals from an outer
703 /* Remap the declaration. */
704 new_decl = remap_decl (*tp, id);
705 gcc_assert (new_decl);
706 /* Replace this variable with the copy. */
707 STRIP_TYPE_NOPS (new_decl);
711 else if (TREE_CODE (*tp) == STATEMENT_LIST)
713 else if (TREE_CODE (*tp) == SAVE_EXPR)
715 else if (TREE_CODE (*tp) == LABEL_DECL
716 && (!DECL_CONTEXT (*tp)
717 || decl_function_context (*tp) == id->src_fn))
718 /* These may need to be remapped for EH handling. */
719 *tp = remap_decl (*tp, id);
720 else if (TYPE_P (*tp))
721 /* Types may need remapping as well. */
722 *tp = remap_type (*tp, id);
723 else if (CONSTANT_CLASS_P (*tp))
725 /* If this is a constant, we have to copy the node iff the type
726 will be remapped. copy_tree_r will not copy a constant. */
727 tree new_type = remap_type (TREE_TYPE (*tp), id);
729 if (new_type == TREE_TYPE (*tp))
732 else if (TREE_CODE (*tp) == INTEGER_CST)
733 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
734 TREE_INT_CST_HIGH (*tp));
737 *tp = copy_node (*tp);
738 TREE_TYPE (*tp) = new_type;
743 /* Otherwise, just copy the node. Note that copy_tree_r already
744 knows not to copy VAR_DECLs, etc., so this is safe. */
745 if (TREE_CODE (*tp) == INDIRECT_REF)
747 /* Get rid of *& from inline substitutions that can happen when a
748 pointer argument is an ADDR_EXPR. */
749 tree decl = TREE_OPERAND (*tp, 0);
752 n = (tree *) pointer_map_contains (id->decl_map, decl);
755 tree type, new_tree, old;
757 /* If we happen to get an ADDR_EXPR in n->value, strip
758 it manually here as we'll eventually get ADDR_EXPRs
759 which lie about their types pointed to. In this case
760 build_fold_indirect_ref wouldn't strip the
761 INDIRECT_REF, but we absolutely rely on that. As
762 fold_indirect_ref does other useful transformations,
763 try that first, though. */
764 type = TREE_TYPE (TREE_TYPE (*n));
765 new_tree = unshare_expr (*n);
767 *tp = gimple_fold_indirect_ref (new_tree);
770 if (TREE_CODE (new_tree) == ADDR_EXPR)
772 *tp = fold_indirect_ref_1 (type, new_tree);
773 /* ??? We should either assert here or build
774 a VIEW_CONVERT_EXPR instead of blindly leaking
775 incompatible types to our IL. */
777 *tp = TREE_OPERAND (new_tree, 0);
781 *tp = build1 (INDIRECT_REF, type, new_tree);
782 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
783 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
791 /* Here is the "usual case". Copy this tree node, and then
792 tweak some special cases. */
793 copy_tree_r (tp, walk_subtrees, NULL);
795 /* Global variables we haven't seen yet need to go into referenced
796 vars. If not referenced from types only. */
797 if (gimple_in_ssa_p (cfun)
798 && TREE_CODE (*tp) == VAR_DECL
799 && id->remapping_type_depth == 0)
800 add_referenced_var (*tp);
802 /* We should never have TREE_BLOCK set on non-statements. */
804 gcc_assert (!TREE_BLOCK (*tp));
806 if (TREE_CODE (*tp) != OMP_CLAUSE)
807 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
809 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
811 /* The copied TARGET_EXPR has never been expanded, even if the
812 original node was expanded already. */
813 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
814 TREE_OPERAND (*tp, 3) = NULL_TREE;
816 else if (TREE_CODE (*tp) == ADDR_EXPR)
818 /* Variable substitution need not be simple. In particular,
819 the INDIRECT_REF substitution above. Make sure that
820 TREE_CONSTANT and friends are up-to-date. But make sure
821 to not improperly set TREE_BLOCK on some sub-expressions. */
822 int invariant = is_gimple_min_invariant (*tp);
823 tree block = id->block;
824 id->block = NULL_TREE;
825 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
828 /* Handle the case where we substituted an INDIRECT_REF
829 into the operand of the ADDR_EXPR. */
830 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
831 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
833 recompute_tree_invariant_for_addr_expr (*tp);
835 /* If this used to be invariant, but is not any longer,
836 then regimplification is probably needed. */
837 if (invariant && !is_gimple_min_invariant (*tp))
838 id->regimplify = true;
844 /* Keep iterating. */
849 /* Called from copy_body_id via walk_tree. DATA is really a
850 `copy_body_data *'. */
853 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
855 copy_body_data *id = (copy_body_data *) data;
856 tree fn = id->src_fn;
859 /* Begin by recognizing trees that we'll completely rewrite for the
860 inlining context. Our output for these trees is completely
861 different from out input (e.g. RETURN_EXPR is deleted, and morphs
862 into an edge). Further down, we'll handle trees that get
863 duplicated and/or tweaked. */
865 /* When requested, RETURN_EXPRs should be transformed to just the
866 contained MODIFY_EXPR. The branch semantics of the return will
867 be handled elsewhere by manipulating the CFG rather than a statement. */
868 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
870 tree assignment = TREE_OPERAND (*tp, 0);
872 /* If we're returning something, just turn that into an
873 assignment into the equivalent of the original RESULT_DECL.
874 If the "assignment" is just the result decl, the result
875 decl has already been set (e.g. a recent "foo (&result_decl,
876 ...)"); just toss the entire RETURN_EXPR. */
877 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
879 /* Replace the RETURN_EXPR with (a copy of) the
880 MODIFY_EXPR hanging underneath. */
881 *tp = copy_node (assignment);
883 else /* Else the RETURN_EXPR returns no value. */
886 return (tree) (void *)1;
889 else if (TREE_CODE (*tp) == SSA_NAME)
891 *tp = remap_ssa_name (*tp, id);
896 /* Local variables and labels need to be replaced by equivalent
897 variables. We don't want to copy static variables; there's only
898 one of those, no matter how many times we inline the containing
899 function. Similarly for globals from an outer function. */
900 else if (auto_var_in_fn_p (*tp, fn))
904 /* Remap the declaration. */
905 new_decl = remap_decl (*tp, id);
906 gcc_assert (new_decl);
907 /* Replace this variable with the copy. */
908 STRIP_TYPE_NOPS (new_decl);
912 else if (TREE_CODE (*tp) == STATEMENT_LIST)
913 copy_statement_list (tp);
914 else if (TREE_CODE (*tp) == SAVE_EXPR)
915 remap_save_expr (tp, id->decl_map, walk_subtrees);
916 else if (TREE_CODE (*tp) == LABEL_DECL
917 && (! DECL_CONTEXT (*tp)
918 || decl_function_context (*tp) == id->src_fn))
919 /* These may need to be remapped for EH handling. */
920 *tp = remap_decl (*tp, id);
921 else if (TREE_CODE (*tp) == BIND_EXPR)
922 copy_bind_expr (tp, walk_subtrees, id);
923 /* Types may need remapping as well. */
924 else if (TYPE_P (*tp))
925 *tp = remap_type (*tp, id);
927 /* If this is a constant, we have to copy the node iff the type will be
928 remapped. copy_tree_r will not copy a constant. */
929 else if (CONSTANT_CLASS_P (*tp))
931 tree new_type = remap_type (TREE_TYPE (*tp), id);
933 if (new_type == TREE_TYPE (*tp))
936 else if (TREE_CODE (*tp) == INTEGER_CST)
937 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
938 TREE_INT_CST_HIGH (*tp));
941 *tp = copy_node (*tp);
942 TREE_TYPE (*tp) = new_type;
946 /* Otherwise, just copy the node. Note that copy_tree_r already
947 knows not to copy VAR_DECLs, etc., so this is safe. */
950 /* Here we handle trees that are not completely rewritten.
951 First we detect some inlining-induced bogosities for
953 if (TREE_CODE (*tp) == MODIFY_EXPR
954 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
955 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
957 /* Some assignments VAR = VAR; don't generate any rtl code
958 and thus don't count as variable modification. Avoid
959 keeping bogosities like 0 = 0. */
960 tree decl = TREE_OPERAND (*tp, 0), value;
963 n = (tree *) pointer_map_contains (id->decl_map, decl);
967 STRIP_TYPE_NOPS (value);
968 if (TREE_CONSTANT (value) || TREE_READONLY (value))
970 *tp = build_empty_stmt ();
971 return copy_tree_body_r (tp, walk_subtrees, data);
975 else if (TREE_CODE (*tp) == INDIRECT_REF)
977 /* Get rid of *& from inline substitutions that can happen when a
978 pointer argument is an ADDR_EXPR. */
979 tree decl = TREE_OPERAND (*tp, 0);
982 n = (tree *) pointer_map_contains (id->decl_map, decl);
987 /* If we happen to get an ADDR_EXPR in n->value, strip
988 it manually here as we'll eventually get ADDR_EXPRs
989 which lie about their types pointed to. In this case
990 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
991 but we absolutely rely on that. As fold_indirect_ref
992 does other useful transformations, try that first, though. */
993 tree type = TREE_TYPE (TREE_TYPE (*n));
994 new_tree = unshare_expr (*n);
996 *tp = gimple_fold_indirect_ref (new_tree);
999 if (TREE_CODE (new_tree) == ADDR_EXPR)
1001 *tp = fold_indirect_ref_1 (type, new_tree);
1002 /* ??? We should either assert here or build
1003 a VIEW_CONVERT_EXPR instead of blindly leaking
1004 incompatible types to our IL. */
1006 *tp = TREE_OPERAND (new_tree, 0);
1010 *tp = build1 (INDIRECT_REF, type, new_tree);
1011 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1012 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1020 /* Here is the "usual case". Copy this tree node, and then
1021 tweak some special cases. */
1022 copy_tree_r (tp, walk_subtrees, NULL);
1024 /* Global variables we haven't seen yet needs to go into referenced
1025 vars. If not referenced from types only. */
1026 if (gimple_in_ssa_p (cfun)
1027 && TREE_CODE (*tp) == VAR_DECL
1028 && id->remapping_type_depth == 0)
1029 add_referenced_var (*tp);
1031 /* If EXPR has block defined, map it to newly constructed block.
1032 When inlining we want EXPRs without block appear in the block
1033 of function call. */
1036 new_block = id->block;
1037 if (TREE_BLOCK (*tp))
1040 n = (tree *) pointer_map_contains (id->decl_map,
1045 TREE_BLOCK (*tp) = new_block;
1048 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
1049 TREE_OPERAND (*tp, 0) =
1050 build_int_cst (NULL_TREE,
1051 id->eh_region_offset
1052 + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
1054 if (TREE_CODE (*tp) != OMP_CLAUSE)
1055 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1057 /* The copied TARGET_EXPR has never been expanded, even if the
1058 original node was expanded already. */
1059 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1061 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1062 TREE_OPERAND (*tp, 3) = NULL_TREE;
1065 /* Variable substitution need not be simple. In particular, the
1066 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1067 and friends are up-to-date. */
1068 else if (TREE_CODE (*tp) == ADDR_EXPR)
1070 int invariant = is_gimple_min_invariant (*tp);
1071 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1073 /* Handle the case where we substituted an INDIRECT_REF
1074 into the operand of the ADDR_EXPR. */
1075 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1076 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1078 recompute_tree_invariant_for_addr_expr (*tp);
1080 /* If this used to be invariant, but is not any longer,
1081 then regimplification is probably needed. */
1082 if (invariant && !is_gimple_min_invariant (*tp))
1083 id->regimplify = true;
1089 /* Keep iterating. */
1094 /* Helper for copy_bb. Remap statement STMT using the inlining
1095 information in ID. Return the new statement copy. */
1098 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1101 struct walk_stmt_info wi;
1103 bool skip_first = false;
1105 /* Begin by recognizing trees that we'll completely rewrite for the
1106 inlining context. Our output for these trees is completely
1107 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1108 into an edge). Further down, we'll handle trees that get
1109 duplicated and/or tweaked. */
1111 /* When requested, GIMPLE_RETURNs should be transformed to just the
1112 contained GIMPLE_ASSIGN. The branch semantics of the return will
1113 be handled elsewhere by manipulating the CFG rather than the
1115 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1117 tree retval = gimple_return_retval (stmt);
1119 /* If we're returning something, just turn that into an
1120 assignment into the equivalent of the original RESULT_DECL.
1121 If RETVAL is just the result decl, the result decl has
1122 already been set (e.g. a recent "foo (&result_decl, ...)");
1123 just toss the entire GIMPLE_RETURN. */
1124 if (retval && TREE_CODE (retval) != RESULT_DECL)
1126 copy = gimple_build_assign (id->retvar, retval);
1127 /* id->retvar is already substituted. Skip it on later remapping. */
1131 return gimple_build_nop ();
1133 else if (gimple_has_substatements (stmt))
1137 /* When cloning bodies from the C++ front end, we will be handed bodies
1138 in High GIMPLE form. Handle here all the High GIMPLE statements that
1139 have embedded statements. */
1140 switch (gimple_code (stmt))
1143 copy = copy_gimple_bind (stmt, id);
1147 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1148 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1151 case GIMPLE_EH_FILTER:
1152 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1153 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1157 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1158 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1159 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1162 case GIMPLE_WITH_CLEANUP_EXPR:
1163 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1164 copy = gimple_build_wce (s1);
1167 case GIMPLE_OMP_PARALLEL:
1168 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1169 copy = gimple_build_omp_parallel
1171 gimple_omp_parallel_clauses (stmt),
1172 gimple_omp_parallel_child_fn (stmt),
1173 gimple_omp_parallel_data_arg (stmt));
1176 case GIMPLE_OMP_TASK:
1177 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1178 copy = gimple_build_omp_task
1180 gimple_omp_task_clauses (stmt),
1181 gimple_omp_task_child_fn (stmt),
1182 gimple_omp_task_data_arg (stmt),
1183 gimple_omp_task_copy_fn (stmt),
1184 gimple_omp_task_arg_size (stmt),
1185 gimple_omp_task_arg_align (stmt));
1188 case GIMPLE_OMP_FOR:
1189 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1190 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1191 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1192 gimple_omp_for_collapse (stmt), s2);
1195 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1197 gimple_omp_for_set_index (copy, i,
1198 gimple_omp_for_index (stmt, i));
1199 gimple_omp_for_set_initial (copy, i,
1200 gimple_omp_for_initial (stmt, i));
1201 gimple_omp_for_set_final (copy, i,
1202 gimple_omp_for_final (stmt, i));
1203 gimple_omp_for_set_incr (copy, i,
1204 gimple_omp_for_incr (stmt, i));
1205 gimple_omp_for_set_cond (copy, i,
1206 gimple_omp_for_cond (stmt, i));
1211 case GIMPLE_OMP_MASTER:
1212 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1213 copy = gimple_build_omp_master (s1);
1216 case GIMPLE_OMP_ORDERED:
1217 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1218 copy = gimple_build_omp_ordered (s1);
1221 case GIMPLE_OMP_SECTION:
1222 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1223 copy = gimple_build_omp_section (s1);
1226 case GIMPLE_OMP_SECTIONS:
1227 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1228 copy = gimple_build_omp_sections
1229 (s1, gimple_omp_sections_clauses (stmt));
1232 case GIMPLE_OMP_SINGLE:
1233 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1234 copy = gimple_build_omp_single
1235 (s1, gimple_omp_single_clauses (stmt));
1238 case GIMPLE_OMP_CRITICAL:
1239 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1241 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1250 if (gimple_assign_copy_p (stmt)
1251 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1252 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1254 /* Here we handle statements that are not completely rewritten.
1255 First we detect some inlining-induced bogosities for
1258 /* Some assignments VAR = VAR; don't generate any rtl code
1259 and thus don't count as variable modification. Avoid
1260 keeping bogosities like 0 = 0. */
1261 tree decl = gimple_assign_lhs (stmt), value;
1264 n = (tree *) pointer_map_contains (id->decl_map, decl);
1268 STRIP_TYPE_NOPS (value);
1269 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1270 return gimple_build_nop ();
1274 /* Create a new deep copy of the statement. */
1275 copy = gimple_copy (stmt);
1278 /* If STMT has a block defined, map it to the newly constructed
1279 block. When inlining we want statements without a block to
1280 appear in the block of the function call. */
1281 new_block = id->block;
1282 if (gimple_block (copy))
1285 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1290 gimple_set_block (copy, new_block);
1292 /* Remap all the operands in COPY. */
1293 memset (&wi, 0, sizeof (wi));
1296 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1298 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1300 /* We have to handle EH region remapping of GIMPLE_RESX specially because
1301 the region number is not an operand. */
1302 if (gimple_code (stmt) == GIMPLE_RESX && id->eh_region_offset)
1304 gimple_resx_set_region (copy, gimple_resx_region (stmt) + id->eh_region_offset);
1310 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1314 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1315 gcov_type count_scale)
1317 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1318 basic_block copy_basic_block;
1321 /* create_basic_block() will append every new block to
1322 basic_block_info automatically. */
1323 copy_basic_block = create_basic_block (NULL, (void *) 0,
1324 (basic_block) bb->prev_bb->aux);
1325 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1327 /* We are going to rebuild frequencies from scratch. These values
1328 have just small importance to drive canonicalize_loop_headers. */
1329 copy_basic_block->frequency = ((gcov_type)bb->frequency
1330 * frequency_scale / REG_BR_PROB_BASE);
1332 if (copy_basic_block->frequency > BB_FREQ_MAX)
1333 copy_basic_block->frequency = BB_FREQ_MAX;
1335 copy_gsi = gsi_start_bb (copy_basic_block);
1337 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1339 gimple stmt = gsi_stmt (gsi);
1340 gimple orig_stmt = stmt;
1342 id->regimplify = false;
1343 stmt = remap_gimple_stmt (stmt, id);
1344 if (gimple_nop_p (stmt))
1347 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1350 /* With return slot optimization we can end up with
1351 non-gimple (foo *)&this->m, fix that here. */
1352 if (is_gimple_assign (stmt)
1353 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1354 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1357 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1358 gimple_assign_rhs1 (stmt),
1359 true, NULL, true, GSI_SAME_STMT);
1360 gimple_assign_set_rhs1 (stmt, new_rhs);
1361 id->regimplify = false;
1364 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1367 gimple_regimplify_operands (stmt, &seq_gsi);
1369 /* If copy_basic_block has been empty at the start of this iteration,
1370 call gsi_start_bb again to get at the newly added statements. */
1371 if (gsi_end_p (copy_gsi))
1372 copy_gsi = gsi_start_bb (copy_basic_block);
1374 gsi_next (©_gsi);
1376 /* Process the new statement. The call to gimple_regimplify_operands
1377 possibly turned the statement into multiple statements, we
1378 need to process all of them. */
1381 stmt = gsi_stmt (copy_gsi);
1382 if (is_gimple_call (stmt)
1383 && gimple_call_va_arg_pack_p (stmt)
1386 /* __builtin_va_arg_pack () should be replaced by
1387 all arguments corresponding to ... in the caller. */
1390 VEC(tree, heap) *argarray;
1391 size_t nargs = gimple_call_num_args (id->gimple_call);
1394 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1397 /* Create the new array of arguments. */
1398 n = nargs + gimple_call_num_args (stmt);
1399 argarray = VEC_alloc (tree, heap, n);
1400 VEC_safe_grow (tree, heap, argarray, n);
1402 /* Copy all the arguments before '...' */
1403 memcpy (VEC_address (tree, argarray),
1404 gimple_call_arg_ptr (stmt, 0),
1405 gimple_call_num_args (stmt) * sizeof (tree));
1407 /* Append the arguments passed in '...' */
1408 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1409 gimple_call_arg_ptr (id->gimple_call, 0)
1410 + (gimple_call_num_args (id->gimple_call) - nargs),
1411 nargs * sizeof (tree));
1413 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1416 VEC_free (tree, heap, argarray);
1418 /* Copy all GIMPLE_CALL flags, location and block, except
1419 GF_CALL_VA_ARG_PACK. */
1420 gimple_call_copy_flags (new_call, stmt);
1421 gimple_call_set_va_arg_pack (new_call, false);
1422 gimple_set_location (new_call, gimple_location (stmt));
1423 gimple_set_block (new_call, gimple_block (stmt));
1424 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1426 gsi_replace (©_gsi, new_call, false);
1427 gimple_set_bb (stmt, NULL);
1430 else if (is_gimple_call (stmt)
1432 && (decl = gimple_call_fndecl (stmt))
1433 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1434 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1436 /* __builtin_va_arg_pack_len () should be replaced by
1437 the number of anonymous arguments. */
1438 size_t nargs = gimple_call_num_args (id->gimple_call);
1442 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1445 count = build_int_cst (integer_type_node, nargs);
1446 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1447 gsi_replace (©_gsi, new_stmt, false);
1451 /* Statements produced by inlining can be unfolded, especially
1452 when we constant propagated some operands. We can't fold
1453 them right now for two reasons:
1454 1) folding require SSA_NAME_DEF_STMTs to be correct
1455 2) we can't change function calls to builtins.
1456 So we just mark statement for later folding. We mark
1457 all new statements, instead just statements that has changed
1458 by some nontrivial substitution so even statements made
1459 foldable indirectly are updated. If this turns out to be
1460 expensive, copy_body can be told to watch for nontrivial
1462 if (id->statements_to_fold)
1463 pointer_set_insert (id->statements_to_fold, stmt);
1465 /* We're duplicating a CALL_EXPR. Find any corresponding
1466 callgraph edges and update or duplicate them. */
1467 if (is_gimple_call (stmt))
1469 struct cgraph_node *node;
1470 struct cgraph_edge *edge;
1473 switch (id->transform_call_graph_edges)
1475 case CB_CGE_DUPLICATE:
1476 edge = cgraph_edge (id->src_node, orig_stmt);
1478 cgraph_clone_edge (edge, id->dst_node, stmt,
1479 REG_BR_PROB_BASE, 1,
1480 edge->frequency, true);
1483 case CB_CGE_MOVE_CLONES:
1484 for (node = id->dst_node->next_clone;
1486 node = node->next_clone)
1488 edge = cgraph_edge (node, orig_stmt);
1490 cgraph_set_call_stmt (edge, stmt);
1495 edge = cgraph_edge (id->dst_node, orig_stmt);
1497 cgraph_set_call_stmt (edge, stmt);
1504 flags = gimple_call_flags (stmt);
1506 if (flags & ECF_MAY_BE_ALLOCA)
1507 cfun->calls_alloca = true;
1508 if (flags & ECF_RETURNS_TWICE)
1509 cfun->calls_setjmp = true;
1512 /* If you think we can abort here, you are wrong.
1513 There is no region 0 in gimple. */
1514 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) != 0);
1516 if (stmt_could_throw_p (stmt)
1517 /* When we are cloning for inlining, we are supposed to
1518 construct a clone that calls precisely the same functions
1519 as original. However IPA optimizers might've proved
1520 earlier some function calls as non-trapping that might
1521 render some basic blocks dead that might become
1524 We can't update SSA with unreachable blocks in CFG and thus
1525 we prevent the scenario by preserving even the "dead" eh
1526 edges until the point they are later removed by
1528 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
1529 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
1531 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
1533 /* Add an entry for the copied tree in the EH hashtable.
1534 When cloning or versioning, use the hashtable in
1535 cfun, and just copy the EH number. When inlining, use the
1536 hashtable in the caller, and adjust the region number. */
1538 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
1540 /* If this tree doesn't have a region associated with it,
1541 and there is a "current region,"
1542 then associate this tree with the current region
1543 and add edges associated with this region. */
1544 if (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) <= 0
1545 && id->eh_region > 0
1546 && stmt_could_throw_p (stmt))
1547 add_stmt_to_eh_region (stmt, id->eh_region);
1550 if (gimple_in_ssa_p (cfun))
1555 find_new_referenced_vars (gsi_stmt (copy_gsi));
1556 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1557 if (TREE_CODE (def) == SSA_NAME)
1558 SSA_NAME_DEF_STMT (def) = stmt;
1561 gsi_next (©_gsi);
1563 while (!gsi_end_p (copy_gsi));
1565 copy_gsi = gsi_last_bb (copy_basic_block);
1568 return copy_basic_block;
1571 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1572 form is quite easy, since dominator relationship for old basic blocks does
1575 There is however exception where inlining might change dominator relation
1576 across EH edges from basic block within inlined functions destinating
1577 to landing pads in function we inline into.
1579 The function fills in PHI_RESULTs of such PHI nodes if they refer
1580 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1581 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1582 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1583 set, and this means that there will be no overlapping live ranges
1584 for the underlying symbol.
1586 This might change in future if we allow redirecting of EH edges and
1587 we might want to change way build CFG pre-inlining to include
1588 all the possible edges then. */
1590 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1591 bool can_throw, bool nonlocal_goto)
1596 FOR_EACH_EDGE (e, ei, bb->succs)
1598 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1601 gimple_stmt_iterator si;
1603 gcc_assert (e->flags & EDGE_ABNORMAL);
1606 gcc_assert (e->flags & EDGE_EH);
1609 gcc_assert (!(e->flags & EDGE_EH));
1611 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1615 phi = gsi_stmt (si);
1617 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1618 gcc_assert (!e->dest->aux);
1620 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1622 if (!is_gimple_reg (PHI_RESULT (phi)))
1624 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1628 re = find_edge (ret_bb, e->dest);
1630 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1631 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1633 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1634 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1640 /* Copy edges from BB into its copy constructed earlier, scale profile
1641 accordingly. Edges will be taken care of later. Assume aux
1642 pointers to point to the copies of each BB. */
1645 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1647 basic_block new_bb = (basic_block) bb->aux;
1650 gimple_stmt_iterator si;
1653 /* Use the indices from the original blocks to create edges for the
1655 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1656 if (!(old_edge->flags & EDGE_EH))
1660 flags = old_edge->flags;
1662 /* Return edges do get a FALLTHRU flag when the get inlined. */
1663 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1664 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1665 flags |= EDGE_FALLTHRU;
1666 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1667 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1668 new_edge->probability = old_edge->probability;
1671 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1674 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1677 bool can_throw, nonlocal_goto;
1679 copy_stmt = gsi_stmt (si);
1680 update_stmt (copy_stmt);
1681 if (gimple_in_ssa_p (cfun))
1682 mark_symbols_for_renaming (copy_stmt);
1684 /* Do this before the possible split_block. */
1687 /* If this tree could throw an exception, there are two
1688 cases where we need to add abnormal edge(s): the
1689 tree wasn't in a region and there is a "current
1690 region" in the caller; or the original tree had
1691 EH edges. In both cases split the block after the tree,
1692 and add abnormal edge(s) as needed; we need both
1693 those from the callee and the caller.
1694 We check whether the copy can throw, because the const
1695 propagation can change an INDIRECT_REF which throws
1696 into a COMPONENT_REF which doesn't. If the copy
1697 can throw, the original could also throw. */
1698 can_throw = stmt_can_throw_internal (copy_stmt);
1699 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1701 if (can_throw || nonlocal_goto)
1703 if (!gsi_end_p (si))
1704 /* Note that bb's predecessor edges aren't necessarily
1705 right at this point; split_block doesn't care. */
1707 edge e = split_block (new_bb, copy_stmt);
1710 new_bb->aux = e->src->aux;
1711 si = gsi_start_bb (new_bb);
1716 make_eh_edges (copy_stmt);
1719 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1721 if ((can_throw || nonlocal_goto)
1722 && gimple_in_ssa_p (cfun))
1723 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1724 can_throw, nonlocal_goto);
1728 /* Copy the PHIs. All blocks and edges are copied, some blocks
1729 was possibly split and new outgoing EH edges inserted.
1730 BB points to the block of original function and AUX pointers links
1731 the original and newly copied blocks. */
1734 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1736 basic_block const new_bb = (basic_block) bb->aux;
1739 gimple_stmt_iterator si;
1741 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1747 phi = gsi_stmt (si);
1748 res = PHI_RESULT (phi);
1750 if (is_gimple_reg (res))
1752 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1753 SSA_NAME_DEF_STMT (new_res)
1754 = new_phi = create_phi_node (new_res, new_bb);
1755 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1758 = find_edge ((basic_block) new_edge->src->aux, bb);
1759 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1761 tree block = id->block;
1762 id->block = NULL_TREE;
1763 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1765 gcc_assert (new_arg);
1766 /* With return slot optimization we can end up with
1767 non-gimple (foo *)&this->m, fix that here. */
1768 if (TREE_CODE (new_arg) != SSA_NAME
1769 && TREE_CODE (new_arg) != FUNCTION_DECL
1770 && !is_gimple_val (new_arg))
1772 gimple_seq stmts = NULL;
1773 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1774 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1776 add_phi_arg (new_phi, new_arg, new_edge);
1783 /* Wrapper for remap_decl so it can be used as a callback. */
1786 remap_decl_1 (tree decl, void *data)
1788 return remap_decl (decl, (copy_body_data *) data);
1791 /* Build struct function and associated datastructures for the new clone
1792 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1795 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1798 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1799 gcov_type count_scale, frequency_scale;
1801 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1802 count_scale = (REG_BR_PROB_BASE * count
1803 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1807 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1808 frequency_scale = (REG_BR_PROB_BASE * frequency
1810 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1812 frequency_scale = count_scale;
1814 /* Register specific tree functions. */
1815 gimple_register_cfg_hooks ();
1817 /* Get clean struct function. */
1818 push_struct_function (new_fndecl);
1820 /* We will rebuild these, so just sanity check that they are empty. */
1821 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
1822 gcc_assert (cfun->local_decls == NULL);
1823 gcc_assert (cfun->cfg == NULL);
1824 gcc_assert (cfun->decl == new_fndecl);
1826 /* Copy items we preserve during clonning. */
1827 cfun->static_chain_decl = src_cfun->static_chain_decl;
1828 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
1829 cfun->function_end_locus = src_cfun->function_end_locus;
1830 cfun->curr_properties = src_cfun->curr_properties;
1831 cfun->last_verified = src_cfun->last_verified;
1832 if (src_cfun->ipa_transforms_to_apply)
1833 cfun->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
1834 src_cfun->ipa_transforms_to_apply);
1835 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
1836 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
1837 cfun->function_frequency = src_cfun->function_frequency;
1838 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
1839 cfun->stdarg = src_cfun->stdarg;
1840 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
1841 cfun->after_inlining = src_cfun->after_inlining;
1842 cfun->returns_struct = src_cfun->returns_struct;
1843 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
1844 cfun->after_tree_profile = src_cfun->after_tree_profile;
1846 init_empty_tree_cfg ();
1848 ENTRY_BLOCK_PTR->count =
1849 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1851 ENTRY_BLOCK_PTR->frequency =
1852 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1853 frequency_scale / REG_BR_PROB_BASE);
1854 EXIT_BLOCK_PTR->count =
1855 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1857 EXIT_BLOCK_PTR->frequency =
1858 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1859 frequency_scale / REG_BR_PROB_BASE);
1861 init_eh_for_function ();
1863 if (src_cfun->gimple_df)
1865 init_tree_ssa (cfun);
1866 cfun->gimple_df->in_ssa_p = true;
1867 init_ssa_operands ();
1872 /* Make a copy of the body of FN so that it can be inserted inline in
1873 another function. Walks FN via CFG, returns new fndecl. */
1876 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1877 basic_block entry_block_map, basic_block exit_block_map)
1879 tree callee_fndecl = id->src_fn;
1880 /* Original cfun for the callee, doesn't change. */
1881 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1882 struct function *cfun_to_copy;
1884 tree new_fndecl = NULL;
1885 gcov_type count_scale, frequency_scale;
1888 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1889 count_scale = (REG_BR_PROB_BASE * count
1890 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1894 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1895 frequency_scale = (REG_BR_PROB_BASE * frequency
1897 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1899 frequency_scale = count_scale;
1901 /* Register specific tree functions. */
1902 gimple_register_cfg_hooks ();
1904 /* Must have a CFG here at this point. */
1905 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1906 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1908 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1910 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1911 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1912 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1913 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1915 /* Duplicate any exception-handling regions. */
1918 id->eh_region_offset
1919 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1923 /* Use aux pointers to map the original blocks to copy. */
1924 FOR_EACH_BB_FN (bb, cfun_to_copy)
1926 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
1931 last = last_basic_block;
1933 /* Now that we've duplicated the blocks, duplicate their edges. */
1934 FOR_ALL_BB_FN (bb, cfun_to_copy)
1935 copy_edges_for_bb (bb, count_scale, exit_block_map);
1937 if (gimple_in_ssa_p (cfun))
1938 FOR_ALL_BB_FN (bb, cfun_to_copy)
1939 copy_phis_for_bb (bb, id);
1941 FOR_ALL_BB_FN (bb, cfun_to_copy)
1943 ((basic_block)bb->aux)->aux = NULL;
1947 /* Zero out AUX fields of newly created block during EH edge
1949 for (; last < last_basic_block; last++)
1950 BASIC_BLOCK (last)->aux = NULL;
1951 entry_block_map->aux = NULL;
1952 exit_block_map->aux = NULL;
1958 copy_body (copy_body_data *id, gcov_type count, int frequency,
1959 basic_block entry_block_map, basic_block exit_block_map)
1961 tree fndecl = id->src_fn;
1964 /* If this body has a CFG, walk CFG and copy. */
1965 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
1966 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
1971 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1972 defined in function FN, or of a data member thereof. */
1975 self_inlining_addr_expr (tree value, tree fn)
1979 if (TREE_CODE (value) != ADDR_EXPR)
1982 var = get_base_address (TREE_OPERAND (value, 0));
1984 return var && auto_var_in_fn_p (var, fn);
1988 insert_init_stmt (basic_block bb, gimple init_stmt)
1990 /* If VAR represents a zero-sized variable, it's possible that the
1991 assignment statement may result in no gimple statements. */
1994 gimple_stmt_iterator si = gsi_last_bb (bb);
1996 /* We can end up with init statements that store to a non-register
1997 from a rhs with a conversion. Handle that here by forcing the
1998 rhs into a temporary. gimple_regimplify_operands is not
1999 prepared to do this for us. */
2000 if (!is_gimple_reg (gimple_assign_lhs (init_stmt))
2001 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2002 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2004 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2005 gimple_expr_type (init_stmt),
2006 gimple_assign_rhs1 (init_stmt));
2007 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2009 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2010 gimple_assign_set_rhs1 (init_stmt, rhs);
2012 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2013 gimple_regimplify_operands (init_stmt, &si);
2014 mark_symbols_for_renaming (init_stmt);
2018 /* Initialize parameter P with VALUE. If needed, produce init statement
2019 at the end of BB. When BB is NULL, we return init statement to be
2022 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2023 basic_block bb, tree *vars)
2025 gimple init_stmt = NULL;
2028 tree def = (gimple_in_ssa_p (cfun)
2029 ? gimple_default_def (id->src_cfun, p) : NULL);
2032 && value != error_mark_node
2033 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2035 if (fold_convertible_p (TREE_TYPE (p), value))
2036 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2038 /* ??? For valid (GIMPLE) programs we should not end up here.
2039 Still if something has gone wrong and we end up with truly
2040 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2041 to not leak invalid GIMPLE to the following passes. */
2042 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2045 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2046 we may not need to create a new variable here at all. Instead, we may
2047 be able to just use the argument value. */
2048 if (TREE_READONLY (p)
2049 && !TREE_ADDRESSABLE (p)
2050 && value && !TREE_SIDE_EFFECTS (value)
2053 /* We may produce non-gimple trees by adding NOPs or introduce
2054 invalid sharing when operand is not really constant.
2055 It is not big deal to prohibit constant propagation here as
2056 we will constant propagate in DOM1 pass anyway. */
2057 if (is_gimple_min_invariant (value)
2058 && useless_type_conversion_p (TREE_TYPE (p),
2060 /* We have to be very careful about ADDR_EXPR. Make sure
2061 the base variable isn't a local variable of the inlined
2062 function, e.g., when doing recursive inlining, direct or
2063 mutually-recursive or whatever, which is why we don't
2064 just test whether fn == current_function_decl. */
2065 && ! self_inlining_addr_expr (value, fn))
2067 insert_decl_map (id, p, value);
2072 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2073 here since the type of this decl must be visible to the calling
2075 var = copy_decl_to_var (p, id);
2076 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2079 add_referenced_var (var);
2082 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2083 that way, when the PARM_DECL is encountered, it will be
2084 automatically replaced by the VAR_DECL. */
2085 insert_decl_map (id, p, var);
2087 /* Declare this new variable. */
2088 TREE_CHAIN (var) = *vars;
2091 /* Make gimplifier happy about this variable. */
2092 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2094 /* Even if P was TREE_READONLY, the new VAR should not be.
2095 In the original code, we would have constructed a
2096 temporary, and then the function body would have never
2097 changed the value of P. However, now, we will be
2098 constructing VAR directly. The constructor body may
2099 change its value multiple times as it is being
2100 constructed. Therefore, it must not be TREE_READONLY;
2101 the back-end assumes that TREE_READONLY variable is
2102 assigned to only once. */
2103 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2104 TREE_READONLY (var) = 0;
2106 /* If there is no setup required and we are in SSA, take the easy route
2107 replacing all SSA names representing the function parameter by the
2108 SSA name passed to function.
2110 We need to construct map for the variable anyway as it might be used
2111 in different SSA names when parameter is set in function.
2113 FIXME: This usually kills the last connection in between inlined
2114 function parameter and the actual value in debug info. Can we do
2115 better here? If we just inserted the statement, copy propagation
2116 would kill it anyway as it always did in older versions of GCC.
2118 We might want to introduce a notion that single SSA_NAME might
2119 represent multiple variables for purposes of debugging. */
2120 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2122 && (TREE_CODE (rhs) == SSA_NAME
2123 || is_gimple_min_invariant (rhs))
2124 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2126 insert_decl_map (id, def, rhs);
2130 /* If the value of argument is never used, don't care about initializing
2132 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2134 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2138 /* Initialize this VAR_DECL from the equivalent argument. Convert
2139 the argument to the proper type in case it was promoted. */
2142 if (rhs == error_mark_node)
2144 insert_decl_map (id, p, var);
2148 STRIP_USELESS_TYPE_CONVERSION (rhs);
2150 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2151 keep our trees in gimple form. */
2152 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2154 def = remap_ssa_name (def, id);
2155 init_stmt = gimple_build_assign (def, rhs);
2156 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2157 set_default_def (var, NULL);
2160 init_stmt = gimple_build_assign (var, rhs);
2162 if (bb && init_stmt)
2163 insert_init_stmt (bb, init_stmt);
2168 /* Generate code to initialize the parameters of the function at the
2169 top of the stack in ID from the GIMPLE_CALL STMT. */
2172 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2173 tree fn, basic_block bb)
2178 tree vars = NULL_TREE;
2179 tree static_chain = gimple_call_chain (stmt);
2181 /* Figure out what the parameters are. */
2182 parms = DECL_ARGUMENTS (fn);
2184 /* Loop through the parameter declarations, replacing each with an
2185 equivalent VAR_DECL, appropriately initialized. */
2186 for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2189 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2190 setup_one_parameter (id, p, val, fn, bb, &vars);
2193 /* Initialize the static chain. */
2194 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2195 gcc_assert (fn != current_function_decl);
2198 /* No static chain? Seems like a bug in tree-nested.c. */
2199 gcc_assert (static_chain);
2201 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2204 declare_inline_vars (id->block, vars);
2208 /* Declare a return variable to replace the RESULT_DECL for the
2209 function we are calling. An appropriate DECL_STMT is returned.
2210 The USE_STMT is filled to contain a use of the declaration to
2211 indicate the return value of the function.
2213 RETURN_SLOT, if non-null is place where to store the result. It
2214 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2215 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2217 The return value is a (possibly null) value that is the result of the
2218 function as seen by the callee. *USE_P is a (possibly null) value that
2219 holds the result as seen by the caller. */
2222 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
2225 tree callee = id->src_fn;
2226 tree caller = id->dst_fn;
2227 tree result = DECL_RESULT (callee);
2228 tree callee_type = TREE_TYPE (result);
2229 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
2232 /* We don't need to do anything for functions that don't return
2234 if (!result || VOID_TYPE_P (callee_type))
2240 /* If there was a return slot, then the return value is the
2241 dereferenced address of that object. */
2244 /* The front end shouldn't have used both return_slot and
2245 a modify expression. */
2246 gcc_assert (!modify_dest);
2247 if (DECL_BY_REFERENCE (result))
2249 tree return_slot_addr = build_fold_addr_expr (return_slot);
2250 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2252 /* We are going to construct *&return_slot and we can't do that
2253 for variables believed to be not addressable.
2255 FIXME: This check possibly can match, because values returned
2256 via return slot optimization are not believed to have address
2257 taken by alias analysis. */
2258 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2259 if (gimple_in_ssa_p (cfun))
2261 HOST_WIDE_INT bitsize;
2262 HOST_WIDE_INT bitpos;
2264 enum machine_mode mode;
2268 base = get_inner_reference (return_slot, &bitsize, &bitpos,
2270 &mode, &unsignedp, &volatilep,
2272 if (TREE_CODE (base) == INDIRECT_REF)
2273 base = TREE_OPERAND (base, 0);
2274 if (TREE_CODE (base) == SSA_NAME)
2275 base = SSA_NAME_VAR (base);
2276 mark_sym_for_renaming (base);
2278 var = return_slot_addr;
2283 gcc_assert (TREE_CODE (var) != SSA_NAME);
2284 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2286 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2287 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2288 && !DECL_GIMPLE_REG_P (result)
2290 DECL_GIMPLE_REG_P (var) = 0;
2295 /* All types requiring non-trivial constructors should have been handled. */
2296 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2298 /* Attempt to avoid creating a new temporary variable. */
2300 && TREE_CODE (modify_dest) != SSA_NAME)
2302 bool use_it = false;
2304 /* We can't use MODIFY_DEST if there's type promotion involved. */
2305 if (!useless_type_conversion_p (callee_type, caller_type))
2308 /* ??? If we're assigning to a variable sized type, then we must
2309 reuse the destination variable, because we've no good way to
2310 create variable sized temporaries at this point. */
2311 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2314 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2315 reuse it as the result of the call directly. Don't do this if
2316 it would promote MODIFY_DEST to addressable. */
2317 else if (TREE_ADDRESSABLE (result))
2321 tree base_m = get_base_address (modify_dest);
2323 /* If the base isn't a decl, then it's a pointer, and we don't
2324 know where that's going to go. */
2325 if (!DECL_P (base_m))
2327 else if (is_global_var (base_m))
2329 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2330 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2331 && !DECL_GIMPLE_REG_P (result)
2332 && DECL_GIMPLE_REG_P (base_m))
2334 else if (!TREE_ADDRESSABLE (base_m))
2346 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2348 var = copy_result_decl_to_var (result, id);
2349 if (gimple_in_ssa_p (cfun))
2352 add_referenced_var (var);
2355 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2356 DECL_STRUCT_FUNCTION (caller)->local_decls
2357 = tree_cons (NULL_TREE, var,
2358 DECL_STRUCT_FUNCTION (caller)->local_decls);
2360 /* Do not have the rest of GCC warn about this variable as it should
2361 not be visible to the user. */
2362 TREE_NO_WARNING (var) = 1;
2364 declare_inline_vars (id->block, var);
2366 /* Build the use expr. If the return type of the function was
2367 promoted, convert it back to the expected type. */
2369 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2370 use = fold_convert (caller_type, var);
2372 STRIP_USELESS_TYPE_CONVERSION (use);
2374 if (DECL_BY_REFERENCE (result))
2375 var = build_fold_addr_expr (var);
2378 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2379 way, when the RESULT_DECL is encountered, it will be
2380 automatically replaced by the VAR_DECL. */
2381 insert_decl_map (id, result, var);
2383 /* Remember this so we can ignore it in remap_decls. */
2390 /* Returns nonzero if a function can be inlined as a tree. */
2393 tree_inlinable_function_p (tree fn)
2395 return inlinable_function_p (fn);
2398 static const char *inline_forbidden_reason;
2400 /* A callback for walk_gimple_seq to handle tree operands. Returns
2401 NULL_TREE if a function can be inlined, otherwise sets the reason
2402 why not and returns a tree representing the offending operand. */
2405 inline_forbidden_p_op (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
2406 void *fnp ATTRIBUTE_UNUSED)
2411 if (TREE_CODE (node) == RECORD_TYPE || TREE_CODE (node) == UNION_TYPE)
2413 /* We cannot inline a function of the form
2415 void F (int i) { struct S { int ar[i]; } s; }
2417 Attempting to do so produces a catch-22.
2418 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
2419 UNION_TYPE nodes, then it goes into infinite recursion on a
2420 structure containing a pointer to its own type. If it doesn't,
2421 then the type node for S doesn't get adjusted properly when
2424 ??? This is likely no longer true, but it's too late in the 4.0
2425 cycle to try to find out. This should be checked for 4.1. */
2426 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
2427 if (variably_modified_type_p (TREE_TYPE (t), NULL))
2429 inline_forbidden_reason
2430 = G_("function %q+F can never be inlined "
2431 "because it uses variable sized variables");
2440 /* A callback for walk_gimple_seq to handle statements. Returns
2441 non-NULL iff a function can not be inlined. Also sets the reason
2445 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2446 struct walk_stmt_info *wip)
2448 tree fn = (tree) wip->info;
2450 gimple stmt = gsi_stmt (*gsi);
2452 switch (gimple_code (stmt))
2455 /* Refuse to inline alloca call unless user explicitly forced so as
2456 this may change program's memory overhead drastically when the
2457 function using alloca is called in loop. In GCC present in
2458 SPEC2000 inlining into schedule_block cause it to require 2GB of
2459 RAM instead of 256MB. */
2460 if (gimple_alloca_call_p (stmt)
2461 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2463 inline_forbidden_reason
2464 = G_("function %q+F can never be inlined because it uses "
2465 "alloca (override using the always_inline attribute)");
2466 *handled_ops_p = true;
2470 t = gimple_call_fndecl (stmt);
2474 /* We cannot inline functions that call setjmp. */
2475 if (setjmp_call_p (t))
2477 inline_forbidden_reason
2478 = G_("function %q+F can never be inlined because it uses setjmp");
2479 *handled_ops_p = true;
2483 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2484 switch (DECL_FUNCTION_CODE (t))
2486 /* We cannot inline functions that take a variable number of
2488 case BUILT_IN_VA_START:
2489 case BUILT_IN_NEXT_ARG:
2490 case BUILT_IN_VA_END:
2491 inline_forbidden_reason
2492 = G_("function %q+F can never be inlined because it "
2493 "uses variable argument lists");
2494 *handled_ops_p = true;
2497 case BUILT_IN_LONGJMP:
2498 /* We can't inline functions that call __builtin_longjmp at
2499 all. The non-local goto machinery really requires the
2500 destination be in a different function. If we allow the
2501 function calling __builtin_longjmp to be inlined into the
2502 function calling __builtin_setjmp, Things will Go Awry. */
2503 inline_forbidden_reason
2504 = G_("function %q+F can never be inlined because "
2505 "it uses setjmp-longjmp exception handling");
2506 *handled_ops_p = true;
2509 case BUILT_IN_NONLOCAL_GOTO:
2511 inline_forbidden_reason
2512 = G_("function %q+F can never be inlined because "
2513 "it uses non-local goto");
2514 *handled_ops_p = true;
2517 case BUILT_IN_RETURN:
2518 case BUILT_IN_APPLY_ARGS:
2519 /* If a __builtin_apply_args caller would be inlined,
2520 it would be saving arguments of the function it has
2521 been inlined into. Similarly __builtin_return would
2522 return from the function the inline has been inlined into. */
2523 inline_forbidden_reason
2524 = G_("function %q+F can never be inlined because "
2525 "it uses __builtin_return or __builtin_apply_args");
2526 *handled_ops_p = true;
2535 t = gimple_goto_dest (stmt);
2537 /* We will not inline a function which uses computed goto. The
2538 addresses of its local labels, which may be tucked into
2539 global storage, are of course not constant across
2540 instantiations, which causes unexpected behavior. */
2541 if (TREE_CODE (t) != LABEL_DECL)
2543 inline_forbidden_reason
2544 = G_("function %q+F can never be inlined "
2545 "because it contains a computed goto");
2546 *handled_ops_p = true;
2552 t = gimple_label_label (stmt);
2553 if (DECL_NONLOCAL (t))
2555 /* We cannot inline a function that receives a non-local goto
2556 because we cannot remap the destination label used in the
2557 function that is performing the non-local goto. */
2558 inline_forbidden_reason
2559 = G_("function %q+F can never be inlined "
2560 "because it receives a non-local goto");
2561 *handled_ops_p = true;
2570 *handled_ops_p = false;
2576 inline_forbidden_p_2 (tree *nodep, int *walk_subtrees,
2580 tree fn = (tree) fnp;
2582 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2584 inline_forbidden_reason
2585 = G_("function %q+F can never be inlined "
2586 "because it saves address of local label in a static variable");
2596 /* Return true if FNDECL is a function that cannot be inlined into
2600 inline_forbidden_p (tree fndecl)
2602 location_t saved_loc = input_location;
2603 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2605 struct walk_stmt_info wi;
2606 struct pointer_set_t *visited_nodes;
2608 bool forbidden_p = false;
2610 visited_nodes = pointer_set_create ();
2611 memset (&wi, 0, sizeof (wi));
2612 wi.info = (void *) fndecl;
2613 wi.pset = visited_nodes;
2615 FOR_EACH_BB_FN (bb, fun)
2618 gimple_seq seq = bb_seq (bb);
2619 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt,
2620 inline_forbidden_p_op, &wi);
2621 forbidden_p = (ret != NULL);
2626 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2628 tree decl = TREE_VALUE (step);
2629 if (TREE_CODE (decl) == VAR_DECL
2630 && TREE_STATIC (decl)
2631 && !DECL_EXTERNAL (decl)
2632 && DECL_INITIAL (decl))
2635 ret = walk_tree_without_duplicates (&DECL_INITIAL (decl),
2636 inline_forbidden_p_2, fndecl);
2637 forbidden_p = (ret != NULL);
2644 pointer_set_destroy (visited_nodes);
2645 input_location = saved_loc;
2649 /* Returns nonzero if FN is a function that does not have any
2650 fundamental inline blocking properties. */
2653 inlinable_function_p (tree fn)
2655 bool inlinable = true;
2659 /* If we've already decided this function shouldn't be inlined,
2660 there's no need to check again. */
2661 if (DECL_UNINLINABLE (fn))
2664 /* We only warn for functions declared `inline' by the user. */
2665 do_warning = (warn_inline
2666 && DECL_DECLARED_INLINE_P (fn)
2667 && !DECL_NO_INLINE_WARNING_P (fn)
2668 && !DECL_IN_SYSTEM_HEADER (fn));
2670 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2673 && always_inline == NULL)
2676 warning (OPT_Winline, "function %q+F can never be inlined because it "
2677 "is suppressed using -fno-inline", fn);
2681 /* Don't auto-inline anything that might not be bound within
2682 this unit of translation. */
2683 else if (!DECL_DECLARED_INLINE_P (fn)
2684 && DECL_REPLACEABLE_P (fn))
2687 else if (!function_attribute_inlinable_p (fn))
2690 warning (OPT_Winline, "function %q+F can never be inlined because it "
2691 "uses attributes conflicting with inlining", fn);
2695 else if (inline_forbidden_p (fn))
2697 /* See if we should warn about uninlinable functions. Previously,
2698 some of these warnings would be issued while trying to expand
2699 the function inline, but that would cause multiple warnings
2700 about functions that would for example call alloca. But since
2701 this a property of the function, just one warning is enough.
2702 As a bonus we can now give more details about the reason why a
2703 function is not inlinable. */
2705 sorry (inline_forbidden_reason, fn);
2706 else if (do_warning)
2707 warning (OPT_Winline, inline_forbidden_reason, fn);
2712 /* Squirrel away the result so that we don't have to check again. */
2713 DECL_UNINLINABLE (fn) = !inlinable;
2718 /* Estimate the cost of a memory move. Use machine dependent
2719 word size and take possible memcpy call into account. */
2722 estimate_move_cost (tree type)
2726 size = int_size_in_bytes (type);
2728 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
2729 /* Cost of a memcpy call, 3 arguments and the call. */
2732 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
2735 /* Returns cost of operation CODE, according to WEIGHTS */
2738 estimate_operator_cost (enum tree_code code, eni_weights *weights)
2742 /* These are "free" conversions, or their presumed cost
2743 is folded into other operations. */
2750 /* Assign cost of 1 to usual operations.
2751 ??? We may consider mapping RTL costs to this. */
2756 case POINTER_PLUS_EXPR:
2760 case FIXED_CONVERT_EXPR:
2761 case FIX_TRUNC_EXPR:
2773 case VEC_LSHIFT_EXPR:
2774 case VEC_RSHIFT_EXPR:
2781 case TRUTH_ANDIF_EXPR:
2782 case TRUTH_ORIF_EXPR:
2783 case TRUTH_AND_EXPR:
2785 case TRUTH_XOR_EXPR:
2786 case TRUTH_NOT_EXPR:
2795 case UNORDERED_EXPR:
2806 case PREDECREMENT_EXPR:
2807 case PREINCREMENT_EXPR:
2808 case POSTDECREMENT_EXPR:
2809 case POSTINCREMENT_EXPR:
2811 case REALIGN_LOAD_EXPR:
2813 case REDUC_MAX_EXPR:
2814 case REDUC_MIN_EXPR:
2815 case REDUC_PLUS_EXPR:
2816 case WIDEN_SUM_EXPR:
2817 case WIDEN_MULT_EXPR:
2820 case VEC_WIDEN_MULT_HI_EXPR:
2821 case VEC_WIDEN_MULT_LO_EXPR:
2822 case VEC_UNPACK_HI_EXPR:
2823 case VEC_UNPACK_LO_EXPR:
2824 case VEC_UNPACK_FLOAT_HI_EXPR:
2825 case VEC_UNPACK_FLOAT_LO_EXPR:
2826 case VEC_PACK_TRUNC_EXPR:
2827 case VEC_PACK_SAT_EXPR:
2828 case VEC_PACK_FIX_TRUNC_EXPR:
2829 case VEC_EXTRACT_EVEN_EXPR:
2830 case VEC_EXTRACT_ODD_EXPR:
2831 case VEC_INTERLEAVE_HIGH_EXPR:
2832 case VEC_INTERLEAVE_LOW_EXPR:
2836 /* Few special cases of expensive operations. This is useful
2837 to avoid inlining on functions having too many of these. */
2838 case TRUNC_DIV_EXPR:
2840 case FLOOR_DIV_EXPR:
2841 case ROUND_DIV_EXPR:
2842 case EXACT_DIV_EXPR:
2843 case TRUNC_MOD_EXPR:
2845 case FLOOR_MOD_EXPR:
2846 case ROUND_MOD_EXPR:
2848 return weights->div_mod_cost;
2851 /* We expect a copy assignment with no operator. */
2852 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
2858 /* Estimate number of instructions that will be created by expanding
2859 the statements in the statement sequence STMTS.
2860 WEIGHTS contains weights attributed to various constructs. */
2863 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
2866 gimple_stmt_iterator gsi;
2869 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
2870 cost += estimate_num_insns (gsi_stmt (gsi), weights);
2876 /* Estimate number of instructions that will be created by expanding STMT.
2877 WEIGHTS contains weights attributed to various constructs. */
2880 estimate_num_insns (gimple stmt, eni_weights *weights)
2883 enum gimple_code code = gimple_code (stmt);
2889 /* Try to estimate the cost of assignments. We have three cases to
2891 1) Simple assignments to registers;
2892 2) Stores to things that must live in memory. This includes
2893 "normal" stores to scalars, but also assignments of large
2894 structures, or constructors of big arrays;
2896 Let us look at the first two cases, assuming we have "a = b + C":
2897 <GIMPLE_ASSIGN <var_decl "a">
2898 <plus_expr <var_decl "b"> <constant C>>
2899 If "a" is a GIMPLE register, the assignment to it is free on almost
2900 any target, because "a" usually ends up in a real register. Hence
2901 the only cost of this expression comes from the PLUS_EXPR, and we
2902 can ignore the GIMPLE_ASSIGN.
2903 If "a" is not a GIMPLE register, the assignment to "a" will most
2904 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
2905 of moving something into "a", which we compute using the function
2906 estimate_move_cost. */
2907 lhs = gimple_assign_lhs (stmt);
2908 if (is_gimple_reg (lhs))
2911 cost = estimate_move_cost (TREE_TYPE (lhs));
2913 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights);
2917 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights);
2921 /* Take into account cost of the switch + guess 2 conditional jumps for
2924 TODO: once the switch expansion logic is sufficiently separated, we can
2925 do better job on estimating cost of the switch. */
2926 cost = gimple_switch_num_labels (stmt) * 2;
2931 tree decl = gimple_call_fndecl (stmt);
2932 tree addr = gimple_call_fn (stmt);
2933 tree funtype = TREE_TYPE (addr);
2935 if (POINTER_TYPE_P (funtype))
2936 funtype = TREE_TYPE (funtype);
2938 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
2939 cost = weights->target_builtin_call_cost;
2941 cost = weights->call_cost;
2943 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
2944 switch (DECL_FUNCTION_CODE (decl))
2946 case BUILT_IN_CONSTANT_P:
2948 case BUILT_IN_EXPECT:
2952 /* Prefetch instruction is not expensive. */
2953 case BUILT_IN_PREFETCH:
2954 cost = weights->target_builtin_call_cost;
2962 funtype = TREE_TYPE (decl);
2964 /* Our cost must be kept in sync with
2965 cgraph_estimate_size_after_inlining that does use function
2966 declaration to figure out the arguments. */
2967 if (decl && DECL_ARGUMENTS (decl))
2970 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2971 cost += estimate_move_cost (TREE_TYPE (arg));
2973 else if (funtype && prototype_p (funtype))
2976 for (t = TYPE_ARG_TYPES (funtype); t; t = TREE_CHAIN (t))
2977 cost += estimate_move_cost (TREE_VALUE (t));
2981 for (i = 0; i < gimple_call_num_args (stmt); i++)
2983 tree arg = gimple_call_arg (stmt, i);
2984 cost += estimate_move_cost (TREE_TYPE (arg));
2996 case GIMPLE_CHANGE_DYNAMIC_TYPE:
2997 case GIMPLE_PREDICT:
3005 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3007 case GIMPLE_EH_FILTER:
3008 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3011 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3014 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3015 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3017 /* OpenMP directives are generally very expensive. */
3019 case GIMPLE_OMP_RETURN:
3020 case GIMPLE_OMP_SECTIONS_SWITCH:
3021 case GIMPLE_OMP_ATOMIC_STORE:
3022 case GIMPLE_OMP_CONTINUE:
3023 /* ...except these, which are cheap. */
3026 case GIMPLE_OMP_ATOMIC_LOAD:
3027 return weights->omp_cost;
3029 case GIMPLE_OMP_FOR:
3030 return (weights->omp_cost
3031 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3032 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3034 case GIMPLE_OMP_PARALLEL:
3035 case GIMPLE_OMP_TASK:
3036 case GIMPLE_OMP_CRITICAL:
3037 case GIMPLE_OMP_MASTER:
3038 case GIMPLE_OMP_ORDERED:
3039 case GIMPLE_OMP_SECTION:
3040 case GIMPLE_OMP_SECTIONS:
3041 case GIMPLE_OMP_SINGLE:
3042 return (weights->omp_cost
3043 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3052 /* Estimate number of instructions that will be created by expanding
3053 function FNDECL. WEIGHTS contains weights attributed to various
3057 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3059 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3060 gimple_stmt_iterator bsi;
3064 gcc_assert (my_function && my_function->cfg);
3065 FOR_EACH_BB_FN (bb, my_function)
3067 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3068 n += estimate_num_insns (gsi_stmt (bsi), weights);
3075 /* Initializes weights used by estimate_num_insns. */
3078 init_inline_once (void)
3080 eni_inlining_weights.call_cost = PARAM_VALUE (PARAM_INLINE_CALL_COST);
3081 eni_inlining_weights.target_builtin_call_cost = 1;
3082 eni_inlining_weights.div_mod_cost = 10;
3083 eni_inlining_weights.omp_cost = 40;
3085 eni_size_weights.call_cost = 1;
3086 eni_size_weights.target_builtin_call_cost = 1;
3087 eni_size_weights.div_mod_cost = 1;
3088 eni_size_weights.omp_cost = 40;
3090 /* Estimating time for call is difficult, since we have no idea what the
3091 called function does. In the current uses of eni_time_weights,
3092 underestimating the cost does less harm than overestimating it, so
3093 we choose a rather small value here. */
3094 eni_time_weights.call_cost = 10;
3095 eni_time_weights.target_builtin_call_cost = 10;
3096 eni_time_weights.div_mod_cost = 10;
3097 eni_time_weights.omp_cost = 40;
3100 /* Estimate the number of instructions in a gimple_seq. */
3103 count_insns_seq (gimple_seq seq, eni_weights *weights)
3105 gimple_stmt_iterator gsi;
3107 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3108 n += estimate_num_insns (gsi_stmt (gsi), weights);
3114 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3117 prepend_lexical_block (tree current_block, tree new_block)
3119 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3120 BLOCK_SUBBLOCKS (current_block) = new_block;
3121 BLOCK_SUPERCONTEXT (new_block) = current_block;
3124 /* Fetch callee declaration from the call graph edge going from NODE and
3125 associated with STMR call statement. Return NULL_TREE if not found. */
3127 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3129 struct cgraph_edge *cs;
3131 cs = cgraph_edge (node, stmt);
3133 return cs->callee->decl;
3138 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3141 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3143 tree retvar, use_retvar;
3145 struct pointer_map_t *st;
3148 location_t saved_location;
3149 struct cgraph_edge *cg_edge;
3151 basic_block return_block;
3153 gimple_stmt_iterator gsi, stmt_gsi;
3154 bool successfully_inlined = FALSE;
3155 bool purge_dead_abnormal_edges;
3159 /* Set input_location here so we get the right instantiation context
3160 if we call instantiate_decl from inlinable_function_p. */
3161 saved_location = input_location;
3162 if (gimple_has_location (stmt))
3163 input_location = gimple_location (stmt);
3165 /* From here on, we're only interested in CALL_EXPRs. */
3166 if (gimple_code (stmt) != GIMPLE_CALL)
3169 /* First, see if we can figure out what function is being called.
3170 If we cannot, then there is no hope of inlining the function. */
3171 fn = gimple_call_fndecl (stmt);
3174 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3179 /* Turn forward declarations into real ones. */
3180 fn = cgraph_node (fn)->decl;
3182 /* If FN is a declaration of a function in a nested scope that was
3183 globally declared inline, we don't set its DECL_INITIAL.
3184 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3185 C++ front-end uses it for cdtors to refer to their internal
3186 declarations, that are not real functions. Fortunately those
3187 don't have trees to be saved, so we can tell by checking their
3189 if (!DECL_INITIAL (fn)
3190 && DECL_ABSTRACT_ORIGIN (fn)
3191 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3192 fn = DECL_ABSTRACT_ORIGIN (fn);
3194 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3195 Kill this check once this is fixed. */
3196 if (!id->dst_node->analyzed)
3199 cg_edge = cgraph_edge (id->dst_node, stmt);
3201 /* Constant propagation on argument done during previous inlining
3202 may create new direct call. Produce an edge for it. */
3205 struct cgraph_node *dest = cgraph_node (fn);
3207 /* We have missing edge in the callgraph. This can happen in one case
3208 where previous inlining turned indirect call into direct call by
3209 constant propagating arguments. In all other cases we hit a bug
3210 (incorrect node sharing is most common reason for missing edges. */
3211 gcc_assert (dest->needed);
3212 cgraph_create_edge (id->dst_node, dest, stmt,
3213 bb->count, CGRAPH_FREQ_BASE,
3214 bb->loop_depth)->inline_failed
3215 = N_("originally indirect function call not considered for inlining");
3218 fprintf (dump_file, "Created new direct edge to %s",
3219 cgraph_node_name (dest));
3224 /* Don't try to inline functions that are not well-suited to
3226 if (!cgraph_inline_p (cg_edge, &reason))
3228 /* If this call was originally indirect, we do not want to emit any
3229 inlining related warnings or sorry messages because there are no
3230 guarantees regarding those. */
3231 if (cg_edge->indirect_call)
3234 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3235 /* Avoid warnings during early inline pass. */
3236 && cgraph_global_info_ready)
3238 sorry ("inlining failed in call to %q+F: %s", fn, reason);
3239 sorry ("called from here");
3241 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3242 && !DECL_IN_SYSTEM_HEADER (fn)
3244 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3245 /* Avoid warnings during early inline pass. */
3246 && cgraph_global_info_ready)
3248 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3250 warning (OPT_Winline, "called from here");
3254 fn = cg_edge->callee->decl;
3256 #ifdef ENABLE_CHECKING
3257 if (cg_edge->callee->decl != id->dst_node->decl)
3258 verify_cgraph_node (cg_edge->callee);
3261 /* We will be inlining this callee. */
3262 id->eh_region = lookup_stmt_eh_region (stmt);
3264 /* Split the block holding the GIMPLE_CALL. */
3265 e = split_block (bb, stmt);
3267 return_block = e->dest;
3270 /* split_block splits after the statement; work around this by
3271 moving the call into the second block manually. Not pretty,
3272 but seems easier than doing the CFG manipulation by hand
3273 when the GIMPLE_CALL is in the last statement of BB. */
3274 stmt_gsi = gsi_last_bb (bb);
3275 gsi_remove (&stmt_gsi, false);
3277 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3278 been the source of abnormal edges. In this case, schedule
3279 the removal of dead abnormal edges. */
3280 gsi = gsi_start_bb (return_block);
3281 if (gsi_end_p (gsi))
3283 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3284 purge_dead_abnormal_edges = true;
3288 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3289 purge_dead_abnormal_edges = false;
3292 stmt_gsi = gsi_start_bb (return_block);
3294 /* Build a block containing code to initialize the arguments, the
3295 actual inline expansion of the body, and a label for the return
3296 statements within the function to jump to. The type of the
3297 statement expression is the return type of the function call. */
3298 id->block = make_node (BLOCK);
3299 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3300 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3301 prepend_lexical_block (gimple_block (stmt), id->block);
3303 /* Local declarations will be replaced by their equivalents in this
3306 id->decl_map = pointer_map_create ();
3308 /* Record the function we are about to inline. */
3310 id->src_node = cg_edge->callee;
3311 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3312 id->gimple_call = stmt;
3314 gcc_assert (!id->src_cfun->after_inlining);
3317 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3319 gimple_stmt_iterator si = gsi_last_bb (bb);
3320 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3324 initialize_inlined_parameters (id, stmt, fn, bb);
3326 if (DECL_INITIAL (fn))
3327 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3329 /* Return statements in the function body will be replaced by jumps
3330 to the RET_LABEL. */
3331 gcc_assert (DECL_INITIAL (fn));
3332 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3334 /* Find the LHS to which the result of this call is assigned. */
3336 if (gimple_call_lhs (stmt))
3338 modify_dest = gimple_call_lhs (stmt);
3340 /* The function which we are inlining might not return a value,
3341 in which case we should issue a warning that the function
3342 does not return a value. In that case the optimizers will
3343 see that the variable to which the value is assigned was not
3344 initialized. We do not want to issue a warning about that
3345 uninitialized variable. */
3346 if (DECL_P (modify_dest))
3347 TREE_NO_WARNING (modify_dest) = 1;
3349 if (gimple_call_return_slot_opt_p (stmt))
3351 return_slot = modify_dest;
3358 /* If we are inlining a call to the C++ operator new, we don't want
3359 to use type based alias analysis on the return value. Otherwise
3360 we may get confused if the compiler sees that the inlined new
3361 function returns a pointer which was just deleted. See bug
3363 if (DECL_IS_OPERATOR_NEW (fn))
3369 /* Declare the return variable for the function. */
3370 retvar = declare_return_variable (id, return_slot, modify_dest, &use_retvar);
3372 if (DECL_IS_OPERATOR_NEW (fn))
3374 gcc_assert (TREE_CODE (retvar) == VAR_DECL
3375 && POINTER_TYPE_P (TREE_TYPE (retvar)));
3376 DECL_NO_TBAA_P (retvar) = 1;
3379 /* Add local vars in this inlined callee to caller. */
3380 t_step = id->src_cfun->local_decls;
3381 for (; t_step; t_step = TREE_CHAIN (t_step))
3383 var = TREE_VALUE (t_step);
3384 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3386 if (var_ann (var) && referenced_var_check_and_insert (var))
3387 cfun->local_decls = tree_cons (NULL_TREE, var,
3390 else if (!can_be_nonlocal (var, id))
3391 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3395 /* This is it. Duplicate the callee body. Assume callee is
3396 pre-gimplified. Note that we must not alter the caller
3397 function in any way before this point, as this CALL_EXPR may be
3398 a self-referential call; if we're calling ourselves, we need to
3399 duplicate our body before altering anything. */
3400 copy_body (id, bb->count, bb->frequency, bb, return_block);
3403 pointer_map_destroy (id->decl_map);
3406 /* If the inlined function returns a result that we care about,
3407 substitute the GIMPLE_CALL with an assignment of the return
3408 variable to the LHS of the call. That is, if STMT was
3409 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3410 if (use_retvar && gimple_call_lhs (stmt))
3412 gimple old_stmt = stmt;
3413 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3414 gsi_replace (&stmt_gsi, stmt, false);
3415 if (gimple_in_ssa_p (cfun))
3418 mark_symbols_for_renaming (stmt);
3420 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3424 /* Handle the case of inlining a function with no return
3425 statement, which causes the return value to become undefined. */
3426 if (gimple_call_lhs (stmt)
3427 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3429 tree name = gimple_call_lhs (stmt);
3430 tree var = SSA_NAME_VAR (name);
3431 tree def = gimple_default_def (cfun, var);
3435 /* If the variable is used undefined, make this name
3436 undefined via a move. */
3437 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3438 gsi_replace (&stmt_gsi, stmt, true);
3443 /* Otherwise make this variable undefined. */
3444 gsi_remove (&stmt_gsi, true);
3445 set_default_def (var, name);
3446 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3450 gsi_remove (&stmt_gsi, true);
3453 if (purge_dead_abnormal_edges)
3454 gimple_purge_dead_abnormal_call_edges (return_block);
3456 /* If the value of the new expression is ignored, that's OK. We
3457 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3458 the equivalent inlined version either. */
3459 if (is_gimple_assign (stmt))
3461 gcc_assert (gimple_assign_single_p (stmt)
3462 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3463 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3466 /* Output the inlining info for this abstract function, since it has been
3467 inlined. If we don't do this now, we can lose the information about the
3468 variables in the function when the blocks get blown away as soon as we
3469 remove the cgraph node. */
3470 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3472 /* Update callgraph if needed. */
3473 cgraph_remove_node (cg_edge->callee);
3475 id->block = NULL_TREE;
3476 successfully_inlined = TRUE;
3479 input_location = saved_location;
3480 return successfully_inlined;
3483 /* Expand call statements reachable from STMT_P.
3484 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3485 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3486 unfortunately not use that function here because we need a pointer
3487 to the CALL_EXPR, not the tree itself. */
3490 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
3492 gimple_stmt_iterator gsi;
3494 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3496 gimple stmt = gsi_stmt (gsi);
3498 if (is_gimple_call (stmt)
3499 && expand_call_inline (bb, stmt, id))
3507 /* Walk all basic blocks created after FIRST and try to fold every statement
3508 in the STATEMENTS pointer set. */
3511 fold_marked_statements (int first, struct pointer_set_t *statements)
3513 for (; first < n_basic_blocks; first++)
3514 if (BASIC_BLOCK (first))
3516 gimple_stmt_iterator gsi;
3518 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
3521 if (pointer_set_contains (statements, gsi_stmt (gsi)))
3523 gimple old_stmt = gsi_stmt (gsi);
3525 if (fold_stmt (&gsi))
3527 /* Re-read the statement from GSI as fold_stmt() may
3529 gimple new_stmt = gsi_stmt (gsi);
3530 update_stmt (new_stmt);
3532 if (is_gimple_call (old_stmt))
3533 cgraph_update_edges_for_call_stmt (old_stmt, new_stmt);
3535 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
3536 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3542 /* Return true if BB has at least one abnormal outgoing edge. */
3545 has_abnormal_outgoing_edge_p (basic_block bb)
3550 FOR_EACH_EDGE (e, ei, bb->succs)
3551 if (e->flags & EDGE_ABNORMAL)
3557 /* Expand calls to inline functions in the body of FN. */
3560 optimize_inline_calls (tree fn)
3565 int last = n_basic_blocks;
3566 struct gimplify_ctx gctx;
3568 /* There is no point in performing inlining if errors have already
3569 occurred -- and we might crash if we try to inline invalid
3571 if (errorcount || sorrycount)
3575 memset (&id, 0, sizeof (id));
3577 id.src_node = id.dst_node = cgraph_node (fn);
3579 /* Or any functions that aren't finished yet. */
3580 prev_fn = NULL_TREE;
3581 if (current_function_decl)
3583 id.dst_fn = current_function_decl;
3584 prev_fn = current_function_decl;
3587 id.copy_decl = copy_decl_maybe_to_var;
3588 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3589 id.transform_new_cfg = false;
3590 id.transform_return_to_modify = true;
3591 id.transform_lang_insert_block = NULL;
3592 id.statements_to_fold = pointer_set_create ();
3594 push_gimplify_context (&gctx);
3596 /* We make no attempts to keep dominance info up-to-date. */
3597 free_dominance_info (CDI_DOMINATORS);
3598 free_dominance_info (CDI_POST_DOMINATORS);
3600 /* Register specific gimple functions. */
3601 gimple_register_cfg_hooks ();
3603 /* Reach the trees by walking over the CFG, and note the
3604 enclosing basic-blocks in the call edges. */
3605 /* We walk the blocks going forward, because inlined function bodies
3606 will split id->current_basic_block, and the new blocks will
3607 follow it; we'll trudge through them, processing their CALL_EXPRs
3610 gimple_expand_calls_inline (bb, &id);
3612 pop_gimplify_context (NULL);
3614 #ifdef ENABLE_CHECKING
3616 struct cgraph_edge *e;
3618 verify_cgraph_node (id.dst_node);
3620 /* Double check that we inlined everything we are supposed to inline. */
3621 for (e = id.dst_node->callees; e; e = e->next_callee)
3622 gcc_assert (e->inline_failed);
3626 /* Fold the statements before compacting/renumbering the basic blocks. */
3627 fold_marked_statements (last, id.statements_to_fold);
3628 pointer_set_destroy (id.statements_to_fold);
3630 /* Renumber the (code) basic_blocks consecutively. */
3632 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3635 /* We are not going to maintain the cgraph edges up to date.
3636 Kill it so it won't confuse us. */
3637 cgraph_node_remove_callees (id.dst_node);
3639 fold_cond_expr_cond ();
3641 /* It would be nice to check SSA/CFG/statement consistency here, but it is
3642 not possible yet - the IPA passes might make various functions to not
3643 throw and they don't care to proactively update local EH info. This is
3644 done later in fixup_cfg pass that also execute the verification. */
3645 return (TODO_update_ssa
3647 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
3648 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
3651 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
3654 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
3656 enum tree_code code = TREE_CODE (*tp);
3657 enum tree_code_class cl = TREE_CODE_CLASS (code);
3659 /* We make copies of most nodes. */
3660 if (IS_EXPR_CODE_CLASS (cl)
3661 || code == TREE_LIST
3663 || code == TYPE_DECL
3664 || code == OMP_CLAUSE)
3666 /* Because the chain gets clobbered when we make a copy, we save it
3668 tree chain = NULL_TREE, new_tree;
3670 chain = TREE_CHAIN (*tp);
3672 /* Copy the node. */
3673 new_tree = copy_node (*tp);
3675 /* Propagate mudflap marked-ness. */
3676 if (flag_mudflap && mf_marked_p (*tp))
3681 /* Now, restore the chain, if appropriate. That will cause
3682 walk_tree to walk into the chain as well. */
3683 if (code == PARM_DECL
3684 || code == TREE_LIST
3685 || code == OMP_CLAUSE)
3686 TREE_CHAIN (*tp) = chain;
3688 /* For now, we don't update BLOCKs when we make copies. So, we
3689 have to nullify all BIND_EXPRs. */
3690 if (TREE_CODE (*tp) == BIND_EXPR)
3691 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
3693 else if (code == CONSTRUCTOR)
3695 /* CONSTRUCTOR nodes need special handling because
3696 we need to duplicate the vector of elements. */
3699 new_tree = copy_node (*tp);
3701 /* Propagate mudflap marked-ness. */
3702 if (flag_mudflap && mf_marked_p (*tp))
3705 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
3706 CONSTRUCTOR_ELTS (*tp));
3709 else if (TREE_CODE_CLASS (code) == tcc_type)
3711 else if (TREE_CODE_CLASS (code) == tcc_declaration)
3713 else if (TREE_CODE_CLASS (code) == tcc_constant)
3716 gcc_assert (code != STATEMENT_LIST);
3720 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3721 information indicating to what new SAVE_EXPR this one should be mapped,
3722 use that one. Otherwise, create a new node and enter it in ST. FN is
3723 the function into which the copy will be placed. */
3726 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
3728 struct pointer_map_t *st = (struct pointer_map_t *) st_;
3732 /* See if we already encountered this SAVE_EXPR. */
3733 n = (tree *) pointer_map_contains (st, *tp);
3735 /* If we didn't already remap this SAVE_EXPR, do so now. */
3738 t = copy_node (*tp);
3740 /* Remember this SAVE_EXPR. */
3741 *pointer_map_insert (st, *tp) = t;
3742 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3743 *pointer_map_insert (st, t) = t;
3747 /* We've already walked into this SAVE_EXPR; don't do it again. */
3752 /* Replace this SAVE_EXPR with the copy. */
3756 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3757 copies the declaration and enters it in the splay_tree in DATA (which is
3758 really an `copy_body_data *'). */
3761 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3764 copy_body_data *id = (copy_body_data *) data;
3766 /* Don't walk into types. */
3770 else if (TREE_CODE (*tp) == LABEL_EXPR)
3772 tree decl = TREE_OPERAND (*tp, 0);
3774 /* Copy the decl and remember the copy. */
3775 insert_decl_map (id, decl, id->copy_decl (decl, id));
3781 /* Perform any modifications to EXPR required when it is unsaved. Does
3782 not recurse into EXPR's subtrees. */
3785 unsave_expr_1 (tree expr)
3787 switch (TREE_CODE (expr))
3790 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3791 It's OK for this to happen if it was part of a subtree that
3792 isn't immediately expanded, such as operand 2 of another
3794 if (TREE_OPERAND (expr, 1))
3797 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3798 TREE_OPERAND (expr, 3) = NULL_TREE;
3806 /* Called via walk_tree when an expression is unsaved. Using the
3807 splay_tree pointed to by ST (which is really a `splay_tree'),
3808 remaps all local declarations to appropriate replacements. */
3811 unsave_r (tree *tp, int *walk_subtrees, void *data)
3813 copy_body_data *id = (copy_body_data *) data;
3814 struct pointer_map_t *st = id->decl_map;
3817 /* Only a local declaration (variable or label). */
3818 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3819 || TREE_CODE (*tp) == LABEL_DECL)
3821 /* Lookup the declaration. */
3822 n = (tree *) pointer_map_contains (st, *tp);
3824 /* If it's there, remap it. */
3829 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3831 else if (TREE_CODE (*tp) == BIND_EXPR)
3832 copy_bind_expr (tp, walk_subtrees, id);
3833 else if (TREE_CODE (*tp) == SAVE_EXPR)
3834 remap_save_expr (tp, st, walk_subtrees);
3837 copy_tree_r (tp, walk_subtrees, NULL);
3839 /* Do whatever unsaving is required. */
3840 unsave_expr_1 (*tp);
3843 /* Keep iterating. */
3847 /* Copies everything in EXPR and replaces variables, labels
3848 and SAVE_EXPRs local to EXPR. */
3851 unsave_expr_now (tree expr)
3855 /* There's nothing to do for NULL_TREE. */
3860 memset (&id, 0, sizeof (id));
3861 id.src_fn = current_function_decl;
3862 id.dst_fn = current_function_decl;
3863 id.decl_map = pointer_map_create ();
3865 id.copy_decl = copy_decl_no_change;
3866 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3867 id.transform_new_cfg = false;
3868 id.transform_return_to_modify = false;
3869 id.transform_lang_insert_block = NULL;
3871 /* Walk the tree once to find local labels. */
3872 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3874 /* Walk the tree again, copying, remapping, and unsaving. */
3875 walk_tree (&expr, unsave_r, &id, NULL);
3878 pointer_map_destroy (id.decl_map);
3883 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
3884 label, copies the declaration and enters it in the splay_tree in DATA (which
3885 is really a 'copy_body_data *'. */
3888 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
3889 bool *handled_ops_p ATTRIBUTE_UNUSED,
3890 struct walk_stmt_info *wi)
3892 copy_body_data *id = (copy_body_data *) wi->info;
3893 gimple stmt = gsi_stmt (*gsip);
3895 if (gimple_code (stmt) == GIMPLE_LABEL)
3897 tree decl = gimple_label_label (stmt);
3899 /* Copy the decl and remember the copy. */
3900 insert_decl_map (id, decl, id->copy_decl (decl, id));
3907 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
3908 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
3909 remaps all local declarations to appropriate replacements in gimple
3913 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
3915 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
3916 copy_body_data *id = (copy_body_data *) wi->info;
3917 struct pointer_map_t *st = id->decl_map;
3921 /* Only a local declaration (variable or label). */
3922 if ((TREE_CODE (expr) == VAR_DECL
3923 && !TREE_STATIC (expr))
3924 || TREE_CODE (expr) == LABEL_DECL)
3926 /* Lookup the declaration. */
3927 n = (tree *) pointer_map_contains (st, expr);
3929 /* If it's there, remap it. */
3934 else if (TREE_CODE (expr) == STATEMENT_LIST
3935 || TREE_CODE (expr) == BIND_EXPR
3936 || TREE_CODE (expr) == SAVE_EXPR)
3938 else if (TREE_CODE (expr) == TARGET_EXPR)
3940 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3941 It's OK for this to happen if it was part of a subtree that
3942 isn't immediately expanded, such as operand 2 of another
3944 if (!TREE_OPERAND (expr, 1))
3946 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3947 TREE_OPERAND (expr, 3) = NULL_TREE;
3951 /* Keep iterating. */
3956 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
3957 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
3958 remaps all local declarations to appropriate replacements in gimple
3962 replace_locals_stmt (gimple_stmt_iterator *gsip,
3963 bool *handled_ops_p ATTRIBUTE_UNUSED,
3964 struct walk_stmt_info *wi)
3966 copy_body_data *id = (copy_body_data *) wi->info;
3967 gimple stmt = gsi_stmt (*gsip);
3969 if (gimple_code (stmt) == GIMPLE_BIND)
3971 tree block = gimple_bind_block (stmt);
3975 remap_block (&block, id);
3976 gimple_bind_set_block (stmt, block);
3979 /* This will remap a lot of the same decls again, but this should be
3981 if (gimple_bind_vars (stmt))
3982 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
3985 /* Keep iterating. */
3990 /* Copies everything in SEQ and replaces variables and labels local to
3991 current_function_decl. */
3994 copy_gimple_seq_and_replace_locals (gimple_seq seq)
3997 struct walk_stmt_info wi;
3998 struct pointer_set_t *visited;
4001 /* There's nothing to do for NULL_TREE. */
4006 memset (&id, 0, sizeof (id));
4007 id.src_fn = current_function_decl;
4008 id.dst_fn = current_function_decl;
4009 id.decl_map = pointer_map_create ();
4011 id.copy_decl = copy_decl_no_change;
4012 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4013 id.transform_new_cfg = false;
4014 id.transform_return_to_modify = false;
4015 id.transform_lang_insert_block = NULL;
4017 /* Walk the tree once to find local labels. */
4018 memset (&wi, 0, sizeof (wi));
4019 visited = pointer_set_create ();
4022 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4023 pointer_set_destroy (visited);
4025 copy = gimple_seq_copy (seq);
4027 /* Walk the copy, remapping decls. */
4028 memset (&wi, 0, sizeof (wi));
4030 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4033 pointer_map_destroy (id.decl_map);
4039 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4042 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4051 debug_find_tree (tree top, tree search)
4053 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4057 /* Declare the variables created by the inliner. Add all the variables in
4058 VARS to BIND_EXPR. */
4061 declare_inline_vars (tree block, tree vars)
4064 for (t = vars; t; t = TREE_CHAIN (t))
4066 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4067 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4068 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4072 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4075 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4076 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4077 VAR_DECL translation. */
4080 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4082 /* Don't generate debug information for the copy if we wouldn't have
4083 generated it for the copy either. */
4084 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4085 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4087 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4088 declaration inspired this copy. */
4089 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4091 /* The new variable/label has no RTL, yet. */
4092 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4093 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4094 SET_DECL_RTL (copy, NULL_RTX);
4096 /* These args would always appear unused, if not for this. */
4097 TREE_USED (copy) = 1;
4099 /* Set the context for the new declaration. */
4100 if (!DECL_CONTEXT (decl))
4101 /* Globals stay global. */
4103 else if (DECL_CONTEXT (decl) != id->src_fn)
4104 /* Things that weren't in the scope of the function we're inlining
4105 from aren't in the scope we're inlining to, either. */
4107 else if (TREE_STATIC (decl))
4108 /* Function-scoped static variables should stay in the original
4112 /* Ordinary automatic local variables are now in the scope of the
4114 DECL_CONTEXT (copy) = id->dst_fn;
4120 copy_decl_to_var (tree decl, copy_body_data *id)
4124 gcc_assert (TREE_CODE (decl) == PARM_DECL
4125 || TREE_CODE (decl) == RESULT_DECL);
4127 type = TREE_TYPE (decl);
4129 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
4130 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4131 TREE_READONLY (copy) = TREE_READONLY (decl);
4132 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4133 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4134 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
4136 return copy_decl_for_dup_finish (id, decl, copy);
4139 /* Like copy_decl_to_var, but create a return slot object instead of a
4140 pointer variable for return by invisible reference. */
4143 copy_result_decl_to_var (tree decl, copy_body_data *id)
4147 gcc_assert (TREE_CODE (decl) == PARM_DECL
4148 || TREE_CODE (decl) == RESULT_DECL);
4150 type = TREE_TYPE (decl);
4151 if (DECL_BY_REFERENCE (decl))
4152 type = TREE_TYPE (type);
4154 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
4155 TREE_READONLY (copy) = TREE_READONLY (decl);
4156 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4157 if (!DECL_BY_REFERENCE (decl))
4159 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4160 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4161 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
4164 return copy_decl_for_dup_finish (id, decl, copy);
4168 copy_decl_no_change (tree decl, copy_body_data *id)
4172 copy = copy_node (decl);
4174 /* The COPY is not abstract; it will be generated in DST_FN. */
4175 DECL_ABSTRACT (copy) = 0;
4176 lang_hooks.dup_lang_specific_decl (copy);
4178 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4179 been taken; it's for internal bookkeeping in expand_goto_internal. */
4180 if (TREE_CODE (copy) == LABEL_DECL)
4182 TREE_ADDRESSABLE (copy) = 0;
4183 LABEL_DECL_UID (copy) = -1;
4186 return copy_decl_for_dup_finish (id, decl, copy);
4190 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4192 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4193 return copy_decl_to_var (decl, id);
4195 return copy_decl_no_change (decl, id);
4198 /* Return a copy of the function's argument tree. */
4200 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4201 bitmap args_to_skip, tree *vars)
4204 tree new_parm = NULL;
4209 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4210 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4212 tree new_tree = remap_decl (arg, id);
4213 lang_hooks.dup_lang_specific_decl (new_tree);
4215 parg = &TREE_CHAIN (new_tree);
4217 else if (!pointer_map_contains (id->decl_map, arg))
4219 /* Make an equivalent VAR_DECL. If the argument was used
4220 as temporary variable later in function, the uses will be
4221 replaced by local variable. */
4222 tree var = copy_decl_to_var (arg, id);
4224 add_referenced_var (var);
4225 insert_decl_map (id, arg, var);
4226 /* Declare this new variable. */
4227 TREE_CHAIN (var) = *vars;
4233 /* Return a copy of the function's static chain. */
4235 copy_static_chain (tree static_chain, copy_body_data * id)
4237 tree *chain_copy, *pvar;
4239 chain_copy = &static_chain;
4240 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4242 tree new_tree = remap_decl (*pvar, id);
4243 lang_hooks.dup_lang_specific_decl (new_tree);
4244 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4247 return static_chain;
4250 /* Return true if the function is allowed to be versioned.
4251 This is a guard for the versioning functionality. */
4253 tree_versionable_function_p (tree fndecl)
4255 if (fndecl == NULL_TREE)
4257 /* ??? There are cases where a function is
4258 uninlinable but can be versioned. */
4259 if (!tree_inlinable_function_p (fndecl))
4265 /* Create a copy of a function's tree.
4266 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4267 of the original function and the new copied function
4268 respectively. In case we want to replace a DECL
4269 tree with another tree while duplicating the function's
4270 body, TREE_MAP represents the mapping between these
4271 trees. If UPDATE_CLONES is set, the call_stmt fields
4272 of edges of clones of the function will be updated. */
4274 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
4275 bool update_clones, bitmap args_to_skip)
4277 struct cgraph_node *old_version_node;
4278 struct cgraph_node *new_version_node;
4282 struct ipa_replace_map *replace_info;
4283 basic_block old_entry_block;
4284 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4287 tree old_current_function_decl = current_function_decl;
4288 tree vars = NULL_TREE;
4290 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4291 && TREE_CODE (new_decl) == FUNCTION_DECL);
4292 DECL_POSSIBLY_INLINED (old_decl) = 1;
4294 old_version_node = cgraph_node (old_decl);
4295 new_version_node = cgraph_node (new_decl);
4297 /* Output the inlining info for this abstract function, since it has been
4298 inlined. If we don't do this now, we can lose the information about the
4299 variables in the function when the blocks get blown away as soon as we
4300 remove the cgraph node. */
4301 (*debug_hooks->outlining_inline_function) (old_decl);
4303 DECL_ARTIFICIAL (new_decl) = 1;
4304 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4306 /* Prepare the data structures for the tree copy. */
4307 memset (&id, 0, sizeof (id));
4309 /* Generate a new name for the new version. */
4312 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
4313 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
4314 SET_DECL_RTL (new_decl, NULL_RTX);
4315 id.statements_to_fold = pointer_set_create ();
4318 id.decl_map = pointer_map_create ();
4319 id.src_fn = old_decl;
4320 id.dst_fn = new_decl;
4321 id.src_node = old_version_node;
4322 id.dst_node = new_version_node;
4323 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4325 id.copy_decl = copy_decl_no_change;
4326 id.transform_call_graph_edges
4327 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
4328 id.transform_new_cfg = true;
4329 id.transform_return_to_modify = false;
4330 id.transform_lang_insert_block = NULL;
4332 current_function_decl = new_decl;
4333 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
4334 (DECL_STRUCT_FUNCTION (old_decl));
4335 initialize_cfun (new_decl, old_decl,
4336 old_entry_block->count,
4337 old_entry_block->frequency);
4338 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
4340 /* Copy the function's static chain. */
4341 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
4343 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
4344 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
4347 /* If there's a tree_map, prepare for substitution. */
4349 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
4353 = (struct ipa_replace_map *) VARRAY_GENERIC_PTR (tree_map, i);
4354 if (replace_info->replace_p)
4356 tree op = replace_info->new_tree;
4360 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
4361 op = TREE_OPERAND (op, 0);
4363 if (TREE_CODE (op) == ADDR_EXPR)
4365 op = TREE_OPERAND (op, 0);
4366 while (handled_component_p (op))
4367 op = TREE_OPERAND (op, 0);
4368 if (TREE_CODE (op) == VAR_DECL)
4369 add_referenced_var (op);
4371 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
4372 init = setup_one_parameter (&id, replace_info->old_tree,
4373 replace_info->new_tree, id.src_fn,
4377 VEC_safe_push (gimple, heap, init_stmts, init);
4380 /* Copy the function's arguments. */
4381 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
4382 DECL_ARGUMENTS (new_decl) =
4383 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
4384 args_to_skip, &vars);
4386 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
4388 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4389 number_blocks (id.dst_fn);
4391 declare_inline_vars (DECL_INITIAL (new_decl), vars);
4392 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
4393 /* Add local vars. */
4394 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
4395 t_step; t_step = TREE_CHAIN (t_step))
4397 tree var = TREE_VALUE (t_step);
4398 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
4399 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
4400 else if (!can_be_nonlocal (var, &id))
4402 tree_cons (NULL_TREE, remap_decl (var, &id),
4406 /* Copy the Function's body. */
4407 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
4409 if (DECL_RESULT (old_decl) != NULL_TREE)
4411 tree *res_decl = &DECL_RESULT (old_decl);
4412 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
4413 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
4416 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4417 number_blocks (new_decl);
4419 if (VEC_length (gimple, init_stmts))
4421 basic_block bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
4422 while (VEC_length (gimple, init_stmts))
4423 insert_init_stmt (bb, VEC_pop (gimple, init_stmts));
4427 pointer_map_destroy (id.decl_map);
4430 fold_marked_statements (0, id.statements_to_fold);
4431 pointer_set_destroy (id.statements_to_fold);
4432 fold_cond_expr_cond ();
4434 if (gimple_in_ssa_p (cfun))
4436 free_dominance_info (CDI_DOMINATORS);
4437 free_dominance_info (CDI_POST_DOMINATORS);
4439 delete_unreachable_blocks ();
4440 update_ssa (TODO_update_ssa);
4443 fold_cond_expr_cond ();
4444 if (need_ssa_update_p ())
4445 update_ssa (TODO_update_ssa);
4448 free_dominance_info (CDI_DOMINATORS);
4449 free_dominance_info (CDI_POST_DOMINATORS);
4450 VEC_free (gimple, heap, init_stmts);
4452 current_function_decl = old_current_function_decl;
4453 gcc_assert (!current_function_decl
4454 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
4458 /* Duplicate a type, fields and all. */
4461 build_duplicate_type (tree type)
4463 struct copy_body_data id;
4465 memset (&id, 0, sizeof (id));
4466 id.src_fn = current_function_decl;
4467 id.dst_fn = current_function_decl;
4469 id.decl_map = pointer_map_create ();
4470 id.copy_decl = copy_decl_no_change;
4472 type = remap_type_1 (type, &id);
4474 pointer_map_destroy (id.decl_map);
4476 TYPE_CANONICAL (type) = type;
4481 /* Return whether it is safe to inline a function because it used different
4482 target specific options or different optimization options. */
4484 tree_can_inline_p (tree caller, tree callee)
4487 /* This causes a regression in SPEC in that it prevents a cold function from
4488 inlining a hot function. Perhaps this should only apply to functions
4489 that the user declares hot/cold/optimize explicitly. */
4491 /* Don't inline a function with a higher optimization level than the
4492 caller, or with different space constraints (hot/cold functions). */
4493 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
4494 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
4496 if (caller_tree != callee_tree)
4498 struct cl_optimization *caller_opt
4499 = TREE_OPTIMIZATION ((caller_tree)
4501 : optimization_default_node);
4503 struct cl_optimization *callee_opt
4504 = TREE_OPTIMIZATION ((callee_tree)
4506 : optimization_default_node);
4508 if ((caller_opt->optimize > callee_opt->optimize)
4509 || (caller_opt->optimize_size != callee_opt->optimize_size))
4514 /* Allow the backend to decide if inlining is ok. */
4515 return targetm.target_option.can_inline_p (caller, callee);