1 /* Control and data flow functions for trees.
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 "splay-tree.h"
39 #include "langhooks.h"
42 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 /* I'm not real happy about this, but we need to handle gimple and
48 #include "tree-iterator.h"
49 #include "tree-gimple.h"
51 /* 0 if we should not perform inlining.
52 1 if we should expand functions calls inline at the tree level.
53 2 if we should consider *all* functions to be inline
56 int flag_inline_trees = 0;
60 o In order to make inlining-on-trees work, we pessimized
61 function-local static constants. In particular, they are now
62 always output, even when not addressed. Fix this by treating
63 function-local static constants just like global static
64 constants; the back-end already knows not to output them if they
67 o Provide heuristics to clamp inlining of recursive template
70 /* Data required for function inlining. */
72 typedef struct inline_data
74 /* A stack of the functions we are inlining. For example, if we are
75 compiling `f', which calls `g', which calls `h', and we are
76 inlining the body of `h', the stack will contain, `h', followed
77 by `g', followed by `f'. The first few elements of the stack may
78 contain other functions that we know we should not recurse into,
79 even though they are not directly being inlined. */
81 /* The index of the first element of FNS that really represents an
83 unsigned first_inlined_fn;
84 /* The label to jump to when a return statement is encountered. If
85 this value is NULL, then return statements will simply be
86 remapped as return statements, rather than as jumps. */
88 /* The VAR_DECL for the return value. */
90 /* The map from local declarations in the inlined function to
91 equivalents in the function into which it is being inlined. */
93 /* Nonzero if we are currently within the cleanup for a
95 int in_target_cleanup_p;
96 /* A list of the functions current function has inlined. */
97 varray_type inlined_fns;
98 /* We use the same mechanism to build clones that we do to perform
99 inlining. However, there are a few places where we need to
100 distinguish between those two situations. This flag is true if
101 we are cloning, rather than inlining. */
103 /* Similarly for saving function body. */
105 /* Hash table used to prevent walk_tree from visiting the same node
106 umpteen million times. */
108 /* Callgraph node of function we are inlining into. */
109 struct cgraph_node *node;
110 /* Callgraph node of currently inlined function. */
111 struct cgraph_node *current_node;
112 /* Statement iterator. We need this so we can keep the tree in
113 gimple form when we insert the inlined function. It is not
114 used when we are not dealing with gimple trees. */
115 tree_stmt_iterator tsi;
120 /* The approximate number of instructions per statement. This number
121 need not be particularly accurate; it is used only to make
122 decisions about when a function is too big to inline. */
123 #define INSNS_PER_STMT (10)
125 static tree declare_return_variable (inline_data *, tree, tree *);
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 tree unsave_r (tree *, int *, void *);
140 static void declare_inline_vars (tree bind_expr, tree vars);
142 /* Insert a tree->tree mapping for ID. Despite the name suggests
143 that the trees should be variables, it is used for more than that. */
146 insert_decl_map (inline_data *id, tree key, tree value)
148 splay_tree_insert (id->decl_map, (splay_tree_key) key,
149 (splay_tree_value) value);
151 /* Always insert an identity map as well. If we see this same new
152 node again, we won't want to duplicate it a second time. */
154 splay_tree_insert (id->decl_map, (splay_tree_key) value,
155 (splay_tree_value) value);
158 /* Remap DECL during the copying of the BLOCK tree for the function. */
161 remap_decl (tree decl, inline_data *id)
166 /* We only remap local variables in the current function. */
167 fn = VARRAY_TOP_TREE (id->fns);
169 /* We need to remap statics, too, so that they get expanded even if the
170 inline function is never emitted out of line. We might as well also
171 remap extern decls so that they show up in the debug info. */
172 if (! lang_hooks.tree_inlining.auto_var_in_fn_p (decl, fn))
176 /* See if we have remapped this declaration. */
177 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
179 /* If we didn't already have an equivalent for this declaration,
185 /* Make a copy of the variable or label. */
186 t = copy_decl_for_inlining (decl, fn, VARRAY_TREE (id->fns, 0));
188 /* Remap types, if necessary. */
189 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
190 if (TREE_CODE (t) == TYPE_DECL)
191 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
192 else if (TREE_CODE (t) == PARM_DECL)
193 DECL_ARG_TYPE_AS_WRITTEN (t)
194 = remap_type (DECL_ARG_TYPE_AS_WRITTEN (t), id);
196 /* Remap sizes as necessary. */
197 walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
198 walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
201 /* FIXME handle anon aggrs. */
202 if (! DECL_NAME (t) && TREE_TYPE (t)
203 && lang_hooks.tree_inlining.anon_aggr_type_p (TREE_TYPE (t)))
205 /* For a VAR_DECL of anonymous type, we must also copy the
206 member VAR_DECLS here and rechain the DECL_ANON_UNION_ELEMS. */
210 for (src = DECL_ANON_UNION_ELEMS (t); src;
211 src = TREE_CHAIN (src))
213 tree member = remap_decl (TREE_VALUE (src), id);
215 if (TREE_PURPOSE (src))
217 members = tree_cons (NULL, member, members);
219 DECL_ANON_UNION_ELEMS (t) = nreverse (members);
223 /* Remember it, so that if we encounter this local entity
224 again we can reuse this copy. */
225 insert_decl_map (id, decl, t);
229 return unshare_expr ((tree) n->value);
233 remap_type (tree type, inline_data *id)
235 splay_tree_node node;
241 /* See if we have remapped this type. */
242 node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
244 return (tree) node->value;
246 /* The type only needs remapping if it's variably modified. */
247 if (! variably_modified_type_p (type))
249 insert_decl_map (id, type, type);
253 /* We do need a copy. build and register it now. */
254 new = copy_node (type);
255 insert_decl_map (id, type, new);
257 /* This is a new type, not a copy of an old type. Need to reassociate
258 variants. We can handle everything except the main variant lazily. */
259 t = TYPE_MAIN_VARIANT (type);
262 t = remap_type (t, id);
263 TYPE_MAIN_VARIANT (new) = t;
264 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t);
265 TYPE_NEXT_VARIANT (t) = new;
269 TYPE_MAIN_VARIANT (new) = new;
270 TYPE_NEXT_VARIANT (new) = NULL;
273 /* Lazily create pointer and reference types. */
274 TYPE_POINTER_TO (new) = NULL;
275 TYPE_REFERENCE_TO (new) = NULL;
277 switch (TREE_CODE (new))
284 t = TYPE_MIN_VALUE (new);
285 if (t && TREE_CODE (t) != INTEGER_CST)
286 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
288 t = TYPE_MAX_VALUE (new);
289 if (t && TREE_CODE (t) != INTEGER_CST)
290 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
294 TREE_TYPE (new) = t = remap_type (TREE_TYPE (new), id);
295 TYPE_NEXT_PTR_TO (new) = TYPE_POINTER_TO (t);
296 TYPE_POINTER_TO (t) = new;
300 TREE_TYPE (new) = t = remap_type (TREE_TYPE (new), id);
301 TYPE_NEXT_REF_TO (new) = TYPE_REFERENCE_TO (t);
302 TYPE_REFERENCE_TO (t) = new;
307 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
308 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
312 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
313 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
318 case QUAL_UNION_TYPE:
319 walk_tree (&TYPE_FIELDS (new), copy_body_r, id, NULL);
326 /* Shouldn't have been thought variable sized. */
330 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
331 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
337 remap_decls (tree decls, inline_data *id)
340 tree new_decls = NULL_TREE;
342 /* Remap its variables. */
343 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
347 /* Remap the variable. */
348 new_var = remap_decl (old_var, id);
350 /* If we didn't remap this variable, so we can't mess with its
351 TREE_CHAIN. If we remapped this variable to the return slot, it's
352 already declared somewhere else, so don't declare it here. */
353 if (!new_var || new_var == id->retvar)
355 #ifdef ENABLE_CHECKING
356 else if (!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
452 copy_body_r (tree *tp, int *walk_subtrees, void *data)
458 id = (inline_data *) data;
459 fn = VARRAY_TOP_TREE (id->fns);
462 /* All automatic variables should have a DECL_CONTEXT indicating
463 what function they come from. */
464 if ((TREE_CODE (*tp) == VAR_DECL || TREE_CODE (*tp) == LABEL_DECL)
465 && DECL_NAMESPACE_SCOPE_P (*tp))
466 if (! DECL_EXTERNAL (*tp) && ! TREE_STATIC (*tp))
470 /* If this is a RETURN_STMT, change it into an EXPR_STMT and a
471 GOTO_STMT with the RET_LABEL as its target. */
472 if (TREE_CODE (*tp) == RETURN_EXPR && id->ret_label)
474 tree return_stmt = *tp;
477 /* Build the GOTO_EXPR. */
478 tree assignment = TREE_OPERAND (return_stmt, 0);
479 goto_stmt = build1 (GOTO_EXPR, void_type_node, id->ret_label);
480 TREE_USED (id->ret_label) = 1;
482 /* If we're returning something, just turn that into an
483 assignment into the equivalent of the original
487 /* Do not create a statement containing a naked RESULT_DECL. */
488 if (lang_hooks.gimple_before_inlining)
489 if (TREE_CODE (assignment) == RESULT_DECL)
490 gimplify_stmt (&assignment);
492 *tp = build (BIND_EXPR, void_type_node, NULL_TREE, NULL_TREE,
494 append_to_statement_list (assignment, &BIND_EXPR_BODY (*tp));
495 append_to_statement_list (goto_stmt, &BIND_EXPR_BODY (*tp));
497 /* If we're not returning anything just do the jump. */
501 /* Local variables and labels need to be replaced by equivalent
502 variables. We don't want to copy static variables; there's only
503 one of those, no matter how many times we inline the containing
505 else if (lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
509 /* Remap the declaration. */
510 new_decl = remap_decl (*tp, id);
513 /* Replace this variable with the copy. */
514 STRIP_TYPE_NOPS (new_decl);
518 else if (nonstatic_local_decl_p (*tp)
519 && DECL_CONTEXT (*tp) != VARRAY_TREE (id->fns, 0))
522 else if (TREE_CODE (*tp) == STATEMENT_LIST)
523 copy_statement_list (tp);
524 else if (TREE_CODE (*tp) == SAVE_EXPR)
525 remap_save_expr (tp, id->decl_map, VARRAY_TREE (id->fns, 0),
527 else if (TREE_CODE (*tp) == UNSAVE_EXPR)
528 /* UNSAVE_EXPRs should not be generated until expansion time. */
530 else if (TREE_CODE (*tp) == BIND_EXPR)
531 copy_bind_expr (tp, walk_subtrees, id);
532 else if (TREE_CODE (*tp) == LABELED_BLOCK_EXPR)
534 /* We need a new copy of this labeled block; the EXIT_BLOCK_EXPR
535 will refer to it, so save a copy ready for remapping. We
536 save it in the decl_map, although it isn't a decl. */
537 tree new_block = copy_node (*tp);
538 insert_decl_map (id, *tp, new_block);
541 else if (TREE_CODE (*tp) == EXIT_BLOCK_EXPR)
544 = splay_tree_lookup (id->decl_map,
545 (splay_tree_key) TREE_OPERAND (*tp, 0));
546 /* We _must_ have seen the enclosing LABELED_BLOCK_EXPR. */
549 *tp = copy_node (*tp);
550 TREE_OPERAND (*tp, 0) = (tree) n->value;
552 /* Types may need remapping as well. */
553 else if (TYPE_P (*tp))
554 *tp = remap_type (*tp, id);
556 /* Otherwise, just copy the node. Note that copy_tree_r already
557 knows not to copy VAR_DECLs, etc., so this is safe. */
562 if (TREE_CODE (*tp) == MODIFY_EXPR
563 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
564 && (lang_hooks.tree_inlining.auto_var_in_fn_p
565 (TREE_OPERAND (*tp, 0), fn)))
567 /* Some assignments VAR = VAR; don't generate any rtl code
568 and thus don't count as variable modification. Avoid
569 keeping bogosities like 0 = 0. */
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;
577 STRIP_TYPE_NOPS (value);
578 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
581 return copy_body_r (tp, walk_subtrees, data);
585 else if (TREE_CODE (*tp) == ADDR_EXPR
586 && (lang_hooks.tree_inlining.auto_var_in_fn_p
587 (TREE_OPERAND (*tp, 0), fn)))
589 /* Get rid of &* from inline substitutions. It can occur when
590 someone takes the address of a parm or return slot passed by
591 invisible reference. */
592 tree decl = TREE_OPERAND (*tp, 0), value;
595 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
598 value = (tree) n->value;
599 if (TREE_CODE (value) == INDIRECT_REF)
601 /* Assume that the argument types properly match the
602 parameter types. We can't compare them well enough
603 without a comptypes langhook, and we don't want to
604 call convert and introduce a NOP_EXPR to convert
605 between two equivalent types (i.e. that only differ
606 in use of typedef names). */
607 *tp = TREE_OPERAND (value, 0);
608 return copy_body_r (tp, walk_subtrees, data);
612 else if (TREE_CODE (*tp) == INDIRECT_REF)
614 /* Get rid of *& from inline substitutions that can happen when a
615 pointer argument is an ADDR_EXPR. */
616 tree decl = TREE_OPERAND (*tp, 0), value;
619 n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
622 value = (tree) n->value;
624 if (TREE_CODE (value) == ADDR_EXPR)
626 *tp = TREE_OPERAND (value, 0);
627 return copy_body_r (tp, walk_subtrees, data);
632 copy_tree_r (tp, walk_subtrees, NULL);
634 if (TREE_CODE (*tp) == CALL_EXPR && id->node && get_callee_fndecl (*tp))
638 struct cgraph_node *node;
639 struct cgraph_edge *edge;
641 for (node = id->node->next_clone; node; node = node->next_clone)
643 edge = cgraph_edge (node, old_node);
645 edge->call_expr = *tp;
652 struct cgraph_edge *edge;
654 edge = cgraph_edge (id->current_node, old_node);
656 cgraph_clone_edge (edge, id->node, *tp);
660 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
662 /* The copied TARGET_EXPR has never been expanded, even if the
663 original node was expanded already. */
664 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
666 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
667 TREE_OPERAND (*tp, 3) = NULL_TREE;
671 /* Keep iterating. */
675 /* Make a copy of the body of FN so that it can be inserted inline in
679 copy_body (inline_data *id)
682 tree fndecl = VARRAY_TOP_TREE (id->fns);
684 if (fndecl == current_function_decl
686 body = cfun->saved_tree;
688 body = DECL_SAVED_TREE (fndecl);
689 walk_tree (&body, copy_body_r, id, NULL);
695 setup_one_parameter (inline_data *id, tree p, tree value,
696 tree fn, tree *init_stmts, tree *vars,
697 bool *gimplify_init_stmts_p)
703 /* If the parameter is never assigned to, we may not need to
704 create a new variable here at all. Instead, we may be able
705 to just use the argument value. */
706 if (TREE_READONLY (p)
707 && !TREE_ADDRESSABLE (p)
708 && value && !TREE_SIDE_EFFECTS (value))
710 /* We can't risk substituting complex expressions. They
711 might contain variables that will be assigned to later.
712 Theoretically, we could check the expression to see if
713 all of the variables that determine its value are
714 read-only, but we don't bother. */
715 if ((TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
716 /* We may produce non-gimple trees by adding NOPs or introduce
717 invalid sharing when operand is not really constant.
718 It is not big deal to prohibit constant propagation here as
719 we will constant propagate in DOM1 pass anyway. */
720 && (!lang_hooks.gimple_before_inlining
721 || (is_gimple_min_invariant (value)
722 && TREE_TYPE (value) == TREE_TYPE (p))))
724 /* If this is a declaration, wrap it a NOP_EXPR so that
725 we don't try to put the VALUE on the list of BLOCK_VARS. */
727 value = build1 (NOP_EXPR, TREE_TYPE (value), value);
729 /* If this is a constant, make sure it has the right type. */
730 else if (TREE_TYPE (value) != TREE_TYPE (p))
731 value = fold (build1 (NOP_EXPR, TREE_TYPE (p), value));
733 insert_decl_map (id, p, value);
738 /* Make an equivalent VAR_DECL. */
739 var = copy_decl_for_inlining (p, fn, VARRAY_TREE (id->fns, 0));
741 /* See if the frontend wants to pass this by invisible reference. If
742 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
743 replace uses of the PARM_DECL with dereferences. */
744 if (TREE_TYPE (var) != TREE_TYPE (p)
745 && POINTER_TYPE_P (TREE_TYPE (var))
746 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
748 insert_decl_map (id, var, var);
749 var_sub = build1 (INDIRECT_REF, TREE_TYPE (p), var);
754 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
755 that way, when the PARM_DECL is encountered, it will be
756 automatically replaced by the VAR_DECL. */
757 insert_decl_map (id, p, var_sub);
759 /* Declare this new variable. */
760 TREE_CHAIN (var) = *vars;
763 /* Make gimplifier happy about this variable. */
764 var->decl.seen_in_bind_expr = lang_hooks.gimple_before_inlining;
766 /* Even if P was TREE_READONLY, the new VAR should not be.
767 In the original code, we would have constructed a
768 temporary, and then the function body would have never
769 changed the value of P. However, now, we will be
770 constructing VAR directly. The constructor body may
771 change its value multiple times as it is being
772 constructed. Therefore, it must not be TREE_READONLY;
773 the back-end assumes that TREE_READONLY variable is
774 assigned to only once. */
775 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
776 TREE_READONLY (var) = 0;
778 /* Initialize this VAR_DECL from the equivalent argument. Convert
779 the argument to the proper type in case it was promoted. */
782 tree rhs = fold_convert (TREE_TYPE (var), value);
784 if (rhs == error_mark_node)
787 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
788 keep our trees in gimple form. */
789 init_stmt = build (MODIFY_EXPR, TREE_TYPE (var), var, rhs);
790 append_to_statement_list (init_stmt, init_stmts);
792 /* If we did not create a gimple value and we did not create a gimple
793 cast of a gimple value, then we will need to gimplify INIT_STMTS
794 at the end. Note that is_gimple_cast only checks the outer
795 tree code, not its operand. Thus the explicit check that it's
796 operand is a gimple value. */
797 if (!is_gimple_val (rhs)
798 && (!is_gimple_cast (rhs)
799 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
800 *gimplify_init_stmts_p = true;
804 /* Generate code to initialize the parameters of the function at the
805 top of the stack in ID from the ARGS (presented as a TREE_LIST). */
808 initialize_inlined_parameters (inline_data *id, tree args, tree static_chain,
809 tree fn, tree bind_expr)
811 tree init_stmts = NULL_TREE;
815 tree vars = NULL_TREE;
816 bool gimplify_init_stmts_p = false;
819 /* Figure out what the parameters are. */
820 parms = DECL_ARGUMENTS (fn);
821 if (fn == current_function_decl)
822 parms = cfun->saved_args;
824 /* Loop through the parameter declarations, replacing each with an
825 equivalent VAR_DECL, appropriately initialized. */
826 for (p = parms, a = args; p;
827 a = a ? TREE_CHAIN (a) : a, p = TREE_CHAIN (p))
833 /* Find the initializer. */
834 value = lang_hooks.tree_inlining.convert_parm_for_inlining
835 (p, a ? TREE_VALUE (a) : NULL_TREE, fn, argnum);
837 setup_one_parameter (id, p, value, fn, &init_stmts, &vars,
838 &gimplify_init_stmts_p);
841 /* Evaluate trailing arguments. */
842 for (; a; a = TREE_CHAIN (a))
844 tree value = TREE_VALUE (a);
845 append_to_statement_list (value, &init_stmts);
848 /* Initialize the static chain. */
849 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
852 /* No static chain? Seems like a bug in tree-nested.c. */
856 setup_one_parameter (id, p, static_chain, fn, &init_stmts, &vars,
857 &gimplify_init_stmts_p);
860 if (gimplify_init_stmts_p && lang_hooks.gimple_before_inlining)
861 gimplify_body (&init_stmts, fn);
863 declare_inline_vars (bind_expr, vars);
867 /* Declare a return variable to replace the RESULT_DECL for the
868 function we are calling. An appropriate DECL_STMT is returned.
869 The USE_STMT is filled in to contain a use of the declaration to
870 indicate the return value of the function. */
873 declare_return_variable (inline_data *id, tree return_slot_addr, tree *use_p)
875 tree fn = VARRAY_TOP_TREE (id->fns);
876 tree result = DECL_RESULT (fn);
877 int need_return_decl = 1;
880 /* We don't need to do anything for functions that don't return
882 if (!result || VOID_TYPE_P (TREE_TYPE (result)))
888 var = (lang_hooks.tree_inlining.copy_res_decl_for_inlining
889 (result, fn, VARRAY_TREE (id->fns, 0), id->decl_map,
890 &need_return_decl, return_slot_addr));
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 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
897 way, when the RESULT_DECL is encountered, it will be
898 automatically replaced by the VAR_DECL. */
899 insert_decl_map (id, result, var);
901 /* Remember this so we can ignore it in remap_decls. */
904 /* Build the use expr. If the return type of the function was
905 promoted, convert it back to the expected type. */
906 if (return_slot_addr)
907 /* The function returns through an explicit return slot, not a normal
910 else if (TREE_TYPE (var) == TREE_TYPE (TREE_TYPE (fn)))
912 else if (TREE_CODE (var) == INDIRECT_REF)
913 *use_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (fn)),
914 TREE_OPERAND (var, 0));
915 else if (TREE_ADDRESSABLE (TREE_TYPE (var)))
918 *use_p = build1 (NOP_EXPR, TREE_TYPE (TREE_TYPE (fn)), var);
920 /* Build the declaration statement if FN does not return an
922 if (need_return_decl)
924 /* If FN does return an aggregate, there's no need to declare the
925 return variable; we're using a variable in our caller's frame. */
930 /* Returns nonzero if a function can be inlined as a tree. */
933 tree_inlinable_function_p (tree fn)
935 return inlinable_function_p (fn);
938 static const char *inline_forbidden_reason;
941 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
945 tree fn = (tree) fnp;
948 switch (TREE_CODE (node))
951 /* Refuse to inline alloca call unless user explicitly forced so as
952 this may change program's memory overhead drastically when the
953 function using alloca is called in loop. In GCC present in
954 SPEC2000 inlining into schedule_block cause it to require 2GB of
955 RAM instead of 256MB. */
956 if (alloca_call_p (node)
957 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
959 inline_forbidden_reason
960 = N_("%Jfunction '%F' can never be inlined because it uses "
961 "alloca (override using the always_inline attribute)");
964 t = get_callee_fndecl (node);
969 /* We cannot inline functions that call setjmp. */
970 if (setjmp_call_p (t))
972 inline_forbidden_reason
973 = N_("%Jfunction '%F' can never be inlined because it uses setjmp");
977 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
978 switch (DECL_FUNCTION_CODE (t))
980 /* We cannot inline functions that take a variable number of
982 case BUILT_IN_VA_START:
983 case BUILT_IN_STDARG_START:
984 case BUILT_IN_NEXT_ARG:
985 case BUILT_IN_VA_END:
986 inline_forbidden_reason
987 = N_("%Jfunction '%F' can never be inlined because it "
988 "uses variable argument lists");
991 case BUILT_IN_LONGJMP:
992 /* We can't inline functions that call __builtin_longjmp at
993 all. The non-local goto machinery really requires the
994 destination be in a different function. If we allow the
995 function calling __builtin_longjmp to be inlined into the
996 function calling __builtin_setjmp, Things will Go Awry. */
997 inline_forbidden_reason
998 = N_("%Jfunction '%F' can never be inlined because "
999 "it uses setjmp-longjmp exception handling");
1002 case BUILT_IN_NONLOCAL_GOTO:
1004 inline_forbidden_reason
1005 = N_("%Jfunction '%F' can never be inlined because "
1006 "it uses non-local goto");
1015 for (t = BIND_EXPR_VARS (node); t ; t = TREE_CHAIN (t))
1017 /* We cannot inline functions that contain other functions. */
1018 if (TREE_CODE (t) == FUNCTION_DECL && DECL_INITIAL (t))
1020 inline_forbidden_reason
1021 = N_("%Jfunction '%F' can never be inlined "
1022 "because it contains a nested function");
1029 t = TREE_OPERAND (node, 0);
1031 /* We will not inline a function which uses computed goto. The
1032 addresses of its local labels, which may be tucked into
1033 global storage, are of course not constant across
1034 instantiations, which causes unexpected behavior. */
1035 if (TREE_CODE (t) != LABEL_DECL)
1037 inline_forbidden_reason
1038 = N_("%Jfunction '%F' can never be inlined "
1039 "because it contains a computed goto");
1045 t = TREE_OPERAND (node, 0);
1046 if (DECL_NONLOCAL (t))
1048 /* We cannot inline a function that receives a non-local goto
1049 because we cannot remap the destination label used in the
1050 function that is performing the non-local goto. */
1051 inline_forbidden_reason
1052 = N_("%Jfunction '%F' can never be inlined "
1053 "because it receives a non-local goto");
1059 /* We cannot inline a function of the form
1061 void F (int i) { struct S { int ar[i]; } s; }
1063 Attempting to do so produces a catch-22.
1064 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1065 UNION_TYPE nodes, then it goes into infinite recursion on a
1066 structure containing a pointer to its own type. If it doesn't,
1067 then the type node for S doesn't get adjusted properly when
1068 F is inlined, and we abort in find_function_data. */
1069 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1070 if (variably_modified_type_p (TREE_TYPE (t)))
1072 inline_forbidden_reason
1073 = N_("%Jfunction '%F' can never be inlined "
1074 "because it uses variable sized variables");
1085 /* Return subexpression representing possible alloca call, if any. */
1087 inline_forbidden_p (tree fndecl)
1089 location_t saved_loc = input_location;
1090 tree ret = walk_tree_without_duplicates
1091 (&DECL_SAVED_TREE (fndecl), inline_forbidden_p_1, fndecl);
1092 input_location = saved_loc;
1096 /* Returns nonzero if FN is a function that does not have any
1097 fundamental inline blocking properties. */
1100 inlinable_function_p (tree fn)
1102 bool inlinable = true;
1104 /* If we've already decided this function shouldn't be inlined,
1105 there's no need to check again. */
1106 if (DECL_UNINLINABLE (fn))
1109 /* See if there is any language-specific reason it cannot be
1110 inlined. (It is important that this hook be called early because
1111 in C++ it may result in template instantiation.)
1112 If the function is not inlinable for language-specific reasons,
1113 it is left up to the langhook to explain why. */
1114 inlinable = !lang_hooks.tree_inlining.cannot_inline_tree_fn (&fn);
1116 /* If we don't have the function body available, we can't inline it.
1117 However, this should not be recorded since we also get here for
1118 forward declared inline functions. Therefore, return at once. */
1119 if (!DECL_SAVED_TREE (fn))
1122 /* If we're not inlining at all, then we cannot inline this function. */
1123 else if (!flag_inline_trees)
1126 /* Only try to inline functions if DECL_INLINE is set. This should be
1127 true for all functions declared `inline', and for all other functions
1128 as well with -finline-functions.
1130 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1131 it's the front-end that must set DECL_INLINE in this case, because
1132 dwarf2out loses if a function that does not have DECL_INLINE set is
1133 inlined anyway. That is why we have both DECL_INLINE and
1134 DECL_DECLARED_INLINE_P. */
1135 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1136 here should be redundant. */
1137 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
1140 #ifdef INLINER_FOR_JAVA
1141 /* Synchronized methods can't be inlined. This is a bug. */
1142 else if (METHOD_SYNCHRONIZED (fn))
1144 #endif /* INLINER_FOR_JAVA */
1146 else if (inline_forbidden_p (fn))
1148 /* See if we should warn about uninlinable functions. Previously,
1149 some of these warnings would be issued while trying to expand
1150 the function inline, but that would cause multiple warnings
1151 about functions that would for example call alloca. But since
1152 this a property of the function, just one warning is enough.
1153 As a bonus we can now give more details about the reason why a
1154 function is not inlinable.
1155 We only warn for functions declared `inline' by the user. */
1156 bool do_warning = (warn_inline
1158 && DECL_DECLARED_INLINE_P (fn)
1159 && !DECL_IN_SYSTEM_HEADER (fn));
1161 if (lookup_attribute ("always_inline",
1162 DECL_ATTRIBUTES (fn)))
1163 sorry (inline_forbidden_reason, fn, fn);
1164 else if (do_warning)
1165 warning (inline_forbidden_reason, fn, fn);
1170 /* Squirrel away the result so that we don't have to check again. */
1171 DECL_UNINLINABLE (fn) = !inlinable;
1176 /* Used by estimate_num_insns. Estimate number of instructions seen
1177 by given statement. */
1179 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
1184 if (TYPE_P (x) || DECL_P (x))
1189 /* Assume that constants and references counts nothing. These should
1190 be majorized by amount of operations among them we count later
1191 and are common target of CSE and similar optimizations. */
1192 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
1193 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
1195 switch (TREE_CODE (x))
1197 /* Containers have no cost. */
1206 case ARRAY_RANGE_REF:
1208 case EXC_PTR_EXPR: /* ??? */
1209 case FILTER_EXPR: /* ??? */
1212 case LABELED_BLOCK_EXPR:
1213 case WITH_CLEANUP_EXPR:
1215 case VIEW_CONVERT_EXPR:
1219 case REFERENCE_EXPR:
1223 case EXIT_BLOCK_EXPR:
1224 case CASE_LABEL_EXPR:
1227 case EH_FILTER_EXPR:
1228 case STATEMENT_LIST:
1230 case NON_LVALUE_EXPR:
1231 case ENTRY_VALUE_EXPR:
1234 case TRY_CATCH_EXPR:
1235 case TRY_FINALLY_EXPR:
1247 /* We don't account constants for now. Assume that the cost is amortized
1248 by operations that do use them. We may re-consider this decision once
1249 we are able to optimize the tree before estimating it's size and break
1250 out static initializers. */
1251 case IDENTIFIER_NODE:
1259 /* Recognize assignments of large structures and constructors of
1268 size = int_size_in_bytes (TREE_TYPE (x));
1270 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
1273 *count += ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
1277 /* Assign cost of 1 to usual operations.
1278 ??? We may consider mapping RTL costs to this. */
1285 case FIX_TRUNC_EXPR:
1287 case FIX_FLOOR_EXPR:
1288 case FIX_ROUND_EXPR:
1306 case TRUTH_ANDIF_EXPR:
1307 case TRUTH_ORIF_EXPR:
1308 case TRUTH_AND_EXPR:
1310 case TRUTH_XOR_EXPR:
1311 case TRUTH_NOT_EXPR:
1320 case UNORDERED_EXPR:
1333 case PREDECREMENT_EXPR:
1334 case PREINCREMENT_EXPR:
1335 case POSTDECREMENT_EXPR:
1336 case POSTINCREMENT_EXPR:
1346 /* Few special cases of expensive operations. This is useful
1347 to avoid inlining on functions having too many of these. */
1348 case TRUNC_DIV_EXPR:
1350 case FLOOR_DIV_EXPR:
1351 case ROUND_DIV_EXPR:
1352 case EXACT_DIV_EXPR:
1353 case TRUNC_MOD_EXPR:
1355 case FLOOR_MOD_EXPR:
1356 case ROUND_MOD_EXPR:
1362 tree decl = get_callee_fndecl (x);
1364 if (decl && DECL_BUILT_IN (decl))
1365 switch (DECL_FUNCTION_CODE (decl))
1367 case BUILT_IN_CONSTANT_P:
1370 case BUILT_IN_EXPECT:
1379 /* Abort here se we know we don't miss any nodes. */
1385 /* Estimate number of instructions that will be created by expanding EXPR. */
1387 estimate_num_insns (tree expr)
1390 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &num);
1394 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
1397 expand_call_inline (tree *tp, int *walk_subtrees, void *data)
1411 tree return_slot_addr;
1412 location_t saved_location;
1413 struct cgraph_edge *edge;
1416 /* See what we've got. */
1417 id = (inline_data *) data;
1420 /* Set input_location here so we get the right instantiation context
1421 if we call instantiate_decl from inlinable_function_p. */
1422 saved_location = input_location;
1423 if (EXPR_HAS_LOCATION (t))
1424 input_location = EXPR_LOCATION (t);
1426 /* Recurse, but letting recursive invocations know that we are
1427 inside the body of a TARGET_EXPR. */
1428 if (TREE_CODE (*tp) == TARGET_EXPR)
1431 int i, len = first_rtl_op (TARGET_EXPR);
1433 /* We're walking our own subtrees. */
1436 /* Actually walk over them. This loop is the body of
1437 walk_trees, omitting the case where the TARGET_EXPR
1438 itself is handled. */
1439 for (i = 0; i < len; ++i)
1442 ++id->in_target_cleanup_p;
1443 walk_tree (&TREE_OPERAND (*tp, i), expand_call_inline, data,
1446 --id->in_target_cleanup_p;
1454 /* Because types were not copied in copy_body, CALL_EXPRs beneath
1455 them should not be expanded. This can happen if the type is a
1456 dynamic array type, for example. */
1459 /* From here on, we're only interested in CALL_EXPRs. */
1460 if (TREE_CODE (t) != CALL_EXPR)
1463 /* First, see if we can figure out what function is being called.
1464 If we cannot, then there is no hope of inlining the function. */
1465 fn = get_callee_fndecl (t);
1469 /* Turn forward declarations into real ones. */
1470 fn = cgraph_node (fn)->decl;
1472 /* If fn is a declaration of a function in a nested scope that was
1473 globally declared inline, we don't set its DECL_INITIAL.
1474 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
1475 C++ front-end uses it for cdtors to refer to their internal
1476 declarations, that are not real functions. Fortunately those
1477 don't have trees to be saved, so we can tell by checking their
1479 if (! DECL_INITIAL (fn)
1480 && DECL_ABSTRACT_ORIGIN (fn)
1481 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
1482 fn = DECL_ABSTRACT_ORIGIN (fn);
1484 /* Objective C and fortran still calls tree_rest_of_compilation directly.
1485 Kill this check once this is fixed. */
1486 if (!id->current_node->analyzed)
1489 edge = cgraph_edge (id->current_node, t);
1491 /* Constant propagation on argument done during previous inlining
1492 may create new direct call. Produce an edge for it. */
1495 struct cgraph_node *dest = cgraph_node (fn);
1497 /* We have missing edge in the callgraph. This can happen in one case
1498 where previous inlining turned indirect call into direct call by
1499 constant propagating arguments. In all other cases we hit a bug
1500 (incorrect node sharing is most common reason for missing edges. */
1503 cgraph_create_edge (id->node, dest, t)->inline_failed
1504 = N_("originally indirect function call not considered for inlining");
1508 /* Don't try to inline functions that are not well-suited to
1510 if (!cgraph_inline_p (edge, &reason))
1512 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1514 sorry ("%Jinlining failed in call to '%F': %s", fn, fn, reason);
1515 sorry ("called from here");
1517 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
1518 && !DECL_IN_SYSTEM_HEADER (fn)
1521 warning ("%Jinlining failed in call to '%F': %s", fn, fn, reason);
1522 warning ("called from here");
1527 #ifdef ENABLE_CHECKING
1528 if (edge->callee->decl != id->node->decl)
1529 verify_cgraph_node (edge->callee);
1532 if (! lang_hooks.tree_inlining.start_inlining (fn))
1535 /* Build a block containing code to initialize the arguments, the
1536 actual inline expansion of the body, and a label for the return
1537 statements within the function to jump to. The type of the
1538 statement expression is the return type of the function call. */
1540 expr = build (BIND_EXPR, TREE_TYPE (TREE_TYPE (fn)), NULL_TREE,
1541 stmt, make_node (BLOCK));
1542 BLOCK_ABSTRACT_ORIGIN (BIND_EXPR_BLOCK (expr)) = fn;
1544 /* Local declarations will be replaced by their equivalents in this
1547 id->decl_map = splay_tree_new (splay_tree_compare_pointers,
1550 /* Initialize the parameters. */
1551 args = TREE_OPERAND (t, 1);
1552 return_slot_addr = NULL_TREE;
1553 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (t))
1555 return_slot_addr = TREE_VALUE (args);
1556 args = TREE_CHAIN (args);
1557 TREE_TYPE (expr) = void_type_node;
1560 arg_inits = initialize_inlined_parameters (id, args, TREE_OPERAND (t, 2),
1564 /* Expand any inlined calls in the initializers. Do this before we
1565 push FN on the stack of functions we are inlining; we want to
1566 inline calls to FN that appear in the initializers for the
1569 Note we need to save and restore the saved tree statement iterator
1570 to avoid having it clobbered by expand_calls_inline. */
1571 tree_stmt_iterator save_tsi;
1574 expand_calls_inline (&arg_inits, id);
1577 /* And add them to the tree. */
1578 append_to_statement_list (arg_inits, &BIND_EXPR_BODY (expr));
1581 /* Record the function we are about to inline so that we can avoid
1582 recursing into it. */
1583 VARRAY_PUSH_TREE (id->fns, fn);
1585 /* Record the function we are about to inline if optimize_function
1586 has not been called on it yet and we don't have it in the list. */
1587 if (! DECL_INLINED_FNS (fn))
1591 for (i = VARRAY_ACTIVE_SIZE (id->inlined_fns) - 1; i >= 0; i--)
1592 if (VARRAY_TREE (id->inlined_fns, i) == fn)
1595 VARRAY_PUSH_TREE (id->inlined_fns, fn);
1598 /* Return statements in the function body will be replaced by jumps
1599 to the RET_LABEL. */
1600 id->ret_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
1601 DECL_ARTIFICIAL (id->ret_label) = 1;
1602 DECL_CONTEXT (id->ret_label) = VARRAY_TREE (id->fns, 0);
1603 insert_decl_map (id, id->ret_label, id->ret_label);
1605 if (! DECL_INITIAL (fn)
1606 || TREE_CODE (DECL_INITIAL (fn)) != BLOCK)
1609 /* Declare the return variable for the function. */
1610 decl = declare_return_variable (id, return_slot_addr, &use_retvar);
1612 declare_inline_vars (expr, decl);
1614 /* After we've initialized the parameters, we insert the body of the
1617 struct cgraph_node *old_node = id->current_node;
1619 id->current_node = edge->callee;
1620 append_to_statement_list (copy_body (id), &BIND_EXPR_BODY (expr));
1621 id->current_node = old_node;
1623 inlined_body = &BIND_EXPR_BODY (expr);
1625 /* After the body of the function comes the RET_LABEL. This must come
1626 before we evaluate the returned value below, because that evaluation
1627 may cause RTL to be generated. */
1628 if (TREE_USED (id->ret_label))
1630 tree label = build1 (LABEL_EXPR, void_type_node, id->ret_label);
1631 append_to_statement_list (label, &BIND_EXPR_BODY (expr));
1634 /* Finally, mention the returned value so that the value of the
1635 statement-expression is the returned value of the function. */
1637 /* Set TREE_TYPE on BIND_EXPR? */
1638 append_to_statement_list_force (use_retvar, &BIND_EXPR_BODY (expr));
1641 splay_tree_delete (id->decl_map);
1644 /* The new expression has side-effects if the old one did. */
1645 TREE_SIDE_EFFECTS (expr) = TREE_SIDE_EFFECTS (t);
1647 /* If we are working with gimple form, then we need to keep the tree
1648 in gimple form. If we are not in gimple form, we can just replace
1649 *tp with the new BIND_EXPR. */
1650 if (lang_hooks.gimple_before_inlining)
1654 /* Keep the new trees in gimple form. */
1655 BIND_EXPR_BODY (expr)
1656 = rationalize_compound_expr (BIND_EXPR_BODY (expr));
1658 /* We want to create a new variable to hold the result of the
1659 inlined body. This new variable needs to be added to the
1660 function which we are inlining into, thus the saving and
1661 restoring of current_function_decl. */
1662 save_decl = current_function_decl;
1663 current_function_decl = id->node->decl;
1664 inline_result = voidify_wrapper_expr (expr);
1665 current_function_decl = save_decl;
1667 /* If the inlined function returns a result that we care about,
1668 then we're going to need to splice in a MODIFY_EXPR. Otherwise
1669 the call was a standalone statement and we can just replace it
1670 with the BIND_EXPR inline representation of the called function. */
1671 if (TREE_CODE (tsi_stmt (id->tsi)) != CALL_EXPR)
1673 tsi_link_before (&id->tsi, expr, TSI_SAME_STMT);
1674 *tp = inline_result;
1679 /* When we gimplify a function call, we may clear TREE_SIDE_EFFECTS
1680 on the call if it is to a "const" function. Thus the copy of
1681 TREE_SIDE_EFFECTS from the CALL_EXPR to the BIND_EXPR above
1682 with result in TREE_SIDE_EFFECTS not being set for the inlined
1683 copy of a "const" function.
1685 Unfortunately, that is wrong as inlining the function
1686 can create/expose interesting side effects (such as setting
1689 The easiest solution is to simply recalculate TREE_SIDE_EFFECTS
1690 for the toplevel expression. */
1691 recalculate_side_effects (expr);
1696 /* If the value of the new expression is ignored, that's OK. We
1697 don't warn about this for CALL_EXPRs, so we shouldn't warn about
1698 the equivalent inlined version either. */
1699 TREE_USED (*tp) = 1;
1701 /* Update callgraph if needed. */
1702 cgraph_remove_node (edge->callee);
1704 /* Recurse into the body of the just inlined function. */
1705 expand_calls_inline (inlined_body, id);
1706 VARRAY_POP (id->fns);
1708 /* Don't walk into subtrees. We've already handled them above. */
1711 lang_hooks.tree_inlining.end_inlining (fn);
1713 /* Keep iterating. */
1715 input_location = saved_location;
1720 gimple_expand_calls_inline (tree *stmt_p, inline_data *id)
1722 tree stmt = *stmt_p;
1723 enum tree_code code = TREE_CODE (stmt);
1728 case STATEMENT_LIST:
1730 tree_stmt_iterator i;
1733 for (i = tsi_start (stmt); !tsi_end_p (i); )
1736 gimple_expand_calls_inline (tsi_stmt_ptr (i), id);
1739 if (TREE_CODE (new) == STATEMENT_LIST)
1741 tsi_link_before (&i, new, TSI_SAME_STMT);
1751 gimple_expand_calls_inline (&COND_EXPR_THEN (stmt), id);
1752 gimple_expand_calls_inline (&COND_EXPR_ELSE (stmt), id);
1755 gimple_expand_calls_inline (&CATCH_BODY (stmt), id);
1757 case EH_FILTER_EXPR:
1758 gimple_expand_calls_inline (&EH_FILTER_FAILURE (stmt), id);
1760 case TRY_CATCH_EXPR:
1761 case TRY_FINALLY_EXPR:
1762 gimple_expand_calls_inline (&TREE_OPERAND (stmt, 0), id);
1763 gimple_expand_calls_inline (&TREE_OPERAND (stmt, 1), id);
1766 gimple_expand_calls_inline (&BIND_EXPR_BODY (stmt), id);
1770 /* We're gimple. We should have gotten rid of all these. */
1774 stmt_p = &TREE_OPERAND (stmt, 0);
1776 if (!stmt || TREE_CODE (stmt) != MODIFY_EXPR)
1780 stmt_p = &TREE_OPERAND (stmt, 1);
1782 if (TREE_CODE (stmt) != CALL_EXPR)
1786 expand_call_inline (stmt_p, &dummy, id);
1794 /* Walk over the entire tree *TP, replacing CALL_EXPRs with inline
1795 expansions as appropriate. */
1798 expand_calls_inline (tree *tp, inline_data *id)
1800 /* If we are not in gimple form, then we want to walk the tree
1801 recursively as we do not know anything about the structure
1804 if (!lang_hooks.gimple_before_inlining)
1806 walk_tree (tp, expand_call_inline, id, id->tree_pruner);
1810 /* We are in gimple form. We want to stay in gimple form. Walk
1811 the statements, inlining calls in each statement. By walking
1812 the statements, we have enough information to keep the tree
1813 in gimple form as we insert inline bodies. */
1815 gimple_expand_calls_inline (tp, id);
1818 /* Expand calls to inline functions in the body of FN. */
1821 optimize_inline_calls (tree fn)
1826 /* There is no point in performing inlining if errors have already
1827 occurred -- and we might crash if we try to inline invalid
1829 if (errorcount || sorrycount)
1833 memset (&id, 0, sizeof (id));
1835 id.current_node = id.node = cgraph_node (fn);
1836 /* Don't allow recursion into FN. */
1837 VARRAY_TREE_INIT (id.fns, 32, "fns");
1838 VARRAY_PUSH_TREE (id.fns, fn);
1839 /* Or any functions that aren't finished yet. */
1840 prev_fn = NULL_TREE;
1841 if (current_function_decl)
1843 VARRAY_PUSH_TREE (id.fns, current_function_decl);
1844 prev_fn = current_function_decl;
1847 prev_fn = (lang_hooks.tree_inlining.add_pending_fn_decls
1848 (&id.fns, prev_fn));
1850 /* Create the list of functions this call will inline. */
1851 VARRAY_TREE_INIT (id.inlined_fns, 32, "inlined_fns");
1853 /* Keep track of the low-water mark, i.e., the point where the first
1854 real inlining is represented in ID.FNS. */
1855 id.first_inlined_fn = VARRAY_ACTIVE_SIZE (id.fns);
1857 /* Replace all calls to inline functions with the bodies of those
1859 id.tree_pruner = htab_create (37, htab_hash_pointer,
1860 htab_eq_pointer, NULL);
1861 expand_calls_inline (&DECL_SAVED_TREE (fn), &id);
1864 htab_delete (id.tree_pruner);
1865 if (DECL_LANG_SPECIFIC (fn))
1867 tree ifn = make_tree_vec (VARRAY_ACTIVE_SIZE (id.inlined_fns));
1869 if (VARRAY_ACTIVE_SIZE (id.inlined_fns))
1870 memcpy (&TREE_VEC_ELT (ifn, 0), &VARRAY_TREE (id.inlined_fns, 0),
1871 VARRAY_ACTIVE_SIZE (id.inlined_fns) * sizeof (tree));
1872 DECL_INLINED_FNS (fn) = ifn;
1875 #ifdef ENABLE_CHECKING
1877 struct cgraph_edge *e;
1879 verify_cgraph_node (id.node);
1881 /* Double check that we inlined everything we are supposed to inline. */
1882 for (e = id.node->callees; e; e = e->next_callee)
1883 if (!e->inline_failed)
1889 /* FN is a function that has a complete body, and CLONE is a function
1890 whose body is to be set to a copy of FN, mapping argument
1891 declarations according to the ARG_MAP splay_tree. */
1894 clone_body (tree clone, tree fn, void *arg_map)
1898 /* Clone the body, as if we were making an inline call. But, remap
1899 the parameters in the callee to the parameters of caller. If
1900 there's an in-charge parameter, map it to an appropriate
1902 memset (&id, 0, sizeof (id));
1903 VARRAY_TREE_INIT (id.fns, 2, "fns");
1904 VARRAY_PUSH_TREE (id.fns, clone);
1905 VARRAY_PUSH_TREE (id.fns, fn);
1906 id.decl_map = (splay_tree)arg_map;
1908 /* Cloning is treated slightly differently from inlining. Set
1909 CLONING_P so that it's clear which operation we're performing. */
1910 id.cloning_p = true;
1912 /* Actually copy the body. */
1913 TREE_CHAIN (DECL_SAVED_TREE (clone)) = copy_body (&id);
1916 /* Save duplicate of body in FN. MAP is used to pass around splay tree
1917 used to update arguments in restore_body. */
1919 save_body (tree fn, tree *arg_copy)
1924 memset (&id, 0, sizeof (id));
1925 VARRAY_TREE_INIT (id.fns, 1, "fns");
1926 VARRAY_PUSH_TREE (id.fns, fn);
1927 id.node = cgraph_node (fn);
1929 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
1930 *arg_copy = DECL_ARGUMENTS (fn);
1931 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
1933 tree new = copy_node (*parg);
1934 lang_hooks.dup_lang_specific_decl (new);
1935 DECL_ABSTRACT_ORIGIN (new) = DECL_ORIGIN (*parg);
1936 insert_decl_map (&id, *parg, new);
1937 TREE_CHAIN (new) = TREE_CHAIN (*parg);
1940 insert_decl_map (&id, DECL_RESULT (fn), DECL_RESULT (fn));
1942 /* Actually copy the body. */
1943 body = copy_body (&id);
1946 splay_tree_delete (id.decl_map);
1950 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal.
1951 FUNC is called with the DATA and the address of each sub-tree. If
1952 FUNC returns a non-NULL value, the traversal is aborted, and the
1953 value returned by FUNC is returned. If HTAB is non-NULL it is used
1954 to record the nodes visited, and to avoid visiting a node more than
1958 walk_tree (tree *tp, walk_tree_fn func, void *data, void *htab_)
1960 htab_t htab = (htab_t) htab_;
1961 enum tree_code code;
1965 #define WALK_SUBTREE(NODE) \
1968 result = walk_tree (&(NODE), func, data, htab); \
1974 #define WALK_SUBTREE_TAIL(NODE) \
1978 goto tail_recurse; \
1983 /* Skip empty subtrees. */
1991 /* Don't walk the same tree twice, if the user has requested
1992 that we avoid doing so. */
1993 slot = htab_find_slot (htab, *tp, INSERT);
1999 /* Call the function. */
2001 result = (*func) (tp, &walk_subtrees, data);
2003 /* If we found something, return it. */
2007 code = TREE_CODE (*tp);
2009 /* Even if we didn't, FUNC may have decided that there was nothing
2010 interesting below this point in the tree. */
2013 if (code == TREE_LIST
2014 || lang_hooks.tree_inlining.tree_chain_matters_p (*tp))
2015 /* But we still need to check our siblings. */
2016 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
2021 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
2023 if (result || ! walk_subtrees)
2026 if (code != EXIT_BLOCK_EXPR
2027 && code != SAVE_EXPR
2028 && code != BIND_EXPR
2029 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
2033 /* Walk over all the sub-trees of this operand. */
2034 len = first_rtl_op (code);
2035 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
2036 But, we only want to walk once. */
2037 if (code == TARGET_EXPR
2038 && TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1))
2040 /* Go through the subtrees. We need to do this in forward order so
2041 that the scope of a FOR_EXPR is handled properly. */
2042 #ifdef DEBUG_WALK_TREE
2043 for (i = 0; i < len; ++i)
2044 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2046 for (i = 0; i < len - 1; ++i)
2047 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2051 /* The common case is that we may tail recurse here. */
2052 if (code != BIND_EXPR
2053 && !TREE_CHAIN (*tp))
2054 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
2056 WALK_SUBTREE (TREE_OPERAND (*tp, len - 1));
2060 if (lang_hooks.tree_inlining.tree_chain_matters_p (*tp))
2061 /* Check our siblings. */
2062 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
2064 else if (TREE_CODE_CLASS (code) == 'd')
2066 WALK_SUBTREE_TAIL (TREE_TYPE (*tp));
2070 if (TREE_CODE_CLASS (code) == 't')
2072 WALK_SUBTREE (TYPE_SIZE (*tp));
2073 WALK_SUBTREE (TYPE_SIZE_UNIT (*tp));
2074 /* Also examine various special fields, below. */
2077 /* Not one of the easy cases. We must explicitly go through the
2082 case IDENTIFIER_NODE:
2096 case PLACEHOLDER_EXPR:
2098 /* None of thse have subtrees other than those already walked
2103 case REFERENCE_TYPE:
2104 WALK_SUBTREE_TAIL (TREE_TYPE (*tp));
2108 WALK_SUBTREE (TREE_VALUE (*tp));
2109 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
2114 int len = TREE_VEC_LENGTH (*tp);
2119 /* Walk all elements but the first. */
2121 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
2123 /* Now walk the first one as a tail call. */
2124 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
2128 WALK_SUBTREE (TREE_REALPART (*tp));
2129 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
2132 WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp));
2135 WALK_SUBTREE (TYPE_METHOD_BASETYPE (*tp));
2139 WALK_SUBTREE (TREE_TYPE (*tp));
2141 tree arg = TYPE_ARG_TYPES (*tp);
2143 /* We never want to walk into default arguments. */
2144 for (; arg; arg = TREE_CHAIN (arg))
2145 WALK_SUBTREE (TREE_VALUE (arg));
2150 WALK_SUBTREE (TREE_TYPE (*tp));
2151 WALK_SUBTREE_TAIL (TYPE_DOMAIN (*tp));
2155 WALK_SUBTREE (TYPE_MIN_VALUE (*tp));
2156 WALK_SUBTREE_TAIL (TYPE_MAX_VALUE (*tp));
2159 WALK_SUBTREE (TREE_TYPE (*tp));
2160 WALK_SUBTREE_TAIL (TYPE_OFFSET_BASETYPE (*tp));
2162 case EXIT_BLOCK_EXPR:
2163 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 1));
2166 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
2171 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
2173 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
2174 into declarations that are just mentioned, rather than
2175 declared; they don't really belong to this part of the tree.
2176 And, we can see cycles: the initializer for a declaration can
2177 refer to the declaration itself. */
2178 WALK_SUBTREE (DECL_INITIAL (decl));
2179 WALK_SUBTREE (DECL_SIZE (decl));
2180 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
2181 WALK_SUBTREE (TREE_TYPE (decl));
2183 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
2186 case STATEMENT_LIST:
2188 tree_stmt_iterator i;
2189 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
2190 WALK_SUBTREE (*tsi_stmt_ptr (i));
2199 /* We didn't find what we were looking for. */
2203 #undef WALK_SUBTREE_TAIL
2206 /* Like walk_tree, but does not walk duplicate nodes more than
2210 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
2215 htab = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
2216 result = walk_tree (tp, func, data, htab);
2221 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2224 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2226 enum tree_code code = TREE_CODE (*tp);
2228 /* We make copies of most nodes. */
2229 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
2230 || TREE_CODE_CLASS (code) == 'c'
2231 || code == TREE_LIST
2233 || code == TYPE_DECL
2234 || lang_hooks.tree_inlining.tree_chain_matters_p (*tp))
2236 /* Because the chain gets clobbered when we make a copy, we save it
2238 tree chain = TREE_CHAIN (*tp);
2241 /* Copy the node. */
2242 new = copy_node (*tp);
2244 /* Propagate mudflap marked-ness. */
2245 if (flag_mudflap && mf_marked_p (*tp))
2250 /* Now, restore the chain, if appropriate. That will cause
2251 walk_tree to walk into the chain as well. */
2252 if (code == PARM_DECL || code == TREE_LIST
2253 || lang_hooks.tree_inlining.tree_chain_matters_p (*tp))
2254 TREE_CHAIN (*tp) = chain;
2256 /* For now, we don't update BLOCKs when we make copies. So, we
2257 have to nullify all BIND_EXPRs. */
2258 if (TREE_CODE (*tp) == BIND_EXPR)
2259 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
2261 else if (TREE_CODE_CLASS (code) == 't')
2263 else if (TREE_CODE_CLASS (code) == 'd')
2265 else if (code == STATEMENT_LIST)
2271 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2272 information indicating to what new SAVE_EXPR this one should be
2273 mapped, use that one. Otherwise, create a new node and enter it in
2274 ST. FN is the function into which the copy will be placed. */
2277 remap_save_expr (tree *tp, void *st_, tree fn, int *walk_subtrees)
2279 splay_tree st = (splay_tree) st_;
2283 /* See if we already encountered this SAVE_EXPR. */
2284 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2286 /* If we didn't already remap this SAVE_EXPR, do so now. */
2289 t = copy_node (*tp);
2291 /* The SAVE_EXPR is now part of the function into which we
2292 are inlining this body. */
2293 SAVE_EXPR_CONTEXT (t) = fn;
2294 /* And we haven't evaluated it yet. */
2295 SAVE_EXPR_RTL (t) = NULL_RTX;
2296 /* Remember this SAVE_EXPR. */
2297 splay_tree_insert (st, (splay_tree_key) *tp, (splay_tree_value) t);
2298 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2299 splay_tree_insert (st, (splay_tree_key) t, (splay_tree_value) t);
2303 /* We've already walked into this SAVE_EXPR; don't do it again. */
2305 t = (tree) n->value;
2308 /* Replace this SAVE_EXPR with the copy. */
2312 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2313 declaration, copies the declaration and enters it in the splay_tree
2314 in DATA (which is really an `inline_data *'). */
2317 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2321 inline_data *id = (inline_data *) data;
2324 /* Don't walk into types. */
2331 if (TREE_CODE (t) == LABEL_EXPR)
2332 decl = TREE_OPERAND (t, 0);
2334 /* We don't need to handle anything else ahead of time. */
2342 copy = copy_decl_for_inlining (decl,
2343 DECL_CONTEXT (decl),
2344 DECL_CONTEXT (decl));
2346 /* Remember the copy. */
2347 insert_decl_map (id, decl, copy);
2353 /* Called via walk_tree when an expression is unsaved. Using the
2354 splay_tree pointed to by ST (which is really a `splay_tree'),
2355 remaps all local declarations to appropriate replacements. */
2358 unsave_r (tree *tp, int *walk_subtrees, void *data)
2360 inline_data *id = (inline_data *) data;
2361 splay_tree st = id->decl_map;
2364 /* Only a local declaration (variable or label). */
2365 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
2366 || TREE_CODE (*tp) == LABEL_DECL)
2368 /* Lookup the declaration. */
2369 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2371 /* If it's there, remap it. */
2373 *tp = (tree) n->value;
2375 else if (TREE_CODE (*tp) == STATEMENT_LIST)
2376 copy_statement_list (tp);
2377 else if (TREE_CODE (*tp) == BIND_EXPR)
2378 copy_bind_expr (tp, walk_subtrees, id);
2379 else if (TREE_CODE (*tp) == SAVE_EXPR)
2380 remap_save_expr (tp, st, current_function_decl, walk_subtrees);
2383 copy_tree_r (tp, walk_subtrees, NULL);
2385 /* Do whatever unsaving is required. */
2386 unsave_expr_1 (*tp);
2389 /* Keep iterating. */
2393 /* Default lang hook for "unsave_expr_now". Copies everything in EXPR and
2394 replaces variables, labels and SAVE_EXPRs local to EXPR. */
2397 lhd_unsave_expr_now (tree expr)
2401 /* There's nothing to do for NULL_TREE. */
2406 memset (&id, 0, sizeof (id));
2407 VARRAY_TREE_INIT (id.fns, 1, "fns");
2408 VARRAY_PUSH_TREE (id.fns, current_function_decl);
2409 id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2411 /* Walk the tree once to find local labels. */
2412 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
2414 /* Walk the tree again, copying, remapping, and unsaving. */
2415 walk_tree (&expr, unsave_r, &id, NULL);
2418 splay_tree_delete (id.decl_map);
2423 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
2425 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
2433 extern bool debug_find_tree (tree top, tree search);
2436 debug_find_tree (tree top, tree search)
2438 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
2442 /* Declare the variables created by the inliner. Add all the variables in
2443 VARS to BIND_EXPR. */
2446 declare_inline_vars (tree bind_expr, tree vars)
2448 if (lang_hooks.gimple_before_inlining)
2451 for (t = vars; t; t = TREE_CHAIN (t))
2452 vars->decl.seen_in_bind_expr = 1;
2455 add_var_to_bind_expr (bind_expr, vars);