mips.h (set_volatile): Delete.
[official-gcc.git] / gcc / tree-inline.c
blob55aef3d5c6e30f408dfb2ecd7450ec7e3615bd84
1 /* Tree inlining.
2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 #include "config.h"
23 #include "system.h"
24 #include "coretypes.h"
25 #include "tm.h"
26 #include "toplev.h"
27 #include "tree.h"
28 #include "tree-inline.h"
29 #include "rtl.h"
30 #include "expr.h"
31 #include "flags.h"
32 #include "params.h"
33 #include "input.h"
34 #include "insn-config.h"
35 #include "varray.h"
36 #include "hashtab.h"
37 #include "langhooks.h"
38 #include "basic-block.h"
39 #include "tree-iterator.h"
40 #include "cgraph.h"
41 #include "intl.h"
42 #include "tree-mudflap.h"
43 #include "tree-flow.h"
44 #include "function.h"
45 #include "ggc.h"
46 #include "tree-flow.h"
47 #include "diagnostic.h"
48 #include "except.h"
49 #include "debug.h"
50 #include "pointer-set.h"
51 #include "ipa-prop.h"
52 #include "value-prof.h"
53 #include "tree-pass.h"
54 #include "target.h"
55 #include "integrate.h"
57 /* I'm not real happy about this, but we need to handle gimple and
58 non-gimple trees. */
59 #include "tree-gimple.h"
61 /* Inlining, Cloning, Versioning, Parallelization
63 Inlining: a function body is duplicated, but the PARM_DECLs are
64 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
65 GIMPLE_MODIFY_STMTs that store to a dedicated returned-value variable.
66 The duplicated eh_region info of the copy will later be appended
67 to the info for the caller; the eh_region info in copied throwing
68 statements and RESX_EXPRs is adjusted accordingly.
70 Cloning: (only in C++) We have one body for a con/de/structor, and
71 multiple function decls, each with a unique parameter list.
72 Duplicate the body, using the given splay tree; some parameters
73 will become constants (like 0 or 1).
75 Versioning: a function body is duplicated and the result is a new
76 function rather than into blocks of an existing function as with
77 inlining. Some parameters will become constants.
79 Parallelization: a region of a function is duplicated resulting in
80 a new function. Variables may be replaced with complex expressions
81 to enable shared variable semantics.
83 All of these will simultaneously lookup any callgraph edges. If
84 we're going to inline the duplicated function body, and the given
85 function has some cloned callgraph nodes (one for each place this
86 function will be inlined) those callgraph edges will be duplicated.
87 If we're cloning the body, those callgraph edges will be
88 updated to point into the new body. (Note that the original
89 callgraph node and edge list will not be altered.)
91 See the CALL_EXPR handling case in copy_body_r (). */
93 /* 0 if we should not perform inlining.
94 1 if we should expand functions calls inline at the tree level.
95 2 if we should consider *all* functions to be inline
96 candidates. */
98 int flag_inline_trees = 0;
100 /* To Do:
102 o In order to make inlining-on-trees work, we pessimized
103 function-local static constants. In particular, they are now
104 always output, even when not addressed. Fix this by treating
105 function-local static constants just like global static
106 constants; the back-end already knows not to output them if they
107 are not needed.
109 o Provide heuristics to clamp inlining of recursive template
110 calls? */
113 /* Weights that estimate_num_insns uses for heuristics in inlining. */
115 eni_weights eni_inlining_weights;
117 /* Weights that estimate_num_insns uses to estimate the size of the
118 produced code. */
120 eni_weights eni_size_weights;
122 /* Weights that estimate_num_insns uses to estimate the time necessary
123 to execute the produced code. */
125 eni_weights eni_time_weights;
127 /* Prototypes. */
129 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
130 static tree copy_generic_body (copy_body_data *);
131 static bool inlinable_function_p (tree);
132 static void remap_block (tree *, copy_body_data *);
133 static tree remap_decls (tree, copy_body_data *);
134 static void copy_bind_expr (tree *, int *, copy_body_data *);
135 static tree mark_local_for_remap_r (tree *, int *, void *);
136 static void unsave_expr_1 (tree);
137 static tree unsave_r (tree *, int *, void *);
138 static void declare_inline_vars (tree, tree);
139 static void remap_save_expr (tree *, void *, int *);
140 static void add_lexical_block (tree current_block, tree new_block);
141 static tree copy_decl_to_var (tree, copy_body_data *);
142 static tree copy_result_decl_to_var (tree, copy_body_data *);
143 static tree copy_decl_no_change (tree, copy_body_data *);
144 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
146 /* Insert a tree->tree mapping for ID. Despite the name suggests
147 that the trees should be variables, it is used for more than that. */
149 void
150 insert_decl_map (copy_body_data *id, tree key, tree value)
152 *pointer_map_insert (id->decl_map, key) = value;
154 /* Always insert an identity map as well. If we see this same new
155 node again, we won't want to duplicate it a second time. */
156 if (key != value)
157 *pointer_map_insert (id->decl_map, value) = value;
160 /* Construct new SSA name for old NAME. ID is the inline context. */
162 static tree
163 remap_ssa_name (tree name, copy_body_data *id)
165 tree new;
166 tree *n;
168 gcc_assert (TREE_CODE (name) == SSA_NAME);
170 n = (tree *) pointer_map_contains (id->decl_map, name);
171 if (n)
172 return *n;
174 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
175 in copy_bb. */
176 new = remap_decl (SSA_NAME_VAR (name), id);
177 /* We might've substituted constant or another SSA_NAME for
178 the variable.
180 Replace the SSA name representing RESULT_DECL by variable during
181 inlining: this saves us from need to introduce PHI node in a case
182 return value is just partly initialized. */
183 if ((TREE_CODE (new) == VAR_DECL || TREE_CODE (new) == PARM_DECL)
184 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
185 || !id->transform_return_to_modify))
187 new = make_ssa_name (new, NULL);
188 insert_decl_map (id, name, new);
189 if (IS_EMPTY_STMT (SSA_NAME_DEF_STMT (name)))
191 SSA_NAME_DEF_STMT (new) = build_empty_stmt ();
192 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name)) == name)
193 set_default_def (SSA_NAME_VAR (new), new);
195 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new)
196 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
197 TREE_TYPE (new) = TREE_TYPE (SSA_NAME_VAR (new));
199 else
200 insert_decl_map (id, name, new);
201 return new;
204 /* Remap DECL during the copying of the BLOCK tree for the function. */
206 tree
207 remap_decl (tree decl, copy_body_data *id)
209 tree *n;
210 tree fn;
212 /* We only remap local variables in the current function. */
213 fn = id->src_fn;
215 /* See if we have remapped this declaration. */
217 n = (tree *) pointer_map_contains (id->decl_map, decl);
219 /* If we didn't already have an equivalent for this declaration,
220 create one now. */
221 if (!n)
223 /* Make a copy of the variable or label. */
224 tree t = id->copy_decl (decl, id);
226 /* Remember it, so that if we encounter this local entity again
227 we can reuse this copy. Do this early because remap_type may
228 need this decl for TYPE_STUB_DECL. */
229 insert_decl_map (id, decl, t);
231 if (!DECL_P (t))
232 return t;
234 /* Remap types, if necessary. */
235 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
236 if (TREE_CODE (t) == TYPE_DECL)
237 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
239 /* Remap sizes as necessary. */
240 walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
241 walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
243 /* If fields, do likewise for offset and qualifier. */
244 if (TREE_CODE (t) == FIELD_DECL)
246 walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
247 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
248 walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
251 if (cfun && gimple_in_ssa_p (cfun)
252 && (TREE_CODE (t) == VAR_DECL
253 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
255 tree def = gimple_default_def (id->src_cfun, decl);
256 get_var_ann (t);
257 if (TREE_CODE (decl) != PARM_DECL && def)
259 tree map = remap_ssa_name (def, id);
260 /* Watch out RESULT_DECLs whose SSA names map directly
261 to them. */
262 if (TREE_CODE (map) == SSA_NAME)
263 set_default_def (t, map);
265 add_referenced_var (t);
267 return t;
270 return unshare_expr (*n);
273 static tree
274 remap_type_1 (tree type, copy_body_data *id)
276 tree *node;
277 tree new, t;
279 if (type == NULL)
280 return type;
282 /* See if we have remapped this type. */
283 node = (tree *) pointer_map_contains (id->decl_map, type);
284 if (node)
285 return *node;
287 /* The type only needs remapping if it's variably modified. */
288 if (! variably_modified_type_p (type, id->src_fn))
290 insert_decl_map (id, type, type);
291 return type;
294 /* We do need a copy. build and register it now. If this is a pointer or
295 reference type, remap the designated type and make a new pointer or
296 reference type. */
297 if (TREE_CODE (type) == POINTER_TYPE)
299 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
300 TYPE_MODE (type),
301 TYPE_REF_CAN_ALIAS_ALL (type));
302 insert_decl_map (id, type, new);
303 return new;
305 else if (TREE_CODE (type) == REFERENCE_TYPE)
307 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
308 TYPE_MODE (type),
309 TYPE_REF_CAN_ALIAS_ALL (type));
310 insert_decl_map (id, type, new);
311 return new;
313 else
314 new = copy_node (type);
316 insert_decl_map (id, type, new);
318 /* This is a new type, not a copy of an old type. Need to reassociate
319 variants. We can handle everything except the main variant lazily. */
320 t = TYPE_MAIN_VARIANT (type);
321 if (type != t)
323 t = remap_type (t, id);
324 TYPE_MAIN_VARIANT (new) = t;
325 TYPE_NEXT_VARIANT (new) = TYPE_NEXT_VARIANT (t);
326 TYPE_NEXT_VARIANT (t) = new;
328 else
330 TYPE_MAIN_VARIANT (new) = new;
331 TYPE_NEXT_VARIANT (new) = NULL;
334 if (TYPE_STUB_DECL (type))
335 TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
337 /* Lazily create pointer and reference types. */
338 TYPE_POINTER_TO (new) = NULL;
339 TYPE_REFERENCE_TO (new) = NULL;
341 switch (TREE_CODE (new))
343 case INTEGER_TYPE:
344 case REAL_TYPE:
345 case FIXED_POINT_TYPE:
346 case ENUMERAL_TYPE:
347 case BOOLEAN_TYPE:
348 t = TYPE_MIN_VALUE (new);
349 if (t && TREE_CODE (t) != INTEGER_CST)
350 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
352 t = TYPE_MAX_VALUE (new);
353 if (t && TREE_CODE (t) != INTEGER_CST)
354 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
355 return new;
357 case FUNCTION_TYPE:
358 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
359 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
360 return new;
362 case ARRAY_TYPE:
363 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
364 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
365 break;
367 case RECORD_TYPE:
368 case UNION_TYPE:
369 case QUAL_UNION_TYPE:
371 tree f, nf = NULL;
373 for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
375 t = remap_decl (f, id);
376 DECL_CONTEXT (t) = new;
377 TREE_CHAIN (t) = nf;
378 nf = t;
380 TYPE_FIELDS (new) = nreverse (nf);
382 break;
384 case OFFSET_TYPE:
385 default:
386 /* Shouldn't have been thought variable sized. */
387 gcc_unreachable ();
390 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
391 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
393 return new;
396 tree
397 remap_type (tree type, copy_body_data *id)
399 tree *node;
401 if (type == NULL)
402 return type;
404 /* See if we have remapped this type. */
405 node = (tree *) pointer_map_contains (id->decl_map, type);
406 if (node)
407 return *node;
409 /* The type only needs remapping if it's variably modified. */
410 if (! variably_modified_type_p (type, id->src_fn))
412 insert_decl_map (id, type, type);
413 return type;
416 return remap_type_1 (type, id);
419 static tree
420 remap_decls (tree decls, copy_body_data *id)
422 tree old_var;
423 tree new_decls = NULL_TREE;
425 /* Remap its variables. */
426 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
428 tree new_var;
430 /* We can not chain the local static declarations into the unexpanded_var_list
431 as we can't duplicate them or break one decl rule. Go ahead and link
432 them into unexpanded_var_list. */
433 if (!auto_var_in_fn_p (old_var, id->src_fn)
434 && !DECL_EXTERNAL (old_var))
436 cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
437 cfun->unexpanded_var_list);
438 continue;
441 /* Remap the variable. */
442 new_var = remap_decl (old_var, id);
444 /* If we didn't remap this variable, so we can't mess with its
445 TREE_CHAIN. If we remapped this variable to the return slot, it's
446 already declared somewhere else, so don't declare it here. */
447 if (!new_var || new_var == id->retvar)
449 else
451 gcc_assert (DECL_P (new_var));
452 TREE_CHAIN (new_var) = new_decls;
453 new_decls = new_var;
457 return nreverse (new_decls);
460 /* Copy the BLOCK to contain remapped versions of the variables
461 therein. And hook the new block into the block-tree. */
463 static void
464 remap_block (tree *block, copy_body_data *id)
466 tree old_block;
467 tree new_block;
468 tree fn;
470 /* Make the new block. */
471 old_block = *block;
472 new_block = make_node (BLOCK);
473 TREE_USED (new_block) = TREE_USED (old_block);
474 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
475 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
476 *block = new_block;
478 /* Remap its variables. */
479 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
481 fn = id->dst_fn;
483 if (id->transform_lang_insert_block)
484 lang_hooks.decls.insert_block (new_block);
486 /* Remember the remapped block. */
487 insert_decl_map (id, old_block, new_block);
490 /* Copy the whole block tree and root it in id->block. */
491 static tree
492 remap_blocks (tree block, copy_body_data *id)
494 tree t;
495 tree new = block;
497 if (!block)
498 return NULL;
500 remap_block (&new, id);
501 gcc_assert (new != block);
502 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
503 add_lexical_block (new, remap_blocks (t, id));
504 return new;
507 static void
508 copy_statement_list (tree *tp)
510 tree_stmt_iterator oi, ni;
511 tree new;
513 new = alloc_stmt_list ();
514 ni = tsi_start (new);
515 oi = tsi_start (*tp);
516 *tp = new;
518 for (; !tsi_end_p (oi); tsi_next (&oi))
519 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
522 static void
523 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
525 tree block = BIND_EXPR_BLOCK (*tp);
526 /* Copy (and replace) the statement. */
527 copy_tree_r (tp, walk_subtrees, NULL);
528 if (block)
530 remap_block (&block, id);
531 BIND_EXPR_BLOCK (*tp) = block;
534 if (BIND_EXPR_VARS (*tp))
535 /* This will remap a lot of the same decls again, but this should be
536 harmless. */
537 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
540 /* Called from copy_body_id via walk_tree. DATA is really an
541 `copy_body_data *'. */
543 tree
544 copy_body_r (tree *tp, int *walk_subtrees, void *data)
546 copy_body_data *id = (copy_body_data *) data;
547 tree fn = id->src_fn;
548 tree new_block;
550 /* Begin by recognizing trees that we'll completely rewrite for the
551 inlining context. Our output for these trees is completely
552 different from out input (e.g. RETURN_EXPR is deleted, and morphs
553 into an edge). Further down, we'll handle trees that get
554 duplicated and/or tweaked. */
556 /* When requested, RETURN_EXPRs should be transformed to just the
557 contained GIMPLE_MODIFY_STMT. The branch semantics of the return will
558 be handled elsewhere by manipulating the CFG rather than a statement. */
559 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
561 tree assignment = TREE_OPERAND (*tp, 0);
563 /* If we're returning something, just turn that into an
564 assignment into the equivalent of the original RESULT_DECL.
565 If the "assignment" is just the result decl, the result
566 decl has already been set (e.g. a recent "foo (&result_decl,
567 ...)"); just toss the entire RETURN_EXPR. */
568 if (assignment && TREE_CODE (assignment) == GIMPLE_MODIFY_STMT)
570 /* Replace the RETURN_EXPR with (a copy of) the
571 GIMPLE_MODIFY_STMT hanging underneath. */
572 *tp = copy_node (assignment);
574 else /* Else the RETURN_EXPR returns no value. */
576 *tp = NULL;
577 return (tree) (void *)1;
580 else if (TREE_CODE (*tp) == SSA_NAME)
582 *tp = remap_ssa_name (*tp, id);
583 *walk_subtrees = 0;
584 return NULL;
587 /* Local variables and labels need to be replaced by equivalent
588 variables. We don't want to copy static variables; there's only
589 one of those, no matter how many times we inline the containing
590 function. Similarly for globals from an outer function. */
591 else if (auto_var_in_fn_p (*tp, fn))
593 tree new_decl;
595 /* Remap the declaration. */
596 new_decl = remap_decl (*tp, id);
597 gcc_assert (new_decl);
598 /* Replace this variable with the copy. */
599 STRIP_TYPE_NOPS (new_decl);
600 *tp = new_decl;
601 *walk_subtrees = 0;
603 else if (TREE_CODE (*tp) == STATEMENT_LIST)
604 copy_statement_list (tp);
605 else if (TREE_CODE (*tp) == SAVE_EXPR)
606 remap_save_expr (tp, id->decl_map, walk_subtrees);
607 else if (TREE_CODE (*tp) == LABEL_DECL
608 && (! DECL_CONTEXT (*tp)
609 || decl_function_context (*tp) == id->src_fn))
610 /* These may need to be remapped for EH handling. */
611 *tp = remap_decl (*tp, id);
612 else if (TREE_CODE (*tp) == BIND_EXPR)
613 copy_bind_expr (tp, walk_subtrees, id);
614 /* Types may need remapping as well. */
615 else if (TYPE_P (*tp))
616 *tp = remap_type (*tp, id);
618 /* If this is a constant, we have to copy the node iff the type will be
619 remapped. copy_tree_r will not copy a constant. */
620 else if (CONSTANT_CLASS_P (*tp))
622 tree new_type = remap_type (TREE_TYPE (*tp), id);
624 if (new_type == TREE_TYPE (*tp))
625 *walk_subtrees = 0;
627 else if (TREE_CODE (*tp) == INTEGER_CST)
628 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
629 TREE_INT_CST_HIGH (*tp));
630 else
632 *tp = copy_node (*tp);
633 TREE_TYPE (*tp) = new_type;
637 /* Otherwise, just copy the node. Note that copy_tree_r already
638 knows not to copy VAR_DECLs, etc., so this is safe. */
639 else
641 /* Here we handle trees that are not completely rewritten.
642 First we detect some inlining-induced bogosities for
643 discarding. */
644 if (TREE_CODE (*tp) == GIMPLE_MODIFY_STMT
645 && GIMPLE_STMT_OPERAND (*tp, 0) == GIMPLE_STMT_OPERAND (*tp, 1)
646 && (auto_var_in_fn_p (GIMPLE_STMT_OPERAND (*tp, 0), fn)))
648 /* Some assignments VAR = VAR; don't generate any rtl code
649 and thus don't count as variable modification. Avoid
650 keeping bogosities like 0 = 0. */
651 tree decl = GIMPLE_STMT_OPERAND (*tp, 0), value;
652 tree *n;
654 n = (tree *) pointer_map_contains (id->decl_map, decl);
655 if (n)
657 value = *n;
658 STRIP_TYPE_NOPS (value);
659 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
661 *tp = build_empty_stmt ();
662 return copy_body_r (tp, walk_subtrees, data);
666 else if (TREE_CODE (*tp) == INDIRECT_REF)
668 /* Get rid of *& from inline substitutions that can happen when a
669 pointer argument is an ADDR_EXPR. */
670 tree decl = TREE_OPERAND (*tp, 0);
671 tree *n;
673 n = (tree *) pointer_map_contains (id->decl_map, decl);
674 if (n)
676 tree new;
677 tree old;
678 /* If we happen to get an ADDR_EXPR in n->value, strip
679 it manually here as we'll eventually get ADDR_EXPRs
680 which lie about their types pointed to. In this case
681 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
682 but we absolutely rely on that. As fold_indirect_ref
683 does other useful transformations, try that first, though. */
684 tree type = TREE_TYPE (TREE_TYPE (*n));
685 new = unshare_expr (*n);
686 old = *tp;
687 *tp = fold_indirect_ref_1 (type, new);
688 if (! *tp)
690 if (TREE_CODE (new) == ADDR_EXPR)
691 *tp = TREE_OPERAND (new, 0);
692 else
694 *tp = build1 (INDIRECT_REF, type, new);
695 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
698 *walk_subtrees = 0;
699 return NULL;
703 /* Here is the "usual case". Copy this tree node, and then
704 tweak some special cases. */
705 copy_tree_r (tp, walk_subtrees, NULL);
707 /* Global variables we didn't seen yet needs to go into referenced
708 vars. */
709 if (gimple_in_ssa_p (cfun) && TREE_CODE (*tp) == VAR_DECL)
710 add_referenced_var (*tp);
712 /* If EXPR has block defined, map it to newly constructed block.
713 When inlining we want EXPRs without block appear in the block
714 of function call. */
715 if (EXPR_P (*tp) || GIMPLE_STMT_P (*tp))
717 new_block = id->block;
718 if (TREE_BLOCK (*tp))
720 tree *n;
721 n = (tree *) pointer_map_contains (id->decl_map,
722 TREE_BLOCK (*tp));
723 gcc_assert (n);
724 new_block = *n;
726 TREE_BLOCK (*tp) = new_block;
729 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
730 TREE_OPERAND (*tp, 0) =
731 build_int_cst
732 (NULL_TREE,
733 id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
735 if (!GIMPLE_TUPLE_P (*tp) && TREE_CODE (*tp) != OMP_CLAUSE)
736 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
738 /* The copied TARGET_EXPR has never been expanded, even if the
739 original node was expanded already. */
740 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
742 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
743 TREE_OPERAND (*tp, 3) = NULL_TREE;
746 /* Variable substitution need not be simple. In particular, the
747 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
748 and friends are up-to-date. */
749 else if (TREE_CODE (*tp) == ADDR_EXPR)
751 walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
752 /* Handle the case where we substituted an INDIRECT_REF
753 into the operand of the ADDR_EXPR. */
754 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
755 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
756 else
757 recompute_tree_invariant_for_addr_expr (*tp);
758 *walk_subtrees = 0;
762 /* Keep iterating. */
763 return NULL_TREE;
766 /* Copy basic block, scale profile accordingly. Edges will be taken care of
767 later */
769 static basic_block
770 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
772 block_stmt_iterator bsi, copy_bsi;
773 basic_block copy_basic_block;
775 /* create_basic_block() will append every new block to
776 basic_block_info automatically. */
777 copy_basic_block = create_basic_block (NULL, (void *) 0,
778 (basic_block) bb->prev_bb->aux);
779 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
781 /* We are going to rebuild frequencies from scratch. These values have just
782 small importance to drive canonicalize_loop_headers. */
783 copy_basic_block->frequency = ((gcov_type)bb->frequency
784 * frequency_scale / REG_BR_PROB_BASE);
785 if (copy_basic_block->frequency > BB_FREQ_MAX)
786 copy_basic_block->frequency = BB_FREQ_MAX;
787 copy_bsi = bsi_start (copy_basic_block);
789 for (bsi = bsi_start (bb);
790 !bsi_end_p (bsi); bsi_next (&bsi))
792 tree stmt = bsi_stmt (bsi);
793 tree orig_stmt = stmt;
795 walk_tree (&stmt, copy_body_r, id, NULL);
797 /* RETURN_EXPR might be removed,
798 this is signalled by making stmt pointer NULL. */
799 if (stmt)
801 tree call, decl;
803 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
805 /* With return slot optimization we can end up with
806 non-gimple (foo *)&this->m, fix that here. */
807 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
808 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 1)) == NOP_EXPR
809 && !is_gimple_val (TREE_OPERAND (GIMPLE_STMT_OPERAND (stmt, 1), 0)))
810 gimplify_stmt (&stmt);
812 bsi_insert_after (&copy_bsi, stmt, BSI_NEW_STMT);
814 /* Process new statement. gimplify_stmt possibly turned statement
815 into multiple statements, we need to process all of them. */
816 while (!bsi_end_p (copy_bsi))
818 tree *stmtp = bsi_stmt_ptr (copy_bsi);
819 tree stmt = *stmtp;
820 call = get_call_expr_in (stmt);
822 if (call && CALL_EXPR_VA_ARG_PACK (call) && id->call_expr)
824 /* __builtin_va_arg_pack () should be replaced by
825 all arguments corresponding to ... in the caller. */
826 tree p, *argarray, new_call, *call_ptr;
827 int nargs = call_expr_nargs (id->call_expr);
829 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
830 nargs--;
832 argarray = (tree *) alloca ((nargs + call_expr_nargs (call))
833 * sizeof (tree));
835 memcpy (argarray, CALL_EXPR_ARGP (call),
836 call_expr_nargs (call) * sizeof (*argarray));
837 memcpy (argarray + call_expr_nargs (call),
838 CALL_EXPR_ARGP (id->call_expr)
839 + (call_expr_nargs (id->call_expr) - nargs),
840 nargs * sizeof (*argarray));
842 new_call = build_call_array (TREE_TYPE (call),
843 CALL_EXPR_FN (call),
844 nargs + call_expr_nargs (call),
845 argarray);
846 /* Copy all CALL_EXPR flags, locus and block, except
847 CALL_EXPR_VA_ARG_PACK flag. */
848 CALL_EXPR_STATIC_CHAIN (new_call)
849 = CALL_EXPR_STATIC_CHAIN (call);
850 CALL_EXPR_TAILCALL (new_call) = CALL_EXPR_TAILCALL (call);
851 CALL_EXPR_RETURN_SLOT_OPT (new_call)
852 = CALL_EXPR_RETURN_SLOT_OPT (call);
853 CALL_FROM_THUNK_P (new_call) = CALL_FROM_THUNK_P (call);
854 CALL_CANNOT_INLINE_P (new_call)
855 = CALL_CANNOT_INLINE_P (call);
856 TREE_NOTHROW (new_call) = TREE_NOTHROW (call);
857 SET_EXPR_LOCUS (new_call, EXPR_LOCUS (call));
858 TREE_BLOCK (new_call) = TREE_BLOCK (call);
860 call_ptr = stmtp;
861 if (TREE_CODE (*call_ptr) == GIMPLE_MODIFY_STMT)
862 call_ptr = &GIMPLE_STMT_OPERAND (*call_ptr, 1);
863 if (TREE_CODE (*call_ptr) == WITH_SIZE_EXPR)
864 call_ptr = &TREE_OPERAND (*call_ptr, 0);
865 gcc_assert (*call_ptr == call);
866 if (call_ptr == stmtp)
868 bsi_replace (&copy_bsi, new_call, true);
869 stmtp = bsi_stmt_ptr (copy_bsi);
870 stmt = *stmtp;
872 else
874 *call_ptr = new_call;
875 stmt = *stmtp;
876 update_stmt (stmt);
879 else if (call
880 && id->call_expr
881 && (decl = get_callee_fndecl (call))
882 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
883 && DECL_FUNCTION_CODE (decl)
884 == BUILT_IN_VA_ARG_PACK_LEN)
886 /* __builtin_va_arg_pack_len () should be replaced by
887 the number of anonymous arguments. */
888 int nargs = call_expr_nargs (id->call_expr);
889 tree count, *call_ptr, p;
891 for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
892 nargs--;
894 count = build_int_cst (integer_type_node, nargs);
895 call_ptr = stmtp;
896 if (TREE_CODE (*call_ptr) == GIMPLE_MODIFY_STMT)
897 call_ptr = &GIMPLE_STMT_OPERAND (*call_ptr, 1);
898 if (TREE_CODE (*call_ptr) == WITH_SIZE_EXPR)
899 call_ptr = &TREE_OPERAND (*call_ptr, 0);
900 gcc_assert (*call_ptr == call && call_ptr != stmtp);
901 *call_ptr = count;
902 stmt = *stmtp;
903 update_stmt (stmt);
904 call = NULL_TREE;
907 /* Statements produced by inlining can be unfolded, especially
908 when we constant propagated some operands. We can't fold
909 them right now for two reasons:
910 1) folding require SSA_NAME_DEF_STMTs to be correct
911 2) we can't change function calls to builtins.
912 So we just mark statement for later folding. We mark
913 all new statements, instead just statements that has changed
914 by some nontrivial substitution so even statements made
915 foldable indirectly are updated. If this turns out to be
916 expensive, copy_body can be told to watch for nontrivial
917 changes. */
918 if (id->statements_to_fold)
919 pointer_set_insert (id->statements_to_fold, stmt);
920 /* We're duplicating a CALL_EXPR. Find any corresponding
921 callgraph edges and update or duplicate them. */
922 if (call && (decl = get_callee_fndecl (call)))
924 struct cgraph_node *node;
925 struct cgraph_edge *edge;
927 switch (id->transform_call_graph_edges)
929 case CB_CGE_DUPLICATE:
930 edge = cgraph_edge (id->src_node, orig_stmt);
931 if (edge)
932 cgraph_clone_edge (edge, id->dst_node, stmt,
933 REG_BR_PROB_BASE, 1, edge->frequency, true);
934 break;
936 case CB_CGE_MOVE_CLONES:
937 for (node = id->dst_node->next_clone;
938 node;
939 node = node->next_clone)
941 edge = cgraph_edge (node, orig_stmt);
942 gcc_assert (edge);
943 cgraph_set_call_stmt (edge, stmt);
945 /* FALLTHRU */
947 case CB_CGE_MOVE:
948 edge = cgraph_edge (id->dst_node, orig_stmt);
949 if (edge)
950 cgraph_set_call_stmt (edge, stmt);
951 break;
953 default:
954 gcc_unreachable ();
957 /* If you think we can abort here, you are wrong.
958 There is no region 0 in tree land. */
959 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
960 != 0);
962 if (tree_could_throw_p (stmt)
963 /* When we are cloning for inlining, we are supposed to
964 construct a clone that calls precisely the same functions
965 as original. However IPA optimizers might've proved
966 earlier some function calls as non-trapping that might
967 render some basic blocks dead that might become
968 unreachable.
970 We can't update SSA with unreachable blocks in CFG and thus
971 we prevent the scenario by preserving even the "dead" eh
972 edges until the point they are later removed by
973 fixup_cfg pass. */
974 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
975 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
977 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
978 /* Add an entry for the copied tree in the EH hashtable.
979 When cloning or versioning, use the hashtable in
980 cfun, and just copy the EH number. When inlining, use the
981 hashtable in the caller, and adjust the region number. */
982 if (region > 0)
983 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
985 /* If this tree doesn't have a region associated with it,
986 and there is a "current region,"
987 then associate this tree with the current region
988 and add edges associated with this region. */
989 if ((lookup_stmt_eh_region_fn (id->src_cfun,
990 orig_stmt) <= 0
991 && id->eh_region > 0)
992 && tree_could_throw_p (stmt))
993 add_stmt_to_eh_region (stmt, id->eh_region);
995 if (gimple_in_ssa_p (cfun))
997 ssa_op_iter i;
998 tree def;
1000 find_new_referenced_vars (bsi_stmt_ptr (copy_bsi));
1001 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1002 if (TREE_CODE (def) == SSA_NAME)
1003 SSA_NAME_DEF_STMT (def) = stmt;
1005 bsi_next (&copy_bsi);
1007 copy_bsi = bsi_last (copy_basic_block);
1010 return copy_basic_block;
1013 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1014 form is quite easy, since dominator relationship for old basic blocks does
1015 not change.
1017 There is however exception where inlining might change dominator relation
1018 across EH edges from basic block within inlined functions destinating
1019 to landing pads in function we inline into.
1021 The function fills in PHI_RESULTs of such PHI nodes if they refer
1022 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1023 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1024 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1025 set, and this means that there will be no overlapping live ranges
1026 for the underlying symbol.
1028 This might change in future if we allow redirecting of EH edges and
1029 we might want to change way build CFG pre-inlining to include
1030 all the possible edges then. */
1031 static void
1032 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1033 bool can_throw, bool nonlocal_goto)
1035 edge e;
1036 edge_iterator ei;
1038 FOR_EACH_EDGE (e, ei, bb->succs)
1039 if (!e->dest->aux
1040 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1042 tree phi;
1044 gcc_assert (e->flags & EDGE_ABNORMAL);
1045 if (!nonlocal_goto)
1046 gcc_assert (e->flags & EDGE_EH);
1047 if (!can_throw)
1048 gcc_assert (!(e->flags & EDGE_EH));
1049 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
1051 edge re;
1053 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1054 gcc_assert (!e->dest->aux);
1056 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
1057 (PHI_RESULT (phi)));
1059 if (!is_gimple_reg (PHI_RESULT (phi)))
1061 mark_sym_for_renaming
1062 (SSA_NAME_VAR (PHI_RESULT (phi)));
1063 continue;
1066 re = find_edge (ret_bb, e->dest);
1067 gcc_assert (re);
1068 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1069 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1071 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1072 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1077 /* Copy edges from BB into its copy constructed earlier, scale profile
1078 accordingly. Edges will be taken care of later. Assume aux
1079 pointers to point to the copies of each BB. */
1080 static void
1081 copy_edges_for_bb (basic_block bb, int count_scale, basic_block ret_bb)
1083 basic_block new_bb = (basic_block) bb->aux;
1084 edge_iterator ei;
1085 edge old_edge;
1086 block_stmt_iterator bsi;
1087 int flags;
1089 /* Use the indices from the original blocks to create edges for the
1090 new ones. */
1091 FOR_EACH_EDGE (old_edge, ei, bb->succs)
1092 if (!(old_edge->flags & EDGE_EH))
1094 edge new;
1096 flags = old_edge->flags;
1098 /* Return edges do get a FALLTHRU flag when the get inlined. */
1099 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1100 && old_edge->dest->aux != EXIT_BLOCK_PTR)
1101 flags |= EDGE_FALLTHRU;
1102 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1103 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1104 new->probability = old_edge->probability;
1107 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1108 return;
1110 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
1112 tree copy_stmt;
1113 bool can_throw, nonlocal_goto;
1115 copy_stmt = bsi_stmt (bsi);
1116 update_stmt (copy_stmt);
1117 if (gimple_in_ssa_p (cfun))
1118 mark_symbols_for_renaming (copy_stmt);
1119 /* Do this before the possible split_block. */
1120 bsi_next (&bsi);
1122 /* If this tree could throw an exception, there are two
1123 cases where we need to add abnormal edge(s): the
1124 tree wasn't in a region and there is a "current
1125 region" in the caller; or the original tree had
1126 EH edges. In both cases split the block after the tree,
1127 and add abnormal edge(s) as needed; we need both
1128 those from the callee and the caller.
1129 We check whether the copy can throw, because the const
1130 propagation can change an INDIRECT_REF which throws
1131 into a COMPONENT_REF which doesn't. If the copy
1132 can throw, the original could also throw. */
1134 can_throw = tree_can_throw_internal (copy_stmt);
1135 nonlocal_goto = tree_can_make_abnormal_goto (copy_stmt);
1137 if (can_throw || nonlocal_goto)
1139 if (!bsi_end_p (bsi))
1140 /* Note that bb's predecessor edges aren't necessarily
1141 right at this point; split_block doesn't care. */
1143 edge e = split_block (new_bb, copy_stmt);
1145 new_bb = e->dest;
1146 new_bb->aux = e->src->aux;
1147 bsi = bsi_start (new_bb);
1151 if (can_throw)
1152 make_eh_edges (copy_stmt);
1154 if (nonlocal_goto)
1155 make_abnormal_goto_edges (bb_for_stmt (copy_stmt), true);
1157 if ((can_throw || nonlocal_goto)
1158 && gimple_in_ssa_p (cfun))
1159 update_ssa_across_abnormal_edges (bb_for_stmt (copy_stmt), ret_bb,
1160 can_throw, nonlocal_goto);
1164 /* Copy the PHIs. All blocks and edges are copied, some blocks
1165 was possibly split and new outgoing EH edges inserted.
1166 BB points to the block of original function and AUX pointers links
1167 the original and newly copied blocks. */
1169 static void
1170 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1172 basic_block new_bb = bb->aux;
1173 edge_iterator ei;
1174 tree phi;
1176 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1178 tree res = PHI_RESULT (phi);
1179 tree new_res = res;
1180 tree new_phi;
1181 edge new_edge;
1183 if (is_gimple_reg (res))
1185 walk_tree (&new_res, copy_body_r, id, NULL);
1186 SSA_NAME_DEF_STMT (new_res)
1187 = new_phi = create_phi_node (new_res, new_bb);
1188 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1190 edge old_edge = find_edge (new_edge->src->aux, bb);
1191 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1192 tree new_arg = arg;
1194 walk_tree (&new_arg, copy_body_r, id, NULL);
1195 gcc_assert (new_arg);
1196 add_phi_arg (new_phi, new_arg, new_edge);
1202 /* Wrapper for remap_decl so it can be used as a callback. */
1203 static tree
1204 remap_decl_1 (tree decl, void *data)
1206 return remap_decl (decl, (copy_body_data *) data);
1209 /* Build struct function and associated datastructures for the new clone
1210 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1212 static void
1213 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1214 int frequency)
1216 struct function *new_cfun
1217 = (struct function *) ggc_alloc_cleared (sizeof (struct function));
1218 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1219 int count_scale, frequency_scale;
1221 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1222 count_scale = (REG_BR_PROB_BASE * count
1223 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1224 else
1225 count_scale = 1;
1227 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1228 frequency_scale = (REG_BR_PROB_BASE * frequency
1230 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1231 else
1232 frequency_scale = count_scale;
1234 /* Register specific tree functions. */
1235 tree_register_cfg_hooks ();
1236 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
1237 new_cfun->funcdef_no = get_next_funcdef_no ();
1238 VALUE_HISTOGRAMS (new_cfun) = NULL;
1239 new_cfun->unexpanded_var_list = NULL;
1240 new_cfun->cfg = NULL;
1241 new_cfun->decl = new_fndecl /*= copy_node (callee_fndecl)*/;
1242 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
1243 push_cfun (new_cfun);
1244 init_empty_tree_cfg ();
1246 ENTRY_BLOCK_PTR->count =
1247 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1248 REG_BR_PROB_BASE);
1249 ENTRY_BLOCK_PTR->frequency =
1250 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1251 frequency_scale / REG_BR_PROB_BASE);
1252 EXIT_BLOCK_PTR->count =
1253 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1254 REG_BR_PROB_BASE);
1255 EXIT_BLOCK_PTR->frequency =
1256 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1257 frequency_scale / REG_BR_PROB_BASE);
1258 if (src_cfun->eh)
1259 init_eh_for_function ();
1261 if (src_cfun->gimple_df)
1263 init_tree_ssa ();
1264 cfun->gimple_df->in_ssa_p = true;
1265 init_ssa_operands ();
1267 pop_cfun ();
1270 /* Make a copy of the body of FN so that it can be inserted inline in
1271 another function. Walks FN via CFG, returns new fndecl. */
1273 static tree
1274 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1275 basic_block entry_block_map, basic_block exit_block_map)
1277 tree callee_fndecl = id->src_fn;
1278 /* Original cfun for the callee, doesn't change. */
1279 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1280 struct function *cfun_to_copy;
1281 basic_block bb;
1282 tree new_fndecl = NULL;
1283 int count_scale, frequency_scale;
1284 int last;
1286 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1287 count_scale = (REG_BR_PROB_BASE * count
1288 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1289 else
1290 count_scale = 1;
1292 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1293 frequency_scale = (REG_BR_PROB_BASE * frequency
1295 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1296 else
1297 frequency_scale = count_scale;
1299 /* Register specific tree functions. */
1300 tree_register_cfg_hooks ();
1302 /* Must have a CFG here at this point. */
1303 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1304 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1306 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1309 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1310 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1311 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1312 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1314 /* Duplicate any exception-handling regions. */
1315 if (cfun->eh)
1317 id->eh_region_offset
1318 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1319 0, id->eh_region);
1321 /* Use aux pointers to map the original blocks to copy. */
1322 FOR_EACH_BB_FN (bb, cfun_to_copy)
1324 basic_block new = copy_bb (id, bb, frequency_scale, count_scale);
1325 bb->aux = new;
1326 new->aux = bb;
1329 last = last_basic_block;
1330 /* Now that we've duplicated the blocks, duplicate their edges. */
1331 FOR_ALL_BB_FN (bb, cfun_to_copy)
1332 copy_edges_for_bb (bb, count_scale, exit_block_map);
1333 if (gimple_in_ssa_p (cfun))
1334 FOR_ALL_BB_FN (bb, cfun_to_copy)
1335 copy_phis_for_bb (bb, id);
1336 FOR_ALL_BB_FN (bb, cfun_to_copy)
1338 ((basic_block)bb->aux)->aux = NULL;
1339 bb->aux = NULL;
1341 /* Zero out AUX fields of newly created block during EH edge
1342 insertion. */
1343 for (; last < last_basic_block; last++)
1344 BASIC_BLOCK (last)->aux = NULL;
1345 entry_block_map->aux = NULL;
1346 exit_block_map->aux = NULL;
1348 return new_fndecl;
1351 /* Make a copy of the body of FN so that it can be inserted inline in
1352 another function. */
1354 static tree
1355 copy_generic_body (copy_body_data *id)
1357 tree body;
1358 tree fndecl = id->src_fn;
1360 body = DECL_SAVED_TREE (fndecl);
1361 walk_tree (&body, copy_body_r, id, NULL);
1363 return body;
1366 static tree
1367 copy_body (copy_body_data *id, gcov_type count, int frequency,
1368 basic_block entry_block_map, basic_block exit_block_map)
1370 tree fndecl = id->src_fn;
1371 tree body;
1373 /* If this body has a CFG, walk CFG and copy. */
1374 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
1375 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
1377 return body;
1380 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1381 defined in function FN, or of a data member thereof. */
1383 static bool
1384 self_inlining_addr_expr (tree value, tree fn)
1386 tree var;
1388 if (TREE_CODE (value) != ADDR_EXPR)
1389 return false;
1391 var = get_base_address (TREE_OPERAND (value, 0));
1393 return var && auto_var_in_fn_p (var, fn);
1396 static void
1397 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
1398 basic_block bb, tree *vars)
1400 tree init_stmt;
1401 tree var;
1402 tree var_sub;
1403 tree rhs = value;
1404 tree def = (gimple_in_ssa_p (cfun)
1405 ? gimple_default_def (id->src_cfun, p) : NULL);
1407 if (value
1408 && value != error_mark_node
1409 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
1410 rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
1412 /* If the parameter is never assigned to, has no SSA_NAMEs created,
1413 we may not need to create a new variable here at all. Instead, we may
1414 be able to just use the argument value. */
1415 if (TREE_READONLY (p)
1416 && !TREE_ADDRESSABLE (p)
1417 && value && !TREE_SIDE_EFFECTS (value)
1418 && !def)
1420 /* We may produce non-gimple trees by adding NOPs or introduce
1421 invalid sharing when operand is not really constant.
1422 It is not big deal to prohibit constant propagation here as
1423 we will constant propagate in DOM1 pass anyway. */
1424 if (is_gimple_min_invariant (value)
1425 && useless_type_conversion_p (TREE_TYPE (p),
1426 TREE_TYPE (value))
1427 /* We have to be very careful about ADDR_EXPR. Make sure
1428 the base variable isn't a local variable of the inlined
1429 function, e.g., when doing recursive inlining, direct or
1430 mutually-recursive or whatever, which is why we don't
1431 just test whether fn == current_function_decl. */
1432 && ! self_inlining_addr_expr (value, fn))
1434 insert_decl_map (id, p, value);
1435 return;
1439 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1440 here since the type of this decl must be visible to the calling
1441 function. */
1442 var = copy_decl_to_var (p, id);
1443 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
1445 get_var_ann (var);
1446 add_referenced_var (var);
1449 /* See if the frontend wants to pass this by invisible reference. If
1450 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1451 replace uses of the PARM_DECL with dereferences. */
1452 if (TREE_TYPE (var) != TREE_TYPE (p)
1453 && POINTER_TYPE_P (TREE_TYPE (var))
1454 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1456 insert_decl_map (id, var, var);
1457 var_sub = build_fold_indirect_ref (var);
1459 else
1460 var_sub = var;
1462 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1463 that way, when the PARM_DECL is encountered, it will be
1464 automatically replaced by the VAR_DECL. */
1465 insert_decl_map (id, p, var_sub);
1467 /* Declare this new variable. */
1468 TREE_CHAIN (var) = *vars;
1469 *vars = var;
1471 /* Make gimplifier happy about this variable. */
1472 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1474 /* Even if P was TREE_READONLY, the new VAR should not be.
1475 In the original code, we would have constructed a
1476 temporary, and then the function body would have never
1477 changed the value of P. However, now, we will be
1478 constructing VAR directly. The constructor body may
1479 change its value multiple times as it is being
1480 constructed. Therefore, it must not be TREE_READONLY;
1481 the back-end assumes that TREE_READONLY variable is
1482 assigned to only once. */
1483 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1484 TREE_READONLY (var) = 0;
1486 /* If there is no setup required and we are in SSA, take the easy route
1487 replacing all SSA names representing the function parameter by the
1488 SSA name passed to function.
1490 We need to construct map for the variable anyway as it might be used
1491 in different SSA names when parameter is set in function.
1493 FIXME: This usually kills the last connection in between inlined
1494 function parameter and the actual value in debug info. Can we do
1495 better here? If we just inserted the statement, copy propagation
1496 would kill it anyway as it always did in older versions of GCC.
1498 We might want to introduce a notion that single SSA_NAME might
1499 represent multiple variables for purposes of debugging. */
1500 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
1501 && (TREE_CODE (rhs) == SSA_NAME
1502 || is_gimple_min_invariant (rhs))
1503 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1505 insert_decl_map (id, def, rhs);
1506 return;
1509 /* Initialize this VAR_DECL from the equivalent argument. Convert
1510 the argument to the proper type in case it was promoted. */
1511 if (value)
1513 block_stmt_iterator bsi = bsi_last (bb);
1515 if (rhs == error_mark_node)
1517 insert_decl_map (id, p, var_sub);
1518 return;
1521 STRIP_USELESS_TYPE_CONVERSION (rhs);
1523 /* We want to use GIMPLE_MODIFY_STMT, not INIT_EXPR here so that we
1524 keep our trees in gimple form. */
1525 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
1527 def = remap_ssa_name (def, id);
1528 init_stmt = build_gimple_modify_stmt (def, rhs);
1529 SSA_NAME_DEF_STMT (def) = init_stmt;
1530 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
1531 set_default_def (var, NULL);
1533 else
1534 init_stmt = build_gimple_modify_stmt (var, rhs);
1536 /* If we did not create a gimple value and we did not create a gimple
1537 cast of a gimple value, then we will need to gimplify INIT_STMTS
1538 at the end. Note that is_gimple_cast only checks the outer
1539 tree code, not its operand. Thus the explicit check that its
1540 operand is a gimple value. */
1541 if ((!is_gimple_val (rhs)
1542 && (!is_gimple_cast (rhs)
1543 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1544 || !is_gimple_reg (var))
1546 tree_stmt_iterator i;
1548 push_gimplify_context ();
1549 gimplify_stmt (&init_stmt);
1550 if (gimple_in_ssa_p (cfun)
1551 && init_stmt && TREE_CODE (init_stmt) == STATEMENT_LIST)
1553 /* The replacement can expose previously unreferenced
1554 variables. */
1555 for (i = tsi_start (init_stmt); !tsi_end_p (i); tsi_next (&i))
1556 find_new_referenced_vars (tsi_stmt_ptr (i));
1558 pop_gimplify_context (NULL);
1561 /* If VAR represents a zero-sized variable, it's possible that the
1562 assignment statment may result in no gimple statements. */
1563 if (init_stmt)
1564 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1565 if (gimple_in_ssa_p (cfun))
1566 for (;!bsi_end_p (bsi); bsi_next (&bsi))
1567 mark_symbols_for_renaming (bsi_stmt (bsi));
1571 /* Generate code to initialize the parameters of the function at the
1572 top of the stack in ID from the CALL_EXPR EXP. */
1574 static void
1575 initialize_inlined_parameters (copy_body_data *id, tree exp,
1576 tree fn, basic_block bb)
1578 tree parms;
1579 tree a;
1580 tree p;
1581 tree vars = NULL_TREE;
1582 call_expr_arg_iterator iter;
1583 tree static_chain = CALL_EXPR_STATIC_CHAIN (exp);
1585 /* Figure out what the parameters are. */
1586 parms = DECL_ARGUMENTS (fn);
1588 /* Loop through the parameter declarations, replacing each with an
1589 equivalent VAR_DECL, appropriately initialized. */
1590 for (p = parms, a = first_call_expr_arg (exp, &iter); p;
1591 a = next_call_expr_arg (&iter), p = TREE_CHAIN (p))
1592 setup_one_parameter (id, p, a, fn, bb, &vars);
1594 /* Initialize the static chain. */
1595 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1596 gcc_assert (fn != current_function_decl);
1597 if (p)
1599 /* No static chain? Seems like a bug in tree-nested.c. */
1600 gcc_assert (static_chain);
1602 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1605 declare_inline_vars (id->block, vars);
1608 /* Declare a return variable to replace the RESULT_DECL for the
1609 function we are calling. An appropriate DECL_STMT is returned.
1610 The USE_STMT is filled to contain a use of the declaration to
1611 indicate the return value of the function.
1613 RETURN_SLOT, if non-null is place where to store the result. It
1614 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
1615 was the LHS of the GIMPLE_MODIFY_STMT to which this call is the RHS.
1617 The return value is a (possibly null) value that is the result of the
1618 function as seen by the callee. *USE_P is a (possibly null) value that
1619 holds the result as seen by the caller. */
1621 static tree
1622 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
1623 tree *use_p)
1625 tree callee = id->src_fn;
1626 tree caller = id->dst_fn;
1627 tree result = DECL_RESULT (callee);
1628 tree callee_type = TREE_TYPE (result);
1629 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1630 tree var, use;
1632 /* We don't need to do anything for functions that don't return
1633 anything. */
1634 if (!result || VOID_TYPE_P (callee_type))
1636 *use_p = NULL_TREE;
1637 return NULL_TREE;
1640 /* If there was a return slot, then the return value is the
1641 dereferenced address of that object. */
1642 if (return_slot)
1644 /* The front end shouldn't have used both return_slot and
1645 a modify expression. */
1646 gcc_assert (!modify_dest);
1647 if (DECL_BY_REFERENCE (result))
1649 tree return_slot_addr = build_fold_addr_expr (return_slot);
1650 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
1652 /* We are going to construct *&return_slot and we can't do that
1653 for variables believed to be not addressable.
1655 FIXME: This check possibly can match, because values returned
1656 via return slot optimization are not believed to have address
1657 taken by alias analysis. */
1658 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
1659 if (gimple_in_ssa_p (cfun))
1661 HOST_WIDE_INT bitsize;
1662 HOST_WIDE_INT bitpos;
1663 tree offset;
1664 enum machine_mode mode;
1665 int unsignedp;
1666 int volatilep;
1667 tree base;
1668 base = get_inner_reference (return_slot, &bitsize, &bitpos,
1669 &offset,
1670 &mode, &unsignedp, &volatilep,
1671 false);
1672 if (TREE_CODE (base) == INDIRECT_REF)
1673 base = TREE_OPERAND (base, 0);
1674 if (TREE_CODE (base) == SSA_NAME)
1675 base = SSA_NAME_VAR (base);
1676 mark_sym_for_renaming (base);
1678 var = return_slot_addr;
1680 else
1682 var = return_slot;
1683 gcc_assert (TREE_CODE (var) != SSA_NAME);
1685 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1686 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1687 && !DECL_GIMPLE_REG_P (result)
1688 && DECL_P (var))
1689 DECL_GIMPLE_REG_P (var) = 0;
1690 use = NULL;
1691 goto done;
1694 /* All types requiring non-trivial constructors should have been handled. */
1695 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1697 /* Attempt to avoid creating a new temporary variable. */
1698 if (modify_dest
1699 && TREE_CODE (modify_dest) != SSA_NAME)
1701 bool use_it = false;
1703 /* We can't use MODIFY_DEST if there's type promotion involved. */
1704 if (!useless_type_conversion_p (callee_type, caller_type))
1705 use_it = false;
1707 /* ??? If we're assigning to a variable sized type, then we must
1708 reuse the destination variable, because we've no good way to
1709 create variable sized temporaries at this point. */
1710 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1711 use_it = true;
1713 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1714 reuse it as the result of the call directly. Don't do this if
1715 it would promote MODIFY_DEST to addressable. */
1716 else if (TREE_ADDRESSABLE (result))
1717 use_it = false;
1718 else
1720 tree base_m = get_base_address (modify_dest);
1722 /* If the base isn't a decl, then it's a pointer, and we don't
1723 know where that's going to go. */
1724 if (!DECL_P (base_m))
1725 use_it = false;
1726 else if (is_global_var (base_m))
1727 use_it = false;
1728 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1729 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1730 && !DECL_GIMPLE_REG_P (result)
1731 && DECL_GIMPLE_REG_P (base_m))
1732 use_it = false;
1733 else if (!TREE_ADDRESSABLE (base_m))
1734 use_it = true;
1737 if (use_it)
1739 var = modify_dest;
1740 use = NULL;
1741 goto done;
1745 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1747 var = copy_result_decl_to_var (result, id);
1748 if (gimple_in_ssa_p (cfun))
1750 get_var_ann (var);
1751 add_referenced_var (var);
1754 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1755 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1756 = tree_cons (NULL_TREE, var,
1757 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1759 /* Do not have the rest of GCC warn about this variable as it should
1760 not be visible to the user. */
1761 TREE_NO_WARNING (var) = 1;
1763 declare_inline_vars (id->block, var);
1765 /* Build the use expr. If the return type of the function was
1766 promoted, convert it back to the expected type. */
1767 use = var;
1768 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
1769 use = fold_convert (caller_type, var);
1771 STRIP_USELESS_TYPE_CONVERSION (use);
1773 if (DECL_BY_REFERENCE (result))
1774 var = build_fold_addr_expr (var);
1776 done:
1777 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1778 way, when the RESULT_DECL is encountered, it will be
1779 automatically replaced by the VAR_DECL. */
1780 insert_decl_map (id, result, var);
1782 /* Remember this so we can ignore it in remap_decls. */
1783 id->retvar = var;
1785 *use_p = use;
1786 return var;
1789 /* Returns nonzero if a function can be inlined as a tree. */
1791 bool
1792 tree_inlinable_function_p (tree fn)
1794 return inlinable_function_p (fn);
1797 static const char *inline_forbidden_reason;
1799 static tree
1800 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1801 void *fnp)
1803 tree node = *nodep;
1804 tree fn = (tree) fnp;
1805 tree t;
1807 switch (TREE_CODE (node))
1809 case CALL_EXPR:
1810 /* Refuse to inline alloca call unless user explicitly forced so as
1811 this may change program's memory overhead drastically when the
1812 function using alloca is called in loop. In GCC present in
1813 SPEC2000 inlining into schedule_block cause it to require 2GB of
1814 RAM instead of 256MB. */
1815 if (alloca_call_p (node)
1816 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1818 inline_forbidden_reason
1819 = G_("function %q+F can never be inlined because it uses "
1820 "alloca (override using the always_inline attribute)");
1821 return node;
1823 t = get_callee_fndecl (node);
1824 if (! t)
1825 break;
1827 /* We cannot inline functions that call setjmp. */
1828 if (setjmp_call_p (t))
1830 inline_forbidden_reason
1831 = G_("function %q+F can never be inlined because it uses setjmp");
1832 return node;
1835 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1836 switch (DECL_FUNCTION_CODE (t))
1838 /* We cannot inline functions that take a variable number of
1839 arguments. */
1840 case BUILT_IN_VA_START:
1841 case BUILT_IN_STDARG_START:
1842 case BUILT_IN_NEXT_ARG:
1843 case BUILT_IN_VA_END:
1844 inline_forbidden_reason
1845 = G_("function %q+F can never be inlined because it "
1846 "uses variable argument lists");
1847 return node;
1849 case BUILT_IN_LONGJMP:
1850 /* We can't inline functions that call __builtin_longjmp at
1851 all. The non-local goto machinery really requires the
1852 destination be in a different function. If we allow the
1853 function calling __builtin_longjmp to be inlined into the
1854 function calling __builtin_setjmp, Things will Go Awry. */
1855 inline_forbidden_reason
1856 = G_("function %q+F can never be inlined because "
1857 "it uses setjmp-longjmp exception handling");
1858 return node;
1860 case BUILT_IN_NONLOCAL_GOTO:
1861 /* Similarly. */
1862 inline_forbidden_reason
1863 = G_("function %q+F can never be inlined because "
1864 "it uses non-local goto");
1865 return node;
1867 case BUILT_IN_RETURN:
1868 case BUILT_IN_APPLY_ARGS:
1869 /* If a __builtin_apply_args caller would be inlined,
1870 it would be saving arguments of the function it has
1871 been inlined into. Similarly __builtin_return would
1872 return from the function the inline has been inlined into. */
1873 inline_forbidden_reason
1874 = G_("function %q+F can never be inlined because "
1875 "it uses __builtin_return or __builtin_apply_args");
1876 return node;
1878 default:
1879 break;
1881 break;
1883 case GOTO_EXPR:
1884 t = TREE_OPERAND (node, 0);
1886 /* We will not inline a function which uses computed goto. The
1887 addresses of its local labels, which may be tucked into
1888 global storage, are of course not constant across
1889 instantiations, which causes unexpected behavior. */
1890 if (TREE_CODE (t) != LABEL_DECL)
1892 inline_forbidden_reason
1893 = G_("function %q+F can never be inlined "
1894 "because it contains a computed goto");
1895 return node;
1897 break;
1899 case LABEL_EXPR:
1900 t = TREE_OPERAND (node, 0);
1901 if (DECL_NONLOCAL (t))
1903 /* We cannot inline a function that receives a non-local goto
1904 because we cannot remap the destination label used in the
1905 function that is performing the non-local goto. */
1906 inline_forbidden_reason
1907 = G_("function %q+F can never be inlined "
1908 "because it receives a non-local goto");
1909 return node;
1911 break;
1913 case RECORD_TYPE:
1914 case UNION_TYPE:
1915 /* We cannot inline a function of the form
1917 void F (int i) { struct S { int ar[i]; } s; }
1919 Attempting to do so produces a catch-22.
1920 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1921 UNION_TYPE nodes, then it goes into infinite recursion on a
1922 structure containing a pointer to its own type. If it doesn't,
1923 then the type node for S doesn't get adjusted properly when
1924 F is inlined.
1926 ??? This is likely no longer true, but it's too late in the 4.0
1927 cycle to try to find out. This should be checked for 4.1. */
1928 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1929 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1931 inline_forbidden_reason
1932 = G_("function %q+F can never be inlined "
1933 "because it uses variable sized variables");
1934 return node;
1937 default:
1938 break;
1941 return NULL_TREE;
1944 /* Return subexpression representing possible alloca call, if any. */
1945 static tree
1946 inline_forbidden_p (tree fndecl)
1948 location_t saved_loc = input_location;
1949 block_stmt_iterator bsi;
1950 basic_block bb;
1951 tree ret = NULL_TREE;
1953 FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
1954 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1956 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
1957 inline_forbidden_p_1, fndecl);
1958 if (ret)
1959 goto egress;
1962 egress:
1963 input_location = saved_loc;
1964 return ret;
1967 /* Returns nonzero if FN is a function that does not have any
1968 fundamental inline blocking properties. */
1970 static bool
1971 inlinable_function_p (tree fn)
1973 bool inlinable = true;
1974 bool do_warning;
1975 tree always_inline;
1977 /* If we've already decided this function shouldn't be inlined,
1978 there's no need to check again. */
1979 if (DECL_UNINLINABLE (fn))
1980 return false;
1982 /* We only warn for functions declared `inline' by the user. */
1983 do_warning = (warn_inline
1984 && DECL_INLINE (fn)
1985 && DECL_DECLARED_INLINE_P (fn)
1986 && !DECL_IN_SYSTEM_HEADER (fn));
1988 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
1990 if (flag_really_no_inline
1991 && always_inline == NULL)
1993 if (do_warning)
1994 warning (OPT_Winline, "function %q+F can never be inlined because it "
1995 "is suppressed using -fno-inline", fn);
1996 inlinable = false;
1999 /* Don't auto-inline anything that might not be bound within
2000 this unit of translation. */
2001 else if (!DECL_DECLARED_INLINE_P (fn)
2002 && DECL_REPLACEABLE_P (fn))
2003 inlinable = false;
2005 else if (!function_attribute_inlinable_p (fn))
2007 if (do_warning)
2008 warning (OPT_Winline, "function %q+F can never be inlined because it "
2009 "uses attributes conflicting with inlining", fn);
2010 inlinable = false;
2013 /* If we don't have the function body available, we can't inline it.
2014 However, this should not be recorded since we also get here for
2015 forward declared inline functions. Therefore, return at once. */
2016 if (!DECL_SAVED_TREE (fn))
2017 return false;
2019 /* If we're not inlining at all, then we cannot inline this function. */
2020 else if (!flag_inline_trees)
2021 inlinable = false;
2023 /* Only try to inline functions if DECL_INLINE is set. This should be
2024 true for all functions declared `inline', and for all other functions
2025 as well with -finline-functions.
2027 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
2028 it's the front-end that must set DECL_INLINE in this case, because
2029 dwarf2out loses if a function that does not have DECL_INLINE set is
2030 inlined anyway. That is why we have both DECL_INLINE and
2031 DECL_DECLARED_INLINE_P. */
2032 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
2033 here should be redundant. */
2034 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
2035 inlinable = false;
2037 else if (inline_forbidden_p (fn))
2039 /* See if we should warn about uninlinable functions. Previously,
2040 some of these warnings would be issued while trying to expand
2041 the function inline, but that would cause multiple warnings
2042 about functions that would for example call alloca. But since
2043 this a property of the function, just one warning is enough.
2044 As a bonus we can now give more details about the reason why a
2045 function is not inlinable. */
2046 if (always_inline)
2047 sorry (inline_forbidden_reason, fn);
2048 else if (do_warning)
2049 warning (OPT_Winline, inline_forbidden_reason, fn);
2051 inlinable = false;
2054 /* Squirrel away the result so that we don't have to check again. */
2055 DECL_UNINLINABLE (fn) = !inlinable;
2057 return inlinable;
2060 /* Estimate the cost of a memory move. Use machine dependent
2061 word size and take possible memcpy call into account. */
2064 estimate_move_cost (tree type)
2066 HOST_WIDE_INT size;
2068 size = int_size_in_bytes (type);
2070 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
2071 /* Cost of a memcpy call, 3 arguments and the call. */
2072 return 4;
2073 else
2074 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
2077 /* Arguments for estimate_num_insns_1. */
2079 struct eni_data
2081 /* Used to return the number of insns. */
2082 int count;
2084 /* Weights of various constructs. */
2085 eni_weights *weights;
2088 /* Used by estimate_num_insns. Estimate number of instructions seen
2089 by given statement. */
2091 static tree
2092 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
2094 struct eni_data *d = data;
2095 tree x = *tp;
2096 unsigned cost;
2098 if (IS_TYPE_OR_DECL_P (x))
2100 *walk_subtrees = 0;
2101 return NULL;
2103 /* Assume that constants and references counts nothing. These should
2104 be majorized by amount of operations among them we count later
2105 and are common target of CSE and similar optimizations. */
2106 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
2107 return NULL;
2109 switch (TREE_CODE (x))
2111 /* Containers have no cost. */
2112 case TREE_LIST:
2113 case TREE_VEC:
2114 case BLOCK:
2115 case COMPONENT_REF:
2116 case BIT_FIELD_REF:
2117 case INDIRECT_REF:
2118 case ALIGN_INDIRECT_REF:
2119 case MISALIGNED_INDIRECT_REF:
2120 case ARRAY_REF:
2121 case ARRAY_RANGE_REF:
2122 case OBJ_TYPE_REF:
2123 case EXC_PTR_EXPR: /* ??? */
2124 case FILTER_EXPR: /* ??? */
2125 case COMPOUND_EXPR:
2126 case BIND_EXPR:
2127 case WITH_CLEANUP_EXPR:
2128 case NOP_EXPR:
2129 case CONVERT_EXPR:
2130 case VIEW_CONVERT_EXPR:
2131 case SAVE_EXPR:
2132 case ADDR_EXPR:
2133 case COMPLEX_EXPR:
2134 case RANGE_EXPR:
2135 case CASE_LABEL_EXPR:
2136 case SSA_NAME:
2137 case CATCH_EXPR:
2138 case EH_FILTER_EXPR:
2139 case STATEMENT_LIST:
2140 case ERROR_MARK:
2141 case NON_LVALUE_EXPR:
2142 case FDESC_EXPR:
2143 case VA_ARG_EXPR:
2144 case TRY_CATCH_EXPR:
2145 case TRY_FINALLY_EXPR:
2146 case LABEL_EXPR:
2147 case GOTO_EXPR:
2148 case RETURN_EXPR:
2149 case EXIT_EXPR:
2150 case LOOP_EXPR:
2151 case PHI_NODE:
2152 case WITH_SIZE_EXPR:
2153 case OMP_CLAUSE:
2154 case OMP_RETURN:
2155 case OMP_CONTINUE:
2156 case OMP_SECTIONS_SWITCH:
2157 break;
2159 /* We don't account constants for now. Assume that the cost is amortized
2160 by operations that do use them. We may re-consider this decision once
2161 we are able to optimize the tree before estimating its size and break
2162 out static initializers. */
2163 case IDENTIFIER_NODE:
2164 case INTEGER_CST:
2165 case REAL_CST:
2166 case FIXED_CST:
2167 case COMPLEX_CST:
2168 case VECTOR_CST:
2169 case STRING_CST:
2170 *walk_subtrees = 0;
2171 return NULL;
2173 /* CHANGE_DYNAMIC_TYPE_EXPR explicitly expands to nothing. */
2174 case CHANGE_DYNAMIC_TYPE_EXPR:
2175 *walk_subtrees = 0;
2176 return NULL;
2178 /* Try to estimate the cost of assignments. We have three cases to
2179 deal with:
2180 1) Simple assignments to registers;
2181 2) Stores to things that must live in memory. This includes
2182 "normal" stores to scalars, but also assignments of large
2183 structures, or constructors of big arrays;
2184 3) TARGET_EXPRs.
2186 Let us look at the first two cases, assuming we have "a = b + C":
2187 <GIMPLE_MODIFY_STMT <var_decl "a">
2188 <plus_expr <var_decl "b"> <constant C>>
2189 If "a" is a GIMPLE register, the assignment to it is free on almost
2190 any target, because "a" usually ends up in a real register. Hence
2191 the only cost of this expression comes from the PLUS_EXPR, and we
2192 can ignore the GIMPLE_MODIFY_STMT.
2193 If "a" is not a GIMPLE register, the assignment to "a" will most
2194 likely be a real store, so the cost of the GIMPLE_MODIFY_STMT is the cost
2195 of moving something into "a", which we compute using the function
2196 estimate_move_cost.
2198 The third case deals with TARGET_EXPRs, for which the semantics are
2199 that a temporary is assigned, unless the TARGET_EXPR itself is being
2200 assigned to something else. In the latter case we do not need the
2201 temporary. E.g. in:
2202 <GIMPLE_MODIFY_STMT <var_decl "a"> <target_expr>>, the
2203 GIMPLE_MODIFY_STMT is free. */
2204 case INIT_EXPR:
2205 case GIMPLE_MODIFY_STMT:
2206 /* Is the right and side a TARGET_EXPR? */
2207 if (TREE_CODE (GENERIC_TREE_OPERAND (x, 1)) == TARGET_EXPR)
2208 break;
2209 /* ... fall through ... */
2211 case TARGET_EXPR:
2212 x = GENERIC_TREE_OPERAND (x, 0);
2213 /* Is this an assignments to a register? */
2214 if (is_gimple_reg (x))
2215 break;
2216 /* Otherwise it's a store, so fall through to compute the move cost. */
2218 case CONSTRUCTOR:
2219 d->count += estimate_move_cost (TREE_TYPE (x));
2220 break;
2222 /* Assign cost of 1 to usual operations.
2223 ??? We may consider mapping RTL costs to this. */
2224 case COND_EXPR:
2225 case VEC_COND_EXPR:
2227 case PLUS_EXPR:
2228 case POINTER_PLUS_EXPR:
2229 case MINUS_EXPR:
2230 case MULT_EXPR:
2232 case FIXED_CONVERT_EXPR:
2233 case FIX_TRUNC_EXPR:
2235 case NEGATE_EXPR:
2236 case FLOAT_EXPR:
2237 case MIN_EXPR:
2238 case MAX_EXPR:
2239 case ABS_EXPR:
2241 case LSHIFT_EXPR:
2242 case RSHIFT_EXPR:
2243 case LROTATE_EXPR:
2244 case RROTATE_EXPR:
2245 case VEC_LSHIFT_EXPR:
2246 case VEC_RSHIFT_EXPR:
2248 case BIT_IOR_EXPR:
2249 case BIT_XOR_EXPR:
2250 case BIT_AND_EXPR:
2251 case BIT_NOT_EXPR:
2253 case TRUTH_ANDIF_EXPR:
2254 case TRUTH_ORIF_EXPR:
2255 case TRUTH_AND_EXPR:
2256 case TRUTH_OR_EXPR:
2257 case TRUTH_XOR_EXPR:
2258 case TRUTH_NOT_EXPR:
2260 case LT_EXPR:
2261 case LE_EXPR:
2262 case GT_EXPR:
2263 case GE_EXPR:
2264 case EQ_EXPR:
2265 case NE_EXPR:
2266 case ORDERED_EXPR:
2267 case UNORDERED_EXPR:
2269 case UNLT_EXPR:
2270 case UNLE_EXPR:
2271 case UNGT_EXPR:
2272 case UNGE_EXPR:
2273 case UNEQ_EXPR:
2274 case LTGT_EXPR:
2276 case CONJ_EXPR:
2278 case PREDECREMENT_EXPR:
2279 case PREINCREMENT_EXPR:
2280 case POSTDECREMENT_EXPR:
2281 case POSTINCREMENT_EXPR:
2283 case ASM_EXPR:
2285 case REALIGN_LOAD_EXPR:
2287 case REDUC_MAX_EXPR:
2288 case REDUC_MIN_EXPR:
2289 case REDUC_PLUS_EXPR:
2290 case WIDEN_SUM_EXPR:
2291 case DOT_PROD_EXPR:
2292 case VEC_WIDEN_MULT_HI_EXPR:
2293 case VEC_WIDEN_MULT_LO_EXPR:
2294 case VEC_UNPACK_HI_EXPR:
2295 case VEC_UNPACK_LO_EXPR:
2296 case VEC_UNPACK_FLOAT_HI_EXPR:
2297 case VEC_UNPACK_FLOAT_LO_EXPR:
2298 case VEC_PACK_TRUNC_EXPR:
2299 case VEC_PACK_SAT_EXPR:
2300 case VEC_PACK_FIX_TRUNC_EXPR:
2302 case WIDEN_MULT_EXPR:
2304 case VEC_EXTRACT_EVEN_EXPR:
2305 case VEC_EXTRACT_ODD_EXPR:
2306 case VEC_INTERLEAVE_HIGH_EXPR:
2307 case VEC_INTERLEAVE_LOW_EXPR:
2309 case RESX_EXPR:
2310 d->count += 1;
2311 break;
2313 case SWITCH_EXPR:
2314 /* TODO: Cost of a switch should be derived from the number of
2315 branches. */
2316 d->count += d->weights->switch_cost;
2317 break;
2319 /* Few special cases of expensive operations. This is useful
2320 to avoid inlining on functions having too many of these. */
2321 case TRUNC_DIV_EXPR:
2322 case CEIL_DIV_EXPR:
2323 case FLOOR_DIV_EXPR:
2324 case ROUND_DIV_EXPR:
2325 case EXACT_DIV_EXPR:
2326 case TRUNC_MOD_EXPR:
2327 case CEIL_MOD_EXPR:
2328 case FLOOR_MOD_EXPR:
2329 case ROUND_MOD_EXPR:
2330 case RDIV_EXPR:
2331 d->count += d->weights->div_mod_cost;
2332 break;
2333 case CALL_EXPR:
2335 tree decl = get_callee_fndecl (x);
2337 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
2338 cost = d->weights->target_builtin_call_cost;
2339 else
2340 cost = d->weights->call_cost;
2342 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
2343 switch (DECL_FUNCTION_CODE (decl))
2345 case BUILT_IN_CONSTANT_P:
2346 *walk_subtrees = 0;
2347 return NULL_TREE;
2348 case BUILT_IN_EXPECT:
2349 return NULL_TREE;
2350 /* Prefetch instruction is not expensive. */
2351 case BUILT_IN_PREFETCH:
2352 cost = 1;
2353 break;
2354 default:
2355 break;
2358 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
2359 that does use function declaration to figure out the arguments. */
2360 if (!decl)
2362 tree a;
2363 call_expr_arg_iterator iter;
2364 FOR_EACH_CALL_EXPR_ARG (a, iter, x)
2365 d->count += estimate_move_cost (TREE_TYPE (a));
2367 else
2369 tree arg;
2370 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2371 d->count += estimate_move_cost (TREE_TYPE (arg));
2374 d->count += cost;
2375 break;
2378 case OMP_PARALLEL:
2379 case OMP_FOR:
2380 case OMP_SECTIONS:
2381 case OMP_SINGLE:
2382 case OMP_SECTION:
2383 case OMP_MASTER:
2384 case OMP_ORDERED:
2385 case OMP_CRITICAL:
2386 case OMP_ATOMIC:
2387 /* OpenMP directives are generally very expensive. */
2388 d->count += d->weights->omp_cost;
2389 break;
2391 default:
2392 gcc_unreachable ();
2394 return NULL;
2397 /* Estimate number of instructions that will be created by expanding EXPR.
2398 WEIGHTS contains weights attributed to various constructs. */
2401 estimate_num_insns (tree expr, eni_weights *weights)
2403 struct pointer_set_t *visited_nodes;
2404 basic_block bb;
2405 block_stmt_iterator bsi;
2406 struct function *my_function;
2407 struct eni_data data;
2409 data.count = 0;
2410 data.weights = weights;
2412 /* If we're given an entire function, walk the CFG. */
2413 if (TREE_CODE (expr) == FUNCTION_DECL)
2415 my_function = DECL_STRUCT_FUNCTION (expr);
2416 gcc_assert (my_function && my_function->cfg);
2417 visited_nodes = pointer_set_create ();
2418 FOR_EACH_BB_FN (bb, my_function)
2420 for (bsi = bsi_start (bb);
2421 !bsi_end_p (bsi);
2422 bsi_next (&bsi))
2424 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
2425 &data, visited_nodes);
2428 pointer_set_destroy (visited_nodes);
2430 else
2431 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &data);
2433 return data.count;
2436 /* Initializes weights used by estimate_num_insns. */
2438 void
2439 init_inline_once (void)
2441 eni_inlining_weights.call_cost = PARAM_VALUE (PARAM_INLINE_CALL_COST);
2442 eni_inlining_weights.target_builtin_call_cost = 1;
2443 eni_inlining_weights.div_mod_cost = 10;
2444 eni_inlining_weights.switch_cost = 1;
2445 eni_inlining_weights.omp_cost = 40;
2447 eni_size_weights.call_cost = 1;
2448 eni_size_weights.target_builtin_call_cost = 1;
2449 eni_size_weights.div_mod_cost = 1;
2450 eni_size_weights.switch_cost = 10;
2451 eni_size_weights.omp_cost = 40;
2453 /* Estimating time for call is difficult, since we have no idea what the
2454 called function does. In the current uses of eni_time_weights,
2455 underestimating the cost does less harm than overestimating it, so
2456 we choose a rather small value here. */
2457 eni_time_weights.call_cost = 10;
2458 eni_time_weights.target_builtin_call_cost = 10;
2459 eni_time_weights.div_mod_cost = 10;
2460 eni_time_weights.switch_cost = 4;
2461 eni_time_weights.omp_cost = 40;
2464 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
2465 static void
2466 add_lexical_block (tree current_block, tree new_block)
2468 tree *blk_p;
2470 /* Walk to the last sub-block. */
2471 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
2472 *blk_p;
2473 blk_p = &TREE_CHAIN (*blk_p))
2475 *blk_p = new_block;
2476 BLOCK_SUPERCONTEXT (new_block) = current_block;
2479 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
2481 static bool
2482 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
2484 copy_body_data *id;
2485 tree t;
2486 tree use_retvar;
2487 tree fn;
2488 struct pointer_map_t *st;
2489 tree return_slot;
2490 tree modify_dest;
2491 location_t saved_location;
2492 struct cgraph_edge *cg_edge;
2493 const char *reason;
2494 basic_block return_block;
2495 edge e;
2496 block_stmt_iterator bsi, stmt_bsi;
2497 bool successfully_inlined = FALSE;
2498 bool purge_dead_abnormal_edges;
2499 tree t_step;
2500 tree var;
2502 /* See what we've got. */
2503 id = (copy_body_data *) data;
2504 t = *tp;
2506 /* Set input_location here so we get the right instantiation context
2507 if we call instantiate_decl from inlinable_function_p. */
2508 saved_location = input_location;
2509 if (EXPR_HAS_LOCATION (t))
2510 input_location = EXPR_LOCATION (t);
2512 /* From here on, we're only interested in CALL_EXPRs. */
2513 if (TREE_CODE (t) != CALL_EXPR)
2514 goto egress;
2516 /* First, see if we can figure out what function is being called.
2517 If we cannot, then there is no hope of inlining the function. */
2518 fn = get_callee_fndecl (t);
2519 if (!fn)
2520 goto egress;
2522 /* Turn forward declarations into real ones. */
2523 fn = cgraph_node (fn)->decl;
2525 /* If fn is a declaration of a function in a nested scope that was
2526 globally declared inline, we don't set its DECL_INITIAL.
2527 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
2528 C++ front-end uses it for cdtors to refer to their internal
2529 declarations, that are not real functions. Fortunately those
2530 don't have trees to be saved, so we can tell by checking their
2531 DECL_SAVED_TREE. */
2532 if (! DECL_INITIAL (fn)
2533 && DECL_ABSTRACT_ORIGIN (fn)
2534 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
2535 fn = DECL_ABSTRACT_ORIGIN (fn);
2537 /* Objective C and fortran still calls tree_rest_of_compilation directly.
2538 Kill this check once this is fixed. */
2539 if (!id->dst_node->analyzed)
2540 goto egress;
2542 cg_edge = cgraph_edge (id->dst_node, stmt);
2544 /* Constant propagation on argument done during previous inlining
2545 may create new direct call. Produce an edge for it. */
2546 if (!cg_edge)
2548 struct cgraph_node *dest = cgraph_node (fn);
2550 /* We have missing edge in the callgraph. This can happen in one case
2551 where previous inlining turned indirect call into direct call by
2552 constant propagating arguments. In all other cases we hit a bug
2553 (incorrect node sharing is most common reason for missing edges. */
2554 gcc_assert (dest->needed || !flag_unit_at_a_time);
2555 cgraph_create_edge (id->dst_node, dest, stmt,
2556 bb->count, CGRAPH_FREQ_BASE,
2557 bb->loop_depth)->inline_failed
2558 = N_("originally indirect function call not considered for inlining");
2559 if (dump_file)
2561 fprintf (dump_file, "Created new direct edge to %s",
2562 cgraph_node_name (dest));
2564 goto egress;
2567 /* Don't try to inline functions that are not well-suited to
2568 inlining. */
2569 if (!cgraph_inline_p (cg_edge, &reason))
2571 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
2572 /* Avoid warnings during early inline pass. */
2573 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2575 sorry ("inlining failed in call to %q+F: %s", fn, reason);
2576 sorry ("called from here");
2578 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
2579 && !DECL_IN_SYSTEM_HEADER (fn)
2580 && strlen (reason)
2581 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
2582 /* Avoid warnings during early inline pass. */
2583 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2585 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
2586 fn, reason);
2587 warning (OPT_Winline, "called from here");
2589 goto egress;
2591 fn = cg_edge->callee->decl;
2593 #ifdef ENABLE_CHECKING
2594 if (cg_edge->callee->decl != id->dst_node->decl)
2595 verify_cgraph_node (cg_edge->callee);
2596 #endif
2598 /* We will be inlining this callee. */
2599 id->eh_region = lookup_stmt_eh_region (stmt);
2601 /* Split the block holding the CALL_EXPR. */
2602 e = split_block (bb, stmt);
2603 bb = e->src;
2604 return_block = e->dest;
2605 remove_edge (e);
2607 /* split_block splits after the statement; work around this by
2608 moving the call into the second block manually. Not pretty,
2609 but seems easier than doing the CFG manipulation by hand
2610 when the CALL_EXPR is in the last statement of BB. */
2611 stmt_bsi = bsi_last (bb);
2612 bsi_remove (&stmt_bsi, false);
2614 /* If the CALL_EXPR was in the last statement of BB, it may have
2615 been the source of abnormal edges. In this case, schedule
2616 the removal of dead abnormal edges. */
2617 bsi = bsi_start (return_block);
2618 if (bsi_end_p (bsi))
2620 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2621 purge_dead_abnormal_edges = true;
2623 else
2625 bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
2626 purge_dead_abnormal_edges = false;
2629 stmt_bsi = bsi_start (return_block);
2631 /* Build a block containing code to initialize the arguments, the
2632 actual inline expansion of the body, and a label for the return
2633 statements within the function to jump to. The type of the
2634 statement expression is the return type of the function call. */
2635 id->block = make_node (BLOCK);
2636 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2637 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2638 add_lexical_block (TREE_BLOCK (stmt), id->block);
2640 /* Local declarations will be replaced by their equivalents in this
2641 map. */
2642 st = id->decl_map;
2643 id->decl_map = pointer_map_create ();
2645 /* Record the function we are about to inline. */
2646 id->src_fn = fn;
2647 id->src_node = cg_edge->callee;
2648 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
2649 id->call_expr = t;
2651 initialize_inlined_parameters (id, t, fn, bb);
2653 if (DECL_INITIAL (fn))
2654 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2656 /* Return statements in the function body will be replaced by jumps
2657 to the RET_LABEL. */
2659 gcc_assert (DECL_INITIAL (fn));
2660 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2662 /* Find the lhs to which the result of this call is assigned. */
2663 return_slot = NULL;
2664 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
2666 modify_dest = GIMPLE_STMT_OPERAND (stmt, 0);
2668 /* The function which we are inlining might not return a value,
2669 in which case we should issue a warning that the function
2670 does not return a value. In that case the optimizers will
2671 see that the variable to which the value is assigned was not
2672 initialized. We do not want to issue a warning about that
2673 uninitialized variable. */
2674 if (DECL_P (modify_dest))
2675 TREE_NO_WARNING (modify_dest) = 1;
2676 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2678 return_slot = modify_dest;
2679 modify_dest = NULL;
2682 else
2683 modify_dest = NULL;
2685 /* Declare the return variable for the function. */
2686 declare_return_variable (id, return_slot,
2687 modify_dest, &use_retvar);
2689 /* This is it. Duplicate the callee body. Assume callee is
2690 pre-gimplified. Note that we must not alter the caller
2691 function in any way before this point, as this CALL_EXPR may be
2692 a self-referential call; if we're calling ourselves, we need to
2693 duplicate our body before altering anything. */
2694 copy_body (id, bb->count, bb->frequency, bb, return_block);
2696 /* Add local vars in this inlined callee to caller. */
2697 t_step = id->src_cfun->unexpanded_var_list;
2698 for (; t_step; t_step = TREE_CHAIN (t_step))
2700 var = TREE_VALUE (t_step);
2701 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2702 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2703 cfun->unexpanded_var_list);
2704 else
2705 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2706 cfun->unexpanded_var_list);
2709 /* Clean up. */
2710 pointer_map_destroy (id->decl_map);
2711 id->decl_map = st;
2713 /* If the inlined function returns a result that we care about,
2714 clobber the CALL_EXPR with a reference to the return variable. */
2715 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2717 *tp = use_retvar;
2718 if (gimple_in_ssa_p (cfun))
2720 update_stmt (stmt);
2721 mark_symbols_for_renaming (stmt);
2723 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2725 else
2726 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2727 tsi_delink() will leave the iterator in a sane state. */
2729 /* Handle case of inlining function that miss return statement so
2730 return value becomes undefined. */
2731 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
2732 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 0)) == SSA_NAME)
2734 tree name = TREE_OPERAND (stmt, 0);
2735 tree var = SSA_NAME_VAR (TREE_OPERAND (stmt, 0));
2736 tree def = gimple_default_def (cfun, var);
2738 /* If the variable is used undefined, make this name undefined via
2739 move. */
2740 if (def)
2742 TREE_OPERAND (stmt, 1) = def;
2743 update_stmt (stmt);
2745 /* Otherwise make this variable undefined. */
2746 else
2748 bsi_remove (&stmt_bsi, true);
2749 set_default_def (var, name);
2750 SSA_NAME_DEF_STMT (name) = build_empty_stmt ();
2753 else
2754 bsi_remove (&stmt_bsi, true);
2757 if (purge_dead_abnormal_edges)
2758 tree_purge_dead_abnormal_call_edges (return_block);
2760 /* If the value of the new expression is ignored, that's OK. We
2761 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2762 the equivalent inlined version either. */
2763 TREE_USED (*tp) = 1;
2765 /* Output the inlining info for this abstract function, since it has been
2766 inlined. If we don't do this now, we can lose the information about the
2767 variables in the function when the blocks get blown away as soon as we
2768 remove the cgraph node. */
2769 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2771 /* Update callgraph if needed. */
2772 cgraph_remove_node (cg_edge->callee);
2774 id->block = NULL_TREE;
2775 successfully_inlined = TRUE;
2777 egress:
2778 input_location = saved_location;
2779 return successfully_inlined;
2782 /* Expand call statements reachable from STMT_P.
2783 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2784 in a GIMPLE_MODIFY_STMT. See tree-gimple.c:get_call_expr_in(). We can
2785 unfortunately not use that function here because we need a pointer
2786 to the CALL_EXPR, not the tree itself. */
2788 static bool
2789 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2791 block_stmt_iterator bsi;
2793 /* Register specific tree functions. */
2794 tree_register_cfg_hooks ();
2795 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2797 tree *expr_p = bsi_stmt_ptr (bsi);
2798 tree stmt = *expr_p;
2800 if (TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT)
2801 expr_p = &GIMPLE_STMT_OPERAND (*expr_p, 1);
2802 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2803 expr_p = &TREE_OPERAND (*expr_p, 0);
2804 if (TREE_CODE (*expr_p) == CALL_EXPR)
2805 if (expand_call_inline (bb, stmt, expr_p, id))
2806 return true;
2808 return false;
2811 /* Walk all basic blocks created after FIRST and try to fold every statement
2812 in the STATEMENTS pointer set. */
2813 static void
2814 fold_marked_statements (int first, struct pointer_set_t *statements)
2816 for (;first < n_basic_blocks;first++)
2817 if (BASIC_BLOCK (first))
2819 block_stmt_iterator bsi;
2820 for (bsi = bsi_start (BASIC_BLOCK (first));
2821 !bsi_end_p (bsi); bsi_next (&bsi))
2822 if (pointer_set_contains (statements, bsi_stmt (bsi)))
2824 tree old_stmt = bsi_stmt (bsi);
2825 if (fold_stmt (bsi_stmt_ptr (bsi)))
2827 update_stmt (bsi_stmt (bsi));
2828 if (maybe_clean_or_replace_eh_stmt (old_stmt, bsi_stmt (bsi)))
2829 tree_purge_dead_eh_edges (BASIC_BLOCK (first));
2835 /* Return true if BB has at least one abnormal outgoing edge. */
2837 static inline bool
2838 has_abnormal_outgoing_edge_p (basic_block bb)
2840 edge e;
2841 edge_iterator ei;
2843 FOR_EACH_EDGE (e, ei, bb->succs)
2844 if (e->flags & EDGE_ABNORMAL)
2845 return true;
2847 return false;
2850 /* Expand calls to inline functions in the body of FN. */
2852 unsigned int
2853 optimize_inline_calls (tree fn)
2855 copy_body_data id;
2856 tree prev_fn;
2857 basic_block bb;
2858 int last = n_basic_blocks;
2859 /* There is no point in performing inlining if errors have already
2860 occurred -- and we might crash if we try to inline invalid
2861 code. */
2862 if (errorcount || sorrycount)
2863 return 0;
2865 /* Clear out ID. */
2866 memset (&id, 0, sizeof (id));
2868 id.src_node = id.dst_node = cgraph_node (fn);
2869 id.dst_fn = fn;
2870 /* Or any functions that aren't finished yet. */
2871 prev_fn = NULL_TREE;
2872 if (current_function_decl)
2874 id.dst_fn = current_function_decl;
2875 prev_fn = current_function_decl;
2878 id.copy_decl = copy_decl_maybe_to_var;
2879 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2880 id.transform_new_cfg = false;
2881 id.transform_return_to_modify = true;
2882 id.transform_lang_insert_block = false;
2883 id.statements_to_fold = pointer_set_create ();
2885 push_gimplify_context ();
2887 /* We make no attempts to keep dominance info up-to-date. */
2888 free_dominance_info (CDI_DOMINATORS);
2889 free_dominance_info (CDI_POST_DOMINATORS);
2891 /* Reach the trees by walking over the CFG, and note the
2892 enclosing basic-blocks in the call edges. */
2893 /* We walk the blocks going forward, because inlined function bodies
2894 will split id->current_basic_block, and the new blocks will
2895 follow it; we'll trudge through them, processing their CALL_EXPRs
2896 along the way. */
2897 FOR_EACH_BB (bb)
2898 gimple_expand_calls_inline (bb, &id);
2900 pop_gimplify_context (NULL);
2902 #ifdef ENABLE_CHECKING
2904 struct cgraph_edge *e;
2906 verify_cgraph_node (id.dst_node);
2908 /* Double check that we inlined everything we are supposed to inline. */
2909 for (e = id.dst_node->callees; e; e = e->next_callee)
2910 gcc_assert (e->inline_failed);
2912 #endif
2914 /* Fold the statements before compacting/renumbering the basic blocks. */
2915 fold_marked_statements (last, id.statements_to_fold);
2916 pointer_set_destroy (id.statements_to_fold);
2918 /* Renumber the (code) basic_blocks consecutively. */
2919 compact_blocks ();
2920 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2921 number_blocks (fn);
2923 /* We are not going to maintain the cgraph edges up to date.
2924 Kill it so it won't confuse us. */
2925 cgraph_node_remove_callees (id.dst_node);
2927 fold_cond_expr_cond ();
2928 /* It would be nice to check SSA/CFG/statement consistency here, but it is
2929 not possible yet - the IPA passes might make various functions to not
2930 throw and they don't care to proactively update local EH info. This is
2931 done later in fixup_cfg pass that also execute the verification. */
2932 return (TODO_update_ssa | TODO_cleanup_cfg
2933 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
2934 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
2937 /* FN is a function that has a complete body, and CLONE is a function whose
2938 body is to be set to a copy of FN, mapping argument declarations according
2939 to the ARG_MAP splay_tree. */
2941 void
2942 clone_body (tree clone, tree fn, void *arg_map)
2944 copy_body_data id;
2946 /* Clone the body, as if we were making an inline call. But, remap the
2947 parameters in the callee to the parameters of caller. */
2948 memset (&id, 0, sizeof (id));
2949 id.src_fn = fn;
2950 id.dst_fn = clone;
2951 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
2952 id.decl_map = (struct pointer_map_t *)arg_map;
2954 id.copy_decl = copy_decl_no_change;
2955 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2956 id.transform_new_cfg = true;
2957 id.transform_return_to_modify = false;
2958 id.transform_lang_insert_block = true;
2960 /* We're not inside any EH region. */
2961 id.eh_region = -1;
2963 /* Actually copy the body. */
2964 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
2967 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2969 tree
2970 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2972 enum tree_code code = TREE_CODE (*tp);
2973 enum tree_code_class cl = TREE_CODE_CLASS (code);
2975 /* We make copies of most nodes. */
2976 if (IS_EXPR_CODE_CLASS (cl)
2977 || IS_GIMPLE_STMT_CODE_CLASS (cl)
2978 || code == TREE_LIST
2979 || code == TREE_VEC
2980 || code == TYPE_DECL
2981 || code == OMP_CLAUSE)
2983 /* Because the chain gets clobbered when we make a copy, we save it
2984 here. */
2985 tree chain = NULL_TREE, new;
2987 if (!GIMPLE_TUPLE_P (*tp))
2988 chain = TREE_CHAIN (*tp);
2990 /* Copy the node. */
2991 new = copy_node (*tp);
2993 /* Propagate mudflap marked-ness. */
2994 if (flag_mudflap && mf_marked_p (*tp))
2995 mf_mark (new);
2997 *tp = new;
2999 /* Now, restore the chain, if appropriate. That will cause
3000 walk_tree to walk into the chain as well. */
3001 if (code == PARM_DECL
3002 || code == TREE_LIST
3003 || code == OMP_CLAUSE)
3004 TREE_CHAIN (*tp) = chain;
3006 /* For now, we don't update BLOCKs when we make copies. So, we
3007 have to nullify all BIND_EXPRs. */
3008 if (TREE_CODE (*tp) == BIND_EXPR)
3009 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
3011 else if (code == CONSTRUCTOR)
3013 /* CONSTRUCTOR nodes need special handling because
3014 we need to duplicate the vector of elements. */
3015 tree new;
3017 new = copy_node (*tp);
3019 /* Propagate mudflap marked-ness. */
3020 if (flag_mudflap && mf_marked_p (*tp))
3021 mf_mark (new);
3023 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
3024 CONSTRUCTOR_ELTS (*tp));
3025 *tp = new;
3027 else if (TREE_CODE_CLASS (code) == tcc_type)
3028 *walk_subtrees = 0;
3029 else if (TREE_CODE_CLASS (code) == tcc_declaration)
3030 *walk_subtrees = 0;
3031 else if (TREE_CODE_CLASS (code) == tcc_constant)
3032 *walk_subtrees = 0;
3033 else
3034 gcc_assert (code != STATEMENT_LIST);
3035 return NULL_TREE;
3038 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3039 information indicating to what new SAVE_EXPR this one should be mapped,
3040 use that one. Otherwise, create a new node and enter it in ST. FN is
3041 the function into which the copy will be placed. */
3043 static void
3044 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
3046 struct pointer_map_t *st = (struct pointer_map_t *) st_;
3047 tree *n;
3048 tree t;
3050 /* See if we already encountered this SAVE_EXPR. */
3051 n = (tree *) pointer_map_contains (st, *tp);
3053 /* If we didn't already remap this SAVE_EXPR, do so now. */
3054 if (!n)
3056 t = copy_node (*tp);
3058 /* Remember this SAVE_EXPR. */
3059 *pointer_map_insert (st, *tp) = t;
3060 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3061 *pointer_map_insert (st, t) = t;
3063 else
3065 /* We've already walked into this SAVE_EXPR; don't do it again. */
3066 *walk_subtrees = 0;
3067 t = *n;
3070 /* Replace this SAVE_EXPR with the copy. */
3071 *tp = t;
3074 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3075 copies the declaration and enters it in the splay_tree in DATA (which is
3076 really an `copy_body_data *'). */
3078 static tree
3079 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3080 void *data)
3082 copy_body_data *id = (copy_body_data *) data;
3084 /* Don't walk into types. */
3085 if (TYPE_P (*tp))
3086 *walk_subtrees = 0;
3088 else if (TREE_CODE (*tp) == LABEL_EXPR)
3090 tree decl = TREE_OPERAND (*tp, 0);
3092 /* Copy the decl and remember the copy. */
3093 insert_decl_map (id, decl, id->copy_decl (decl, id));
3096 return NULL_TREE;
3099 /* Perform any modifications to EXPR required when it is unsaved. Does
3100 not recurse into EXPR's subtrees. */
3102 static void
3103 unsave_expr_1 (tree expr)
3105 switch (TREE_CODE (expr))
3107 case TARGET_EXPR:
3108 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3109 It's OK for this to happen if it was part of a subtree that
3110 isn't immediately expanded, such as operand 2 of another
3111 TARGET_EXPR. */
3112 if (TREE_OPERAND (expr, 1))
3113 break;
3115 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3116 TREE_OPERAND (expr, 3) = NULL_TREE;
3117 break;
3119 default:
3120 break;
3124 /* Called via walk_tree when an expression is unsaved. Using the
3125 splay_tree pointed to by ST (which is really a `splay_tree'),
3126 remaps all local declarations to appropriate replacements. */
3128 static tree
3129 unsave_r (tree *tp, int *walk_subtrees, void *data)
3131 copy_body_data *id = (copy_body_data *) data;
3132 struct pointer_map_t *st = id->decl_map;
3133 tree *n;
3135 /* Only a local declaration (variable or label). */
3136 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3137 || TREE_CODE (*tp) == LABEL_DECL)
3139 /* Lookup the declaration. */
3140 n = (tree *) pointer_map_contains (st, *tp);
3142 /* If it's there, remap it. */
3143 if (n)
3144 *tp = *n;
3147 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3148 copy_statement_list (tp);
3149 else if (TREE_CODE (*tp) == BIND_EXPR)
3150 copy_bind_expr (tp, walk_subtrees, id);
3151 else if (TREE_CODE (*tp) == SAVE_EXPR)
3152 remap_save_expr (tp, st, walk_subtrees);
3153 else
3155 copy_tree_r (tp, walk_subtrees, NULL);
3157 /* Do whatever unsaving is required. */
3158 unsave_expr_1 (*tp);
3161 /* Keep iterating. */
3162 return NULL_TREE;
3165 /* Copies everything in EXPR and replaces variables, labels
3166 and SAVE_EXPRs local to EXPR. */
3168 tree
3169 unsave_expr_now (tree expr)
3171 copy_body_data id;
3173 /* There's nothing to do for NULL_TREE. */
3174 if (expr == 0)
3175 return expr;
3177 /* Set up ID. */
3178 memset (&id, 0, sizeof (id));
3179 id.src_fn = current_function_decl;
3180 id.dst_fn = current_function_decl;
3181 id.decl_map = pointer_map_create ();
3183 id.copy_decl = copy_decl_no_change;
3184 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3185 id.transform_new_cfg = false;
3186 id.transform_return_to_modify = false;
3187 id.transform_lang_insert_block = false;
3189 /* Walk the tree once to find local labels. */
3190 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3192 /* Walk the tree again, copying, remapping, and unsaving. */
3193 walk_tree (&expr, unsave_r, &id, NULL);
3195 /* Clean up. */
3196 pointer_map_destroy (id.decl_map);
3198 return expr;
3201 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
3203 static tree
3204 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
3206 if (*tp == data)
3207 return (tree) data;
3208 else
3209 return NULL;
3212 bool
3213 debug_find_tree (tree top, tree search)
3215 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
3219 /* Declare the variables created by the inliner. Add all the variables in
3220 VARS to BIND_EXPR. */
3222 static void
3223 declare_inline_vars (tree block, tree vars)
3225 tree t;
3226 for (t = vars; t; t = TREE_CHAIN (t))
3228 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
3229 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
3230 cfun->unexpanded_var_list =
3231 tree_cons (NULL_TREE, t,
3232 cfun->unexpanded_var_list);
3235 if (block)
3236 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
3240 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
3241 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
3242 VAR_DECL translation. */
3244 static tree
3245 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
3247 /* Don't generate debug information for the copy if we wouldn't have
3248 generated it for the copy either. */
3249 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
3250 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
3252 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
3253 declaration inspired this copy. */
3254 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
3256 /* The new variable/label has no RTL, yet. */
3257 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
3258 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
3259 SET_DECL_RTL (copy, NULL_RTX);
3261 /* These args would always appear unused, if not for this. */
3262 TREE_USED (copy) = 1;
3264 /* Set the context for the new declaration. */
3265 if (!DECL_CONTEXT (decl))
3266 /* Globals stay global. */
3268 else if (DECL_CONTEXT (decl) != id->src_fn)
3269 /* Things that weren't in the scope of the function we're inlining
3270 from aren't in the scope we're inlining to, either. */
3272 else if (TREE_STATIC (decl))
3273 /* Function-scoped static variables should stay in the original
3274 function. */
3276 else
3277 /* Ordinary automatic local variables are now in the scope of the
3278 new function. */
3279 DECL_CONTEXT (copy) = id->dst_fn;
3281 return copy;
3284 static tree
3285 copy_decl_to_var (tree decl, copy_body_data *id)
3287 tree copy, type;
3289 gcc_assert (TREE_CODE (decl) == PARM_DECL
3290 || TREE_CODE (decl) == RESULT_DECL);
3292 type = TREE_TYPE (decl);
3294 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3295 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3296 TREE_READONLY (copy) = TREE_READONLY (decl);
3297 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3298 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3299 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3301 return copy_decl_for_dup_finish (id, decl, copy);
3304 /* Like copy_decl_to_var, but create a return slot object instead of a
3305 pointer variable for return by invisible reference. */
3307 static tree
3308 copy_result_decl_to_var (tree decl, copy_body_data *id)
3310 tree copy, type;
3312 gcc_assert (TREE_CODE (decl) == PARM_DECL
3313 || TREE_CODE (decl) == RESULT_DECL);
3315 type = TREE_TYPE (decl);
3316 if (DECL_BY_REFERENCE (decl))
3317 type = TREE_TYPE (type);
3319 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3320 TREE_READONLY (copy) = TREE_READONLY (decl);
3321 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3322 if (!DECL_BY_REFERENCE (decl))
3324 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3325 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3326 DECL_NO_TBAA_P (copy) = DECL_NO_TBAA_P (decl);
3329 return copy_decl_for_dup_finish (id, decl, copy);
3333 static tree
3334 copy_decl_no_change (tree decl, copy_body_data *id)
3336 tree copy;
3338 copy = copy_node (decl);
3340 /* The COPY is not abstract; it will be generated in DST_FN. */
3341 DECL_ABSTRACT (copy) = 0;
3342 lang_hooks.dup_lang_specific_decl (copy);
3344 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
3345 been taken; it's for internal bookkeeping in expand_goto_internal. */
3346 if (TREE_CODE (copy) == LABEL_DECL)
3348 TREE_ADDRESSABLE (copy) = 0;
3349 LABEL_DECL_UID (copy) = -1;
3352 return copy_decl_for_dup_finish (id, decl, copy);
3355 static tree
3356 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
3358 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
3359 return copy_decl_to_var (decl, id);
3360 else
3361 return copy_decl_no_change (decl, id);
3364 /* Return a copy of the function's argument tree. */
3365 static tree
3366 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
3368 tree *arg_copy, *parg;
3370 arg_copy = &orig_parm;
3371 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
3373 tree new = remap_decl (*parg, id);
3374 lang_hooks.dup_lang_specific_decl (new);
3375 TREE_CHAIN (new) = TREE_CHAIN (*parg);
3376 *parg = new;
3378 return orig_parm;
3381 /* Return a copy of the function's static chain. */
3382 static tree
3383 copy_static_chain (tree static_chain, copy_body_data * id)
3385 tree *chain_copy, *pvar;
3387 chain_copy = &static_chain;
3388 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
3390 tree new = remap_decl (*pvar, id);
3391 lang_hooks.dup_lang_specific_decl (new);
3392 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
3393 *pvar = new;
3395 return static_chain;
3398 /* Return true if the function is allowed to be versioned.
3399 This is a guard for the versioning functionality. */
3400 bool
3401 tree_versionable_function_p (tree fndecl)
3403 if (fndecl == NULL_TREE)
3404 return false;
3405 /* ??? There are cases where a function is
3406 uninlinable but can be versioned. */
3407 if (!tree_inlinable_function_p (fndecl))
3408 return false;
3410 return true;
3413 /* Create a copy of a function's tree.
3414 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
3415 of the original function and the new copied function
3416 respectively. In case we want to replace a DECL
3417 tree with another tree while duplicating the function's
3418 body, TREE_MAP represents the mapping between these
3419 trees. If UPDATE_CLONES is set, the call_stmt fields
3420 of edges of clones of the function will be updated. */
3421 void
3422 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
3423 bool update_clones)
3425 struct cgraph_node *old_version_node;
3426 struct cgraph_node *new_version_node;
3427 copy_body_data id;
3428 tree p;
3429 unsigned i;
3430 struct ipa_replace_map *replace_info;
3431 basic_block old_entry_block;
3432 tree t_step;
3433 tree old_current_function_decl = current_function_decl;
3435 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
3436 && TREE_CODE (new_decl) == FUNCTION_DECL);
3437 DECL_POSSIBLY_INLINED (old_decl) = 1;
3439 old_version_node = cgraph_node (old_decl);
3440 new_version_node = cgraph_node (new_decl);
3442 DECL_ARTIFICIAL (new_decl) = 1;
3443 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
3445 /* Prepare the data structures for the tree copy. */
3446 memset (&id, 0, sizeof (id));
3448 /* Generate a new name for the new version. */
3449 if (!update_clones)
3451 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
3452 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
3453 SET_DECL_RTL (new_decl, NULL_RTX);
3454 id.statements_to_fold = pointer_set_create ();
3457 id.decl_map = pointer_map_create ();
3458 id.src_fn = old_decl;
3459 id.dst_fn = new_decl;
3460 id.src_node = old_version_node;
3461 id.dst_node = new_version_node;
3462 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
3464 id.copy_decl = copy_decl_no_change;
3465 id.transform_call_graph_edges
3466 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
3467 id.transform_new_cfg = true;
3468 id.transform_return_to_modify = false;
3469 id.transform_lang_insert_block = false;
3471 current_function_decl = new_decl;
3472 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
3473 (DECL_STRUCT_FUNCTION (old_decl));
3474 initialize_cfun (new_decl, old_decl,
3475 old_entry_block->count,
3476 old_entry_block->frequency);
3477 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
3479 /* Copy the function's static chain. */
3480 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
3481 if (p)
3482 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
3483 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
3484 &id);
3485 /* Copy the function's arguments. */
3486 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
3487 DECL_ARGUMENTS (new_decl) =
3488 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
3490 /* If there's a tree_map, prepare for substitution. */
3491 if (tree_map)
3492 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
3494 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
3495 if (replace_info->replace_p)
3496 insert_decl_map (&id, replace_info->old_tree,
3497 replace_info->new_tree);
3500 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
3502 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3503 number_blocks (id.dst_fn);
3505 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
3506 /* Add local vars. */
3507 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
3508 t_step; t_step = TREE_CHAIN (t_step))
3510 tree var = TREE_VALUE (t_step);
3511 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3512 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
3513 cfun->unexpanded_var_list);
3514 else
3515 cfun->unexpanded_var_list =
3516 tree_cons (NULL_TREE, remap_decl (var, &id),
3517 cfun->unexpanded_var_list);
3520 /* Copy the Function's body. */
3521 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
3523 if (DECL_RESULT (old_decl) != NULL_TREE)
3525 tree *res_decl = &DECL_RESULT (old_decl);
3526 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
3527 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
3530 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3531 number_blocks (new_decl);
3533 /* Clean up. */
3534 pointer_map_destroy (id.decl_map);
3535 if (!update_clones)
3537 fold_marked_statements (0, id.statements_to_fold);
3538 pointer_set_destroy (id.statements_to_fold);
3539 fold_cond_expr_cond ();
3541 if (gimple_in_ssa_p (cfun))
3543 free_dominance_info (CDI_DOMINATORS);
3544 free_dominance_info (CDI_POST_DOMINATORS);
3545 if (!update_clones)
3546 delete_unreachable_blocks ();
3547 update_ssa (TODO_update_ssa);
3548 if (!update_clones)
3550 fold_cond_expr_cond ();
3551 if (need_ssa_update_p ())
3552 update_ssa (TODO_update_ssa);
3555 free_dominance_info (CDI_DOMINATORS);
3556 free_dominance_info (CDI_POST_DOMINATORS);
3557 pop_cfun ();
3558 current_function_decl = old_current_function_decl;
3559 gcc_assert (!current_function_decl
3560 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
3561 return;
3564 /* Duplicate a type, fields and all. */
3566 tree
3567 build_duplicate_type (tree type)
3569 struct copy_body_data id;
3571 memset (&id, 0, sizeof (id));
3572 id.src_fn = current_function_decl;
3573 id.dst_fn = current_function_decl;
3574 id.src_cfun = cfun;
3575 id.decl_map = pointer_map_create ();
3577 type = remap_type_1 (type, &id);
3579 pointer_map_destroy (id.decl_map);
3581 return type;