2 Copyright 2001, 2002, 2003, 2004, 2005 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, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include "coretypes.h"
28 #include "tree-inline.h"
34 #include "insn-config.h"
37 #include "splay-tree.h"
38 #include "langhooks.h"
39 #include "basic-block.h"
40 #include "tree-iterator.h"
43 #include "tree-mudflap.h"
44 #include "tree-flow.h"
47 #include "tree-flow.h"
48 #include "diagnostic.h"
51 #include "pointer-set.h"
52 #include "integrate.h"
54 /* I'm not real happy about this, but we need to handle gimple and
56 #include "tree-gimple.h"
58 /* Inlining, Saving, Cloning
60 Inlining: a function body is duplicated, but the PARM_DECLs are
61 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
62 MODIFY_EXPRs that store to a dedicated returned-value variable.
63 The duplicated eh_region info of the copy will later be appended
64 to the info for the caller; the eh_region info in copied throwing
65 statements and RESX_EXPRs is adjusted accordingly.
67 Saving: make a semantically-identical copy of the function body.
68 Necessary when we want to generate code for the body (a destructive
69 operation), but we expect to need this body in the future (e.g. for
70 inlining into another function).
72 Cloning: (only in C++) We have one body for a con/de/structor, and
73 multiple function decls, each with a unique parameter list.
74 Duplicate the body, using the given splay tree; some parameters
75 will become constants (like 0 or 1).
77 All of these will simultaneously lookup any callgraph edges. If
78 we're going to inline the duplicated function body, and the given
79 function has some cloned callgraph nodes (one for each place this
80 function will be inlined) those callgraph edges will be duplicated.
81 If we're saving or cloning the body, those callgraph edges will be
82 updated to point into the new body. (Note that the original
83 callgraph node and edge list will not be altered.)
85 See the CALL_EXPR handling case in copy_body_r (). */
87 /* 0 if we should not perform inlining.
88 1 if we should expand functions calls inline at the tree level.
89 2 if we should consider *all* functions to be inline
92 int flag_inline_trees
= 0;
96 o In order to make inlining-on-trees work, we pessimized
97 function-local static constants. In particular, they are now
98 always output, even when not addressed. Fix this by treating
99 function-local static constants just like global static
100 constants; the back-end already knows not to output them if they
103 o Provide heuristics to clamp inlining of recursive template
106 /* Data required for function inlining. */
108 typedef struct inline_data
110 /* FUNCTION_DECL for function being inlined. */
112 /* FUNCTION_DECL for function being inlined into. */
114 /* struct function for function being inlined. Usually this is the same
115 as DECL_STRUCT_FUNCTION (callee), but can be different if saved_cfg
116 and saved_eh are in use. */
117 struct function
*callee_cfun
;
118 /* The VAR_DECL for the return value. */
120 /* The map from local declarations in the inlined function to
121 equivalents in the function into which it is being inlined. */
123 /* We use the same mechanism to build clones that we do to perform
124 inlining. However, there are a few places where we need to
125 distinguish between those two situations. This flag is true if
126 we are cloning, rather than inlining. */
128 /* Similarly for saving function body. */
130 /* Callgraph node of function we are inlining into. */
131 struct cgraph_node
*node
;
132 /* Callgraph node of currently inlined function. */
133 struct cgraph_node
*current_node
;
136 /* Exception region the inlined call lie in. */
138 /* Take region number in the function being copied, add this value and
139 get eh region number of the duplicate in the function we inline into. */
140 int eh_region_offset
;
145 static tree
declare_return_variable (inline_data
*, tree
, tree
, tree
*);
146 static tree
copy_body_r (tree
*, int *, void *);
147 static tree
copy_generic_body (inline_data
*);
148 static bool inlinable_function_p (tree
);
149 static tree
remap_decl (tree
, inline_data
*);
150 static tree
remap_type (tree
, inline_data
*);
151 static void remap_block (tree
*, inline_data
*);
152 static tree
remap_decl (tree
, inline_data
*);
153 static tree
remap_decls (tree
, inline_data
*);
154 static void copy_bind_expr (tree
*, int *, inline_data
*);
155 static tree
mark_local_for_remap_r (tree
*, int *, void *);
156 static void unsave_expr_1 (tree
);
157 static tree
unsave_r (tree
*, int *, void *);
158 static void declare_inline_vars (tree
, tree
);
159 static void remap_save_expr (tree
*, void *, int *);
161 static inline bool inlining_p (inline_data
*id
);
163 /* Insert a tree->tree mapping for ID. Despite the name suggests
164 that the trees should be variables, it is used for more than that. */
167 insert_decl_map (inline_data
*id
, tree key
, tree value
)
169 splay_tree_insert (id
->decl_map
, (splay_tree_key
) key
,
170 (splay_tree_value
) value
);
172 /* Always insert an identity map as well. If we see this same new
173 node again, we won't want to duplicate it a second time. */
175 splay_tree_insert (id
->decl_map
, (splay_tree_key
) value
,
176 (splay_tree_value
) value
);
179 /* Remap DECL during the copying of the BLOCK tree for the function. */
182 remap_decl (tree decl
, inline_data
*id
)
187 /* We only remap local variables in the current function. */
190 /* See if we have remapped this declaration. */
192 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
194 /* If we didn't already have an equivalent for this declaration,
198 /* Make a copy of the variable or label. */
200 t
= copy_decl_for_inlining (decl
, fn
, id
->caller
);
202 /* Remember it, so that if we encounter this local entity again
203 we can reuse this copy. Do this early because remap_type may
204 need this decl for TYPE_STUB_DECL. */
205 insert_decl_map (id
, decl
, t
);
207 /* Remap types, if necessary. */
208 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
209 if (TREE_CODE (t
) == TYPE_DECL
)
210 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
211 else if (TREE_CODE (t
) == PARM_DECL
)
212 DECL_ARG_TYPE_AS_WRITTEN (t
)
213 = remap_type (DECL_ARG_TYPE_AS_WRITTEN (t
), id
);
215 /* Remap sizes as necessary. */
216 walk_tree (&DECL_SIZE (t
), copy_body_r
, id
, NULL
);
217 walk_tree (&DECL_SIZE_UNIT (t
), copy_body_r
, id
, NULL
);
219 /* If fields, do likewise for offset and qualifier. */
220 if (TREE_CODE (t
) == FIELD_DECL
)
222 walk_tree (&DECL_FIELD_OFFSET (t
), copy_body_r
, id
, NULL
);
223 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
224 walk_tree (&DECL_QUALIFIER (t
), copy_body_r
, id
, NULL
);
228 /* FIXME handle anon aggrs. */
229 if (! DECL_NAME (t
) && TREE_TYPE (t
)
230 && lang_hooks
.tree_inlining
.anon_aggr_type_p (TREE_TYPE (t
)))
232 /* For a VAR_DECL of anonymous type, we must also copy the
233 member VAR_DECLS here and rechain the DECL_ANON_UNION_ELEMS. */
237 for (src
= DECL_ANON_UNION_ELEMS (t
); src
;
238 src
= TREE_CHAIN (src
))
240 tree member
= remap_decl (TREE_VALUE (src
), id
);
242 gcc_assert (!TREE_PURPOSE (src
));
243 members
= tree_cons (NULL
, member
, members
);
245 DECL_ANON_UNION_ELEMS (t
) = nreverse (members
);
249 /* If we are inlining and this is a variable (not a label), declare the
250 remapped variable in the callers' body. */
252 && (TREE_CODE (t
) == VAR_DECL
253 || TREE_CODE (t
) == PARM_DECL
))
254 declare_inline_vars (id
->block
, t
);
256 /* Remember it, so that if we encounter this local entity
257 again we can reuse this copy. */
258 insert_decl_map (id
, decl
, t
);
262 return unshare_expr ((tree
) n
->value
);
266 remap_type (tree type
, inline_data
*id
)
268 splay_tree_node node
;
274 /* See if we have remapped this type. */
275 node
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) type
);
277 return (tree
) node
->value
;
279 /* The type only needs remapping if it's variably modified. */
280 if (! variably_modified_type_p (type
, id
->callee
))
282 insert_decl_map (id
, type
, type
);
286 /* We do need a copy. build and register it now. If this is a pointer or
287 reference type, remap the designated type and make a new pointer or
289 if (TREE_CODE (type
) == POINTER_TYPE
)
291 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
293 TYPE_REF_CAN_ALIAS_ALL (type
));
294 insert_decl_map (id
, type
, new);
297 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
299 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
301 TYPE_REF_CAN_ALIAS_ALL (type
));
302 insert_decl_map (id
, type
, new);
306 new = copy_node (type
);
308 insert_decl_map (id
, type
, new);
310 /* This is a new type, not a copy of an old type. Need to reassociate
311 variants. We can handle everything except the main variant lazily. */
312 t
= TYPE_MAIN_VARIANT (type
);
315 t
= remap_type (t
, id
);
316 TYPE_MAIN_VARIANT (new) = t
;
317 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t
);
318 TYPE_NEXT_VARIANT (t
) = new;
322 TYPE_MAIN_VARIANT (new) = new;
323 TYPE_NEXT_VARIANT (new) = NULL
;
326 if (TYPE_STUB_DECL (type
))
327 TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type
), id
);
329 /* Lazily create pointer and reference types. */
330 TYPE_POINTER_TO (new) = NULL
;
331 TYPE_REFERENCE_TO (new) = NULL
;
333 switch (TREE_CODE (new))
340 t
= TYPE_MIN_VALUE (new);
341 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
342 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r
, id
, NULL
);
344 t
= TYPE_MAX_VALUE (new);
345 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
346 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r
, id
, NULL
);
350 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
351 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r
, id
, NULL
);
355 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
356 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id
);
361 case QUAL_UNION_TYPE
:
362 walk_tree (&TYPE_FIELDS (new), copy_body_r
, id
, NULL
);
367 /* Shouldn't have been thought variable sized. */
371 walk_tree (&TYPE_SIZE (new), copy_body_r
, id
, NULL
);
372 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r
, id
, NULL
);
378 remap_decls (tree decls
, inline_data
*id
)
381 tree new_decls
= NULL_TREE
;
383 /* Remap its variables. */
384 for (old_var
= decls
; old_var
; old_var
= TREE_CHAIN (old_var
))
388 /* We can not chain the local static declarations into the unexpanded_var_list
389 as we can't duplicate them or break one decl rule. Go ahead and link
390 them into unexpanded_var_list. */
391 if (!lang_hooks
.tree_inlining
.auto_var_in_fn_p (old_var
, id
->callee
)
392 && !DECL_EXTERNAL (old_var
))
394 cfun
->unexpanded_var_list
= tree_cons (NULL_TREE
, old_var
,
395 cfun
->unexpanded_var_list
);
399 /* Remap the variable. */
400 new_var
= remap_decl (old_var
, id
);
402 /* If we didn't remap this variable, so we can't mess with its
403 TREE_CHAIN. If we remapped this variable to the return slot, it's
404 already declared somewhere else, so don't declare it here. */
405 if (!new_var
|| new_var
== id
->retvar
)
409 gcc_assert (DECL_P (new_var
));
410 TREE_CHAIN (new_var
) = new_decls
;
415 return nreverse (new_decls
);
418 /* Copy the BLOCK to contain remapped versions of the variables
419 therein. And hook the new block into the block-tree. */
422 remap_block (tree
*block
, inline_data
*id
)
428 /* Make the new block. */
430 new_block
= make_node (BLOCK
);
431 TREE_USED (new_block
) = TREE_USED (old_block
);
432 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
435 /* Remap its variables. */
436 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
), id
);
440 /* FIXME! It shouldn't be so hard to manage blocks. Rebuilding them in
441 rest_of_compilation is a good start. */
443 /* We're building a clone; DECL_INITIAL is still
444 error_mark_node, and current_binding_level is the parm
446 lang_hooks
.decls
.insert_block (new_block
);
449 /* Attach this new block after the DECL_INITIAL block for the
450 function into which this block is being inlined. In
451 rest_of_compilation we will straighten out the BLOCK tree. */
453 if (DECL_INITIAL (fn
))
454 first_block
= &BLOCK_CHAIN (DECL_INITIAL (fn
));
456 first_block
= &DECL_INITIAL (fn
);
457 BLOCK_CHAIN (new_block
) = *first_block
;
458 *first_block
= new_block
;
461 /* Remember the remapped block. */
462 insert_decl_map (id
, old_block
, new_block
);
466 copy_statement_list (tree
*tp
)
468 tree_stmt_iterator oi
, ni
;
471 new = alloc_stmt_list ();
472 ni
= tsi_start (new);
473 oi
= tsi_start (*tp
);
476 for (; !tsi_end_p (oi
); tsi_next (&oi
))
477 tsi_link_after (&ni
, tsi_stmt (oi
), TSI_NEW_STMT
);
481 copy_bind_expr (tree
*tp
, int *walk_subtrees
, inline_data
*id
)
483 tree block
= BIND_EXPR_BLOCK (*tp
);
484 /* Copy (and replace) the statement. */
485 copy_tree_r (tp
, walk_subtrees
, NULL
);
488 remap_block (&block
, id
);
489 BIND_EXPR_BLOCK (*tp
) = block
;
492 if (BIND_EXPR_VARS (*tp
))
493 /* This will remap a lot of the same decls again, but this should be
495 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), id
);
498 /* Called from copy_body_id via walk_tree. DATA is really an
502 copy_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
504 inline_data
*id
= (inline_data
*) data
;
505 tree fn
= id
->callee
;
507 /* Begin by recognizing trees that we'll completely rewrite for the
508 inlining context. Our output for these trees is completely
509 different from out input (e.g. RETURN_EXPR is deleted, and morphs
510 into an edge). Further down, we'll handle trees that get
511 duplicated and/or tweaked. */
513 /* If this is a RETURN_STMT, change it into an EXPR_STMT and a
514 GOTO_STMT with the RET_LABEL as its target. */
515 if (TREE_CODE (*tp
) == RETURN_EXPR
&& inlining_p (id
))
517 tree assignment
= TREE_OPERAND (*tp
, 0);
519 /* If we're returning something, just turn that into an
520 assignment into the equivalent of the original RESULT_DECL.
521 If the "assignment" is just the result decl, the result
522 decl has already been set (e.g. a recent "foo (&result_decl,
523 ...)"); just toss the entire RETURN_EXPR. */
524 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
526 /* Replace the RETURN_EXPR with (a copy of) the
527 MODIFY_EXPR hanging underneath. */
528 *tp
= copy_node (assignment
);
530 else /* Else the RETURN_EXPR returns no value. */
537 /* Local variables and labels need to be replaced by equivalent
538 variables. We don't want to copy static variables; there's only
539 one of those, no matter how many times we inline the containing
540 function. Similarly for globals from an outer function. */
541 else if (lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
545 /* Remap the declaration. */
546 new_decl
= remap_decl (*tp
, id
);
547 gcc_assert (new_decl
);
548 /* Replace this variable with the copy. */
549 STRIP_TYPE_NOPS (new_decl
);
553 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
554 copy_statement_list (tp
);
555 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
556 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
557 else if (TREE_CODE (*tp
) == LABEL_DECL
)
558 /* These may need to be remapped for EH handling. */
559 remap_decl (*tp
, id
);
560 else if (TREE_CODE (*tp
) == BIND_EXPR
)
561 copy_bind_expr (tp
, walk_subtrees
, id
);
562 /* Types may need remapping as well. */
563 else if (TYPE_P (*tp
))
564 *tp
= remap_type (*tp
, id
);
566 /* If this is a constant, we have to copy the node iff the type will be
567 remapped. copy_tree_r will not copy a constant. */
568 else if (CONSTANT_CLASS_P (*tp
))
570 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
572 if (new_type
== TREE_TYPE (*tp
))
575 else if (TREE_CODE (*tp
) == INTEGER_CST
)
576 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
577 TREE_INT_CST_HIGH (*tp
));
580 *tp
= copy_node (*tp
);
581 TREE_TYPE (*tp
) = new_type
;
585 /* Otherwise, just copy the node. Note that copy_tree_r already
586 knows not to copy VAR_DECLs, etc., so this is safe. */
589 /* Here we handle trees that are not completely rewritten.
590 First we detect some inlining-induced bogosities for
592 if (TREE_CODE (*tp
) == MODIFY_EXPR
593 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
594 && (lang_hooks
.tree_inlining
.auto_var_in_fn_p
595 (TREE_OPERAND (*tp
, 0), fn
)))
597 /* Some assignments VAR = VAR; don't generate any rtl code
598 and thus don't count as variable modification. Avoid
599 keeping bogosities like 0 = 0. */
600 tree decl
= TREE_OPERAND (*tp
, 0), value
;
603 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
606 value
= (tree
) n
->value
;
607 STRIP_TYPE_NOPS (value
);
608 if (TREE_CONSTANT (value
) || TREE_READONLY_DECL_P (value
))
610 *tp
= build_empty_stmt ();
611 return copy_body_r (tp
, walk_subtrees
, data
);
615 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
617 /* Get rid of *& from inline substitutions that can happen when a
618 pointer argument is an ADDR_EXPR. */
619 tree decl
= TREE_OPERAND (*tp
, 0);
622 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
625 /* If we happen to get an ADDR_EXPR in n->value, strip
626 it manually here as we'll eventually get ADDR_EXPRs
627 which lie about their types pointed to. In this case
628 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
629 but we absolutely rely on that. As fold_indirect_ref
630 does other useful transformations, try that first, though. */
631 tree type
= TREE_TYPE (TREE_TYPE ((tree
)n
->value
));
632 *tp
= fold_indirect_ref_1 (type
, (tree
)n
->value
);
635 if (TREE_CODE ((tree
)n
->value
) == ADDR_EXPR
)
636 *tp
= TREE_OPERAND ((tree
)n
->value
, 0);
638 *tp
= build1 (INDIRECT_REF
, type
, (tree
)n
->value
);
645 /* Here is the "usual case". Copy this tree node, and then
646 tweak some special cases. */
647 copy_tree_r (tp
, walk_subtrees
, NULL
);
649 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (*tp
))))
650 TREE_BLOCK (*tp
) = id
->block
;
652 if (TREE_CODE (*tp
) == RESX_EXPR
&& id
->eh_region_offset
)
653 TREE_OPERAND (*tp
, 0) =
656 id
->eh_region_offset
+ TREE_INT_CST_LOW (TREE_OPERAND (*tp
, 0)));
658 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
660 /* The copied TARGET_EXPR has never been expanded, even if the
661 original node was expanded already. */
662 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
664 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
665 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
668 /* Variable substitution need not be simple. In particular, the
669 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
670 and friends are up-to-date. */
671 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
673 walk_tree (&TREE_OPERAND (*tp
, 0), copy_body_r
, id
, NULL
);
674 recompute_tree_invarant_for_addr_expr (*tp
);
679 /* Keep iterating. */
683 /* Copy basic block, scale profile accordingly. Edges will be taken care of
687 copy_bb (inline_data
*id
, basic_block bb
, int frequency_scale
, int count_scale
)
689 block_stmt_iterator bsi
, copy_bsi
;
690 basic_block copy_basic_block
;
692 /* create_basic_block() will append every new block to
693 basic_block_info automatically. */
694 copy_basic_block
= create_basic_block (NULL
, (void *) 0, bb
->prev_bb
->aux
);
695 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
696 copy_basic_block
->frequency
= (bb
->frequency
697 * frequency_scale
/ REG_BR_PROB_BASE
);
698 copy_bsi
= bsi_start (copy_basic_block
);
700 for (bsi
= bsi_start (bb
);
701 !bsi_end_p (bsi
); bsi_next (&bsi
))
703 tree stmt
= bsi_stmt (bsi
);
704 tree orig_stmt
= stmt
;
706 walk_tree (&stmt
, copy_body_r
, id
, NULL
);
708 /* RETURN_EXPR might be removed,
709 this is signalled by making stmt pointer NULL. */
713 bsi_insert_after (©_bsi
, stmt
, BSI_NEW_STMT
);
714 call
= get_call_expr_in (stmt
);
715 /* We're duplicating a CALL_EXPR. Find any corresponding
716 callgraph edges and update or duplicate them. */
717 if (call
&& (decl
= get_callee_fndecl (call
)))
721 struct cgraph_node
*node
;
722 struct cgraph_edge
*edge
;
724 /* We're saving a copy of the body, so we'll update the
725 callgraph nodes in place. Note that we avoid
726 altering the original callgraph node; we begin with
728 for (node
= id
->node
->next_clone
;
730 node
= node
->next_clone
)
732 edge
= cgraph_edge (node
, orig_stmt
);
734 edge
->call_stmt
= stmt
;
739 struct cgraph_edge
*edge
;
741 /* We're cloning or inlining this body; duplicate the
742 associate callgraph nodes. */
743 edge
= cgraph_edge (id
->current_node
, orig_stmt
);
745 cgraph_clone_edge (edge
, id
->node
, stmt
,
746 REG_BR_PROB_BASE
, 1);
749 /* If you think we can abort here, you are wrong.
750 There is no region 0 in tree land. */
751 gcc_assert (lookup_stmt_eh_region_fn (id
->callee_cfun
, orig_stmt
)
754 if (tree_could_throw_p (stmt
))
756 int region
= lookup_stmt_eh_region_fn (id
->callee_cfun
, orig_stmt
);
757 /* Add an entry for the copied tree in the EH hashtable.
758 When saving or cloning or versioning, use the hashtable in
759 cfun, and just copy the EH number. When inlining, use the
760 hashtable in the caller, and adjust the region number. */
762 add_stmt_to_eh_region (stmt
, region
+ id
->eh_region_offset
);
764 /* If this tree doesn't have a region associated with it,
765 and there is a "current region,"
766 then associate this tree with the current region
767 and add edges associated with this region. */
768 if ((lookup_stmt_eh_region_fn (id
->callee_cfun
,
770 && id
->eh_region
> 0)
771 && tree_could_throw_p (stmt
))
772 add_stmt_to_eh_region (stmt
, id
->eh_region
);
776 return copy_basic_block
;
779 /* Copy edges from BB into its copy constructed earlier, scale profile
780 accordingly. Edges will be taken care of later. Assume aux
781 pointers to point to the copies of each BB. */
783 copy_edges_for_bb (basic_block bb
, int count_scale
)
785 basic_block new_bb
= bb
->aux
;
788 block_stmt_iterator bsi
;
791 /* Use the indices from the original blocks to create edges for the
793 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
794 if (!(old_edge
->flags
& EDGE_EH
))
798 flags
= old_edge
->flags
;
800 /* Return edges do get a FALLTHRU flag when the get inlined. */
801 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
802 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
803 flags
|= EDGE_FALLTHRU
;
804 new = make_edge (new_bb
, old_edge
->dest
->aux
, flags
);
805 new->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
806 new->probability
= old_edge
->probability
;
809 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
812 for (bsi
= bsi_start (new_bb
); !bsi_end_p (bsi
);)
816 copy_stmt
= bsi_stmt (bsi
);
817 update_stmt (copy_stmt
);
818 /* Do this before the possible split_block. */
821 /* If this tree could throw an exception, there are two
822 cases where we need to add abnormal edge(s): the
823 tree wasn't in a region and there is a "current
824 region" in the caller; or the original tree had
825 EH edges. In both cases split the block after the tree,
826 and add abnormal edge(s) as needed; we need both
827 those from the callee and the caller.
828 We check whether the copy can throw, because the const
829 propagation can change an INDIRECT_REF which throws
830 into a COMPONENT_REF which doesn't. If the copy
831 can throw, the original could also throw. */
833 if (tree_can_throw_internal (copy_stmt
))
835 if (!bsi_end_p (bsi
))
836 /* Note that bb's predecessor edges aren't necessarily
837 right at this point; split_block doesn't care. */
839 edge e
= split_block (new_bb
, copy_stmt
);
841 bsi
= bsi_start (new_bb
);
844 make_eh_edges (copy_stmt
);
849 /* Wrapper for remap_decl so it can be used as a callback. */
851 remap_decl_1 (tree decl
, void *data
)
853 return remap_decl (decl
, data
);
856 /* Make a copy of the body of FN so that it can be inserted inline in
857 another function. Walks FN via CFG, returns new fndecl. */
860 copy_cfg_body (inline_data
* id
, gcov_type count
, int frequency
,
861 basic_block entry_block_map
, basic_block exit_block_map
)
863 tree callee_fndecl
= id
->callee
;
864 /* Original cfun for the callee, doesn't change. */
865 struct function
*callee_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
866 /* Copy, built by this function. */
867 struct function
*new_cfun
;
868 /* Place to copy from; when a copy of the function was saved off earlier,
869 use that instead of the main copy. */
870 struct function
*cfun_to_copy
=
871 (struct function
*) ggc_alloc_cleared (sizeof (struct function
));
873 tree new_fndecl
= NULL
;
874 bool saving_or_cloning
;
875 int count_scale
, frequency_scale
;
877 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->count
)
878 count_scale
= (REG_BR_PROB_BASE
* count
879 / ENTRY_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->count
);
883 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->frequency
)
884 frequency_scale
= (REG_BR_PROB_BASE
* frequency
886 ENTRY_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->frequency
);
888 frequency_scale
= count_scale
;
890 /* Register specific tree functions. */
891 tree_register_cfg_hooks ();
893 /* Must have a CFG here at this point. */
894 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
895 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
897 *cfun_to_copy
= *DECL_STRUCT_FUNCTION (callee_fndecl
);
899 /* If there is a saved_cfg+saved_args lurking in the
900 struct function, a copy of the callee body was saved there, and
901 the 'struct cgraph edge' nodes have been fudged to point into the
902 saved body. Accordingly, we want to copy that saved body so the
903 callgraph edges will be recognized and cloned properly. */
904 if (cfun_to_copy
->saved_cfg
)
906 cfun_to_copy
->cfg
= cfun_to_copy
->saved_cfg
;
907 cfun_to_copy
->eh
= cfun_to_copy
->saved_eh
;
909 id
->callee_cfun
= cfun_to_copy
;
911 /* If saving or cloning a function body, create new basic_block_info
912 and label_to_block_maps. Otherwise, we're duplicating a function
913 body for inlining; insert our new blocks and labels into the
915 saving_or_cloning
= (id
->saving_p
|| id
->cloning_p
);
916 if (saving_or_cloning
)
919 (struct function
*) ggc_alloc_cleared (sizeof (struct function
));
920 *new_cfun
= *DECL_STRUCT_FUNCTION (callee_fndecl
);
921 new_cfun
->cfg
= NULL
;
922 new_cfun
->decl
= new_fndecl
= copy_node (callee_fndecl
);
923 new_cfun
->ib_boundaries_block
= (varray_type
) 0;
924 DECL_STRUCT_FUNCTION (new_fndecl
) = new_cfun
;
925 push_cfun (new_cfun
);
926 init_empty_tree_cfg ();
928 ENTRY_BLOCK_PTR
->count
=
929 (ENTRY_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->count
* count_scale
/
931 ENTRY_BLOCK_PTR
->frequency
=
932 (ENTRY_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->frequency
*
933 frequency_scale
/ REG_BR_PROB_BASE
);
934 EXIT_BLOCK_PTR
->count
=
935 (EXIT_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->count
* count_scale
/
937 EXIT_BLOCK_PTR
->frequency
=
938 (EXIT_BLOCK_PTR_FOR_FUNCTION (callee_cfun
)->frequency
*
939 frequency_scale
/ REG_BR_PROB_BASE
);
941 entry_block_map
= ENTRY_BLOCK_PTR
;
942 exit_block_map
= EXIT_BLOCK_PTR
;
945 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
946 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
949 /* Duplicate any exception-handling regions. */
952 if (saving_or_cloning
)
953 init_eh_for_function ();
954 id
->eh_region_offset
= duplicate_eh_regions (cfun_to_copy
,
957 gcc_assert (inlining_p (id
) || !id
->eh_region_offset
);
959 /* Use aux pointers to map the original blocks to copy. */
960 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
961 bb
->aux
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
962 /* Now that we've duplicated the blocks, duplicate their edges. */
963 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
964 copy_edges_for_bb (bb
, count_scale
);
965 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
968 if (saving_or_cloning
)
974 /* Make a copy of the body of FN so that it can be inserted inline in
978 copy_generic_body (inline_data
*id
)
981 tree fndecl
= id
->callee
;
983 body
= DECL_SAVED_TREE (fndecl
);
984 walk_tree (&body
, copy_body_r
, id
, NULL
);
990 copy_body (inline_data
*id
, gcov_type count
, int frequency
,
991 basic_block entry_block_map
, basic_block exit_block_map
)
993 tree fndecl
= id
->callee
;
996 /* If this body has a CFG, walk CFG and copy. */
997 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
998 body
= copy_cfg_body (id
, count
, frequency
, entry_block_map
, exit_block_map
);
1003 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1004 defined in function FN, or of a data member thereof. */
1007 self_inlining_addr_expr (tree value
, tree fn
)
1011 if (TREE_CODE (value
) != ADDR_EXPR
)
1014 var
= get_base_address (TREE_OPERAND (value
, 0));
1016 return var
&& lang_hooks
.tree_inlining
.auto_var_in_fn_p (var
, fn
);
1020 setup_one_parameter (inline_data
*id
, tree p
, tree value
, tree fn
,
1021 basic_block bb
, tree
*vars
)
1027 /* If the parameter is never assigned to, we may not need to
1028 create a new variable here at all. Instead, we may be able
1029 to just use the argument value. */
1030 if (TREE_READONLY (p
)
1031 && !TREE_ADDRESSABLE (p
)
1032 && value
&& !TREE_SIDE_EFFECTS (value
))
1034 /* We may produce non-gimple trees by adding NOPs or introduce
1035 invalid sharing when operand is not really constant.
1036 It is not big deal to prohibit constant propagation here as
1037 we will constant propagate in DOM1 pass anyway. */
1038 if (is_gimple_min_invariant (value
)
1039 && lang_hooks
.types_compatible_p (TREE_TYPE (value
), TREE_TYPE (p
))
1040 /* We have to be very careful about ADDR_EXPR. Make sure
1041 the base variable isn't a local variable of the inlined
1042 function, e.g., when doing recursive inlining, direct or
1043 mutually-recursive or whatever, which is why we don't
1044 just test whether fn == current_function_decl. */
1045 && ! self_inlining_addr_expr (value
, fn
))
1047 insert_decl_map (id
, p
, value
);
1052 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1053 here since the type of this decl must be visible to the calling
1055 var
= copy_decl_for_inlining (p
, fn
, id
->caller
);
1057 /* See if the frontend wants to pass this by invisible reference. If
1058 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1059 replace uses of the PARM_DECL with dereferences. */
1060 if (TREE_TYPE (var
) != TREE_TYPE (p
)
1061 && POINTER_TYPE_P (TREE_TYPE (var
))
1062 && TREE_TYPE (TREE_TYPE (var
)) == TREE_TYPE (p
))
1064 insert_decl_map (id
, var
, var
);
1065 var_sub
= build_fold_indirect_ref (var
);
1070 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1071 that way, when the PARM_DECL is encountered, it will be
1072 automatically replaced by the VAR_DECL. */
1073 insert_decl_map (id
, p
, var_sub
);
1075 /* Declare this new variable. */
1076 TREE_CHAIN (var
) = *vars
;
1079 /* Make gimplifier happy about this variable. */
1080 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
1082 /* Even if P was TREE_READONLY, the new VAR should not be.
1083 In the original code, we would have constructed a
1084 temporary, and then the function body would have never
1085 changed the value of P. However, now, we will be
1086 constructing VAR directly. The constructor body may
1087 change its value multiple times as it is being
1088 constructed. Therefore, it must not be TREE_READONLY;
1089 the back-end assumes that TREE_READONLY variable is
1090 assigned to only once. */
1091 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
1092 TREE_READONLY (var
) = 0;
1094 /* Initialize this VAR_DECL from the equivalent argument. Convert
1095 the argument to the proper type in case it was promoted. */
1098 tree rhs
= fold_convert (TREE_TYPE (var
), value
);
1099 block_stmt_iterator bsi
= bsi_last (bb
);
1101 if (rhs
== error_mark_node
)
1104 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
1105 keep our trees in gimple form. */
1106 init_stmt
= build (MODIFY_EXPR
, TREE_TYPE (var
), var
, rhs
);
1108 /* If we did not create a gimple value and we did not create a gimple
1109 cast of a gimple value, then we will need to gimplify INIT_STMTS
1110 at the end. Note that is_gimple_cast only checks the outer
1111 tree code, not its operand. Thus the explicit check that its
1112 operand is a gimple value. */
1113 if (!is_gimple_val (rhs
)
1114 && (!is_gimple_cast (rhs
)
1115 || !is_gimple_val (TREE_OPERAND (rhs
, 0))))
1116 gimplify_stmt (&init_stmt
);
1117 bsi_insert_after (&bsi
, init_stmt
, BSI_NEW_STMT
);
1121 /* Generate code to initialize the parameters of the function at the
1122 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
1125 initialize_inlined_parameters (inline_data
*id
, tree args
, tree static_chain
,
1126 tree fn
, basic_block bb
)
1131 tree vars
= NULL_TREE
;
1134 /* Figure out what the parameters are. */
1135 parms
= DECL_ARGUMENTS (fn
);
1136 if (fn
== current_function_decl
)
1137 parms
= cfun
->saved_args
;
1139 /* Loop through the parameter declarations, replacing each with an
1140 equivalent VAR_DECL, appropriately initialized. */
1141 for (p
= parms
, a
= args
; p
;
1142 a
= a
? TREE_CHAIN (a
) : a
, p
= TREE_CHAIN (p
))
1148 /* Find the initializer. */
1149 value
= lang_hooks
.tree_inlining
.convert_parm_for_inlining
1150 (p
, a
? TREE_VALUE (a
) : NULL_TREE
, fn
, argnum
);
1152 setup_one_parameter (id
, p
, value
, fn
, bb
, &vars
);
1155 /* Initialize the static chain. */
1156 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
1157 if (fn
== current_function_decl
)
1158 p
= DECL_STRUCT_FUNCTION (fn
)->saved_static_chain_decl
;
1161 /* No static chain? Seems like a bug in tree-nested.c. */
1162 gcc_assert (static_chain
);
1164 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
1167 declare_inline_vars (id
->block
, vars
);
1170 /* Declare a return variable to replace the RESULT_DECL for the
1171 function we are calling. An appropriate DECL_STMT is returned.
1172 The USE_STMT is filled to contain a use of the declaration to
1173 indicate the return value of the function.
1175 RETURN_SLOT_ADDR, if non-null, was a fake parameter that
1176 took the address of the result. MODIFY_DEST, if non-null, was the LHS of
1177 the MODIFY_EXPR to which this call is the RHS.
1179 The return value is a (possibly null) value that is the result of the
1180 function as seen by the callee. *USE_P is a (possibly null) value that
1181 holds the result as seen by the caller. */
1184 declare_return_variable (inline_data
*id
, tree return_slot_addr
,
1185 tree modify_dest
, tree
*use_p
)
1187 tree callee
= id
->callee
;
1188 tree caller
= id
->caller
;
1189 tree result
= DECL_RESULT (callee
);
1190 tree callee_type
= TREE_TYPE (result
);
1191 tree caller_type
= TREE_TYPE (TREE_TYPE (callee
));
1194 /* We don't need to do anything for functions that don't return
1196 if (!result
|| VOID_TYPE_P (callee_type
))
1202 /* If there was a return slot, then the return value is the
1203 dereferenced address of that object. */
1204 if (return_slot_addr
)
1206 /* The front end shouldn't have used both return_slot_addr and
1207 a modify expression. */
1208 gcc_assert (!modify_dest
);
1209 if (DECL_BY_REFERENCE (result
))
1210 var
= return_slot_addr
;
1212 var
= build_fold_indirect_ref (return_slot_addr
);
1217 /* All types requiring non-trivial constructors should have been handled. */
1218 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
1220 /* Attempt to avoid creating a new temporary variable. */
1223 bool use_it
= false;
1225 /* We can't use MODIFY_DEST if there's type promotion involved. */
1226 if (!lang_hooks
.types_compatible_p (caller_type
, callee_type
))
1229 /* ??? If we're assigning to a variable sized type, then we must
1230 reuse the destination variable, because we've no good way to
1231 create variable sized temporaries at this point. */
1232 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
1235 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1236 reuse it as the result of the call directly. Don't do this if
1237 it would promote MODIFY_DEST to addressable. */
1238 else if (!TREE_STATIC (modify_dest
)
1239 && !TREE_ADDRESSABLE (modify_dest
)
1240 && !TREE_ADDRESSABLE (result
))
1251 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
1253 var
= copy_decl_for_inlining (result
, callee
, caller
);
1255 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
1256 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
1257 = tree_cons (NULL_TREE
, var
,
1258 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
);
1260 /* Do not have the rest of GCC warn about this variable as it should
1261 not be visible to the user. */
1262 TREE_NO_WARNING (var
) = 1;
1264 /* Build the use expr. If the return type of the function was
1265 promoted, convert it back to the expected type. */
1267 if (!lang_hooks
.types_compatible_p (TREE_TYPE (var
), caller_type
))
1268 use
= fold_convert (caller_type
, var
);
1271 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1272 way, when the RESULT_DECL is encountered, it will be
1273 automatically replaced by the VAR_DECL. */
1274 insert_decl_map (id
, result
, var
);
1276 /* Remember this so we can ignore it in remap_decls. */
1283 /* Returns nonzero if a function can be inlined as a tree. */
1286 tree_inlinable_function_p (tree fn
)
1288 return inlinable_function_p (fn
);
1291 static const char *inline_forbidden_reason
;
1294 inline_forbidden_p_1 (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
1298 tree fn
= (tree
) fnp
;
1301 switch (TREE_CODE (node
))
1304 /* Refuse to inline alloca call unless user explicitly forced so as
1305 this may change program's memory overhead drastically when the
1306 function using alloca is called in loop. In GCC present in
1307 SPEC2000 inlining into schedule_block cause it to require 2GB of
1308 RAM instead of 256MB. */
1309 if (alloca_call_p (node
)
1310 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1312 inline_forbidden_reason
1313 = G_("%Jfunction %qF can never be inlined because it uses "
1314 "alloca (override using the always_inline attribute)");
1317 t
= get_callee_fndecl (node
);
1321 /* We cannot inline functions that call setjmp. */
1322 if (setjmp_call_p (t
))
1324 inline_forbidden_reason
1325 = G_("%Jfunction %qF can never be inlined because it uses setjmp");
1329 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
1330 switch (DECL_FUNCTION_CODE (t
))
1332 /* We cannot inline functions that take a variable number of
1334 case BUILT_IN_VA_START
:
1335 case BUILT_IN_STDARG_START
:
1336 case BUILT_IN_NEXT_ARG
:
1337 case BUILT_IN_VA_END
:
1338 inline_forbidden_reason
1339 = G_("%Jfunction %qF can never be inlined because it "
1340 "uses variable argument lists");
1343 case BUILT_IN_LONGJMP
:
1344 /* We can't inline functions that call __builtin_longjmp at
1345 all. The non-local goto machinery really requires the
1346 destination be in a different function. If we allow the
1347 function calling __builtin_longjmp to be inlined into the
1348 function calling __builtin_setjmp, Things will Go Awry. */
1349 inline_forbidden_reason
1350 = G_("%Jfunction %qF can never be inlined because "
1351 "it uses setjmp-longjmp exception handling");
1354 case BUILT_IN_NONLOCAL_GOTO
:
1356 inline_forbidden_reason
1357 = G_("%Jfunction %qF can never be inlined because "
1358 "it uses non-local goto");
1361 case BUILT_IN_RETURN
:
1362 case BUILT_IN_APPLY_ARGS
:
1363 /* If a __builtin_apply_args caller would be inlined,
1364 it would be saving arguments of the function it has
1365 been inlined into. Similarly __builtin_return would
1366 return from the function the inline has been inlined into. */
1367 inline_forbidden_reason
1368 = G_("%Jfunction %qF can never be inlined because "
1369 "it uses __builtin_return or __builtin_apply_args");
1378 t
= TREE_OPERAND (node
, 0);
1380 /* We will not inline a function which uses computed goto. The
1381 addresses of its local labels, which may be tucked into
1382 global storage, are of course not constant across
1383 instantiations, which causes unexpected behavior. */
1384 if (TREE_CODE (t
) != LABEL_DECL
)
1386 inline_forbidden_reason
1387 = G_("%Jfunction %qF can never be inlined "
1388 "because it contains a computed goto");
1394 t
= TREE_OPERAND (node
, 0);
1395 if (DECL_NONLOCAL (t
))
1397 /* We cannot inline a function that receives a non-local goto
1398 because we cannot remap the destination label used in the
1399 function that is performing the non-local goto. */
1400 inline_forbidden_reason
1401 = G_("%Jfunction %qF can never be inlined "
1402 "because it receives a non-local goto");
1409 /* We cannot inline a function of the form
1411 void F (int i) { struct S { int ar[i]; } s; }
1413 Attempting to do so produces a catch-22.
1414 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1415 UNION_TYPE nodes, then it goes into infinite recursion on a
1416 structure containing a pointer to its own type. If it doesn't,
1417 then the type node for S doesn't get adjusted properly when
1420 ??? This is likely no longer true, but it's too late in the 4.0
1421 cycle to try to find out. This should be checked for 4.1. */
1422 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
1423 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
1425 inline_forbidden_reason
1426 = G_("%Jfunction %qF can never be inlined "
1427 "because it uses variable sized variables");
1438 /* Return subexpression representing possible alloca call, if any. */
1440 inline_forbidden_p (tree fndecl
)
1442 location_t saved_loc
= input_location
;
1443 block_stmt_iterator bsi
;
1445 tree ret
= NULL_TREE
;
1447 FOR_EACH_BB_FN (bb
, DECL_STRUCT_FUNCTION (fndecl
))
1448 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
1450 ret
= walk_tree_without_duplicates (bsi_stmt_ptr (bsi
),
1451 inline_forbidden_p_1
, fndecl
);
1457 input_location
= saved_loc
;
1461 /* Returns nonzero if FN is a function that does not have any
1462 fundamental inline blocking properties. */
1465 inlinable_function_p (tree fn
)
1467 bool inlinable
= true;
1469 /* If we've already decided this function shouldn't be inlined,
1470 there's no need to check again. */
1471 if (DECL_UNINLINABLE (fn
))
1474 /* See if there is any language-specific reason it cannot be
1475 inlined. (It is important that this hook be called early because
1476 in C++ it may result in template instantiation.)
1477 If the function is not inlinable for language-specific reasons,
1478 it is left up to the langhook to explain why. */
1479 inlinable
= !lang_hooks
.tree_inlining
.cannot_inline_tree_fn (&fn
);
1481 /* If we don't have the function body available, we can't inline it.
1482 However, this should not be recorded since we also get here for
1483 forward declared inline functions. Therefore, return at once. */
1484 if (!DECL_SAVED_TREE (fn
))
1487 /* If we're not inlining at all, then we cannot inline this function. */
1488 else if (!flag_inline_trees
)
1491 /* Only try to inline functions if DECL_INLINE is set. This should be
1492 true for all functions declared `inline', and for all other functions
1493 as well with -finline-functions.
1495 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1496 it's the front-end that must set DECL_INLINE in this case, because
1497 dwarf2out loses if a function that does not have DECL_INLINE set is
1498 inlined anyway. That is why we have both DECL_INLINE and
1499 DECL_DECLARED_INLINE_P. */
1500 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1501 here should be redundant. */
1502 else if (!DECL_INLINE (fn
) && !flag_unit_at_a_time
)
1505 else if (inline_forbidden_p (fn
))
1507 /* See if we should warn about uninlinable functions. Previously,
1508 some of these warnings would be issued while trying to expand
1509 the function inline, but that would cause multiple warnings
1510 about functions that would for example call alloca. But since
1511 this a property of the function, just one warning is enough.
1512 As a bonus we can now give more details about the reason why a
1513 function is not inlinable.
1514 We only warn for functions declared `inline' by the user. */
1515 bool do_warning
= (warn_inline
1517 && DECL_DECLARED_INLINE_P (fn
)
1518 && !DECL_IN_SYSTEM_HEADER (fn
));
1520 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1521 sorry (inline_forbidden_reason
, fn
, fn
);
1522 else if (do_warning
)
1523 warning (0, inline_forbidden_reason
, fn
, fn
);
1528 /* Squirrel away the result so that we don't have to check again. */
1529 DECL_UNINLINABLE (fn
) = !inlinable
;
1534 /* Estimate the cost of a memory move. Use machine dependent
1535 word size and take possible memcpy call into account. */
1538 estimate_move_cost (tree type
)
1542 size
= int_size_in_bytes (type
);
1544 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO
)
1545 /* Cost of a memcpy call, 3 arguments and the call. */
1548 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
1551 /* Used by estimate_num_insns. Estimate number of instructions seen
1552 by given statement. */
1555 estimate_num_insns_1 (tree
*tp
, int *walk_subtrees
, void *data
)
1560 if (IS_TYPE_OR_DECL_P (x
))
1565 /* Assume that constants and references counts nothing. These should
1566 be majorized by amount of operations among them we count later
1567 and are common target of CSE and similar optimizations. */
1568 else if (CONSTANT_CLASS_P (x
) || REFERENCE_CLASS_P (x
))
1571 switch (TREE_CODE (x
))
1573 /* Containers have no cost. */
1580 case ALIGN_INDIRECT_REF
:
1581 case MISALIGNED_INDIRECT_REF
:
1583 case ARRAY_RANGE_REF
:
1585 case EXC_PTR_EXPR
: /* ??? */
1586 case FILTER_EXPR
: /* ??? */
1589 case WITH_CLEANUP_EXPR
:
1591 case VIEW_CONVERT_EXPR
:
1596 case CASE_LABEL_EXPR
:
1599 case EH_FILTER_EXPR
:
1600 case STATEMENT_LIST
:
1602 case NON_LVALUE_EXPR
:
1605 case TRY_CATCH_EXPR
:
1606 case TRY_FINALLY_EXPR
:
1613 case WITH_SIZE_EXPR
:
1616 /* We don't account constants for now. Assume that the cost is amortized
1617 by operations that do use them. We may re-consider this decision once
1618 we are able to optimize the tree before estimating its size and break
1619 out static initializers. */
1620 case IDENTIFIER_NODE
:
1629 /* Try to estimate the cost of assignments. We have three cases to
1631 1) Simple assignments to registers;
1632 2) Stores to things that must live in memory. This includes
1633 "normal" stores to scalars, but also assignments of large
1634 structures, or constructors of big arrays;
1637 Let us look at the first two cases, assuming we have "a = b + C":
1638 <modify_expr <var_decl "a"> <plus_expr <var_decl "b"> <constant C>>
1639 If "a" is a GIMPLE register, the assignment to it is free on almost
1640 any target, because "a" usually ends up in a real register. Hence
1641 the only cost of this expression comes from the PLUS_EXPR, and we
1642 can ignore the MODIFY_EXPR.
1643 If "a" is not a GIMPLE register, the assignment to "a" will most
1644 likely be a real store, so the cost of the MODIFY_EXPR is the cost
1645 of moving something into "a", which we compute using the function
1648 The third case deals with TARGET_EXPRs, for which the semantics are
1649 that a temporary is assigned, unless the TARGET_EXPR itself is being
1650 assigned to something else. In the latter case we do not need the
1651 temporary. E.g. in <modify_expr <var_decl "a"> <target_expr>>, the
1652 MODIFY_EXPR is free. */
1655 /* Is the right and side a TARGET_EXPR? */
1656 if (TREE_CODE (TREE_OPERAND (x
, 1)) == TARGET_EXPR
)
1658 /* ... fall through ... */
1661 x
= TREE_OPERAND (x
, 0);
1662 /* Is this an assignments to a register? */
1663 if (is_gimple_reg (x
))
1665 /* Otherwise it's a store, so fall through to compute the move cost. */
1668 *count
+= estimate_move_cost (TREE_TYPE (x
));
1671 /* Assign cost of 1 to usual operations.
1672 ??? We may consider mapping RTL costs to this. */
1680 case FIX_TRUNC_EXPR
:
1682 case FIX_FLOOR_EXPR
:
1683 case FIX_ROUND_EXPR
:
1701 case TRUTH_ANDIF_EXPR
:
1702 case TRUTH_ORIF_EXPR
:
1703 case TRUTH_AND_EXPR
:
1705 case TRUTH_XOR_EXPR
:
1706 case TRUTH_NOT_EXPR
:
1715 case UNORDERED_EXPR
:
1728 case PREDECREMENT_EXPR
:
1729 case PREINCREMENT_EXPR
:
1730 case POSTDECREMENT_EXPR
:
1731 case POSTINCREMENT_EXPR
:
1737 case REALIGN_LOAD_EXPR
:
1743 /* Few special cases of expensive operations. This is useful
1744 to avoid inlining on functions having too many of these. */
1745 case TRUNC_DIV_EXPR
:
1747 case FLOOR_DIV_EXPR
:
1748 case ROUND_DIV_EXPR
:
1749 case EXACT_DIV_EXPR
:
1750 case TRUNC_MOD_EXPR
:
1752 case FLOOR_MOD_EXPR
:
1753 case ROUND_MOD_EXPR
:
1759 tree decl
= get_callee_fndecl (x
);
1762 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
1763 switch (DECL_FUNCTION_CODE (decl
))
1765 case BUILT_IN_CONSTANT_P
:
1768 case BUILT_IN_EXPECT
:
1774 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
1775 that does use function declaration to figure out the arguments. */
1778 for (arg
= TREE_OPERAND (x
, 1); arg
; arg
= TREE_CHAIN (arg
))
1779 *count
+= estimate_move_cost (TREE_TYPE (TREE_VALUE (arg
)));
1783 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
1784 *count
+= estimate_move_cost (TREE_TYPE (arg
));
1787 *count
+= PARAM_VALUE (PARAM_INLINE_CALL_COST
);
1796 /* Estimate number of instructions that will be created by expanding EXPR. */
1799 estimate_num_insns (tree expr
)
1802 struct pointer_set_t
*visited_nodes
;
1804 block_stmt_iterator bsi
;
1805 struct function
*my_function
;
1807 /* If we're given an entire function, walk the CFG. */
1808 if (TREE_CODE (expr
) == FUNCTION_DECL
)
1810 my_function
= DECL_STRUCT_FUNCTION (expr
);
1811 gcc_assert (my_function
&& my_function
->cfg
);
1812 visited_nodes
= pointer_set_create ();
1813 FOR_EACH_BB_FN (bb
, my_function
)
1815 for (bsi
= bsi_start (bb
);
1819 walk_tree (bsi_stmt_ptr (bsi
), estimate_num_insns_1
,
1820 &num
, visited_nodes
);
1823 pointer_set_destroy (visited_nodes
);
1826 walk_tree_without_duplicates (&expr
, estimate_num_insns_1
, &num
);
1831 typedef struct function
*function_p
;
1833 DEF_VEC_P(function_p
);
1834 DEF_VEC_ALLOC_P(function_p
,heap
);
1836 /* Initialized with NOGC, making this poisonous to the garbage collector. */
1837 static VEC(function_p
,heap
) *cfun_stack
;
1840 push_cfun (struct function
*new_cfun
)
1842 VEC_safe_push (function_p
, heap
, cfun_stack
, cfun
);
1849 cfun
= VEC_pop (function_p
, cfun_stack
);
1852 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
1854 add_lexical_block (tree current_block
, tree new_block
)
1858 /* Walk to the last sub-block. */
1859 for (blk_p
= &BLOCK_SUBBLOCKS (current_block
);
1861 blk_p
= &TREE_CHAIN (*blk_p
))
1864 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
1865 BLOCK_SUBBLOCKS (new_block
) = NULL_TREE
;
1868 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1871 expand_call_inline (basic_block bb
, tree stmt
, tree
*tp
, void *data
)
1879 tree return_slot_addr
;
1881 location_t saved_location
;
1882 struct cgraph_edge
*cg_edge
;
1884 basic_block return_block
;
1886 block_stmt_iterator bsi
, stmt_bsi
;
1887 bool successfully_inlined
= FALSE
;
1890 struct cgraph_node
*old_node
;
1893 /* See what we've got. */
1894 id
= (inline_data
*) data
;
1897 /* Set input_location here so we get the right instantiation context
1898 if we call instantiate_decl from inlinable_function_p. */
1899 saved_location
= input_location
;
1900 if (EXPR_HAS_LOCATION (t
))
1901 input_location
= EXPR_LOCATION (t
);
1903 /* From here on, we're only interested in CALL_EXPRs. */
1904 if (TREE_CODE (t
) != CALL_EXPR
)
1907 /* First, see if we can figure out what function is being called.
1908 If we cannot, then there is no hope of inlining the function. */
1909 fn
= get_callee_fndecl (t
);
1913 /* Turn forward declarations into real ones. */
1914 fn
= cgraph_node (fn
)->decl
;
1916 /* If fn is a declaration of a function in a nested scope that was
1917 globally declared inline, we don't set its DECL_INITIAL.
1918 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1919 C++ front-end uses it for cdtors to refer to their internal
1920 declarations, that are not real functions. Fortunately those
1921 don't have trees to be saved, so we can tell by checking their
1923 if (! DECL_INITIAL (fn
)
1924 && DECL_ABSTRACT_ORIGIN (fn
)
1925 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn
)))
1926 fn
= DECL_ABSTRACT_ORIGIN (fn
);
1928 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1929 Kill this check once this is fixed. */
1930 if (!id
->current_node
->analyzed
)
1933 cg_edge
= cgraph_edge (id
->current_node
, stmt
);
1935 /* Constant propagation on argument done during previous inlining
1936 may create new direct call. Produce an edge for it. */
1939 struct cgraph_node
*dest
= cgraph_node (fn
);
1941 /* We have missing edge in the callgraph. This can happen in one case
1942 where previous inlining turned indirect call into direct call by
1943 constant propagating arguments. In all other cases we hit a bug
1944 (incorrect node sharing is most common reason for missing edges. */
1945 gcc_assert (dest
->needed
|| !flag_unit_at_a_time
);
1946 cgraph_create_edge (id
->node
, dest
, stmt
,
1947 bb
->count
, bb
->loop_depth
)->inline_failed
1948 = N_("originally indirect function call not considered for inlining");
1952 /* Don't try to inline functions that are not well-suited to
1954 if (!cgraph_inline_p (cg_edge
, &reason
))
1956 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1958 sorry ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1959 sorry ("called from here");
1961 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
1962 && !DECL_IN_SYSTEM_HEADER (fn
)
1964 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
)))
1966 warning (0, "%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1967 warning (0, "called from here");
1972 #ifdef ENABLE_CHECKING
1973 if (cg_edge
->callee
->decl
!= id
->node
->decl
)
1974 verify_cgraph_node (cg_edge
->callee
);
1977 /* We will be inlining this callee. */
1979 id
->eh_region
= lookup_stmt_eh_region (stmt
);
1981 /* Split the block holding the CALL_EXPR. */
1983 e
= split_block (bb
, stmt
);
1985 return_block
= e
->dest
;
1988 /* split_block splits before the statement, work around this by moving
1989 the call into the first half_bb. Not pretty, but seems easier than
1990 doing the CFG manipulation by hand when the CALL_EXPR is in the last
1992 stmt_bsi
= bsi_last (bb
);
1993 bsi
= bsi_start (return_block
);
1994 if (!bsi_end_p (bsi
))
1995 bsi_move_before (&stmt_bsi
, &bsi
);
1998 tree stmt
= bsi_stmt (stmt_bsi
);
1999 bsi_remove (&stmt_bsi
);
2000 bsi_insert_after (&bsi
, stmt
, BSI_NEW_STMT
);
2002 stmt_bsi
= bsi_start (return_block
);
2004 /* Build a block containing code to initialize the arguments, the
2005 actual inline expansion of the body, and a label for the return
2006 statements within the function to jump to. The type of the
2007 statement expression is the return type of the function call. */
2008 id
->block
= make_node (BLOCK
);
2009 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
2010 add_lexical_block (TREE_BLOCK (stmt
), id
->block
);
2013 /* Local declarations will be replaced by their equivalents in this
2016 id
->decl_map
= splay_tree_new (splay_tree_compare_pointers
,
2019 /* Initialize the parameters. */
2020 args
= TREE_OPERAND (t
, 1);
2021 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (t
))
2023 return_slot_addr
= TREE_VALUE (args
);
2024 args
= TREE_CHAIN (args
);
2027 return_slot_addr
= NULL_TREE
;
2029 initialize_inlined_parameters (id
, args
, TREE_OPERAND (t
, 2), fn
, bb
);
2031 /* Record the function we are about to inline. */
2034 /* Return statements in the function body will be replaced by jumps
2035 to the RET_LABEL. */
2037 gcc_assert (DECL_INITIAL (fn
));
2038 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
2040 /* Find the lhs to which the result of this call is assigned. */
2042 if (TREE_CODE (modify_dest
) == MODIFY_EXPR
)
2044 modify_dest
= TREE_OPERAND (modify_dest
, 0);
2046 /* The function which we are inlining might not return a value,
2047 in which case we should issue a warning that the function
2048 does not return a value. In that case the optimizers will
2049 see that the variable to which the value is assigned was not
2050 initialized. We do not want to issue a warning about that
2051 uninitialized variable. */
2052 if (DECL_P (modify_dest
))
2053 TREE_NO_WARNING (modify_dest
) = 1;
2058 /* Declare the return variable for the function. */
2059 decl
= declare_return_variable (id
, return_slot_addr
,
2060 modify_dest
, &use_retvar
);
2061 /* Do this only if declare_return_variable created a new one. */
2062 if (decl
&& !return_slot_addr
&& decl
!= modify_dest
)
2063 declare_inline_vars (id
->block
, decl
);
2065 /* After we've initialized the parameters, we insert the body of the
2067 old_node
= id
->current_node
;
2069 /* Anoint the callee-to-be-duplicated as the "current_node." When
2070 CALL_EXPRs within callee are duplicated, the edges from callee to
2071 callee's callees (caller's grandchildren) will be cloned. */
2072 id
->current_node
= cg_edge
->callee
;
2074 /* This is it. Duplicate the callee body. Assume callee is
2075 pre-gimplified. Note that we must not alter the caller
2076 function in any way before this point, as this CALL_EXPR may be
2077 a self-referential call; if we're calling ourselves, we need to
2078 duplicate our body before altering anything. */
2079 copy_body (id
, bb
->count
, bb
->frequency
, bb
, return_block
);
2080 id
->current_node
= old_node
;
2083 splay_tree_delete (id
->decl_map
);
2086 /* If the inlined function returns a result that we care about,
2087 clobber the CALL_EXPR with a reference to the return variable. */
2088 if (use_retvar
&& (TREE_CODE (bsi_stmt (stmt_bsi
)) != CALL_EXPR
))
2091 maybe_clean_or_replace_eh_stmt (stmt
, stmt
);
2094 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2095 tsi_delink() will leave the iterator in a sane state. */
2096 bsi_remove (&stmt_bsi
);
2099 if (bsi_end_p (bsi
))
2100 tree_purge_dead_eh_edges (return_block
);
2102 /* If the value of the new expression is ignored, that's OK. We
2103 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2104 the equivalent inlined version either. */
2105 TREE_USED (*tp
) = 1;
2107 /* Output the inlining info for this abstract function, since it has been
2108 inlined. If we don't do this now, we can lose the information about the
2109 variables in the function when the blocks get blown away as soon as we
2110 remove the cgraph node. */
2111 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
2113 /* Update callgraph if needed. */
2114 cgraph_remove_node (cg_edge
->callee
);
2116 /* Declare the 'auto' variables added with this inlined body. */
2117 record_vars (BLOCK_VARS (id
->block
));
2118 id
->block
= NULL_TREE
;
2120 /* Add local static vars in this inlined callee to caller. */
2121 for (t_step
= id
->callee_cfun
->unexpanded_var_list
;
2123 t_step
= TREE_CHAIN (t_step
))
2125 var
= TREE_VALUE (t_step
);
2126 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
2129 successfully_inlined
= TRUE
;
2132 input_location
= saved_location
;
2133 return successfully_inlined
;
2136 /* Expand call statements reachable from STMT_P.
2137 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2138 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
2139 unfortunately not use that function here because we need a pointer
2140 to the CALL_EXPR, not the tree itself. */
2143 gimple_expand_calls_inline (basic_block bb
, inline_data
*id
)
2145 block_stmt_iterator bsi
;
2147 /* Register specific tree functions. */
2148 tree_register_cfg_hooks ();
2149 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
2151 tree
*expr_p
= bsi_stmt_ptr (bsi
);
2152 tree stmt
= *expr_p
;
2154 if (TREE_CODE (*expr_p
) == MODIFY_EXPR
)
2155 expr_p
= &TREE_OPERAND (*expr_p
, 1);
2156 if (TREE_CODE (*expr_p
) == WITH_SIZE_EXPR
)
2157 expr_p
= &TREE_OPERAND (*expr_p
, 0);
2158 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2159 if (expand_call_inline (bb
, stmt
, expr_p
, id
))
2165 /* Expand calls to inline functions in the body of FN. */
2168 optimize_inline_calls (tree fn
)
2173 /* There is no point in performing inlining if errors have already
2174 occurred -- and we might crash if we try to inline invalid
2176 if (errorcount
|| sorrycount
)
2180 memset (&id
, 0, sizeof (id
));
2182 id
.current_node
= id
.node
= cgraph_node (fn
);
2184 /* Or any functions that aren't finished yet. */
2185 prev_fn
= NULL_TREE
;
2186 if (current_function_decl
)
2188 id
.caller
= current_function_decl
;
2189 prev_fn
= current_function_decl
;
2191 push_gimplify_context ();
2193 /* Reach the trees by walking over the CFG, and note the
2194 enclosing basic-blocks in the call edges. */
2195 /* We walk the blocks going forward, because inlined function bodies
2196 will split id->current_basic_block, and the new blocks will
2197 follow it; we'll trudge through them, processing their CALL_EXPRs
2200 gimple_expand_calls_inline (bb
, &id
);
2203 pop_gimplify_context (NULL
);
2204 /* Renumber the (code) basic_blocks consecutively. */
2206 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2209 #ifdef ENABLE_CHECKING
2211 struct cgraph_edge
*e
;
2213 verify_cgraph_node (id
.node
);
2215 /* Double check that we inlined everything we are supposed to inline. */
2216 for (e
= id
.node
->callees
; e
; e
= e
->next_callee
)
2217 gcc_assert (e
->inline_failed
);
2220 /* We need to rescale frequencies again to peak at REG_BR_PROB_BASE
2221 as inlining loops might increase the maximum. */
2222 if (ENTRY_BLOCK_PTR
->count
)
2224 fold_cond_expr_cond ();
2227 /* FN is a function that has a complete body, and CLONE is a function whose
2228 body is to be set to a copy of FN, mapping argument declarations according
2229 to the ARG_MAP splay_tree. */
2232 clone_body (tree clone
, tree fn
, void *arg_map
)
2236 /* Clone the body, as if we were making an inline call. But, remap the
2237 parameters in the callee to the parameters of caller. */
2238 memset (&id
, 0, sizeof (id
));
2241 id
.callee_cfun
= DECL_STRUCT_FUNCTION (fn
);
2242 id
.decl_map
= (splay_tree
)arg_map
;
2244 /* Cloning is treated slightly differently from inlining. Set
2245 CLONING_P so that it's clear which operation we're performing. */
2246 id
.cloning_p
= true;
2248 /* We're not inside any EH region. */
2251 /* Actually copy the body. */
2252 append_to_statement_list_force (copy_generic_body (&id
), &DECL_SAVED_TREE (clone
));
2255 /* Save duplicate body in FN. MAP is used to pass around splay tree
2256 used to update arguments in restore_body. */
2258 /* Make and return duplicate of body in FN. Put copies of DECL_ARGUMENTS
2259 in *arg_copy and of the static chain, if any, in *sc_copy. */
2262 save_body (tree fn
, tree
*arg_copy
, tree
*sc_copy
)
2265 tree newdecl
, *parg
;
2266 basic_block fn_entry_block
;
2268 memset (&id
, 0, sizeof (id
));
2270 id
.callee_cfun
= DECL_STRUCT_FUNCTION (fn
);
2272 id
.node
= cgraph_node (fn
);
2274 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2275 *arg_copy
= DECL_ARGUMENTS (fn
);
2277 for (parg
= arg_copy
; *parg
; parg
= &TREE_CHAIN (*parg
))
2279 tree
new = copy_node (*parg
);
2281 lang_hooks
.dup_lang_specific_decl (new);
2282 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*parg
);
2283 insert_decl_map (&id
, *parg
, new);
2284 TREE_CHAIN (new) = TREE_CHAIN (*parg
);
2288 *sc_copy
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2291 tree
new = copy_node (*sc_copy
);
2293 lang_hooks
.dup_lang_specific_decl (new);
2294 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*sc_copy
);
2295 insert_decl_map (&id
, *sc_copy
, new);
2296 TREE_CHAIN (new) = TREE_CHAIN (*sc_copy
);
2300 /* We're not inside any EH region. */
2303 insert_decl_map (&id
, DECL_RESULT (fn
), DECL_RESULT (fn
));
2305 /* Actually copy the body, including a new (struct function *) and CFG.
2306 EH info is also duplicated so its labels point into the copied
2307 CFG, not the original. */
2308 fn_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fn
));
2309 newdecl
= copy_body (&id
, fn_entry_block
->count
, fn_entry_block
->frequency
, NULL
, NULL
);
2310 DECL_STRUCT_FUNCTION (fn
)->saved_cfg
= DECL_STRUCT_FUNCTION (newdecl
)->cfg
;
2311 DECL_STRUCT_FUNCTION (fn
)->saved_eh
= DECL_STRUCT_FUNCTION (newdecl
)->eh
;
2314 splay_tree_delete (id
.decl_map
);
2317 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2320 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2322 enum tree_code code
= TREE_CODE (*tp
);
2324 /* We make copies of most nodes. */
2325 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
2326 || code
== TREE_LIST
2328 || code
== TYPE_DECL
)
2330 /* Because the chain gets clobbered when we make a copy, we save it
2332 tree chain
= TREE_CHAIN (*tp
);
2335 /* Copy the node. */
2336 new = copy_node (*tp
);
2338 /* Propagate mudflap marked-ness. */
2339 if (flag_mudflap
&& mf_marked_p (*tp
))
2344 /* Now, restore the chain, if appropriate. That will cause
2345 walk_tree to walk into the chain as well. */
2346 if (code
== PARM_DECL
|| code
== TREE_LIST
)
2347 TREE_CHAIN (*tp
) = chain
;
2349 /* For now, we don't update BLOCKs when we make copies. So, we
2350 have to nullify all BIND_EXPRs. */
2351 if (TREE_CODE (*tp
) == BIND_EXPR
)
2352 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
2355 else if (TREE_CODE_CLASS (code
) == tcc_type
)
2357 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
2359 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
2362 gcc_assert (code
!= STATEMENT_LIST
);
2366 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2367 information indicating to what new SAVE_EXPR this one should be mapped,
2368 use that one. Otherwise, create a new node and enter it in ST. FN is
2369 the function into which the copy will be placed. */
2372 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
2374 splay_tree st
= (splay_tree
) st_
;
2378 /* See if we already encountered this SAVE_EXPR. */
2379 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2381 /* If we didn't already remap this SAVE_EXPR, do so now. */
2384 t
= copy_node (*tp
);
2386 /* Remember this SAVE_EXPR. */
2387 splay_tree_insert (st
, (splay_tree_key
) *tp
, (splay_tree_value
) t
);
2388 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2389 splay_tree_insert (st
, (splay_tree_key
) t
, (splay_tree_value
) t
);
2393 /* We've already walked into this SAVE_EXPR; don't do it again. */
2395 t
= (tree
) n
->value
;
2398 /* Replace this SAVE_EXPR with the copy. */
2402 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2403 copies the declaration and enters it in the splay_tree in DATA (which is
2404 really an `inline_data *'). */
2407 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2410 inline_data
*id
= (inline_data
*) data
;
2412 /* Don't walk into types. */
2416 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
2418 tree decl
= TREE_OPERAND (*tp
, 0);
2420 /* Copy the decl and remember the copy. */
2421 insert_decl_map (id
, decl
,
2422 copy_decl_for_inlining (decl
, DECL_CONTEXT (decl
),
2423 DECL_CONTEXT (decl
)));
2429 /* Perform any modifications to EXPR required when it is unsaved. Does
2430 not recurse into EXPR's subtrees. */
2433 unsave_expr_1 (tree expr
)
2435 switch (TREE_CODE (expr
))
2438 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2439 It's OK for this to happen if it was part of a subtree that
2440 isn't immediately expanded, such as operand 2 of another
2442 if (TREE_OPERAND (expr
, 1))
2445 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2446 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2454 /* Called via walk_tree when an expression is unsaved. Using the
2455 splay_tree pointed to by ST (which is really a `splay_tree'),
2456 remaps all local declarations to appropriate replacements. */
2459 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
2461 inline_data
*id
= (inline_data
*) data
;
2462 splay_tree st
= id
->decl_map
;
2465 /* Only a local declaration (variable or label). */
2466 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
2467 || TREE_CODE (*tp
) == LABEL_DECL
)
2469 /* Lookup the declaration. */
2470 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2472 /* If it's there, remap it. */
2474 *tp
= (tree
) n
->value
;
2477 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
2478 copy_statement_list (tp
);
2479 else if (TREE_CODE (*tp
) == BIND_EXPR
)
2480 copy_bind_expr (tp
, walk_subtrees
, id
);
2481 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2482 remap_save_expr (tp
, st
, walk_subtrees
);
2485 copy_tree_r (tp
, walk_subtrees
, NULL
);
2487 /* Do whatever unsaving is required. */
2488 unsave_expr_1 (*tp
);
2491 /* Keep iterating. */
2495 /* Copies everything in EXPR and replaces variables, labels
2496 and SAVE_EXPRs local to EXPR. */
2499 unsave_expr_now (tree expr
)
2503 /* There's nothing to do for NULL_TREE. */
2508 memset (&id
, 0, sizeof (id
));
2509 id
.callee
= current_function_decl
;
2510 id
.caller
= current_function_decl
;
2511 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2513 /* Walk the tree once to find local labels. */
2514 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
2516 /* Walk the tree again, copying, remapping, and unsaving. */
2517 walk_tree (&expr
, unsave_r
, &id
, NULL
);
2520 splay_tree_delete (id
.decl_map
);
2525 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2528 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
2537 debug_find_tree (tree top
, tree search
)
2539 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
2543 /* Declare the variables created by the inliner. Add all the variables in
2544 VARS to BIND_EXPR. */
2547 declare_inline_vars (tree block
, tree vars
)
2550 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
2551 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
2554 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
2557 /* Returns true if we're inlining. */
2559 inlining_p (inline_data
*id
)
2561 return (!id
->saving_p
&& !id
->cloning_p
);