2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "tree-inline.h"
34 #include "insn-config.h"
37 #include "langhooks.h"
38 #include "basic-block.h"
39 #include "tree-iterator.h"
42 #include "tree-mudflap.h"
43 #include "tree-flow.h"
46 #include "tree-flow.h"
47 #include "diagnostic.h"
50 #include "pointer-set.h"
52 #include "value-prof.h"
53 #include "tree-pass.h"
55 /* I'm not real happy about this, but we need to handle gimple and
57 #include "tree-gimple.h"
59 /* Inlining, Cloning, Versioning, Parallelization
61 Inlining: a function body is duplicated, but the PARM_DECLs are
62 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
63 GIMPLE_MODIFY_STMTs that store to a dedicated returned-value variable.
64 The duplicated eh_region info of the copy will later be appended
65 to the info for the caller; the eh_region info in copied throwing
66 statements and RESX_EXPRs is adjusted accordingly.
68 Cloning: (only in C++) We have one body for a con/de/structor, and
69 multiple function decls, each with a unique parameter list.
70 Duplicate the body, using the given splay tree; some parameters
71 will become constants (like 0 or 1).
73 Versioning: a function body is duplicated and the result is a new
74 function rather than into blocks of an existing function as with
75 inlining. Some parameters will become constants.
77 Parallelization: a region of a function is duplicated resulting in
78 a new function. Variables may be replaced with complex expressions
79 to enable shared variable semantics.
81 All of these will simultaneously lookup any callgraph edges. If
82 we're going to inline the duplicated function body, and the given
83 function has some cloned callgraph nodes (one for each place this
84 function will be inlined) those callgraph edges will be duplicated.
85 If we're cloning the body, those callgraph edges will be
86 updated to point into the new body. (Note that the original
87 callgraph node and edge list will not be altered.)
89 See the CALL_EXPR handling case in copy_body_r (). */
91 /* 0 if we should not perform inlining.
92 1 if we should expand functions calls inline at the tree level.
93 2 if we should consider *all* functions to be inline
96 int flag_inline_trees = 0;
100 o In order to make inlining-on-trees work, we pessimized
101 function-local static constants. In particular, they are now
102 always output, even when not addressed. Fix this by treating
103 function-local static constants just like global static
104 constants; the back-end already knows not to output them if they
107 o Provide heuristics to clamp inlining of recursive template
111 /* Weights that estimate_num_insns uses for heuristics in inlining. */
113 eni_weights eni_inlining_weights;
115 /* Weights that estimate_num_insns uses to estimate the size of the
118 eni_weights eni_size_weights;
120 /* Weights that estimate_num_insns uses to estimate the time necessary
121 to execute the produced code. */
123 eni_weights eni_time_weights;
127 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
128 static tree copy_generic_body (copy_body_data *);
129 static bool inlinable_function_p (tree);
130 static void remap_block (tree *, copy_body_data *);
131 static tree remap_decls (tree, copy_body_data *);
132 static void copy_bind_expr (tree *, int *, copy_body_data *);
133 static tree mark_local_for_remap_r (tree *, int *, void *);
134 static void unsave_expr_1 (tree);
135 static tree unsave_r (tree *, int *, void *);
136 static void declare_inline_vars (tree, tree);
137 static void remap_save_expr (tree *, void *, int *);
138 static void add_lexical_block (tree current_block, tree new_block);
139 static tree copy_decl_to_var (tree, copy_body_data *);
140 static tree copy_result_decl_to_var (tree, copy_body_data *);
141 static tree copy_decl_no_change (tree, copy_body_data *);
142 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
144 /* Insert a tree->tree mapping for ID. Despite the name suggests
145 that the trees should be variables, it is used for more than that. */
148 insert_decl_map (copy_body_data *id, tree key, tree value)
150 *pointer_map_insert (id->decl_map, key) = value;
152 /* Always insert an identity map as well. If we see this same new
153 node again, we won't want to duplicate it a second time. */
155 *pointer_map_insert (id->decl_map, value) = value;
158 /* Construct new SSA name for old NAME. ID is the inline context. */
161 remap_ssa_name (tree name, copy_body_data *id)
166 gcc_assert (TREE_CODE (name) == SSA_NAME);
168 n = (tree *) pointer_map_contains (id->decl_map, name);
172 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
174 new = remap_decl (SSA_NAME_VAR (name), id);
175 /* We might've substituted constant or another SSA_NAME for
178 Replace the SSA name representing RESULT_DECL by variable during
179 inlining: this saves us from need to introduce PHI node in a case
180 return value is just partly initialized. */
181 if ((TREE_CODE (new) == VAR_DECL || TREE_CODE (new) == PARM_DECL)
182 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
183 || !id->transform_return_to_modify))
185 new = make_ssa_name (new, NULL);
186 insert_decl_map (id, name, new);
187 if (IS_EMPTY_STMT (SSA_NAME_DEF_STMT (name)))
189 SSA_NAME_DEF_STMT (new) = build_empty_stmt ();
190 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name)) == name)
191 set_default_def (SSA_NAME_VAR (new), new);
193 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new)
194 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
195 TREE_TYPE (new) = TREE_TYPE (SSA_NAME_VAR (new));
198 insert_decl_map (id, name, new);
202 /* Remap DECL during the copying of the BLOCK tree for the function. */
205 remap_decl (tree decl, copy_body_data *id)
210 /* We only remap local variables in the current function. */
213 /* See if we have remapped this declaration. */
215 n = (tree *) pointer_map_contains (id->decl_map, decl);
217 /* If we didn't already have an equivalent for this declaration,
221 /* Make a copy of the variable or label. */
222 tree t = id->copy_decl (decl, id);
224 /* Remember it, so that if we encounter this local entity again
225 we can reuse this copy. Do this early because remap_type may
226 need this decl for TYPE_STUB_DECL. */
227 insert_decl_map (id, decl, t);
232 /* Remap types, if necessary. */
233 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
234 if (TREE_CODE (t) == TYPE_DECL)
235 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
237 /* Remap sizes as necessary. */
238 walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
239 walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
241 /* If fields, do likewise for offset and qualifier. */
242 if (TREE_CODE (t) == FIELD_DECL)
244 walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
245 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
246 walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
249 if (cfun && gimple_in_ssa_p (cfun)
250 && (TREE_CODE (t) == VAR_DECL
251 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
253 tree def = gimple_default_def (id->src_cfun, decl);
255 if (TREE_CODE (decl) != PARM_DECL && def)
257 tree map = remap_ssa_name (def, id);
258 /* Watch out RESULT_DECLs whose SSA names map directly
260 if (TREE_CODE (map) == SSA_NAME)
261 set_default_def (t, map);
263 add_referenced_var (t);
268 return unshare_expr (*n);
272 remap_type_1 (tree type, copy_body_data *id)
280 /* See if we have remapped this type. */
281 node = (tree *) pointer_map_contains (id->decl_map, type);
285 /* The type only needs remapping if it's variably modified. */
286 if (! variably_modified_type_p (type, id->src_fn))
288 insert_decl_map (id, type, type);
292 /* We do need a copy. build and register it now. If this is a pointer or
293 reference type, remap the designated type and make a new pointer or
295 if (TREE_CODE (type) == POINTER_TYPE)
297 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
299 TYPE_REF_CAN_ALIAS_ALL (type));
300 insert_decl_map (id, type, new);
303 else if (TREE_CODE (type) == REFERENCE_TYPE)
305 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
307 TYPE_REF_CAN_ALIAS_ALL (type));
308 insert_decl_map (id, type, new);
312 new = copy_node (type);
314 insert_decl_map (id, type, new);
316 /* This is a new type, not a copy of an old type. Need to reassociate
317 variants. We can handle everything except the main variant lazily. */
318 t = TYPE_MAIN_VARIANT (type);
321 t = remap_type (t, id);
322 TYPE_MAIN_VARIANT (new) = t;
323 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t);
324 TYPE_NEXT_VARIANT (t) = new;
328 TYPE_MAIN_VARIANT (new) = new;
329 TYPE_NEXT_VARIANT (new) = NULL;
332 if (TYPE_STUB_DECL (type))
333 TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
335 /* Lazily create pointer and reference types. */
336 TYPE_POINTER_TO (new) = NULL;
337 TYPE_REFERENCE_TO (new) = NULL;
339 switch (TREE_CODE (new))
345 t = TYPE_MIN_VALUE (new);
346 if (t && TREE_CODE (t) != INTEGER_CST)
347 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
349 t = TYPE_MAX_VALUE (new);
350 if (t && TREE_CODE (t) != INTEGER_CST)
351 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
355 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
356 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
360 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
361 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
366 case QUAL_UNION_TYPE:
370 for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
372 t = remap_decl (f, id);
373 DECL_CONTEXT (t) = new;
377 TYPE_FIELDS (new) = nreverse (nf);
383 /* Shouldn't have been thought variable sized. */
387 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
388 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
394 remap_type (tree type, copy_body_data *id)
401 /* See if we have remapped this type. */
402 node = (tree *) pointer_map_contains (id->decl_map, type);
406 /* The type only needs remapping if it's variably modified. */
407 if (! variably_modified_type_p (type, id->src_fn))
409 insert_decl_map (id, type, type);
413 return remap_type_1 (type, id);
417 remap_decls (tree decls, copy_body_data *id)
420 tree new_decls = NULL_TREE;
422 /* Remap its variables. */
423 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
427 /* We can not chain the local static declarations into the unexpanded_var_list
428 as we can't duplicate them or break one decl rule. Go ahead and link
429 them into unexpanded_var_list. */
430 if (!lang_hooks.tree_inlining.auto_var_in_fn_p (old_var, id->src_fn)
431 && !DECL_EXTERNAL (old_var))
433 cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
434 cfun->unexpanded_var_list);
438 /* Remap the variable. */
439 new_var = remap_decl (old_var, id);
441 /* If we didn't remap this variable, so we can't mess with its
442 TREE_CHAIN. If we remapped this variable to the return slot, it's
443 already declared somewhere else, so don't declare it here. */
444 if (!new_var || new_var == id->retvar)
448 gcc_assert (DECL_P (new_var));
449 TREE_CHAIN (new_var) = new_decls;
454 return nreverse (new_decls);
457 /* Copy the BLOCK to contain remapped versions of the variables
458 therein. And hook the new block into the block-tree. */
461 remap_block (tree *block, copy_body_data *id)
467 /* Make the new block. */
469 new_block = make_node (BLOCK);
470 TREE_USED (new_block) = TREE_USED (old_block);
471 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
472 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
475 /* Remap its variables. */
476 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
480 if (id->transform_lang_insert_block)
481 lang_hooks.decls.insert_block (new_block);
483 /* Remember the remapped block. */
484 insert_decl_map (id, old_block, new_block);
487 /* Copy the whole block tree and root it in id->block. */
489 remap_blocks (tree block, copy_body_data *id)
497 remap_block (&new, id);
498 gcc_assert (new != block);
499 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
500 add_lexical_block (new, remap_blocks (t, id));
505 copy_statement_list (tree *tp)
507 tree_stmt_iterator oi, ni;
510 new = alloc_stmt_list ();
511 ni = tsi_start (new);
512 oi = tsi_start (*tp);
515 for (; !tsi_end_p (oi); tsi_next (&oi))
516 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
520 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
522 tree block = BIND_EXPR_BLOCK (*tp);
523 /* Copy (and replace) the statement. */
524 copy_tree_r (tp, walk_subtrees, NULL);
527 remap_block (&block, id);
528 BIND_EXPR_BLOCK (*tp) = block;
531 if (BIND_EXPR_VARS (*tp))
532 /* This will remap a lot of the same decls again, but this should be
534 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
537 /* Called from copy_body_id via walk_tree. DATA is really an
538 `copy_body_data *'. */
541 copy_body_r (tree *tp, int *walk_subtrees, void *data)
543 copy_body_data *id = (copy_body_data *) data;
544 tree fn = id->src_fn;
547 /* Begin by recognizing trees that we'll completely rewrite for the
548 inlining context. Our output for these trees is completely
549 different from out input (e.g. RETURN_EXPR is deleted, and morphs
550 into an edge). Further down, we'll handle trees that get
551 duplicated and/or tweaked. */
553 /* When requested, RETURN_EXPRs should be transformed to just the
554 contained GIMPLE_MODIFY_STMT. The branch semantics of the return will
555 be handled elsewhere by manipulating the CFG rather than a statement. */
556 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
558 tree assignment = TREE_OPERAND (*tp, 0);
560 /* If we're returning something, just turn that into an
561 assignment into the equivalent of the original RESULT_DECL.
562 If the "assignment" is just the result decl, the result
563 decl has already been set (e.g. a recent "foo (&result_decl,
564 ...)"); just toss the entire RETURN_EXPR. */
565 if (assignment && TREE_CODE (assignment) == GIMPLE_MODIFY_STMT)
567 /* Replace the RETURN_EXPR with (a copy of) the
568 GIMPLE_MODIFY_STMT hanging underneath. */
569 *tp = copy_node (assignment);
571 else /* Else the RETURN_EXPR returns no value. */
574 return (tree) (void *)1;
577 else if (TREE_CODE (*tp) == SSA_NAME)
579 *tp = remap_ssa_name (*tp, id);
584 /* Local variables and labels need to be replaced by equivalent
585 variables. We don't want to copy static variables; there's only
586 one of those, no matter how many times we inline the containing
587 function. Similarly for globals from an outer function. */
588 else if (lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
592 /* Remap the declaration. */
593 new_decl = remap_decl (*tp, id);
594 gcc_assert (new_decl);
595 /* Replace this variable with the copy. */
596 STRIP_TYPE_NOPS (new_decl);
600 else if (TREE_CODE (*tp) == STATEMENT_LIST)
601 copy_statement_list (tp);
602 else if (TREE_CODE (*tp) == SAVE_EXPR)
603 remap_save_expr (tp, id->decl_map, walk_subtrees);
604 else if (TREE_CODE (*tp) == LABEL_DECL
605 && (! DECL_CONTEXT (*tp)
606 || decl_function_context (*tp) == id->src_fn))
607 /* These may need to be remapped for EH handling. */
608 *tp = remap_decl (*tp, id);
609 else if (TREE_CODE (*tp) == BIND_EXPR)
610 copy_bind_expr (tp, walk_subtrees, id);
611 /* Types may need remapping as well. */
612 else if (TYPE_P (*tp))
613 *tp = remap_type (*tp, id);
615 /* If this is a constant, we have to copy the node iff the type will be
616 remapped. copy_tree_r will not copy a constant. */
617 else if (CONSTANT_CLASS_P (*tp))
619 tree new_type = remap_type (TREE_TYPE (*tp), id);
621 if (new_type == TREE_TYPE (*tp))
624 else if (TREE_CODE (*tp) == INTEGER_CST)
625 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
626 TREE_INT_CST_HIGH (*tp));
629 *tp = copy_node (*tp);
630 TREE_TYPE (*tp) = new_type;
634 /* Otherwise, just copy the node. Note that copy_tree_r already
635 knows not to copy VAR_DECLs, etc., so this is safe. */
638 /* Here we handle trees that are not completely rewritten.
639 First we detect some inlining-induced bogosities for
641 if (TREE_CODE (*tp) == GIMPLE_MODIFY_STMT
642 && GIMPLE_STMT_OPERAND (*tp, 0) == GIMPLE_STMT_OPERAND (*tp, 1)
643 && (lang_hooks.tree_inlining.auto_var_in_fn_p
644 (GIMPLE_STMT_OPERAND (*tp, 0), fn)))
646 /* Some assignments VAR = VAR; don't generate any rtl code
647 and thus don't count as variable modification. Avoid
648 keeping bogosities like 0 = 0. */
649 tree decl = GIMPLE_STMT_OPERAND (*tp, 0), value;
652 n = (tree *) pointer_map_contains (id->decl_map, decl);
656 STRIP_TYPE_NOPS (value);
657 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
659 *tp = build_empty_stmt ();
660 return copy_body_r (tp, walk_subtrees, data);
664 else if (TREE_CODE (*tp) == INDIRECT_REF)
666 /* Get rid of *& from inline substitutions that can happen when a
667 pointer argument is an ADDR_EXPR. */
668 tree decl = TREE_OPERAND (*tp, 0);
671 n = (tree *) pointer_map_contains (id->decl_map, decl);
676 /* If we happen to get an ADDR_EXPR in n->value, strip
677 it manually here as we'll eventually get ADDR_EXPRs
678 which lie about their types pointed to. In this case
679 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
680 but we absolutely rely on that. As fold_indirect_ref
681 does other useful transformations, try that first, though. */
682 tree type = TREE_TYPE (TREE_TYPE (*n));
683 new = unshare_expr (*n);
685 *tp = fold_indirect_ref_1 (type, new);
688 if (TREE_CODE (new) == ADDR_EXPR)
689 *tp = TREE_OPERAND (new, 0);
692 *tp = build1 (INDIRECT_REF, type, new);
693 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
701 /* Here is the "usual case". Copy this tree node, and then
702 tweak some special cases. */
703 copy_tree_r (tp, walk_subtrees, NULL);
705 /* Global variables we didn't seen yet needs to go into referenced
707 if (gimple_in_ssa_p (cfun) && TREE_CODE (*tp) == VAR_DECL)
708 add_referenced_var (*tp);
710 /* If EXPR has block defined, map it to newly constructed block.
711 When inlining we want EXPRs without block appear in the block
713 if (EXPR_P (*tp) || GIMPLE_STMT_P (*tp))
715 new_block = id->block;
716 if (TREE_BLOCK (*tp))
719 n = (tree *) pointer_map_contains (id->decl_map,
724 TREE_BLOCK (*tp) = new_block;
727 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
728 TREE_OPERAND (*tp, 0) =
731 id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
733 if (!GIMPLE_TUPLE_P (*tp) && TREE_CODE (*tp) != OMP_CLAUSE)
734 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
736 /* The copied TARGET_EXPR has never been expanded, even if the
737 original node was expanded already. */
738 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
740 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
741 TREE_OPERAND (*tp, 3) = NULL_TREE;
744 /* Variable substitution need not be simple. In particular, the
745 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
746 and friends are up-to-date. */
747 else if (TREE_CODE (*tp) == ADDR_EXPR)
749 walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
750 /* Handle the case where we substituted an INDIRECT_REF
751 into the operand of the ADDR_EXPR. */
752 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
753 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
755 recompute_tree_invariant_for_addr_expr (*tp);
760 /* Keep iterating. */
764 /* Copy basic block, scale profile accordingly. Edges will be taken care of
768 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
770 block_stmt_iterator bsi, copy_bsi;
771 basic_block copy_basic_block;
773 /* create_basic_block() will append every new block to
774 basic_block_info automatically. */
775 copy_basic_block = create_basic_block (NULL, (void *) 0,
776 (basic_block) bb->prev_bb->aux);
777 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
779 /* We are going to rebuild frequencies from scratch. These values have just
780 small importance to drive canonicalize_loop_headers. */
781 copy_basic_block->frequency = ((gcov_type)bb->frequency
782 * frequency_scale / REG_BR_PROB_BASE);
783 if (copy_basic_block->frequency > BB_FREQ_MAX)
784 copy_basic_block->frequency = BB_FREQ_MAX;
785 copy_bsi = bsi_start (copy_basic_block);
787 for (bsi = bsi_start (bb);
788 !bsi_end_p (bsi); bsi_next (&bsi))
790 tree stmt = bsi_stmt (bsi);
791 tree orig_stmt = stmt;
793 walk_tree (&stmt, copy_body_r, id, NULL);
795 /* RETURN_EXPR might be removed,
796 this is signalled by making stmt pointer NULL. */
801 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
803 /* With return slot optimization we can end up with
804 non-gimple (foo *)&this->m, fix that here. */
805 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
806 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 1)) == NOP_EXPR
807 && !is_gimple_val (TREE_OPERAND (GIMPLE_STMT_OPERAND (stmt, 1), 0)))
808 gimplify_stmt (&stmt);
810 bsi_insert_after (©_bsi, stmt, BSI_NEW_STMT);
812 /* Process new statement. gimplify_stmt possibly turned statement
813 into multiple statements, we need to process all of them. */
814 while (!bsi_end_p (copy_bsi))
816 stmt = bsi_stmt (copy_bsi);
817 call = get_call_expr_in (stmt);
819 /* Statements produced by inlining can be unfolded, especially
820 when we constant propagated some operands. We can't fold
821 them right now for two reasons:
822 1) folding require SSA_NAME_DEF_STMTs to be correct
823 2) we can't change function calls to builtins.
824 So we just mark statement for later folding. We mark
825 all new statements, instead just statements that has changed
826 by some nontrivial substitution so even statements made
827 foldable indirectly are updated. If this turns out to be
828 expensive, copy_body can be told to watch for nontrivial
830 if (id->statements_to_fold)
831 pointer_set_insert (id->statements_to_fold, stmt);
832 /* We're duplicating a CALL_EXPR. Find any corresponding
833 callgraph edges and update or duplicate them. */
834 if (call && (decl = get_callee_fndecl (call)))
836 struct cgraph_node *node;
837 struct cgraph_edge *edge;
839 switch (id->transform_call_graph_edges)
841 case CB_CGE_DUPLICATE:
842 edge = cgraph_edge (id->src_node, orig_stmt);
844 cgraph_clone_edge (edge, id->dst_node, stmt,
845 REG_BR_PROB_BASE, 1, edge->frequency, true);
848 case CB_CGE_MOVE_CLONES:
849 for (node = id->dst_node->next_clone;
851 node = node->next_clone)
853 edge = cgraph_edge (node, orig_stmt);
855 cgraph_set_call_stmt (edge, stmt);
860 edge = cgraph_edge (id->dst_node, orig_stmt);
862 cgraph_set_call_stmt (edge, stmt);
869 /* If you think we can abort here, you are wrong.
870 There is no region 0 in tree land. */
871 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
874 if (tree_could_throw_p (stmt)
875 /* When we are cloning for inlining, we are supposed to
876 construct a clone that calls precisely the same functions
877 as original. However IPA optimizers might've proved
878 earlier some function calls as non-trapping that might
879 render some basic blocks dead that might become
882 We can't update SSA with unreachable blocks in CFG and thus
883 we prevent the scenario by preserving even the "dead" eh
884 edges until the point they are later removed by
886 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
887 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
889 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
890 /* Add an entry for the copied tree in the EH hashtable.
891 When cloning or versioning, use the hashtable in
892 cfun, and just copy the EH number. When inlining, use the
893 hashtable in the caller, and adjust the region number. */
895 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
897 /* If this tree doesn't have a region associated with it,
898 and there is a "current region,"
899 then associate this tree with the current region
900 and add edges associated with this region. */
901 if ((lookup_stmt_eh_region_fn (id->src_cfun,
903 && id->eh_region > 0)
904 && tree_could_throw_p (stmt))
905 add_stmt_to_eh_region (stmt, id->eh_region);
907 if (gimple_in_ssa_p (cfun))
912 find_new_referenced_vars (bsi_stmt_ptr (copy_bsi));
913 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
914 if (TREE_CODE (def) == SSA_NAME)
915 SSA_NAME_DEF_STMT (def) = stmt;
917 bsi_next (©_bsi);
919 copy_bsi = bsi_last (copy_basic_block);
922 return copy_basic_block;
925 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
926 form is quite easy, since dominator relationship for old basic blocks does
929 There is however exception where inlining might change dominator relation
930 across EH edges from basic block within inlined functions destinating
931 to landing pads in function we inline into.
933 The function mark PHI_RESULT of such PHI nodes for renaming; it is
934 safe the EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI
935 must be set. This means, that there will be no overlapping live ranges
936 for the underlying symbol.
938 This might change in future if we allow redirecting of EH edges and
939 we might want to change way build CFG pre-inlining to include
940 all the possible edges then. */
942 update_ssa_across_eh_edges (basic_block bb)
947 FOR_EACH_EDGE (e, ei, bb->succs)
949 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
953 gcc_assert (e->flags & EDGE_EH);
954 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
956 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
958 mark_sym_for_renaming
959 (SSA_NAME_VAR (PHI_RESULT (phi)));
964 /* Copy edges from BB into its copy constructed earlier, scale profile
965 accordingly. Edges will be taken care of later. Assume aux
966 pointers to point to the copies of each BB. */
968 copy_edges_for_bb (basic_block bb, int count_scale)
970 basic_block new_bb = (basic_block) bb->aux;
973 block_stmt_iterator bsi;
976 /* Use the indices from the original blocks to create edges for the
978 FOR_EACH_EDGE (old_edge, ei, bb->succs)
979 if (!(old_edge->flags & EDGE_EH))
983 flags = old_edge->flags;
985 /* Return edges do get a FALLTHRU flag when the get inlined. */
986 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
987 && old_edge->dest->aux != EXIT_BLOCK_PTR)
988 flags |= EDGE_FALLTHRU;
989 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
990 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
991 new->probability = old_edge->probability;
994 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
997 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
1001 copy_stmt = bsi_stmt (bsi);
1002 update_stmt (copy_stmt);
1003 if (gimple_in_ssa_p (cfun))
1004 mark_symbols_for_renaming (copy_stmt);
1005 /* Do this before the possible split_block. */
1008 /* If this tree could throw an exception, there are two
1009 cases where we need to add abnormal edge(s): the
1010 tree wasn't in a region and there is a "current
1011 region" in the caller; or the original tree had
1012 EH edges. In both cases split the block after the tree,
1013 and add abnormal edge(s) as needed; we need both
1014 those from the callee and the caller.
1015 We check whether the copy can throw, because the const
1016 propagation can change an INDIRECT_REF which throws
1017 into a COMPONENT_REF which doesn't. If the copy
1018 can throw, the original could also throw. */
1020 if (tree_can_throw_internal (copy_stmt))
1022 if (!bsi_end_p (bsi))
1023 /* Note that bb's predecessor edges aren't necessarily
1024 right at this point; split_block doesn't care. */
1026 edge e = split_block (new_bb, copy_stmt);
1029 new_bb->aux = e->src->aux;
1030 bsi = bsi_start (new_bb);
1033 make_eh_edges (copy_stmt);
1035 if (gimple_in_ssa_p (cfun))
1036 update_ssa_across_eh_edges (bb_for_stmt (copy_stmt));
1041 /* Copy the PHIs. All blocks and edges are copied, some blocks
1042 was possibly split and new outgoing EH edges inserted.
1043 BB points to the block of original function and AUX pointers links
1044 the original and newly copied blocks. */
1047 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1049 basic_block new_bb = bb->aux;
1053 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1055 tree res = PHI_RESULT (phi);
1060 if (is_gimple_reg (res))
1062 walk_tree (&new_res, copy_body_r, id, NULL);
1063 SSA_NAME_DEF_STMT (new_res)
1064 = new_phi = create_phi_node (new_res, new_bb);
1065 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1067 edge old_edge = find_edge (new_edge->src->aux, bb);
1068 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1071 walk_tree (&new_arg, copy_body_r, id, NULL);
1072 gcc_assert (new_arg);
1073 add_phi_arg (new_phi, new_arg, new_edge);
1079 /* Wrapper for remap_decl so it can be used as a callback. */
1081 remap_decl_1 (tree decl, void *data)
1083 return remap_decl (decl, (copy_body_data *) data);
1086 /* Build struct function and associated datastructures for the new clone
1087 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1090 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1093 struct function *new_cfun
1094 = (struct function *) ggc_alloc_cleared (sizeof (struct function));
1095 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1096 int count_scale, frequency_scale;
1098 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1099 count_scale = (REG_BR_PROB_BASE * count
1100 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1104 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1105 frequency_scale = (REG_BR_PROB_BASE * frequency
1107 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1109 frequency_scale = count_scale;
1111 /* Register specific tree functions. */
1112 tree_register_cfg_hooks ();
1113 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
1114 new_cfun->funcdef_no = get_next_funcdef_no ();
1115 VALUE_HISTOGRAMS (new_cfun) = NULL;
1116 new_cfun->unexpanded_var_list = NULL;
1117 new_cfun->cfg = NULL;
1118 new_cfun->decl = new_fndecl /*= copy_node (callee_fndecl)*/;
1119 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
1120 push_cfun (new_cfun);
1121 init_empty_tree_cfg ();
1123 ENTRY_BLOCK_PTR->count =
1124 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1126 ENTRY_BLOCK_PTR->frequency =
1127 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1128 frequency_scale / REG_BR_PROB_BASE);
1129 EXIT_BLOCK_PTR->count =
1130 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1132 EXIT_BLOCK_PTR->frequency =
1133 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1134 frequency_scale / REG_BR_PROB_BASE);
1136 init_eh_for_function ();
1138 if (src_cfun->gimple_df)
1141 cfun->gimple_df->in_ssa_p = true;
1142 init_ssa_operands ();
1147 /* Make a copy of the body of FN so that it can be inserted inline in
1148 another function. Walks FN via CFG, returns new fndecl. */
1151 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1152 basic_block entry_block_map, basic_block exit_block_map)
1154 tree callee_fndecl = id->src_fn;
1155 /* Original cfun for the callee, doesn't change. */
1156 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1157 struct function *cfun_to_copy;
1159 tree new_fndecl = NULL;
1160 int count_scale, frequency_scale;
1163 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1164 count_scale = (REG_BR_PROB_BASE * count
1165 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1169 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1170 frequency_scale = (REG_BR_PROB_BASE * frequency
1172 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1174 frequency_scale = count_scale;
1176 /* Register specific tree functions. */
1177 tree_register_cfg_hooks ();
1179 /* Must have a CFG here at this point. */
1180 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1181 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1183 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1186 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1187 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1188 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1189 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1191 /* Duplicate any exception-handling regions. */
1194 id->eh_region_offset
1195 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1198 /* Use aux pointers to map the original blocks to copy. */
1199 FOR_EACH_BB_FN (bb, cfun_to_copy)
1201 basic_block new = copy_bb (id, bb, frequency_scale, count_scale);
1206 last = last_basic_block;
1207 /* Now that we've duplicated the blocks, duplicate their edges. */
1208 FOR_ALL_BB_FN (bb, cfun_to_copy)
1209 copy_edges_for_bb (bb, count_scale);
1210 if (gimple_in_ssa_p (cfun))
1211 FOR_ALL_BB_FN (bb, cfun_to_copy)
1212 copy_phis_for_bb (bb, id);
1213 FOR_ALL_BB_FN (bb, cfun_to_copy)
1215 ((basic_block)bb->aux)->aux = NULL;
1218 /* Zero out AUX fields of newly created block during EH edge
1220 for (; last < last_basic_block; last++)
1221 BASIC_BLOCK (last)->aux = NULL;
1222 entry_block_map->aux = NULL;
1223 exit_block_map->aux = NULL;
1228 /* Make a copy of the body of FN so that it can be inserted inline in
1229 another function. */
1232 copy_generic_body (copy_body_data *id)
1235 tree fndecl = id->src_fn;
1237 body = DECL_SAVED_TREE (fndecl);
1238 walk_tree (&body, copy_body_r, id, NULL);
1244 copy_body (copy_body_data *id, gcov_type count, int frequency,
1245 basic_block entry_block_map, basic_block exit_block_map)
1247 tree fndecl = id->src_fn;
1250 /* If this body has a CFG, walk CFG and copy. */
1251 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
1252 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
1257 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1258 defined in function FN, or of a data member thereof. */
1261 self_inlining_addr_expr (tree value, tree fn)
1265 if (TREE_CODE (value) != ADDR_EXPR)
1268 var = get_base_address (TREE_OPERAND (value, 0));
1270 return var && lang_hooks.tree_inlining.auto_var_in_fn_p (var, fn);
1274 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
1275 basic_block bb, tree *vars)
1281 tree def = (gimple_in_ssa_p (cfun)
1282 ? gimple_default_def (id->src_cfun, p) : NULL);
1285 && value != error_mark_node
1286 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
1287 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
1289 /* If the parameter is never assigned to, has no SSA_NAMEs created,
1290 we may not need to create a new variable here at all. Instead, we may
1291 be able to just use the argument value. */
1292 if (TREE_READONLY (p)
1293 && !TREE_ADDRESSABLE (p)
1294 && value && !TREE_SIDE_EFFECTS (value)
1297 /* We may produce non-gimple trees by adding NOPs or introduce
1298 invalid sharing when operand is not really constant.
1299 It is not big deal to prohibit constant propagation here as
1300 we will constant propagate in DOM1 pass anyway. */
1301 if (is_gimple_min_invariant (value)
1302 && useless_type_conversion_p (TREE_TYPE (p),
1304 /* We have to be very careful about ADDR_EXPR. Make sure
1305 the base variable isn't a local variable of the inlined
1306 function, e.g., when doing recursive inlining, direct or
1307 mutually-recursive or whatever, which is why we don't
1308 just test whether fn == current_function_decl. */
1309 && ! self_inlining_addr_expr (value, fn))
1311 insert_decl_map (id, p, value);
1316 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1317 here since the type of this decl must be visible to the calling
1319 var = copy_decl_to_var (p, id);
1320 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
1323 add_referenced_var (var);
1326 /* See if the frontend wants to pass this by invisible reference. If
1327 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1328 replace uses of the PARM_DECL with dereferences. */
1329 if (TREE_TYPE (var) != TREE_TYPE (p)
1330 && POINTER_TYPE_P (TREE_TYPE (var))
1331 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1333 insert_decl_map (id, var, var);
1334 var_sub = build_fold_indirect_ref (var);
1339 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1340 that way, when the PARM_DECL is encountered, it will be
1341 automatically replaced by the VAR_DECL. */
1342 insert_decl_map (id, p, var_sub);
1344 /* Declare this new variable. */
1345 TREE_CHAIN (var) = *vars;
1348 /* Make gimplifier happy about this variable. */
1349 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1351 /* Even if P was TREE_READONLY, the new VAR should not be.
1352 In the original code, we would have constructed a
1353 temporary, and then the function body would have never
1354 changed the value of P. However, now, we will be
1355 constructing VAR directly. The constructor body may
1356 change its value multiple times as it is being
1357 constructed. Therefore, it must not be TREE_READONLY;
1358 the back-end assumes that TREE_READONLY variable is
1359 assigned to only once. */
1360 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1361 TREE_READONLY (var) = 0;
1363 /* If there is no setup required and we are in SSA, take the easy route
1364 replacing all SSA names representing the function parameter by the
1365 SSA name passed to function.
1367 We need to construct map for the variable anyway as it might be used
1368 in different SSA names when parameter is set in function.
1370 FIXME: This usually kills the last connection in between inlined
1371 function parameter and the actual value in debug info. Can we do
1372 better here? If we just inserted the statement, copy propagation
1373 would kill it anyway as it always did in older versions of GCC.
1375 We might want to introduce a notion that single SSA_NAME might
1376 represent multiple variables for purposes of debugging. */
1377 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
1378 && (TREE_CODE (rhs) == SSA_NAME
1379 || is_gimple_min_invariant (rhs))
1380 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1382 insert_decl_map (id, def, rhs);
1386 /* Initialize this VAR_DECL from the equivalent argument. Convert
1387 the argument to the proper type in case it was promoted. */
1390 block_stmt_iterator bsi = bsi_last (bb);
1392 if (rhs == error_mark_node)
1394 insert_decl_map (id, p, var_sub);
1398 STRIP_USELESS_TYPE_CONVERSION (rhs);
1400 /* We want to use GIMPLE_MODIFY_STMT, not INIT_EXPR here so that we
1401 keep our trees in gimple form. */
1402 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
1404 def = remap_ssa_name (def, id);
1405 init_stmt = build_gimple_modify_stmt (def, rhs);
1406 SSA_NAME_DEF_STMT (def) = init_stmt;
1407 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
1408 set_default_def (var, NULL);
1411 init_stmt = build_gimple_modify_stmt (var, rhs);
1413 /* If we did not create a gimple value and we did not create a gimple
1414 cast of a gimple value, then we will need to gimplify INIT_STMTS
1415 at the end. Note that is_gimple_cast only checks the outer
1416 tree code, not its operand. Thus the explicit check that its
1417 operand is a gimple value. */
1418 if ((!is_gimple_val (rhs)
1419 && (!is_gimple_cast (rhs)
1420 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1421 || !is_gimple_reg (var))
1423 tree_stmt_iterator i;
1425 push_gimplify_context ();
1426 gimplify_stmt (&init_stmt);
1427 if (gimple_in_ssa_p (cfun)
1428 && init_stmt && TREE_CODE (init_stmt) == STATEMENT_LIST)
1430 /* The replacement can expose previously unreferenced
1432 for (i = tsi_start (init_stmt); !tsi_end_p (i); tsi_next (&i))
1433 find_new_referenced_vars (tsi_stmt_ptr (i));
1435 pop_gimplify_context (NULL);
1438 /* If VAR represents a zero-sized variable, it's possible that the
1439 assignment statment may result in no gimple statements. */
1441 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1442 if (gimple_in_ssa_p (cfun))
1443 for (;!bsi_end_p (bsi); bsi_next (&bsi))
1444 mark_symbols_for_renaming (bsi_stmt (bsi));
1448 /* Generate code to initialize the parameters of the function at the
1449 top of the stack in ID from the CALL_EXPR EXP. */
1452 initialize_inlined_parameters (copy_body_data *id, tree exp,
1453 tree fn, basic_block bb)
1458 tree vars = NULL_TREE;
1459 call_expr_arg_iterator iter;
1460 tree static_chain = CALL_EXPR_STATIC_CHAIN (exp);
1462 /* Figure out what the parameters are. */
1463 parms = DECL_ARGUMENTS (fn);
1465 /* Loop through the parameter declarations, replacing each with an
1466 equivalent VAR_DECL, appropriately initialized. */
1467 for (p = parms, a = first_call_expr_arg (exp, &iter); p;
1468 a = next_call_expr_arg (&iter), p = TREE_CHAIN (p))
1469 setup_one_parameter (id, p, a, fn, bb, &vars);
1471 /* Initialize the static chain. */
1472 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1473 gcc_assert (fn != current_function_decl);
1476 /* No static chain? Seems like a bug in tree-nested.c. */
1477 gcc_assert (static_chain);
1479 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1482 declare_inline_vars (id->block, vars);
1485 /* Declare a return variable to replace the RESULT_DECL for the
1486 function we are calling. An appropriate DECL_STMT is returned.
1487 The USE_STMT is filled to contain a use of the declaration to
1488 indicate the return value of the function.
1490 RETURN_SLOT, if non-null is place where to store the result. It
1491 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
1492 was the LHS of the GIMPLE_MODIFY_STMT to which this call is the RHS.
1494 The return value is a (possibly null) value that is the result of the
1495 function as seen by the callee. *USE_P is a (possibly null) value that
1496 holds the result as seen by the caller. */
1499 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
1502 tree callee = id->src_fn;
1503 tree caller = id->dst_fn;
1504 tree result = DECL_RESULT (callee);
1505 tree callee_type = TREE_TYPE (result);
1506 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1509 /* We don't need to do anything for functions that don't return
1511 if (!result || VOID_TYPE_P (callee_type))
1517 /* If there was a return slot, then the return value is the
1518 dereferenced address of that object. */
1521 /* The front end shouldn't have used both return_slot and
1522 a modify expression. */
1523 gcc_assert (!modify_dest);
1524 if (DECL_BY_REFERENCE (result))
1526 tree return_slot_addr = build_fold_addr_expr (return_slot);
1527 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
1529 /* We are going to construct *&return_slot and we can't do that
1530 for variables believed to be not addressable.
1532 FIXME: This check possibly can match, because values returned
1533 via return slot optimization are not believed to have address
1534 taken by alias analysis. */
1535 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
1536 if (gimple_in_ssa_p (cfun))
1538 HOST_WIDE_INT bitsize;
1539 HOST_WIDE_INT bitpos;
1541 enum machine_mode mode;
1545 base = get_inner_reference (return_slot, &bitsize, &bitpos,
1547 &mode, &unsignedp, &volatilep,
1549 if (TREE_CODE (base) == INDIRECT_REF)
1550 base = TREE_OPERAND (base, 0);
1551 if (TREE_CODE (base) == SSA_NAME)
1552 base = SSA_NAME_VAR (base);
1553 mark_sym_for_renaming (base);
1555 var = return_slot_addr;
1560 gcc_assert (TREE_CODE (var) != SSA_NAME);
1562 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1563 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1564 && !DECL_GIMPLE_REG_P (result)
1566 DECL_GIMPLE_REG_P (var) = 0;
1571 /* All types requiring non-trivial constructors should have been handled. */
1572 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1574 /* Attempt to avoid creating a new temporary variable. */
1576 && TREE_CODE (modify_dest) != SSA_NAME)
1578 bool use_it = false;
1580 /* We can't use MODIFY_DEST if there's type promotion involved. */
1581 if (!useless_type_conversion_p (callee_type, caller_type))
1584 /* ??? If we're assigning to a variable sized type, then we must
1585 reuse the destination variable, because we've no good way to
1586 create variable sized temporaries at this point. */
1587 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1590 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1591 reuse it as the result of the call directly. Don't do this if
1592 it would promote MODIFY_DEST to addressable. */
1593 else if (TREE_ADDRESSABLE (result))
1597 tree base_m = get_base_address (modify_dest);
1599 /* If the base isn't a decl, then it's a pointer, and we don't
1600 know where that's going to go. */
1601 if (!DECL_P (base_m))
1603 else if (is_global_var (base_m))
1605 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1606 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1607 && !DECL_GIMPLE_REG_P (result)
1608 && DECL_GIMPLE_REG_P (base_m))
1610 else if (!TREE_ADDRESSABLE (base_m))
1622 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1624 var = copy_result_decl_to_var (result, id);
1625 if (gimple_in_ssa_p (cfun))
1628 add_referenced_var (var);
1631 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1632 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1633 = tree_cons (NULL_TREE, var,
1634 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1636 /* Do not have the rest of GCC warn about this variable as it should
1637 not be visible to the user. */
1638 TREE_NO_WARNING (var) = 1;
1640 declare_inline_vars (id->block, var);
1642 /* Build the use expr. If the return type of the function was
1643 promoted, convert it back to the expected type. */
1645 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
1646 use = fold_convert (caller_type, var);
1648 STRIP_USELESS_TYPE_CONVERSION (use);
1650 if (DECL_BY_REFERENCE (result))
1651 var = build_fold_addr_expr (var);
1654 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1655 way, when the RESULT_DECL is encountered, it will be
1656 automatically replaced by the VAR_DECL. */
1657 insert_decl_map (id, result, var);
1659 /* Remember this so we can ignore it in remap_decls. */
1666 /* Returns nonzero if a function can be inlined as a tree. */
1669 tree_inlinable_function_p (tree fn)
1671 return inlinable_function_p (fn);
1674 static const char *inline_forbidden_reason;
1677 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1681 tree fn = (tree) fnp;
1684 switch (TREE_CODE (node))
1687 /* Refuse to inline alloca call unless user explicitly forced so as
1688 this may change program's memory overhead drastically when the
1689 function using alloca is called in loop. In GCC present in
1690 SPEC2000 inlining into schedule_block cause it to require 2GB of
1691 RAM instead of 256MB. */
1692 if (alloca_call_p (node)
1693 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1695 inline_forbidden_reason
1696 = G_("function %q+F can never be inlined because it uses "
1697 "alloca (override using the always_inline attribute)");
1700 t = get_callee_fndecl (node);
1704 /* We cannot inline functions that call setjmp. */
1705 if (setjmp_call_p (t))
1707 inline_forbidden_reason
1708 = G_("function %q+F can never be inlined because it uses setjmp");
1712 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1713 switch (DECL_FUNCTION_CODE (t))
1715 /* We cannot inline functions that take a variable number of
1717 case BUILT_IN_VA_START:
1718 case BUILT_IN_STDARG_START:
1719 case BUILT_IN_NEXT_ARG:
1720 case BUILT_IN_VA_END:
1721 inline_forbidden_reason
1722 = G_("function %q+F can never be inlined because it "
1723 "uses variable argument lists");
1726 case BUILT_IN_LONGJMP:
1727 /* We can't inline functions that call __builtin_longjmp at
1728 all. The non-local goto machinery really requires the
1729 destination be in a different function. If we allow the
1730 function calling __builtin_longjmp to be inlined into the
1731 function calling __builtin_setjmp, Things will Go Awry. */
1732 inline_forbidden_reason
1733 = G_("function %q+F can never be inlined because "
1734 "it uses setjmp-longjmp exception handling");
1737 case BUILT_IN_NONLOCAL_GOTO:
1739 inline_forbidden_reason
1740 = G_("function %q+F can never be inlined because "
1741 "it uses non-local goto");
1744 case BUILT_IN_RETURN:
1745 case BUILT_IN_APPLY_ARGS:
1746 /* If a __builtin_apply_args caller would be inlined,
1747 it would be saving arguments of the function it has
1748 been inlined into. Similarly __builtin_return would
1749 return from the function the inline has been inlined into. */
1750 inline_forbidden_reason
1751 = G_("function %q+F can never be inlined because "
1752 "it uses __builtin_return or __builtin_apply_args");
1761 t = TREE_OPERAND (node, 0);
1763 /* We will not inline a function which uses computed goto. The
1764 addresses of its local labels, which may be tucked into
1765 global storage, are of course not constant across
1766 instantiations, which causes unexpected behavior. */
1767 if (TREE_CODE (t) != LABEL_DECL)
1769 inline_forbidden_reason
1770 = G_("function %q+F can never be inlined "
1771 "because it contains a computed goto");
1777 t = TREE_OPERAND (node, 0);
1778 if (DECL_NONLOCAL (t))
1780 /* We cannot inline a function that receives a non-local goto
1781 because we cannot remap the destination label used in the
1782 function that is performing the non-local goto. */
1783 inline_forbidden_reason
1784 = G_("function %q+F can never be inlined "
1785 "because it receives a non-local goto");
1792 /* We cannot inline a function of the form
1794 void F (int i) { struct S { int ar[i]; } s; }
1796 Attempting to do so produces a catch-22.
1797 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1798 UNION_TYPE nodes, then it goes into infinite recursion on a
1799 structure containing a pointer to its own type. If it doesn't,
1800 then the type node for S doesn't get adjusted properly when
1803 ??? This is likely no longer true, but it's too late in the 4.0
1804 cycle to try to find out. This should be checked for 4.1. */
1805 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1806 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1808 inline_forbidden_reason
1809 = G_("function %q+F can never be inlined "
1810 "because it uses variable sized variables");
1821 /* Return subexpression representing possible alloca call, if any. */
1823 inline_forbidden_p (tree fndecl)
1825 location_t saved_loc = input_location;
1826 block_stmt_iterator bsi;
1828 tree ret = NULL_TREE;
1830 FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
1831 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1833 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
1834 inline_forbidden_p_1, fndecl);
1840 input_location = saved_loc;
1844 /* Returns nonzero if FN is a function that does not have any
1845 fundamental inline blocking properties. */
1848 inlinable_function_p (tree fn)
1850 bool inlinable = true;
1852 /* If we've already decided this function shouldn't be inlined,
1853 there's no need to check again. */
1854 if (DECL_UNINLINABLE (fn))
1857 /* See if there is any language-specific reason it cannot be
1858 inlined. (It is important that this hook be called early because
1859 in C++ it may result in template instantiation.)
1860 If the function is not inlinable for language-specific reasons,
1861 it is left up to the langhook to explain why. */
1862 inlinable = !lang_hooks.tree_inlining.cannot_inline_tree_fn (&fn);
1864 /* If we don't have the function body available, we can't inline it.
1865 However, this should not be recorded since we also get here for
1866 forward declared inline functions. Therefore, return at once. */
1867 if (!DECL_SAVED_TREE (fn))
1870 /* If we're not inlining at all, then we cannot inline this function. */
1871 else if (!flag_inline_trees)
1874 /* Only try to inline functions if DECL_INLINE is set. This should be
1875 true for all functions declared `inline', and for all other functions
1876 as well with -finline-functions.
1878 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1879 it's the front-end that must set DECL_INLINE in this case, because
1880 dwarf2out loses if a function that does not have DECL_INLINE set is
1881 inlined anyway. That is why we have both DECL_INLINE and
1882 DECL_DECLARED_INLINE_P. */
1883 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1884 here should be redundant. */
1885 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
1888 else if (inline_forbidden_p (fn))
1890 /* See if we should warn about uninlinable functions. Previously,
1891 some of these warnings would be issued while trying to expand
1892 the function inline, but that would cause multiple warnings
1893 about functions that would for example call alloca. But since
1894 this a property of the function, just one warning is enough.
1895 As a bonus we can now give more details about the reason why a
1896 function is not inlinable.
1897 We only warn for functions declared `inline' by the user. */
1898 bool do_warning = (warn_inline
1900 && DECL_DECLARED_INLINE_P (fn)
1901 && !DECL_IN_SYSTEM_HEADER (fn));
1903 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1904 sorry (inline_forbidden_reason, fn);
1905 else if (do_warning)
1906 warning (OPT_Winline, inline_forbidden_reason, fn);
1911 /* Squirrel away the result so that we don't have to check again. */
1912 DECL_UNINLINABLE (fn) = !inlinable;
1917 /* Estimate the cost of a memory move. Use machine dependent
1918 word size and take possible memcpy call into account. */
1921 estimate_move_cost (tree type)
1925 size = int_size_in_bytes (type);
1927 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
1928 /* Cost of a memcpy call, 3 arguments and the call. */
1931 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
1934 /* Arguments for estimate_num_insns_1. */
1938 /* Used to return the number of insns. */
1941 /* Weights of various constructs. */
1942 eni_weights *weights;
1945 /* Used by estimate_num_insns. Estimate number of instructions seen
1946 by given statement. */
1949 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
1951 struct eni_data *d = data;
1955 if (IS_TYPE_OR_DECL_P (x))
1960 /* Assume that constants and references counts nothing. These should
1961 be majorized by amount of operations among them we count later
1962 and are common target of CSE and similar optimizations. */
1963 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
1966 switch (TREE_CODE (x))
1968 /* Containers have no cost. */
1975 case ALIGN_INDIRECT_REF:
1976 case MISALIGNED_INDIRECT_REF:
1978 case ARRAY_RANGE_REF:
1980 case EXC_PTR_EXPR: /* ??? */
1981 case FILTER_EXPR: /* ??? */
1984 case WITH_CLEANUP_EXPR:
1987 case VIEW_CONVERT_EXPR:
1992 case CASE_LABEL_EXPR:
1995 case EH_FILTER_EXPR:
1996 case STATEMENT_LIST:
1998 case NON_LVALUE_EXPR:
2001 case TRY_CATCH_EXPR:
2002 case TRY_FINALLY_EXPR:
2009 case WITH_SIZE_EXPR:
2013 case OMP_SECTIONS_SWITCH:
2016 /* We don't account constants for now. Assume that the cost is amortized
2017 by operations that do use them. We may re-consider this decision once
2018 we are able to optimize the tree before estimating its size and break
2019 out static initializers. */
2020 case IDENTIFIER_NODE:
2029 /* CHANGE_DYNAMIC_TYPE_EXPR explicitly expands to nothing. */
2030 case CHANGE_DYNAMIC_TYPE_EXPR:
2034 /* Try to estimate the cost of assignments. We have three cases to
2036 1) Simple assignments to registers;
2037 2) Stores to things that must live in memory. This includes
2038 "normal" stores to scalars, but also assignments of large
2039 structures, or constructors of big arrays;
2042 Let us look at the first two cases, assuming we have "a = b + C":
2043 <GIMPLE_MODIFY_STMT <var_decl "a">
2044 <plus_expr <var_decl "b"> <constant C>>
2045 If "a" is a GIMPLE register, the assignment to it is free on almost
2046 any target, because "a" usually ends up in a real register. Hence
2047 the only cost of this expression comes from the PLUS_EXPR, and we
2048 can ignore the GIMPLE_MODIFY_STMT.
2049 If "a" is not a GIMPLE register, the assignment to "a" will most
2050 likely be a real store, so the cost of the GIMPLE_MODIFY_STMT is the cost
2051 of moving something into "a", which we compute using the function
2054 The third case deals with TARGET_EXPRs, for which the semantics are
2055 that a temporary is assigned, unless the TARGET_EXPR itself is being
2056 assigned to something else. In the latter case we do not need the
2058 <GIMPLE_MODIFY_STMT <var_decl "a"> <target_expr>>, the
2059 GIMPLE_MODIFY_STMT is free. */
2061 case GIMPLE_MODIFY_STMT:
2062 /* Is the right and side a TARGET_EXPR? */
2063 if (TREE_CODE (GENERIC_TREE_OPERAND (x, 1)) == TARGET_EXPR)
2065 /* ... fall through ... */
2068 x = GENERIC_TREE_OPERAND (x, 0);
2069 /* Is this an assignments to a register? */
2070 if (is_gimple_reg (x))
2072 /* Otherwise it's a store, so fall through to compute the move cost. */
2075 d->count += estimate_move_cost (TREE_TYPE (x));
2078 /* Assign cost of 1 to usual operations.
2079 ??? We may consider mapping RTL costs to this. */
2084 case POINTER_PLUS_EXPR:
2088 case FIX_TRUNC_EXPR:
2100 case VEC_LSHIFT_EXPR:
2101 case VEC_RSHIFT_EXPR:
2108 case TRUTH_ANDIF_EXPR:
2109 case TRUTH_ORIF_EXPR:
2110 case TRUTH_AND_EXPR:
2112 case TRUTH_XOR_EXPR:
2113 case TRUTH_NOT_EXPR:
2122 case UNORDERED_EXPR:
2133 case PREDECREMENT_EXPR:
2134 case PREINCREMENT_EXPR:
2135 case POSTDECREMENT_EXPR:
2136 case POSTINCREMENT_EXPR:
2140 case REALIGN_LOAD_EXPR:
2142 case REDUC_MAX_EXPR:
2143 case REDUC_MIN_EXPR:
2144 case REDUC_PLUS_EXPR:
2145 case WIDEN_SUM_EXPR:
2147 case VEC_WIDEN_MULT_HI_EXPR:
2148 case VEC_WIDEN_MULT_LO_EXPR:
2149 case VEC_UNPACK_HI_EXPR:
2150 case VEC_UNPACK_LO_EXPR:
2151 case VEC_UNPACK_FLOAT_HI_EXPR:
2152 case VEC_UNPACK_FLOAT_LO_EXPR:
2153 case VEC_PACK_TRUNC_EXPR:
2154 case VEC_PACK_SAT_EXPR:
2155 case VEC_PACK_FIX_TRUNC_EXPR:
2157 case WIDEN_MULT_EXPR:
2159 case VEC_EXTRACT_EVEN_EXPR:
2160 case VEC_EXTRACT_ODD_EXPR:
2161 case VEC_INTERLEAVE_HIGH_EXPR:
2162 case VEC_INTERLEAVE_LOW_EXPR:
2169 /* TODO: Cost of a switch should be derived from the number of
2171 d->count += d->weights->switch_cost;
2174 /* Few special cases of expensive operations. This is useful
2175 to avoid inlining on functions having too many of these. */
2176 case TRUNC_DIV_EXPR:
2178 case FLOOR_DIV_EXPR:
2179 case ROUND_DIV_EXPR:
2180 case EXACT_DIV_EXPR:
2181 case TRUNC_MOD_EXPR:
2183 case FLOOR_MOD_EXPR:
2184 case ROUND_MOD_EXPR:
2186 d->count += d->weights->div_mod_cost;
2190 tree decl = get_callee_fndecl (x);
2192 cost = d->weights->call_cost;
2193 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
2194 switch (DECL_FUNCTION_CODE (decl))
2196 case BUILT_IN_CONSTANT_P:
2199 case BUILT_IN_EXPECT:
2201 /* Prefetch instruction is not expensive. */
2202 case BUILT_IN_PREFETCH:
2209 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
2210 that does use function declaration to figure out the arguments. */
2214 call_expr_arg_iterator iter;
2215 FOR_EACH_CALL_EXPR_ARG (a, iter, x)
2216 d->count += estimate_move_cost (TREE_TYPE (a));
2221 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2222 d->count += estimate_move_cost (TREE_TYPE (arg));
2238 /* OpenMP directives are generally very expensive. */
2239 d->count += d->weights->omp_cost;
2248 /* Estimate number of instructions that will be created by expanding EXPR.
2249 WEIGHTS contains weights attributed to various constructs. */
2252 estimate_num_insns (tree expr, eni_weights *weights)
2254 struct pointer_set_t *visited_nodes;
2256 block_stmt_iterator bsi;
2257 struct function *my_function;
2258 struct eni_data data;
2261 data.weights = weights;
2263 /* If we're given an entire function, walk the CFG. */
2264 if (TREE_CODE (expr) == FUNCTION_DECL)
2266 my_function = DECL_STRUCT_FUNCTION (expr);
2267 gcc_assert (my_function && my_function->cfg);
2268 visited_nodes = pointer_set_create ();
2269 FOR_EACH_BB_FN (bb, my_function)
2271 for (bsi = bsi_start (bb);
2275 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
2276 &data, visited_nodes);
2279 pointer_set_destroy (visited_nodes);
2282 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &data);
2287 /* Initializes weights used by estimate_num_insns. */
2290 init_inline_once (void)
2292 eni_inlining_weights.call_cost = PARAM_VALUE (PARAM_INLINE_CALL_COST);
2293 eni_inlining_weights.div_mod_cost = 10;
2294 eni_inlining_weights.switch_cost = 1;
2295 eni_inlining_weights.omp_cost = 40;
2297 eni_size_weights.call_cost = 1;
2298 eni_size_weights.div_mod_cost = 1;
2299 eni_size_weights.switch_cost = 10;
2300 eni_size_weights.omp_cost = 40;
2302 /* Estimating time for call is difficult, since we have no idea what the
2303 called function does. In the current uses of eni_time_weights,
2304 underestimating the cost does less harm than overestimating it, so
2305 we choose a rather small value here. */
2306 eni_time_weights.call_cost = 10;
2307 eni_time_weights.div_mod_cost = 10;
2308 eni_time_weights.switch_cost = 4;
2309 eni_time_weights.omp_cost = 40;
2312 typedef struct function *function_p;
2314 DEF_VEC_P(function_p);
2315 DEF_VEC_ALLOC_P(function_p,heap);
2317 /* Initialized with NOGC, making this poisonous to the garbage collector. */
2318 static VEC(function_p,heap) *cfun_stack;
2321 push_cfun (struct function *new_cfun)
2323 VEC_safe_push (function_p, heap, cfun_stack, cfun);
2330 cfun = VEC_pop (function_p, cfun_stack);
2333 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
2335 add_lexical_block (tree current_block, tree new_block)
2339 /* Walk to the last sub-block. */
2340 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
2342 blk_p = &TREE_CHAIN (*blk_p))
2345 BLOCK_SUPERCONTEXT (new_block) = current_block;
2348 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
2351 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
2357 struct pointer_map_t *st;
2360 location_t saved_location;
2361 struct cgraph_edge *cg_edge;
2363 basic_block return_block;
2365 block_stmt_iterator bsi, stmt_bsi;
2366 bool successfully_inlined = FALSE;
2367 bool purge_dead_abnormal_edges;
2371 /* See what we've got. */
2372 id = (copy_body_data *) data;
2375 /* Set input_location here so we get the right instantiation context
2376 if we call instantiate_decl from inlinable_function_p. */
2377 saved_location = input_location;
2378 if (EXPR_HAS_LOCATION (t))
2379 input_location = EXPR_LOCATION (t);
2381 /* From here on, we're only interested in CALL_EXPRs. */
2382 if (TREE_CODE (t) != CALL_EXPR)
2385 /* First, see if we can figure out what function is being called.
2386 If we cannot, then there is no hope of inlining the function. */
2387 fn = get_callee_fndecl (t);
2391 /* Turn forward declarations into real ones. */
2392 fn = cgraph_node (fn)->decl;
2394 /* If fn is a declaration of a function in a nested scope that was
2395 globally declared inline, we don't set its DECL_INITIAL.
2396 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
2397 C++ front-end uses it for cdtors to refer to their internal
2398 declarations, that are not real functions. Fortunately those
2399 don't have trees to be saved, so we can tell by checking their
2401 if (! DECL_INITIAL (fn)
2402 && DECL_ABSTRACT_ORIGIN (fn)
2403 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
2404 fn = DECL_ABSTRACT_ORIGIN (fn);
2406 /* Objective C and fortran still calls tree_rest_of_compilation directly.
2407 Kill this check once this is fixed. */
2408 if (!id->dst_node->analyzed)
2411 cg_edge = cgraph_edge (id->dst_node, stmt);
2413 /* Constant propagation on argument done during previous inlining
2414 may create new direct call. Produce an edge for it. */
2417 struct cgraph_node *dest = cgraph_node (fn);
2419 /* We have missing edge in the callgraph. This can happen in one case
2420 where previous inlining turned indirect call into direct call by
2421 constant propagating arguments. In all other cases we hit a bug
2422 (incorrect node sharing is most common reason for missing edges. */
2423 gcc_assert (dest->needed || !flag_unit_at_a_time);
2424 cgraph_create_edge (id->dst_node, dest, stmt,
2425 bb->count, CGRAPH_FREQ_BASE,
2426 bb->loop_depth)->inline_failed
2427 = N_("originally indirect function call not considered for inlining");
2430 fprintf (dump_file, "Created new direct edge to %s",
2431 cgraph_node_name (dest));
2436 /* Don't try to inline functions that are not well-suited to
2438 if (!cgraph_inline_p (cg_edge, &reason))
2440 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
2441 /* Avoid warnings during early inline pass. */
2442 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2444 sorry ("inlining failed in call to %q+F: %s", fn, reason);
2445 sorry ("called from here");
2447 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
2448 && !DECL_IN_SYSTEM_HEADER (fn)
2450 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
2451 /* Avoid warnings during early inline pass. */
2452 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2454 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
2456 warning (OPT_Winline, "called from here");
2460 fn = cg_edge->callee->decl;
2462 #ifdef ENABLE_CHECKING
2463 if (cg_edge->callee->decl != id->dst_node->decl)
2464 verify_cgraph_node (cg_edge->callee);
2467 /* We will be inlining this callee. */
2468 id->eh_region = lookup_stmt_eh_region (stmt);
2470 /* Split the block holding the CALL_EXPR. */
2471 e = split_block (bb, stmt);
2473 return_block = e->dest;
2476 /* split_block splits after the statement; work around this by
2477 moving the call into the second block manually. Not pretty,
2478 but seems easier than doing the CFG manipulation by hand
2479 when the CALL_EXPR is in the last statement of BB. */
2480 stmt_bsi = bsi_last (bb);
2481 bsi_remove (&stmt_bsi, false);
2483 /* If the CALL_EXPR was in the last statement of BB, it may have
2484 been the source of abnormal edges. In this case, schedule
2485 the removal of dead abnormal edges. */
2486 bsi = bsi_start (return_block);
2487 if (bsi_end_p (bsi))
2489 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2490 purge_dead_abnormal_edges = true;
2494 bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
2495 purge_dead_abnormal_edges = false;
2498 stmt_bsi = bsi_start (return_block);
2500 /* Build a block containing code to initialize the arguments, the
2501 actual inline expansion of the body, and a label for the return
2502 statements within the function to jump to. The type of the
2503 statement expression is the return type of the function call. */
2504 id->block = make_node (BLOCK);
2505 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2506 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2507 add_lexical_block (TREE_BLOCK (stmt), id->block);
2509 /* Local declarations will be replaced by their equivalents in this
2512 id->decl_map = pointer_map_create ();
2514 /* Record the function we are about to inline. */
2516 id->src_node = cg_edge->callee;
2517 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
2519 initialize_inlined_parameters (id, t, fn, bb);
2521 if (DECL_INITIAL (fn))
2522 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2524 /* Return statements in the function body will be replaced by jumps
2525 to the RET_LABEL. */
2527 gcc_assert (DECL_INITIAL (fn));
2528 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2530 /* Find the lhs to which the result of this call is assigned. */
2532 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
2534 modify_dest = GIMPLE_STMT_OPERAND (stmt, 0);
2536 /* The function which we are inlining might not return a value,
2537 in which case we should issue a warning that the function
2538 does not return a value. In that case the optimizers will
2539 see that the variable to which the value is assigned was not
2540 initialized. We do not want to issue a warning about that
2541 uninitialized variable. */
2542 if (DECL_P (modify_dest))
2543 TREE_NO_WARNING (modify_dest) = 1;
2544 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2546 return_slot = modify_dest;
2553 /* Declare the return variable for the function. */
2554 declare_return_variable (id, return_slot,
2555 modify_dest, &use_retvar);
2557 /* This is it. Duplicate the callee body. Assume callee is
2558 pre-gimplified. Note that we must not alter the caller
2559 function in any way before this point, as this CALL_EXPR may be
2560 a self-referential call; if we're calling ourselves, we need to
2561 duplicate our body before altering anything. */
2562 copy_body (id, bb->count, bb->frequency, bb, return_block);
2564 /* Add local vars in this inlined callee to caller. */
2565 t_step = id->src_cfun->unexpanded_var_list;
2566 for (; t_step; t_step = TREE_CHAIN (t_step))
2568 var = TREE_VALUE (t_step);
2569 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2570 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2571 cfun->unexpanded_var_list);
2573 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2574 cfun->unexpanded_var_list);
2578 pointer_map_destroy (id->decl_map);
2581 /* If the inlined function returns a result that we care about,
2582 clobber the CALL_EXPR with a reference to the return variable. */
2583 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2586 if (gimple_in_ssa_p (cfun))
2589 mark_symbols_for_renaming (stmt);
2591 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2594 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2595 tsi_delink() will leave the iterator in a sane state. */
2597 /* Handle case of inlining function that miss return statement so
2598 return value becomes undefined. */
2599 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
2600 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 0)) == SSA_NAME)
2602 tree name = TREE_OPERAND (stmt, 0);
2603 tree var = SSA_NAME_VAR (TREE_OPERAND (stmt, 0));
2604 tree def = gimple_default_def (cfun, var);
2606 /* If the variable is used undefined, make this name undefined via
2610 TREE_OPERAND (stmt, 1) = def;
2613 /* Otherwise make this variable undefined. */
2616 bsi_remove (&stmt_bsi, true);
2617 set_default_def (var, name);
2618 SSA_NAME_DEF_STMT (name) = build_empty_stmt ();
2622 bsi_remove (&stmt_bsi, true);
2625 if (purge_dead_abnormal_edges)
2626 tree_purge_dead_abnormal_call_edges (return_block);
2628 /* If the value of the new expression is ignored, that's OK. We
2629 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2630 the equivalent inlined version either. */
2631 TREE_USED (*tp) = 1;
2633 /* Output the inlining info for this abstract function, since it has been
2634 inlined. If we don't do this now, we can lose the information about the
2635 variables in the function when the blocks get blown away as soon as we
2636 remove the cgraph node. */
2637 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2639 /* Update callgraph if needed. */
2640 cgraph_remove_node (cg_edge->callee);
2642 id->block = NULL_TREE;
2643 successfully_inlined = TRUE;
2646 input_location = saved_location;
2647 return successfully_inlined;
2650 /* Expand call statements reachable from STMT_P.
2651 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2652 in a GIMPLE_MODIFY_STMT. See tree-gimple.c:get_call_expr_in(). We can
2653 unfortunately not use that function here because we need a pointer
2654 to the CALL_EXPR, not the tree itself. */
2657 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2659 block_stmt_iterator bsi;
2661 /* Register specific tree functions. */
2662 tree_register_cfg_hooks ();
2663 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2665 tree *expr_p = bsi_stmt_ptr (bsi);
2666 tree stmt = *expr_p;
2668 if (TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT)
2669 expr_p = &GIMPLE_STMT_OPERAND (*expr_p, 1);
2670 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2671 expr_p = &TREE_OPERAND (*expr_p, 0);
2672 if (TREE_CODE (*expr_p) == CALL_EXPR)
2673 if (expand_call_inline (bb, stmt, expr_p, id))
2679 /* Walk all basic blocks created after FIRST and try to fold every statement
2680 in the STATEMENTS pointer set. */
2682 fold_marked_statements (int first, struct pointer_set_t *statements)
2684 for (;first < n_basic_blocks;first++)
2685 if (BASIC_BLOCK (first))
2687 block_stmt_iterator bsi;
2688 for (bsi = bsi_start (BASIC_BLOCK (first));
2689 !bsi_end_p (bsi); bsi_next (&bsi))
2690 if (pointer_set_contains (statements, bsi_stmt (bsi)))
2692 tree old_stmt = bsi_stmt (bsi);
2693 if (fold_stmt (bsi_stmt_ptr (bsi)))
2695 update_stmt (bsi_stmt (bsi));
2696 if (maybe_clean_or_replace_eh_stmt (old_stmt, bsi_stmt (bsi)))
2697 tree_purge_dead_eh_edges (BASIC_BLOCK (first));
2703 /* Return true if BB has at least one abnormal outgoing edge. */
2706 has_abnormal_outgoing_edge_p (basic_block bb)
2711 FOR_EACH_EDGE (e, ei, bb->succs)
2712 if (e->flags & EDGE_ABNORMAL)
2718 /* When a block from the inlined function contains a call with side-effects
2719 in the middle gets inlined in a function with non-locals labels, the call
2720 becomes a potential non-local goto so we need to add appropriate edge. */
2723 make_nonlocal_label_edges (void)
2725 block_stmt_iterator bsi;
2730 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2732 tree stmt = bsi_stmt (bsi);
2733 if (tree_can_make_abnormal_goto (stmt))
2735 if (stmt == bsi_stmt (bsi_last (bb)))
2737 if (!has_abnormal_outgoing_edge_p (bb))
2738 make_abnormal_goto_edges (bb, true);
2742 edge e = split_block (bb, stmt);
2744 make_abnormal_goto_edges (bb, true);
2749 /* Update PHIs on nonlocal goto receivers we (possibly)
2750 just created new edges into. */
2751 if (TREE_CODE (stmt) == LABEL_EXPR
2752 && gimple_in_ssa_p (cfun))
2754 tree target = LABEL_EXPR_LABEL (stmt);
2755 if (DECL_NONLOCAL (target))
2759 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
2761 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
2762 (PHI_RESULT (phi)));
2763 mark_sym_for_renaming
2764 (SSA_NAME_VAR (PHI_RESULT (phi)));
2772 /* Expand calls to inline functions in the body of FN. */
2775 optimize_inline_calls (tree fn)
2780 int last = n_basic_blocks;
2781 /* There is no point in performing inlining if errors have already
2782 occurred -- and we might crash if we try to inline invalid
2784 if (errorcount || sorrycount)
2788 memset (&id, 0, sizeof (id));
2790 id.src_node = id.dst_node = cgraph_node (fn);
2792 /* Or any functions that aren't finished yet. */
2793 prev_fn = NULL_TREE;
2794 if (current_function_decl)
2796 id.dst_fn = current_function_decl;
2797 prev_fn = current_function_decl;
2800 id.copy_decl = copy_decl_maybe_to_var;
2801 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2802 id.transform_new_cfg = false;
2803 id.transform_return_to_modify = true;
2804 id.transform_lang_insert_block = false;
2805 id.statements_to_fold = pointer_set_create ();
2807 push_gimplify_context ();
2809 /* We make no attempts to keep dominance info up-to-date. */
2810 free_dominance_info (CDI_DOMINATORS);
2811 free_dominance_info (CDI_POST_DOMINATORS);
2813 /* Reach the trees by walking over the CFG, and note the
2814 enclosing basic-blocks in the call edges. */
2815 /* We walk the blocks going forward, because inlined function bodies
2816 will split id->current_basic_block, and the new blocks will
2817 follow it; we'll trudge through them, processing their CALL_EXPRs
2820 gimple_expand_calls_inline (bb, &id);
2822 pop_gimplify_context (NULL);
2823 /* Renumber the (code) basic_blocks consecutively. */
2825 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2828 #ifdef ENABLE_CHECKING
2830 struct cgraph_edge *e;
2832 verify_cgraph_node (id.dst_node);
2834 /* Double check that we inlined everything we are supposed to inline. */
2835 for (e = id.dst_node->callees; e; e = e->next_callee)
2836 gcc_assert (e->inline_failed);
2840 /* We are not going to maintain the cgraph edges up to date.
2841 Kill it so it won't confuse us. */
2842 cgraph_node_remove_callees (id.dst_node);
2844 fold_marked_statements (last, id.statements_to_fold);
2845 pointer_set_destroy (id.statements_to_fold);
2846 fold_cond_expr_cond ();
2847 if (current_function_has_nonlocal_label)
2848 make_nonlocal_label_edges ();
2849 /* It would be nice to check SSA/CFG/statement consistency here, but it is
2850 not possible yet - the IPA passes might make various functions to not
2851 throw and they don't care to proactively update local EH info. This is
2852 done later in fixup_cfg pass that also execute the verification. */
2853 return (TODO_update_ssa | TODO_cleanup_cfg
2854 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
2855 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
2858 /* FN is a function that has a complete body, and CLONE is a function whose
2859 body is to be set to a copy of FN, mapping argument declarations according
2860 to the ARG_MAP splay_tree. */
2863 clone_body (tree clone, tree fn, void *arg_map)
2867 /* Clone the body, as if we were making an inline call. But, remap the
2868 parameters in the callee to the parameters of caller. */
2869 memset (&id, 0, sizeof (id));
2872 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
2873 id.decl_map = (struct pointer_map_t *)arg_map;
2875 id.copy_decl = copy_decl_no_change;
2876 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2877 id.transform_new_cfg = true;
2878 id.transform_return_to_modify = false;
2879 id.transform_lang_insert_block = true;
2881 /* We're not inside any EH region. */
2884 /* Actually copy the body. */
2885 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
2888 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2891 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2893 enum tree_code code = TREE_CODE (*tp);
2894 enum tree_code_class cl = TREE_CODE_CLASS (code);
2896 /* We make copies of most nodes. */
2897 if (IS_EXPR_CODE_CLASS (cl)
2898 || IS_GIMPLE_STMT_CODE_CLASS (cl)
2899 || code == TREE_LIST
2901 || code == TYPE_DECL
2902 || code == OMP_CLAUSE)
2904 /* Because the chain gets clobbered when we make a copy, we save it
2906 tree chain = NULL_TREE, new;
2908 if (!GIMPLE_TUPLE_P (*tp))
2909 chain = TREE_CHAIN (*tp);
2911 /* Copy the node. */
2912 new = copy_node (*tp);
2914 /* Propagate mudflap marked-ness. */
2915 if (flag_mudflap && mf_marked_p (*tp))
2920 /* Now, restore the chain, if appropriate. That will cause
2921 walk_tree to walk into the chain as well. */
2922 if (code == PARM_DECL
2923 || code == TREE_LIST
2924 || code == OMP_CLAUSE)
2925 TREE_CHAIN (*tp) = chain;
2927 /* For now, we don't update BLOCKs when we make copies. So, we
2928 have to nullify all BIND_EXPRs. */
2929 if (TREE_CODE (*tp) == BIND_EXPR)
2930 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
2932 else if (code == CONSTRUCTOR)
2934 /* CONSTRUCTOR nodes need special handling because
2935 we need to duplicate the vector of elements. */
2938 new = copy_node (*tp);
2940 /* Propagate mudflap marked-ness. */
2941 if (flag_mudflap && mf_marked_p (*tp))
2944 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
2945 CONSTRUCTOR_ELTS (*tp));
2948 else if (TREE_CODE_CLASS (code) == tcc_type)
2950 else if (TREE_CODE_CLASS (code) == tcc_declaration)
2952 else if (TREE_CODE_CLASS (code) == tcc_constant)
2955 gcc_assert (code != STATEMENT_LIST);
2959 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2960 information indicating to what new SAVE_EXPR this one should be mapped,
2961 use that one. Otherwise, create a new node and enter it in ST. FN is
2962 the function into which the copy will be placed. */
2965 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
2967 struct pointer_map_t *st = (struct pointer_map_t *) st_;
2971 /* See if we already encountered this SAVE_EXPR. */
2972 n = (tree *) pointer_map_contains (st, *tp);
2974 /* If we didn't already remap this SAVE_EXPR, do so now. */
2977 t = copy_node (*tp);
2979 /* Remember this SAVE_EXPR. */
2980 *pointer_map_insert (st, *tp) = t;
2981 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2982 *pointer_map_insert (st, t) = t;
2986 /* We've already walked into this SAVE_EXPR; don't do it again. */
2991 /* Replace this SAVE_EXPR with the copy. */
2995 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2996 copies the declaration and enters it in the splay_tree in DATA (which is
2997 really an `copy_body_data *'). */
3000 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3003 copy_body_data *id = (copy_body_data *) data;
3005 /* Don't walk into types. */
3009 else if (TREE_CODE (*tp) == LABEL_EXPR)
3011 tree decl = TREE_OPERAND (*tp, 0);
3013 /* Copy the decl and remember the copy. */
3014 insert_decl_map (id, decl, id->copy_decl (decl, id));
3020 /* Perform any modifications to EXPR required when it is unsaved. Does
3021 not recurse into EXPR's subtrees. */
3024 unsave_expr_1 (tree expr)
3026 switch (TREE_CODE (expr))
3029 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3030 It's OK for this to happen if it was part of a subtree that
3031 isn't immediately expanded, such as operand 2 of another
3033 if (TREE_OPERAND (expr, 1))
3036 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3037 TREE_OPERAND (expr, 3) = NULL_TREE;
3045 /* Called via walk_tree when an expression is unsaved. Using the
3046 splay_tree pointed to by ST (which is really a `splay_tree'),
3047 remaps all local declarations to appropriate replacements. */
3050 unsave_r (tree *tp, int *walk_subtrees, void *data)
3052 copy_body_data *id = (copy_body_data *) data;
3053 struct pointer_map_t *st = id->decl_map;
3056 /* Only a local declaration (variable or label). */
3057 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3058 || TREE_CODE (*tp) == LABEL_DECL)
3060 /* Lookup the declaration. */
3061 n = (tree *) pointer_map_contains (st, *tp);
3063 /* If it's there, remap it. */
3068 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3069 copy_statement_list (tp);
3070 else if (TREE_CODE (*tp) == BIND_EXPR)
3071 copy_bind_expr (tp, walk_subtrees, id);
3072 else if (TREE_CODE (*tp) == SAVE_EXPR)
3073 remap_save_expr (tp, st, walk_subtrees);
3076 copy_tree_r (tp, walk_subtrees, NULL);
3078 /* Do whatever unsaving is required. */
3079 unsave_expr_1 (*tp);
3082 /* Keep iterating. */
3086 /* Copies everything in EXPR and replaces variables, labels
3087 and SAVE_EXPRs local to EXPR. */
3090 unsave_expr_now (tree expr)
3094 /* There's nothing to do for NULL_TREE. */
3099 memset (&id, 0, sizeof (id));
3100 id.src_fn = current_function_decl;
3101 id.dst_fn = current_function_decl;
3102 id.decl_map = pointer_map_create ();
3104 id.copy_decl = copy_decl_no_change;
3105 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3106 id.transform_new_cfg = false;
3107 id.transform_return_to_modify = false;
3108 id.transform_lang_insert_block = false;
3110 /* Walk the tree once to find local labels. */
3111 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3113 /* Walk the tree again, copying, remapping, and unsaving. */
3114 walk_tree (&expr, unsave_r, &id, NULL);
3117 pointer_map_destroy (id.decl_map);
3122 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
3125 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
3134 debug_find_tree (tree top, tree search)
3136 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
3140 /* Declare the variables created by the inliner. Add all the variables in
3141 VARS to BIND_EXPR. */
3144 declare_inline_vars (tree block, tree vars)
3147 for (t = vars; t; t = TREE_CHAIN (t))
3149 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
3150 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
3151 cfun->unexpanded_var_list =
3152 tree_cons (NULL_TREE, t,
3153 cfun->unexpanded_var_list);
3157 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
3161 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
3162 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
3163 VAR_DECL translation. */
3166 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
3168 /* Don't generate debug information for the copy if we wouldn't have
3169 generated it for the copy either. */
3170 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
3171 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
3173 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
3174 declaration inspired this copy. */
3175 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
3177 /* The new variable/label has no RTL, yet. */
3178 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
3179 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
3180 SET_DECL_RTL (copy, NULL_RTX);
3182 /* These args would always appear unused, if not for this. */
3183 TREE_USED (copy) = 1;
3185 /* Set the context for the new declaration. */
3186 if (!DECL_CONTEXT (decl))
3187 /* Globals stay global. */
3189 else if (DECL_CONTEXT (decl) != id->src_fn)
3190 /* Things that weren't in the scope of the function we're inlining
3191 from aren't in the scope we're inlining to, either. */
3193 else if (TREE_STATIC (decl))
3194 /* Function-scoped static variables should stay in the original
3198 /* Ordinary automatic local variables are now in the scope of the
3200 DECL_CONTEXT (copy) = id->dst_fn;
3206 copy_decl_to_var (tree decl, copy_body_data *id)
3210 gcc_assert (TREE_CODE (decl) == PARM_DECL
3211 || TREE_CODE (decl) == RESULT_DECL);
3213 type = TREE_TYPE (decl);
3215 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3216 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3217 TREE_READONLY (copy) = TREE_READONLY (decl);
3218 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3219 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3220 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3222 return copy_decl_for_dup_finish (id, decl, copy);
3225 /* Like copy_decl_to_var, but create a return slot object instead of a
3226 pointer variable for return by invisible reference. */
3229 copy_result_decl_to_var (tree decl, copy_body_data *id)
3233 gcc_assert (TREE_CODE (decl) == PARM_DECL
3234 || TREE_CODE (decl) == RESULT_DECL);
3236 type = TREE_TYPE (decl);
3237 if (DECL_BY_REFERENCE (decl))
3238 type = TREE_TYPE (type);
3240 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3241 TREE_READONLY (copy) = TREE_READONLY (decl);
3242 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3243 if (!DECL_BY_REFERENCE (decl))
3245 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3246 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3247 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3250 return copy_decl_for_dup_finish (id, decl, copy);
3255 copy_decl_no_change (tree decl, copy_body_data *id)
3259 copy = copy_node (decl);
3261 /* The COPY is not abstract; it will be generated in DST_FN. */
3262 DECL_ABSTRACT (copy) = 0;
3263 lang_hooks.dup_lang_specific_decl (copy);
3265 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
3266 been taken; it's for internal bookkeeping in expand_goto_internal. */
3267 if (TREE_CODE (copy) == LABEL_DECL)
3269 TREE_ADDRESSABLE (copy) = 0;
3270 LABEL_DECL_UID (copy) = -1;
3273 return copy_decl_for_dup_finish (id, decl, copy);
3277 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
3279 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
3280 return copy_decl_to_var (decl, id);
3282 return copy_decl_no_change (decl, id);
3285 /* Return a copy of the function's argument tree. */
3287 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
3289 tree *arg_copy, *parg;
3291 arg_copy = &orig_parm;
3292 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
3294 tree new = remap_decl (*parg, id);
3295 lang_hooks.dup_lang_specific_decl (new);
3296 TREE_CHAIN (new) = TREE_CHAIN (*parg);
3302 /* Return a copy of the function's static chain. */
3304 copy_static_chain (tree static_chain, copy_body_data * id)
3306 tree *chain_copy, *pvar;
3308 chain_copy = &static_chain;
3309 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
3311 tree new = remap_decl (*pvar, id);
3312 lang_hooks.dup_lang_specific_decl (new);
3313 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
3316 return static_chain;
3319 /* Return true if the function is allowed to be versioned.
3320 This is a guard for the versioning functionality. */
3322 tree_versionable_function_p (tree fndecl)
3324 if (fndecl == NULL_TREE)
3326 /* ??? There are cases where a function is
3327 uninlinable but can be versioned. */
3328 if (!tree_inlinable_function_p (fndecl))
3334 /* Create a copy of a function's tree.
3335 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
3336 of the original function and the new copied function
3337 respectively. In case we want to replace a DECL
3338 tree with another tree while duplicating the function's
3339 body, TREE_MAP represents the mapping between these
3340 trees. If UPDATE_CLONES is set, the call_stmt fields
3341 of edges of clones of the function will be updated. */
3343 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
3346 struct cgraph_node *old_version_node;
3347 struct cgraph_node *new_version_node;
3351 struct ipa_replace_map *replace_info;
3352 basic_block old_entry_block;
3354 tree old_current_function_decl = current_function_decl;
3356 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
3357 && TREE_CODE (new_decl) == FUNCTION_DECL);
3358 DECL_POSSIBLY_INLINED (old_decl) = 1;
3360 old_version_node = cgraph_node (old_decl);
3361 new_version_node = cgraph_node (new_decl);
3363 DECL_ARTIFICIAL (new_decl) = 1;
3364 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
3366 /* Prepare the data structures for the tree copy. */
3367 memset (&id, 0, sizeof (id));
3369 /* Generate a new name for the new version. */
3372 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
3373 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
3374 SET_DECL_RTL (new_decl, NULL_RTX);
3375 id.statements_to_fold = pointer_set_create ();
3378 id.decl_map = pointer_map_create ();
3379 id.src_fn = old_decl;
3380 id.dst_fn = new_decl;
3381 id.src_node = old_version_node;
3382 id.dst_node = new_version_node;
3383 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
3385 id.copy_decl = copy_decl_no_change;
3386 id.transform_call_graph_edges
3387 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
3388 id.transform_new_cfg = true;
3389 id.transform_return_to_modify = false;
3390 id.transform_lang_insert_block = false;
3392 current_function_decl = new_decl;
3393 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
3394 (DECL_STRUCT_FUNCTION (old_decl));
3395 initialize_cfun (new_decl, old_decl,
3396 old_entry_block->count,
3397 old_entry_block->frequency);
3398 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
3400 /* Copy the function's static chain. */
3401 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
3403 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
3404 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
3406 /* Copy the function's arguments. */
3407 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
3408 DECL_ARGUMENTS (new_decl) =
3409 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
3411 /* If there's a tree_map, prepare for substitution. */
3413 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
3415 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
3416 if (replace_info->replace_p)
3417 insert_decl_map (&id, replace_info->old_tree,
3418 replace_info->new_tree);
3421 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
3423 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3424 number_blocks (id.dst_fn);
3426 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
3427 /* Add local vars. */
3428 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
3429 t_step; t_step = TREE_CHAIN (t_step))
3431 tree var = TREE_VALUE (t_step);
3432 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3433 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
3434 cfun->unexpanded_var_list);
3436 cfun->unexpanded_var_list =
3437 tree_cons (NULL_TREE, remap_decl (var, &id),
3438 cfun->unexpanded_var_list);
3441 /* Copy the Function's body. */
3442 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
3444 if (DECL_RESULT (old_decl) != NULL_TREE)
3446 tree *res_decl = &DECL_RESULT (old_decl);
3447 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
3448 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
3451 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3452 number_blocks (new_decl);
3455 pointer_map_destroy (id.decl_map);
3458 fold_marked_statements (0, id.statements_to_fold);
3459 pointer_set_destroy (id.statements_to_fold);
3460 fold_cond_expr_cond ();
3462 if (gimple_in_ssa_p (cfun))
3464 free_dominance_info (CDI_DOMINATORS);
3465 free_dominance_info (CDI_POST_DOMINATORS);
3467 delete_unreachable_blocks ();
3468 update_ssa (TODO_update_ssa);
3471 fold_cond_expr_cond ();
3472 if (need_ssa_update_p ())
3473 update_ssa (TODO_update_ssa);
3476 free_dominance_info (CDI_DOMINATORS);
3477 free_dominance_info (CDI_POST_DOMINATORS);
3479 current_function_decl = old_current_function_decl;
3480 gcc_assert (!current_function_decl
3481 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
3485 /* Duplicate a type, fields and all. */
3488 build_duplicate_type (tree type)
3490 struct copy_body_data id;
3492 memset (&id, 0, sizeof (id));
3493 id.src_fn = current_function_decl;
3494 id.dst_fn = current_function_decl;
3496 id.decl_map = pointer_map_create ();
3498 type = remap_type_1 (type, &id);
3500 pointer_map_destroy (id.decl_map);