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"
35 #include "integrate.h"
38 #include "pointer-set.h"
39 #include "splay-tree.h"
40 #include "langhooks.h"
43 #include "tree-mudflap.h"
44 #include "tree-flow.h"
46 #include "diagnostic.h"
49 /* I'm not real happy about this, but we need to handle gimple and
51 #include "tree-iterator.h"
52 #include "tree-gimple.h"
54 /* 0 if we should not perform inlining.
55 1 if we should expand functions calls inline at the tree level.
56 2 if we should consider *all* functions to be inline
59 int flag_inline_trees
= 0;
63 o In order to make inlining-on-trees work, we pessimized
64 function-local static constants. In particular, they are now
65 always output, even when not addressed. Fix this by treating
66 function-local static constants just like global static
67 constants; the back-end already knows not to output them if they
70 o Provide heuristics to clamp inlining of recursive template
73 /* Data required for function inlining. */
75 typedef struct inline_data
77 /* A stack of the functions we are inlining. For example, if we are
78 compiling `f', which calls `g', which calls `h', and we are
79 inlining the body of `h', the stack will contain, `h', followed
80 by `g', followed by `f'. The first few elements of the stack may
81 contain other functions that we know we should not recurse into,
82 even though they are not directly being inlined. */
84 /* The index of the first element of FNS that really represents an
86 unsigned first_inlined_fn
;
87 /* The label to jump to when a return statement is encountered. If
88 this value is NULL, then return statements will simply be
89 remapped as return statements, rather than as jumps. */
91 /* The VAR_DECL for the return value. */
93 /* The map from local declarations in the inlined function to
94 equivalents in the function into which it is being inlined. */
96 /* Nonzero if we are currently within the cleanup for a
98 int in_target_cleanup_p
;
99 /* We use the same mechanism to build clones that we do to perform
100 inlining. However, there are a few places where we need to
101 distinguish between those two situations. This flag is true if
102 we are cloning, rather than inlining. */
104 /* Similarly for saving function body. */
106 /* Hash table used to prevent walk_tree from visiting the same node
107 umpteen million times. */
109 /* Callgraph node of function we are inlining into. */
110 struct cgraph_node
*node
;
111 /* Callgraph node of currently inlined function. */
112 struct cgraph_node
*current_node
;
113 /* Statement iterator. We need this so we can keep the tree in
114 gimple form when we insert the inlined function. It is not
115 used when we are not dealing with gimple trees. */
116 tree_stmt_iterator tsi
;
121 /* The approximate number of instructions per statement. This number
122 need not be particularly accurate; it is used only to make
123 decisions about when a function is too big to inline. */
124 #define INSNS_PER_STMT (10)
126 static tree
copy_body_r (tree
*, int *, void *);
127 static tree
copy_body (inline_data
*);
128 static tree
expand_call_inline (tree
*, int *, void *);
129 static void expand_calls_inline (tree
*, inline_data
*);
130 static bool inlinable_function_p (tree
);
131 static tree
remap_decl (tree
, inline_data
*);
132 static tree
remap_type (tree
, inline_data
*);
133 static tree
initialize_inlined_parameters (inline_data
*, tree
,
135 static void remap_block (tree
*, inline_data
*);
136 static tree
remap_decls (tree
, inline_data
*);
137 static void copy_bind_expr (tree
*, int *, inline_data
*);
138 static tree
mark_local_for_remap_r (tree
*, int *, void *);
139 static void unsave_expr_1 (tree
);
140 static tree
unsave_r (tree
*, int *, void *);
141 static void declare_inline_vars (tree bind_expr
, tree vars
);
142 static void remap_save_expr (tree
*, void *, int *);
144 /* Insert a tree->tree mapping for ID. Despite the name suggests
145 that the trees should be variables, it is used for more than that. */
148 insert_decl_map (inline_data
*id
, tree key
, tree value
)
150 splay_tree_insert (id
->decl_map
, (splay_tree_key
) key
,
151 (splay_tree_value
) value
);
153 /* Always insert an identity map as well. If we see this same new
154 node again, we won't want to duplicate it a second time. */
156 splay_tree_insert (id
->decl_map
, (splay_tree_key
) value
,
157 (splay_tree_value
) value
);
160 /* Remap DECL during the copying of the BLOCK tree for the function.
161 We are only called to remap local variables in the current function. */
164 remap_decl (tree decl
, inline_data
*id
)
166 splay_tree_node n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
167 tree fn
= VARRAY_TOP_TREE (id
->fns
);
169 /* See if we have remapped this declaration. If we didn't already have an
170 equivalent for this declaration, create one now. */
173 /* Make a copy of the variable or label. */
174 tree t
= copy_decl_for_inlining (decl
, fn
, VARRAY_TREE (id
->fns
, 0));
176 /* Remap types, if necessary. */
177 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
178 if (TREE_CODE (t
) == TYPE_DECL
)
179 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
180 else if (TREE_CODE (t
) == PARM_DECL
)
181 DECL_ARG_TYPE_AS_WRITTEN (t
)
182 = remap_type (DECL_ARG_TYPE_AS_WRITTEN (t
), id
);
184 /* Remap sizes as necessary. */
185 walk_tree (&DECL_SIZE (t
), copy_body_r
, id
, NULL
);
186 walk_tree (&DECL_SIZE_UNIT (t
), copy_body_r
, id
, NULL
);
188 /* If fields, do likewise for offset and qualifier. */
189 if (TREE_CODE (t
) == FIELD_DECL
)
191 walk_tree (&DECL_FIELD_OFFSET (t
), copy_body_r
, id
, NULL
);
192 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
193 walk_tree (&DECL_QUALIFIER (t
), copy_body_r
, id
, NULL
);
197 /* FIXME handle anon aggrs. */
198 if (! DECL_NAME (t
) && TREE_TYPE (t
)
199 && lang_hooks
.tree_inlining
.anon_aggr_type_p (TREE_TYPE (t
)))
201 /* For a VAR_DECL of anonymous type, we must also copy the
202 member VAR_DECLS here and rechain the DECL_ANON_UNION_ELEMS. */
206 for (src
= DECL_ANON_UNION_ELEMS (t
); src
;
207 src
= TREE_CHAIN (src
))
209 tree member
= remap_decl (TREE_VALUE (src
), id
);
211 gcc_assert (!TREE_PURPOSE (src
));
212 members
= tree_cons (NULL
, member
, members
);
214 DECL_ANON_UNION_ELEMS (t
) = nreverse (members
);
218 /* Remember it, so that if we encounter this local entity
219 again we can reuse this copy. */
220 insert_decl_map (id
, decl
, t
);
224 return unshare_expr ((tree
) n
->value
);
228 remap_type (tree type
, inline_data
*id
)
230 splay_tree_node node
;
236 /* See if we have remapped this type. */
237 node
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) type
);
239 return (tree
) node
->value
;
241 /* The type only needs remapping if it's variably modified by a variable
242 in the function we are inlining. */
243 if (! variably_modified_type_p (type
, VARRAY_TOP_TREE (id
->fns
)))
245 insert_decl_map (id
, type
, type
);
249 /* We do need a copy. build and register it now. If this is a pointer or
250 reference type, remap the designated type and make a new pointer or
252 if (TREE_CODE (type
) == POINTER_TYPE
)
254 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
256 TYPE_REF_CAN_ALIAS_ALL (type
));
257 insert_decl_map (id
, type
, new);
260 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
262 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
264 TYPE_REF_CAN_ALIAS_ALL (type
));
265 insert_decl_map (id
, type
, new);
269 new = copy_node (type
);
271 insert_decl_map (id
, type
, new);
273 /* This is a new type, not a copy of an old type. Need to reassociate
274 variants. We can handle everything except the main variant lazily. */
275 t
= TYPE_MAIN_VARIANT (type
);
278 t
= remap_type (t
, id
);
279 TYPE_MAIN_VARIANT (new) = t
;
280 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t
);
281 TYPE_NEXT_VARIANT (t
) = new;
285 TYPE_MAIN_VARIANT (new) = new;
286 TYPE_NEXT_VARIANT (new) = NULL
;
289 /* Lazily create pointer and reference types. */
290 TYPE_POINTER_TO (new) = NULL
;
291 TYPE_REFERENCE_TO (new) = NULL
;
293 switch (TREE_CODE (new))
300 t
= TYPE_MIN_VALUE (new);
301 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
302 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r
, id
, NULL
);
304 t
= TYPE_MAX_VALUE (new);
305 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
306 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r
, id
, NULL
);
310 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
311 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r
, id
, NULL
);
315 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
316 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id
);
321 case QUAL_UNION_TYPE
:
322 walk_tree (&TYPE_FIELDS (new), copy_body_r
, id
, NULL
);
328 /* Shouldn't have been thought variable sized. */
332 walk_tree (&TYPE_SIZE (new), copy_body_r
, id
, NULL
);
333 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r
, id
, NULL
);
339 remap_decls (tree decls
, inline_data
*id
)
342 tree new_decls
= NULL_TREE
;
344 /* Remap its variables. */
345 for (old_var
= decls
; old_var
; old_var
= TREE_CHAIN (old_var
))
349 /* Remap the variable. */
350 new_var
= remap_decl (old_var
, id
);
352 /* If we didn't remap this variable, so we can't mess with its
353 TREE_CHAIN. If we remapped this variable to the return slot, it's
354 already declared somewhere else, so don't declare it here. */
355 if (!new_var
|| new_var
== id
->retvar
)
359 gcc_assert (DECL_P (new_var
));
360 TREE_CHAIN (new_var
) = new_decls
;
365 return nreverse (new_decls
);
368 /* Copy the BLOCK to contain remapped versions of the variables
369 therein. And hook the new block into the block-tree. */
372 remap_block (tree
*block
, inline_data
*id
)
378 /* Make the new block. */
380 new_block
= make_node (BLOCK
);
381 TREE_USED (new_block
) = TREE_USED (old_block
);
382 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
385 /* Remap its variables. */
386 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
), id
);
388 fn
= VARRAY_TREE (id
->fns
, 0);
390 /* FIXME! It shouldn't be so hard to manage blocks. Rebuilding them in
391 rest_of_compilation is a good start. */
393 /* We're building a clone; DECL_INITIAL is still
394 error_mark_node, and current_binding_level is the parm
396 lang_hooks
.decls
.insert_block (new_block
);
399 /* Attach this new block after the DECL_INITIAL block for the
400 function into which this block is being inlined. In
401 rest_of_compilation we will straighten out the BLOCK tree. */
403 if (DECL_INITIAL (fn
))
404 first_block
= &BLOCK_CHAIN (DECL_INITIAL (fn
));
406 first_block
= &DECL_INITIAL (fn
);
407 BLOCK_CHAIN (new_block
) = *first_block
;
408 *first_block
= new_block
;
411 /* Remember the remapped block. */
412 insert_decl_map (id
, old_block
, new_block
);
416 copy_statement_list (tree
*tp
)
418 tree_stmt_iterator oi
, ni
;
421 new = alloc_stmt_list ();
422 ni
= tsi_start (new);
423 oi
= tsi_start (*tp
);
426 for (; !tsi_end_p (oi
); tsi_next (&oi
))
427 tsi_link_after (&ni
, tsi_stmt (oi
), TSI_NEW_STMT
);
431 copy_bind_expr (tree
*tp
, int *walk_subtrees
, inline_data
*id
)
433 tree block
= BIND_EXPR_BLOCK (*tp
);
434 /* Copy (and replace) the statement. */
435 copy_tree_r (tp
, walk_subtrees
, NULL
);
438 remap_block (&block
, id
);
439 BIND_EXPR_BLOCK (*tp
) = block
;
442 if (BIND_EXPR_VARS (*tp
))
443 /* This will remap a lot of the same decls again, but this should be
445 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), id
);
448 /* Called from copy_body via walk_tree. DATA is really an `inline_data *'. */
451 copy_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
453 inline_data
*id
= (inline_data
*) data
;
454 tree fn
= VARRAY_TOP_TREE (id
->fns
);
457 /* All automatic variables should have a DECL_CONTEXT indicating
458 what function they come from. */
459 if ((TREE_CODE (*tp
) == VAR_DECL
|| TREE_CODE (*tp
) == LABEL_DECL
)
460 && DECL_NAMESPACE_SCOPE_P (*tp
))
461 gcc_assert (DECL_EXTERNAL (*tp
) || TREE_STATIC (*tp
));
464 /* If this is a RETURN_EXPR, change it into a MODIFY_EXPR and a
465 GOTO_EXPR with the RET_LABEL as its target. */
466 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->ret_label
)
468 tree return_stmt
= *tp
;
471 /* Build the GOTO_EXPR. */
472 tree assignment
= TREE_OPERAND (return_stmt
, 0);
473 goto_stmt
= build1 (GOTO_EXPR
, void_type_node
, id
->ret_label
);
474 TREE_USED (id
->ret_label
) = 1;
476 /* If we're returning something, just turn that into an
477 assignment into the equivalent of the original
481 /* Do not create a statement containing a naked RESULT_DECL. */
482 if (TREE_CODE (assignment
) == RESULT_DECL
)
483 gimplify_stmt (&assignment
);
485 *tp
= build (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
486 append_to_statement_list (assignment
, &BIND_EXPR_BODY (*tp
));
487 append_to_statement_list (goto_stmt
, &BIND_EXPR_BODY (*tp
));
489 /* If we're not returning anything just do the jump. */
493 /* Local variables and labels need to be replaced by equivalent
494 variables. We don't want to copy static variables; there's only
495 one of those, no matter how many times we inline the containing
496 function. Similarly for globals from an outer function. */
497 else if (lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
501 /* Remap the declaration. */
502 new_decl
= remap_decl (*tp
, id
);
503 gcc_assert (new_decl
);
504 /* Replace this variable with the copy. */
505 STRIP_TYPE_NOPS (new_decl
);
509 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
510 copy_statement_list (tp
);
511 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
512 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
513 else if (TREE_CODE (*tp
) == BIND_EXPR
)
514 copy_bind_expr (tp
, walk_subtrees
, id
);
515 /* Types may need remapping as well. */
516 else if (TYPE_P (*tp
))
517 *tp
= remap_type (*tp
, id
);
519 /* If this is a constant, we have to copy the node iff the type will be
520 remapped. copy_tree_r will not copy a constant. */
521 else if (TREE_CODE_CLASS (TREE_CODE (*tp
)) == tcc_constant
)
523 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
525 if (new_type
== TREE_TYPE (*tp
))
528 else if (TREE_CODE (*tp
) == INTEGER_CST
)
529 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
530 TREE_INT_CST_HIGH (*tp
));
533 *tp
= copy_node (*tp
);
534 TREE_TYPE (*tp
) = new_type
;
538 /* Otherwise, just copy the node. Note that copy_tree_r already
539 knows not to copy VAR_DECLs, etc., so this is safe. */
544 if (TREE_CODE (*tp
) == MODIFY_EXPR
545 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
546 && (lang_hooks
.tree_inlining
.auto_var_in_fn_p
547 (TREE_OPERAND (*tp
, 0), fn
)))
549 /* Some assignments VAR = VAR; don't generate any rtl code
550 and thus don't count as variable modification. Avoid
551 keeping bogosities like 0 = 0. */
552 tree decl
= TREE_OPERAND (*tp
, 0), value
;
555 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
558 value
= (tree
) n
->value
;
559 STRIP_TYPE_NOPS (value
);
560 if (TREE_CONSTANT (value
) || TREE_READONLY_DECL_P (value
))
562 *tp
= build_empty_stmt ();
563 return copy_body_r (tp
, walk_subtrees
, data
);
567 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
569 /* Get rid of *& from inline substitutions that can happen when a
570 pointer argument is an ADDR_EXPR. */
571 tree decl
= TREE_OPERAND (*tp
, 0), value
;
574 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
577 value
= (tree
) n
->value
;
579 if (TREE_CODE (value
) == ADDR_EXPR
580 && (lang_hooks
.types_compatible_p
581 (TREE_TYPE (*tp
), TREE_TYPE (TREE_OPERAND (value
, 0)))))
583 *tp
= TREE_OPERAND (value
, 0);
584 return copy_body_r (tp
, walk_subtrees
, data
);
589 copy_tree_r (tp
, walk_subtrees
, NULL
);
591 if (TREE_CODE (*tp
) == CALL_EXPR
&& id
->node
&& get_callee_fndecl (*tp
))
595 struct cgraph_node
*node
;
596 struct cgraph_edge
*edge
;
598 for (node
= id
->node
->next_clone
; node
; node
= node
->next_clone
)
600 edge
= cgraph_edge (node
, old_node
);
602 edge
->call_expr
= *tp
;
607 struct cgraph_edge
*edge
608 = cgraph_edge (id
->current_node
, old_node
);
611 cgraph_clone_edge (edge
, id
->node
, *tp
);
615 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
617 /* The copied TARGET_EXPR has never been expanded, even if the
618 original node was expanded already. */
619 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
621 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
622 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
625 /* Variable substitution need not be simple. In particular, the
626 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
627 and friends are up-to-date. */
628 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
630 walk_tree (&TREE_OPERAND (*tp
, 0), copy_body_r
, id
, NULL
);
631 recompute_tree_invarant_for_addr_expr (*tp
);
636 /* Keep iterating. */
640 /* Make a copy of the body of FN so that it can be inserted inline in
644 copy_body (inline_data
*id
)
647 tree fndecl
= VARRAY_TOP_TREE (id
->fns
);
649 if (fndecl
== current_function_decl
651 body
= cfun
->saved_tree
;
653 body
= DECL_SAVED_TREE (fndecl
);
654 walk_tree (&body
, copy_body_r
, id
, NULL
);
659 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
660 defined in function FN, or of a data member thereof. */
663 self_inlining_addr_expr (tree value
, tree fn
)
667 if (TREE_CODE (value
) != ADDR_EXPR
)
670 var
= get_base_address (TREE_OPERAND (value
, 0));
672 return var
&& lang_hooks
.tree_inlining
.auto_var_in_fn_p (var
, fn
);
676 setup_one_parameter (inline_data
*id
, tree p
, tree value
, tree fn
,
677 tree
*init_stmts
, tree
*vars
, bool *gimplify_init_stmts_p
)
682 /* If the parameter is never assigned to, we may not need to
683 create a new variable here at all. Instead, we may be able
684 to just use the argument value. */
685 if (TREE_READONLY (p
)
686 && !TREE_ADDRESSABLE (p
)
687 && value
&& !TREE_SIDE_EFFECTS (value
))
689 /* We can't risk substituting complex expressions. They
690 might contain variables that will be assigned to later.
691 Theoretically, we could check the expression to see if
692 all of the variables that determine its value are
693 read-only, but we don't bother. */
694 /* We may produce non-gimple trees by adding NOPs or introduce
695 invalid sharing when operand is not really constant.
696 It is not big deal to prohibit constant propagation here as
697 we will constant propagate in DOM1 pass anyway. */
698 if (is_gimple_min_invariant (value
)
699 && lang_hooks
.types_compatible_p (TREE_TYPE (value
), TREE_TYPE (p
))
700 /* We have to be very careful about ADDR_EXPR. Make sure
701 the base variable isn't a local variable of the inlined
702 function, e.g., when doing recursive inlining, direct or
703 mutually-recursive or whatever, which is why we don't
704 just test whether fn == current_function_decl. */
705 && ! self_inlining_addr_expr (value
, fn
))
707 insert_decl_map (id
, p
, value
);
712 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
713 here since the type of this decl must be visible to the calling
715 var
= copy_decl_for_inlining (p
, fn
, VARRAY_TREE (id
->fns
, 0));
717 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
718 that way, when the PARM_DECL is encountered, it will be
719 automatically replaced by the VAR_DECL. */
720 insert_decl_map (id
, p
, var
);
722 /* Declare this new variable. */
723 TREE_CHAIN (var
) = *vars
;
726 /* Make gimplifier happy about this variable. */
727 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
729 /* Even if P was TREE_READONLY, the new VAR should not be.
730 In the original code, we would have constructed a
731 temporary, and then the function body would have never
732 changed the value of P. However, now, we will be
733 constructing VAR directly. The constructor body may
734 change its value multiple times as it is being
735 constructed. Therefore, it must not be TREE_READONLY;
736 the back-end assumes that TREE_READONLY variable is
737 assigned to only once. */
738 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
739 TREE_READONLY (var
) = 0;
741 /* Initialize this VAR_DECL from the equivalent argument. Convert
742 the argument to the proper type in case it was promoted. */
745 tree rhs
= fold_convert (TREE_TYPE (var
), value
);
747 if (rhs
== error_mark_node
)
750 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
751 keep our trees in gimple form. */
752 init_stmt
= build (MODIFY_EXPR
, TREE_TYPE (var
), var
, rhs
);
753 append_to_statement_list (init_stmt
, init_stmts
);
755 /* If we did not create a gimple value and we did not create a gimple
756 cast of a gimple value, then we will need to gimplify INIT_STMTS
757 at the end. Note that is_gimple_cast only checks the outer
758 tree code, not its operand. Thus the explicit check that it's
759 operand is a gimple value. */
760 if (!is_gimple_val (rhs
)
761 && (!is_gimple_cast (rhs
)
762 || !is_gimple_val (TREE_OPERAND (rhs
, 0))))
763 *gimplify_init_stmts_p
= true;
767 /* Generate code to initialize the parameters of the function at the
768 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
771 initialize_inlined_parameters (inline_data
*id
, tree args
, tree static_chain
,
772 tree fn
, tree bind_expr
)
774 tree init_stmts
= NULL_TREE
;
778 tree vars
= NULL_TREE
;
779 bool gimplify_init_stmts_p
= false;
782 /* Figure out what the parameters are. */
783 parms
= DECL_ARGUMENTS (fn
);
784 if (fn
== current_function_decl
)
785 parms
= cfun
->saved_args
;
787 /* Loop through the parameter declarations, replacing each with an
788 equivalent VAR_DECL, appropriately initialized. */
789 for (p
= parms
, a
= args
; p
;
790 a
= a
? TREE_CHAIN (a
) : a
, p
= TREE_CHAIN (p
))
796 /* Find the initializer. */
797 value
= lang_hooks
.tree_inlining
.convert_parm_for_inlining
798 (p
, a
? TREE_VALUE (a
) : NULL_TREE
, fn
, argnum
);
800 setup_one_parameter (id
, p
, value
, fn
, &init_stmts
, &vars
,
801 &gimplify_init_stmts_p
);
804 /* Evaluate trailing arguments. */
805 for (; a
; a
= TREE_CHAIN (a
))
807 tree value
= TREE_VALUE (a
);
808 append_to_statement_list (value
, &init_stmts
);
811 /* Initialize the static chain. */
812 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
813 if (fn
== current_function_decl
)
814 p
= DECL_STRUCT_FUNCTION (fn
)->saved_static_chain_decl
;
817 /* No static chain? Seems like a bug in tree-nested.c. */
818 gcc_assert (static_chain
);
820 setup_one_parameter (id
, p
, static_chain
, fn
, &init_stmts
, &vars
,
821 &gimplify_init_stmts_p
);
824 if (gimplify_init_stmts_p
)
825 gimplify_body (&init_stmts
, current_function_decl
, false);
827 declare_inline_vars (bind_expr
, vars
);
831 /* Declare a return variable to replace the RESULT_DECL for the function we
832 are calling. RETURN_SLOT_ADDR, if non-null, was a fake parameter that
833 took the address of the result. MODIFY_DEST, if non-null, was the LHS of
834 the MODIFY_EXPR to which this call is the RHS.
836 The return value is a (possibly null) value that is the result of the
837 function as seen by the callee. *USE_P is a (possibly null) value that
838 holds the result as seen by the caller. */
841 declare_return_variable (inline_data
*id
, tree return_slot_addr
,
842 tree modify_dest
, tree
*use_p
)
844 tree callee
= VARRAY_TOP_TREE (id
->fns
);
845 tree caller
= VARRAY_TREE (id
->fns
, 0);
846 tree result
= DECL_RESULT (callee
);
847 tree callee_type
= TREE_TYPE (result
);
848 tree caller_type
= TREE_TYPE (TREE_TYPE (callee
));
851 /* We don't need to do anything for functions that don't return
853 if (!result
|| VOID_TYPE_P (callee_type
))
859 /* If there was a return slot, then the return value is the
860 dereferenced address of that object. */
861 if (return_slot_addr
)
863 /* The front end shouldn't have used both return_slot_addr and
864 a modify expression. */
865 gcc_assert (!modify_dest
);
866 if (DECL_BY_REFERENCE (result
))
867 var
= return_slot_addr
;
869 var
= build_fold_indirect_ref (return_slot_addr
);
874 /* All types requiring non-trivial constructors should have been handled. */
875 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
877 /* Attempt to avoid creating a new temporary variable. */
882 /* We can't use MODIFY_DEST if there's type promotion involved. */
883 if (!lang_hooks
.types_compatible_p (caller_type
, callee_type
))
886 /* ??? If we're assigning to a variable sized type, then we must
887 reuse the destination variable, because we've no good way to
888 create variable sized temporaries at this point. */
889 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
892 /* If the callee cannot possibly modify MODIFY_DEST, then we can
893 reuse it as the result of the call directly. Don't do this if
894 it would promote MODIFY_DEST to addressable. */
895 else if (!TREE_STATIC (modify_dest
)
896 && !TREE_ADDRESSABLE (modify_dest
)
897 && !TREE_ADDRESSABLE (result
))
908 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
910 var
= copy_decl_for_inlining (result
, callee
, caller
);
911 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
912 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
913 = tree_cons (NULL_TREE
, var
,
914 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
);
916 /* Do not have the rest of GCC warn about this variable as it should
917 not be visible to the user. */
918 TREE_NO_WARNING (var
) = 1;
920 /* Build the use expr. If the return type of the function was
921 promoted, convert it back to the expected type. */
923 if (!lang_hooks
.types_compatible_p (TREE_TYPE (var
), caller_type
))
924 use
= fold_convert (caller_type
, var
);
927 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
928 way, when the RESULT_DECL is encountered, it will be
929 automatically replaced by the VAR_DECL. */
930 insert_decl_map (id
, result
, var
);
932 /* Remember this so we can ignore it in remap_decls. */
939 /* Returns nonzero if a function can be inlined as a tree. */
942 tree_inlinable_function_p (tree fn
)
944 return inlinable_function_p (fn
);
947 static const char *inline_forbidden_reason
;
950 inline_forbidden_p_1 (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
954 tree fn
= (tree
) fnp
;
957 switch (TREE_CODE (node
))
960 /* Refuse to inline alloca call unless user explicitly forced so as
961 this may change program's memory overhead drastically when the
962 function using alloca is called in loop. In GCC present in
963 SPEC2000 inlining into schedule_block cause it to require 2GB of
964 RAM instead of 256MB. */
965 if (alloca_call_p (node
)
966 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
968 inline_forbidden_reason
969 = N_("%Jfunction %qF can never be inlined because it uses "
970 "alloca (override using the always_inline attribute)");
973 t
= get_callee_fndecl (node
);
977 /* We cannot inline functions that call setjmp. */
978 if (setjmp_call_p (t
))
980 inline_forbidden_reason
981 = N_("%Jfunction %qF can never be inlined because it uses setjmp");
985 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
986 switch (DECL_FUNCTION_CODE (t
))
988 /* We cannot inline functions that take a variable number of
990 case BUILT_IN_VA_START
:
991 case BUILT_IN_STDARG_START
:
992 case BUILT_IN_NEXT_ARG
:
993 case BUILT_IN_VA_END
:
994 inline_forbidden_reason
995 = N_("%Jfunction %qF can never be inlined because it "
996 "uses variable argument lists");
999 case BUILT_IN_LONGJMP
:
1000 /* We can't inline functions that call __builtin_longjmp at
1001 all. The non-local goto machinery really requires the
1002 destination be in a different function. If we allow the
1003 function calling __builtin_longjmp to be inlined into the
1004 function calling __builtin_setjmp, Things will Go Awry. */
1005 inline_forbidden_reason
1006 = N_("%Jfunction %qF can never be inlined because "
1007 "it uses setjmp-longjmp exception handling");
1010 case BUILT_IN_NONLOCAL_GOTO
:
1012 inline_forbidden_reason
1013 = N_("%Jfunction %qF can never be inlined because "
1014 "it uses non-local goto");
1023 t
= TREE_OPERAND (node
, 0);
1025 /* We will not inline a function which uses computed goto. The
1026 addresses of its local labels, which may be tucked into
1027 global storage, are of course not constant across
1028 instantiations, which causes unexpected behavior. */
1029 if (TREE_CODE (t
) != LABEL_DECL
)
1031 inline_forbidden_reason
1032 = N_("%Jfunction %qF can never be inlined "
1033 "because it contains a computed goto");
1039 t
= TREE_OPERAND (node
, 0);
1040 if (DECL_NONLOCAL (t
))
1042 /* We cannot inline a function that receives a non-local goto
1043 because we cannot remap the destination label used in the
1044 function that is performing the non-local goto. */
1045 inline_forbidden_reason
1046 = N_("%Jfunction %qF can never be inlined "
1047 "because it receives a non-local goto");
1054 /* We cannot inline a function of the form
1056 void F (int i) { struct S { int ar[i]; } s; }
1058 Attempting to do so produces a catch-22.
1059 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1060 UNION_TYPE nodes, then it goes into infinite recursion on a
1061 structure containing a pointer to its own type. If it doesn't,
1062 then the type node for S doesn't get adjusted properly when
1063 F is inlined, and we abort in find_function_data.
1065 ??? This is likely no longer true, but it's too late in the 4.0
1066 cycle to try to find out. This should be checked for 4.1. */
1067 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
1068 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
1070 inline_forbidden_reason
1071 = N_("%Jfunction %qF can never be inlined "
1072 "because it uses variable sized variables");
1083 /* Return subexpression representing possible alloca call, if any. */
1085 inline_forbidden_p (tree fndecl
)
1087 location_t saved_loc
= input_location
;
1088 tree ret
= walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl
),
1089 inline_forbidden_p_1
, fndecl
);
1091 input_location
= saved_loc
;
1095 /* Returns nonzero if FN is a function that does not have any
1096 fundamental inline blocking properties. */
1099 inlinable_function_p (tree fn
)
1101 bool inlinable
= true;
1103 /* If we've already decided this function shouldn't be inlined,
1104 there's no need to check again. */
1105 if (DECL_UNINLINABLE (fn
))
1108 /* See if there is any language-specific reason it cannot be
1109 inlined. (It is important that this hook be called early because
1110 in C++ it may result in template instantiation.)
1111 If the function is not inlinable for language-specific reasons,
1112 it is left up to the langhook to explain why. */
1113 inlinable
= !lang_hooks
.tree_inlining
.cannot_inline_tree_fn (&fn
);
1115 /* If we don't have the function body available, we can't inline it.
1116 However, this should not be recorded since we also get here for
1117 forward declared inline functions. Therefore, return at once. */
1118 if (!DECL_SAVED_TREE (fn
))
1121 /* If we're not inlining at all, then we cannot inline this function. */
1122 else if (!flag_inline_trees
)
1125 /* Only try to inline functions if DECL_INLINE is set. This should be
1126 true for all functions declared `inline', and for all other functions
1127 as well with -finline-functions.
1129 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1130 it's the front-end that must set DECL_INLINE in this case, because
1131 dwarf2out loses if a function that does not have DECL_INLINE set is
1132 inlined anyway. That is why we have both DECL_INLINE and
1133 DECL_DECLARED_INLINE_P. */
1134 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1135 here should be redundant. */
1136 else if (!DECL_INLINE (fn
) && !flag_unit_at_a_time
)
1139 else if (inline_forbidden_p (fn
))
1141 /* See if we should warn about uninlinable functions. Previously,
1142 some of these warnings would be issued while trying to expand
1143 the function inline, but that would cause multiple warnings
1144 about functions that would for example call alloca. But since
1145 this a property of the function, just one warning is enough.
1146 As a bonus we can now give more details about the reason why a
1147 function is not inlinable.
1148 We only warn for functions declared `inline' by the user. */
1149 bool do_warning
= (warn_inline
1151 && DECL_DECLARED_INLINE_P (fn
)
1152 && !DECL_IN_SYSTEM_HEADER (fn
));
1154 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1155 sorry (inline_forbidden_reason
, fn
, fn
);
1156 else if (do_warning
)
1157 warning (inline_forbidden_reason
, fn
, fn
);
1162 /* Squirrel away the result so that we don't have to check again. */
1163 DECL_UNINLINABLE (fn
) = !inlinable
;
1168 /* Used by estimate_num_insns. Estimate number of instructions seen
1169 by given statement. */
1172 estimate_num_insns_1 (tree
*tp
, int *walk_subtrees
, void *data
)
1177 if (IS_TYPE_OR_DECL_P (x
))
1182 /* Assume that constants and references counts nothing. These should
1183 be majorized by amount of operations among them we count later
1184 and are common target of CSE and similar optimizations. */
1185 else if (CONSTANT_CLASS_P (x
) || REFERENCE_CLASS_P (x
))
1188 switch (TREE_CODE (x
))
1190 /* Containers have no cost. */
1197 case ALIGN_INDIRECT_REF
:
1198 case MISALIGNED_INDIRECT_REF
:
1200 case ARRAY_RANGE_REF
:
1202 case EXC_PTR_EXPR
: /* ??? */
1203 case FILTER_EXPR
: /* ??? */
1206 case WITH_CLEANUP_EXPR
:
1208 case VIEW_CONVERT_EXPR
:
1213 case CASE_LABEL_EXPR
:
1216 case EH_FILTER_EXPR
:
1217 case STATEMENT_LIST
:
1219 case NON_LVALUE_EXPR
:
1222 case TRY_CATCH_EXPR
:
1223 case TRY_FINALLY_EXPR
:
1230 case WITH_SIZE_EXPR
:
1233 /* We don't account constants for now. Assume that the cost is amortized
1234 by operations that do use them. We may re-consider this decision once
1235 we are able to optimize the tree before estimating it's size and break
1236 out static initializers. */
1237 case IDENTIFIER_NODE
:
1246 /* Recognize assignments of large structures and constructors of
1250 x
= TREE_OPERAND (x
, 0);
1257 size
= int_size_in_bytes (TREE_TYPE (x
));
1259 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO
)
1262 *count
+= ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
1266 /* Assign cost of 1 to usual operations.
1267 ??? We may consider mapping RTL costs to this. */
1274 case FIX_TRUNC_EXPR
:
1276 case FIX_FLOOR_EXPR
:
1277 case FIX_ROUND_EXPR
:
1295 case TRUTH_ANDIF_EXPR
:
1296 case TRUTH_ORIF_EXPR
:
1297 case TRUTH_AND_EXPR
:
1299 case TRUTH_XOR_EXPR
:
1300 case TRUTH_NOT_EXPR
:
1309 case UNORDERED_EXPR
:
1322 case PREDECREMENT_EXPR
:
1323 case PREINCREMENT_EXPR
:
1324 case POSTDECREMENT_EXPR
:
1325 case POSTINCREMENT_EXPR
:
1331 case REALIGN_LOAD_EXPR
:
1337 /* Few special cases of expensive operations. This is useful
1338 to avoid inlining on functions having too many of these. */
1339 case TRUNC_DIV_EXPR
:
1341 case FLOOR_DIV_EXPR
:
1342 case ROUND_DIV_EXPR
:
1343 case EXACT_DIV_EXPR
:
1344 case TRUNC_MOD_EXPR
:
1346 case FLOOR_MOD_EXPR
:
1347 case ROUND_MOD_EXPR
:
1353 tree decl
= get_callee_fndecl (x
);
1355 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
1356 switch (DECL_FUNCTION_CODE (decl
))
1358 case BUILT_IN_CONSTANT_P
:
1361 case BUILT_IN_EXPECT
:
1370 /* Abort here se we know we don't miss any nodes. */
1376 /* Estimate number of instructions that will be created by expanding EXPR. */
1379 estimate_num_insns (tree expr
)
1382 walk_tree_without_duplicates (&expr
, estimate_num_insns_1
, &num
);
1386 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1389 expand_call_inline (tree
*tp
, int *walk_subtrees
, void *data
)
1401 tree return_slot_addr
;
1403 location_t saved_location
;
1404 struct cgraph_edge
*edge
;
1407 /* See what we've got. */
1408 id
= (inline_data
*) data
;
1411 /* Set input_location here so we get the right instantiation context
1412 if we call instantiate_decl from inlinable_function_p. */
1413 saved_location
= input_location
;
1414 if (EXPR_HAS_LOCATION (t
))
1415 input_location
= EXPR_LOCATION (t
);
1417 /* Recurse, but letting recursive invocations know that we are
1418 inside the body of a TARGET_EXPR. */
1419 if (TREE_CODE (*tp
) == TARGET_EXPR
)
1422 int i
, len
= TREE_CODE_LENGTH (TARGET_EXPR
);
1424 /* We're walking our own subtrees. */
1427 /* Actually walk over them. This loop is the body of
1428 walk_trees, omitting the case where the TARGET_EXPR
1429 itself is handled. */
1430 for (i
= 0; i
< len
; ++i
)
1433 ++id
->in_target_cleanup_p
;
1434 walk_tree (&TREE_OPERAND (*tp
, i
), expand_call_inline
, data
,
1437 --id
->in_target_cleanup_p
;
1445 /* Because types were not copied in copy_body, CALL_EXPRs beneath
1446 them should not be expanded. This can happen if the type is a
1447 dynamic array type, for example. */
1450 /* From here on, we're only interested in CALL_EXPRs. */
1451 if (TREE_CODE (t
) != CALL_EXPR
)
1454 /* First, see if we can figure out what function is being called.
1455 If we cannot, then there is no hope of inlining the function. */
1456 fn
= get_callee_fndecl (t
);
1460 /* Turn forward declarations into real ones. */
1461 fn
= cgraph_node (fn
)->decl
;
1463 /* If fn is a declaration of a function in a nested scope that was
1464 globally declared inline, we don't set its DECL_INITIAL.
1465 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1466 C++ front-end uses it for cdtors to refer to their internal
1467 declarations, that are not real functions. Fortunately those
1468 don't have trees to be saved, so we can tell by checking their
1470 if (! DECL_INITIAL (fn
)
1471 && DECL_ABSTRACT_ORIGIN (fn
)
1472 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn
)))
1473 fn
= DECL_ABSTRACT_ORIGIN (fn
);
1475 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1476 Kill this check once this is fixed. */
1477 if (!id
->current_node
->analyzed
)
1480 edge
= cgraph_edge (id
->current_node
, t
);
1482 /* Constant propagation on argument done during previous inlining
1483 may create new direct call. Produce an edge for it. */
1486 struct cgraph_node
*dest
= cgraph_node (fn
);
1488 /* We have missing edge in the callgraph. This can happen in one case
1489 where previous inlining turned indirect call into direct call by
1490 constant propagating arguments. In all other cases we hit a bug
1491 (incorrect node sharing is most common reason for missing edges. */
1492 gcc_assert (dest
->needed
|| !flag_unit_at_a_time
);
1493 cgraph_create_edge (id
->node
, dest
, t
)->inline_failed
1494 = N_("originally indirect function call not considered for inlining");
1498 /* Don't try to inline functions that are not well-suited to
1500 if (!cgraph_inline_p (edge
, &reason
))
1502 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1504 sorry ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1505 sorry ("called from here");
1507 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
1508 && !DECL_IN_SYSTEM_HEADER (fn
)
1510 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
)))
1512 warning ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1513 warning ("called from here");
1518 #ifdef ENABLE_CHECKING
1519 if (edge
->callee
->decl
!= id
->node
->decl
)
1520 verify_cgraph_node (edge
->callee
);
1523 if (! lang_hooks
.tree_inlining
.start_inlining (fn
))
1526 /* Build a block containing code to initialize the arguments, the
1527 actual inline expansion of the body, and a label for the return
1528 statements within the function to jump to. The type of the
1529 statement expression is the return type of the function call. */
1531 expr
= build (BIND_EXPR
, void_type_node
, NULL_TREE
,
1532 stmt
, make_node (BLOCK
));
1533 BLOCK_ABSTRACT_ORIGIN (BIND_EXPR_BLOCK (expr
)) = fn
;
1535 /* Local declarations will be replaced by their equivalents in this
1538 id
->decl_map
= splay_tree_new (splay_tree_compare_pointers
,
1541 /* Initialize the parameters. */
1542 args
= TREE_OPERAND (t
, 1);
1543 return_slot_addr
= NULL_TREE
;
1544 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (t
))
1546 return_slot_addr
= TREE_VALUE (args
);
1547 args
= TREE_CHAIN (args
);
1548 TREE_TYPE (expr
) = void_type_node
;
1551 arg_inits
= initialize_inlined_parameters (id
, args
, TREE_OPERAND (t
, 2),
1555 /* Expand any inlined calls in the initializers. Do this before we
1556 push FN on the stack of functions we are inlining; we want to
1557 inline calls to FN that appear in the initializers for the
1560 Note we need to save and restore the saved tree statement iterator
1561 to avoid having it clobbered by expand_calls_inline. */
1562 tree_stmt_iterator save_tsi
;
1565 expand_calls_inline (&arg_inits
, id
);
1568 /* And add them to the tree. */
1569 append_to_statement_list (arg_inits
, &BIND_EXPR_BODY (expr
));
1572 /* Record the function we are about to inline so that we can avoid
1573 recursing into it. */
1574 VARRAY_PUSH_TREE (id
->fns
, fn
);
1576 /* Return statements in the function body will be replaced by jumps
1577 to the RET_LABEL. */
1578 id
->ret_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
1579 DECL_ARTIFICIAL (id
->ret_label
) = 1;
1580 DECL_IGNORED_P (id
->ret_label
) = 1;
1581 DECL_CONTEXT (id
->ret_label
) = VARRAY_TREE (id
->fns
, 0);
1582 insert_decl_map (id
, id
->ret_label
, id
->ret_label
);
1584 gcc_assert (DECL_INITIAL (fn
));
1585 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
1587 /* Find the lhs to which the result of this call is assigned. */
1588 modify_dest
= tsi_stmt (id
->tsi
);
1589 if (TREE_CODE (modify_dest
) == MODIFY_EXPR
)
1591 modify_dest
= TREE_OPERAND (modify_dest
, 0);
1593 /* The function which we are inlining might not return a value,
1594 in which case we should issue a warning that the function
1595 does not return a value. In that case the optimizers will
1596 see that the variable to which the value is assigned was not
1597 initialized. We do not want to issue a warning about that
1598 uninitialized variable. */
1599 if (DECL_P (modify_dest
))
1600 TREE_NO_WARNING (modify_dest
) = 1;
1605 /* Declare the return variable for the function. */
1606 declare_return_variable (id
, return_slot_addr
,
1607 modify_dest
, &use_retvar
);
1609 /* After we've initialized the parameters, we insert the body of the
1612 struct cgraph_node
*old_node
= id
->current_node
;
1615 id
->current_node
= edge
->callee
;
1616 copy
= copy_body (id
);
1618 /* If the function uses a return slot, then it may legitimately
1619 fall through while still returning a value, so we have to skip
1620 the warning here. */
1621 if (warn_return_type
1622 && !TREE_NO_WARNING (fn
)
1623 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fn
)))
1624 && return_slot_addr
== NULL_TREE
1625 && block_may_fallthru (copy
))
1627 warning ("control may reach end of non-void function %qD being inlined",
1629 TREE_NO_WARNING (fn
) = 1;
1632 append_to_statement_list (copy
, &BIND_EXPR_BODY (expr
));
1633 id
->current_node
= old_node
;
1635 inlined_body
= &BIND_EXPR_BODY (expr
);
1637 /* After the body of the function comes the RET_LABEL. This must come
1638 before we evaluate the returned value below, because that evaluation
1639 may cause RTL to be generated. */
1640 if (TREE_USED (id
->ret_label
))
1642 tree label
= build1 (LABEL_EXPR
, void_type_node
, id
->ret_label
);
1643 append_to_statement_list (label
, &BIND_EXPR_BODY (expr
));
1647 splay_tree_delete (id
->decl_map
);
1650 /* Although, from the semantic viewpoint, the new expression has
1651 side-effects only if the old one did, it is not possible, from
1652 the technical viewpoint, to evaluate the body of a function
1653 multiple times without serious havoc. */
1654 TREE_SIDE_EFFECTS (expr
) = 1;
1656 tsi_link_before (&id
->tsi
, expr
, TSI_SAME_STMT
);
1658 /* If the inlined function returns a result that we care about,
1659 then we're going to need to splice in a MODIFY_EXPR. Otherwise
1660 the call was a standalone statement and we can just replace it
1661 with the BIND_EXPR inline representation of the called function. */
1662 if (!use_retvar
|| !modify_dest
)
1663 *tsi_stmt_ptr (id
->tsi
) = build_empty_stmt ();
1667 /* When we gimplify a function call, we may clear TREE_SIDE_EFFECTS on
1668 the call if it is to a "const" function. Thus the copy of
1669 TREE_SIDE_EFFECTS from the CALL_EXPR to the BIND_EXPR above with
1670 result in TREE_SIDE_EFFECTS not being set for the inlined copy of a
1673 Unfortunately, that is wrong as inlining the function can create/expose
1674 interesting side effects (such as setting of a return value).
1676 The easiest solution is to simply recalculate TREE_SIDE_EFFECTS for
1677 the toplevel expression. */
1678 recalculate_side_effects (expr
);
1680 /* Output the inlining info for this abstract function, since it has been
1681 inlined. If we don't do this now, we can lose the information about the
1682 variables in the function when the blocks get blown away as soon as we
1683 remove the cgraph node. */
1684 (*debug_hooks
->outlining_inline_function
) (edge
->callee
->decl
);
1686 /* Update callgraph if needed. */
1687 cgraph_remove_node (edge
->callee
);
1689 /* Recurse into the body of the just inlined function. */
1690 expand_calls_inline (inlined_body
, id
);
1691 VARRAY_POP (id
->fns
);
1693 /* Don't walk into subtrees. We've already handled them above. */
1696 lang_hooks
.tree_inlining
.end_inlining (fn
);
1698 /* Keep iterating. */
1700 input_location
= saved_location
;
1705 expand_calls_inline (tree
*stmt_p
, inline_data
*id
)
1707 tree stmt
= *stmt_p
;
1708 enum tree_code code
= TREE_CODE (stmt
);
1713 case STATEMENT_LIST
:
1715 tree_stmt_iterator i
;
1718 for (i
= tsi_start (stmt
); !tsi_end_p (i
); )
1721 expand_calls_inline (tsi_stmt_ptr (i
), id
);
1724 if (TREE_CODE (new) == STATEMENT_LIST
)
1726 tsi_link_before (&i
, new, TSI_SAME_STMT
);
1736 expand_calls_inline (&COND_EXPR_THEN (stmt
), id
);
1737 expand_calls_inline (&COND_EXPR_ELSE (stmt
), id
);
1741 expand_calls_inline (&CATCH_BODY (stmt
), id
);
1744 case EH_FILTER_EXPR
:
1745 expand_calls_inline (&EH_FILTER_FAILURE (stmt
), id
);
1748 case TRY_CATCH_EXPR
:
1749 case TRY_FINALLY_EXPR
:
1750 expand_calls_inline (&TREE_OPERAND (stmt
, 0), id
);
1751 expand_calls_inline (&TREE_OPERAND (stmt
, 1), id
);
1755 expand_calls_inline (&BIND_EXPR_BODY (stmt
), id
);
1759 /* We're gimple. We should have gotten rid of all these. */
1763 stmt_p
= &TREE_OPERAND (stmt
, 0);
1765 if (!stmt
|| TREE_CODE (stmt
) != MODIFY_EXPR
)
1771 stmt_p
= &TREE_OPERAND (stmt
, 1);
1773 if (TREE_CODE (stmt
) == WITH_SIZE_EXPR
)
1775 stmt_p
= &TREE_OPERAND (stmt
, 0);
1778 if (TREE_CODE (stmt
) != CALL_EXPR
)
1784 expand_call_inline (stmt_p
, &dummy
, id
);
1792 /* Expand calls to inline functions in the body of FN. */
1795 optimize_inline_calls (tree fn
)
1800 /* There is no point in performing inlining if errors have already
1801 occurred -- and we might crash if we try to inline invalid
1803 if (errorcount
|| sorrycount
)
1807 memset (&id
, 0, sizeof (id
));
1809 id
.current_node
= id
.node
= cgraph_node (fn
);
1810 /* Don't allow recursion into FN. */
1811 VARRAY_TREE_INIT (id
.fns
, 32, "fns");
1812 VARRAY_PUSH_TREE (id
.fns
, fn
);
1813 /* Or any functions that aren't finished yet. */
1814 prev_fn
= NULL_TREE
;
1815 if (current_function_decl
)
1817 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
1818 prev_fn
= current_function_decl
;
1821 prev_fn
= lang_hooks
.tree_inlining
.add_pending_fn_decls (&id
.fns
, prev_fn
);
1823 /* Keep track of the low-water mark, i.e., the point where the first
1824 real inlining is represented in ID.FNS. */
1825 id
.first_inlined_fn
= VARRAY_ACTIVE_SIZE (id
.fns
);
1827 /* Replace all calls to inline functions with the bodies of those
1829 id
.tree_pruner
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1830 expand_calls_inline (&DECL_SAVED_TREE (fn
), &id
);
1833 htab_delete (id
.tree_pruner
);
1835 #ifdef ENABLE_CHECKING
1837 struct cgraph_edge
*e
;
1839 verify_cgraph_node (id
.node
);
1841 /* Double check that we inlined everything we are supposed to inline. */
1842 for (e
= id
.node
->callees
; e
; e
= e
->next_callee
)
1843 gcc_assert (e
->inline_failed
);
1848 /* FN is a function that has a complete body, and CLONE is a function whose
1849 body is to be set to a copy of FN, mapping argument declarations according
1850 to the ARG_MAP splay_tree. */
1853 clone_body (tree clone
, tree fn
, void *arg_map
)
1857 /* Clone the body, as if we were making an inline call. But, remap the
1858 parameters in the callee to the parameters of caller. If there's an
1859 in-charge parameter, map it to an appropriate constant. */
1860 memset (&id
, 0, sizeof (id
));
1861 VARRAY_TREE_INIT (id
.fns
, 2, "fns");
1862 VARRAY_PUSH_TREE (id
.fns
, clone
);
1863 VARRAY_PUSH_TREE (id
.fns
, fn
);
1864 id
.decl_map
= (splay_tree
)arg_map
;
1866 /* Cloning is treated slightly differently from inlining. Set
1867 CLONING_P so that it's clear which operation we're performing. */
1868 id
.cloning_p
= true;
1870 /* Actually copy the body. */
1871 append_to_statement_list_force (copy_body (&id
), &DECL_SAVED_TREE (clone
));
1874 /* Make and return duplicate of body in FN. Put copies of DECL_ARGUMENTS
1875 in *arg_copy and of the static chain, if any, in *sc_copy. */
1878 save_body (tree fn
, tree
*arg_copy
, tree
*sc_copy
)
1883 memset (&id
, 0, sizeof (id
));
1884 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
1885 VARRAY_PUSH_TREE (id
.fns
, fn
);
1886 id
.node
= cgraph_node (fn
);
1888 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
1889 *arg_copy
= DECL_ARGUMENTS (fn
);
1891 for (parg
= arg_copy
; *parg
; parg
= &TREE_CHAIN (*parg
))
1893 tree
new = copy_node (*parg
);
1895 lang_hooks
.dup_lang_specific_decl (new);
1896 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*parg
);
1897 insert_decl_map (&id
, *parg
, new);
1898 TREE_CHAIN (new) = TREE_CHAIN (*parg
);
1902 *sc_copy
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
1905 tree
new = copy_node (*sc_copy
);
1907 lang_hooks
.dup_lang_specific_decl (new);
1908 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*sc_copy
);
1909 insert_decl_map (&id
, *sc_copy
, new);
1910 TREE_CHAIN (new) = TREE_CHAIN (*sc_copy
);
1914 insert_decl_map (&id
, DECL_RESULT (fn
), DECL_RESULT (fn
));
1916 /* Actually copy the body. */
1917 body
= copy_body (&id
);
1920 splay_tree_delete (id
.decl_map
);
1924 #define WALK_SUBTREE(NODE) \
1927 result = walk_tree (&(NODE), func, data, pset); \
1933 /* This is a subroutine of walk_tree that walks field of TYPE that are to
1934 be walked whenever a type is seen in the tree. Rest of operands and return
1935 value are as for walk_tree. */
1938 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
1939 struct pointer_set_t
*pset
)
1941 tree result
= NULL_TREE
;
1943 switch (TREE_CODE (type
))
1946 case REFERENCE_TYPE
:
1947 /* We have to worry about mutually recursive pointers. These can't
1948 be written in C. They can in Ada. It's pathological, but
1949 there's an ACATS test (c38102a) that checks it. Deal with this
1950 by checking if we're pointing to another pointer, that one
1951 points to another pointer, that one does too, and we have no htab.
1952 If so, get a hash table. We check three levels deep to avoid
1953 the cost of the hash table if we don't need one. */
1954 if (POINTER_TYPE_P (TREE_TYPE (type
))
1955 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
1956 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
1959 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
1967 /* ... fall through ... */
1970 WALK_SUBTREE (TREE_TYPE (type
));
1974 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
1979 WALK_SUBTREE (TREE_TYPE (type
));
1983 /* We never want to walk into default arguments. */
1984 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
1985 WALK_SUBTREE (TREE_VALUE (arg
));
1990 /* Don't follow this nodes's type if a pointer for fear that we'll
1991 have infinite recursion. Those types are uninteresting anyway. */
1992 if (!POINTER_TYPE_P (TREE_TYPE (type
))
1993 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
1994 WALK_SUBTREE (TREE_TYPE (type
));
1995 WALK_SUBTREE (TYPE_DOMAIN (type
));
2003 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
2004 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
2008 WALK_SUBTREE (TREE_TYPE (type
));
2009 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
2019 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
2020 called with the DATA and the address of each sub-tree. If FUNC returns a
2021 non-NULL value, the traversal is aborted, and the value returned by FUNC
2022 is returned. If PSET is non-NULL it is used to record the nodes visited,
2023 and to avoid visiting a node more than once. */
2026 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
2028 enum tree_code code
;
2032 #define WALK_SUBTREE_TAIL(NODE) \
2036 goto tail_recurse; \
2041 /* Skip empty subtrees. */
2045 /* Don't walk the same tree twice, if the user has requested
2046 that we avoid doing so. */
2047 if (pset
&& pointer_set_insert (pset
, *tp
))
2050 /* Call the function. */
2052 result
= (*func
) (tp
, &walk_subtrees
, data
);
2054 /* If we found something, return it. */
2058 code
= TREE_CODE (*tp
);
2060 /* Even if we didn't, FUNC may have decided that there was nothing
2061 interesting below this point in the tree. */
2064 if (code
== TREE_LIST
)
2065 /* But we still need to check our siblings. */
2066 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2071 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
2073 if (result
|| ! walk_subtrees
)
2076 /* If this is a DECL_EXPR, walk into various fields of the type that it's
2077 defining. We only want to walk into these fields of a type in this
2078 case. Note that decls get walked as part of the processing of a
2081 ??? Precisely which fields of types that we are supposed to walk in
2082 this case vs. the normal case aren't well defined. */
2083 if (code
== DECL_EXPR
2084 && TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
2085 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
2087 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
2089 /* Call the function for the type. See if it returns anything or
2090 doesn't want us to continue. If we are to continue, walk both
2091 the normal fields and those for the declaration case. */
2092 result
= (*func
) (type_p
, &walk_subtrees
, data
);
2093 if (result
|| !walk_subtrees
)
2096 result
= walk_type_fields (*type_p
, func
, data
, pset
);
2100 WALK_SUBTREE (TYPE_SIZE (*type_p
));
2101 WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p
));
2103 /* If this is a record type, also walk the fields. */
2104 if (TREE_CODE (*type_p
) == RECORD_TYPE
2105 || TREE_CODE (*type_p
) == UNION_TYPE
2106 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2110 for (field
= TYPE_FIELDS (*type_p
); field
;
2111 field
= TREE_CHAIN (field
))
2113 /* We'd like to look at the type of the field, but we can easily
2114 get infinite recursion. So assume it's pointed to elsewhere
2115 in the tree. Also, ignore things that aren't fields. */
2116 if (TREE_CODE (field
) != FIELD_DECL
)
2119 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
2120 WALK_SUBTREE (DECL_SIZE (field
));
2121 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
2122 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2123 WALK_SUBTREE (DECL_QUALIFIER (field
));
2128 else if (code
!= SAVE_EXPR
2129 && code
!= BIND_EXPR
2130 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
2134 /* Walk over all the sub-trees of this operand. */
2135 len
= TREE_CODE_LENGTH (code
);
2136 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
2137 But, we only want to walk once. */
2138 if (code
== TARGET_EXPR
2139 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
2142 /* Go through the subtrees. We need to do this in forward order so
2143 that the scope of a FOR_EXPR is handled properly. */
2144 #ifdef DEBUG_WALK_TREE
2145 for (i
= 0; i
< len
; ++i
)
2146 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2148 for (i
= 0; i
< len
- 1; ++i
)
2149 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2153 /* The common case is that we may tail recurse here. */
2154 if (code
!= BIND_EXPR
2155 && !TREE_CHAIN (*tp
))
2156 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
2158 WALK_SUBTREE (TREE_OPERAND (*tp
, len
- 1));
2163 /* If this is a type, walk the needed fields in the type. */
2164 else if (TYPE_P (*tp
))
2166 result
= walk_type_fields (*tp
, func
, data
, pset
);
2172 /* Not one of the easy cases. We must explicitly go through the
2177 case IDENTIFIER_NODE
:
2183 case PLACEHOLDER_EXPR
:
2187 /* None of thse have subtrees other than those already walked
2192 WALK_SUBTREE (TREE_VALUE (*tp
));
2193 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2198 int len
= TREE_VEC_LENGTH (*tp
);
2203 /* Walk all elements but the first. */
2205 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
2207 /* Now walk the first one as a tail call. */
2208 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
2212 WALK_SUBTREE (TREE_REALPART (*tp
));
2213 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
2216 WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp
));
2219 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
2224 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
2226 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
2227 into declarations that are just mentioned, rather than
2228 declared; they don't really belong to this part of the tree.
2229 And, we can see cycles: the initializer for a declaration
2230 can refer to the declaration itself. */
2231 WALK_SUBTREE (DECL_INITIAL (decl
));
2232 WALK_SUBTREE (DECL_SIZE (decl
));
2233 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
2235 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
2238 case STATEMENT_LIST
:
2240 tree_stmt_iterator i
;
2241 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
2242 WALK_SUBTREE (*tsi_stmt_ptr (i
));
2247 /* ??? This could be a language-defined node. We really should make
2248 a hook for it, but right now just ignore it. */
2253 /* We didn't find what we were looking for. */
2257 #undef WALK_SUBTREE_TAIL
2260 /* Like walk_tree, but does not walk duplicate nodes more than once. */
2263 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
2266 struct pointer_set_t
*pset
;
2268 pset
= pointer_set_create ();
2269 result
= walk_tree (tp
, func
, data
, pset
);
2270 pointer_set_destroy (pset
);
2274 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2277 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2279 enum tree_code code
= TREE_CODE (*tp
);
2281 /* We make copies of most nodes. */
2282 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
2283 || code
== TREE_LIST
2285 || code
== TYPE_DECL
)
2287 /* Because the chain gets clobbered when we make a copy, we save it
2289 tree chain
= TREE_CHAIN (*tp
);
2292 /* Copy the node. */
2293 new = copy_node (*tp
);
2295 /* Propagate mudflap marked-ness. */
2296 if (flag_mudflap
&& mf_marked_p (*tp
))
2301 /* Now, restore the chain, if appropriate. That will cause
2302 walk_tree to walk into the chain as well. */
2303 if (code
== PARM_DECL
|| code
== TREE_LIST
)
2304 TREE_CHAIN (*tp
) = chain
;
2306 /* For now, we don't update BLOCKs when we make copies. So, we
2307 have to nullify all BIND_EXPRs. */
2308 if (TREE_CODE (*tp
) == BIND_EXPR
)
2309 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
2312 else if (TREE_CODE_CLASS (code
) == tcc_type
)
2314 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
2316 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
2319 gcc_assert (code
!= STATEMENT_LIST
);
2323 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2324 information indicating to what new SAVE_EXPR this one should be mapped,
2325 use that one. Otherwise, create a new node and enter it in ST. */
2328 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
2330 splay_tree st
= (splay_tree
) st_
;
2334 /* See if we already encountered this SAVE_EXPR. */
2335 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2337 /* If we didn't already remap this SAVE_EXPR, do so now. */
2340 t
= copy_node (*tp
);
2342 /* Remember this SAVE_EXPR. */
2343 splay_tree_insert (st
, (splay_tree_key
) *tp
, (splay_tree_value
) t
);
2344 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2345 splay_tree_insert (st
, (splay_tree_key
) t
, (splay_tree_value
) t
);
2349 /* We've already walked into this SAVE_EXPR; don't do it again. */
2351 t
= (tree
) n
->value
;
2354 /* Replace this SAVE_EXPR with the copy. */
2358 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2359 copies the declaration and enters it in the splay_tree in DATA (which is
2360 really an `inline_data *'). */
2363 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2366 inline_data
*id
= (inline_data
*) data
;
2368 /* Don't walk into types. */
2372 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
2374 tree decl
= TREE_OPERAND (*tp
, 0);
2376 /* Copy the decl and remember the copy. */
2377 insert_decl_map (id
, decl
,
2378 copy_decl_for_inlining (decl
, DECL_CONTEXT (decl
),
2379 DECL_CONTEXT (decl
)));
2385 /* Perform any modifications to EXPR required when it is unsaved. Does
2386 not recurse into EXPR's subtrees. */
2389 unsave_expr_1 (tree expr
)
2391 switch (TREE_CODE (expr
))
2394 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2395 It's OK for this to happen if it was part of a subtree that
2396 isn't immediately expanded, such as operand 2 of another
2398 if (TREE_OPERAND (expr
, 1))
2401 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2402 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2410 /* Called via walk_tree when an expression is unsaved. Using the
2411 splay_tree pointed to by ST (which is really a `splay_tree'),
2412 remaps all local declarations to appropriate replacements. */
2415 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
2417 inline_data
*id
= (inline_data
*) data
;
2418 splay_tree st
= id
->decl_map
;
2421 /* Only a local declaration (variable or label). */
2422 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
2423 || TREE_CODE (*tp
) == LABEL_DECL
)
2425 /* Lookup the declaration. */
2426 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2428 /* If it's there, remap it. */
2430 *tp
= (tree
) n
->value
;
2433 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
2434 copy_statement_list (tp
);
2435 else if (TREE_CODE (*tp
) == BIND_EXPR
)
2436 copy_bind_expr (tp
, walk_subtrees
, id
);
2437 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2438 remap_save_expr (tp
, st
, walk_subtrees
);
2441 copy_tree_r (tp
, walk_subtrees
, NULL
);
2443 /* Do whatever unsaving is required. */
2444 unsave_expr_1 (*tp
);
2447 /* Keep iterating. */
2451 /* Copies everything in EXPR and replaces variables, labels
2452 and SAVE_EXPRs local to EXPR. */
2455 unsave_expr_now (tree expr
)
2459 /* There's nothing to do for NULL_TREE. */
2464 memset (&id
, 0, sizeof (id
));
2465 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
2466 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
2467 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2469 /* Walk the tree once to find local labels. */
2470 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
2472 /* Walk the tree again, copying, remapping, and unsaving. */
2473 walk_tree (&expr
, unsave_r
, &id
, NULL
);
2476 splay_tree_delete (id
.decl_map
);
2481 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2484 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
2493 debug_find_tree (tree top
, tree search
)
2495 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
2498 /* Declare the variables created by the inliner. Add all the variables in
2499 VARS to BIND_EXPR. */
2502 declare_inline_vars (tree bind_expr
, tree vars
)
2505 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
2506 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
2508 add_var_to_bind_expr (bind_expr
, vars
);