2 Copyright 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to
19 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
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"
53 /* I'm not real happy about this, but we need to handle gimple and
55 #include "tree-gimple.h"
57 /* Inlining, Cloning, Versioning, Parallelization
59 Inlining: a function body is duplicated, but the PARM_DECLs are
60 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
61 MODIFY_EXPRs that store to a dedicated returned-value variable.
62 The duplicated eh_region info of the copy will later be appended
63 to the info for the caller; the eh_region info in copied throwing
64 statements and RESX_EXPRs is adjusted accordingly.
66 Cloning: (only in C++) We have one body for a con/de/structor, and
67 multiple function decls, each with a unique parameter list.
68 Duplicate the body, using the given splay tree; some parameters
69 will become constants (like 0 or 1).
71 Versioning: a function body is duplicated and the result is a new
72 function rather than into blocks of an existing function as with
73 inlining. Some parameters will become constants.
75 Parallelization: a region of a function is duplicated resulting in
76 a new function. Variables may be replaced with complex expressions
77 to enable shared variable semantics.
79 All of these will simultaneously lookup any callgraph edges. If
80 we're going to inline the duplicated function body, and the given
81 function has some cloned callgraph nodes (one for each place this
82 function will be inlined) those callgraph edges will be duplicated.
83 If we're cloning the body, those callgraph edges will be
84 updated to point into the new body. (Note that the original
85 callgraph node and edge list will not be altered.)
87 See the CALL_EXPR handling case in copy_body_r (). */
89 /* 0 if we should not perform inlining.
90 1 if we should expand functions calls inline at the tree level.
91 2 if we should consider *all* functions to be inline
94 int flag_inline_trees = 0;
98 o In order to make inlining-on-trees work, we pessimized
99 function-local static constants. In particular, they are now
100 always output, even when not addressed. Fix this by treating
101 function-local static constants just like global static
102 constants; the back-end already knows not to output them if they
105 o Provide heuristics to clamp inlining of recursive template
110 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
111 static tree copy_generic_body (copy_body_data *);
112 static bool inlinable_function_p (tree);
113 static void remap_block (tree *, copy_body_data *);
114 static tree remap_decls (tree, copy_body_data *);
115 static void copy_bind_expr (tree *, int *, copy_body_data *);
116 static tree mark_local_for_remap_r (tree *, int *, void *);
117 static void unsave_expr_1 (tree);
118 static tree unsave_r (tree *, int *, void *);
119 static void declare_inline_vars (tree, tree);
120 static void remap_save_expr (tree *, void *, int *);
121 static void add_lexical_block (tree current_block, tree new_block);
122 static tree copy_decl_to_var (tree, copy_body_data *);
123 static tree copy_decl_no_change (tree, copy_body_data *);
124 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
126 /* Insert a tree->tree mapping for ID. Despite the name suggests
127 that the trees should be variables, it is used for more than that. */
130 insert_decl_map (copy_body_data *id, tree key, tree value)
132 splay_tree_insert (id->decl_map, (splay_tree_key) key,
133 (splay_tree_value) value);
135 /* Always insert an identity map as well. If we see this same new
136 node again, we won't want to duplicate it a second time. */
138 splay_tree_insert (id->decl_map, (splay_tree_key) value,
139 (splay_tree_value) value);
142 /* Remap DECL during the copying of the BLOCK tree for the function. */
145 remap_decl (tree decl, copy_body_data *id)
150 /* We only remap local variables in the current function. */
153 /* See if we have remapped this declaration. */
155 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
157 /* If we didn't already have an equivalent for this declaration,
161 /* Make a copy of the variable or label. */
162 tree t = id->copy_decl (decl, id);
164 /* Remember it, so that if we encounter this local entity again
165 we can reuse this copy. Do this early because remap_type may
166 need this decl for TYPE_STUB_DECL. */
167 insert_decl_map (id, decl, t);
172 /* Remap types, if necessary. */
173 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
174 if (TREE_CODE (t) == TYPE_DECL)
175 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
177 /* Remap sizes as necessary. */
178 walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
179 walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
181 /* If fields, do likewise for offset and qualifier. */
182 if (TREE_CODE (t) == FIELD_DECL)
184 walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
185 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
186 walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
192 return unshare_expr ((tree) n->value);
196 remap_type_1 (tree type, copy_body_data *id)
198 splay_tree_node node;
204 /* See if we have remapped this type. */
205 node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
207 return (tree) node->value;
209 /* The type only needs remapping if it's variably modified. */
210 if (! variably_modified_type_p (type, id->src_fn))
212 insert_decl_map (id, type, type);
216 /* We do need a copy. build and register it now. If this is a pointer or
217 reference type, remap the designated type and make a new pointer or
219 if (TREE_CODE (type) == POINTER_TYPE)
221 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
223 TYPE_REF_CAN_ALIAS_ALL (type));
224 insert_decl_map (id, type, new);
227 else if (TREE_CODE (type) == REFERENCE_TYPE)
229 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
231 TYPE_REF_CAN_ALIAS_ALL (type));
232 insert_decl_map (id, type, new);
236 new = copy_node (type);
238 insert_decl_map (id, type, new);
240 /* This is a new type, not a copy of an old type. Need to reassociate
241 variants. We can handle everything except the main variant lazily. */
242 t = TYPE_MAIN_VARIANT (type);
245 t = remap_type (t, id);
246 TYPE_MAIN_VARIANT (new) = t;
247 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t);
248 TYPE_NEXT_VARIANT (t) = new;
252 TYPE_MAIN_VARIANT (new) = new;
253 TYPE_NEXT_VARIANT (new) = NULL;
256 if (TYPE_STUB_DECL (type))
257 TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
259 /* Lazily create pointer and reference types. */
260 TYPE_POINTER_TO (new) = NULL;
261 TYPE_REFERENCE_TO (new) = NULL;
263 switch (TREE_CODE (new))
270 t = TYPE_MIN_VALUE (new);
271 if (t && TREE_CODE (t) != INTEGER_CST)
272 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
274 t = TYPE_MAX_VALUE (new);
275 if (t && TREE_CODE (t) != INTEGER_CST)
276 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
280 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
281 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
285 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
286 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
291 case QUAL_UNION_TYPE:
295 for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
297 t = remap_decl (f, id);
298 DECL_CONTEXT (t) = new;
302 TYPE_FIELDS (new) = nreverse (nf);
308 /* Shouldn't have been thought variable sized. */
312 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
313 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
319 remap_type (tree type, copy_body_data *id)
321 splay_tree_node node;
326 /* See if we have remapped this type. */
327 node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
329 return (tree) node->value;
331 /* The type only needs remapping if it's variably modified. */
332 if (! variably_modified_type_p (type, id->src_fn))
334 insert_decl_map (id, type, type);
338 return remap_type_1 (type, id);
342 remap_decls (tree decls, copy_body_data *id)
345 tree new_decls = NULL_TREE;
347 /* Remap its variables. */
348 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
352 /* We can not chain the local static declarations into the unexpanded_var_list
353 as we can't duplicate them or break one decl rule. Go ahead and link
354 them into unexpanded_var_list. */
355 if (!lang_hooks.tree_inlining.auto_var_in_fn_p (old_var, id->src_fn)
356 && !DECL_EXTERNAL (old_var))
358 cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
359 cfun->unexpanded_var_list);
363 /* Remap the variable. */
364 new_var = remap_decl (old_var, id);
366 /* If we didn't remap this variable, so we can't mess with its
367 TREE_CHAIN. If we remapped this variable to the return slot, it's
368 already declared somewhere else, so don't declare it here. */
369 if (!new_var || new_var == id->retvar)
373 gcc_assert (DECL_P (new_var));
374 TREE_CHAIN (new_var) = new_decls;
379 return nreverse (new_decls);
382 /* Copy the BLOCK to contain remapped versions of the variables
383 therein. And hook the new block into the block-tree. */
386 remap_block (tree *block, copy_body_data *id)
392 /* Make the new block. */
394 new_block = make_node (BLOCK);
395 TREE_USED (new_block) = TREE_USED (old_block);
396 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
397 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
400 /* Remap its variables. */
401 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
405 if (id->transform_lang_insert_block)
406 lang_hooks.decls.insert_block (new_block);
408 /* Remember the remapped block. */
409 insert_decl_map (id, old_block, new_block);
412 /* Copy the whole block tree and root it in id->block. */
414 remap_blocks (tree block, copy_body_data *id)
422 remap_block (&new, id);
423 gcc_assert (new != block);
424 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
425 add_lexical_block (new, remap_blocks (t, id));
430 copy_statement_list (tree *tp)
432 tree_stmt_iterator oi, ni;
435 new = alloc_stmt_list ();
436 ni = tsi_start (new);
437 oi = tsi_start (*tp);
440 for (; !tsi_end_p (oi); tsi_next (&oi))
441 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
445 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
447 tree block = BIND_EXPR_BLOCK (*tp);
448 /* Copy (and replace) the statement. */
449 copy_tree_r (tp, walk_subtrees, NULL);
452 remap_block (&block, id);
453 BIND_EXPR_BLOCK (*tp) = block;
456 if (BIND_EXPR_VARS (*tp))
457 /* This will remap a lot of the same decls again, but this should be
459 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
462 /* Called from copy_body_id via walk_tree. DATA is really an
463 `copy_body_data *'. */
466 copy_body_r (tree *tp, int *walk_subtrees, void *data)
468 copy_body_data *id = (copy_body_data *) data;
469 tree fn = id->src_fn;
472 /* Begin by recognizing trees that we'll completely rewrite for the
473 inlining context. Our output for these trees is completely
474 different from out input (e.g. RETURN_EXPR is deleted, and morphs
475 into an edge). Further down, we'll handle trees that get
476 duplicated and/or tweaked. */
478 /* When requested, RETURN_EXPRs should be transformed to just the
479 contained MODIFY_EXPR. The branch semantics of the return will
480 be handled elsewhere by manipulating the CFG rather than a statement. */
481 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
483 tree assignment = TREE_OPERAND (*tp, 0);
485 /* If we're returning something, just turn that into an
486 assignment into the equivalent of the original RESULT_DECL.
487 If the "assignment" is just the result decl, the result
488 decl has already been set (e.g. a recent "foo (&result_decl,
489 ...)"); just toss the entire RETURN_EXPR. */
490 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
492 /* Replace the RETURN_EXPR with (a copy of) the
493 MODIFY_EXPR hanging underneath. */
494 *tp = copy_node (assignment);
496 else /* Else the RETURN_EXPR returns no value. */
499 return (tree) (void *)1;
503 /* Local variables and labels need to be replaced by equivalent
504 variables. We don't want to copy static variables; there's only
505 one of those, no matter how many times we inline the containing
506 function. Similarly for globals from an outer function. */
507 else if (lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
511 /* Remap the declaration. */
512 new_decl = remap_decl (*tp, id);
513 gcc_assert (new_decl);
514 /* Replace this variable with the copy. */
515 STRIP_TYPE_NOPS (new_decl);
519 else if (TREE_CODE (*tp) == STATEMENT_LIST)
520 copy_statement_list (tp);
521 else if (TREE_CODE (*tp) == SAVE_EXPR)
522 remap_save_expr (tp, id->decl_map, walk_subtrees);
523 else if (TREE_CODE (*tp) == LABEL_DECL
524 && (! DECL_CONTEXT (*tp)
525 || decl_function_context (*tp) == id->src_fn))
526 /* These may need to be remapped for EH handling. */
527 *tp = remap_decl (*tp, id);
528 else if (TREE_CODE (*tp) == BIND_EXPR)
529 copy_bind_expr (tp, walk_subtrees, id);
530 /* Types may need remapping as well. */
531 else if (TYPE_P (*tp))
532 *tp = remap_type (*tp, id);
534 /* If this is a constant, we have to copy the node iff the type will be
535 remapped. copy_tree_r will not copy a constant. */
536 else if (CONSTANT_CLASS_P (*tp))
538 tree new_type = remap_type (TREE_TYPE (*tp), id);
540 if (new_type == TREE_TYPE (*tp))
543 else if (TREE_CODE (*tp) == INTEGER_CST)
544 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
545 TREE_INT_CST_HIGH (*tp));
548 *tp = copy_node (*tp);
549 TREE_TYPE (*tp) = new_type;
553 /* Otherwise, just copy the node. Note that copy_tree_r already
554 knows not to copy VAR_DECLs, etc., so this is safe. */
557 /* Here we handle trees that are not completely rewritten.
558 First we detect some inlining-induced bogosities for
560 if (TREE_CODE (*tp) == MODIFY_EXPR
561 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
562 && (lang_hooks.tree_inlining.auto_var_in_fn_p
563 (TREE_OPERAND (*tp, 0), fn)))
565 /* Some assignments VAR = VAR; don't generate any rtl code
566 and thus don't count as variable modification. Avoid
567 keeping bogosities like 0 = 0. */
568 tree decl = TREE_OPERAND (*tp, 0), value;
571 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
574 value = (tree) n->value;
575 STRIP_TYPE_NOPS (value);
576 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
578 *tp = build_empty_stmt ();
579 return copy_body_r (tp, walk_subtrees, data);
583 else if (TREE_CODE (*tp) == INDIRECT_REF)
585 /* Get rid of *& from inline substitutions that can happen when a
586 pointer argument is an ADDR_EXPR. */
587 tree decl = TREE_OPERAND (*tp, 0);
590 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
594 /* If we happen to get an ADDR_EXPR in n->value, strip
595 it manually here as we'll eventually get ADDR_EXPRs
596 which lie about their types pointed to. In this case
597 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
598 but we absolutely rely on that. As fold_indirect_ref
599 does other useful transformations, try that first, though. */
600 tree type = TREE_TYPE (TREE_TYPE ((tree)n->value));
601 new = unshare_expr ((tree)n->value);
602 *tp = fold_indirect_ref_1 (type, new);
605 if (TREE_CODE (new) == ADDR_EXPR)
606 *tp = TREE_OPERAND (new, 0);
608 *tp = build1 (INDIRECT_REF, type, new);
615 /* Here is the "usual case". Copy this tree node, and then
616 tweak some special cases. */
617 copy_tree_r (tp, walk_subtrees, NULL);
619 /* If EXPR has block defined, map it to newly constructed block.
620 When inlining we want EXPRs without block appear in the block
622 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (*tp))))
624 new_block = id->block;
625 if (TREE_BLOCK (*tp))
628 n = splay_tree_lookup (id->decl_map,
629 (splay_tree_key) TREE_BLOCK (*tp));
631 new_block = (tree) n->value;
633 TREE_BLOCK (*tp) = new_block;
636 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
637 TREE_OPERAND (*tp, 0) =
640 id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
642 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
644 /* The copied TARGET_EXPR has never been expanded, even if the
645 original node was expanded already. */
646 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
648 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
649 TREE_OPERAND (*tp, 3) = NULL_TREE;
652 /* Variable substitution need not be simple. In particular, the
653 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
654 and friends are up-to-date. */
655 else if (TREE_CODE (*tp) == ADDR_EXPR)
657 walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
658 recompute_tree_invariant_for_addr_expr (*tp);
663 /* Keep iterating. */
667 /* Copy basic block, scale profile accordingly. Edges will be taken care of
671 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
673 block_stmt_iterator bsi, copy_bsi;
674 basic_block copy_basic_block;
676 /* create_basic_block() will append every new block to
677 basic_block_info automatically. */
678 copy_basic_block = create_basic_block (NULL, (void *) 0,
679 (basic_block) bb->prev_bb->aux);
680 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
681 copy_basic_block->frequency = (bb->frequency
682 * frequency_scale / REG_BR_PROB_BASE);
683 copy_bsi = bsi_start (copy_basic_block);
685 for (bsi = bsi_start (bb);
686 !bsi_end_p (bsi); bsi_next (&bsi))
688 tree stmt = bsi_stmt (bsi);
689 tree orig_stmt = stmt;
691 walk_tree (&stmt, copy_body_r, id, NULL);
693 /* RETURN_EXPR might be removed,
694 this is signalled by making stmt pointer NULL. */
698 bsi_insert_after (©_bsi, stmt, BSI_NEW_STMT);
699 call = get_call_expr_in (stmt);
700 /* We're duplicating a CALL_EXPR. Find any corresponding
701 callgraph edges and update or duplicate them. */
702 if (call && (decl = get_callee_fndecl (call)))
704 struct cgraph_node *node;
705 struct cgraph_edge *edge;
707 switch (id->transform_call_graph_edges)
709 case CB_CGE_DUPLICATE:
710 edge = cgraph_edge (id->src_node, orig_stmt);
712 cgraph_clone_edge (edge, id->dst_node, stmt,
713 REG_BR_PROB_BASE, 1, true);
716 case CB_CGE_MOVE_CLONES:
717 for (node = id->dst_node->next_clone;
719 node = node->next_clone)
721 edge = cgraph_edge (node, orig_stmt);
723 edge->call_stmt = stmt;
728 edge = cgraph_edge (id->dst_node, orig_stmt);
730 edge->call_stmt = stmt;
737 /* If you think we can abort here, you are wrong.
738 There is no region 0 in tree land. */
739 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
742 if (tree_could_throw_p (stmt))
744 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
745 /* Add an entry for the copied tree in the EH hashtable.
746 When cloning or versioning, use the hashtable in
747 cfun, and just copy the EH number. When inlining, use the
748 hashtable in the caller, and adjust the region number. */
750 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
752 /* If this tree doesn't have a region associated with it,
753 and there is a "current region,"
754 then associate this tree with the current region
755 and add edges associated with this region. */
756 if ((lookup_stmt_eh_region_fn (id->src_cfun,
758 && id->eh_region > 0)
759 && tree_could_throw_p (stmt))
760 add_stmt_to_eh_region (stmt, id->eh_region);
764 return copy_basic_block;
767 /* Copy edges from BB into its copy constructed earlier, scale profile
768 accordingly. Edges will be taken care of later. Assume aux
769 pointers to point to the copies of each BB. */
771 copy_edges_for_bb (basic_block bb, int count_scale)
773 basic_block new_bb = (basic_block) bb->aux;
776 block_stmt_iterator bsi;
779 /* Use the indices from the original blocks to create edges for the
781 FOR_EACH_EDGE (old_edge, ei, bb->succs)
782 if (!(old_edge->flags & EDGE_EH))
786 flags = old_edge->flags;
788 /* Return edges do get a FALLTHRU flag when the get inlined. */
789 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
790 && old_edge->dest->aux != EXIT_BLOCK_PTR)
791 flags |= EDGE_FALLTHRU;
792 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
793 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
794 new->probability = old_edge->probability;
797 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
800 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
804 copy_stmt = bsi_stmt (bsi);
805 update_stmt (copy_stmt);
806 /* Do this before the possible split_block. */
809 /* If this tree could throw an exception, there are two
810 cases where we need to add abnormal edge(s): the
811 tree wasn't in a region and there is a "current
812 region" in the caller; or the original tree had
813 EH edges. In both cases split the block after the tree,
814 and add abnormal edge(s) as needed; we need both
815 those from the callee and the caller.
816 We check whether the copy can throw, because the const
817 propagation can change an INDIRECT_REF which throws
818 into a COMPONENT_REF which doesn't. If the copy
819 can throw, the original could also throw. */
821 if (tree_can_throw_internal (copy_stmt))
823 if (!bsi_end_p (bsi))
824 /* Note that bb's predecessor edges aren't necessarily
825 right at this point; split_block doesn't care. */
827 edge e = split_block (new_bb, copy_stmt);
829 bsi = bsi_start (new_bb);
832 make_eh_edges (copy_stmt);
837 /* Wrapper for remap_decl so it can be used as a callback. */
839 remap_decl_1 (tree decl, void *data)
841 return remap_decl (decl, (copy_body_data *) data);
844 /* Make a copy of the body of FN so that it can be inserted inline in
845 another function. Walks FN via CFG, returns new fndecl. */
848 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
849 basic_block entry_block_map, basic_block exit_block_map)
851 tree callee_fndecl = id->src_fn;
852 /* Original cfun for the callee, doesn't change. */
853 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
854 /* Copy, built by this function. */
855 struct function *new_cfun;
856 /* Place to copy from; when a copy of the function was saved off earlier,
857 use that instead of the main copy. */
858 struct function *cfun_to_copy =
859 (struct function *) ggc_alloc_cleared (sizeof (struct function));
861 tree new_fndecl = NULL;
862 int count_scale, frequency_scale;
864 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
865 count_scale = (REG_BR_PROB_BASE * count
866 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
870 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
871 frequency_scale = (REG_BR_PROB_BASE * frequency
873 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
875 frequency_scale = count_scale;
877 /* Register specific tree functions. */
878 tree_register_cfg_hooks ();
880 /* Must have a CFG here at this point. */
881 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
882 (DECL_STRUCT_FUNCTION (callee_fndecl)));
884 *cfun_to_copy = *DECL_STRUCT_FUNCTION (callee_fndecl);
886 id->src_cfun = cfun_to_copy;
888 /* If requested, create new basic_block_info and label_to_block_maps.
889 Otherwise, insert our new blocks and labels into the existing cfg. */
890 if (id->transform_new_cfg)
893 (struct function *) ggc_alloc_cleared (sizeof (struct function));
894 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
895 new_cfun->cfg = NULL;
896 new_cfun->decl = new_fndecl = copy_node (callee_fndecl);
897 new_cfun->ib_boundaries_block = (varray_type) 0;
898 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
899 push_cfun (new_cfun);
900 init_empty_tree_cfg ();
902 ENTRY_BLOCK_PTR->count =
903 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
905 ENTRY_BLOCK_PTR->frequency =
906 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
907 frequency_scale / REG_BR_PROB_BASE);
908 EXIT_BLOCK_PTR->count =
909 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
911 EXIT_BLOCK_PTR->frequency =
912 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
913 frequency_scale / REG_BR_PROB_BASE);
915 entry_block_map = ENTRY_BLOCK_PTR;
916 exit_block_map = EXIT_BLOCK_PTR;
919 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
920 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
922 /* Duplicate any exception-handling regions. */
925 if (id->transform_new_cfg)
926 init_eh_for_function ();
928 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id, id->eh_region);
930 /* Use aux pointers to map the original blocks to copy. */
931 FOR_EACH_BB_FN (bb, cfun_to_copy)
932 bb->aux = copy_bb (id, bb, frequency_scale, count_scale);
933 /* Now that we've duplicated the blocks, duplicate their edges. */
934 FOR_ALL_BB_FN (bb, cfun_to_copy)
935 copy_edges_for_bb (bb, count_scale);
936 FOR_ALL_BB_FN (bb, cfun_to_copy)
939 if (id->transform_new_cfg)
945 /* Make a copy of the body of FN so that it can be inserted inline in
949 copy_generic_body (copy_body_data *id)
952 tree fndecl = id->src_fn;
954 body = DECL_SAVED_TREE (fndecl);
955 walk_tree (&body, copy_body_r, id, NULL);
961 copy_body (copy_body_data *id, gcov_type count, int frequency,
962 basic_block entry_block_map, basic_block exit_block_map)
964 tree fndecl = id->src_fn;
967 /* If this body has a CFG, walk CFG and copy. */
968 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
969 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
974 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
975 defined in function FN, or of a data member thereof. */
978 self_inlining_addr_expr (tree value, tree fn)
982 if (TREE_CODE (value) != ADDR_EXPR)
985 var = get_base_address (TREE_OPERAND (value, 0));
987 return var && lang_hooks.tree_inlining.auto_var_in_fn_p (var, fn);
991 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
992 basic_block bb, tree *vars)
998 /* If the parameter is never assigned to, we may not need to
999 create a new variable here at all. Instead, we may be able
1000 to just use the argument value. */
1001 if (TREE_READONLY (p)
1002 && !TREE_ADDRESSABLE (p)
1003 && value && !TREE_SIDE_EFFECTS (value))
1005 /* We may produce non-gimple trees by adding NOPs or introduce
1006 invalid sharing when operand is not really constant.
1007 It is not big deal to prohibit constant propagation here as
1008 we will constant propagate in DOM1 pass anyway. */
1009 if (is_gimple_min_invariant (value)
1010 && lang_hooks.types_compatible_p (TREE_TYPE (value), TREE_TYPE (p))
1011 /* We have to be very careful about ADDR_EXPR. Make sure
1012 the base variable isn't a local variable of the inlined
1013 function, e.g., when doing recursive inlining, direct or
1014 mutually-recursive or whatever, which is why we don't
1015 just test whether fn == current_function_decl. */
1016 && ! self_inlining_addr_expr (value, fn))
1018 insert_decl_map (id, p, value);
1023 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1024 here since the type of this decl must be visible to the calling
1026 var = copy_decl_to_var (p, id);
1028 /* See if the frontend wants to pass this by invisible reference. If
1029 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1030 replace uses of the PARM_DECL with dereferences. */
1031 if (TREE_TYPE (var) != TREE_TYPE (p)
1032 && POINTER_TYPE_P (TREE_TYPE (var))
1033 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1035 insert_decl_map (id, var, var);
1036 var_sub = build_fold_indirect_ref (var);
1041 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1042 that way, when the PARM_DECL is encountered, it will be
1043 automatically replaced by the VAR_DECL. */
1044 insert_decl_map (id, p, var_sub);
1046 /* Declare this new variable. */
1047 TREE_CHAIN (var) = *vars;
1050 /* Make gimplifier happy about this variable. */
1051 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1053 /* Even if P was TREE_READONLY, the new VAR should not be.
1054 In the original code, we would have constructed a
1055 temporary, and then the function body would have never
1056 changed the value of P. However, now, we will be
1057 constructing VAR directly. The constructor body may
1058 change its value multiple times as it is being
1059 constructed. Therefore, it must not be TREE_READONLY;
1060 the back-end assumes that TREE_READONLY variable is
1061 assigned to only once. */
1062 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1063 TREE_READONLY (var) = 0;
1065 /* Initialize this VAR_DECL from the equivalent argument. Convert
1066 the argument to the proper type in case it was promoted. */
1069 tree rhs = fold_convert (TREE_TYPE (var), value);
1070 block_stmt_iterator bsi = bsi_last (bb);
1072 if (rhs == error_mark_node)
1075 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
1076 keep our trees in gimple form. */
1077 init_stmt = build2 (MODIFY_EXPR, TREE_TYPE (var), var, rhs);
1079 /* If we did not create a gimple value and we did not create a gimple
1080 cast of a gimple value, then we will need to gimplify INIT_STMTS
1081 at the end. Note that is_gimple_cast only checks the outer
1082 tree code, not its operand. Thus the explicit check that its
1083 operand is a gimple value. */
1084 if (!is_gimple_val (rhs)
1085 && (!is_gimple_cast (rhs)
1086 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1087 gimplify_stmt (&init_stmt);
1089 /* If VAR represents a zero-sized variable, it's possible that the
1090 assignment statment may result in no gimple statements. */
1092 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1096 /* Generate code to initialize the parameters of the function at the
1097 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
1100 initialize_inlined_parameters (copy_body_data *id, tree args, tree static_chain,
1101 tree fn, basic_block bb)
1106 tree vars = NULL_TREE;
1109 /* Figure out what the parameters are. */
1110 parms = DECL_ARGUMENTS (fn);
1112 /* Loop through the parameter declarations, replacing each with an
1113 equivalent VAR_DECL, appropriately initialized. */
1114 for (p = parms, a = args; p;
1115 a = a ? TREE_CHAIN (a) : a, p = TREE_CHAIN (p))
1121 /* Find the initializer. */
1122 value = lang_hooks.tree_inlining.convert_parm_for_inlining
1123 (p, a ? TREE_VALUE (a) : NULL_TREE, fn, argnum);
1125 setup_one_parameter (id, p, value, fn, bb, &vars);
1128 /* Initialize the static chain. */
1129 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1130 gcc_assert (fn != current_function_decl);
1133 /* No static chain? Seems like a bug in tree-nested.c. */
1134 gcc_assert (static_chain);
1136 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1139 declare_inline_vars (id->block, vars);
1142 /* Declare a return variable to replace the RESULT_DECL for the
1143 function we are calling. An appropriate DECL_STMT is returned.
1144 The USE_STMT is filled to contain a use of the declaration to
1145 indicate the return value of the function.
1147 RETURN_SLOT_ADDR, if non-null, was a fake parameter that
1148 took the address of the result. MODIFY_DEST, if non-null, was the LHS of
1149 the MODIFY_EXPR to which this call is the RHS.
1151 The return value is a (possibly null) value that is the result of the
1152 function as seen by the callee. *USE_P is a (possibly null) value that
1153 holds the result as seen by the caller. */
1156 declare_return_variable (copy_body_data *id, tree return_slot_addr,
1157 tree modify_dest, tree *use_p)
1159 tree callee = id->src_fn;
1160 tree caller = id->dst_fn;
1161 tree result = DECL_RESULT (callee);
1162 tree callee_type = TREE_TYPE (result);
1163 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1166 /* We don't need to do anything for functions that don't return
1168 if (!result || VOID_TYPE_P (callee_type))
1174 /* If there was a return slot, then the return value is the
1175 dereferenced address of that object. */
1176 if (return_slot_addr)
1178 /* The front end shouldn't have used both return_slot_addr and
1179 a modify expression. */
1180 gcc_assert (!modify_dest);
1181 if (DECL_BY_REFERENCE (result))
1182 var = return_slot_addr;
1184 var = build_fold_indirect_ref (return_slot_addr);
1185 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1186 && !DECL_COMPLEX_GIMPLE_REG_P (result)
1188 DECL_COMPLEX_GIMPLE_REG_P (var) = 0;
1193 /* All types requiring non-trivial constructors should have been handled. */
1194 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1196 /* Attempt to avoid creating a new temporary variable. */
1199 bool use_it = false;
1201 /* We can't use MODIFY_DEST if there's type promotion involved. */
1202 if (!lang_hooks.types_compatible_p (caller_type, callee_type))
1205 /* ??? If we're assigning to a variable sized type, then we must
1206 reuse the destination variable, because we've no good way to
1207 create variable sized temporaries at this point. */
1208 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1211 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1212 reuse it as the result of the call directly. Don't do this if
1213 it would promote MODIFY_DEST to addressable. */
1214 else if (TREE_ADDRESSABLE (result))
1218 tree base_m = get_base_address (modify_dest);
1220 /* If the base isn't a decl, then it's a pointer, and we don't
1221 know where that's going to go. */
1222 if (!DECL_P (base_m))
1224 else if (is_global_var (base_m))
1226 else if (!TREE_ADDRESSABLE (base_m))
1238 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1240 var = copy_decl_to_var (result, id);
1242 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1243 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1244 = tree_cons (NULL_TREE, var,
1245 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1247 /* Do not have the rest of GCC warn about this variable as it should
1248 not be visible to the user. */
1249 TREE_NO_WARNING (var) = 1;
1251 /* Build the use expr. If the return type of the function was
1252 promoted, convert it back to the expected type. */
1254 if (!lang_hooks.types_compatible_p (TREE_TYPE (var), caller_type))
1255 use = fold_convert (caller_type, var);
1258 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1259 way, when the RESULT_DECL is encountered, it will be
1260 automatically replaced by the VAR_DECL. */
1261 insert_decl_map (id, result, var);
1263 /* Remember this so we can ignore it in remap_decls. */
1270 /* Returns nonzero if a function can be inlined as a tree. */
1273 tree_inlinable_function_p (tree fn)
1275 return inlinable_function_p (fn);
1278 static const char *inline_forbidden_reason;
1281 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1285 tree fn = (tree) fnp;
1288 switch (TREE_CODE (node))
1291 /* Refuse to inline alloca call unless user explicitly forced so as
1292 this may change program's memory overhead drastically when the
1293 function using alloca is called in loop. In GCC present in
1294 SPEC2000 inlining into schedule_block cause it to require 2GB of
1295 RAM instead of 256MB. */
1296 if (alloca_call_p (node)
1297 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1299 inline_forbidden_reason
1300 = G_("function %q+F can never be inlined because it uses "
1301 "alloca (override using the always_inline attribute)");
1304 t = get_callee_fndecl (node);
1308 /* We cannot inline functions that call setjmp. */
1309 if (setjmp_call_p (t))
1311 inline_forbidden_reason
1312 = G_("function %q+F can never be inlined because it uses setjmp");
1316 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1317 switch (DECL_FUNCTION_CODE (t))
1319 /* We cannot inline functions that take a variable number of
1321 case BUILT_IN_VA_START:
1322 case BUILT_IN_STDARG_START:
1323 case BUILT_IN_NEXT_ARG:
1324 case BUILT_IN_VA_END:
1325 inline_forbidden_reason
1326 = G_("function %q+F can never be inlined because it "
1327 "uses variable argument lists");
1330 case BUILT_IN_LONGJMP:
1331 /* We can't inline functions that call __builtin_longjmp at
1332 all. The non-local goto machinery really requires the
1333 destination be in a different function. If we allow the
1334 function calling __builtin_longjmp to be inlined into the
1335 function calling __builtin_setjmp, Things will Go Awry. */
1336 inline_forbidden_reason
1337 = G_("function %q+F can never be inlined because "
1338 "it uses setjmp-longjmp exception handling");
1341 case BUILT_IN_NONLOCAL_GOTO:
1343 inline_forbidden_reason
1344 = G_("function %q+F can never be inlined because "
1345 "it uses non-local goto");
1348 case BUILT_IN_RETURN:
1349 case BUILT_IN_APPLY_ARGS:
1350 /* If a __builtin_apply_args caller would be inlined,
1351 it would be saving arguments of the function it has
1352 been inlined into. Similarly __builtin_return would
1353 return from the function the inline has been inlined into. */
1354 inline_forbidden_reason
1355 = G_("function %q+F can never be inlined because "
1356 "it uses __builtin_return or __builtin_apply_args");
1365 t = TREE_OPERAND (node, 0);
1367 /* We will not inline a function which uses computed goto. The
1368 addresses of its local labels, which may be tucked into
1369 global storage, are of course not constant across
1370 instantiations, which causes unexpected behavior. */
1371 if (TREE_CODE (t) != LABEL_DECL)
1373 inline_forbidden_reason
1374 = G_("function %q+F can never be inlined "
1375 "because it contains a computed goto");
1381 t = TREE_OPERAND (node, 0);
1382 if (DECL_NONLOCAL (t))
1384 /* We cannot inline a function that receives a non-local goto
1385 because we cannot remap the destination label used in the
1386 function that is performing the non-local goto. */
1387 inline_forbidden_reason
1388 = G_("function %q+F can never be inlined "
1389 "because it receives a non-local goto");
1396 /* We cannot inline a function of the form
1398 void F (int i) { struct S { int ar[i]; } s; }
1400 Attempting to do so produces a catch-22.
1401 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1402 UNION_TYPE nodes, then it goes into infinite recursion on a
1403 structure containing a pointer to its own type. If it doesn't,
1404 then the type node for S doesn't get adjusted properly when
1407 ??? This is likely no longer true, but it's too late in the 4.0
1408 cycle to try to find out. This should be checked for 4.1. */
1409 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1410 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1412 inline_forbidden_reason
1413 = G_("function %q+F can never be inlined "
1414 "because it uses variable sized variables");
1425 /* Return subexpression representing possible alloca call, if any. */
1427 inline_forbidden_p (tree fndecl)
1429 location_t saved_loc = input_location;
1430 block_stmt_iterator bsi;
1432 tree ret = NULL_TREE;
1434 FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
1435 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1437 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
1438 inline_forbidden_p_1, fndecl);
1444 input_location = saved_loc;
1448 /* Returns nonzero if FN is a function that does not have any
1449 fundamental inline blocking properties. */
1452 inlinable_function_p (tree fn)
1454 bool inlinable = true;
1456 /* If we've already decided this function shouldn't be inlined,
1457 there's no need to check again. */
1458 if (DECL_UNINLINABLE (fn))
1461 /* See if there is any language-specific reason it cannot be
1462 inlined. (It is important that this hook be called early because
1463 in C++ it may result in template instantiation.)
1464 If the function is not inlinable for language-specific reasons,
1465 it is left up to the langhook to explain why. */
1466 inlinable = !lang_hooks.tree_inlining.cannot_inline_tree_fn (&fn);
1468 /* If we don't have the function body available, we can't inline it.
1469 However, this should not be recorded since we also get here for
1470 forward declared inline functions. Therefore, return at once. */
1471 if (!DECL_SAVED_TREE (fn))
1474 /* If we're not inlining at all, then we cannot inline this function. */
1475 else if (!flag_inline_trees)
1478 /* Only try to inline functions if DECL_INLINE is set. This should be
1479 true for all functions declared `inline', and for all other functions
1480 as well with -finline-functions.
1482 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1483 it's the front-end that must set DECL_INLINE in this case, because
1484 dwarf2out loses if a function that does not have DECL_INLINE set is
1485 inlined anyway. That is why we have both DECL_INLINE and
1486 DECL_DECLARED_INLINE_P. */
1487 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1488 here should be redundant. */
1489 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
1492 else if (inline_forbidden_p (fn))
1494 /* See if we should warn about uninlinable functions. Previously,
1495 some of these warnings would be issued while trying to expand
1496 the function inline, but that would cause multiple warnings
1497 about functions that would for example call alloca. But since
1498 this a property of the function, just one warning is enough.
1499 As a bonus we can now give more details about the reason why a
1500 function is not inlinable.
1501 We only warn for functions declared `inline' by the user. */
1502 bool do_warning = (warn_inline
1504 && DECL_DECLARED_INLINE_P (fn)
1505 && !DECL_IN_SYSTEM_HEADER (fn));
1507 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1508 sorry (inline_forbidden_reason, fn);
1509 else if (do_warning)
1510 warning (OPT_Winline, inline_forbidden_reason, fn);
1515 /* Squirrel away the result so that we don't have to check again. */
1516 DECL_UNINLINABLE (fn) = !inlinable;
1521 /* Estimate the cost of a memory move. Use machine dependent
1522 word size and take possible memcpy call into account. */
1525 estimate_move_cost (tree type)
1529 size = int_size_in_bytes (type);
1531 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
1532 /* Cost of a memcpy call, 3 arguments and the call. */
1535 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
1538 /* Used by estimate_num_insns. Estimate number of instructions seen
1539 by given statement. */
1542 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
1544 int *count = (int *) data;
1547 if (IS_TYPE_OR_DECL_P (x))
1552 /* Assume that constants and references counts nothing. These should
1553 be majorized by amount of operations among them we count later
1554 and are common target of CSE and similar optimizations. */
1555 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
1558 switch (TREE_CODE (x))
1560 /* Containers have no cost. */
1567 case ALIGN_INDIRECT_REF:
1568 case MISALIGNED_INDIRECT_REF:
1570 case ARRAY_RANGE_REF:
1572 case EXC_PTR_EXPR: /* ??? */
1573 case FILTER_EXPR: /* ??? */
1576 case WITH_CLEANUP_EXPR:
1578 case VIEW_CONVERT_EXPR:
1583 case CASE_LABEL_EXPR:
1586 case EH_FILTER_EXPR:
1587 case STATEMENT_LIST:
1589 case NON_LVALUE_EXPR:
1592 case TRY_CATCH_EXPR:
1593 case TRY_FINALLY_EXPR:
1600 case WITH_SIZE_EXPR:
1611 case OMP_RETURN_EXPR:
1614 /* We don't account constants for now. Assume that the cost is amortized
1615 by operations that do use them. We may re-consider this decision once
1616 we are able to optimize the tree before estimating its size and break
1617 out static initializers. */
1618 case IDENTIFIER_NODE:
1627 /* Try to estimate the cost of assignments. We have three cases to
1629 1) Simple assignments to registers;
1630 2) Stores to things that must live in memory. This includes
1631 "normal" stores to scalars, but also assignments of large
1632 structures, or constructors of big arrays;
1635 Let us look at the first two cases, assuming we have "a = b + C":
1636 <modify_expr <var_decl "a"> <plus_expr <var_decl "b"> <constant C>>
1637 If "a" is a GIMPLE register, the assignment to it is free on almost
1638 any target, because "a" usually ends up in a real register. Hence
1639 the only cost of this expression comes from the PLUS_EXPR, and we
1640 can ignore the MODIFY_EXPR.
1641 If "a" is not a GIMPLE register, the assignment to "a" will most
1642 likely be a real store, so the cost of the MODIFY_EXPR is the cost
1643 of moving something into "a", which we compute using the function
1646 The third case deals with TARGET_EXPRs, for which the semantics are
1647 that a temporary is assigned, unless the TARGET_EXPR itself is being
1648 assigned to something else. In the latter case we do not need the
1649 temporary. E.g. in <modify_expr <var_decl "a"> <target_expr>>, the
1650 MODIFY_EXPR is free. */
1653 /* Is the right and side a TARGET_EXPR? */
1654 if (TREE_CODE (TREE_OPERAND (x, 1)) == TARGET_EXPR)
1656 /* ... fall through ... */
1659 x = TREE_OPERAND (x, 0);
1660 /* Is this an assignments to a register? */
1661 if (is_gimple_reg (x))
1663 /* Otherwise it's a store, so fall through to compute the move cost. */
1666 *count += estimate_move_cost (TREE_TYPE (x));
1669 /* Assign cost of 1 to usual operations.
1670 ??? We may consider mapping RTL costs to this. */
1678 case FIX_TRUNC_EXPR:
1680 case FIX_FLOOR_EXPR:
1681 case FIX_ROUND_EXPR:
1693 case VEC_LSHIFT_EXPR:
1694 case VEC_RSHIFT_EXPR:
1701 case TRUTH_ANDIF_EXPR:
1702 case TRUTH_ORIF_EXPR:
1703 case TRUTH_AND_EXPR:
1705 case TRUTH_XOR_EXPR:
1706 case TRUTH_NOT_EXPR:
1715 case UNORDERED_EXPR:
1728 case PREDECREMENT_EXPR:
1729 case PREINCREMENT_EXPR:
1730 case POSTDECREMENT_EXPR:
1731 case POSTINCREMENT_EXPR:
1737 case REALIGN_LOAD_EXPR:
1739 case REDUC_MAX_EXPR:
1740 case REDUC_MIN_EXPR:
1741 case REDUC_PLUS_EXPR:
1742 case WIDEN_SUM_EXPR:
1745 case WIDEN_MULT_EXPR:
1751 /* Few special cases of expensive operations. This is useful
1752 to avoid inlining on functions having too many of these. */
1753 case TRUNC_DIV_EXPR:
1755 case FLOOR_DIV_EXPR:
1756 case ROUND_DIV_EXPR:
1757 case EXACT_DIV_EXPR:
1758 case TRUNC_MOD_EXPR:
1760 case FLOOR_MOD_EXPR:
1761 case ROUND_MOD_EXPR:
1767 tree decl = get_callee_fndecl (x);
1770 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
1771 switch (DECL_FUNCTION_CODE (decl))
1773 case BUILT_IN_CONSTANT_P:
1776 case BUILT_IN_EXPECT:
1782 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
1783 that does use function declaration to figure out the arguments. */
1786 for (arg = TREE_OPERAND (x, 1); arg; arg = TREE_CHAIN (arg))
1787 *count += estimate_move_cost (TREE_TYPE (TREE_VALUE (arg)));
1791 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
1792 *count += estimate_move_cost (TREE_TYPE (arg));
1795 *count += PARAM_VALUE (PARAM_INLINE_CALL_COST);
1804 /* Estimate number of instructions that will be created by expanding EXPR. */
1807 estimate_num_insns (tree expr)
1810 struct pointer_set_t *visited_nodes;
1812 block_stmt_iterator bsi;
1813 struct function *my_function;
1815 /* If we're given an entire function, walk the CFG. */
1816 if (TREE_CODE (expr) == FUNCTION_DECL)
1818 my_function = DECL_STRUCT_FUNCTION (expr);
1819 gcc_assert (my_function && my_function->cfg);
1820 visited_nodes = pointer_set_create ();
1821 FOR_EACH_BB_FN (bb, my_function)
1823 for (bsi = bsi_start (bb);
1827 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
1828 &num, visited_nodes);
1831 pointer_set_destroy (visited_nodes);
1834 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &num);
1839 typedef struct function *function_p;
1841 DEF_VEC_P(function_p);
1842 DEF_VEC_ALLOC_P(function_p,heap);
1844 /* Initialized with NOGC, making this poisonous to the garbage collector. */
1845 static VEC(function_p,heap) *cfun_stack;
1848 push_cfun (struct function *new_cfun)
1850 VEC_safe_push (function_p, heap, cfun_stack, cfun);
1857 cfun = VEC_pop (function_p, cfun_stack);
1860 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
1862 add_lexical_block (tree current_block, tree new_block)
1866 /* Walk to the last sub-block. */
1867 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
1869 blk_p = &TREE_CHAIN (*blk_p))
1872 BLOCK_SUPERCONTEXT (new_block) = current_block;
1875 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1878 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
1886 tree return_slot_addr;
1888 location_t saved_location;
1889 struct cgraph_edge *cg_edge;
1891 basic_block return_block;
1893 block_stmt_iterator bsi, stmt_bsi;
1894 bool successfully_inlined = FALSE;
1899 /* See what we've got. */
1900 id = (copy_body_data *) data;
1903 /* Set input_location here so we get the right instantiation context
1904 if we call instantiate_decl from inlinable_function_p. */
1905 saved_location = input_location;
1906 if (EXPR_HAS_LOCATION (t))
1907 input_location = EXPR_LOCATION (t);
1909 /* From here on, we're only interested in CALL_EXPRs. */
1910 if (TREE_CODE (t) != CALL_EXPR)
1913 /* First, see if we can figure out what function is being called.
1914 If we cannot, then there is no hope of inlining the function. */
1915 fn = get_callee_fndecl (t);
1919 /* Turn forward declarations into real ones. */
1920 fn = cgraph_node (fn)->decl;
1922 /* If fn is a declaration of a function in a nested scope that was
1923 globally declared inline, we don't set its DECL_INITIAL.
1924 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1925 C++ front-end uses it for cdtors to refer to their internal
1926 declarations, that are not real functions. Fortunately those
1927 don't have trees to be saved, so we can tell by checking their
1929 if (! DECL_INITIAL (fn)
1930 && DECL_ABSTRACT_ORIGIN (fn)
1931 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
1932 fn = DECL_ABSTRACT_ORIGIN (fn);
1934 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1935 Kill this check once this is fixed. */
1936 if (!id->dst_node->analyzed)
1939 cg_edge = cgraph_edge (id->dst_node, stmt);
1941 /* Constant propagation on argument done during previous inlining
1942 may create new direct call. Produce an edge for it. */
1945 struct cgraph_node *dest = cgraph_node (fn);
1947 /* We have missing edge in the callgraph. This can happen in one case
1948 where previous inlining turned indirect call into direct call by
1949 constant propagating arguments. In all other cases we hit a bug
1950 (incorrect node sharing is most common reason for missing edges. */
1951 gcc_assert (dest->needed || !flag_unit_at_a_time);
1952 cgraph_create_edge (id->dst_node, dest, stmt,
1953 bb->count, bb->loop_depth)->inline_failed
1954 = N_("originally indirect function call not considered for inlining");
1958 /* Don't try to inline functions that are not well-suited to
1960 if (!cgraph_inline_p (cg_edge, &reason))
1962 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
1963 /* Avoid warnings during early inline pass. */
1964 && (!flag_unit_at_a_time || cgraph_global_info_ready))
1966 sorry ("inlining failed in call to %q+F: %s", fn, reason);
1967 sorry ("called from here");
1969 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
1970 && !DECL_IN_SYSTEM_HEADER (fn)
1972 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
1973 /* Avoid warnings during early inline pass. */
1974 && (!flag_unit_at_a_time || cgraph_global_info_ready))
1976 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
1978 warning (OPT_Winline, "called from here");
1982 fn = cg_edge->callee->decl;
1984 #ifdef ENABLE_CHECKING
1985 if (cg_edge->callee->decl != id->dst_node->decl)
1986 verify_cgraph_node (cg_edge->callee);
1989 /* We will be inlining this callee. */
1991 id->eh_region = lookup_stmt_eh_region (stmt);
1993 /* Split the block holding the CALL_EXPR. */
1995 e = split_block (bb, stmt);
1997 return_block = e->dest;
2000 /* split_block splits before the statement, work around this by moving
2001 the call into the first half_bb. Not pretty, but seems easier than
2002 doing the CFG manipulation by hand when the CALL_EXPR is in the last
2004 stmt_bsi = bsi_last (bb);
2005 bsi = bsi_start (return_block);
2006 if (!bsi_end_p (bsi))
2007 bsi_move_before (&stmt_bsi, &bsi);
2010 tree stmt = bsi_stmt (stmt_bsi);
2011 bsi_remove (&stmt_bsi, false);
2012 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2014 stmt_bsi = bsi_start (return_block);
2016 /* Build a block containing code to initialize the arguments, the
2017 actual inline expansion of the body, and a label for the return
2018 statements within the function to jump to. The type of the
2019 statement expression is the return type of the function call. */
2020 id->block = make_node (BLOCK);
2021 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2022 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2023 add_lexical_block (TREE_BLOCK (stmt), id->block);
2025 /* Local declarations will be replaced by their equivalents in this
2028 id->decl_map = splay_tree_new (splay_tree_compare_pointers,
2031 /* Initialize the parameters. */
2032 args = TREE_OPERAND (t, 1);
2034 /* Record the function we are about to inline. */
2036 id->src_node = cg_edge->callee;
2038 initialize_inlined_parameters (id, args, TREE_OPERAND (t, 2), fn, bb);
2040 if (DECL_INITIAL (fn))
2041 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2043 /* Return statements in the function body will be replaced by jumps
2044 to the RET_LABEL. */
2046 gcc_assert (DECL_INITIAL (fn));
2047 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2049 /* Find the lhs to which the result of this call is assigned. */
2050 return_slot_addr = NULL;
2051 if (TREE_CODE (stmt) == MODIFY_EXPR)
2053 modify_dest = TREE_OPERAND (stmt, 0);
2055 /* The function which we are inlining might not return a value,
2056 in which case we should issue a warning that the function
2057 does not return a value. In that case the optimizers will
2058 see that the variable to which the value is assigned was not
2059 initialized. We do not want to issue a warning about that
2060 uninitialized variable. */
2061 if (DECL_P (modify_dest))
2062 TREE_NO_WARNING (modify_dest) = 1;
2063 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2065 return_slot_addr = build_fold_addr_expr (modify_dest);
2072 /* Declare the return variable for the function. */
2073 decl = declare_return_variable (id, return_slot_addr,
2074 modify_dest, &use_retvar);
2075 /* Do this only if declare_return_variable created a new one. */
2076 if (decl && !return_slot_addr && decl != modify_dest)
2077 declare_inline_vars (id->block, decl);
2079 /* This is it. Duplicate the callee body. Assume callee is
2080 pre-gimplified. Note that we must not alter the caller
2081 function in any way before this point, as this CALL_EXPR may be
2082 a self-referential call; if we're calling ourselves, we need to
2083 duplicate our body before altering anything. */
2084 copy_body (id, bb->count, bb->frequency, bb, return_block);
2086 /* Add local vars in this inlined callee to caller. */
2087 t_step = id->src_cfun->unexpanded_var_list;
2088 for (; t_step; t_step = TREE_CHAIN (t_step))
2090 var = TREE_VALUE (t_step);
2091 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2092 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2093 cfun->unexpanded_var_list);
2095 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2096 cfun->unexpanded_var_list);
2100 splay_tree_delete (id->decl_map);
2103 /* If the inlined function returns a result that we care about,
2104 clobber the CALL_EXPR with a reference to the return variable. */
2105 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2108 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2111 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2112 tsi_delink() will leave the iterator in a sane state. */
2113 bsi_remove (&stmt_bsi, true);
2116 if (bsi_end_p (bsi))
2117 tree_purge_dead_eh_edges (return_block);
2119 /* If the value of the new expression is ignored, that's OK. We
2120 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2121 the equivalent inlined version either. */
2122 TREE_USED (*tp) = 1;
2124 /* Output the inlining info for this abstract function, since it has been
2125 inlined. If we don't do this now, we can lose the information about the
2126 variables in the function when the blocks get blown away as soon as we
2127 remove the cgraph node. */
2128 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2130 /* Update callgraph if needed. */
2131 cgraph_remove_node (cg_edge->callee);
2133 /* Declare the 'auto' variables added with this inlined body. */
2134 record_vars (BLOCK_VARS (id->block));
2135 id->block = NULL_TREE;
2136 successfully_inlined = TRUE;
2139 input_location = saved_location;
2140 return successfully_inlined;
2143 /* Expand call statements reachable from STMT_P.
2144 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2145 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
2146 unfortunately not use that function here because we need a pointer
2147 to the CALL_EXPR, not the tree itself. */
2150 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2152 block_stmt_iterator bsi;
2154 /* Register specific tree functions. */
2155 tree_register_cfg_hooks ();
2156 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2158 tree *expr_p = bsi_stmt_ptr (bsi);
2159 tree stmt = *expr_p;
2161 if (TREE_CODE (*expr_p) == MODIFY_EXPR)
2162 expr_p = &TREE_OPERAND (*expr_p, 1);
2163 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2164 expr_p = &TREE_OPERAND (*expr_p, 0);
2165 if (TREE_CODE (*expr_p) == CALL_EXPR)
2166 if (expand_call_inline (bb, stmt, expr_p, id))
2172 /* Expand calls to inline functions in the body of FN. */
2175 optimize_inline_calls (tree fn)
2180 /* There is no point in performing inlining if errors have already
2181 occurred -- and we might crash if we try to inline invalid
2183 if (errorcount || sorrycount)
2187 memset (&id, 0, sizeof (id));
2189 id.src_node = id.dst_node = cgraph_node (fn);
2191 /* Or any functions that aren't finished yet. */
2192 prev_fn = NULL_TREE;
2193 if (current_function_decl)
2195 id.dst_fn = current_function_decl;
2196 prev_fn = current_function_decl;
2199 id.copy_decl = copy_decl_maybe_to_var;
2200 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2201 id.transform_new_cfg = false;
2202 id.transform_return_to_modify = true;
2203 id.transform_lang_insert_block = false;
2205 push_gimplify_context ();
2207 /* Reach the trees by walking over the CFG, and note the
2208 enclosing basic-blocks in the call edges. */
2209 /* We walk the blocks going forward, because inlined function bodies
2210 will split id->current_basic_block, and the new blocks will
2211 follow it; we'll trudge through them, processing their CALL_EXPRs
2214 gimple_expand_calls_inline (bb, &id);
2216 pop_gimplify_context (NULL);
2217 /* Renumber the (code) basic_blocks consecutively. */
2219 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2222 #ifdef ENABLE_CHECKING
2224 struct cgraph_edge *e;
2226 verify_cgraph_node (id.dst_node);
2228 /* Double check that we inlined everything we are supposed to inline. */
2229 for (e = id.dst_node->callees; e; e = e->next_callee)
2230 gcc_assert (e->inline_failed);
2233 /* We need to rescale frequencies again to peak at REG_BR_PROB_BASE
2234 as inlining loops might increase the maximum. */
2235 if (ENTRY_BLOCK_PTR->count)
2237 fold_cond_expr_cond ();
2240 /* FN is a function that has a complete body, and CLONE is a function whose
2241 body is to be set to a copy of FN, mapping argument declarations according
2242 to the ARG_MAP splay_tree. */
2245 clone_body (tree clone, tree fn, void *arg_map)
2249 /* Clone the body, as if we were making an inline call. But, remap the
2250 parameters in the callee to the parameters of caller. */
2251 memset (&id, 0, sizeof (id));
2254 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
2255 id.decl_map = (splay_tree)arg_map;
2257 id.copy_decl = copy_decl_no_change;
2258 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2259 id.transform_new_cfg = true;
2260 id.transform_return_to_modify = false;
2261 id.transform_lang_insert_block = true;
2263 /* We're not inside any EH region. */
2266 /* Actually copy the body. */
2267 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
2270 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2273 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2275 enum tree_code code = TREE_CODE (*tp);
2277 /* We make copies of most nodes. */
2278 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
2279 || code == TREE_LIST
2281 || code == TYPE_DECL
2282 || code == OMP_CLAUSE)
2284 /* Because the chain gets clobbered when we make a copy, we save it
2286 tree chain = TREE_CHAIN (*tp);
2289 /* Copy the node. */
2290 new = copy_node (*tp);
2292 /* Propagate mudflap marked-ness. */
2293 if (flag_mudflap && mf_marked_p (*tp))
2298 /* Now, restore the chain, if appropriate. That will cause
2299 walk_tree to walk into the chain as well. */
2300 if (code == PARM_DECL
2301 || code == TREE_LIST
2302 || code == OMP_CLAUSE)
2303 TREE_CHAIN (*tp) = chain;
2305 /* For now, we don't update BLOCKs when we make copies. So, we
2306 have to nullify all BIND_EXPRs. */
2307 if (TREE_CODE (*tp) == BIND_EXPR)
2308 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
2310 else if (code == CONSTRUCTOR)
2312 /* CONSTRUCTOR nodes need special handling because
2313 we need to duplicate the vector of elements. */
2316 new = copy_node (*tp);
2318 /* Propagate mudflap marked-ness. */
2319 if (flag_mudflap && mf_marked_p (*tp))
2322 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
2323 CONSTRUCTOR_ELTS (*tp));
2326 else if (TREE_CODE_CLASS (code) == tcc_type)
2328 else if (TREE_CODE_CLASS (code) == tcc_declaration)
2330 else if (TREE_CODE_CLASS (code) == tcc_constant)
2333 gcc_assert (code != STATEMENT_LIST);
2337 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2338 information indicating to what new SAVE_EXPR this one should be mapped,
2339 use that one. Otherwise, create a new node and enter it in ST. FN is
2340 the function into which the copy will be placed. */
2343 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
2345 splay_tree st = (splay_tree) st_;
2349 /* See if we already encountered this SAVE_EXPR. */
2350 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2352 /* If we didn't already remap this SAVE_EXPR, do so now. */
2355 t = copy_node (*tp);
2357 /* Remember this SAVE_EXPR. */
2358 splay_tree_insert (st, (splay_tree_key) *tp, (splay_tree_value) t);
2359 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2360 splay_tree_insert (st, (splay_tree_key) t, (splay_tree_value) t);
2364 /* We've already walked into this SAVE_EXPR; don't do it again. */
2366 t = (tree) n->value;
2369 /* Replace this SAVE_EXPR with the copy. */
2373 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2374 copies the declaration and enters it in the splay_tree in DATA (which is
2375 really an `copy_body_data *'). */
2378 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2381 copy_body_data *id = (copy_body_data *) data;
2383 /* Don't walk into types. */
2387 else if (TREE_CODE (*tp) == LABEL_EXPR)
2389 tree decl = TREE_OPERAND (*tp, 0);
2391 /* Copy the decl and remember the copy. */
2392 insert_decl_map (id, decl, id->copy_decl (decl, id));
2398 /* Perform any modifications to EXPR required when it is unsaved. Does
2399 not recurse into EXPR's subtrees. */
2402 unsave_expr_1 (tree expr)
2404 switch (TREE_CODE (expr))
2407 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2408 It's OK for this to happen if it was part of a subtree that
2409 isn't immediately expanded, such as operand 2 of another
2411 if (TREE_OPERAND (expr, 1))
2414 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
2415 TREE_OPERAND (expr, 3) = NULL_TREE;
2423 /* Called via walk_tree when an expression is unsaved. Using the
2424 splay_tree pointed to by ST (which is really a `splay_tree'),
2425 remaps all local declarations to appropriate replacements. */
2428 unsave_r (tree *tp, int *walk_subtrees, void *data)
2430 copy_body_data *id = (copy_body_data *) data;
2431 splay_tree st = id->decl_map;
2434 /* Only a local declaration (variable or label). */
2435 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
2436 || TREE_CODE (*tp) == LABEL_DECL)
2438 /* Lookup the declaration. */
2439 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2441 /* If it's there, remap it. */
2443 *tp = (tree) n->value;
2446 else if (TREE_CODE (*tp) == STATEMENT_LIST)
2447 copy_statement_list (tp);
2448 else if (TREE_CODE (*tp) == BIND_EXPR)
2449 copy_bind_expr (tp, walk_subtrees, id);
2450 else if (TREE_CODE (*tp) == SAVE_EXPR)
2451 remap_save_expr (tp, st, walk_subtrees);
2454 copy_tree_r (tp, walk_subtrees, NULL);
2456 /* Do whatever unsaving is required. */
2457 unsave_expr_1 (*tp);
2460 /* Keep iterating. */
2464 /* Copies everything in EXPR and replaces variables, labels
2465 and SAVE_EXPRs local to EXPR. */
2468 unsave_expr_now (tree expr)
2472 /* There's nothing to do for NULL_TREE. */
2477 memset (&id, 0, sizeof (id));
2478 id.src_fn = current_function_decl;
2479 id.dst_fn = current_function_decl;
2480 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2482 id.copy_decl = copy_decl_no_change;
2483 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2484 id.transform_new_cfg = false;
2485 id.transform_return_to_modify = false;
2486 id.transform_lang_insert_block = false;
2488 /* Walk the tree once to find local labels. */
2489 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
2491 /* Walk the tree again, copying, remapping, and unsaving. */
2492 walk_tree (&expr, unsave_r, &id, NULL);
2495 splay_tree_delete (id.decl_map);
2500 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2503 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
2512 debug_find_tree (tree top, tree search)
2514 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
2518 /* Declare the variables created by the inliner. Add all the variables in
2519 VARS to BIND_EXPR. */
2522 declare_inline_vars (tree block, tree vars)
2525 for (t = vars; t; t = TREE_CHAIN (t))
2526 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
2529 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
2533 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
2534 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
2535 VAR_DECL translation. */
2538 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
2540 /* Don't generate debug information for the copy if we wouldn't have
2541 generated it for the copy either. */
2542 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
2543 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
2545 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
2546 declaration inspired this copy. */
2547 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
2549 /* The new variable/label has no RTL, yet. */
2550 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
2551 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
2552 SET_DECL_RTL (copy, NULL_RTX);
2554 /* These args would always appear unused, if not for this. */
2555 TREE_USED (copy) = 1;
2557 /* Set the context for the new declaration. */
2558 if (!DECL_CONTEXT (decl))
2559 /* Globals stay global. */
2561 else if (DECL_CONTEXT (decl) != id->src_fn)
2562 /* Things that weren't in the scope of the function we're inlining
2563 from aren't in the scope we're inlining to, either. */
2565 else if (TREE_STATIC (decl))
2566 /* Function-scoped static variables should stay in the original
2570 /* Ordinary automatic local variables are now in the scope of the
2572 DECL_CONTEXT (copy) = id->dst_fn;
2578 copy_decl_to_var (tree decl, copy_body_data *id)
2582 gcc_assert (TREE_CODE (decl) == PARM_DECL
2583 || TREE_CODE (decl) == RESULT_DECL);
2585 type = TREE_TYPE (decl);
2587 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
2588 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
2589 TREE_READONLY (copy) = TREE_READONLY (decl);
2590 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
2591 DECL_COMPLEX_GIMPLE_REG_P (copy) = DECL_COMPLEX_GIMPLE_REG_P (decl);
2593 return copy_decl_for_dup_finish (id, decl, copy);
2597 copy_decl_no_change (tree decl, copy_body_data *id)
2601 copy = copy_node (decl);
2603 /* The COPY is not abstract; it will be generated in DST_FN. */
2604 DECL_ABSTRACT (copy) = 0;
2605 lang_hooks.dup_lang_specific_decl (copy);
2607 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
2608 been taken; it's for internal bookkeeping in expand_goto_internal. */
2609 if (TREE_CODE (copy) == LABEL_DECL)
2611 TREE_ADDRESSABLE (copy) = 0;
2612 LABEL_DECL_UID (copy) = -1;
2615 return copy_decl_for_dup_finish (id, decl, copy);
2619 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
2621 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
2622 return copy_decl_to_var (decl, id);
2624 return copy_decl_no_change (decl, id);
2627 /* Return a copy of the function's argument tree. */
2629 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
2631 tree *arg_copy, *parg;
2633 arg_copy = &orig_parm;
2634 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
2636 tree new = remap_decl (*parg, id);
2637 lang_hooks.dup_lang_specific_decl (new);
2638 TREE_CHAIN (new) = TREE_CHAIN (*parg);
2644 /* Return a copy of the function's static chain. */
2646 copy_static_chain (tree static_chain, copy_body_data * id)
2648 tree *chain_copy, *pvar;
2650 chain_copy = &static_chain;
2651 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
2653 tree new = remap_decl (*pvar, id);
2654 lang_hooks.dup_lang_specific_decl (new);
2655 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
2658 return static_chain;
2661 /* Return true if the function is allowed to be versioned.
2662 This is a guard for the versioning functionality. */
2664 tree_versionable_function_p (tree fndecl)
2666 if (fndecl == NULL_TREE)
2668 /* ??? There are cases where a function is
2669 uninlinable but can be versioned. */
2670 if (!tree_inlinable_function_p (fndecl))
2676 /* Create a copy of a function's tree.
2677 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
2678 of the original function and the new copied function
2679 respectively. In case we want to replace a DECL
2680 tree with another tree while duplicating the function's
2681 body, TREE_MAP represents the mapping between these
2682 trees. If UPDATE_CLONES is set, the call_stmt fields
2683 of edges of clones of the function will be updated. */
2685 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
2688 struct cgraph_node *old_version_node;
2689 struct cgraph_node *new_version_node;
2693 struct ipa_replace_map *replace_info;
2694 basic_block old_entry_block;
2697 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
2698 && TREE_CODE (new_decl) == FUNCTION_DECL);
2699 DECL_POSSIBLY_INLINED (old_decl) = 1;
2701 old_version_node = cgraph_node (old_decl);
2702 new_version_node = cgraph_node (new_decl);
2704 allocate_struct_function (new_decl);
2705 /* Cfun points to the new allocated function struct at this point. */
2706 cfun->function_end_locus = DECL_SOURCE_LOCATION (new_decl);
2708 DECL_ARTIFICIAL (new_decl) = 1;
2709 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
2711 /* Generate a new name for the new version. */
2713 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
2714 /* Create a new SYMBOL_REF rtx for the new name. */
2715 if (DECL_RTL (old_decl) != NULL)
2717 SET_DECL_RTL (new_decl, copy_rtx (DECL_RTL (old_decl)));
2718 XEXP (DECL_RTL (new_decl), 0) =
2719 gen_rtx_SYMBOL_REF (GET_MODE (XEXP (DECL_RTL (old_decl), 0)),
2720 IDENTIFIER_POINTER (DECL_NAME (new_decl)));
2723 /* Prepare the data structures for the tree copy. */
2724 memset (&id, 0, sizeof (id));
2726 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2727 id.src_fn = old_decl;
2728 id.dst_fn = new_decl;
2729 id.src_node = old_version_node;
2730 id.dst_node = new_version_node;
2731 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
2733 id.copy_decl = copy_decl_no_change;
2734 id.transform_call_graph_edges
2735 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
2736 id.transform_new_cfg = true;
2737 id.transform_return_to_modify = false;
2738 id.transform_lang_insert_block = false;
2740 current_function_decl = new_decl;
2742 /* Copy the function's static chain. */
2743 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
2745 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
2746 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
2748 /* Copy the function's arguments. */
2749 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
2750 DECL_ARGUMENTS (new_decl) =
2751 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
2753 /* If there's a tree_map, prepare for substitution. */
2755 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
2757 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
2758 if (replace_info->replace_p)
2759 insert_decl_map (&id, replace_info->old_tree,
2760 replace_info->new_tree);
2763 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
2765 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2766 number_blocks (id.dst_fn);
2768 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
2769 /* Add local vars. */
2770 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
2771 t_step; t_step = TREE_CHAIN (t_step))
2773 tree var = TREE_VALUE (t_step);
2774 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2775 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2776 cfun->unexpanded_var_list);
2778 cfun->unexpanded_var_list =
2779 tree_cons (NULL_TREE, remap_decl (var, &id),
2780 cfun->unexpanded_var_list);
2783 /* Copy the Function's body. */
2784 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
2785 (DECL_STRUCT_FUNCTION (old_decl));
2786 new_fndecl = copy_body (&id,
2787 old_entry_block->count,
2788 old_entry_block->frequency, NULL, NULL);
2790 DECL_SAVED_TREE (new_decl) = DECL_SAVED_TREE (new_fndecl);
2792 DECL_STRUCT_FUNCTION (new_decl)->cfg =
2793 DECL_STRUCT_FUNCTION (new_fndecl)->cfg;
2794 DECL_STRUCT_FUNCTION (new_decl)->eh = DECL_STRUCT_FUNCTION (new_fndecl)->eh;
2795 DECL_STRUCT_FUNCTION (new_decl)->ib_boundaries_block =
2796 DECL_STRUCT_FUNCTION (new_fndecl)->ib_boundaries_block;
2797 DECL_STRUCT_FUNCTION (new_decl)->last_label_uid =
2798 DECL_STRUCT_FUNCTION (new_fndecl)->last_label_uid;
2800 if (DECL_RESULT (old_decl) != NULL_TREE)
2802 tree *res_decl = &DECL_RESULT (old_decl);
2803 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
2804 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
2807 current_function_decl = NULL;
2808 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2809 number_blocks (new_decl);
2812 splay_tree_delete (id.decl_map);
2813 fold_cond_expr_cond ();
2817 /* Duplicate a type, fields and all. */
2820 build_duplicate_type (tree type)
2822 struct copy_body_data id;
2824 memset (&id, 0, sizeof (id));
2825 id.src_fn = current_function_decl;
2826 id.dst_fn = current_function_decl;
2828 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2830 type = remap_type_1 (type, &id);
2832 splay_tree_delete (id.decl_map);