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
);
142 static void remap_save_expr (tree
*, void *, int *);
144 /* Insert a tree->tree mapping for ID. Despite the name suggests
145 that the trees should be variables, it is used for more than that. */
148 insert_decl_map (inline_data
*id
, tree key
, tree value
)
150 splay_tree_insert (id
->decl_map
, (splay_tree_key
) key
,
151 (splay_tree_value
) value
);
153 /* Always insert an identity map as well. If we see this same new
154 node again, we won't want to duplicate it a second time. */
156 splay_tree_insert (id
->decl_map
, (splay_tree_key
) value
,
157 (splay_tree_value
) value
);
160 /* Remap DECL during the copying of the BLOCK tree for the function.
161 We are only called to remap local variables in the current function. */
164 remap_decl (tree decl
, inline_data
*id
)
166 splay_tree_node n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
167 tree fn
= VARRAY_TOP_TREE (id
->fns
);
169 /* See if we have remapped this declaration. If we didn't already have an
170 equivalent for this declaration, create one now. */
173 /* Make a copy of the variable or label. */
174 tree t
= copy_decl_for_inlining (decl
, fn
, VARRAY_TREE (id
->fns
, 0));
176 /* Remap types, if necessary. */
177 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
178 if (TREE_CODE (t
) == TYPE_DECL
)
179 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
180 else if (TREE_CODE (t
) == PARM_DECL
)
181 DECL_ARG_TYPE_AS_WRITTEN (t
)
182 = remap_type (DECL_ARG_TYPE_AS_WRITTEN (t
), id
);
184 /* Remap sizes as necessary. */
185 walk_tree (&DECL_SIZE (t
), copy_body_r
, id
, NULL
);
186 walk_tree (&DECL_SIZE_UNIT (t
), copy_body_r
, id
, NULL
);
188 /* If fields, do likewise for offset and qualifier. */
189 if (TREE_CODE (t
) == FIELD_DECL
)
191 walk_tree (&DECL_FIELD_OFFSET (t
), copy_body_r
, id
, NULL
);
192 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
193 walk_tree (&DECL_QUALIFIER (t
), copy_body_r
, id
, NULL
);
197 /* FIXME handle anon aggrs. */
198 if (! DECL_NAME (t
) && TREE_TYPE (t
)
199 && lang_hooks
.tree_inlining
.anon_aggr_type_p (TREE_TYPE (t
)))
201 /* For a VAR_DECL of anonymous type, we must also copy the
202 member VAR_DECLS here and rechain the DECL_ANON_UNION_ELEMS. */
206 for (src
= DECL_ANON_UNION_ELEMS (t
); src
;
207 src
= TREE_CHAIN (src
))
209 tree member
= remap_decl (TREE_VALUE (src
), id
);
211 gcc_assert (!TREE_PURPOSE (src
));
212 members
= tree_cons (NULL
, member
, members
);
214 DECL_ANON_UNION_ELEMS (t
) = nreverse (members
);
218 /* Remember it, so that if we encounter this local entity
219 again we can reuse this copy. */
220 insert_decl_map (id
, decl
, t
);
224 return unshare_expr ((tree
) n
->value
);
228 remap_type (tree type
, inline_data
*id
)
230 splay_tree_node node
;
236 /* See if we have remapped this type. */
237 node
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) type
);
239 return (tree
) node
->value
;
241 /* The type only needs remapping if it's variably modified by a variable
242 in the function we are inlining. */
243 if (! variably_modified_type_p (type
, VARRAY_TOP_TREE (id
->fns
)))
245 insert_decl_map (id
, type
, type
);
249 /* We do need a copy. build and register it now. If this is a pointer or
250 reference type, remap the designated type and make a new pointer or
252 if (TREE_CODE (type
) == POINTER_TYPE
)
254 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
256 TYPE_REF_CAN_ALIAS_ALL (type
));
257 insert_decl_map (id
, type
, new);
260 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
262 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
264 TYPE_REF_CAN_ALIAS_ALL (type
));
265 insert_decl_map (id
, type
, new);
269 new = copy_node (type
);
271 insert_decl_map (id
, type
, new);
273 /* This is a new type, not a copy of an old type. Need to reassociate
274 variants. We can handle everything except the main variant lazily. */
275 t
= TYPE_MAIN_VARIANT (type
);
278 t
= remap_type (t
, id
);
279 TYPE_MAIN_VARIANT (new) = t
;
280 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t
);
281 TYPE_NEXT_VARIANT (t
) = new;
285 TYPE_MAIN_VARIANT (new) = new;
286 TYPE_NEXT_VARIANT (new) = NULL
;
289 /* Lazily create pointer and reference types. */
290 TYPE_POINTER_TO (new) = NULL
;
291 TYPE_REFERENCE_TO (new) = NULL
;
293 switch (TREE_CODE (new))
300 t
= TYPE_MIN_VALUE (new);
301 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
302 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r
, id
, NULL
);
304 t
= TYPE_MAX_VALUE (new);
305 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
306 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r
, id
, NULL
);
310 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
311 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r
, id
, NULL
);
315 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id
);
316 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id
);
321 case QUAL_UNION_TYPE
:
322 walk_tree (&TYPE_FIELDS (new), copy_body_r
, id
, NULL
);
329 /* Shouldn't have been thought variable sized. */
333 walk_tree (&TYPE_SIZE (new), copy_body_r
, id
, NULL
);
334 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r
, id
, NULL
);
340 remap_decls (tree decls
, inline_data
*id
)
343 tree new_decls
= NULL_TREE
;
345 /* Remap its variables. */
346 for (old_var
= decls
; old_var
; old_var
= TREE_CHAIN (old_var
))
350 /* Remap the variable. */
351 new_var
= remap_decl (old_var
, id
);
353 /* If we didn't remap this variable, so we can't mess with its
354 TREE_CHAIN. If we remapped this variable to the return slot, it's
355 already declared somewhere else, so don't declare it here. */
356 if (!new_var
|| new_var
== id
->retvar
)
360 gcc_assert (DECL_P (new_var
));
361 TREE_CHAIN (new_var
) = new_decls
;
366 return nreverse (new_decls
);
369 /* Copy the BLOCK to contain remapped versions of the variables
370 therein. And hook the new block into the block-tree. */
373 remap_block (tree
*block
, inline_data
*id
)
379 /* Make the new block. */
381 new_block
= make_node (BLOCK
);
382 TREE_USED (new_block
) = TREE_USED (old_block
);
383 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
386 /* Remap its variables. */
387 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
), id
);
389 fn
= VARRAY_TREE (id
->fns
, 0);
391 /* FIXME! It shouldn't be so hard to manage blocks. Rebuilding them in
392 rest_of_compilation is a good start. */
394 /* We're building a clone; DECL_INITIAL is still
395 error_mark_node, and current_binding_level is the parm
397 lang_hooks
.decls
.insert_block (new_block
);
400 /* Attach this new block after the DECL_INITIAL block for the
401 function into which this block is being inlined. In
402 rest_of_compilation we will straighten out the BLOCK tree. */
404 if (DECL_INITIAL (fn
))
405 first_block
= &BLOCK_CHAIN (DECL_INITIAL (fn
));
407 first_block
= &DECL_INITIAL (fn
);
408 BLOCK_CHAIN (new_block
) = *first_block
;
409 *first_block
= new_block
;
412 /* Remember the remapped block. */
413 insert_decl_map (id
, old_block
, new_block
);
417 copy_statement_list (tree
*tp
)
419 tree_stmt_iterator oi
, ni
;
422 new = alloc_stmt_list ();
423 ni
= tsi_start (new);
424 oi
= tsi_start (*tp
);
427 for (; !tsi_end_p (oi
); tsi_next (&oi
))
428 tsi_link_after (&ni
, tsi_stmt (oi
), TSI_NEW_STMT
);
432 copy_bind_expr (tree
*tp
, int *walk_subtrees
, inline_data
*id
)
434 tree block
= BIND_EXPR_BLOCK (*tp
);
435 /* Copy (and replace) the statement. */
436 copy_tree_r (tp
, walk_subtrees
, NULL
);
439 remap_block (&block
, id
);
440 BIND_EXPR_BLOCK (*tp
) = block
;
443 if (BIND_EXPR_VARS (*tp
))
444 /* This will remap a lot of the same decls again, but this should be
446 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), id
);
449 /* Called from copy_body via walk_tree. DATA is really an `inline_data *'. */
452 copy_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
454 inline_data
*id
= (inline_data
*) data
;
455 tree fn
= VARRAY_TOP_TREE (id
->fns
);
458 /* All automatic variables should have a DECL_CONTEXT indicating
459 what function they come from. */
460 if ((TREE_CODE (*tp
) == VAR_DECL
|| TREE_CODE (*tp
) == LABEL_DECL
)
461 && DECL_NAMESPACE_SCOPE_P (*tp
))
462 gcc_assert (DECL_EXTERNAL (*tp
) || TREE_STATIC (*tp
));
465 /* If this is a RETURN_EXPR, change it into a MODIFY_EXPR and a
466 GOTO_EXPR with the RET_LABEL as its target. */
467 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->ret_label
)
469 tree return_stmt
= *tp
;
472 /* Build the GOTO_EXPR. */
473 tree assignment
= TREE_OPERAND (return_stmt
, 0);
474 goto_stmt
= build1 (GOTO_EXPR
, void_type_node
, id
->ret_label
);
475 TREE_USED (id
->ret_label
) = 1;
477 /* If we're returning something, just turn that into an
478 assignment into the equivalent of the original
482 /* Do not create a statement containing a naked RESULT_DECL. */
483 if (TREE_CODE (assignment
) == RESULT_DECL
)
484 gimplify_stmt (&assignment
);
486 *tp
= build (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
487 append_to_statement_list (assignment
, &BIND_EXPR_BODY (*tp
));
488 append_to_statement_list (goto_stmt
, &BIND_EXPR_BODY (*tp
));
490 /* If we're not returning anything just do the jump. */
494 /* Local variables and labels need to be replaced by equivalent
495 variables. We don't want to copy static variables; there's only
496 one of those, no matter how many times we inline the containing
497 function. Similarly for globals from an outer function. */
498 else if (lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
502 /* Remap the declaration. */
503 new_decl
= remap_decl (*tp
, id
);
504 gcc_assert (new_decl
);
505 /* Replace this variable with the copy. */
506 STRIP_TYPE_NOPS (new_decl
);
509 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
510 copy_statement_list (tp
);
511 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
512 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
513 else if (TREE_CODE (*tp
) == BIND_EXPR
)
514 copy_bind_expr (tp
, walk_subtrees
, id
);
515 /* Types may need remapping as well. */
516 else if (TYPE_P (*tp
))
517 *tp
= remap_type (*tp
, id
);
519 /* If this is a constant, we have to copy the node iff the type will be
520 remapped. copy_tree_r will not copy a constant. */
521 else if (TREE_CODE_CLASS (TREE_CODE (*tp
)) == tcc_constant
)
523 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
525 if (new_type
== TREE_TYPE (*tp
))
528 else if (TREE_CODE (*tp
) == INTEGER_CST
)
529 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
530 TREE_INT_CST_HIGH (*tp
));
533 *tp
= copy_node (*tp
);
534 TREE_TYPE (*tp
) = new_type
;
538 /* Otherwise, just copy the node. Note that copy_tree_r already
539 knows not to copy VAR_DECLs, etc., so this is safe. */
544 if (TREE_CODE (*tp
) == MODIFY_EXPR
545 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
546 && (lang_hooks
.tree_inlining
.auto_var_in_fn_p
547 (TREE_OPERAND (*tp
, 0), fn
)))
549 /* Some assignments VAR = VAR; don't generate any rtl code
550 and thus don't count as variable modification. Avoid
551 keeping bogosities like 0 = 0. */
552 tree decl
= TREE_OPERAND (*tp
, 0), value
;
555 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
558 value
= (tree
) n
->value
;
559 STRIP_TYPE_NOPS (value
);
560 if (TREE_CONSTANT (value
) || TREE_READONLY_DECL_P (value
))
562 *tp
= build_empty_stmt ();
563 return copy_body_r (tp
, walk_subtrees
, data
);
567 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
569 /* Get rid of *& from inline substitutions that can happen when a
570 pointer argument is an ADDR_EXPR. */
571 tree decl
= TREE_OPERAND (*tp
, 0), value
;
574 n
= splay_tree_lookup (id
->decl_map
, (splay_tree_key
) decl
);
577 value
= (tree
) n
->value
;
579 if (TREE_CODE (value
) == ADDR_EXPR
580 && (lang_hooks
.types_compatible_p
581 (TREE_TYPE (*tp
), TREE_TYPE (TREE_OPERAND (value
, 0)))))
583 *tp
= TREE_OPERAND (value
, 0);
584 return copy_body_r (tp
, walk_subtrees
, data
);
589 copy_tree_r (tp
, walk_subtrees
, NULL
);
591 if (TREE_CODE (*tp
) == CALL_EXPR
&& id
->node
&& get_callee_fndecl (*tp
))
595 struct cgraph_node
*node
;
596 struct cgraph_edge
*edge
;
598 for (node
= id
->node
->next_clone
; node
; node
= node
->next_clone
)
600 edge
= cgraph_edge (node
, old_node
);
602 edge
->call_expr
= *tp
;
607 struct cgraph_edge
*edge
608 = cgraph_edge (id
->current_node
, old_node
);
611 cgraph_clone_edge (edge
, id
->node
, *tp
);
615 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
617 /* The copied TARGET_EXPR has never been expanded, even if the
618 original node was expanded already. */
619 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
621 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
622 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
625 /* Variable substitution need not be simple. In particular, the
626 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
627 and friends are up-to-date. */
628 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
630 walk_tree (&TREE_OPERAND (*tp
, 0), copy_body_r
, id
, NULL
);
631 recompute_tree_invarant_for_addr_expr (*tp
);
636 /* Keep iterating. */
640 /* Make a copy of the body of FN so that it can be inserted inline in
644 copy_body (inline_data
*id
)
647 tree fndecl
= VARRAY_TOP_TREE (id
->fns
);
649 if (fndecl
== current_function_decl
651 body
= cfun
->saved_tree
;
653 body
= DECL_SAVED_TREE (fndecl
);
654 walk_tree (&body
, copy_body_r
, id
, NULL
);
660 setup_one_parameter (inline_data
*id
, tree p
, tree value
, tree fn
,
661 tree
*init_stmts
, tree
*vars
, bool *gimplify_init_stmts_p
)
666 /* If the parameter is never assigned to, we may not need to
667 create a new variable here at all. Instead, we may be able
668 to just use the argument value. */
669 if (TREE_READONLY (p
)
670 && !TREE_ADDRESSABLE (p
)
671 && value
&& !TREE_SIDE_EFFECTS (value
))
673 /* We can't risk substituting complex expressions. They
674 might contain variables that will be assigned to later.
675 Theoretically, we could check the expression to see if
676 all of the variables that determine its value are
677 read-only, but we don't bother. */
678 /* We may produce non-gimple trees by adding NOPs or introduce
679 invalid sharing when operand is not really constant.
680 It is not big deal to prohibit constant propagation here as
681 we will constant propagate in DOM1 pass anyway. */
682 if (is_gimple_min_invariant (value
)
683 && lang_hooks
.types_compatible_p (TREE_TYPE (value
), TREE_TYPE (p
)))
685 insert_decl_map (id
, p
, value
);
690 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
691 here since the type of this decl must be visible to the calling
693 var
= copy_decl_for_inlining (p
, fn
, VARRAY_TREE (id
->fns
, 0));
695 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
696 that way, when the PARM_DECL is encountered, it will be
697 automatically replaced by the VAR_DECL. */
698 insert_decl_map (id
, p
, var
);
700 /* Declare this new variable. */
701 TREE_CHAIN (var
) = *vars
;
704 /* Make gimplifier happy about this variable. */
705 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
707 /* Even if P was TREE_READONLY, the new VAR should not be.
708 In the original code, we would have constructed a
709 temporary, and then the function body would have never
710 changed the value of P. However, now, we will be
711 constructing VAR directly. The constructor body may
712 change its value multiple times as it is being
713 constructed. Therefore, it must not be TREE_READONLY;
714 the back-end assumes that TREE_READONLY variable is
715 assigned to only once. */
716 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
717 TREE_READONLY (var
) = 0;
719 /* Initialize this VAR_DECL from the equivalent argument. Convert
720 the argument to the proper type in case it was promoted. */
723 tree rhs
= fold_convert (TREE_TYPE (var
), value
);
725 if (rhs
== error_mark_node
)
728 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
729 keep our trees in gimple form. */
730 init_stmt
= build (MODIFY_EXPR
, TREE_TYPE (var
), var
, rhs
);
731 append_to_statement_list (init_stmt
, init_stmts
);
733 /* If we did not create a gimple value and we did not create a gimple
734 cast of a gimple value, then we will need to gimplify INIT_STMTS
735 at the end. Note that is_gimple_cast only checks the outer
736 tree code, not its operand. Thus the explicit check that it's
737 operand is a gimple value. */
738 if (!is_gimple_val (rhs
)
739 && (!is_gimple_cast (rhs
)
740 || !is_gimple_val (TREE_OPERAND (rhs
, 0))))
741 *gimplify_init_stmts_p
= true;
745 /* Generate code to initialize the parameters of the function at the
746 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
749 initialize_inlined_parameters (inline_data
*id
, tree args
, tree static_chain
,
750 tree fn
, tree bind_expr
)
752 tree init_stmts
= NULL_TREE
;
756 tree vars
= NULL_TREE
;
757 bool gimplify_init_stmts_p
= false;
760 /* Figure out what the parameters are. */
761 parms
= DECL_ARGUMENTS (fn
);
762 if (fn
== current_function_decl
)
763 parms
= cfun
->saved_args
;
765 /* Loop through the parameter declarations, replacing each with an
766 equivalent VAR_DECL, appropriately initialized. */
767 for (p
= parms
, a
= args
; p
;
768 a
= a
? TREE_CHAIN (a
) : a
, p
= TREE_CHAIN (p
))
774 /* Find the initializer. */
775 value
= lang_hooks
.tree_inlining
.convert_parm_for_inlining
776 (p
, a
? TREE_VALUE (a
) : NULL_TREE
, fn
, argnum
);
778 setup_one_parameter (id
, p
, value
, fn
, &init_stmts
, &vars
,
779 &gimplify_init_stmts_p
);
782 /* Evaluate trailing arguments. */
783 for (; a
; a
= TREE_CHAIN (a
))
785 tree value
= TREE_VALUE (a
);
786 append_to_statement_list (value
, &init_stmts
);
789 /* Initialize the static chain. */
790 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
793 /* No static chain? Seems like a bug in tree-nested.c. */
794 gcc_assert (static_chain
);
796 setup_one_parameter (id
, p
, static_chain
, fn
, &init_stmts
, &vars
,
797 &gimplify_init_stmts_p
);
800 if (gimplify_init_stmts_p
)
801 gimplify_body (&init_stmts
, current_function_decl
);
803 declare_inline_vars (bind_expr
, vars
);
807 /* Declare a return variable to replace the RESULT_DECL for the function we
808 are calling. RETURN_SLOT_ADDR, if non-null, was a fake parameter that
809 took the address of the result. MODIFY_DEST, if non-null, was the LHS of
810 the MODIFY_EXPR to which this call is the RHS.
812 The return value is a (possibly null) value that is the result of the
813 function as seen by the callee. *USE_P is a (possibly null) value that
814 holds the result as seen by the caller. */
817 declare_return_variable (inline_data
*id
, tree return_slot_addr
,
818 tree modify_dest
, tree
*use_p
)
820 tree callee
= VARRAY_TOP_TREE (id
->fns
);
821 tree caller
= VARRAY_TREE (id
->fns
, 0);
822 tree result
= DECL_RESULT (callee
);
823 tree callee_type
= TREE_TYPE (result
);
824 tree caller_type
= TREE_TYPE (TREE_TYPE (callee
));
827 /* We don't need to do anything for functions that don't return
829 if (!result
|| VOID_TYPE_P (callee_type
))
835 /* If there was a return slot, then the return value is the
836 dereferenced address of that object. */
837 if (return_slot_addr
)
839 /* The front end shouldn't have used both return_slot_addr and
840 a modify expression. */
841 gcc_assert (!modify_dest
);
842 if (DECL_BY_REFERENCE (result
))
843 var
= return_slot_addr
;
845 var
= build_fold_indirect_ref (return_slot_addr
);
850 /* All types requiring non-trivial constructors should have been handled. */
851 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
853 /* Attempt to avoid creating a new temporary variable. */
858 /* We can't use MODIFY_DEST if there's type promotion involved. */
859 if (!lang_hooks
.types_compatible_p (caller_type
, callee_type
))
862 /* ??? If we're assigning to a variable sized type, then we must
863 reuse the destination variable, because we've no good way to
864 create variable sized temporaries at this point. */
865 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
868 /* If the callee cannot possibly modify MODIFY_DEST, then we can
869 reuse it as the result of the call directly. Don't do this if
870 it would promote MODIFY_DEST to addressable. */
871 else if (!TREE_STATIC (modify_dest
)
872 && !TREE_ADDRESSABLE (modify_dest
)
873 && !TREE_ADDRESSABLE (result
))
884 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
886 var
= copy_decl_for_inlining (result
, callee
, caller
);
887 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
888 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
889 = tree_cons (NULL_TREE
, var
,
890 DECL_STRUCT_FUNCTION (caller
)->unexpanded_var_list
);
892 /* Do not have the rest of GCC warn about this variable as it should
893 not be visible to the user. */
894 TREE_NO_WARNING (var
) = 1;
896 /* Build the use expr. If the return type of the function was
897 promoted, convert it back to the expected type. */
899 if (!lang_hooks
.types_compatible_p (TREE_TYPE (var
), caller_type
))
900 use
= fold_convert (caller_type
, var
);
903 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
904 way, when the RESULT_DECL is encountered, it will be
905 automatically replaced by the VAR_DECL. */
906 insert_decl_map (id
, result
, var
);
908 /* Remember this so we can ignore it in remap_decls. */
915 /* Returns nonzero if a function can be inlined as a tree. */
918 tree_inlinable_function_p (tree fn
)
920 return inlinable_function_p (fn
);
923 static const char *inline_forbidden_reason
;
926 inline_forbidden_p_1 (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
930 tree fn
= (tree
) fnp
;
933 switch (TREE_CODE (node
))
936 /* Refuse to inline alloca call unless user explicitly forced so as
937 this may change program's memory overhead drastically when the
938 function using alloca is called in loop. In GCC present in
939 SPEC2000 inlining into schedule_block cause it to require 2GB of
940 RAM instead of 256MB. */
941 if (alloca_call_p (node
)
942 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
944 inline_forbidden_reason
945 = N_("%Jfunction %qF can never be inlined because it uses "
946 "alloca (override using the always_inline attribute)");
949 t
= get_callee_fndecl (node
);
953 /* We cannot inline functions that call setjmp. */
954 if (setjmp_call_p (t
))
956 inline_forbidden_reason
957 = N_("%Jfunction %qF can never be inlined because it uses setjmp");
961 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
962 switch (DECL_FUNCTION_CODE (t
))
964 /* We cannot inline functions that take a variable number of
966 case BUILT_IN_VA_START
:
967 case BUILT_IN_STDARG_START
:
968 case BUILT_IN_NEXT_ARG
:
969 case BUILT_IN_VA_END
:
970 inline_forbidden_reason
971 = N_("%Jfunction %qF can never be inlined because it "
972 "uses variable argument lists");
975 case BUILT_IN_LONGJMP
:
976 /* We can't inline functions that call __builtin_longjmp at
977 all. The non-local goto machinery really requires the
978 destination be in a different function. If we allow the
979 function calling __builtin_longjmp to be inlined into the
980 function calling __builtin_setjmp, Things will Go Awry. */
981 inline_forbidden_reason
982 = N_("%Jfunction %qF can never be inlined because "
983 "it uses setjmp-longjmp exception handling");
986 case BUILT_IN_NONLOCAL_GOTO
:
988 inline_forbidden_reason
989 = N_("%Jfunction %qF can never be inlined because "
990 "it uses non-local goto");
999 t
= TREE_OPERAND (node
, 0);
1001 /* We will not inline a function which uses computed goto. The
1002 addresses of its local labels, which may be tucked into
1003 global storage, are of course not constant across
1004 instantiations, which causes unexpected behavior. */
1005 if (TREE_CODE (t
) != LABEL_DECL
)
1007 inline_forbidden_reason
1008 = N_("%Jfunction %qF can never be inlined "
1009 "because it contains a computed goto");
1015 t
= TREE_OPERAND (node
, 0);
1016 if (DECL_NONLOCAL (t
))
1018 /* We cannot inline a function that receives a non-local goto
1019 because we cannot remap the destination label used in the
1020 function that is performing the non-local goto. */
1021 inline_forbidden_reason
1022 = N_("%Jfunction %qF can never be inlined "
1023 "because it receives a non-local goto");
1030 /* We cannot inline a function of the form
1032 void F (int i) { struct S { int ar[i]; } s; }
1034 Attempting to do so produces a catch-22.
1035 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1036 UNION_TYPE nodes, then it goes into infinite recursion on a
1037 structure containing a pointer to its own type. If it doesn't,
1038 then the type node for S doesn't get adjusted properly when
1039 F is inlined, and we abort in find_function_data. */
1040 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
1041 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
1043 inline_forbidden_reason
1044 = N_("%Jfunction %qF can never be inlined "
1045 "because it uses variable sized variables");
1056 /* Return subexpression representing possible alloca call, if any. */
1058 inline_forbidden_p (tree fndecl
)
1060 location_t saved_loc
= input_location
;
1061 tree ret
= walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl
),
1062 inline_forbidden_p_1
, fndecl
);
1064 input_location
= saved_loc
;
1068 /* Returns nonzero if FN is a function that does not have any
1069 fundamental inline blocking properties. */
1072 inlinable_function_p (tree fn
)
1074 bool inlinable
= true;
1076 /* If we've already decided this function shouldn't be inlined,
1077 there's no need to check again. */
1078 if (DECL_UNINLINABLE (fn
))
1081 /* See if there is any language-specific reason it cannot be
1082 inlined. (It is important that this hook be called early because
1083 in C++ it may result in template instantiation.)
1084 If the function is not inlinable for language-specific reasons,
1085 it is left up to the langhook to explain why. */
1086 inlinable
= !lang_hooks
.tree_inlining
.cannot_inline_tree_fn (&fn
);
1088 /* If we don't have the function body available, we can't inline it.
1089 However, this should not be recorded since we also get here for
1090 forward declared inline functions. Therefore, return at once. */
1091 if (!DECL_SAVED_TREE (fn
))
1094 /* If we're not inlining at all, then we cannot inline this function. */
1095 else if (!flag_inline_trees
)
1098 /* Only try to inline functions if DECL_INLINE is set. This should be
1099 true for all functions declared `inline', and for all other functions
1100 as well with -finline-functions.
1102 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1103 it's the front-end that must set DECL_INLINE in this case, because
1104 dwarf2out loses if a function that does not have DECL_INLINE set is
1105 inlined anyway. That is why we have both DECL_INLINE and
1106 DECL_DECLARED_INLINE_P. */
1107 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1108 here should be redundant. */
1109 else if (!DECL_INLINE (fn
) && !flag_unit_at_a_time
)
1112 else if (inline_forbidden_p (fn
))
1114 /* See if we should warn about uninlinable functions. Previously,
1115 some of these warnings would be issued while trying to expand
1116 the function inline, but that would cause multiple warnings
1117 about functions that would for example call alloca. But since
1118 this a property of the function, just one warning is enough.
1119 As a bonus we can now give more details about the reason why a
1120 function is not inlinable.
1121 We only warn for functions declared `inline' by the user. */
1122 bool do_warning
= (warn_inline
1124 && DECL_DECLARED_INLINE_P (fn
)
1125 && !DECL_IN_SYSTEM_HEADER (fn
));
1127 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1128 sorry (inline_forbidden_reason
, fn
, fn
);
1129 else if (do_warning
)
1130 warning (inline_forbidden_reason
, fn
, fn
);
1135 /* Squirrel away the result so that we don't have to check again. */
1136 DECL_UNINLINABLE (fn
) = !inlinable
;
1141 /* Used by estimate_num_insns. Estimate number of instructions seen
1142 by given statement. */
1145 estimate_num_insns_1 (tree
*tp
, int *walk_subtrees
, void *data
)
1150 if (IS_TYPE_OR_DECL_P (x
))
1155 /* Assume that constants and references counts nothing. These should
1156 be majorized by amount of operations among them we count later
1157 and are common target of CSE and similar optimizations. */
1158 else if (CONSTANT_CLASS_P (x
) || REFERENCE_CLASS_P (x
))
1161 switch (TREE_CODE (x
))
1163 /* Containers have no cost. */
1171 case ARRAY_RANGE_REF
:
1173 case EXC_PTR_EXPR
: /* ??? */
1174 case FILTER_EXPR
: /* ??? */
1177 case WITH_CLEANUP_EXPR
:
1179 case VIEW_CONVERT_EXPR
:
1183 case CASE_LABEL_EXPR
:
1186 case EH_FILTER_EXPR
:
1187 case STATEMENT_LIST
:
1189 case NON_LVALUE_EXPR
:
1192 case TRY_CATCH_EXPR
:
1193 case TRY_FINALLY_EXPR
:
1200 case WITH_SIZE_EXPR
:
1203 /* We don't account constants for now. Assume that the cost is amortized
1204 by operations that do use them. We may re-consider this decision once
1205 we are able to optimize the tree before estimating it's size and break
1206 out static initializers. */
1207 case IDENTIFIER_NODE
:
1216 /* Recognize assignments of large structures and constructors of
1220 x
= TREE_OPERAND (x
, 0);
1227 size
= int_size_in_bytes (TREE_TYPE (x
));
1229 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO
)
1232 *count
+= ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
1236 /* Assign cost of 1 to usual operations.
1237 ??? We may consider mapping RTL costs to this. */
1244 case FIX_TRUNC_EXPR
:
1246 case FIX_FLOOR_EXPR
:
1247 case FIX_ROUND_EXPR
:
1265 case TRUTH_ANDIF_EXPR
:
1266 case TRUTH_ORIF_EXPR
:
1267 case TRUTH_AND_EXPR
:
1269 case TRUTH_XOR_EXPR
:
1270 case TRUTH_NOT_EXPR
:
1279 case UNORDERED_EXPR
:
1292 case PREDECREMENT_EXPR
:
1293 case PREINCREMENT_EXPR
:
1294 case POSTDECREMENT_EXPR
:
1295 case POSTINCREMENT_EXPR
:
1305 /* Few special cases of expensive operations. This is useful
1306 to avoid inlining on functions having too many of these. */
1307 case TRUNC_DIV_EXPR
:
1309 case FLOOR_DIV_EXPR
:
1310 case ROUND_DIV_EXPR
:
1311 case EXACT_DIV_EXPR
:
1312 case TRUNC_MOD_EXPR
:
1314 case FLOOR_MOD_EXPR
:
1315 case ROUND_MOD_EXPR
:
1321 tree decl
= get_callee_fndecl (x
);
1323 if (decl
&& DECL_BUILT_IN (decl
))
1324 switch (DECL_FUNCTION_CODE (decl
))
1326 case BUILT_IN_CONSTANT_P
:
1329 case BUILT_IN_EXPECT
:
1338 /* Abort here se we know we don't miss any nodes. */
1344 /* Estimate number of instructions that will be created by expanding EXPR. */
1347 estimate_num_insns (tree expr
)
1350 walk_tree_without_duplicates (&expr
, estimate_num_insns_1
, &num
);
1354 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1357 expand_call_inline (tree
*tp
, int *walk_subtrees
, void *data
)
1370 tree return_slot_addr
;
1372 location_t saved_location
;
1373 struct cgraph_edge
*edge
;
1376 /* See what we've got. */
1377 id
= (inline_data
*) data
;
1380 /* Set input_location here so we get the right instantiation context
1381 if we call instantiate_decl from inlinable_function_p. */
1382 saved_location
= input_location
;
1383 if (EXPR_HAS_LOCATION (t
))
1384 input_location
= EXPR_LOCATION (t
);
1386 /* Recurse, but letting recursive invocations know that we are
1387 inside the body of a TARGET_EXPR. */
1388 if (TREE_CODE (*tp
) == TARGET_EXPR
)
1391 int i
, len
= first_rtl_op (TARGET_EXPR
);
1393 /* We're walking our own subtrees. */
1396 /* Actually walk over them. This loop is the body of
1397 walk_trees, omitting the case where the TARGET_EXPR
1398 itself is handled. */
1399 for (i
= 0; i
< len
; ++i
)
1402 ++id
->in_target_cleanup_p
;
1403 walk_tree (&TREE_OPERAND (*tp
, i
), expand_call_inline
, data
,
1406 --id
->in_target_cleanup_p
;
1414 /* Because types were not copied in copy_body, CALL_EXPRs beneath
1415 them should not be expanded. This can happen if the type is a
1416 dynamic array type, for example. */
1419 /* From here on, we're only interested in CALL_EXPRs. */
1420 if (TREE_CODE (t
) != CALL_EXPR
)
1423 /* First, see if we can figure out what function is being called.
1424 If we cannot, then there is no hope of inlining the function. */
1425 fn
= get_callee_fndecl (t
);
1429 /* Turn forward declarations into real ones. */
1430 fn
= cgraph_node (fn
)->decl
;
1432 /* If fn is a declaration of a function in a nested scope that was
1433 globally declared inline, we don't set its DECL_INITIAL.
1434 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1435 C++ front-end uses it for cdtors to refer to their internal
1436 declarations, that are not real functions. Fortunately those
1437 don't have trees to be saved, so we can tell by checking their
1439 if (! DECL_INITIAL (fn
)
1440 && DECL_ABSTRACT_ORIGIN (fn
)
1441 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn
)))
1442 fn
= DECL_ABSTRACT_ORIGIN (fn
);
1444 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1445 Kill this check once this is fixed. */
1446 if (!id
->current_node
->analyzed
)
1449 edge
= cgraph_edge (id
->current_node
, t
);
1451 /* Constant propagation on argument done during previous inlining
1452 may create new direct call. Produce an edge for it. */
1455 struct cgraph_node
*dest
= cgraph_node (fn
);
1457 /* We have missing edge in the callgraph. This can happen in one case
1458 where previous inlining turned indirect call into direct call by
1459 constant propagating arguments. In all other cases we hit a bug
1460 (incorrect node sharing is most common reason for missing edges. */
1461 gcc_assert (dest
->needed
|| !flag_unit_at_a_time
);
1462 cgraph_create_edge (id
->node
, dest
, t
)->inline_failed
1463 = N_("originally indirect function call not considered for inlining");
1467 /* Don't try to inline functions that are not well-suited to
1469 if (!cgraph_inline_p (edge
, &reason
))
1471 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
1473 sorry ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1474 sorry ("called from here");
1476 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
1477 && !DECL_IN_SYSTEM_HEADER (fn
)
1479 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
)))
1481 warning ("%Jinlining failed in call to %qF: %s", fn
, fn
, reason
);
1482 warning ("called from here");
1487 #ifdef ENABLE_CHECKING
1488 if (edge
->callee
->decl
!= id
->node
->decl
)
1489 verify_cgraph_node (edge
->callee
);
1492 if (! lang_hooks
.tree_inlining
.start_inlining (fn
))
1495 /* Build a block containing code to initialize the arguments, the
1496 actual inline expansion of the body, and a label for the return
1497 statements within the function to jump to. The type of the
1498 statement expression is the return type of the function call. */
1500 expr
= build (BIND_EXPR
, void_type_node
, NULL_TREE
,
1501 stmt
, make_node (BLOCK
));
1502 BLOCK_ABSTRACT_ORIGIN (BIND_EXPR_BLOCK (expr
)) = fn
;
1504 /* Local declarations will be replaced by their equivalents in this
1507 id
->decl_map
= splay_tree_new (splay_tree_compare_pointers
,
1510 /* Initialize the parameters. */
1511 args
= TREE_OPERAND (t
, 1);
1512 return_slot_addr
= NULL_TREE
;
1513 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (t
))
1515 return_slot_addr
= TREE_VALUE (args
);
1516 args
= TREE_CHAIN (args
);
1517 TREE_TYPE (expr
) = void_type_node
;
1520 arg_inits
= initialize_inlined_parameters (id
, args
, TREE_OPERAND (t
, 2),
1524 /* Expand any inlined calls in the initializers. Do this before we
1525 push FN on the stack of functions we are inlining; we want to
1526 inline calls to FN that appear in the initializers for the
1529 Note we need to save and restore the saved tree statement iterator
1530 to avoid having it clobbered by expand_calls_inline. */
1531 tree_stmt_iterator save_tsi
;
1534 expand_calls_inline (&arg_inits
, id
);
1537 /* And add them to the tree. */
1538 append_to_statement_list (arg_inits
, &BIND_EXPR_BODY (expr
));
1541 /* Record the function we are about to inline so that we can avoid
1542 recursing into it. */
1543 VARRAY_PUSH_TREE (id
->fns
, fn
);
1545 /* Record the function we are about to inline if optimize_function
1546 has not been called on it yet and we don't have it in the list. */
1547 if (! DECL_INLINED_FNS (fn
))
1551 for (i
= VARRAY_ACTIVE_SIZE (id
->inlined_fns
) - 1; i
>= 0; i
--)
1552 if (VARRAY_TREE (id
->inlined_fns
, i
) == fn
)
1555 VARRAY_PUSH_TREE (id
->inlined_fns
, fn
);
1558 /* Return statements in the function body will be replaced by jumps
1559 to the RET_LABEL. */
1560 id
->ret_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
1561 DECL_ARTIFICIAL (id
->ret_label
) = 1;
1562 DECL_CONTEXT (id
->ret_label
) = VARRAY_TREE (id
->fns
, 0);
1563 insert_decl_map (id
, id
->ret_label
, id
->ret_label
);
1565 gcc_assert (DECL_INITIAL (fn
));
1566 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
1568 /* Find the lhs to which the result of this call is assigned. */
1569 modify_dest
= tsi_stmt (id
->tsi
);
1570 if (TREE_CODE (modify_dest
) == MODIFY_EXPR
)
1571 modify_dest
= TREE_OPERAND (modify_dest
, 0);
1575 /* Declare the return variable for the function. */
1576 decl
= declare_return_variable (id
, return_slot_addr
,
1577 modify_dest
, &use_retvar
);
1579 /* After we've initialized the parameters, we insert the body of the
1582 struct cgraph_node
*old_node
= id
->current_node
;
1584 id
->current_node
= edge
->callee
;
1585 append_to_statement_list (copy_body (id
), &BIND_EXPR_BODY (expr
));
1586 id
->current_node
= old_node
;
1588 inlined_body
= &BIND_EXPR_BODY (expr
);
1590 /* After the body of the function comes the RET_LABEL. This must come
1591 before we evaluate the returned value below, because that evaluation
1592 may cause RTL to be generated. */
1593 if (TREE_USED (id
->ret_label
))
1595 tree label
= build1 (LABEL_EXPR
, void_type_node
, id
->ret_label
);
1596 append_to_statement_list (label
, &BIND_EXPR_BODY (expr
));
1600 splay_tree_delete (id
->decl_map
);
1603 /* The new expression has side-effects if the old one did. */
1604 TREE_SIDE_EFFECTS (expr
) = TREE_SIDE_EFFECTS (t
);
1606 tsi_link_before (&id
->tsi
, expr
, TSI_SAME_STMT
);
1608 /* If the inlined function returns a result that we care about,
1609 then we're going to need to splice in a MODIFY_EXPR. Otherwise
1610 the call was a standalone statement and we can just replace it
1611 with the BIND_EXPR inline representation of the called function. */
1612 if (!use_retvar
|| !modify_dest
)
1613 *tsi_stmt_ptr (id
->tsi
) = build_empty_stmt ();
1617 /* When we gimplify a function call, we may clear TREE_SIDE_EFFECTS on
1618 the call if it is to a "const" function. Thus the copy of
1619 TREE_SIDE_EFFECTS from the CALL_EXPR to the BIND_EXPR above with
1620 result in TREE_SIDE_EFFECTS not being set for the inlined copy of a
1623 Unfortunately, that is wrong as inlining the function can create/expose
1624 interesting side effects (such as setting of a return value).
1626 The easiest solution is to simply recalculate TREE_SIDE_EFFECTS for
1627 the toplevel expression. */
1628 recalculate_side_effects (expr
);
1630 /* Update callgraph if needed. */
1631 cgraph_remove_node (edge
->callee
);
1633 /* Recurse into the body of the just inlined function. */
1634 expand_calls_inline (inlined_body
, id
);
1635 VARRAY_POP (id
->fns
);
1637 /* Don't walk into subtrees. We've already handled them above. */
1640 lang_hooks
.tree_inlining
.end_inlining (fn
);
1642 /* Keep iterating. */
1644 input_location
= saved_location
;
1649 expand_calls_inline (tree
*stmt_p
, inline_data
*id
)
1651 tree stmt
= *stmt_p
;
1652 enum tree_code code
= TREE_CODE (stmt
);
1657 case STATEMENT_LIST
:
1659 tree_stmt_iterator i
;
1662 for (i
= tsi_start (stmt
); !tsi_end_p (i
); )
1665 expand_calls_inline (tsi_stmt_ptr (i
), id
);
1668 if (TREE_CODE (new) == STATEMENT_LIST
)
1670 tsi_link_before (&i
, new, TSI_SAME_STMT
);
1680 expand_calls_inline (&COND_EXPR_THEN (stmt
), id
);
1681 expand_calls_inline (&COND_EXPR_ELSE (stmt
), id
);
1685 expand_calls_inline (&CATCH_BODY (stmt
), id
);
1688 case EH_FILTER_EXPR
:
1689 expand_calls_inline (&EH_FILTER_FAILURE (stmt
), id
);
1692 case TRY_CATCH_EXPR
:
1693 case TRY_FINALLY_EXPR
:
1694 expand_calls_inline (&TREE_OPERAND (stmt
, 0), id
);
1695 expand_calls_inline (&TREE_OPERAND (stmt
, 1), id
);
1699 expand_calls_inline (&BIND_EXPR_BODY (stmt
), id
);
1703 /* We're gimple. We should have gotten rid of all these. */
1707 stmt_p
= &TREE_OPERAND (stmt
, 0);
1709 if (!stmt
|| TREE_CODE (stmt
) != MODIFY_EXPR
)
1715 stmt_p
= &TREE_OPERAND (stmt
, 1);
1717 if (TREE_CODE (stmt
) == WITH_SIZE_EXPR
)
1719 stmt_p
= &TREE_OPERAND (stmt
, 0);
1722 if (TREE_CODE (stmt
) != CALL_EXPR
)
1728 expand_call_inline (stmt_p
, &dummy
, id
);
1736 /* Expand calls to inline functions in the body of FN. */
1739 optimize_inline_calls (tree fn
)
1745 /* There is no point in performing inlining if errors have already
1746 occurred -- and we might crash if we try to inline invalid
1748 if (errorcount
|| sorrycount
)
1752 memset (&id
, 0, sizeof (id
));
1754 id
.current_node
= id
.node
= cgraph_node (fn
);
1755 /* Don't allow recursion into FN. */
1756 VARRAY_TREE_INIT (id
.fns
, 32, "fns");
1757 VARRAY_PUSH_TREE (id
.fns
, fn
);
1758 /* Or any functions that aren't finished yet. */
1759 prev_fn
= NULL_TREE
;
1760 if (current_function_decl
)
1762 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
1763 prev_fn
= current_function_decl
;
1766 prev_fn
= lang_hooks
.tree_inlining
.add_pending_fn_decls (&id
.fns
, prev_fn
);
1768 /* Create the list of functions this call will inline. */
1769 VARRAY_TREE_INIT (id
.inlined_fns
, 32, "inlined_fns");
1771 /* Keep track of the low-water mark, i.e., the point where the first
1772 real inlining is represented in ID.FNS. */
1773 id
.first_inlined_fn
= VARRAY_ACTIVE_SIZE (id
.fns
);
1775 /* Replace all calls to inline functions with the bodies of those
1777 id
.tree_pruner
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1778 expand_calls_inline (&DECL_SAVED_TREE (fn
), &id
);
1781 htab_delete (id
.tree_pruner
);
1782 ifn
= make_tree_vec (VARRAY_ACTIVE_SIZE (id
.inlined_fns
));
1783 if (VARRAY_ACTIVE_SIZE (id
.inlined_fns
))
1784 memcpy (&TREE_VEC_ELT (ifn
, 0), &VARRAY_TREE (id
.inlined_fns
, 0),
1785 VARRAY_ACTIVE_SIZE (id
.inlined_fns
) * sizeof (tree
));
1786 DECL_INLINED_FNS (fn
) = ifn
;
1788 #ifdef ENABLE_CHECKING
1790 struct cgraph_edge
*e
;
1792 verify_cgraph_node (id
.node
);
1794 /* Double check that we inlined everything we are supposed to inline. */
1795 for (e
= id
.node
->callees
; e
; e
= e
->next_callee
)
1796 gcc_assert (e
->inline_failed
);
1801 /* FN is a function that has a complete body, and CLONE is a function whose
1802 body is to be set to a copy of FN, mapping argument declarations according
1803 to the ARG_MAP splay_tree. */
1806 clone_body (tree clone
, tree fn
, void *arg_map
)
1810 /* Clone the body, as if we were making an inline call. But, remap the
1811 parameters in the callee to the parameters of caller. If there's an
1812 in-charge parameter, map it to an appropriate constant. */
1813 memset (&id
, 0, sizeof (id
));
1814 VARRAY_TREE_INIT (id
.fns
, 2, "fns");
1815 VARRAY_PUSH_TREE (id
.fns
, clone
);
1816 VARRAY_PUSH_TREE (id
.fns
, fn
);
1817 id
.decl_map
= (splay_tree
)arg_map
;
1819 /* Cloning is treated slightly differently from inlining. Set
1820 CLONING_P so that it's clear which operation we're performing. */
1821 id
.cloning_p
= true;
1823 /* Actually copy the body. */
1824 append_to_statement_list_force (copy_body (&id
), &DECL_SAVED_TREE (clone
));
1827 /* Make and return duplicate of body in FN. Put copies of DECL_ARGUMENTS
1828 in *arg_copy and of the static chain, if any, in *sc_copy. */
1831 save_body (tree fn
, tree
*arg_copy
, tree
*sc_copy
)
1836 memset (&id
, 0, sizeof (id
));
1837 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
1838 VARRAY_PUSH_TREE (id
.fns
, fn
);
1839 id
.node
= cgraph_node (fn
);
1841 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
1842 *arg_copy
= DECL_ARGUMENTS (fn
);
1844 for (parg
= arg_copy
; *parg
; parg
= &TREE_CHAIN (*parg
))
1846 tree
new = copy_node (*parg
);
1848 lang_hooks
.dup_lang_specific_decl (new);
1849 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*parg
);
1850 insert_decl_map (&id
, *parg
, new);
1851 TREE_CHAIN (new) = TREE_CHAIN (*parg
);
1855 *sc_copy
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
1858 tree
new = copy_node (*sc_copy
);
1860 lang_hooks
.dup_lang_specific_decl (new);
1861 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*sc_copy
);
1862 insert_decl_map (&id
, *sc_copy
, new);
1863 TREE_CHAIN (new) = TREE_CHAIN (*sc_copy
);
1867 insert_decl_map (&id
, DECL_RESULT (fn
), DECL_RESULT (fn
));
1869 /* Actually copy the body. */
1870 body
= copy_body (&id
);
1873 splay_tree_delete (id
.decl_map
);
1877 #define WALK_SUBTREE(NODE) \
1880 result = walk_tree (&(NODE), func, data, pset); \
1886 /* This is a subroutine of walk_tree that walks field of TYPE that are to
1887 be walked whenever a type is seen in the tree. Rest of operands and return
1888 value are as for walk_tree. */
1891 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
1892 struct pointer_set_t
*pset
)
1894 tree result
= NULL_TREE
;
1896 switch (TREE_CODE (type
))
1899 case REFERENCE_TYPE
:
1900 /* We have to worry about mutually recursive pointers. These can't
1901 be written in C. They can in Ada. It's pathological, but
1902 there's an ACATS test (c38102a) that checks it. Deal with this
1903 by checking if we're pointing to another pointer, that one
1904 points to another pointer, that one does too, and we have no htab.
1905 If so, get a hash table. We check three levels deep to avoid
1906 the cost of the hash table if we don't need one. */
1907 if (POINTER_TYPE_P (TREE_TYPE (type
))
1908 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
1909 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
1912 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
1920 /* ... fall through ... */
1923 WALK_SUBTREE (TREE_TYPE (type
));
1927 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
1932 WALK_SUBTREE (TREE_TYPE (type
));
1936 /* We never want to walk into default arguments. */
1937 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
1938 WALK_SUBTREE (TREE_VALUE (arg
));
1943 /* Don't follow this nodes's type if a pointer for fear that we'll
1944 have infinite recursion. Those types are uninteresting anyway. */
1945 if (!POINTER_TYPE_P (TREE_TYPE (type
))
1946 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
1947 WALK_SUBTREE (TREE_TYPE (type
));
1948 WALK_SUBTREE (TYPE_DOMAIN (type
));
1956 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
1957 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
1961 WALK_SUBTREE (TREE_TYPE (type
));
1962 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
1972 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
1973 called with the DATA and the address of each sub-tree. If FUNC returns a
1974 non-NULL value, the traversal is aborted, and the value returned by FUNC
1975 is returned. If PSET is non-NULL it is used to record the nodes visited,
1976 and to avoid visiting a node more than once. */
1979 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
1981 enum tree_code code
;
1985 #define WALK_SUBTREE_TAIL(NODE) \
1989 goto tail_recurse; \
1994 /* Skip empty subtrees. */
1998 /* Don't walk the same tree twice, if the user has requested
1999 that we avoid doing so. */
2000 if (pset
&& pointer_set_insert (pset
, *tp
))
2003 /* Call the function. */
2005 result
= (*func
) (tp
, &walk_subtrees
, data
);
2007 /* If we found something, return it. */
2011 code
= TREE_CODE (*tp
);
2013 /* Even if we didn't, FUNC may have decided that there was nothing
2014 interesting below this point in the tree. */
2017 if (code
== TREE_LIST
)
2018 /* But we still need to check our siblings. */
2019 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2024 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
2026 if (result
|| ! walk_subtrees
)
2029 /* If this is a DECL_EXPR, walk into various fields of the type that it's
2030 defining. We only want to walk into these fields of a type in this
2031 case. Note that decls get walked as part of the processing of a
2034 ??? Precisely which fields of types that we are supposed to walk in
2035 this case vs. the normal case aren't well defined. */
2036 if (code
== DECL_EXPR
2037 && TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
2038 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
2040 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
2042 /* Call the function for the type. See if it returns anything or
2043 doesn't want us to continue. If we are to continue, walk both
2044 the normal fields and those for the declaration case. */
2045 result
= (*func
) (type_p
, &walk_subtrees
, data
);
2046 if (result
|| !walk_subtrees
)
2049 result
= walk_type_fields (*type_p
, func
, data
, pset
);
2053 WALK_SUBTREE (TYPE_SIZE (*type_p
));
2054 WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p
));
2056 /* If this is a record type, also walk the fields. */
2057 if (TREE_CODE (*type_p
) == RECORD_TYPE
2058 || TREE_CODE (*type_p
) == UNION_TYPE
2059 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2063 for (field
= TYPE_FIELDS (*type_p
); field
;
2064 field
= TREE_CHAIN (field
))
2066 /* We'd like to look at the type of the field, but we can easily
2067 get infinite recursion. So assume it's pointed to elsewhere
2068 in the tree. Also, ignore things that aren't fields. */
2069 if (TREE_CODE (field
) != FIELD_DECL
)
2072 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
2073 WALK_SUBTREE (DECL_SIZE (field
));
2074 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
2075 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
2076 WALK_SUBTREE (DECL_QUALIFIER (field
));
2081 else if (code
!= SAVE_EXPR
2082 && code
!= BIND_EXPR
2083 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
2087 /* Walk over all the sub-trees of this operand. */
2088 len
= first_rtl_op (code
);
2089 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
2090 But, we only want to walk once. */
2091 if (code
== TARGET_EXPR
2092 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
2095 /* Go through the subtrees. We need to do this in forward order so
2096 that the scope of a FOR_EXPR is handled properly. */
2097 #ifdef DEBUG_WALK_TREE
2098 for (i
= 0; i
< len
; ++i
)
2099 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2101 for (i
= 0; i
< len
- 1; ++i
)
2102 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2106 /* The common case is that we may tail recurse here. */
2107 if (code
!= BIND_EXPR
2108 && !TREE_CHAIN (*tp
))
2109 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
2111 WALK_SUBTREE (TREE_OPERAND (*tp
, len
- 1));
2116 /* If this is a type, walk the needed fields in the type. */
2117 else if (TYPE_P (*tp
))
2119 result
= walk_type_fields (*tp
, func
, data
, pset
);
2125 /* Not one of the easy cases. We must explicitly go through the
2130 case IDENTIFIER_NODE
:
2136 case PLACEHOLDER_EXPR
:
2140 /* None of thse have subtrees other than those already walked
2145 WALK_SUBTREE (TREE_VALUE (*tp
));
2146 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
2151 int len
= TREE_VEC_LENGTH (*tp
);
2156 /* Walk all elements but the first. */
2158 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
2160 /* Now walk the first one as a tail call. */
2161 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
2165 WALK_SUBTREE (TREE_REALPART (*tp
));
2166 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
2169 WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp
));
2172 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
2177 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
2179 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
2180 into declarations that are just mentioned, rather than
2181 declared; they don't really belong to this part of the tree.
2182 And, we can see cycles: the initializer for a declaration
2183 can refer to the declaration itself. */
2184 WALK_SUBTREE (DECL_INITIAL (decl
));
2185 WALK_SUBTREE (DECL_SIZE (decl
));
2186 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
2188 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
2191 case STATEMENT_LIST
:
2193 tree_stmt_iterator i
;
2194 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
2195 WALK_SUBTREE (*tsi_stmt_ptr (i
));
2200 /* ??? This could be a language-defined node. We really should make
2201 a hook for it, but right now just ignore it. */
2206 /* We didn't find what we were looking for. */
2210 #undef WALK_SUBTREE_TAIL
2213 /* Like walk_tree, but does not walk duplicate nodes more than once. */
2216 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
2219 struct pointer_set_t
*pset
;
2221 pset
= pointer_set_create ();
2222 result
= walk_tree (tp
, func
, data
, pset
);
2223 pointer_set_destroy (pset
);
2227 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2230 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2232 enum tree_code code
= TREE_CODE (*tp
);
2234 /* We make copies of most nodes. */
2235 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
2236 || code
== TREE_LIST
2238 || code
== TYPE_DECL
)
2240 /* Because the chain gets clobbered when we make a copy, we save it
2242 tree chain
= TREE_CHAIN (*tp
);
2245 /* Copy the node. */
2246 new = copy_node (*tp
);
2248 /* Propagate mudflap marked-ness. */
2249 if (flag_mudflap
&& mf_marked_p (*tp
))
2254 /* Now, restore the chain, if appropriate. That will cause
2255 walk_tree to walk into the chain as well. */
2256 if (code
== PARM_DECL
|| code
== TREE_LIST
)
2257 TREE_CHAIN (*tp
) = chain
;
2259 /* For now, we don't update BLOCKs when we make copies. So, we
2260 have to nullify all BIND_EXPRs. */
2261 if (TREE_CODE (*tp
) == BIND_EXPR
)
2262 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
2265 else if (TREE_CODE_CLASS (code
) == tcc_type
)
2267 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
2269 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
2272 gcc_assert (code
!= STATEMENT_LIST
);
2276 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2277 information indicating to what new SAVE_EXPR this one should be mapped,
2278 use that one. Otherwise, create a new node and enter it in ST. */
2281 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
2283 splay_tree st
= (splay_tree
) st_
;
2287 /* See if we already encountered this SAVE_EXPR. */
2288 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2290 /* If we didn't already remap this SAVE_EXPR, do so now. */
2293 t
= copy_node (*tp
);
2295 /* Remember this SAVE_EXPR. */
2296 splay_tree_insert (st
, (splay_tree_key
) *tp
, (splay_tree_value
) t
);
2297 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2298 splay_tree_insert (st
, (splay_tree_key
) t
, (splay_tree_value
) t
);
2302 /* We've already walked into this SAVE_EXPR; don't do it again. */
2304 t
= (tree
) n
->value
;
2307 /* Replace this SAVE_EXPR with the copy. */
2311 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2312 copies the declaration and enters it in the splay_tree in DATA (which is
2313 really an `inline_data *'). */
2316 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2319 inline_data
*id
= (inline_data
*) data
;
2321 /* Don't walk into types. */
2325 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
2327 tree decl
= TREE_OPERAND (*tp
, 0);
2329 /* Copy the decl and remember the copy. */
2330 insert_decl_map (id
, decl
,
2331 copy_decl_for_inlining (decl
, DECL_CONTEXT (decl
),
2332 DECL_CONTEXT (decl
)));
2338 /* Perform any modifications to EXPR required when it is unsaved. Does
2339 not recurse into EXPR's subtrees. */
2342 unsave_expr_1 (tree expr
)
2344 switch (TREE_CODE (expr
))
2347 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2348 It's OK for this to happen if it was part of a subtree that
2349 isn't immediately expanded, such as operand 2 of another
2351 if (TREE_OPERAND (expr
, 1))
2354 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2355 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2363 /* Called via walk_tree when an expression is unsaved. Using the
2364 splay_tree pointed to by ST (which is really a `splay_tree'),
2365 remaps all local declarations to appropriate replacements. */
2368 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
2370 inline_data
*id
= (inline_data
*) data
;
2371 splay_tree st
= id
->decl_map
;
2374 /* Only a local declaration (variable or label). */
2375 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
2376 || TREE_CODE (*tp
) == LABEL_DECL
)
2378 /* Lookup the declaration. */
2379 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2381 /* If it's there, remap it. */
2383 *tp
= (tree
) n
->value
;
2386 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
2387 copy_statement_list (tp
);
2388 else if (TREE_CODE (*tp
) == BIND_EXPR
)
2389 copy_bind_expr (tp
, walk_subtrees
, id
);
2390 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2391 remap_save_expr (tp
, st
, walk_subtrees
);
2394 copy_tree_r (tp
, walk_subtrees
, NULL
);
2396 /* Do whatever unsaving is required. */
2397 unsave_expr_1 (*tp
);
2400 /* Keep iterating. */
2404 /* Copies everything in EXPR and replaces variables, labels
2405 and SAVE_EXPRs local to EXPR. */
2408 unsave_expr_now (tree expr
)
2412 /* There's nothing to do for NULL_TREE. */
2417 memset (&id
, 0, sizeof (id
));
2418 VARRAY_TREE_INIT (id
.fns
, 1, "fns");
2419 VARRAY_PUSH_TREE (id
.fns
, current_function_decl
);
2420 id
.decl_map
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2422 /* Walk the tree once to find local labels. */
2423 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
2425 /* Walk the tree again, copying, remapping, and unsaving. */
2426 walk_tree (&expr
, unsave_r
, &id
, NULL
);
2429 splay_tree_delete (id
.decl_map
);
2434 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2437 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
2446 debug_find_tree (tree top
, tree search
)
2448 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
2451 /* Declare the variables created by the inliner. Add all the variables in
2452 VARS to BIND_EXPR. */
2455 declare_inline_vars (tree bind_expr
, tree vars
)
2458 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
2459 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
2461 add_var_to_bind_expr (bind_expr
, vars
);