2 Copyright 2001, 2002, 2003, 2004 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"
47 /* I'm not real happy about this, but we need to handle gimple and
49 #include "tree-iterator.h"
50 #include "tree-gimple.h"
52 /* 0 if we should not perform inlining.
53 1 if we should expand functions calls inline at the tree level.
54 2 if we should consider *all* functions to be inline
57 int flag_inline_trees
= 0;
61 o In order to make inlining-on-trees work, we pessimized
62 function-local static constants. In particular, they are now
63 always output, even when not addressed. Fix this by treating
64 function-local static constants just like global static
65 constants; the back-end already knows not to output them if they
68 o Provide heuristics to clamp inlining of recursive template
71 /* Data required for function inlining. */
73 typedef struct inline_data
75 /* A stack of the functions we are inlining. For example, if we are
76 compiling `f', which calls `g', which calls `h', and we are
77 inlining the body of `h', the stack will contain, `h', followed
78 by `g', followed by `f'. The first few elements of the stack may
79 contain other functions that we know we should not recurse into,
80 even though they are not directly being inlined. */
82 /* The index of the first element of FNS that really represents an
84 unsigned first_inlined_fn
;
85 /* The label to jump to when a return statement is encountered. If
86 this value is NULL, then return statements will simply be
87 remapped as return statements, rather than as jumps. */
89 /* The VAR_DECL for the return value. */
91 /* The map from local declarations in the inlined function to
92 equivalents in the function into which it is being inlined. */
94 /* Nonzero if we are currently within the cleanup for a
96 int in_target_cleanup_p
;
97 /* A list of the functions current function has inlined. */
98 varray_type inlined_fns
;
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
);
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
);
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
);
508 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
509 copy_statement_list (tp
);
510 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
511 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
512 else if (TREE_CODE (*tp
) == BIND_EXPR
)
513 copy_bind_expr (tp
, walk_subtrees
, id
);
514 else if (TREE_CODE (*tp
) == LABELED_BLOCK_EXPR
)
516 /* We need a new copy of this labeled block; the EXIT_BLOCK_EXPR
517 will refer to it, so save a copy ready for remapping. We
518 save it in the decl_map, although it isn't a decl. */
519 tree new_block
= copy_node (*tp
);
520 insert_decl_map (id
, *tp
, new_block
);
523 else if (TREE_CODE (*tp
) == EXIT_BLOCK_EXPR
)
526 = splay_tree_lookup (id
->decl_map
,
527 (splay_tree_key
) TREE_OPERAND (*tp
, 0));
528 /* We _must_ have seen the enclosing LABELED_BLOCK_EXPR. */
530 *tp
= copy_node (*tp
);
531 TREE_OPERAND (*tp
, 0) = (tree
) n
->value
;
533 /* Types may need remapping as well. */
534 else if (TYPE_P (*tp
))
535 *tp
= remap_type (*tp
, id
);
537 /* Otherwise, just copy the node. Note that copy_tree_r already
538 knows not to copy VAR_DECLs, etc., so this is safe. */
543 if (TREE_CODE (*tp
) == MODIFY_EXPR
544 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
545 && (lang_hooks
.tree_inlining
.auto_var_in_fn_p
546 (TREE_OPERAND (*tp
, 0), fn
)))
548 /* Some assignments VAR = VAR; don't generate any rtl code
549 and thus don't count as variable modification. Avoid
550 keeping bogosities like 0 = 0. */
551 tree decl
= TREE_OPERAND (*tp
, 0), value
;
554 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
557 value
= (tree
) n
->value
;
558 STRIP_TYPE_NOPS (value
);
559 if (TREE_CONSTANT (value
) || TREE_READONLY_DECL_P (value
))
562 return copy_body_r (tp
, walk_subtrees
, data
);
566 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
568 /* Get rid of *& from inline substitutions that can happen when a
569 pointer argument is an ADDR_EXPR. */
570 tree decl
= TREE_OPERAND (*tp
, 0), value
;
573 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
576 value
= (tree
) n
->value
;
578 if (TREE_CODE (value
) == ADDR_EXPR
579 && (lang_hooks
.types_compatible_p
580 (TREE_TYPE (*tp
), TREE_TYPE (TREE_OPERAND (value
, 0)))))
582 *tp
= TREE_OPERAND (value
, 0);
583 return copy_body_r (tp
, walk_subtrees
, data
);
588 copy_tree_r (tp
, walk_subtrees
, NULL
);
590 if (TREE_CODE (*tp
) == CALL_EXPR
&& id
->node
&& get_callee_fndecl (*tp
))
594 struct cgraph_node
*node
;
595 struct cgraph_edge
*edge
;
597 for (node
= id
->node
->next_clone
; node
; node
= node
->next_clone
)
599 edge
= cgraph_edge (node
, old_node
);
601 edge
->call_expr
= *tp
;
606 struct cgraph_edge
*edge
607 = cgraph_edge (id
->current_node
, old_node
);
610 cgraph_clone_edge (edge
, id
->node
, *tp
);
614 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
616 /* The copied TARGET_EXPR has never been expanded, even if the
617 original node was expanded already. */
618 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
620 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
621 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
624 /* Variable substitution need not be simple. In particular, the
625 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
626 and friends are up-to-date. */
627 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
629 walk_tree (&TREE_OPERAND (*tp
, 0), copy_body_r
, id
, NULL
);
630 recompute_tree_invarant_for_addr_expr (*tp
);
635 /* Keep iterating. */
639 /* Make a copy of the body of FN so that it can be inserted inline in
643 copy_body (inline_data
*id
)
646 tree fndecl
= VARRAY_TOP_TREE (id
->fns
);
648 if (fndecl
== current_function_decl
650 body
= cfun
->saved_tree
;
652 body
= DECL_SAVED_TREE (fndecl
);
653 walk_tree (&body
, copy_body_r
, id
, NULL
);
659 setup_one_parameter (inline_data
*id
, tree p
, tree value
, tree fn
,
660 tree
*init_stmts
, tree
*vars
, bool *gimplify_init_stmts_p
)
665 /* If the parameter is never assigned to, we may not need to
666 create a new variable here at all. Instead, we may be able
667 to just use the argument value. */
668 if (TREE_READONLY (p
)
669 && !TREE_ADDRESSABLE (p
)
670 && value
&& !TREE_SIDE_EFFECTS (value
))
672 /* We can't risk substituting complex expressions. They
673 might contain variables that will be assigned to later.
674 Theoretically, we could check the expression to see if
675 all of the variables that determine its value are
676 read-only, but we don't bother. */
677 /* We may produce non-gimple trees by adding NOPs or introduce
678 invalid sharing when operand is not really constant.
679 It is not big deal to prohibit constant propagation here as
680 we will constant propagate in DOM1 pass anyway. */
681 if (is_gimple_min_invariant (value
)
682 && lang_hooks
.types_compatible_p (TREE_TYPE (value
), TREE_TYPE (p
)))
684 insert_decl_map (id
, p
, value
);
689 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
690 here since the type of this decl must be visible to the calling
692 var
= copy_decl_for_inlining (p
, fn
, VARRAY_TREE (id
->fns
, 0));
694 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
695 that way, when the PARM_DECL is encountered, it will be
696 automatically replaced by the VAR_DECL. */
697 insert_decl_map (id
, p
, var
);
699 /* Declare this new variable. */
700 TREE_CHAIN (var
) = *vars
;
703 /* Make gimplifier happy about this variable. */
704 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
706 /* Even if P was TREE_READONLY, the new VAR should not be.
707 In the original code, we would have constructed a
708 temporary, and then the function body would have never
709 changed the value of P. However, now, we will be
710 constructing VAR directly. The constructor body may
711 change its value multiple times as it is being
712 constructed. Therefore, it must not be TREE_READONLY;
713 the back-end assumes that TREE_READONLY variable is
714 assigned to only once. */
715 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
716 TREE_READONLY (var
) = 0;
718 /* Initialize this VAR_DECL from the equivalent argument. Convert
719 the argument to the proper type in case it was promoted. */
722 tree rhs
= fold_convert (TREE_TYPE (var
), value
);
724 if (rhs
== error_mark_node
)
727 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
728 keep our trees in gimple form. */
729 init_stmt
= build (MODIFY_EXPR
, TREE_TYPE (var
), var
, rhs
);
730 append_to_statement_list (init_stmt
, init_stmts
);
732 /* If we did not create a gimple value and we did not create a gimple
733 cast of a gimple value, then we will need to gimplify INIT_STMTS
734 at the end. Note that is_gimple_cast only checks the outer
735 tree code, not its operand. Thus the explicit check that it's
736 operand is a gimple value. */
737 if (!is_gimple_val (rhs
)
738 && (!is_gimple_cast (rhs
)
739 || !is_gimple_val (TREE_OPERAND (rhs
, 0))))
740 *gimplify_init_stmts_p
= true;
744 /* Generate code to initialize the parameters of the function at the
745 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
748 initialize_inlined_parameters (inline_data
*id
, tree args
, tree static_chain
,
749 tree fn
, tree bind_expr
)
751 tree init_stmts
= NULL_TREE
;
755 tree vars
= NULL_TREE
;
756 bool gimplify_init_stmts_p
= false;
759 /* Figure out what the parameters are. */
760 parms
= DECL_ARGUMENTS (fn
);
761 if (fn
== current_function_decl
)
762 parms
= cfun
->saved_args
;
764 /* Loop through the parameter declarations, replacing each with an
765 equivalent VAR_DECL, appropriately initialized. */
766 for (p
= parms
, a
= args
; p
;
767 a
= a
? TREE_CHAIN (a
) : a
, p
= TREE_CHAIN (p
))
773 /* Find the initializer. */
774 value
= lang_hooks
.tree_inlining
.convert_parm_for_inlining
775 (p
, a
? TREE_VALUE (a
) : NULL_TREE
, fn
, argnum
);
777 setup_one_parameter (id
, p
, value
, fn
, &init_stmts
, &vars
,
778 &gimplify_init_stmts_p
);
781 /* Evaluate trailing arguments. */
782 for (; a
; a
= TREE_CHAIN (a
))
784 tree value
= TREE_VALUE (a
);
785 append_to_statement_list (value
, &init_stmts
);
788 /* Initialize the static chain. */
789 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
792 /* No static chain? Seems like a bug in tree-nested.c. */
793 gcc_assert (static_chain
);
795 setup_one_parameter (id
, p
, static_chain
, fn
, &init_stmts
, &vars
,
796 &gimplify_init_stmts_p
);
799 if (gimplify_init_stmts_p
)
800 gimplify_body (&init_stmts
, current_function_decl
);
802 declare_inline_vars (bind_expr
, vars
);
806 /* Declare a return variable to replace the RESULT_DECL for the function we
807 are calling. RETURN_SLOT_ADDR, if non-null, was a fake parameter that
808 took the address of the result. MODIFY_DEST, if non-null, was the LHS of
809 the MODIFY_EXPR to which this call is the RHS.
811 The return value is a (possibly null) value that is the result of the
812 function as seen by the callee. *USE_P is a (possibly null) value that
813 holds the result as seen by the caller. */
816 declare_return_variable (inline_data
*id
, tree return_slot_addr
,
817 tree modify_dest
, tree
*use_p
)
819 tree callee
= VARRAY_TOP_TREE (id
->fns
);
820 tree caller
= VARRAY_TREE (id
->fns
, 0);
821 tree result
= DECL_RESULT (callee
);
822 tree callee_type
= TREE_TYPE (result
);
823 tree caller_type
= TREE_TYPE (TREE_TYPE (callee
));
826 /* We don't need to do anything for functions that don't return
828 if (!result
|| VOID_TYPE_P (callee_type
))
834 /* If there was a return slot, then the return value is the
835 dereferenced address of that object. */
836 if (return_slot_addr
)
838 /* The front end shouldn't have used both return_slot_addr and
839 a modify expression. */
840 gcc_assert (!modify_dest
);
841 if (DECL_BY_REFERENCE (result
))
842 var
= return_slot_addr
;
844 var
= build_fold_indirect_ref (return_slot_addr
);
849 /* All types requiring non-trivial constructors should have been handled. */
850 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
852 /* Attempt to avoid creating a new temporary variable. */
857 /* We can't use MODIFY_DEST if there's type promotion involved. */
858 if (!lang_hooks
.types_compatible_p (caller_type
, callee_type
))
861 /* ??? If we're assigning to a variable sized type, then we must
862 reuse the destination variable, because we've no good way to
863 create variable sized temporaries at this point. */
864 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
867 /* If the callee cannot possibly modify MODIFY_DEST, then we can
868 reuse it as the result of the call directly. Don't do this if
869 it would promote MODIFY_DEST to addressable. */
870 else if (!TREE_STATIC (modify_dest
)
871 && !TREE_ADDRESSABLE (modify_dest
)
872 && !TREE_ADDRESSABLE (result
))
883 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
885 var
= copy_decl_for_inlining (result
, callee
, caller
);
886 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
887 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
888 = tree_cons (NULL_TREE
, var
,
889 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
);
891 /* Do not have the rest of GCC warn about this variable as it should
892 not be visible to the user. */
893 TREE_NO_WARNING (var
) = 1;
895 /* Build the use expr. If the return type of the function was
896 promoted, convert it back to the expected type. */
898 if (!lang_hooks
.types_compatible_p (TREE_TYPE (var
), caller_type
))
899 use
= fold_convert (caller_type
, var
);
902 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
903 way, when the RESULT_DECL is encountered, it will be
904 automatically replaced by the VAR_DECL. */
905 insert_decl_map (id
, result
, var
);
907 /* Remember this so we can ignore it in remap_decls. */
914 /* Returns nonzero if a function can be inlined as a tree. */
917 tree_inlinable_function_p (tree fn
)
919 return inlinable_function_p (fn
);
922 static const char *inline_forbidden_reason
;
925 inline_forbidden_p_1 (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
929 tree fn
= (tree
) fnp
;
932 switch (TREE_CODE (node
))
935 /* Refuse to inline alloca call unless user explicitly forced so as
936 this may change program's memory overhead drastically when the
937 function using alloca is called in loop. In GCC present in
938 SPEC2000 inlining into schedule_block cause it to require 2GB of
939 RAM instead of 256MB. */
940 if (alloca_call_p (node
)
941 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
943 inline_forbidden_reason
944 = N_("%Jfunction %qF can never be inlined because it uses "
945 "alloca (override using the always_inline attribute)");
948 t
= get_callee_fndecl (node
);
952 /* We cannot inline functions that call setjmp. */
953 if (setjmp_call_p (t
))
955 inline_forbidden_reason
956 = N_("%Jfunction %qF can never be inlined because it uses setjmp");
960 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
961 switch (DECL_FUNCTION_CODE (t
))
963 /* We cannot inline functions that take a variable number of
965 case BUILT_IN_VA_START
:
966 case BUILT_IN_STDARG_START
:
967 case BUILT_IN_NEXT_ARG
:
968 case BUILT_IN_VA_END
:
969 inline_forbidden_reason
970 = N_("%Jfunction %qF can never be inlined because it "
971 "uses variable argument lists");
974 case BUILT_IN_LONGJMP
:
975 /* We can't inline functions that call __builtin_longjmp at
976 all. The non-local goto machinery really requires the
977 destination be in a different function. If we allow the
978 function calling __builtin_longjmp to be inlined into the
979 function calling __builtin_setjmp, Things will Go Awry. */
980 inline_forbidden_reason
981 = N_("%Jfunction %qF can never be inlined because "
982 "it uses setjmp-longjmp exception handling");
985 case BUILT_IN_NONLOCAL_GOTO
:
987 inline_forbidden_reason
988 = N_("%Jfunction %qF can never be inlined because "
989 "it uses non-local goto");
998 t
= TREE_OPERAND (node
, 0);
1000 /* We will not inline a function which uses computed goto. The
1001 addresses of its local labels, which may be tucked into
1002 global storage, are of course not constant across
1003 instantiations, which causes unexpected behavior. */
1004 if (TREE_CODE (t
) != LABEL_DECL
)
1006 inline_forbidden_reason
1007 = N_("%Jfunction %qF can never be inlined "
1008 "because it contains a computed goto");
1014 t
= TREE_OPERAND (node
, 0);
1015 if (DECL_NONLOCAL (t
))
1017 /* We cannot inline a function that receives a non-local goto
1018 because we cannot remap the destination label used in the
1019 function that is performing the non-local goto. */
1020 inline_forbidden_reason
1021 = N_("%Jfunction %qF can never be inlined "
1022 "because it receives a non-local goto");
1029 /* We cannot inline a function of the form
1031 void F (int i) { struct S { int ar[i]; } s; }
1033 Attempting to do so produces a catch-22.
1034 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1035 UNION_TYPE nodes, then it goes into infinite recursion on a
1036 structure containing a pointer to its own type. If it doesn't,
1037 then the type node for S doesn't get adjusted properly when
1038 F is inlined, and we abort in find_function_data. */
1039 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
1040 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
1042 inline_forbidden_reason
1043 = N_("%Jfunction %qF can never be inlined "
1044 "because it uses variable sized variables");
1055 /* Return subexpression representing possible alloca call, if any. */
1057 inline_forbidden_p (tree fndecl
)
1059 location_t saved_loc
= input_location
;
1060 tree ret
= walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl
),
1061 inline_forbidden_p_1
, fndecl
);
1063 input_location
= saved_loc
;
1067 /* Returns nonzero if FN is a function that does not have any
1068 fundamental inline blocking properties. */
1071 inlinable_function_p (tree fn
)
1073 bool inlinable
= true;
1075 /* If we've already decided this function shouldn't be inlined,
1076 there's no need to check again. */
1077 if (DECL_UNINLINABLE (fn
))
1080 /* See if there is any language-specific reason it cannot be
1081 inlined. (It is important that this hook be called early because
1082 in C++ it may result in template instantiation.)
1083 If the function is not inlinable for language-specific reasons,
1084 it is left up to the langhook to explain why. */
1085 inlinable
= !lang_hooks
.tree_inlining
.cannot_inline_tree_fn (&fn
);
1087 /* If we don't have the function body available, we can't inline it.
1088 However, this should not be recorded since we also get here for
1089 forward declared inline functions. Therefore, return at once. */
1090 if (!DECL_SAVED_TREE (fn
))
1093 /* If we're not inlining at all, then we cannot inline this function. */
1094 else if (!flag_inline_trees
)
1097 /* Only try to inline functions if DECL_INLINE is set. This should be
1098 true for all functions declared `inline', and for all other functions
1099 as well with -finline-functions.
1101 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1102 it's the front-end that must set DECL_INLINE in this case, because
1103 dwarf2out loses if a function that does not have DECL_INLINE set is
1104 inlined anyway. That is why we have both DECL_INLINE and
1105 DECL_DECLARED_INLINE_P. */
1106 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1107 here should be redundant. */
1108 else if (!DECL_INLINE (fn
) && !flag_unit_at_a_time
)
1111 else if (inline_forbidden_p (fn
))
1113 /* See if we should warn about uninlinable functions. Previously,
1114 some of these warnings would be issued while trying to expand
1115 the function inline, but that would cause multiple warnings
1116 about functions that would for example call alloca. But since
1117 this a property of the function, just one warning is enough.
1118 As a bonus we can now give more details about the reason why a
1119 function is not inlinable.
1120 We only warn for functions declared `inline' by the user. */
1121 bool do_warning
= (warn_inline
1123 && DECL_DECLARED_INLINE_P (fn
)
1124 && !DECL_IN_SYSTEM_HEADER (fn
));
1126 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1127 sorry (inline_forbidden_reason
, fn
, fn
);
1128 else if (do_warning
)
1129 warning (inline_forbidden_reason
, fn
, fn
);
1134 /* Squirrel away the result so that we don't have to check again. */
1135 DECL_UNINLINABLE (fn
) = !inlinable
;
1140 /* Used by estimate_num_insns. Estimate number of instructions seen
1141 by given statement. */
1144 estimate_num_insns_1 (tree
*tp
, int *walk_subtrees
, void *data
)
1149 if (IS_TYPE_OR_DECL_P (x
))
1154 /* Assume that constants and references counts nothing. These should
1155 be majorized by amount of operations among them we count later
1156 and are common target of CSE and similar optimizations. */
1157 else if (CONSTANT_CLASS_P (x
) || REFERENCE_CLASS_P (x
))
1160 switch (TREE_CODE (x
))
1162 /* Containers have no cost. */
1170 case ARRAY_RANGE_REF
:
1172 case EXC_PTR_EXPR
: /* ??? */
1173 case FILTER_EXPR
: /* ??? */
1176 case LABELED_BLOCK_EXPR
:
1177 case WITH_CLEANUP_EXPR
:
1179 case VIEW_CONVERT_EXPR
:
1183 case EXIT_BLOCK_EXPR
:
1184 case CASE_LABEL_EXPR
:
1187 case EH_FILTER_EXPR
:
1188 case STATEMENT_LIST
:
1190 case NON_LVALUE_EXPR
:
1193 case TRY_CATCH_EXPR
:
1194 case TRY_FINALLY_EXPR
:
1201 case WITH_SIZE_EXPR
:
1204 /* We don't account constants for now. Assume that the cost is amortized
1205 by operations that do use them. We may re-consider this decision once
1206 we are able to optimize the tree before estimating it's size and break
1207 out static initializers. */
1208 case IDENTIFIER_NODE
:
1217 /* Recognize assignments of large structures and constructors of
1221 x
= TREE_OPERAND (x
, 0);
1228 size
= int_size_in_bytes (TREE_TYPE (x
));
1230 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO
)
1233 *count
+= ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
1237 /* Assign cost of 1 to usual operations.
1238 ??? We may consider mapping RTL costs to this. */
1245 case FIX_TRUNC_EXPR
:
1247 case FIX_FLOOR_EXPR
:
1248 case FIX_ROUND_EXPR
:
1266 case TRUTH_ANDIF_EXPR
:
1267 case TRUTH_ORIF_EXPR
:
1268 case TRUTH_AND_EXPR
:
1270 case TRUTH_XOR_EXPR
:
1271 case TRUTH_NOT_EXPR
:
1280 case UNORDERED_EXPR
:
1293 case PREDECREMENT_EXPR
:
1294 case PREINCREMENT_EXPR
:
1295 case POSTDECREMENT_EXPR
:
1296 case POSTINCREMENT_EXPR
:
1306 /* Few special cases of expensive operations. This is useful
1307 to avoid inlining on functions having too many of these. */
1308 case TRUNC_DIV_EXPR
:
1310 case FLOOR_DIV_EXPR
:
1311 case ROUND_DIV_EXPR
:
1312 case EXACT_DIV_EXPR
:
1313 case TRUNC_MOD_EXPR
:
1315 case FLOOR_MOD_EXPR
:
1316 case ROUND_MOD_EXPR
:
1322 tree decl
= get_callee_fndecl (x
);
1324 if (decl
&& DECL_BUILT_IN (decl
))
1325 switch (DECL_FUNCTION_CODE (decl
))
1327 case BUILT_IN_CONSTANT_P
:
1330 case BUILT_IN_EXPECT
:
1339 /* Abort here se we know we don't miss any nodes. */
1345 /* Estimate number of instructions that will be created by expanding EXPR. */
1348 estimate_num_insns (tree expr
)
1351 walk_tree_without_duplicates (&expr
, estimate_num_insns_1
, &num
);
1355 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1358 expand_call_inline (tree
*tp
, int *walk_subtrees
, void *data
)
1371 tree return_slot_addr
;
1373 location_t saved_location
;
1374 struct cgraph_edge
*edge
;
1377 /* See what we've got. */
1378 id
= (inline_data
*) data
;
1381 /* Set input_location here so we get the right instantiation context
1382 if we call instantiate_decl from inlinable_function_p. */
1383 saved_location
= input_location
;
1384 if (EXPR_HAS_LOCATION (t
))
1385 input_location
= EXPR_LOCATION (t
);
1387 /* Recurse, but letting recursive invocations know that we are
1388 inside the body of a TARGET_EXPR. */
1389 if (TREE_CODE (*tp
) == TARGET_EXPR
)
1392 int i
, len
= first_rtl_op (TARGET_EXPR
);
1394 /* We're walking our own subtrees. */
1397 /* Actually walk over them. This loop is the body of
1398 walk_trees, omitting the case where the TARGET_EXPR
1399 itself is handled. */
1400 for (i
= 0; i
< len
; ++i
)
1403 ++id
->in_target_cleanup_p
;
1404 walk_tree (&TREE_OPERAND (*tp
, i
), expand_call_inline
, data
,
1407 --id
->in_target_cleanup_p
;
1415 /* Because types were not copied in copy_body, CALL_EXPRs beneath
1416 them should not be expanded. This can happen if the type is a
1417 dynamic array type, for example. */
1420 /* From here on, we're only interested in CALL_EXPRs. */
1421 if (TREE_CODE (t
) != CALL_EXPR
)
1424 /* First, see if we can figure out what function is being called.
1425 If we cannot, then there is no hope of inlining the function. */
1426 fn
= get_callee_fndecl (t
);
1430 /* Turn forward declarations into real ones. */
1431 fn
= cgraph_node (fn
)->decl
;
1433 /* If fn is a declaration of a function in a nested scope that was
1434 globally declared inline, we don't set its DECL_INITIAL.
1435 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1436 C++ front-end uses it for cdtors to refer to their internal
1437 declarations, that are not real functions. Fortunately those
1438 don't have trees to be saved, so we can tell by checking their
1440 if (! DECL_INITIAL (fn
)
1441 && DECL_ABSTRACT_ORIGIN (fn
)
1442 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn
)))
1443 fn
= DECL_ABSTRACT_ORIGIN (fn
);
1445 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1446 Kill this check once this is fixed. */
1447 if (!id
->current_node
->analyzed
)
1450 edge
= cgraph_edge (id
->current_node
, t
);
1452 /* Constant propagation on argument done during previous inlining
1453 may create new direct call. Produce an edge for it. */
1456 struct cgraph_node
*dest
= cgraph_node (fn
);
1458 /* We have missing edge in the callgraph. This can happen in one case
1459 where previous inlining turned indirect call into direct call by
1460 constant propagating arguments. In all other cases we hit a bug
1461 (incorrect node sharing is most common reason for missing edges. */
1462 gcc_assert (dest
->needed
|| !flag_unit_at_a_time
);
1463 cgraph_create_edge (id
->node
, dest
, t
)->inline_failed
1464 = N_("originally indirect function call not considered for inlining");
1468 /* Don't try to inline functions that are not well-suited to
1470 if (!cgraph_inline_p (edge
, &reason
))
1472 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1474 sorry ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1475 sorry ("called from here");
1477 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
1478 && !DECL_IN_SYSTEM_HEADER (fn
)
1480 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
)))
1482 warning ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1483 warning ("called from here");
1488 #ifdef ENABLE_CHECKING
1489 if (edge
->callee
->decl
!= id
->node
->decl
)
1490 verify_cgraph_node (edge
->callee
);
1493 if (! lang_hooks
.tree_inlining
.start_inlining (fn
))
1496 /* Build a block containing code to initialize the arguments, the
1497 actual inline expansion of the body, and a label for the return
1498 statements within the function to jump to. The type of the
1499 statement expression is the return type of the function call. */
1501 expr
= build (BIND_EXPR
, void_type_node
, NULL_TREE
,
1502 stmt
, make_node (BLOCK
));
1503 BLOCK_ABSTRACT_ORIGIN (BIND_EXPR_BLOCK (expr
)) = fn
;
1505 /* Local declarations will be replaced by their equivalents in this
1508 id
->decl_map
= splay_tree_new (splay_tree_compare_pointers
,
1511 /* Initialize the parameters. */
1512 args
= TREE_OPERAND (t
, 1);
1513 return_slot_addr
= NULL_TREE
;
1514 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (t
))
1516 return_slot_addr
= TREE_VALUE (args
);
1517 args
= TREE_CHAIN (args
);
1518 TREE_TYPE (expr
) = void_type_node
;
1521 arg_inits
= initialize_inlined_parameters (id
, args
, TREE_OPERAND (t
, 2),
1525 /* Expand any inlined calls in the initializers. Do this before we
1526 push FN on the stack of functions we are inlining; we want to
1527 inline calls to FN that appear in the initializers for the
1530 Note we need to save and restore the saved tree statement iterator
1531 to avoid having it clobbered by expand_calls_inline. */
1532 tree_stmt_iterator save_tsi
;
1535 expand_calls_inline (&arg_inits
, id
);
1538 /* And add them to the tree. */
1539 append_to_statement_list (arg_inits
, &BIND_EXPR_BODY (expr
));
1542 /* Record the function we are about to inline so that we can avoid
1543 recursing into it. */
1544 VARRAY_PUSH_TREE (id
->fns
, fn
);
1546 /* Record the function we are about to inline if optimize_function
1547 has not been called on it yet and we don't have it in the list. */
1548 if (! DECL_INLINED_FNS (fn
))
1552 for (i
= VARRAY_ACTIVE_SIZE (id
->inlined_fns
) - 1; i
>= 0; i
--)
1553 if (VARRAY_TREE (id
->inlined_fns
, i
) == fn
)
1556 VARRAY_PUSH_TREE (id
->inlined_fns
, fn
);
1559 /* Return statements in the function body will be replaced by jumps
1560 to the RET_LABEL. */
1561 id
->ret_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
1562 DECL_ARTIFICIAL (id
->ret_label
) = 1;
1563 DECL_CONTEXT (id
->ret_label
) = VARRAY_TREE (id
->fns
, 0);
1564 insert_decl_map (id
, id
->ret_label
, id
->ret_label
);
1566 gcc_assert (DECL_INITIAL (fn
));
1567 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
1569 /* Find the lhs to which the result of this call is assigned. */
1570 modify_dest
= tsi_stmt (id
->tsi
);
1571 if (TREE_CODE (modify_dest
) == MODIFY_EXPR
)
1572 modify_dest
= TREE_OPERAND (modify_dest
, 0);
1576 /* Declare the return variable for the function. */
1577 decl
= declare_return_variable (id
, return_slot_addr
,
1578 modify_dest
, &use_retvar
);
1580 /* After we've initialized the parameters, we insert the body of the
1583 struct cgraph_node
*old_node
= id
->current_node
;
1585 id
->current_node
= edge
->callee
;
1586 append_to_statement_list (copy_body (id
), &BIND_EXPR_BODY (expr
));
1587 id
->current_node
= old_node
;
1589 inlined_body
= &BIND_EXPR_BODY (expr
);
1591 /* After the body of the function comes the RET_LABEL. This must come
1592 before we evaluate the returned value below, because that evaluation
1593 may cause RTL to be generated. */
1594 if (TREE_USED (id
->ret_label
))
1596 tree label
= build1 (LABEL_EXPR
, void_type_node
, id
->ret_label
);
1597 append_to_statement_list (label
, &BIND_EXPR_BODY (expr
));
1601 splay_tree_delete (id
->decl_map
);
1604 /* The new expression has side-effects if the old one did. */
1605 TREE_SIDE_EFFECTS (expr
) = TREE_SIDE_EFFECTS (t
);
1607 tsi_link_before (&id
->tsi
, expr
, TSI_SAME_STMT
);
1609 /* If the inlined function returns a result that we care about,
1610 then we're going to need to splice in a MODIFY_EXPR. Otherwise
1611 the call was a standalone statement and we can just replace it
1612 with the BIND_EXPR inline representation of the called function. */
1613 if (!use_retvar
|| !modify_dest
)
1614 *tsi_stmt_ptr (id
->tsi
) = build_empty_stmt ();
1618 /* When we gimplify a function call, we may clear TREE_SIDE_EFFECTS on
1619 the call if it is to a "const" function. Thus the copy of
1620 TREE_SIDE_EFFECTS from the CALL_EXPR to the BIND_EXPR above with
1621 result in TREE_SIDE_EFFECTS not being set for the inlined copy of a
1624 Unfortunately, that is wrong as inlining the function can create/expose
1625 interesting side effects (such as setting of a return value).
1627 The easiest solution is to simply recalculate TREE_SIDE_EFFECTS for
1628 the toplevel expression. */
1629 recalculate_side_effects (expr
);
1631 /* Update callgraph if needed. */
1632 cgraph_remove_node (edge
->callee
);
1634 /* Recurse into the body of the just inlined function. */
1635 expand_calls_inline (inlined_body
, id
);
1636 VARRAY_POP (id
->fns
);
1638 /* Don't walk into subtrees. We've already handled them above. */
1641 lang_hooks
.tree_inlining
.end_inlining (fn
);
1643 /* Keep iterating. */
1645 input_location
= saved_location
;
1650 expand_calls_inline (tree
*stmt_p
, inline_data
*id
)
1652 tree stmt
= *stmt_p
;
1653 enum tree_code code
= TREE_CODE (stmt
);
1658 case STATEMENT_LIST
:
1660 tree_stmt_iterator i
;
1663 for (i
= tsi_start (stmt
); !tsi_end_p (i
); )
1666 expand_calls_inline (tsi_stmt_ptr (i
), id
);
1669 if (TREE_CODE (new) == STATEMENT_LIST
)
1671 tsi_link_before (&i
, new, TSI_SAME_STMT
);
1681 expand_calls_inline (&COND_EXPR_THEN (stmt
), id
);
1682 expand_calls_inline (&COND_EXPR_ELSE (stmt
), id
);
1686 expand_calls_inline (&CATCH_BODY (stmt
), id
);
1689 case EH_FILTER_EXPR
:
1690 expand_calls_inline (&EH_FILTER_FAILURE (stmt
), id
);
1693 case TRY_CATCH_EXPR
:
1694 case TRY_FINALLY_EXPR
:
1695 expand_calls_inline (&TREE_OPERAND (stmt
, 0), id
);
1696 expand_calls_inline (&TREE_OPERAND (stmt
, 1), id
);
1700 expand_calls_inline (&BIND_EXPR_BODY (stmt
), id
);
1704 /* We're gimple. We should have gotten rid of all these. */
1708 stmt_p
= &TREE_OPERAND (stmt
, 0);
1710 if (!stmt
|| TREE_CODE (stmt
) != MODIFY_EXPR
)
1716 stmt_p
= &TREE_OPERAND (stmt
, 1);
1718 if (TREE_CODE (stmt
) == WITH_SIZE_EXPR
)
1720 stmt_p
= &TREE_OPERAND (stmt
, 0);
1723 if (TREE_CODE (stmt
) != CALL_EXPR
)
1729 expand_call_inline (stmt_p
, &dummy
, id
);
1737 /* Expand calls to inline functions in the body of FN. */
1740 optimize_inline_calls (tree fn
)
1746 /* There is no point in performing inlining if errors have already
1747 occurred -- and we might crash if we try to inline invalid
1749 if (errorcount
|| sorrycount
)
1753 memset (&id
, 0, sizeof (id
));
1755 id
.current_node
= id
.node
= cgraph_node (fn
);
1756 /* Don't allow recursion into FN. */
1757 VARRAY_TREE_INIT (id
.fns
, 32, "fns");
1758 VARRAY_PUSH_TREE (id
.fns
, fn
);
1759 /* Or any functions that aren't finished yet. */
1760 prev_fn
= NULL_TREE
;
1761 if (current_function_decl
)
1763 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
1764 prev_fn
= current_function_decl
;
1767 prev_fn
= lang_hooks
.tree_inlining
.add_pending_fn_decls (&id
.fns
, prev_fn
);
1769 /* Create the list of functions this call will inline. */
1770 VARRAY_TREE_INIT (id
.inlined_fns
, 32, "inlined_fns");
1772 /* Keep track of the low-water mark, i.e., the point where the first
1773 real inlining is represented in ID.FNS. */
1774 id
.first_inlined_fn
= VARRAY_ACTIVE_SIZE (id
.fns
);
1776 /* Replace all calls to inline functions with the bodies of those
1778 id
.tree_pruner
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1779 expand_calls_inline (&DECL_SAVED_TREE (fn
), &id
);
1782 htab_delete (id
.tree_pruner
);
1783 ifn
= make_tree_vec (VARRAY_ACTIVE_SIZE (id
.inlined_fns
));
1784 if (VARRAY_ACTIVE_SIZE (id
.inlined_fns
))
1785 memcpy (&TREE_VEC_ELT (ifn
, 0), &VARRAY_TREE (id
.inlined_fns
, 0),
1786 VARRAY_ACTIVE_SIZE (id
.inlined_fns
) * sizeof (tree
));
1787 DECL_INLINED_FNS (fn
) = ifn
;
1789 #ifdef ENABLE_CHECKING
1791 struct cgraph_edge
*e
;
1793 verify_cgraph_node (id
.node
);
1795 /* Double check that we inlined everything we are supposed to inline. */
1796 for (e
= id
.node
->callees
; e
; e
= e
->next_callee
)
1797 gcc_assert (e
->inline_failed
);
1802 /* FN is a function that has a complete body, and CLONE is a function whose
1803 body is to be set to a copy of FN, mapping argument declarations according
1804 to the ARG_MAP splay_tree. */
1807 clone_body (tree clone
, tree fn
, void *arg_map
)
1811 /* Clone the body, as if we were making an inline call. But, remap the
1812 parameters in the callee to the parameters of caller. If there's an
1813 in-charge parameter, map it to an appropriate constant. */
1814 memset (&id
, 0, sizeof (id
));
1815 VARRAY_TREE_INIT (id
.fns
, 2, "fns");
1816 VARRAY_PUSH_TREE (id
.fns
, clone
);
1817 VARRAY_PUSH_TREE (id
.fns
, fn
);
1818 id
.decl_map
= (splay_tree
)arg_map
;
1820 /* Cloning is treated slightly differently from inlining. Set
1821 CLONING_P so that it's clear which operation we're performing. */
1822 id
.cloning_p
= true;
1824 /* Actually copy the body. */
1825 append_to_statement_list_force (copy_body (&id
), &DECL_SAVED_TREE (clone
));
1828 /* Make and return duplicate of body in FN. Put copies of DECL_ARGUMENTS
1829 in *arg_copy and of the static chain, if any, in *sc_copy. */
1832 save_body (tree fn
, tree
*arg_copy
, tree
*sc_copy
)
1837 memset (&id
, 0, sizeof (id
));
1838 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
1839 VARRAY_PUSH_TREE (id
.fns
, fn
);
1840 id
.node
= cgraph_node (fn
);
1842 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
1843 *arg_copy
= DECL_ARGUMENTS (fn
);
1845 for (parg
= arg_copy
; *parg
; parg
= &TREE_CHAIN (*parg
))
1847 tree
new = copy_node (*parg
);
1849 lang_hooks
.dup_lang_specific_decl (new);
1850 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*parg
);
1851 insert_decl_map (&id
, *parg
, new);
1852 TREE_CHAIN (new) = TREE_CHAIN (*parg
);
1856 *sc_copy
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
1859 tree
new = copy_node (*sc_copy
);
1861 lang_hooks
.dup_lang_specific_decl (new);
1862 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*sc_copy
);
1863 insert_decl_map (&id
, *sc_copy
, new);
1864 TREE_CHAIN (new) = TREE_CHAIN (*sc_copy
);
1868 insert_decl_map (&id
, DECL_RESULT (fn
), DECL_RESULT (fn
));
1870 /* Actually copy the body. */
1871 body
= copy_body (&id
);
1874 splay_tree_delete (id
.decl_map
);
1878 #define WALK_SUBTREE(NODE) \
1881 result = walk_tree (&(NODE), func, data, pset); \
1887 /* This is a subroutine of walk_tree that walks field of TYPE that are to
1888 be walked whenever a type is seen in the tree. Rest of operands and return
1889 value are as for walk_tree. */
1892 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
1893 struct pointer_set_t
*pset
)
1895 tree result
= NULL_TREE
;
1897 switch (TREE_CODE (type
))
1900 case REFERENCE_TYPE
:
1901 /* We have to worry about mutually recursive pointers. These can't
1902 be written in C. They can in Ada. It's pathological, but
1903 there's an ACATS test (c38102a) that checks it. Deal with this
1904 by checking if we're pointing to another pointer, that one
1905 points to another pointer, that one does too, and we have no htab.
1906 If so, get a hash table. We check three levels deep to avoid
1907 the cost of the hash table if we don't need one. */
1908 if (POINTER_TYPE_P (TREE_TYPE (type
))
1909 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
1910 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
1913 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
1921 /* ... fall through ... */
1924 WALK_SUBTREE (TREE_TYPE (type
));
1928 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
1933 WALK_SUBTREE (TREE_TYPE (type
));
1937 /* We never want to walk into default arguments. */
1938 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
1939 WALK_SUBTREE (TREE_VALUE (arg
));
1944 /* Don't follow this nodes's type if a pointer for fear that we'll
1945 have infinite recursion. Those types are uninteresting anyway. */
1946 if (!POINTER_TYPE_P (TREE_TYPE (type
))
1947 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
1948 WALK_SUBTREE (TREE_TYPE (type
));
1949 WALK_SUBTREE (TYPE_DOMAIN (type
));
1957 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
1958 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
1962 WALK_SUBTREE (TREE_TYPE (type
));
1963 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
1973 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
1974 called with the DATA and the address of each sub-tree. If FUNC returns a
1975 non-NULL value, the traversal is aborted, and the value returned by FUNC
1976 is returned. If PSET is non-NULL it is used to record the nodes visited,
1977 and to avoid visiting a node more than once. */
1980 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
1982 enum tree_code code
;
1986 #define WALK_SUBTREE_TAIL(NODE) \
1990 goto tail_recurse; \
1995 /* Skip empty subtrees. */
1999 /* Don't walk the same tree twice, if the user has requested
2000 that we avoid doing so. */
2001 if (pset
&& pointer_set_insert (pset
, *tp
))
2004 /* Call the function. */
2006 result
= (*func
) (tp
, &walk_subtrees
, data
);
2008 /* If we found something, return it. */
2012 code
= TREE_CODE (*tp
);
2014 /* Even if we didn't, FUNC may have decided that there was nothing
2015 interesting below this point in the tree. */
2018 if (code
== TREE_LIST
)
2019 /* But we still need to check our siblings. */
2020 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2025 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
2027 if (result
|| ! walk_subtrees
)
2030 /* If this is a DECL_EXPR, walk into various fields of the type that it's
2031 defining. We only want to walk into these fields of a type in this
2032 case. Note that decls get walked as part of the processing of a
2035 ??? Precisely which fields of types that we are supposed to walk in
2036 this case vs. the normal case aren't well defined. */
2037 if (code
== DECL_EXPR
2038 && TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
2039 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
2041 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
2043 /* Call the function for the type. See if it returns anything or
2044 doesn't want us to continue. If we are to continue, walk both
2045 the normal fields and those for the declaration case. */
2046 result
= (*func
) (type_p
, &walk_subtrees
, data
);
2047 if (result
|| !walk_subtrees
)
2050 result
= walk_type_fields (*type_p
, func
, data
, pset
);
2054 WALK_SUBTREE (TYPE_SIZE (*type_p
));
2055 WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p
));
2057 /* If this is a record type, also walk the fields. */
2058 if (TREE_CODE (*type_p
) == RECORD_TYPE
2059 || TREE_CODE (*type_p
) == UNION_TYPE
2060 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2064 for (field
= TYPE_FIELDS (*type_p
); field
;
2065 field
= TREE_CHAIN (field
))
2067 /* We'd like to look at the type of the field, but we can easily
2068 get infinite recursion. So assume it's pointed to elsewhere
2069 in the tree. Also, ignore things that aren't fields. */
2070 if (TREE_CODE (field
) != FIELD_DECL
)
2073 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
2074 WALK_SUBTREE (DECL_SIZE (field
));
2075 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
2076 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2077 WALK_SUBTREE (DECL_QUALIFIER (field
));
2082 else if (code
!= EXIT_BLOCK_EXPR
2083 && code
!= SAVE_EXPR
2084 && code
!= BIND_EXPR
2085 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
2089 /* Walk over all the sub-trees of this operand. */
2090 len
= first_rtl_op (code
);
2091 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
2092 But, we only want to walk once. */
2093 if (code
== TARGET_EXPR
2094 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
2097 /* Go through the subtrees. We need to do this in forward order so
2098 that the scope of a FOR_EXPR is handled properly. */
2099 #ifdef DEBUG_WALK_TREE
2100 for (i
= 0; i
< len
; ++i
)
2101 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2103 for (i
= 0; i
< len
- 1; ++i
)
2104 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2108 /* The common case is that we may tail recurse here. */
2109 if (code
!= BIND_EXPR
2110 && !TREE_CHAIN (*tp
))
2111 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
2113 WALK_SUBTREE (TREE_OPERAND (*tp
, len
- 1));
2118 /* If this is a type, walk the needed fields in the type. */
2119 else if (TYPE_P (*tp
))
2121 result
= walk_type_fields (*tp
, func
, data
, pset
);
2127 /* Not one of the easy cases. We must explicitly go through the
2132 case IDENTIFIER_NODE
:
2138 case PLACEHOLDER_EXPR
:
2142 /* None of thse have subtrees other than those already walked
2147 WALK_SUBTREE (TREE_VALUE (*tp
));
2148 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2153 int len
= TREE_VEC_LENGTH (*tp
);
2158 /* Walk all elements but the first. */
2160 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
2162 /* Now walk the first one as a tail call. */
2163 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
2167 WALK_SUBTREE (TREE_REALPART (*tp
));
2168 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
2171 WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp
));
2173 case EXIT_BLOCK_EXPR
:
2174 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 1));
2177 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
2182 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
2184 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
2185 into declarations that are just mentioned, rather than
2186 declared; they don't really belong to this part of the tree.
2187 And, we can see cycles: the initializer for a declaration
2188 can refer to the declaration itself. */
2189 WALK_SUBTREE (DECL_INITIAL (decl
));
2190 WALK_SUBTREE (DECL_SIZE (decl
));
2191 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
2193 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
2196 case STATEMENT_LIST
:
2198 tree_stmt_iterator i
;
2199 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
2200 WALK_SUBTREE (*tsi_stmt_ptr (i
));
2205 /* ??? This could be a language-defined node. We really should make
2206 a hook for it, but right now just ignore it. */
2211 /* We didn't find what we were looking for. */
2215 #undef WALK_SUBTREE_TAIL
2218 /* Like walk_tree, but does not walk duplicate nodes more than once. */
2221 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
2224 struct pointer_set_t
*pset
;
2226 pset
= pointer_set_create ();
2227 result
= walk_tree (tp
, func
, data
, pset
);
2228 pointer_set_destroy (pset
);
2232 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2235 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2237 enum tree_code code
= TREE_CODE (*tp
);
2239 /* We make copies of most nodes. */
2240 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
2241 || code
== TREE_LIST
2243 || code
== TYPE_DECL
)
2245 /* Because the chain gets clobbered when we make a copy, we save it
2247 tree chain
= TREE_CHAIN (*tp
);
2250 /* Copy the node. */
2251 new = copy_node (*tp
);
2253 /* Propagate mudflap marked-ness. */
2254 if (flag_mudflap
&& mf_marked_p (*tp
))
2259 /* Now, restore the chain, if appropriate. That will cause
2260 walk_tree to walk into the chain as well. */
2261 if (code
== PARM_DECL
|| code
== TREE_LIST
)
2262 TREE_CHAIN (*tp
) = chain
;
2264 /* For now, we don't update BLOCKs when we make copies. So, we
2265 have to nullify all BIND_EXPRs. */
2266 if (TREE_CODE (*tp
) == BIND_EXPR
)
2267 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
2270 else if (TREE_CODE_CLASS (code
) == tcc_type
)
2272 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
2274 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
2277 gcc_assert (code
!= STATEMENT_LIST
);
2281 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2282 information indicating to what new SAVE_EXPR this one should be mapped,
2283 use that one. Otherwise, create a new node and enter it in ST. */
2286 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
2288 splay_tree st
= (splay_tree
) st_
;
2292 /* See if we already encountered this SAVE_EXPR. */
2293 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2295 /* If we didn't already remap this SAVE_EXPR, do so now. */
2298 t
= copy_node (*tp
);
2300 /* Remember this SAVE_EXPR. */
2301 splay_tree_insert (st
, (splay_tree_key
) *tp
, (splay_tree_value
) t
);
2302 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2303 splay_tree_insert (st
, (splay_tree_key
) t
, (splay_tree_value
) t
);
2307 /* We've already walked into this SAVE_EXPR; don't do it again. */
2309 t
= (tree
) n
->value
;
2312 /* Replace this SAVE_EXPR with the copy. */
2316 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2317 copies the declaration and enters it in the splay_tree in DATA (which is
2318 really an `inline_data *'). */
2321 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2324 inline_data
*id
= (inline_data
*) data
;
2326 /* Don't walk into types. */
2330 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
2332 tree decl
= TREE_OPERAND (*tp
, 0);
2334 /* Copy the decl and remember the copy. */
2335 insert_decl_map (id
, decl
,
2336 copy_decl_for_inlining (decl
, DECL_CONTEXT (decl
),
2337 DECL_CONTEXT (decl
)));
2343 /* Perform any modifications to EXPR required when it is unsaved. Does
2344 not recurse into EXPR's subtrees. */
2347 unsave_expr_1 (tree expr
)
2349 switch (TREE_CODE (expr
))
2352 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2353 It's OK for this to happen if it was part of a subtree that
2354 isn't immediately expanded, such as operand 2 of another
2356 if (TREE_OPERAND (expr
, 1))
2359 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2360 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2368 /* Called via walk_tree when an expression is unsaved. Using the
2369 splay_tree pointed to by ST (which is really a `splay_tree'),
2370 remaps all local declarations to appropriate replacements. */
2373 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
2375 inline_data
*id
= (inline_data
*) data
;
2376 splay_tree st
= id
->decl_map
;
2379 /* Only a local declaration (variable or label). */
2380 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
2381 || TREE_CODE (*tp
) == LABEL_DECL
)
2383 /* Lookup the declaration. */
2384 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2386 /* If it's there, remap it. */
2388 *tp
= (tree
) n
->value
;
2391 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
2392 copy_statement_list (tp
);
2393 else if (TREE_CODE (*tp
) == BIND_EXPR
)
2394 copy_bind_expr (tp
, walk_subtrees
, id
);
2395 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2396 remap_save_expr (tp
, st
, walk_subtrees
);
2399 copy_tree_r (tp
, walk_subtrees
, NULL
);
2401 /* Do whatever unsaving is required. */
2402 unsave_expr_1 (*tp
);
2405 /* Keep iterating. */
2409 /* Copies everything in EXPR and replaces variables, labels
2410 and SAVE_EXPRs local to EXPR. */
2413 unsave_expr_now (tree expr
)
2417 /* There's nothing to do for NULL_TREE. */
2422 memset (&id
, 0, sizeof (id
));
2423 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
2424 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
2425 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2427 /* Walk the tree once to find local labels. */
2428 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
2430 /* Walk the tree again, copying, remapping, and unsaving. */
2431 walk_tree (&expr
, unsave_r
, &id
, NULL
);
2434 splay_tree_delete (id
.decl_map
);
2439 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2442 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
2451 debug_find_tree (tree top
, tree search
)
2453 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
2456 /* Declare the variables created by the inliner. Add all the variables in
2457 VARS to BIND_EXPR. */
2460 declare_inline_vars (tree bind_expr
, tree vars
)
2463 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
2464 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
2466 add_var_to_bind_expr (bind_expr
, vars
);