2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
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)
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/>. */
24 #include "coretypes.h"
28 #include "tree-inline.h"
34 #include "insn-config.h"
36 #include "langhooks.h"
37 #include "basic-block.h"
38 #include "tree-iterator.h"
41 #include "tree-mudflap.h"
42 #include "tree-flow.h"
45 #include "tree-flow.h"
46 #include "diagnostic.h"
49 #include "pointer-set.h"
51 #include "value-prof.h"
52 #include "tree-pass.h"
54 #include "integrate.h"
56 /* I'm not real happy about this, but we need to handle gimple and
60 /* Inlining, Cloning, Versioning, Parallelization
62 Inlining: a function body is duplicated, but the PARM_DECLs are
63 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
64 MODIFY_EXPRs that store to a dedicated returned-value variable.
65 The duplicated eh_region info of the copy will later be appended
66 to the info for the caller; the eh_region info in copied throwing
67 statements and RESX_EXPRs is adjusted accordingly.
69 Cloning: (only in C++) We have one body for a con/de/structor, and
70 multiple function decls, each with a unique parameter list.
71 Duplicate the body, using the given splay tree; some parameters
72 will become constants (like 0 or 1).
74 Versioning: a function body is duplicated and the result is a new
75 function rather than into blocks of an existing function as with
76 inlining. Some parameters will become constants.
78 Parallelization: a region of a function is duplicated resulting in
79 a new function. Variables may be replaced with complex expressions
80 to enable shared variable semantics.
82 All of these will simultaneously lookup any callgraph edges. If
83 we're going to inline the duplicated function body, and the given
84 function has some cloned callgraph nodes (one for each place this
85 function will be inlined) those callgraph edges will be duplicated.
86 If we're cloning the body, those callgraph edges will be
87 updated to point into the new body. (Note that the original
88 callgraph node and edge list will not be altered.)
90 See the CALL_EXPR handling case in copy_tree_body_r (). */
94 o In order to make inlining-on-trees work, we pessimized
95 function-local static constants. In particular, they are now
96 always output, even when not addressed. Fix this by treating
97 function-local static constants just like global static
98 constants; the back-end already knows not to output them if they
101 o Provide heuristics to clamp inlining of recursive template
105 /* Weights that estimate_num_insns uses for heuristics in inlining. */
107 eni_weights eni_inlining_weights
;
109 /* Weights that estimate_num_insns uses to estimate the size of the
112 eni_weights eni_size_weights
;
114 /* Weights that estimate_num_insns uses to estimate the time necessary
115 to execute the produced code. */
117 eni_weights eni_time_weights
;
121 static tree
declare_return_variable (copy_body_data
*, tree
, tree
, tree
*);
122 static void remap_block (tree
*, copy_body_data
*);
123 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
124 static tree
mark_local_for_remap_r (tree
*, int *, void *);
125 static void unsave_expr_1 (tree
);
126 static tree
unsave_r (tree
*, int *, void *);
127 static void declare_inline_vars (tree
, tree
);
128 static void remap_save_expr (tree
*, void *, int *);
129 static void prepend_lexical_block (tree current_block
, tree new_block
);
130 static tree
copy_decl_to_var (tree
, copy_body_data
*);
131 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
132 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
133 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
134 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
136 /* Insert a tree->tree mapping for ID. Despite the name suggests
137 that the trees should be variables, it is used for more than that. */
140 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
142 *pointer_map_insert (id
->decl_map
, key
) = value
;
144 /* Always insert an identity map as well. If we see this same new
145 node again, we won't want to duplicate it a second time. */
147 *pointer_map_insert (id
->decl_map
, value
) = value
;
150 /* Construct new SSA name for old NAME. ID is the inline context. */
153 remap_ssa_name (tree name
, copy_body_data
*id
)
158 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
160 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
162 return unshare_expr (*n
);
164 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
166 new_tree
= remap_decl (SSA_NAME_VAR (name
), id
);
168 /* We might've substituted constant or another SSA_NAME for
171 Replace the SSA name representing RESULT_DECL by variable during
172 inlining: this saves us from need to introduce PHI node in a case
173 return value is just partly initialized. */
174 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
175 && (TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
176 || !id
->transform_return_to_modify
))
178 new_tree
= make_ssa_name (new_tree
, NULL
);
179 insert_decl_map (id
, name
, new_tree
);
180 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
181 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
182 TREE_TYPE (new_tree
) = TREE_TYPE (SSA_NAME_VAR (new_tree
));
183 if (gimple_nop_p (SSA_NAME_DEF_STMT (name
)))
185 /* By inlining function having uninitialized variable, we might
186 extend the lifetime (variable might get reused). This cause
187 ICE in the case we end up extending lifetime of SSA name across
188 abnormal edge, but also increase register pressure.
190 We simply initialize all uninitialized vars by 0 except
191 for case we are inlining to very first BB. We can avoid
192 this for all BBs that are not inside strongly connected
193 regions of the CFG, but this is expensive to test. */
195 && is_gimple_reg (SSA_NAME_VAR (name
))
196 && TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
197 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0)->dest
198 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
200 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
203 init_stmt
= gimple_build_assign (new_tree
,
204 fold_convert (TREE_TYPE (new_tree
),
206 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
207 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
211 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
212 if (gimple_default_def (id
->src_cfun
, SSA_NAME_VAR (name
))
214 set_default_def (SSA_NAME_VAR (new_tree
), new_tree
);
219 insert_decl_map (id
, name
, new_tree
);
223 /* Remap DECL during the copying of the BLOCK tree for the function. */
226 remap_decl (tree decl
, copy_body_data
*id
)
231 /* We only remap local variables in the current function. */
234 /* See if we have remapped this declaration. */
236 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
238 /* If we didn't already have an equivalent for this declaration,
242 /* Make a copy of the variable or label. */
243 tree t
= id
->copy_decl (decl
, id
);
245 /* Remember it, so that if we encounter this local entity again
246 we can reuse this copy. Do this early because remap_type may
247 need this decl for TYPE_STUB_DECL. */
248 insert_decl_map (id
, decl
, t
);
253 /* Remap types, if necessary. */
254 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
255 if (TREE_CODE (t
) == TYPE_DECL
)
256 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
258 /* Remap sizes as necessary. */
259 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
260 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
262 /* If fields, do likewise for offset and qualifier. */
263 if (TREE_CODE (t
) == FIELD_DECL
)
265 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
266 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
267 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
270 if (cfun
&& gimple_in_ssa_p (cfun
)
271 && (TREE_CODE (t
) == VAR_DECL
272 || TREE_CODE (t
) == RESULT_DECL
|| TREE_CODE (t
) == PARM_DECL
))
274 tree def
= gimple_default_def (id
->src_cfun
, decl
);
276 if (TREE_CODE (decl
) != PARM_DECL
&& def
)
278 tree map
= remap_ssa_name (def
, id
);
279 /* Watch out RESULT_DECLs whose SSA names map directly
281 if (TREE_CODE (map
) == SSA_NAME
282 && gimple_nop_p (SSA_NAME_DEF_STMT (map
)))
283 set_default_def (t
, map
);
285 add_referenced_var (t
);
290 if (id
->do_not_unshare
)
293 return unshare_expr (*n
);
297 remap_type_1 (tree type
, copy_body_data
*id
)
301 /* We do need a copy. build and register it now. If this is a pointer or
302 reference type, remap the designated type and make a new pointer or
304 if (TREE_CODE (type
) == POINTER_TYPE
)
306 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
308 TYPE_REF_CAN_ALIAS_ALL (type
));
309 insert_decl_map (id
, type
, new_tree
);
312 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
314 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
316 TYPE_REF_CAN_ALIAS_ALL (type
));
317 insert_decl_map (id
, type
, new_tree
);
321 new_tree
= copy_node (type
);
323 insert_decl_map (id
, type
, new_tree
);
325 /* This is a new type, not a copy of an old type. Need to reassociate
326 variants. We can handle everything except the main variant lazily. */
327 t
= TYPE_MAIN_VARIANT (type
);
330 t
= remap_type (t
, id
);
331 TYPE_MAIN_VARIANT (new_tree
) = t
;
332 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
333 TYPE_NEXT_VARIANT (t
) = new_tree
;
337 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
338 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
341 if (TYPE_STUB_DECL (type
))
342 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
344 /* Lazily create pointer and reference types. */
345 TYPE_POINTER_TO (new_tree
) = NULL
;
346 TYPE_REFERENCE_TO (new_tree
) = NULL
;
348 switch (TREE_CODE (new_tree
))
352 case FIXED_POINT_TYPE
:
355 t
= TYPE_MIN_VALUE (new_tree
);
356 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
357 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
359 t
= TYPE_MAX_VALUE (new_tree
);
360 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
361 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
365 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
366 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
370 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
371 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
376 case QUAL_UNION_TYPE
:
380 for (f
= TYPE_FIELDS (new_tree
); f
; f
= TREE_CHAIN (f
))
382 t
= remap_decl (f
, id
);
383 DECL_CONTEXT (t
) = new_tree
;
387 TYPE_FIELDS (new_tree
) = nreverse (nf
);
393 /* Shouldn't have been thought variable sized. */
397 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
398 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
404 remap_type (tree type
, copy_body_data
*id
)
412 /* See if we have remapped this type. */
413 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
417 /* The type only needs remapping if it's variably modified. */
418 if (! variably_modified_type_p (type
, id
->src_fn
))
420 insert_decl_map (id
, type
, type
);
424 id
->remapping_type_depth
++;
425 tmp
= remap_type_1 (type
, id
);
426 id
->remapping_type_depth
--;
431 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
432 is NULL or TYPE has not been remapped before. */
435 remapped_type (tree type
, copy_body_data
*id
)
442 /* See if we have remapped this type. */
443 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
450 /* The type only needs remapping if it's variably modified. */
451 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
454 can_be_nonlocal (tree decl
, copy_body_data
*id
)
456 /* We can not duplicate function decls. */
457 if (TREE_CODE (decl
) == FUNCTION_DECL
)
460 /* Local static vars must be non-local or we get multiple declaration
462 if (TREE_CODE (decl
) == VAR_DECL
463 && !auto_var_in_fn_p (decl
, id
->src_fn
))
466 /* At the moment dwarf2out can handle only these types of nodes. We
467 can support more later. */
468 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != PARM_DECL
)
471 /* We must use global type. We call remapped_type instead of
472 remap_type since we don't want to remap this type here if it
473 hasn't been remapped before. */
474 if (TREE_TYPE (decl
) != remapped_type (TREE_TYPE (decl
), id
))
477 /* Wihtout SSA we can't tell if variable is used. */
478 if (!gimple_in_ssa_p (cfun
))
481 /* Live variables must be copied so we can attach DECL_RTL. */
489 remap_decls (tree decls
, VEC(tree
,gc
) **nonlocalized_list
, copy_body_data
*id
)
492 tree new_decls
= NULL_TREE
;
494 /* Remap its variables. */
495 for (old_var
= decls
; old_var
; old_var
= TREE_CHAIN (old_var
))
498 tree origin_var
= DECL_ORIGIN (old_var
);
500 if (can_be_nonlocal (old_var
, id
))
502 if (TREE_CODE (old_var
) == VAR_DECL
503 && (var_ann (old_var
) || !gimple_in_ssa_p (cfun
)))
504 cfun
->local_decls
= tree_cons (NULL_TREE
, old_var
,
506 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
507 && !DECL_IGNORED_P (old_var
)
508 && nonlocalized_list
)
509 VEC_safe_push (tree
, gc
, *nonlocalized_list
, origin_var
);
513 /* Remap the variable. */
514 new_var
= remap_decl (old_var
, id
);
516 /* If we didn't remap this variable, we can't mess with its
517 TREE_CHAIN. If we remapped this variable to the return slot, it's
518 already declared somewhere else, so don't declare it here. */
520 if (new_var
== id
->retvar
)
524 if ((!optimize
|| debug_info_level
> DINFO_LEVEL_TERSE
)
525 && !DECL_IGNORED_P (old_var
)
526 && nonlocalized_list
)
527 VEC_safe_push (tree
, gc
, *nonlocalized_list
, origin_var
);
531 gcc_assert (DECL_P (new_var
));
532 TREE_CHAIN (new_var
) = new_decls
;
537 return nreverse (new_decls
);
540 /* Copy the BLOCK to contain remapped versions of the variables
541 therein. And hook the new block into the block-tree. */
544 remap_block (tree
*block
, copy_body_data
*id
)
550 /* Make the new block. */
552 new_block
= make_node (BLOCK
);
553 TREE_USED (new_block
) = TREE_USED (old_block
);
554 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
555 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
556 BLOCK_NONLOCALIZED_VARS (new_block
)
557 = VEC_copy (tree
, gc
, BLOCK_NONLOCALIZED_VARS (old_block
));
560 /* Remap its variables. */
561 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
562 &BLOCK_NONLOCALIZED_VARS (new_block
),
567 if (id
->transform_lang_insert_block
)
568 id
->transform_lang_insert_block (new_block
);
570 /* Remember the remapped block. */
571 insert_decl_map (id
, old_block
, new_block
);
574 /* Copy the whole block tree and root it in id->block. */
576 remap_blocks (tree block
, copy_body_data
*id
)
579 tree new_tree
= block
;
584 remap_block (&new_tree
, id
);
585 gcc_assert (new_tree
!= block
);
586 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
587 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
588 /* Blocks are in arbitrary order, but make things slightly prettier and do
589 not swap order when producing a copy. */
590 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
595 copy_statement_list (tree
*tp
)
597 tree_stmt_iterator oi
, ni
;
600 new_tree
= alloc_stmt_list ();
601 ni
= tsi_start (new_tree
);
602 oi
= tsi_start (*tp
);
603 TREE_TYPE (new_tree
) = TREE_TYPE (*tp
);
606 for (; !tsi_end_p (oi
); tsi_next (&oi
))
608 tree stmt
= tsi_stmt (oi
);
609 if (TREE_CODE (stmt
) == STATEMENT_LIST
)
610 copy_statement_list (&stmt
);
611 tsi_link_after (&ni
, stmt
, TSI_CONTINUE_LINKING
);
616 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
618 tree block
= BIND_EXPR_BLOCK (*tp
);
619 /* Copy (and replace) the statement. */
620 copy_tree_r (tp
, walk_subtrees
, NULL
);
623 remap_block (&block
, id
);
624 BIND_EXPR_BLOCK (*tp
) = block
;
627 if (BIND_EXPR_VARS (*tp
))
628 /* This will remap a lot of the same decls again, but this should be
630 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
634 /* Create a new gimple_seq by remapping all the statements in BODY
635 using the inlining information in ID. */
638 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
640 gimple_stmt_iterator si
;
641 gimple_seq new_body
= NULL
;
643 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
645 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
646 gimple_seq_add_stmt (&new_body
, new_stmt
);
653 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
654 block using the mapping information in ID. */
657 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
660 tree new_block
, new_vars
;
661 gimple_seq body
, new_body
;
663 /* Copy the statement. Note that we purposely don't use copy_stmt
664 here because we need to remap statements as we copy. */
665 body
= gimple_bind_body (stmt
);
666 new_body
= remap_gimple_seq (body
, id
);
668 new_block
= gimple_bind_block (stmt
);
670 remap_block (&new_block
, id
);
672 /* This will remap a lot of the same decls again, but this should be
674 new_vars
= gimple_bind_vars (stmt
);
676 new_vars
= remap_decls (new_vars
, NULL
, id
);
678 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
684 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
685 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
686 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
687 recursing into the children nodes of *TP. */
690 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
692 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
693 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
694 tree fn
= id
->src_fn
;
696 if (TREE_CODE (*tp
) == SSA_NAME
)
698 *tp
= remap_ssa_name (*tp
, id
);
702 else if (auto_var_in_fn_p (*tp
, fn
))
704 /* Local variables and labels need to be replaced by equivalent
705 variables. We don't want to copy static variables; there's
706 only one of those, no matter how many times we inline the
707 containing function. Similarly for globals from an outer
711 /* Remap the declaration. */
712 new_decl
= remap_decl (*tp
, id
);
713 gcc_assert (new_decl
);
714 /* Replace this variable with the copy. */
715 STRIP_TYPE_NOPS (new_decl
);
716 /* ??? The C++ frontend uses void * pointer zero to initialize
717 any other type. This confuses the middle-end type verification.
718 As cloned bodies do not go through gimplification again the fixup
719 there doesn't trigger. */
720 if (TREE_CODE (new_decl
) == INTEGER_CST
721 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
722 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
726 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
728 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
730 else if (TREE_CODE (*tp
) == LABEL_DECL
731 && (!DECL_CONTEXT (*tp
)
732 || decl_function_context (*tp
) == id
->src_fn
))
733 /* These may need to be remapped for EH handling. */
734 *tp
= remap_decl (*tp
, id
);
735 else if (TYPE_P (*tp
))
736 /* Types may need remapping as well. */
737 *tp
= remap_type (*tp
, id
);
738 else if (CONSTANT_CLASS_P (*tp
))
740 /* If this is a constant, we have to copy the node iff the type
741 will be remapped. copy_tree_r will not copy a constant. */
742 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
744 if (new_type
== TREE_TYPE (*tp
))
747 else if (TREE_CODE (*tp
) == INTEGER_CST
)
748 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
749 TREE_INT_CST_HIGH (*tp
));
752 *tp
= copy_node (*tp
);
753 TREE_TYPE (*tp
) = new_type
;
758 /* Otherwise, just copy the node. Note that copy_tree_r already
759 knows not to copy VAR_DECLs, etc., so this is safe. */
760 if (TREE_CODE (*tp
) == INDIRECT_REF
)
762 /* Get rid of *& from inline substitutions that can happen when a
763 pointer argument is an ADDR_EXPR. */
764 tree decl
= TREE_OPERAND (*tp
, 0);
767 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
770 tree type
, new_tree
, old
;
772 /* If we happen to get an ADDR_EXPR in n->value, strip
773 it manually here as we'll eventually get ADDR_EXPRs
774 which lie about their types pointed to. In this case
775 build_fold_indirect_ref wouldn't strip the
776 INDIRECT_REF, but we absolutely rely on that. As
777 fold_indirect_ref does other useful transformations,
778 try that first, though. */
779 type
= TREE_TYPE (TREE_TYPE (*n
));
780 new_tree
= unshare_expr (*n
);
782 *tp
= gimple_fold_indirect_ref (new_tree
);
785 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
787 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
789 /* ??? We should either assert here or build
790 a VIEW_CONVERT_EXPR instead of blindly leaking
791 incompatible types to our IL. */
793 *tp
= TREE_OPERAND (new_tree
, 0);
797 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
798 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
799 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
807 /* Here is the "usual case". Copy this tree node, and then
808 tweak some special cases. */
809 copy_tree_r (tp
, walk_subtrees
, NULL
);
811 /* Global variables we haven't seen yet need to go into referenced
812 vars. If not referenced from types only. */
813 if (gimple_in_ssa_p (cfun
)
814 && TREE_CODE (*tp
) == VAR_DECL
815 && id
->remapping_type_depth
== 0)
816 add_referenced_var (*tp
);
818 /* We should never have TREE_BLOCK set on non-statements. */
820 gcc_assert (!TREE_BLOCK (*tp
));
822 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
823 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
825 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
827 /* The copied TARGET_EXPR has never been expanded, even if the
828 original node was expanded already. */
829 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
830 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
832 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
834 /* Variable substitution need not be simple. In particular,
835 the INDIRECT_REF substitution above. Make sure that
836 TREE_CONSTANT and friends are up-to-date. But make sure
837 to not improperly set TREE_BLOCK on some sub-expressions. */
838 int invariant
= is_gimple_min_invariant (*tp
);
839 tree block
= id
->block
;
840 id
->block
= NULL_TREE
;
841 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
844 /* Handle the case where we substituted an INDIRECT_REF
845 into the operand of the ADDR_EXPR. */
846 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
847 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
849 recompute_tree_invariant_for_addr_expr (*tp
);
851 /* If this used to be invariant, but is not any longer,
852 then regimplification is probably needed. */
853 if (invariant
&& !is_gimple_min_invariant (*tp
))
854 id
->regimplify
= true;
860 /* Keep iterating. */
865 /* Called from copy_body_id via walk_tree. DATA is really a
866 `copy_body_data *'. */
869 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
871 copy_body_data
*id
= (copy_body_data
*) data
;
872 tree fn
= id
->src_fn
;
875 /* Begin by recognizing trees that we'll completely rewrite for the
876 inlining context. Our output for these trees is completely
877 different from out input (e.g. RETURN_EXPR is deleted, and morphs
878 into an edge). Further down, we'll handle trees that get
879 duplicated and/or tweaked. */
881 /* When requested, RETURN_EXPRs should be transformed to just the
882 contained MODIFY_EXPR. The branch semantics of the return will
883 be handled elsewhere by manipulating the CFG rather than a statement. */
884 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
886 tree assignment
= TREE_OPERAND (*tp
, 0);
888 /* If we're returning something, just turn that into an
889 assignment into the equivalent of the original RESULT_DECL.
890 If the "assignment" is just the result decl, the result
891 decl has already been set (e.g. a recent "foo (&result_decl,
892 ...)"); just toss the entire RETURN_EXPR. */
893 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
895 /* Replace the RETURN_EXPR with (a copy of) the
896 MODIFY_EXPR hanging underneath. */
897 *tp
= copy_node (assignment
);
899 else /* Else the RETURN_EXPR returns no value. */
902 return (tree
) (void *)1;
905 else if (TREE_CODE (*tp
) == SSA_NAME
)
907 *tp
= remap_ssa_name (*tp
, id
);
912 /* Local variables and labels need to be replaced by equivalent
913 variables. We don't want to copy static variables; there's only
914 one of those, no matter how many times we inline the containing
915 function. Similarly for globals from an outer function. */
916 else if (auto_var_in_fn_p (*tp
, fn
))
920 /* Remap the declaration. */
921 new_decl
= remap_decl (*tp
, id
);
922 gcc_assert (new_decl
);
923 /* Replace this variable with the copy. */
924 STRIP_TYPE_NOPS (new_decl
);
928 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
929 copy_statement_list (tp
);
930 else if (TREE_CODE (*tp
) == SAVE_EXPR
931 || TREE_CODE (*tp
) == TARGET_EXPR
)
932 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
933 else if (TREE_CODE (*tp
) == LABEL_DECL
934 && (! DECL_CONTEXT (*tp
)
935 || decl_function_context (*tp
) == id
->src_fn
))
936 /* These may need to be remapped for EH handling. */
937 *tp
= remap_decl (*tp
, id
);
938 else if (TREE_CODE (*tp
) == BIND_EXPR
)
939 copy_bind_expr (tp
, walk_subtrees
, id
);
940 /* Types may need remapping as well. */
941 else if (TYPE_P (*tp
))
942 *tp
= remap_type (*tp
, id
);
944 /* If this is a constant, we have to copy the node iff the type will be
945 remapped. copy_tree_r will not copy a constant. */
946 else if (CONSTANT_CLASS_P (*tp
))
948 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
950 if (new_type
== TREE_TYPE (*tp
))
953 else if (TREE_CODE (*tp
) == INTEGER_CST
)
954 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
955 TREE_INT_CST_HIGH (*tp
));
958 *tp
= copy_node (*tp
);
959 TREE_TYPE (*tp
) = new_type
;
963 /* Otherwise, just copy the node. Note that copy_tree_r already
964 knows not to copy VAR_DECLs, etc., so this is safe. */
967 /* Here we handle trees that are not completely rewritten.
968 First we detect some inlining-induced bogosities for
970 if (TREE_CODE (*tp
) == MODIFY_EXPR
971 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
972 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
974 /* Some assignments VAR = VAR; don't generate any rtl code
975 and thus don't count as variable modification. Avoid
976 keeping bogosities like 0 = 0. */
977 tree decl
= TREE_OPERAND (*tp
, 0), value
;
980 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
984 STRIP_TYPE_NOPS (value
);
985 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
987 *tp
= build_empty_stmt (EXPR_LOCATION (*tp
));
988 return copy_tree_body_r (tp
, walk_subtrees
, data
);
992 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
994 /* Get rid of *& from inline substitutions that can happen when a
995 pointer argument is an ADDR_EXPR. */
996 tree decl
= TREE_OPERAND (*tp
, 0);
999 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1004 /* If we happen to get an ADDR_EXPR in n->value, strip
1005 it manually here as we'll eventually get ADDR_EXPRs
1006 which lie about their types pointed to. In this case
1007 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1008 but we absolutely rely on that. As fold_indirect_ref
1009 does other useful transformations, try that first, though. */
1010 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1011 if (id
->do_not_unshare
)
1014 new_tree
= unshare_expr (*n
);
1016 *tp
= gimple_fold_indirect_ref (new_tree
);
1019 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1021 *tp
= fold_indirect_ref_1 (EXPR_LOCATION (new_tree
),
1023 /* ??? We should either assert here or build
1024 a VIEW_CONVERT_EXPR instead of blindly leaking
1025 incompatible types to our IL. */
1027 *tp
= TREE_OPERAND (new_tree
, 0);
1031 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1032 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1033 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1041 /* Here is the "usual case". Copy this tree node, and then
1042 tweak some special cases. */
1043 copy_tree_r (tp
, walk_subtrees
, NULL
);
1045 /* Global variables we haven't seen yet needs to go into referenced
1046 vars. If not referenced from types only. */
1047 if (gimple_in_ssa_p (cfun
)
1048 && TREE_CODE (*tp
) == VAR_DECL
1049 && id
->remapping_type_depth
== 0)
1050 add_referenced_var (*tp
);
1052 /* If EXPR has block defined, map it to newly constructed block.
1053 When inlining we want EXPRs without block appear in the block
1054 of function call. */
1057 new_block
= id
->block
;
1058 if (TREE_BLOCK (*tp
))
1061 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1066 TREE_BLOCK (*tp
) = new_block
;
1069 if (TREE_CODE (*tp
) == RESX_EXPR
&& id
->eh_region_offset
)
1070 TREE_OPERAND (*tp
, 0) =
1071 build_int_cst (NULL_TREE
,
1072 id
->eh_region_offset
1073 + TREE_INT_CST_LOW (TREE_OPERAND (*tp
, 0)));
1075 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1076 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1078 /* The copied TARGET_EXPR has never been expanded, even if the
1079 original node was expanded already. */
1080 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1082 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1083 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1086 /* Variable substitution need not be simple. In particular, the
1087 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1088 and friends are up-to-date. */
1089 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1091 int invariant
= is_gimple_min_invariant (*tp
);
1092 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1094 /* Handle the case where we substituted an INDIRECT_REF
1095 into the operand of the ADDR_EXPR. */
1096 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1097 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1099 recompute_tree_invariant_for_addr_expr (*tp
);
1101 /* If this used to be invariant, but is not any longer,
1102 then regimplification is probably needed. */
1103 if (invariant
&& !is_gimple_min_invariant (*tp
))
1104 id
->regimplify
= true;
1110 /* Keep iterating. */
1115 /* Helper for copy_bb. Remap statement STMT using the inlining
1116 information in ID. Return the new statement copy. */
1119 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1122 struct walk_stmt_info wi
;
1124 bool skip_first
= false;
1126 /* Begin by recognizing trees that we'll completely rewrite for the
1127 inlining context. Our output for these trees is completely
1128 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1129 into an edge). Further down, we'll handle trees that get
1130 duplicated and/or tweaked. */
1132 /* When requested, GIMPLE_RETURNs should be transformed to just the
1133 contained GIMPLE_ASSIGN. The branch semantics of the return will
1134 be handled elsewhere by manipulating the CFG rather than the
1136 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1138 tree retval
= gimple_return_retval (stmt
);
1140 /* If we're returning something, just turn that into an
1141 assignment into the equivalent of the original RESULT_DECL.
1142 If RETVAL is just the result decl, the result decl has
1143 already been set (e.g. a recent "foo (&result_decl, ...)");
1144 just toss the entire GIMPLE_RETURN. */
1145 if (retval
&& TREE_CODE (retval
) != RESULT_DECL
)
1147 copy
= gimple_build_assign (id
->retvar
, retval
);
1148 /* id->retvar is already substituted. Skip it on later remapping. */
1152 return gimple_build_nop ();
1154 else if (gimple_has_substatements (stmt
))
1158 /* When cloning bodies from the C++ front end, we will be handed bodies
1159 in High GIMPLE form. Handle here all the High GIMPLE statements that
1160 have embedded statements. */
1161 switch (gimple_code (stmt
))
1164 copy
= copy_gimple_bind (stmt
, id
);
1168 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1169 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1172 case GIMPLE_EH_FILTER
:
1173 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1174 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1178 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1179 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1180 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1183 case GIMPLE_WITH_CLEANUP_EXPR
:
1184 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1185 copy
= gimple_build_wce (s1
);
1188 case GIMPLE_OMP_PARALLEL
:
1189 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1190 copy
= gimple_build_omp_parallel
1192 gimple_omp_parallel_clauses (stmt
),
1193 gimple_omp_parallel_child_fn (stmt
),
1194 gimple_omp_parallel_data_arg (stmt
));
1197 case GIMPLE_OMP_TASK
:
1198 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1199 copy
= gimple_build_omp_task
1201 gimple_omp_task_clauses (stmt
),
1202 gimple_omp_task_child_fn (stmt
),
1203 gimple_omp_task_data_arg (stmt
),
1204 gimple_omp_task_copy_fn (stmt
),
1205 gimple_omp_task_arg_size (stmt
),
1206 gimple_omp_task_arg_align (stmt
));
1209 case GIMPLE_OMP_FOR
:
1210 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1211 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1212 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1213 gimple_omp_for_collapse (stmt
), s2
);
1216 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1218 gimple_omp_for_set_index (copy
, i
,
1219 gimple_omp_for_index (stmt
, i
));
1220 gimple_omp_for_set_initial (copy
, i
,
1221 gimple_omp_for_initial (stmt
, i
));
1222 gimple_omp_for_set_final (copy
, i
,
1223 gimple_omp_for_final (stmt
, i
));
1224 gimple_omp_for_set_incr (copy
, i
,
1225 gimple_omp_for_incr (stmt
, i
));
1226 gimple_omp_for_set_cond (copy
, i
,
1227 gimple_omp_for_cond (stmt
, i
));
1232 case GIMPLE_OMP_MASTER
:
1233 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1234 copy
= gimple_build_omp_master (s1
);
1237 case GIMPLE_OMP_ORDERED
:
1238 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1239 copy
= gimple_build_omp_ordered (s1
);
1242 case GIMPLE_OMP_SECTION
:
1243 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1244 copy
= gimple_build_omp_section (s1
);
1247 case GIMPLE_OMP_SECTIONS
:
1248 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1249 copy
= gimple_build_omp_sections
1250 (s1
, gimple_omp_sections_clauses (stmt
));
1253 case GIMPLE_OMP_SINGLE
:
1254 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1255 copy
= gimple_build_omp_single
1256 (s1
, gimple_omp_single_clauses (stmt
));
1259 case GIMPLE_OMP_CRITICAL
:
1260 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1262 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1271 if (gimple_assign_copy_p (stmt
)
1272 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1273 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1275 /* Here we handle statements that are not completely rewritten.
1276 First we detect some inlining-induced bogosities for
1279 /* Some assignments VAR = VAR; don't generate any rtl code
1280 and thus don't count as variable modification. Avoid
1281 keeping bogosities like 0 = 0. */
1282 tree decl
= gimple_assign_lhs (stmt
), value
;
1285 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1289 STRIP_TYPE_NOPS (value
);
1290 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1291 return gimple_build_nop ();
1295 /* Create a new deep copy of the statement. */
1296 copy
= gimple_copy (stmt
);
1299 /* If STMT has a block defined, map it to the newly constructed
1300 block. When inlining we want statements without a block to
1301 appear in the block of the function call. */
1302 new_block
= id
->block
;
1303 if (gimple_block (copy
))
1306 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1311 gimple_set_block (copy
, new_block
);
1313 /* Remap all the operands in COPY. */
1314 memset (&wi
, 0, sizeof (wi
));
1317 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1319 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1321 /* Clear the copied virtual operands. We are not remapping them here
1322 but are going to recreate them from scratch. */
1323 if (gimple_has_mem_ops (copy
))
1325 gimple_set_vdef (copy
, NULL_TREE
);
1326 gimple_set_vuse (copy
, NULL_TREE
);
1329 /* We have to handle EH region remapping of GIMPLE_RESX specially because
1330 the region number is not an operand. */
1331 if (gimple_code (stmt
) == GIMPLE_RESX
&& id
->eh_region_offset
)
1333 gimple_resx_set_region (copy
, gimple_resx_region (stmt
) + id
->eh_region_offset
);
1339 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1343 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1344 gcov_type count_scale
)
1346 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1347 basic_block copy_basic_block
;
1350 /* create_basic_block() will append every new block to
1351 basic_block_info automatically. */
1352 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1353 (basic_block
) bb
->prev_bb
->aux
);
1354 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1356 /* We are going to rebuild frequencies from scratch. These values
1357 have just small importance to drive canonicalize_loop_headers. */
1358 copy_basic_block
->frequency
= ((gcov_type
)bb
->frequency
1359 * frequency_scale
/ REG_BR_PROB_BASE
);
1361 if (copy_basic_block
->frequency
> BB_FREQ_MAX
)
1362 copy_basic_block
->frequency
= BB_FREQ_MAX
;
1364 copy_gsi
= gsi_start_bb (copy_basic_block
);
1366 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1368 gimple stmt
= gsi_stmt (gsi
);
1369 gimple orig_stmt
= stmt
;
1371 id
->regimplify
= false;
1372 stmt
= remap_gimple_stmt (stmt
, id
);
1373 if (gimple_nop_p (stmt
))
1376 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1379 /* With return slot optimization we can end up with
1380 non-gimple (foo *)&this->m, fix that here. */
1381 if (is_gimple_assign (stmt
)
1382 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1383 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1386 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1387 gimple_assign_rhs1 (stmt
),
1388 true, NULL
, false, GSI_NEW_STMT
);
1389 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1390 id
->regimplify
= false;
1393 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1396 gimple_regimplify_operands (stmt
, &seq_gsi
);
1398 /* If copy_basic_block has been empty at the start of this iteration,
1399 call gsi_start_bb again to get at the newly added statements. */
1400 if (gsi_end_p (copy_gsi
))
1401 copy_gsi
= gsi_start_bb (copy_basic_block
);
1403 gsi_next (©_gsi
);
1405 /* Process the new statement. The call to gimple_regimplify_operands
1406 possibly turned the statement into multiple statements, we
1407 need to process all of them. */
1412 stmt
= gsi_stmt (copy_gsi
);
1413 if (is_gimple_call (stmt
)
1414 && gimple_call_va_arg_pack_p (stmt
)
1417 /* __builtin_va_arg_pack () should be replaced by
1418 all arguments corresponding to ... in the caller. */
1421 VEC(tree
, heap
) *argarray
;
1422 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1425 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= TREE_CHAIN (p
))
1428 /* Create the new array of arguments. */
1429 n
= nargs
+ gimple_call_num_args (stmt
);
1430 argarray
= VEC_alloc (tree
, heap
, n
);
1431 VEC_safe_grow (tree
, heap
, argarray
, n
);
1433 /* Copy all the arguments before '...' */
1434 memcpy (VEC_address (tree
, argarray
),
1435 gimple_call_arg_ptr (stmt
, 0),
1436 gimple_call_num_args (stmt
) * sizeof (tree
));
1438 /* Append the arguments passed in '...' */
1439 memcpy (VEC_address(tree
, argarray
) + gimple_call_num_args (stmt
),
1440 gimple_call_arg_ptr (id
->gimple_call
, 0)
1441 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1442 nargs
* sizeof (tree
));
1444 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1447 VEC_free (tree
, heap
, argarray
);
1449 /* Copy all GIMPLE_CALL flags, location and block, except
1450 GF_CALL_VA_ARG_PACK. */
1451 gimple_call_copy_flags (new_call
, stmt
);
1452 gimple_call_set_va_arg_pack (new_call
, false);
1453 gimple_set_location (new_call
, gimple_location (stmt
));
1454 gimple_set_block (new_call
, gimple_block (stmt
));
1455 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1457 gsi_replace (©_gsi
, new_call
, false);
1458 gimple_set_bb (stmt
, NULL
);
1461 else if (is_gimple_call (stmt
)
1463 && (decl
= gimple_call_fndecl (stmt
))
1464 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1465 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1467 /* __builtin_va_arg_pack_len () should be replaced by
1468 the number of anonymous arguments. */
1469 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1473 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= TREE_CHAIN (p
))
1476 count
= build_int_cst (integer_type_node
, nargs
);
1477 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1478 gsi_replace (©_gsi
, new_stmt
, false);
1482 /* Statements produced by inlining can be unfolded, especially
1483 when we constant propagated some operands. We can't fold
1484 them right now for two reasons:
1485 1) folding require SSA_NAME_DEF_STMTs to be correct
1486 2) we can't change function calls to builtins.
1487 So we just mark statement for later folding. We mark
1488 all new statements, instead just statements that has changed
1489 by some nontrivial substitution so even statements made
1490 foldable indirectly are updated. If this turns out to be
1491 expensive, copy_body can be told to watch for nontrivial
1493 if (id
->statements_to_fold
)
1494 pointer_set_insert (id
->statements_to_fold
, stmt
);
1496 /* We're duplicating a CALL_EXPR. Find any corresponding
1497 callgraph edges and update or duplicate them. */
1498 if (is_gimple_call (stmt
))
1500 struct cgraph_edge
*edge
;
1503 switch (id
->transform_call_graph_edges
)
1505 case CB_CGE_DUPLICATE
:
1506 edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1508 edge
= cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1509 REG_BR_PROB_BASE
, 1,
1510 edge
->frequency
, true);
1513 case CB_CGE_MOVE_CLONES
:
1514 cgraph_set_call_stmt_including_clones (id
->dst_node
,
1516 edge
= cgraph_edge (id
->dst_node
, stmt
);
1520 edge
= cgraph_edge (id
->dst_node
, orig_stmt
);
1522 cgraph_set_call_stmt (edge
, stmt
);
1529 /* Constant propagation on argument done during inlining
1530 may create new direct call. Produce an edge for it. */
1532 || (edge
->indirect_call
1533 && id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
))
1534 && is_gimple_call (stmt
)
1535 && (fn
= gimple_call_fndecl (stmt
)) != NULL
)
1537 struct cgraph_node
*dest
= cgraph_node (fn
);
1539 /* We have missing edge in the callgraph. This can happen
1540 when previous inlining turned an indirect call into a
1541 direct call by constant propagating arguments. In all
1542 other cases we hit a bug (incorrect node sharing is the
1543 most common reason for missing edges). */
1544 gcc_assert (dest
->needed
|| !dest
->analyzed
);
1545 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1546 cgraph_create_edge_including_clones
1547 (id
->dst_node
, dest
, stmt
, bb
->count
,
1548 compute_call_stmt_bb_frequency (id
->dst_node
->decl
, bb
),
1549 bb
->loop_depth
, CIF_ORIGINALLY_INDIRECT_CALL
);
1551 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1552 bb
->count
, CGRAPH_FREQ_BASE
,
1553 bb
->loop_depth
)->inline_failed
1554 = CIF_ORIGINALLY_INDIRECT_CALL
;
1557 fprintf (dump_file
, "Created new direct edge to %s",
1558 cgraph_node_name (dest
));
1562 flags
= gimple_call_flags (stmt
);
1563 if (flags
& ECF_MAY_BE_ALLOCA
)
1564 cfun
->calls_alloca
= true;
1565 if (flags
& ECF_RETURNS_TWICE
)
1566 cfun
->calls_setjmp
= true;
1569 /* If you think we can abort here, you are wrong.
1570 There is no region 0 in gimple. */
1571 gcc_assert (lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
) != 0);
1573 if (stmt_could_throw_p (stmt
)
1574 /* When we are cloning for inlining, we are supposed to
1575 construct a clone that calls precisely the same functions
1576 as original. However IPA optimizers might've proved
1577 earlier some function calls as non-trapping that might
1578 render some basic blocks dead that might become
1581 We can't update SSA with unreachable blocks in CFG and thus
1582 we prevent the scenario by preserving even the "dead" eh
1583 edges until the point they are later removed by
1585 || (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
1586 && lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
) > 0))
1588 int region
= lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
);
1590 /* Add an entry for the copied tree in the EH hashtable.
1591 When cloning or versioning, use the hashtable in
1592 cfun, and just copy the EH number. When inlining, use the
1593 hashtable in the caller, and adjust the region number. */
1595 add_stmt_to_eh_region (stmt
, region
+ id
->eh_region_offset
);
1597 /* If this tree doesn't have a region associated with it,
1598 and there is a "current region,"
1599 then associate this tree with the current region
1600 and add edges associated with this region. */
1601 if (lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
) <= 0
1602 && id
->eh_region
> 0
1603 && stmt_could_throw_p (stmt
))
1604 add_stmt_to_eh_region (stmt
, id
->eh_region
);
1607 if (gimple_in_ssa_p (cfun
))
1612 find_new_referenced_vars (gsi_stmt (copy_gsi
));
1613 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1614 if (TREE_CODE (def
) == SSA_NAME
)
1615 SSA_NAME_DEF_STMT (def
) = stmt
;
1618 gsi_next (©_gsi
);
1620 while (!gsi_end_p (copy_gsi
));
1622 copy_gsi
= gsi_last_bb (copy_basic_block
);
1625 return copy_basic_block
;
1628 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1629 form is quite easy, since dominator relationship for old basic blocks does
1632 There is however exception where inlining might change dominator relation
1633 across EH edges from basic block within inlined functions destinating
1634 to landing pads in function we inline into.
1636 The function fills in PHI_RESULTs of such PHI nodes if they refer
1637 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1638 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1639 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1640 set, and this means that there will be no overlapping live ranges
1641 for the underlying symbol.
1643 This might change in future if we allow redirecting of EH edges and
1644 we might want to change way build CFG pre-inlining to include
1645 all the possible edges then. */
1647 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1648 bool can_throw
, bool nonlocal_goto
)
1653 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1655 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1658 gimple_stmt_iterator si
;
1661 gcc_assert (e
->flags
& EDGE_EH
);
1664 gcc_assert (!(e
->flags
& EDGE_EH
));
1666 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1670 phi
= gsi_stmt (si
);
1672 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1673 gcc_assert (!e
->dest
->aux
);
1675 gcc_assert ((e
->flags
& EDGE_EH
)
1676 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1678 if (!is_gimple_reg (PHI_RESULT (phi
)))
1680 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi
)));
1684 re
= find_edge (ret_bb
, e
->dest
);
1686 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1687 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1689 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1690 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1696 /* Copy edges from BB into its copy constructed earlier, scale profile
1697 accordingly. Edges will be taken care of later. Assume aux
1698 pointers to point to the copies of each BB. */
1701 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1703 basic_block new_bb
= (basic_block
) bb
->aux
;
1706 gimple_stmt_iterator si
;
1709 /* Use the indices from the original blocks to create edges for the
1711 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1712 if (!(old_edge
->flags
& EDGE_EH
))
1716 flags
= old_edge
->flags
;
1718 /* Return edges do get a FALLTHRU flag when the get inlined. */
1719 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1720 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1721 flags
|= EDGE_FALLTHRU
;
1722 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1723 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1724 new_edge
->probability
= old_edge
->probability
;
1727 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1730 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1733 bool can_throw
, nonlocal_goto
;
1735 copy_stmt
= gsi_stmt (si
);
1736 update_stmt (copy_stmt
);
1737 if (gimple_in_ssa_p (cfun
))
1738 mark_symbols_for_renaming (copy_stmt
);
1740 /* Do this before the possible split_block. */
1743 /* If this tree could throw an exception, there are two
1744 cases where we need to add abnormal edge(s): the
1745 tree wasn't in a region and there is a "current
1746 region" in the caller; or the original tree had
1747 EH edges. In both cases split the block after the tree,
1748 and add abnormal edge(s) as needed; we need both
1749 those from the callee and the caller.
1750 We check whether the copy can throw, because the const
1751 propagation can change an INDIRECT_REF which throws
1752 into a COMPONENT_REF which doesn't. If the copy
1753 can throw, the original could also throw. */
1754 can_throw
= stmt_can_throw_internal (copy_stmt
);
1755 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1757 if (can_throw
|| nonlocal_goto
)
1759 if (!gsi_end_p (si
))
1760 /* Note that bb's predecessor edges aren't necessarily
1761 right at this point; split_block doesn't care. */
1763 edge e
= split_block (new_bb
, copy_stmt
);
1766 new_bb
->aux
= e
->src
->aux
;
1767 si
= gsi_start_bb (new_bb
);
1772 make_eh_edges (copy_stmt
);
1775 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1777 if ((can_throw
|| nonlocal_goto
)
1778 && gimple_in_ssa_p (cfun
))
1779 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1780 can_throw
, nonlocal_goto
);
1784 /* Copy the PHIs. All blocks and edges are copied, some blocks
1785 was possibly split and new outgoing EH edges inserted.
1786 BB points to the block of original function and AUX pointers links
1787 the original and newly copied blocks. */
1790 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1792 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1795 gimple_stmt_iterator si
;
1797 for (si
= gsi_start (phi_nodes (bb
)); !gsi_end_p (si
); gsi_next (&si
))
1803 phi
= gsi_stmt (si
);
1804 res
= PHI_RESULT (phi
);
1806 if (is_gimple_reg (res
))
1808 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
1809 SSA_NAME_DEF_STMT (new_res
)
1810 = new_phi
= create_phi_node (new_res
, new_bb
);
1811 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
1814 = find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
1815 tree arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
1817 tree block
= id
->block
;
1818 id
->block
= NULL_TREE
;
1819 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
1821 gcc_assert (new_arg
);
1822 /* With return slot optimization we can end up with
1823 non-gimple (foo *)&this->m, fix that here. */
1824 if (TREE_CODE (new_arg
) != SSA_NAME
1825 && TREE_CODE (new_arg
) != FUNCTION_DECL
1826 && !is_gimple_val (new_arg
))
1828 gimple_seq stmts
= NULL
;
1829 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
1830 gsi_insert_seq_on_edge_immediate (new_edge
, stmts
);
1832 add_phi_arg (new_phi
, new_arg
, new_edge
,
1833 gimple_phi_arg_location_from_edge (phi
, old_edge
));
1840 /* Wrapper for remap_decl so it can be used as a callback. */
1843 remap_decl_1 (tree decl
, void *data
)
1845 return remap_decl (decl
, (copy_body_data
*) data
);
1848 /* Build struct function and associated datastructures for the new clone
1849 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1852 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
,
1855 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
1856 gcov_type count_scale
, frequency_scale
;
1858 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
1859 count_scale
= (REG_BR_PROB_BASE
* count
1860 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
1864 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
)
1865 frequency_scale
= (REG_BR_PROB_BASE
* frequency
1867 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
);
1869 frequency_scale
= count_scale
;
1871 /* Register specific tree functions. */
1872 gimple_register_cfg_hooks ();
1874 /* Get clean struct function. */
1875 push_struct_function (new_fndecl
);
1877 /* We will rebuild these, so just sanity check that they are empty. */
1878 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
1879 gcc_assert (cfun
->local_decls
== NULL
);
1880 gcc_assert (cfun
->cfg
== NULL
);
1881 gcc_assert (cfun
->decl
== new_fndecl
);
1883 /* Copy items we preserve during clonning. */
1884 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
1885 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
1886 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
1887 cfun
->curr_properties
= src_cfun
->curr_properties
;
1888 cfun
->last_verified
= src_cfun
->last_verified
;
1889 if (src_cfun
->ipa_transforms_to_apply
)
1890 cfun
->ipa_transforms_to_apply
= VEC_copy (ipa_opt_pass
, heap
,
1891 src_cfun
->ipa_transforms_to_apply
);
1892 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
1893 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
1894 cfun
->function_frequency
= src_cfun
->function_frequency
;
1895 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
1896 cfun
->stdarg
= src_cfun
->stdarg
;
1897 cfun
->dont_save_pending_sizes_p
= src_cfun
->dont_save_pending_sizes_p
;
1898 cfun
->after_inlining
= src_cfun
->after_inlining
;
1899 cfun
->returns_struct
= src_cfun
->returns_struct
;
1900 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
1901 cfun
->after_tree_profile
= src_cfun
->after_tree_profile
;
1903 init_empty_tree_cfg ();
1905 ENTRY_BLOCK_PTR
->count
=
1906 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
1908 ENTRY_BLOCK_PTR
->frequency
=
1909 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
*
1910 frequency_scale
/ REG_BR_PROB_BASE
);
1911 EXIT_BLOCK_PTR
->count
=
1912 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
1914 EXIT_BLOCK_PTR
->frequency
=
1915 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
*
1916 frequency_scale
/ REG_BR_PROB_BASE
);
1918 init_eh_for_function ();
1920 if (src_cfun
->gimple_df
)
1922 init_tree_ssa (cfun
);
1923 cfun
->gimple_df
->in_ssa_p
= true;
1924 init_ssa_operands ();
1929 /* Make a copy of the body of FN so that it can be inserted inline in
1930 another function. Walks FN via CFG, returns new fndecl. */
1933 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency
,
1934 basic_block entry_block_map
, basic_block exit_block_map
)
1936 tree callee_fndecl
= id
->src_fn
;
1937 /* Original cfun for the callee, doesn't change. */
1938 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
1939 struct function
*cfun_to_copy
;
1941 tree new_fndecl
= NULL
;
1942 gcov_type count_scale
, frequency_scale
;
1945 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
1946 count_scale
= (REG_BR_PROB_BASE
* count
1947 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
1951 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
)
1952 frequency_scale
= (REG_BR_PROB_BASE
* frequency
1954 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
);
1956 frequency_scale
= count_scale
;
1958 /* Register specific tree functions. */
1959 gimple_register_cfg_hooks ();
1961 /* Must have a CFG here at this point. */
1962 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1963 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
1965 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
1967 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
1968 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
1969 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
1970 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
1972 /* Duplicate any exception-handling regions. */
1975 id
->eh_region_offset
1976 = duplicate_eh_regions (cfun_to_copy
, remap_decl_1
, id
,
1980 /* Use aux pointers to map the original blocks to copy. */
1981 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
1983 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
1988 last
= last_basic_block
;
1990 /* Now that we've duplicated the blocks, duplicate their edges. */
1991 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
1992 copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
1994 if (gimple_in_ssa_p (cfun
))
1995 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
1996 copy_phis_for_bb (bb
, id
);
1998 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
2000 ((basic_block
)bb
->aux
)->aux
= NULL
;
2004 /* Zero out AUX fields of newly created block during EH edge
2006 for (; last
< last_basic_block
; last
++)
2007 BASIC_BLOCK (last
)->aux
= NULL
;
2008 entry_block_map
->aux
= NULL
;
2009 exit_block_map
->aux
= NULL
;
2014 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2015 another function. */
2018 copy_tree_body (copy_body_data
*id
)
2020 tree fndecl
= id
->src_fn
;
2021 tree body
= DECL_SAVED_TREE (fndecl
);
2023 walk_tree (&body
, copy_tree_body_r
, id
, NULL
);
2029 copy_body (copy_body_data
*id
, gcov_type count
, int frequency
,
2030 basic_block entry_block_map
, basic_block exit_block_map
)
2032 tree fndecl
= id
->src_fn
;
2035 /* If this body has a CFG, walk CFG and copy. */
2036 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2037 body
= copy_cfg_body (id
, count
, frequency
, entry_block_map
, exit_block_map
);
2042 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2043 defined in function FN, or of a data member thereof. */
2046 self_inlining_addr_expr (tree value
, tree fn
)
2050 if (TREE_CODE (value
) != ADDR_EXPR
)
2053 var
= get_base_address (TREE_OPERAND (value
, 0));
2055 return var
&& auto_var_in_fn_p (var
, fn
);
2059 insert_init_stmt (basic_block bb
, gimple init_stmt
)
2061 /* If VAR represents a zero-sized variable, it's possible that the
2062 assignment statement may result in no gimple statements. */
2065 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2067 /* We can end up with init statements that store to a non-register
2068 from a rhs with a conversion. Handle that here by forcing the
2069 rhs into a temporary. gimple_regimplify_operands is not
2070 prepared to do this for us. */
2071 if (!is_gimple_reg (gimple_assign_lhs (init_stmt
))
2072 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2073 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2075 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2076 gimple_expr_type (init_stmt
),
2077 gimple_assign_rhs1 (init_stmt
));
2078 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2080 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2081 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2083 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2084 gimple_regimplify_operands (init_stmt
, &si
);
2085 mark_symbols_for_renaming (init_stmt
);
2089 /* Initialize parameter P with VALUE. If needed, produce init statement
2090 at the end of BB. When BB is NULL, we return init statement to be
2093 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2094 basic_block bb
, tree
*vars
)
2096 gimple init_stmt
= NULL
;
2099 tree def
= (gimple_in_ssa_p (cfun
)
2100 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2103 && value
!= error_mark_node
2104 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2106 if (fold_convertible_p (TREE_TYPE (p
), value
))
2107 rhs
= fold_build1 (NOP_EXPR
, TREE_TYPE (p
), value
);
2109 /* ??? For valid (GIMPLE) programs we should not end up here.
2110 Still if something has gone wrong and we end up with truly
2111 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2112 to not leak invalid GIMPLE to the following passes. */
2113 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2116 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2117 we may not need to create a new variable here at all. Instead, we may
2118 be able to just use the argument value. */
2119 if (TREE_READONLY (p
)
2120 && !TREE_ADDRESSABLE (p
)
2121 && value
&& !TREE_SIDE_EFFECTS (value
)
2124 /* We may produce non-gimple trees by adding NOPs or introduce
2125 invalid sharing when operand is not really constant.
2126 It is not big deal to prohibit constant propagation here as
2127 we will constant propagate in DOM1 pass anyway. */
2128 if (is_gimple_min_invariant (value
)
2129 && useless_type_conversion_p (TREE_TYPE (p
),
2131 /* We have to be very careful about ADDR_EXPR. Make sure
2132 the base variable isn't a local variable of the inlined
2133 function, e.g., when doing recursive inlining, direct or
2134 mutually-recursive or whatever, which is why we don't
2135 just test whether fn == current_function_decl. */
2136 && ! self_inlining_addr_expr (value
, fn
))
2138 insert_decl_map (id
, p
, value
);
2143 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2144 here since the type of this decl must be visible to the calling
2146 var
= copy_decl_to_var (p
, id
);
2147 if (gimple_in_ssa_p (cfun
) && TREE_CODE (var
) == VAR_DECL
)
2150 add_referenced_var (var
);
2153 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2154 that way, when the PARM_DECL is encountered, it will be
2155 automatically replaced by the VAR_DECL. */
2156 insert_decl_map (id
, p
, var
);
2158 /* Declare this new variable. */
2159 TREE_CHAIN (var
) = *vars
;
2162 /* Make gimplifier happy about this variable. */
2163 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2165 /* Even if P was TREE_READONLY, the new VAR should not be.
2166 In the original code, we would have constructed a
2167 temporary, and then the function body would have never
2168 changed the value of P. However, now, we will be
2169 constructing VAR directly. The constructor body may
2170 change its value multiple times as it is being
2171 constructed. Therefore, it must not be TREE_READONLY;
2172 the back-end assumes that TREE_READONLY variable is
2173 assigned to only once. */
2174 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2175 TREE_READONLY (var
) = 0;
2177 /* If there is no setup required and we are in SSA, take the easy route
2178 replacing all SSA names representing the function parameter by the
2179 SSA name passed to function.
2181 We need to construct map for the variable anyway as it might be used
2182 in different SSA names when parameter is set in function.
2184 Do replacement at -O0 for const arguments replaced by constant.
2185 This is important for builtin_constant_p and other construct requiring
2186 constant argument to be visible in inlined function body.
2188 FIXME: This usually kills the last connection in between inlined
2189 function parameter and the actual value in debug info. Can we do
2190 better here? If we just inserted the statement, copy propagation
2191 would kill it anyway as it always did in older versions of GCC.
2193 We might want to introduce a notion that single SSA_NAME might
2194 represent multiple variables for purposes of debugging. */
2195 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2197 || (TREE_READONLY (p
)
2198 && is_gimple_min_invariant (rhs
)))
2199 && (TREE_CODE (rhs
) == SSA_NAME
2200 || is_gimple_min_invariant (rhs
))
2201 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2203 insert_decl_map (id
, def
, rhs
);
2207 /* If the value of argument is never used, don't care about initializing
2209 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2211 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2215 /* Initialize this VAR_DECL from the equivalent argument. Convert
2216 the argument to the proper type in case it was promoted. */
2219 if (rhs
== error_mark_node
)
2221 insert_decl_map (id
, p
, var
);
2225 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2227 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2228 keep our trees in gimple form. */
2229 if (def
&& gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2231 def
= remap_ssa_name (def
, id
);
2232 init_stmt
= gimple_build_assign (def
, rhs
);
2233 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2234 set_default_def (var
, NULL
);
2237 init_stmt
= gimple_build_assign (var
, rhs
);
2239 if (bb
&& init_stmt
)
2240 insert_init_stmt (bb
, init_stmt
);
2245 /* Generate code to initialize the parameters of the function at the
2246 top of the stack in ID from the GIMPLE_CALL STMT. */
2249 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2250 tree fn
, basic_block bb
)
2255 tree vars
= NULL_TREE
;
2256 tree static_chain
= gimple_call_chain (stmt
);
2258 /* Figure out what the parameters are. */
2259 parms
= DECL_ARGUMENTS (fn
);
2261 /* Loop through the parameter declarations, replacing each with an
2262 equivalent VAR_DECL, appropriately initialized. */
2263 for (p
= parms
, i
= 0; p
; p
= TREE_CHAIN (p
), i
++)
2266 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2267 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2270 /* Initialize the static chain. */
2271 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2272 gcc_assert (fn
!= current_function_decl
);
2275 /* No static chain? Seems like a bug in tree-nested.c. */
2276 gcc_assert (static_chain
);
2278 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2281 declare_inline_vars (id
->block
, vars
);
2285 /* Declare a return variable to replace the RESULT_DECL for the
2286 function we are calling. An appropriate DECL_STMT is returned.
2287 The USE_STMT is filled to contain a use of the declaration to
2288 indicate the return value of the function.
2290 RETURN_SLOT, if non-null is place where to store the result. It
2291 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2292 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2294 The return value is a (possibly null) value that is the result of the
2295 function as seen by the callee. *USE_P is a (possibly null) value that
2296 holds the result as seen by the caller. */
2299 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2302 tree callee
= id
->src_fn
;
2303 tree caller
= id
->dst_fn
;
2304 tree result
= DECL_RESULT (callee
);
2305 tree callee_type
= TREE_TYPE (result
);
2306 tree caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2309 /* We don't need to do anything for functions that don't return
2311 if (!result
|| VOID_TYPE_P (callee_type
))
2317 /* If there was a return slot, then the return value is the
2318 dereferenced address of that object. */
2321 /* The front end shouldn't have used both return_slot and
2322 a modify expression. */
2323 gcc_assert (!modify_dest
);
2324 if (DECL_BY_REFERENCE (result
))
2326 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2327 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2329 /* We are going to construct *&return_slot and we can't do that
2330 for variables believed to be not addressable.
2332 FIXME: This check possibly can match, because values returned
2333 via return slot optimization are not believed to have address
2334 taken by alias analysis. */
2335 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2336 if (gimple_in_ssa_p (cfun
))
2338 HOST_WIDE_INT bitsize
;
2339 HOST_WIDE_INT bitpos
;
2341 enum machine_mode mode
;
2345 base
= get_inner_reference (return_slot
, &bitsize
, &bitpos
,
2347 &mode
, &unsignedp
, &volatilep
,
2349 if (TREE_CODE (base
) == INDIRECT_REF
)
2350 base
= TREE_OPERAND (base
, 0);
2351 if (TREE_CODE (base
) == SSA_NAME
)
2352 base
= SSA_NAME_VAR (base
);
2353 mark_sym_for_renaming (base
);
2355 var
= return_slot_addr
;
2360 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2361 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2363 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2364 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2365 && !DECL_GIMPLE_REG_P (result
)
2367 DECL_GIMPLE_REG_P (var
) = 0;
2372 /* All types requiring non-trivial constructors should have been handled. */
2373 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2375 /* Attempt to avoid creating a new temporary variable. */
2377 && TREE_CODE (modify_dest
) != SSA_NAME
)
2379 bool use_it
= false;
2381 /* We can't use MODIFY_DEST if there's type promotion involved. */
2382 if (!useless_type_conversion_p (callee_type
, caller_type
))
2385 /* ??? If we're assigning to a variable sized type, then we must
2386 reuse the destination variable, because we've no good way to
2387 create variable sized temporaries at this point. */
2388 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2391 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2392 reuse it as the result of the call directly. Don't do this if
2393 it would promote MODIFY_DEST to addressable. */
2394 else if (TREE_ADDRESSABLE (result
))
2398 tree base_m
= get_base_address (modify_dest
);
2400 /* If the base isn't a decl, then it's a pointer, and we don't
2401 know where that's going to go. */
2402 if (!DECL_P (base_m
))
2404 else if (is_global_var (base_m
))
2406 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2407 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2408 && !DECL_GIMPLE_REG_P (result
)
2409 && DECL_GIMPLE_REG_P (base_m
))
2411 else if (!TREE_ADDRESSABLE (base_m
))
2423 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2425 var
= copy_result_decl_to_var (result
, id
);
2426 if (gimple_in_ssa_p (cfun
))
2429 add_referenced_var (var
);
2432 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2433 DECL_STRUCT_FUNCTION (caller
)->local_decls
2434 = tree_cons (NULL_TREE
, var
,
2435 DECL_STRUCT_FUNCTION (caller
)->local_decls
);
2437 /* Do not have the rest of GCC warn about this variable as it should
2438 not be visible to the user. */
2439 TREE_NO_WARNING (var
) = 1;
2441 declare_inline_vars (id
->block
, var
);
2443 /* Build the use expr. If the return type of the function was
2444 promoted, convert it back to the expected type. */
2446 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2447 use
= fold_convert (caller_type
, var
);
2449 STRIP_USELESS_TYPE_CONVERSION (use
);
2451 if (DECL_BY_REFERENCE (result
))
2453 TREE_ADDRESSABLE (var
) = 1;
2454 var
= build_fold_addr_expr (var
);
2458 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2459 way, when the RESULT_DECL is encountered, it will be
2460 automatically replaced by the VAR_DECL. */
2461 insert_decl_map (id
, result
, var
);
2463 /* Remember this so we can ignore it in remap_decls. */
2470 /* Callback through walk_tree. Determine if a DECL_INITIAL makes reference
2471 to a local label. */
2474 has_label_address_in_static_1 (tree
*nodep
, int *walk_subtrees
, void *fnp
)
2477 tree fn
= (tree
) fnp
;
2479 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
2488 /* Callback through walk_tree. Determine if we've got an aggregate
2489 type that we can't support; return non-null if so. */
2492 cannot_copy_type_1 (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2493 void *data ATTRIBUTE_UNUSED
)
2495 tree t
, node
= *nodep
;
2497 if (TREE_CODE (node
) == RECORD_TYPE
|| TREE_CODE (node
) == UNION_TYPE
)
2499 /* We cannot inline a function of the form
2501 void F (int i) { struct S { int ar[i]; } s; }
2503 Attempting to do so produces a catch-22.
2504 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
2505 UNION_TYPE nodes, then it goes into infinite recursion on a
2506 structure containing a pointer to its own type. If it doesn't,
2507 then the type node for S doesn't get adjusted properly when
2510 ??? This is likely no longer true, but it's too late in the 4.0
2511 cycle to try to find out. This should be checked for 4.1. */
2512 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
2513 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
2521 /* Determine if the function can be copied. If so return NULL. If
2522 not return a string describng the reason for failure. */
2525 copy_forbidden (struct function
*fun
, tree fndecl
)
2527 const char *reason
= fun
->cannot_be_copied_reason
;
2530 /* Only examine the function once. */
2531 if (fun
->cannot_be_copied_set
)
2534 /* We cannot copy a function that receives a non-local goto
2535 because we cannot remap the destination label used in the
2536 function that is performing the non-local goto. */
2537 /* ??? Actually, this should be possible, if we work at it.
2538 No doubt there's just a handful of places that simply
2539 assume it doesn't happen and don't substitute properly. */
2540 if (fun
->has_nonlocal_label
)
2542 reason
= G_("function %q+F can never be copied "
2543 "because it receives a non-local goto");
2547 for (step
= fun
->local_decls
; step
; step
= TREE_CHAIN (step
))
2549 tree decl
= TREE_VALUE (step
);
2551 if (TREE_CODE (decl
) == VAR_DECL
2552 && TREE_STATIC (decl
)
2553 && !DECL_EXTERNAL (decl
)
2554 && DECL_INITIAL (decl
)
2555 && walk_tree_without_duplicates (&DECL_INITIAL (decl
),
2556 has_label_address_in_static_1
,
2559 reason
= G_("function %q+F can never be copied because it saves "
2560 "address of local label in a static variable");
2564 if (!TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
2565 && variably_modified_type_p (TREE_TYPE (decl
), NULL
)
2566 && walk_tree_without_duplicates (&TREE_TYPE (decl
),
2567 cannot_copy_type_1
, NULL
))
2569 reason
= G_("function %q+F can never be copied "
2570 "because it uses variable sized variables");
2576 fun
->cannot_be_copied_reason
= reason
;
2577 fun
->cannot_be_copied_set
= true;
2582 static const char *inline_forbidden_reason
;
2584 /* A callback for walk_gimple_seq to handle statements. Returns non-null
2585 iff a function can not be inlined. Also sets the reason why. */
2588 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
2589 struct walk_stmt_info
*wip
)
2591 tree fn
= (tree
) wip
->info
;
2593 gimple stmt
= gsi_stmt (*gsi
);
2595 switch (gimple_code (stmt
))
2598 /* Refuse to inline alloca call unless user explicitly forced so as
2599 this may change program's memory overhead drastically when the
2600 function using alloca is called in loop. In GCC present in
2601 SPEC2000 inlining into schedule_block cause it to require 2GB of
2602 RAM instead of 256MB. */
2603 if (gimple_alloca_call_p (stmt
)
2604 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
2606 inline_forbidden_reason
2607 = G_("function %q+F can never be inlined because it uses "
2608 "alloca (override using the always_inline attribute)");
2609 *handled_ops_p
= true;
2613 t
= gimple_call_fndecl (stmt
);
2617 /* We cannot inline functions that call setjmp. */
2618 if (setjmp_call_p (t
))
2620 inline_forbidden_reason
2621 = G_("function %q+F can never be inlined because it uses setjmp");
2622 *handled_ops_p
= true;
2626 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
2627 switch (DECL_FUNCTION_CODE (t
))
2629 /* We cannot inline functions that take a variable number of
2631 case BUILT_IN_VA_START
:
2632 case BUILT_IN_NEXT_ARG
:
2633 case BUILT_IN_VA_END
:
2634 inline_forbidden_reason
2635 = G_("function %q+F can never be inlined because it "
2636 "uses variable argument lists");
2637 *handled_ops_p
= true;
2640 case BUILT_IN_LONGJMP
:
2641 /* We can't inline functions that call __builtin_longjmp at
2642 all. The non-local goto machinery really requires the
2643 destination be in a different function. If we allow the
2644 function calling __builtin_longjmp to be inlined into the
2645 function calling __builtin_setjmp, Things will Go Awry. */
2646 inline_forbidden_reason
2647 = G_("function %q+F can never be inlined because "
2648 "it uses setjmp-longjmp exception handling");
2649 *handled_ops_p
= true;
2652 case BUILT_IN_NONLOCAL_GOTO
:
2654 inline_forbidden_reason
2655 = G_("function %q+F can never be inlined because "
2656 "it uses non-local goto");
2657 *handled_ops_p
= true;
2660 case BUILT_IN_RETURN
:
2661 case BUILT_IN_APPLY_ARGS
:
2662 /* If a __builtin_apply_args caller would be inlined,
2663 it would be saving arguments of the function it has
2664 been inlined into. Similarly __builtin_return would
2665 return from the function the inline has been inlined into. */
2666 inline_forbidden_reason
2667 = G_("function %q+F can never be inlined because "
2668 "it uses __builtin_return or __builtin_apply_args");
2669 *handled_ops_p
= true;
2678 t
= gimple_goto_dest (stmt
);
2680 /* We will not inline a function which uses computed goto. The
2681 addresses of its local labels, which may be tucked into
2682 global storage, are of course not constant across
2683 instantiations, which causes unexpected behavior. */
2684 if (TREE_CODE (t
) != LABEL_DECL
)
2686 inline_forbidden_reason
2687 = G_("function %q+F can never be inlined "
2688 "because it contains a computed goto");
2689 *handled_ops_p
= true;
2698 *handled_ops_p
= false;
2702 /* Return true if FNDECL is a function that cannot be inlined into
2706 inline_forbidden_p (tree fndecl
)
2708 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
2709 struct walk_stmt_info wi
;
2710 struct pointer_set_t
*visited_nodes
;
2712 bool forbidden_p
= false;
2714 /* First check for shared reasons not to copy the code. */
2715 inline_forbidden_reason
= copy_forbidden (fun
, fndecl
);
2716 if (inline_forbidden_reason
!= NULL
)
2719 /* Next, walk the statements of the function looking for
2720 constraucts we can't handle, or are non-optimal for inlining. */
2721 visited_nodes
= pointer_set_create ();
2722 memset (&wi
, 0, sizeof (wi
));
2723 wi
.info
= (void *) fndecl
;
2724 wi
.pset
= visited_nodes
;
2726 FOR_EACH_BB_FN (bb
, fun
)
2729 gimple_seq seq
= bb_seq (bb
);
2730 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
, NULL
, &wi
);
2731 forbidden_p
= (ret
!= NULL
);
2736 pointer_set_destroy (visited_nodes
);
2740 /* Returns nonzero if FN is a function that does not have any
2741 fundamental inline blocking properties. */
2744 tree_inlinable_function_p (tree fn
)
2746 bool inlinable
= true;
2750 /* If we've already decided this function shouldn't be inlined,
2751 there's no need to check again. */
2752 if (DECL_UNINLINABLE (fn
))
2755 /* We only warn for functions declared `inline' by the user. */
2756 do_warning
= (warn_inline
2757 && DECL_DECLARED_INLINE_P (fn
)
2758 && !DECL_NO_INLINE_WARNING_P (fn
)
2759 && !DECL_IN_SYSTEM_HEADER (fn
));
2761 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
2764 && always_inline
== NULL
)
2767 warning (OPT_Winline
, "function %q+F can never be inlined because it "
2768 "is suppressed using -fno-inline", fn
);
2772 /* Don't auto-inline anything that might not be bound within
2773 this unit of translation. */
2774 else if (!DECL_DECLARED_INLINE_P (fn
)
2775 && DECL_REPLACEABLE_P (fn
))
2778 else if (!function_attribute_inlinable_p (fn
))
2781 warning (OPT_Winline
, "function %q+F can never be inlined because it "
2782 "uses attributes conflicting with inlining", fn
);
2786 else if (inline_forbidden_p (fn
))
2788 /* See if we should warn about uninlinable functions. Previously,
2789 some of these warnings would be issued while trying to expand
2790 the function inline, but that would cause multiple warnings
2791 about functions that would for example call alloca. But since
2792 this a property of the function, just one warning is enough.
2793 As a bonus we can now give more details about the reason why a
2794 function is not inlinable. */
2796 sorry (inline_forbidden_reason
, fn
);
2797 else if (do_warning
)
2798 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
2803 /* Squirrel away the result so that we don't have to check again. */
2804 DECL_UNINLINABLE (fn
) = !inlinable
;
2809 /* Estimate the cost of a memory move. Use machine dependent
2810 word size and take possible memcpy call into account. */
2813 estimate_move_cost (tree type
)
2817 gcc_assert (!VOID_TYPE_P (type
));
2819 size
= int_size_in_bytes (type
);
2821 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
2822 /* Cost of a memcpy call, 3 arguments and the call. */
2825 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
2828 /* Returns cost of operation CODE, according to WEIGHTS */
2831 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
2832 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
2836 /* These are "free" conversions, or their presumed cost
2837 is folded into other operations. */
2844 /* Assign cost of 1 to usual operations.
2845 ??? We may consider mapping RTL costs to this. */
2850 case POINTER_PLUS_EXPR
:
2854 case FIXED_CONVERT_EXPR
:
2855 case FIX_TRUNC_EXPR
:
2867 case VEC_LSHIFT_EXPR
:
2868 case VEC_RSHIFT_EXPR
:
2875 case TRUTH_ANDIF_EXPR
:
2876 case TRUTH_ORIF_EXPR
:
2877 case TRUTH_AND_EXPR
:
2879 case TRUTH_XOR_EXPR
:
2880 case TRUTH_NOT_EXPR
:
2889 case UNORDERED_EXPR
:
2900 case PREDECREMENT_EXPR
:
2901 case PREINCREMENT_EXPR
:
2902 case POSTDECREMENT_EXPR
:
2903 case POSTINCREMENT_EXPR
:
2905 case REALIGN_LOAD_EXPR
:
2907 case REDUC_MAX_EXPR
:
2908 case REDUC_MIN_EXPR
:
2909 case REDUC_PLUS_EXPR
:
2910 case WIDEN_SUM_EXPR
:
2911 case WIDEN_MULT_EXPR
:
2914 case VEC_WIDEN_MULT_HI_EXPR
:
2915 case VEC_WIDEN_MULT_LO_EXPR
:
2916 case VEC_UNPACK_HI_EXPR
:
2917 case VEC_UNPACK_LO_EXPR
:
2918 case VEC_UNPACK_FLOAT_HI_EXPR
:
2919 case VEC_UNPACK_FLOAT_LO_EXPR
:
2920 case VEC_PACK_TRUNC_EXPR
:
2921 case VEC_PACK_SAT_EXPR
:
2922 case VEC_PACK_FIX_TRUNC_EXPR
:
2923 case VEC_EXTRACT_EVEN_EXPR
:
2924 case VEC_EXTRACT_ODD_EXPR
:
2925 case VEC_INTERLEAVE_HIGH_EXPR
:
2926 case VEC_INTERLEAVE_LOW_EXPR
:
2930 /* Few special cases of expensive operations. This is useful
2931 to avoid inlining on functions having too many of these. */
2932 case TRUNC_DIV_EXPR
:
2934 case FLOOR_DIV_EXPR
:
2935 case ROUND_DIV_EXPR
:
2936 case EXACT_DIV_EXPR
:
2937 case TRUNC_MOD_EXPR
:
2939 case FLOOR_MOD_EXPR
:
2940 case ROUND_MOD_EXPR
:
2942 if (TREE_CODE (op2
) != INTEGER_CST
)
2943 return weights
->div_mod_cost
;
2947 /* We expect a copy assignment with no operator. */
2948 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
2954 /* Estimate number of instructions that will be created by expanding
2955 the statements in the statement sequence STMTS.
2956 WEIGHTS contains weights attributed to various constructs. */
2959 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
2962 gimple_stmt_iterator gsi
;
2965 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
2966 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
2972 /* Estimate number of instructions that will be created by expanding STMT.
2973 WEIGHTS contains weights attributed to various constructs. */
2976 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
2979 enum gimple_code code
= gimple_code (stmt
);
2986 /* Try to estimate the cost of assignments. We have three cases to
2988 1) Simple assignments to registers;
2989 2) Stores to things that must live in memory. This includes
2990 "normal" stores to scalars, but also assignments of large
2991 structures, or constructors of big arrays;
2993 Let us look at the first two cases, assuming we have "a = b + C":
2994 <GIMPLE_ASSIGN <var_decl "a">
2995 <plus_expr <var_decl "b"> <constant C>>
2996 If "a" is a GIMPLE register, the assignment to it is free on almost
2997 any target, because "a" usually ends up in a real register. Hence
2998 the only cost of this expression comes from the PLUS_EXPR, and we
2999 can ignore the GIMPLE_ASSIGN.
3000 If "a" is not a GIMPLE register, the assignment to "a" will most
3001 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
3002 of moving something into "a", which we compute using the function
3003 estimate_move_cost. */
3004 lhs
= gimple_assign_lhs (stmt
);
3005 rhs
= gimple_assign_rhs1 (stmt
);
3007 /* EH magic stuff is most probably going to be optimized out.
3008 We rarely really need to save EH info for unwinding
3009 nested exceptions. */
3010 if (TREE_CODE (lhs
) == FILTER_EXPR
3011 || TREE_CODE (lhs
) == EXC_PTR_EXPR
3012 || TREE_CODE (rhs
) == FILTER_EXPR
3013 || TREE_CODE (rhs
) == EXC_PTR_EXPR
)
3015 if (is_gimple_reg (lhs
))
3018 cost
= estimate_move_cost (TREE_TYPE (lhs
));
3020 if (!is_gimple_reg (rhs
) && !is_gimple_min_invariant (rhs
))
3021 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
3023 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
3024 gimple_assign_rhs1 (stmt
),
3025 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
3026 == GIMPLE_BINARY_RHS
3027 ? gimple_assign_rhs2 (stmt
) : NULL
);
3031 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
3032 gimple_op (stmt
, 0),
3033 gimple_op (stmt
, 1));
3037 /* Take into account cost of the switch + guess 2 conditional jumps for
3040 TODO: once the switch expansion logic is sufficiently separated, we can
3041 do better job on estimating cost of the switch. */
3042 if (weights
->time_based
)
3043 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3045 cost
= gimple_switch_num_labels (stmt
) * 2;
3050 tree decl
= gimple_call_fndecl (stmt
);
3051 tree addr
= gimple_call_fn (stmt
);
3052 tree funtype
= TREE_TYPE (addr
);
3054 if (POINTER_TYPE_P (funtype
))
3055 funtype
= TREE_TYPE (funtype
);
3057 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_MD
)
3058 cost
= weights
->target_builtin_call_cost
;
3060 cost
= weights
->call_cost
;
3062 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3063 switch (DECL_FUNCTION_CODE (decl
))
3065 case BUILT_IN_CONSTANT_P
:
3067 case BUILT_IN_EXPECT
:
3070 /* Prefetch instruction is not expensive. */
3071 case BUILT_IN_PREFETCH
:
3072 cost
= weights
->target_builtin_call_cost
;
3080 funtype
= TREE_TYPE (decl
);
3082 if (!VOID_TYPE_P (TREE_TYPE (funtype
)))
3083 cost
+= estimate_move_cost (TREE_TYPE (funtype
));
3084 /* Our cost must be kept in sync with
3085 cgraph_estimate_size_after_inlining that does use function
3086 declaration to figure out the arguments. */
3087 if (decl
&& DECL_ARGUMENTS (decl
))
3090 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
3091 if (!VOID_TYPE_P (TREE_TYPE (arg
)))
3092 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3094 else if (funtype
&& prototype_p (funtype
))
3097 for (t
= TYPE_ARG_TYPES (funtype
); t
&& t
!= void_list_node
;
3099 if (!VOID_TYPE_P (TREE_VALUE (t
)))
3100 cost
+= estimate_move_cost (TREE_VALUE (t
));
3104 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3106 tree arg
= gimple_call_arg (stmt
, i
);
3107 if (!VOID_TYPE_P (TREE_TYPE (arg
)))
3108 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3120 case GIMPLE_PREDICT
:
3128 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3130 case GIMPLE_EH_FILTER
:
3131 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3134 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3137 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3138 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3140 /* OpenMP directives are generally very expensive. */
3142 case GIMPLE_OMP_RETURN
:
3143 case GIMPLE_OMP_SECTIONS_SWITCH
:
3144 case GIMPLE_OMP_ATOMIC_STORE
:
3145 case GIMPLE_OMP_CONTINUE
:
3146 /* ...except these, which are cheap. */
3149 case GIMPLE_OMP_ATOMIC_LOAD
:
3150 return weights
->omp_cost
;
3152 case GIMPLE_OMP_FOR
:
3153 return (weights
->omp_cost
3154 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3155 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3157 case GIMPLE_OMP_PARALLEL
:
3158 case GIMPLE_OMP_TASK
:
3159 case GIMPLE_OMP_CRITICAL
:
3160 case GIMPLE_OMP_MASTER
:
3161 case GIMPLE_OMP_ORDERED
:
3162 case GIMPLE_OMP_SECTION
:
3163 case GIMPLE_OMP_SECTIONS
:
3164 case GIMPLE_OMP_SINGLE
:
3165 return (weights
->omp_cost
3166 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3175 /* Estimate number of instructions that will be created by expanding
3176 function FNDECL. WEIGHTS contains weights attributed to various
3180 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3182 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3183 gimple_stmt_iterator bsi
;
3187 gcc_assert (my_function
&& my_function
->cfg
);
3188 FOR_EACH_BB_FN (bb
, my_function
)
3190 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3191 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3198 /* Initializes weights used by estimate_num_insns. */
3201 init_inline_once (void)
3203 eni_size_weights
.call_cost
= 1;
3204 eni_size_weights
.target_builtin_call_cost
= 1;
3205 eni_size_weights
.div_mod_cost
= 1;
3206 eni_size_weights
.omp_cost
= 40;
3207 eni_size_weights
.time_based
= false;
3209 /* Estimating time for call is difficult, since we have no idea what the
3210 called function does. In the current uses of eni_time_weights,
3211 underestimating the cost does less harm than overestimating it, so
3212 we choose a rather small value here. */
3213 eni_time_weights
.call_cost
= 10;
3214 eni_time_weights
.target_builtin_call_cost
= 10;
3215 eni_time_weights
.div_mod_cost
= 10;
3216 eni_time_weights
.omp_cost
= 40;
3217 eni_time_weights
.time_based
= true;
3220 /* Estimate the number of instructions in a gimple_seq. */
3223 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3225 gimple_stmt_iterator gsi
;
3227 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3228 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3234 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3237 prepend_lexical_block (tree current_block
, tree new_block
)
3239 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3240 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3241 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3244 /* Fetch callee declaration from the call graph edge going from NODE and
3245 associated with STMR call statement. Return NULL_TREE if not found. */
3247 get_indirect_callee_fndecl (struct cgraph_node
*node
, gimple stmt
)
3249 struct cgraph_edge
*cs
;
3251 cs
= cgraph_edge (node
, stmt
);
3253 return cs
->callee
->decl
;
3258 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3261 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3263 tree retvar
, use_retvar
;
3265 struct pointer_map_t
*st
;
3268 location_t saved_location
;
3269 struct cgraph_edge
*cg_edge
;
3270 cgraph_inline_failed_t reason
;
3271 basic_block return_block
;
3273 gimple_stmt_iterator gsi
, stmt_gsi
;
3274 bool successfully_inlined
= FALSE
;
3275 bool purge_dead_abnormal_edges
;
3279 /* Set input_location here so we get the right instantiation context
3280 if we call instantiate_decl from inlinable_function_p. */
3281 saved_location
= input_location
;
3282 if (gimple_has_location (stmt
))
3283 input_location
= gimple_location (stmt
);
3285 /* From here on, we're only interested in CALL_EXPRs. */
3286 if (gimple_code (stmt
) != GIMPLE_CALL
)
3289 /* First, see if we can figure out what function is being called.
3290 If we cannot, then there is no hope of inlining the function. */
3291 fn
= gimple_call_fndecl (stmt
);
3294 fn
= get_indirect_callee_fndecl (id
->dst_node
, stmt
);
3299 /* Turn forward declarations into real ones. */
3300 fn
= cgraph_node (fn
)->decl
;
3302 /* If FN is a declaration of a function in a nested scope that was
3303 globally declared inline, we don't set its DECL_INITIAL.
3304 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3305 C++ front-end uses it for cdtors to refer to their internal
3306 declarations, that are not real functions. Fortunately those
3307 don't have trees to be saved, so we can tell by checking their
3309 if (!DECL_INITIAL (fn
)
3310 && DECL_ABSTRACT_ORIGIN (fn
)
3311 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3312 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3314 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3315 Kill this check once this is fixed. */
3316 if (!id
->dst_node
->analyzed
)
3319 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3321 /* Don't try to inline functions that are not well-suited to
3323 if (!cgraph_inline_p (cg_edge
, &reason
))
3325 /* If this call was originally indirect, we do not want to emit any
3326 inlining related warnings or sorry messages because there are no
3327 guarantees regarding those. */
3328 if (cg_edge
->indirect_call
)
3331 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3332 /* Avoid warnings during early inline pass. */
3333 && cgraph_global_info_ready
)
3335 sorry ("inlining failed in call to %q+F: %s", fn
,
3336 cgraph_inline_failed_string (reason
));
3337 sorry ("called from here");
3339 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
3340 && !DECL_IN_SYSTEM_HEADER (fn
)
3341 && reason
!= CIF_UNSPECIFIED
3342 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3343 /* Avoid warnings during early inline pass. */
3344 && cgraph_global_info_ready
)
3346 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3347 fn
, cgraph_inline_failed_string (reason
));
3348 warning (OPT_Winline
, "called from here");
3352 fn
= cg_edge
->callee
->decl
;
3354 #ifdef ENABLE_CHECKING
3355 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
3356 verify_cgraph_node (cg_edge
->callee
);
3359 /* We will be inlining this callee. */
3360 id
->eh_region
= lookup_stmt_eh_region (stmt
);
3362 /* Split the block holding the GIMPLE_CALL. */
3363 e
= split_block (bb
, stmt
);
3365 return_block
= e
->dest
;
3368 /* split_block splits after the statement; work around this by
3369 moving the call into the second block manually. Not pretty,
3370 but seems easier than doing the CFG manipulation by hand
3371 when the GIMPLE_CALL is in the last statement of BB. */
3372 stmt_gsi
= gsi_last_bb (bb
);
3373 gsi_remove (&stmt_gsi
, false);
3375 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3376 been the source of abnormal edges. In this case, schedule
3377 the removal of dead abnormal edges. */
3378 gsi
= gsi_start_bb (return_block
);
3379 if (gsi_end_p (gsi
))
3381 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3382 purge_dead_abnormal_edges
= true;
3386 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3387 purge_dead_abnormal_edges
= false;
3390 stmt_gsi
= gsi_start_bb (return_block
);
3392 /* Build a block containing code to initialize the arguments, the
3393 actual inline expansion of the body, and a label for the return
3394 statements within the function to jump to. The type of the
3395 statement expression is the return type of the function call. */
3396 id
->block
= make_node (BLOCK
);
3397 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3398 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
3399 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3401 /* Local declarations will be replaced by their equivalents in this
3404 id
->decl_map
= pointer_map_create ();
3406 /* Record the function we are about to inline. */
3408 id
->src_node
= cg_edge
->callee
;
3409 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3410 id
->gimple_call
= stmt
;
3412 gcc_assert (!id
->src_cfun
->after_inlining
);
3415 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3417 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3418 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3422 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3424 if (DECL_INITIAL (fn
))
3425 prepend_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
3427 /* Return statements in the function body will be replaced by jumps
3428 to the RET_LABEL. */
3429 gcc_assert (DECL_INITIAL (fn
));
3430 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3432 /* Find the LHS to which the result of this call is assigned. */
3434 if (gimple_call_lhs (stmt
))
3436 modify_dest
= gimple_call_lhs (stmt
);
3438 /* The function which we are inlining might not return a value,
3439 in which case we should issue a warning that the function
3440 does not return a value. In that case the optimizers will
3441 see that the variable to which the value is assigned was not
3442 initialized. We do not want to issue a warning about that
3443 uninitialized variable. */
3444 if (DECL_P (modify_dest
))
3445 TREE_NO_WARNING (modify_dest
) = 1;
3447 if (gimple_call_return_slot_opt_p (stmt
))
3449 return_slot
= modify_dest
;
3456 /* If we are inlining a call to the C++ operator new, we don't want
3457 to use type based alias analysis on the return value. Otherwise
3458 we may get confused if the compiler sees that the inlined new
3459 function returns a pointer which was just deleted. See bug
3461 if (DECL_IS_OPERATOR_NEW (fn
))
3467 /* Declare the return variable for the function. */
3468 retvar
= declare_return_variable (id
, return_slot
, modify_dest
, &use_retvar
);
3470 /* Add local vars in this inlined callee to caller. */
3471 t_step
= id
->src_cfun
->local_decls
;
3472 for (; t_step
; t_step
= TREE_CHAIN (t_step
))
3474 var
= TREE_VALUE (t_step
);
3475 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
3477 if (var_ann (var
) && add_referenced_var (var
))
3478 cfun
->local_decls
= tree_cons (NULL_TREE
, var
,
3481 else if (!can_be_nonlocal (var
, id
))
3482 cfun
->local_decls
= tree_cons (NULL_TREE
, remap_decl (var
, id
),
3486 /* This is it. Duplicate the callee body. Assume callee is
3487 pre-gimplified. Note that we must not alter the caller
3488 function in any way before this point, as this CALL_EXPR may be
3489 a self-referential call; if we're calling ourselves, we need to
3490 duplicate our body before altering anything. */
3491 copy_body (id
, bb
->count
, bb
->frequency
, bb
, return_block
);
3493 /* Reset the escaped and callused solutions. */
3494 if (cfun
->gimple_df
)
3496 pt_solution_reset (&cfun
->gimple_df
->escaped
);
3497 pt_solution_reset (&cfun
->gimple_df
->callused
);
3501 pointer_map_destroy (id
->decl_map
);
3504 /* Unlink the calls virtual operands before replacing it. */
3505 unlink_stmt_vdef (stmt
);
3507 /* If the inlined function returns a result that we care about,
3508 substitute the GIMPLE_CALL with an assignment of the return
3509 variable to the LHS of the call. That is, if STMT was
3510 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3511 if (use_retvar
&& gimple_call_lhs (stmt
))
3513 gimple old_stmt
= stmt
;
3514 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
3515 gsi_replace (&stmt_gsi
, stmt
, false);
3516 if (gimple_in_ssa_p (cfun
))
3517 mark_symbols_for_renaming (stmt
);
3518 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
3522 /* Handle the case of inlining a function with no return
3523 statement, which causes the return value to become undefined. */
3524 if (gimple_call_lhs (stmt
)
3525 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
3527 tree name
= gimple_call_lhs (stmt
);
3528 tree var
= SSA_NAME_VAR (name
);
3529 tree def
= gimple_default_def (cfun
, var
);
3533 /* If the variable is used undefined, make this name
3534 undefined via a move. */
3535 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
3536 gsi_replace (&stmt_gsi
, stmt
, true);
3540 /* Otherwise make this variable undefined. */
3541 gsi_remove (&stmt_gsi
, true);
3542 set_default_def (var
, name
);
3543 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
3547 gsi_remove (&stmt_gsi
, true);
3550 if (purge_dead_abnormal_edges
)
3551 gimple_purge_dead_abnormal_call_edges (return_block
);
3553 /* If the value of the new expression is ignored, that's OK. We
3554 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3555 the equivalent inlined version either. */
3556 if (is_gimple_assign (stmt
))
3558 gcc_assert (gimple_assign_single_p (stmt
)
3559 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
3560 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
3563 /* Output the inlining info for this abstract function, since it has been
3564 inlined. If we don't do this now, we can lose the information about the
3565 variables in the function when the blocks get blown away as soon as we
3566 remove the cgraph node. */
3567 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
3569 /* Update callgraph if needed. */
3570 cgraph_remove_node (cg_edge
->callee
);
3572 id
->block
= NULL_TREE
;
3573 successfully_inlined
= TRUE
;
3576 input_location
= saved_location
;
3577 return successfully_inlined
;
3580 /* Expand call statements reachable from STMT_P.
3581 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3582 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3583 unfortunately not use that function here because we need a pointer
3584 to the CALL_EXPR, not the tree itself. */
3587 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
3589 gimple_stmt_iterator gsi
;
3591 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3593 gimple stmt
= gsi_stmt (gsi
);
3595 if (is_gimple_call (stmt
)
3596 && expand_call_inline (bb
, stmt
, id
))
3604 /* Walk all basic blocks created after FIRST and try to fold every statement
3605 in the STATEMENTS pointer set. */
3608 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
3610 for (; first
< n_basic_blocks
; first
++)
3611 if (BASIC_BLOCK (first
))
3613 gimple_stmt_iterator gsi
;
3615 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
3618 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
3620 gimple old_stmt
= gsi_stmt (gsi
);
3621 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
3623 if (fold_stmt (&gsi
))
3625 /* Re-read the statement from GSI as fold_stmt() may
3627 gimple new_stmt
= gsi_stmt (gsi
);
3628 update_stmt (new_stmt
);
3630 if (is_gimple_call (old_stmt
)
3631 || is_gimple_call (new_stmt
))
3632 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
, new_stmt
);
3634 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
3635 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
3641 /* Return true if BB has at least one abnormal outgoing edge. */
3644 has_abnormal_outgoing_edge_p (basic_block bb
)
3649 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
3650 if (e
->flags
& EDGE_ABNORMAL
)
3656 /* Expand calls to inline functions in the body of FN. */
3659 optimize_inline_calls (tree fn
)
3664 int last
= n_basic_blocks
;
3665 struct gimplify_ctx gctx
;
3667 /* There is no point in performing inlining if errors have already
3668 occurred -- and we might crash if we try to inline invalid
3670 if (errorcount
|| sorrycount
)
3674 memset (&id
, 0, sizeof (id
));
3676 id
.src_node
= id
.dst_node
= cgraph_node (fn
);
3678 /* Or any functions that aren't finished yet. */
3679 prev_fn
= NULL_TREE
;
3680 if (current_function_decl
)
3682 id
.dst_fn
= current_function_decl
;
3683 prev_fn
= current_function_decl
;
3686 id
.copy_decl
= copy_decl_maybe_to_var
;
3687 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
3688 id
.transform_new_cfg
= false;
3689 id
.transform_return_to_modify
= true;
3690 id
.transform_lang_insert_block
= NULL
;
3691 id
.statements_to_fold
= pointer_set_create ();
3693 push_gimplify_context (&gctx
);
3695 /* We make no attempts to keep dominance info up-to-date. */
3696 free_dominance_info (CDI_DOMINATORS
);
3697 free_dominance_info (CDI_POST_DOMINATORS
);
3699 /* Register specific gimple functions. */
3700 gimple_register_cfg_hooks ();
3702 /* Reach the trees by walking over the CFG, and note the
3703 enclosing basic-blocks in the call edges. */
3704 /* We walk the blocks going forward, because inlined function bodies
3705 will split id->current_basic_block, and the new blocks will
3706 follow it; we'll trudge through them, processing their CALL_EXPRs
3709 gimple_expand_calls_inline (bb
, &id
);
3711 pop_gimplify_context (NULL
);
3713 #ifdef ENABLE_CHECKING
3715 struct cgraph_edge
*e
;
3717 verify_cgraph_node (id
.dst_node
);
3719 /* Double check that we inlined everything we are supposed to inline. */
3720 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
3721 gcc_assert (e
->inline_failed
);
3725 /* Fold the statements before compacting/renumbering the basic blocks. */
3726 fold_marked_statements (last
, id
.statements_to_fold
);
3727 pointer_set_destroy (id
.statements_to_fold
);
3729 /* Renumber the (code) basic_blocks consecutively. */
3731 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3734 fold_cond_expr_cond ();
3735 delete_unreachable_blocks_update_callgraph (&id
);
3736 #ifdef ENABLE_CHECKING
3737 verify_cgraph_node (id
.dst_node
);
3740 /* It would be nice to check SSA/CFG/statement consistency here, but it is
3741 not possible yet - the IPA passes might make various functions to not
3742 throw and they don't care to proactively update local EH info. This is
3743 done later in fixup_cfg pass that also execute the verification. */
3744 return (TODO_update_ssa
3746 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
3747 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
3750 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
3753 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
3755 enum tree_code code
= TREE_CODE (*tp
);
3756 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
3758 /* We make copies of most nodes. */
3759 if (IS_EXPR_CODE_CLASS (cl
)
3760 || code
== TREE_LIST
3762 || code
== TYPE_DECL
3763 || code
== OMP_CLAUSE
)
3765 /* Because the chain gets clobbered when we make a copy, we save it
3767 tree chain
= NULL_TREE
, new_tree
;
3769 chain
= TREE_CHAIN (*tp
);
3771 /* Copy the node. */
3772 new_tree
= copy_node (*tp
);
3774 /* Propagate mudflap marked-ness. */
3775 if (flag_mudflap
&& mf_marked_p (*tp
))
3780 /* Now, restore the chain, if appropriate. That will cause
3781 walk_tree to walk into the chain as well. */
3782 if (code
== PARM_DECL
3783 || code
== TREE_LIST
3784 || code
== OMP_CLAUSE
)
3785 TREE_CHAIN (*tp
) = chain
;
3787 /* For now, we don't update BLOCKs when we make copies. So, we
3788 have to nullify all BIND_EXPRs. */
3789 if (TREE_CODE (*tp
) == BIND_EXPR
)
3790 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
3792 else if (code
== CONSTRUCTOR
)
3794 /* CONSTRUCTOR nodes need special handling because
3795 we need to duplicate the vector of elements. */
3798 new_tree
= copy_node (*tp
);
3800 /* Propagate mudflap marked-ness. */
3801 if (flag_mudflap
&& mf_marked_p (*tp
))
3804 CONSTRUCTOR_ELTS (new_tree
) = VEC_copy (constructor_elt
, gc
,
3805 CONSTRUCTOR_ELTS (*tp
));
3808 else if (TREE_CODE_CLASS (code
) == tcc_type
)
3810 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
3812 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
3815 gcc_assert (code
!= STATEMENT_LIST
);
3819 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3820 information indicating to what new SAVE_EXPR this one should be mapped,
3821 use that one. Otherwise, create a new node and enter it in ST. FN is
3822 the function into which the copy will be placed. */
3825 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
3827 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
3831 /* See if we already encountered this SAVE_EXPR. */
3832 n
= (tree
*) pointer_map_contains (st
, *tp
);
3834 /* If we didn't already remap this SAVE_EXPR, do so now. */
3837 t
= copy_node (*tp
);
3839 /* Remember this SAVE_EXPR. */
3840 *pointer_map_insert (st
, *tp
) = t
;
3841 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3842 *pointer_map_insert (st
, t
) = t
;
3846 /* We've already walked into this SAVE_EXPR; don't do it again. */
3851 /* Replace this SAVE_EXPR with the copy. */
3855 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3856 copies the declaration and enters it in the splay_tree in DATA (which is
3857 really an `copy_body_data *'). */
3860 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
3863 copy_body_data
*id
= (copy_body_data
*) data
;
3865 /* Don't walk into types. */
3869 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
3871 tree decl
= TREE_OPERAND (*tp
, 0);
3873 /* Copy the decl and remember the copy. */
3874 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
3880 /* Perform any modifications to EXPR required when it is unsaved. Does
3881 not recurse into EXPR's subtrees. */
3884 unsave_expr_1 (tree expr
)
3886 switch (TREE_CODE (expr
))
3889 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3890 It's OK for this to happen if it was part of a subtree that
3891 isn't immediately expanded, such as operand 2 of another
3893 if (TREE_OPERAND (expr
, 1))
3896 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
3897 TREE_OPERAND (expr
, 3) = NULL_TREE
;
3905 /* Called via walk_tree when an expression is unsaved. Using the
3906 splay_tree pointed to by ST (which is really a `splay_tree'),
3907 remaps all local declarations to appropriate replacements. */
3910 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
3912 copy_body_data
*id
= (copy_body_data
*) data
;
3913 struct pointer_map_t
*st
= id
->decl_map
;
3916 /* Only a local declaration (variable or label). */
3917 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
3918 || TREE_CODE (*tp
) == LABEL_DECL
)
3920 /* Lookup the declaration. */
3921 n
= (tree
*) pointer_map_contains (st
, *tp
);
3923 /* If it's there, remap it. */
3928 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
3930 else if (TREE_CODE (*tp
) == BIND_EXPR
)
3931 copy_bind_expr (tp
, walk_subtrees
, id
);
3932 else if (TREE_CODE (*tp
) == SAVE_EXPR
3933 || TREE_CODE (*tp
) == TARGET_EXPR
)
3934 remap_save_expr (tp
, st
, walk_subtrees
);
3937 copy_tree_r (tp
, walk_subtrees
, NULL
);
3939 /* Do whatever unsaving is required. */
3940 unsave_expr_1 (*tp
);
3943 /* Keep iterating. */
3947 /* Copies everything in EXPR and replaces variables, labels
3948 and SAVE_EXPRs local to EXPR. */
3951 unsave_expr_now (tree expr
)
3955 /* There's nothing to do for NULL_TREE. */
3960 memset (&id
, 0, sizeof (id
));
3961 id
.src_fn
= current_function_decl
;
3962 id
.dst_fn
= current_function_decl
;
3963 id
.decl_map
= pointer_map_create ();
3965 id
.copy_decl
= copy_decl_no_change
;
3966 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
3967 id
.transform_new_cfg
= false;
3968 id
.transform_return_to_modify
= false;
3969 id
.transform_lang_insert_block
= NULL
;
3971 /* Walk the tree once to find local labels. */
3972 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
3974 /* Walk the tree again, copying, remapping, and unsaving. */
3975 walk_tree (&expr
, unsave_r
, &id
, NULL
);
3978 pointer_map_destroy (id
.decl_map
);
3983 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
3984 label, copies the declaration and enters it in the splay_tree in DATA (which
3985 is really a 'copy_body_data *'. */
3988 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
3989 bool *handled_ops_p ATTRIBUTE_UNUSED
,
3990 struct walk_stmt_info
*wi
)
3992 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
3993 gimple stmt
= gsi_stmt (*gsip
);
3995 if (gimple_code (stmt
) == GIMPLE_LABEL
)
3997 tree decl
= gimple_label_label (stmt
);
3999 /* Copy the decl and remember the copy. */
4000 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
4007 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4008 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4009 remaps all local declarations to appropriate replacements in gimple
4013 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
4015 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4016 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4017 struct pointer_map_t
*st
= id
->decl_map
;
4021 /* Only a local declaration (variable or label). */
4022 if ((TREE_CODE (expr
) == VAR_DECL
4023 && !TREE_STATIC (expr
))
4024 || TREE_CODE (expr
) == LABEL_DECL
)
4026 /* Lookup the declaration. */
4027 n
= (tree
*) pointer_map_contains (st
, expr
);
4029 /* If it's there, remap it. */
4034 else if (TREE_CODE (expr
) == STATEMENT_LIST
4035 || TREE_CODE (expr
) == BIND_EXPR
4036 || TREE_CODE (expr
) == SAVE_EXPR
)
4038 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4040 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4041 It's OK for this to happen if it was part of a subtree that
4042 isn't immediately expanded, such as operand 2 of another
4044 if (!TREE_OPERAND (expr
, 1))
4046 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4047 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4051 /* Keep iterating. */
4056 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4057 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4058 remaps all local declarations to appropriate replacements in gimple
4062 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4063 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4064 struct walk_stmt_info
*wi
)
4066 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4067 gimple stmt
= gsi_stmt (*gsip
);
4069 if (gimple_code (stmt
) == GIMPLE_BIND
)
4071 tree block
= gimple_bind_block (stmt
);
4075 remap_block (&block
, id
);
4076 gimple_bind_set_block (stmt
, block
);
4079 /* This will remap a lot of the same decls again, but this should be
4081 if (gimple_bind_vars (stmt
))
4082 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
), NULL
, id
));
4085 /* Keep iterating. */
4090 /* Copies everything in SEQ and replaces variables and labels local to
4091 current_function_decl. */
4094 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4097 struct walk_stmt_info wi
;
4098 struct pointer_set_t
*visited
;
4101 /* There's nothing to do for NULL_TREE. */
4106 memset (&id
, 0, sizeof (id
));
4107 id
.src_fn
= current_function_decl
;
4108 id
.dst_fn
= current_function_decl
;
4109 id
.decl_map
= pointer_map_create ();
4111 id
.copy_decl
= copy_decl_no_change
;
4112 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4113 id
.transform_new_cfg
= false;
4114 id
.transform_return_to_modify
= false;
4115 id
.transform_lang_insert_block
= NULL
;
4117 /* Walk the tree once to find local labels. */
4118 memset (&wi
, 0, sizeof (wi
));
4119 visited
= pointer_set_create ();
4122 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4123 pointer_set_destroy (visited
);
4125 copy
= gimple_seq_copy (seq
);
4127 /* Walk the copy, remapping decls. */
4128 memset (&wi
, 0, sizeof (wi
));
4130 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4133 pointer_map_destroy (id
.decl_map
);
4139 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4142 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4151 debug_find_tree (tree top
, tree search
)
4153 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4157 /* Declare the variables created by the inliner. Add all the variables in
4158 VARS to BIND_EXPR. */
4161 declare_inline_vars (tree block
, tree vars
)
4164 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4166 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4167 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4168 cfun
->local_decls
= tree_cons (NULL_TREE
, t
, cfun
->local_decls
);
4172 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4175 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4176 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4177 VAR_DECL translation. */
4180 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4182 /* Don't generate debug information for the copy if we wouldn't have
4183 generated it for the copy either. */
4184 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4185 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4187 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4188 declaration inspired this copy. */
4189 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4191 /* The new variable/label has no RTL, yet. */
4192 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4193 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4194 SET_DECL_RTL (copy
, NULL_RTX
);
4196 /* These args would always appear unused, if not for this. */
4197 TREE_USED (copy
) = 1;
4199 /* Set the context for the new declaration. */
4200 if (!DECL_CONTEXT (decl
))
4201 /* Globals stay global. */
4203 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4204 /* Things that weren't in the scope of the function we're inlining
4205 from aren't in the scope we're inlining to, either. */
4207 else if (TREE_STATIC (decl
))
4208 /* Function-scoped static variables should stay in the original
4212 /* Ordinary automatic local variables are now in the scope of the
4214 DECL_CONTEXT (copy
) = id
->dst_fn
;
4220 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4224 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4225 || TREE_CODE (decl
) == RESULT_DECL
);
4227 type
= TREE_TYPE (decl
);
4229 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4230 VAR_DECL
, DECL_NAME (decl
), type
);
4231 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4232 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4233 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4234 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4236 return copy_decl_for_dup_finish (id
, decl
, copy
);
4239 /* Like copy_decl_to_var, but create a return slot object instead of a
4240 pointer variable for return by invisible reference. */
4243 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4247 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4248 || TREE_CODE (decl
) == RESULT_DECL
);
4250 type
= TREE_TYPE (decl
);
4251 if (DECL_BY_REFERENCE (decl
))
4252 type
= TREE_TYPE (type
);
4254 copy
= build_decl (DECL_SOURCE_LOCATION (id
->dst_fn
),
4255 VAR_DECL
, DECL_NAME (decl
), type
);
4256 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4257 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4258 if (!DECL_BY_REFERENCE (decl
))
4260 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4261 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4264 return copy_decl_for_dup_finish (id
, decl
, copy
);
4268 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4272 copy
= copy_node (decl
);
4274 /* The COPY is not abstract; it will be generated in DST_FN. */
4275 DECL_ABSTRACT (copy
) = 0;
4276 lang_hooks
.dup_lang_specific_decl (copy
);
4278 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4279 been taken; it's for internal bookkeeping in expand_goto_internal. */
4280 if (TREE_CODE (copy
) == LABEL_DECL
)
4282 TREE_ADDRESSABLE (copy
) = 0;
4283 LABEL_DECL_UID (copy
) = -1;
4286 return copy_decl_for_dup_finish (id
, decl
, copy
);
4290 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4292 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4293 return copy_decl_to_var (decl
, id
);
4295 return copy_decl_no_change (decl
, id
);
4298 /* Return a copy of the function's argument tree. */
4300 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4301 bitmap args_to_skip
, tree
*vars
)
4304 tree new_parm
= NULL
;
4309 for (arg
= orig_parm
; arg
; arg
= TREE_CHAIN (arg
), i
++)
4310 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4312 tree new_tree
= remap_decl (arg
, id
);
4313 lang_hooks
.dup_lang_specific_decl (new_tree
);
4315 parg
= &TREE_CHAIN (new_tree
);
4317 else if (!pointer_map_contains (id
->decl_map
, arg
))
4319 /* Make an equivalent VAR_DECL. If the argument was used
4320 as temporary variable later in function, the uses will be
4321 replaced by local variable. */
4322 tree var
= copy_decl_to_var (arg
, id
);
4324 add_referenced_var (var
);
4325 insert_decl_map (id
, arg
, var
);
4326 /* Declare this new variable. */
4327 TREE_CHAIN (var
) = *vars
;
4333 /* Return a copy of the function's static chain. */
4335 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4337 tree
*chain_copy
, *pvar
;
4339 chain_copy
= &static_chain
;
4340 for (pvar
= chain_copy
; *pvar
; pvar
= &TREE_CHAIN (*pvar
))
4342 tree new_tree
= remap_decl (*pvar
, id
);
4343 lang_hooks
.dup_lang_specific_decl (new_tree
);
4344 TREE_CHAIN (new_tree
) = TREE_CHAIN (*pvar
);
4347 return static_chain
;
4350 /* Return true if the function is allowed to be versioned.
4351 This is a guard for the versioning functionality. */
4354 tree_versionable_function_p (tree fndecl
)
4356 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl
))
4357 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl
), fndecl
) == NULL
);
4360 /* Delete all unreachable basic blocks and update callgraph.
4361 Doing so is somewhat nontrivial because we need to update all clones and
4362 remove inline function that become unreachable. */
4365 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4367 bool changed
= false;
4368 basic_block b
, next_bb
;
4370 find_unreachable_blocks ();
4372 /* Delete all unreachable basic blocks. */
4374 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4376 next_bb
= b
->next_bb
;
4378 if (!(b
->flags
& BB_REACHABLE
))
4380 gimple_stmt_iterator bsi
;
4382 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4383 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
4385 struct cgraph_edge
*e
;
4386 struct cgraph_node
*node
;
4388 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
4390 if (!e
->inline_failed
)
4391 cgraph_remove_node_and_inline_clones (e
->callee
);
4393 cgraph_remove_edge (e
);
4395 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
4396 && id
->dst_node
->clones
)
4397 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4399 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
4401 if (!e
->inline_failed
)
4402 cgraph_remove_node_and_inline_clones (e
->callee
);
4404 cgraph_remove_edge (e
);
4408 node
= node
->clones
;
4409 else if (node
->next_sibling_clone
)
4410 node
= node
->next_sibling_clone
;
4413 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4414 node
= node
->clone_of
;
4415 if (node
!= id
->dst_node
)
4416 node
= node
->next_sibling_clone
;
4420 delete_basic_block (b
);
4426 tidy_fallthru_edges ();
4427 #ifdef ENABLE_CHECKING0
4428 verify_cgraph_node (id
->dst_node
);
4429 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
4430 && id
->dst_node
->clones
)
4432 struct cgraph_node
*node
;
4433 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4435 verify_cgraph_node (node
);
4438 node
= node
->clones
;
4439 else if (node
->next_sibling_clone
)
4440 node
= node
->next_sibling_clone
;
4443 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4444 node
= node
->clone_of
;
4445 if (node
!= id
->dst_node
)
4446 node
= node
->next_sibling_clone
;
4454 /* Update clone info after duplication. */
4457 update_clone_info (copy_body_data
* id
)
4459 struct cgraph_node
*node
;
4460 if (!id
->dst_node
->clones
)
4462 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4464 /* First update replace maps to match the new body. */
4465 if (node
->clone
.tree_map
)
4468 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, node
->clone
.tree_map
); i
++)
4470 struct ipa_replace_map
*replace_info
;
4471 replace_info
= VEC_index (ipa_replace_map_p
, node
->clone
.tree_map
, i
);
4472 walk_tree (&replace_info
->old_tree
, copy_tree_body_r
, id
, NULL
);
4473 walk_tree (&replace_info
->new_tree
, copy_tree_body_r
, id
, NULL
);
4477 node
= node
->clones
;
4478 else if (node
->next_sibling_clone
)
4479 node
= node
->next_sibling_clone
;
4482 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4483 node
= node
->clone_of
;
4484 if (node
!= id
->dst_node
)
4485 node
= node
->next_sibling_clone
;
4490 /* Create a copy of a function's tree.
4491 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4492 of the original function and the new copied function
4493 respectively. In case we want to replace a DECL
4494 tree with another tree while duplicating the function's
4495 body, TREE_MAP represents the mapping between these
4496 trees. If UPDATE_CLONES is set, the call_stmt fields
4497 of edges of clones of the function will be updated. */
4499 tree_function_versioning (tree old_decl
, tree new_decl
,
4500 VEC(ipa_replace_map_p
,gc
)* tree_map
,
4501 bool update_clones
, bitmap args_to_skip
)
4503 struct cgraph_node
*old_version_node
;
4504 struct cgraph_node
*new_version_node
;
4508 struct ipa_replace_map
*replace_info
;
4509 basic_block old_entry_block
;
4510 VEC (gimple
, heap
) *init_stmts
= VEC_alloc (gimple
, heap
, 10);
4513 tree old_current_function_decl
= current_function_decl
;
4514 tree vars
= NULL_TREE
;
4516 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
4517 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
4518 DECL_POSSIBLY_INLINED (old_decl
) = 1;
4520 old_version_node
= cgraph_node (old_decl
);
4521 new_version_node
= cgraph_node (new_decl
);
4523 /* Output the inlining info for this abstract function, since it has been
4524 inlined. If we don't do this now, we can lose the information about the
4525 variables in the function when the blocks get blown away as soon as we
4526 remove the cgraph node. */
4527 (*debug_hooks
->outlining_inline_function
) (old_decl
);
4529 DECL_ARTIFICIAL (new_decl
) = 1;
4530 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
4532 /* Prepare the data structures for the tree copy. */
4533 memset (&id
, 0, sizeof (id
));
4535 /* Generate a new name for the new version. */
4536 id
.statements_to_fold
= pointer_set_create ();
4538 id
.decl_map
= pointer_map_create ();
4539 id
.src_fn
= old_decl
;
4540 id
.dst_fn
= new_decl
;
4541 id
.src_node
= old_version_node
;
4542 id
.dst_node
= new_version_node
;
4543 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
4545 id
.copy_decl
= copy_decl_no_change
;
4546 id
.transform_call_graph_edges
4547 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
4548 id
.transform_new_cfg
= true;
4549 id
.transform_return_to_modify
= false;
4550 id
.transform_lang_insert_block
= NULL
;
4552 current_function_decl
= new_decl
;
4553 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
4554 (DECL_STRUCT_FUNCTION (old_decl
));
4555 initialize_cfun (new_decl
, old_decl
,
4556 old_entry_block
->count
,
4557 old_entry_block
->frequency
);
4558 push_cfun (DECL_STRUCT_FUNCTION (new_decl
));
4560 /* Copy the function's static chain. */
4561 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
4563 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
4564 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
4567 /* If there's a tree_map, prepare for substitution. */
4569 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, tree_map
); i
++)
4572 replace_info
= VEC_index (ipa_replace_map_p
, tree_map
, i
);
4573 if (replace_info
->replace_p
)
4575 tree op
= replace_info
->new_tree
;
4579 if (TREE_CODE (op
) == VIEW_CONVERT_EXPR
)
4580 op
= TREE_OPERAND (op
, 0);
4582 if (TREE_CODE (op
) == ADDR_EXPR
)
4584 op
= TREE_OPERAND (op
, 0);
4585 while (handled_component_p (op
))
4586 op
= TREE_OPERAND (op
, 0);
4587 if (TREE_CODE (op
) == VAR_DECL
)
4588 add_referenced_var (op
);
4590 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
4591 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
4592 replace_info
->new_tree
, id
.src_fn
,
4596 VEC_safe_push (gimple
, heap
, init_stmts
, init
);
4599 /* Copy the function's arguments. */
4600 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
4601 DECL_ARGUMENTS (new_decl
) =
4602 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
4603 args_to_skip
, &vars
);
4605 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
4607 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4608 number_blocks (id
.dst_fn
);
4610 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
4612 if (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
!= NULL_TREE
)
4613 /* Add local vars. */
4614 for (t_step
= DECL_STRUCT_FUNCTION (old_decl
)->local_decls
;
4615 t_step
; t_step
= TREE_CHAIN (t_step
))
4617 tree var
= TREE_VALUE (t_step
);
4618 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
4619 cfun
->local_decls
= tree_cons (NULL_TREE
, var
, cfun
->local_decls
);
4620 else if (!can_be_nonlocal (var
, &id
))
4622 tree_cons (NULL_TREE
, remap_decl (var
, &id
),
4626 /* Copy the Function's body. */
4627 copy_body (&id
, old_entry_block
->count
, old_entry_block
->frequency
,
4628 ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
);
4630 if (DECL_RESULT (old_decl
) != NULL_TREE
)
4632 tree
*res_decl
= &DECL_RESULT (old_decl
);
4633 DECL_RESULT (new_decl
) = remap_decl (*res_decl
, &id
);
4634 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
4637 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4638 number_blocks (new_decl
);
4640 if (VEC_length (gimple
, init_stmts
))
4642 basic_block bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
4643 while (VEC_length (gimple
, init_stmts
))
4644 insert_init_stmt (bb
, VEC_pop (gimple
, init_stmts
));
4646 update_clone_info (&id
);
4648 /* Remap the nonlocal_goto_save_area, if any. */
4649 if (cfun
->nonlocal_goto_save_area
)
4651 struct walk_stmt_info wi
;
4653 memset (&wi
, 0, sizeof (wi
));
4655 walk_tree (&cfun
->nonlocal_goto_save_area
, remap_gimple_op_r
, &wi
, NULL
);
4659 pointer_map_destroy (id
.decl_map
);
4660 free_dominance_info (CDI_DOMINATORS
);
4661 free_dominance_info (CDI_POST_DOMINATORS
);
4663 fold_marked_statements (0, id
.statements_to_fold
);
4664 pointer_set_destroy (id
.statements_to_fold
);
4665 fold_cond_expr_cond ();
4666 delete_unreachable_blocks_update_callgraph (&id
);
4667 update_ssa (TODO_update_ssa
);
4668 free_dominance_info (CDI_DOMINATORS
);
4669 free_dominance_info (CDI_POST_DOMINATORS
);
4671 VEC_free (gimple
, heap
, init_stmts
);
4673 current_function_decl
= old_current_function_decl
;
4674 gcc_assert (!current_function_decl
4675 || DECL_STRUCT_FUNCTION (current_function_decl
) == cfun
);
4679 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
4680 the callee and return the inlined body on success. */
4683 maybe_inline_call_in_expr (tree exp
)
4685 tree fn
= get_callee_fndecl (exp
);
4687 /* We can only try to inline "const" functions. */
4688 if (fn
&& TREE_READONLY (fn
) && DECL_SAVED_TREE (fn
))
4690 struct pointer_map_t
*decl_map
= pointer_map_create ();
4691 call_expr_arg_iterator iter
;
4695 /* Remap the parameters. */
4696 for (param
= DECL_ARGUMENTS (fn
), arg
= first_call_expr_arg (exp
, &iter
);
4698 param
= TREE_CHAIN (param
), arg
= next_call_expr_arg (&iter
))
4699 *pointer_map_insert (decl_map
, param
) = arg
;
4701 memset (&id
, 0, sizeof (id
));
4703 id
.dst_fn
= current_function_decl
;
4704 id
.src_cfun
= DECL_STRUCT_FUNCTION (fn
);
4705 id
.decl_map
= decl_map
;
4707 id
.copy_decl
= copy_decl_no_change
;
4708 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4709 id
.transform_new_cfg
= false;
4710 id
.transform_return_to_modify
= true;
4711 id
.transform_lang_insert_block
= false;
4713 /* Make sure not to unshare trees behind the front-end's back
4714 since front-end specific mechanisms may rely on sharing. */
4715 id
.regimplify
= false;
4716 id
.do_not_unshare
= true;
4718 /* We're not inside any EH region. */
4721 t
= copy_tree_body (&id
);
4722 pointer_map_destroy (decl_map
);
4724 /* We can only return something suitable for use in a GENERIC
4726 if (TREE_CODE (t
) == MODIFY_EXPR
)
4727 return TREE_OPERAND (t
, 1);
4733 /* Duplicate a type, fields and all. */
4736 build_duplicate_type (tree type
)
4738 struct copy_body_data id
;
4740 memset (&id
, 0, sizeof (id
));
4741 id
.src_fn
= current_function_decl
;
4742 id
.dst_fn
= current_function_decl
;
4744 id
.decl_map
= pointer_map_create ();
4745 id
.copy_decl
= copy_decl_no_change
;
4747 type
= remap_type_1 (type
, &id
);
4749 pointer_map_destroy (id
.decl_map
);
4751 TYPE_CANONICAL (type
) = type
;
4756 /* Return whether it is safe to inline a function because it used different
4757 target specific options or call site actual types mismatch parameter types.
4758 E is the call edge to be checked. */
4760 tree_can_inline_p (struct cgraph_edge
*e
)
4763 /* This causes a regression in SPEC in that it prevents a cold function from
4764 inlining a hot function. Perhaps this should only apply to functions
4765 that the user declares hot/cold/optimize explicitly. */
4767 /* Don't inline a function with a higher optimization level than the
4768 caller, or with different space constraints (hot/cold functions). */
4769 tree caller_tree
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller
);
4770 tree callee_tree
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee
);
4772 if (caller_tree
!= callee_tree
)
4774 struct cl_optimization
*caller_opt
4775 = TREE_OPTIMIZATION ((caller_tree
)
4777 : optimization_default_node
);
4779 struct cl_optimization
*callee_opt
4780 = TREE_OPTIMIZATION ((callee_tree
)
4782 : optimization_default_node
);
4784 if ((caller_opt
->optimize
> callee_opt
->optimize
)
4785 || (caller_opt
->optimize_size
!= callee_opt
->optimize_size
))
4789 tree caller
, callee
;
4791 caller
= e
->caller
->decl
;
4792 callee
= e
->callee
->decl
;
4794 /* Allow the backend to decide if inlining is ok. */
4795 if (!targetm
.target_option
.can_inline_p (caller
, callee
))
4797 e
->inline_failed
= CIF_TARGET_OPTION_MISMATCH
;
4798 gimple_call_set_cannot_inline (e
->call_stmt
, true);
4802 if (!gimple_check_call_args (e
->call_stmt
))
4804 e
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
4805 gimple_call_set_cannot_inline (e
->call_stmt
, true);