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))
269 t = TYPE_MIN_VALUE (new);
270 if (t && TREE_CODE (t) != INTEGER_CST)
271 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
273 t = TYPE_MAX_VALUE (new);
274 if (t && TREE_CODE (t) != INTEGER_CST)
275 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
279 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
280 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
284 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
285 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
290 case QUAL_UNION_TYPE:
294 for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
296 t = remap_decl (f, id);
297 DECL_CONTEXT (t) = new;
301 TYPE_FIELDS (new) = nreverse (nf);
307 /* Shouldn't have been thought variable sized. */
311 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
312 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
318 remap_type (tree type, copy_body_data *id)
320 splay_tree_node node;
325 /* See if we have remapped this type. */
326 node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
328 return (tree) node->value;
330 /* The type only needs remapping if it's variably modified. */
331 if (! variably_modified_type_p (type, id->src_fn))
333 insert_decl_map (id, type, type);
337 return remap_type_1 (type, id);
341 remap_decls (tree decls, copy_body_data *id)
344 tree new_decls = NULL_TREE;
346 /* Remap its variables. */
347 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
351 /* We can not chain the local static declarations into the unexpanded_var_list
352 as we can't duplicate them or break one decl rule. Go ahead and link
353 them into unexpanded_var_list. */
354 if (!lang_hooks.tree_inlining.auto_var_in_fn_p (old_var, id->src_fn)
355 && !DECL_EXTERNAL (old_var))
357 cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
358 cfun->unexpanded_var_list);
362 /* Remap the variable. */
363 new_var = remap_decl (old_var, id);
365 /* If we didn't remap this variable, so we can't mess with its
366 TREE_CHAIN. If we remapped this variable to the return slot, it's
367 already declared somewhere else, so don't declare it here. */
368 if (!new_var || new_var == id->retvar)
372 gcc_assert (DECL_P (new_var));
373 TREE_CHAIN (new_var) = new_decls;
378 return nreverse (new_decls);
381 /* Copy the BLOCK to contain remapped versions of the variables
382 therein. And hook the new block into the block-tree. */
385 remap_block (tree *block, copy_body_data *id)
391 /* Make the new block. */
393 new_block = make_node (BLOCK);
394 TREE_USED (new_block) = TREE_USED (old_block);
395 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
396 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
399 /* Remap its variables. */
400 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
404 if (id->transform_lang_insert_block)
405 lang_hooks.decls.insert_block (new_block);
407 /* Remember the remapped block. */
408 insert_decl_map (id, old_block, new_block);
411 /* Copy the whole block tree and root it in id->block. */
413 remap_blocks (tree block, copy_body_data *id)
421 remap_block (&new, id);
422 gcc_assert (new != block);
423 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
424 add_lexical_block (new, remap_blocks (t, id));
429 copy_statement_list (tree *tp)
431 tree_stmt_iterator oi, ni;
434 new = alloc_stmt_list ();
435 ni = tsi_start (new);
436 oi = tsi_start (*tp);
439 for (; !tsi_end_p (oi); tsi_next (&oi))
440 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
444 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
446 tree block = BIND_EXPR_BLOCK (*tp);
447 /* Copy (and replace) the statement. */
448 copy_tree_r (tp, walk_subtrees, NULL);
451 remap_block (&block, id);
452 BIND_EXPR_BLOCK (*tp) = block;
455 if (BIND_EXPR_VARS (*tp))
456 /* This will remap a lot of the same decls again, but this should be
458 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
461 /* Called from copy_body_id via walk_tree. DATA is really an
462 `copy_body_data *'. */
465 copy_body_r (tree *tp, int *walk_subtrees, void *data)
467 copy_body_data *id = (copy_body_data *) data;
468 tree fn = id->src_fn;
471 /* Begin by recognizing trees that we'll completely rewrite for the
472 inlining context. Our output for these trees is completely
473 different from out input (e.g. RETURN_EXPR is deleted, and morphs
474 into an edge). Further down, we'll handle trees that get
475 duplicated and/or tweaked. */
477 /* When requested, RETURN_EXPRs should be transformed to just the
478 contained MODIFY_EXPR. The branch semantics of the return will
479 be handled elsewhere by manipulating the CFG rather than a statement. */
480 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
482 tree assignment = TREE_OPERAND (*tp, 0);
484 /* If we're returning something, just turn that into an
485 assignment into the equivalent of the original RESULT_DECL.
486 If the "assignment" is just the result decl, the result
487 decl has already been set (e.g. a recent "foo (&result_decl,
488 ...)"); just toss the entire RETURN_EXPR. */
489 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
491 /* Replace the RETURN_EXPR with (a copy of) the
492 MODIFY_EXPR hanging underneath. */
493 *tp = copy_node (assignment);
495 else /* Else the RETURN_EXPR returns no value. */
498 return (tree) (void *)1;
502 /* Local variables and labels need to be replaced by equivalent
503 variables. We don't want to copy static variables; there's only
504 one of those, no matter how many times we inline the containing
505 function. Similarly for globals from an outer function. */
506 else if (lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
510 /* Remap the declaration. */
511 new_decl = remap_decl (*tp, id);
512 gcc_assert (new_decl);
513 /* Replace this variable with the copy. */
514 STRIP_TYPE_NOPS (new_decl);
518 else if (TREE_CODE (*tp) == STATEMENT_LIST)
519 copy_statement_list (tp);
520 else if (TREE_CODE (*tp) == SAVE_EXPR)
521 remap_save_expr (tp, id->decl_map, walk_subtrees);
522 else if (TREE_CODE (*tp) == LABEL_DECL
523 && (! DECL_CONTEXT (*tp)
524 || decl_function_context (*tp) == id->src_fn))
525 /* These may need to be remapped for EH handling. */
526 *tp = remap_decl (*tp, id);
527 else if (TREE_CODE (*tp) == BIND_EXPR)
528 copy_bind_expr (tp, walk_subtrees, id);
529 /* Types may need remapping as well. */
530 else if (TYPE_P (*tp))
531 *tp = remap_type (*tp, id);
533 /* If this is a constant, we have to copy the node iff the type will be
534 remapped. copy_tree_r will not copy a constant. */
535 else if (CONSTANT_CLASS_P (*tp))
537 tree new_type = remap_type (TREE_TYPE (*tp), id);
539 if (new_type == TREE_TYPE (*tp))
542 else if (TREE_CODE (*tp) == INTEGER_CST)
543 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
544 TREE_INT_CST_HIGH (*tp));
547 *tp = copy_node (*tp);
548 TREE_TYPE (*tp) = new_type;
552 /* Otherwise, just copy the node. Note that copy_tree_r already
553 knows not to copy VAR_DECLs, etc., so this is safe. */
556 /* Here we handle trees that are not completely rewritten.
557 First we detect some inlining-induced bogosities for
559 if (TREE_CODE (*tp) == MODIFY_EXPR
560 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
561 && (lang_hooks.tree_inlining.auto_var_in_fn_p
562 (TREE_OPERAND (*tp, 0), fn)))
564 /* Some assignments VAR = VAR; don't generate any rtl code
565 and thus don't count as variable modification. Avoid
566 keeping bogosities like 0 = 0. */
567 tree decl = TREE_OPERAND (*tp, 0), value;
570 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
573 value = (tree) n->value;
574 STRIP_TYPE_NOPS (value);
575 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
577 *tp = build_empty_stmt ();
578 return copy_body_r (tp, walk_subtrees, data);
582 else if (TREE_CODE (*tp) == INDIRECT_REF)
584 /* Get rid of *& from inline substitutions that can happen when a
585 pointer argument is an ADDR_EXPR. */
586 tree decl = TREE_OPERAND (*tp, 0);
589 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
593 /* If we happen to get an ADDR_EXPR in n->value, strip
594 it manually here as we'll eventually get ADDR_EXPRs
595 which lie about their types pointed to. In this case
596 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
597 but we absolutely rely on that. As fold_indirect_ref
598 does other useful transformations, try that first, though. */
599 tree type = TREE_TYPE (TREE_TYPE ((tree)n->value));
600 new = unshare_expr ((tree)n->value);
601 *tp = fold_indirect_ref_1 (type, new);
604 if (TREE_CODE (new) == ADDR_EXPR)
605 *tp = TREE_OPERAND (new, 0);
607 *tp = build1 (INDIRECT_REF, type, new);
614 /* Here is the "usual case". Copy this tree node, and then
615 tweak some special cases. */
616 copy_tree_r (tp, walk_subtrees, NULL);
618 /* If EXPR has block defined, map it to newly constructed block.
619 When inlining we want EXPRs without block appear in the block
621 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (*tp))))
623 new_block = id->block;
624 if (TREE_BLOCK (*tp))
627 n = splay_tree_lookup (id->decl_map,
628 (splay_tree_key) TREE_BLOCK (*tp));
630 new_block = (tree) n->value;
632 TREE_BLOCK (*tp) = new_block;
635 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
636 TREE_OPERAND (*tp, 0) =
639 id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
641 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
643 /* The copied TARGET_EXPR has never been expanded, even if the
644 original node was expanded already. */
645 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
647 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
648 TREE_OPERAND (*tp, 3) = NULL_TREE;
651 /* Variable substitution need not be simple. In particular, the
652 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
653 and friends are up-to-date. */
654 else if (TREE_CODE (*tp) == ADDR_EXPR)
656 walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
657 recompute_tree_invariant_for_addr_expr (*tp);
662 /* Keep iterating. */
666 /* Copy basic block, scale profile accordingly. Edges will be taken care of
670 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
672 block_stmt_iterator bsi, copy_bsi;
673 basic_block copy_basic_block;
675 /* create_basic_block() will append every new block to
676 basic_block_info automatically. */
677 copy_basic_block = create_basic_block (NULL, (void *) 0,
678 (basic_block) bb->prev_bb->aux);
679 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
680 copy_basic_block->frequency = (bb->frequency
681 * frequency_scale / REG_BR_PROB_BASE);
682 copy_bsi = bsi_start (copy_basic_block);
684 for (bsi = bsi_start (bb);
685 !bsi_end_p (bsi); bsi_next (&bsi))
687 tree stmt = bsi_stmt (bsi);
688 tree orig_stmt = stmt;
690 walk_tree (&stmt, copy_body_r, id, NULL);
692 /* RETURN_EXPR might be removed,
693 this is signalled by making stmt pointer NULL. */
697 bsi_insert_after (©_bsi, stmt, BSI_NEW_STMT);
698 call = get_call_expr_in (stmt);
699 /* We're duplicating a CALL_EXPR. Find any corresponding
700 callgraph edges and update or duplicate them. */
701 if (call && (decl = get_callee_fndecl (call)))
703 struct cgraph_node *node;
704 struct cgraph_edge *edge;
706 switch (id->transform_call_graph_edges)
708 case CB_CGE_DUPLICATE:
709 edge = cgraph_edge (id->src_node, orig_stmt);
711 cgraph_clone_edge (edge, id->dst_node, stmt,
712 REG_BR_PROB_BASE, 1, true);
715 case CB_CGE_MOVE_CLONES:
716 for (node = id->dst_node->next_clone;
718 node = node->next_clone)
720 edge = cgraph_edge (node, orig_stmt);
722 edge->call_stmt = stmt;
727 edge = cgraph_edge (id->dst_node, orig_stmt);
729 edge->call_stmt = stmt;
736 /* If you think we can abort here, you are wrong.
737 There is no region 0 in tree land. */
738 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
741 if (tree_could_throw_p (stmt))
743 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
744 /* Add an entry for the copied tree in the EH hashtable.
745 When cloning or versioning, use the hashtable in
746 cfun, and just copy the EH number. When inlining, use the
747 hashtable in the caller, and adjust the region number. */
749 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
751 /* If this tree doesn't have a region associated with it,
752 and there is a "current region,"
753 then associate this tree with the current region
754 and add edges associated with this region. */
755 if ((lookup_stmt_eh_region_fn (id->src_cfun,
757 && id->eh_region > 0)
758 && tree_could_throw_p (stmt))
759 add_stmt_to_eh_region (stmt, id->eh_region);
763 return copy_basic_block;
766 /* Copy edges from BB into its copy constructed earlier, scale profile
767 accordingly. Edges will be taken care of later. Assume aux
768 pointers to point to the copies of each BB. */
770 copy_edges_for_bb (basic_block bb, int count_scale)
772 basic_block new_bb = (basic_block) bb->aux;
775 block_stmt_iterator bsi;
778 /* Use the indices from the original blocks to create edges for the
780 FOR_EACH_EDGE (old_edge, ei, bb->succs)
781 if (!(old_edge->flags & EDGE_EH))
785 flags = old_edge->flags;
787 /* Return edges do get a FALLTHRU flag when the get inlined. */
788 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
789 && old_edge->dest->aux != EXIT_BLOCK_PTR)
790 flags |= EDGE_FALLTHRU;
791 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
792 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
793 new->probability = old_edge->probability;
796 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
799 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
803 copy_stmt = bsi_stmt (bsi);
804 update_stmt (copy_stmt);
805 /* Do this before the possible split_block. */
808 /* If this tree could throw an exception, there are two
809 cases where we need to add abnormal edge(s): the
810 tree wasn't in a region and there is a "current
811 region" in the caller; or the original tree had
812 EH edges. In both cases split the block after the tree,
813 and add abnormal edge(s) as needed; we need both
814 those from the callee and the caller.
815 We check whether the copy can throw, because the const
816 propagation can change an INDIRECT_REF which throws
817 into a COMPONENT_REF which doesn't. If the copy
818 can throw, the original could also throw. */
820 if (tree_can_throw_internal (copy_stmt))
822 if (!bsi_end_p (bsi))
823 /* Note that bb's predecessor edges aren't necessarily
824 right at this point; split_block doesn't care. */
826 edge e = split_block (new_bb, copy_stmt);
828 bsi = bsi_start (new_bb);
831 make_eh_edges (copy_stmt);
836 /* Wrapper for remap_decl so it can be used as a callback. */
838 remap_decl_1 (tree decl, void *data)
840 return remap_decl (decl, (copy_body_data *) data);
843 /* Make a copy of the body of FN so that it can be inserted inline in
844 another function. Walks FN via CFG, returns new fndecl. */
847 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
848 basic_block entry_block_map, basic_block exit_block_map)
850 tree callee_fndecl = id->src_fn;
851 /* Original cfun for the callee, doesn't change. */
852 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
853 /* Copy, built by this function. */
854 struct function *new_cfun;
855 /* Place to copy from; when a copy of the function was saved off earlier,
856 use that instead of the main copy. */
857 struct function *cfun_to_copy =
858 (struct function *) ggc_alloc_cleared (sizeof (struct function));
860 tree new_fndecl = NULL;
861 int count_scale, frequency_scale;
863 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
864 count_scale = (REG_BR_PROB_BASE * count
865 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
869 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
870 frequency_scale = (REG_BR_PROB_BASE * frequency
872 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
874 frequency_scale = count_scale;
876 /* Register specific tree functions. */
877 tree_register_cfg_hooks ();
879 /* Must have a CFG here at this point. */
880 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
881 (DECL_STRUCT_FUNCTION (callee_fndecl)));
883 *cfun_to_copy = *DECL_STRUCT_FUNCTION (callee_fndecl);
885 id->src_cfun = cfun_to_copy;
887 /* If requested, create new basic_block_info and label_to_block_maps.
888 Otherwise, insert our new blocks and labels into the existing cfg. */
889 if (id->transform_new_cfg)
892 (struct function *) ggc_alloc_cleared (sizeof (struct function));
893 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
894 new_cfun->cfg = NULL;
895 new_cfun->decl = new_fndecl = copy_node (callee_fndecl);
896 new_cfun->ib_boundaries_block = (varray_type) 0;
897 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
898 push_cfun (new_cfun);
899 init_empty_tree_cfg ();
901 ENTRY_BLOCK_PTR->count =
902 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
904 ENTRY_BLOCK_PTR->frequency =
905 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
906 frequency_scale / REG_BR_PROB_BASE);
907 EXIT_BLOCK_PTR->count =
908 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
910 EXIT_BLOCK_PTR->frequency =
911 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
912 frequency_scale / REG_BR_PROB_BASE);
914 entry_block_map = ENTRY_BLOCK_PTR;
915 exit_block_map = EXIT_BLOCK_PTR;
918 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
919 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
921 /* Duplicate any exception-handling regions. */
924 if (id->transform_new_cfg)
925 init_eh_for_function ();
927 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id, id->eh_region);
929 /* Use aux pointers to map the original blocks to copy. */
930 FOR_EACH_BB_FN (bb, cfun_to_copy)
931 bb->aux = copy_bb (id, bb, frequency_scale, count_scale);
932 /* Now that we've duplicated the blocks, duplicate their edges. */
933 FOR_ALL_BB_FN (bb, cfun_to_copy)
934 copy_edges_for_bb (bb, count_scale);
935 FOR_ALL_BB_FN (bb, cfun_to_copy)
938 if (id->transform_new_cfg)
944 /* Make a copy of the body of FN so that it can be inserted inline in
948 copy_generic_body (copy_body_data *id)
951 tree fndecl = id->src_fn;
953 body = DECL_SAVED_TREE (fndecl);
954 walk_tree (&body, copy_body_r, id, NULL);
960 copy_body (copy_body_data *id, gcov_type count, int frequency,
961 basic_block entry_block_map, basic_block exit_block_map)
963 tree fndecl = id->src_fn;
966 /* If this body has a CFG, walk CFG and copy. */
967 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
968 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
973 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
974 defined in function FN, or of a data member thereof. */
977 self_inlining_addr_expr (tree value, tree fn)
981 if (TREE_CODE (value) != ADDR_EXPR)
984 var = get_base_address (TREE_OPERAND (value, 0));
986 return var && lang_hooks.tree_inlining.auto_var_in_fn_p (var, fn);
990 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
991 basic_block bb, tree *vars)
997 /* If the parameter is never assigned to, we may not need to
998 create a new variable here at all. Instead, we may be able
999 to just use the argument value. */
1000 if (TREE_READONLY (p)
1001 && !TREE_ADDRESSABLE (p)
1002 && value && !TREE_SIDE_EFFECTS (value))
1004 /* We may produce non-gimple trees by adding NOPs or introduce
1005 invalid sharing when operand is not really constant.
1006 It is not big deal to prohibit constant propagation here as
1007 we will constant propagate in DOM1 pass anyway. */
1008 if (is_gimple_min_invariant (value)
1009 && lang_hooks.types_compatible_p (TREE_TYPE (value), TREE_TYPE (p))
1010 /* We have to be very careful about ADDR_EXPR. Make sure
1011 the base variable isn't a local variable of the inlined
1012 function, e.g., when doing recursive inlining, direct or
1013 mutually-recursive or whatever, which is why we don't
1014 just test whether fn == current_function_decl. */
1015 && ! self_inlining_addr_expr (value, fn))
1017 insert_decl_map (id, p, value);
1022 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1023 here since the type of this decl must be visible to the calling
1025 var = copy_decl_to_var (p, id);
1027 /* See if the frontend wants to pass this by invisible reference. If
1028 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1029 replace uses of the PARM_DECL with dereferences. */
1030 if (TREE_TYPE (var) != TREE_TYPE (p)
1031 && POINTER_TYPE_P (TREE_TYPE (var))
1032 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1034 insert_decl_map (id, var, var);
1035 var_sub = build_fold_indirect_ref (var);
1040 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1041 that way, when the PARM_DECL is encountered, it will be
1042 automatically replaced by the VAR_DECL. */
1043 insert_decl_map (id, p, var_sub);
1045 /* Declare this new variable. */
1046 TREE_CHAIN (var) = *vars;
1049 /* Make gimplifier happy about this variable. */
1050 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1052 /* Even if P was TREE_READONLY, the new VAR should not be.
1053 In the original code, we would have constructed a
1054 temporary, and then the function body would have never
1055 changed the value of P. However, now, we will be
1056 constructing VAR directly. The constructor body may
1057 change its value multiple times as it is being
1058 constructed. Therefore, it must not be TREE_READONLY;
1059 the back-end assumes that TREE_READONLY variable is
1060 assigned to only once. */
1061 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1062 TREE_READONLY (var) = 0;
1064 /* Initialize this VAR_DECL from the equivalent argument. Convert
1065 the argument to the proper type in case it was promoted. */
1068 tree rhs = fold_convert (TREE_TYPE (var), value);
1069 block_stmt_iterator bsi = bsi_last (bb);
1071 if (rhs == error_mark_node)
1074 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
1075 keep our trees in gimple form. */
1076 init_stmt = build2 (MODIFY_EXPR, TREE_TYPE (var), var, rhs);
1078 /* If we did not create a gimple value and we did not create a gimple
1079 cast of a gimple value, then we will need to gimplify INIT_STMTS
1080 at the end. Note that is_gimple_cast only checks the outer
1081 tree code, not its operand. Thus the explicit check that its
1082 operand is a gimple value. */
1083 if (!is_gimple_val (rhs)
1084 && (!is_gimple_cast (rhs)
1085 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1086 gimplify_stmt (&init_stmt);
1088 /* If VAR represents a zero-sized variable, it's possible that the
1089 assignment statment may result in no gimple statements. */
1091 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1095 /* Generate code to initialize the parameters of the function at the
1096 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
1099 initialize_inlined_parameters (copy_body_data *id, tree args, tree static_chain,
1100 tree fn, basic_block bb)
1105 tree vars = NULL_TREE;
1108 /* Figure out what the parameters are. */
1109 parms = DECL_ARGUMENTS (fn);
1111 /* Loop through the parameter declarations, replacing each with an
1112 equivalent VAR_DECL, appropriately initialized. */
1113 for (p = parms, a = args; p;
1114 a = a ? TREE_CHAIN (a) : a, p = TREE_CHAIN (p))
1120 /* Find the initializer. */
1121 value = lang_hooks.tree_inlining.convert_parm_for_inlining
1122 (p, a ? TREE_VALUE (a) : NULL_TREE, fn, argnum);
1124 setup_one_parameter (id, p, value, fn, bb, &vars);
1127 /* Initialize the static chain. */
1128 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1129 gcc_assert (fn != current_function_decl);
1132 /* No static chain? Seems like a bug in tree-nested.c. */
1133 gcc_assert (static_chain);
1135 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1138 declare_inline_vars (id->block, vars);
1141 /* Declare a return variable to replace the RESULT_DECL for the
1142 function we are calling. An appropriate DECL_STMT is returned.
1143 The USE_STMT is filled to contain a use of the declaration to
1144 indicate the return value of the function.
1146 RETURN_SLOT_ADDR, if non-null, was a fake parameter that
1147 took the address of the result. MODIFY_DEST, if non-null, was the LHS of
1148 the MODIFY_EXPR to which this call is the RHS.
1150 The return value is a (possibly null) value that is the result of the
1151 function as seen by the callee. *USE_P is a (possibly null) value that
1152 holds the result as seen by the caller. */
1155 declare_return_variable (copy_body_data *id, tree return_slot_addr,
1156 tree modify_dest, tree *use_p)
1158 tree callee = id->src_fn;
1159 tree caller = id->dst_fn;
1160 tree result = DECL_RESULT (callee);
1161 tree callee_type = TREE_TYPE (result);
1162 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1165 /* We don't need to do anything for functions that don't return
1167 if (!result || VOID_TYPE_P (callee_type))
1173 /* If there was a return slot, then the return value is the
1174 dereferenced address of that object. */
1175 if (return_slot_addr)
1177 /* The front end shouldn't have used both return_slot_addr and
1178 a modify expression. */
1179 gcc_assert (!modify_dest);
1180 if (DECL_BY_REFERENCE (result))
1181 var = return_slot_addr;
1183 var = build_fold_indirect_ref (return_slot_addr);
1184 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1185 && !DECL_COMPLEX_GIMPLE_REG_P (result)
1187 DECL_COMPLEX_GIMPLE_REG_P (var) = 0;
1192 /* All types requiring non-trivial constructors should have been handled. */
1193 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1195 /* Attempt to avoid creating a new temporary variable. */
1198 bool use_it = false;
1200 /* We can't use MODIFY_DEST if there's type promotion involved. */
1201 if (!lang_hooks.types_compatible_p (caller_type, callee_type))
1204 /* ??? If we're assigning to a variable sized type, then we must
1205 reuse the destination variable, because we've no good way to
1206 create variable sized temporaries at this point. */
1207 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1210 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1211 reuse it as the result of the call directly. Don't do this if
1212 it would promote MODIFY_DEST to addressable. */
1213 else if (TREE_ADDRESSABLE (result))
1217 tree base_m = get_base_address (modify_dest);
1219 /* If the base isn't a decl, then it's a pointer, and we don't
1220 know where that's going to go. */
1221 if (!DECL_P (base_m))
1223 else if (is_global_var (base_m))
1225 else if (TREE_CODE (TREE_TYPE (base_m)) == COMPLEX_TYPE
1226 && !DECL_COMPLEX_GIMPLE_REG_P (result))
1227 DECL_COMPLEX_GIMPLE_REG_P (base_m) = 0;
1228 else if (!TREE_ADDRESSABLE (base_m))
1240 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1242 var = copy_decl_to_var (result, id);
1244 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1245 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1246 = tree_cons (NULL_TREE, var,
1247 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1249 /* Do not have the rest of GCC warn about this variable as it should
1250 not be visible to the user. */
1251 TREE_NO_WARNING (var) = 1;
1253 /* Build the use expr. If the return type of the function was
1254 promoted, convert it back to the expected type. */
1256 if (!lang_hooks.types_compatible_p (TREE_TYPE (var), caller_type))
1257 use = fold_convert (caller_type, var);
1260 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1261 way, when the RESULT_DECL is encountered, it will be
1262 automatically replaced by the VAR_DECL. */
1263 insert_decl_map (id, result, var);
1265 /* Remember this so we can ignore it in remap_decls. */
1272 /* Returns nonzero if a function can be inlined as a tree. */
1275 tree_inlinable_function_p (tree fn)
1277 return inlinable_function_p (fn);
1280 static const char *inline_forbidden_reason;
1283 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1287 tree fn = (tree) fnp;
1290 switch (TREE_CODE (node))
1293 /* Refuse to inline alloca call unless user explicitly forced so as
1294 this may change program's memory overhead drastically when the
1295 function using alloca is called in loop. In GCC present in
1296 SPEC2000 inlining into schedule_block cause it to require 2GB of
1297 RAM instead of 256MB. */
1298 if (alloca_call_p (node)
1299 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1301 inline_forbidden_reason
1302 = G_("function %q+F can never be inlined because it uses "
1303 "alloca (override using the always_inline attribute)");
1306 t = get_callee_fndecl (node);
1310 /* We cannot inline functions that call setjmp. */
1311 if (setjmp_call_p (t))
1313 inline_forbidden_reason
1314 = G_("function %q+F can never be inlined because it uses setjmp");
1318 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1319 switch (DECL_FUNCTION_CODE (t))
1321 /* We cannot inline functions that take a variable number of
1323 case BUILT_IN_VA_START:
1324 case BUILT_IN_STDARG_START:
1325 case BUILT_IN_NEXT_ARG:
1326 case BUILT_IN_VA_END:
1327 inline_forbidden_reason
1328 = G_("function %q+F can never be inlined because it "
1329 "uses variable argument lists");
1332 case BUILT_IN_LONGJMP:
1333 /* We can't inline functions that call __builtin_longjmp at
1334 all. The non-local goto machinery really requires the
1335 destination be in a different function. If we allow the
1336 function calling __builtin_longjmp to be inlined into the
1337 function calling __builtin_setjmp, Things will Go Awry. */
1338 inline_forbidden_reason
1339 = G_("function %q+F can never be inlined because "
1340 "it uses setjmp-longjmp exception handling");
1343 case BUILT_IN_NONLOCAL_GOTO:
1345 inline_forbidden_reason
1346 = G_("function %q+F can never be inlined because "
1347 "it uses non-local goto");
1350 case BUILT_IN_RETURN:
1351 case BUILT_IN_APPLY_ARGS:
1352 /* If a __builtin_apply_args caller would be inlined,
1353 it would be saving arguments of the function it has
1354 been inlined into. Similarly __builtin_return would
1355 return from the function the inline has been inlined into. */
1356 inline_forbidden_reason
1357 = G_("function %q+F can never be inlined because "
1358 "it uses __builtin_return or __builtin_apply_args");
1367 t = TREE_OPERAND (node, 0);
1369 /* We will not inline a function which uses computed goto. The
1370 addresses of its local labels, which may be tucked into
1371 global storage, are of course not constant across
1372 instantiations, which causes unexpected behavior. */
1373 if (TREE_CODE (t) != LABEL_DECL)
1375 inline_forbidden_reason
1376 = G_("function %q+F can never be inlined "
1377 "because it contains a computed goto");
1383 t = TREE_OPERAND (node, 0);
1384 if (DECL_NONLOCAL (t))
1386 /* We cannot inline a function that receives a non-local goto
1387 because we cannot remap the destination label used in the
1388 function that is performing the non-local goto. */
1389 inline_forbidden_reason
1390 = G_("function %q+F can never be inlined "
1391 "because it receives a non-local goto");
1398 /* We cannot inline a function of the form
1400 void F (int i) { struct S { int ar[i]; } s; }
1402 Attempting to do so produces a catch-22.
1403 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1404 UNION_TYPE nodes, then it goes into infinite recursion on a
1405 structure containing a pointer to its own type. If it doesn't,
1406 then the type node for S doesn't get adjusted properly when
1409 ??? This is likely no longer true, but it's too late in the 4.0
1410 cycle to try to find out. This should be checked for 4.1. */
1411 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1412 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1414 inline_forbidden_reason
1415 = G_("function %q+F can never be inlined "
1416 "because it uses variable sized variables");
1427 /* Return subexpression representing possible alloca call, if any. */
1429 inline_forbidden_p (tree fndecl)
1431 location_t saved_loc = input_location;
1432 block_stmt_iterator bsi;
1434 tree ret = NULL_TREE;
1436 FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
1437 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1439 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
1440 inline_forbidden_p_1, fndecl);
1446 input_location = saved_loc;
1450 /* Returns nonzero if FN is a function that does not have any
1451 fundamental inline blocking properties. */
1454 inlinable_function_p (tree fn)
1456 bool inlinable = true;
1458 /* If we've already decided this function shouldn't be inlined,
1459 there's no need to check again. */
1460 if (DECL_UNINLINABLE (fn))
1463 /* See if there is any language-specific reason it cannot be
1464 inlined. (It is important that this hook be called early because
1465 in C++ it may result in template instantiation.)
1466 If the function is not inlinable for language-specific reasons,
1467 it is left up to the langhook to explain why. */
1468 inlinable = !lang_hooks.tree_inlining.cannot_inline_tree_fn (&fn);
1470 /* If we don't have the function body available, we can't inline it.
1471 However, this should not be recorded since we also get here for
1472 forward declared inline functions. Therefore, return at once. */
1473 if (!DECL_SAVED_TREE (fn))
1476 /* If we're not inlining at all, then we cannot inline this function. */
1477 else if (!flag_inline_trees)
1480 /* Only try to inline functions if DECL_INLINE is set. This should be
1481 true for all functions declared `inline', and for all other functions
1482 as well with -finline-functions.
1484 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1485 it's the front-end that must set DECL_INLINE in this case, because
1486 dwarf2out loses if a function that does not have DECL_INLINE set is
1487 inlined anyway. That is why we have both DECL_INLINE and
1488 DECL_DECLARED_INLINE_P. */
1489 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1490 here should be redundant. */
1491 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
1494 else if (inline_forbidden_p (fn))
1496 /* See if we should warn about uninlinable functions. Previously,
1497 some of these warnings would be issued while trying to expand
1498 the function inline, but that would cause multiple warnings
1499 about functions that would for example call alloca. But since
1500 this a property of the function, just one warning is enough.
1501 As a bonus we can now give more details about the reason why a
1502 function is not inlinable.
1503 We only warn for functions declared `inline' by the user. */
1504 bool do_warning = (warn_inline
1506 && DECL_DECLARED_INLINE_P (fn)
1507 && !DECL_IN_SYSTEM_HEADER (fn));
1509 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1510 sorry (inline_forbidden_reason, fn);
1511 else if (do_warning)
1512 warning (OPT_Winline, inline_forbidden_reason, fn);
1517 /* Squirrel away the result so that we don't have to check again. */
1518 DECL_UNINLINABLE (fn) = !inlinable;
1523 /* Estimate the cost of a memory move. Use machine dependent
1524 word size and take possible memcpy call into account. */
1527 estimate_move_cost (tree type)
1531 size = int_size_in_bytes (type);
1533 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
1534 /* Cost of a memcpy call, 3 arguments and the call. */
1537 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
1540 /* Used by estimate_num_insns. Estimate number of instructions seen
1541 by given statement. */
1544 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
1546 int *count = (int *) data;
1549 if (IS_TYPE_OR_DECL_P (x))
1554 /* Assume that constants and references counts nothing. These should
1555 be majorized by amount of operations among them we count later
1556 and are common target of CSE and similar optimizations. */
1557 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
1560 switch (TREE_CODE (x))
1562 /* Containers have no cost. */
1569 case ALIGN_INDIRECT_REF:
1570 case MISALIGNED_INDIRECT_REF:
1572 case ARRAY_RANGE_REF:
1574 case EXC_PTR_EXPR: /* ??? */
1575 case FILTER_EXPR: /* ??? */
1578 case WITH_CLEANUP_EXPR:
1580 case VIEW_CONVERT_EXPR:
1585 case CASE_LABEL_EXPR:
1588 case EH_FILTER_EXPR:
1589 case STATEMENT_LIST:
1591 case NON_LVALUE_EXPR:
1594 case TRY_CATCH_EXPR:
1595 case TRY_FINALLY_EXPR:
1602 case WITH_SIZE_EXPR:
1604 case OMP_RETURN_EXPR:
1607 /* We don't account constants for now. Assume that the cost is amortized
1608 by operations that do use them. We may re-consider this decision once
1609 we are able to optimize the tree before estimating its size and break
1610 out static initializers. */
1611 case IDENTIFIER_NODE:
1620 /* Try to estimate the cost of assignments. We have three cases to
1622 1) Simple assignments to registers;
1623 2) Stores to things that must live in memory. This includes
1624 "normal" stores to scalars, but also assignments of large
1625 structures, or constructors of big arrays;
1628 Let us look at the first two cases, assuming we have "a = b + C":
1629 <modify_expr <var_decl "a"> <plus_expr <var_decl "b"> <constant C>>
1630 If "a" is a GIMPLE register, the assignment to it is free on almost
1631 any target, because "a" usually ends up in a real register. Hence
1632 the only cost of this expression comes from the PLUS_EXPR, and we
1633 can ignore the MODIFY_EXPR.
1634 If "a" is not a GIMPLE register, the assignment to "a" will most
1635 likely be a real store, so the cost of the MODIFY_EXPR is the cost
1636 of moving something into "a", which we compute using the function
1639 The third case deals with TARGET_EXPRs, for which the semantics are
1640 that a temporary is assigned, unless the TARGET_EXPR itself is being
1641 assigned to something else. In the latter case we do not need the
1642 temporary. E.g. in <modify_expr <var_decl "a"> <target_expr>>, the
1643 MODIFY_EXPR is free. */
1646 /* Is the right and side a TARGET_EXPR? */
1647 if (TREE_CODE (TREE_OPERAND (x, 1)) == TARGET_EXPR)
1649 /* ... fall through ... */
1652 x = TREE_OPERAND (x, 0);
1653 /* Is this an assignments to a register? */
1654 if (is_gimple_reg (x))
1656 /* Otherwise it's a store, so fall through to compute the move cost. */
1659 *count += estimate_move_cost (TREE_TYPE (x));
1662 /* Assign cost of 1 to usual operations.
1663 ??? We may consider mapping RTL costs to this. */
1671 case FIX_TRUNC_EXPR:
1673 case FIX_FLOOR_EXPR:
1674 case FIX_ROUND_EXPR:
1686 case VEC_LSHIFT_EXPR:
1687 case VEC_RSHIFT_EXPR:
1694 case TRUTH_ANDIF_EXPR:
1695 case TRUTH_ORIF_EXPR:
1696 case TRUTH_AND_EXPR:
1698 case TRUTH_XOR_EXPR:
1699 case TRUTH_NOT_EXPR:
1708 case UNORDERED_EXPR:
1721 case PREDECREMENT_EXPR:
1722 case PREINCREMENT_EXPR:
1723 case POSTDECREMENT_EXPR:
1724 case POSTINCREMENT_EXPR:
1730 case REALIGN_LOAD_EXPR:
1732 case REDUC_MAX_EXPR:
1733 case REDUC_MIN_EXPR:
1734 case REDUC_PLUS_EXPR:
1735 case WIDEN_SUM_EXPR:
1738 case WIDEN_MULT_EXPR:
1744 /* Few special cases of expensive operations. This is useful
1745 to avoid inlining on functions having too many of these. */
1746 case TRUNC_DIV_EXPR:
1748 case FLOOR_DIV_EXPR:
1749 case ROUND_DIV_EXPR:
1750 case EXACT_DIV_EXPR:
1751 case TRUNC_MOD_EXPR:
1753 case FLOOR_MOD_EXPR:
1754 case ROUND_MOD_EXPR:
1760 tree decl = get_callee_fndecl (x);
1763 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
1764 switch (DECL_FUNCTION_CODE (decl))
1766 case BUILT_IN_CONSTANT_P:
1769 case BUILT_IN_EXPECT:
1775 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
1776 that does use function declaration to figure out the arguments. */
1779 for (arg = TREE_OPERAND (x, 1); arg; arg = TREE_CHAIN (arg))
1780 *count += estimate_move_cost (TREE_TYPE (TREE_VALUE (arg)));
1784 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
1785 *count += estimate_move_cost (TREE_TYPE (arg));
1788 *count += PARAM_VALUE (PARAM_INLINE_CALL_COST);
1801 /* OpenMP directives are generally very expensive. */
1811 /* Estimate number of instructions that will be created by expanding EXPR. */
1814 estimate_num_insns (tree expr)
1817 struct pointer_set_t *visited_nodes;
1819 block_stmt_iterator bsi;
1820 struct function *my_function;
1822 /* If we're given an entire function, walk the CFG. */
1823 if (TREE_CODE (expr) == FUNCTION_DECL)
1825 my_function = DECL_STRUCT_FUNCTION (expr);
1826 gcc_assert (my_function && my_function->cfg);
1827 visited_nodes = pointer_set_create ();
1828 FOR_EACH_BB_FN (bb, my_function)
1830 for (bsi = bsi_start (bb);
1834 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
1835 &num, visited_nodes);
1838 pointer_set_destroy (visited_nodes);
1841 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &num);
1846 typedef struct function *function_p;
1848 DEF_VEC_P(function_p);
1849 DEF_VEC_ALLOC_P(function_p,heap);
1851 /* Initialized with NOGC, making this poisonous to the garbage collector. */
1852 static VEC(function_p,heap) *cfun_stack;
1855 push_cfun (struct function *new_cfun)
1857 VEC_safe_push (function_p, heap, cfun_stack, cfun);
1864 cfun = VEC_pop (function_p, cfun_stack);
1867 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
1869 add_lexical_block (tree current_block, tree new_block)
1873 /* Walk to the last sub-block. */
1874 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
1876 blk_p = &TREE_CHAIN (*blk_p))
1879 BLOCK_SUPERCONTEXT (new_block) = current_block;
1882 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1885 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
1893 tree return_slot_addr;
1895 location_t saved_location;
1896 struct cgraph_edge *cg_edge;
1898 basic_block return_block;
1900 block_stmt_iterator bsi, stmt_bsi;
1901 bool successfully_inlined = FALSE;
1906 /* See what we've got. */
1907 id = (copy_body_data *) data;
1910 /* Set input_location here so we get the right instantiation context
1911 if we call instantiate_decl from inlinable_function_p. */
1912 saved_location = input_location;
1913 if (EXPR_HAS_LOCATION (t))
1914 input_location = EXPR_LOCATION (t);
1916 /* From here on, we're only interested in CALL_EXPRs. */
1917 if (TREE_CODE (t) != CALL_EXPR)
1920 /* First, see if we can figure out what function is being called.
1921 If we cannot, then there is no hope of inlining the function. */
1922 fn = get_callee_fndecl (t);
1926 /* Turn forward declarations into real ones. */
1927 fn = cgraph_node (fn)->decl;
1929 /* If fn is a declaration of a function in a nested scope that was
1930 globally declared inline, we don't set its DECL_INITIAL.
1931 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1932 C++ front-end uses it for cdtors to refer to their internal
1933 declarations, that are not real functions. Fortunately those
1934 don't have trees to be saved, so we can tell by checking their
1936 if (! DECL_INITIAL (fn)
1937 && DECL_ABSTRACT_ORIGIN (fn)
1938 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
1939 fn = DECL_ABSTRACT_ORIGIN (fn);
1941 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1942 Kill this check once this is fixed. */
1943 if (!id->dst_node->analyzed)
1946 cg_edge = cgraph_edge (id->dst_node, stmt);
1948 /* Constant propagation on argument done during previous inlining
1949 may create new direct call. Produce an edge for it. */
1952 struct cgraph_node *dest = cgraph_node (fn);
1954 /* We have missing edge in the callgraph. This can happen in one case
1955 where previous inlining turned indirect call into direct call by
1956 constant propagating arguments. In all other cases we hit a bug
1957 (incorrect node sharing is most common reason for missing edges. */
1958 gcc_assert (dest->needed || !flag_unit_at_a_time);
1959 cgraph_create_edge (id->dst_node, dest, stmt,
1960 bb->count, bb->loop_depth)->inline_failed
1961 = N_("originally indirect function call not considered for inlining");
1965 /* Don't try to inline functions that are not well-suited to
1967 if (!cgraph_inline_p (cg_edge, &reason))
1969 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
1970 /* Avoid warnings during early inline pass. */
1971 && (!flag_unit_at_a_time || cgraph_global_info_ready))
1973 sorry ("inlining failed in call to %q+F: %s", fn, reason);
1974 sorry ("called from here");
1976 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
1977 && !DECL_IN_SYSTEM_HEADER (fn)
1979 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
1980 /* Avoid warnings during early inline pass. */
1981 && (!flag_unit_at_a_time || cgraph_global_info_ready))
1983 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
1985 warning (OPT_Winline, "called from here");
1989 fn = cg_edge->callee->decl;
1991 #ifdef ENABLE_CHECKING
1992 if (cg_edge->callee->decl != id->dst_node->decl)
1993 verify_cgraph_node (cg_edge->callee);
1996 /* We will be inlining this callee. */
1998 id->eh_region = lookup_stmt_eh_region (stmt);
2000 /* Split the block holding the CALL_EXPR. */
2002 e = split_block (bb, stmt);
2004 return_block = e->dest;
2007 /* split_block splits before the statement, work around this by moving
2008 the call into the first half_bb. Not pretty, but seems easier than
2009 doing the CFG manipulation by hand when the CALL_EXPR is in the last
2011 stmt_bsi = bsi_last (bb);
2012 bsi = bsi_start (return_block);
2013 if (!bsi_end_p (bsi))
2014 bsi_move_before (&stmt_bsi, &bsi);
2017 tree stmt = bsi_stmt (stmt_bsi);
2018 bsi_remove (&stmt_bsi, false);
2019 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2021 stmt_bsi = bsi_start (return_block);
2023 /* Build a block containing code to initialize the arguments, the
2024 actual inline expansion of the body, and a label for the return
2025 statements within the function to jump to. The type of the
2026 statement expression is the return type of the function call. */
2027 id->block = make_node (BLOCK);
2028 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2029 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2030 add_lexical_block (TREE_BLOCK (stmt), id->block);
2032 /* Local declarations will be replaced by their equivalents in this
2035 id->decl_map = splay_tree_new (splay_tree_compare_pointers,
2038 /* Initialize the parameters. */
2039 args = TREE_OPERAND (t, 1);
2041 /* Record the function we are about to inline. */
2043 id->src_node = cg_edge->callee;
2045 initialize_inlined_parameters (id, args, TREE_OPERAND (t, 2), fn, bb);
2047 if (DECL_INITIAL (fn))
2048 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2050 /* Return statements in the function body will be replaced by jumps
2051 to the RET_LABEL. */
2053 gcc_assert (DECL_INITIAL (fn));
2054 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2056 /* Find the lhs to which the result of this call is assigned. */
2057 return_slot_addr = NULL;
2058 if (TREE_CODE (stmt) == MODIFY_EXPR)
2060 modify_dest = TREE_OPERAND (stmt, 0);
2062 /* The function which we are inlining might not return a value,
2063 in which case we should issue a warning that the function
2064 does not return a value. In that case the optimizers will
2065 see that the variable to which the value is assigned was not
2066 initialized. We do not want to issue a warning about that
2067 uninitialized variable. */
2068 if (DECL_P (modify_dest))
2069 TREE_NO_WARNING (modify_dest) = 1;
2070 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2072 return_slot_addr = build_fold_addr_expr (modify_dest);
2079 /* Declare the return variable for the function. */
2080 decl = declare_return_variable (id, return_slot_addr,
2081 modify_dest, &use_retvar);
2082 /* Do this only if declare_return_variable created a new one. */
2083 if (decl && !return_slot_addr && decl != modify_dest)
2084 declare_inline_vars (id->block, decl);
2086 /* This is it. Duplicate the callee body. Assume callee is
2087 pre-gimplified. Note that we must not alter the caller
2088 function in any way before this point, as this CALL_EXPR may be
2089 a self-referential call; if we're calling ourselves, we need to
2090 duplicate our body before altering anything. */
2091 copy_body (id, bb->count, bb->frequency, bb, return_block);
2093 /* Add local vars in this inlined callee to caller. */
2094 t_step = id->src_cfun->unexpanded_var_list;
2095 for (; t_step; t_step = TREE_CHAIN (t_step))
2097 var = TREE_VALUE (t_step);
2098 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2099 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2100 cfun->unexpanded_var_list);
2102 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2103 cfun->unexpanded_var_list);
2107 splay_tree_delete (id->decl_map);
2110 /* If the inlined function returns a result that we care about,
2111 clobber the CALL_EXPR with a reference to the return variable. */
2112 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2115 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2118 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2119 tsi_delink() will leave the iterator in a sane state. */
2120 bsi_remove (&stmt_bsi, true);
2123 if (bsi_end_p (bsi))
2124 tree_purge_dead_eh_edges (return_block);
2126 /* If the value of the new expression is ignored, that's OK. We
2127 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2128 the equivalent inlined version either. */
2129 TREE_USED (*tp) = 1;
2131 /* Output the inlining info for this abstract function, since it has been
2132 inlined. If we don't do this now, we can lose the information about the
2133 variables in the function when the blocks get blown away as soon as we
2134 remove the cgraph node. */
2135 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2137 /* Update callgraph if needed. */
2138 cgraph_remove_node (cg_edge->callee);
2140 /* Declare the 'auto' variables added with this inlined body. */
2141 record_vars (BLOCK_VARS (id->block));
2142 id->block = NULL_TREE;
2143 successfully_inlined = TRUE;
2146 input_location = saved_location;
2147 return successfully_inlined;
2150 /* Expand call statements reachable from STMT_P.
2151 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2152 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
2153 unfortunately not use that function here because we need a pointer
2154 to the CALL_EXPR, not the tree itself. */
2157 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2159 block_stmt_iterator bsi;
2161 /* Register specific tree functions. */
2162 tree_register_cfg_hooks ();
2163 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2165 tree *expr_p = bsi_stmt_ptr (bsi);
2166 tree stmt = *expr_p;
2168 if (TREE_CODE (*expr_p) == MODIFY_EXPR)
2169 expr_p = &TREE_OPERAND (*expr_p, 1);
2170 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2171 expr_p = &TREE_OPERAND (*expr_p, 0);
2172 if (TREE_CODE (*expr_p) == CALL_EXPR)
2173 if (expand_call_inline (bb, stmt, expr_p, id))
2179 /* Expand calls to inline functions in the body of FN. */
2182 optimize_inline_calls (tree fn)
2187 /* There is no point in performing inlining if errors have already
2188 occurred -- and we might crash if we try to inline invalid
2190 if (errorcount || sorrycount)
2194 memset (&id, 0, sizeof (id));
2196 id.src_node = id.dst_node = cgraph_node (fn);
2198 /* Or any functions that aren't finished yet. */
2199 prev_fn = NULL_TREE;
2200 if (current_function_decl)
2202 id.dst_fn = current_function_decl;
2203 prev_fn = current_function_decl;
2206 id.copy_decl = copy_decl_maybe_to_var;
2207 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2208 id.transform_new_cfg = false;
2209 id.transform_return_to_modify = true;
2210 id.transform_lang_insert_block = false;
2212 push_gimplify_context ();
2214 /* Reach the trees by walking over the CFG, and note the
2215 enclosing basic-blocks in the call edges. */
2216 /* We walk the blocks going forward, because inlined function bodies
2217 will split id->current_basic_block, and the new blocks will
2218 follow it; we'll trudge through them, processing their CALL_EXPRs
2221 gimple_expand_calls_inline (bb, &id);
2223 pop_gimplify_context (NULL);
2224 /* Renumber the (code) basic_blocks consecutively. */
2226 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2229 #ifdef ENABLE_CHECKING
2231 struct cgraph_edge *e;
2233 verify_cgraph_node (id.dst_node);
2235 /* Double check that we inlined everything we are supposed to inline. */
2236 for (e = id.dst_node->callees; e; e = e->next_callee)
2237 gcc_assert (e->inline_failed);
2240 /* We need to rescale frequencies again to peak at REG_BR_PROB_BASE
2241 as inlining loops might increase the maximum. */
2242 if (ENTRY_BLOCK_PTR->count)
2244 fold_cond_expr_cond ();
2247 /* FN is a function that has a complete body, and CLONE is a function whose
2248 body is to be set to a copy of FN, mapping argument declarations according
2249 to the ARG_MAP splay_tree. */
2252 clone_body (tree clone, tree fn, void *arg_map)
2256 /* Clone the body, as if we were making an inline call. But, remap the
2257 parameters in the callee to the parameters of caller. */
2258 memset (&id, 0, sizeof (id));
2261 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
2262 id.decl_map = (splay_tree)arg_map;
2264 id.copy_decl = copy_decl_no_change;
2265 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2266 id.transform_new_cfg = true;
2267 id.transform_return_to_modify = false;
2268 id.transform_lang_insert_block = true;
2270 /* We're not inside any EH region. */
2273 /* Actually copy the body. */
2274 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
2277 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2280 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2282 enum tree_code code = TREE_CODE (*tp);
2284 /* We make copies of most nodes. */
2285 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
2286 || code == TREE_LIST
2288 || code == TYPE_DECL
2289 || code == OMP_CLAUSE)
2291 /* Because the chain gets clobbered when we make a copy, we save it
2293 tree chain = TREE_CHAIN (*tp);
2296 /* Copy the node. */
2297 new = copy_node (*tp);
2299 /* Propagate mudflap marked-ness. */
2300 if (flag_mudflap && mf_marked_p (*tp))
2305 /* Now, restore the chain, if appropriate. That will cause
2306 walk_tree to walk into the chain as well. */
2307 if (code == PARM_DECL
2308 || code == TREE_LIST
2309 || code == OMP_CLAUSE)
2310 TREE_CHAIN (*tp) = chain;
2312 /* For now, we don't update BLOCKs when we make copies. So, we
2313 have to nullify all BIND_EXPRs. */
2314 if (TREE_CODE (*tp) == BIND_EXPR)
2315 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
2317 else if (code == CONSTRUCTOR)
2319 /* CONSTRUCTOR nodes need special handling because
2320 we need to duplicate the vector of elements. */
2323 new = copy_node (*tp);
2325 /* Propagate mudflap marked-ness. */
2326 if (flag_mudflap && mf_marked_p (*tp))
2329 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
2330 CONSTRUCTOR_ELTS (*tp));
2333 else if (TREE_CODE_CLASS (code) == tcc_type)
2335 else if (TREE_CODE_CLASS (code) == tcc_declaration)
2337 else if (TREE_CODE_CLASS (code) == tcc_constant)
2340 gcc_assert (code != STATEMENT_LIST);
2344 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2345 information indicating to what new SAVE_EXPR this one should be mapped,
2346 use that one. Otherwise, create a new node and enter it in ST. FN is
2347 the function into which the copy will be placed. */
2350 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
2352 splay_tree st = (splay_tree) st_;
2356 /* See if we already encountered this SAVE_EXPR. */
2357 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2359 /* If we didn't already remap this SAVE_EXPR, do so now. */
2362 t = copy_node (*tp);
2364 /* Remember this SAVE_EXPR. */
2365 splay_tree_insert (st, (splay_tree_key) *tp, (splay_tree_value) t);
2366 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2367 splay_tree_insert (st, (splay_tree_key) t, (splay_tree_value) t);
2371 /* We've already walked into this SAVE_EXPR; don't do it again. */
2373 t = (tree) n->value;
2376 /* Replace this SAVE_EXPR with the copy. */
2380 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2381 copies the declaration and enters it in the splay_tree in DATA (which is
2382 really an `copy_body_data *'). */
2385 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2388 copy_body_data *id = (copy_body_data *) data;
2390 /* Don't walk into types. */
2394 else if (TREE_CODE (*tp) == LABEL_EXPR)
2396 tree decl = TREE_OPERAND (*tp, 0);
2398 /* Copy the decl and remember the copy. */
2399 insert_decl_map (id, decl, id->copy_decl (decl, id));
2405 /* Perform any modifications to EXPR required when it is unsaved. Does
2406 not recurse into EXPR's subtrees. */
2409 unsave_expr_1 (tree expr)
2411 switch (TREE_CODE (expr))
2414 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2415 It's OK for this to happen if it was part of a subtree that
2416 isn't immediately expanded, such as operand 2 of another
2418 if (TREE_OPERAND (expr, 1))
2421 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
2422 TREE_OPERAND (expr, 3) = NULL_TREE;
2430 /* Called via walk_tree when an expression is unsaved. Using the
2431 splay_tree pointed to by ST (which is really a `splay_tree'),
2432 remaps all local declarations to appropriate replacements. */
2435 unsave_r (tree *tp, int *walk_subtrees, void *data)
2437 copy_body_data *id = (copy_body_data *) data;
2438 splay_tree st = id->decl_map;
2441 /* Only a local declaration (variable or label). */
2442 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
2443 || TREE_CODE (*tp) == LABEL_DECL)
2445 /* Lookup the declaration. */
2446 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2448 /* If it's there, remap it. */
2450 *tp = (tree) n->value;
2453 else if (TREE_CODE (*tp) == STATEMENT_LIST)
2454 copy_statement_list (tp);
2455 else if (TREE_CODE (*tp) == BIND_EXPR)
2456 copy_bind_expr (tp, walk_subtrees, id);
2457 else if (TREE_CODE (*tp) == SAVE_EXPR)
2458 remap_save_expr (tp, st, walk_subtrees);
2461 copy_tree_r (tp, walk_subtrees, NULL);
2463 /* Do whatever unsaving is required. */
2464 unsave_expr_1 (*tp);
2467 /* Keep iterating. */
2471 /* Copies everything in EXPR and replaces variables, labels
2472 and SAVE_EXPRs local to EXPR. */
2475 unsave_expr_now (tree expr)
2479 /* There's nothing to do for NULL_TREE. */
2484 memset (&id, 0, sizeof (id));
2485 id.src_fn = current_function_decl;
2486 id.dst_fn = current_function_decl;
2487 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2489 id.copy_decl = copy_decl_no_change;
2490 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2491 id.transform_new_cfg = false;
2492 id.transform_return_to_modify = false;
2493 id.transform_lang_insert_block = false;
2495 /* Walk the tree once to find local labels. */
2496 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
2498 /* Walk the tree again, copying, remapping, and unsaving. */
2499 walk_tree (&expr, unsave_r, &id, NULL);
2502 splay_tree_delete (id.decl_map);
2507 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2510 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
2519 debug_find_tree (tree top, tree search)
2521 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
2525 /* Declare the variables created by the inliner. Add all the variables in
2526 VARS to BIND_EXPR. */
2529 declare_inline_vars (tree block, tree vars)
2532 for (t = vars; t; t = TREE_CHAIN (t))
2533 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
2536 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
2540 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
2541 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
2542 VAR_DECL translation. */
2545 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
2547 /* Don't generate debug information for the copy if we wouldn't have
2548 generated it for the copy either. */
2549 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
2550 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
2552 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
2553 declaration inspired this copy. */
2554 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
2556 /* The new variable/label has no RTL, yet. */
2557 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
2558 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
2559 SET_DECL_RTL (copy, NULL_RTX);
2561 /* These args would always appear unused, if not for this. */
2562 TREE_USED (copy) = 1;
2564 /* Set the context for the new declaration. */
2565 if (!DECL_CONTEXT (decl))
2566 /* Globals stay global. */
2568 else if (DECL_CONTEXT (decl) != id->src_fn)
2569 /* Things that weren't in the scope of the function we're inlining
2570 from aren't in the scope we're inlining to, either. */
2572 else if (TREE_STATIC (decl))
2573 /* Function-scoped static variables should stay in the original
2577 /* Ordinary automatic local variables are now in the scope of the
2579 DECL_CONTEXT (copy) = id->dst_fn;
2585 copy_decl_to_var (tree decl, copy_body_data *id)
2589 gcc_assert (TREE_CODE (decl) == PARM_DECL
2590 || TREE_CODE (decl) == RESULT_DECL);
2592 type = TREE_TYPE (decl);
2594 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
2595 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
2596 TREE_READONLY (copy) = TREE_READONLY (decl);
2597 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
2598 DECL_COMPLEX_GIMPLE_REG_P (copy) = DECL_COMPLEX_GIMPLE_REG_P (decl);
2600 return copy_decl_for_dup_finish (id, decl, copy);
2604 copy_decl_no_change (tree decl, copy_body_data *id)
2608 copy = copy_node (decl);
2610 /* The COPY is not abstract; it will be generated in DST_FN. */
2611 DECL_ABSTRACT (copy) = 0;
2612 lang_hooks.dup_lang_specific_decl (copy);
2614 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
2615 been taken; it's for internal bookkeeping in expand_goto_internal. */
2616 if (TREE_CODE (copy) == LABEL_DECL)
2618 TREE_ADDRESSABLE (copy) = 0;
2619 LABEL_DECL_UID (copy) = -1;
2622 return copy_decl_for_dup_finish (id, decl, copy);
2626 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
2628 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
2629 return copy_decl_to_var (decl, id);
2631 return copy_decl_no_change (decl, id);
2634 /* Return a copy of the function's argument tree. */
2636 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
2638 tree *arg_copy, *parg;
2640 arg_copy = &orig_parm;
2641 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
2643 tree new = remap_decl (*parg, id);
2644 lang_hooks.dup_lang_specific_decl (new);
2645 TREE_CHAIN (new) = TREE_CHAIN (*parg);
2651 /* Return a copy of the function's static chain. */
2653 copy_static_chain (tree static_chain, copy_body_data * id)
2655 tree *chain_copy, *pvar;
2657 chain_copy = &static_chain;
2658 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
2660 tree new = remap_decl (*pvar, id);
2661 lang_hooks.dup_lang_specific_decl (new);
2662 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
2665 return static_chain;
2668 /* Return true if the function is allowed to be versioned.
2669 This is a guard for the versioning functionality. */
2671 tree_versionable_function_p (tree fndecl)
2673 if (fndecl == NULL_TREE)
2675 /* ??? There are cases where a function is
2676 uninlinable but can be versioned. */
2677 if (!tree_inlinable_function_p (fndecl))
2683 /* Create a copy of a function's tree.
2684 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
2685 of the original function and the new copied function
2686 respectively. In case we want to replace a DECL
2687 tree with another tree while duplicating the function's
2688 body, TREE_MAP represents the mapping between these
2689 trees. If UPDATE_CLONES is set, the call_stmt fields
2690 of edges of clones of the function will be updated. */
2692 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
2695 struct cgraph_node *old_version_node;
2696 struct cgraph_node *new_version_node;
2700 struct ipa_replace_map *replace_info;
2701 basic_block old_entry_block;
2704 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
2705 && TREE_CODE (new_decl) == FUNCTION_DECL);
2706 DECL_POSSIBLY_INLINED (old_decl) = 1;
2708 old_version_node = cgraph_node (old_decl);
2709 new_version_node = cgraph_node (new_decl);
2711 allocate_struct_function (new_decl);
2712 /* Cfun points to the new allocated function struct at this point. */
2713 cfun->function_end_locus = DECL_SOURCE_LOCATION (new_decl);
2715 DECL_ARTIFICIAL (new_decl) = 1;
2716 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
2718 /* Generate a new name for the new version. */
2720 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
2721 /* Create a new SYMBOL_REF rtx for the new name. */
2722 if (DECL_RTL (old_decl) != NULL)
2724 SET_DECL_RTL (new_decl, copy_rtx (DECL_RTL (old_decl)));
2725 XEXP (DECL_RTL (new_decl), 0) =
2726 gen_rtx_SYMBOL_REF (GET_MODE (XEXP (DECL_RTL (old_decl), 0)),
2727 IDENTIFIER_POINTER (DECL_NAME (new_decl)));
2730 /* Prepare the data structures for the tree copy. */
2731 memset (&id, 0, sizeof (id));
2733 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2734 id.src_fn = old_decl;
2735 id.dst_fn = new_decl;
2736 id.src_node = old_version_node;
2737 id.dst_node = new_version_node;
2738 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
2740 id.copy_decl = copy_decl_no_change;
2741 id.transform_call_graph_edges
2742 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
2743 id.transform_new_cfg = true;
2744 id.transform_return_to_modify = false;
2745 id.transform_lang_insert_block = false;
2747 current_function_decl = new_decl;
2749 /* Copy the function's static chain. */
2750 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
2752 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
2753 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
2755 /* Copy the function's arguments. */
2756 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
2757 DECL_ARGUMENTS (new_decl) =
2758 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
2760 /* If there's a tree_map, prepare for substitution. */
2762 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
2764 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
2765 if (replace_info->replace_p)
2766 insert_decl_map (&id, replace_info->old_tree,
2767 replace_info->new_tree);
2770 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
2772 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2773 number_blocks (id.dst_fn);
2775 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
2776 /* Add local vars. */
2777 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
2778 t_step; t_step = TREE_CHAIN (t_step))
2780 tree var = TREE_VALUE (t_step);
2781 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2782 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2783 cfun->unexpanded_var_list);
2785 cfun->unexpanded_var_list =
2786 tree_cons (NULL_TREE, remap_decl (var, &id),
2787 cfun->unexpanded_var_list);
2790 /* Copy the Function's body. */
2791 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
2792 (DECL_STRUCT_FUNCTION (old_decl));
2793 new_fndecl = copy_body (&id,
2794 old_entry_block->count,
2795 old_entry_block->frequency, NULL, NULL);
2797 DECL_SAVED_TREE (new_decl) = DECL_SAVED_TREE (new_fndecl);
2799 DECL_STRUCT_FUNCTION (new_decl)->cfg =
2800 DECL_STRUCT_FUNCTION (new_fndecl)->cfg;
2801 DECL_STRUCT_FUNCTION (new_decl)->eh = DECL_STRUCT_FUNCTION (new_fndecl)->eh;
2802 DECL_STRUCT_FUNCTION (new_decl)->ib_boundaries_block =
2803 DECL_STRUCT_FUNCTION (new_fndecl)->ib_boundaries_block;
2804 DECL_STRUCT_FUNCTION (new_decl)->last_label_uid =
2805 DECL_STRUCT_FUNCTION (new_fndecl)->last_label_uid;
2807 if (DECL_RESULT (old_decl) != NULL_TREE)
2809 tree *res_decl = &DECL_RESULT (old_decl);
2810 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
2811 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
2814 current_function_decl = NULL;
2815 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2816 number_blocks (new_decl);
2819 splay_tree_delete (id.decl_map);
2820 fold_cond_expr_cond ();
2824 /* Duplicate a type, fields and all. */
2827 build_duplicate_type (tree type)
2829 struct copy_body_data id;
2831 memset (&id, 0, sizeof (id));
2832 id.src_fn = current_function_decl;
2833 id.dst_fn = current_function_decl;
2835 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2837 type = remap_type_1 (type, &id);
2839 splay_tree_delete (id.decl_map);