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 (result
)) == COMPLEX_TYPE
1226 && !DECL_COMPLEX_GIMPLE_REG_P (result
)
1227 && DECL_COMPLEX_GIMPLE_REG_P (base_m
))
1229 else if (!TREE_ADDRESSABLE (base_m
))
1241 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
1243 var
= copy_decl_to_var (result
, id
);
1245 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
1246 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
1247 = tree_cons (NULL_TREE
, var
,
1248 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
);
1250 /* Do not have the rest of GCC warn about this variable as it should
1251 not be visible to the user. */
1252 TREE_NO_WARNING (var
) = 1;
1254 /* Build the use expr. If the return type of the function was
1255 promoted, convert it back to the expected type. */
1257 if (!lang_hooks
.types_compatible_p (TREE_TYPE (var
), caller_type
))
1258 use
= fold_convert (caller_type
, var
);
1261 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1262 way, when the RESULT_DECL is encountered, it will be
1263 automatically replaced by the VAR_DECL. */
1264 insert_decl_map (id
, result
, var
);
1266 /* Remember this so we can ignore it in remap_decls. */
1273 /* Returns nonzero if a function can be inlined as a tree. */
1276 tree_inlinable_function_p (tree fn
)
1278 return inlinable_function_p (fn
);
1281 static const char *inline_forbidden_reason
;
1284 inline_forbidden_p_1 (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
1288 tree fn
= (tree
) fnp
;
1291 switch (TREE_CODE (node
))
1294 /* Refuse to inline alloca call unless user explicitly forced so as
1295 this may change program's memory overhead drastically when the
1296 function using alloca is called in loop. In GCC present in
1297 SPEC2000 inlining into schedule_block cause it to require 2GB of
1298 RAM instead of 256MB. */
1299 if (alloca_call_p (node
)
1300 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1302 inline_forbidden_reason
1303 = G_("function %q+F can never be inlined because it uses "
1304 "alloca (override using the always_inline attribute)");
1307 t
= get_callee_fndecl (node
);
1311 /* We cannot inline functions that call setjmp. */
1312 if (setjmp_call_p (t
))
1314 inline_forbidden_reason
1315 = G_("function %q+F can never be inlined because it uses setjmp");
1319 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
1320 switch (DECL_FUNCTION_CODE (t
))
1322 /* We cannot inline functions that take a variable number of
1324 case BUILT_IN_VA_START
:
1325 case BUILT_IN_STDARG_START
:
1326 case BUILT_IN_NEXT_ARG
:
1327 case BUILT_IN_VA_END
:
1328 inline_forbidden_reason
1329 = G_("function %q+F can never be inlined because it "
1330 "uses variable argument lists");
1333 case BUILT_IN_LONGJMP
:
1334 /* We can't inline functions that call __builtin_longjmp at
1335 all. The non-local goto machinery really requires the
1336 destination be in a different function. If we allow the
1337 function calling __builtin_longjmp to be inlined into the
1338 function calling __builtin_setjmp, Things will Go Awry. */
1339 inline_forbidden_reason
1340 = G_("function %q+F can never be inlined because "
1341 "it uses setjmp-longjmp exception handling");
1344 case BUILT_IN_NONLOCAL_GOTO
:
1346 inline_forbidden_reason
1347 = G_("function %q+F can never be inlined because "
1348 "it uses non-local goto");
1351 case BUILT_IN_RETURN
:
1352 case BUILT_IN_APPLY_ARGS
:
1353 /* If a __builtin_apply_args caller would be inlined,
1354 it would be saving arguments of the function it has
1355 been inlined into. Similarly __builtin_return would
1356 return from the function the inline has been inlined into. */
1357 inline_forbidden_reason
1358 = G_("function %q+F can never be inlined because "
1359 "it uses __builtin_return or __builtin_apply_args");
1368 t
= TREE_OPERAND (node
, 0);
1370 /* We will not inline a function which uses computed goto. The
1371 addresses of its local labels, which may be tucked into
1372 global storage, are of course not constant across
1373 instantiations, which causes unexpected behavior. */
1374 if (TREE_CODE (t
) != LABEL_DECL
)
1376 inline_forbidden_reason
1377 = G_("function %q+F can never be inlined "
1378 "because it contains a computed goto");
1384 t
= TREE_OPERAND (node
, 0);
1385 if (DECL_NONLOCAL (t
))
1387 /* We cannot inline a function that receives a non-local goto
1388 because we cannot remap the destination label used in the
1389 function that is performing the non-local goto. */
1390 inline_forbidden_reason
1391 = G_("function %q+F can never be inlined "
1392 "because it receives a non-local goto");
1399 /* We cannot inline a function of the form
1401 void F (int i) { struct S { int ar[i]; } s; }
1403 Attempting to do so produces a catch-22.
1404 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1405 UNION_TYPE nodes, then it goes into infinite recursion on a
1406 structure containing a pointer to its own type. If it doesn't,
1407 then the type node for S doesn't get adjusted properly when
1410 ??? This is likely no longer true, but it's too late in the 4.0
1411 cycle to try to find out. This should be checked for 4.1. */
1412 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
1413 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
1415 inline_forbidden_reason
1416 = G_("function %q+F can never be inlined "
1417 "because it uses variable sized variables");
1428 /* Return subexpression representing possible alloca call, if any. */
1430 inline_forbidden_p (tree fndecl
)
1432 location_t saved_loc
= input_location
;
1433 block_stmt_iterator bsi
;
1435 tree ret
= NULL_TREE
;
1437 FOR_EACH_BB_FN (bb
, DECL_STRUCT_FUNCTION (fndecl
))
1438 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
1440 ret
= walk_tree_without_duplicates (bsi_stmt_ptr (bsi
),
1441 inline_forbidden_p_1
, fndecl
);
1447 input_location
= saved_loc
;
1451 /* Returns nonzero if FN is a function that does not have any
1452 fundamental inline blocking properties. */
1455 inlinable_function_p (tree fn
)
1457 bool inlinable
= true;
1459 /* If we've already decided this function shouldn't be inlined,
1460 there's no need to check again. */
1461 if (DECL_UNINLINABLE (fn
))
1464 /* See if there is any language-specific reason it cannot be
1465 inlined. (It is important that this hook be called early because
1466 in C++ it may result in template instantiation.)
1467 If the function is not inlinable for language-specific reasons,
1468 it is left up to the langhook to explain why. */
1469 inlinable
= !lang_hooks
.tree_inlining
.cannot_inline_tree_fn (&fn
);
1471 /* If we don't have the function body available, we can't inline it.
1472 However, this should not be recorded since we also get here for
1473 forward declared inline functions. Therefore, return at once. */
1474 if (!DECL_SAVED_TREE (fn
))
1477 /* If we're not inlining at all, then we cannot inline this function. */
1478 else if (!flag_inline_trees
)
1481 /* Only try to inline functions if DECL_INLINE is set. This should be
1482 true for all functions declared `inline', and for all other functions
1483 as well with -finline-functions.
1485 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1486 it's the front-end that must set DECL_INLINE in this case, because
1487 dwarf2out loses if a function that does not have DECL_INLINE set is
1488 inlined anyway. That is why we have both DECL_INLINE and
1489 DECL_DECLARED_INLINE_P. */
1490 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1491 here should be redundant. */
1492 else if (!DECL_INLINE (fn
) && !flag_unit_at_a_time
)
1495 else if (inline_forbidden_p (fn
))
1497 /* See if we should warn about uninlinable functions. Previously,
1498 some of these warnings would be issued while trying to expand
1499 the function inline, but that would cause multiple warnings
1500 about functions that would for example call alloca. But since
1501 this a property of the function, just one warning is enough.
1502 As a bonus we can now give more details about the reason why a
1503 function is not inlinable.
1504 We only warn for functions declared `inline' by the user. */
1505 bool do_warning
= (warn_inline
1507 && DECL_DECLARED_INLINE_P (fn
)
1508 && !DECL_IN_SYSTEM_HEADER (fn
));
1510 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1511 sorry (inline_forbidden_reason
, fn
);
1512 else if (do_warning
)
1513 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
1518 /* Squirrel away the result so that we don't have to check again. */
1519 DECL_UNINLINABLE (fn
) = !inlinable
;
1524 /* Estimate the cost of a memory move. Use machine dependent
1525 word size and take possible memcpy call into account. */
1528 estimate_move_cost (tree type
)
1532 size
= int_size_in_bytes (type
);
1534 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO
)
1535 /* Cost of a memcpy call, 3 arguments and the call. */
1538 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
1541 /* Used by estimate_num_insns. Estimate number of instructions seen
1542 by given statement. */
1545 estimate_num_insns_1 (tree
*tp
, int *walk_subtrees
, void *data
)
1547 int *count
= (int *) data
;
1550 if (IS_TYPE_OR_DECL_P (x
))
1555 /* Assume that constants and references counts nothing. These should
1556 be majorized by amount of operations among them we count later
1557 and are common target of CSE and similar optimizations. */
1558 else if (CONSTANT_CLASS_P (x
) || REFERENCE_CLASS_P (x
))
1561 switch (TREE_CODE (x
))
1563 /* Containers have no cost. */
1570 case ALIGN_INDIRECT_REF
:
1571 case MISALIGNED_INDIRECT_REF
:
1573 case ARRAY_RANGE_REF
:
1575 case EXC_PTR_EXPR
: /* ??? */
1576 case FILTER_EXPR
: /* ??? */
1579 case WITH_CLEANUP_EXPR
:
1581 case VIEW_CONVERT_EXPR
:
1586 case CASE_LABEL_EXPR
:
1589 case EH_FILTER_EXPR
:
1590 case STATEMENT_LIST
:
1592 case NON_LVALUE_EXPR
:
1595 case TRY_CATCH_EXPR
:
1596 case TRY_FINALLY_EXPR
:
1603 case WITH_SIZE_EXPR
:
1605 case OMP_RETURN_EXPR
:
1608 /* We don't account constants for now. Assume that the cost is amortized
1609 by operations that do use them. We may re-consider this decision once
1610 we are able to optimize the tree before estimating its size and break
1611 out static initializers. */
1612 case IDENTIFIER_NODE
:
1621 /* Try to estimate the cost of assignments. We have three cases to
1623 1) Simple assignments to registers;
1624 2) Stores to things that must live in memory. This includes
1625 "normal" stores to scalars, but also assignments of large
1626 structures, or constructors of big arrays;
1629 Let us look at the first two cases, assuming we have "a = b + C":
1630 <modify_expr <var_decl "a"> <plus_expr <var_decl "b"> <constant C>>
1631 If "a" is a GIMPLE register, the assignment to it is free on almost
1632 any target, because "a" usually ends up in a real register. Hence
1633 the only cost of this expression comes from the PLUS_EXPR, and we
1634 can ignore the MODIFY_EXPR.
1635 If "a" is not a GIMPLE register, the assignment to "a" will most
1636 likely be a real store, so the cost of the MODIFY_EXPR is the cost
1637 of moving something into "a", which we compute using the function
1640 The third case deals with TARGET_EXPRs, for which the semantics are
1641 that a temporary is assigned, unless the TARGET_EXPR itself is being
1642 assigned to something else. In the latter case we do not need the
1643 temporary. E.g. in <modify_expr <var_decl "a"> <target_expr>>, the
1644 MODIFY_EXPR is free. */
1647 /* Is the right and side a TARGET_EXPR? */
1648 if (TREE_CODE (TREE_OPERAND (x
, 1)) == TARGET_EXPR
)
1650 /* ... fall through ... */
1653 x
= TREE_OPERAND (x
, 0);
1654 /* Is this an assignments to a register? */
1655 if (is_gimple_reg (x
))
1657 /* Otherwise it's a store, so fall through to compute the move cost. */
1660 *count
+= estimate_move_cost (TREE_TYPE (x
));
1663 /* Assign cost of 1 to usual operations.
1664 ??? We may consider mapping RTL costs to this. */
1672 case FIX_TRUNC_EXPR
:
1674 case FIX_FLOOR_EXPR
:
1675 case FIX_ROUND_EXPR
:
1687 case VEC_LSHIFT_EXPR
:
1688 case VEC_RSHIFT_EXPR
:
1695 case TRUTH_ANDIF_EXPR
:
1696 case TRUTH_ORIF_EXPR
:
1697 case TRUTH_AND_EXPR
:
1699 case TRUTH_XOR_EXPR
:
1700 case TRUTH_NOT_EXPR
:
1709 case UNORDERED_EXPR
:
1722 case PREDECREMENT_EXPR
:
1723 case PREINCREMENT_EXPR
:
1724 case POSTDECREMENT_EXPR
:
1725 case POSTINCREMENT_EXPR
:
1731 case REALIGN_LOAD_EXPR
:
1733 case REDUC_MAX_EXPR
:
1734 case REDUC_MIN_EXPR
:
1735 case REDUC_PLUS_EXPR
:
1736 case WIDEN_SUM_EXPR
:
1739 case WIDEN_MULT_EXPR
:
1745 /* Few special cases of expensive operations. This is useful
1746 to avoid inlining on functions having too many of these. */
1747 case TRUNC_DIV_EXPR
:
1749 case FLOOR_DIV_EXPR
:
1750 case ROUND_DIV_EXPR
:
1751 case EXACT_DIV_EXPR
:
1752 case TRUNC_MOD_EXPR
:
1754 case FLOOR_MOD_EXPR
:
1755 case ROUND_MOD_EXPR
:
1761 tree decl
= get_callee_fndecl (x
);
1764 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
1765 switch (DECL_FUNCTION_CODE (decl
))
1767 case BUILT_IN_CONSTANT_P
:
1770 case BUILT_IN_EXPECT
:
1776 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
1777 that does use function declaration to figure out the arguments. */
1780 for (arg
= TREE_OPERAND (x
, 1); arg
; arg
= TREE_CHAIN (arg
))
1781 *count
+= estimate_move_cost (TREE_TYPE (TREE_VALUE (arg
)));
1785 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
1786 *count
+= estimate_move_cost (TREE_TYPE (arg
));
1789 *count
+= PARAM_VALUE (PARAM_INLINE_CALL_COST
);
1802 /* OpenMP directives are generally very expensive. */
1812 /* Estimate number of instructions that will be created by expanding EXPR. */
1815 estimate_num_insns (tree expr
)
1818 struct pointer_set_t
*visited_nodes
;
1820 block_stmt_iterator bsi
;
1821 struct function
*my_function
;
1823 /* If we're given an entire function, walk the CFG. */
1824 if (TREE_CODE (expr
) == FUNCTION_DECL
)
1826 my_function
= DECL_STRUCT_FUNCTION (expr
);
1827 gcc_assert (my_function
&& my_function
->cfg
);
1828 visited_nodes
= pointer_set_create ();
1829 FOR_EACH_BB_FN (bb
, my_function
)
1831 for (bsi
= bsi_start (bb
);
1835 walk_tree (bsi_stmt_ptr (bsi
), estimate_num_insns_1
,
1836 &num
, visited_nodes
);
1839 pointer_set_destroy (visited_nodes
);
1842 walk_tree_without_duplicates (&expr
, estimate_num_insns_1
, &num
);
1847 typedef struct function
*function_p
;
1849 DEF_VEC_P(function_p
);
1850 DEF_VEC_ALLOC_P(function_p
,heap
);
1852 /* Initialized with NOGC, making this poisonous to the garbage collector. */
1853 static VEC(function_p
,heap
) *cfun_stack
;
1856 push_cfun (struct function
*new_cfun
)
1858 VEC_safe_push (function_p
, heap
, cfun_stack
, cfun
);
1865 cfun
= VEC_pop (function_p
, cfun_stack
);
1868 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
1870 add_lexical_block (tree current_block
, tree new_block
)
1874 /* Walk to the last sub-block. */
1875 for (blk_p
= &BLOCK_SUBBLOCKS (current_block
);
1877 blk_p
= &TREE_CHAIN (*blk_p
))
1880 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
1883 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1886 expand_call_inline (basic_block bb
, tree stmt
, tree
*tp
, void *data
)
1894 tree return_slot_addr
;
1896 location_t saved_location
;
1897 struct cgraph_edge
*cg_edge
;
1899 basic_block return_block
;
1901 block_stmt_iterator bsi
, stmt_bsi
;
1902 bool successfully_inlined
= FALSE
;
1907 /* See what we've got. */
1908 id
= (copy_body_data
*) data
;
1911 /* Set input_location here so we get the right instantiation context
1912 if we call instantiate_decl from inlinable_function_p. */
1913 saved_location
= input_location
;
1914 if (EXPR_HAS_LOCATION (t
))
1915 input_location
= EXPR_LOCATION (t
);
1917 /* From here on, we're only interested in CALL_EXPRs. */
1918 if (TREE_CODE (t
) != CALL_EXPR
)
1921 /* First, see if we can figure out what function is being called.
1922 If we cannot, then there is no hope of inlining the function. */
1923 fn
= get_callee_fndecl (t
);
1927 /* Turn forward declarations into real ones. */
1928 fn
= cgraph_node (fn
)->decl
;
1930 /* If fn is a declaration of a function in a nested scope that was
1931 globally declared inline, we don't set its DECL_INITIAL.
1932 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1933 C++ front-end uses it for cdtors to refer to their internal
1934 declarations, that are not real functions. Fortunately those
1935 don't have trees to be saved, so we can tell by checking their
1937 if (! DECL_INITIAL (fn
)
1938 && DECL_ABSTRACT_ORIGIN (fn
)
1939 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn
)))
1940 fn
= DECL_ABSTRACT_ORIGIN (fn
);
1942 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1943 Kill this check once this is fixed. */
1944 if (!id
->dst_node
->analyzed
)
1947 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
1949 /* Constant propagation on argument done during previous inlining
1950 may create new direct call. Produce an edge for it. */
1953 struct cgraph_node
*dest
= cgraph_node (fn
);
1955 /* We have missing edge in the callgraph. This can happen in one case
1956 where previous inlining turned indirect call into direct call by
1957 constant propagating arguments. In all other cases we hit a bug
1958 (incorrect node sharing is most common reason for missing edges. */
1959 gcc_assert (dest
->needed
|| !flag_unit_at_a_time
);
1960 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1961 bb
->count
, bb
->loop_depth
)->inline_failed
1962 = N_("originally indirect function call not considered for inlining");
1966 /* Don't try to inline functions that are not well-suited to
1968 if (!cgraph_inline_p (cg_edge
, &reason
))
1970 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
1971 /* Avoid warnings during early inline pass. */
1972 && (!flag_unit_at_a_time
|| cgraph_global_info_ready
))
1974 sorry ("inlining failed in call to %q+F: %s", fn
, reason
);
1975 sorry ("called from here");
1977 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
1978 && !DECL_IN_SYSTEM_HEADER (fn
)
1980 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
1981 /* Avoid warnings during early inline pass. */
1982 && (!flag_unit_at_a_time
|| cgraph_global_info_ready
))
1984 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
1986 warning (OPT_Winline
, "called from here");
1990 fn
= cg_edge
->callee
->decl
;
1992 #ifdef ENABLE_CHECKING
1993 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
1994 verify_cgraph_node (cg_edge
->callee
);
1997 /* We will be inlining this callee. */
1999 id
->eh_region
= lookup_stmt_eh_region (stmt
);
2001 /* Split the block holding the CALL_EXPR. */
2003 e
= split_block (bb
, stmt
);
2005 return_block
= e
->dest
;
2008 /* split_block splits before the statement, work around this by moving
2009 the call into the first half_bb. Not pretty, but seems easier than
2010 doing the CFG manipulation by hand when the CALL_EXPR is in the last
2012 stmt_bsi
= bsi_last (bb
);
2013 bsi
= bsi_start (return_block
);
2014 if (!bsi_end_p (bsi
))
2015 bsi_move_before (&stmt_bsi
, &bsi
);
2018 tree stmt
= bsi_stmt (stmt_bsi
);
2019 bsi_remove (&stmt_bsi
, false);
2020 bsi_insert_after (&bsi
, stmt
, BSI_NEW_STMT
);
2022 stmt_bsi
= bsi_start (return_block
);
2024 /* Build a block containing code to initialize the arguments, the
2025 actual inline expansion of the body, and a label for the return
2026 statements within the function to jump to. The type of the
2027 statement expression is the return type of the function call. */
2028 id
->block
= make_node (BLOCK
);
2029 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
2030 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
2031 add_lexical_block (TREE_BLOCK (stmt
), id
->block
);
2033 /* Local declarations will be replaced by their equivalents in this
2036 id
->decl_map
= splay_tree_new (splay_tree_compare_pointers
,
2039 /* Initialize the parameters. */
2040 args
= TREE_OPERAND (t
, 1);
2042 /* Record the function we are about to inline. */
2044 id
->src_node
= cg_edge
->callee
;
2046 initialize_inlined_parameters (id
, args
, TREE_OPERAND (t
, 2), fn
, bb
);
2048 if (DECL_INITIAL (fn
))
2049 add_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
2051 /* Return statements in the function body will be replaced by jumps
2052 to the RET_LABEL. */
2054 gcc_assert (DECL_INITIAL (fn
));
2055 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
2057 /* Find the lhs to which the result of this call is assigned. */
2058 return_slot_addr
= NULL
;
2059 if (TREE_CODE (stmt
) == MODIFY_EXPR
)
2061 modify_dest
= TREE_OPERAND (stmt
, 0);
2063 /* The function which we are inlining might not return a value,
2064 in which case we should issue a warning that the function
2065 does not return a value. In that case the optimizers will
2066 see that the variable to which the value is assigned was not
2067 initialized. We do not want to issue a warning about that
2068 uninitialized variable. */
2069 if (DECL_P (modify_dest
))
2070 TREE_NO_WARNING (modify_dest
) = 1;
2071 if (CALL_EXPR_RETURN_SLOT_OPT (t
))
2073 return_slot_addr
= build_fold_addr_expr (modify_dest
);
2080 /* Declare the return variable for the function. */
2081 decl
= declare_return_variable (id
, return_slot_addr
,
2082 modify_dest
, &use_retvar
);
2083 /* Do this only if declare_return_variable created a new one. */
2084 if (decl
&& !return_slot_addr
&& decl
!= modify_dest
)
2085 declare_inline_vars (id
->block
, decl
);
2087 /* This is it. Duplicate the callee body. Assume callee is
2088 pre-gimplified. Note that we must not alter the caller
2089 function in any way before this point, as this CALL_EXPR may be
2090 a self-referential call; if we're calling ourselves, we need to
2091 duplicate our body before altering anything. */
2092 copy_body (id
, bb
->count
, bb
->frequency
, bb
, return_block
);
2094 /* Add local vars in this inlined callee to caller. */
2095 t_step
= id
->src_cfun
->unexpanded_var_list
;
2096 for (; t_step
; t_step
= TREE_CHAIN (t_step
))
2098 var
= TREE_VALUE (t_step
);
2099 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
2100 cfun
->unexpanded_var_list
= tree_cons (NULL_TREE
, var
,
2101 cfun
->unexpanded_var_list
);
2103 cfun
->unexpanded_var_list
= tree_cons (NULL_TREE
, remap_decl (var
, id
),
2104 cfun
->unexpanded_var_list
);
2108 splay_tree_delete (id
->decl_map
);
2111 /* If the inlined function returns a result that we care about,
2112 clobber the CALL_EXPR with a reference to the return variable. */
2113 if (use_retvar
&& (TREE_CODE (bsi_stmt (stmt_bsi
)) != CALL_EXPR
))
2116 maybe_clean_or_replace_eh_stmt (stmt
, stmt
);
2119 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2120 tsi_delink() will leave the iterator in a sane state. */
2121 bsi_remove (&stmt_bsi
, true);
2124 if (bsi_end_p (bsi
))
2125 tree_purge_dead_eh_edges (return_block
);
2127 /* If the value of the new expression is ignored, that's OK. We
2128 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2129 the equivalent inlined version either. */
2130 TREE_USED (*tp
) = 1;
2132 /* Output the inlining info for this abstract function, since it has been
2133 inlined. If we don't do this now, we can lose the information about the
2134 variables in the function when the blocks get blown away as soon as we
2135 remove the cgraph node. */
2136 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
2138 /* Update callgraph if needed. */
2139 cgraph_remove_node (cg_edge
->callee
);
2141 /* Declare the 'auto' variables added with this inlined body. */
2142 record_vars (BLOCK_VARS (id
->block
));
2143 id
->block
= NULL_TREE
;
2144 successfully_inlined
= TRUE
;
2147 input_location
= saved_location
;
2148 return successfully_inlined
;
2151 /* Expand call statements reachable from STMT_P.
2152 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2153 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
2154 unfortunately not use that function here because we need a pointer
2155 to the CALL_EXPR, not the tree itself. */
2158 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
2160 block_stmt_iterator bsi
;
2162 /* Register specific tree functions. */
2163 tree_register_cfg_hooks ();
2164 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
2166 tree
*expr_p
= bsi_stmt_ptr (bsi
);
2167 tree stmt
= *expr_p
;
2169 if (TREE_CODE (*expr_p
) == MODIFY_EXPR
)
2170 expr_p
= &TREE_OPERAND (*expr_p
, 1);
2171 if (TREE_CODE (*expr_p
) == WITH_SIZE_EXPR
)
2172 expr_p
= &TREE_OPERAND (*expr_p
, 0);
2173 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2174 if (expand_call_inline (bb
, stmt
, expr_p
, id
))
2180 /* Expand calls to inline functions in the body of FN. */
2183 optimize_inline_calls (tree fn
)
2188 /* There is no point in performing inlining if errors have already
2189 occurred -- and we might crash if we try to inline invalid
2191 if (errorcount
|| sorrycount
)
2195 memset (&id
, 0, sizeof (id
));
2197 id
.src_node
= id
.dst_node
= cgraph_node (fn
);
2199 /* Or any functions that aren't finished yet. */
2200 prev_fn
= NULL_TREE
;
2201 if (current_function_decl
)
2203 id
.dst_fn
= current_function_decl
;
2204 prev_fn
= current_function_decl
;
2207 id
.copy_decl
= copy_decl_maybe_to_var
;
2208 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
2209 id
.transform_new_cfg
= false;
2210 id
.transform_return_to_modify
= true;
2211 id
.transform_lang_insert_block
= false;
2213 push_gimplify_context ();
2215 /* Reach the trees by walking over the CFG, and note the
2216 enclosing basic-blocks in the call edges. */
2217 /* We walk the blocks going forward, because inlined function bodies
2218 will split id->current_basic_block, and the new blocks will
2219 follow it; we'll trudge through them, processing their CALL_EXPRs
2222 gimple_expand_calls_inline (bb
, &id
);
2224 pop_gimplify_context (NULL
);
2225 /* Renumber the (code) basic_blocks consecutively. */
2227 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2230 #ifdef ENABLE_CHECKING
2232 struct cgraph_edge
*e
;
2234 verify_cgraph_node (id
.dst_node
);
2236 /* Double check that we inlined everything we are supposed to inline. */
2237 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
2238 gcc_assert (e
->inline_failed
);
2241 /* We need to rescale frequencies again to peak at REG_BR_PROB_BASE
2242 as inlining loops might increase the maximum. */
2243 if (ENTRY_BLOCK_PTR
->count
)
2245 fold_cond_expr_cond ();
2248 /* FN is a function that has a complete body, and CLONE is a function whose
2249 body is to be set to a copy of FN, mapping argument declarations according
2250 to the ARG_MAP splay_tree. */
2253 clone_body (tree clone
, tree fn
, void *arg_map
)
2257 /* Clone the body, as if we were making an inline call. But, remap the
2258 parameters in the callee to the parameters of caller. */
2259 memset (&id
, 0, sizeof (id
));
2262 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
2263 id
.decl_map
= (splay_tree
)arg_map
;
2265 id
.copy_decl
= copy_decl_no_change
;
2266 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
2267 id
.transform_new_cfg
= true;
2268 id
.transform_return_to_modify
= false;
2269 id
.transform_lang_insert_block
= true;
2271 /* We're not inside any EH region. */
2274 /* Actually copy the body. */
2275 append_to_statement_list_force (copy_generic_body (&id
), &DECL_SAVED_TREE (clone
));
2278 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2281 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2283 enum tree_code code
= TREE_CODE (*tp
);
2285 /* We make copies of most nodes. */
2286 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
2287 || code
== TREE_LIST
2289 || code
== TYPE_DECL
2290 || code
== OMP_CLAUSE
)
2292 /* Because the chain gets clobbered when we make a copy, we save it
2294 tree chain
= TREE_CHAIN (*tp
);
2297 /* Copy the node. */
2298 new = copy_node (*tp
);
2300 /* Propagate mudflap marked-ness. */
2301 if (flag_mudflap
&& mf_marked_p (*tp
))
2306 /* Now, restore the chain, if appropriate. That will cause
2307 walk_tree to walk into the chain as well. */
2308 if (code
== PARM_DECL
2309 || code
== TREE_LIST
2310 || code
== OMP_CLAUSE
)
2311 TREE_CHAIN (*tp
) = chain
;
2313 /* For now, we don't update BLOCKs when we make copies. So, we
2314 have to nullify all BIND_EXPRs. */
2315 if (TREE_CODE (*tp
) == BIND_EXPR
)
2316 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
2318 else if (code
== CONSTRUCTOR
)
2320 /* CONSTRUCTOR nodes need special handling because
2321 we need to duplicate the vector of elements. */
2324 new = copy_node (*tp
);
2326 /* Propagate mudflap marked-ness. */
2327 if (flag_mudflap
&& mf_marked_p (*tp
))
2330 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt
, gc
,
2331 CONSTRUCTOR_ELTS (*tp
));
2334 else if (TREE_CODE_CLASS (code
) == tcc_type
)
2336 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
2338 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
2341 gcc_assert (code
!= STATEMENT_LIST
);
2345 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2346 information indicating to what new SAVE_EXPR this one should be mapped,
2347 use that one. Otherwise, create a new node and enter it in ST. FN is
2348 the function into which the copy will be placed. */
2351 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
2353 splay_tree st
= (splay_tree
) st_
;
2357 /* See if we already encountered this SAVE_EXPR. */
2358 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2360 /* If we didn't already remap this SAVE_EXPR, do so now. */
2363 t
= copy_node (*tp
);
2365 /* Remember this SAVE_EXPR. */
2366 splay_tree_insert (st
, (splay_tree_key
) *tp
, (splay_tree_value
) t
);
2367 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2368 splay_tree_insert (st
, (splay_tree_key
) t
, (splay_tree_value
) t
);
2372 /* We've already walked into this SAVE_EXPR; don't do it again. */
2374 t
= (tree
) n
->value
;
2377 /* Replace this SAVE_EXPR with the copy. */
2381 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2382 copies the declaration and enters it in the splay_tree in DATA (which is
2383 really an `copy_body_data *'). */
2386 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2389 copy_body_data
*id
= (copy_body_data
*) data
;
2391 /* Don't walk into types. */
2395 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
2397 tree decl
= TREE_OPERAND (*tp
, 0);
2399 /* Copy the decl and remember the copy. */
2400 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
2406 /* Perform any modifications to EXPR required when it is unsaved. Does
2407 not recurse into EXPR's subtrees. */
2410 unsave_expr_1 (tree expr
)
2412 switch (TREE_CODE (expr
))
2415 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2416 It's OK for this to happen if it was part of a subtree that
2417 isn't immediately expanded, such as operand 2 of another
2419 if (TREE_OPERAND (expr
, 1))
2422 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2423 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2431 /* Called via walk_tree when an expression is unsaved. Using the
2432 splay_tree pointed to by ST (which is really a `splay_tree'),
2433 remaps all local declarations to appropriate replacements. */
2436 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
2438 copy_body_data
*id
= (copy_body_data
*) data
;
2439 splay_tree st
= id
->decl_map
;
2442 /* Only a local declaration (variable or label). */
2443 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
2444 || TREE_CODE (*tp
) == LABEL_DECL
)
2446 /* Lookup the declaration. */
2447 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2449 /* If it's there, remap it. */
2451 *tp
= (tree
) n
->value
;
2454 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
2455 copy_statement_list (tp
);
2456 else if (TREE_CODE (*tp
) == BIND_EXPR
)
2457 copy_bind_expr (tp
, walk_subtrees
, id
);
2458 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2459 remap_save_expr (tp
, st
, walk_subtrees
);
2462 copy_tree_r (tp
, walk_subtrees
, NULL
);
2464 /* Do whatever unsaving is required. */
2465 unsave_expr_1 (*tp
);
2468 /* Keep iterating. */
2472 /* Copies everything in EXPR and replaces variables, labels
2473 and SAVE_EXPRs local to EXPR. */
2476 unsave_expr_now (tree expr
)
2480 /* There's nothing to do for NULL_TREE. */
2485 memset (&id
, 0, sizeof (id
));
2486 id
.src_fn
= current_function_decl
;
2487 id
.dst_fn
= current_function_decl
;
2488 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2490 id
.copy_decl
= copy_decl_no_change
;
2491 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
2492 id
.transform_new_cfg
= false;
2493 id
.transform_return_to_modify
= false;
2494 id
.transform_lang_insert_block
= false;
2496 /* Walk the tree once to find local labels. */
2497 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
2499 /* Walk the tree again, copying, remapping, and unsaving. */
2500 walk_tree (&expr
, unsave_r
, &id
, NULL
);
2503 splay_tree_delete (id
.decl_map
);
2508 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2511 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
2520 debug_find_tree (tree top
, tree search
)
2522 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
2526 /* Declare the variables created by the inliner. Add all the variables in
2527 VARS to BIND_EXPR. */
2530 declare_inline_vars (tree block
, tree vars
)
2533 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
2534 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
2537 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
2541 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
2542 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
2543 VAR_DECL translation. */
2546 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
2548 /* Don't generate debug information for the copy if we wouldn't have
2549 generated it for the copy either. */
2550 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
2551 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
2553 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
2554 declaration inspired this copy. */
2555 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
2557 /* The new variable/label has no RTL, yet. */
2558 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
2559 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
2560 SET_DECL_RTL (copy
, NULL_RTX
);
2562 /* These args would always appear unused, if not for this. */
2563 TREE_USED (copy
) = 1;
2565 /* Set the context for the new declaration. */
2566 if (!DECL_CONTEXT (decl
))
2567 /* Globals stay global. */
2569 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
2570 /* Things that weren't in the scope of the function we're inlining
2571 from aren't in the scope we're inlining to, either. */
2573 else if (TREE_STATIC (decl
))
2574 /* Function-scoped static variables should stay in the original
2578 /* Ordinary automatic local variables are now in the scope of the
2580 DECL_CONTEXT (copy
) = id
->dst_fn
;
2586 copy_decl_to_var (tree decl
, copy_body_data
*id
)
2590 gcc_assert (TREE_CODE (decl
) == PARM_DECL
2591 || TREE_CODE (decl
) == RESULT_DECL
);
2593 type
= TREE_TYPE (decl
);
2595 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), type
);
2596 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
2597 TREE_READONLY (copy
) = TREE_READONLY (decl
);
2598 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
2599 DECL_COMPLEX_GIMPLE_REG_P (copy
) = DECL_COMPLEX_GIMPLE_REG_P (decl
);
2601 return copy_decl_for_dup_finish (id
, decl
, copy
);
2605 copy_decl_no_change (tree decl
, copy_body_data
*id
)
2609 copy
= copy_node (decl
);
2611 /* The COPY is not abstract; it will be generated in DST_FN. */
2612 DECL_ABSTRACT (copy
) = 0;
2613 lang_hooks
.dup_lang_specific_decl (copy
);
2615 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
2616 been taken; it's for internal bookkeeping in expand_goto_internal. */
2617 if (TREE_CODE (copy
) == LABEL_DECL
)
2619 TREE_ADDRESSABLE (copy
) = 0;
2620 LABEL_DECL_UID (copy
) = -1;
2623 return copy_decl_for_dup_finish (id
, decl
, copy
);
2627 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
2629 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
2630 return copy_decl_to_var (decl
, id
);
2632 return copy_decl_no_change (decl
, id
);
2635 /* Return a copy of the function's argument tree. */
2637 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
)
2639 tree
*arg_copy
, *parg
;
2641 arg_copy
= &orig_parm
;
2642 for (parg
= arg_copy
; *parg
; parg
= &TREE_CHAIN (*parg
))
2644 tree
new = remap_decl (*parg
, id
);
2645 lang_hooks
.dup_lang_specific_decl (new);
2646 TREE_CHAIN (new) = TREE_CHAIN (*parg
);
2652 /* Return a copy of the function's static chain. */
2654 copy_static_chain (tree static_chain
, copy_body_data
* id
)
2656 tree
*chain_copy
, *pvar
;
2658 chain_copy
= &static_chain
;
2659 for (pvar
= chain_copy
; *pvar
; pvar
= &TREE_CHAIN (*pvar
))
2661 tree
new = remap_decl (*pvar
, id
);
2662 lang_hooks
.dup_lang_specific_decl (new);
2663 TREE_CHAIN (new) = TREE_CHAIN (*pvar
);
2666 return static_chain
;
2669 /* Return true if the function is allowed to be versioned.
2670 This is a guard for the versioning functionality. */
2672 tree_versionable_function_p (tree fndecl
)
2674 if (fndecl
== NULL_TREE
)
2676 /* ??? There are cases where a function is
2677 uninlinable but can be versioned. */
2678 if (!tree_inlinable_function_p (fndecl
))
2684 /* Create a copy of a function's tree.
2685 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
2686 of the original function and the new copied function
2687 respectively. In case we want to replace a DECL
2688 tree with another tree while duplicating the function's
2689 body, TREE_MAP represents the mapping between these
2690 trees. If UPDATE_CLONES is set, the call_stmt fields
2691 of edges of clones of the function will be updated. */
2693 tree_function_versioning (tree old_decl
, tree new_decl
, varray_type tree_map
,
2696 struct cgraph_node
*old_version_node
;
2697 struct cgraph_node
*new_version_node
;
2701 struct ipa_replace_map
*replace_info
;
2702 basic_block old_entry_block
;
2705 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
2706 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
2707 DECL_POSSIBLY_INLINED (old_decl
) = 1;
2709 old_version_node
= cgraph_node (old_decl
);
2710 new_version_node
= cgraph_node (new_decl
);
2712 allocate_struct_function (new_decl
);
2713 /* Cfun points to the new allocated function struct at this point. */
2714 cfun
->function_end_locus
= DECL_SOURCE_LOCATION (new_decl
);
2716 DECL_ARTIFICIAL (new_decl
) = 1;
2717 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
2719 /* Generate a new name for the new version. */
2721 DECL_NAME (new_decl
) = create_tmp_var_name (NULL
);
2722 /* Create a new SYMBOL_REF rtx for the new name. */
2723 if (DECL_RTL (old_decl
) != NULL
)
2725 SET_DECL_RTL (new_decl
, copy_rtx (DECL_RTL (old_decl
)));
2726 XEXP (DECL_RTL (new_decl
), 0) =
2727 gen_rtx_SYMBOL_REF (GET_MODE (XEXP (DECL_RTL (old_decl
), 0)),
2728 IDENTIFIER_POINTER (DECL_NAME (new_decl
)));
2731 /* Prepare the data structures for the tree copy. */
2732 memset (&id
, 0, sizeof (id
));
2734 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2735 id
.src_fn
= old_decl
;
2736 id
.dst_fn
= new_decl
;
2737 id
.src_node
= old_version_node
;
2738 id
.dst_node
= new_version_node
;
2739 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
2741 id
.copy_decl
= copy_decl_no_change
;
2742 id
.transform_call_graph_edges
2743 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
2744 id
.transform_new_cfg
= true;
2745 id
.transform_return_to_modify
= false;
2746 id
.transform_lang_insert_block
= false;
2748 current_function_decl
= new_decl
;
2750 /* Copy the function's static chain. */
2751 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
2753 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
2754 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
2756 /* Copy the function's arguments. */
2757 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
2758 DECL_ARGUMENTS (new_decl
) =
2759 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
);
2761 /* If there's a tree_map, prepare for substitution. */
2763 for (i
= 0; i
< VARRAY_ACTIVE_SIZE (tree_map
); i
++)
2765 replace_info
= VARRAY_GENERIC_PTR (tree_map
, i
);
2766 if (replace_info
->replace_p
)
2767 insert_decl_map (&id
, replace_info
->old_tree
,
2768 replace_info
->new_tree
);
2771 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
2773 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2774 number_blocks (id
.dst_fn
);
2776 if (DECL_STRUCT_FUNCTION (old_decl
)->unexpanded_var_list
!= NULL_TREE
)
2777 /* Add local vars. */
2778 for (t_step
= DECL_STRUCT_FUNCTION (old_decl
)->unexpanded_var_list
;
2779 t_step
; t_step
= TREE_CHAIN (t_step
))
2781 tree var
= TREE_VALUE (t_step
);
2782 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
2783 cfun
->unexpanded_var_list
= tree_cons (NULL_TREE
, var
,
2784 cfun
->unexpanded_var_list
);
2786 cfun
->unexpanded_var_list
=
2787 tree_cons (NULL_TREE
, remap_decl (var
, &id
),
2788 cfun
->unexpanded_var_list
);
2791 /* Copy the Function's body. */
2792 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
2793 (DECL_STRUCT_FUNCTION (old_decl
));
2794 new_fndecl
= copy_body (&id
,
2795 old_entry_block
->count
,
2796 old_entry_block
->frequency
, NULL
, NULL
);
2798 DECL_SAVED_TREE (new_decl
) = DECL_SAVED_TREE (new_fndecl
);
2800 DECL_STRUCT_FUNCTION (new_decl
)->cfg
=
2801 DECL_STRUCT_FUNCTION (new_fndecl
)->cfg
;
2802 DECL_STRUCT_FUNCTION (new_decl
)->eh
= DECL_STRUCT_FUNCTION (new_fndecl
)->eh
;
2803 DECL_STRUCT_FUNCTION (new_decl
)->ib_boundaries_block
=
2804 DECL_STRUCT_FUNCTION (new_fndecl
)->ib_boundaries_block
;
2805 DECL_STRUCT_FUNCTION (new_decl
)->last_label_uid
=
2806 DECL_STRUCT_FUNCTION (new_fndecl
)->last_label_uid
;
2808 if (DECL_RESULT (old_decl
) != NULL_TREE
)
2810 tree
*res_decl
= &DECL_RESULT (old_decl
);
2811 DECL_RESULT (new_decl
) = remap_decl (*res_decl
, &id
);
2812 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
2815 current_function_decl
= NULL
;
2816 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2817 number_blocks (new_decl
);
2820 splay_tree_delete (id
.decl_map
);
2821 fold_cond_expr_cond ();
2825 /* Duplicate a type, fields and all. */
2828 build_duplicate_type (tree type
)
2830 struct copy_body_data id
;
2832 memset (&id
, 0, sizeof (id
));
2833 id
.src_fn
= current_function_decl
;
2834 id
.dst_fn
= current_function_decl
;
2836 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2838 type
= remap_type_1 (type
, &id
);
2840 splay_tree_delete (id
.decl_map
);