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"
45 #include "diagnostic.h"
48 /* I'm not real happy about this, but we need to handle gimple and
50 #include "tree-iterator.h"
51 #include "tree-gimple.h"
53 /* 0 if we should not perform inlining.
54 1 if we should expand functions calls inline at the tree level.
55 2 if we should consider *all* functions to be inline
58 int flag_inline_trees
= 0;
62 o In order to make inlining-on-trees work, we pessimized
63 function-local static constants. In particular, they are now
64 always output, even when not addressed. Fix this by treating
65 function-local static constants just like global static
66 constants; the back-end already knows not to output them if they
69 o Provide heuristics to clamp inlining of recursive template
72 /* Data required for function inlining. */
74 typedef struct inline_data
76 /* A stack of the functions we are inlining. For example, if we are
77 compiling `f', which calls `g', which calls `h', and we are
78 inlining the body of `h', the stack will contain, `h', followed
79 by `g', followed by `f'. The first few elements of the stack may
80 contain other functions that we know we should not recurse into,
81 even though they are not directly being inlined. */
83 /* The index of the first element of FNS that really represents an
85 unsigned first_inlined_fn
;
86 /* The label to jump to when a return statement is encountered. If
87 this value is NULL, then return statements will simply be
88 remapped as return statements, rather than as jumps. */
90 /* The VAR_DECL for the return value. */
92 /* The map from local declarations in the inlined function to
93 equivalents in the function into which it is being inlined. */
95 /* Nonzero if we are currently within the cleanup for a
97 int in_target_cleanup_p
;
98 /* We use the same mechanism to build clones that we do to perform
99 inlining. However, there are a few places where we need to
100 distinguish between those two situations. This flag is true if
101 we are cloning, rather than inlining. */
103 /* Similarly for saving function body. */
105 /* Hash table used to prevent walk_tree from visiting the same node
106 umpteen million times. */
108 /* Callgraph node of function we are inlining into. */
109 struct cgraph_node
*node
;
110 /* Callgraph node of currently inlined function. */
111 struct cgraph_node
*current_node
;
112 /* Statement iterator. We need this so we can keep the tree in
113 gimple form when we insert the inlined function. It is not
114 used when we are not dealing with gimple trees. */
115 tree_stmt_iterator tsi
;
120 /* The approximate number of instructions per statement. This number
121 need not be particularly accurate; it is used only to make
122 decisions about when a function is too big to inline. */
123 #define INSNS_PER_STMT (10)
125 static tree
copy_body_r (tree
*, int *, void *);
126 static tree
copy_body (inline_data
*);
127 static tree
expand_call_inline (tree
*, int *, void *);
128 static void expand_calls_inline (tree
*, inline_data
*);
129 static bool inlinable_function_p (tree
);
130 static tree
remap_decl (tree
, inline_data
*);
131 static tree
remap_type (tree
, inline_data
*);
132 static tree
initialize_inlined_parameters (inline_data
*, tree
,
134 static void remap_block (tree
*, inline_data
*);
135 static tree
remap_decls (tree
, inline_data
*);
136 static void copy_bind_expr (tree
*, int *, inline_data
*);
137 static tree
mark_local_for_remap_r (tree
*, int *, void *);
138 static void unsave_expr_1 (tree
);
139 static tree
unsave_r (tree
*, int *, void *);
140 static void declare_inline_vars (tree bind_expr
, tree vars
);
141 static void remap_save_expr (tree
*, void *, int *);
143 /* Insert a tree->tree mapping for ID. Despite the name suggests
144 that the trees should be variables, it is used for more than that. */
147 insert_decl_map (inline_data
*id
, tree key
, tree value
)
149 splay_tree_insert (id
->decl_map
, (splay_tree_key
) key
,
150 (splay_tree_value
) value
);
152 /* Always insert an identity map as well. If we see this same new
153 node again, we won't want to duplicate it a second time. */
155 splay_tree_insert (id
->decl_map
, (splay_tree_key
) value
,
156 (splay_tree_value
) value
);
159 /* Remap DECL during the copying of the BLOCK tree for the function.
160 We are only called to remap local variables in the current function. */
163 remap_decl (tree decl
, inline_data
*id
)
165 splay_tree_node n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
166 tree fn
= VARRAY_TOP_TREE (id
->fns
);
168 /* See if we have remapped this declaration. If we didn't already have an
169 equivalent for this declaration, create one now. */
172 /* Make a copy of the variable or label. */
173 tree t
= copy_decl_for_inlining (decl
, fn
, VARRAY_TREE (id
->fns
, 0));
175 /* Remap types, if necessary. */
176 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
177 if (TREE_CODE (t
) == TYPE_DECL
)
178 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
179 else if (TREE_CODE (t
) == PARM_DECL
)
180 DECL_ARG_TYPE_AS_WRITTEN (t
)
181 = remap_type (DECL_ARG_TYPE_AS_WRITTEN (t
), id
);
183 /* Remap sizes as necessary. */
184 walk_tree (&DECL_SIZE (t
), copy_body_r
, id
, NULL
);
185 walk_tree (&DECL_SIZE_UNIT (t
), copy_body_r
, id
, NULL
);
187 /* If fields, do likewise for offset and qualifier. */
188 if (TREE_CODE (t
) == FIELD_DECL
)
190 walk_tree (&DECL_FIELD_OFFSET (t
), copy_body_r
, id
, NULL
);
191 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
192 walk_tree (&DECL_QUALIFIER (t
), copy_body_r
, id
, NULL
);
196 /* FIXME handle anon aggrs. */
197 if (! DECL_NAME (t
) && TREE_TYPE (t
)
198 && lang_hooks
.tree_inlining
.anon_aggr_type_p (TREE_TYPE (t
)))
200 /* For a VAR_DECL of anonymous type, we must also copy the
201 member VAR_DECLS here and rechain the DECL_ANON_UNION_ELEMS. */
205 for (src
= DECL_ANON_UNION_ELEMS (t
); src
;
206 src
= TREE_CHAIN (src
))
208 tree member
= remap_decl (TREE_VALUE (src
), id
);
210 gcc_assert (!TREE_PURPOSE (src
));
211 members
= tree_cons (NULL
, member
, members
);
213 DECL_ANON_UNION_ELEMS (t
) = nreverse (members
);
217 /* Remember it, so that if we encounter this local entity
218 again we can reuse this copy. */
219 insert_decl_map (id
, decl
, t
);
223 return unshare_expr ((tree
) n
->value
);
227 remap_type (tree type
, inline_data
*id
)
229 splay_tree_node node
;
235 /* See if we have remapped this type. */
236 node
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) type
);
238 return (tree
) node
->value
;
240 /* The type only needs remapping if it's variably modified by a variable
241 in the function we are inlining. */
242 if (! variably_modified_type_p (type
, VARRAY_TOP_TREE (id
->fns
)))
244 insert_decl_map (id
, type
, type
);
248 /* We do need a copy. build and register it now. If this is a pointer or
249 reference type, remap the designated type and make a new pointer or
251 if (TREE_CODE (type
) == POINTER_TYPE
)
253 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
255 TYPE_REF_CAN_ALIAS_ALL (type
));
256 insert_decl_map (id
, type
, new);
259 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
261 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
263 TYPE_REF_CAN_ALIAS_ALL (type
));
264 insert_decl_map (id
, type
, new);
268 new = copy_node (type
);
270 insert_decl_map (id
, type
, new);
272 /* This is a new type, not a copy of an old type. Need to reassociate
273 variants. We can handle everything except the main variant lazily. */
274 t
= TYPE_MAIN_VARIANT (type
);
277 t
= remap_type (t
, id
);
278 TYPE_MAIN_VARIANT (new) = t
;
279 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t
);
280 TYPE_NEXT_VARIANT (t
) = new;
284 TYPE_MAIN_VARIANT (new) = new;
285 TYPE_NEXT_VARIANT (new) = NULL
;
288 /* Lazily create pointer and reference types. */
289 TYPE_POINTER_TO (new) = NULL
;
290 TYPE_REFERENCE_TO (new) = NULL
;
292 switch (TREE_CODE (new))
299 t
= TYPE_MIN_VALUE (new);
300 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
301 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r
, id
, NULL
);
303 t
= TYPE_MAX_VALUE (new);
304 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
305 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r
, id
, NULL
);
309 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
310 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r
, id
, NULL
);
314 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
315 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id
);
320 case QUAL_UNION_TYPE
:
321 walk_tree (&TYPE_FIELDS (new), copy_body_r
, id
, NULL
);
327 /* Shouldn't have been thought variable sized. */
331 walk_tree (&TYPE_SIZE (new), copy_body_r
, id
, NULL
);
332 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r
, id
, NULL
);
338 remap_decls (tree decls
, inline_data
*id
)
341 tree new_decls
= NULL_TREE
;
343 /* Remap its variables. */
344 for (old_var
= decls
; old_var
; old_var
= TREE_CHAIN (old_var
))
348 /* Remap the variable. */
349 new_var
= remap_decl (old_var
, id
);
351 /* If we didn't remap this variable, so we can't mess with its
352 TREE_CHAIN. If we remapped this variable to the return slot, it's
353 already declared somewhere else, so don't declare it here. */
354 if (!new_var
|| new_var
== id
->retvar
)
358 gcc_assert (DECL_P (new_var
));
359 TREE_CHAIN (new_var
) = new_decls
;
364 return nreverse (new_decls
);
367 /* Copy the BLOCK to contain remapped versions of the variables
368 therein. And hook the new block into the block-tree. */
371 remap_block (tree
*block
, inline_data
*id
)
377 /* Make the new block. */
379 new_block
= make_node (BLOCK
);
380 TREE_USED (new_block
) = TREE_USED (old_block
);
381 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
384 /* Remap its variables. */
385 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
), id
);
387 fn
= VARRAY_TREE (id
->fns
, 0);
389 /* FIXME! It shouldn't be so hard to manage blocks. Rebuilding them in
390 rest_of_compilation is a good start. */
392 /* We're building a clone; DECL_INITIAL is still
393 error_mark_node, and current_binding_level is the parm
395 lang_hooks
.decls
.insert_block (new_block
);
398 /* Attach this new block after the DECL_INITIAL block for the
399 function into which this block is being inlined. In
400 rest_of_compilation we will straighten out the BLOCK tree. */
402 if (DECL_INITIAL (fn
))
403 first_block
= &BLOCK_CHAIN (DECL_INITIAL (fn
));
405 first_block
= &DECL_INITIAL (fn
);
406 BLOCK_CHAIN (new_block
) = *first_block
;
407 *first_block
= new_block
;
410 /* Remember the remapped block. */
411 insert_decl_map (id
, old_block
, new_block
);
415 copy_statement_list (tree
*tp
)
417 tree_stmt_iterator oi
, ni
;
420 new = alloc_stmt_list ();
421 ni
= tsi_start (new);
422 oi
= tsi_start (*tp
);
425 for (; !tsi_end_p (oi
); tsi_next (&oi
))
426 tsi_link_after (&ni
, tsi_stmt (oi
), TSI_NEW_STMT
);
430 copy_bind_expr (tree
*tp
, int *walk_subtrees
, inline_data
*id
)
432 tree block
= BIND_EXPR_BLOCK (*tp
);
433 /* Copy (and replace) the statement. */
434 copy_tree_r (tp
, walk_subtrees
, NULL
);
437 remap_block (&block
, id
);
438 BIND_EXPR_BLOCK (*tp
) = block
;
441 if (BIND_EXPR_VARS (*tp
))
442 /* This will remap a lot of the same decls again, but this should be
444 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), id
);
447 /* Called from copy_body via walk_tree. DATA is really an `inline_data *'. */
450 copy_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
452 inline_data
*id
= (inline_data
*) data
;
453 tree fn
= VARRAY_TOP_TREE (id
->fns
);
456 /* All automatic variables should have a DECL_CONTEXT indicating
457 what function they come from. */
458 if ((TREE_CODE (*tp
) == VAR_DECL
|| TREE_CODE (*tp
) == LABEL_DECL
)
459 && DECL_NAMESPACE_SCOPE_P (*tp
))
460 gcc_assert (DECL_EXTERNAL (*tp
) || TREE_STATIC (*tp
));
463 /* If this is a RETURN_EXPR, change it into a MODIFY_EXPR and a
464 GOTO_EXPR with the RET_LABEL as its target. */
465 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->ret_label
)
467 tree return_stmt
= *tp
;
470 /* Build the GOTO_EXPR. */
471 tree assignment
= TREE_OPERAND (return_stmt
, 0);
472 goto_stmt
= build1 (GOTO_EXPR
, void_type_node
, id
->ret_label
);
473 TREE_USED (id
->ret_label
) = 1;
475 /* If we're returning something, just turn that into an
476 assignment into the equivalent of the original
480 /* Do not create a statement containing a naked RESULT_DECL. */
481 if (TREE_CODE (assignment
) == RESULT_DECL
)
482 gimplify_stmt (&assignment
);
484 *tp
= build (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
485 append_to_statement_list (assignment
, &BIND_EXPR_BODY (*tp
));
486 append_to_statement_list (goto_stmt
, &BIND_EXPR_BODY (*tp
));
488 /* If we're not returning anything just do the jump. */
492 /* Local variables and labels need to be replaced by equivalent
493 variables. We don't want to copy static variables; there's only
494 one of those, no matter how many times we inline the containing
495 function. Similarly for globals from an outer function. */
496 else if (lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
500 /* Remap the declaration. */
501 new_decl
= remap_decl (*tp
, id
);
502 gcc_assert (new_decl
);
503 /* Replace this variable with the copy. */
504 STRIP_TYPE_NOPS (new_decl
);
507 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
508 copy_statement_list (tp
);
509 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
510 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
511 else if (TREE_CODE (*tp
) == BIND_EXPR
)
512 copy_bind_expr (tp
, walk_subtrees
, id
);
513 /* Types may need remapping as well. */
514 else if (TYPE_P (*tp
))
515 *tp
= remap_type (*tp
, id
);
517 /* If this is a constant, we have to copy the node iff the type will be
518 remapped. copy_tree_r will not copy a constant. */
519 else if (TREE_CODE_CLASS (TREE_CODE (*tp
)) == tcc_constant
)
521 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
523 if (new_type
== TREE_TYPE (*tp
))
526 else if (TREE_CODE (*tp
) == INTEGER_CST
)
527 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
528 TREE_INT_CST_HIGH (*tp
));
531 *tp
= copy_node (*tp
);
532 TREE_TYPE (*tp
) = new_type
;
536 /* Otherwise, just copy the node. Note that copy_tree_r already
537 knows not to copy VAR_DECLs, etc., so this is safe. */
542 if (TREE_CODE (*tp
) == MODIFY_EXPR
543 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
544 && (lang_hooks
.tree_inlining
.auto_var_in_fn_p
545 (TREE_OPERAND (*tp
, 0), fn
)))
547 /* Some assignments VAR = VAR; don't generate any rtl code
548 and thus don't count as variable modification. Avoid
549 keeping bogosities like 0 = 0. */
550 tree decl
= TREE_OPERAND (*tp
, 0), value
;
553 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
556 value
= (tree
) n
->value
;
557 STRIP_TYPE_NOPS (value
);
558 if (TREE_CONSTANT (value
) || TREE_READONLY_DECL_P (value
))
560 *tp
= build_empty_stmt ();
561 return copy_body_r (tp
, walk_subtrees
, data
);
565 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
567 /* Get rid of *& from inline substitutions that can happen when a
568 pointer argument is an ADDR_EXPR. */
569 tree decl
= TREE_OPERAND (*tp
, 0), value
;
572 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
575 value
= (tree
) n
->value
;
577 if (TREE_CODE (value
) == ADDR_EXPR
578 && (lang_hooks
.types_compatible_p
579 (TREE_TYPE (*tp
), TREE_TYPE (TREE_OPERAND (value
, 0)))))
581 *tp
= TREE_OPERAND (value
, 0);
582 return copy_body_r (tp
, walk_subtrees
, data
);
587 copy_tree_r (tp
, walk_subtrees
, NULL
);
589 if (TREE_CODE (*tp
) == CALL_EXPR
&& id
->node
&& get_callee_fndecl (*tp
))
593 struct cgraph_node
*node
;
594 struct cgraph_edge
*edge
;
596 for (node
= id
->node
->next_clone
; node
; node
= node
->next_clone
)
598 edge
= cgraph_edge (node
, old_node
);
600 edge
->call_expr
= *tp
;
605 struct cgraph_edge
*edge
606 = cgraph_edge (id
->current_node
, old_node
);
609 cgraph_clone_edge (edge
, id
->node
, *tp
);
613 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
615 /* The copied TARGET_EXPR has never been expanded, even if the
616 original node was expanded already. */
617 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
619 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
620 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
623 /* Variable substitution need not be simple. In particular, the
624 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
625 and friends are up-to-date. */
626 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
628 walk_tree (&TREE_OPERAND (*tp
, 0), copy_body_r
, id
, NULL
);
629 recompute_tree_invarant_for_addr_expr (*tp
);
634 /* Keep iterating. */
638 /* Make a copy of the body of FN so that it can be inserted inline in
642 copy_body (inline_data
*id
)
645 tree fndecl
= VARRAY_TOP_TREE (id
->fns
);
647 if (fndecl
== current_function_decl
649 body
= cfun
->saved_tree
;
651 body
= DECL_SAVED_TREE (fndecl
);
652 walk_tree (&body
, copy_body_r
, id
, NULL
);
657 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
658 defined in function FN, or of a data member thereof. */
661 self_inlining_addr_expr (tree value
, tree fn
)
665 if (TREE_CODE (value
) != ADDR_EXPR
)
668 var
= get_base_address (TREE_OPERAND (value
, 0));
670 return var
&& lang_hooks
.tree_inlining
.auto_var_in_fn_p (var
, fn
);
674 setup_one_parameter (inline_data
*id
, tree p
, tree value
, tree fn
,
675 tree
*init_stmts
, tree
*vars
, bool *gimplify_init_stmts_p
)
680 /* If the parameter is never assigned to, we may not need to
681 create a new variable here at all. Instead, we may be able
682 to just use the argument value. */
683 if (TREE_READONLY (p
)
684 && !TREE_ADDRESSABLE (p
)
685 && value
&& !TREE_SIDE_EFFECTS (value
))
687 /* We can't risk substituting complex expressions. They
688 might contain variables that will be assigned to later.
689 Theoretically, we could check the expression to see if
690 all of the variables that determine its value are
691 read-only, but we don't bother. */
692 /* We may produce non-gimple trees by adding NOPs or introduce
693 invalid sharing when operand is not really constant.
694 It is not big deal to prohibit constant propagation here as
695 we will constant propagate in DOM1 pass anyway. */
696 if (is_gimple_min_invariant (value
)
697 && lang_hooks
.types_compatible_p (TREE_TYPE (value
), TREE_TYPE (p
))
698 /* We have to be very careful about ADDR_EXPR. Make sure
699 the base variable isn't a local variable of the inlined
700 function, e.g., when doing recursive inlining, direct or
701 mutually-recursive or whatever, which is why we don't
702 just test whether fn == current_function_decl. */
703 && ! self_inlining_addr_expr (value
, fn
))
705 insert_decl_map (id
, p
, value
);
710 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
711 here since the type of this decl must be visible to the calling
713 var
= copy_decl_for_inlining (p
, fn
, VARRAY_TREE (id
->fns
, 0));
715 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
716 that way, when the PARM_DECL is encountered, it will be
717 automatically replaced by the VAR_DECL. */
718 insert_decl_map (id
, p
, var
);
720 /* Declare this new variable. */
721 TREE_CHAIN (var
) = *vars
;
724 /* Make gimplifier happy about this variable. */
725 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
727 /* Even if P was TREE_READONLY, the new VAR should not be.
728 In the original code, we would have constructed a
729 temporary, and then the function body would have never
730 changed the value of P. However, now, we will be
731 constructing VAR directly. The constructor body may
732 change its value multiple times as it is being
733 constructed. Therefore, it must not be TREE_READONLY;
734 the back-end assumes that TREE_READONLY variable is
735 assigned to only once. */
736 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
737 TREE_READONLY (var
) = 0;
739 /* Initialize this VAR_DECL from the equivalent argument. Convert
740 the argument to the proper type in case it was promoted. */
743 tree rhs
= fold_convert (TREE_TYPE (var
), value
);
745 if (rhs
== error_mark_node
)
748 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
749 keep our trees in gimple form. */
750 init_stmt
= build (MODIFY_EXPR
, TREE_TYPE (var
), var
, rhs
);
751 append_to_statement_list (init_stmt
, init_stmts
);
753 /* If we did not create a gimple value and we did not create a gimple
754 cast of a gimple value, then we will need to gimplify INIT_STMTS
755 at the end. Note that is_gimple_cast only checks the outer
756 tree code, not its operand. Thus the explicit check that it's
757 operand is a gimple value. */
758 if (!is_gimple_val (rhs
)
759 && (!is_gimple_cast (rhs
)
760 || !is_gimple_val (TREE_OPERAND (rhs
, 0))))
761 *gimplify_init_stmts_p
= true;
765 /* Generate code to initialize the parameters of the function at the
766 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
769 initialize_inlined_parameters (inline_data
*id
, tree args
, tree static_chain
,
770 tree fn
, tree bind_expr
)
772 tree init_stmts
= NULL_TREE
;
776 tree vars
= NULL_TREE
;
777 bool gimplify_init_stmts_p
= false;
780 /* Figure out what the parameters are. */
781 parms
= DECL_ARGUMENTS (fn
);
782 if (fn
== current_function_decl
)
783 parms
= cfun
->saved_args
;
785 /* Loop through the parameter declarations, replacing each with an
786 equivalent VAR_DECL, appropriately initialized. */
787 for (p
= parms
, a
= args
; p
;
788 a
= a
? TREE_CHAIN (a
) : a
, p
= TREE_CHAIN (p
))
794 /* Find the initializer. */
795 value
= lang_hooks
.tree_inlining
.convert_parm_for_inlining
796 (p
, a
? TREE_VALUE (a
) : NULL_TREE
, fn
, argnum
);
798 setup_one_parameter (id
, p
, value
, fn
, &init_stmts
, &vars
,
799 &gimplify_init_stmts_p
);
802 /* Evaluate trailing arguments. */
803 for (; a
; a
= TREE_CHAIN (a
))
805 tree value
= TREE_VALUE (a
);
806 append_to_statement_list (value
, &init_stmts
);
809 /* Initialize the static chain. */
810 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
813 /* No static chain? Seems like a bug in tree-nested.c. */
814 gcc_assert (static_chain
);
816 setup_one_parameter (id
, p
, static_chain
, fn
, &init_stmts
, &vars
,
817 &gimplify_init_stmts_p
);
820 if (gimplify_init_stmts_p
)
821 gimplify_body (&init_stmts
, current_function_decl
, false);
823 declare_inline_vars (bind_expr
, vars
);
827 /* Declare a return variable to replace the RESULT_DECL for the function we
828 are calling. RETURN_SLOT_ADDR, if non-null, was a fake parameter that
829 took the address of the result. MODIFY_DEST, if non-null, was the LHS of
830 the MODIFY_EXPR to which this call is the RHS.
832 The return value is a (possibly null) value that is the result of the
833 function as seen by the callee. *USE_P is a (possibly null) value that
834 holds the result as seen by the caller. */
837 declare_return_variable (inline_data
*id
, tree return_slot_addr
,
838 tree modify_dest
, tree
*use_p
)
840 tree callee
= VARRAY_TOP_TREE (id
->fns
);
841 tree caller
= VARRAY_TREE (id
->fns
, 0);
842 tree result
= DECL_RESULT (callee
);
843 tree callee_type
= TREE_TYPE (result
);
844 tree caller_type
= TREE_TYPE (TREE_TYPE (callee
));
847 /* We don't need to do anything for functions that don't return
849 if (!result
|| VOID_TYPE_P (callee_type
))
855 /* If there was a return slot, then the return value is the
856 dereferenced address of that object. */
857 if (return_slot_addr
)
859 /* The front end shouldn't have used both return_slot_addr and
860 a modify expression. */
861 gcc_assert (!modify_dest
);
862 if (DECL_BY_REFERENCE (result
))
863 var
= return_slot_addr
;
865 var
= build_fold_indirect_ref (return_slot_addr
);
870 /* All types requiring non-trivial constructors should have been handled. */
871 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
873 /* Attempt to avoid creating a new temporary variable. */
878 /* We can't use MODIFY_DEST if there's type promotion involved. */
879 if (!lang_hooks
.types_compatible_p (caller_type
, callee_type
))
882 /* ??? If we're assigning to a variable sized type, then we must
883 reuse the destination variable, because we've no good way to
884 create variable sized temporaries at this point. */
885 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
888 /* If the callee cannot possibly modify MODIFY_DEST, then we can
889 reuse it as the result of the call directly. Don't do this if
890 it would promote MODIFY_DEST to addressable. */
891 else if (!TREE_STATIC (modify_dest
)
892 && !TREE_ADDRESSABLE (modify_dest
)
893 && !TREE_ADDRESSABLE (result
))
904 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
906 var
= copy_decl_for_inlining (result
, callee
, caller
);
907 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
908 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
909 = tree_cons (NULL_TREE
, var
,
910 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
);
912 /* Do not have the rest of GCC warn about this variable as it should
913 not be visible to the user. */
914 TREE_NO_WARNING (var
) = 1;
916 /* Build the use expr. If the return type of the function was
917 promoted, convert it back to the expected type. */
919 if (!lang_hooks
.types_compatible_p (TREE_TYPE (var
), caller_type
))
920 use
= fold_convert (caller_type
, var
);
923 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
924 way, when the RESULT_DECL is encountered, it will be
925 automatically replaced by the VAR_DECL. */
926 insert_decl_map (id
, result
, var
);
928 /* Remember this so we can ignore it in remap_decls. */
935 /* Returns nonzero if a function can be inlined as a tree. */
938 tree_inlinable_function_p (tree fn
)
940 return inlinable_function_p (fn
);
943 static const char *inline_forbidden_reason
;
946 inline_forbidden_p_1 (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
950 tree fn
= (tree
) fnp
;
953 switch (TREE_CODE (node
))
956 /* Refuse to inline alloca call unless user explicitly forced so as
957 this may change program's memory overhead drastically when the
958 function using alloca is called in loop. In GCC present in
959 SPEC2000 inlining into schedule_block cause it to require 2GB of
960 RAM instead of 256MB. */
961 if (alloca_call_p (node
)
962 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
964 inline_forbidden_reason
965 = N_("%Jfunction %qF can never be inlined because it uses "
966 "alloca (override using the always_inline attribute)");
969 t
= get_callee_fndecl (node
);
973 /* We cannot inline functions that call setjmp. */
974 if (setjmp_call_p (t
))
976 inline_forbidden_reason
977 = N_("%Jfunction %qF can never be inlined because it uses setjmp");
981 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
982 switch (DECL_FUNCTION_CODE (t
))
984 /* We cannot inline functions that take a variable number of
986 case BUILT_IN_VA_START
:
987 case BUILT_IN_STDARG_START
:
988 case BUILT_IN_NEXT_ARG
:
989 case BUILT_IN_VA_END
:
990 inline_forbidden_reason
991 = N_("%Jfunction %qF can never be inlined because it "
992 "uses variable argument lists");
995 case BUILT_IN_LONGJMP
:
996 /* We can't inline functions that call __builtin_longjmp at
997 all. The non-local goto machinery really requires the
998 destination be in a different function. If we allow the
999 function calling __builtin_longjmp to be inlined into the
1000 function calling __builtin_setjmp, Things will Go Awry. */
1001 inline_forbidden_reason
1002 = N_("%Jfunction %qF can never be inlined because "
1003 "it uses setjmp-longjmp exception handling");
1006 case BUILT_IN_NONLOCAL_GOTO
:
1008 inline_forbidden_reason
1009 = N_("%Jfunction %qF can never be inlined because "
1010 "it uses non-local goto");
1019 t
= TREE_OPERAND (node
, 0);
1021 /* We will not inline a function which uses computed goto. The
1022 addresses of its local labels, which may be tucked into
1023 global storage, are of course not constant across
1024 instantiations, which causes unexpected behavior. */
1025 if (TREE_CODE (t
) != LABEL_DECL
)
1027 inline_forbidden_reason
1028 = N_("%Jfunction %qF can never be inlined "
1029 "because it contains a computed goto");
1035 t
= TREE_OPERAND (node
, 0);
1036 if (DECL_NONLOCAL (t
))
1038 /* We cannot inline a function that receives a non-local goto
1039 because we cannot remap the destination label used in the
1040 function that is performing the non-local goto. */
1041 inline_forbidden_reason
1042 = N_("%Jfunction %qF can never be inlined "
1043 "because it receives a non-local goto");
1050 /* We cannot inline a function of the form
1052 void F (int i) { struct S { int ar[i]; } s; }
1054 Attempting to do so produces a catch-22.
1055 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1056 UNION_TYPE nodes, then it goes into infinite recursion on a
1057 structure containing a pointer to its own type. If it doesn't,
1058 then the type node for S doesn't get adjusted properly when
1059 F is inlined, and we abort in find_function_data.
1061 ??? This is likely no longer true, but it's too late in the 4.0
1062 cycle to try to find out. This should be checked for 4.1. */
1063 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
1064 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
1066 inline_forbidden_reason
1067 = N_("%Jfunction %qF can never be inlined "
1068 "because it uses variable sized variables");
1079 /* Return subexpression representing possible alloca call, if any. */
1081 inline_forbidden_p (tree fndecl
)
1083 location_t saved_loc
= input_location
;
1084 tree ret
= walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl
),
1085 inline_forbidden_p_1
, fndecl
);
1087 input_location
= saved_loc
;
1091 /* Returns nonzero if FN is a function that does not have any
1092 fundamental inline blocking properties. */
1095 inlinable_function_p (tree fn
)
1097 bool inlinable
= true;
1099 /* If we've already decided this function shouldn't be inlined,
1100 there's no need to check again. */
1101 if (DECL_UNINLINABLE (fn
))
1104 /* See if there is any language-specific reason it cannot be
1105 inlined. (It is important that this hook be called early because
1106 in C++ it may result in template instantiation.)
1107 If the function is not inlinable for language-specific reasons,
1108 it is left up to the langhook to explain why. */
1109 inlinable
= !lang_hooks
.tree_inlining
.cannot_inline_tree_fn (&fn
);
1111 /* If we don't have the function body available, we can't inline it.
1112 However, this should not be recorded since we also get here for
1113 forward declared inline functions. Therefore, return at once. */
1114 if (!DECL_SAVED_TREE (fn
))
1117 /* If we're not inlining at all, then we cannot inline this function. */
1118 else if (!flag_inline_trees
)
1121 /* Only try to inline functions if DECL_INLINE is set. This should be
1122 true for all functions declared `inline', and for all other functions
1123 as well with -finline-functions.
1125 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1126 it's the front-end that must set DECL_INLINE in this case, because
1127 dwarf2out loses if a function that does not have DECL_INLINE set is
1128 inlined anyway. That is why we have both DECL_INLINE and
1129 DECL_DECLARED_INLINE_P. */
1130 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1131 here should be redundant. */
1132 else if (!DECL_INLINE (fn
) && !flag_unit_at_a_time
)
1135 else if (inline_forbidden_p (fn
))
1137 /* See if we should warn about uninlinable functions. Previously,
1138 some of these warnings would be issued while trying to expand
1139 the function inline, but that would cause multiple warnings
1140 about functions that would for example call alloca. But since
1141 this a property of the function, just one warning is enough.
1142 As a bonus we can now give more details about the reason why a
1143 function is not inlinable.
1144 We only warn for functions declared `inline' by the user. */
1145 bool do_warning
= (warn_inline
1147 && DECL_DECLARED_INLINE_P (fn
)
1148 && !DECL_IN_SYSTEM_HEADER (fn
));
1150 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1151 sorry (inline_forbidden_reason
, fn
, fn
);
1152 else if (do_warning
)
1153 warning (inline_forbidden_reason
, fn
, fn
);
1158 /* Squirrel away the result so that we don't have to check again. */
1159 DECL_UNINLINABLE (fn
) = !inlinable
;
1164 /* Used by estimate_num_insns. Estimate number of instructions seen
1165 by given statement. */
1168 estimate_num_insns_1 (tree
*tp
, int *walk_subtrees
, void *data
)
1173 if (IS_TYPE_OR_DECL_P (x
))
1178 /* Assume that constants and references counts nothing. These should
1179 be majorized by amount of operations among them we count later
1180 and are common target of CSE and similar optimizations. */
1181 else if (CONSTANT_CLASS_P (x
) || REFERENCE_CLASS_P (x
))
1184 switch (TREE_CODE (x
))
1186 /* Containers have no cost. */
1193 case ALIGN_INDIRECT_REF
:
1194 case MISALIGNED_INDIRECT_REF
:
1196 case ARRAY_RANGE_REF
:
1198 case EXC_PTR_EXPR
: /* ??? */
1199 case FILTER_EXPR
: /* ??? */
1202 case WITH_CLEANUP_EXPR
:
1204 case VIEW_CONVERT_EXPR
:
1209 case CASE_LABEL_EXPR
:
1212 case EH_FILTER_EXPR
:
1213 case STATEMENT_LIST
:
1215 case NON_LVALUE_EXPR
:
1218 case TRY_CATCH_EXPR
:
1219 case TRY_FINALLY_EXPR
:
1226 case WITH_SIZE_EXPR
:
1229 /* We don't account constants for now. Assume that the cost is amortized
1230 by operations that do use them. We may re-consider this decision once
1231 we are able to optimize the tree before estimating it's size and break
1232 out static initializers. */
1233 case IDENTIFIER_NODE
:
1242 /* Recognize assignments of large structures and constructors of
1246 x
= TREE_OPERAND (x
, 0);
1253 size
= int_size_in_bytes (TREE_TYPE (x
));
1255 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO
)
1258 *count
+= ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
1262 /* Assign cost of 1 to usual operations.
1263 ??? We may consider mapping RTL costs to this. */
1270 case FIX_TRUNC_EXPR
:
1272 case FIX_FLOOR_EXPR
:
1273 case FIX_ROUND_EXPR
:
1291 case TRUTH_ANDIF_EXPR
:
1292 case TRUTH_ORIF_EXPR
:
1293 case TRUTH_AND_EXPR
:
1295 case TRUTH_XOR_EXPR
:
1296 case TRUTH_NOT_EXPR
:
1305 case UNORDERED_EXPR
:
1318 case PREDECREMENT_EXPR
:
1319 case PREINCREMENT_EXPR
:
1320 case POSTDECREMENT_EXPR
:
1321 case POSTINCREMENT_EXPR
:
1327 case REALIGN_LOAD_EXPR
:
1333 /* Few special cases of expensive operations. This is useful
1334 to avoid inlining on functions having too many of these. */
1335 case TRUNC_DIV_EXPR
:
1337 case FLOOR_DIV_EXPR
:
1338 case ROUND_DIV_EXPR
:
1339 case EXACT_DIV_EXPR
:
1340 case TRUNC_MOD_EXPR
:
1342 case FLOOR_MOD_EXPR
:
1343 case ROUND_MOD_EXPR
:
1349 tree decl
= get_callee_fndecl (x
);
1351 if (decl
&& DECL_BUILT_IN (decl
))
1352 switch (DECL_FUNCTION_CODE (decl
))
1354 case BUILT_IN_CONSTANT_P
:
1357 case BUILT_IN_EXPECT
:
1366 /* Abort here se we know we don't miss any nodes. */
1372 /* Estimate number of instructions that will be created by expanding EXPR. */
1375 estimate_num_insns (tree expr
)
1378 walk_tree_without_duplicates (&expr
, estimate_num_insns_1
, &num
);
1382 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1385 expand_call_inline (tree
*tp
, int *walk_subtrees
, void *data
)
1398 tree return_slot_addr
;
1400 location_t saved_location
;
1401 struct cgraph_edge
*edge
;
1404 /* See what we've got. */
1405 id
= (inline_data
*) data
;
1408 /* Set input_location here so we get the right instantiation context
1409 if we call instantiate_decl from inlinable_function_p. */
1410 saved_location
= input_location
;
1411 if (EXPR_HAS_LOCATION (t
))
1412 input_location
= EXPR_LOCATION (t
);
1414 /* Recurse, but letting recursive invocations know that we are
1415 inside the body of a TARGET_EXPR. */
1416 if (TREE_CODE (*tp
) == TARGET_EXPR
)
1419 int i
, len
= TREE_CODE_LENGTH (TARGET_EXPR
);
1421 /* We're walking our own subtrees. */
1424 /* Actually walk over them. This loop is the body of
1425 walk_trees, omitting the case where the TARGET_EXPR
1426 itself is handled. */
1427 for (i
= 0; i
< len
; ++i
)
1430 ++id
->in_target_cleanup_p
;
1431 walk_tree (&TREE_OPERAND (*tp
, i
), expand_call_inline
, data
,
1434 --id
->in_target_cleanup_p
;
1442 /* Because types were not copied in copy_body, CALL_EXPRs beneath
1443 them should not be expanded. This can happen if the type is a
1444 dynamic array type, for example. */
1447 /* From here on, we're only interested in CALL_EXPRs. */
1448 if (TREE_CODE (t
) != CALL_EXPR
)
1451 /* First, see if we can figure out what function is being called.
1452 If we cannot, then there is no hope of inlining the function. */
1453 fn
= get_callee_fndecl (t
);
1457 /* Turn forward declarations into real ones. */
1458 fn
= cgraph_node (fn
)->decl
;
1460 /* If fn is a declaration of a function in a nested scope that was
1461 globally declared inline, we don't set its DECL_INITIAL.
1462 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1463 C++ front-end uses it for cdtors to refer to their internal
1464 declarations, that are not real functions. Fortunately those
1465 don't have trees to be saved, so we can tell by checking their
1467 if (! DECL_INITIAL (fn
)
1468 && DECL_ABSTRACT_ORIGIN (fn
)
1469 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn
)))
1470 fn
= DECL_ABSTRACT_ORIGIN (fn
);
1472 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1473 Kill this check once this is fixed. */
1474 if (!id
->current_node
->analyzed
)
1477 edge
= cgraph_edge (id
->current_node
, t
);
1479 /* Constant propagation on argument done during previous inlining
1480 may create new direct call. Produce an edge for it. */
1483 struct cgraph_node
*dest
= cgraph_node (fn
);
1485 /* We have missing edge in the callgraph. This can happen in one case
1486 where previous inlining turned indirect call into direct call by
1487 constant propagating arguments. In all other cases we hit a bug
1488 (incorrect node sharing is most common reason for missing edges. */
1489 gcc_assert (dest
->needed
|| !flag_unit_at_a_time
);
1490 cgraph_create_edge (id
->node
, dest
, t
)->inline_failed
1491 = N_("originally indirect function call not considered for inlining");
1495 /* Don't try to inline functions that are not well-suited to
1497 if (!cgraph_inline_p (edge
, &reason
))
1499 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1501 sorry ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1502 sorry ("called from here");
1504 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
1505 && !DECL_IN_SYSTEM_HEADER (fn
)
1507 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
)))
1509 warning ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1510 warning ("called from here");
1515 #ifdef ENABLE_CHECKING
1516 if (edge
->callee
->decl
!= id
->node
->decl
)
1517 verify_cgraph_node (edge
->callee
);
1520 if (! lang_hooks
.tree_inlining
.start_inlining (fn
))
1523 /* Build a block containing code to initialize the arguments, the
1524 actual inline expansion of the body, and a label for the return
1525 statements within the function to jump to. The type of the
1526 statement expression is the return type of the function call. */
1528 expr
= build (BIND_EXPR
, void_type_node
, NULL_TREE
,
1529 stmt
, make_node (BLOCK
));
1530 BLOCK_ABSTRACT_ORIGIN (BIND_EXPR_BLOCK (expr
)) = fn
;
1532 /* Local declarations will be replaced by their equivalents in this
1535 id
->decl_map
= splay_tree_new (splay_tree_compare_pointers
,
1538 /* Initialize the parameters. */
1539 args
= TREE_OPERAND (t
, 1);
1540 return_slot_addr
= NULL_TREE
;
1541 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (t
))
1543 return_slot_addr
= TREE_VALUE (args
);
1544 args
= TREE_CHAIN (args
);
1545 TREE_TYPE (expr
) = void_type_node
;
1548 arg_inits
= initialize_inlined_parameters (id
, args
, TREE_OPERAND (t
, 2),
1552 /* Expand any inlined calls in the initializers. Do this before we
1553 push FN on the stack of functions we are inlining; we want to
1554 inline calls to FN that appear in the initializers for the
1557 Note we need to save and restore the saved tree statement iterator
1558 to avoid having it clobbered by expand_calls_inline. */
1559 tree_stmt_iterator save_tsi
;
1562 expand_calls_inline (&arg_inits
, id
);
1565 /* And add them to the tree. */
1566 append_to_statement_list (arg_inits
, &BIND_EXPR_BODY (expr
));
1569 /* Record the function we are about to inline so that we can avoid
1570 recursing into it. */
1571 VARRAY_PUSH_TREE (id
->fns
, fn
);
1573 /* Return statements in the function body will be replaced by jumps
1574 to the RET_LABEL. */
1575 id
->ret_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
1576 DECL_ARTIFICIAL (id
->ret_label
) = 1;
1577 DECL_IGNORED_P (id
->ret_label
) = 1;
1578 DECL_CONTEXT (id
->ret_label
) = VARRAY_TREE (id
->fns
, 0);
1579 insert_decl_map (id
, id
->ret_label
, id
->ret_label
);
1581 gcc_assert (DECL_INITIAL (fn
));
1582 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
1584 /* Find the lhs to which the result of this call is assigned. */
1585 modify_dest
= tsi_stmt (id
->tsi
);
1586 if (TREE_CODE (modify_dest
) == MODIFY_EXPR
)
1588 modify_dest
= TREE_OPERAND (modify_dest
, 0);
1590 /* The function which we are inlining might not return a value,
1591 in which case we should issue a warning that the function
1592 does not return a value. In that case the optimizers will
1593 see that the variable to which the value is assigned was not
1594 initialized. We do not want to issue a warning about that
1595 uninitialized variable. */
1596 if (DECL_P (modify_dest
))
1597 TREE_NO_WARNING (modify_dest
) = 1;
1602 /* Declare the return variable for the function. */
1603 decl
= declare_return_variable (id
, return_slot_addr
,
1604 modify_dest
, &use_retvar
);
1606 /* After we've initialized the parameters, we insert the body of the
1609 struct cgraph_node
*old_node
= id
->current_node
;
1611 id
->current_node
= edge
->callee
;
1612 append_to_statement_list (copy_body (id
), &BIND_EXPR_BODY (expr
));
1613 id
->current_node
= old_node
;
1615 inlined_body
= &BIND_EXPR_BODY (expr
);
1617 /* After the body of the function comes the RET_LABEL. This must come
1618 before we evaluate the returned value below, because that evaluation
1619 may cause RTL to be generated. */
1620 if (TREE_USED (id
->ret_label
))
1622 tree label
= build1 (LABEL_EXPR
, void_type_node
, id
->ret_label
);
1623 append_to_statement_list (label
, &BIND_EXPR_BODY (expr
));
1627 splay_tree_delete (id
->decl_map
);
1630 /* Although, from the semantic viewpoint, the new expression has
1631 side-effects only if the old one did, it is not possible, from
1632 the technical viewpoint, to evaluate the body of a function
1633 multiple times without serious havoc. */
1634 TREE_SIDE_EFFECTS (expr
) = 1;
1636 tsi_link_before (&id
->tsi
, expr
, TSI_SAME_STMT
);
1638 /* If the inlined function returns a result that we care about,
1639 then we're going to need to splice in a MODIFY_EXPR. Otherwise
1640 the call was a standalone statement and we can just replace it
1641 with the BIND_EXPR inline representation of the called function. */
1642 if (!use_retvar
|| !modify_dest
)
1643 *tsi_stmt_ptr (id
->tsi
) = build_empty_stmt ();
1647 /* When we gimplify a function call, we may clear TREE_SIDE_EFFECTS on
1648 the call if it is to a "const" function. Thus the copy of
1649 TREE_SIDE_EFFECTS from the CALL_EXPR to the BIND_EXPR above with
1650 result in TREE_SIDE_EFFECTS not being set for the inlined copy of a
1653 Unfortunately, that is wrong as inlining the function can create/expose
1654 interesting side effects (such as setting of a return value).
1656 The easiest solution is to simply recalculate TREE_SIDE_EFFECTS for
1657 the toplevel expression. */
1658 recalculate_side_effects (expr
);
1660 /* Output the inlining info for this abstract function, since it has been
1661 inlined. If we don't do this now, we can lose the information about the
1662 variables in the function when the blocks get blown away as soon as we
1663 remove the cgraph node. */
1664 (*debug_hooks
->outlining_inline_function
) (edge
->callee
->decl
);
1666 /* Update callgraph if needed. */
1667 cgraph_remove_node (edge
->callee
);
1669 /* Recurse into the body of the just inlined function. */
1670 expand_calls_inline (inlined_body
, id
);
1671 VARRAY_POP (id
->fns
);
1673 /* Don't walk into subtrees. We've already handled them above. */
1676 lang_hooks
.tree_inlining
.end_inlining (fn
);
1678 /* Keep iterating. */
1680 input_location
= saved_location
;
1685 expand_calls_inline (tree
*stmt_p
, inline_data
*id
)
1687 tree stmt
= *stmt_p
;
1688 enum tree_code code
= TREE_CODE (stmt
);
1693 case STATEMENT_LIST
:
1695 tree_stmt_iterator i
;
1698 for (i
= tsi_start (stmt
); !tsi_end_p (i
); )
1701 expand_calls_inline (tsi_stmt_ptr (i
), id
);
1704 if (TREE_CODE (new) == STATEMENT_LIST
)
1706 tsi_link_before (&i
, new, TSI_SAME_STMT
);
1716 expand_calls_inline (&COND_EXPR_THEN (stmt
), id
);
1717 expand_calls_inline (&COND_EXPR_ELSE (stmt
), id
);
1721 expand_calls_inline (&CATCH_BODY (stmt
), id
);
1724 case EH_FILTER_EXPR
:
1725 expand_calls_inline (&EH_FILTER_FAILURE (stmt
), id
);
1728 case TRY_CATCH_EXPR
:
1729 case TRY_FINALLY_EXPR
:
1730 expand_calls_inline (&TREE_OPERAND (stmt
, 0), id
);
1731 expand_calls_inline (&TREE_OPERAND (stmt
, 1), id
);
1735 expand_calls_inline (&BIND_EXPR_BODY (stmt
), id
);
1739 /* We're gimple. We should have gotten rid of all these. */
1743 stmt_p
= &TREE_OPERAND (stmt
, 0);
1745 if (!stmt
|| TREE_CODE (stmt
) != MODIFY_EXPR
)
1751 stmt_p
= &TREE_OPERAND (stmt
, 1);
1753 if (TREE_CODE (stmt
) == WITH_SIZE_EXPR
)
1755 stmt_p
= &TREE_OPERAND (stmt
, 0);
1758 if (TREE_CODE (stmt
) != CALL_EXPR
)
1764 expand_call_inline (stmt_p
, &dummy
, id
);
1772 /* Expand calls to inline functions in the body of FN. */
1775 optimize_inline_calls (tree fn
)
1780 /* There is no point in performing inlining if errors have already
1781 occurred -- and we might crash if we try to inline invalid
1783 if (errorcount
|| sorrycount
)
1787 memset (&id
, 0, sizeof (id
));
1789 id
.current_node
= id
.node
= cgraph_node (fn
);
1790 /* Don't allow recursion into FN. */
1791 VARRAY_TREE_INIT (id
.fns
, 32, "fns");
1792 VARRAY_PUSH_TREE (id
.fns
, fn
);
1793 /* Or any functions that aren't finished yet. */
1794 prev_fn
= NULL_TREE
;
1795 if (current_function_decl
)
1797 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
1798 prev_fn
= current_function_decl
;
1801 prev_fn
= lang_hooks
.tree_inlining
.add_pending_fn_decls (&id
.fns
, prev_fn
);
1803 /* Keep track of the low-water mark, i.e., the point where the first
1804 real inlining is represented in ID.FNS. */
1805 id
.first_inlined_fn
= VARRAY_ACTIVE_SIZE (id
.fns
);
1807 /* Replace all calls to inline functions with the bodies of those
1809 id
.tree_pruner
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1810 expand_calls_inline (&DECL_SAVED_TREE (fn
), &id
);
1813 htab_delete (id
.tree_pruner
);
1815 #ifdef ENABLE_CHECKING
1817 struct cgraph_edge
*e
;
1819 verify_cgraph_node (id
.node
);
1821 /* Double check that we inlined everything we are supposed to inline. */
1822 for (e
= id
.node
->callees
; e
; e
= e
->next_callee
)
1823 gcc_assert (e
->inline_failed
);
1828 /* FN is a function that has a complete body, and CLONE is a function whose
1829 body is to be set to a copy of FN, mapping argument declarations according
1830 to the ARG_MAP splay_tree. */
1833 clone_body (tree clone
, tree fn
, void *arg_map
)
1837 /* Clone the body, as if we were making an inline call. But, remap the
1838 parameters in the callee to the parameters of caller. If there's an
1839 in-charge parameter, map it to an appropriate constant. */
1840 memset (&id
, 0, sizeof (id
));
1841 VARRAY_TREE_INIT (id
.fns
, 2, "fns");
1842 VARRAY_PUSH_TREE (id
.fns
, clone
);
1843 VARRAY_PUSH_TREE (id
.fns
, fn
);
1844 id
.decl_map
= (splay_tree
)arg_map
;
1846 /* Cloning is treated slightly differently from inlining. Set
1847 CLONING_P so that it's clear which operation we're performing. */
1848 id
.cloning_p
= true;
1850 /* Actually copy the body. */
1851 append_to_statement_list_force (copy_body (&id
), &DECL_SAVED_TREE (clone
));
1854 /* Make and return duplicate of body in FN. Put copies of DECL_ARGUMENTS
1855 in *arg_copy and of the static chain, if any, in *sc_copy. */
1858 save_body (tree fn
, tree
*arg_copy
, tree
*sc_copy
)
1863 memset (&id
, 0, sizeof (id
));
1864 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
1865 VARRAY_PUSH_TREE (id
.fns
, fn
);
1866 id
.node
= cgraph_node (fn
);
1868 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
1869 *arg_copy
= DECL_ARGUMENTS (fn
);
1871 for (parg
= arg_copy
; *parg
; parg
= &TREE_CHAIN (*parg
))
1873 tree
new = copy_node (*parg
);
1875 lang_hooks
.dup_lang_specific_decl (new);
1876 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*parg
);
1877 insert_decl_map (&id
, *parg
, new);
1878 TREE_CHAIN (new) = TREE_CHAIN (*parg
);
1882 *sc_copy
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
1885 tree
new = copy_node (*sc_copy
);
1887 lang_hooks
.dup_lang_specific_decl (new);
1888 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*sc_copy
);
1889 insert_decl_map (&id
, *sc_copy
, new);
1890 TREE_CHAIN (new) = TREE_CHAIN (*sc_copy
);
1894 insert_decl_map (&id
, DECL_RESULT (fn
), DECL_RESULT (fn
));
1896 /* Actually copy the body. */
1897 body
= copy_body (&id
);
1900 splay_tree_delete (id
.decl_map
);
1904 #define WALK_SUBTREE(NODE) \
1907 result = walk_tree (&(NODE), func, data, pset); \
1913 /* This is a subroutine of walk_tree that walks field of TYPE that are to
1914 be walked whenever a type is seen in the tree. Rest of operands and return
1915 value are as for walk_tree. */
1918 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
1919 struct pointer_set_t
*pset
)
1921 tree result
= NULL_TREE
;
1923 switch (TREE_CODE (type
))
1926 case REFERENCE_TYPE
:
1927 /* We have to worry about mutually recursive pointers. These can't
1928 be written in C. They can in Ada. It's pathological, but
1929 there's an ACATS test (c38102a) that checks it. Deal with this
1930 by checking if we're pointing to another pointer, that one
1931 points to another pointer, that one does too, and we have no htab.
1932 If so, get a hash table. We check three levels deep to avoid
1933 the cost of the hash table if we don't need one. */
1934 if (POINTER_TYPE_P (TREE_TYPE (type
))
1935 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
1936 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
1939 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
1947 /* ... fall through ... */
1950 WALK_SUBTREE (TREE_TYPE (type
));
1954 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
1959 WALK_SUBTREE (TREE_TYPE (type
));
1963 /* We never want to walk into default arguments. */
1964 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
1965 WALK_SUBTREE (TREE_VALUE (arg
));
1970 /* Don't follow this nodes's type if a pointer for fear that we'll
1971 have infinite recursion. Those types are uninteresting anyway. */
1972 if (!POINTER_TYPE_P (TREE_TYPE (type
))
1973 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
1974 WALK_SUBTREE (TREE_TYPE (type
));
1975 WALK_SUBTREE (TYPE_DOMAIN (type
));
1983 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
1984 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
1988 WALK_SUBTREE (TREE_TYPE (type
));
1989 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
1999 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
2000 called with the DATA and the address of each sub-tree. If FUNC returns a
2001 non-NULL value, the traversal is aborted, and the value returned by FUNC
2002 is returned. If PSET is non-NULL it is used to record the nodes visited,
2003 and to avoid visiting a node more than once. */
2006 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
2008 enum tree_code code
;
2012 #define WALK_SUBTREE_TAIL(NODE) \
2016 goto tail_recurse; \
2021 /* Skip empty subtrees. */
2025 /* Don't walk the same tree twice, if the user has requested
2026 that we avoid doing so. */
2027 if (pset
&& pointer_set_insert (pset
, *tp
))
2030 /* Call the function. */
2032 result
= (*func
) (tp
, &walk_subtrees
, data
);
2034 /* If we found something, return it. */
2038 code
= TREE_CODE (*tp
);
2040 /* Even if we didn't, FUNC may have decided that there was nothing
2041 interesting below this point in the tree. */
2044 if (code
== TREE_LIST
)
2045 /* But we still need to check our siblings. */
2046 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2051 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
2053 if (result
|| ! walk_subtrees
)
2056 /* If this is a DECL_EXPR, walk into various fields of the type that it's
2057 defining. We only want to walk into these fields of a type in this
2058 case. Note that decls get walked as part of the processing of a
2061 ??? Precisely which fields of types that we are supposed to walk in
2062 this case vs. the normal case aren't well defined. */
2063 if (code
== DECL_EXPR
2064 && TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
2065 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
2067 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
2069 /* Call the function for the type. See if it returns anything or
2070 doesn't want us to continue. If we are to continue, walk both
2071 the normal fields and those for the declaration case. */
2072 result
= (*func
) (type_p
, &walk_subtrees
, data
);
2073 if (result
|| !walk_subtrees
)
2076 result
= walk_type_fields (*type_p
, func
, data
, pset
);
2080 WALK_SUBTREE (TYPE_SIZE (*type_p
));
2081 WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p
));
2083 /* If this is a record type, also walk the fields. */
2084 if (TREE_CODE (*type_p
) == RECORD_TYPE
2085 || TREE_CODE (*type_p
) == UNION_TYPE
2086 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2090 for (field
= TYPE_FIELDS (*type_p
); field
;
2091 field
= TREE_CHAIN (field
))
2093 /* We'd like to look at the type of the field, but we can easily
2094 get infinite recursion. So assume it's pointed to elsewhere
2095 in the tree. Also, ignore things that aren't fields. */
2096 if (TREE_CODE (field
) != FIELD_DECL
)
2099 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
2100 WALK_SUBTREE (DECL_SIZE (field
));
2101 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
2102 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2103 WALK_SUBTREE (DECL_QUALIFIER (field
));
2108 else if (code
!= SAVE_EXPR
2109 && code
!= BIND_EXPR
2110 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
2114 /* Walk over all the sub-trees of this operand. */
2115 len
= TREE_CODE_LENGTH (code
);
2116 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
2117 But, we only want to walk once. */
2118 if (code
== TARGET_EXPR
2119 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
2122 /* Go through the subtrees. We need to do this in forward order so
2123 that the scope of a FOR_EXPR is handled properly. */
2124 #ifdef DEBUG_WALK_TREE
2125 for (i
= 0; i
< len
; ++i
)
2126 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2128 for (i
= 0; i
< len
- 1; ++i
)
2129 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2133 /* The common case is that we may tail recurse here. */
2134 if (code
!= BIND_EXPR
2135 && !TREE_CHAIN (*tp
))
2136 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
2138 WALK_SUBTREE (TREE_OPERAND (*tp
, len
- 1));
2143 /* If this is a type, walk the needed fields in the type. */
2144 else if (TYPE_P (*tp
))
2146 result
= walk_type_fields (*tp
, func
, data
, pset
);
2152 /* Not one of the easy cases. We must explicitly go through the
2157 case IDENTIFIER_NODE
:
2163 case PLACEHOLDER_EXPR
:
2167 /* None of thse have subtrees other than those already walked
2172 WALK_SUBTREE (TREE_VALUE (*tp
));
2173 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2178 int len
= TREE_VEC_LENGTH (*tp
);
2183 /* Walk all elements but the first. */
2185 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
2187 /* Now walk the first one as a tail call. */
2188 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
2192 WALK_SUBTREE (TREE_REALPART (*tp
));
2193 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
2196 WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp
));
2199 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
2204 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
2206 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
2207 into declarations that are just mentioned, rather than
2208 declared; they don't really belong to this part of the tree.
2209 And, we can see cycles: the initializer for a declaration
2210 can refer to the declaration itself. */
2211 WALK_SUBTREE (DECL_INITIAL (decl
));
2212 WALK_SUBTREE (DECL_SIZE (decl
));
2213 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
2215 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
2218 case STATEMENT_LIST
:
2220 tree_stmt_iterator i
;
2221 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
2222 WALK_SUBTREE (*tsi_stmt_ptr (i
));
2227 /* ??? This could be a language-defined node. We really should make
2228 a hook for it, but right now just ignore it. */
2233 /* We didn't find what we were looking for. */
2237 #undef WALK_SUBTREE_TAIL
2240 /* Like walk_tree, but does not walk duplicate nodes more than once. */
2243 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
2246 struct pointer_set_t
*pset
;
2248 pset
= pointer_set_create ();
2249 result
= walk_tree (tp
, func
, data
, pset
);
2250 pointer_set_destroy (pset
);
2254 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2257 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2259 enum tree_code code
= TREE_CODE (*tp
);
2261 /* We make copies of most nodes. */
2262 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
2263 || code
== TREE_LIST
2265 || code
== TYPE_DECL
)
2267 /* Because the chain gets clobbered when we make a copy, we save it
2269 tree chain
= TREE_CHAIN (*tp
);
2272 /* Copy the node. */
2273 new = copy_node (*tp
);
2275 /* Propagate mudflap marked-ness. */
2276 if (flag_mudflap
&& mf_marked_p (*tp
))
2281 /* Now, restore the chain, if appropriate. That will cause
2282 walk_tree to walk into the chain as well. */
2283 if (code
== PARM_DECL
|| code
== TREE_LIST
)
2284 TREE_CHAIN (*tp
) = chain
;
2286 /* For now, we don't update BLOCKs when we make copies. So, we
2287 have to nullify all BIND_EXPRs. */
2288 if (TREE_CODE (*tp
) == BIND_EXPR
)
2289 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
2292 else if (TREE_CODE_CLASS (code
) == tcc_type
)
2294 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
2296 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
2299 gcc_assert (code
!= STATEMENT_LIST
);
2303 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2304 information indicating to what new SAVE_EXPR this one should be mapped,
2305 use that one. Otherwise, create a new node and enter it in ST. */
2308 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
2310 splay_tree st
= (splay_tree
) st_
;
2314 /* See if we already encountered this SAVE_EXPR. */
2315 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2317 /* If we didn't already remap this SAVE_EXPR, do so now. */
2320 t
= copy_node (*tp
);
2322 /* Remember this SAVE_EXPR. */
2323 splay_tree_insert (st
, (splay_tree_key
) *tp
, (splay_tree_value
) t
);
2324 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2325 splay_tree_insert (st
, (splay_tree_key
) t
, (splay_tree_value
) t
);
2329 /* We've already walked into this SAVE_EXPR; don't do it again. */
2331 t
= (tree
) n
->value
;
2334 /* Replace this SAVE_EXPR with the copy. */
2338 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2339 copies the declaration and enters it in the splay_tree in DATA (which is
2340 really an `inline_data *'). */
2343 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2346 inline_data
*id
= (inline_data
*) data
;
2348 /* Don't walk into types. */
2352 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
2354 tree decl
= TREE_OPERAND (*tp
, 0);
2356 /* Copy the decl and remember the copy. */
2357 insert_decl_map (id
, decl
,
2358 copy_decl_for_inlining (decl
, DECL_CONTEXT (decl
),
2359 DECL_CONTEXT (decl
)));
2365 /* Perform any modifications to EXPR required when it is unsaved. Does
2366 not recurse into EXPR's subtrees. */
2369 unsave_expr_1 (tree expr
)
2371 switch (TREE_CODE (expr
))
2374 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2375 It's OK for this to happen if it was part of a subtree that
2376 isn't immediately expanded, such as operand 2 of another
2378 if (TREE_OPERAND (expr
, 1))
2381 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2382 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2390 /* Called via walk_tree when an expression is unsaved. Using the
2391 splay_tree pointed to by ST (which is really a `splay_tree'),
2392 remaps all local declarations to appropriate replacements. */
2395 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
2397 inline_data
*id
= (inline_data
*) data
;
2398 splay_tree st
= id
->decl_map
;
2401 /* Only a local declaration (variable or label). */
2402 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
2403 || TREE_CODE (*tp
) == LABEL_DECL
)
2405 /* Lookup the declaration. */
2406 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2408 /* If it's there, remap it. */
2410 *tp
= (tree
) n
->value
;
2413 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
2414 copy_statement_list (tp
);
2415 else if (TREE_CODE (*tp
) == BIND_EXPR
)
2416 copy_bind_expr (tp
, walk_subtrees
, id
);
2417 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2418 remap_save_expr (tp
, st
, walk_subtrees
);
2421 copy_tree_r (tp
, walk_subtrees
, NULL
);
2423 /* Do whatever unsaving is required. */
2424 unsave_expr_1 (*tp
);
2427 /* Keep iterating. */
2431 /* Copies everything in EXPR and replaces variables, labels
2432 and SAVE_EXPRs local to EXPR. */
2435 unsave_expr_now (tree expr
)
2439 /* There's nothing to do for NULL_TREE. */
2444 memset (&id
, 0, sizeof (id
));
2445 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
2446 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
2447 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2449 /* Walk the tree once to find local labels. */
2450 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
2452 /* Walk the tree again, copying, remapping, and unsaving. */
2453 walk_tree (&expr
, unsave_r
, &id
, NULL
);
2456 splay_tree_delete (id
.decl_map
);
2461 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2464 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
2473 debug_find_tree (tree top
, tree search
)
2475 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
2478 /* Declare the variables created by the inliner. Add all the variables in
2479 VARS to BIND_EXPR. */
2482 declare_inline_vars (tree bind_expr
, tree vars
)
2485 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
2486 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
2488 add_var_to_bind_expr (bind_expr
, vars
);