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 #include "integrate.h"
57 /* I'm not real happy about this, but we need to handle gimple and
59 #include "tree-gimple.h"
61 /* Inlining, Cloning, Versioning, Parallelization
63 Inlining: a function body is duplicated, but the PARM_DECLs are
64 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
65 GIMPLE_MODIFY_STMTs that store to a dedicated returned-value variable.
66 The duplicated eh_region info of the copy will later be appended
67 to the info for the caller; the eh_region info in copied throwing
68 statements and RESX_EXPRs is adjusted accordingly.
70 Cloning: (only in C++) We have one body for a con/de/structor, and
71 multiple function decls, each with a unique parameter list.
72 Duplicate the body, using the given splay tree; some parameters
73 will become constants (like 0 or 1).
75 Versioning: a function body is duplicated and the result is a new
76 function rather than into blocks of an existing function as with
77 inlining. Some parameters will become constants.
79 Parallelization: a region of a function is duplicated resulting in
80 a new function. Variables may be replaced with complex expressions
81 to enable shared variable semantics.
83 All of these will simultaneously lookup any callgraph edges. If
84 we're going to inline the duplicated function body, and the given
85 function has some cloned callgraph nodes (one for each place this
86 function will be inlined) those callgraph edges will be duplicated.
87 If we're cloning the body, those callgraph edges will be
88 updated to point into the new body. (Note that the original
89 callgraph node and edge list will not be altered.)
91 See the CALL_EXPR handling case in copy_body_r (). */
93 /* 0 if we should not perform inlining.
94 1 if we should expand functions calls inline at the tree level.
95 2 if we should consider *all* functions to be inline
98 int flag_inline_trees = 0;
102 o In order to make inlining-on-trees work, we pessimized
103 function-local static constants. In particular, they are now
104 always output, even when not addressed. Fix this by treating
105 function-local static constants just like global static
106 constants; the back-end already knows not to output them if they
109 o Provide heuristics to clamp inlining of recursive template
113 /* Weights that estimate_num_insns uses for heuristics in inlining. */
115 eni_weights eni_inlining_weights;
117 /* Weights that estimate_num_insns uses to estimate the size of the
120 eni_weights eni_size_weights;
122 /* Weights that estimate_num_insns uses to estimate the time necessary
123 to execute the produced code. */
125 eni_weights eni_time_weights;
129 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
130 static tree copy_generic_body (copy_body_data *);
131 static bool inlinable_function_p (tree);
132 static void remap_block (tree *, copy_body_data *);
133 static tree remap_decls (tree, copy_body_data *);
134 static void copy_bind_expr (tree *, int *, copy_body_data *);
135 static tree mark_local_for_remap_r (tree *, int *, void *);
136 static void unsave_expr_1 (tree);
137 static tree unsave_r (tree *, int *, void *);
138 static void declare_inline_vars (tree, tree);
139 static void remap_save_expr (tree *, void *, int *);
140 static void add_lexical_block (tree current_block, tree new_block);
141 static tree copy_decl_to_var (tree, copy_body_data *);
142 static tree copy_result_decl_to_var (tree, copy_body_data *);
143 static tree copy_decl_no_change (tree, copy_body_data *);
144 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
146 /* Insert a tree->tree mapping for ID. Despite the name suggests
147 that the trees should be variables, it is used for more than that. */
150 insert_decl_map (copy_body_data *id, tree key, tree value)
152 *pointer_map_insert (id->decl_map, key) = value;
154 /* Always insert an identity map as well. If we see this same new
155 node again, we won't want to duplicate it a second time. */
157 *pointer_map_insert (id->decl_map, value) = value;
160 /* Construct new SSA name for old NAME. ID is the inline context. */
163 remap_ssa_name (tree name, copy_body_data *id)
168 gcc_assert (TREE_CODE (name) == SSA_NAME);
170 n = (tree *) pointer_map_contains (id->decl_map, name);
174 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
176 new = remap_decl (SSA_NAME_VAR (name), id);
177 /* We might've substituted constant or another SSA_NAME for
180 Replace the SSA name representing RESULT_DECL by variable during
181 inlining: this saves us from need to introduce PHI node in a case
182 return value is just partly initialized. */
183 if ((TREE_CODE (new) == VAR_DECL || TREE_CODE (new) == PARM_DECL)
184 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
185 || !id->transform_return_to_modify))
187 new = make_ssa_name (new, NULL);
188 insert_decl_map (id, name, new);
189 if (IS_EMPTY_STMT (SSA_NAME_DEF_STMT (name)))
191 SSA_NAME_DEF_STMT (new) = build_empty_stmt ();
192 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name)) == name)
193 set_default_def (SSA_NAME_VAR (new), new);
195 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new)
196 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
197 TREE_TYPE (new) = TREE_TYPE (SSA_NAME_VAR (new));
200 insert_decl_map (id, name, new);
204 /* Remap DECL during the copying of the BLOCK tree for the function. */
207 remap_decl (tree decl, copy_body_data *id)
212 /* We only remap local variables in the current function. */
215 /* See if we have remapped this declaration. */
217 n = (tree *) pointer_map_contains (id->decl_map, decl);
219 /* If we didn't already have an equivalent for this declaration,
223 /* Make a copy of the variable or label. */
224 tree t = id->copy_decl (decl, id);
226 /* Remember it, so that if we encounter this local entity again
227 we can reuse this copy. Do this early because remap_type may
228 need this decl for TYPE_STUB_DECL. */
229 insert_decl_map (id, decl, t);
234 /* Remap types, if necessary. */
235 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
236 if (TREE_CODE (t) == TYPE_DECL)
237 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
239 /* Remap sizes as necessary. */
240 walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
241 walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
243 /* If fields, do likewise for offset and qualifier. */
244 if (TREE_CODE (t) == FIELD_DECL)
246 walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
247 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
248 walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
251 if (cfun && gimple_in_ssa_p (cfun)
252 && (TREE_CODE (t) == VAR_DECL
253 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
255 tree def = gimple_default_def (id->src_cfun, decl);
257 if (TREE_CODE (decl) != PARM_DECL && def)
259 tree map = remap_ssa_name (def, id);
260 /* Watch out RESULT_DECLs whose SSA names map directly
262 if (TREE_CODE (map) == SSA_NAME)
263 set_default_def (t, map);
265 add_referenced_var (t);
270 return unshare_expr (*n);
274 remap_type_1 (tree type, copy_body_data *id)
282 /* See if we have remapped this type. */
283 node = (tree *) pointer_map_contains (id->decl_map, type);
287 /* The type only needs remapping if it's variably modified. */
288 if (! variably_modified_type_p (type, id->src_fn))
290 insert_decl_map (id, type, type);
294 /* We do need a copy. build and register it now. If this is a pointer or
295 reference type, remap the designated type and make a new pointer or
297 if (TREE_CODE (type) == POINTER_TYPE)
299 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
301 TYPE_REF_CAN_ALIAS_ALL (type));
302 insert_decl_map (id, type, new);
305 else if (TREE_CODE (type) == REFERENCE_TYPE)
307 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
309 TYPE_REF_CAN_ALIAS_ALL (type));
310 insert_decl_map (id, type, new);
314 new = copy_node (type);
316 insert_decl_map (id, type, new);
318 /* This is a new type, not a copy of an old type. Need to reassociate
319 variants. We can handle everything except the main variant lazily. */
320 t = TYPE_MAIN_VARIANT (type);
323 t = remap_type (t, id);
324 TYPE_MAIN_VARIANT (new) = t;
325 TYPE_NEXT_VARIANT (new) = TYPE_NEXT_VARIANT (t);
326 TYPE_NEXT_VARIANT (t) = new;
330 TYPE_MAIN_VARIANT (new) = new;
331 TYPE_NEXT_VARIANT (new) = NULL;
334 if (TYPE_STUB_DECL (type))
335 TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
337 /* Lazily create pointer and reference types. */
338 TYPE_POINTER_TO (new) = NULL;
339 TYPE_REFERENCE_TO (new) = NULL;
341 switch (TREE_CODE (new))
345 case FIXED_POINT_TYPE:
348 t = TYPE_MIN_VALUE (new);
349 if (t && TREE_CODE (t) != INTEGER_CST)
350 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
352 t = TYPE_MAX_VALUE (new);
353 if (t && TREE_CODE (t) != INTEGER_CST)
354 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
358 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
359 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
363 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
364 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
369 case QUAL_UNION_TYPE:
373 for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
375 t = remap_decl (f, id);
376 DECL_CONTEXT (t) = new;
380 TYPE_FIELDS (new) = nreverse (nf);
386 /* Shouldn't have been thought variable sized. */
390 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
391 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
397 remap_type (tree type, copy_body_data *id)
404 /* See if we have remapped this type. */
405 node = (tree *) pointer_map_contains (id->decl_map, type);
409 /* The type only needs remapping if it's variably modified. */
410 if (! variably_modified_type_p (type, id->src_fn))
412 insert_decl_map (id, type, type);
416 return remap_type_1 (type, id);
420 remap_decls (tree decls, copy_body_data *id)
423 tree new_decls = NULL_TREE;
425 /* Remap its variables. */
426 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
430 /* We can not chain the local static declarations into the unexpanded_var_list
431 as we can't duplicate them or break one decl rule. Go ahead and link
432 them into unexpanded_var_list. */
433 if (!auto_var_in_fn_p (old_var, id->src_fn)
434 && !DECL_EXTERNAL (old_var))
436 cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
437 cfun->unexpanded_var_list);
441 /* Remap the variable. */
442 new_var = remap_decl (old_var, id);
444 /* If we didn't remap this variable, so we can't mess with its
445 TREE_CHAIN. If we remapped this variable to the return slot, it's
446 already declared somewhere else, so don't declare it here. */
447 if (!new_var || new_var == id->retvar)
451 gcc_assert (DECL_P (new_var));
452 TREE_CHAIN (new_var) = new_decls;
457 return nreverse (new_decls);
460 /* Copy the BLOCK to contain remapped versions of the variables
461 therein. And hook the new block into the block-tree. */
464 remap_block (tree *block, copy_body_data *id)
470 /* Make the new block. */
472 new_block = make_node (BLOCK);
473 TREE_USED (new_block) = TREE_USED (old_block);
474 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
475 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
478 /* Remap its variables. */
479 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
483 if (id->transform_lang_insert_block)
484 lang_hooks.decls.insert_block (new_block);
486 /* Remember the remapped block. */
487 insert_decl_map (id, old_block, new_block);
490 /* Copy the whole block tree and root it in id->block. */
492 remap_blocks (tree block, copy_body_data *id)
500 remap_block (&new, id);
501 gcc_assert (new != block);
502 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
503 add_lexical_block (new, remap_blocks (t, id));
508 copy_statement_list (tree *tp)
510 tree_stmt_iterator oi, ni;
513 new = alloc_stmt_list ();
514 ni = tsi_start (new);
515 oi = tsi_start (*tp);
518 for (; !tsi_end_p (oi); tsi_next (&oi))
519 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
523 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
525 tree block = BIND_EXPR_BLOCK (*tp);
526 /* Copy (and replace) the statement. */
527 copy_tree_r (tp, walk_subtrees, NULL);
530 remap_block (&block, id);
531 BIND_EXPR_BLOCK (*tp) = block;
534 if (BIND_EXPR_VARS (*tp))
535 /* This will remap a lot of the same decls again, but this should be
537 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
540 /* Called from copy_body_id via walk_tree. DATA is really an
541 `copy_body_data *'. */
544 copy_body_r (tree *tp, int *walk_subtrees, void *data)
546 copy_body_data *id = (copy_body_data *) data;
547 tree fn = id->src_fn;
550 /* Begin by recognizing trees that we'll completely rewrite for the
551 inlining context. Our output for these trees is completely
552 different from out input (e.g. RETURN_EXPR is deleted, and morphs
553 into an edge). Further down, we'll handle trees that get
554 duplicated and/or tweaked. */
556 /* When requested, RETURN_EXPRs should be transformed to just the
557 contained GIMPLE_MODIFY_STMT. The branch semantics of the return will
558 be handled elsewhere by manipulating the CFG rather than a statement. */
559 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
561 tree assignment = TREE_OPERAND (*tp, 0);
563 /* If we're returning something, just turn that into an
564 assignment into the equivalent of the original RESULT_DECL.
565 If the "assignment" is just the result decl, the result
566 decl has already been set (e.g. a recent "foo (&result_decl,
567 ...)"); just toss the entire RETURN_EXPR. */
568 if (assignment && TREE_CODE (assignment) == GIMPLE_MODIFY_STMT)
570 /* Replace the RETURN_EXPR with (a copy of) the
571 GIMPLE_MODIFY_STMT hanging underneath. */
572 *tp = copy_node (assignment);
574 else /* Else the RETURN_EXPR returns no value. */
577 return (tree) (void *)1;
580 else if (TREE_CODE (*tp) == SSA_NAME)
582 *tp = remap_ssa_name (*tp, id);
587 /* Local variables and labels need to be replaced by equivalent
588 variables. We don't want to copy static variables; there's only
589 one of those, no matter how many times we inline the containing
590 function. Similarly for globals from an outer function. */
591 else if (auto_var_in_fn_p (*tp, fn))
595 /* Remap the declaration. */
596 new_decl = remap_decl (*tp, id);
597 gcc_assert (new_decl);
598 /* Replace this variable with the copy. */
599 STRIP_TYPE_NOPS (new_decl);
603 else if (TREE_CODE (*tp) == STATEMENT_LIST)
604 copy_statement_list (tp);
605 else if (TREE_CODE (*tp) == SAVE_EXPR)
606 remap_save_expr (tp, id->decl_map, walk_subtrees);
607 else if (TREE_CODE (*tp) == LABEL_DECL
608 && (! DECL_CONTEXT (*tp)
609 || decl_function_context (*tp) == id->src_fn))
610 /* These may need to be remapped for EH handling. */
611 *tp = remap_decl (*tp, id);
612 else if (TREE_CODE (*tp) == BIND_EXPR)
613 copy_bind_expr (tp, walk_subtrees, id);
614 /* Types may need remapping as well. */
615 else if (TYPE_P (*tp))
616 *tp = remap_type (*tp, id);
618 /* If this is a constant, we have to copy the node iff the type will be
619 remapped. copy_tree_r will not copy a constant. */
620 else if (CONSTANT_CLASS_P (*tp))
622 tree new_type = remap_type (TREE_TYPE (*tp), id);
624 if (new_type == TREE_TYPE (*tp))
627 else if (TREE_CODE (*tp) == INTEGER_CST)
628 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
629 TREE_INT_CST_HIGH (*tp));
632 *tp = copy_node (*tp);
633 TREE_TYPE (*tp) = new_type;
637 /* Otherwise, just copy the node. Note that copy_tree_r already
638 knows not to copy VAR_DECLs, etc., so this is safe. */
641 /* Here we handle trees that are not completely rewritten.
642 First we detect some inlining-induced bogosities for
644 if (TREE_CODE (*tp) == GIMPLE_MODIFY_STMT
645 && GIMPLE_STMT_OPERAND (*tp, 0) == GIMPLE_STMT_OPERAND (*tp, 1)
646 && (auto_var_in_fn_p (GIMPLE_STMT_OPERAND (*tp, 0), fn)))
648 /* Some assignments VAR = VAR; don't generate any rtl code
649 and thus don't count as variable modification. Avoid
650 keeping bogosities like 0 = 0. */
651 tree decl = GIMPLE_STMT_OPERAND (*tp, 0), value;
654 n = (tree *) pointer_map_contains (id->decl_map, decl);
658 STRIP_TYPE_NOPS (value);
659 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
661 *tp = build_empty_stmt ();
662 return copy_body_r (tp, walk_subtrees, data);
666 else if (TREE_CODE (*tp) == INDIRECT_REF)
668 /* Get rid of *& from inline substitutions that can happen when a
669 pointer argument is an ADDR_EXPR. */
670 tree decl = TREE_OPERAND (*tp, 0);
673 n = (tree *) pointer_map_contains (id->decl_map, decl);
678 /* If we happen to get an ADDR_EXPR in n->value, strip
679 it manually here as we'll eventually get ADDR_EXPRs
680 which lie about their types pointed to. In this case
681 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
682 but we absolutely rely on that. As fold_indirect_ref
683 does other useful transformations, try that first, though. */
684 tree type = TREE_TYPE (TREE_TYPE (*n));
685 new = unshare_expr (*n);
687 *tp = fold_indirect_ref_1 (type, new);
690 if (TREE_CODE (new) == ADDR_EXPR)
691 *tp = TREE_OPERAND (new, 0);
694 *tp = build1 (INDIRECT_REF, type, new);
695 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
703 /* Here is the "usual case". Copy this tree node, and then
704 tweak some special cases. */
705 copy_tree_r (tp, walk_subtrees, NULL);
707 /* Global variables we didn't seen yet needs to go into referenced
709 if (gimple_in_ssa_p (cfun) && TREE_CODE (*tp) == VAR_DECL)
710 add_referenced_var (*tp);
712 /* If EXPR has block defined, map it to newly constructed block.
713 When inlining we want EXPRs without block appear in the block
715 if (EXPR_P (*tp) || GIMPLE_STMT_P (*tp))
717 new_block = id->block;
718 if (TREE_BLOCK (*tp))
721 n = (tree *) pointer_map_contains (id->decl_map,
726 TREE_BLOCK (*tp) = new_block;
729 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
730 TREE_OPERAND (*tp, 0) =
733 id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
735 if (!GIMPLE_TUPLE_P (*tp) && TREE_CODE (*tp) != OMP_CLAUSE)
736 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
738 /* The copied TARGET_EXPR has never been expanded, even if the
739 original node was expanded already. */
740 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
742 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
743 TREE_OPERAND (*tp, 3) = NULL_TREE;
746 /* Variable substitution need not be simple. In particular, the
747 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
748 and friends are up-to-date. */
749 else if (TREE_CODE (*tp) == ADDR_EXPR)
751 walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
752 /* Handle the case where we substituted an INDIRECT_REF
753 into the operand of the ADDR_EXPR. */
754 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
755 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
757 recompute_tree_invariant_for_addr_expr (*tp);
762 /* Keep iterating. */
766 /* Copy basic block, scale profile accordingly. Edges will be taken care of
770 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
772 block_stmt_iterator bsi, copy_bsi;
773 basic_block copy_basic_block;
775 /* create_basic_block() will append every new block to
776 basic_block_info automatically. */
777 copy_basic_block = create_basic_block (NULL, (void *) 0,
778 (basic_block) bb->prev_bb->aux);
779 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
781 /* We are going to rebuild frequencies from scratch. These values have just
782 small importance to drive canonicalize_loop_headers. */
783 copy_basic_block->frequency = ((gcov_type)bb->frequency
784 * frequency_scale / REG_BR_PROB_BASE);
785 if (copy_basic_block->frequency > BB_FREQ_MAX)
786 copy_basic_block->frequency = BB_FREQ_MAX;
787 copy_bsi = bsi_start (copy_basic_block);
789 for (bsi = bsi_start (bb);
790 !bsi_end_p (bsi); bsi_next (&bsi))
792 tree stmt = bsi_stmt (bsi);
793 tree orig_stmt = stmt;
795 walk_tree (&stmt, copy_body_r, id, NULL);
797 /* RETURN_EXPR might be removed,
798 this is signalled by making stmt pointer NULL. */
803 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
805 /* With return slot optimization we can end up with
806 non-gimple (foo *)&this->m, fix that here. */
807 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
808 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 1)) == NOP_EXPR
809 && !is_gimple_val (TREE_OPERAND (GIMPLE_STMT_OPERAND (stmt, 1), 0)))
810 gimplify_stmt (&stmt);
812 bsi_insert_after (©_bsi, stmt, BSI_NEW_STMT);
814 /* Process new statement. gimplify_stmt possibly turned statement
815 into multiple statements, we need to process all of them. */
816 while (!bsi_end_p (copy_bsi))
818 tree *stmtp = bsi_stmt_ptr (copy_bsi);
820 call = get_call_expr_in (stmt);
822 if (call && CALL_EXPR_VA_ARG_PACK (call) && id->call_expr)
824 /* __builtin_va_arg_pack () should be replaced by
825 all arguments corresponding to ... in the caller. */
826 tree p, *argarray, new_call, *call_ptr;
827 int nargs = call_expr_nargs (id->call_expr);
829 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
832 argarray = (tree *) alloca ((nargs + call_expr_nargs (call))
835 memcpy (argarray, CALL_EXPR_ARGP (call),
836 call_expr_nargs (call) * sizeof (*argarray));
837 memcpy (argarray + call_expr_nargs (call),
838 CALL_EXPR_ARGP (id->call_expr)
839 + (call_expr_nargs (id->call_expr) - nargs),
840 nargs * sizeof (*argarray));
842 new_call = build_call_array (TREE_TYPE (call),
844 nargs + call_expr_nargs (call),
846 /* Copy all CALL_EXPR flags, locus and block, except
847 CALL_EXPR_VA_ARG_PACK flag. */
848 CALL_EXPR_STATIC_CHAIN (new_call)
849 = CALL_EXPR_STATIC_CHAIN (call);
850 CALL_EXPR_TAILCALL (new_call) = CALL_EXPR_TAILCALL (call);
851 CALL_EXPR_RETURN_SLOT_OPT (new_call)
852 = CALL_EXPR_RETURN_SLOT_OPT (call);
853 CALL_FROM_THUNK_P (new_call) = CALL_FROM_THUNK_P (call);
854 CALL_CANNOT_INLINE_P (new_call)
855 = CALL_CANNOT_INLINE_P (call);
856 TREE_NOTHROW (new_call) = TREE_NOTHROW (call);
857 SET_EXPR_LOCUS (new_call, EXPR_LOCUS (call));
858 TREE_BLOCK (new_call) = TREE_BLOCK (call);
861 if (TREE_CODE (*call_ptr) == GIMPLE_MODIFY_STMT)
862 call_ptr = &GIMPLE_STMT_OPERAND (*call_ptr, 1);
863 if (TREE_CODE (*call_ptr) == WITH_SIZE_EXPR)
864 call_ptr = &TREE_OPERAND (*call_ptr, 0);
865 gcc_assert (*call_ptr == call);
866 *call_ptr = new_call;
872 && (decl = get_callee_fndecl (call))
873 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
874 && DECL_FUNCTION_CODE (decl)
875 == BUILT_IN_VA_ARG_PACK_LEN)
877 /* __builtin_va_arg_pack_len () should be replaced by
878 the number of anonymous arguments. */
879 int nargs = call_expr_nargs (id->call_expr);
880 tree count, *call_ptr, p;
882 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
885 count = build_int_cst (integer_type_node, nargs);
887 if (TREE_CODE (*call_ptr) == GIMPLE_MODIFY_STMT)
888 call_ptr = &GIMPLE_STMT_OPERAND (*call_ptr, 1);
889 if (TREE_CODE (*call_ptr) == WITH_SIZE_EXPR)
890 call_ptr = &TREE_OPERAND (*call_ptr, 0);
891 gcc_assert (*call_ptr == call && call_ptr != stmtp);
898 /* Statements produced by inlining can be unfolded, especially
899 when we constant propagated some operands. We can't fold
900 them right now for two reasons:
901 1) folding require SSA_NAME_DEF_STMTs to be correct
902 2) we can't change function calls to builtins.
903 So we just mark statement for later folding. We mark
904 all new statements, instead just statements that has changed
905 by some nontrivial substitution so even statements made
906 foldable indirectly are updated. If this turns out to be
907 expensive, copy_body can be told to watch for nontrivial
909 if (id->statements_to_fold)
910 pointer_set_insert (id->statements_to_fold, stmt);
911 /* We're duplicating a CALL_EXPR. Find any corresponding
912 callgraph edges and update or duplicate them. */
913 if (call && (decl = get_callee_fndecl (call)))
915 struct cgraph_node *node;
916 struct cgraph_edge *edge;
918 switch (id->transform_call_graph_edges)
920 case CB_CGE_DUPLICATE:
921 edge = cgraph_edge (id->src_node, orig_stmt);
923 cgraph_clone_edge (edge, id->dst_node, stmt,
924 REG_BR_PROB_BASE, 1, edge->frequency, true);
927 case CB_CGE_MOVE_CLONES:
928 for (node = id->dst_node->next_clone;
930 node = node->next_clone)
932 edge = cgraph_edge (node, orig_stmt);
934 cgraph_set_call_stmt (edge, stmt);
939 edge = cgraph_edge (id->dst_node, orig_stmt);
941 cgraph_set_call_stmt (edge, stmt);
948 /* If you think we can abort here, you are wrong.
949 There is no region 0 in tree land. */
950 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
953 if (tree_could_throw_p (stmt)
954 /* When we are cloning for inlining, we are supposed to
955 construct a clone that calls precisely the same functions
956 as original. However IPA optimizers might've proved
957 earlier some function calls as non-trapping that might
958 render some basic blocks dead that might become
961 We can't update SSA with unreachable blocks in CFG and thus
962 we prevent the scenario by preserving even the "dead" eh
963 edges until the point they are later removed by
965 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
966 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
968 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
969 /* Add an entry for the copied tree in the EH hashtable.
970 When cloning or versioning, use the hashtable in
971 cfun, and just copy the EH number. When inlining, use the
972 hashtable in the caller, and adjust the region number. */
974 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
976 /* If this tree doesn't have a region associated with it,
977 and there is a "current region,"
978 then associate this tree with the current region
979 and add edges associated with this region. */
980 if ((lookup_stmt_eh_region_fn (id->src_cfun,
982 && id->eh_region > 0)
983 && tree_could_throw_p (stmt))
984 add_stmt_to_eh_region (stmt, id->eh_region);
986 if (gimple_in_ssa_p (cfun))
991 find_new_referenced_vars (bsi_stmt_ptr (copy_bsi));
992 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
993 if (TREE_CODE (def) == SSA_NAME)
994 SSA_NAME_DEF_STMT (def) = stmt;
996 bsi_next (©_bsi);
998 copy_bsi = bsi_last (copy_basic_block);
1001 return copy_basic_block;
1004 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1005 form is quite easy, since dominator relationship for old basic blocks does
1008 There is however exception where inlining might change dominator relation
1009 across EH edges from basic block within inlined functions destinating
1010 to landing pads in function we inline into.
1012 The function mark PHI_RESULT of such PHI nodes for renaming; it is
1013 safe the EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI
1014 must be set. This means, that there will be no overlapping live ranges
1015 for the underlying symbol.
1017 This might change in future if we allow redirecting of EH edges and
1018 we might want to change way build CFG pre-inlining to include
1019 all the possible edges then. */
1021 update_ssa_across_eh_edges (basic_block bb)
1026 FOR_EACH_EDGE (e, ei, bb->succs)
1028 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1032 gcc_assert (e->flags & EDGE_EH);
1033 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
1035 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
1036 (PHI_RESULT (phi)));
1037 mark_sym_for_renaming
1038 (SSA_NAME_VAR (PHI_RESULT (phi)));
1043 /* Copy edges from BB into its copy constructed earlier, scale profile
1044 accordingly. Edges will be taken care of later. Assume aux
1045 pointers to point to the copies of each BB. */
1047 copy_edges_for_bb (basic_block bb, int count_scale)
1049 basic_block new_bb = (basic_block) bb->aux;
1052 block_stmt_iterator bsi;
1055 /* Use the indices from the original blocks to create edges for the
1057 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1058 if (!(old_edge->flags & EDGE_EH))
1062 flags = old_edge->flags;
1064 /* Return edges do get a FALLTHRU flag when the get inlined. */
1065 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1066 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1067 flags |= EDGE_FALLTHRU;
1068 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1069 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1070 new->probability = old_edge->probability;
1073 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1076 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
1080 copy_stmt = bsi_stmt (bsi);
1081 update_stmt (copy_stmt);
1082 if (gimple_in_ssa_p (cfun))
1083 mark_symbols_for_renaming (copy_stmt);
1084 /* Do this before the possible split_block. */
1087 /* If this tree could throw an exception, there are two
1088 cases where we need to add abnormal edge(s): the
1089 tree wasn't in a region and there is a "current
1090 region" in the caller; or the original tree had
1091 EH edges. In both cases split the block after the tree,
1092 and add abnormal edge(s) as needed; we need both
1093 those from the callee and the caller.
1094 We check whether the copy can throw, because the const
1095 propagation can change an INDIRECT_REF which throws
1096 into a COMPONENT_REF which doesn't. If the copy
1097 can throw, the original could also throw. */
1099 if (tree_can_throw_internal (copy_stmt))
1101 if (!bsi_end_p (bsi))
1102 /* Note that bb's predecessor edges aren't necessarily
1103 right at this point; split_block doesn't care. */
1105 edge e = split_block (new_bb, copy_stmt);
1108 new_bb->aux = e->src->aux;
1109 bsi = bsi_start (new_bb);
1112 make_eh_edges (copy_stmt);
1114 if (gimple_in_ssa_p (cfun))
1115 update_ssa_across_eh_edges (bb_for_stmt (copy_stmt));
1120 /* Copy the PHIs. All blocks and edges are copied, some blocks
1121 was possibly split and new outgoing EH edges inserted.
1122 BB points to the block of original function and AUX pointers links
1123 the original and newly copied blocks. */
1126 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1128 basic_block new_bb = bb->aux;
1132 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1134 tree res = PHI_RESULT (phi);
1139 if (is_gimple_reg (res))
1141 walk_tree (&new_res, copy_body_r, id, NULL);
1142 SSA_NAME_DEF_STMT (new_res)
1143 = new_phi = create_phi_node (new_res, new_bb);
1144 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1146 edge old_edge = find_edge (new_edge->src->aux, bb);
1147 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1150 walk_tree (&new_arg, copy_body_r, id, NULL);
1151 gcc_assert (new_arg);
1152 add_phi_arg (new_phi, new_arg, new_edge);
1158 /* Wrapper for remap_decl so it can be used as a callback. */
1160 remap_decl_1 (tree decl, void *data)
1162 return remap_decl (decl, (copy_body_data *) data);
1165 /* Build struct function and associated datastructures for the new clone
1166 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1169 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1172 struct function *new_cfun
1173 = (struct function *) ggc_alloc_cleared (sizeof (struct function));
1174 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1175 int count_scale, frequency_scale;
1177 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1178 count_scale = (REG_BR_PROB_BASE * count
1179 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1183 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1184 frequency_scale = (REG_BR_PROB_BASE * frequency
1186 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1188 frequency_scale = count_scale;
1190 /* Register specific tree functions. */
1191 tree_register_cfg_hooks ();
1192 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
1193 new_cfun->funcdef_no = get_next_funcdef_no ();
1194 VALUE_HISTOGRAMS (new_cfun) = NULL;
1195 new_cfun->unexpanded_var_list = NULL;
1196 new_cfun->cfg = NULL;
1197 new_cfun->decl = new_fndecl /*= copy_node (callee_fndecl)*/;
1198 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
1199 push_cfun (new_cfun);
1200 init_empty_tree_cfg ();
1202 ENTRY_BLOCK_PTR->count =
1203 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1205 ENTRY_BLOCK_PTR->frequency =
1206 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1207 frequency_scale / REG_BR_PROB_BASE);
1208 EXIT_BLOCK_PTR->count =
1209 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1211 EXIT_BLOCK_PTR->frequency =
1212 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1213 frequency_scale / REG_BR_PROB_BASE);
1215 init_eh_for_function ();
1217 if (src_cfun->gimple_df)
1220 cfun->gimple_df->in_ssa_p = true;
1221 init_ssa_operands ();
1226 /* Make a copy of the body of FN so that it can be inserted inline in
1227 another function. Walks FN via CFG, returns new fndecl. */
1230 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1231 basic_block entry_block_map, basic_block exit_block_map)
1233 tree callee_fndecl = id->src_fn;
1234 /* Original cfun for the callee, doesn't change. */
1235 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1236 struct function *cfun_to_copy;
1238 tree new_fndecl = NULL;
1239 int count_scale, frequency_scale;
1242 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1243 count_scale = (REG_BR_PROB_BASE * count
1244 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1248 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1249 frequency_scale = (REG_BR_PROB_BASE * frequency
1251 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1253 frequency_scale = count_scale;
1255 /* Register specific tree functions. */
1256 tree_register_cfg_hooks ();
1258 /* Must have a CFG here at this point. */
1259 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1260 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1262 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1265 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1266 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1267 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1268 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1270 /* Duplicate any exception-handling regions. */
1273 id->eh_region_offset
1274 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1277 /* Use aux pointers to map the original blocks to copy. */
1278 FOR_EACH_BB_FN (bb, cfun_to_copy)
1280 basic_block new = copy_bb (id, bb, frequency_scale, count_scale);
1285 last = last_basic_block;
1286 /* Now that we've duplicated the blocks, duplicate their edges. */
1287 FOR_ALL_BB_FN (bb, cfun_to_copy)
1288 copy_edges_for_bb (bb, count_scale);
1289 if (gimple_in_ssa_p (cfun))
1290 FOR_ALL_BB_FN (bb, cfun_to_copy)
1291 copy_phis_for_bb (bb, id);
1292 FOR_ALL_BB_FN (bb, cfun_to_copy)
1294 ((basic_block)bb->aux)->aux = NULL;
1297 /* Zero out AUX fields of newly created block during EH edge
1299 for (; last < last_basic_block; last++)
1300 BASIC_BLOCK (last)->aux = NULL;
1301 entry_block_map->aux = NULL;
1302 exit_block_map->aux = NULL;
1307 /* Make a copy of the body of FN so that it can be inserted inline in
1308 another function. */
1311 copy_generic_body (copy_body_data *id)
1314 tree fndecl = id->src_fn;
1316 body = DECL_SAVED_TREE (fndecl);
1317 walk_tree (&body, copy_body_r, id, NULL);
1323 copy_body (copy_body_data *id, gcov_type count, int frequency,
1324 basic_block entry_block_map, basic_block exit_block_map)
1326 tree fndecl = id->src_fn;
1329 /* If this body has a CFG, walk CFG and copy. */
1330 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
1331 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
1336 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1337 defined in function FN, or of a data member thereof. */
1340 self_inlining_addr_expr (tree value, tree fn)
1344 if (TREE_CODE (value) != ADDR_EXPR)
1347 var = get_base_address (TREE_OPERAND (value, 0));
1349 return var && auto_var_in_fn_p (var, fn);
1353 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
1354 basic_block bb, tree *vars)
1360 tree def = (gimple_in_ssa_p (cfun)
1361 ? gimple_default_def (id->src_cfun, p) : NULL);
1364 && value != error_mark_node
1365 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
1366 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
1368 /* If the parameter is never assigned to, has no SSA_NAMEs created,
1369 we may not need to create a new variable here at all. Instead, we may
1370 be able to just use the argument value. */
1371 if (TREE_READONLY (p)
1372 && !TREE_ADDRESSABLE (p)
1373 && value && !TREE_SIDE_EFFECTS (value)
1376 /* We may produce non-gimple trees by adding NOPs or introduce
1377 invalid sharing when operand is not really constant.
1378 It is not big deal to prohibit constant propagation here as
1379 we will constant propagate in DOM1 pass anyway. */
1380 if (is_gimple_min_invariant (value)
1381 && useless_type_conversion_p (TREE_TYPE (p),
1383 /* We have to be very careful about ADDR_EXPR. Make sure
1384 the base variable isn't a local variable of the inlined
1385 function, e.g., when doing recursive inlining, direct or
1386 mutually-recursive or whatever, which is why we don't
1387 just test whether fn == current_function_decl. */
1388 && ! self_inlining_addr_expr (value, fn))
1390 insert_decl_map (id, p, value);
1395 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1396 here since the type of this decl must be visible to the calling
1398 var = copy_decl_to_var (p, id);
1399 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
1402 add_referenced_var (var);
1405 /* See if the frontend wants to pass this by invisible reference. If
1406 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1407 replace uses of the PARM_DECL with dereferences. */
1408 if (TREE_TYPE (var) != TREE_TYPE (p)
1409 && POINTER_TYPE_P (TREE_TYPE (var))
1410 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1412 insert_decl_map (id, var, var);
1413 var_sub = build_fold_indirect_ref (var);
1418 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1419 that way, when the PARM_DECL is encountered, it will be
1420 automatically replaced by the VAR_DECL. */
1421 insert_decl_map (id, p, var_sub);
1423 /* Declare this new variable. */
1424 TREE_CHAIN (var) = *vars;
1427 /* Make gimplifier happy about this variable. */
1428 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1430 /* Even if P was TREE_READONLY, the new VAR should not be.
1431 In the original code, we would have constructed a
1432 temporary, and then the function body would have never
1433 changed the value of P. However, now, we will be
1434 constructing VAR directly. The constructor body may
1435 change its value multiple times as it is being
1436 constructed. Therefore, it must not be TREE_READONLY;
1437 the back-end assumes that TREE_READONLY variable is
1438 assigned to only once. */
1439 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1440 TREE_READONLY (var) = 0;
1442 /* If there is no setup required and we are in SSA, take the easy route
1443 replacing all SSA names representing the function parameter by the
1444 SSA name passed to function.
1446 We need to construct map for the variable anyway as it might be used
1447 in different SSA names when parameter is set in function.
1449 FIXME: This usually kills the last connection in between inlined
1450 function parameter and the actual value in debug info. Can we do
1451 better here? If we just inserted the statement, copy propagation
1452 would kill it anyway as it always did in older versions of GCC.
1454 We might want to introduce a notion that single SSA_NAME might
1455 represent multiple variables for purposes of debugging. */
1456 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
1457 && (TREE_CODE (rhs) == SSA_NAME
1458 || is_gimple_min_invariant (rhs))
1459 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1461 insert_decl_map (id, def, rhs);
1465 /* Initialize this VAR_DECL from the equivalent argument. Convert
1466 the argument to the proper type in case it was promoted. */
1469 block_stmt_iterator bsi = bsi_last (bb);
1471 if (rhs == error_mark_node)
1473 insert_decl_map (id, p, var_sub);
1477 STRIP_USELESS_TYPE_CONVERSION (rhs);
1479 /* We want to use GIMPLE_MODIFY_STMT, not INIT_EXPR here so that we
1480 keep our trees in gimple form. */
1481 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
1483 def = remap_ssa_name (def, id);
1484 init_stmt = build_gimple_modify_stmt (def, rhs);
1485 SSA_NAME_DEF_STMT (def) = init_stmt;
1486 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
1487 set_default_def (var, NULL);
1490 init_stmt = build_gimple_modify_stmt (var, rhs);
1492 /* If we did not create a gimple value and we did not create a gimple
1493 cast of a gimple value, then we will need to gimplify INIT_STMTS
1494 at the end. Note that is_gimple_cast only checks the outer
1495 tree code, not its operand. Thus the explicit check that its
1496 operand is a gimple value. */
1497 if ((!is_gimple_val (rhs)
1498 && (!is_gimple_cast (rhs)
1499 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1500 || !is_gimple_reg (var))
1502 tree_stmt_iterator i;
1504 push_gimplify_context ();
1505 gimplify_stmt (&init_stmt);
1506 if (gimple_in_ssa_p (cfun)
1507 && init_stmt && TREE_CODE (init_stmt) == STATEMENT_LIST)
1509 /* The replacement can expose previously unreferenced
1511 for (i = tsi_start (init_stmt); !tsi_end_p (i); tsi_next (&i))
1512 find_new_referenced_vars (tsi_stmt_ptr (i));
1514 pop_gimplify_context (NULL);
1517 /* If VAR represents a zero-sized variable, it's possible that the
1518 assignment statment may result in no gimple statements. */
1520 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1521 if (gimple_in_ssa_p (cfun))
1522 for (;!bsi_end_p (bsi); bsi_next (&bsi))
1523 mark_symbols_for_renaming (bsi_stmt (bsi));
1527 /* Generate code to initialize the parameters of the function at the
1528 top of the stack in ID from the CALL_EXPR EXP. */
1531 initialize_inlined_parameters (copy_body_data *id, tree exp,
1532 tree fn, basic_block bb)
1537 tree vars = NULL_TREE;
1538 call_expr_arg_iterator iter;
1539 tree static_chain = CALL_EXPR_STATIC_CHAIN (exp);
1541 /* Figure out what the parameters are. */
1542 parms = DECL_ARGUMENTS (fn);
1544 /* Loop through the parameter declarations, replacing each with an
1545 equivalent VAR_DECL, appropriately initialized. */
1546 for (p = parms, a = first_call_expr_arg (exp, &iter); p;
1547 a = next_call_expr_arg (&iter), p = TREE_CHAIN (p))
1548 setup_one_parameter (id, p, a, fn, bb, &vars);
1550 /* Initialize the static chain. */
1551 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1552 gcc_assert (fn != current_function_decl);
1555 /* No static chain? Seems like a bug in tree-nested.c. */
1556 gcc_assert (static_chain);
1558 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1561 declare_inline_vars (id->block, vars);
1564 /* Declare a return variable to replace the RESULT_DECL for the
1565 function we are calling. An appropriate DECL_STMT is returned.
1566 The USE_STMT is filled to contain a use of the declaration to
1567 indicate the return value of the function.
1569 RETURN_SLOT, if non-null is place where to store the result. It
1570 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
1571 was the LHS of the GIMPLE_MODIFY_STMT to which this call is the RHS.
1573 The return value is a (possibly null) value that is the result of the
1574 function as seen by the callee. *USE_P is a (possibly null) value that
1575 holds the result as seen by the caller. */
1578 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
1581 tree callee = id->src_fn;
1582 tree caller = id->dst_fn;
1583 tree result = DECL_RESULT (callee);
1584 tree callee_type = TREE_TYPE (result);
1585 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1588 /* We don't need to do anything for functions that don't return
1590 if (!result || VOID_TYPE_P (callee_type))
1596 /* If there was a return slot, then the return value is the
1597 dereferenced address of that object. */
1600 /* The front end shouldn't have used both return_slot and
1601 a modify expression. */
1602 gcc_assert (!modify_dest);
1603 if (DECL_BY_REFERENCE (result))
1605 tree return_slot_addr = build_fold_addr_expr (return_slot);
1606 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
1608 /* We are going to construct *&return_slot and we can't do that
1609 for variables believed to be not addressable.
1611 FIXME: This check possibly can match, because values returned
1612 via return slot optimization are not believed to have address
1613 taken by alias analysis. */
1614 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
1615 if (gimple_in_ssa_p (cfun))
1617 HOST_WIDE_INT bitsize;
1618 HOST_WIDE_INT bitpos;
1620 enum machine_mode mode;
1624 base = get_inner_reference (return_slot, &bitsize, &bitpos,
1626 &mode, &unsignedp, &volatilep,
1628 if (TREE_CODE (base) == INDIRECT_REF)
1629 base = TREE_OPERAND (base, 0);
1630 if (TREE_CODE (base) == SSA_NAME)
1631 base = SSA_NAME_VAR (base);
1632 mark_sym_for_renaming (base);
1634 var = return_slot_addr;
1639 gcc_assert (TREE_CODE (var) != SSA_NAME);
1641 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1642 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1643 && !DECL_GIMPLE_REG_P (result)
1645 DECL_GIMPLE_REG_P (var) = 0;
1650 /* All types requiring non-trivial constructors should have been handled. */
1651 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1653 /* Attempt to avoid creating a new temporary variable. */
1655 && TREE_CODE (modify_dest) != SSA_NAME)
1657 bool use_it = false;
1659 /* We can't use MODIFY_DEST if there's type promotion involved. */
1660 if (!useless_type_conversion_p (callee_type, caller_type))
1663 /* ??? If we're assigning to a variable sized type, then we must
1664 reuse the destination variable, because we've no good way to
1665 create variable sized temporaries at this point. */
1666 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1669 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1670 reuse it as the result of the call directly. Don't do this if
1671 it would promote MODIFY_DEST to addressable. */
1672 else if (TREE_ADDRESSABLE (result))
1676 tree base_m = get_base_address (modify_dest);
1678 /* If the base isn't a decl, then it's a pointer, and we don't
1679 know where that's going to go. */
1680 if (!DECL_P (base_m))
1682 else if (is_global_var (base_m))
1684 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1685 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1686 && !DECL_GIMPLE_REG_P (result)
1687 && DECL_GIMPLE_REG_P (base_m))
1689 else if (!TREE_ADDRESSABLE (base_m))
1701 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1703 var = copy_result_decl_to_var (result, id);
1704 if (gimple_in_ssa_p (cfun))
1707 add_referenced_var (var);
1710 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1711 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1712 = tree_cons (NULL_TREE, var,
1713 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1715 /* Do not have the rest of GCC warn about this variable as it should
1716 not be visible to the user. */
1717 TREE_NO_WARNING (var) = 1;
1719 declare_inline_vars (id->block, var);
1721 /* Build the use expr. If the return type of the function was
1722 promoted, convert it back to the expected type. */
1724 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
1725 use = fold_convert (caller_type, var);
1727 STRIP_USELESS_TYPE_CONVERSION (use);
1729 if (DECL_BY_REFERENCE (result))
1730 var = build_fold_addr_expr (var);
1733 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1734 way, when the RESULT_DECL is encountered, it will be
1735 automatically replaced by the VAR_DECL. */
1736 insert_decl_map (id, result, var);
1738 /* Remember this so we can ignore it in remap_decls. */
1745 /* Returns nonzero if a function can be inlined as a tree. */
1748 tree_inlinable_function_p (tree fn)
1750 return inlinable_function_p (fn);
1753 static const char *inline_forbidden_reason;
1756 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1760 tree fn = (tree) fnp;
1763 switch (TREE_CODE (node))
1766 /* Refuse to inline alloca call unless user explicitly forced so as
1767 this may change program's memory overhead drastically when the
1768 function using alloca is called in loop. In GCC present in
1769 SPEC2000 inlining into schedule_block cause it to require 2GB of
1770 RAM instead of 256MB. */
1771 if (alloca_call_p (node)
1772 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1774 inline_forbidden_reason
1775 = G_("function %q+F can never be inlined because it uses "
1776 "alloca (override using the always_inline attribute)");
1779 t = get_callee_fndecl (node);
1783 /* We cannot inline functions that call setjmp. */
1784 if (setjmp_call_p (t))
1786 inline_forbidden_reason
1787 = G_("function %q+F can never be inlined because it uses setjmp");
1791 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1792 switch (DECL_FUNCTION_CODE (t))
1794 /* We cannot inline functions that take a variable number of
1796 case BUILT_IN_VA_START:
1797 case BUILT_IN_STDARG_START:
1798 case BUILT_IN_NEXT_ARG:
1799 case BUILT_IN_VA_END:
1800 inline_forbidden_reason
1801 = G_("function %q+F can never be inlined because it "
1802 "uses variable argument lists");
1805 case BUILT_IN_LONGJMP:
1806 /* We can't inline functions that call __builtin_longjmp at
1807 all. The non-local goto machinery really requires the
1808 destination be in a different function. If we allow the
1809 function calling __builtin_longjmp to be inlined into the
1810 function calling __builtin_setjmp, Things will Go Awry. */
1811 inline_forbidden_reason
1812 = G_("function %q+F can never be inlined because "
1813 "it uses setjmp-longjmp exception handling");
1816 case BUILT_IN_NONLOCAL_GOTO:
1818 inline_forbidden_reason
1819 = G_("function %q+F can never be inlined because "
1820 "it uses non-local goto");
1823 case BUILT_IN_RETURN:
1824 case BUILT_IN_APPLY_ARGS:
1825 /* If a __builtin_apply_args caller would be inlined,
1826 it would be saving arguments of the function it has
1827 been inlined into. Similarly __builtin_return would
1828 return from the function the inline has been inlined into. */
1829 inline_forbidden_reason
1830 = G_("function %q+F can never be inlined because "
1831 "it uses __builtin_return or __builtin_apply_args");
1840 t = TREE_OPERAND (node, 0);
1842 /* We will not inline a function which uses computed goto. The
1843 addresses of its local labels, which may be tucked into
1844 global storage, are of course not constant across
1845 instantiations, which causes unexpected behavior. */
1846 if (TREE_CODE (t) != LABEL_DECL)
1848 inline_forbidden_reason
1849 = G_("function %q+F can never be inlined "
1850 "because it contains a computed goto");
1856 t = TREE_OPERAND (node, 0);
1857 if (DECL_NONLOCAL (t))
1859 /* We cannot inline a function that receives a non-local goto
1860 because we cannot remap the destination label used in the
1861 function that is performing the non-local goto. */
1862 inline_forbidden_reason
1863 = G_("function %q+F can never be inlined "
1864 "because it receives a non-local goto");
1871 /* We cannot inline a function of the form
1873 void F (int i) { struct S { int ar[i]; } s; }
1875 Attempting to do so produces a catch-22.
1876 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1877 UNION_TYPE nodes, then it goes into infinite recursion on a
1878 structure containing a pointer to its own type. If it doesn't,
1879 then the type node for S doesn't get adjusted properly when
1882 ??? This is likely no longer true, but it's too late in the 4.0
1883 cycle to try to find out. This should be checked for 4.1. */
1884 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1885 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1887 inline_forbidden_reason
1888 = G_("function %q+F can never be inlined "
1889 "because it uses variable sized variables");
1900 /* Return subexpression representing possible alloca call, if any. */
1902 inline_forbidden_p (tree fndecl)
1904 location_t saved_loc = input_location;
1905 block_stmt_iterator bsi;
1907 tree ret = NULL_TREE;
1909 FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
1910 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1912 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
1913 inline_forbidden_p_1, fndecl);
1919 input_location = saved_loc;
1923 /* Returns nonzero if FN is a function that does not have any
1924 fundamental inline blocking properties. */
1927 inlinable_function_p (tree fn)
1929 bool inlinable = true;
1933 /* If we've already decided this function shouldn't be inlined,
1934 there's no need to check again. */
1935 if (DECL_UNINLINABLE (fn))
1938 /* We only warn for functions declared `inline' by the user. */
1939 do_warning = (warn_inline
1941 && DECL_DECLARED_INLINE_P (fn)
1942 && !DECL_IN_SYSTEM_HEADER (fn));
1944 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
1946 if (flag_really_no_inline
1947 && always_inline == NULL)
1950 warning (OPT_Winline, "function %q+F can never be inlined because it "
1951 "is suppressed using -fno-inline", fn);
1955 /* Don't auto-inline anything that might not be bound within
1956 this unit of translation. */
1957 else if (!DECL_DECLARED_INLINE_P (fn)
1958 && DECL_REPLACEABLE_P (fn))
1961 else if (!function_attribute_inlinable_p (fn))
1964 warning (OPT_Winline, "function %q+F can never be inlined because it "
1965 "uses attributes conflicting with inlining", fn);
1969 /* If we don't have the function body available, we can't inline it.
1970 However, this should not be recorded since we also get here for
1971 forward declared inline functions. Therefore, return at once. */
1972 if (!DECL_SAVED_TREE (fn))
1975 /* If we're not inlining at all, then we cannot inline this function. */
1976 else if (!flag_inline_trees)
1979 /* Only try to inline functions if DECL_INLINE is set. This should be
1980 true for all functions declared `inline', and for all other functions
1981 as well with -finline-functions.
1983 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1984 it's the front-end that must set DECL_INLINE in this case, because
1985 dwarf2out loses if a function that does not have DECL_INLINE set is
1986 inlined anyway. That is why we have both DECL_INLINE and
1987 DECL_DECLARED_INLINE_P. */
1988 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1989 here should be redundant. */
1990 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
1993 else if (inline_forbidden_p (fn))
1995 /* See if we should warn about uninlinable functions. Previously,
1996 some of these warnings would be issued while trying to expand
1997 the function inline, but that would cause multiple warnings
1998 about functions that would for example call alloca. But since
1999 this a property of the function, just one warning is enough.
2000 As a bonus we can now give more details about the reason why a
2001 function is not inlinable. */
2003 sorry (inline_forbidden_reason, fn);
2004 else if (do_warning)
2005 warning (OPT_Winline, inline_forbidden_reason, fn);
2010 /* Squirrel away the result so that we don't have to check again. */
2011 DECL_UNINLINABLE (fn) = !inlinable;
2016 /* Estimate the cost of a memory move. Use machine dependent
2017 word size and take possible memcpy call into account. */
2020 estimate_move_cost (tree type)
2024 size = int_size_in_bytes (type);
2026 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
2027 /* Cost of a memcpy call, 3 arguments and the call. */
2030 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
2033 /* Arguments for estimate_num_insns_1. */
2037 /* Used to return the number of insns. */
2040 /* Weights of various constructs. */
2041 eni_weights *weights;
2044 /* Used by estimate_num_insns. Estimate number of instructions seen
2045 by given statement. */
2048 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
2050 struct eni_data *d = data;
2054 if (IS_TYPE_OR_DECL_P (x))
2059 /* Assume that constants and references counts nothing. These should
2060 be majorized by amount of operations among them we count later
2061 and are common target of CSE and similar optimizations. */
2062 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
2065 switch (TREE_CODE (x))
2067 /* Containers have no cost. */
2074 case ALIGN_INDIRECT_REF:
2075 case MISALIGNED_INDIRECT_REF:
2077 case ARRAY_RANGE_REF:
2079 case EXC_PTR_EXPR: /* ??? */
2080 case FILTER_EXPR: /* ??? */
2083 case WITH_CLEANUP_EXPR:
2086 case VIEW_CONVERT_EXPR:
2091 case CASE_LABEL_EXPR:
2094 case EH_FILTER_EXPR:
2095 case STATEMENT_LIST:
2097 case NON_LVALUE_EXPR:
2100 case TRY_CATCH_EXPR:
2101 case TRY_FINALLY_EXPR:
2108 case WITH_SIZE_EXPR:
2112 case OMP_SECTIONS_SWITCH:
2115 /* We don't account constants for now. Assume that the cost is amortized
2116 by operations that do use them. We may re-consider this decision once
2117 we are able to optimize the tree before estimating its size and break
2118 out static initializers. */
2119 case IDENTIFIER_NODE:
2129 /* CHANGE_DYNAMIC_TYPE_EXPR explicitly expands to nothing. */
2130 case CHANGE_DYNAMIC_TYPE_EXPR:
2134 /* Try to estimate the cost of assignments. We have three cases to
2136 1) Simple assignments to registers;
2137 2) Stores to things that must live in memory. This includes
2138 "normal" stores to scalars, but also assignments of large
2139 structures, or constructors of big arrays;
2142 Let us look at the first two cases, assuming we have "a = b + C":
2143 <GIMPLE_MODIFY_STMT <var_decl "a">
2144 <plus_expr <var_decl "b"> <constant C>>
2145 If "a" is a GIMPLE register, the assignment to it is free on almost
2146 any target, because "a" usually ends up in a real register. Hence
2147 the only cost of this expression comes from the PLUS_EXPR, and we
2148 can ignore the GIMPLE_MODIFY_STMT.
2149 If "a" is not a GIMPLE register, the assignment to "a" will most
2150 likely be a real store, so the cost of the GIMPLE_MODIFY_STMT is the cost
2151 of moving something into "a", which we compute using the function
2154 The third case deals with TARGET_EXPRs, for which the semantics are
2155 that a temporary is assigned, unless the TARGET_EXPR itself is being
2156 assigned to something else. In the latter case we do not need the
2158 <GIMPLE_MODIFY_STMT <var_decl "a"> <target_expr>>, the
2159 GIMPLE_MODIFY_STMT is free. */
2161 case GIMPLE_MODIFY_STMT:
2162 /* Is the right and side a TARGET_EXPR? */
2163 if (TREE_CODE (GENERIC_TREE_OPERAND (x, 1)) == TARGET_EXPR)
2165 /* ... fall through ... */
2168 x = GENERIC_TREE_OPERAND (x, 0);
2169 /* Is this an assignments to a register? */
2170 if (is_gimple_reg (x))
2172 /* Otherwise it's a store, so fall through to compute the move cost. */
2175 d->count += estimate_move_cost (TREE_TYPE (x));
2178 /* Assign cost of 1 to usual operations.
2179 ??? We may consider mapping RTL costs to this. */
2184 case POINTER_PLUS_EXPR:
2188 case FIXED_CONVERT_EXPR:
2189 case FIX_TRUNC_EXPR:
2201 case VEC_LSHIFT_EXPR:
2202 case VEC_RSHIFT_EXPR:
2209 case TRUTH_ANDIF_EXPR:
2210 case TRUTH_ORIF_EXPR:
2211 case TRUTH_AND_EXPR:
2213 case TRUTH_XOR_EXPR:
2214 case TRUTH_NOT_EXPR:
2223 case UNORDERED_EXPR:
2234 case PREDECREMENT_EXPR:
2235 case PREINCREMENT_EXPR:
2236 case POSTDECREMENT_EXPR:
2237 case POSTINCREMENT_EXPR:
2241 case REALIGN_LOAD_EXPR:
2243 case REDUC_MAX_EXPR:
2244 case REDUC_MIN_EXPR:
2245 case REDUC_PLUS_EXPR:
2246 case WIDEN_SUM_EXPR:
2248 case VEC_WIDEN_MULT_HI_EXPR:
2249 case VEC_WIDEN_MULT_LO_EXPR:
2250 case VEC_UNPACK_HI_EXPR:
2251 case VEC_UNPACK_LO_EXPR:
2252 case VEC_UNPACK_FLOAT_HI_EXPR:
2253 case VEC_UNPACK_FLOAT_LO_EXPR:
2254 case VEC_PACK_TRUNC_EXPR:
2255 case VEC_PACK_SAT_EXPR:
2256 case VEC_PACK_FIX_TRUNC_EXPR:
2258 case WIDEN_MULT_EXPR:
2260 case VEC_EXTRACT_EVEN_EXPR:
2261 case VEC_EXTRACT_ODD_EXPR:
2262 case VEC_INTERLEAVE_HIGH_EXPR:
2263 case VEC_INTERLEAVE_LOW_EXPR:
2270 /* TODO: Cost of a switch should be derived from the number of
2272 d->count += d->weights->switch_cost;
2275 /* Few special cases of expensive operations. This is useful
2276 to avoid inlining on functions having too many of these. */
2277 case TRUNC_DIV_EXPR:
2279 case FLOOR_DIV_EXPR:
2280 case ROUND_DIV_EXPR:
2281 case EXACT_DIV_EXPR:
2282 case TRUNC_MOD_EXPR:
2284 case FLOOR_MOD_EXPR:
2285 case ROUND_MOD_EXPR:
2287 d->count += d->weights->div_mod_cost;
2291 tree decl = get_callee_fndecl (x);
2293 cost = d->weights->call_cost;
2294 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
2295 switch (DECL_FUNCTION_CODE (decl))
2297 case BUILT_IN_CONSTANT_P:
2300 case BUILT_IN_EXPECT:
2302 /* Prefetch instruction is not expensive. */
2303 case BUILT_IN_PREFETCH:
2310 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
2311 that does use function declaration to figure out the arguments. */
2315 call_expr_arg_iterator iter;
2316 FOR_EACH_CALL_EXPR_ARG (a, iter, x)
2317 d->count += estimate_move_cost (TREE_TYPE (a));
2322 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2323 d->count += estimate_move_cost (TREE_TYPE (arg));
2339 /* OpenMP directives are generally very expensive. */
2340 d->count += d->weights->omp_cost;
2349 /* Estimate number of instructions that will be created by expanding EXPR.
2350 WEIGHTS contains weights attributed to various constructs. */
2353 estimate_num_insns (tree expr, eni_weights *weights)
2355 struct pointer_set_t *visited_nodes;
2357 block_stmt_iterator bsi;
2358 struct function *my_function;
2359 struct eni_data data;
2362 data.weights = weights;
2364 /* If we're given an entire function, walk the CFG. */
2365 if (TREE_CODE (expr) == FUNCTION_DECL)
2367 my_function = DECL_STRUCT_FUNCTION (expr);
2368 gcc_assert (my_function && my_function->cfg);
2369 visited_nodes = pointer_set_create ();
2370 FOR_EACH_BB_FN (bb, my_function)
2372 for (bsi = bsi_start (bb);
2376 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
2377 &data, visited_nodes);
2380 pointer_set_destroy (visited_nodes);
2383 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &data);
2388 /* Initializes weights used by estimate_num_insns. */
2391 init_inline_once (void)
2393 eni_inlining_weights.call_cost = PARAM_VALUE (PARAM_INLINE_CALL_COST);
2394 eni_inlining_weights.div_mod_cost = 10;
2395 eni_inlining_weights.switch_cost = 1;
2396 eni_inlining_weights.omp_cost = 40;
2398 eni_size_weights.call_cost = 1;
2399 eni_size_weights.div_mod_cost = 1;
2400 eni_size_weights.switch_cost = 10;
2401 eni_size_weights.omp_cost = 40;
2403 /* Estimating time for call is difficult, since we have no idea what the
2404 called function does. In the current uses of eni_time_weights,
2405 underestimating the cost does less harm than overestimating it, so
2406 we choose a rather small value here. */
2407 eni_time_weights.call_cost = 10;
2408 eni_time_weights.div_mod_cost = 10;
2409 eni_time_weights.switch_cost = 4;
2410 eni_time_weights.omp_cost = 40;
2413 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
2415 add_lexical_block (tree current_block, tree new_block)
2419 /* Walk to the last sub-block. */
2420 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
2422 blk_p = &TREE_CHAIN (*blk_p))
2425 BLOCK_SUPERCONTEXT (new_block) = current_block;
2428 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
2431 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
2437 struct pointer_map_t *st;
2440 location_t saved_location;
2441 struct cgraph_edge *cg_edge;
2443 basic_block return_block;
2445 block_stmt_iterator bsi, stmt_bsi;
2446 bool successfully_inlined = FALSE;
2447 bool purge_dead_abnormal_edges;
2451 /* See what we've got. */
2452 id = (copy_body_data *) data;
2455 /* Set input_location here so we get the right instantiation context
2456 if we call instantiate_decl from inlinable_function_p. */
2457 saved_location = input_location;
2458 if (EXPR_HAS_LOCATION (t))
2459 input_location = EXPR_LOCATION (t);
2461 /* From here on, we're only interested in CALL_EXPRs. */
2462 if (TREE_CODE (t) != CALL_EXPR)
2465 /* First, see if we can figure out what function is being called.
2466 If we cannot, then there is no hope of inlining the function. */
2467 fn = get_callee_fndecl (t);
2471 /* Turn forward declarations into real ones. */
2472 fn = cgraph_node (fn)->decl;
2474 /* If fn is a declaration of a function in a nested scope that was
2475 globally declared inline, we don't set its DECL_INITIAL.
2476 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
2477 C++ front-end uses it for cdtors to refer to their internal
2478 declarations, that are not real functions. Fortunately those
2479 don't have trees to be saved, so we can tell by checking their
2481 if (! DECL_INITIAL (fn)
2482 && DECL_ABSTRACT_ORIGIN (fn)
2483 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
2484 fn = DECL_ABSTRACT_ORIGIN (fn);
2486 /* Objective C and fortran still calls tree_rest_of_compilation directly.
2487 Kill this check once this is fixed. */
2488 if (!id->dst_node->analyzed)
2491 cg_edge = cgraph_edge (id->dst_node, stmt);
2493 /* Constant propagation on argument done during previous inlining
2494 may create new direct call. Produce an edge for it. */
2497 struct cgraph_node *dest = cgraph_node (fn);
2499 /* We have missing edge in the callgraph. This can happen in one case
2500 where previous inlining turned indirect call into direct call by
2501 constant propagating arguments. In all other cases we hit a bug
2502 (incorrect node sharing is most common reason for missing edges. */
2503 gcc_assert (dest->needed || !flag_unit_at_a_time);
2504 cgraph_create_edge (id->dst_node, dest, stmt,
2505 bb->count, CGRAPH_FREQ_BASE,
2506 bb->loop_depth)->inline_failed
2507 = N_("originally indirect function call not considered for inlining");
2510 fprintf (dump_file, "Created new direct edge to %s",
2511 cgraph_node_name (dest));
2516 /* Don't try to inline functions that are not well-suited to
2518 if (!cgraph_inline_p (cg_edge, &reason))
2520 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
2521 /* Avoid warnings during early inline pass. */
2522 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2524 sorry ("inlining failed in call to %q+F: %s", fn, reason);
2525 sorry ("called from here");
2527 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
2528 && !DECL_IN_SYSTEM_HEADER (fn)
2530 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
2531 /* Avoid warnings during early inline pass. */
2532 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2534 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
2536 warning (OPT_Winline, "called from here");
2540 fn = cg_edge->callee->decl;
2542 #ifdef ENABLE_CHECKING
2543 if (cg_edge->callee->decl != id->dst_node->decl)
2544 verify_cgraph_node (cg_edge->callee);
2547 /* We will be inlining this callee. */
2548 id->eh_region = lookup_stmt_eh_region (stmt);
2550 /* Split the block holding the CALL_EXPR. */
2551 e = split_block (bb, stmt);
2553 return_block = e->dest;
2556 /* split_block splits after the statement; work around this by
2557 moving the call into the second block manually. Not pretty,
2558 but seems easier than doing the CFG manipulation by hand
2559 when the CALL_EXPR is in the last statement of BB. */
2560 stmt_bsi = bsi_last (bb);
2561 bsi_remove (&stmt_bsi, false);
2563 /* If the CALL_EXPR was in the last statement of BB, it may have
2564 been the source of abnormal edges. In this case, schedule
2565 the removal of dead abnormal edges. */
2566 bsi = bsi_start (return_block);
2567 if (bsi_end_p (bsi))
2569 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2570 purge_dead_abnormal_edges = true;
2574 bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
2575 purge_dead_abnormal_edges = false;
2578 stmt_bsi = bsi_start (return_block);
2580 /* Build a block containing code to initialize the arguments, the
2581 actual inline expansion of the body, and a label for the return
2582 statements within the function to jump to. The type of the
2583 statement expression is the return type of the function call. */
2584 id->block = make_node (BLOCK);
2585 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2586 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2587 add_lexical_block (TREE_BLOCK (stmt), id->block);
2589 /* Local declarations will be replaced by their equivalents in this
2592 id->decl_map = pointer_map_create ();
2594 /* Record the function we are about to inline. */
2596 id->src_node = cg_edge->callee;
2597 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
2600 initialize_inlined_parameters (id, t, fn, bb);
2602 if (DECL_INITIAL (fn))
2603 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2605 /* Return statements in the function body will be replaced by jumps
2606 to the RET_LABEL. */
2608 gcc_assert (DECL_INITIAL (fn));
2609 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2611 /* Find the lhs to which the result of this call is assigned. */
2613 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
2615 modify_dest = GIMPLE_STMT_OPERAND (stmt, 0);
2617 /* The function which we are inlining might not return a value,
2618 in which case we should issue a warning that the function
2619 does not return a value. In that case the optimizers will
2620 see that the variable to which the value is assigned was not
2621 initialized. We do not want to issue a warning about that
2622 uninitialized variable. */
2623 if (DECL_P (modify_dest))
2624 TREE_NO_WARNING (modify_dest) = 1;
2625 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2627 return_slot = modify_dest;
2634 /* Declare the return variable for the function. */
2635 declare_return_variable (id, return_slot,
2636 modify_dest, &use_retvar);
2638 /* This is it. Duplicate the callee body. Assume callee is
2639 pre-gimplified. Note that we must not alter the caller
2640 function in any way before this point, as this CALL_EXPR may be
2641 a self-referential call; if we're calling ourselves, we need to
2642 duplicate our body before altering anything. */
2643 copy_body (id, bb->count, bb->frequency, bb, return_block);
2645 /* Add local vars in this inlined callee to caller. */
2646 t_step = id->src_cfun->unexpanded_var_list;
2647 for (; t_step; t_step = TREE_CHAIN (t_step))
2649 var = TREE_VALUE (t_step);
2650 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2651 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2652 cfun->unexpanded_var_list);
2654 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2655 cfun->unexpanded_var_list);
2659 pointer_map_destroy (id->decl_map);
2662 /* If the inlined function returns a result that we care about,
2663 clobber the CALL_EXPR with a reference to the return variable. */
2664 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2667 if (gimple_in_ssa_p (cfun))
2670 mark_symbols_for_renaming (stmt);
2672 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2675 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2676 tsi_delink() will leave the iterator in a sane state. */
2678 /* Handle case of inlining function that miss return statement so
2679 return value becomes undefined. */
2680 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
2681 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 0)) == SSA_NAME)
2683 tree name = TREE_OPERAND (stmt, 0);
2684 tree var = SSA_NAME_VAR (TREE_OPERAND (stmt, 0));
2685 tree def = gimple_default_def (cfun, var);
2687 /* If the variable is used undefined, make this name undefined via
2691 TREE_OPERAND (stmt, 1) = def;
2694 /* Otherwise make this variable undefined. */
2697 bsi_remove (&stmt_bsi, true);
2698 set_default_def (var, name);
2699 SSA_NAME_DEF_STMT (name) = build_empty_stmt ();
2703 bsi_remove (&stmt_bsi, true);
2706 if (purge_dead_abnormal_edges)
2707 tree_purge_dead_abnormal_call_edges (return_block);
2709 /* If the value of the new expression is ignored, that's OK. We
2710 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2711 the equivalent inlined version either. */
2712 TREE_USED (*tp) = 1;
2714 /* Output the inlining info for this abstract function, since it has been
2715 inlined. If we don't do this now, we can lose the information about the
2716 variables in the function when the blocks get blown away as soon as we
2717 remove the cgraph node. */
2718 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2720 /* Update callgraph if needed. */
2721 cgraph_remove_node (cg_edge->callee);
2723 id->block = NULL_TREE;
2724 successfully_inlined = TRUE;
2727 input_location = saved_location;
2728 return successfully_inlined;
2731 /* Expand call statements reachable from STMT_P.
2732 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2733 in a GIMPLE_MODIFY_STMT. See tree-gimple.c:get_call_expr_in(). We can
2734 unfortunately not use that function here because we need a pointer
2735 to the CALL_EXPR, not the tree itself. */
2738 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2740 block_stmt_iterator bsi;
2742 /* Register specific tree functions. */
2743 tree_register_cfg_hooks ();
2744 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2746 tree *expr_p = bsi_stmt_ptr (bsi);
2747 tree stmt = *expr_p;
2749 if (TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT)
2750 expr_p = &GIMPLE_STMT_OPERAND (*expr_p, 1);
2751 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2752 expr_p = &TREE_OPERAND (*expr_p, 0);
2753 if (TREE_CODE (*expr_p) == CALL_EXPR)
2754 if (expand_call_inline (bb, stmt, expr_p, id))
2760 /* Walk all basic blocks created after FIRST and try to fold every statement
2761 in the STATEMENTS pointer set. */
2763 fold_marked_statements (int first, struct pointer_set_t *statements)
2765 for (;first < n_basic_blocks;first++)
2766 if (BASIC_BLOCK (first))
2768 block_stmt_iterator bsi;
2769 for (bsi = bsi_start (BASIC_BLOCK (first));
2770 !bsi_end_p (bsi); bsi_next (&bsi))
2771 if (pointer_set_contains (statements, bsi_stmt (bsi)))
2773 tree old_stmt = bsi_stmt (bsi);
2774 if (fold_stmt (bsi_stmt_ptr (bsi)))
2776 update_stmt (bsi_stmt (bsi));
2777 if (maybe_clean_or_replace_eh_stmt (old_stmt, bsi_stmt (bsi)))
2778 tree_purge_dead_eh_edges (BASIC_BLOCK (first));
2784 /* Return true if BB has at least one abnormal outgoing edge. */
2787 has_abnormal_outgoing_edge_p (basic_block bb)
2792 FOR_EACH_EDGE (e, ei, bb->succs)
2793 if (e->flags & EDGE_ABNORMAL)
2799 /* When a block from the inlined function contains a call with side-effects
2800 in the middle gets inlined in a function with non-locals labels, the call
2801 becomes a potential non-local goto so we need to add appropriate edge. */
2804 make_nonlocal_label_edges (void)
2806 block_stmt_iterator bsi;
2811 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2813 tree stmt = bsi_stmt (bsi);
2814 if (tree_can_make_abnormal_goto (stmt))
2816 if (stmt == bsi_stmt (bsi_last (bb)))
2818 if (!has_abnormal_outgoing_edge_p (bb))
2819 make_abnormal_goto_edges (bb, true);
2823 edge e = split_block (bb, stmt);
2825 make_abnormal_goto_edges (bb, true);
2830 /* Update PHIs on nonlocal goto receivers we (possibly)
2831 just created new edges into. */
2832 if (TREE_CODE (stmt) == LABEL_EXPR
2833 && gimple_in_ssa_p (cfun))
2835 tree target = LABEL_EXPR_LABEL (stmt);
2836 if (DECL_NONLOCAL (target))
2840 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
2842 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
2843 (PHI_RESULT (phi)));
2844 mark_sym_for_renaming
2845 (SSA_NAME_VAR (PHI_RESULT (phi)));
2853 /* Expand calls to inline functions in the body of FN. */
2856 optimize_inline_calls (tree fn)
2861 int last = n_basic_blocks;
2862 /* There is no point in performing inlining if errors have already
2863 occurred -- and we might crash if we try to inline invalid
2865 if (errorcount || sorrycount)
2869 memset (&id, 0, sizeof (id));
2871 id.src_node = id.dst_node = cgraph_node (fn);
2873 /* Or any functions that aren't finished yet. */
2874 prev_fn = NULL_TREE;
2875 if (current_function_decl)
2877 id.dst_fn = current_function_decl;
2878 prev_fn = current_function_decl;
2881 id.copy_decl = copy_decl_maybe_to_var;
2882 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2883 id.transform_new_cfg = false;
2884 id.transform_return_to_modify = true;
2885 id.transform_lang_insert_block = false;
2886 id.statements_to_fold = pointer_set_create ();
2888 push_gimplify_context ();
2890 /* We make no attempts to keep dominance info up-to-date. */
2891 free_dominance_info (CDI_DOMINATORS);
2892 free_dominance_info (CDI_POST_DOMINATORS);
2894 /* Reach the trees by walking over the CFG, and note the
2895 enclosing basic-blocks in the call edges. */
2896 /* We walk the blocks going forward, because inlined function bodies
2897 will split id->current_basic_block, and the new blocks will
2898 follow it; we'll trudge through them, processing their CALL_EXPRs
2901 gimple_expand_calls_inline (bb, &id);
2903 pop_gimplify_context (NULL);
2905 #ifdef ENABLE_CHECKING
2907 struct cgraph_edge *e;
2909 verify_cgraph_node (id.dst_node);
2911 /* Double check that we inlined everything we are supposed to inline. */
2912 for (e = id.dst_node->callees; e; e = e->next_callee)
2913 gcc_assert (e->inline_failed);
2917 /* Fold the statements before compacting/renumbering the basic blocks. */
2918 fold_marked_statements (last, id.statements_to_fold);
2919 pointer_set_destroy (id.statements_to_fold);
2921 /* Renumber the (code) basic_blocks consecutively. */
2923 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2926 /* We are not going to maintain the cgraph edges up to date.
2927 Kill it so it won't confuse us. */
2928 cgraph_node_remove_callees (id.dst_node);
2930 fold_cond_expr_cond ();
2931 if (current_function_has_nonlocal_label)
2932 make_nonlocal_label_edges ();
2933 /* It would be nice to check SSA/CFG/statement consistency here, but it is
2934 not possible yet - the IPA passes might make various functions to not
2935 throw and they don't care to proactively update local EH info. This is
2936 done later in fixup_cfg pass that also execute the verification. */
2937 return (TODO_update_ssa | TODO_cleanup_cfg
2938 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
2939 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
2942 /* FN is a function that has a complete body, and CLONE is a function whose
2943 body is to be set to a copy of FN, mapping argument declarations according
2944 to the ARG_MAP splay_tree. */
2947 clone_body (tree clone, tree fn, void *arg_map)
2951 /* Clone the body, as if we were making an inline call. But, remap the
2952 parameters in the callee to the parameters of caller. */
2953 memset (&id, 0, sizeof (id));
2956 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
2957 id.decl_map = (struct pointer_map_t *)arg_map;
2959 id.copy_decl = copy_decl_no_change;
2960 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2961 id.transform_new_cfg = true;
2962 id.transform_return_to_modify = false;
2963 id.transform_lang_insert_block = true;
2965 /* We're not inside any EH region. */
2968 /* Actually copy the body. */
2969 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
2972 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2975 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2977 enum tree_code code = TREE_CODE (*tp);
2978 enum tree_code_class cl = TREE_CODE_CLASS (code);
2980 /* We make copies of most nodes. */
2981 if (IS_EXPR_CODE_CLASS (cl)
2982 || IS_GIMPLE_STMT_CODE_CLASS (cl)
2983 || code == TREE_LIST
2985 || code == TYPE_DECL
2986 || code == OMP_CLAUSE)
2988 /* Because the chain gets clobbered when we make a copy, we save it
2990 tree chain = NULL_TREE, new;
2992 if (!GIMPLE_TUPLE_P (*tp))
2993 chain = TREE_CHAIN (*tp);
2995 /* Copy the node. */
2996 new = copy_node (*tp);
2998 /* Propagate mudflap marked-ness. */
2999 if (flag_mudflap && mf_marked_p (*tp))
3004 /* Now, restore the chain, if appropriate. That will cause
3005 walk_tree to walk into the chain as well. */
3006 if (code == PARM_DECL
3007 || code == TREE_LIST
3008 || code == OMP_CLAUSE)
3009 TREE_CHAIN (*tp) = chain;
3011 /* For now, we don't update BLOCKs when we make copies. So, we
3012 have to nullify all BIND_EXPRs. */
3013 if (TREE_CODE (*tp) == BIND_EXPR)
3014 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
3016 else if (code == CONSTRUCTOR)
3018 /* CONSTRUCTOR nodes need special handling because
3019 we need to duplicate the vector of elements. */
3022 new = copy_node (*tp);
3024 /* Propagate mudflap marked-ness. */
3025 if (flag_mudflap && mf_marked_p (*tp))
3028 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
3029 CONSTRUCTOR_ELTS (*tp));
3032 else if (TREE_CODE_CLASS (code) == tcc_type)
3034 else if (TREE_CODE_CLASS (code) == tcc_declaration)
3036 else if (TREE_CODE_CLASS (code) == tcc_constant)
3039 gcc_assert (code != STATEMENT_LIST);
3043 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3044 information indicating to what new SAVE_EXPR this one should be mapped,
3045 use that one. Otherwise, create a new node and enter it in ST. FN is
3046 the function into which the copy will be placed. */
3049 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
3051 struct pointer_map_t *st = (struct pointer_map_t *) st_;
3055 /* See if we already encountered this SAVE_EXPR. */
3056 n = (tree *) pointer_map_contains (st, *tp);
3058 /* If we didn't already remap this SAVE_EXPR, do so now. */
3061 t = copy_node (*tp);
3063 /* Remember this SAVE_EXPR. */
3064 *pointer_map_insert (st, *tp) = t;
3065 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3066 *pointer_map_insert (st, t) = t;
3070 /* We've already walked into this SAVE_EXPR; don't do it again. */
3075 /* Replace this SAVE_EXPR with the copy. */
3079 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3080 copies the declaration and enters it in the splay_tree in DATA (which is
3081 really an `copy_body_data *'). */
3084 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3087 copy_body_data *id = (copy_body_data *) data;
3089 /* Don't walk into types. */
3093 else if (TREE_CODE (*tp) == LABEL_EXPR)
3095 tree decl = TREE_OPERAND (*tp, 0);
3097 /* Copy the decl and remember the copy. */
3098 insert_decl_map (id, decl, id->copy_decl (decl, id));
3104 /* Perform any modifications to EXPR required when it is unsaved. Does
3105 not recurse into EXPR's subtrees. */
3108 unsave_expr_1 (tree expr)
3110 switch (TREE_CODE (expr))
3113 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3114 It's OK for this to happen if it was part of a subtree that
3115 isn't immediately expanded, such as operand 2 of another
3117 if (TREE_OPERAND (expr, 1))
3120 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3121 TREE_OPERAND (expr, 3) = NULL_TREE;
3129 /* Called via walk_tree when an expression is unsaved. Using the
3130 splay_tree pointed to by ST (which is really a `splay_tree'),
3131 remaps all local declarations to appropriate replacements. */
3134 unsave_r (tree *tp, int *walk_subtrees, void *data)
3136 copy_body_data *id = (copy_body_data *) data;
3137 struct pointer_map_t *st = id->decl_map;
3140 /* Only a local declaration (variable or label). */
3141 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3142 || TREE_CODE (*tp) == LABEL_DECL)
3144 /* Lookup the declaration. */
3145 n = (tree *) pointer_map_contains (st, *tp);
3147 /* If it's there, remap it. */
3152 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3153 copy_statement_list (tp);
3154 else if (TREE_CODE (*tp) == BIND_EXPR)
3155 copy_bind_expr (tp, walk_subtrees, id);
3156 else if (TREE_CODE (*tp) == SAVE_EXPR)
3157 remap_save_expr (tp, st, walk_subtrees);
3160 copy_tree_r (tp, walk_subtrees, NULL);
3162 /* Do whatever unsaving is required. */
3163 unsave_expr_1 (*tp);
3166 /* Keep iterating. */
3170 /* Copies everything in EXPR and replaces variables, labels
3171 and SAVE_EXPRs local to EXPR. */
3174 unsave_expr_now (tree expr)
3178 /* There's nothing to do for NULL_TREE. */
3183 memset (&id, 0, sizeof (id));
3184 id.src_fn = current_function_decl;
3185 id.dst_fn = current_function_decl;
3186 id.decl_map = pointer_map_create ();
3188 id.copy_decl = copy_decl_no_change;
3189 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3190 id.transform_new_cfg = false;
3191 id.transform_return_to_modify = false;
3192 id.transform_lang_insert_block = false;
3194 /* Walk the tree once to find local labels. */
3195 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3197 /* Walk the tree again, copying, remapping, and unsaving. */
3198 walk_tree (&expr, unsave_r, &id, NULL);
3201 pointer_map_destroy (id.decl_map);
3206 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
3209 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
3218 debug_find_tree (tree top, tree search)
3220 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
3224 /* Declare the variables created by the inliner. Add all the variables in
3225 VARS to BIND_EXPR. */
3228 declare_inline_vars (tree block, tree vars)
3231 for (t = vars; t; t = TREE_CHAIN (t))
3233 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
3234 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
3235 cfun->unexpanded_var_list =
3236 tree_cons (NULL_TREE, t,
3237 cfun->unexpanded_var_list);
3241 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
3245 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
3246 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
3247 VAR_DECL translation. */
3250 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
3252 /* Don't generate debug information for the copy if we wouldn't have
3253 generated it for the copy either. */
3254 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
3255 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
3257 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
3258 declaration inspired this copy. */
3259 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
3261 /* The new variable/label has no RTL, yet. */
3262 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
3263 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
3264 SET_DECL_RTL (copy, NULL_RTX);
3266 /* These args would always appear unused, if not for this. */
3267 TREE_USED (copy) = 1;
3269 /* Set the context for the new declaration. */
3270 if (!DECL_CONTEXT (decl))
3271 /* Globals stay global. */
3273 else if (DECL_CONTEXT (decl) != id->src_fn)
3274 /* Things that weren't in the scope of the function we're inlining
3275 from aren't in the scope we're inlining to, either. */
3277 else if (TREE_STATIC (decl))
3278 /* Function-scoped static variables should stay in the original
3282 /* Ordinary automatic local variables are now in the scope of the
3284 DECL_CONTEXT (copy) = id->dst_fn;
3290 copy_decl_to_var (tree decl, copy_body_data *id)
3294 gcc_assert (TREE_CODE (decl) == PARM_DECL
3295 || TREE_CODE (decl) == RESULT_DECL);
3297 type = TREE_TYPE (decl);
3299 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3300 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3301 TREE_READONLY (copy) = TREE_READONLY (decl);
3302 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3303 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3304 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3306 return copy_decl_for_dup_finish (id, decl, copy);
3309 /* Like copy_decl_to_var, but create a return slot object instead of a
3310 pointer variable for return by invisible reference. */
3313 copy_result_decl_to_var (tree decl, copy_body_data *id)
3317 gcc_assert (TREE_CODE (decl) == PARM_DECL
3318 || TREE_CODE (decl) == RESULT_DECL);
3320 type = TREE_TYPE (decl);
3321 if (DECL_BY_REFERENCE (decl))
3322 type = TREE_TYPE (type);
3324 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3325 TREE_READONLY (copy) = TREE_READONLY (decl);
3326 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3327 if (!DECL_BY_REFERENCE (decl))
3329 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3330 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3331 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3334 return copy_decl_for_dup_finish (id, decl, copy);
3339 copy_decl_no_change (tree decl, copy_body_data *id)
3343 copy = copy_node (decl);
3345 /* The COPY is not abstract; it will be generated in DST_FN. */
3346 DECL_ABSTRACT (copy) = 0;
3347 lang_hooks.dup_lang_specific_decl (copy);
3349 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
3350 been taken; it's for internal bookkeeping in expand_goto_internal. */
3351 if (TREE_CODE (copy) == LABEL_DECL)
3353 TREE_ADDRESSABLE (copy) = 0;
3354 LABEL_DECL_UID (copy) = -1;
3357 return copy_decl_for_dup_finish (id, decl, copy);
3361 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
3363 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
3364 return copy_decl_to_var (decl, id);
3366 return copy_decl_no_change (decl, id);
3369 /* Return a copy of the function's argument tree. */
3371 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
3373 tree *arg_copy, *parg;
3375 arg_copy = &orig_parm;
3376 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
3378 tree new = remap_decl (*parg, id);
3379 lang_hooks.dup_lang_specific_decl (new);
3380 TREE_CHAIN (new) = TREE_CHAIN (*parg);
3386 /* Return a copy of the function's static chain. */
3388 copy_static_chain (tree static_chain, copy_body_data * id)
3390 tree *chain_copy, *pvar;
3392 chain_copy = &static_chain;
3393 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
3395 tree new = remap_decl (*pvar, id);
3396 lang_hooks.dup_lang_specific_decl (new);
3397 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
3400 return static_chain;
3403 /* Return true if the function is allowed to be versioned.
3404 This is a guard for the versioning functionality. */
3406 tree_versionable_function_p (tree fndecl)
3408 if (fndecl == NULL_TREE)
3410 /* ??? There are cases where a function is
3411 uninlinable but can be versioned. */
3412 if (!tree_inlinable_function_p (fndecl))
3418 /* Create a copy of a function's tree.
3419 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
3420 of the original function and the new copied function
3421 respectively. In case we want to replace a DECL
3422 tree with another tree while duplicating the function's
3423 body, TREE_MAP represents the mapping between these
3424 trees. If UPDATE_CLONES is set, the call_stmt fields
3425 of edges of clones of the function will be updated. */
3427 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
3430 struct cgraph_node *old_version_node;
3431 struct cgraph_node *new_version_node;
3435 struct ipa_replace_map *replace_info;
3436 basic_block old_entry_block;
3438 tree old_current_function_decl = current_function_decl;
3440 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
3441 && TREE_CODE (new_decl) == FUNCTION_DECL);
3442 DECL_POSSIBLY_INLINED (old_decl) = 1;
3444 old_version_node = cgraph_node (old_decl);
3445 new_version_node = cgraph_node (new_decl);
3447 DECL_ARTIFICIAL (new_decl) = 1;
3448 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
3450 /* Prepare the data structures for the tree copy. */
3451 memset (&id, 0, sizeof (id));
3453 /* Generate a new name for the new version. */
3456 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
3457 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
3458 SET_DECL_RTL (new_decl, NULL_RTX);
3459 id.statements_to_fold = pointer_set_create ();
3462 id.decl_map = pointer_map_create ();
3463 id.src_fn = old_decl;
3464 id.dst_fn = new_decl;
3465 id.src_node = old_version_node;
3466 id.dst_node = new_version_node;
3467 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
3469 id.copy_decl = copy_decl_no_change;
3470 id.transform_call_graph_edges
3471 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
3472 id.transform_new_cfg = true;
3473 id.transform_return_to_modify = false;
3474 id.transform_lang_insert_block = false;
3476 current_function_decl = new_decl;
3477 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
3478 (DECL_STRUCT_FUNCTION (old_decl));
3479 initialize_cfun (new_decl, old_decl,
3480 old_entry_block->count,
3481 old_entry_block->frequency);
3482 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
3484 /* Copy the function's static chain. */
3485 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
3487 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
3488 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
3490 /* Copy the function's arguments. */
3491 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
3492 DECL_ARGUMENTS (new_decl) =
3493 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
3495 /* If there's a tree_map, prepare for substitution. */
3497 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
3499 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
3500 if (replace_info->replace_p)
3501 insert_decl_map (&id, replace_info->old_tree,
3502 replace_info->new_tree);
3505 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
3507 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3508 number_blocks (id.dst_fn);
3510 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
3511 /* Add local vars. */
3512 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
3513 t_step; t_step = TREE_CHAIN (t_step))
3515 tree var = TREE_VALUE (t_step);
3516 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3517 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
3518 cfun->unexpanded_var_list);
3520 cfun->unexpanded_var_list =
3521 tree_cons (NULL_TREE, remap_decl (var, &id),
3522 cfun->unexpanded_var_list);
3525 /* Copy the Function's body. */
3526 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
3528 if (DECL_RESULT (old_decl) != NULL_TREE)
3530 tree *res_decl = &DECL_RESULT (old_decl);
3531 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
3532 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
3535 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3536 number_blocks (new_decl);
3539 pointer_map_destroy (id.decl_map);
3542 fold_marked_statements (0, id.statements_to_fold);
3543 pointer_set_destroy (id.statements_to_fold);
3544 fold_cond_expr_cond ();
3546 if (gimple_in_ssa_p (cfun))
3548 free_dominance_info (CDI_DOMINATORS);
3549 free_dominance_info (CDI_POST_DOMINATORS);
3551 delete_unreachable_blocks ();
3552 update_ssa (TODO_update_ssa);
3555 fold_cond_expr_cond ();
3556 if (need_ssa_update_p ())
3557 update_ssa (TODO_update_ssa);
3560 free_dominance_info (CDI_DOMINATORS);
3561 free_dominance_info (CDI_POST_DOMINATORS);
3563 current_function_decl = old_current_function_decl;
3564 gcc_assert (!current_function_decl
3565 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
3569 /* Duplicate a type, fields and all. */
3572 build_duplicate_type (tree type)
3574 struct copy_body_data id;
3576 memset (&id, 0, sizeof (id));
3577 id.src_fn = current_function_decl;
3578 id.dst_fn = current_function_decl;
3580 id.decl_map = pointer_map_create ();
3582 type = remap_type_1 (type, &id);
3584 pointer_map_destroy (id.decl_map);