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 if (call_ptr == stmtp)
868 bsi_replace (©_bsi, new_call, true);
869 stmtp = bsi_stmt_ptr (copy_bsi);
874 *call_ptr = new_call;
881 && (decl = get_callee_fndecl (call))
882 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
883 && DECL_FUNCTION_CODE (decl)
884 == BUILT_IN_VA_ARG_PACK_LEN)
886 /* __builtin_va_arg_pack_len () should be replaced by
887 the number of anonymous arguments. */
888 int nargs = call_expr_nargs (id->call_expr);
889 tree count, *call_ptr, p;
891 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
894 count = build_int_cst (integer_type_node, nargs);
896 if (TREE_CODE (*call_ptr) == GIMPLE_MODIFY_STMT)
897 call_ptr = &GIMPLE_STMT_OPERAND (*call_ptr, 1);
898 if (TREE_CODE (*call_ptr) == WITH_SIZE_EXPR)
899 call_ptr = &TREE_OPERAND (*call_ptr, 0);
900 gcc_assert (*call_ptr == call && call_ptr != stmtp);
907 /* Statements produced by inlining can be unfolded, especially
908 when we constant propagated some operands. We can't fold
909 them right now for two reasons:
910 1) folding require SSA_NAME_DEF_STMTs to be correct
911 2) we can't change function calls to builtins.
912 So we just mark statement for later folding. We mark
913 all new statements, instead just statements that has changed
914 by some nontrivial substitution so even statements made
915 foldable indirectly are updated. If this turns out to be
916 expensive, copy_body can be told to watch for nontrivial
918 if (id->statements_to_fold)
919 pointer_set_insert (id->statements_to_fold, stmt);
920 /* We're duplicating a CALL_EXPR. Find any corresponding
921 callgraph edges and update or duplicate them. */
922 if (call && (decl = get_callee_fndecl (call)))
924 struct cgraph_node *node;
925 struct cgraph_edge *edge;
927 switch (id->transform_call_graph_edges)
929 case CB_CGE_DUPLICATE:
930 edge = cgraph_edge (id->src_node, orig_stmt);
932 cgraph_clone_edge (edge, id->dst_node, stmt,
933 REG_BR_PROB_BASE, 1, edge->frequency, true);
936 case CB_CGE_MOVE_CLONES:
937 for (node = id->dst_node->next_clone;
939 node = node->next_clone)
941 edge = cgraph_edge (node, orig_stmt);
943 cgraph_set_call_stmt (edge, stmt);
948 edge = cgraph_edge (id->dst_node, orig_stmt);
950 cgraph_set_call_stmt (edge, stmt);
957 /* If you think we can abort here, you are wrong.
958 There is no region 0 in tree land. */
959 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
962 if (tree_could_throw_p (stmt)
963 /* When we are cloning for inlining, we are supposed to
964 construct a clone that calls precisely the same functions
965 as original. However IPA optimizers might've proved
966 earlier some function calls as non-trapping that might
967 render some basic blocks dead that might become
970 We can't update SSA with unreachable blocks in CFG and thus
971 we prevent the scenario by preserving even the "dead" eh
972 edges until the point they are later removed by
974 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
975 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
977 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
978 /* Add an entry for the copied tree in the EH hashtable.
979 When cloning or versioning, use the hashtable in
980 cfun, and just copy the EH number. When inlining, use the
981 hashtable in the caller, and adjust the region number. */
983 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
985 /* If this tree doesn't have a region associated with it,
986 and there is a "current region,"
987 then associate this tree with the current region
988 and add edges associated with this region. */
989 if ((lookup_stmt_eh_region_fn (id->src_cfun,
991 && id->eh_region > 0)
992 && tree_could_throw_p (stmt))
993 add_stmt_to_eh_region (stmt, id->eh_region);
995 if (gimple_in_ssa_p (cfun))
1000 find_new_referenced_vars (bsi_stmt_ptr (copy_bsi));
1001 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1002 if (TREE_CODE (def) == SSA_NAME)
1003 SSA_NAME_DEF_STMT (def) = stmt;
1005 bsi_next (©_bsi);
1007 copy_bsi = bsi_last (copy_basic_block);
1010 return copy_basic_block;
1013 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1014 form is quite easy, since dominator relationship for old basic blocks does
1017 There is however exception where inlining might change dominator relation
1018 across EH edges from basic block within inlined functions destinating
1019 to landing pads in function we inline into.
1021 The function fills in PHI_RESULTs of such PHI nodes if they refer
1022 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1023 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1024 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1025 set, and this means that there will be no overlapping live ranges
1026 for the underlying symbol.
1028 This might change in future if we allow redirecting of EH edges and
1029 we might want to change way build CFG pre-inlining to include
1030 all the possible edges then. */
1032 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1033 bool can_throw, bool nonlocal_goto)
1038 FOR_EACH_EDGE (e, ei, bb->succs)
1040 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1044 gcc_assert (e->flags & EDGE_ABNORMAL);
1046 gcc_assert (e->flags & EDGE_EH);
1048 gcc_assert (!(e->flags & EDGE_EH));
1049 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
1053 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1054 gcc_assert (!e->dest->aux);
1056 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
1057 (PHI_RESULT (phi)));
1059 if (!is_gimple_reg (PHI_RESULT (phi)))
1061 mark_sym_for_renaming
1062 (SSA_NAME_VAR (PHI_RESULT (phi)));
1066 re = find_edge (ret_bb, e->dest);
1068 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1069 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1071 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1072 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1077 /* Copy edges from BB into its copy constructed earlier, scale profile
1078 accordingly. Edges will be taken care of later. Assume aux
1079 pointers to point to the copies of each BB. */
1081 copy_edges_for_bb (basic_block bb, int count_scale, basic_block ret_bb)
1083 basic_block new_bb = (basic_block) bb->aux;
1086 block_stmt_iterator bsi;
1089 /* Use the indices from the original blocks to create edges for the
1091 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1092 if (!(old_edge->flags & EDGE_EH))
1096 flags = old_edge->flags;
1098 /* Return edges do get a FALLTHRU flag when the get inlined. */
1099 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1100 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1101 flags |= EDGE_FALLTHRU;
1102 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1103 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1104 new->probability = old_edge->probability;
1107 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1110 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
1113 bool can_throw, nonlocal_goto;
1115 copy_stmt = bsi_stmt (bsi);
1116 update_stmt (copy_stmt);
1117 if (gimple_in_ssa_p (cfun))
1118 mark_symbols_for_renaming (copy_stmt);
1119 /* Do this before the possible split_block. */
1122 /* If this tree could throw an exception, there are two
1123 cases where we need to add abnormal edge(s): the
1124 tree wasn't in a region and there is a "current
1125 region" in the caller; or the original tree had
1126 EH edges. In both cases split the block after the tree,
1127 and add abnormal edge(s) as needed; we need both
1128 those from the callee and the caller.
1129 We check whether the copy can throw, because the const
1130 propagation can change an INDIRECT_REF which throws
1131 into a COMPONENT_REF which doesn't. If the copy
1132 can throw, the original could also throw. */
1134 can_throw = tree_can_throw_internal (copy_stmt);
1135 nonlocal_goto = tree_can_make_abnormal_goto (copy_stmt);
1137 if (can_throw || nonlocal_goto)
1139 if (!bsi_end_p (bsi))
1140 /* Note that bb's predecessor edges aren't necessarily
1141 right at this point; split_block doesn't care. */
1143 edge e = split_block (new_bb, copy_stmt);
1146 new_bb->aux = e->src->aux;
1147 bsi = bsi_start (new_bb);
1152 make_eh_edges (copy_stmt);
1155 make_abnormal_goto_edges (bb_for_stmt (copy_stmt), true);
1157 if ((can_throw || nonlocal_goto)
1158 && gimple_in_ssa_p (cfun))
1159 update_ssa_across_abnormal_edges (bb_for_stmt (copy_stmt), ret_bb,
1160 can_throw, nonlocal_goto);
1164 /* Copy the PHIs. All blocks and edges are copied, some blocks
1165 was possibly split and new outgoing EH edges inserted.
1166 BB points to the block of original function and AUX pointers links
1167 the original and newly copied blocks. */
1170 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1172 basic_block new_bb = bb->aux;
1176 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1178 tree res = PHI_RESULT (phi);
1183 if (is_gimple_reg (res))
1185 walk_tree (&new_res, copy_body_r, id, NULL);
1186 SSA_NAME_DEF_STMT (new_res)
1187 = new_phi = create_phi_node (new_res, new_bb);
1188 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1190 edge old_edge = find_edge (new_edge->src->aux, bb);
1191 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1194 walk_tree (&new_arg, copy_body_r, id, NULL);
1195 gcc_assert (new_arg);
1196 /* With return slot optimization we can end up with
1197 non-gimple (foo *)&this->m, fix that here. */
1198 if (TREE_CODE (new_arg) != SSA_NAME
1199 && TREE_CODE (new_arg) != FUNCTION_DECL
1200 && !is_gimple_val (new_arg))
1202 tree stmts = NULL_TREE;
1203 new_arg = force_gimple_operand (new_arg, &stmts,
1205 bsi_insert_on_edge_immediate (new_edge, stmts);
1207 add_phi_arg (new_phi, new_arg, new_edge);
1213 /* Wrapper for remap_decl so it can be used as a callback. */
1215 remap_decl_1 (tree decl, void *data)
1217 return remap_decl (decl, (copy_body_data *) data);
1220 /* Build struct function and associated datastructures for the new clone
1221 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1224 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1227 struct function *new_cfun
1228 = (struct function *) ggc_alloc_cleared (sizeof (struct function));
1229 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1230 int count_scale, frequency_scale;
1232 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1233 count_scale = (REG_BR_PROB_BASE * count
1234 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1238 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1239 frequency_scale = (REG_BR_PROB_BASE * frequency
1241 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1243 frequency_scale = count_scale;
1245 /* Register specific tree functions. */
1246 tree_register_cfg_hooks ();
1247 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
1248 new_cfun->funcdef_no = get_next_funcdef_no ();
1249 VALUE_HISTOGRAMS (new_cfun) = NULL;
1250 new_cfun->unexpanded_var_list = NULL;
1251 new_cfun->cfg = NULL;
1252 new_cfun->decl = new_fndecl /*= copy_node (callee_fndecl)*/;
1253 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
1254 push_cfun (new_cfun);
1255 init_empty_tree_cfg ();
1257 ENTRY_BLOCK_PTR->count =
1258 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1260 ENTRY_BLOCK_PTR->frequency =
1261 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1262 frequency_scale / REG_BR_PROB_BASE);
1263 EXIT_BLOCK_PTR->count =
1264 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1266 EXIT_BLOCK_PTR->frequency =
1267 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1268 frequency_scale / REG_BR_PROB_BASE);
1270 init_eh_for_function ();
1272 if (src_cfun->gimple_df)
1275 cfun->gimple_df->in_ssa_p = true;
1276 init_ssa_operands ();
1281 /* Make a copy of the body of FN so that it can be inserted inline in
1282 another function. Walks FN via CFG, returns new fndecl. */
1285 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1286 basic_block entry_block_map, basic_block exit_block_map)
1288 tree callee_fndecl = id->src_fn;
1289 /* Original cfun for the callee, doesn't change. */
1290 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1291 struct function *cfun_to_copy;
1293 tree new_fndecl = NULL;
1294 int count_scale, frequency_scale;
1297 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1298 count_scale = (REG_BR_PROB_BASE * count
1299 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1303 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1304 frequency_scale = (REG_BR_PROB_BASE * frequency
1306 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1308 frequency_scale = count_scale;
1310 /* Register specific tree functions. */
1311 tree_register_cfg_hooks ();
1313 /* Must have a CFG here at this point. */
1314 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1315 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1317 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1320 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1321 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1322 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1323 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1325 /* Duplicate any exception-handling regions. */
1328 id->eh_region_offset
1329 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1332 /* Use aux pointers to map the original blocks to copy. */
1333 FOR_EACH_BB_FN (bb, cfun_to_copy)
1335 basic_block new = copy_bb (id, bb, frequency_scale, count_scale);
1340 last = last_basic_block;
1341 /* Now that we've duplicated the blocks, duplicate their edges. */
1342 FOR_ALL_BB_FN (bb, cfun_to_copy)
1343 copy_edges_for_bb (bb, count_scale, exit_block_map);
1344 if (gimple_in_ssa_p (cfun))
1345 FOR_ALL_BB_FN (bb, cfun_to_copy)
1346 copy_phis_for_bb (bb, id);
1347 FOR_ALL_BB_FN (bb, cfun_to_copy)
1349 ((basic_block)bb->aux)->aux = NULL;
1352 /* Zero out AUX fields of newly created block during EH edge
1354 for (; last < last_basic_block; last++)
1355 BASIC_BLOCK (last)->aux = NULL;
1356 entry_block_map->aux = NULL;
1357 exit_block_map->aux = NULL;
1362 /* Make a copy of the body of FN so that it can be inserted inline in
1363 another function. */
1366 copy_generic_body (copy_body_data *id)
1369 tree fndecl = id->src_fn;
1371 body = DECL_SAVED_TREE (fndecl);
1372 walk_tree (&body, copy_body_r, id, NULL);
1378 copy_body (copy_body_data *id, gcov_type count, int frequency,
1379 basic_block entry_block_map, basic_block exit_block_map)
1381 tree fndecl = id->src_fn;
1384 /* If this body has a CFG, walk CFG and copy. */
1385 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
1386 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
1391 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1392 defined in function FN, or of a data member thereof. */
1395 self_inlining_addr_expr (tree value, tree fn)
1399 if (TREE_CODE (value) != ADDR_EXPR)
1402 var = get_base_address (TREE_OPERAND (value, 0));
1404 return var && auto_var_in_fn_p (var, fn);
1408 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
1409 basic_block bb, tree *vars)
1415 tree def = (gimple_in_ssa_p (cfun)
1416 ? gimple_default_def (id->src_cfun, p) : NULL);
1419 && value != error_mark_node
1420 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
1421 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
1423 /* If the parameter is never assigned to, has no SSA_NAMEs created,
1424 we may not need to create a new variable here at all. Instead, we may
1425 be able to just use the argument value. */
1426 if (TREE_READONLY (p)
1427 && !TREE_ADDRESSABLE (p)
1428 && value && !TREE_SIDE_EFFECTS (value)
1431 /* We may produce non-gimple trees by adding NOPs or introduce
1432 invalid sharing when operand is not really constant.
1433 It is not big deal to prohibit constant propagation here as
1434 we will constant propagate in DOM1 pass anyway. */
1435 if (is_gimple_min_invariant (value)
1436 && useless_type_conversion_p (TREE_TYPE (p),
1438 /* We have to be very careful about ADDR_EXPR. Make sure
1439 the base variable isn't a local variable of the inlined
1440 function, e.g., when doing recursive inlining, direct or
1441 mutually-recursive or whatever, which is why we don't
1442 just test whether fn == current_function_decl. */
1443 && ! self_inlining_addr_expr (value, fn))
1445 insert_decl_map (id, p, value);
1450 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1451 here since the type of this decl must be visible to the calling
1453 var = copy_decl_to_var (p, id);
1454 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
1457 add_referenced_var (var);
1460 /* See if the frontend wants to pass this by invisible reference. If
1461 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1462 replace uses of the PARM_DECL with dereferences. */
1463 if (TREE_TYPE (var) != TREE_TYPE (p)
1464 && POINTER_TYPE_P (TREE_TYPE (var))
1465 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1467 insert_decl_map (id, var, var);
1468 var_sub = build_fold_indirect_ref (var);
1473 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1474 that way, when the PARM_DECL is encountered, it will be
1475 automatically replaced by the VAR_DECL. */
1476 insert_decl_map (id, p, var_sub);
1478 /* Declare this new variable. */
1479 TREE_CHAIN (var) = *vars;
1482 /* Make gimplifier happy about this variable. */
1483 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1485 /* Even if P was TREE_READONLY, the new VAR should not be.
1486 In the original code, we would have constructed a
1487 temporary, and then the function body would have never
1488 changed the value of P. However, now, we will be
1489 constructing VAR directly. The constructor body may
1490 change its value multiple times as it is being
1491 constructed. Therefore, it must not be TREE_READONLY;
1492 the back-end assumes that TREE_READONLY variable is
1493 assigned to only once. */
1494 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1495 TREE_READONLY (var) = 0;
1497 /* If there is no setup required and we are in SSA, take the easy route
1498 replacing all SSA names representing the function parameter by the
1499 SSA name passed to function.
1501 We need to construct map for the variable anyway as it might be used
1502 in different SSA names when parameter is set in function.
1504 FIXME: This usually kills the last connection in between inlined
1505 function parameter and the actual value in debug info. Can we do
1506 better here? If we just inserted the statement, copy propagation
1507 would kill it anyway as it always did in older versions of GCC.
1509 We might want to introduce a notion that single SSA_NAME might
1510 represent multiple variables for purposes of debugging. */
1511 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
1512 && (TREE_CODE (rhs) == SSA_NAME
1513 || is_gimple_min_invariant (rhs))
1514 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1516 insert_decl_map (id, def, rhs);
1520 /* Initialize this VAR_DECL from the equivalent argument. Convert
1521 the argument to the proper type in case it was promoted. */
1524 block_stmt_iterator bsi = bsi_last (bb);
1526 if (rhs == error_mark_node)
1528 insert_decl_map (id, p, var_sub);
1532 STRIP_USELESS_TYPE_CONVERSION (rhs);
1534 /* We want to use GIMPLE_MODIFY_STMT, not INIT_EXPR here so that we
1535 keep our trees in gimple form. */
1536 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
1538 def = remap_ssa_name (def, id);
1539 init_stmt = build_gimple_modify_stmt (def, rhs);
1540 SSA_NAME_DEF_STMT (def) = init_stmt;
1541 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
1542 set_default_def (var, NULL);
1545 init_stmt = build_gimple_modify_stmt (var, rhs);
1547 /* If we did not create a gimple value and we did not create a gimple
1548 cast of a gimple value, then we will need to gimplify INIT_STMTS
1549 at the end. Note that is_gimple_cast only checks the outer
1550 tree code, not its operand. Thus the explicit check that its
1551 operand is a gimple value. */
1552 if ((!is_gimple_val (rhs)
1553 && (!is_gimple_cast (rhs)
1554 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1555 || !is_gimple_reg (var))
1557 tree_stmt_iterator i;
1559 push_gimplify_context ();
1560 gimplify_stmt (&init_stmt);
1561 if (gimple_in_ssa_p (cfun)
1562 && init_stmt && TREE_CODE (init_stmt) == STATEMENT_LIST)
1564 /* The replacement can expose previously unreferenced
1566 for (i = tsi_start (init_stmt); !tsi_end_p (i); tsi_next (&i))
1567 find_new_referenced_vars (tsi_stmt_ptr (i));
1569 pop_gimplify_context (NULL);
1572 /* If VAR represents a zero-sized variable, it's possible that the
1573 assignment statment may result in no gimple statements. */
1575 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1576 if (gimple_in_ssa_p (cfun))
1577 for (;!bsi_end_p (bsi); bsi_next (&bsi))
1578 mark_symbols_for_renaming (bsi_stmt (bsi));
1582 /* Generate code to initialize the parameters of the function at the
1583 top of the stack in ID from the CALL_EXPR EXP. */
1586 initialize_inlined_parameters (copy_body_data *id, tree exp,
1587 tree fn, basic_block bb)
1592 tree vars = NULL_TREE;
1593 call_expr_arg_iterator iter;
1594 tree static_chain = CALL_EXPR_STATIC_CHAIN (exp);
1596 /* Figure out what the parameters are. */
1597 parms = DECL_ARGUMENTS (fn);
1599 /* Loop through the parameter declarations, replacing each with an
1600 equivalent VAR_DECL, appropriately initialized. */
1601 for (p = parms, a = first_call_expr_arg (exp, &iter); p;
1602 a = next_call_expr_arg (&iter), p = TREE_CHAIN (p))
1603 setup_one_parameter (id, p, a, fn, bb, &vars);
1605 /* Initialize the static chain. */
1606 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1607 gcc_assert (fn != current_function_decl);
1610 /* No static chain? Seems like a bug in tree-nested.c. */
1611 gcc_assert (static_chain);
1613 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1616 declare_inline_vars (id->block, vars);
1619 /* Declare a return variable to replace the RESULT_DECL for the
1620 function we are calling. An appropriate DECL_STMT is returned.
1621 The USE_STMT is filled to contain a use of the declaration to
1622 indicate the return value of the function.
1624 RETURN_SLOT, if non-null is place where to store the result. It
1625 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
1626 was the LHS of the GIMPLE_MODIFY_STMT to which this call is the RHS.
1628 The return value is a (possibly null) value that is the result of the
1629 function as seen by the callee. *USE_P is a (possibly null) value that
1630 holds the result as seen by the caller. */
1633 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
1636 tree callee = id->src_fn;
1637 tree caller = id->dst_fn;
1638 tree result = DECL_RESULT (callee);
1639 tree callee_type = TREE_TYPE (result);
1640 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1643 /* We don't need to do anything for functions that don't return
1645 if (!result || VOID_TYPE_P (callee_type))
1651 /* If there was a return slot, then the return value is the
1652 dereferenced address of that object. */
1655 /* The front end shouldn't have used both return_slot and
1656 a modify expression. */
1657 gcc_assert (!modify_dest);
1658 if (DECL_BY_REFERENCE (result))
1660 tree return_slot_addr = build_fold_addr_expr (return_slot);
1661 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
1663 /* We are going to construct *&return_slot and we can't do that
1664 for variables believed to be not addressable.
1666 FIXME: This check possibly can match, because values returned
1667 via return slot optimization are not believed to have address
1668 taken by alias analysis. */
1669 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
1670 if (gimple_in_ssa_p (cfun))
1672 HOST_WIDE_INT bitsize;
1673 HOST_WIDE_INT bitpos;
1675 enum machine_mode mode;
1679 base = get_inner_reference (return_slot, &bitsize, &bitpos,
1681 &mode, &unsignedp, &volatilep,
1683 if (TREE_CODE (base) == INDIRECT_REF)
1684 base = TREE_OPERAND (base, 0);
1685 if (TREE_CODE (base) == SSA_NAME)
1686 base = SSA_NAME_VAR (base);
1687 mark_sym_for_renaming (base);
1689 var = return_slot_addr;
1694 gcc_assert (TREE_CODE (var) != SSA_NAME);
1696 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1697 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1698 && !DECL_GIMPLE_REG_P (result)
1700 DECL_GIMPLE_REG_P (var) = 0;
1705 /* All types requiring non-trivial constructors should have been handled. */
1706 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1708 /* Attempt to avoid creating a new temporary variable. */
1710 && TREE_CODE (modify_dest) != SSA_NAME)
1712 bool use_it = false;
1714 /* We can't use MODIFY_DEST if there's type promotion involved. */
1715 if (!useless_type_conversion_p (callee_type, caller_type))
1718 /* ??? If we're assigning to a variable sized type, then we must
1719 reuse the destination variable, because we've no good way to
1720 create variable sized temporaries at this point. */
1721 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1724 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1725 reuse it as the result of the call directly. Don't do this if
1726 it would promote MODIFY_DEST to addressable. */
1727 else if (TREE_ADDRESSABLE (result))
1731 tree base_m = get_base_address (modify_dest);
1733 /* If the base isn't a decl, then it's a pointer, and we don't
1734 know where that's going to go. */
1735 if (!DECL_P (base_m))
1737 else if (is_global_var (base_m))
1739 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1740 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1741 && !DECL_GIMPLE_REG_P (result)
1742 && DECL_GIMPLE_REG_P (base_m))
1744 else if (!TREE_ADDRESSABLE (base_m))
1756 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1758 var = copy_result_decl_to_var (result, id);
1759 if (gimple_in_ssa_p (cfun))
1762 add_referenced_var (var);
1765 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1766 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1767 = tree_cons (NULL_TREE, var,
1768 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1770 /* Do not have the rest of GCC warn about this variable as it should
1771 not be visible to the user. */
1772 TREE_NO_WARNING (var) = 1;
1774 declare_inline_vars (id->block, var);
1776 /* Build the use expr. If the return type of the function was
1777 promoted, convert it back to the expected type. */
1779 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
1780 use = fold_convert (caller_type, var);
1782 STRIP_USELESS_TYPE_CONVERSION (use);
1784 if (DECL_BY_REFERENCE (result))
1785 var = build_fold_addr_expr (var);
1788 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1789 way, when the RESULT_DECL is encountered, it will be
1790 automatically replaced by the VAR_DECL. */
1791 insert_decl_map (id, result, var);
1793 /* Remember this so we can ignore it in remap_decls. */
1800 /* Returns nonzero if a function can be inlined as a tree. */
1803 tree_inlinable_function_p (tree fn)
1805 return inlinable_function_p (fn);
1808 static const char *inline_forbidden_reason;
1811 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1815 tree fn = (tree) fnp;
1818 switch (TREE_CODE (node))
1821 /* Refuse to inline alloca call unless user explicitly forced so as
1822 this may change program's memory overhead drastically when the
1823 function using alloca is called in loop. In GCC present in
1824 SPEC2000 inlining into schedule_block cause it to require 2GB of
1825 RAM instead of 256MB. */
1826 if (alloca_call_p (node)
1827 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1829 inline_forbidden_reason
1830 = G_("function %q+F can never be inlined because it uses "
1831 "alloca (override using the always_inline attribute)");
1834 t = get_callee_fndecl (node);
1838 /* We cannot inline functions that call setjmp. */
1839 if (setjmp_call_p (t))
1841 inline_forbidden_reason
1842 = G_("function %q+F can never be inlined because it uses setjmp");
1846 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1847 switch (DECL_FUNCTION_CODE (t))
1849 /* We cannot inline functions that take a variable number of
1851 case BUILT_IN_VA_START:
1852 case BUILT_IN_STDARG_START:
1853 case BUILT_IN_NEXT_ARG:
1854 case BUILT_IN_VA_END:
1855 inline_forbidden_reason
1856 = G_("function %q+F can never be inlined because it "
1857 "uses variable argument lists");
1860 case BUILT_IN_LONGJMP:
1861 /* We can't inline functions that call __builtin_longjmp at
1862 all. The non-local goto machinery really requires the
1863 destination be in a different function. If we allow the
1864 function calling __builtin_longjmp to be inlined into the
1865 function calling __builtin_setjmp, Things will Go Awry. */
1866 inline_forbidden_reason
1867 = G_("function %q+F can never be inlined because "
1868 "it uses setjmp-longjmp exception handling");
1871 case BUILT_IN_NONLOCAL_GOTO:
1873 inline_forbidden_reason
1874 = G_("function %q+F can never be inlined because "
1875 "it uses non-local goto");
1878 case BUILT_IN_RETURN:
1879 case BUILT_IN_APPLY_ARGS:
1880 /* If a __builtin_apply_args caller would be inlined,
1881 it would be saving arguments of the function it has
1882 been inlined into. Similarly __builtin_return would
1883 return from the function the inline has been inlined into. */
1884 inline_forbidden_reason
1885 = G_("function %q+F can never be inlined because "
1886 "it uses __builtin_return or __builtin_apply_args");
1895 t = TREE_OPERAND (node, 0);
1897 /* We will not inline a function which uses computed goto. The
1898 addresses of its local labels, which may be tucked into
1899 global storage, are of course not constant across
1900 instantiations, which causes unexpected behavior. */
1901 if (TREE_CODE (t) != LABEL_DECL)
1903 inline_forbidden_reason
1904 = G_("function %q+F can never be inlined "
1905 "because it contains a computed goto");
1911 t = TREE_OPERAND (node, 0);
1912 if (DECL_NONLOCAL (t))
1914 /* We cannot inline a function that receives a non-local goto
1915 because we cannot remap the destination label used in the
1916 function that is performing the non-local goto. */
1917 inline_forbidden_reason
1918 = G_("function %q+F can never be inlined "
1919 "because it receives a non-local goto");
1926 /* We cannot inline a function of the form
1928 void F (int i) { struct S { int ar[i]; } s; }
1930 Attempting to do so produces a catch-22.
1931 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1932 UNION_TYPE nodes, then it goes into infinite recursion on a
1933 structure containing a pointer to its own type. If it doesn't,
1934 then the type node for S doesn't get adjusted properly when
1937 ??? This is likely no longer true, but it's too late in the 4.0
1938 cycle to try to find out. This should be checked for 4.1. */
1939 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1940 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1942 inline_forbidden_reason
1943 = G_("function %q+F can never be inlined "
1944 "because it uses variable sized variables");
1955 /* Return subexpression representing possible alloca call, if any. */
1957 inline_forbidden_p (tree fndecl)
1959 location_t saved_loc = input_location;
1960 block_stmt_iterator bsi;
1962 tree ret = NULL_TREE;
1964 FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
1965 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1967 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
1968 inline_forbidden_p_1, fndecl);
1974 input_location = saved_loc;
1978 /* Returns nonzero if FN is a function that does not have any
1979 fundamental inline blocking properties. */
1982 inlinable_function_p (tree fn)
1984 bool inlinable = true;
1988 /* If we've already decided this function shouldn't be inlined,
1989 there's no need to check again. */
1990 if (DECL_UNINLINABLE (fn))
1993 /* We only warn for functions declared `inline' by the user. */
1994 do_warning = (warn_inline
1996 && DECL_DECLARED_INLINE_P (fn)
1997 && !DECL_IN_SYSTEM_HEADER (fn));
1999 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2001 if (flag_really_no_inline
2002 && always_inline == NULL)
2005 warning (OPT_Winline, "function %q+F can never be inlined because it "
2006 "is suppressed using -fno-inline", fn);
2010 /* Don't auto-inline anything that might not be bound within
2011 this unit of translation. */
2012 else if (!DECL_DECLARED_INLINE_P (fn)
2013 && DECL_REPLACEABLE_P (fn))
2016 else if (!function_attribute_inlinable_p (fn))
2019 warning (OPT_Winline, "function %q+F can never be inlined because it "
2020 "uses attributes conflicting with inlining", fn);
2024 /* If we don't have the function body available, we can't inline it.
2025 However, this should not be recorded since we also get here for
2026 forward declared inline functions. Therefore, return at once. */
2027 if (!DECL_SAVED_TREE (fn))
2030 /* If we're not inlining at all, then we cannot inline this function. */
2031 else if (!flag_inline_trees)
2034 /* Only try to inline functions if DECL_INLINE is set. This should be
2035 true for all functions declared `inline', and for all other functions
2036 as well with -finline-functions.
2038 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
2039 it's the front-end that must set DECL_INLINE in this case, because
2040 dwarf2out loses if a function that does not have DECL_INLINE set is
2041 inlined anyway. That is why we have both DECL_INLINE and
2042 DECL_DECLARED_INLINE_P. */
2043 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
2044 here should be redundant. */
2045 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
2048 else if (inline_forbidden_p (fn))
2050 /* See if we should warn about uninlinable functions. Previously,
2051 some of these warnings would be issued while trying to expand
2052 the function inline, but that would cause multiple warnings
2053 about functions that would for example call alloca. But since
2054 this a property of the function, just one warning is enough.
2055 As a bonus we can now give more details about the reason why a
2056 function is not inlinable. */
2058 sorry (inline_forbidden_reason, fn);
2059 else if (do_warning)
2060 warning (OPT_Winline, inline_forbidden_reason, fn);
2065 /* Squirrel away the result so that we don't have to check again. */
2066 DECL_UNINLINABLE (fn) = !inlinable;
2071 /* Estimate the cost of a memory move. Use machine dependent
2072 word size and take possible memcpy call into account. */
2075 estimate_move_cost (tree type)
2079 size = int_size_in_bytes (type);
2081 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
2082 /* Cost of a memcpy call, 3 arguments and the call. */
2085 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
2088 /* Arguments for estimate_num_insns_1. */
2092 /* Used to return the number of insns. */
2095 /* Weights of various constructs. */
2096 eni_weights *weights;
2099 /* Used by estimate_num_insns. Estimate number of instructions seen
2100 by given statement. */
2103 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
2105 struct eni_data *d = data;
2109 if (IS_TYPE_OR_DECL_P (x))
2114 /* Assume that constants and references counts nothing. These should
2115 be majorized by amount of operations among them we count later
2116 and are common target of CSE and similar optimizations. */
2117 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
2120 switch (TREE_CODE (x))
2122 /* Containers have no cost. */
2129 case ALIGN_INDIRECT_REF:
2130 case MISALIGNED_INDIRECT_REF:
2132 case ARRAY_RANGE_REF:
2134 case EXC_PTR_EXPR: /* ??? */
2135 case FILTER_EXPR: /* ??? */
2138 case WITH_CLEANUP_EXPR:
2141 case VIEW_CONVERT_EXPR:
2146 case CASE_LABEL_EXPR:
2149 case EH_FILTER_EXPR:
2150 case STATEMENT_LIST:
2152 case NON_LVALUE_EXPR:
2155 case TRY_CATCH_EXPR:
2156 case TRY_FINALLY_EXPR:
2163 case WITH_SIZE_EXPR:
2167 case OMP_SECTIONS_SWITCH:
2168 case OMP_ATOMIC_STORE:
2171 /* We don't account constants for now. Assume that the cost is amortized
2172 by operations that do use them. We may re-consider this decision once
2173 we are able to optimize the tree before estimating its size and break
2174 out static initializers. */
2175 case IDENTIFIER_NODE:
2185 /* CHANGE_DYNAMIC_TYPE_EXPR explicitly expands to nothing. */
2186 case CHANGE_DYNAMIC_TYPE_EXPR:
2190 /* Try to estimate the cost of assignments. We have three cases to
2192 1) Simple assignments to registers;
2193 2) Stores to things that must live in memory. This includes
2194 "normal" stores to scalars, but also assignments of large
2195 structures, or constructors of big arrays;
2198 Let us look at the first two cases, assuming we have "a = b + C":
2199 <GIMPLE_MODIFY_STMT <var_decl "a">
2200 <plus_expr <var_decl "b"> <constant C>>
2201 If "a" is a GIMPLE register, the assignment to it is free on almost
2202 any target, because "a" usually ends up in a real register. Hence
2203 the only cost of this expression comes from the PLUS_EXPR, and we
2204 can ignore the GIMPLE_MODIFY_STMT.
2205 If "a" is not a GIMPLE register, the assignment to "a" will most
2206 likely be a real store, so the cost of the GIMPLE_MODIFY_STMT is the cost
2207 of moving something into "a", which we compute using the function
2210 The third case deals with TARGET_EXPRs, for which the semantics are
2211 that a temporary is assigned, unless the TARGET_EXPR itself is being
2212 assigned to something else. In the latter case we do not need the
2214 <GIMPLE_MODIFY_STMT <var_decl "a"> <target_expr>>, the
2215 GIMPLE_MODIFY_STMT is free. */
2217 case GIMPLE_MODIFY_STMT:
2218 /* Is the right and side a TARGET_EXPR? */
2219 if (TREE_CODE (GENERIC_TREE_OPERAND (x, 1)) == TARGET_EXPR)
2221 /* ... fall through ... */
2224 x = GENERIC_TREE_OPERAND (x, 0);
2225 /* Is this an assignments to a register? */
2226 if (is_gimple_reg (x))
2228 /* Otherwise it's a store, so fall through to compute the move cost. */
2231 d->count += estimate_move_cost (TREE_TYPE (x));
2234 /* Assign cost of 1 to usual operations.
2235 ??? We may consider mapping RTL costs to this. */
2240 case POINTER_PLUS_EXPR:
2244 case FIXED_CONVERT_EXPR:
2245 case FIX_TRUNC_EXPR:
2257 case VEC_LSHIFT_EXPR:
2258 case VEC_RSHIFT_EXPR:
2265 case TRUTH_ANDIF_EXPR:
2266 case TRUTH_ORIF_EXPR:
2267 case TRUTH_AND_EXPR:
2269 case TRUTH_XOR_EXPR:
2270 case TRUTH_NOT_EXPR:
2279 case UNORDERED_EXPR:
2290 case PREDECREMENT_EXPR:
2291 case PREINCREMENT_EXPR:
2292 case POSTDECREMENT_EXPR:
2293 case POSTINCREMENT_EXPR:
2297 case REALIGN_LOAD_EXPR:
2299 case REDUC_MAX_EXPR:
2300 case REDUC_MIN_EXPR:
2301 case REDUC_PLUS_EXPR:
2302 case WIDEN_SUM_EXPR:
2304 case VEC_WIDEN_MULT_HI_EXPR:
2305 case VEC_WIDEN_MULT_LO_EXPR:
2306 case VEC_UNPACK_HI_EXPR:
2307 case VEC_UNPACK_LO_EXPR:
2308 case VEC_UNPACK_FLOAT_HI_EXPR:
2309 case VEC_UNPACK_FLOAT_LO_EXPR:
2310 case VEC_PACK_TRUNC_EXPR:
2311 case VEC_PACK_SAT_EXPR:
2312 case VEC_PACK_FIX_TRUNC_EXPR:
2314 case WIDEN_MULT_EXPR:
2316 case VEC_EXTRACT_EVEN_EXPR:
2317 case VEC_EXTRACT_ODD_EXPR:
2318 case VEC_INTERLEAVE_HIGH_EXPR:
2319 case VEC_INTERLEAVE_LOW_EXPR:
2326 /* TODO: Cost of a switch should be derived from the number of
2328 d->count += d->weights->switch_cost;
2331 /* Few special cases of expensive operations. This is useful
2332 to avoid inlining on functions having too many of these. */
2333 case TRUNC_DIV_EXPR:
2335 case FLOOR_DIV_EXPR:
2336 case ROUND_DIV_EXPR:
2337 case EXACT_DIV_EXPR:
2338 case TRUNC_MOD_EXPR:
2340 case FLOOR_MOD_EXPR:
2341 case ROUND_MOD_EXPR:
2343 d->count += d->weights->div_mod_cost;
2347 tree decl = get_callee_fndecl (x);
2349 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
2350 cost = d->weights->target_builtin_call_cost;
2352 cost = d->weights->call_cost;
2354 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
2355 switch (DECL_FUNCTION_CODE (decl))
2357 case BUILT_IN_CONSTANT_P:
2360 case BUILT_IN_EXPECT:
2362 /* Prefetch instruction is not expensive. */
2363 case BUILT_IN_PREFETCH:
2370 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
2371 that does use function declaration to figure out the arguments. */
2375 call_expr_arg_iterator iter;
2376 FOR_EACH_CALL_EXPR_ARG (a, iter, x)
2377 d->count += estimate_move_cost (TREE_TYPE (a));
2382 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2383 d->count += estimate_move_cost (TREE_TYPE (arg));
2399 case OMP_ATOMIC_LOAD:
2400 /* OpenMP directives are generally very expensive. */
2401 d->count += d->weights->omp_cost;
2410 /* Estimate number of instructions that will be created by expanding EXPR.
2411 WEIGHTS contains weights attributed to various constructs. */
2414 estimate_num_insns (tree expr, eni_weights *weights)
2416 struct pointer_set_t *visited_nodes;
2418 block_stmt_iterator bsi;
2419 struct function *my_function;
2420 struct eni_data data;
2423 data.weights = weights;
2425 /* If we're given an entire function, walk the CFG. */
2426 if (TREE_CODE (expr) == FUNCTION_DECL)
2428 my_function = DECL_STRUCT_FUNCTION (expr);
2429 gcc_assert (my_function && my_function->cfg);
2430 visited_nodes = pointer_set_create ();
2431 FOR_EACH_BB_FN (bb, my_function)
2433 for (bsi = bsi_start (bb);
2437 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
2438 &data, visited_nodes);
2441 pointer_set_destroy (visited_nodes);
2444 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &data);
2449 /* Initializes weights used by estimate_num_insns. */
2452 init_inline_once (void)
2454 eni_inlining_weights.call_cost = PARAM_VALUE (PARAM_INLINE_CALL_COST);
2455 eni_inlining_weights.target_builtin_call_cost = 1;
2456 eni_inlining_weights.div_mod_cost = 10;
2457 eni_inlining_weights.switch_cost = 1;
2458 eni_inlining_weights.omp_cost = 40;
2460 eni_size_weights.call_cost = 1;
2461 eni_size_weights.target_builtin_call_cost = 1;
2462 eni_size_weights.div_mod_cost = 1;
2463 eni_size_weights.switch_cost = 10;
2464 eni_size_weights.omp_cost = 40;
2466 /* Estimating time for call is difficult, since we have no idea what the
2467 called function does. In the current uses of eni_time_weights,
2468 underestimating the cost does less harm than overestimating it, so
2469 we choose a rather small value here. */
2470 eni_time_weights.call_cost = 10;
2471 eni_time_weights.target_builtin_call_cost = 10;
2472 eni_time_weights.div_mod_cost = 10;
2473 eni_time_weights.switch_cost = 4;
2474 eni_time_weights.omp_cost = 40;
2477 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
2479 add_lexical_block (tree current_block, tree new_block)
2483 /* Walk to the last sub-block. */
2484 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
2486 blk_p = &TREE_CHAIN (*blk_p))
2489 BLOCK_SUPERCONTEXT (new_block) = current_block;
2492 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
2495 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
2501 struct pointer_map_t *st;
2504 location_t saved_location;
2505 struct cgraph_edge *cg_edge;
2507 basic_block return_block;
2509 block_stmt_iterator bsi, stmt_bsi;
2510 bool successfully_inlined = FALSE;
2511 bool purge_dead_abnormal_edges;
2515 /* See what we've got. */
2516 id = (copy_body_data *) data;
2519 /* Set input_location here so we get the right instantiation context
2520 if we call instantiate_decl from inlinable_function_p. */
2521 saved_location = input_location;
2522 if (EXPR_HAS_LOCATION (t))
2523 input_location = EXPR_LOCATION (t);
2525 /* From here on, we're only interested in CALL_EXPRs. */
2526 if (TREE_CODE (t) != CALL_EXPR)
2529 /* First, see if we can figure out what function is being called.
2530 If we cannot, then there is no hope of inlining the function. */
2531 fn = get_callee_fndecl (t);
2535 /* Turn forward declarations into real ones. */
2536 fn = cgraph_node (fn)->decl;
2538 /* If fn is a declaration of a function in a nested scope that was
2539 globally declared inline, we don't set its DECL_INITIAL.
2540 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
2541 C++ front-end uses it for cdtors to refer to their internal
2542 declarations, that are not real functions. Fortunately those
2543 don't have trees to be saved, so we can tell by checking their
2545 if (! DECL_INITIAL (fn)
2546 && DECL_ABSTRACT_ORIGIN (fn)
2547 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
2548 fn = DECL_ABSTRACT_ORIGIN (fn);
2550 /* Objective C and fortran still calls tree_rest_of_compilation directly.
2551 Kill this check once this is fixed. */
2552 if (!id->dst_node->analyzed)
2555 cg_edge = cgraph_edge (id->dst_node, stmt);
2557 /* Constant propagation on argument done during previous inlining
2558 may create new direct call. Produce an edge for it. */
2561 struct cgraph_node *dest = cgraph_node (fn);
2563 /* We have missing edge in the callgraph. This can happen in one case
2564 where previous inlining turned indirect call into direct call by
2565 constant propagating arguments. In all other cases we hit a bug
2566 (incorrect node sharing is most common reason for missing edges. */
2567 gcc_assert (dest->needed || !flag_unit_at_a_time);
2568 cgraph_create_edge (id->dst_node, dest, stmt,
2569 bb->count, CGRAPH_FREQ_BASE,
2570 bb->loop_depth)->inline_failed
2571 = N_("originally indirect function call not considered for inlining");
2574 fprintf (dump_file, "Created new direct edge to %s",
2575 cgraph_node_name (dest));
2580 /* Don't try to inline functions that are not well-suited to
2582 if (!cgraph_inline_p (cg_edge, &reason))
2584 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
2585 /* Avoid warnings during early inline pass. */
2586 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2588 sorry ("inlining failed in call to %q+F: %s", fn, reason);
2589 sorry ("called from here");
2591 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
2592 && !DECL_IN_SYSTEM_HEADER (fn)
2594 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
2595 /* Avoid warnings during early inline pass. */
2596 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2598 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
2600 warning (OPT_Winline, "called from here");
2604 fn = cg_edge->callee->decl;
2606 #ifdef ENABLE_CHECKING
2607 if (cg_edge->callee->decl != id->dst_node->decl)
2608 verify_cgraph_node (cg_edge->callee);
2611 /* We will be inlining this callee. */
2612 id->eh_region = lookup_stmt_eh_region (stmt);
2614 /* Split the block holding the CALL_EXPR. */
2615 e = split_block (bb, stmt);
2617 return_block = e->dest;
2620 /* split_block splits after the statement; work around this by
2621 moving the call into the second block manually. Not pretty,
2622 but seems easier than doing the CFG manipulation by hand
2623 when the CALL_EXPR is in the last statement of BB. */
2624 stmt_bsi = bsi_last (bb);
2625 bsi_remove (&stmt_bsi, false);
2627 /* If the CALL_EXPR was in the last statement of BB, it may have
2628 been the source of abnormal edges. In this case, schedule
2629 the removal of dead abnormal edges. */
2630 bsi = bsi_start (return_block);
2631 if (bsi_end_p (bsi))
2633 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2634 purge_dead_abnormal_edges = true;
2638 bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
2639 purge_dead_abnormal_edges = false;
2642 stmt_bsi = bsi_start (return_block);
2644 /* Build a block containing code to initialize the arguments, the
2645 actual inline expansion of the body, and a label for the return
2646 statements within the function to jump to. The type of the
2647 statement expression is the return type of the function call. */
2648 id->block = make_node (BLOCK);
2649 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2650 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2651 add_lexical_block (TREE_BLOCK (stmt), id->block);
2653 /* Local declarations will be replaced by their equivalents in this
2656 id->decl_map = pointer_map_create ();
2658 /* Record the function we are about to inline. */
2660 id->src_node = cg_edge->callee;
2661 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
2664 initialize_inlined_parameters (id, t, fn, bb);
2666 if (DECL_INITIAL (fn))
2667 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2669 /* Return statements in the function body will be replaced by jumps
2670 to the RET_LABEL. */
2672 gcc_assert (DECL_INITIAL (fn));
2673 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2675 /* Find the lhs to which the result of this call is assigned. */
2677 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
2679 modify_dest = GIMPLE_STMT_OPERAND (stmt, 0);
2681 /* The function which we are inlining might not return a value,
2682 in which case we should issue a warning that the function
2683 does not return a value. In that case the optimizers will
2684 see that the variable to which the value is assigned was not
2685 initialized. We do not want to issue a warning about that
2686 uninitialized variable. */
2687 if (DECL_P (modify_dest))
2688 TREE_NO_WARNING (modify_dest) = 1;
2689 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2691 return_slot = modify_dest;
2698 /* Declare the return variable for the function. */
2699 declare_return_variable (id, return_slot,
2700 modify_dest, &use_retvar);
2702 /* This is it. Duplicate the callee body. Assume callee is
2703 pre-gimplified. Note that we must not alter the caller
2704 function in any way before this point, as this CALL_EXPR may be
2705 a self-referential call; if we're calling ourselves, we need to
2706 duplicate our body before altering anything. */
2707 copy_body (id, bb->count, bb->frequency, bb, return_block);
2709 /* Add local vars in this inlined callee to caller. */
2710 t_step = id->src_cfun->unexpanded_var_list;
2711 for (; t_step; t_step = TREE_CHAIN (t_step))
2713 var = TREE_VALUE (t_step);
2714 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2715 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2716 cfun->unexpanded_var_list);
2718 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2719 cfun->unexpanded_var_list);
2723 pointer_map_destroy (id->decl_map);
2726 /* If the inlined function returns a result that we care about,
2727 clobber the CALL_EXPR with a reference to the return variable. */
2728 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2731 if (gimple_in_ssa_p (cfun))
2734 mark_symbols_for_renaming (stmt);
2736 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2739 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2740 tsi_delink() will leave the iterator in a sane state. */
2742 /* Handle case of inlining function that miss return statement so
2743 return value becomes undefined. */
2744 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
2745 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 0)) == SSA_NAME)
2747 tree name = TREE_OPERAND (stmt, 0);
2748 tree var = SSA_NAME_VAR (TREE_OPERAND (stmt, 0));
2749 tree def = gimple_default_def (cfun, var);
2751 /* If the variable is used undefined, make this name undefined via
2755 TREE_OPERAND (stmt, 1) = def;
2758 /* Otherwise make this variable undefined. */
2761 bsi_remove (&stmt_bsi, true);
2762 set_default_def (var, name);
2763 SSA_NAME_DEF_STMT (name) = build_empty_stmt ();
2767 bsi_remove (&stmt_bsi, true);
2770 if (purge_dead_abnormal_edges)
2771 tree_purge_dead_abnormal_call_edges (return_block);
2773 /* If the value of the new expression is ignored, that's OK. We
2774 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2775 the equivalent inlined version either. */
2776 TREE_USED (*tp) = 1;
2778 /* Output the inlining info for this abstract function, since it has been
2779 inlined. If we don't do this now, we can lose the information about the
2780 variables in the function when the blocks get blown away as soon as we
2781 remove the cgraph node. */
2782 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2784 /* Update callgraph if needed. */
2785 cgraph_remove_node (cg_edge->callee);
2787 id->block = NULL_TREE;
2788 successfully_inlined = TRUE;
2791 input_location = saved_location;
2792 return successfully_inlined;
2795 /* Expand call statements reachable from STMT_P.
2796 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2797 in a GIMPLE_MODIFY_STMT. See tree-gimple.c:get_call_expr_in(). We can
2798 unfortunately not use that function here because we need a pointer
2799 to the CALL_EXPR, not the tree itself. */
2802 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2804 block_stmt_iterator bsi;
2806 /* Register specific tree functions. */
2807 tree_register_cfg_hooks ();
2808 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2810 tree *expr_p = bsi_stmt_ptr (bsi);
2811 tree stmt = *expr_p;
2813 if (TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT)
2814 expr_p = &GIMPLE_STMT_OPERAND (*expr_p, 1);
2815 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2816 expr_p = &TREE_OPERAND (*expr_p, 0);
2817 if (TREE_CODE (*expr_p) == CALL_EXPR)
2818 if (expand_call_inline (bb, stmt, expr_p, id))
2824 /* Walk all basic blocks created after FIRST and try to fold every statement
2825 in the STATEMENTS pointer set. */
2827 fold_marked_statements (int first, struct pointer_set_t *statements)
2829 for (;first < n_basic_blocks;first++)
2830 if (BASIC_BLOCK (first))
2832 block_stmt_iterator bsi;
2833 for (bsi = bsi_start (BASIC_BLOCK (first));
2834 !bsi_end_p (bsi); bsi_next (&bsi))
2835 if (pointer_set_contains (statements, bsi_stmt (bsi)))
2837 tree old_stmt = bsi_stmt (bsi);
2838 if (fold_stmt (bsi_stmt_ptr (bsi)))
2840 update_stmt (bsi_stmt (bsi));
2841 if (maybe_clean_or_replace_eh_stmt (old_stmt, bsi_stmt (bsi)))
2842 tree_purge_dead_eh_edges (BASIC_BLOCK (first));
2848 /* Return true if BB has at least one abnormal outgoing edge. */
2851 has_abnormal_outgoing_edge_p (basic_block bb)
2856 FOR_EACH_EDGE (e, ei, bb->succs)
2857 if (e->flags & EDGE_ABNORMAL)
2863 /* Expand calls to inline functions in the body of FN. */
2866 optimize_inline_calls (tree fn)
2871 int last = n_basic_blocks;
2872 /* There is no point in performing inlining if errors have already
2873 occurred -- and we might crash if we try to inline invalid
2875 if (errorcount || sorrycount)
2879 memset (&id, 0, sizeof (id));
2881 id.src_node = id.dst_node = cgraph_node (fn);
2883 /* Or any functions that aren't finished yet. */
2884 prev_fn = NULL_TREE;
2885 if (current_function_decl)
2887 id.dst_fn = current_function_decl;
2888 prev_fn = current_function_decl;
2891 id.copy_decl = copy_decl_maybe_to_var;
2892 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2893 id.transform_new_cfg = false;
2894 id.transform_return_to_modify = true;
2895 id.transform_lang_insert_block = false;
2896 id.statements_to_fold = pointer_set_create ();
2898 push_gimplify_context ();
2900 /* We make no attempts to keep dominance info up-to-date. */
2901 free_dominance_info (CDI_DOMINATORS);
2902 free_dominance_info (CDI_POST_DOMINATORS);
2904 /* Reach the trees by walking over the CFG, and note the
2905 enclosing basic-blocks in the call edges. */
2906 /* We walk the blocks going forward, because inlined function bodies
2907 will split id->current_basic_block, and the new blocks will
2908 follow it; we'll trudge through them, processing their CALL_EXPRs
2911 gimple_expand_calls_inline (bb, &id);
2913 pop_gimplify_context (NULL);
2915 #ifdef ENABLE_CHECKING
2917 struct cgraph_edge *e;
2919 verify_cgraph_node (id.dst_node);
2921 /* Double check that we inlined everything we are supposed to inline. */
2922 for (e = id.dst_node->callees; e; e = e->next_callee)
2923 gcc_assert (e->inline_failed);
2927 /* Fold the statements before compacting/renumbering the basic blocks. */
2928 fold_marked_statements (last, id.statements_to_fold);
2929 pointer_set_destroy (id.statements_to_fold);
2931 /* Renumber the (code) basic_blocks consecutively. */
2933 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2936 /* We are not going to maintain the cgraph edges up to date.
2937 Kill it so it won't confuse us. */
2938 cgraph_node_remove_callees (id.dst_node);
2940 fold_cond_expr_cond ();
2941 /* It would be nice to check SSA/CFG/statement consistency here, but it is
2942 not possible yet - the IPA passes might make various functions to not
2943 throw and they don't care to proactively update local EH info. This is
2944 done later in fixup_cfg pass that also execute the verification. */
2945 return (TODO_update_ssa | TODO_cleanup_cfg
2946 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
2947 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
2950 /* FN is a function that has a complete body, and CLONE is a function whose
2951 body is to be set to a copy of FN, mapping argument declarations according
2952 to the ARG_MAP splay_tree. */
2955 clone_body (tree clone, tree fn, void *arg_map)
2959 /* Clone the body, as if we were making an inline call. But, remap the
2960 parameters in the callee to the parameters of caller. */
2961 memset (&id, 0, sizeof (id));
2964 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
2965 id.decl_map = (struct pointer_map_t *)arg_map;
2967 id.copy_decl = copy_decl_no_change;
2968 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2969 id.transform_new_cfg = true;
2970 id.transform_return_to_modify = false;
2971 id.transform_lang_insert_block = true;
2973 /* We're not inside any EH region. */
2976 /* Actually copy the body. */
2977 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
2980 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2983 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2985 enum tree_code code = TREE_CODE (*tp);
2986 enum tree_code_class cl = TREE_CODE_CLASS (code);
2988 /* We make copies of most nodes. */
2989 if (IS_EXPR_CODE_CLASS (cl)
2990 || IS_GIMPLE_STMT_CODE_CLASS (cl)
2991 || code == TREE_LIST
2993 || code == TYPE_DECL
2994 || code == OMP_CLAUSE)
2996 /* Because the chain gets clobbered when we make a copy, we save it
2998 tree chain = NULL_TREE, new;
3000 if (!GIMPLE_TUPLE_P (*tp))
3001 chain = TREE_CHAIN (*tp);
3003 /* Copy the node. */
3004 new = copy_node (*tp);
3006 /* Propagate mudflap marked-ness. */
3007 if (flag_mudflap && mf_marked_p (*tp))
3012 /* Now, restore the chain, if appropriate. That will cause
3013 walk_tree to walk into the chain as well. */
3014 if (code == PARM_DECL
3015 || code == TREE_LIST
3016 || code == OMP_CLAUSE)
3017 TREE_CHAIN (*tp) = chain;
3019 /* For now, we don't update BLOCKs when we make copies. So, we
3020 have to nullify all BIND_EXPRs. */
3021 if (TREE_CODE (*tp) == BIND_EXPR)
3022 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
3024 else if (code == CONSTRUCTOR)
3026 /* CONSTRUCTOR nodes need special handling because
3027 we need to duplicate the vector of elements. */
3030 new = copy_node (*tp);
3032 /* Propagate mudflap marked-ness. */
3033 if (flag_mudflap && mf_marked_p (*tp))
3036 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
3037 CONSTRUCTOR_ELTS (*tp));
3040 else if (TREE_CODE_CLASS (code) == tcc_type)
3042 else if (TREE_CODE_CLASS (code) == tcc_declaration)
3044 else if (TREE_CODE_CLASS (code) == tcc_constant)
3047 gcc_assert (code != STATEMENT_LIST);
3051 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3052 information indicating to what new SAVE_EXPR this one should be mapped,
3053 use that one. Otherwise, create a new node and enter it in ST. FN is
3054 the function into which the copy will be placed. */
3057 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
3059 struct pointer_map_t *st = (struct pointer_map_t *) st_;
3063 /* See if we already encountered this SAVE_EXPR. */
3064 n = (tree *) pointer_map_contains (st, *tp);
3066 /* If we didn't already remap this SAVE_EXPR, do so now. */
3069 t = copy_node (*tp);
3071 /* Remember this SAVE_EXPR. */
3072 *pointer_map_insert (st, *tp) = t;
3073 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3074 *pointer_map_insert (st, t) = t;
3078 /* We've already walked into this SAVE_EXPR; don't do it again. */
3083 /* Replace this SAVE_EXPR with the copy. */
3087 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3088 copies the declaration and enters it in the splay_tree in DATA (which is
3089 really an `copy_body_data *'). */
3092 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3095 copy_body_data *id = (copy_body_data *) data;
3097 /* Don't walk into types. */
3101 else if (TREE_CODE (*tp) == LABEL_EXPR)
3103 tree decl = TREE_OPERAND (*tp, 0);
3105 /* Copy the decl and remember the copy. */
3106 insert_decl_map (id, decl, id->copy_decl (decl, id));
3112 /* Perform any modifications to EXPR required when it is unsaved. Does
3113 not recurse into EXPR's subtrees. */
3116 unsave_expr_1 (tree expr)
3118 switch (TREE_CODE (expr))
3121 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3122 It's OK for this to happen if it was part of a subtree that
3123 isn't immediately expanded, such as operand 2 of another
3125 if (TREE_OPERAND (expr, 1))
3128 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3129 TREE_OPERAND (expr, 3) = NULL_TREE;
3137 /* Called via walk_tree when an expression is unsaved. Using the
3138 splay_tree pointed to by ST (which is really a `splay_tree'),
3139 remaps all local declarations to appropriate replacements. */
3142 unsave_r (tree *tp, int *walk_subtrees, void *data)
3144 copy_body_data *id = (copy_body_data *) data;
3145 struct pointer_map_t *st = id->decl_map;
3148 /* Only a local declaration (variable or label). */
3149 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3150 || TREE_CODE (*tp) == LABEL_DECL)
3152 /* Lookup the declaration. */
3153 n = (tree *) pointer_map_contains (st, *tp);
3155 /* If it's there, remap it. */
3160 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3161 copy_statement_list (tp);
3162 else if (TREE_CODE (*tp) == BIND_EXPR)
3163 copy_bind_expr (tp, walk_subtrees, id);
3164 else if (TREE_CODE (*tp) == SAVE_EXPR)
3165 remap_save_expr (tp, st, walk_subtrees);
3168 copy_tree_r (tp, walk_subtrees, NULL);
3170 /* Do whatever unsaving is required. */
3171 unsave_expr_1 (*tp);
3174 /* Keep iterating. */
3178 /* Copies everything in EXPR and replaces variables, labels
3179 and SAVE_EXPRs local to EXPR. */
3182 unsave_expr_now (tree expr)
3186 /* There's nothing to do for NULL_TREE. */
3191 memset (&id, 0, sizeof (id));
3192 id.src_fn = current_function_decl;
3193 id.dst_fn = current_function_decl;
3194 id.decl_map = pointer_map_create ();
3196 id.copy_decl = copy_decl_no_change;
3197 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3198 id.transform_new_cfg = false;
3199 id.transform_return_to_modify = false;
3200 id.transform_lang_insert_block = false;
3202 /* Walk the tree once to find local labels. */
3203 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3205 /* Walk the tree again, copying, remapping, and unsaving. */
3206 walk_tree (&expr, unsave_r, &id, NULL);
3209 pointer_map_destroy (id.decl_map);
3214 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
3217 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
3226 debug_find_tree (tree top, tree search)
3228 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
3232 /* Declare the variables created by the inliner. Add all the variables in
3233 VARS to BIND_EXPR. */
3236 declare_inline_vars (tree block, tree vars)
3239 for (t = vars; t; t = TREE_CHAIN (t))
3241 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
3242 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
3243 cfun->unexpanded_var_list =
3244 tree_cons (NULL_TREE, t,
3245 cfun->unexpanded_var_list);
3249 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
3253 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
3254 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
3255 VAR_DECL translation. */
3258 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
3260 /* Don't generate debug information for the copy if we wouldn't have
3261 generated it for the copy either. */
3262 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
3263 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
3265 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
3266 declaration inspired this copy. */
3267 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
3269 /* The new variable/label has no RTL, yet. */
3270 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
3271 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
3272 SET_DECL_RTL (copy, NULL_RTX);
3274 /* These args would always appear unused, if not for this. */
3275 TREE_USED (copy) = 1;
3277 /* Set the context for the new declaration. */
3278 if (!DECL_CONTEXT (decl))
3279 /* Globals stay global. */
3281 else if (DECL_CONTEXT (decl) != id->src_fn)
3282 /* Things that weren't in the scope of the function we're inlining
3283 from aren't in the scope we're inlining to, either. */
3285 else if (TREE_STATIC (decl))
3286 /* Function-scoped static variables should stay in the original
3290 /* Ordinary automatic local variables are now in the scope of the
3292 DECL_CONTEXT (copy) = id->dst_fn;
3298 copy_decl_to_var (tree decl, copy_body_data *id)
3302 gcc_assert (TREE_CODE (decl) == PARM_DECL
3303 || TREE_CODE (decl) == RESULT_DECL);
3305 type = TREE_TYPE (decl);
3307 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3308 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3309 TREE_READONLY (copy) = TREE_READONLY (decl);
3310 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3311 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3312 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3314 return copy_decl_for_dup_finish (id, decl, copy);
3317 /* Like copy_decl_to_var, but create a return slot object instead of a
3318 pointer variable for return by invisible reference. */
3321 copy_result_decl_to_var (tree decl, copy_body_data *id)
3325 gcc_assert (TREE_CODE (decl) == PARM_DECL
3326 || TREE_CODE (decl) == RESULT_DECL);
3328 type = TREE_TYPE (decl);
3329 if (DECL_BY_REFERENCE (decl))
3330 type = TREE_TYPE (type);
3332 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3333 TREE_READONLY (copy) = TREE_READONLY (decl);
3334 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3335 if (!DECL_BY_REFERENCE (decl))
3337 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3338 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3339 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3342 return copy_decl_for_dup_finish (id, decl, copy);
3347 copy_decl_no_change (tree decl, copy_body_data *id)
3351 copy = copy_node (decl);
3353 /* The COPY is not abstract; it will be generated in DST_FN. */
3354 DECL_ABSTRACT (copy) = 0;
3355 lang_hooks.dup_lang_specific_decl (copy);
3357 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
3358 been taken; it's for internal bookkeeping in expand_goto_internal. */
3359 if (TREE_CODE (copy) == LABEL_DECL)
3361 TREE_ADDRESSABLE (copy) = 0;
3362 LABEL_DECL_UID (copy) = -1;
3365 return copy_decl_for_dup_finish (id, decl, copy);
3369 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
3371 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
3372 return copy_decl_to_var (decl, id);
3374 return copy_decl_no_change (decl, id);
3377 /* Return a copy of the function's argument tree. */
3379 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
3381 tree *arg_copy, *parg;
3383 arg_copy = &orig_parm;
3384 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
3386 tree new = remap_decl (*parg, id);
3387 lang_hooks.dup_lang_specific_decl (new);
3388 TREE_CHAIN (new) = TREE_CHAIN (*parg);
3394 /* Return a copy of the function's static chain. */
3396 copy_static_chain (tree static_chain, copy_body_data * id)
3398 tree *chain_copy, *pvar;
3400 chain_copy = &static_chain;
3401 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
3403 tree new = remap_decl (*pvar, id);
3404 lang_hooks.dup_lang_specific_decl (new);
3405 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
3408 return static_chain;
3411 /* Return true if the function is allowed to be versioned.
3412 This is a guard for the versioning functionality. */
3414 tree_versionable_function_p (tree fndecl)
3416 if (fndecl == NULL_TREE)
3418 /* ??? There are cases where a function is
3419 uninlinable but can be versioned. */
3420 if (!tree_inlinable_function_p (fndecl))
3426 /* Create a copy of a function's tree.
3427 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
3428 of the original function and the new copied function
3429 respectively. In case we want to replace a DECL
3430 tree with another tree while duplicating the function's
3431 body, TREE_MAP represents the mapping between these
3432 trees. If UPDATE_CLONES is set, the call_stmt fields
3433 of edges of clones of the function will be updated. */
3435 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
3438 struct cgraph_node *old_version_node;
3439 struct cgraph_node *new_version_node;
3443 struct ipa_replace_map *replace_info;
3444 basic_block old_entry_block;
3446 tree old_current_function_decl = current_function_decl;
3448 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
3449 && TREE_CODE (new_decl) == FUNCTION_DECL);
3450 DECL_POSSIBLY_INLINED (old_decl) = 1;
3452 old_version_node = cgraph_node (old_decl);
3453 new_version_node = cgraph_node (new_decl);
3455 DECL_ARTIFICIAL (new_decl) = 1;
3456 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
3458 /* Prepare the data structures for the tree copy. */
3459 memset (&id, 0, sizeof (id));
3461 /* Generate a new name for the new version. */
3464 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
3465 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
3466 SET_DECL_RTL (new_decl, NULL_RTX);
3467 id.statements_to_fold = pointer_set_create ();
3470 id.decl_map = pointer_map_create ();
3471 id.src_fn = old_decl;
3472 id.dst_fn = new_decl;
3473 id.src_node = old_version_node;
3474 id.dst_node = new_version_node;
3475 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
3477 id.copy_decl = copy_decl_no_change;
3478 id.transform_call_graph_edges
3479 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
3480 id.transform_new_cfg = true;
3481 id.transform_return_to_modify = false;
3482 id.transform_lang_insert_block = false;
3484 current_function_decl = new_decl;
3485 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
3486 (DECL_STRUCT_FUNCTION (old_decl));
3487 initialize_cfun (new_decl, old_decl,
3488 old_entry_block->count,
3489 old_entry_block->frequency);
3490 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
3492 /* Copy the function's static chain. */
3493 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
3495 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
3496 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
3498 /* Copy the function's arguments. */
3499 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
3500 DECL_ARGUMENTS (new_decl) =
3501 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
3503 /* If there's a tree_map, prepare for substitution. */
3505 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
3507 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
3508 if (replace_info->replace_p)
3509 insert_decl_map (&id, replace_info->old_tree,
3510 replace_info->new_tree);
3513 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
3515 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3516 number_blocks (id.dst_fn);
3518 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
3519 /* Add local vars. */
3520 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
3521 t_step; t_step = TREE_CHAIN (t_step))
3523 tree var = TREE_VALUE (t_step);
3524 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3525 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
3526 cfun->unexpanded_var_list);
3528 cfun->unexpanded_var_list =
3529 tree_cons (NULL_TREE, remap_decl (var, &id),
3530 cfun->unexpanded_var_list);
3533 /* Copy the Function's body. */
3534 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
3536 if (DECL_RESULT (old_decl) != NULL_TREE)
3538 tree *res_decl = &DECL_RESULT (old_decl);
3539 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
3540 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
3543 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3544 number_blocks (new_decl);
3547 pointer_map_destroy (id.decl_map);
3550 fold_marked_statements (0, id.statements_to_fold);
3551 pointer_set_destroy (id.statements_to_fold);
3552 fold_cond_expr_cond ();
3554 if (gimple_in_ssa_p (cfun))
3556 free_dominance_info (CDI_DOMINATORS);
3557 free_dominance_info (CDI_POST_DOMINATORS);
3559 delete_unreachable_blocks ();
3560 update_ssa (TODO_update_ssa);
3563 fold_cond_expr_cond ();
3564 if (need_ssa_update_p ())
3565 update_ssa (TODO_update_ssa);
3568 free_dominance_info (CDI_DOMINATORS);
3569 free_dominance_info (CDI_POST_DOMINATORS);
3571 current_function_decl = old_current_function_decl;
3572 gcc_assert (!current_function_decl
3573 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
3577 /* Duplicate a type, fields and all. */
3580 build_duplicate_type (tree type)
3582 struct copy_body_data id;
3584 memset (&id, 0, sizeof (id));
3585 id.src_fn = current_function_decl;
3586 id.dst_fn = current_function_decl;
3588 id.decl_map = pointer_map_create ();
3590 type = remap_type_1 (type, &id);
3592 pointer_map_destroy (id.decl_map);