2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "tree-inline.h"
34 #include "insn-config.h"
36 #include "langhooks.h"
37 #include "basic-block.h"
38 #include "tree-iterator.h"
41 #include "tree-mudflap.h"
42 #include "tree-flow.h"
45 #include "tree-flow.h"
46 #include "diagnostic.h"
49 #include "pointer-set.h"
51 #include "value-prof.h"
52 #include "tree-pass.h"
54 #include "integrate.h"
56 /* I'm not real happy about this, but we need to handle gimple and
60 /* Inlining, Cloning, Versioning, Parallelization
62 Inlining: a function body is duplicated, but the PARM_DECLs are
63 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
64 MODIFY_EXPRs that store to a dedicated returned-value variable.
65 The duplicated eh_region info of the copy will later be appended
66 to the info for the caller; the eh_region info in copied throwing
67 statements and RESX_EXPRs is adjusted accordingly.
69 Cloning: (only in C++) We have one body for a con/de/structor, and
70 multiple function decls, each with a unique parameter list.
71 Duplicate the body, using the given splay tree; some parameters
72 will become constants (like 0 or 1).
74 Versioning: a function body is duplicated and the result is a new
75 function rather than into blocks of an existing function as with
76 inlining. Some parameters will become constants.
78 Parallelization: a region of a function is duplicated resulting in
79 a new function. Variables may be replaced with complex expressions
80 to enable shared variable semantics.
82 All of these will simultaneously lookup any callgraph edges. If
83 we're going to inline the duplicated function body, and the given
84 function has some cloned callgraph nodes (one for each place this
85 function will be inlined) those callgraph edges will be duplicated.
86 If we're cloning the body, those callgraph edges will be
87 updated to point into the new body. (Note that the original
88 callgraph node and edge list will not be altered.)
90 See the CALL_EXPR handling case in copy_tree_body_r (). */
94 o In order to make inlining-on-trees work, we pessimized
95 function-local static constants. In particular, they are now
96 always output, even when not addressed. Fix this by treating
97 function-local static constants just like global static
98 constants; the back-end already knows not to output them if they
101 o Provide heuristics to clamp inlining of recursive template
105 /* Weights that estimate_num_insns uses for heuristics in inlining. */
107 eni_weights eni_inlining_weights;
109 /* Weights that estimate_num_insns uses to estimate the size of the
112 eni_weights eni_size_weights;
114 /* Weights that estimate_num_insns uses to estimate the time necessary
115 to execute the produced code. */
117 eni_weights eni_time_weights;
121 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
122 static bool inlinable_function_p (tree);
123 static void remap_block (tree *, copy_body_data *);
124 static void copy_bind_expr (tree *, int *, copy_body_data *);
125 static tree mark_local_for_remap_r (tree *, int *, void *);
126 static void unsave_expr_1 (tree);
127 static tree unsave_r (tree *, int *, void *);
128 static void declare_inline_vars (tree, tree);
129 static void remap_save_expr (tree *, void *, int *);
130 static void prepend_lexical_block (tree current_block, tree new_block);
131 static tree copy_decl_to_var (tree, copy_body_data *);
132 static tree copy_result_decl_to_var (tree, copy_body_data *);
133 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
134 static gimple remap_gimple_stmt (gimple, copy_body_data *);
135 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
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 ((!optimize || 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 ((!optimize || 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);
708 /* ??? The C++ frontend uses void * pointer zero to initialize
709 any other type. This confuses the middle-end type verification.
710 As cloned bodies do not go through gimplification again the fixup
711 there doesn't trigger. */
712 if (TREE_CODE (new_decl) == INTEGER_CST
713 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
714 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
718 else if (TREE_CODE (*tp) == STATEMENT_LIST)
720 else if (TREE_CODE (*tp) == SAVE_EXPR)
722 else if (TREE_CODE (*tp) == LABEL_DECL
723 && (!DECL_CONTEXT (*tp)
724 || decl_function_context (*tp) == id->src_fn))
725 /* These may need to be remapped for EH handling. */
726 *tp = remap_decl (*tp, id);
727 else if (TYPE_P (*tp))
728 /* Types may need remapping as well. */
729 *tp = remap_type (*tp, id);
730 else if (CONSTANT_CLASS_P (*tp))
732 /* If this is a constant, we have to copy the node iff the type
733 will be remapped. copy_tree_r will not copy a constant. */
734 tree new_type = remap_type (TREE_TYPE (*tp), id);
736 if (new_type == TREE_TYPE (*tp))
739 else if (TREE_CODE (*tp) == INTEGER_CST)
740 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
741 TREE_INT_CST_HIGH (*tp));
744 *tp = copy_node (*tp);
745 TREE_TYPE (*tp) = new_type;
750 /* Otherwise, just copy the node. Note that copy_tree_r already
751 knows not to copy VAR_DECLs, etc., so this is safe. */
752 if (TREE_CODE (*tp) == INDIRECT_REF)
754 /* Get rid of *& from inline substitutions that can happen when a
755 pointer argument is an ADDR_EXPR. */
756 tree decl = TREE_OPERAND (*tp, 0);
759 n = (tree *) pointer_map_contains (id->decl_map, decl);
762 tree type, new_tree, old;
764 /* If we happen to get an ADDR_EXPR in n->value, strip
765 it manually here as we'll eventually get ADDR_EXPRs
766 which lie about their types pointed to. In this case
767 build_fold_indirect_ref wouldn't strip the
768 INDIRECT_REF, but we absolutely rely on that. As
769 fold_indirect_ref does other useful transformations,
770 try that first, though. */
771 type = TREE_TYPE (TREE_TYPE (*n));
772 new_tree = unshare_expr (*n);
774 *tp = gimple_fold_indirect_ref (new_tree);
777 if (TREE_CODE (new_tree) == ADDR_EXPR)
779 *tp = fold_indirect_ref_1 (type, new_tree);
780 /* ??? We should either assert here or build
781 a VIEW_CONVERT_EXPR instead of blindly leaking
782 incompatible types to our IL. */
784 *tp = TREE_OPERAND (new_tree, 0);
788 *tp = build1 (INDIRECT_REF, type, new_tree);
789 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
790 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
798 /* Here is the "usual case". Copy this tree node, and then
799 tweak some special cases. */
800 copy_tree_r (tp, walk_subtrees, NULL);
802 /* Global variables we haven't seen yet need to go into referenced
803 vars. If not referenced from types only. */
804 if (gimple_in_ssa_p (cfun)
805 && TREE_CODE (*tp) == VAR_DECL
806 && id->remapping_type_depth == 0)
807 add_referenced_var (*tp);
809 /* We should never have TREE_BLOCK set on non-statements. */
811 gcc_assert (!TREE_BLOCK (*tp));
813 if (TREE_CODE (*tp) != OMP_CLAUSE)
814 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
816 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
818 /* The copied TARGET_EXPR has never been expanded, even if the
819 original node was expanded already. */
820 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
821 TREE_OPERAND (*tp, 3) = NULL_TREE;
823 else if (TREE_CODE (*tp) == ADDR_EXPR)
825 /* Variable substitution need not be simple. In particular,
826 the INDIRECT_REF substitution above. Make sure that
827 TREE_CONSTANT and friends are up-to-date. But make sure
828 to not improperly set TREE_BLOCK on some sub-expressions. */
829 int invariant = is_gimple_min_invariant (*tp);
830 tree block = id->block;
831 id->block = NULL_TREE;
832 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
835 /* Handle the case where we substituted an INDIRECT_REF
836 into the operand of the ADDR_EXPR. */
837 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
838 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
840 recompute_tree_invariant_for_addr_expr (*tp);
842 /* If this used to be invariant, but is not any longer,
843 then regimplification is probably needed. */
844 if (invariant && !is_gimple_min_invariant (*tp))
845 id->regimplify = true;
851 /* Keep iterating. */
856 /* Called from copy_body_id via walk_tree. DATA is really a
857 `copy_body_data *'. */
860 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
862 copy_body_data *id = (copy_body_data *) data;
863 tree fn = id->src_fn;
866 /* Begin by recognizing trees that we'll completely rewrite for the
867 inlining context. Our output for these trees is completely
868 different from out input (e.g. RETURN_EXPR is deleted, and morphs
869 into an edge). Further down, we'll handle trees that get
870 duplicated and/or tweaked. */
872 /* When requested, RETURN_EXPRs should be transformed to just the
873 contained MODIFY_EXPR. The branch semantics of the return will
874 be handled elsewhere by manipulating the CFG rather than a statement. */
875 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
877 tree assignment = TREE_OPERAND (*tp, 0);
879 /* If we're returning something, just turn that into an
880 assignment into the equivalent of the original RESULT_DECL.
881 If the "assignment" is just the result decl, the result
882 decl has already been set (e.g. a recent "foo (&result_decl,
883 ...)"); just toss the entire RETURN_EXPR. */
884 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
886 /* Replace the RETURN_EXPR with (a copy of) the
887 MODIFY_EXPR hanging underneath. */
888 *tp = copy_node (assignment);
890 else /* Else the RETURN_EXPR returns no value. */
893 return (tree) (void *)1;
896 else if (TREE_CODE (*tp) == SSA_NAME)
898 *tp = remap_ssa_name (*tp, id);
903 /* Local variables and labels need to be replaced by equivalent
904 variables. We don't want to copy static variables; there's only
905 one of those, no matter how many times we inline the containing
906 function. Similarly for globals from an outer function. */
907 else if (auto_var_in_fn_p (*tp, fn))
911 /* Remap the declaration. */
912 new_decl = remap_decl (*tp, id);
913 gcc_assert (new_decl);
914 /* Replace this variable with the copy. */
915 STRIP_TYPE_NOPS (new_decl);
919 else if (TREE_CODE (*tp) == STATEMENT_LIST)
920 copy_statement_list (tp);
921 else if (TREE_CODE (*tp) == SAVE_EXPR)
922 remap_save_expr (tp, id->decl_map, walk_subtrees);
923 else if (TREE_CODE (*tp) == LABEL_DECL
924 && (! DECL_CONTEXT (*tp)
925 || decl_function_context (*tp) == id->src_fn))
926 /* These may need to be remapped for EH handling. */
927 *tp = remap_decl (*tp, id);
928 else if (TREE_CODE (*tp) == BIND_EXPR)
929 copy_bind_expr (tp, walk_subtrees, id);
930 /* Types may need remapping as well. */
931 else if (TYPE_P (*tp))
932 *tp = remap_type (*tp, id);
934 /* If this is a constant, we have to copy the node iff the type will be
935 remapped. copy_tree_r will not copy a constant. */
936 else if (CONSTANT_CLASS_P (*tp))
938 tree new_type = remap_type (TREE_TYPE (*tp), id);
940 if (new_type == TREE_TYPE (*tp))
943 else if (TREE_CODE (*tp) == INTEGER_CST)
944 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
945 TREE_INT_CST_HIGH (*tp));
948 *tp = copy_node (*tp);
949 TREE_TYPE (*tp) = new_type;
953 /* Otherwise, just copy the node. Note that copy_tree_r already
954 knows not to copy VAR_DECLs, etc., so this is safe. */
957 /* Here we handle trees that are not completely rewritten.
958 First we detect some inlining-induced bogosities for
960 if (TREE_CODE (*tp) == MODIFY_EXPR
961 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
962 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
964 /* Some assignments VAR = VAR; don't generate any rtl code
965 and thus don't count as variable modification. Avoid
966 keeping bogosities like 0 = 0. */
967 tree decl = TREE_OPERAND (*tp, 0), value;
970 n = (tree *) pointer_map_contains (id->decl_map, decl);
974 STRIP_TYPE_NOPS (value);
975 if (TREE_CONSTANT (value) || TREE_READONLY (value))
977 *tp = build_empty_stmt ();
978 return copy_tree_body_r (tp, walk_subtrees, data);
982 else if (TREE_CODE (*tp) == INDIRECT_REF)
984 /* Get rid of *& from inline substitutions that can happen when a
985 pointer argument is an ADDR_EXPR. */
986 tree decl = TREE_OPERAND (*tp, 0);
989 n = (tree *) pointer_map_contains (id->decl_map, decl);
994 /* If we happen to get an ADDR_EXPR in n->value, strip
995 it manually here as we'll eventually get ADDR_EXPRs
996 which lie about their types pointed to. In this case
997 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
998 but we absolutely rely on that. As fold_indirect_ref
999 does other useful transformations, try that first, though. */
1000 tree type = TREE_TYPE (TREE_TYPE (*n));
1001 new_tree = unshare_expr (*n);
1003 *tp = gimple_fold_indirect_ref (new_tree);
1006 if (TREE_CODE (new_tree) == ADDR_EXPR)
1008 *tp = fold_indirect_ref_1 (type, new_tree);
1009 /* ??? We should either assert here or build
1010 a VIEW_CONVERT_EXPR instead of blindly leaking
1011 incompatible types to our IL. */
1013 *tp = TREE_OPERAND (new_tree, 0);
1017 *tp = build1 (INDIRECT_REF, type, new_tree);
1018 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1019 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1027 /* Here is the "usual case". Copy this tree node, and then
1028 tweak some special cases. */
1029 copy_tree_r (tp, walk_subtrees, NULL);
1031 /* Global variables we haven't seen yet needs to go into referenced
1032 vars. If not referenced from types only. */
1033 if (gimple_in_ssa_p (cfun)
1034 && TREE_CODE (*tp) == VAR_DECL
1035 && id->remapping_type_depth == 0)
1036 add_referenced_var (*tp);
1038 /* If EXPR has block defined, map it to newly constructed block.
1039 When inlining we want EXPRs without block appear in the block
1040 of function call. */
1043 new_block = id->block;
1044 if (TREE_BLOCK (*tp))
1047 n = (tree *) pointer_map_contains (id->decl_map,
1052 TREE_BLOCK (*tp) = new_block;
1055 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
1056 TREE_OPERAND (*tp, 0) =
1057 build_int_cst (NULL_TREE,
1058 id->eh_region_offset
1059 + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
1061 if (TREE_CODE (*tp) != OMP_CLAUSE)
1062 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1064 /* The copied TARGET_EXPR has never been expanded, even if the
1065 original node was expanded already. */
1066 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1068 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1069 TREE_OPERAND (*tp, 3) = NULL_TREE;
1072 /* Variable substitution need not be simple. In particular, the
1073 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1074 and friends are up-to-date. */
1075 else if (TREE_CODE (*tp) == ADDR_EXPR)
1077 int invariant = is_gimple_min_invariant (*tp);
1078 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1080 /* Handle the case where we substituted an INDIRECT_REF
1081 into the operand of the ADDR_EXPR. */
1082 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1083 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1085 recompute_tree_invariant_for_addr_expr (*tp);
1087 /* If this used to be invariant, but is not any longer,
1088 then regimplification is probably needed. */
1089 if (invariant && !is_gimple_min_invariant (*tp))
1090 id->regimplify = true;
1096 /* Keep iterating. */
1101 /* Helper for copy_bb. Remap statement STMT using the inlining
1102 information in ID. Return the new statement copy. */
1105 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1108 struct walk_stmt_info wi;
1110 bool skip_first = false;
1112 /* Begin by recognizing trees that we'll completely rewrite for the
1113 inlining context. Our output for these trees is completely
1114 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1115 into an edge). Further down, we'll handle trees that get
1116 duplicated and/or tweaked. */
1118 /* When requested, GIMPLE_RETURNs should be transformed to just the
1119 contained GIMPLE_ASSIGN. The branch semantics of the return will
1120 be handled elsewhere by manipulating the CFG rather than the
1122 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1124 tree retval = gimple_return_retval (stmt);
1126 /* If we're returning something, just turn that into an
1127 assignment into the equivalent of the original RESULT_DECL.
1128 If RETVAL is just the result decl, the result decl has
1129 already been set (e.g. a recent "foo (&result_decl, ...)");
1130 just toss the entire GIMPLE_RETURN. */
1131 if (retval && TREE_CODE (retval) != RESULT_DECL)
1133 copy = gimple_build_assign (id->retvar, retval);
1134 /* id->retvar is already substituted. Skip it on later remapping. */
1138 return gimple_build_nop ();
1140 else if (gimple_has_substatements (stmt))
1144 /* When cloning bodies from the C++ front end, we will be handed bodies
1145 in High GIMPLE form. Handle here all the High GIMPLE statements that
1146 have embedded statements. */
1147 switch (gimple_code (stmt))
1150 copy = copy_gimple_bind (stmt, id);
1154 s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1155 copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1158 case GIMPLE_EH_FILTER:
1159 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1160 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1164 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1165 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1166 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1169 case GIMPLE_WITH_CLEANUP_EXPR:
1170 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1171 copy = gimple_build_wce (s1);
1174 case GIMPLE_OMP_PARALLEL:
1175 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1176 copy = gimple_build_omp_parallel
1178 gimple_omp_parallel_clauses (stmt),
1179 gimple_omp_parallel_child_fn (stmt),
1180 gimple_omp_parallel_data_arg (stmt));
1183 case GIMPLE_OMP_TASK:
1184 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1185 copy = gimple_build_omp_task
1187 gimple_omp_task_clauses (stmt),
1188 gimple_omp_task_child_fn (stmt),
1189 gimple_omp_task_data_arg (stmt),
1190 gimple_omp_task_copy_fn (stmt),
1191 gimple_omp_task_arg_size (stmt),
1192 gimple_omp_task_arg_align (stmt));
1195 case GIMPLE_OMP_FOR:
1196 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1197 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1198 copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1199 gimple_omp_for_collapse (stmt), s2);
1202 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1204 gimple_omp_for_set_index (copy, i,
1205 gimple_omp_for_index (stmt, i));
1206 gimple_omp_for_set_initial (copy, i,
1207 gimple_omp_for_initial (stmt, i));
1208 gimple_omp_for_set_final (copy, i,
1209 gimple_omp_for_final (stmt, i));
1210 gimple_omp_for_set_incr (copy, i,
1211 gimple_omp_for_incr (stmt, i));
1212 gimple_omp_for_set_cond (copy, i,
1213 gimple_omp_for_cond (stmt, i));
1218 case GIMPLE_OMP_MASTER:
1219 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1220 copy = gimple_build_omp_master (s1);
1223 case GIMPLE_OMP_ORDERED:
1224 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1225 copy = gimple_build_omp_ordered (s1);
1228 case GIMPLE_OMP_SECTION:
1229 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1230 copy = gimple_build_omp_section (s1);
1233 case GIMPLE_OMP_SECTIONS:
1234 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1235 copy = gimple_build_omp_sections
1236 (s1, gimple_omp_sections_clauses (stmt));
1239 case GIMPLE_OMP_SINGLE:
1240 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1241 copy = gimple_build_omp_single
1242 (s1, gimple_omp_single_clauses (stmt));
1245 case GIMPLE_OMP_CRITICAL:
1246 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1248 = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1257 if (gimple_assign_copy_p (stmt)
1258 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1259 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1261 /* Here we handle statements that are not completely rewritten.
1262 First we detect some inlining-induced bogosities for
1265 /* Some assignments VAR = VAR; don't generate any rtl code
1266 and thus don't count as variable modification. Avoid
1267 keeping bogosities like 0 = 0. */
1268 tree decl = gimple_assign_lhs (stmt), value;
1271 n = (tree *) pointer_map_contains (id->decl_map, decl);
1275 STRIP_TYPE_NOPS (value);
1276 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1277 return gimple_build_nop ();
1281 /* Create a new deep copy of the statement. */
1282 copy = gimple_copy (stmt);
1285 /* If STMT has a block defined, map it to the newly constructed
1286 block. When inlining we want statements without a block to
1287 appear in the block of the function call. */
1288 new_block = id->block;
1289 if (gimple_block (copy))
1292 n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1297 gimple_set_block (copy, new_block);
1299 /* Remap all the operands in COPY. */
1300 memset (&wi, 0, sizeof (wi));
1303 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1305 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1307 /* Clear the copied virtual operands. We are not remapping them here
1308 but are going to recreate them from scratch. */
1309 if (gimple_has_mem_ops (copy))
1311 gimple_set_vdef (copy, NULL_TREE);
1312 gimple_set_vuse (copy, NULL_TREE);
1315 /* We have to handle EH region remapping of GIMPLE_RESX specially because
1316 the region number is not an operand. */
1317 if (gimple_code (stmt) == GIMPLE_RESX && id->eh_region_offset)
1319 gimple_resx_set_region (copy, gimple_resx_region (stmt) + id->eh_region_offset);
1325 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1329 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1330 gcov_type count_scale)
1332 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1333 basic_block copy_basic_block;
1336 /* create_basic_block() will append every new block to
1337 basic_block_info automatically. */
1338 copy_basic_block = create_basic_block (NULL, (void *) 0,
1339 (basic_block) bb->prev_bb->aux);
1340 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1342 /* We are going to rebuild frequencies from scratch. These values
1343 have just small importance to drive canonicalize_loop_headers. */
1344 copy_basic_block->frequency = ((gcov_type)bb->frequency
1345 * frequency_scale / REG_BR_PROB_BASE);
1347 if (copy_basic_block->frequency > BB_FREQ_MAX)
1348 copy_basic_block->frequency = BB_FREQ_MAX;
1350 copy_gsi = gsi_start_bb (copy_basic_block);
1352 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1354 gimple stmt = gsi_stmt (gsi);
1355 gimple orig_stmt = stmt;
1357 id->regimplify = false;
1358 stmt = remap_gimple_stmt (stmt, id);
1359 if (gimple_nop_p (stmt))
1362 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1365 /* With return slot optimization we can end up with
1366 non-gimple (foo *)&this->m, fix that here. */
1367 if (is_gimple_assign (stmt)
1368 && gimple_assign_rhs_code (stmt) == NOP_EXPR
1369 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1372 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1373 gimple_assign_rhs1 (stmt),
1374 true, NULL, true, GSI_SAME_STMT);
1375 gimple_assign_set_rhs1 (stmt, new_rhs);
1376 id->regimplify = false;
1379 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1382 gimple_regimplify_operands (stmt, &seq_gsi);
1384 /* If copy_basic_block has been empty at the start of this iteration,
1385 call gsi_start_bb again to get at the newly added statements. */
1386 if (gsi_end_p (copy_gsi))
1387 copy_gsi = gsi_start_bb (copy_basic_block);
1389 gsi_next (©_gsi);
1391 /* Process the new statement. The call to gimple_regimplify_operands
1392 possibly turned the statement into multiple statements, we
1393 need to process all of them. */
1398 stmt = gsi_stmt (copy_gsi);
1399 if (is_gimple_call (stmt)
1400 && gimple_call_va_arg_pack_p (stmt)
1403 /* __builtin_va_arg_pack () should be replaced by
1404 all arguments corresponding to ... in the caller. */
1407 VEC(tree, heap) *argarray;
1408 size_t nargs = gimple_call_num_args (id->gimple_call);
1411 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1414 /* Create the new array of arguments. */
1415 n = nargs + gimple_call_num_args (stmt);
1416 argarray = VEC_alloc (tree, heap, n);
1417 VEC_safe_grow (tree, heap, argarray, n);
1419 /* Copy all the arguments before '...' */
1420 memcpy (VEC_address (tree, argarray),
1421 gimple_call_arg_ptr (stmt, 0),
1422 gimple_call_num_args (stmt) * sizeof (tree));
1424 /* Append the arguments passed in '...' */
1425 memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1426 gimple_call_arg_ptr (id->gimple_call, 0)
1427 + (gimple_call_num_args (id->gimple_call) - nargs),
1428 nargs * sizeof (tree));
1430 new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1433 VEC_free (tree, heap, argarray);
1435 /* Copy all GIMPLE_CALL flags, location and block, except
1436 GF_CALL_VA_ARG_PACK. */
1437 gimple_call_copy_flags (new_call, stmt);
1438 gimple_call_set_va_arg_pack (new_call, false);
1439 gimple_set_location (new_call, gimple_location (stmt));
1440 gimple_set_block (new_call, gimple_block (stmt));
1441 gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1443 gsi_replace (©_gsi, new_call, false);
1444 gimple_set_bb (stmt, NULL);
1447 else if (is_gimple_call (stmt)
1449 && (decl = gimple_call_fndecl (stmt))
1450 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1451 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1453 /* __builtin_va_arg_pack_len () should be replaced by
1454 the number of anonymous arguments. */
1455 size_t nargs = gimple_call_num_args (id->gimple_call);
1459 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1462 count = build_int_cst (integer_type_node, nargs);
1463 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1464 gsi_replace (©_gsi, new_stmt, false);
1468 /* Statements produced by inlining can be unfolded, especially
1469 when we constant propagated some operands. We can't fold
1470 them right now for two reasons:
1471 1) folding require SSA_NAME_DEF_STMTs to be correct
1472 2) we can't change function calls to builtins.
1473 So we just mark statement for later folding. We mark
1474 all new statements, instead just statements that has changed
1475 by some nontrivial substitution so even statements made
1476 foldable indirectly are updated. If this turns out to be
1477 expensive, copy_body can be told to watch for nontrivial
1479 if (id->statements_to_fold)
1480 pointer_set_insert (id->statements_to_fold, stmt);
1482 /* We're duplicating a CALL_EXPR. Find any corresponding
1483 callgraph edges and update or duplicate them. */
1484 if (is_gimple_call (stmt))
1486 struct cgraph_edge *edge = cgraph_edge (id->src_node, orig_stmt);
1489 switch (id->transform_call_graph_edges)
1491 case CB_CGE_DUPLICATE:
1493 cgraph_clone_edge (edge, id->dst_node, stmt,
1494 REG_BR_PROB_BASE, 1,
1495 edge->frequency, true);
1498 case CB_CGE_MOVE_CLONES:
1499 cgraph_set_call_stmt_including_clones (id->dst_node, orig_stmt, stmt);
1504 cgraph_set_call_stmt (edge, stmt);
1511 edge = cgraph_edge (id->src_node, orig_stmt);
1512 /* Constant propagation on argument done during inlining
1513 may create new direct call. Produce an edge for it. */
1515 || (edge->indirect_call
1516 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1517 && is_gimple_call (stmt)
1518 && (fn = gimple_call_fndecl (stmt)) != NULL)
1520 struct cgraph_node *dest = cgraph_node (fn);
1522 /* We have missing edge in the callgraph. This can happen in one case
1523 where previous inlining turned indirect call into direct call by
1524 constant propagating arguments. In all other cases we hit a bug
1525 (incorrect node sharing is most common reason for missing edges. */
1526 gcc_assert (dest->needed || !dest->analyzed);
1527 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1528 cgraph_create_edge_including_clones (id->dst_node, dest, stmt,
1530 compute_call_stmt_bb_frequency (id->dst_node->decl, bb),
1532 CIF_ORIGINALLY_INDIRECT_CALL);
1534 cgraph_create_edge (id->dst_node, dest, stmt,
1535 bb->count, CGRAPH_FREQ_BASE,
1536 bb->loop_depth)->inline_failed
1537 = CIF_ORIGINALLY_INDIRECT_CALL;
1540 fprintf (dump_file, "Created new direct edge to %s",
1541 cgraph_node_name (dest));
1545 flags = gimple_call_flags (stmt);
1547 if (flags & ECF_MAY_BE_ALLOCA)
1548 cfun->calls_alloca = true;
1549 if (flags & ECF_RETURNS_TWICE)
1550 cfun->calls_setjmp = true;
1553 /* If you think we can abort here, you are wrong.
1554 There is no region 0 in gimple. */
1555 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) != 0);
1557 if (stmt_could_throw_p (stmt)
1558 /* When we are cloning for inlining, we are supposed to
1559 construct a clone that calls precisely the same functions
1560 as original. However IPA optimizers might've proved
1561 earlier some function calls as non-trapping that might
1562 render some basic blocks dead that might become
1565 We can't update SSA with unreachable blocks in CFG and thus
1566 we prevent the scenario by preserving even the "dead" eh
1567 edges until the point they are later removed by
1569 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
1570 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
1572 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
1574 /* Add an entry for the copied tree in the EH hashtable.
1575 When cloning or versioning, use the hashtable in
1576 cfun, and just copy the EH number. When inlining, use the
1577 hashtable in the caller, and adjust the region number. */
1579 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
1581 /* If this tree doesn't have a region associated with it,
1582 and there is a "current region,"
1583 then associate this tree with the current region
1584 and add edges associated with this region. */
1585 if (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) <= 0
1586 && id->eh_region > 0
1587 && stmt_could_throw_p (stmt))
1588 add_stmt_to_eh_region (stmt, id->eh_region);
1591 if (gimple_in_ssa_p (cfun))
1596 find_new_referenced_vars (gsi_stmt (copy_gsi));
1597 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1598 if (TREE_CODE (def) == SSA_NAME)
1599 SSA_NAME_DEF_STMT (def) = stmt;
1602 gsi_next (©_gsi);
1604 while (!gsi_end_p (copy_gsi));
1606 copy_gsi = gsi_last_bb (copy_basic_block);
1609 return copy_basic_block;
1612 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1613 form is quite easy, since dominator relationship for old basic blocks does
1616 There is however exception where inlining might change dominator relation
1617 across EH edges from basic block within inlined functions destinating
1618 to landing pads in function we inline into.
1620 The function fills in PHI_RESULTs of such PHI nodes if they refer
1621 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1622 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1623 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1624 set, and this means that there will be no overlapping live ranges
1625 for the underlying symbol.
1627 This might change in future if we allow redirecting of EH edges and
1628 we might want to change way build CFG pre-inlining to include
1629 all the possible edges then. */
1631 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1632 bool can_throw, bool nonlocal_goto)
1637 FOR_EACH_EDGE (e, ei, bb->succs)
1639 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1642 gimple_stmt_iterator si;
1645 gcc_assert (e->flags & EDGE_EH);
1648 gcc_assert (!(e->flags & EDGE_EH));
1650 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1654 phi = gsi_stmt (si);
1656 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1657 gcc_assert (!e->dest->aux);
1659 gcc_assert ((e->flags & EDGE_EH)
1660 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1662 if (!is_gimple_reg (PHI_RESULT (phi)))
1664 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1668 re = find_edge (ret_bb, e->dest);
1670 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1671 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1673 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1674 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1680 /* Copy edges from BB into its copy constructed earlier, scale profile
1681 accordingly. Edges will be taken care of later. Assume aux
1682 pointers to point to the copies of each BB. */
1685 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1687 basic_block new_bb = (basic_block) bb->aux;
1690 gimple_stmt_iterator si;
1693 /* Use the indices from the original blocks to create edges for the
1695 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1696 if (!(old_edge->flags & EDGE_EH))
1700 flags = old_edge->flags;
1702 /* Return edges do get a FALLTHRU flag when the get inlined. */
1703 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1704 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1705 flags |= EDGE_FALLTHRU;
1706 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1707 new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1708 new_edge->probability = old_edge->probability;
1711 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1714 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1717 bool can_throw, nonlocal_goto;
1719 copy_stmt = gsi_stmt (si);
1720 update_stmt (copy_stmt);
1721 if (gimple_in_ssa_p (cfun))
1722 mark_symbols_for_renaming (copy_stmt);
1724 /* Do this before the possible split_block. */
1727 /* If this tree could throw an exception, there are two
1728 cases where we need to add abnormal edge(s): the
1729 tree wasn't in a region and there is a "current
1730 region" in the caller; or the original tree had
1731 EH edges. In both cases split the block after the tree,
1732 and add abnormal edge(s) as needed; we need both
1733 those from the callee and the caller.
1734 We check whether the copy can throw, because the const
1735 propagation can change an INDIRECT_REF which throws
1736 into a COMPONENT_REF which doesn't. If the copy
1737 can throw, the original could also throw. */
1738 can_throw = stmt_can_throw_internal (copy_stmt);
1739 nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1741 if (can_throw || nonlocal_goto)
1743 if (!gsi_end_p (si))
1744 /* Note that bb's predecessor edges aren't necessarily
1745 right at this point; split_block doesn't care. */
1747 edge e = split_block (new_bb, copy_stmt);
1750 new_bb->aux = e->src->aux;
1751 si = gsi_start_bb (new_bb);
1756 make_eh_edges (copy_stmt);
1759 make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1761 if ((can_throw || nonlocal_goto)
1762 && gimple_in_ssa_p (cfun))
1763 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1764 can_throw, nonlocal_goto);
1768 /* Copy the PHIs. All blocks and edges are copied, some blocks
1769 was possibly split and new outgoing EH edges inserted.
1770 BB points to the block of original function and AUX pointers links
1771 the original and newly copied blocks. */
1774 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1776 basic_block const new_bb = (basic_block) bb->aux;
1779 gimple_stmt_iterator si;
1781 for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1787 phi = gsi_stmt (si);
1788 res = PHI_RESULT (phi);
1790 if (is_gimple_reg (res))
1792 walk_tree (&new_res, copy_tree_body_r, id, NULL);
1793 SSA_NAME_DEF_STMT (new_res)
1794 = new_phi = create_phi_node (new_res, new_bb);
1795 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1798 = find_edge ((basic_block) new_edge->src->aux, bb);
1799 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1801 tree block = id->block;
1802 id->block = NULL_TREE;
1803 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1805 gcc_assert (new_arg);
1806 /* With return slot optimization we can end up with
1807 non-gimple (foo *)&this->m, fix that here. */
1808 if (TREE_CODE (new_arg) != SSA_NAME
1809 && TREE_CODE (new_arg) != FUNCTION_DECL
1810 && !is_gimple_val (new_arg))
1812 gimple_seq stmts = NULL;
1813 new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1814 gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1816 add_phi_arg (new_phi, new_arg, new_edge);
1823 /* Wrapper for remap_decl so it can be used as a callback. */
1826 remap_decl_1 (tree decl, void *data)
1828 return remap_decl (decl, (copy_body_data *) data);
1831 /* Build struct function and associated datastructures for the new clone
1832 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1835 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1838 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1839 gcov_type count_scale, frequency_scale;
1841 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1842 count_scale = (REG_BR_PROB_BASE * count
1843 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1847 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1848 frequency_scale = (REG_BR_PROB_BASE * frequency
1850 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1852 frequency_scale = count_scale;
1854 /* Register specific tree functions. */
1855 gimple_register_cfg_hooks ();
1857 /* Get clean struct function. */
1858 push_struct_function (new_fndecl);
1860 /* We will rebuild these, so just sanity check that they are empty. */
1861 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
1862 gcc_assert (cfun->local_decls == NULL);
1863 gcc_assert (cfun->cfg == NULL);
1864 gcc_assert (cfun->decl == new_fndecl);
1866 /* Copy items we preserve during clonning. */
1867 cfun->static_chain_decl = src_cfun->static_chain_decl;
1868 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
1869 cfun->function_end_locus = src_cfun->function_end_locus;
1870 cfun->curr_properties = src_cfun->curr_properties;
1871 cfun->last_verified = src_cfun->last_verified;
1872 if (src_cfun->ipa_transforms_to_apply)
1873 cfun->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
1874 src_cfun->ipa_transforms_to_apply);
1875 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
1876 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
1877 cfun->function_frequency = src_cfun->function_frequency;
1878 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
1879 cfun->stdarg = src_cfun->stdarg;
1880 cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
1881 cfun->after_inlining = src_cfun->after_inlining;
1882 cfun->returns_struct = src_cfun->returns_struct;
1883 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
1884 cfun->after_tree_profile = src_cfun->after_tree_profile;
1886 init_empty_tree_cfg ();
1888 ENTRY_BLOCK_PTR->count =
1889 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1891 ENTRY_BLOCK_PTR->frequency =
1892 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1893 frequency_scale / REG_BR_PROB_BASE);
1894 EXIT_BLOCK_PTR->count =
1895 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1897 EXIT_BLOCK_PTR->frequency =
1898 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1899 frequency_scale / REG_BR_PROB_BASE);
1901 init_eh_for_function ();
1903 if (src_cfun->gimple_df)
1905 init_tree_ssa (cfun);
1906 cfun->gimple_df->in_ssa_p = true;
1907 init_ssa_operands ();
1912 /* Make a copy of the body of FN so that it can be inserted inline in
1913 another function. Walks FN via CFG, returns new fndecl. */
1916 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1917 basic_block entry_block_map, basic_block exit_block_map)
1919 tree callee_fndecl = id->src_fn;
1920 /* Original cfun for the callee, doesn't change. */
1921 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1922 struct function *cfun_to_copy;
1924 tree new_fndecl = NULL;
1925 gcov_type count_scale, frequency_scale;
1928 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1929 count_scale = (REG_BR_PROB_BASE * count
1930 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1934 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1935 frequency_scale = (REG_BR_PROB_BASE * frequency
1937 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1939 frequency_scale = count_scale;
1941 /* Register specific tree functions. */
1942 gimple_register_cfg_hooks ();
1944 /* Must have a CFG here at this point. */
1945 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1946 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1948 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1950 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1951 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1952 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1953 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1955 /* Duplicate any exception-handling regions. */
1958 id->eh_region_offset
1959 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1963 /* Use aux pointers to map the original blocks to copy. */
1964 FOR_EACH_BB_FN (bb, cfun_to_copy)
1966 basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
1971 last = last_basic_block;
1973 /* Now that we've duplicated the blocks, duplicate their edges. */
1974 FOR_ALL_BB_FN (bb, cfun_to_copy)
1975 copy_edges_for_bb (bb, count_scale, exit_block_map);
1977 if (gimple_in_ssa_p (cfun))
1978 FOR_ALL_BB_FN (bb, cfun_to_copy)
1979 copy_phis_for_bb (bb, id);
1981 FOR_ALL_BB_FN (bb, cfun_to_copy)
1983 ((basic_block)bb->aux)->aux = NULL;
1987 /* Zero out AUX fields of newly created block during EH edge
1989 for (; last < last_basic_block; last++)
1990 BASIC_BLOCK (last)->aux = NULL;
1991 entry_block_map->aux = NULL;
1992 exit_block_map->aux = NULL;
1998 copy_body (copy_body_data *id, gcov_type count, int frequency,
1999 basic_block entry_block_map, basic_block exit_block_map)
2001 tree fndecl = id->src_fn;
2004 /* If this body has a CFG, walk CFG and copy. */
2005 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2006 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
2011 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2012 defined in function FN, or of a data member thereof. */
2015 self_inlining_addr_expr (tree value, tree fn)
2019 if (TREE_CODE (value) != ADDR_EXPR)
2022 var = get_base_address (TREE_OPERAND (value, 0));
2024 return var && auto_var_in_fn_p (var, fn);
2028 insert_init_stmt (basic_block bb, gimple init_stmt)
2030 /* If VAR represents a zero-sized variable, it's possible that the
2031 assignment statement may result in no gimple statements. */
2034 gimple_stmt_iterator si = gsi_last_bb (bb);
2036 /* We can end up with init statements that store to a non-register
2037 from a rhs with a conversion. Handle that here by forcing the
2038 rhs into a temporary. gimple_regimplify_operands is not
2039 prepared to do this for us. */
2040 if (!is_gimple_reg (gimple_assign_lhs (init_stmt))
2041 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2042 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2044 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2045 gimple_expr_type (init_stmt),
2046 gimple_assign_rhs1 (init_stmt));
2047 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2049 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2050 gimple_assign_set_rhs1 (init_stmt, rhs);
2052 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2053 gimple_regimplify_operands (init_stmt, &si);
2054 mark_symbols_for_renaming (init_stmt);
2058 /* Initialize parameter P with VALUE. If needed, produce init statement
2059 at the end of BB. When BB is NULL, we return init statement to be
2062 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2063 basic_block bb, tree *vars)
2065 gimple init_stmt = NULL;
2068 tree def = (gimple_in_ssa_p (cfun)
2069 ? gimple_default_def (id->src_cfun, p) : NULL);
2072 && value != error_mark_node
2073 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2075 if (fold_convertible_p (TREE_TYPE (p), value))
2076 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2078 /* ??? For valid (GIMPLE) programs we should not end up here.
2079 Still if something has gone wrong and we end up with truly
2080 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2081 to not leak invalid GIMPLE to the following passes. */
2082 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2085 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2086 we may not need to create a new variable here at all. Instead, we may
2087 be able to just use the argument value. */
2088 if (TREE_READONLY (p)
2089 && !TREE_ADDRESSABLE (p)
2090 && value && !TREE_SIDE_EFFECTS (value)
2093 /* We may produce non-gimple trees by adding NOPs or introduce
2094 invalid sharing when operand is not really constant.
2095 It is not big deal to prohibit constant propagation here as
2096 we will constant propagate in DOM1 pass anyway. */
2097 if (is_gimple_min_invariant (value)
2098 && useless_type_conversion_p (TREE_TYPE (p),
2100 /* We have to be very careful about ADDR_EXPR. Make sure
2101 the base variable isn't a local variable of the inlined
2102 function, e.g., when doing recursive inlining, direct or
2103 mutually-recursive or whatever, which is why we don't
2104 just test whether fn == current_function_decl. */
2105 && ! self_inlining_addr_expr (value, fn))
2107 insert_decl_map (id, p, value);
2112 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2113 here since the type of this decl must be visible to the calling
2115 var = copy_decl_to_var (p, id);
2116 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2119 add_referenced_var (var);
2122 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2123 that way, when the PARM_DECL is encountered, it will be
2124 automatically replaced by the VAR_DECL. */
2125 insert_decl_map (id, p, var);
2127 /* Declare this new variable. */
2128 TREE_CHAIN (var) = *vars;
2131 /* Make gimplifier happy about this variable. */
2132 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2134 /* Even if P was TREE_READONLY, the new VAR should not be.
2135 In the original code, we would have constructed a
2136 temporary, and then the function body would have never
2137 changed the value of P. However, now, we will be
2138 constructing VAR directly. The constructor body may
2139 change its value multiple times as it is being
2140 constructed. Therefore, it must not be TREE_READONLY;
2141 the back-end assumes that TREE_READONLY variable is
2142 assigned to only once. */
2143 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2144 TREE_READONLY (var) = 0;
2146 /* If there is no setup required and we are in SSA, take the easy route
2147 replacing all SSA names representing the function parameter by the
2148 SSA name passed to function.
2150 We need to construct map for the variable anyway as it might be used
2151 in different SSA names when parameter is set in function.
2153 Do replacement at -O0 for const arguments replaced by constant.
2154 This is important for builtin_constant_p and other construct requiring
2155 constant argument to be visible in inlined function body.
2157 FIXME: This usually kills the last connection in between inlined
2158 function parameter and the actual value in debug info. Can we do
2159 better here? If we just inserted the statement, copy propagation
2160 would kill it anyway as it always did in older versions of GCC.
2162 We might want to introduce a notion that single SSA_NAME might
2163 represent multiple variables for purposes of debugging. */
2164 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2166 || (TREE_READONLY (p)
2167 && is_gimple_min_invariant (rhs)))
2168 && (TREE_CODE (rhs) == SSA_NAME
2169 || is_gimple_min_invariant (rhs))
2170 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2172 insert_decl_map (id, def, rhs);
2176 /* If the value of argument is never used, don't care about initializing
2178 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2180 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2184 /* Initialize this VAR_DECL from the equivalent argument. Convert
2185 the argument to the proper type in case it was promoted. */
2188 if (rhs == error_mark_node)
2190 insert_decl_map (id, p, var);
2194 STRIP_USELESS_TYPE_CONVERSION (rhs);
2196 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2197 keep our trees in gimple form. */
2198 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2200 def = remap_ssa_name (def, id);
2201 init_stmt = gimple_build_assign (def, rhs);
2202 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2203 set_default_def (var, NULL);
2206 init_stmt = gimple_build_assign (var, rhs);
2208 if (bb && init_stmt)
2209 insert_init_stmt (bb, init_stmt);
2214 /* Generate code to initialize the parameters of the function at the
2215 top of the stack in ID from the GIMPLE_CALL STMT. */
2218 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2219 tree fn, basic_block bb)
2224 tree vars = NULL_TREE;
2225 tree static_chain = gimple_call_chain (stmt);
2227 /* Figure out what the parameters are. */
2228 parms = DECL_ARGUMENTS (fn);
2230 /* Loop through the parameter declarations, replacing each with an
2231 equivalent VAR_DECL, appropriately initialized. */
2232 for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2235 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2236 setup_one_parameter (id, p, val, fn, bb, &vars);
2239 /* Initialize the static chain. */
2240 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2241 gcc_assert (fn != current_function_decl);
2244 /* No static chain? Seems like a bug in tree-nested.c. */
2245 gcc_assert (static_chain);
2247 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2250 declare_inline_vars (id->block, vars);
2254 /* Declare a return variable to replace the RESULT_DECL for the
2255 function we are calling. An appropriate DECL_STMT is returned.
2256 The USE_STMT is filled to contain a use of the declaration to
2257 indicate the return value of the function.
2259 RETURN_SLOT, if non-null is place where to store the result. It
2260 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2261 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2263 The return value is a (possibly null) value that is the result of the
2264 function as seen by the callee. *USE_P is a (possibly null) value that
2265 holds the result as seen by the caller. */
2268 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
2271 tree callee = id->src_fn;
2272 tree caller = id->dst_fn;
2273 tree result = DECL_RESULT (callee);
2274 tree callee_type = TREE_TYPE (result);
2275 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
2278 /* We don't need to do anything for functions that don't return
2280 if (!result || VOID_TYPE_P (callee_type))
2286 /* If there was a return slot, then the return value is the
2287 dereferenced address of that object. */
2290 /* The front end shouldn't have used both return_slot and
2291 a modify expression. */
2292 gcc_assert (!modify_dest);
2293 if (DECL_BY_REFERENCE (result))
2295 tree return_slot_addr = build_fold_addr_expr (return_slot);
2296 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2298 /* We are going to construct *&return_slot and we can't do that
2299 for variables believed to be not addressable.
2301 FIXME: This check possibly can match, because values returned
2302 via return slot optimization are not believed to have address
2303 taken by alias analysis. */
2304 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2305 if (gimple_in_ssa_p (cfun))
2307 HOST_WIDE_INT bitsize;
2308 HOST_WIDE_INT bitpos;
2310 enum machine_mode mode;
2314 base = get_inner_reference (return_slot, &bitsize, &bitpos,
2316 &mode, &unsignedp, &volatilep,
2318 if (TREE_CODE (base) == INDIRECT_REF)
2319 base = TREE_OPERAND (base, 0);
2320 if (TREE_CODE (base) == SSA_NAME)
2321 base = SSA_NAME_VAR (base);
2322 mark_sym_for_renaming (base);
2324 var = return_slot_addr;
2329 gcc_assert (TREE_CODE (var) != SSA_NAME);
2330 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2332 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2333 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2334 && !DECL_GIMPLE_REG_P (result)
2336 DECL_GIMPLE_REG_P (var) = 0;
2341 /* All types requiring non-trivial constructors should have been handled. */
2342 gcc_assert (!TREE_ADDRESSABLE (callee_type));
2344 /* Attempt to avoid creating a new temporary variable. */
2346 && TREE_CODE (modify_dest) != SSA_NAME)
2348 bool use_it = false;
2350 /* We can't use MODIFY_DEST if there's type promotion involved. */
2351 if (!useless_type_conversion_p (callee_type, caller_type))
2354 /* ??? If we're assigning to a variable sized type, then we must
2355 reuse the destination variable, because we've no good way to
2356 create variable sized temporaries at this point. */
2357 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2360 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2361 reuse it as the result of the call directly. Don't do this if
2362 it would promote MODIFY_DEST to addressable. */
2363 else if (TREE_ADDRESSABLE (result))
2367 tree base_m = get_base_address (modify_dest);
2369 /* If the base isn't a decl, then it's a pointer, and we don't
2370 know where that's going to go. */
2371 if (!DECL_P (base_m))
2373 else if (is_global_var (base_m))
2375 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2376 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2377 && !DECL_GIMPLE_REG_P (result)
2378 && DECL_GIMPLE_REG_P (base_m))
2380 else if (!TREE_ADDRESSABLE (base_m))
2392 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2394 var = copy_result_decl_to_var (result, id);
2395 if (gimple_in_ssa_p (cfun))
2398 add_referenced_var (var);
2401 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2402 DECL_STRUCT_FUNCTION (caller)->local_decls
2403 = tree_cons (NULL_TREE, var,
2404 DECL_STRUCT_FUNCTION (caller)->local_decls);
2406 /* Do not have the rest of GCC warn about this variable as it should
2407 not be visible to the user. */
2408 TREE_NO_WARNING (var) = 1;
2410 declare_inline_vars (id->block, var);
2412 /* Build the use expr. If the return type of the function was
2413 promoted, convert it back to the expected type. */
2415 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2416 use = fold_convert (caller_type, var);
2418 STRIP_USELESS_TYPE_CONVERSION (use);
2420 if (DECL_BY_REFERENCE (result))
2422 TREE_ADDRESSABLE (var) = 1;
2423 var = build_fold_addr_expr (var);
2427 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2428 way, when the RESULT_DECL is encountered, it will be
2429 automatically replaced by the VAR_DECL. */
2430 insert_decl_map (id, result, var);
2432 /* Remember this so we can ignore it in remap_decls. */
2439 /* Returns nonzero if a function can be inlined as a tree. */
2442 tree_inlinable_function_p (tree fn)
2444 return inlinable_function_p (fn);
2447 static const char *inline_forbidden_reason;
2449 /* A callback for walk_gimple_seq to handle tree operands. Returns
2450 NULL_TREE if a function can be inlined, otherwise sets the reason
2451 why not and returns a tree representing the offending operand. */
2454 inline_forbidden_p_op (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
2455 void *fnp ATTRIBUTE_UNUSED)
2460 if (TREE_CODE (node) == RECORD_TYPE || TREE_CODE (node) == UNION_TYPE)
2462 /* We cannot inline a function of the form
2464 void F (int i) { struct S { int ar[i]; } s; }
2466 Attempting to do so produces a catch-22.
2467 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
2468 UNION_TYPE nodes, then it goes into infinite recursion on a
2469 structure containing a pointer to its own type. If it doesn't,
2470 then the type node for S doesn't get adjusted properly when
2473 ??? This is likely no longer true, but it's too late in the 4.0
2474 cycle to try to find out. This should be checked for 4.1. */
2475 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
2476 if (variably_modified_type_p (TREE_TYPE (t), NULL))
2478 inline_forbidden_reason
2479 = G_("function %q+F can never be inlined "
2480 "because it uses variable sized variables");
2489 /* A callback for walk_gimple_seq to handle statements. Returns
2490 non-NULL iff a function can not be inlined. Also sets the reason
2494 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2495 struct walk_stmt_info *wip)
2497 tree fn = (tree) wip->info;
2499 gimple stmt = gsi_stmt (*gsi);
2501 switch (gimple_code (stmt))
2504 /* Refuse to inline alloca call unless user explicitly forced so as
2505 this may change program's memory overhead drastically when the
2506 function using alloca is called in loop. In GCC present in
2507 SPEC2000 inlining into schedule_block cause it to require 2GB of
2508 RAM instead of 256MB. */
2509 if (gimple_alloca_call_p (stmt)
2510 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2512 inline_forbidden_reason
2513 = G_("function %q+F can never be inlined because it uses "
2514 "alloca (override using the always_inline attribute)");
2515 *handled_ops_p = true;
2519 t = gimple_call_fndecl (stmt);
2523 /* We cannot inline functions that call setjmp. */
2524 if (setjmp_call_p (t))
2526 inline_forbidden_reason
2527 = G_("function %q+F can never be inlined because it uses setjmp");
2528 *handled_ops_p = true;
2532 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2533 switch (DECL_FUNCTION_CODE (t))
2535 /* We cannot inline functions that take a variable number of
2537 case BUILT_IN_VA_START:
2538 case BUILT_IN_NEXT_ARG:
2539 case BUILT_IN_VA_END:
2540 inline_forbidden_reason
2541 = G_("function %q+F can never be inlined because it "
2542 "uses variable argument lists");
2543 *handled_ops_p = true;
2546 case BUILT_IN_LONGJMP:
2547 /* We can't inline functions that call __builtin_longjmp at
2548 all. The non-local goto machinery really requires the
2549 destination be in a different function. If we allow the
2550 function calling __builtin_longjmp to be inlined into the
2551 function calling __builtin_setjmp, Things will Go Awry. */
2552 inline_forbidden_reason
2553 = G_("function %q+F can never be inlined because "
2554 "it uses setjmp-longjmp exception handling");
2555 *handled_ops_p = true;
2558 case BUILT_IN_NONLOCAL_GOTO:
2560 inline_forbidden_reason
2561 = G_("function %q+F can never be inlined because "
2562 "it uses non-local goto");
2563 *handled_ops_p = true;
2566 case BUILT_IN_RETURN:
2567 case BUILT_IN_APPLY_ARGS:
2568 /* If a __builtin_apply_args caller would be inlined,
2569 it would be saving arguments of the function it has
2570 been inlined into. Similarly __builtin_return would
2571 return from the function the inline has been inlined into. */
2572 inline_forbidden_reason
2573 = G_("function %q+F can never be inlined because "
2574 "it uses __builtin_return or __builtin_apply_args");
2575 *handled_ops_p = true;
2584 t = gimple_goto_dest (stmt);
2586 /* We will not inline a function which uses computed goto. The
2587 addresses of its local labels, which may be tucked into
2588 global storage, are of course not constant across
2589 instantiations, which causes unexpected behavior. */
2590 if (TREE_CODE (t) != LABEL_DECL)
2592 inline_forbidden_reason
2593 = G_("function %q+F can never be inlined "
2594 "because it contains a computed goto");
2595 *handled_ops_p = true;
2601 t = gimple_label_label (stmt);
2602 if (DECL_NONLOCAL (t))
2604 /* We cannot inline a function that receives a non-local goto
2605 because we cannot remap the destination label used in the
2606 function that is performing the non-local goto. */
2607 inline_forbidden_reason
2608 = G_("function %q+F can never be inlined "
2609 "because it receives a non-local goto");
2610 *handled_ops_p = true;
2619 *handled_ops_p = false;
2625 inline_forbidden_p_2 (tree *nodep, int *walk_subtrees,
2629 tree fn = (tree) fnp;
2631 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2633 inline_forbidden_reason
2634 = G_("function %q+F can never be inlined "
2635 "because it saves address of local label in a static variable");
2645 /* Return true if FNDECL is a function that cannot be inlined into
2649 inline_forbidden_p (tree fndecl)
2651 location_t saved_loc = input_location;
2652 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2654 struct walk_stmt_info wi;
2655 struct pointer_set_t *visited_nodes;
2657 bool forbidden_p = false;
2659 visited_nodes = pointer_set_create ();
2660 memset (&wi, 0, sizeof (wi));
2661 wi.info = (void *) fndecl;
2662 wi.pset = visited_nodes;
2664 FOR_EACH_BB_FN (bb, fun)
2667 gimple_seq seq = bb_seq (bb);
2668 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt,
2669 inline_forbidden_p_op, &wi);
2670 forbidden_p = (ret != NULL);
2675 for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2677 tree decl = TREE_VALUE (step);
2678 if (TREE_CODE (decl) == VAR_DECL
2679 && TREE_STATIC (decl)
2680 && !DECL_EXTERNAL (decl)
2681 && DECL_INITIAL (decl))
2684 ret = walk_tree_without_duplicates (&DECL_INITIAL (decl),
2685 inline_forbidden_p_2, fndecl);
2686 forbidden_p = (ret != NULL);
2693 pointer_set_destroy (visited_nodes);
2694 input_location = saved_loc;
2698 /* Returns nonzero if FN is a function that does not have any
2699 fundamental inline blocking properties. */
2702 inlinable_function_p (tree fn)
2704 bool inlinable = true;
2708 /* If we've already decided this function shouldn't be inlined,
2709 there's no need to check again. */
2710 if (DECL_UNINLINABLE (fn))
2713 /* We only warn for functions declared `inline' by the user. */
2714 do_warning = (warn_inline
2715 && DECL_DECLARED_INLINE_P (fn)
2716 && !DECL_NO_INLINE_WARNING_P (fn)
2717 && !DECL_IN_SYSTEM_HEADER (fn));
2719 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2722 && always_inline == NULL)
2725 warning (OPT_Winline, "function %q+F can never be inlined because it "
2726 "is suppressed using -fno-inline", fn);
2730 /* Don't auto-inline anything that might not be bound within
2731 this unit of translation. */
2732 else if (!DECL_DECLARED_INLINE_P (fn)
2733 && DECL_REPLACEABLE_P (fn))
2736 else if (!function_attribute_inlinable_p (fn))
2739 warning (OPT_Winline, "function %q+F can never be inlined because it "
2740 "uses attributes conflicting with inlining", fn);
2744 else if (inline_forbidden_p (fn))
2746 /* See if we should warn about uninlinable functions. Previously,
2747 some of these warnings would be issued while trying to expand
2748 the function inline, but that would cause multiple warnings
2749 about functions that would for example call alloca. But since
2750 this a property of the function, just one warning is enough.
2751 As a bonus we can now give more details about the reason why a
2752 function is not inlinable. */
2754 sorry (inline_forbidden_reason, fn);
2755 else if (do_warning)
2756 warning (OPT_Winline, inline_forbidden_reason, fn);
2761 /* Squirrel away the result so that we don't have to check again. */
2762 DECL_UNINLINABLE (fn) = !inlinable;
2767 /* Estimate the cost of a memory move. Use machine dependent
2768 word size and take possible memcpy call into account. */
2771 estimate_move_cost (tree type)
2775 gcc_assert (!VOID_TYPE_P (type));
2777 size = int_size_in_bytes (type);
2779 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
2780 /* Cost of a memcpy call, 3 arguments and the call. */
2783 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
2786 /* Returns cost of operation CODE, according to WEIGHTS */
2789 estimate_operator_cost (enum tree_code code, eni_weights *weights,
2790 tree op1 ATTRIBUTE_UNUSED, tree op2)
2794 /* These are "free" conversions, or their presumed cost
2795 is folded into other operations. */
2802 /* Assign cost of 1 to usual operations.
2803 ??? We may consider mapping RTL costs to this. */
2808 case POINTER_PLUS_EXPR:
2812 case FIXED_CONVERT_EXPR:
2813 case FIX_TRUNC_EXPR:
2825 case VEC_LSHIFT_EXPR:
2826 case VEC_RSHIFT_EXPR:
2833 case TRUTH_ANDIF_EXPR:
2834 case TRUTH_ORIF_EXPR:
2835 case TRUTH_AND_EXPR:
2837 case TRUTH_XOR_EXPR:
2838 case TRUTH_NOT_EXPR:
2847 case UNORDERED_EXPR:
2858 case PREDECREMENT_EXPR:
2859 case PREINCREMENT_EXPR:
2860 case POSTDECREMENT_EXPR:
2861 case POSTINCREMENT_EXPR:
2863 case REALIGN_LOAD_EXPR:
2865 case REDUC_MAX_EXPR:
2866 case REDUC_MIN_EXPR:
2867 case REDUC_PLUS_EXPR:
2868 case WIDEN_SUM_EXPR:
2869 case WIDEN_MULT_EXPR:
2872 case VEC_WIDEN_MULT_HI_EXPR:
2873 case VEC_WIDEN_MULT_LO_EXPR:
2874 case VEC_UNPACK_HI_EXPR:
2875 case VEC_UNPACK_LO_EXPR:
2876 case VEC_UNPACK_FLOAT_HI_EXPR:
2877 case VEC_UNPACK_FLOAT_LO_EXPR:
2878 case VEC_PACK_TRUNC_EXPR:
2879 case VEC_PACK_SAT_EXPR:
2880 case VEC_PACK_FIX_TRUNC_EXPR:
2881 case VEC_EXTRACT_EVEN_EXPR:
2882 case VEC_EXTRACT_ODD_EXPR:
2883 case VEC_INTERLEAVE_HIGH_EXPR:
2884 case VEC_INTERLEAVE_LOW_EXPR:
2888 /* Few special cases of expensive operations. This is useful
2889 to avoid inlining on functions having too many of these. */
2890 case TRUNC_DIV_EXPR:
2892 case FLOOR_DIV_EXPR:
2893 case ROUND_DIV_EXPR:
2894 case EXACT_DIV_EXPR:
2895 case TRUNC_MOD_EXPR:
2897 case FLOOR_MOD_EXPR:
2898 case ROUND_MOD_EXPR:
2900 if (TREE_CODE (op2) != INTEGER_CST)
2901 return weights->div_mod_cost;
2905 /* We expect a copy assignment with no operator. */
2906 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
2912 /* Estimate number of instructions that will be created by expanding
2913 the statements in the statement sequence STMTS.
2914 WEIGHTS contains weights attributed to various constructs. */
2917 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
2920 gimple_stmt_iterator gsi;
2923 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
2924 cost += estimate_num_insns (gsi_stmt (gsi), weights);
2930 /* Estimate number of instructions that will be created by expanding STMT.
2931 WEIGHTS contains weights attributed to various constructs. */
2934 estimate_num_insns (gimple stmt, eni_weights *weights)
2937 enum gimple_code code = gimple_code (stmt);
2944 /* Try to estimate the cost of assignments. We have three cases to
2946 1) Simple assignments to registers;
2947 2) Stores to things that must live in memory. This includes
2948 "normal" stores to scalars, but also assignments of large
2949 structures, or constructors of big arrays;
2951 Let us look at the first two cases, assuming we have "a = b + C":
2952 <GIMPLE_ASSIGN <var_decl "a">
2953 <plus_expr <var_decl "b"> <constant C>>
2954 If "a" is a GIMPLE register, the assignment to it is free on almost
2955 any target, because "a" usually ends up in a real register. Hence
2956 the only cost of this expression comes from the PLUS_EXPR, and we
2957 can ignore the GIMPLE_ASSIGN.
2958 If "a" is not a GIMPLE register, the assignment to "a" will most
2959 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
2960 of moving something into "a", which we compute using the function
2961 estimate_move_cost. */
2962 lhs = gimple_assign_lhs (stmt);
2963 rhs = gimple_assign_rhs1 (stmt);
2965 /* EH magic stuff is most probably going to be optimized out.
2966 We rarely really need to save EH info for unwinding
2967 nested exceptions. */
2968 if (TREE_CODE (lhs) == FILTER_EXPR
2969 || TREE_CODE (lhs) == EXC_PTR_EXPR
2970 || TREE_CODE (rhs) == FILTER_EXPR
2971 || TREE_CODE (rhs) == EXC_PTR_EXPR)
2973 if (is_gimple_reg (lhs))
2976 cost = estimate_move_cost (TREE_TYPE (lhs));
2978 if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
2979 cost += estimate_move_cost (TREE_TYPE (rhs));
2981 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
2982 gimple_assign_rhs1 (stmt),
2983 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
2984 == GIMPLE_BINARY_RHS
2985 ? gimple_assign_rhs2 (stmt) : NULL);
2989 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
2990 gimple_op (stmt, 0),
2991 gimple_op (stmt, 1));
2995 /* Take into account cost of the switch + guess 2 conditional jumps for
2998 TODO: once the switch expansion logic is sufficiently separated, we can
2999 do better job on estimating cost of the switch. */
3000 if (weights->time_based)
3001 cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3003 cost = gimple_switch_num_labels (stmt) * 2;
3008 tree decl = gimple_call_fndecl (stmt);
3009 tree addr = gimple_call_fn (stmt);
3010 tree funtype = TREE_TYPE (addr);
3012 if (POINTER_TYPE_P (funtype))
3013 funtype = TREE_TYPE (funtype);
3015 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3016 cost = weights->target_builtin_call_cost;
3018 cost = weights->call_cost;
3020 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3021 switch (DECL_FUNCTION_CODE (decl))
3023 case BUILT_IN_CONSTANT_P:
3025 case BUILT_IN_EXPECT:
3028 /* Prefetch instruction is not expensive. */
3029 case BUILT_IN_PREFETCH:
3030 cost = weights->target_builtin_call_cost;
3038 funtype = TREE_TYPE (decl);
3040 if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3041 cost += estimate_move_cost (TREE_TYPE (funtype));
3042 /* Our cost must be kept in sync with
3043 cgraph_estimate_size_after_inlining that does use function
3044 declaration to figure out the arguments. */
3045 if (decl && DECL_ARGUMENTS (decl))
3048 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3049 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3050 cost += estimate_move_cost (TREE_TYPE (arg));
3052 else if (funtype && prototype_p (funtype))
3055 for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3057 if (!VOID_TYPE_P (TREE_VALUE (t)))
3058 cost += estimate_move_cost (TREE_VALUE (t));
3062 for (i = 0; i < gimple_call_num_args (stmt); i++)
3064 tree arg = gimple_call_arg (stmt, i);
3065 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3066 cost += estimate_move_cost (TREE_TYPE (arg));
3078 case GIMPLE_PREDICT:
3086 return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3088 case GIMPLE_EH_FILTER:
3089 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3092 return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3095 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3096 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3098 /* OpenMP directives are generally very expensive. */
3100 case GIMPLE_OMP_RETURN:
3101 case GIMPLE_OMP_SECTIONS_SWITCH:
3102 case GIMPLE_OMP_ATOMIC_STORE:
3103 case GIMPLE_OMP_CONTINUE:
3104 /* ...except these, which are cheap. */
3107 case GIMPLE_OMP_ATOMIC_LOAD:
3108 return weights->omp_cost;
3110 case GIMPLE_OMP_FOR:
3111 return (weights->omp_cost
3112 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3113 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3115 case GIMPLE_OMP_PARALLEL:
3116 case GIMPLE_OMP_TASK:
3117 case GIMPLE_OMP_CRITICAL:
3118 case GIMPLE_OMP_MASTER:
3119 case GIMPLE_OMP_ORDERED:
3120 case GIMPLE_OMP_SECTION:
3121 case GIMPLE_OMP_SECTIONS:
3122 case GIMPLE_OMP_SINGLE:
3123 return (weights->omp_cost
3124 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3133 /* Estimate number of instructions that will be created by expanding
3134 function FNDECL. WEIGHTS contains weights attributed to various
3138 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3140 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3141 gimple_stmt_iterator bsi;
3145 gcc_assert (my_function && my_function->cfg);
3146 FOR_EACH_BB_FN (bb, my_function)
3148 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3149 n += estimate_num_insns (gsi_stmt (bsi), weights);
3156 /* Initializes weights used by estimate_num_insns. */
3159 init_inline_once (void)
3161 eni_size_weights.call_cost = 1;
3162 eni_size_weights.target_builtin_call_cost = 1;
3163 eni_size_weights.div_mod_cost = 1;
3164 eni_size_weights.omp_cost = 40;
3165 eni_size_weights.time_based = false;
3167 /* Estimating time for call is difficult, since we have no idea what the
3168 called function does. In the current uses of eni_time_weights,
3169 underestimating the cost does less harm than overestimating it, so
3170 we choose a rather small value here. */
3171 eni_time_weights.call_cost = 10;
3172 eni_time_weights.target_builtin_call_cost = 10;
3173 eni_time_weights.div_mod_cost = 10;
3174 eni_time_weights.omp_cost = 40;
3175 eni_time_weights.time_based = true;
3178 /* Estimate the number of instructions in a gimple_seq. */
3181 count_insns_seq (gimple_seq seq, eni_weights *weights)
3183 gimple_stmt_iterator gsi;
3185 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3186 n += estimate_num_insns (gsi_stmt (gsi), weights);
3192 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3195 prepend_lexical_block (tree current_block, tree new_block)
3197 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3198 BLOCK_SUBBLOCKS (current_block) = new_block;
3199 BLOCK_SUPERCONTEXT (new_block) = current_block;
3202 /* Fetch callee declaration from the call graph edge going from NODE and
3203 associated with STMR call statement. Return NULL_TREE if not found. */
3205 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3207 struct cgraph_edge *cs;
3209 cs = cgraph_edge (node, stmt);
3211 return cs->callee->decl;
3216 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3219 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3221 tree retvar, use_retvar;
3223 struct pointer_map_t *st;
3226 location_t saved_location;
3227 struct cgraph_edge *cg_edge;
3228 cgraph_inline_failed_t reason;
3229 basic_block return_block;
3231 gimple_stmt_iterator gsi, stmt_gsi;
3232 bool successfully_inlined = FALSE;
3233 bool purge_dead_abnormal_edges;
3237 /* Set input_location here so we get the right instantiation context
3238 if we call instantiate_decl from inlinable_function_p. */
3239 saved_location = input_location;
3240 if (gimple_has_location (stmt))
3241 input_location = gimple_location (stmt);
3243 /* From here on, we're only interested in CALL_EXPRs. */
3244 if (gimple_code (stmt) != GIMPLE_CALL)
3247 /* First, see if we can figure out what function is being called.
3248 If we cannot, then there is no hope of inlining the function. */
3249 fn = gimple_call_fndecl (stmt);
3252 fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3257 /* Turn forward declarations into real ones. */
3258 fn = cgraph_node (fn)->decl;
3260 /* If FN is a declaration of a function in a nested scope that was
3261 globally declared inline, we don't set its DECL_INITIAL.
3262 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3263 C++ front-end uses it for cdtors to refer to their internal
3264 declarations, that are not real functions. Fortunately those
3265 don't have trees to be saved, so we can tell by checking their
3267 if (!DECL_INITIAL (fn)
3268 && DECL_ABSTRACT_ORIGIN (fn)
3269 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3270 fn = DECL_ABSTRACT_ORIGIN (fn);
3272 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3273 Kill this check once this is fixed. */
3274 if (!id->dst_node->analyzed)
3277 cg_edge = cgraph_edge (id->dst_node, stmt);
3279 /* Don't try to inline functions that are not well-suited to
3281 if (!cgraph_inline_p (cg_edge, &reason))
3283 /* If this call was originally indirect, we do not want to emit any
3284 inlining related warnings or sorry messages because there are no
3285 guarantees regarding those. */
3286 if (cg_edge->indirect_call)
3289 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3290 /* Avoid warnings during early inline pass. */
3291 && cgraph_global_info_ready)
3293 sorry ("inlining failed in call to %q+F: %s", fn,
3294 cgraph_inline_failed_string (reason));
3295 sorry ("called from here");
3297 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3298 && !DECL_IN_SYSTEM_HEADER (fn)
3299 && reason != CIF_UNSPECIFIED
3300 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3301 /* Avoid warnings during early inline pass. */
3302 && cgraph_global_info_ready)
3304 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3305 fn, cgraph_inline_failed_string (reason));
3306 warning (OPT_Winline, "called from here");
3310 fn = cg_edge->callee->decl;
3312 #ifdef ENABLE_CHECKING
3313 if (cg_edge->callee->decl != id->dst_node->decl)
3314 verify_cgraph_node (cg_edge->callee);
3317 /* We will be inlining this callee. */
3318 id->eh_region = lookup_stmt_eh_region (stmt);
3320 /* Split the block holding the GIMPLE_CALL. */
3321 e = split_block (bb, stmt);
3323 return_block = e->dest;
3326 /* split_block splits after the statement; work around this by
3327 moving the call into the second block manually. Not pretty,
3328 but seems easier than doing the CFG manipulation by hand
3329 when the GIMPLE_CALL is in the last statement of BB. */
3330 stmt_gsi = gsi_last_bb (bb);
3331 gsi_remove (&stmt_gsi, false);
3333 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3334 been the source of abnormal edges. In this case, schedule
3335 the removal of dead abnormal edges. */
3336 gsi = gsi_start_bb (return_block);
3337 if (gsi_end_p (gsi))
3339 gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3340 purge_dead_abnormal_edges = true;
3344 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3345 purge_dead_abnormal_edges = false;
3348 stmt_gsi = gsi_start_bb (return_block);
3350 /* Build a block containing code to initialize the arguments, the
3351 actual inline expansion of the body, and a label for the return
3352 statements within the function to jump to. The type of the
3353 statement expression is the return type of the function call. */
3354 id->block = make_node (BLOCK);
3355 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3356 BLOCK_SOURCE_LOCATION (id->block) = input_location;
3357 prepend_lexical_block (gimple_block (stmt), id->block);
3359 /* Local declarations will be replaced by their equivalents in this
3362 id->decl_map = pointer_map_create ();
3364 /* Record the function we are about to inline. */
3366 id->src_node = cg_edge->callee;
3367 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3368 id->gimple_call = stmt;
3370 gcc_assert (!id->src_cfun->after_inlining);
3373 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3375 gimple_stmt_iterator si = gsi_last_bb (bb);
3376 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3380 initialize_inlined_parameters (id, stmt, fn, bb);
3382 if (DECL_INITIAL (fn))
3383 prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3385 /* Return statements in the function body will be replaced by jumps
3386 to the RET_LABEL. */
3387 gcc_assert (DECL_INITIAL (fn));
3388 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3390 /* Find the LHS to which the result of this call is assigned. */
3392 if (gimple_call_lhs (stmt))
3394 modify_dest = gimple_call_lhs (stmt);
3396 /* The function which we are inlining might not return a value,
3397 in which case we should issue a warning that the function
3398 does not return a value. In that case the optimizers will
3399 see that the variable to which the value is assigned was not
3400 initialized. We do not want to issue a warning about that
3401 uninitialized variable. */
3402 if (DECL_P (modify_dest))
3403 TREE_NO_WARNING (modify_dest) = 1;
3405 if (gimple_call_return_slot_opt_p (stmt))
3407 return_slot = modify_dest;
3414 /* If we are inlining a call to the C++ operator new, we don't want
3415 to use type based alias analysis on the return value. Otherwise
3416 we may get confused if the compiler sees that the inlined new
3417 function returns a pointer which was just deleted. See bug
3419 if (DECL_IS_OPERATOR_NEW (fn))
3425 /* Declare the return variable for the function. */
3426 retvar = declare_return_variable (id, return_slot, modify_dest, &use_retvar);
3428 /* Add local vars in this inlined callee to caller. */
3429 t_step = id->src_cfun->local_decls;
3430 for (; t_step; t_step = TREE_CHAIN (t_step))
3432 var = TREE_VALUE (t_step);
3433 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3435 if (var_ann (var) && add_referenced_var (var))
3436 cfun->local_decls = tree_cons (NULL_TREE, var,
3439 else if (!can_be_nonlocal (var, id))
3440 cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3444 /* This is it. Duplicate the callee body. Assume callee is
3445 pre-gimplified. Note that we must not alter the caller
3446 function in any way before this point, as this CALL_EXPR may be
3447 a self-referential call; if we're calling ourselves, we need to
3448 duplicate our body before altering anything. */
3449 copy_body (id, bb->count, bb->frequency, bb, return_block);
3451 /* Reset the escaped and callused solutions. */
3452 if (cfun->gimple_df)
3454 pt_solution_reset (&cfun->gimple_df->escaped);
3455 pt_solution_reset (&cfun->gimple_df->callused);
3459 pointer_map_destroy (id->decl_map);
3462 /* Unlink the calls virtual operands before replacing it. */
3463 unlink_stmt_vdef (stmt);
3465 /* If the inlined function returns a result that we care about,
3466 substitute the GIMPLE_CALL with an assignment of the return
3467 variable to the LHS of the call. That is, if STMT was
3468 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3469 if (use_retvar && gimple_call_lhs (stmt))
3471 gimple old_stmt = stmt;
3472 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3473 gsi_replace (&stmt_gsi, stmt, false);
3474 if (gimple_in_ssa_p (cfun))
3475 mark_symbols_for_renaming (stmt);
3476 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3480 /* Handle the case of inlining a function with no return
3481 statement, which causes the return value to become undefined. */
3482 if (gimple_call_lhs (stmt)
3483 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3485 tree name = gimple_call_lhs (stmt);
3486 tree var = SSA_NAME_VAR (name);
3487 tree def = gimple_default_def (cfun, var);
3491 /* If the variable is used undefined, make this name
3492 undefined via a move. */
3493 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3494 gsi_replace (&stmt_gsi, stmt, true);
3498 /* Otherwise make this variable undefined. */
3499 gsi_remove (&stmt_gsi, true);
3500 set_default_def (var, name);
3501 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3505 gsi_remove (&stmt_gsi, true);
3508 if (purge_dead_abnormal_edges)
3509 gimple_purge_dead_abnormal_call_edges (return_block);
3511 /* If the value of the new expression is ignored, that's OK. We
3512 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3513 the equivalent inlined version either. */
3514 if (is_gimple_assign (stmt))
3516 gcc_assert (gimple_assign_single_p (stmt)
3517 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3518 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3521 /* Output the inlining info for this abstract function, since it has been
3522 inlined. If we don't do this now, we can lose the information about the
3523 variables in the function when the blocks get blown away as soon as we
3524 remove the cgraph node. */
3525 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3527 /* Update callgraph if needed. */
3528 cgraph_remove_node (cg_edge->callee);
3530 id->block = NULL_TREE;
3531 successfully_inlined = TRUE;
3534 input_location = saved_location;
3535 return successfully_inlined;
3538 /* Expand call statements reachable from STMT_P.
3539 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3540 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3541 unfortunately not use that function here because we need a pointer
3542 to the CALL_EXPR, not the tree itself. */
3545 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
3547 gimple_stmt_iterator gsi;
3549 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3551 gimple stmt = gsi_stmt (gsi);
3553 if (is_gimple_call (stmt)
3554 && expand_call_inline (bb, stmt, id))
3562 /* Walk all basic blocks created after FIRST and try to fold every statement
3563 in the STATEMENTS pointer set. */
3566 fold_marked_statements (int first, struct pointer_set_t *statements)
3568 for (; first < n_basic_blocks; first++)
3569 if (BASIC_BLOCK (first))
3571 gimple_stmt_iterator gsi;
3573 for (gsi = gsi_start_bb (BASIC_BLOCK (first));
3576 if (pointer_set_contains (statements, gsi_stmt (gsi)))
3578 gimple old_stmt = gsi_stmt (gsi);
3579 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
3581 if (fold_stmt (&gsi))
3583 /* Re-read the statement from GSI as fold_stmt() may
3585 gimple new_stmt = gsi_stmt (gsi);
3586 update_stmt (new_stmt);
3588 if (is_gimple_call (old_stmt)
3589 || is_gimple_call (new_stmt))
3590 cgraph_update_edges_for_call_stmt (old_stmt, old_decl, new_stmt);
3592 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
3593 gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3599 /* Return true if BB has at least one abnormal outgoing edge. */
3602 has_abnormal_outgoing_edge_p (basic_block bb)
3607 FOR_EACH_EDGE (e, ei, bb->succs)
3608 if (e->flags & EDGE_ABNORMAL)
3614 /* Expand calls to inline functions in the body of FN. */
3617 optimize_inline_calls (tree fn)
3622 int last = n_basic_blocks;
3623 struct gimplify_ctx gctx;
3625 /* There is no point in performing inlining if errors have already
3626 occurred -- and we might crash if we try to inline invalid
3628 if (errorcount || sorrycount)
3632 memset (&id, 0, sizeof (id));
3634 id.src_node = id.dst_node = cgraph_node (fn);
3636 /* Or any functions that aren't finished yet. */
3637 prev_fn = NULL_TREE;
3638 if (current_function_decl)
3640 id.dst_fn = current_function_decl;
3641 prev_fn = current_function_decl;
3644 id.copy_decl = copy_decl_maybe_to_var;
3645 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3646 id.transform_new_cfg = false;
3647 id.transform_return_to_modify = true;
3648 id.transform_lang_insert_block = NULL;
3649 id.statements_to_fold = pointer_set_create ();
3651 push_gimplify_context (&gctx);
3653 /* We make no attempts to keep dominance info up-to-date. */
3654 free_dominance_info (CDI_DOMINATORS);
3655 free_dominance_info (CDI_POST_DOMINATORS);
3657 /* Register specific gimple functions. */
3658 gimple_register_cfg_hooks ();
3660 /* Reach the trees by walking over the CFG, and note the
3661 enclosing basic-blocks in the call edges. */
3662 /* We walk the blocks going forward, because inlined function bodies
3663 will split id->current_basic_block, and the new blocks will
3664 follow it; we'll trudge through them, processing their CALL_EXPRs
3667 gimple_expand_calls_inline (bb, &id);
3669 pop_gimplify_context (NULL);
3671 #ifdef ENABLE_CHECKING
3673 struct cgraph_edge *e;
3675 verify_cgraph_node (id.dst_node);
3677 /* Double check that we inlined everything we are supposed to inline. */
3678 for (e = id.dst_node->callees; e; e = e->next_callee)
3679 gcc_assert (e->inline_failed);
3683 /* Fold the statements before compacting/renumbering the basic blocks. */
3684 fold_marked_statements (last, id.statements_to_fold);
3685 pointer_set_destroy (id.statements_to_fold);
3687 /* Renumber the (code) basic_blocks consecutively. */
3689 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3692 fold_cond_expr_cond ();
3693 delete_unreachable_blocks_update_callgraph (&id);
3694 #ifdef ENABLE_CHECKING
3695 verify_cgraph_node (id.dst_node);
3698 /* It would be nice to check SSA/CFG/statement consistency here, but it is
3699 not possible yet - the IPA passes might make various functions to not
3700 throw and they don't care to proactively update local EH info. This is
3701 done later in fixup_cfg pass that also execute the verification. */
3702 return (TODO_update_ssa
3704 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
3705 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
3708 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
3711 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
3713 enum tree_code code = TREE_CODE (*tp);
3714 enum tree_code_class cl = TREE_CODE_CLASS (code);
3716 /* We make copies of most nodes. */
3717 if (IS_EXPR_CODE_CLASS (cl)
3718 || code == TREE_LIST
3720 || code == TYPE_DECL
3721 || code == OMP_CLAUSE)
3723 /* Because the chain gets clobbered when we make a copy, we save it
3725 tree chain = NULL_TREE, new_tree;
3727 chain = TREE_CHAIN (*tp);
3729 /* Copy the node. */
3730 new_tree = copy_node (*tp);
3732 /* Propagate mudflap marked-ness. */
3733 if (flag_mudflap && mf_marked_p (*tp))
3738 /* Now, restore the chain, if appropriate. That will cause
3739 walk_tree to walk into the chain as well. */
3740 if (code == PARM_DECL
3741 || code == TREE_LIST
3742 || code == OMP_CLAUSE)
3743 TREE_CHAIN (*tp) = chain;
3745 /* For now, we don't update BLOCKs when we make copies. So, we
3746 have to nullify all BIND_EXPRs. */
3747 if (TREE_CODE (*tp) == BIND_EXPR)
3748 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
3750 else if (code == CONSTRUCTOR)
3752 /* CONSTRUCTOR nodes need special handling because
3753 we need to duplicate the vector of elements. */
3756 new_tree = copy_node (*tp);
3758 /* Propagate mudflap marked-ness. */
3759 if (flag_mudflap && mf_marked_p (*tp))
3762 CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
3763 CONSTRUCTOR_ELTS (*tp));
3766 else if (TREE_CODE_CLASS (code) == tcc_type)
3768 else if (TREE_CODE_CLASS (code) == tcc_declaration)
3770 else if (TREE_CODE_CLASS (code) == tcc_constant)
3773 gcc_assert (code != STATEMENT_LIST);
3777 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3778 information indicating to what new SAVE_EXPR this one should be mapped,
3779 use that one. Otherwise, create a new node and enter it in ST. FN is
3780 the function into which the copy will be placed. */
3783 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
3785 struct pointer_map_t *st = (struct pointer_map_t *) st_;
3789 /* See if we already encountered this SAVE_EXPR. */
3790 n = (tree *) pointer_map_contains (st, *tp);
3792 /* If we didn't already remap this SAVE_EXPR, do so now. */
3795 t = copy_node (*tp);
3797 /* Remember this SAVE_EXPR. */
3798 *pointer_map_insert (st, *tp) = t;
3799 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3800 *pointer_map_insert (st, t) = t;
3804 /* We've already walked into this SAVE_EXPR; don't do it again. */
3809 /* Replace this SAVE_EXPR with the copy. */
3813 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3814 copies the declaration and enters it in the splay_tree in DATA (which is
3815 really an `copy_body_data *'). */
3818 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3821 copy_body_data *id = (copy_body_data *) data;
3823 /* Don't walk into types. */
3827 else if (TREE_CODE (*tp) == LABEL_EXPR)
3829 tree decl = TREE_OPERAND (*tp, 0);
3831 /* Copy the decl and remember the copy. */
3832 insert_decl_map (id, decl, id->copy_decl (decl, id));
3838 /* Perform any modifications to EXPR required when it is unsaved. Does
3839 not recurse into EXPR's subtrees. */
3842 unsave_expr_1 (tree expr)
3844 switch (TREE_CODE (expr))
3847 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3848 It's OK for this to happen if it was part of a subtree that
3849 isn't immediately expanded, such as operand 2 of another
3851 if (TREE_OPERAND (expr, 1))
3854 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3855 TREE_OPERAND (expr, 3) = NULL_TREE;
3863 /* Called via walk_tree when an expression is unsaved. Using the
3864 splay_tree pointed to by ST (which is really a `splay_tree'),
3865 remaps all local declarations to appropriate replacements. */
3868 unsave_r (tree *tp, int *walk_subtrees, void *data)
3870 copy_body_data *id = (copy_body_data *) data;
3871 struct pointer_map_t *st = id->decl_map;
3874 /* Only a local declaration (variable or label). */
3875 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3876 || TREE_CODE (*tp) == LABEL_DECL)
3878 /* Lookup the declaration. */
3879 n = (tree *) pointer_map_contains (st, *tp);
3881 /* If it's there, remap it. */
3886 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3888 else if (TREE_CODE (*tp) == BIND_EXPR)
3889 copy_bind_expr (tp, walk_subtrees, id);
3890 else if (TREE_CODE (*tp) == SAVE_EXPR)
3891 remap_save_expr (tp, st, walk_subtrees);
3894 copy_tree_r (tp, walk_subtrees, NULL);
3896 /* Do whatever unsaving is required. */
3897 unsave_expr_1 (*tp);
3900 /* Keep iterating. */
3904 /* Copies everything in EXPR and replaces variables, labels
3905 and SAVE_EXPRs local to EXPR. */
3908 unsave_expr_now (tree expr)
3912 /* There's nothing to do for NULL_TREE. */
3917 memset (&id, 0, sizeof (id));
3918 id.src_fn = current_function_decl;
3919 id.dst_fn = current_function_decl;
3920 id.decl_map = pointer_map_create ();
3922 id.copy_decl = copy_decl_no_change;
3923 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3924 id.transform_new_cfg = false;
3925 id.transform_return_to_modify = false;
3926 id.transform_lang_insert_block = NULL;
3928 /* Walk the tree once to find local labels. */
3929 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3931 /* Walk the tree again, copying, remapping, and unsaving. */
3932 walk_tree (&expr, unsave_r, &id, NULL);
3935 pointer_map_destroy (id.decl_map);
3940 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
3941 label, copies the declaration and enters it in the splay_tree in DATA (which
3942 is really a 'copy_body_data *'. */
3945 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
3946 bool *handled_ops_p ATTRIBUTE_UNUSED,
3947 struct walk_stmt_info *wi)
3949 copy_body_data *id = (copy_body_data *) wi->info;
3950 gimple stmt = gsi_stmt (*gsip);
3952 if (gimple_code (stmt) == GIMPLE_LABEL)
3954 tree decl = gimple_label_label (stmt);
3956 /* Copy the decl and remember the copy. */
3957 insert_decl_map (id, decl, id->copy_decl (decl, id));
3964 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
3965 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
3966 remaps all local declarations to appropriate replacements in gimple
3970 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
3972 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
3973 copy_body_data *id = (copy_body_data *) wi->info;
3974 struct pointer_map_t *st = id->decl_map;
3978 /* Only a local declaration (variable or label). */
3979 if ((TREE_CODE (expr) == VAR_DECL
3980 && !TREE_STATIC (expr))
3981 || TREE_CODE (expr) == LABEL_DECL)
3983 /* Lookup the declaration. */
3984 n = (tree *) pointer_map_contains (st, expr);
3986 /* If it's there, remap it. */
3991 else if (TREE_CODE (expr) == STATEMENT_LIST
3992 || TREE_CODE (expr) == BIND_EXPR
3993 || TREE_CODE (expr) == SAVE_EXPR)
3995 else if (TREE_CODE (expr) == TARGET_EXPR)
3997 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3998 It's OK for this to happen if it was part of a subtree that
3999 isn't immediately expanded, such as operand 2 of another
4001 if (!TREE_OPERAND (expr, 1))
4003 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4004 TREE_OPERAND (expr, 3) = NULL_TREE;
4008 /* Keep iterating. */
4013 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4014 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4015 remaps all local declarations to appropriate replacements in gimple
4019 replace_locals_stmt (gimple_stmt_iterator *gsip,
4020 bool *handled_ops_p ATTRIBUTE_UNUSED,
4021 struct walk_stmt_info *wi)
4023 copy_body_data *id = (copy_body_data *) wi->info;
4024 gimple stmt = gsi_stmt (*gsip);
4026 if (gimple_code (stmt) == GIMPLE_BIND)
4028 tree block = gimple_bind_block (stmt);
4032 remap_block (&block, id);
4033 gimple_bind_set_block (stmt, block);
4036 /* This will remap a lot of the same decls again, but this should be
4038 if (gimple_bind_vars (stmt))
4039 gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4042 /* Keep iterating. */
4047 /* Copies everything in SEQ and replaces variables and labels local to
4048 current_function_decl. */
4051 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4054 struct walk_stmt_info wi;
4055 struct pointer_set_t *visited;
4058 /* There's nothing to do for NULL_TREE. */
4063 memset (&id, 0, sizeof (id));
4064 id.src_fn = current_function_decl;
4065 id.dst_fn = current_function_decl;
4066 id.decl_map = pointer_map_create ();
4068 id.copy_decl = copy_decl_no_change;
4069 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4070 id.transform_new_cfg = false;
4071 id.transform_return_to_modify = false;
4072 id.transform_lang_insert_block = NULL;
4074 /* Walk the tree once to find local labels. */
4075 memset (&wi, 0, sizeof (wi));
4076 visited = pointer_set_create ();
4079 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4080 pointer_set_destroy (visited);
4082 copy = gimple_seq_copy (seq);
4084 /* Walk the copy, remapping decls. */
4085 memset (&wi, 0, sizeof (wi));
4087 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4090 pointer_map_destroy (id.decl_map);
4096 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4099 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4108 debug_find_tree (tree top, tree search)
4110 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4114 /* Declare the variables created by the inliner. Add all the variables in
4115 VARS to BIND_EXPR. */
4118 declare_inline_vars (tree block, tree vars)
4121 for (t = vars; t; t = TREE_CHAIN (t))
4123 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4124 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4125 cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4129 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4132 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4133 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4134 VAR_DECL translation. */
4137 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4139 /* Don't generate debug information for the copy if we wouldn't have
4140 generated it for the copy either. */
4141 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4142 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4144 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4145 declaration inspired this copy. */
4146 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4148 /* The new variable/label has no RTL, yet. */
4149 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4150 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4151 SET_DECL_RTL (copy, NULL_RTX);
4153 /* These args would always appear unused, if not for this. */
4154 TREE_USED (copy) = 1;
4156 /* Set the context for the new declaration. */
4157 if (!DECL_CONTEXT (decl))
4158 /* Globals stay global. */
4160 else if (DECL_CONTEXT (decl) != id->src_fn)
4161 /* Things that weren't in the scope of the function we're inlining
4162 from aren't in the scope we're inlining to, either. */
4164 else if (TREE_STATIC (decl))
4165 /* Function-scoped static variables should stay in the original
4169 /* Ordinary automatic local variables are now in the scope of the
4171 DECL_CONTEXT (copy) = id->dst_fn;
4177 copy_decl_to_var (tree decl, copy_body_data *id)
4181 gcc_assert (TREE_CODE (decl) == PARM_DECL
4182 || TREE_CODE (decl) == RESULT_DECL);
4184 type = TREE_TYPE (decl);
4186 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
4187 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4188 TREE_READONLY (copy) = TREE_READONLY (decl);
4189 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4190 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4192 return copy_decl_for_dup_finish (id, decl, copy);
4195 /* Like copy_decl_to_var, but create a return slot object instead of a
4196 pointer variable for return by invisible reference. */
4199 copy_result_decl_to_var (tree decl, copy_body_data *id)
4203 gcc_assert (TREE_CODE (decl) == PARM_DECL
4204 || TREE_CODE (decl) == RESULT_DECL);
4206 type = TREE_TYPE (decl);
4207 if (DECL_BY_REFERENCE (decl))
4208 type = TREE_TYPE (type);
4210 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
4211 TREE_READONLY (copy) = TREE_READONLY (decl);
4212 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4213 if (!DECL_BY_REFERENCE (decl))
4215 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4216 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4219 return copy_decl_for_dup_finish (id, decl, copy);
4223 copy_decl_no_change (tree decl, copy_body_data *id)
4227 copy = copy_node (decl);
4229 /* The COPY is not abstract; it will be generated in DST_FN. */
4230 DECL_ABSTRACT (copy) = 0;
4231 lang_hooks.dup_lang_specific_decl (copy);
4233 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4234 been taken; it's for internal bookkeeping in expand_goto_internal. */
4235 if (TREE_CODE (copy) == LABEL_DECL)
4237 TREE_ADDRESSABLE (copy) = 0;
4238 LABEL_DECL_UID (copy) = -1;
4241 return copy_decl_for_dup_finish (id, decl, copy);
4245 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4247 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4248 return copy_decl_to_var (decl, id);
4250 return copy_decl_no_change (decl, id);
4253 /* Return a copy of the function's argument tree. */
4255 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4256 bitmap args_to_skip, tree *vars)
4259 tree new_parm = NULL;
4264 for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4265 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4267 tree new_tree = remap_decl (arg, id);
4268 lang_hooks.dup_lang_specific_decl (new_tree);
4270 parg = &TREE_CHAIN (new_tree);
4272 else if (!pointer_map_contains (id->decl_map, arg))
4274 /* Make an equivalent VAR_DECL. If the argument was used
4275 as temporary variable later in function, the uses will be
4276 replaced by local variable. */
4277 tree var = copy_decl_to_var (arg, id);
4279 add_referenced_var (var);
4280 insert_decl_map (id, arg, var);
4281 /* Declare this new variable. */
4282 TREE_CHAIN (var) = *vars;
4288 /* Return a copy of the function's static chain. */
4290 copy_static_chain (tree static_chain, copy_body_data * id)
4292 tree *chain_copy, *pvar;
4294 chain_copy = &static_chain;
4295 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4297 tree new_tree = remap_decl (*pvar, id);
4298 lang_hooks.dup_lang_specific_decl (new_tree);
4299 TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4302 return static_chain;
4305 /* Return true if the function is allowed to be versioned.
4306 This is a guard for the versioning functionality. */
4308 tree_versionable_function_p (tree fndecl)
4310 if (fndecl == NULL_TREE)
4312 /* ??? There are cases where a function is
4313 uninlinable but can be versioned. */
4314 if (!tree_inlinable_function_p (fndecl))
4320 /* Delete all unreachable basic blocks and update callgraph.
4321 Doing so is somewhat nontrivial because we need to update all clones and
4322 remove inline function that become unreachable. */
4325 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4327 bool changed = false;
4328 basic_block b, next_bb;
4330 find_unreachable_blocks ();
4332 /* Delete all unreachable basic blocks. */
4334 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4336 next_bb = b->next_bb;
4338 if (!(b->flags & BB_REACHABLE))
4340 gimple_stmt_iterator bsi;
4342 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4343 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4345 struct cgraph_edge *e;
4346 struct cgraph_node *node;
4348 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4350 if (!e->inline_failed)
4351 cgraph_remove_node_and_inline_clones (e->callee);
4353 cgraph_remove_edge (e);
4355 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4356 && id->dst_node->clones)
4357 for (node = id->dst_node->clones; node != id->dst_node;)
4359 if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4361 if (!e->inline_failed)
4362 cgraph_remove_node_and_inline_clones (e->callee);
4364 cgraph_remove_edge (e);
4368 node = node->clones;
4369 else if (node->next_sibling_clone)
4370 node = node->next_sibling_clone;
4373 while (node != id->dst_node && !node->next_sibling_clone)
4374 node = node->clone_of;
4375 if (node != id->dst_node)
4376 node = node->next_sibling_clone;
4380 delete_basic_block (b);
4386 tidy_fallthru_edges ();
4387 #ifdef ENABLE_CHECKING0
4388 verify_cgraph_node (id->dst_node);
4389 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4390 && id->dst_node->clones)
4392 struct cgraph_node *node;
4393 for (node = id->dst_node->clones; node != id->dst_node;)
4395 verify_cgraph_node (node);
4398 node = node->clones;
4399 else if (node->next_sibling_clone)
4400 node = node->next_sibling_clone;
4403 while (node != id->dst_node && !node->next_sibling_clone)
4404 node = node->clone_of;
4405 if (node != id->dst_node)
4406 node = node->next_sibling_clone;
4414 /* Create a copy of a function's tree.
4415 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4416 of the original function and the new copied function
4417 respectively. In case we want to replace a DECL
4418 tree with another tree while duplicating the function's
4419 body, TREE_MAP represents the mapping between these
4420 trees. If UPDATE_CLONES is set, the call_stmt fields
4421 of edges of clones of the function will be updated. */
4423 tree_function_versioning (tree old_decl, tree new_decl, VEC(ipa_replace_map_p,gc)* tree_map,
4424 bool update_clones, bitmap args_to_skip)
4426 struct cgraph_node *old_version_node;
4427 struct cgraph_node *new_version_node;
4431 struct ipa_replace_map *replace_info;
4432 basic_block old_entry_block;
4433 VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4436 tree old_current_function_decl = current_function_decl;
4437 tree vars = NULL_TREE;
4439 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4440 && TREE_CODE (new_decl) == FUNCTION_DECL);
4441 DECL_POSSIBLY_INLINED (old_decl) = 1;
4443 old_version_node = cgraph_node (old_decl);
4444 new_version_node = cgraph_node (new_decl);
4446 /* Output the inlining info for this abstract function, since it has been
4447 inlined. If we don't do this now, we can lose the information about the
4448 variables in the function when the blocks get blown away as soon as we
4449 remove the cgraph node. */
4450 (*debug_hooks->outlining_inline_function) (old_decl);
4452 DECL_ARTIFICIAL (new_decl) = 1;
4453 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4455 /* Prepare the data structures for the tree copy. */
4456 memset (&id, 0, sizeof (id));
4458 /* Generate a new name for the new version. */
4459 id.statements_to_fold = pointer_set_create ();
4461 id.decl_map = pointer_map_create ();
4462 id.src_fn = old_decl;
4463 id.dst_fn = new_decl;
4464 id.src_node = old_version_node;
4465 id.dst_node = new_version_node;
4466 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4468 id.copy_decl = copy_decl_no_change;
4469 id.transform_call_graph_edges
4470 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
4471 id.transform_new_cfg = true;
4472 id.transform_return_to_modify = false;
4473 id.transform_lang_insert_block = NULL;
4475 current_function_decl = new_decl;
4476 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
4477 (DECL_STRUCT_FUNCTION (old_decl));
4478 initialize_cfun (new_decl, old_decl,
4479 old_entry_block->count,
4480 old_entry_block->frequency);
4481 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
4483 /* Copy the function's static chain. */
4484 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
4486 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
4487 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
4490 /* If there's a tree_map, prepare for substitution. */
4492 for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
4495 replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
4496 if (replace_info->replace_p)
4498 tree op = replace_info->new_tree;
4502 if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
4503 op = TREE_OPERAND (op, 0);
4505 if (TREE_CODE (op) == ADDR_EXPR)
4507 op = TREE_OPERAND (op, 0);
4508 while (handled_component_p (op))
4509 op = TREE_OPERAND (op, 0);
4510 if (TREE_CODE (op) == VAR_DECL)
4511 add_referenced_var (op);
4513 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
4514 init = setup_one_parameter (&id, replace_info->old_tree,
4515 replace_info->new_tree, id.src_fn,
4519 VEC_safe_push (gimple, heap, init_stmts, init);
4522 /* Copy the function's arguments. */
4523 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
4524 DECL_ARGUMENTS (new_decl) =
4525 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
4526 args_to_skip, &vars);
4528 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
4530 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4531 number_blocks (id.dst_fn);
4533 declare_inline_vars (DECL_INITIAL (new_decl), vars);
4535 if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
4536 /* Add local vars. */
4537 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
4538 t_step; t_step = TREE_CHAIN (t_step))
4540 tree var = TREE_VALUE (t_step);
4541 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
4542 cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
4543 else if (!can_be_nonlocal (var, &id))
4545 tree_cons (NULL_TREE, remap_decl (var, &id),
4549 /* Copy the Function's body. */
4550 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
4552 if (DECL_RESULT (old_decl) != NULL_TREE)
4554 tree *res_decl = &DECL_RESULT (old_decl);
4555 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
4556 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
4559 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4560 number_blocks (new_decl);
4562 if (VEC_length (gimple, init_stmts))
4564 basic_block bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
4565 while (VEC_length (gimple, init_stmts))
4566 insert_init_stmt (bb, VEC_pop (gimple, init_stmts));
4570 pointer_map_destroy (id.decl_map);
4571 free_dominance_info (CDI_DOMINATORS);
4572 free_dominance_info (CDI_POST_DOMINATORS);
4574 fold_marked_statements (0, id.statements_to_fold);
4575 pointer_set_destroy (id.statements_to_fold);
4576 fold_cond_expr_cond ();
4577 delete_unreachable_blocks_update_callgraph (&id);
4578 update_ssa (TODO_update_ssa);
4579 free_dominance_info (CDI_DOMINATORS);
4580 free_dominance_info (CDI_POST_DOMINATORS);
4582 VEC_free (gimple, heap, init_stmts);
4584 current_function_decl = old_current_function_decl;
4585 gcc_assert (!current_function_decl
4586 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
4590 /* Duplicate a type, fields and all. */
4593 build_duplicate_type (tree type)
4595 struct copy_body_data id;
4597 memset (&id, 0, sizeof (id));
4598 id.src_fn = current_function_decl;
4599 id.dst_fn = current_function_decl;
4601 id.decl_map = pointer_map_create ();
4602 id.copy_decl = copy_decl_no_change;
4604 type = remap_type_1 (type, &id);
4606 pointer_map_destroy (id.decl_map);
4608 TYPE_CANONICAL (type) = type;
4613 /* Return whether it is safe to inline a function because it used different
4614 target specific options or different optimization options. */
4616 tree_can_inline_p (tree caller, tree callee)
4619 /* This causes a regression in SPEC in that it prevents a cold function from
4620 inlining a hot function. Perhaps this should only apply to functions
4621 that the user declares hot/cold/optimize explicitly. */
4623 /* Don't inline a function with a higher optimization level than the
4624 caller, or with different space constraints (hot/cold functions). */
4625 tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
4626 tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
4628 if (caller_tree != callee_tree)
4630 struct cl_optimization *caller_opt
4631 = TREE_OPTIMIZATION ((caller_tree)
4633 : optimization_default_node);
4635 struct cl_optimization *callee_opt
4636 = TREE_OPTIMIZATION ((callee_tree)
4638 : optimization_default_node);
4640 if ((caller_opt->optimize > callee_opt->optimize)
4641 || (caller_opt->optimize_size != callee_opt->optimize_size))
4646 /* Allow the backend to decide if inlining is ok. */
4647 return targetm.target_option.can_inline_p (caller, callee);