2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "tree-inline.h"
34 #include "insn-config.h"
37 #include "langhooks.h"
38 #include "basic-block.h"
39 #include "tree-iterator.h"
42 #include "tree-mudflap.h"
43 #include "tree-flow.h"
46 #include "tree-flow.h"
47 #include "diagnostic.h"
50 #include "pointer-set.h"
52 #include "value-prof.h"
53 #include "tree-pass.h"
55 #include "integrate.h"
57 /* I'm not real happy about this, but we need to handle gimple and
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 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new)
190 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
191 TREE_TYPE (new) = TREE_TYPE (SSA_NAME_VAR (new));
192 if (IS_EMPTY_STMT (SSA_NAME_DEF_STMT (name)))
194 /* By inlining function having uninitialized variable, we might
195 extend the lifetime (variable might get reused). This cause
196 ICE in the case we end up extending lifetime of SSA name across
197 abnormal edge, but also increase register presure.
199 We simply initialize all uninitialized vars by 0 except for case
200 we are inlining to very first BB. We can avoid this for all
201 BBs that are not withing strongly connected regions of the CFG,
202 but this is bit expensive to test.
204 if (id->entry_bb && is_gimple_reg (SSA_NAME_VAR (name))
205 && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
206 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
207 || EDGE_COUNT (id->entry_bb->preds) != 1))
209 block_stmt_iterator bsi = bsi_last (id->entry_bb);
211 = build_gimple_modify_stmt (new,
212 fold_convert (TREE_TYPE (new),
214 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
215 SSA_NAME_DEF_STMT (new) = init_stmt;
216 SSA_NAME_IS_DEFAULT_DEF (new) = 0;
220 SSA_NAME_DEF_STMT (new) = build_empty_stmt ();
221 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name)) == name)
222 set_default_def (SSA_NAME_VAR (new), new);
227 insert_decl_map (id, name, new);
231 /* Remap DECL during the copying of the BLOCK tree for the function. */
234 remap_decl (tree decl, copy_body_data *id)
239 /* We only remap local variables in the current function. */
242 /* See if we have remapped this declaration. */
244 n = (tree *) pointer_map_contains (id->decl_map, decl);
246 /* If we didn't already have an equivalent for this declaration,
250 /* Make a copy of the variable or label. */
251 tree t = id->copy_decl (decl, id);
253 /* Remember it, so that if we encounter this local entity again
254 we can reuse this copy. Do this early because remap_type may
255 need this decl for TYPE_STUB_DECL. */
256 insert_decl_map (id, decl, t);
261 /* Remap types, if necessary. */
262 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
263 if (TREE_CODE (t) == TYPE_DECL)
264 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
266 /* Remap sizes as necessary. */
267 walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
268 walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
270 /* If fields, do likewise for offset and qualifier. */
271 if (TREE_CODE (t) == FIELD_DECL)
273 walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
274 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
275 walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
278 if (cfun && gimple_in_ssa_p (cfun)
279 && (TREE_CODE (t) == VAR_DECL
280 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
282 tree def = gimple_default_def (id->src_cfun, decl);
284 if (TREE_CODE (decl) != PARM_DECL && def)
286 tree map = remap_ssa_name (def, id);
287 /* Watch out RESULT_DECLs whose SSA names map directly
289 if (TREE_CODE (map) == SSA_NAME
290 && IS_EMPTY_STMT (SSA_NAME_DEF_STMT (map)))
291 set_default_def (t, map);
293 add_referenced_var (t);
298 return unshare_expr (*n);
302 remap_type_1 (tree type, copy_body_data *id)
306 /* We do need a copy. build and register it now. If this is a pointer or
307 reference type, remap the designated type and make a new pointer or
309 if (TREE_CODE (type) == POINTER_TYPE)
311 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
313 TYPE_REF_CAN_ALIAS_ALL (type));
314 insert_decl_map (id, type, new);
317 else if (TREE_CODE (type) == REFERENCE_TYPE)
319 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
321 TYPE_REF_CAN_ALIAS_ALL (type));
322 insert_decl_map (id, type, new);
326 new = copy_node (type);
328 insert_decl_map (id, type, new);
330 /* This is a new type, not a copy of an old type. Need to reassociate
331 variants. We can handle everything except the main variant lazily. */
332 t = TYPE_MAIN_VARIANT (type);
335 t = remap_type (t, id);
336 TYPE_MAIN_VARIANT (new) = t;
337 TYPE_NEXT_VARIANT (new) = TYPE_NEXT_VARIANT (t);
338 TYPE_NEXT_VARIANT (t) = new;
342 TYPE_MAIN_VARIANT (new) = new;
343 TYPE_NEXT_VARIANT (new) = NULL;
346 if (TYPE_STUB_DECL (type))
347 TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
349 /* Lazily create pointer and reference types. */
350 TYPE_POINTER_TO (new) = NULL;
351 TYPE_REFERENCE_TO (new) = NULL;
353 switch (TREE_CODE (new))
357 case FIXED_POINT_TYPE:
360 t = TYPE_MIN_VALUE (new);
361 if (t && TREE_CODE (t) != INTEGER_CST)
362 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
364 t = TYPE_MAX_VALUE (new);
365 if (t && TREE_CODE (t) != INTEGER_CST)
366 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
370 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
371 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
375 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
376 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
381 case QUAL_UNION_TYPE:
385 for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
387 t = remap_decl (f, id);
388 DECL_CONTEXT (t) = new;
392 TYPE_FIELDS (new) = nreverse (nf);
398 /* Shouldn't have been thought variable sized. */
402 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
403 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
409 remap_type (tree type, copy_body_data *id)
416 /* See if we have remapped this type. */
417 node = (tree *) pointer_map_contains (id->decl_map, type);
421 /* The type only needs remapping if it's variably modified. */
422 if (! variably_modified_type_p (type, id->src_fn))
424 insert_decl_map (id, type, type);
428 return remap_type_1 (type, id);
432 remap_decls (tree decls, copy_body_data *id)
435 tree new_decls = NULL_TREE;
437 /* Remap its variables. */
438 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
442 /* We can not chain the local static declarations into the unexpanded_var_list
443 as we can't duplicate them or break one decl rule. Go ahead and link
444 them into unexpanded_var_list. */
445 if (!auto_var_in_fn_p (old_var, id->src_fn)
446 && !DECL_EXTERNAL (old_var))
448 cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
449 cfun->unexpanded_var_list);
453 /* Remap the variable. */
454 new_var = remap_decl (old_var, id);
456 /* If we didn't remap this variable, so we can't mess with its
457 TREE_CHAIN. If we remapped this variable to the return slot, it's
458 already declared somewhere else, so don't declare it here. */
459 if (!new_var || new_var == id->retvar)
463 gcc_assert (DECL_P (new_var));
464 TREE_CHAIN (new_var) = new_decls;
469 return nreverse (new_decls);
472 /* Copy the BLOCK to contain remapped versions of the variables
473 therein. And hook the new block into the block-tree. */
476 remap_block (tree *block, copy_body_data *id)
482 /* Make the new block. */
484 new_block = make_node (BLOCK);
485 TREE_USED (new_block) = TREE_USED (old_block);
486 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
487 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
490 /* Remap its variables. */
491 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
495 if (id->transform_lang_insert_block)
496 lang_hooks.decls.insert_block (new_block);
498 /* Remember the remapped block. */
499 insert_decl_map (id, old_block, new_block);
502 /* Copy the whole block tree and root it in id->block. */
504 remap_blocks (tree block, copy_body_data *id)
512 remap_block (&new, id);
513 gcc_assert (new != block);
514 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
515 add_lexical_block (new, remap_blocks (t, id));
520 copy_statement_list (tree *tp)
522 tree_stmt_iterator oi, ni;
525 new = alloc_stmt_list ();
526 ni = tsi_start (new);
527 oi = tsi_start (*tp);
530 for (; !tsi_end_p (oi); tsi_next (&oi))
531 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
535 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
537 tree block = BIND_EXPR_BLOCK (*tp);
538 /* Copy (and replace) the statement. */
539 copy_tree_r (tp, walk_subtrees, NULL);
542 remap_block (&block, id);
543 BIND_EXPR_BLOCK (*tp) = block;
546 if (BIND_EXPR_VARS (*tp))
547 /* This will remap a lot of the same decls again, but this should be
549 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
552 /* Called from copy_body_id via walk_tree. DATA is really an
553 `copy_body_data *'. */
556 copy_body_r (tree *tp, int *walk_subtrees, void *data)
558 copy_body_data *id = (copy_body_data *) data;
559 tree fn = id->src_fn;
562 /* Begin by recognizing trees that we'll completely rewrite for the
563 inlining context. Our output for these trees is completely
564 different from out input (e.g. RETURN_EXPR is deleted, and morphs
565 into an edge). Further down, we'll handle trees that get
566 duplicated and/or tweaked. */
568 /* When requested, RETURN_EXPRs should be transformed to just the
569 contained GIMPLE_MODIFY_STMT. The branch semantics of the return will
570 be handled elsewhere by manipulating the CFG rather than a statement. */
571 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
573 tree assignment = TREE_OPERAND (*tp, 0);
575 /* If we're returning something, just turn that into an
576 assignment into the equivalent of the original RESULT_DECL.
577 If the "assignment" is just the result decl, the result
578 decl has already been set (e.g. a recent "foo (&result_decl,
579 ...)"); just toss the entire RETURN_EXPR. */
580 if (assignment && TREE_CODE (assignment) == GIMPLE_MODIFY_STMT)
582 /* Replace the RETURN_EXPR with (a copy of) the
583 GIMPLE_MODIFY_STMT hanging underneath. */
584 *tp = copy_node (assignment);
586 else /* Else the RETURN_EXPR returns no value. */
589 return (tree) (void *)1;
592 else if (TREE_CODE (*tp) == SSA_NAME)
594 *tp = remap_ssa_name (*tp, id);
599 /* Local variables and labels need to be replaced by equivalent
600 variables. We don't want to copy static variables; there's only
601 one of those, no matter how many times we inline the containing
602 function. Similarly for globals from an outer function. */
603 else if (auto_var_in_fn_p (*tp, fn))
607 /* Remap the declaration. */
608 new_decl = remap_decl (*tp, id);
609 gcc_assert (new_decl);
610 /* Replace this variable with the copy. */
611 STRIP_TYPE_NOPS (new_decl);
615 else if (TREE_CODE (*tp) == STATEMENT_LIST)
616 copy_statement_list (tp);
617 else if (TREE_CODE (*tp) == SAVE_EXPR)
618 remap_save_expr (tp, id->decl_map, walk_subtrees);
619 else if (TREE_CODE (*tp) == LABEL_DECL
620 && (! DECL_CONTEXT (*tp)
621 || decl_function_context (*tp) == id->src_fn))
622 /* These may need to be remapped for EH handling. */
623 *tp = remap_decl (*tp, id);
624 else if (TREE_CODE (*tp) == BIND_EXPR)
625 copy_bind_expr (tp, walk_subtrees, id);
626 /* Types may need remapping as well. */
627 else if (TYPE_P (*tp))
628 *tp = remap_type (*tp, id);
630 /* If this is a constant, we have to copy the node iff the type will be
631 remapped. copy_tree_r will not copy a constant. */
632 else if (CONSTANT_CLASS_P (*tp))
634 tree new_type = remap_type (TREE_TYPE (*tp), id);
636 if (new_type == TREE_TYPE (*tp))
639 else if (TREE_CODE (*tp) == INTEGER_CST)
640 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
641 TREE_INT_CST_HIGH (*tp));
644 *tp = copy_node (*tp);
645 TREE_TYPE (*tp) = new_type;
649 /* Otherwise, just copy the node. Note that copy_tree_r already
650 knows not to copy VAR_DECLs, etc., so this is safe. */
653 /* Here we handle trees that are not completely rewritten.
654 First we detect some inlining-induced bogosities for
656 if (TREE_CODE (*tp) == GIMPLE_MODIFY_STMT
657 && GIMPLE_STMT_OPERAND (*tp, 0) == GIMPLE_STMT_OPERAND (*tp, 1)
658 && (auto_var_in_fn_p (GIMPLE_STMT_OPERAND (*tp, 0), fn)))
660 /* Some assignments VAR = VAR; don't generate any rtl code
661 and thus don't count as variable modification. Avoid
662 keeping bogosities like 0 = 0. */
663 tree decl = GIMPLE_STMT_OPERAND (*tp, 0), value;
666 n = (tree *) pointer_map_contains (id->decl_map, decl);
670 STRIP_TYPE_NOPS (value);
671 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
673 *tp = build_empty_stmt ();
674 return copy_body_r (tp, walk_subtrees, data);
678 else if (TREE_CODE (*tp) == INDIRECT_REF)
680 /* Get rid of *& from inline substitutions that can happen when a
681 pointer argument is an ADDR_EXPR. */
682 tree decl = TREE_OPERAND (*tp, 0);
685 n = (tree *) pointer_map_contains (id->decl_map, decl);
690 /* If we happen to get an ADDR_EXPR in n->value, strip
691 it manually here as we'll eventually get ADDR_EXPRs
692 which lie about their types pointed to. In this case
693 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
694 but we absolutely rely on that. As fold_indirect_ref
695 does other useful transformations, try that first, though. */
696 tree type = TREE_TYPE (TREE_TYPE (*n));
697 new = unshare_expr (*n);
699 *tp = gimple_fold_indirect_ref (new);
702 if (TREE_CODE (new) == ADDR_EXPR)
704 *tp = fold_indirect_ref_1 (type, new);
705 /* ??? We should either assert here or build
706 a VIEW_CONVERT_EXPR instead of blindly leaking
707 incompatible types to our IL. */
709 *tp = TREE_OPERAND (new, 0);
713 *tp = build1 (INDIRECT_REF, type, new);
714 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
722 /* Here is the "usual case". Copy this tree node, and then
723 tweak some special cases. */
724 copy_tree_r (tp, walk_subtrees, NULL);
726 /* Global variables we didn't seen yet needs to go into referenced
728 if (gimple_in_ssa_p (cfun) && TREE_CODE (*tp) == VAR_DECL)
729 add_referenced_var (*tp);
731 /* If EXPR has block defined, map it to newly constructed block.
732 When inlining we want EXPRs without block appear in the block
734 if (EXPR_P (*tp) || GIMPLE_STMT_P (*tp))
736 new_block = id->block;
737 if (TREE_BLOCK (*tp))
740 n = (tree *) pointer_map_contains (id->decl_map,
745 TREE_BLOCK (*tp) = new_block;
748 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
749 TREE_OPERAND (*tp, 0) =
752 id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
754 if (!GIMPLE_TUPLE_P (*tp) && TREE_CODE (*tp) != OMP_CLAUSE)
755 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
757 /* The copied TARGET_EXPR has never been expanded, even if the
758 original node was expanded already. */
759 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
761 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
762 TREE_OPERAND (*tp, 3) = NULL_TREE;
765 /* Variable substitution need not be simple. In particular, the
766 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
767 and friends are up-to-date. */
768 else if (TREE_CODE (*tp) == ADDR_EXPR)
770 int invariant = TREE_INVARIANT (*tp);
771 walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
772 /* Handle the case where we substituted an INDIRECT_REF
773 into the operand of the ADDR_EXPR. */
774 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
775 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
777 recompute_tree_invariant_for_addr_expr (*tp);
778 /* If this used to be invariant, but is not any longer,
779 then regimplification is probably needed. */
780 if (invariant && !TREE_INVARIANT (*tp))
781 id->regimplify = true;
786 /* Keep iterating. */
790 /* Copy basic block, scale profile accordingly. Edges will be taken care of
794 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
796 block_stmt_iterator bsi, copy_bsi;
797 basic_block copy_basic_block;
799 /* create_basic_block() will append every new block to
800 basic_block_info automatically. */
801 copy_basic_block = create_basic_block (NULL, (void *) 0,
802 (basic_block) bb->prev_bb->aux);
803 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
805 /* We are going to rebuild frequencies from scratch. These values have just
806 small importance to drive canonicalize_loop_headers. */
807 copy_basic_block->frequency = ((gcov_type)bb->frequency
808 * frequency_scale / REG_BR_PROB_BASE);
809 if (copy_basic_block->frequency > BB_FREQ_MAX)
810 copy_basic_block->frequency = BB_FREQ_MAX;
811 copy_bsi = bsi_start (copy_basic_block);
813 for (bsi = bsi_start (bb);
814 !bsi_end_p (bsi); bsi_next (&bsi))
816 tree stmt = bsi_stmt (bsi);
817 tree orig_stmt = stmt;
819 id->regimplify = false;
820 walk_tree (&stmt, copy_body_r, id, NULL);
822 /* RETURN_EXPR might be removed,
823 this is signalled by making stmt pointer NULL. */
828 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
830 /* With return slot optimization we can end up with
831 non-gimple (foo *)&this->m, fix that here. */
832 if ((TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
833 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 1)) == NOP_EXPR
834 && !is_gimple_val (TREE_OPERAND (GIMPLE_STMT_OPERAND (stmt, 1), 0)))
836 gimplify_stmt (&stmt);
838 bsi_insert_after (©_bsi, stmt, BSI_NEW_STMT);
840 /* Process new statement. gimplify_stmt possibly turned statement
841 into multiple statements, we need to process all of them. */
842 while (!bsi_end_p (copy_bsi))
844 tree *stmtp = bsi_stmt_ptr (copy_bsi);
846 call = get_call_expr_in (stmt);
848 if (call && CALL_EXPR_VA_ARG_PACK (call) && id->call_expr)
850 /* __builtin_va_arg_pack () should be replaced by
851 all arguments corresponding to ... in the caller. */
852 tree p, *argarray, new_call, *call_ptr;
853 int nargs = call_expr_nargs (id->call_expr);
855 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
858 argarray = (tree *) alloca ((nargs + call_expr_nargs (call))
861 memcpy (argarray, CALL_EXPR_ARGP (call),
862 call_expr_nargs (call) * sizeof (*argarray));
863 memcpy (argarray + call_expr_nargs (call),
864 CALL_EXPR_ARGP (id->call_expr)
865 + (call_expr_nargs (id->call_expr) - nargs),
866 nargs * sizeof (*argarray));
868 new_call = build_call_array (TREE_TYPE (call),
870 nargs + call_expr_nargs (call),
872 /* Copy all CALL_EXPR flags, locus and block, except
873 CALL_EXPR_VA_ARG_PACK flag. */
874 CALL_EXPR_STATIC_CHAIN (new_call)
875 = CALL_EXPR_STATIC_CHAIN (call);
876 CALL_EXPR_TAILCALL (new_call) = CALL_EXPR_TAILCALL (call);
877 CALL_EXPR_RETURN_SLOT_OPT (new_call)
878 = CALL_EXPR_RETURN_SLOT_OPT (call);
879 CALL_FROM_THUNK_P (new_call) = CALL_FROM_THUNK_P (call);
880 CALL_CANNOT_INLINE_P (new_call)
881 = CALL_CANNOT_INLINE_P (call);
882 TREE_NOTHROW (new_call) = TREE_NOTHROW (call);
883 SET_EXPR_LOCUS (new_call, EXPR_LOCUS (call));
884 TREE_BLOCK (new_call) = TREE_BLOCK (call);
887 if (TREE_CODE (*call_ptr) == GIMPLE_MODIFY_STMT)
888 call_ptr = &GIMPLE_STMT_OPERAND (*call_ptr, 1);
889 if (TREE_CODE (*call_ptr) == WITH_SIZE_EXPR)
890 call_ptr = &TREE_OPERAND (*call_ptr, 0);
891 gcc_assert (*call_ptr == call);
892 if (call_ptr == stmtp)
894 bsi_replace (©_bsi, new_call, true);
895 stmtp = bsi_stmt_ptr (copy_bsi);
900 *call_ptr = new_call;
907 && (decl = get_callee_fndecl (call))
908 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
909 && DECL_FUNCTION_CODE (decl)
910 == BUILT_IN_VA_ARG_PACK_LEN)
912 /* __builtin_va_arg_pack_len () should be replaced by
913 the number of anonymous arguments. */
914 int nargs = call_expr_nargs (id->call_expr);
915 tree count, *call_ptr, p;
917 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
920 count = build_int_cst (integer_type_node, nargs);
922 if (TREE_CODE (*call_ptr) == GIMPLE_MODIFY_STMT)
923 call_ptr = &GIMPLE_STMT_OPERAND (*call_ptr, 1);
924 if (TREE_CODE (*call_ptr) == WITH_SIZE_EXPR)
925 call_ptr = &TREE_OPERAND (*call_ptr, 0);
926 gcc_assert (*call_ptr == call && call_ptr != stmtp);
933 /* Statements produced by inlining can be unfolded, especially
934 when we constant propagated some operands. We can't fold
935 them right now for two reasons:
936 1) folding require SSA_NAME_DEF_STMTs to be correct
937 2) we can't change function calls to builtins.
938 So we just mark statement for later folding. We mark
939 all new statements, instead just statements that has changed
940 by some nontrivial substitution so even statements made
941 foldable indirectly are updated. If this turns out to be
942 expensive, copy_body can be told to watch for nontrivial
944 if (id->statements_to_fold)
945 pointer_set_insert (id->statements_to_fold, stmt);
946 /* We're duplicating a CALL_EXPR. Find any corresponding
947 callgraph edges and update or duplicate them. */
948 if (call && (decl = get_callee_fndecl (call)))
950 struct cgraph_node *node;
951 struct cgraph_edge *edge;
953 switch (id->transform_call_graph_edges)
955 case CB_CGE_DUPLICATE:
956 edge = cgraph_edge (id->src_node, orig_stmt);
958 cgraph_clone_edge (edge, id->dst_node, stmt,
959 REG_BR_PROB_BASE, 1, edge->frequency, true);
962 case CB_CGE_MOVE_CLONES:
963 for (node = id->dst_node->next_clone;
965 node = node->next_clone)
967 edge = cgraph_edge (node, orig_stmt);
969 cgraph_set_call_stmt (edge, stmt);
974 edge = cgraph_edge (id->dst_node, orig_stmt);
976 cgraph_set_call_stmt (edge, stmt);
983 /* If you think we can abort here, you are wrong.
984 There is no region 0 in tree land. */
985 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
988 if (tree_could_throw_p (stmt)
989 /* When we are cloning for inlining, we are supposed to
990 construct a clone that calls precisely the same functions
991 as original. However IPA optimizers might've proved
992 earlier some function calls as non-trapping that might
993 render some basic blocks dead that might become
996 We can't update SSA with unreachable blocks in CFG and thus
997 we prevent the scenario by preserving even the "dead" eh
998 edges until the point they are later removed by
1000 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
1001 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
1003 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
1004 /* Add an entry for the copied tree in the EH hashtable.
1005 When cloning or versioning, use the hashtable in
1006 cfun, and just copy the EH number. When inlining, use the
1007 hashtable in the caller, and adjust the region number. */
1009 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
1011 /* If this tree doesn't have a region associated with it,
1012 and there is a "current region,"
1013 then associate this tree with the current region
1014 and add edges associated with this region. */
1015 if ((lookup_stmt_eh_region_fn (id->src_cfun,
1017 && id->eh_region > 0)
1018 && tree_could_throw_p (stmt))
1019 add_stmt_to_eh_region (stmt, id->eh_region);
1021 if (gimple_in_ssa_p (cfun))
1026 find_new_referenced_vars (bsi_stmt_ptr (copy_bsi));
1027 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1028 if (TREE_CODE (def) == SSA_NAME)
1029 SSA_NAME_DEF_STMT (def) = stmt;
1031 bsi_next (©_bsi);
1033 copy_bsi = bsi_last (copy_basic_block);
1036 return copy_basic_block;
1039 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1040 form is quite easy, since dominator relationship for old basic blocks does
1043 There is however exception where inlining might change dominator relation
1044 across EH edges from basic block within inlined functions destinating
1045 to landing pads in function we inline into.
1047 The function fills in PHI_RESULTs of such PHI nodes if they refer
1048 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1049 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1050 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1051 set, and this means that there will be no overlapping live ranges
1052 for the underlying symbol.
1054 This might change in future if we allow redirecting of EH edges and
1055 we might want to change way build CFG pre-inlining to include
1056 all the possible edges then. */
1058 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1059 bool can_throw, bool nonlocal_goto)
1064 FOR_EACH_EDGE (e, ei, bb->succs)
1066 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1070 gcc_assert (e->flags & EDGE_ABNORMAL);
1072 gcc_assert (e->flags & EDGE_EH);
1074 gcc_assert (!(e->flags & EDGE_EH));
1075 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
1079 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1080 gcc_assert (!e->dest->aux);
1082 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
1083 (PHI_RESULT (phi)));
1085 if (!is_gimple_reg (PHI_RESULT (phi)))
1087 mark_sym_for_renaming
1088 (SSA_NAME_VAR (PHI_RESULT (phi)));
1092 re = find_edge (ret_bb, e->dest);
1094 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1095 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1097 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1098 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1103 /* Copy edges from BB into its copy constructed earlier, scale profile
1104 accordingly. Edges will be taken care of later. Assume aux
1105 pointers to point to the copies of each BB. */
1107 copy_edges_for_bb (basic_block bb, int count_scale, basic_block ret_bb)
1109 basic_block new_bb = (basic_block) bb->aux;
1112 block_stmt_iterator bsi;
1115 /* Use the indices from the original blocks to create edges for the
1117 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1118 if (!(old_edge->flags & EDGE_EH))
1122 flags = old_edge->flags;
1124 /* Return edges do get a FALLTHRU flag when the get inlined. */
1125 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1126 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1127 flags |= EDGE_FALLTHRU;
1128 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1129 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1130 new->probability = old_edge->probability;
1133 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1136 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
1139 bool can_throw, nonlocal_goto;
1141 copy_stmt = bsi_stmt (bsi);
1142 update_stmt (copy_stmt);
1143 if (gimple_in_ssa_p (cfun))
1144 mark_symbols_for_renaming (copy_stmt);
1145 /* Do this before the possible split_block. */
1148 /* If this tree could throw an exception, there are two
1149 cases where we need to add abnormal edge(s): the
1150 tree wasn't in a region and there is a "current
1151 region" in the caller; or the original tree had
1152 EH edges. In both cases split the block after the tree,
1153 and add abnormal edge(s) as needed; we need both
1154 those from the callee and the caller.
1155 We check whether the copy can throw, because the const
1156 propagation can change an INDIRECT_REF which throws
1157 into a COMPONENT_REF which doesn't. If the copy
1158 can throw, the original could also throw. */
1160 can_throw = tree_can_throw_internal (copy_stmt);
1161 nonlocal_goto = tree_can_make_abnormal_goto (copy_stmt);
1163 if (can_throw || nonlocal_goto)
1165 if (!bsi_end_p (bsi))
1166 /* Note that bb's predecessor edges aren't necessarily
1167 right at this point; split_block doesn't care. */
1169 edge e = split_block (new_bb, copy_stmt);
1172 new_bb->aux = e->src->aux;
1173 bsi = bsi_start (new_bb);
1178 make_eh_edges (copy_stmt);
1181 make_abnormal_goto_edges (bb_for_stmt (copy_stmt), true);
1183 if ((can_throw || nonlocal_goto)
1184 && gimple_in_ssa_p (cfun))
1185 update_ssa_across_abnormal_edges (bb_for_stmt (copy_stmt), ret_bb,
1186 can_throw, nonlocal_goto);
1190 /* Copy the PHIs. All blocks and edges are copied, some blocks
1191 was possibly split and new outgoing EH edges inserted.
1192 BB points to the block of original function and AUX pointers links
1193 the original and newly copied blocks. */
1196 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1198 basic_block new_bb = bb->aux;
1202 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1204 tree res = PHI_RESULT (phi);
1209 if (is_gimple_reg (res))
1211 walk_tree (&new_res, copy_body_r, id, NULL);
1212 SSA_NAME_DEF_STMT (new_res)
1213 = new_phi = create_phi_node (new_res, new_bb);
1214 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1216 edge old_edge = find_edge (new_edge->src->aux, bb);
1217 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1220 walk_tree (&new_arg, copy_body_r, id, NULL);
1221 gcc_assert (new_arg);
1222 /* With return slot optimization we can end up with
1223 non-gimple (foo *)&this->m, fix that here. */
1224 if (TREE_CODE (new_arg) != SSA_NAME
1225 && TREE_CODE (new_arg) != FUNCTION_DECL
1226 && !is_gimple_val (new_arg))
1228 tree stmts = NULL_TREE;
1229 new_arg = force_gimple_operand (new_arg, &stmts,
1231 bsi_insert_on_edge_immediate (new_edge, stmts);
1233 add_phi_arg (new_phi, new_arg, new_edge);
1239 /* Wrapper for remap_decl so it can be used as a callback. */
1241 remap_decl_1 (tree decl, void *data)
1243 return remap_decl (decl, (copy_body_data *) data);
1246 /* Build struct function and associated datastructures for the new clone
1247 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1250 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1253 struct function *new_cfun
1254 = (struct function *) ggc_alloc_cleared (sizeof (struct function));
1255 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1256 int count_scale, frequency_scale;
1258 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1259 count_scale = (REG_BR_PROB_BASE * count
1260 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1264 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1265 frequency_scale = (REG_BR_PROB_BASE * frequency
1267 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1269 frequency_scale = count_scale;
1271 /* Register specific tree functions. */
1272 tree_register_cfg_hooks ();
1273 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
1274 new_cfun->funcdef_no = get_next_funcdef_no ();
1275 VALUE_HISTOGRAMS (new_cfun) = NULL;
1276 new_cfun->unexpanded_var_list = NULL;
1277 new_cfun->cfg = NULL;
1278 new_cfun->decl = new_fndecl /*= copy_node (callee_fndecl)*/;
1279 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
1280 push_cfun (new_cfun);
1281 init_empty_tree_cfg ();
1283 ENTRY_BLOCK_PTR->count =
1284 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1286 ENTRY_BLOCK_PTR->frequency =
1287 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1288 frequency_scale / REG_BR_PROB_BASE);
1289 EXIT_BLOCK_PTR->count =
1290 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1292 EXIT_BLOCK_PTR->frequency =
1293 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1294 frequency_scale / REG_BR_PROB_BASE);
1296 init_eh_for_function ();
1298 if (src_cfun->gimple_df)
1301 cfun->gimple_df->in_ssa_p = true;
1302 init_ssa_operands ();
1307 /* Make a copy of the body of FN so that it can be inserted inline in
1308 another function. Walks FN via CFG, returns new fndecl. */
1311 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1312 basic_block entry_block_map, basic_block exit_block_map)
1314 tree callee_fndecl = id->src_fn;
1315 /* Original cfun for the callee, doesn't change. */
1316 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1317 struct function *cfun_to_copy;
1319 tree new_fndecl = NULL;
1320 int count_scale, frequency_scale;
1323 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1324 count_scale = (REG_BR_PROB_BASE * count
1325 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1329 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1330 frequency_scale = (REG_BR_PROB_BASE * frequency
1332 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1334 frequency_scale = count_scale;
1336 /* Register specific tree functions. */
1337 tree_register_cfg_hooks ();
1339 /* Must have a CFG here at this point. */
1340 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1341 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1343 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1346 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1347 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1348 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1349 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1351 /* Duplicate any exception-handling regions. */
1354 id->eh_region_offset
1355 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1358 /* Use aux pointers to map the original blocks to copy. */
1359 FOR_EACH_BB_FN (bb, cfun_to_copy)
1361 basic_block new = copy_bb (id, bb, frequency_scale, count_scale);
1366 last = last_basic_block;
1367 /* Now that we've duplicated the blocks, duplicate their edges. */
1368 FOR_ALL_BB_FN (bb, cfun_to_copy)
1369 copy_edges_for_bb (bb, count_scale, exit_block_map);
1370 if (gimple_in_ssa_p (cfun))
1371 FOR_ALL_BB_FN (bb, cfun_to_copy)
1372 copy_phis_for_bb (bb, id);
1373 FOR_ALL_BB_FN (bb, cfun_to_copy)
1375 ((basic_block)bb->aux)->aux = NULL;
1378 /* Zero out AUX fields of newly created block during EH edge
1380 for (; last < last_basic_block; last++)
1381 BASIC_BLOCK (last)->aux = NULL;
1382 entry_block_map->aux = NULL;
1383 exit_block_map->aux = NULL;
1388 /* Make a copy of the body of FN so that it can be inserted inline in
1389 another function. */
1392 copy_generic_body (copy_body_data *id)
1395 tree fndecl = id->src_fn;
1397 body = DECL_SAVED_TREE (fndecl);
1398 walk_tree (&body, copy_body_r, id, NULL);
1404 copy_body (copy_body_data *id, gcov_type count, int frequency,
1405 basic_block entry_block_map, basic_block exit_block_map)
1407 tree fndecl = id->src_fn;
1410 /* If this body has a CFG, walk CFG and copy. */
1411 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
1412 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
1417 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1418 defined in function FN, or of a data member thereof. */
1421 self_inlining_addr_expr (tree value, tree fn)
1425 if (TREE_CODE (value) != ADDR_EXPR)
1428 var = get_base_address (TREE_OPERAND (value, 0));
1430 return var && auto_var_in_fn_p (var, fn);
1434 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
1435 basic_block bb, tree *vars)
1441 tree def = (gimple_in_ssa_p (cfun)
1442 ? gimple_default_def (id->src_cfun, p) : NULL);
1445 && value != error_mark_node
1446 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
1447 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
1449 /* If the parameter is never assigned to, has no SSA_NAMEs created,
1450 we may not need to create a new variable here at all. Instead, we may
1451 be able to just use the argument value. */
1452 if (TREE_READONLY (p)
1453 && !TREE_ADDRESSABLE (p)
1454 && value && !TREE_SIDE_EFFECTS (value)
1457 /* We may produce non-gimple trees by adding NOPs or introduce
1458 invalid sharing when operand is not really constant.
1459 It is not big deal to prohibit constant propagation here as
1460 we will constant propagate in DOM1 pass anyway. */
1461 if (is_gimple_min_invariant (value)
1462 && useless_type_conversion_p (TREE_TYPE (p),
1464 /* We have to be very careful about ADDR_EXPR. Make sure
1465 the base variable isn't a local variable of the inlined
1466 function, e.g., when doing recursive inlining, direct or
1467 mutually-recursive or whatever, which is why we don't
1468 just test whether fn == current_function_decl. */
1469 && ! self_inlining_addr_expr (value, fn))
1471 insert_decl_map (id, p, value);
1476 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1477 here since the type of this decl must be visible to the calling
1479 var = copy_decl_to_var (p, id);
1480 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
1483 add_referenced_var (var);
1486 /* See if the frontend wants to pass this by invisible reference. If
1487 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1488 replace uses of the PARM_DECL with dereferences. */
1489 if (TREE_TYPE (var) != TREE_TYPE (p)
1490 && POINTER_TYPE_P (TREE_TYPE (var))
1491 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1493 insert_decl_map (id, var, var);
1494 var_sub = build_fold_indirect_ref (var);
1499 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1500 that way, when the PARM_DECL is encountered, it will be
1501 automatically replaced by the VAR_DECL. */
1502 insert_decl_map (id, p, var_sub);
1504 /* Declare this new variable. */
1505 TREE_CHAIN (var) = *vars;
1508 /* Make gimplifier happy about this variable. */
1509 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1511 /* Even if P was TREE_READONLY, the new VAR should not be.
1512 In the original code, we would have constructed a
1513 temporary, and then the function body would have never
1514 changed the value of P. However, now, we will be
1515 constructing VAR directly. The constructor body may
1516 change its value multiple times as it is being
1517 constructed. Therefore, it must not be TREE_READONLY;
1518 the back-end assumes that TREE_READONLY variable is
1519 assigned to only once. */
1520 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1521 TREE_READONLY (var) = 0;
1523 /* If there is no setup required and we are in SSA, take the easy route
1524 replacing all SSA names representing the function parameter by the
1525 SSA name passed to function.
1527 We need to construct map for the variable anyway as it might be used
1528 in different SSA names when parameter is set in function.
1530 FIXME: This usually kills the last connection in between inlined
1531 function parameter and the actual value in debug info. Can we do
1532 better here? If we just inserted the statement, copy propagation
1533 would kill it anyway as it always did in older versions of GCC.
1535 We might want to introduce a notion that single SSA_NAME might
1536 represent multiple variables for purposes of debugging. */
1537 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
1538 && (TREE_CODE (rhs) == SSA_NAME
1539 || is_gimple_min_invariant (rhs))
1540 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1542 insert_decl_map (id, def, rhs);
1546 /* If the value of argument is never used, don't care about initializing
1548 if (gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
1550 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
1554 /* Initialize this VAR_DECL from the equivalent argument. Convert
1555 the argument to the proper type in case it was promoted. */
1558 block_stmt_iterator bsi = bsi_last (bb);
1560 if (rhs == error_mark_node)
1562 insert_decl_map (id, p, var_sub);
1566 STRIP_USELESS_TYPE_CONVERSION (rhs);
1568 /* We want to use GIMPLE_MODIFY_STMT, not INIT_EXPR here so that we
1569 keep our trees in gimple form. */
1570 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
1572 def = remap_ssa_name (def, id);
1573 init_stmt = build_gimple_modify_stmt (def, rhs);
1574 SSA_NAME_DEF_STMT (def) = init_stmt;
1575 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
1576 set_default_def (var, NULL);
1579 init_stmt = build_gimple_modify_stmt (var, rhs);
1581 /* If we did not create a gimple value and we did not create a gimple
1582 cast of a gimple value, then we will need to gimplify INIT_STMTS
1583 at the end. Note that is_gimple_cast only checks the outer
1584 tree code, not its operand. Thus the explicit check that its
1585 operand is a gimple value. */
1586 if ((!is_gimple_val (rhs)
1587 && (!is_gimple_cast (rhs)
1588 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1589 || !is_gimple_reg (var))
1591 tree_stmt_iterator i;
1593 push_gimplify_context ();
1594 gimplify_stmt (&init_stmt);
1595 if (gimple_in_ssa_p (cfun)
1596 && init_stmt && TREE_CODE (init_stmt) == STATEMENT_LIST)
1598 /* The replacement can expose previously unreferenced
1600 for (i = tsi_start (init_stmt); !tsi_end_p (i); tsi_next (&i))
1601 find_new_referenced_vars (tsi_stmt_ptr (i));
1603 pop_gimplify_context (NULL);
1606 /* If VAR represents a zero-sized variable, it's possible that the
1607 assignment statment may result in no gimple statements. */
1609 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1610 if (gimple_in_ssa_p (cfun))
1611 for (;!bsi_end_p (bsi); bsi_next (&bsi))
1612 mark_symbols_for_renaming (bsi_stmt (bsi));
1616 /* Generate code to initialize the parameters of the function at the
1617 top of the stack in ID from the CALL_EXPR EXP. */
1620 initialize_inlined_parameters (copy_body_data *id, tree exp,
1621 tree fn, basic_block bb)
1626 tree vars = NULL_TREE;
1627 call_expr_arg_iterator iter;
1628 tree static_chain = CALL_EXPR_STATIC_CHAIN (exp);
1630 /* Figure out what the parameters are. */
1631 parms = DECL_ARGUMENTS (fn);
1633 /* Loop through the parameter declarations, replacing each with an
1634 equivalent VAR_DECL, appropriately initialized. */
1635 for (p = parms, a = first_call_expr_arg (exp, &iter); p;
1636 a = next_call_expr_arg (&iter), p = TREE_CHAIN (p))
1637 setup_one_parameter (id, p, a, fn, bb, &vars);
1639 /* Initialize the static chain. */
1640 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1641 gcc_assert (fn != current_function_decl);
1644 /* No static chain? Seems like a bug in tree-nested.c. */
1645 gcc_assert (static_chain);
1647 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1650 declare_inline_vars (id->block, vars);
1653 /* Declare a return variable to replace the RESULT_DECL for the
1654 function we are calling. An appropriate DECL_STMT is returned.
1655 The USE_STMT is filled to contain a use of the declaration to
1656 indicate the return value of the function.
1658 RETURN_SLOT, if non-null is place where to store the result. It
1659 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
1660 was the LHS of the GIMPLE_MODIFY_STMT to which this call is the RHS.
1662 The return value is a (possibly null) value that is the result of the
1663 function as seen by the callee. *USE_P is a (possibly null) value that
1664 holds the result as seen by the caller. */
1667 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
1670 tree callee = id->src_fn;
1671 tree caller = id->dst_fn;
1672 tree result = DECL_RESULT (callee);
1673 tree callee_type = TREE_TYPE (result);
1674 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1677 /* We don't need to do anything for functions that don't return
1679 if (!result || VOID_TYPE_P (callee_type))
1685 /* If there was a return slot, then the return value is the
1686 dereferenced address of that object. */
1689 /* The front end shouldn't have used both return_slot and
1690 a modify expression. */
1691 gcc_assert (!modify_dest);
1692 if (DECL_BY_REFERENCE (result))
1694 tree return_slot_addr = build_fold_addr_expr (return_slot);
1695 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
1697 /* We are going to construct *&return_slot and we can't do that
1698 for variables believed to be not addressable.
1700 FIXME: This check possibly can match, because values returned
1701 via return slot optimization are not believed to have address
1702 taken by alias analysis. */
1703 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
1704 if (gimple_in_ssa_p (cfun))
1706 HOST_WIDE_INT bitsize;
1707 HOST_WIDE_INT bitpos;
1709 enum machine_mode mode;
1713 base = get_inner_reference (return_slot, &bitsize, &bitpos,
1715 &mode, &unsignedp, &volatilep,
1717 if (TREE_CODE (base) == INDIRECT_REF)
1718 base = TREE_OPERAND (base, 0);
1719 if (TREE_CODE (base) == SSA_NAME)
1720 base = SSA_NAME_VAR (base);
1721 mark_sym_for_renaming (base);
1723 var = return_slot_addr;
1728 gcc_assert (TREE_CODE (var) != SSA_NAME);
1729 TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
1731 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1732 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1733 && !DECL_GIMPLE_REG_P (result)
1735 DECL_GIMPLE_REG_P (var) = 0;
1740 /* All types requiring non-trivial constructors should have been handled. */
1741 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1743 /* Attempt to avoid creating a new temporary variable. */
1745 && TREE_CODE (modify_dest) != SSA_NAME)
1747 bool use_it = false;
1749 /* We can't use MODIFY_DEST if there's type promotion involved. */
1750 if (!useless_type_conversion_p (callee_type, caller_type))
1753 /* ??? If we're assigning to a variable sized type, then we must
1754 reuse the destination variable, because we've no good way to
1755 create variable sized temporaries at this point. */
1756 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1759 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1760 reuse it as the result of the call directly. Don't do this if
1761 it would promote MODIFY_DEST to addressable. */
1762 else if (TREE_ADDRESSABLE (result))
1766 tree base_m = get_base_address (modify_dest);
1768 /* If the base isn't a decl, then it's a pointer, and we don't
1769 know where that's going to go. */
1770 if (!DECL_P (base_m))
1772 else if (is_global_var (base_m))
1774 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1775 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1776 && !DECL_GIMPLE_REG_P (result)
1777 && DECL_GIMPLE_REG_P (base_m))
1779 else if (!TREE_ADDRESSABLE (base_m))
1791 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1793 var = copy_result_decl_to_var (result, id);
1794 if (gimple_in_ssa_p (cfun))
1797 add_referenced_var (var);
1800 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1801 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1802 = tree_cons (NULL_TREE, var,
1803 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1805 /* Do not have the rest of GCC warn about this variable as it should
1806 not be visible to the user. */
1807 TREE_NO_WARNING (var) = 1;
1809 declare_inline_vars (id->block, var);
1811 /* Build the use expr. If the return type of the function was
1812 promoted, convert it back to the expected type. */
1814 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
1815 use = fold_convert (caller_type, var);
1817 STRIP_USELESS_TYPE_CONVERSION (use);
1819 if (DECL_BY_REFERENCE (result))
1820 var = build_fold_addr_expr (var);
1823 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1824 way, when the RESULT_DECL is encountered, it will be
1825 automatically replaced by the VAR_DECL. */
1826 insert_decl_map (id, result, var);
1828 /* Remember this so we can ignore it in remap_decls. */
1835 /* Returns nonzero if a function can be inlined as a tree. */
1838 tree_inlinable_function_p (tree fn)
1840 return inlinable_function_p (fn);
1843 static const char *inline_forbidden_reason;
1846 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1850 tree fn = (tree) fnp;
1853 switch (TREE_CODE (node))
1856 /* Refuse to inline alloca call unless user explicitly forced so as
1857 this may change program's memory overhead drastically when the
1858 function using alloca is called in loop. In GCC present in
1859 SPEC2000 inlining into schedule_block cause it to require 2GB of
1860 RAM instead of 256MB. */
1861 if (alloca_call_p (node)
1862 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1864 inline_forbidden_reason
1865 = G_("function %q+F can never be inlined because it uses "
1866 "alloca (override using the always_inline attribute)");
1869 t = get_callee_fndecl (node);
1873 /* We cannot inline functions that call setjmp. */
1874 if (setjmp_call_p (t))
1876 inline_forbidden_reason
1877 = G_("function %q+F can never be inlined because it uses setjmp");
1881 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1882 switch (DECL_FUNCTION_CODE (t))
1884 /* We cannot inline functions that take a variable number of
1886 case BUILT_IN_VA_START:
1887 case BUILT_IN_STDARG_START:
1888 case BUILT_IN_NEXT_ARG:
1889 case BUILT_IN_VA_END:
1890 inline_forbidden_reason
1891 = G_("function %q+F can never be inlined because it "
1892 "uses variable argument lists");
1895 case BUILT_IN_LONGJMP:
1896 /* We can't inline functions that call __builtin_longjmp at
1897 all. The non-local goto machinery really requires the
1898 destination be in a different function. If we allow the
1899 function calling __builtin_longjmp to be inlined into the
1900 function calling __builtin_setjmp, Things will Go Awry. */
1901 inline_forbidden_reason
1902 = G_("function %q+F can never be inlined because "
1903 "it uses setjmp-longjmp exception handling");
1906 case BUILT_IN_NONLOCAL_GOTO:
1908 inline_forbidden_reason
1909 = G_("function %q+F can never be inlined because "
1910 "it uses non-local goto");
1913 case BUILT_IN_RETURN:
1914 case BUILT_IN_APPLY_ARGS:
1915 /* If a __builtin_apply_args caller would be inlined,
1916 it would be saving arguments of the function it has
1917 been inlined into. Similarly __builtin_return would
1918 return from the function the inline has been inlined into. */
1919 inline_forbidden_reason
1920 = G_("function %q+F can never be inlined because "
1921 "it uses __builtin_return or __builtin_apply_args");
1930 t = TREE_OPERAND (node, 0);
1932 /* We will not inline a function which uses computed goto. The
1933 addresses of its local labels, which may be tucked into
1934 global storage, are of course not constant across
1935 instantiations, which causes unexpected behavior. */
1936 if (TREE_CODE (t) != LABEL_DECL)
1938 inline_forbidden_reason
1939 = G_("function %q+F can never be inlined "
1940 "because it contains a computed goto");
1946 t = TREE_OPERAND (node, 0);
1947 if (DECL_NONLOCAL (t))
1949 /* We cannot inline a function that receives a non-local goto
1950 because we cannot remap the destination label used in the
1951 function that is performing the non-local goto. */
1952 inline_forbidden_reason
1953 = G_("function %q+F can never be inlined "
1954 "because it receives a non-local goto");
1961 /* We cannot inline a function of the form
1963 void F (int i) { struct S { int ar[i]; } s; }
1965 Attempting to do so produces a catch-22.
1966 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1967 UNION_TYPE nodes, then it goes into infinite recursion on a
1968 structure containing a pointer to its own type. If it doesn't,
1969 then the type node for S doesn't get adjusted properly when
1972 ??? This is likely no longer true, but it's too late in the 4.0
1973 cycle to try to find out. This should be checked for 4.1. */
1974 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1975 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1977 inline_forbidden_reason
1978 = G_("function %q+F can never be inlined "
1979 "because it uses variable sized variables");
1991 inline_forbidden_p_2 (tree *nodep, int *walk_subtrees,
1995 tree fn = (tree) fnp;
1997 if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
1999 inline_forbidden_reason
2000 = G_("function %q+F can never be inlined "
2001 "because it saves address of local label in a static variable");
2011 /* Return subexpression representing possible alloca call, if any. */
2013 inline_forbidden_p (tree fndecl)
2015 location_t saved_loc = input_location;
2016 block_stmt_iterator bsi;
2018 tree ret = NULL_TREE;
2019 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2022 FOR_EACH_BB_FN (bb, fun)
2023 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2025 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
2026 inline_forbidden_p_1, fndecl);
2031 for (step = fun->unexpanded_var_list; step; step = TREE_CHAIN (step))
2033 tree decl = TREE_VALUE (step);
2034 if (TREE_CODE (decl) == VAR_DECL
2035 && TREE_STATIC (decl)
2036 && !DECL_EXTERNAL (decl)
2037 && DECL_INITIAL (decl))
2038 ret = walk_tree_without_duplicates (&DECL_INITIAL (decl),
2039 inline_forbidden_p_2, fndecl);
2045 input_location = saved_loc;
2049 /* Returns nonzero if FN is a function that does not have any
2050 fundamental inline blocking properties. */
2053 inlinable_function_p (tree fn)
2055 bool inlinable = true;
2059 /* If we've already decided this function shouldn't be inlined,
2060 there's no need to check again. */
2061 if (DECL_UNINLINABLE (fn))
2064 /* We only warn for functions declared `inline' by the user. */
2065 do_warning = (warn_inline
2067 && DECL_DECLARED_INLINE_P (fn)
2068 && !DECL_IN_SYSTEM_HEADER (fn));
2070 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2072 if (flag_really_no_inline
2073 && always_inline == NULL)
2076 warning (OPT_Winline, "function %q+F can never be inlined because it "
2077 "is suppressed using -fno-inline", fn);
2081 /* Don't auto-inline anything that might not be bound within
2082 this unit of translation. */
2083 else if (!DECL_DECLARED_INLINE_P (fn)
2084 && DECL_REPLACEABLE_P (fn))
2087 else if (!function_attribute_inlinable_p (fn))
2090 warning (OPT_Winline, "function %q+F can never be inlined because it "
2091 "uses attributes conflicting with inlining", fn);
2095 /* If we don't have the function body available, we can't inline it.
2096 However, this should not be recorded since we also get here for
2097 forward declared inline functions. Therefore, return at once. */
2098 if (!DECL_SAVED_TREE (fn))
2101 /* If we're not inlining at all, then we cannot inline this function. */
2102 else if (!flag_inline_trees)
2105 /* Only try to inline functions if DECL_INLINE is set. This should be
2106 true for all functions declared `inline', and for all other functions
2107 as well with -finline-functions.
2109 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
2110 it's the front-end that must set DECL_INLINE in this case, because
2111 dwarf2out loses if a function that does not have DECL_INLINE set is
2112 inlined anyway. That is why we have both DECL_INLINE and
2113 DECL_DECLARED_INLINE_P. */
2114 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
2115 here should be redundant. */
2116 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
2119 else if (inline_forbidden_p (fn))
2121 /* See if we should warn about uninlinable functions. Previously,
2122 some of these warnings would be issued while trying to expand
2123 the function inline, but that would cause multiple warnings
2124 about functions that would for example call alloca. But since
2125 this a property of the function, just one warning is enough.
2126 As a bonus we can now give more details about the reason why a
2127 function is not inlinable. */
2129 sorry (inline_forbidden_reason, fn);
2130 else if (do_warning)
2131 warning (OPT_Winline, inline_forbidden_reason, fn);
2136 /* Squirrel away the result so that we don't have to check again. */
2137 DECL_UNINLINABLE (fn) = !inlinable;
2142 /* Estimate the cost of a memory move. Use machine dependent
2143 word size and take possible memcpy call into account. */
2146 estimate_move_cost (tree type)
2150 size = int_size_in_bytes (type);
2152 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
2153 /* Cost of a memcpy call, 3 arguments and the call. */
2156 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
2159 /* Arguments for estimate_num_insns_1. */
2163 /* Used to return the number of insns. */
2166 /* Weights of various constructs. */
2167 eni_weights *weights;
2170 /* Used by estimate_num_insns. Estimate number of instructions seen
2171 by given statement. */
2174 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
2176 struct eni_data *d = data;
2180 if (IS_TYPE_OR_DECL_P (x))
2185 /* Assume that constants and references counts nothing. These should
2186 be majorized by amount of operations among them we count later
2187 and are common target of CSE and similar optimizations. */
2188 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
2191 switch (TREE_CODE (x))
2193 /* Containers have no cost. */
2200 case ALIGN_INDIRECT_REF:
2201 case MISALIGNED_INDIRECT_REF:
2203 case ARRAY_RANGE_REF:
2205 case EXC_PTR_EXPR: /* ??? */
2206 case FILTER_EXPR: /* ??? */
2209 case WITH_CLEANUP_EXPR:
2212 case VIEW_CONVERT_EXPR:
2217 case CASE_LABEL_EXPR:
2220 case EH_FILTER_EXPR:
2221 case STATEMENT_LIST:
2223 case NON_LVALUE_EXPR:
2226 case TRY_CATCH_EXPR:
2227 case TRY_FINALLY_EXPR:
2234 case WITH_SIZE_EXPR:
2238 case OMP_SECTIONS_SWITCH:
2239 case OMP_ATOMIC_STORE:
2242 /* We don't account constants for now. Assume that the cost is amortized
2243 by operations that do use them. We may re-consider this decision once
2244 we are able to optimize the tree before estimating its size and break
2245 out static initializers. */
2246 case IDENTIFIER_NODE:
2256 /* CHANGE_DYNAMIC_TYPE_EXPR explicitly expands to nothing. */
2257 case CHANGE_DYNAMIC_TYPE_EXPR:
2261 /* Try to estimate the cost of assignments. We have three cases to
2263 1) Simple assignments to registers;
2264 2) Stores to things that must live in memory. This includes
2265 "normal" stores to scalars, but also assignments of large
2266 structures, or constructors of big arrays;
2269 Let us look at the first two cases, assuming we have "a = b + C":
2270 <GIMPLE_MODIFY_STMT <var_decl "a">
2271 <plus_expr <var_decl "b"> <constant C>>
2272 If "a" is a GIMPLE register, the assignment to it is free on almost
2273 any target, because "a" usually ends up in a real register. Hence
2274 the only cost of this expression comes from the PLUS_EXPR, and we
2275 can ignore the GIMPLE_MODIFY_STMT.
2276 If "a" is not a GIMPLE register, the assignment to "a" will most
2277 likely be a real store, so the cost of the GIMPLE_MODIFY_STMT is the cost
2278 of moving something into "a", which we compute using the function
2281 The third case deals with TARGET_EXPRs, for which the semantics are
2282 that a temporary is assigned, unless the TARGET_EXPR itself is being
2283 assigned to something else. In the latter case we do not need the
2285 <GIMPLE_MODIFY_STMT <var_decl "a"> <target_expr>>, the
2286 GIMPLE_MODIFY_STMT is free. */
2288 case GIMPLE_MODIFY_STMT:
2289 /* Is the right and side a TARGET_EXPR? */
2290 if (TREE_CODE (GENERIC_TREE_OPERAND (x, 1)) == TARGET_EXPR)
2292 /* ... fall through ... */
2295 x = GENERIC_TREE_OPERAND (x, 0);
2296 /* Is this an assignments to a register? */
2297 if (is_gimple_reg (x))
2299 /* Otherwise it's a store, so fall through to compute the move cost. */
2302 d->count += estimate_move_cost (TREE_TYPE (x));
2305 /* Assign cost of 1 to usual operations.
2306 ??? We may consider mapping RTL costs to this. */
2311 case POINTER_PLUS_EXPR:
2315 case FIXED_CONVERT_EXPR:
2316 case FIX_TRUNC_EXPR:
2328 case VEC_LSHIFT_EXPR:
2329 case VEC_RSHIFT_EXPR:
2336 case TRUTH_ANDIF_EXPR:
2337 case TRUTH_ORIF_EXPR:
2338 case TRUTH_AND_EXPR:
2340 case TRUTH_XOR_EXPR:
2341 case TRUTH_NOT_EXPR:
2350 case UNORDERED_EXPR:
2361 case PREDECREMENT_EXPR:
2362 case PREINCREMENT_EXPR:
2363 case POSTDECREMENT_EXPR:
2364 case POSTINCREMENT_EXPR:
2368 case REALIGN_LOAD_EXPR:
2370 case REDUC_MAX_EXPR:
2371 case REDUC_MIN_EXPR:
2372 case REDUC_PLUS_EXPR:
2373 case WIDEN_SUM_EXPR:
2375 case VEC_WIDEN_MULT_HI_EXPR:
2376 case VEC_WIDEN_MULT_LO_EXPR:
2377 case VEC_UNPACK_HI_EXPR:
2378 case VEC_UNPACK_LO_EXPR:
2379 case VEC_UNPACK_FLOAT_HI_EXPR:
2380 case VEC_UNPACK_FLOAT_LO_EXPR:
2381 case VEC_PACK_TRUNC_EXPR:
2382 case VEC_PACK_SAT_EXPR:
2383 case VEC_PACK_FIX_TRUNC_EXPR:
2385 case WIDEN_MULT_EXPR:
2387 case VEC_EXTRACT_EVEN_EXPR:
2388 case VEC_EXTRACT_ODD_EXPR:
2389 case VEC_INTERLEAVE_HIGH_EXPR:
2390 case VEC_INTERLEAVE_LOW_EXPR:
2397 /* Take into account cost of the switch + guess 2 conditional jumps for
2400 TODO: once the switch expansion logic is sufficiently separated, we can
2401 do better job on estimating cost of the switch. */
2402 d->count += TREE_VEC_LENGTH (SWITCH_LABELS (x)) * 2;
2405 /* Few special cases of expensive operations. This is useful
2406 to avoid inlining on functions having too many of these. */
2407 case TRUNC_DIV_EXPR:
2409 case FLOOR_DIV_EXPR:
2410 case ROUND_DIV_EXPR:
2411 case EXACT_DIV_EXPR:
2412 case TRUNC_MOD_EXPR:
2414 case FLOOR_MOD_EXPR:
2415 case ROUND_MOD_EXPR:
2417 d->count += d->weights->div_mod_cost;
2421 tree decl = get_callee_fndecl (x);
2423 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
2424 cost = d->weights->target_builtin_call_cost;
2426 cost = d->weights->call_cost;
2428 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
2429 switch (DECL_FUNCTION_CODE (decl))
2431 case BUILT_IN_CONSTANT_P:
2434 case BUILT_IN_EXPECT:
2436 /* Prefetch instruction is not expensive. */
2437 case BUILT_IN_PREFETCH:
2444 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
2445 that does use function declaration to figure out the arguments. */
2449 call_expr_arg_iterator iter;
2450 FOR_EACH_CALL_EXPR_ARG (a, iter, x)
2451 d->count += estimate_move_cost (TREE_TYPE (a));
2456 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2457 d->count += estimate_move_cost (TREE_TYPE (arg));
2473 case OMP_ATOMIC_LOAD:
2474 /* OpenMP directives are generally very expensive. */
2475 d->count += d->weights->omp_cost;
2484 /* Estimate number of instructions that will be created by expanding EXPR.
2485 WEIGHTS contains weights attributed to various constructs. */
2488 estimate_num_insns (tree expr, eni_weights *weights)
2490 struct pointer_set_t *visited_nodes;
2492 block_stmt_iterator bsi;
2493 struct function *my_function;
2494 struct eni_data data;
2497 data.weights = weights;
2499 /* If we're given an entire function, walk the CFG. */
2500 if (TREE_CODE (expr) == FUNCTION_DECL)
2502 my_function = DECL_STRUCT_FUNCTION (expr);
2503 gcc_assert (my_function && my_function->cfg);
2504 visited_nodes = pointer_set_create ();
2505 FOR_EACH_BB_FN (bb, my_function)
2507 for (bsi = bsi_start (bb);
2511 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
2512 &data, visited_nodes);
2515 pointer_set_destroy (visited_nodes);
2518 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &data);
2523 /* Initializes weights used by estimate_num_insns. */
2526 init_inline_once (void)
2528 eni_inlining_weights.call_cost = PARAM_VALUE (PARAM_INLINE_CALL_COST);
2529 eni_inlining_weights.target_builtin_call_cost = 1;
2530 eni_inlining_weights.div_mod_cost = 10;
2531 eni_inlining_weights.omp_cost = 40;
2533 eni_size_weights.call_cost = 1;
2534 eni_size_weights.target_builtin_call_cost = 1;
2535 eni_size_weights.div_mod_cost = 1;
2536 eni_size_weights.omp_cost = 40;
2538 /* Estimating time for call is difficult, since we have no idea what the
2539 called function does. In the current uses of eni_time_weights,
2540 underestimating the cost does less harm than overestimating it, so
2541 we choose a rather small value here. */
2542 eni_time_weights.call_cost = 10;
2543 eni_time_weights.target_builtin_call_cost = 10;
2544 eni_time_weights.div_mod_cost = 10;
2545 eni_time_weights.omp_cost = 40;
2548 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
2550 add_lexical_block (tree current_block, tree new_block)
2554 /* Walk to the last sub-block. */
2555 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
2557 blk_p = &BLOCK_CHAIN (*blk_p))
2560 BLOCK_SUPERCONTEXT (new_block) = current_block;
2563 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
2566 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
2572 struct pointer_map_t *st;
2575 location_t saved_location;
2576 struct cgraph_edge *cg_edge;
2578 basic_block return_block;
2580 block_stmt_iterator bsi, stmt_bsi;
2581 bool successfully_inlined = FALSE;
2582 bool purge_dead_abnormal_edges;
2586 /* See what we've got. */
2587 id = (copy_body_data *) data;
2590 /* Set input_location here so we get the right instantiation context
2591 if we call instantiate_decl from inlinable_function_p. */
2592 saved_location = input_location;
2593 if (EXPR_HAS_LOCATION (t))
2594 input_location = EXPR_LOCATION (t);
2596 /* From here on, we're only interested in CALL_EXPRs. */
2597 if (TREE_CODE (t) != CALL_EXPR)
2600 /* First, see if we can figure out what function is being called.
2601 If we cannot, then there is no hope of inlining the function. */
2602 fn = get_callee_fndecl (t);
2606 /* Turn forward declarations into real ones. */
2607 fn = cgraph_node (fn)->decl;
2609 /* If fn is a declaration of a function in a nested scope that was
2610 globally declared inline, we don't set its DECL_INITIAL.
2611 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
2612 C++ front-end uses it for cdtors to refer to their internal
2613 declarations, that are not real functions. Fortunately those
2614 don't have trees to be saved, so we can tell by checking their
2616 if (! DECL_INITIAL (fn)
2617 && DECL_ABSTRACT_ORIGIN (fn)
2618 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
2619 fn = DECL_ABSTRACT_ORIGIN (fn);
2621 /* Objective C and fortran still calls tree_rest_of_compilation directly.
2622 Kill this check once this is fixed. */
2623 if (!id->dst_node->analyzed)
2626 cg_edge = cgraph_edge (id->dst_node, stmt);
2628 /* Constant propagation on argument done during previous inlining
2629 may create new direct call. Produce an edge for it. */
2632 struct cgraph_node *dest = cgraph_node (fn);
2634 /* We have missing edge in the callgraph. This can happen in one case
2635 where previous inlining turned indirect call into direct call by
2636 constant propagating arguments. In all other cases we hit a bug
2637 (incorrect node sharing is most common reason for missing edges. */
2638 gcc_assert (dest->needed || !flag_unit_at_a_time);
2639 cgraph_create_edge (id->dst_node, dest, stmt,
2640 bb->count, CGRAPH_FREQ_BASE,
2641 bb->loop_depth)->inline_failed
2642 = N_("originally indirect function call not considered for inlining");
2645 fprintf (dump_file, "Created new direct edge to %s",
2646 cgraph_node_name (dest));
2651 /* Don't try to inline functions that are not well-suited to
2653 if (!cgraph_inline_p (cg_edge, &reason))
2655 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
2656 /* Avoid warnings during early inline pass. */
2657 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2659 sorry ("inlining failed in call to %q+F: %s", fn, reason);
2660 sorry ("called from here");
2662 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
2663 && !DECL_IN_SYSTEM_HEADER (fn)
2665 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
2666 /* Avoid warnings during early inline pass. */
2667 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2669 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
2671 warning (OPT_Winline, "called from here");
2675 fn = cg_edge->callee->decl;
2677 #ifdef ENABLE_CHECKING
2678 if (cg_edge->callee->decl != id->dst_node->decl)
2679 verify_cgraph_node (cg_edge->callee);
2682 /* We will be inlining this callee. */
2683 id->eh_region = lookup_stmt_eh_region (stmt);
2685 /* Split the block holding the CALL_EXPR. */
2686 e = split_block (bb, stmt);
2688 return_block = e->dest;
2691 /* split_block splits after the statement; work around this by
2692 moving the call into the second block manually. Not pretty,
2693 but seems easier than doing the CFG manipulation by hand
2694 when the CALL_EXPR is in the last statement of BB. */
2695 stmt_bsi = bsi_last (bb);
2696 bsi_remove (&stmt_bsi, false);
2698 /* If the CALL_EXPR was in the last statement of BB, it may have
2699 been the source of abnormal edges. In this case, schedule
2700 the removal of dead abnormal edges. */
2701 bsi = bsi_start (return_block);
2702 if (bsi_end_p (bsi))
2704 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2705 purge_dead_abnormal_edges = true;
2709 bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
2710 purge_dead_abnormal_edges = false;
2713 stmt_bsi = bsi_start (return_block);
2715 /* Build a block containing code to initialize the arguments, the
2716 actual inline expansion of the body, and a label for the return
2717 statements within the function to jump to. The type of the
2718 statement expression is the return type of the function call. */
2719 id->block = make_node (BLOCK);
2720 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2721 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2722 add_lexical_block (TREE_BLOCK (stmt), id->block);
2724 /* Local declarations will be replaced by their equivalents in this
2727 id->decl_map = pointer_map_create ();
2729 /* Record the function we are about to inline. */
2731 id->src_node = cg_edge->callee;
2732 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
2735 gcc_assert (!id->src_cfun->after_inlining);
2738 initialize_inlined_parameters (id, t, fn, bb);
2740 if (DECL_INITIAL (fn))
2741 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2743 /* Return statements in the function body will be replaced by jumps
2744 to the RET_LABEL. */
2746 gcc_assert (DECL_INITIAL (fn));
2747 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2749 /* Find the lhs to which the result of this call is assigned. */
2751 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
2753 modify_dest = GIMPLE_STMT_OPERAND (stmt, 0);
2755 /* The function which we are inlining might not return a value,
2756 in which case we should issue a warning that the function
2757 does not return a value. In that case the optimizers will
2758 see that the variable to which the value is assigned was not
2759 initialized. We do not want to issue a warning about that
2760 uninitialized variable. */
2761 if (DECL_P (modify_dest))
2762 TREE_NO_WARNING (modify_dest) = 1;
2763 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2765 return_slot = modify_dest;
2772 /* Declare the return variable for the function. */
2773 declare_return_variable (id, return_slot,
2774 modify_dest, &use_retvar);
2776 /* This is it. Duplicate the callee body. Assume callee is
2777 pre-gimplified. Note that we must not alter the caller
2778 function in any way before this point, as this CALL_EXPR may be
2779 a self-referential call; if we're calling ourselves, we need to
2780 duplicate our body before altering anything. */
2781 copy_body (id, bb->count, bb->frequency, bb, return_block);
2783 /* Add local vars in this inlined callee to caller. */
2784 t_step = id->src_cfun->unexpanded_var_list;
2785 for (; t_step; t_step = TREE_CHAIN (t_step))
2787 var = TREE_VALUE (t_step);
2788 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2789 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2790 cfun->unexpanded_var_list);
2792 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2793 cfun->unexpanded_var_list);
2797 pointer_map_destroy (id->decl_map);
2800 /* If the inlined function returns a result that we care about,
2801 clobber the CALL_EXPR with a reference to the return variable. */
2802 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2805 if (gimple_in_ssa_p (cfun))
2808 mark_symbols_for_renaming (stmt);
2810 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2813 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2814 tsi_delink() will leave the iterator in a sane state. */
2816 /* Handle case of inlining function that miss return statement so
2817 return value becomes undefined. */
2818 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
2819 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 0)) == SSA_NAME)
2821 tree name = TREE_OPERAND (stmt, 0);
2822 tree var = SSA_NAME_VAR (TREE_OPERAND (stmt, 0));
2823 tree def = gimple_default_def (cfun, var);
2825 /* If the variable is used undefined, make this name undefined via
2829 TREE_OPERAND (stmt, 1) = def;
2832 /* Otherwise make this variable undefined. */
2835 bsi_remove (&stmt_bsi, true);
2836 set_default_def (var, name);
2837 SSA_NAME_DEF_STMT (name) = build_empty_stmt ();
2841 bsi_remove (&stmt_bsi, true);
2844 if (purge_dead_abnormal_edges)
2845 tree_purge_dead_abnormal_call_edges (return_block);
2847 /* If the value of the new expression is ignored, that's OK. We
2848 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2849 the equivalent inlined version either. */
2850 TREE_USED (*tp) = 1;
2852 /* Output the inlining info for this abstract function, since it has been
2853 inlined. If we don't do this now, we can lose the information about the
2854 variables in the function when the blocks get blown away as soon as we
2855 remove the cgraph node. */
2856 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2858 /* Update callgraph if needed. */
2859 cgraph_remove_node (cg_edge->callee);
2861 id->block = NULL_TREE;
2862 successfully_inlined = TRUE;
2865 input_location = saved_location;
2866 return successfully_inlined;
2869 /* Expand call statements reachable from STMT_P.
2870 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2871 in a GIMPLE_MODIFY_STMT. See tree-gimple.c:get_call_expr_in(). We can
2872 unfortunately not use that function here because we need a pointer
2873 to the CALL_EXPR, not the tree itself. */
2876 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2878 block_stmt_iterator bsi;
2880 /* Register specific tree functions. */
2881 tree_register_cfg_hooks ();
2882 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2884 tree *expr_p = bsi_stmt_ptr (bsi);
2885 tree stmt = *expr_p;
2887 if (TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT)
2888 expr_p = &GIMPLE_STMT_OPERAND (*expr_p, 1);
2889 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2890 expr_p = &TREE_OPERAND (*expr_p, 0);
2891 if (TREE_CODE (*expr_p) == CALL_EXPR)
2892 if (expand_call_inline (bb, stmt, expr_p, id))
2898 /* Walk all basic blocks created after FIRST and try to fold every statement
2899 in the STATEMENTS pointer set. */
2901 fold_marked_statements (int first, struct pointer_set_t *statements)
2903 for (;first < n_basic_blocks;first++)
2904 if (BASIC_BLOCK (first))
2906 block_stmt_iterator bsi;
2907 for (bsi = bsi_start (BASIC_BLOCK (first));
2908 !bsi_end_p (bsi); bsi_next (&bsi))
2909 if (pointer_set_contains (statements, bsi_stmt (bsi)))
2911 tree old_stmt = bsi_stmt (bsi);
2912 if (fold_stmt (bsi_stmt_ptr (bsi)))
2914 update_stmt (bsi_stmt (bsi));
2915 if (maybe_clean_or_replace_eh_stmt (old_stmt, bsi_stmt (bsi)))
2916 tree_purge_dead_eh_edges (BASIC_BLOCK (first));
2922 /* Return true if BB has at least one abnormal outgoing edge. */
2925 has_abnormal_outgoing_edge_p (basic_block bb)
2930 FOR_EACH_EDGE (e, ei, bb->succs)
2931 if (e->flags & EDGE_ABNORMAL)
2937 /* Expand calls to inline functions in the body of FN. */
2940 optimize_inline_calls (tree fn)
2945 int last = n_basic_blocks;
2946 /* There is no point in performing inlining if errors have already
2947 occurred -- and we might crash if we try to inline invalid
2949 if (errorcount || sorrycount)
2953 memset (&id, 0, sizeof (id));
2955 id.src_node = id.dst_node = cgraph_node (fn);
2957 /* Or any functions that aren't finished yet. */
2958 prev_fn = NULL_TREE;
2959 if (current_function_decl)
2961 id.dst_fn = current_function_decl;
2962 prev_fn = current_function_decl;
2965 id.copy_decl = copy_decl_maybe_to_var;
2966 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2967 id.transform_new_cfg = false;
2968 id.transform_return_to_modify = true;
2969 id.transform_lang_insert_block = false;
2970 id.statements_to_fold = pointer_set_create ();
2972 push_gimplify_context ();
2974 /* We make no attempts to keep dominance info up-to-date. */
2975 free_dominance_info (CDI_DOMINATORS);
2976 free_dominance_info (CDI_POST_DOMINATORS);
2978 /* Reach the trees by walking over the CFG, and note the
2979 enclosing basic-blocks in the call edges. */
2980 /* We walk the blocks going forward, because inlined function bodies
2981 will split id->current_basic_block, and the new blocks will
2982 follow it; we'll trudge through them, processing their CALL_EXPRs
2985 gimple_expand_calls_inline (bb, &id);
2987 pop_gimplify_context (NULL);
2989 #ifdef ENABLE_CHECKING
2991 struct cgraph_edge *e;
2993 verify_cgraph_node (id.dst_node);
2995 /* Double check that we inlined everything we are supposed to inline. */
2996 for (e = id.dst_node->callees; e; e = e->next_callee)
2997 gcc_assert (e->inline_failed);
3001 /* Fold the statements before compacting/renumbering the basic blocks. */
3002 fold_marked_statements (last, id.statements_to_fold);
3003 pointer_set_destroy (id.statements_to_fold);
3005 /* Renumber the (code) basic_blocks consecutively. */
3007 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3010 /* We are not going to maintain the cgraph edges up to date.
3011 Kill it so it won't confuse us. */
3012 cgraph_node_remove_callees (id.dst_node);
3014 fold_cond_expr_cond ();
3015 /* It would be nice to check SSA/CFG/statement consistency here, but it is
3016 not possible yet - the IPA passes might make various functions to not
3017 throw and they don't care to proactively update local EH info. This is
3018 done later in fixup_cfg pass that also execute the verification. */
3019 return (TODO_update_ssa | TODO_cleanup_cfg
3020 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
3021 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
3024 /* FN is a function that has a complete body, and CLONE is a function whose
3025 body is to be set to a copy of FN, mapping argument declarations according
3026 to the ARG_MAP splay_tree. */
3029 clone_body (tree clone, tree fn, void *arg_map)
3033 /* Clone the body, as if we were making an inline call. But, remap the
3034 parameters in the callee to the parameters of caller. */
3035 memset (&id, 0, sizeof (id));
3038 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
3039 id.decl_map = (struct pointer_map_t *)arg_map;
3041 id.copy_decl = copy_decl_no_change;
3042 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3043 id.transform_new_cfg = true;
3044 id.transform_return_to_modify = false;
3045 id.transform_lang_insert_block = true;
3047 /* We're not inside any EH region. */
3050 /* Actually copy the body. */
3051 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
3054 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
3057 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
3059 enum tree_code code = TREE_CODE (*tp);
3060 enum tree_code_class cl = TREE_CODE_CLASS (code);
3062 /* We make copies of most nodes. */
3063 if (IS_EXPR_CODE_CLASS (cl)
3064 || IS_GIMPLE_STMT_CODE_CLASS (cl)
3065 || code == TREE_LIST
3067 || code == TYPE_DECL
3068 || code == OMP_CLAUSE)
3070 /* Because the chain gets clobbered when we make a copy, we save it
3072 tree chain = NULL_TREE, new;
3074 if (!GIMPLE_TUPLE_P (*tp))
3075 chain = TREE_CHAIN (*tp);
3077 /* Copy the node. */
3078 new = copy_node (*tp);
3080 /* Propagate mudflap marked-ness. */
3081 if (flag_mudflap && mf_marked_p (*tp))
3086 /* Now, restore the chain, if appropriate. That will cause
3087 walk_tree to walk into the chain as well. */
3088 if (code == PARM_DECL
3089 || code == TREE_LIST
3090 || code == OMP_CLAUSE)
3091 TREE_CHAIN (*tp) = chain;
3093 /* For now, we don't update BLOCKs when we make copies. So, we
3094 have to nullify all BIND_EXPRs. */
3095 if (TREE_CODE (*tp) == BIND_EXPR)
3096 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
3098 else if (code == CONSTRUCTOR)
3100 /* CONSTRUCTOR nodes need special handling because
3101 we need to duplicate the vector of elements. */
3104 new = copy_node (*tp);
3106 /* Propagate mudflap marked-ness. */
3107 if (flag_mudflap && mf_marked_p (*tp))
3110 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
3111 CONSTRUCTOR_ELTS (*tp));
3114 else if (TREE_CODE_CLASS (code) == tcc_type)
3116 else if (TREE_CODE_CLASS (code) == tcc_declaration)
3118 else if (TREE_CODE_CLASS (code) == tcc_constant)
3121 gcc_assert (code != STATEMENT_LIST);
3125 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3126 information indicating to what new SAVE_EXPR this one should be mapped,
3127 use that one. Otherwise, create a new node and enter it in ST. FN is
3128 the function into which the copy will be placed. */
3131 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
3133 struct pointer_map_t *st = (struct pointer_map_t *) st_;
3137 /* See if we already encountered this SAVE_EXPR. */
3138 n = (tree *) pointer_map_contains (st, *tp);
3140 /* If we didn't already remap this SAVE_EXPR, do so now. */
3143 t = copy_node (*tp);
3145 /* Remember this SAVE_EXPR. */
3146 *pointer_map_insert (st, *tp) = t;
3147 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3148 *pointer_map_insert (st, t) = t;
3152 /* We've already walked into this SAVE_EXPR; don't do it again. */
3157 /* Replace this SAVE_EXPR with the copy. */
3161 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3162 copies the declaration and enters it in the splay_tree in DATA (which is
3163 really an `copy_body_data *'). */
3166 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3169 copy_body_data *id = (copy_body_data *) data;
3171 /* Don't walk into types. */
3175 else if (TREE_CODE (*tp) == LABEL_EXPR)
3177 tree decl = TREE_OPERAND (*tp, 0);
3179 /* Copy the decl and remember the copy. */
3180 insert_decl_map (id, decl, id->copy_decl (decl, id));
3186 /* Perform any modifications to EXPR required when it is unsaved. Does
3187 not recurse into EXPR's subtrees. */
3190 unsave_expr_1 (tree expr)
3192 switch (TREE_CODE (expr))
3195 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3196 It's OK for this to happen if it was part of a subtree that
3197 isn't immediately expanded, such as operand 2 of another
3199 if (TREE_OPERAND (expr, 1))
3202 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3203 TREE_OPERAND (expr, 3) = NULL_TREE;
3211 /* Called via walk_tree when an expression is unsaved. Using the
3212 splay_tree pointed to by ST (which is really a `splay_tree'),
3213 remaps all local declarations to appropriate replacements. */
3216 unsave_r (tree *tp, int *walk_subtrees, void *data)
3218 copy_body_data *id = (copy_body_data *) data;
3219 struct pointer_map_t *st = id->decl_map;
3222 /* Only a local declaration (variable or label). */
3223 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3224 || TREE_CODE (*tp) == LABEL_DECL)
3226 /* Lookup the declaration. */
3227 n = (tree *) pointer_map_contains (st, *tp);
3229 /* If it's there, remap it. */
3234 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3235 copy_statement_list (tp);
3236 else if (TREE_CODE (*tp) == BIND_EXPR)
3237 copy_bind_expr (tp, walk_subtrees, id);
3238 else if (TREE_CODE (*tp) == SAVE_EXPR)
3239 remap_save_expr (tp, st, walk_subtrees);
3242 copy_tree_r (tp, walk_subtrees, NULL);
3244 /* Do whatever unsaving is required. */
3245 unsave_expr_1 (*tp);
3248 /* Keep iterating. */
3252 /* Copies everything in EXPR and replaces variables, labels
3253 and SAVE_EXPRs local to EXPR. */
3256 unsave_expr_now (tree expr)
3260 /* There's nothing to do for NULL_TREE. */
3265 memset (&id, 0, sizeof (id));
3266 id.src_fn = current_function_decl;
3267 id.dst_fn = current_function_decl;
3268 id.decl_map = pointer_map_create ();
3270 id.copy_decl = copy_decl_no_change;
3271 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3272 id.transform_new_cfg = false;
3273 id.transform_return_to_modify = false;
3274 id.transform_lang_insert_block = false;
3276 /* Walk the tree once to find local labels. */
3277 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3279 /* Walk the tree again, copying, remapping, and unsaving. */
3280 walk_tree (&expr, unsave_r, &id, NULL);
3283 pointer_map_destroy (id.decl_map);
3288 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
3291 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
3300 debug_find_tree (tree top, tree search)
3302 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
3306 /* Declare the variables created by the inliner. Add all the variables in
3307 VARS to BIND_EXPR. */
3310 declare_inline_vars (tree block, tree vars)
3313 for (t = vars; t; t = TREE_CHAIN (t))
3315 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
3316 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
3317 cfun->unexpanded_var_list =
3318 tree_cons (NULL_TREE, t,
3319 cfun->unexpanded_var_list);
3323 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
3327 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
3328 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
3329 VAR_DECL translation. */
3332 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
3334 /* Don't generate debug information for the copy if we wouldn't have
3335 generated it for the copy either. */
3336 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
3337 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
3339 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
3340 declaration inspired this copy. */
3341 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
3343 /* The new variable/label has no RTL, yet. */
3344 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
3345 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
3346 SET_DECL_RTL (copy, NULL_RTX);
3348 /* These args would always appear unused, if not for this. */
3349 TREE_USED (copy) = 1;
3351 /* Set the context for the new declaration. */
3352 if (!DECL_CONTEXT (decl))
3353 /* Globals stay global. */
3355 else if (DECL_CONTEXT (decl) != id->src_fn)
3356 /* Things that weren't in the scope of the function we're inlining
3357 from aren't in the scope we're inlining to, either. */
3359 else if (TREE_STATIC (decl))
3360 /* Function-scoped static variables should stay in the original
3364 /* Ordinary automatic local variables are now in the scope of the
3366 DECL_CONTEXT (copy) = id->dst_fn;
3372 copy_decl_to_var (tree decl, copy_body_data *id)
3376 gcc_assert (TREE_CODE (decl) == PARM_DECL
3377 || TREE_CODE (decl) == RESULT_DECL);
3379 type = TREE_TYPE (decl);
3381 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3382 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3383 TREE_READONLY (copy) = TREE_READONLY (decl);
3384 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3385 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3386 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3388 return copy_decl_for_dup_finish (id, decl, copy);
3391 /* Like copy_decl_to_var, but create a return slot object instead of a
3392 pointer variable for return by invisible reference. */
3395 copy_result_decl_to_var (tree decl, copy_body_data *id)
3399 gcc_assert (TREE_CODE (decl) == PARM_DECL
3400 || TREE_CODE (decl) == RESULT_DECL);
3402 type = TREE_TYPE (decl);
3403 if (DECL_BY_REFERENCE (decl))
3404 type = TREE_TYPE (type);
3406 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3407 TREE_READONLY (copy) = TREE_READONLY (decl);
3408 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3409 if (!DECL_BY_REFERENCE (decl))
3411 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3412 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3413 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3416 return copy_decl_for_dup_finish (id, decl, copy);
3421 copy_decl_no_change (tree decl, copy_body_data *id)
3425 copy = copy_node (decl);
3427 /* The COPY is not abstract; it will be generated in DST_FN. */
3428 DECL_ABSTRACT (copy) = 0;
3429 lang_hooks.dup_lang_specific_decl (copy);
3431 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
3432 been taken; it's for internal bookkeeping in expand_goto_internal. */
3433 if (TREE_CODE (copy) == LABEL_DECL)
3435 TREE_ADDRESSABLE (copy) = 0;
3436 LABEL_DECL_UID (copy) = -1;
3439 return copy_decl_for_dup_finish (id, decl, copy);
3443 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
3445 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
3446 return copy_decl_to_var (decl, id);
3448 return copy_decl_no_change (decl, id);
3451 /* Return a copy of the function's argument tree. */
3453 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
3455 tree *arg_copy, *parg;
3457 arg_copy = &orig_parm;
3458 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
3460 tree new = remap_decl (*parg, id);
3461 lang_hooks.dup_lang_specific_decl (new);
3462 TREE_CHAIN (new) = TREE_CHAIN (*parg);
3468 /* Return a copy of the function's static chain. */
3470 copy_static_chain (tree static_chain, copy_body_data * id)
3472 tree *chain_copy, *pvar;
3474 chain_copy = &static_chain;
3475 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
3477 tree new = remap_decl (*pvar, id);
3478 lang_hooks.dup_lang_specific_decl (new);
3479 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
3482 return static_chain;
3485 /* Return true if the function is allowed to be versioned.
3486 This is a guard for the versioning functionality. */
3488 tree_versionable_function_p (tree fndecl)
3490 if (fndecl == NULL_TREE)
3492 /* ??? There are cases where a function is
3493 uninlinable but can be versioned. */
3494 if (!tree_inlinable_function_p (fndecl))
3500 /* Create a copy of a function's tree.
3501 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
3502 of the original function and the new copied function
3503 respectively. In case we want to replace a DECL
3504 tree with another tree while duplicating the function's
3505 body, TREE_MAP represents the mapping between these
3506 trees. If UPDATE_CLONES is set, the call_stmt fields
3507 of edges of clones of the function will be updated. */
3509 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
3512 struct cgraph_node *old_version_node;
3513 struct cgraph_node *new_version_node;
3517 struct ipa_replace_map *replace_info;
3518 basic_block old_entry_block;
3520 tree old_current_function_decl = current_function_decl;
3522 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
3523 && TREE_CODE (new_decl) == FUNCTION_DECL);
3524 DECL_POSSIBLY_INLINED (old_decl) = 1;
3526 old_version_node = cgraph_node (old_decl);
3527 new_version_node = cgraph_node (new_decl);
3529 DECL_ARTIFICIAL (new_decl) = 1;
3530 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
3532 /* Prepare the data structures for the tree copy. */
3533 memset (&id, 0, sizeof (id));
3535 /* Generate a new name for the new version. */
3538 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
3539 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
3540 SET_DECL_RTL (new_decl, NULL_RTX);
3541 id.statements_to_fold = pointer_set_create ();
3544 id.decl_map = pointer_map_create ();
3545 id.src_fn = old_decl;
3546 id.dst_fn = new_decl;
3547 id.src_node = old_version_node;
3548 id.dst_node = new_version_node;
3549 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
3551 id.copy_decl = copy_decl_no_change;
3552 id.transform_call_graph_edges
3553 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
3554 id.transform_new_cfg = true;
3555 id.transform_return_to_modify = false;
3556 id.transform_lang_insert_block = false;
3558 current_function_decl = new_decl;
3559 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
3560 (DECL_STRUCT_FUNCTION (old_decl));
3561 initialize_cfun (new_decl, old_decl,
3562 old_entry_block->count,
3563 old_entry_block->frequency);
3564 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
3566 /* Copy the function's static chain. */
3567 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
3569 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
3570 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
3572 /* Copy the function's arguments. */
3573 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
3574 DECL_ARGUMENTS (new_decl) =
3575 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
3577 /* If there's a tree_map, prepare for substitution. */
3579 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
3581 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
3582 if (replace_info->replace_p)
3583 insert_decl_map (&id, replace_info->old_tree,
3584 replace_info->new_tree);
3587 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
3589 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3590 number_blocks (id.dst_fn);
3592 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
3593 /* Add local vars. */
3594 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
3595 t_step; t_step = TREE_CHAIN (t_step))
3597 tree var = TREE_VALUE (t_step);
3598 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3599 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
3600 cfun->unexpanded_var_list);
3602 cfun->unexpanded_var_list =
3603 tree_cons (NULL_TREE, remap_decl (var, &id),
3604 cfun->unexpanded_var_list);
3607 /* Copy the Function's body. */
3608 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
3610 if (DECL_RESULT (old_decl) != NULL_TREE)
3612 tree *res_decl = &DECL_RESULT (old_decl);
3613 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
3614 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
3617 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3618 number_blocks (new_decl);
3621 pointer_map_destroy (id.decl_map);
3624 fold_marked_statements (0, id.statements_to_fold);
3625 pointer_set_destroy (id.statements_to_fold);
3626 fold_cond_expr_cond ();
3628 if (gimple_in_ssa_p (cfun))
3630 free_dominance_info (CDI_DOMINATORS);
3631 free_dominance_info (CDI_POST_DOMINATORS);
3633 delete_unreachable_blocks ();
3634 update_ssa (TODO_update_ssa);
3637 fold_cond_expr_cond ();
3638 if (need_ssa_update_p ())
3639 update_ssa (TODO_update_ssa);
3642 free_dominance_info (CDI_DOMINATORS);
3643 free_dominance_info (CDI_POST_DOMINATORS);
3645 current_function_decl = old_current_function_decl;
3646 gcc_assert (!current_function_decl
3647 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
3651 /* Duplicate a type, fields and all. */
3654 build_duplicate_type (tree type)
3656 struct copy_body_data id;
3658 memset (&id, 0, sizeof (id));
3659 id.src_fn = current_function_decl;
3660 id.dst_fn = current_function_decl;
3662 id.decl_map = pointer_map_create ();
3663 id.copy_decl = copy_decl_no_change;
3665 type = remap_type_1 (type, &id);
3667 pointer_map_destroy (id.decl_map);