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 bool inlinable_function_p (tree
);
123 static void remap_block (tree
*, copy_body_data
*);
124 static void copy_bind_expr (tree
*, int *, copy_body_data
*);
125 static tree
mark_local_for_remap_r (tree
*, int *, void *);
126 static void unsave_expr_1 (tree
);
127 static tree
unsave_r (tree
*, int *, void *);
128 static void declare_inline_vars (tree
, tree
);
129 static void remap_save_expr (tree
*, void *, int *);
130 static void prepend_lexical_block (tree current_block
, tree new_block
);
131 static tree
copy_decl_to_var (tree
, copy_body_data
*);
132 static tree
copy_result_decl_to_var (tree
, copy_body_data
*);
133 static tree
copy_decl_maybe_to_var (tree
, copy_body_data
*);
134 static gimple
remap_gimple_stmt (gimple
, copy_body_data
*);
135 static bool delete_unreachable_blocks_update_callgraph (copy_body_data
*id
);
137 /* Insert a tree->tree mapping for ID. Despite the name suggests
138 that the trees should be variables, it is used for more than that. */
141 insert_decl_map (copy_body_data
*id
, tree key
, tree value
)
143 *pointer_map_insert (id
->decl_map
, key
) = value
;
145 /* Always insert an identity map as well. If we see this same new
146 node again, we won't want to duplicate it a second time. */
148 *pointer_map_insert (id
->decl_map
, value
) = value
;
151 /* Construct new SSA name for old NAME. ID is the inline context. */
154 remap_ssa_name (tree name
, copy_body_data
*id
)
159 gcc_assert (TREE_CODE (name
) == SSA_NAME
);
161 n
= (tree
*) pointer_map_contains (id
->decl_map
, name
);
163 return unshare_expr (*n
);
165 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
167 new_tree
= remap_decl (SSA_NAME_VAR (name
), id
);
169 /* We might've substituted constant or another SSA_NAME for
172 Replace the SSA name representing RESULT_DECL by variable during
173 inlining: this saves us from need to introduce PHI node in a case
174 return value is just partly initialized. */
175 if ((TREE_CODE (new_tree
) == VAR_DECL
|| TREE_CODE (new_tree
) == PARM_DECL
)
176 && (TREE_CODE (SSA_NAME_VAR (name
)) != RESULT_DECL
177 || !id
->transform_return_to_modify
))
179 new_tree
= make_ssa_name (new_tree
, NULL
);
180 insert_decl_map (id
, name
, new_tree
);
181 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree
)
182 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name
);
183 TREE_TYPE (new_tree
) = TREE_TYPE (SSA_NAME_VAR (new_tree
));
184 if (gimple_nop_p (SSA_NAME_DEF_STMT (name
)))
186 /* By inlining function having uninitialized variable, we might
187 extend the lifetime (variable might get reused). This cause
188 ICE in the case we end up extending lifetime of SSA name across
189 abnormal edge, but also increase register pressure.
191 We simply initialize all uninitialized vars by 0 except
192 for case we are inlining to very first BB. We can avoid
193 this for all BBs that are not inside strongly connected
194 regions of the CFG, but this is expensive to test. */
196 && is_gimple_reg (SSA_NAME_VAR (name
))
197 && TREE_CODE (SSA_NAME_VAR (name
)) != PARM_DECL
198 && (id
->entry_bb
!= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0)->dest
199 || EDGE_COUNT (id
->entry_bb
->preds
) != 1))
201 gimple_stmt_iterator gsi
= gsi_last_bb (id
->entry_bb
);
204 init_stmt
= gimple_build_assign (new_tree
,
205 fold_convert (TREE_TYPE (new_tree
),
207 gsi_insert_after (&gsi
, init_stmt
, GSI_NEW_STMT
);
208 SSA_NAME_IS_DEFAULT_DEF (new_tree
) = 0;
212 SSA_NAME_DEF_STMT (new_tree
) = gimple_build_nop ();
213 if (gimple_default_def (id
->src_cfun
, SSA_NAME_VAR (name
))
215 set_default_def (SSA_NAME_VAR (new_tree
), new_tree
);
220 insert_decl_map (id
, name
, new_tree
);
224 /* Remap DECL during the copying of the BLOCK tree for the function. */
227 remap_decl (tree decl
, copy_body_data
*id
)
232 /* We only remap local variables in the current function. */
235 /* See if we have remapped this declaration. */
237 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
239 /* If we didn't already have an equivalent for this declaration,
243 /* Make a copy of the variable or label. */
244 tree t
= id
->copy_decl (decl
, id
);
246 /* Remember it, so that if we encounter this local entity again
247 we can reuse this copy. Do this early because remap_type may
248 need this decl for TYPE_STUB_DECL. */
249 insert_decl_map (id
, decl
, t
);
254 /* Remap types, if necessary. */
255 TREE_TYPE (t
) = remap_type (TREE_TYPE (t
), id
);
256 if (TREE_CODE (t
) == TYPE_DECL
)
257 DECL_ORIGINAL_TYPE (t
) = remap_type (DECL_ORIGINAL_TYPE (t
), id
);
259 /* Remap sizes as necessary. */
260 walk_tree (&DECL_SIZE (t
), copy_tree_body_r
, id
, NULL
);
261 walk_tree (&DECL_SIZE_UNIT (t
), copy_tree_body_r
, id
, NULL
);
263 /* If fields, do likewise for offset and qualifier. */
264 if (TREE_CODE (t
) == FIELD_DECL
)
266 walk_tree (&DECL_FIELD_OFFSET (t
), copy_tree_body_r
, id
, NULL
);
267 if (TREE_CODE (DECL_CONTEXT (t
)) == QUAL_UNION_TYPE
)
268 walk_tree (&DECL_QUALIFIER (t
), copy_tree_body_r
, id
, NULL
);
271 if (cfun
&& gimple_in_ssa_p (cfun
)
272 && (TREE_CODE (t
) == VAR_DECL
273 || TREE_CODE (t
) == RESULT_DECL
|| TREE_CODE (t
) == PARM_DECL
))
275 tree def
= gimple_default_def (id
->src_cfun
, decl
);
277 if (TREE_CODE (decl
) != PARM_DECL
&& def
)
279 tree map
= remap_ssa_name (def
, id
);
280 /* Watch out RESULT_DECLs whose SSA names map directly
282 if (TREE_CODE (map
) == SSA_NAME
283 && gimple_nop_p (SSA_NAME_DEF_STMT (map
)))
284 set_default_def (t
, map
);
286 add_referenced_var (t
);
291 return unshare_expr (*n
);
295 remap_type_1 (tree type
, copy_body_data
*id
)
299 /* We do need a copy. build and register it now. If this is a pointer or
300 reference type, remap the designated type and make a new pointer or
302 if (TREE_CODE (type
) == POINTER_TYPE
)
304 new_tree
= build_pointer_type_for_mode (remap_type (TREE_TYPE (type
), id
),
306 TYPE_REF_CAN_ALIAS_ALL (type
));
307 insert_decl_map (id
, type
, new_tree
);
310 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
312 new_tree
= build_reference_type_for_mode (remap_type (TREE_TYPE (type
), id
),
314 TYPE_REF_CAN_ALIAS_ALL (type
));
315 insert_decl_map (id
, type
, new_tree
);
319 new_tree
= copy_node (type
);
321 insert_decl_map (id
, type
, new_tree
);
323 /* This is a new type, not a copy of an old type. Need to reassociate
324 variants. We can handle everything except the main variant lazily. */
325 t
= TYPE_MAIN_VARIANT (type
);
328 t
= remap_type (t
, id
);
329 TYPE_MAIN_VARIANT (new_tree
) = t
;
330 TYPE_NEXT_VARIANT (new_tree
) = TYPE_NEXT_VARIANT (t
);
331 TYPE_NEXT_VARIANT (t
) = new_tree
;
335 TYPE_MAIN_VARIANT (new_tree
) = new_tree
;
336 TYPE_NEXT_VARIANT (new_tree
) = NULL
;
339 if (TYPE_STUB_DECL (type
))
340 TYPE_STUB_DECL (new_tree
) = remap_decl (TYPE_STUB_DECL (type
), id
);
342 /* Lazily create pointer and reference types. */
343 TYPE_POINTER_TO (new_tree
) = NULL
;
344 TYPE_REFERENCE_TO (new_tree
) = NULL
;
346 switch (TREE_CODE (new_tree
))
350 case FIXED_POINT_TYPE
:
353 t
= TYPE_MIN_VALUE (new_tree
);
354 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
355 walk_tree (&TYPE_MIN_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
357 t
= TYPE_MAX_VALUE (new_tree
);
358 if (t
&& TREE_CODE (t
) != INTEGER_CST
)
359 walk_tree (&TYPE_MAX_VALUE (new_tree
), copy_tree_body_r
, id
, NULL
);
363 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
364 walk_tree (&TYPE_ARG_TYPES (new_tree
), copy_tree_body_r
, id
, NULL
);
368 TREE_TYPE (new_tree
) = remap_type (TREE_TYPE (new_tree
), id
);
369 TYPE_DOMAIN (new_tree
) = remap_type (TYPE_DOMAIN (new_tree
), id
);
374 case QUAL_UNION_TYPE
:
378 for (f
= TYPE_FIELDS (new_tree
); f
; f
= TREE_CHAIN (f
))
380 t
= remap_decl (f
, id
);
381 DECL_CONTEXT (t
) = new_tree
;
385 TYPE_FIELDS (new_tree
) = nreverse (nf
);
391 /* Shouldn't have been thought variable sized. */
395 walk_tree (&TYPE_SIZE (new_tree
), copy_tree_body_r
, id
, NULL
);
396 walk_tree (&TYPE_SIZE_UNIT (new_tree
), copy_tree_body_r
, id
, NULL
);
402 remap_type (tree type
, copy_body_data
*id
)
410 /* See if we have remapped this type. */
411 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
415 /* The type only needs remapping if it's variably modified. */
416 if (! variably_modified_type_p (type
, id
->src_fn
))
418 insert_decl_map (id
, type
, type
);
422 id
->remapping_type_depth
++;
423 tmp
= remap_type_1 (type
, id
);
424 id
->remapping_type_depth
--;
429 /* Return previously remapped type of TYPE in ID. Return NULL if TYPE
430 is NULL or TYPE has not been remapped before. */
433 remapped_type (tree type
, copy_body_data
*id
)
440 /* See if we have remapped this type. */
441 node
= (tree
*) pointer_map_contains (id
->decl_map
, type
);
448 /* The type only needs remapping if it's variably modified. */
449 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
452 can_be_nonlocal (tree decl
, copy_body_data
*id
)
454 /* We can not duplicate function decls. */
455 if (TREE_CODE (decl
) == FUNCTION_DECL
)
458 /* Local static vars must be non-local or we get multiple declaration
460 if (TREE_CODE (decl
) == VAR_DECL
461 && !auto_var_in_fn_p (decl
, id
->src_fn
))
464 /* At the moment dwarf2out can handle only these types of nodes. We
465 can support more later. */
466 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != PARM_DECL
)
469 /* We must use global type. We call remapped_type instead of
470 remap_type since we don't want to remap this type here if it
471 hasn't been remapped before. */
472 if (TREE_TYPE (decl
) != remapped_type (TREE_TYPE (decl
), id
))
475 /* Wihtout SSA we can't tell if variable is used. */
476 if (!gimple_in_ssa_p (cfun
))
479 /* Live variables must be copied so we can attach DECL_RTL. */
487 remap_decls (tree decls
, VEC(tree
,gc
) **nonlocalized_list
, copy_body_data
*id
)
490 tree new_decls
= NULL_TREE
;
492 /* Remap its variables. */
493 for (old_var
= decls
; old_var
; old_var
= TREE_CHAIN (old_var
))
496 tree origin_var
= DECL_ORIGIN (old_var
);
498 if (can_be_nonlocal (old_var
, id
))
500 if (TREE_CODE (old_var
) == VAR_DECL
501 && (var_ann (old_var
) || !gimple_in_ssa_p (cfun
)))
502 cfun
->local_decls
= tree_cons (NULL_TREE
, old_var
,
504 if (debug_info_level
> DINFO_LEVEL_TERSE
505 && !DECL_IGNORED_P (old_var
)
506 && nonlocalized_list
)
507 VEC_safe_push (tree
, gc
, *nonlocalized_list
, origin_var
);
511 /* Remap the variable. */
512 new_var
= remap_decl (old_var
, id
);
514 /* If we didn't remap this variable, we can't mess with its
515 TREE_CHAIN. If we remapped this variable to the return slot, it's
516 already declared somewhere else, so don't declare it here. */
518 if (new_var
== id
->retvar
)
522 if (debug_info_level
> DINFO_LEVEL_TERSE
523 && !DECL_IGNORED_P (old_var
)
524 && nonlocalized_list
)
525 VEC_safe_push (tree
, gc
, *nonlocalized_list
, origin_var
);
529 gcc_assert (DECL_P (new_var
));
530 TREE_CHAIN (new_var
) = new_decls
;
535 return nreverse (new_decls
);
538 /* Copy the BLOCK to contain remapped versions of the variables
539 therein. And hook the new block into the block-tree. */
542 remap_block (tree
*block
, copy_body_data
*id
)
548 /* Make the new block. */
550 new_block
= make_node (BLOCK
);
551 TREE_USED (new_block
) = TREE_USED (old_block
);
552 BLOCK_ABSTRACT_ORIGIN (new_block
) = old_block
;
553 BLOCK_SOURCE_LOCATION (new_block
) = BLOCK_SOURCE_LOCATION (old_block
);
554 BLOCK_NONLOCALIZED_VARS (new_block
)
555 = VEC_copy (tree
, gc
, BLOCK_NONLOCALIZED_VARS (old_block
));
558 /* Remap its variables. */
559 BLOCK_VARS (new_block
) = remap_decls (BLOCK_VARS (old_block
),
560 &BLOCK_NONLOCALIZED_VARS (new_block
),
565 if (id
->transform_lang_insert_block
)
566 id
->transform_lang_insert_block (new_block
);
568 /* Remember the remapped block. */
569 insert_decl_map (id
, old_block
, new_block
);
572 /* Copy the whole block tree and root it in id->block. */
574 remap_blocks (tree block
, copy_body_data
*id
)
577 tree new_tree
= block
;
582 remap_block (&new_tree
, id
);
583 gcc_assert (new_tree
!= block
);
584 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
585 prepend_lexical_block (new_tree
, remap_blocks (t
, id
));
586 /* Blocks are in arbitrary order, but make things slightly prettier and do
587 not swap order when producing a copy. */
588 BLOCK_SUBBLOCKS (new_tree
) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree
));
593 copy_statement_list (tree
*tp
)
595 tree_stmt_iterator oi
, ni
;
598 new_tree
= alloc_stmt_list ();
599 ni
= tsi_start (new_tree
);
600 oi
= tsi_start (*tp
);
603 for (; !tsi_end_p (oi
); tsi_next (&oi
))
604 tsi_link_after (&ni
, tsi_stmt (oi
), TSI_NEW_STMT
);
608 copy_bind_expr (tree
*tp
, int *walk_subtrees
, copy_body_data
*id
)
610 tree block
= BIND_EXPR_BLOCK (*tp
);
611 /* Copy (and replace) the statement. */
612 copy_tree_r (tp
, walk_subtrees
, NULL
);
615 remap_block (&block
, id
);
616 BIND_EXPR_BLOCK (*tp
) = block
;
619 if (BIND_EXPR_VARS (*tp
))
620 /* This will remap a lot of the same decls again, but this should be
622 BIND_EXPR_VARS (*tp
) = remap_decls (BIND_EXPR_VARS (*tp
), NULL
, id
);
626 /* Create a new gimple_seq by remapping all the statements in BODY
627 using the inlining information in ID. */
630 remap_gimple_seq (gimple_seq body
, copy_body_data
*id
)
632 gimple_stmt_iterator si
;
633 gimple_seq new_body
= NULL
;
635 for (si
= gsi_start (body
); !gsi_end_p (si
); gsi_next (&si
))
637 gimple new_stmt
= remap_gimple_stmt (gsi_stmt (si
), id
);
638 gimple_seq_add_stmt (&new_body
, new_stmt
);
645 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
646 block using the mapping information in ID. */
649 copy_gimple_bind (gimple stmt
, copy_body_data
*id
)
652 tree new_block
, new_vars
;
653 gimple_seq body
, new_body
;
655 /* Copy the statement. Note that we purposely don't use copy_stmt
656 here because we need to remap statements as we copy. */
657 body
= gimple_bind_body (stmt
);
658 new_body
= remap_gimple_seq (body
, id
);
660 new_block
= gimple_bind_block (stmt
);
662 remap_block (&new_block
, id
);
664 /* This will remap a lot of the same decls again, but this should be
666 new_vars
= gimple_bind_vars (stmt
);
668 new_vars
= remap_decls (new_vars
, NULL
, id
);
670 new_bind
= gimple_build_bind (new_vars
, new_body
, new_block
);
676 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
677 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
678 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
679 recursing into the children nodes of *TP. */
682 remap_gimple_op_r (tree
*tp
, int *walk_subtrees
, void *data
)
684 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
685 copy_body_data
*id
= (copy_body_data
*) wi_p
->info
;
686 tree fn
= id
->src_fn
;
688 if (TREE_CODE (*tp
) == SSA_NAME
)
690 *tp
= remap_ssa_name (*tp
, id
);
694 else if (auto_var_in_fn_p (*tp
, fn
))
696 /* Local variables and labels need to be replaced by equivalent
697 variables. We don't want to copy static variables; there's
698 only one of those, no matter how many times we inline the
699 containing function. Similarly for globals from an outer
703 /* Remap the declaration. */
704 new_decl
= remap_decl (*tp
, id
);
705 gcc_assert (new_decl
);
706 /* Replace this variable with the copy. */
707 STRIP_TYPE_NOPS (new_decl
);
708 /* ??? The C++ frontend uses void * pointer zero to initialize
709 any other type. This confuses the middle-end type verification.
710 As cloned bodies do not go through gimplification again the fixup
711 there doesn't trigger. */
712 if (TREE_CODE (new_decl
) == INTEGER_CST
713 && !useless_type_conversion_p (TREE_TYPE (*tp
), TREE_TYPE (new_decl
)))
714 new_decl
= fold_convert (TREE_TYPE (*tp
), new_decl
);
718 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
720 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
722 else if (TREE_CODE (*tp
) == LABEL_DECL
723 && (!DECL_CONTEXT (*tp
)
724 || decl_function_context (*tp
) == id
->src_fn
))
725 /* These may need to be remapped for EH handling. */
726 *tp
= remap_decl (*tp
, id
);
727 else if (TYPE_P (*tp
))
728 /* Types may need remapping as well. */
729 *tp
= remap_type (*tp
, id
);
730 else if (CONSTANT_CLASS_P (*tp
))
732 /* If this is a constant, we have to copy the node iff the type
733 will be remapped. copy_tree_r will not copy a constant. */
734 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
736 if (new_type
== TREE_TYPE (*tp
))
739 else if (TREE_CODE (*tp
) == INTEGER_CST
)
740 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
741 TREE_INT_CST_HIGH (*tp
));
744 *tp
= copy_node (*tp
);
745 TREE_TYPE (*tp
) = new_type
;
750 /* Otherwise, just copy the node. Note that copy_tree_r already
751 knows not to copy VAR_DECLs, etc., so this is safe. */
752 if (TREE_CODE (*tp
) == INDIRECT_REF
)
754 /* Get rid of *& from inline substitutions that can happen when a
755 pointer argument is an ADDR_EXPR. */
756 tree decl
= TREE_OPERAND (*tp
, 0);
759 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
762 tree type
, new_tree
, old
;
764 /* If we happen to get an ADDR_EXPR in n->value, strip
765 it manually here as we'll eventually get ADDR_EXPRs
766 which lie about their types pointed to. In this case
767 build_fold_indirect_ref wouldn't strip the
768 INDIRECT_REF, but we absolutely rely on that. As
769 fold_indirect_ref does other useful transformations,
770 try that first, though. */
771 type
= TREE_TYPE (TREE_TYPE (*n
));
772 new_tree
= unshare_expr (*n
);
774 *tp
= gimple_fold_indirect_ref (new_tree
);
777 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
779 *tp
= fold_indirect_ref_1 (type
, new_tree
);
780 /* ??? We should either assert here or build
781 a VIEW_CONVERT_EXPR instead of blindly leaking
782 incompatible types to our IL. */
784 *tp
= TREE_OPERAND (new_tree
, 0);
788 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
789 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
790 TREE_NO_WARNING (*tp
) = TREE_NO_WARNING (old
);
798 /* Here is the "usual case". Copy this tree node, and then
799 tweak some special cases. */
800 copy_tree_r (tp
, walk_subtrees
, NULL
);
802 /* Global variables we haven't seen yet need to go into referenced
803 vars. If not referenced from types only. */
804 if (gimple_in_ssa_p (cfun
)
805 && TREE_CODE (*tp
) == VAR_DECL
806 && id
->remapping_type_depth
== 0)
807 add_referenced_var (*tp
);
809 /* We should never have TREE_BLOCK set on non-statements. */
811 gcc_assert (!TREE_BLOCK (*tp
));
813 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
814 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
816 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
818 /* The copied TARGET_EXPR has never been expanded, even if the
819 original node was expanded already. */
820 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
821 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
823 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
825 /* Variable substitution need not be simple. In particular,
826 the INDIRECT_REF substitution above. Make sure that
827 TREE_CONSTANT and friends are up-to-date. But make sure
828 to not improperly set TREE_BLOCK on some sub-expressions. */
829 int invariant
= is_gimple_min_invariant (*tp
);
830 tree block
= id
->block
;
831 id
->block
= NULL_TREE
;
832 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
835 /* Handle the case where we substituted an INDIRECT_REF
836 into the operand of the ADDR_EXPR. */
837 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
838 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
840 recompute_tree_invariant_for_addr_expr (*tp
);
842 /* If this used to be invariant, but is not any longer,
843 then regimplification is probably needed. */
844 if (invariant
&& !is_gimple_min_invariant (*tp
))
845 id
->regimplify
= true;
851 /* Keep iterating. */
856 /* Called from copy_body_id via walk_tree. DATA is really a
857 `copy_body_data *'. */
860 copy_tree_body_r (tree
*tp
, int *walk_subtrees
, void *data
)
862 copy_body_data
*id
= (copy_body_data
*) data
;
863 tree fn
= id
->src_fn
;
866 /* Begin by recognizing trees that we'll completely rewrite for the
867 inlining context. Our output for these trees is completely
868 different from out input (e.g. RETURN_EXPR is deleted, and morphs
869 into an edge). Further down, we'll handle trees that get
870 duplicated and/or tweaked. */
872 /* When requested, RETURN_EXPRs should be transformed to just the
873 contained MODIFY_EXPR. The branch semantics of the return will
874 be handled elsewhere by manipulating the CFG rather than a statement. */
875 if (TREE_CODE (*tp
) == RETURN_EXPR
&& id
->transform_return_to_modify
)
877 tree assignment
= TREE_OPERAND (*tp
, 0);
879 /* If we're returning something, just turn that into an
880 assignment into the equivalent of the original RESULT_DECL.
881 If the "assignment" is just the result decl, the result
882 decl has already been set (e.g. a recent "foo (&result_decl,
883 ...)"); just toss the entire RETURN_EXPR. */
884 if (assignment
&& TREE_CODE (assignment
) == MODIFY_EXPR
)
886 /* Replace the RETURN_EXPR with (a copy of) the
887 MODIFY_EXPR hanging underneath. */
888 *tp
= copy_node (assignment
);
890 else /* Else the RETURN_EXPR returns no value. */
893 return (tree
) (void *)1;
896 else if (TREE_CODE (*tp
) == SSA_NAME
)
898 *tp
= remap_ssa_name (*tp
, id
);
903 /* Local variables and labels need to be replaced by equivalent
904 variables. We don't want to copy static variables; there's only
905 one of those, no matter how many times we inline the containing
906 function. Similarly for globals from an outer function. */
907 else if (auto_var_in_fn_p (*tp
, fn
))
911 /* Remap the declaration. */
912 new_decl
= remap_decl (*tp
, id
);
913 gcc_assert (new_decl
);
914 /* Replace this variable with the copy. */
915 STRIP_TYPE_NOPS (new_decl
);
919 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
920 copy_statement_list (tp
);
921 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
922 remap_save_expr (tp
, id
->decl_map
, walk_subtrees
);
923 else if (TREE_CODE (*tp
) == LABEL_DECL
924 && (! DECL_CONTEXT (*tp
)
925 || decl_function_context (*tp
) == id
->src_fn
))
926 /* These may need to be remapped for EH handling. */
927 *tp
= remap_decl (*tp
, id
);
928 else if (TREE_CODE (*tp
) == BIND_EXPR
)
929 copy_bind_expr (tp
, walk_subtrees
, id
);
930 /* Types may need remapping as well. */
931 else if (TYPE_P (*tp
))
932 *tp
= remap_type (*tp
, id
);
934 /* If this is a constant, we have to copy the node iff the type will be
935 remapped. copy_tree_r will not copy a constant. */
936 else if (CONSTANT_CLASS_P (*tp
))
938 tree new_type
= remap_type (TREE_TYPE (*tp
), id
);
940 if (new_type
== TREE_TYPE (*tp
))
943 else if (TREE_CODE (*tp
) == INTEGER_CST
)
944 *tp
= build_int_cst_wide (new_type
, TREE_INT_CST_LOW (*tp
),
945 TREE_INT_CST_HIGH (*tp
));
948 *tp
= copy_node (*tp
);
949 TREE_TYPE (*tp
) = new_type
;
953 /* Otherwise, just copy the node. Note that copy_tree_r already
954 knows not to copy VAR_DECLs, etc., so this is safe. */
957 /* Here we handle trees that are not completely rewritten.
958 First we detect some inlining-induced bogosities for
960 if (TREE_CODE (*tp
) == MODIFY_EXPR
961 && TREE_OPERAND (*tp
, 0) == TREE_OPERAND (*tp
, 1)
962 && (auto_var_in_fn_p (TREE_OPERAND (*tp
, 0), fn
)))
964 /* Some assignments VAR = VAR; don't generate any rtl code
965 and thus don't count as variable modification. Avoid
966 keeping bogosities like 0 = 0. */
967 tree decl
= TREE_OPERAND (*tp
, 0), value
;
970 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
974 STRIP_TYPE_NOPS (value
);
975 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
977 *tp
= build_empty_stmt ();
978 return copy_tree_body_r (tp
, walk_subtrees
, data
);
982 else if (TREE_CODE (*tp
) == INDIRECT_REF
)
984 /* Get rid of *& from inline substitutions that can happen when a
985 pointer argument is an ADDR_EXPR. */
986 tree decl
= TREE_OPERAND (*tp
, 0);
989 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
994 /* If we happen to get an ADDR_EXPR in n->value, strip
995 it manually here as we'll eventually get ADDR_EXPRs
996 which lie about their types pointed to. In this case
997 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
998 but we absolutely rely on that. As fold_indirect_ref
999 does other useful transformations, try that first, though. */
1000 tree type
= TREE_TYPE (TREE_TYPE (*n
));
1001 new_tree
= unshare_expr (*n
);
1003 *tp
= gimple_fold_indirect_ref (new_tree
);
1006 if (TREE_CODE (new_tree
) == ADDR_EXPR
)
1008 *tp
= fold_indirect_ref_1 (type
, new_tree
);
1009 /* ??? We should either assert here or build
1010 a VIEW_CONVERT_EXPR instead of blindly leaking
1011 incompatible types to our IL. */
1013 *tp
= TREE_OPERAND (new_tree
, 0);
1017 *tp
= build1 (INDIRECT_REF
, type
, new_tree
);
1018 TREE_THIS_VOLATILE (*tp
) = TREE_THIS_VOLATILE (old
);
1019 TREE_SIDE_EFFECTS (*tp
) = TREE_SIDE_EFFECTS (old
);
1027 /* Here is the "usual case". Copy this tree node, and then
1028 tweak some special cases. */
1029 copy_tree_r (tp
, walk_subtrees
, NULL
);
1031 /* Global variables we haven't seen yet needs to go into referenced
1032 vars. If not referenced from types only. */
1033 if (gimple_in_ssa_p (cfun
)
1034 && TREE_CODE (*tp
) == VAR_DECL
1035 && id
->remapping_type_depth
== 0)
1036 add_referenced_var (*tp
);
1038 /* If EXPR has block defined, map it to newly constructed block.
1039 When inlining we want EXPRs without block appear in the block
1040 of function call. */
1043 new_block
= id
->block
;
1044 if (TREE_BLOCK (*tp
))
1047 n
= (tree
*) pointer_map_contains (id
->decl_map
,
1052 TREE_BLOCK (*tp
) = new_block
;
1055 if (TREE_CODE (*tp
) == RESX_EXPR
&& id
->eh_region_offset
)
1056 TREE_OPERAND (*tp
, 0) =
1057 build_int_cst (NULL_TREE
,
1058 id
->eh_region_offset
1059 + TREE_INT_CST_LOW (TREE_OPERAND (*tp
, 0)));
1061 if (TREE_CODE (*tp
) != OMP_CLAUSE
)
1062 TREE_TYPE (*tp
) = remap_type (TREE_TYPE (*tp
), id
);
1064 /* The copied TARGET_EXPR has never been expanded, even if the
1065 original node was expanded already. */
1066 if (TREE_CODE (*tp
) == TARGET_EXPR
&& TREE_OPERAND (*tp
, 3))
1068 TREE_OPERAND (*tp
, 1) = TREE_OPERAND (*tp
, 3);
1069 TREE_OPERAND (*tp
, 3) = NULL_TREE
;
1072 /* Variable substitution need not be simple. In particular, the
1073 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1074 and friends are up-to-date. */
1075 else if (TREE_CODE (*tp
) == ADDR_EXPR
)
1077 int invariant
= is_gimple_min_invariant (*tp
);
1078 walk_tree (&TREE_OPERAND (*tp
, 0), copy_tree_body_r
, id
, NULL
);
1080 /* Handle the case where we substituted an INDIRECT_REF
1081 into the operand of the ADDR_EXPR. */
1082 if (TREE_CODE (TREE_OPERAND (*tp
, 0)) == INDIRECT_REF
)
1083 *tp
= TREE_OPERAND (TREE_OPERAND (*tp
, 0), 0);
1085 recompute_tree_invariant_for_addr_expr (*tp
);
1087 /* If this used to be invariant, but is not any longer,
1088 then regimplification is probably needed. */
1089 if (invariant
&& !is_gimple_min_invariant (*tp
))
1090 id
->regimplify
= true;
1096 /* Keep iterating. */
1101 /* Helper for copy_bb. Remap statement STMT using the inlining
1102 information in ID. Return the new statement copy. */
1105 remap_gimple_stmt (gimple stmt
, copy_body_data
*id
)
1108 struct walk_stmt_info wi
;
1110 bool skip_first
= false;
1112 /* Begin by recognizing trees that we'll completely rewrite for the
1113 inlining context. Our output for these trees is completely
1114 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1115 into an edge). Further down, we'll handle trees that get
1116 duplicated and/or tweaked. */
1118 /* When requested, GIMPLE_RETURNs should be transformed to just the
1119 contained GIMPLE_ASSIGN. The branch semantics of the return will
1120 be handled elsewhere by manipulating the CFG rather than the
1122 if (gimple_code (stmt
) == GIMPLE_RETURN
&& id
->transform_return_to_modify
)
1124 tree retval
= gimple_return_retval (stmt
);
1126 /* If we're returning something, just turn that into an
1127 assignment into the equivalent of the original RESULT_DECL.
1128 If RETVAL is just the result decl, the result decl has
1129 already been set (e.g. a recent "foo (&result_decl, ...)");
1130 just toss the entire GIMPLE_RETURN. */
1131 if (retval
&& TREE_CODE (retval
) != RESULT_DECL
)
1133 copy
= gimple_build_assign (id
->retvar
, retval
);
1134 /* id->retvar is already substituted. Skip it on later remapping. */
1138 return gimple_build_nop ();
1140 else if (gimple_has_substatements (stmt
))
1144 /* When cloning bodies from the C++ front end, we will be handed bodies
1145 in High GIMPLE form. Handle here all the High GIMPLE statements that
1146 have embedded statements. */
1147 switch (gimple_code (stmt
))
1150 copy
= copy_gimple_bind (stmt
, id
);
1154 s1
= remap_gimple_seq (gimple_catch_handler (stmt
), id
);
1155 copy
= gimple_build_catch (gimple_catch_types (stmt
), s1
);
1158 case GIMPLE_EH_FILTER
:
1159 s1
= remap_gimple_seq (gimple_eh_filter_failure (stmt
), id
);
1160 copy
= gimple_build_eh_filter (gimple_eh_filter_types (stmt
), s1
);
1164 s1
= remap_gimple_seq (gimple_try_eval (stmt
), id
);
1165 s2
= remap_gimple_seq (gimple_try_cleanup (stmt
), id
);
1166 copy
= gimple_build_try (s1
, s2
, gimple_try_kind (stmt
));
1169 case GIMPLE_WITH_CLEANUP_EXPR
:
1170 s1
= remap_gimple_seq (gimple_wce_cleanup (stmt
), id
);
1171 copy
= gimple_build_wce (s1
);
1174 case GIMPLE_OMP_PARALLEL
:
1175 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1176 copy
= gimple_build_omp_parallel
1178 gimple_omp_parallel_clauses (stmt
),
1179 gimple_omp_parallel_child_fn (stmt
),
1180 gimple_omp_parallel_data_arg (stmt
));
1183 case GIMPLE_OMP_TASK
:
1184 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1185 copy
= gimple_build_omp_task
1187 gimple_omp_task_clauses (stmt
),
1188 gimple_omp_task_child_fn (stmt
),
1189 gimple_omp_task_data_arg (stmt
),
1190 gimple_omp_task_copy_fn (stmt
),
1191 gimple_omp_task_arg_size (stmt
),
1192 gimple_omp_task_arg_align (stmt
));
1195 case GIMPLE_OMP_FOR
:
1196 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1197 s2
= remap_gimple_seq (gimple_omp_for_pre_body (stmt
), id
);
1198 copy
= gimple_build_omp_for (s1
, gimple_omp_for_clauses (stmt
),
1199 gimple_omp_for_collapse (stmt
), s2
);
1202 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1204 gimple_omp_for_set_index (copy
, i
,
1205 gimple_omp_for_index (stmt
, i
));
1206 gimple_omp_for_set_initial (copy
, i
,
1207 gimple_omp_for_initial (stmt
, i
));
1208 gimple_omp_for_set_final (copy
, i
,
1209 gimple_omp_for_final (stmt
, i
));
1210 gimple_omp_for_set_incr (copy
, i
,
1211 gimple_omp_for_incr (stmt
, i
));
1212 gimple_omp_for_set_cond (copy
, i
,
1213 gimple_omp_for_cond (stmt
, i
));
1218 case GIMPLE_OMP_MASTER
:
1219 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1220 copy
= gimple_build_omp_master (s1
);
1223 case GIMPLE_OMP_ORDERED
:
1224 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1225 copy
= gimple_build_omp_ordered (s1
);
1228 case GIMPLE_OMP_SECTION
:
1229 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1230 copy
= gimple_build_omp_section (s1
);
1233 case GIMPLE_OMP_SECTIONS
:
1234 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1235 copy
= gimple_build_omp_sections
1236 (s1
, gimple_omp_sections_clauses (stmt
));
1239 case GIMPLE_OMP_SINGLE
:
1240 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1241 copy
= gimple_build_omp_single
1242 (s1
, gimple_omp_single_clauses (stmt
));
1245 case GIMPLE_OMP_CRITICAL
:
1246 s1
= remap_gimple_seq (gimple_omp_body (stmt
), id
);
1248 = gimple_build_omp_critical (s1
, gimple_omp_critical_name (stmt
));
1257 if (gimple_assign_copy_p (stmt
)
1258 && gimple_assign_lhs (stmt
) == gimple_assign_rhs1 (stmt
)
1259 && auto_var_in_fn_p (gimple_assign_lhs (stmt
), id
->src_fn
))
1261 /* Here we handle statements that are not completely rewritten.
1262 First we detect some inlining-induced bogosities for
1265 /* Some assignments VAR = VAR; don't generate any rtl code
1266 and thus don't count as variable modification. Avoid
1267 keeping bogosities like 0 = 0. */
1268 tree decl
= gimple_assign_lhs (stmt
), value
;
1271 n
= (tree
*) pointer_map_contains (id
->decl_map
, decl
);
1275 STRIP_TYPE_NOPS (value
);
1276 if (TREE_CONSTANT (value
) || TREE_READONLY (value
))
1277 return gimple_build_nop ();
1281 /* Create a new deep copy of the statement. */
1282 copy
= gimple_copy (stmt
);
1285 /* If STMT has a block defined, map it to the newly constructed
1286 block. When inlining we want statements without a block to
1287 appear in the block of the function call. */
1288 new_block
= id
->block
;
1289 if (gimple_block (copy
))
1292 n
= (tree
*) pointer_map_contains (id
->decl_map
, gimple_block (copy
));
1297 gimple_set_block (copy
, new_block
);
1299 /* Remap all the operands in COPY. */
1300 memset (&wi
, 0, sizeof (wi
));
1303 walk_tree (gimple_op_ptr (copy
, 1), remap_gimple_op_r
, &wi
, NULL
);
1305 walk_gimple_op (copy
, remap_gimple_op_r
, &wi
);
1307 /* Clear the copied virtual operands. We are not remapping them here
1308 but are going to recreate them from scratch. */
1309 if (gimple_has_mem_ops (copy
))
1311 gimple_set_vdef (copy
, NULL_TREE
);
1312 gimple_set_vuse (copy
, NULL_TREE
);
1315 /* We have to handle EH region remapping of GIMPLE_RESX specially because
1316 the region number is not an operand. */
1317 if (gimple_code (stmt
) == GIMPLE_RESX
&& id
->eh_region_offset
)
1319 gimple_resx_set_region (copy
, gimple_resx_region (stmt
) + id
->eh_region_offset
);
1325 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1329 copy_bb (copy_body_data
*id
, basic_block bb
, int frequency_scale
,
1330 gcov_type count_scale
)
1332 gimple_stmt_iterator gsi
, copy_gsi
, seq_gsi
;
1333 basic_block copy_basic_block
;
1336 /* create_basic_block() will append every new block to
1337 basic_block_info automatically. */
1338 copy_basic_block
= create_basic_block (NULL
, (void *) 0,
1339 (basic_block
) bb
->prev_bb
->aux
);
1340 copy_basic_block
->count
= bb
->count
* count_scale
/ REG_BR_PROB_BASE
;
1342 /* We are going to rebuild frequencies from scratch. These values
1343 have just small importance to drive canonicalize_loop_headers. */
1344 copy_basic_block
->frequency
= ((gcov_type
)bb
->frequency
1345 * frequency_scale
/ REG_BR_PROB_BASE
);
1347 if (copy_basic_block
->frequency
> BB_FREQ_MAX
)
1348 copy_basic_block
->frequency
= BB_FREQ_MAX
;
1350 copy_gsi
= gsi_start_bb (copy_basic_block
);
1352 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1354 gimple stmt
= gsi_stmt (gsi
);
1355 gimple orig_stmt
= stmt
;
1357 id
->regimplify
= false;
1358 stmt
= remap_gimple_stmt (stmt
, id
);
1359 if (gimple_nop_p (stmt
))
1362 gimple_duplicate_stmt_histograms (cfun
, stmt
, id
->src_cfun
, orig_stmt
);
1365 /* With return slot optimization we can end up with
1366 non-gimple (foo *)&this->m, fix that here. */
1367 if (is_gimple_assign (stmt
)
1368 && gimple_assign_rhs_code (stmt
) == NOP_EXPR
1369 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
1372 new_rhs
= force_gimple_operand_gsi (&seq_gsi
,
1373 gimple_assign_rhs1 (stmt
),
1374 true, NULL
, true, GSI_SAME_STMT
);
1375 gimple_assign_set_rhs1 (stmt
, new_rhs
);
1376 id
->regimplify
= false;
1379 gsi_insert_after (&seq_gsi
, stmt
, GSI_NEW_STMT
);
1382 gimple_regimplify_operands (stmt
, &seq_gsi
);
1384 /* If copy_basic_block has been empty at the start of this iteration,
1385 call gsi_start_bb again to get at the newly added statements. */
1386 if (gsi_end_p (copy_gsi
))
1387 copy_gsi
= gsi_start_bb (copy_basic_block
);
1389 gsi_next (©_gsi
);
1391 /* Process the new statement. The call to gimple_regimplify_operands
1392 possibly turned the statement into multiple statements, we
1393 need to process all of them. */
1398 stmt
= gsi_stmt (copy_gsi
);
1399 if (is_gimple_call (stmt
)
1400 && gimple_call_va_arg_pack_p (stmt
)
1403 /* __builtin_va_arg_pack () should be replaced by
1404 all arguments corresponding to ... in the caller. */
1407 VEC(tree
, heap
) *argarray
;
1408 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1411 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= TREE_CHAIN (p
))
1414 /* Create the new array of arguments. */
1415 n
= nargs
+ gimple_call_num_args (stmt
);
1416 argarray
= VEC_alloc (tree
, heap
, n
);
1417 VEC_safe_grow (tree
, heap
, argarray
, n
);
1419 /* Copy all the arguments before '...' */
1420 memcpy (VEC_address (tree
, argarray
),
1421 gimple_call_arg_ptr (stmt
, 0),
1422 gimple_call_num_args (stmt
) * sizeof (tree
));
1424 /* Append the arguments passed in '...' */
1425 memcpy (VEC_address(tree
, argarray
) + gimple_call_num_args (stmt
),
1426 gimple_call_arg_ptr (id
->gimple_call
, 0)
1427 + (gimple_call_num_args (id
->gimple_call
) - nargs
),
1428 nargs
* sizeof (tree
));
1430 new_call
= gimple_build_call_vec (gimple_call_fn (stmt
),
1433 VEC_free (tree
, heap
, argarray
);
1435 /* Copy all GIMPLE_CALL flags, location and block, except
1436 GF_CALL_VA_ARG_PACK. */
1437 gimple_call_copy_flags (new_call
, stmt
);
1438 gimple_call_set_va_arg_pack (new_call
, false);
1439 gimple_set_location (new_call
, gimple_location (stmt
));
1440 gimple_set_block (new_call
, gimple_block (stmt
));
1441 gimple_call_set_lhs (new_call
, gimple_call_lhs (stmt
));
1443 gsi_replace (©_gsi
, new_call
, false);
1444 gimple_set_bb (stmt
, NULL
);
1447 else if (is_gimple_call (stmt
)
1449 && (decl
= gimple_call_fndecl (stmt
))
1450 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1451 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_ARG_PACK_LEN
)
1453 /* __builtin_va_arg_pack_len () should be replaced by
1454 the number of anonymous arguments. */
1455 size_t nargs
= gimple_call_num_args (id
->gimple_call
);
1459 for (p
= DECL_ARGUMENTS (id
->src_fn
); p
; p
= TREE_CHAIN (p
))
1462 count
= build_int_cst (integer_type_node
, nargs
);
1463 new_stmt
= gimple_build_assign (gimple_call_lhs (stmt
), count
);
1464 gsi_replace (©_gsi
, new_stmt
, false);
1468 /* Statements produced by inlining can be unfolded, especially
1469 when we constant propagated some operands. We can't fold
1470 them right now for two reasons:
1471 1) folding require SSA_NAME_DEF_STMTs to be correct
1472 2) we can't change function calls to builtins.
1473 So we just mark statement for later folding. We mark
1474 all new statements, instead just statements that has changed
1475 by some nontrivial substitution so even statements made
1476 foldable indirectly are updated. If this turns out to be
1477 expensive, copy_body can be told to watch for nontrivial
1479 if (id
->statements_to_fold
)
1480 pointer_set_insert (id
->statements_to_fold
, stmt
);
1482 /* We're duplicating a CALL_EXPR. Find any corresponding
1483 callgraph edges and update or duplicate them. */
1484 if (is_gimple_call (stmt
))
1486 struct cgraph_edge
*edge
= cgraph_edge (id
->src_node
, orig_stmt
);
1489 switch (id
->transform_call_graph_edges
)
1491 case CB_CGE_DUPLICATE
:
1493 cgraph_clone_edge (edge
, id
->dst_node
, stmt
,
1494 REG_BR_PROB_BASE
, 1,
1495 edge
->frequency
, true);
1498 case CB_CGE_MOVE_CLONES
:
1499 cgraph_set_call_stmt_including_clones (id
->dst_node
, orig_stmt
, stmt
);
1504 cgraph_set_call_stmt (edge
, stmt
);
1511 /* Constant propagation on argument done during inlining
1512 may create new direct call. Produce an edge for it. */
1513 if (!edge
&& is_gimple_call (stmt
)
1514 && (fn
= gimple_call_fndecl (stmt
)) != NULL
1515 && !cgraph_edge (id
->dst_node
, stmt
))
1517 struct cgraph_node
*dest
= cgraph_node (fn
);
1519 /* We have missing edge in the callgraph. This can happen in one case
1520 where previous inlining turned indirect call into direct call by
1521 constant propagating arguments. In all other cases we hit a bug
1522 (incorrect node sharing is most common reason for missing edges. */
1523 gcc_assert (dest
->needed
|| !dest
->analyzed
);
1524 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
)
1525 cgraph_create_edge_including_clones (id
->dst_node
, dest
, stmt
,
1527 compute_call_stmt_bb_frequency (id
->dst_node
->decl
, bb
),
1529 CIF_ORIGINALLY_INDIRECT_CALL
);
1531 cgraph_create_edge (id
->dst_node
, dest
, stmt
,
1532 bb
->count
, CGRAPH_FREQ_BASE
,
1533 bb
->loop_depth
)->inline_failed
1534 = CIF_ORIGINALLY_INDIRECT_CALL
;
1537 fprintf (dump_file
, "Created new direct edge to %s",
1538 cgraph_node_name (dest
));
1542 flags
= gimple_call_flags (stmt
);
1544 if (flags
& ECF_MAY_BE_ALLOCA
)
1545 cfun
->calls_alloca
= true;
1546 if (flags
& ECF_RETURNS_TWICE
)
1547 cfun
->calls_setjmp
= true;
1550 /* If you think we can abort here, you are wrong.
1551 There is no region 0 in gimple. */
1552 gcc_assert (lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
) != 0);
1554 if (stmt_could_throw_p (stmt
)
1555 /* When we are cloning for inlining, we are supposed to
1556 construct a clone that calls precisely the same functions
1557 as original. However IPA optimizers might've proved
1558 earlier some function calls as non-trapping that might
1559 render some basic blocks dead that might become
1562 We can't update SSA with unreachable blocks in CFG and thus
1563 we prevent the scenario by preserving even the "dead" eh
1564 edges until the point they are later removed by
1566 || (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
1567 && lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
) > 0))
1569 int region
= lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
);
1571 /* Add an entry for the copied tree in the EH hashtable.
1572 When cloning or versioning, use the hashtable in
1573 cfun, and just copy the EH number. When inlining, use the
1574 hashtable in the caller, and adjust the region number. */
1576 add_stmt_to_eh_region (stmt
, region
+ id
->eh_region_offset
);
1578 /* If this tree doesn't have a region associated with it,
1579 and there is a "current region,"
1580 then associate this tree with the current region
1581 and add edges associated with this region. */
1582 if (lookup_stmt_eh_region_fn (id
->src_cfun
, orig_stmt
) <= 0
1583 && id
->eh_region
> 0
1584 && stmt_could_throw_p (stmt
))
1585 add_stmt_to_eh_region (stmt
, id
->eh_region
);
1588 if (gimple_in_ssa_p (cfun
))
1593 find_new_referenced_vars (gsi_stmt (copy_gsi
));
1594 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, i
, SSA_OP_DEF
)
1595 if (TREE_CODE (def
) == SSA_NAME
)
1596 SSA_NAME_DEF_STMT (def
) = stmt
;
1599 gsi_next (©_gsi
);
1601 while (!gsi_end_p (copy_gsi
));
1603 copy_gsi
= gsi_last_bb (copy_basic_block
);
1606 return copy_basic_block
;
1609 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1610 form is quite easy, since dominator relationship for old basic blocks does
1613 There is however exception where inlining might change dominator relation
1614 across EH edges from basic block within inlined functions destinating
1615 to landing pads in function we inline into.
1617 The function fills in PHI_RESULTs of such PHI nodes if they refer
1618 to gimple regs. Otherwise, the function mark PHI_RESULT of such
1619 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
1620 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1621 set, and this means that there will be no overlapping live ranges
1622 for the underlying symbol.
1624 This might change in future if we allow redirecting of EH edges and
1625 we might want to change way build CFG pre-inlining to include
1626 all the possible edges then. */
1628 update_ssa_across_abnormal_edges (basic_block bb
, basic_block ret_bb
,
1629 bool can_throw
, bool nonlocal_goto
)
1634 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1636 || ((basic_block
)e
->dest
->aux
)->index
== ENTRY_BLOCK
)
1639 gimple_stmt_iterator si
;
1642 gcc_assert (e
->flags
& EDGE_EH
);
1645 gcc_assert (!(e
->flags
& EDGE_EH
));
1647 for (si
= gsi_start_phis (e
->dest
); !gsi_end_p (si
); gsi_next (&si
))
1651 phi
= gsi_stmt (si
);
1653 /* There shouldn't be any PHI nodes in the ENTRY_BLOCK. */
1654 gcc_assert (!e
->dest
->aux
);
1656 gcc_assert ((e
->flags
& EDGE_EH
)
1657 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi
)));
1659 if (!is_gimple_reg (PHI_RESULT (phi
)))
1661 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi
)));
1665 re
= find_edge (ret_bb
, e
->dest
);
1667 gcc_assert ((re
->flags
& (EDGE_EH
| EDGE_ABNORMAL
))
1668 == (e
->flags
& (EDGE_EH
| EDGE_ABNORMAL
)));
1670 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, e
),
1671 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi
, re
)));
1677 /* Copy edges from BB into its copy constructed earlier, scale profile
1678 accordingly. Edges will be taken care of later. Assume aux
1679 pointers to point to the copies of each BB. */
1682 copy_edges_for_bb (basic_block bb
, gcov_type count_scale
, basic_block ret_bb
)
1684 basic_block new_bb
= (basic_block
) bb
->aux
;
1687 gimple_stmt_iterator si
;
1690 /* Use the indices from the original blocks to create edges for the
1692 FOR_EACH_EDGE (old_edge
, ei
, bb
->succs
)
1693 if (!(old_edge
->flags
& EDGE_EH
))
1697 flags
= old_edge
->flags
;
1699 /* Return edges do get a FALLTHRU flag when the get inlined. */
1700 if (old_edge
->dest
->index
== EXIT_BLOCK
&& !old_edge
->flags
1701 && old_edge
->dest
->aux
!= EXIT_BLOCK_PTR
)
1702 flags
|= EDGE_FALLTHRU
;
1703 new_edge
= make_edge (new_bb
, (basic_block
) old_edge
->dest
->aux
, flags
);
1704 new_edge
->count
= old_edge
->count
* count_scale
/ REG_BR_PROB_BASE
;
1705 new_edge
->probability
= old_edge
->probability
;
1708 if (bb
->index
== ENTRY_BLOCK
|| bb
->index
== EXIT_BLOCK
)
1711 for (si
= gsi_start_bb (new_bb
); !gsi_end_p (si
);)
1714 bool can_throw
, nonlocal_goto
;
1716 copy_stmt
= gsi_stmt (si
);
1717 update_stmt (copy_stmt
);
1718 if (gimple_in_ssa_p (cfun
))
1719 mark_symbols_for_renaming (copy_stmt
);
1721 /* Do this before the possible split_block. */
1724 /* If this tree could throw an exception, there are two
1725 cases where we need to add abnormal edge(s): the
1726 tree wasn't in a region and there is a "current
1727 region" in the caller; or the original tree had
1728 EH edges. In both cases split the block after the tree,
1729 and add abnormal edge(s) as needed; we need both
1730 those from the callee and the caller.
1731 We check whether the copy can throw, because the const
1732 propagation can change an INDIRECT_REF which throws
1733 into a COMPONENT_REF which doesn't. If the copy
1734 can throw, the original could also throw. */
1735 can_throw
= stmt_can_throw_internal (copy_stmt
);
1736 nonlocal_goto
= stmt_can_make_abnormal_goto (copy_stmt
);
1738 if (can_throw
|| nonlocal_goto
)
1740 if (!gsi_end_p (si
))
1741 /* Note that bb's predecessor edges aren't necessarily
1742 right at this point; split_block doesn't care. */
1744 edge e
= split_block (new_bb
, copy_stmt
);
1747 new_bb
->aux
= e
->src
->aux
;
1748 si
= gsi_start_bb (new_bb
);
1753 make_eh_edges (copy_stmt
);
1756 make_abnormal_goto_edges (gimple_bb (copy_stmt
), true);
1758 if ((can_throw
|| nonlocal_goto
)
1759 && gimple_in_ssa_p (cfun
))
1760 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt
), ret_bb
,
1761 can_throw
, nonlocal_goto
);
1765 /* Copy the PHIs. All blocks and edges are copied, some blocks
1766 was possibly split and new outgoing EH edges inserted.
1767 BB points to the block of original function and AUX pointers links
1768 the original and newly copied blocks. */
1771 copy_phis_for_bb (basic_block bb
, copy_body_data
*id
)
1773 basic_block
const new_bb
= (basic_block
) bb
->aux
;
1776 gimple_stmt_iterator si
;
1778 for (si
= gsi_start (phi_nodes (bb
)); !gsi_end_p (si
); gsi_next (&si
))
1784 phi
= gsi_stmt (si
);
1785 res
= PHI_RESULT (phi
);
1787 if (is_gimple_reg (res
))
1789 walk_tree (&new_res
, copy_tree_body_r
, id
, NULL
);
1790 SSA_NAME_DEF_STMT (new_res
)
1791 = new_phi
= create_phi_node (new_res
, new_bb
);
1792 FOR_EACH_EDGE (new_edge
, ei
, new_bb
->preds
)
1795 = find_edge ((basic_block
) new_edge
->src
->aux
, bb
);
1796 tree arg
= PHI_ARG_DEF_FROM_EDGE (phi
, old_edge
);
1798 tree block
= id
->block
;
1799 id
->block
= NULL_TREE
;
1800 walk_tree (&new_arg
, copy_tree_body_r
, id
, NULL
);
1802 gcc_assert (new_arg
);
1803 /* With return slot optimization we can end up with
1804 non-gimple (foo *)&this->m, fix that here. */
1805 if (TREE_CODE (new_arg
) != SSA_NAME
1806 && TREE_CODE (new_arg
) != FUNCTION_DECL
1807 && !is_gimple_val (new_arg
))
1809 gimple_seq stmts
= NULL
;
1810 new_arg
= force_gimple_operand (new_arg
, &stmts
, true, NULL
);
1811 gsi_insert_seq_on_edge_immediate (new_edge
, stmts
);
1813 add_phi_arg (new_phi
, new_arg
, new_edge
);
1820 /* Wrapper for remap_decl so it can be used as a callback. */
1823 remap_decl_1 (tree decl
, void *data
)
1825 return remap_decl (decl
, (copy_body_data
*) data
);
1828 /* Build struct function and associated datastructures for the new clone
1829 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1832 initialize_cfun (tree new_fndecl
, tree callee_fndecl
, gcov_type count
,
1835 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
1836 gcov_type count_scale
, frequency_scale
;
1838 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
1839 count_scale
= (REG_BR_PROB_BASE
* count
1840 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
1844 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
)
1845 frequency_scale
= (REG_BR_PROB_BASE
* frequency
1847 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
);
1849 frequency_scale
= count_scale
;
1851 /* Register specific tree functions. */
1852 gimple_register_cfg_hooks ();
1854 /* Get clean struct function. */
1855 push_struct_function (new_fndecl
);
1857 /* We will rebuild these, so just sanity check that they are empty. */
1858 gcc_assert (VALUE_HISTOGRAMS (cfun
) == NULL
);
1859 gcc_assert (cfun
->local_decls
== NULL
);
1860 gcc_assert (cfun
->cfg
== NULL
);
1861 gcc_assert (cfun
->decl
== new_fndecl
);
1863 /* Copy items we preserve during clonning. */
1864 cfun
->static_chain_decl
= src_cfun
->static_chain_decl
;
1865 cfun
->nonlocal_goto_save_area
= src_cfun
->nonlocal_goto_save_area
;
1866 cfun
->function_end_locus
= src_cfun
->function_end_locus
;
1867 cfun
->curr_properties
= src_cfun
->curr_properties
;
1868 cfun
->last_verified
= src_cfun
->last_verified
;
1869 if (src_cfun
->ipa_transforms_to_apply
)
1870 cfun
->ipa_transforms_to_apply
= VEC_copy (ipa_opt_pass
, heap
,
1871 src_cfun
->ipa_transforms_to_apply
);
1872 cfun
->va_list_gpr_size
= src_cfun
->va_list_gpr_size
;
1873 cfun
->va_list_fpr_size
= src_cfun
->va_list_fpr_size
;
1874 cfun
->function_frequency
= src_cfun
->function_frequency
;
1875 cfun
->has_nonlocal_label
= src_cfun
->has_nonlocal_label
;
1876 cfun
->stdarg
= src_cfun
->stdarg
;
1877 cfun
->dont_save_pending_sizes_p
= src_cfun
->dont_save_pending_sizes_p
;
1878 cfun
->after_inlining
= src_cfun
->after_inlining
;
1879 cfun
->returns_struct
= src_cfun
->returns_struct
;
1880 cfun
->returns_pcc_struct
= src_cfun
->returns_pcc_struct
;
1881 cfun
->after_tree_profile
= src_cfun
->after_tree_profile
;
1883 init_empty_tree_cfg ();
1885 ENTRY_BLOCK_PTR
->count
=
1886 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
1888 ENTRY_BLOCK_PTR
->frequency
=
1889 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
*
1890 frequency_scale
/ REG_BR_PROB_BASE
);
1891 EXIT_BLOCK_PTR
->count
=
1892 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
* count_scale
/
1894 EXIT_BLOCK_PTR
->frequency
=
1895 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
*
1896 frequency_scale
/ REG_BR_PROB_BASE
);
1898 init_eh_for_function ();
1900 if (src_cfun
->gimple_df
)
1902 init_tree_ssa (cfun
);
1903 cfun
->gimple_df
->in_ssa_p
= true;
1904 init_ssa_operands ();
1909 /* Make a copy of the body of FN so that it can be inserted inline in
1910 another function. Walks FN via CFG, returns new fndecl. */
1913 copy_cfg_body (copy_body_data
* id
, gcov_type count
, int frequency
,
1914 basic_block entry_block_map
, basic_block exit_block_map
)
1916 tree callee_fndecl
= id
->src_fn
;
1917 /* Original cfun for the callee, doesn't change. */
1918 struct function
*src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
1919 struct function
*cfun_to_copy
;
1921 tree new_fndecl
= NULL
;
1922 gcov_type count_scale
, frequency_scale
;
1925 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
)
1926 count_scale
= (REG_BR_PROB_BASE
* count
1927 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->count
);
1931 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
)
1932 frequency_scale
= (REG_BR_PROB_BASE
* frequency
1934 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun
)->frequency
);
1936 frequency_scale
= count_scale
;
1938 /* Register specific tree functions. */
1939 gimple_register_cfg_hooks ();
1941 /* Must have a CFG here at this point. */
1942 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1943 (DECL_STRUCT_FUNCTION (callee_fndecl
)));
1945 cfun_to_copy
= id
->src_cfun
= DECL_STRUCT_FUNCTION (callee_fndecl
);
1947 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= entry_block_map
;
1948 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
)->aux
= exit_block_map
;
1949 entry_block_map
->aux
= ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
1950 exit_block_map
->aux
= EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy
);
1952 /* Duplicate any exception-handling regions. */
1955 id
->eh_region_offset
1956 = duplicate_eh_regions (cfun_to_copy
, remap_decl_1
, id
,
1960 /* Use aux pointers to map the original blocks to copy. */
1961 FOR_EACH_BB_FN (bb
, cfun_to_copy
)
1963 basic_block new_bb
= copy_bb (id
, bb
, frequency_scale
, count_scale
);
1968 last
= last_basic_block
;
1970 /* Now that we've duplicated the blocks, duplicate their edges. */
1971 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
1972 copy_edges_for_bb (bb
, count_scale
, exit_block_map
);
1974 if (gimple_in_ssa_p (cfun
))
1975 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
1976 copy_phis_for_bb (bb
, id
);
1978 FOR_ALL_BB_FN (bb
, cfun_to_copy
)
1980 ((basic_block
)bb
->aux
)->aux
= NULL
;
1984 /* Zero out AUX fields of newly created block during EH edge
1986 for (; last
< last_basic_block
; last
++)
1987 BASIC_BLOCK (last
)->aux
= NULL
;
1988 entry_block_map
->aux
= NULL
;
1989 exit_block_map
->aux
= NULL
;
1995 copy_body (copy_body_data
*id
, gcov_type count
, int frequency
,
1996 basic_block entry_block_map
, basic_block exit_block_map
)
1998 tree fndecl
= id
->src_fn
;
2001 /* If this body has a CFG, walk CFG and copy. */
2002 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl
)));
2003 body
= copy_cfg_body (id
, count
, frequency
, entry_block_map
, exit_block_map
);
2008 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2009 defined in function FN, or of a data member thereof. */
2012 self_inlining_addr_expr (tree value
, tree fn
)
2016 if (TREE_CODE (value
) != ADDR_EXPR
)
2019 var
= get_base_address (TREE_OPERAND (value
, 0));
2021 return var
&& auto_var_in_fn_p (var
, fn
);
2025 insert_init_stmt (basic_block bb
, gimple init_stmt
)
2027 /* If VAR represents a zero-sized variable, it's possible that the
2028 assignment statement may result in no gimple statements. */
2031 gimple_stmt_iterator si
= gsi_last_bb (bb
);
2033 /* We can end up with init statements that store to a non-register
2034 from a rhs with a conversion. Handle that here by forcing the
2035 rhs into a temporary. gimple_regimplify_operands is not
2036 prepared to do this for us. */
2037 if (!is_gimple_reg (gimple_assign_lhs (init_stmt
))
2038 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt
)))
2039 && gimple_assign_rhs_class (init_stmt
) == GIMPLE_UNARY_RHS
)
2041 tree rhs
= build1 (gimple_assign_rhs_code (init_stmt
),
2042 gimple_expr_type (init_stmt
),
2043 gimple_assign_rhs1 (init_stmt
));
2044 rhs
= force_gimple_operand_gsi (&si
, rhs
, true, NULL_TREE
, false,
2046 gimple_assign_set_rhs_code (init_stmt
, TREE_CODE (rhs
));
2047 gimple_assign_set_rhs1 (init_stmt
, rhs
);
2049 gsi_insert_after (&si
, init_stmt
, GSI_NEW_STMT
);
2050 gimple_regimplify_operands (init_stmt
, &si
);
2051 mark_symbols_for_renaming (init_stmt
);
2055 /* Initialize parameter P with VALUE. If needed, produce init statement
2056 at the end of BB. When BB is NULL, we return init statement to be
2059 setup_one_parameter (copy_body_data
*id
, tree p
, tree value
, tree fn
,
2060 basic_block bb
, tree
*vars
)
2062 gimple init_stmt
= NULL
;
2065 tree def
= (gimple_in_ssa_p (cfun
)
2066 ? gimple_default_def (id
->src_cfun
, p
) : NULL
);
2069 && value
!= error_mark_node
2070 && !useless_type_conversion_p (TREE_TYPE (p
), TREE_TYPE (value
)))
2072 if (fold_convertible_p (TREE_TYPE (p
), value
))
2073 rhs
= fold_build1 (NOP_EXPR
, TREE_TYPE (p
), value
);
2075 /* ??? For valid (GIMPLE) programs we should not end up here.
2076 Still if something has gone wrong and we end up with truly
2077 mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2078 to not leak invalid GIMPLE to the following passes. */
2079 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (p
), value
);
2082 /* If the parameter is never assigned to, has no SSA_NAMEs created,
2083 we may not need to create a new variable here at all. Instead, we may
2084 be able to just use the argument value. */
2085 if (TREE_READONLY (p
)
2086 && !TREE_ADDRESSABLE (p
)
2087 && value
&& !TREE_SIDE_EFFECTS (value
)
2090 /* We may produce non-gimple trees by adding NOPs or introduce
2091 invalid sharing when operand is not really constant.
2092 It is not big deal to prohibit constant propagation here as
2093 we will constant propagate in DOM1 pass anyway. */
2094 if (is_gimple_min_invariant (value
)
2095 && useless_type_conversion_p (TREE_TYPE (p
),
2097 /* We have to be very careful about ADDR_EXPR. Make sure
2098 the base variable isn't a local variable of the inlined
2099 function, e.g., when doing recursive inlining, direct or
2100 mutually-recursive or whatever, which is why we don't
2101 just test whether fn == current_function_decl. */
2102 && ! self_inlining_addr_expr (value
, fn
))
2104 insert_decl_map (id
, p
, value
);
2109 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
2110 here since the type of this decl must be visible to the calling
2112 var
= copy_decl_to_var (p
, id
);
2113 if (gimple_in_ssa_p (cfun
) && TREE_CODE (var
) == VAR_DECL
)
2116 add_referenced_var (var
);
2119 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2120 that way, when the PARM_DECL is encountered, it will be
2121 automatically replaced by the VAR_DECL. */
2122 insert_decl_map (id
, p
, var
);
2124 /* Declare this new variable. */
2125 TREE_CHAIN (var
) = *vars
;
2128 /* Make gimplifier happy about this variable. */
2129 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2131 /* Even if P was TREE_READONLY, the new VAR should not be.
2132 In the original code, we would have constructed a
2133 temporary, and then the function body would have never
2134 changed the value of P. However, now, we will be
2135 constructing VAR directly. The constructor body may
2136 change its value multiple times as it is being
2137 constructed. Therefore, it must not be TREE_READONLY;
2138 the back-end assumes that TREE_READONLY variable is
2139 assigned to only once. */
2140 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p
)))
2141 TREE_READONLY (var
) = 0;
2143 /* If there is no setup required and we are in SSA, take the easy route
2144 replacing all SSA names representing the function parameter by the
2145 SSA name passed to function.
2147 We need to construct map for the variable anyway as it might be used
2148 in different SSA names when parameter is set in function.
2150 Do replacement at -O0 for const arguments replaced by constant.
2151 This is important for builtin_constant_p and other construct requiring
2152 constant argument to be visible in inlined function body.
2154 FIXME: This usually kills the last connection in between inlined
2155 function parameter and the actual value in debug info. Can we do
2156 better here? If we just inserted the statement, copy propagation
2157 would kill it anyway as it always did in older versions of GCC.
2159 We might want to introduce a notion that single SSA_NAME might
2160 represent multiple variables for purposes of debugging. */
2161 if (gimple_in_ssa_p (cfun
) && rhs
&& def
&& is_gimple_reg (p
)
2163 || (TREE_READONLY (p
)
2164 && is_gimple_min_invariant (rhs
)))
2165 && (TREE_CODE (rhs
) == SSA_NAME
2166 || is_gimple_min_invariant (rhs
))
2167 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2169 insert_decl_map (id
, def
, rhs
);
2173 /* If the value of argument is never used, don't care about initializing
2175 if (optimize
&& gimple_in_ssa_p (cfun
) && !def
&& is_gimple_reg (p
))
2177 gcc_assert (!value
|| !TREE_SIDE_EFFECTS (value
));
2181 /* Initialize this VAR_DECL from the equivalent argument. Convert
2182 the argument to the proper type in case it was promoted. */
2185 if (rhs
== error_mark_node
)
2187 insert_decl_map (id
, p
, var
);
2191 STRIP_USELESS_TYPE_CONVERSION (rhs
);
2193 /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2194 keep our trees in gimple form. */
2195 if (def
&& gimple_in_ssa_p (cfun
) && is_gimple_reg (p
))
2197 def
= remap_ssa_name (def
, id
);
2198 init_stmt
= gimple_build_assign (def
, rhs
);
2199 SSA_NAME_IS_DEFAULT_DEF (def
) = 0;
2200 set_default_def (var
, NULL
);
2203 init_stmt
= gimple_build_assign (var
, rhs
);
2205 if (bb
&& init_stmt
)
2206 insert_init_stmt (bb
, init_stmt
);
2211 /* Generate code to initialize the parameters of the function at the
2212 top of the stack in ID from the GIMPLE_CALL STMT. */
2215 initialize_inlined_parameters (copy_body_data
*id
, gimple stmt
,
2216 tree fn
, basic_block bb
)
2221 tree vars
= NULL_TREE
;
2222 tree static_chain
= gimple_call_chain (stmt
);
2224 /* Figure out what the parameters are. */
2225 parms
= DECL_ARGUMENTS (fn
);
2227 /* Loop through the parameter declarations, replacing each with an
2228 equivalent VAR_DECL, appropriately initialized. */
2229 for (p
= parms
, i
= 0; p
; p
= TREE_CHAIN (p
), i
++)
2232 val
= i
< gimple_call_num_args (stmt
) ? gimple_call_arg (stmt
, i
) : NULL
;
2233 setup_one_parameter (id
, p
, val
, fn
, bb
, &vars
);
2236 /* Initialize the static chain. */
2237 p
= DECL_STRUCT_FUNCTION (fn
)->static_chain_decl
;
2238 gcc_assert (fn
!= current_function_decl
);
2241 /* No static chain? Seems like a bug in tree-nested.c. */
2242 gcc_assert (static_chain
);
2244 setup_one_parameter (id
, p
, static_chain
, fn
, bb
, &vars
);
2247 declare_inline_vars (id
->block
, vars
);
2251 /* Declare a return variable to replace the RESULT_DECL for the
2252 function we are calling. An appropriate DECL_STMT is returned.
2253 The USE_STMT is filled to contain a use of the declaration to
2254 indicate the return value of the function.
2256 RETURN_SLOT, if non-null is place where to store the result. It
2257 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
2258 was the LHS of the MODIFY_EXPR to which this call is the RHS.
2260 The return value is a (possibly null) value that is the result of the
2261 function as seen by the callee. *USE_P is a (possibly null) value that
2262 holds the result as seen by the caller. */
2265 declare_return_variable (copy_body_data
*id
, tree return_slot
, tree modify_dest
,
2268 tree callee
= id
->src_fn
;
2269 tree caller
= id
->dst_fn
;
2270 tree result
= DECL_RESULT (callee
);
2271 tree callee_type
= TREE_TYPE (result
);
2272 tree caller_type
= TREE_TYPE (TREE_TYPE (callee
));
2275 /* We don't need to do anything for functions that don't return
2277 if (!result
|| VOID_TYPE_P (callee_type
))
2283 /* If there was a return slot, then the return value is the
2284 dereferenced address of that object. */
2287 /* The front end shouldn't have used both return_slot and
2288 a modify expression. */
2289 gcc_assert (!modify_dest
);
2290 if (DECL_BY_REFERENCE (result
))
2292 tree return_slot_addr
= build_fold_addr_expr (return_slot
);
2293 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr
);
2295 /* We are going to construct *&return_slot and we can't do that
2296 for variables believed to be not addressable.
2298 FIXME: This check possibly can match, because values returned
2299 via return slot optimization are not believed to have address
2300 taken by alias analysis. */
2301 gcc_assert (TREE_CODE (return_slot
) != SSA_NAME
);
2302 if (gimple_in_ssa_p (cfun
))
2304 HOST_WIDE_INT bitsize
;
2305 HOST_WIDE_INT bitpos
;
2307 enum machine_mode mode
;
2311 base
= get_inner_reference (return_slot
, &bitsize
, &bitpos
,
2313 &mode
, &unsignedp
, &volatilep
,
2315 if (TREE_CODE (base
) == INDIRECT_REF
)
2316 base
= TREE_OPERAND (base
, 0);
2317 if (TREE_CODE (base
) == SSA_NAME
)
2318 base
= SSA_NAME_VAR (base
);
2319 mark_sym_for_renaming (base
);
2321 var
= return_slot_addr
;
2326 gcc_assert (TREE_CODE (var
) != SSA_NAME
);
2327 TREE_ADDRESSABLE (var
) |= TREE_ADDRESSABLE (result
);
2329 if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2330 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2331 && !DECL_GIMPLE_REG_P (result
)
2333 DECL_GIMPLE_REG_P (var
) = 0;
2338 /* All types requiring non-trivial constructors should have been handled. */
2339 gcc_assert (!TREE_ADDRESSABLE (callee_type
));
2341 /* Attempt to avoid creating a new temporary variable. */
2343 && TREE_CODE (modify_dest
) != SSA_NAME
)
2345 bool use_it
= false;
2347 /* We can't use MODIFY_DEST if there's type promotion involved. */
2348 if (!useless_type_conversion_p (callee_type
, caller_type
))
2351 /* ??? If we're assigning to a variable sized type, then we must
2352 reuse the destination variable, because we've no good way to
2353 create variable sized temporaries at this point. */
2354 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type
)) != INTEGER_CST
)
2357 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2358 reuse it as the result of the call directly. Don't do this if
2359 it would promote MODIFY_DEST to addressable. */
2360 else if (TREE_ADDRESSABLE (result
))
2364 tree base_m
= get_base_address (modify_dest
);
2366 /* If the base isn't a decl, then it's a pointer, and we don't
2367 know where that's going to go. */
2368 if (!DECL_P (base_m
))
2370 else if (is_global_var (base_m
))
2372 else if ((TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
2373 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
2374 && !DECL_GIMPLE_REG_P (result
)
2375 && DECL_GIMPLE_REG_P (base_m
))
2377 else if (!TREE_ADDRESSABLE (base_m
))
2389 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type
)) == INTEGER_CST
);
2391 var
= copy_result_decl_to_var (result
, id
);
2392 if (gimple_in_ssa_p (cfun
))
2395 add_referenced_var (var
);
2398 DECL_SEEN_IN_BIND_EXPR_P (var
) = 1;
2399 DECL_STRUCT_FUNCTION (caller
)->local_decls
2400 = tree_cons (NULL_TREE
, var
,
2401 DECL_STRUCT_FUNCTION (caller
)->local_decls
);
2403 /* Do not have the rest of GCC warn about this variable as it should
2404 not be visible to the user. */
2405 TREE_NO_WARNING (var
) = 1;
2407 declare_inline_vars (id
->block
, var
);
2409 /* Build the use expr. If the return type of the function was
2410 promoted, convert it back to the expected type. */
2412 if (!useless_type_conversion_p (caller_type
, TREE_TYPE (var
)))
2413 use
= fold_convert (caller_type
, var
);
2415 STRIP_USELESS_TYPE_CONVERSION (use
);
2417 if (DECL_BY_REFERENCE (result
))
2419 TREE_ADDRESSABLE (var
) = 1;
2420 var
= build_fold_addr_expr (var
);
2424 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2425 way, when the RESULT_DECL is encountered, it will be
2426 automatically replaced by the VAR_DECL. */
2427 insert_decl_map (id
, result
, var
);
2429 /* Remember this so we can ignore it in remap_decls. */
2436 /* Returns nonzero if a function can be inlined as a tree. */
2439 tree_inlinable_function_p (tree fn
)
2441 return inlinable_function_p (fn
);
2444 static const char *inline_forbidden_reason
;
2446 /* A callback for walk_gimple_seq to handle tree operands. Returns
2447 NULL_TREE if a function can be inlined, otherwise sets the reason
2448 why not and returns a tree representing the offending operand. */
2451 inline_forbidden_p_op (tree
*nodep
, int *walk_subtrees ATTRIBUTE_UNUSED
,
2452 void *fnp ATTRIBUTE_UNUSED
)
2457 if (TREE_CODE (node
) == RECORD_TYPE
|| TREE_CODE (node
) == UNION_TYPE
)
2459 /* We cannot inline a function of the form
2461 void F (int i) { struct S { int ar[i]; } s; }
2463 Attempting to do so produces a catch-22.
2464 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
2465 UNION_TYPE nodes, then it goes into infinite recursion on a
2466 structure containing a pointer to its own type. If it doesn't,
2467 then the type node for S doesn't get adjusted properly when
2470 ??? This is likely no longer true, but it's too late in the 4.0
2471 cycle to try to find out. This should be checked for 4.1. */
2472 for (t
= TYPE_FIELDS (node
); t
; t
= TREE_CHAIN (t
))
2473 if (variably_modified_type_p (TREE_TYPE (t
), NULL
))
2475 inline_forbidden_reason
2476 = G_("function %q+F can never be inlined "
2477 "because it uses variable sized variables");
2486 /* A callback for walk_gimple_seq to handle statements. Returns
2487 non-NULL iff a function can not be inlined. Also sets the reason
2491 inline_forbidden_p_stmt (gimple_stmt_iterator
*gsi
, bool *handled_ops_p
,
2492 struct walk_stmt_info
*wip
)
2494 tree fn
= (tree
) wip
->info
;
2496 gimple stmt
= gsi_stmt (*gsi
);
2498 switch (gimple_code (stmt
))
2501 /* Refuse to inline alloca call unless user explicitly forced so as
2502 this may change program's memory overhead drastically when the
2503 function using alloca is called in loop. In GCC present in
2504 SPEC2000 inlining into schedule_block cause it to require 2GB of
2505 RAM instead of 256MB. */
2506 if (gimple_alloca_call_p (stmt
)
2507 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)))
2509 inline_forbidden_reason
2510 = G_("function %q+F can never be inlined because it uses "
2511 "alloca (override using the always_inline attribute)");
2512 *handled_ops_p
= true;
2516 t
= gimple_call_fndecl (stmt
);
2520 /* We cannot inline functions that call setjmp. */
2521 if (setjmp_call_p (t
))
2523 inline_forbidden_reason
2524 = G_("function %q+F can never be inlined because it uses setjmp");
2525 *handled_ops_p
= true;
2529 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
)
2530 switch (DECL_FUNCTION_CODE (t
))
2532 /* We cannot inline functions that take a variable number of
2534 case BUILT_IN_VA_START
:
2535 case BUILT_IN_NEXT_ARG
:
2536 case BUILT_IN_VA_END
:
2537 inline_forbidden_reason
2538 = G_("function %q+F can never be inlined because it "
2539 "uses variable argument lists");
2540 *handled_ops_p
= true;
2543 case BUILT_IN_LONGJMP
:
2544 /* We can't inline functions that call __builtin_longjmp at
2545 all. The non-local goto machinery really requires the
2546 destination be in a different function. If we allow the
2547 function calling __builtin_longjmp to be inlined into the
2548 function calling __builtin_setjmp, Things will Go Awry. */
2549 inline_forbidden_reason
2550 = G_("function %q+F can never be inlined because "
2551 "it uses setjmp-longjmp exception handling");
2552 *handled_ops_p
= true;
2555 case BUILT_IN_NONLOCAL_GOTO
:
2557 inline_forbidden_reason
2558 = G_("function %q+F can never be inlined because "
2559 "it uses non-local goto");
2560 *handled_ops_p
= true;
2563 case BUILT_IN_RETURN
:
2564 case BUILT_IN_APPLY_ARGS
:
2565 /* If a __builtin_apply_args caller would be inlined,
2566 it would be saving arguments of the function it has
2567 been inlined into. Similarly __builtin_return would
2568 return from the function the inline has been inlined into. */
2569 inline_forbidden_reason
2570 = G_("function %q+F can never be inlined because "
2571 "it uses __builtin_return or __builtin_apply_args");
2572 *handled_ops_p
= true;
2581 t
= gimple_goto_dest (stmt
);
2583 /* We will not inline a function which uses computed goto. The
2584 addresses of its local labels, which may be tucked into
2585 global storage, are of course not constant across
2586 instantiations, which causes unexpected behavior. */
2587 if (TREE_CODE (t
) != LABEL_DECL
)
2589 inline_forbidden_reason
2590 = G_("function %q+F can never be inlined "
2591 "because it contains a computed goto");
2592 *handled_ops_p
= true;
2598 t
= gimple_label_label (stmt
);
2599 if (DECL_NONLOCAL (t
))
2601 /* We cannot inline a function that receives a non-local goto
2602 because we cannot remap the destination label used in the
2603 function that is performing the non-local goto. */
2604 inline_forbidden_reason
2605 = G_("function %q+F can never be inlined "
2606 "because it receives a non-local goto");
2607 *handled_ops_p
= true;
2616 *handled_ops_p
= false;
2622 inline_forbidden_p_2 (tree
*nodep
, int *walk_subtrees
,
2626 tree fn
= (tree
) fnp
;
2628 if (TREE_CODE (node
) == LABEL_DECL
&& DECL_CONTEXT (node
) == fn
)
2630 inline_forbidden_reason
2631 = G_("function %q+F can never be inlined "
2632 "because it saves address of local label in a static variable");
2642 /* Return true if FNDECL is a function that cannot be inlined into
2646 inline_forbidden_p (tree fndecl
)
2648 location_t saved_loc
= input_location
;
2649 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
2651 struct walk_stmt_info wi
;
2652 struct pointer_set_t
*visited_nodes
;
2654 bool forbidden_p
= false;
2656 visited_nodes
= pointer_set_create ();
2657 memset (&wi
, 0, sizeof (wi
));
2658 wi
.info
= (void *) fndecl
;
2659 wi
.pset
= visited_nodes
;
2661 FOR_EACH_BB_FN (bb
, fun
)
2664 gimple_seq seq
= bb_seq (bb
);
2665 ret
= walk_gimple_seq (seq
, inline_forbidden_p_stmt
,
2666 inline_forbidden_p_op
, &wi
);
2667 forbidden_p
= (ret
!= NULL
);
2672 for (step
= fun
->local_decls
; step
; step
= TREE_CHAIN (step
))
2674 tree decl
= TREE_VALUE (step
);
2675 if (TREE_CODE (decl
) == VAR_DECL
2676 && TREE_STATIC (decl
)
2677 && !DECL_EXTERNAL (decl
)
2678 && DECL_INITIAL (decl
))
2681 ret
= walk_tree_without_duplicates (&DECL_INITIAL (decl
),
2682 inline_forbidden_p_2
, fndecl
);
2683 forbidden_p
= (ret
!= NULL
);
2690 pointer_set_destroy (visited_nodes
);
2691 input_location
= saved_loc
;
2695 /* Returns nonzero if FN is a function that does not have any
2696 fundamental inline blocking properties. */
2699 inlinable_function_p (tree fn
)
2701 bool inlinable
= true;
2705 /* If we've already decided this function shouldn't be inlined,
2706 there's no need to check again. */
2707 if (DECL_UNINLINABLE (fn
))
2710 /* We only warn for functions declared `inline' by the user. */
2711 do_warning
= (warn_inline
2712 && DECL_DECLARED_INLINE_P (fn
)
2713 && !DECL_NO_INLINE_WARNING_P (fn
)
2714 && !DECL_IN_SYSTEM_HEADER (fn
));
2716 always_inline
= lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
));
2719 && always_inline
== NULL
)
2722 warning (OPT_Winline
, "function %q+F can never be inlined because it "
2723 "is suppressed using -fno-inline", fn
);
2727 /* Don't auto-inline anything that might not be bound within
2728 this unit of translation. */
2729 else if (!DECL_DECLARED_INLINE_P (fn
)
2730 && DECL_REPLACEABLE_P (fn
))
2733 else if (!function_attribute_inlinable_p (fn
))
2736 warning (OPT_Winline
, "function %q+F can never be inlined because it "
2737 "uses attributes conflicting with inlining", fn
);
2741 else if (inline_forbidden_p (fn
))
2743 /* See if we should warn about uninlinable functions. Previously,
2744 some of these warnings would be issued while trying to expand
2745 the function inline, but that would cause multiple warnings
2746 about functions that would for example call alloca. But since
2747 this a property of the function, just one warning is enough.
2748 As a bonus we can now give more details about the reason why a
2749 function is not inlinable. */
2751 sorry (inline_forbidden_reason
, fn
);
2752 else if (do_warning
)
2753 warning (OPT_Winline
, inline_forbidden_reason
, fn
);
2758 /* Squirrel away the result so that we don't have to check again. */
2759 DECL_UNINLINABLE (fn
) = !inlinable
;
2764 /* Estimate the cost of a memory move. Use machine dependent
2765 word size and take possible memcpy call into account. */
2768 estimate_move_cost (tree type
)
2772 gcc_assert (!VOID_TYPE_P (type
));
2774 size
= int_size_in_bytes (type
);
2776 if (size
< 0 || size
> MOVE_MAX_PIECES
* MOVE_RATIO (!optimize_size
))
2777 /* Cost of a memcpy call, 3 arguments and the call. */
2780 return ((size
+ MOVE_MAX_PIECES
- 1) / MOVE_MAX_PIECES
);
2783 /* Returns cost of operation CODE, according to WEIGHTS */
2786 estimate_operator_cost (enum tree_code code
, eni_weights
*weights
,
2787 tree op1 ATTRIBUTE_UNUSED
, tree op2
)
2791 /* These are "free" conversions, or their presumed cost
2792 is folded into other operations. */
2799 /* Assign cost of 1 to usual operations.
2800 ??? We may consider mapping RTL costs to this. */
2805 case POINTER_PLUS_EXPR
:
2809 case FIXED_CONVERT_EXPR
:
2810 case FIX_TRUNC_EXPR
:
2822 case VEC_LSHIFT_EXPR
:
2823 case VEC_RSHIFT_EXPR
:
2830 case TRUTH_ANDIF_EXPR
:
2831 case TRUTH_ORIF_EXPR
:
2832 case TRUTH_AND_EXPR
:
2834 case TRUTH_XOR_EXPR
:
2835 case TRUTH_NOT_EXPR
:
2844 case UNORDERED_EXPR
:
2855 case PREDECREMENT_EXPR
:
2856 case PREINCREMENT_EXPR
:
2857 case POSTDECREMENT_EXPR
:
2858 case POSTINCREMENT_EXPR
:
2860 case REALIGN_LOAD_EXPR
:
2862 case REDUC_MAX_EXPR
:
2863 case REDUC_MIN_EXPR
:
2864 case REDUC_PLUS_EXPR
:
2865 case WIDEN_SUM_EXPR
:
2866 case WIDEN_MULT_EXPR
:
2869 case VEC_WIDEN_MULT_HI_EXPR
:
2870 case VEC_WIDEN_MULT_LO_EXPR
:
2871 case VEC_UNPACK_HI_EXPR
:
2872 case VEC_UNPACK_LO_EXPR
:
2873 case VEC_UNPACK_FLOAT_HI_EXPR
:
2874 case VEC_UNPACK_FLOAT_LO_EXPR
:
2875 case VEC_PACK_TRUNC_EXPR
:
2876 case VEC_PACK_SAT_EXPR
:
2877 case VEC_PACK_FIX_TRUNC_EXPR
:
2878 case VEC_EXTRACT_EVEN_EXPR
:
2879 case VEC_EXTRACT_ODD_EXPR
:
2880 case VEC_INTERLEAVE_HIGH_EXPR
:
2881 case VEC_INTERLEAVE_LOW_EXPR
:
2885 /* Few special cases of expensive operations. This is useful
2886 to avoid inlining on functions having too many of these. */
2887 case TRUNC_DIV_EXPR
:
2889 case FLOOR_DIV_EXPR
:
2890 case ROUND_DIV_EXPR
:
2891 case EXACT_DIV_EXPR
:
2892 case TRUNC_MOD_EXPR
:
2894 case FLOOR_MOD_EXPR
:
2895 case ROUND_MOD_EXPR
:
2897 if (TREE_CODE (op2
) != INTEGER_CST
)
2898 return weights
->div_mod_cost
;
2902 /* We expect a copy assignment with no operator. */
2903 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_SINGLE_RHS
);
2909 /* Estimate number of instructions that will be created by expanding
2910 the statements in the statement sequence STMTS.
2911 WEIGHTS contains weights attributed to various constructs. */
2914 int estimate_num_insns_seq (gimple_seq stmts
, eni_weights
*weights
)
2917 gimple_stmt_iterator gsi
;
2920 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
2921 cost
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
2927 /* Estimate number of instructions that will be created by expanding STMT.
2928 WEIGHTS contains weights attributed to various constructs. */
2931 estimate_num_insns (gimple stmt
, eni_weights
*weights
)
2934 enum gimple_code code
= gimple_code (stmt
);
2941 /* Try to estimate the cost of assignments. We have three cases to
2943 1) Simple assignments to registers;
2944 2) Stores to things that must live in memory. This includes
2945 "normal" stores to scalars, but also assignments of large
2946 structures, or constructors of big arrays;
2948 Let us look at the first two cases, assuming we have "a = b + C":
2949 <GIMPLE_ASSIGN <var_decl "a">
2950 <plus_expr <var_decl "b"> <constant C>>
2951 If "a" is a GIMPLE register, the assignment to it is free on almost
2952 any target, because "a" usually ends up in a real register. Hence
2953 the only cost of this expression comes from the PLUS_EXPR, and we
2954 can ignore the GIMPLE_ASSIGN.
2955 If "a" is not a GIMPLE register, the assignment to "a" will most
2956 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
2957 of moving something into "a", which we compute using the function
2958 estimate_move_cost. */
2959 lhs
= gimple_assign_lhs (stmt
);
2960 rhs
= gimple_assign_rhs1 (stmt
);
2962 /* EH magic stuff is most probably going to be optimized out.
2963 We rarely really need to save EH info for unwinding
2964 nested exceptions. */
2965 if (TREE_CODE (lhs
) == FILTER_EXPR
2966 || TREE_CODE (lhs
) == EXC_PTR_EXPR
2967 || TREE_CODE (rhs
) == FILTER_EXPR
2968 || TREE_CODE (rhs
) == EXC_PTR_EXPR
)
2970 if (is_gimple_reg (lhs
))
2973 cost
= estimate_move_cost (TREE_TYPE (lhs
));
2975 if (!is_gimple_reg (rhs
) && !is_gimple_min_invariant (rhs
))
2976 cost
+= estimate_move_cost (TREE_TYPE (rhs
));
2978 cost
+= estimate_operator_cost (gimple_assign_rhs_code (stmt
), weights
,
2979 gimple_assign_rhs1 (stmt
),
2980 get_gimple_rhs_class (gimple_assign_rhs_code (stmt
))
2981 == GIMPLE_BINARY_RHS
2982 ? gimple_assign_rhs2 (stmt
) : NULL
);
2986 cost
= 1 + estimate_operator_cost (gimple_cond_code (stmt
), weights
,
2987 gimple_op (stmt
, 0),
2988 gimple_op (stmt
, 1));
2992 /* Take into account cost of the switch + guess 2 conditional jumps for
2995 TODO: once the switch expansion logic is sufficiently separated, we can
2996 do better job on estimating cost of the switch. */
2997 if (weights
->time_based
)
2998 cost
= floor_log2 (gimple_switch_num_labels (stmt
)) * 2;
3000 cost
= gimple_switch_num_labels (stmt
) * 2;
3005 tree decl
= gimple_call_fndecl (stmt
);
3006 tree addr
= gimple_call_fn (stmt
);
3007 tree funtype
= TREE_TYPE (addr
);
3009 if (POINTER_TYPE_P (funtype
))
3010 funtype
= TREE_TYPE (funtype
);
3012 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_MD
)
3013 cost
= weights
->target_builtin_call_cost
;
3015 cost
= weights
->call_cost
;
3017 if (decl
&& DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
)
3018 switch (DECL_FUNCTION_CODE (decl
))
3020 case BUILT_IN_CONSTANT_P
:
3022 case BUILT_IN_EXPECT
:
3025 /* Prefetch instruction is not expensive. */
3026 case BUILT_IN_PREFETCH
:
3027 cost
= weights
->target_builtin_call_cost
;
3035 funtype
= TREE_TYPE (decl
);
3037 if (!VOID_TYPE_P (TREE_TYPE (funtype
)))
3038 cost
+= estimate_move_cost (TREE_TYPE (funtype
));
3039 /* Our cost must be kept in sync with
3040 cgraph_estimate_size_after_inlining that does use function
3041 declaration to figure out the arguments. */
3042 if (decl
&& DECL_ARGUMENTS (decl
))
3045 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
3046 if (!VOID_TYPE_P (TREE_TYPE (arg
)))
3047 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3049 else if (funtype
&& prototype_p (funtype
))
3052 for (t
= TYPE_ARG_TYPES (funtype
); t
&& t
!= void_list_node
;
3054 if (!VOID_TYPE_P (TREE_VALUE (t
)))
3055 cost
+= estimate_move_cost (TREE_VALUE (t
));
3059 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
3061 tree arg
= gimple_call_arg (stmt
, i
);
3062 if (!VOID_TYPE_P (TREE_TYPE (arg
)))
3063 cost
+= estimate_move_cost (TREE_TYPE (arg
));
3075 case GIMPLE_CHANGE_DYNAMIC_TYPE
:
3076 case GIMPLE_PREDICT
:
3084 return estimate_num_insns_seq (gimple_bind_body (stmt
), weights
);
3086 case GIMPLE_EH_FILTER
:
3087 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt
), weights
);
3090 return estimate_num_insns_seq (gimple_catch_handler (stmt
), weights
);
3093 return (estimate_num_insns_seq (gimple_try_eval (stmt
), weights
)
3094 + estimate_num_insns_seq (gimple_try_cleanup (stmt
), weights
));
3096 /* OpenMP directives are generally very expensive. */
3098 case GIMPLE_OMP_RETURN
:
3099 case GIMPLE_OMP_SECTIONS_SWITCH
:
3100 case GIMPLE_OMP_ATOMIC_STORE
:
3101 case GIMPLE_OMP_CONTINUE
:
3102 /* ...except these, which are cheap. */
3105 case GIMPLE_OMP_ATOMIC_LOAD
:
3106 return weights
->omp_cost
;
3108 case GIMPLE_OMP_FOR
:
3109 return (weights
->omp_cost
3110 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
)
3111 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt
), weights
));
3113 case GIMPLE_OMP_PARALLEL
:
3114 case GIMPLE_OMP_TASK
:
3115 case GIMPLE_OMP_CRITICAL
:
3116 case GIMPLE_OMP_MASTER
:
3117 case GIMPLE_OMP_ORDERED
:
3118 case GIMPLE_OMP_SECTION
:
3119 case GIMPLE_OMP_SECTIONS
:
3120 case GIMPLE_OMP_SINGLE
:
3121 return (weights
->omp_cost
3122 + estimate_num_insns_seq (gimple_omp_body (stmt
), weights
));
3131 /* Estimate number of instructions that will be created by expanding
3132 function FNDECL. WEIGHTS contains weights attributed to various
3136 estimate_num_insns_fn (tree fndecl
, eni_weights
*weights
)
3138 struct function
*my_function
= DECL_STRUCT_FUNCTION (fndecl
);
3139 gimple_stmt_iterator bsi
;
3143 gcc_assert (my_function
&& my_function
->cfg
);
3144 FOR_EACH_BB_FN (bb
, my_function
)
3146 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
3147 n
+= estimate_num_insns (gsi_stmt (bsi
), weights
);
3154 /* Initializes weights used by estimate_num_insns. */
3157 init_inline_once (void)
3159 eni_inlining_weights
.call_cost
= PARAM_VALUE (PARAM_INLINE_CALL_COST
);
3160 eni_inlining_weights
.target_builtin_call_cost
= 1;
3161 eni_inlining_weights
.div_mod_cost
= 10;
3162 eni_inlining_weights
.omp_cost
= 40;
3163 eni_inlining_weights
.time_based
= true;
3165 eni_size_weights
.call_cost
= 1;
3166 eni_size_weights
.target_builtin_call_cost
= 1;
3167 eni_size_weights
.div_mod_cost
= 1;
3168 eni_size_weights
.omp_cost
= 40;
3169 eni_size_weights
.time_based
= false;
3171 /* Estimating time for call is difficult, since we have no idea what the
3172 called function does. In the current uses of eni_time_weights,
3173 underestimating the cost does less harm than overestimating it, so
3174 we choose a rather small value here. */
3175 eni_time_weights
.call_cost
= 10;
3176 eni_time_weights
.target_builtin_call_cost
= 10;
3177 eni_time_weights
.div_mod_cost
= 10;
3178 eni_time_weights
.omp_cost
= 40;
3179 eni_time_weights
.time_based
= true;
3182 /* Estimate the number of instructions in a gimple_seq. */
3185 count_insns_seq (gimple_seq seq
, eni_weights
*weights
)
3187 gimple_stmt_iterator gsi
;
3189 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3190 n
+= estimate_num_insns (gsi_stmt (gsi
), weights
);
3196 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
3199 prepend_lexical_block (tree current_block
, tree new_block
)
3201 BLOCK_CHAIN (new_block
) = BLOCK_SUBBLOCKS (current_block
);
3202 BLOCK_SUBBLOCKS (current_block
) = new_block
;
3203 BLOCK_SUPERCONTEXT (new_block
) = current_block
;
3206 /* Fetch callee declaration from the call graph edge going from NODE and
3207 associated with STMR call statement. Return NULL_TREE if not found. */
3209 get_indirect_callee_fndecl (struct cgraph_node
*node
, gimple stmt
)
3211 struct cgraph_edge
*cs
;
3213 cs
= cgraph_edge (node
, stmt
);
3215 return cs
->callee
->decl
;
3220 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
3223 expand_call_inline (basic_block bb
, gimple stmt
, copy_body_data
*id
)
3225 tree retvar
, use_retvar
;
3227 struct pointer_map_t
*st
;
3230 location_t saved_location
;
3231 struct cgraph_edge
*cg_edge
;
3232 cgraph_inline_failed_t reason
;
3233 basic_block return_block
;
3235 gimple_stmt_iterator gsi
, stmt_gsi
;
3236 bool successfully_inlined
= FALSE
;
3237 bool purge_dead_abnormal_edges
;
3241 /* Set input_location here so we get the right instantiation context
3242 if we call instantiate_decl from inlinable_function_p. */
3243 saved_location
= input_location
;
3244 if (gimple_has_location (stmt
))
3245 input_location
= gimple_location (stmt
);
3247 /* From here on, we're only interested in CALL_EXPRs. */
3248 if (gimple_code (stmt
) != GIMPLE_CALL
)
3251 /* First, see if we can figure out what function is being called.
3252 If we cannot, then there is no hope of inlining the function. */
3253 fn
= gimple_call_fndecl (stmt
);
3256 fn
= get_indirect_callee_fndecl (id
->dst_node
, stmt
);
3261 /* Turn forward declarations into real ones. */
3262 fn
= cgraph_node (fn
)->decl
;
3264 /* If FN is a declaration of a function in a nested scope that was
3265 globally declared inline, we don't set its DECL_INITIAL.
3266 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3267 C++ front-end uses it for cdtors to refer to their internal
3268 declarations, that are not real functions. Fortunately those
3269 don't have trees to be saved, so we can tell by checking their
3271 if (!DECL_INITIAL (fn
)
3272 && DECL_ABSTRACT_ORIGIN (fn
)
3273 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn
)))
3274 fn
= DECL_ABSTRACT_ORIGIN (fn
);
3276 /* Objective C and fortran still calls tree_rest_of_compilation directly.
3277 Kill this check once this is fixed. */
3278 if (!id
->dst_node
->analyzed
)
3281 cg_edge
= cgraph_edge (id
->dst_node
, stmt
);
3283 /* Don't try to inline functions that are not well-suited to
3285 if (!cgraph_inline_p (cg_edge
, &reason
))
3287 /* If this call was originally indirect, we do not want to emit any
3288 inlining related warnings or sorry messages because there are no
3289 guarantees regarding those. */
3290 if (cg_edge
->indirect_call
)
3293 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
))
3294 /* Avoid warnings during early inline pass. */
3295 && cgraph_global_info_ready
)
3297 sorry ("inlining failed in call to %q+F: %s", fn
,
3298 cgraph_inline_failed_string (reason
));
3299 sorry ("called from here");
3301 else if (warn_inline
&& DECL_DECLARED_INLINE_P (fn
)
3302 && !DECL_IN_SYSTEM_HEADER (fn
)
3303 && reason
!= CIF_UNSPECIFIED
3304 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn
))
3305 /* Avoid warnings during early inline pass. */
3306 && cgraph_global_info_ready
)
3308 warning (OPT_Winline
, "inlining failed in call to %q+F: %s",
3309 fn
, cgraph_inline_failed_string (reason
));
3310 warning (OPT_Winline
, "called from here");
3314 fn
= cg_edge
->callee
->decl
;
3316 #ifdef ENABLE_CHECKING
3317 if (cg_edge
->callee
->decl
!= id
->dst_node
->decl
)
3318 verify_cgraph_node (cg_edge
->callee
);
3321 /* We will be inlining this callee. */
3322 id
->eh_region
= lookup_stmt_eh_region (stmt
);
3324 /* Split the block holding the GIMPLE_CALL. */
3325 e
= split_block (bb
, stmt
);
3327 return_block
= e
->dest
;
3330 /* split_block splits after the statement; work around this by
3331 moving the call into the second block manually. Not pretty,
3332 but seems easier than doing the CFG manipulation by hand
3333 when the GIMPLE_CALL is in the last statement of BB. */
3334 stmt_gsi
= gsi_last_bb (bb
);
3335 gsi_remove (&stmt_gsi
, false);
3337 /* If the GIMPLE_CALL was in the last statement of BB, it may have
3338 been the source of abnormal edges. In this case, schedule
3339 the removal of dead abnormal edges. */
3340 gsi
= gsi_start_bb (return_block
);
3341 if (gsi_end_p (gsi
))
3343 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
3344 purge_dead_abnormal_edges
= true;
3348 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
3349 purge_dead_abnormal_edges
= false;
3352 stmt_gsi
= gsi_start_bb (return_block
);
3354 /* Build a block containing code to initialize the arguments, the
3355 actual inline expansion of the body, and a label for the return
3356 statements within the function to jump to. The type of the
3357 statement expression is the return type of the function call. */
3358 id
->block
= make_node (BLOCK
);
3359 BLOCK_ABSTRACT_ORIGIN (id
->block
) = fn
;
3360 BLOCK_SOURCE_LOCATION (id
->block
) = input_location
;
3361 prepend_lexical_block (gimple_block (stmt
), id
->block
);
3363 /* Local declarations will be replaced by their equivalents in this
3366 id
->decl_map
= pointer_map_create ();
3368 /* Record the function we are about to inline. */
3370 id
->src_node
= cg_edge
->callee
;
3371 id
->src_cfun
= DECL_STRUCT_FUNCTION (fn
);
3372 id
->gimple_call
= stmt
;
3374 gcc_assert (!id
->src_cfun
->after_inlining
);
3377 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn
)))
3379 gimple_stmt_iterator si
= gsi_last_bb (bb
);
3380 gsi_insert_after (&si
, gimple_build_predict (PRED_COLD_FUNCTION
,
3384 initialize_inlined_parameters (id
, stmt
, fn
, bb
);
3386 if (DECL_INITIAL (fn
))
3387 prepend_lexical_block (id
->block
, remap_blocks (DECL_INITIAL (fn
), id
));
3389 /* Return statements in the function body will be replaced by jumps
3390 to the RET_LABEL. */
3391 gcc_assert (DECL_INITIAL (fn
));
3392 gcc_assert (TREE_CODE (DECL_INITIAL (fn
)) == BLOCK
);
3394 /* Find the LHS to which the result of this call is assigned. */
3396 if (gimple_call_lhs (stmt
))
3398 modify_dest
= gimple_call_lhs (stmt
);
3400 /* The function which we are inlining might not return a value,
3401 in which case we should issue a warning that the function
3402 does not return a value. In that case the optimizers will
3403 see that the variable to which the value is assigned was not
3404 initialized. We do not want to issue a warning about that
3405 uninitialized variable. */
3406 if (DECL_P (modify_dest
))
3407 TREE_NO_WARNING (modify_dest
) = 1;
3409 if (gimple_call_return_slot_opt_p (stmt
))
3411 return_slot
= modify_dest
;
3418 /* If we are inlining a call to the C++ operator new, we don't want
3419 to use type based alias analysis on the return value. Otherwise
3420 we may get confused if the compiler sees that the inlined new
3421 function returns a pointer which was just deleted. See bug
3423 if (DECL_IS_OPERATOR_NEW (fn
))
3429 /* Declare the return variable for the function. */
3430 retvar
= declare_return_variable (id
, return_slot
, modify_dest
, &use_retvar
);
3432 if (DECL_IS_OPERATOR_NEW (fn
))
3434 gcc_assert (TREE_CODE (retvar
) == VAR_DECL
3435 && POINTER_TYPE_P (TREE_TYPE (retvar
)));
3436 DECL_NO_TBAA_P (retvar
) = 1;
3439 /* Add local vars in this inlined callee to caller. */
3440 t_step
= id
->src_cfun
->local_decls
;
3441 for (; t_step
; t_step
= TREE_CHAIN (t_step
))
3443 var
= TREE_VALUE (t_step
);
3444 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
3446 if (var_ann (var
) && add_referenced_var (var
))
3447 cfun
->local_decls
= tree_cons (NULL_TREE
, var
,
3450 else if (!can_be_nonlocal (var
, id
))
3451 cfun
->local_decls
= tree_cons (NULL_TREE
, remap_decl (var
, id
),
3455 /* This is it. Duplicate the callee body. Assume callee is
3456 pre-gimplified. Note that we must not alter the caller
3457 function in any way before this point, as this CALL_EXPR may be
3458 a self-referential call; if we're calling ourselves, we need to
3459 duplicate our body before altering anything. */
3460 copy_body (id
, bb
->count
, bb
->frequency
, bb
, return_block
);
3463 pointer_map_destroy (id
->decl_map
);
3466 /* Unlink the calls virtual operands before replacing it. */
3467 unlink_stmt_vdef (stmt
);
3469 /* If the inlined function returns a result that we care about,
3470 substitute the GIMPLE_CALL with an assignment of the return
3471 variable to the LHS of the call. That is, if STMT was
3472 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
3473 if (use_retvar
&& gimple_call_lhs (stmt
))
3475 gimple old_stmt
= stmt
;
3476 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), use_retvar
);
3477 gsi_replace (&stmt_gsi
, stmt
, false);
3478 if (gimple_in_ssa_p (cfun
))
3479 mark_symbols_for_renaming (stmt
);
3480 maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
);
3484 /* Handle the case of inlining a function with no return
3485 statement, which causes the return value to become undefined. */
3486 if (gimple_call_lhs (stmt
)
3487 && TREE_CODE (gimple_call_lhs (stmt
)) == SSA_NAME
)
3489 tree name
= gimple_call_lhs (stmt
);
3490 tree var
= SSA_NAME_VAR (name
);
3491 tree def
= gimple_default_def (cfun
, var
);
3495 /* If the variable is used undefined, make this name
3496 undefined via a move. */
3497 stmt
= gimple_build_assign (gimple_call_lhs (stmt
), def
);
3498 gsi_replace (&stmt_gsi
, stmt
, true);
3502 /* Otherwise make this variable undefined. */
3503 gsi_remove (&stmt_gsi
, true);
3504 set_default_def (var
, name
);
3505 SSA_NAME_DEF_STMT (name
) = gimple_build_nop ();
3509 gsi_remove (&stmt_gsi
, true);
3512 if (purge_dead_abnormal_edges
)
3513 gimple_purge_dead_abnormal_call_edges (return_block
);
3515 /* If the value of the new expression is ignored, that's OK. We
3516 don't warn about this for CALL_EXPRs, so we shouldn't warn about
3517 the equivalent inlined version either. */
3518 if (is_gimple_assign (stmt
))
3520 gcc_assert (gimple_assign_single_p (stmt
)
3521 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt
)));
3522 TREE_USED (gimple_assign_rhs1 (stmt
)) = 1;
3525 /* Output the inlining info for this abstract function, since it has been
3526 inlined. If we don't do this now, we can lose the information about the
3527 variables in the function when the blocks get blown away as soon as we
3528 remove the cgraph node. */
3529 (*debug_hooks
->outlining_inline_function
) (cg_edge
->callee
->decl
);
3531 /* Update callgraph if needed. */
3532 cgraph_remove_node (cg_edge
->callee
);
3534 id
->block
= NULL_TREE
;
3535 successfully_inlined
= TRUE
;
3538 input_location
= saved_location
;
3539 return successfully_inlined
;
3542 /* Expand call statements reachable from STMT_P.
3543 We can only have CALL_EXPRs as the "toplevel" tree code or nested
3544 in a MODIFY_EXPR. See tree-gimple.c:get_call_expr_in(). We can
3545 unfortunately not use that function here because we need a pointer
3546 to the CALL_EXPR, not the tree itself. */
3549 gimple_expand_calls_inline (basic_block bb
, copy_body_data
*id
)
3551 gimple_stmt_iterator gsi
;
3553 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3555 gimple stmt
= gsi_stmt (gsi
);
3557 if (is_gimple_call (stmt
)
3558 && expand_call_inline (bb
, stmt
, id
))
3566 /* Walk all basic blocks created after FIRST and try to fold every statement
3567 in the STATEMENTS pointer set. */
3570 fold_marked_statements (int first
, struct pointer_set_t
*statements
)
3572 for (; first
< n_basic_blocks
; first
++)
3573 if (BASIC_BLOCK (first
))
3575 gimple_stmt_iterator gsi
;
3577 for (gsi
= gsi_start_bb (BASIC_BLOCK (first
));
3580 if (pointer_set_contains (statements
, gsi_stmt (gsi
)))
3582 gimple old_stmt
= gsi_stmt (gsi
);
3583 tree old_decl
= is_gimple_call (old_stmt
) ? gimple_call_fndecl (old_stmt
) : 0;
3585 if (fold_stmt (&gsi
))
3587 /* Re-read the statement from GSI as fold_stmt() may
3589 gimple new_stmt
= gsi_stmt (gsi
);
3590 update_stmt (new_stmt
);
3592 if (is_gimple_call (old_stmt
)
3593 || is_gimple_call (new_stmt
))
3594 cgraph_update_edges_for_call_stmt (old_stmt
, old_decl
, new_stmt
);
3596 if (maybe_clean_or_replace_eh_stmt (old_stmt
, new_stmt
))
3597 gimple_purge_dead_eh_edges (BASIC_BLOCK (first
));
3603 /* Return true if BB has at least one abnormal outgoing edge. */
3606 has_abnormal_outgoing_edge_p (basic_block bb
)
3611 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
3612 if (e
->flags
& EDGE_ABNORMAL
)
3618 /* Expand calls to inline functions in the body of FN. */
3621 optimize_inline_calls (tree fn
)
3626 int last
= n_basic_blocks
;
3627 struct gimplify_ctx gctx
;
3629 /* There is no point in performing inlining if errors have already
3630 occurred -- and we might crash if we try to inline invalid
3632 if (errorcount
|| sorrycount
)
3636 memset (&id
, 0, sizeof (id
));
3638 id
.src_node
= id
.dst_node
= cgraph_node (fn
);
3640 /* Or any functions that aren't finished yet. */
3641 prev_fn
= NULL_TREE
;
3642 if (current_function_decl
)
3644 id
.dst_fn
= current_function_decl
;
3645 prev_fn
= current_function_decl
;
3648 id
.copy_decl
= copy_decl_maybe_to_var
;
3649 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
3650 id
.transform_new_cfg
= false;
3651 id
.transform_return_to_modify
= true;
3652 id
.transform_lang_insert_block
= NULL
;
3653 id
.statements_to_fold
= pointer_set_create ();
3655 push_gimplify_context (&gctx
);
3657 /* We make no attempts to keep dominance info up-to-date. */
3658 free_dominance_info (CDI_DOMINATORS
);
3659 free_dominance_info (CDI_POST_DOMINATORS
);
3661 /* Register specific gimple functions. */
3662 gimple_register_cfg_hooks ();
3664 /* Reach the trees by walking over the CFG, and note the
3665 enclosing basic-blocks in the call edges. */
3666 /* We walk the blocks going forward, because inlined function bodies
3667 will split id->current_basic_block, and the new blocks will
3668 follow it; we'll trudge through them, processing their CALL_EXPRs
3671 gimple_expand_calls_inline (bb
, &id
);
3673 pop_gimplify_context (NULL
);
3675 #ifdef ENABLE_CHECKING
3677 struct cgraph_edge
*e
;
3679 verify_cgraph_node (id
.dst_node
);
3681 /* Double check that we inlined everything we are supposed to inline. */
3682 for (e
= id
.dst_node
->callees
; e
; e
= e
->next_callee
)
3683 gcc_assert (e
->inline_failed
);
3687 /* Fold the statements before compacting/renumbering the basic blocks. */
3688 fold_marked_statements (last
, id
.statements_to_fold
);
3689 pointer_set_destroy (id
.statements_to_fold
);
3691 /* Renumber the (code) basic_blocks consecutively. */
3693 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3696 fold_cond_expr_cond ();
3697 delete_unreachable_blocks_update_callgraph (&id
);
3698 #ifdef ENABLE_CHECKING
3699 verify_cgraph_node (id
.dst_node
);
3702 /* It would be nice to check SSA/CFG/statement consistency here, but it is
3703 not possible yet - the IPA passes might make various functions to not
3704 throw and they don't care to proactively update local EH info. This is
3705 done later in fixup_cfg pass that also execute the verification. */
3706 return (TODO_update_ssa
3708 | (gimple_in_ssa_p (cfun
) ? TODO_remove_unused_locals
: 0)
3709 | (profile_status
!= PROFILE_ABSENT
? TODO_rebuild_frequencies
: 0));
3712 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
3715 copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
3717 enum tree_code code
= TREE_CODE (*tp
);
3718 enum tree_code_class cl
= TREE_CODE_CLASS (code
);
3720 /* We make copies of most nodes. */
3721 if (IS_EXPR_CODE_CLASS (cl
)
3722 || code
== TREE_LIST
3724 || code
== TYPE_DECL
3725 || code
== OMP_CLAUSE
)
3727 /* Because the chain gets clobbered when we make a copy, we save it
3729 tree chain
= NULL_TREE
, new_tree
;
3731 chain
= TREE_CHAIN (*tp
);
3733 /* Copy the node. */
3734 new_tree
= copy_node (*tp
);
3736 /* Propagate mudflap marked-ness. */
3737 if (flag_mudflap
&& mf_marked_p (*tp
))
3742 /* Now, restore the chain, if appropriate. That will cause
3743 walk_tree to walk into the chain as well. */
3744 if (code
== PARM_DECL
3745 || code
== TREE_LIST
3746 || code
== OMP_CLAUSE
)
3747 TREE_CHAIN (*tp
) = chain
;
3749 /* For now, we don't update BLOCKs when we make copies. So, we
3750 have to nullify all BIND_EXPRs. */
3751 if (TREE_CODE (*tp
) == BIND_EXPR
)
3752 BIND_EXPR_BLOCK (*tp
) = NULL_TREE
;
3754 else if (code
== CONSTRUCTOR
)
3756 /* CONSTRUCTOR nodes need special handling because
3757 we need to duplicate the vector of elements. */
3760 new_tree
= copy_node (*tp
);
3762 /* Propagate mudflap marked-ness. */
3763 if (flag_mudflap
&& mf_marked_p (*tp
))
3766 CONSTRUCTOR_ELTS (new_tree
) = VEC_copy (constructor_elt
, gc
,
3767 CONSTRUCTOR_ELTS (*tp
));
3770 else if (TREE_CODE_CLASS (code
) == tcc_type
)
3772 else if (TREE_CODE_CLASS (code
) == tcc_declaration
)
3774 else if (TREE_CODE_CLASS (code
) == tcc_constant
)
3777 gcc_assert (code
!= STATEMENT_LIST
);
3781 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
3782 information indicating to what new SAVE_EXPR this one should be mapped,
3783 use that one. Otherwise, create a new node and enter it in ST. FN is
3784 the function into which the copy will be placed. */
3787 remap_save_expr (tree
*tp
, void *st_
, int *walk_subtrees
)
3789 struct pointer_map_t
*st
= (struct pointer_map_t
*) st_
;
3793 /* See if we already encountered this SAVE_EXPR. */
3794 n
= (tree
*) pointer_map_contains (st
, *tp
);
3796 /* If we didn't already remap this SAVE_EXPR, do so now. */
3799 t
= copy_node (*tp
);
3801 /* Remember this SAVE_EXPR. */
3802 *pointer_map_insert (st
, *tp
) = t
;
3803 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3804 *pointer_map_insert (st
, t
) = t
;
3808 /* We've already walked into this SAVE_EXPR; don't do it again. */
3813 /* Replace this SAVE_EXPR with the copy. */
3817 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
3818 copies the declaration and enters it in the splay_tree in DATA (which is
3819 really an `copy_body_data *'). */
3822 mark_local_for_remap_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
3825 copy_body_data
*id
= (copy_body_data
*) data
;
3827 /* Don't walk into types. */
3831 else if (TREE_CODE (*tp
) == LABEL_EXPR
)
3833 tree decl
= TREE_OPERAND (*tp
, 0);
3835 /* Copy the decl and remember the copy. */
3836 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
3842 /* Perform any modifications to EXPR required when it is unsaved. Does
3843 not recurse into EXPR's subtrees. */
3846 unsave_expr_1 (tree expr
)
3848 switch (TREE_CODE (expr
))
3851 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3852 It's OK for this to happen if it was part of a subtree that
3853 isn't immediately expanded, such as operand 2 of another
3855 if (TREE_OPERAND (expr
, 1))
3858 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
3859 TREE_OPERAND (expr
, 3) = NULL_TREE
;
3867 /* Called via walk_tree when an expression is unsaved. Using the
3868 splay_tree pointed to by ST (which is really a `splay_tree'),
3869 remaps all local declarations to appropriate replacements. */
3872 unsave_r (tree
*tp
, int *walk_subtrees
, void *data
)
3874 copy_body_data
*id
= (copy_body_data
*) data
;
3875 struct pointer_map_t
*st
= id
->decl_map
;
3878 /* Only a local declaration (variable or label). */
3879 if ((TREE_CODE (*tp
) == VAR_DECL
&& !TREE_STATIC (*tp
))
3880 || TREE_CODE (*tp
) == LABEL_DECL
)
3882 /* Lookup the declaration. */
3883 n
= (tree
*) pointer_map_contains (st
, *tp
);
3885 /* If it's there, remap it. */
3890 else if (TREE_CODE (*tp
) == STATEMENT_LIST
)
3892 else if (TREE_CODE (*tp
) == BIND_EXPR
)
3893 copy_bind_expr (tp
, walk_subtrees
, id
);
3894 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
3895 remap_save_expr (tp
, st
, walk_subtrees
);
3898 copy_tree_r (tp
, walk_subtrees
, NULL
);
3900 /* Do whatever unsaving is required. */
3901 unsave_expr_1 (*tp
);
3904 /* Keep iterating. */
3908 /* Copies everything in EXPR and replaces variables, labels
3909 and SAVE_EXPRs local to EXPR. */
3912 unsave_expr_now (tree expr
)
3916 /* There's nothing to do for NULL_TREE. */
3921 memset (&id
, 0, sizeof (id
));
3922 id
.src_fn
= current_function_decl
;
3923 id
.dst_fn
= current_function_decl
;
3924 id
.decl_map
= pointer_map_create ();
3926 id
.copy_decl
= copy_decl_no_change
;
3927 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
3928 id
.transform_new_cfg
= false;
3929 id
.transform_return_to_modify
= false;
3930 id
.transform_lang_insert_block
= NULL
;
3932 /* Walk the tree once to find local labels. */
3933 walk_tree_without_duplicates (&expr
, mark_local_for_remap_r
, &id
);
3935 /* Walk the tree again, copying, remapping, and unsaving. */
3936 walk_tree (&expr
, unsave_r
, &id
, NULL
);
3939 pointer_map_destroy (id
.decl_map
);
3944 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
3945 label, copies the declaration and enters it in the splay_tree in DATA (which
3946 is really a 'copy_body_data *'. */
3949 mark_local_labels_stmt (gimple_stmt_iterator
*gsip
,
3950 bool *handled_ops_p ATTRIBUTE_UNUSED
,
3951 struct walk_stmt_info
*wi
)
3953 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
3954 gimple stmt
= gsi_stmt (*gsip
);
3956 if (gimple_code (stmt
) == GIMPLE_LABEL
)
3958 tree decl
= gimple_label_label (stmt
);
3960 /* Copy the decl and remember the copy. */
3961 insert_decl_map (id
, decl
, id
->copy_decl (decl
, id
));
3968 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
3969 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
3970 remaps all local declarations to appropriate replacements in gimple
3974 replace_locals_op (tree
*tp
, int *walk_subtrees
, void *data
)
3976 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
3977 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
3978 struct pointer_map_t
*st
= id
->decl_map
;
3982 /* Only a local declaration (variable or label). */
3983 if ((TREE_CODE (expr
) == VAR_DECL
3984 && !TREE_STATIC (expr
))
3985 || TREE_CODE (expr
) == LABEL_DECL
)
3987 /* Lookup the declaration. */
3988 n
= (tree
*) pointer_map_contains (st
, expr
);
3990 /* If it's there, remap it. */
3995 else if (TREE_CODE (expr
) == STATEMENT_LIST
3996 || TREE_CODE (expr
) == BIND_EXPR
3997 || TREE_CODE (expr
) == SAVE_EXPR
)
3999 else if (TREE_CODE (expr
) == TARGET_EXPR
)
4001 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4002 It's OK for this to happen if it was part of a subtree that
4003 isn't immediately expanded, such as operand 2 of another
4005 if (!TREE_OPERAND (expr
, 1))
4007 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
4008 TREE_OPERAND (expr
, 3) = NULL_TREE
;
4012 /* Keep iterating. */
4017 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4018 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4019 remaps all local declarations to appropriate replacements in gimple
4023 replace_locals_stmt (gimple_stmt_iterator
*gsip
,
4024 bool *handled_ops_p ATTRIBUTE_UNUSED
,
4025 struct walk_stmt_info
*wi
)
4027 copy_body_data
*id
= (copy_body_data
*) wi
->info
;
4028 gimple stmt
= gsi_stmt (*gsip
);
4030 if (gimple_code (stmt
) == GIMPLE_BIND
)
4032 tree block
= gimple_bind_block (stmt
);
4036 remap_block (&block
, id
);
4037 gimple_bind_set_block (stmt
, block
);
4040 /* This will remap a lot of the same decls again, but this should be
4042 if (gimple_bind_vars (stmt
))
4043 gimple_bind_set_vars (stmt
, remap_decls (gimple_bind_vars (stmt
), NULL
, id
));
4046 /* Keep iterating. */
4051 /* Copies everything in SEQ and replaces variables and labels local to
4052 current_function_decl. */
4055 copy_gimple_seq_and_replace_locals (gimple_seq seq
)
4058 struct walk_stmt_info wi
;
4059 struct pointer_set_t
*visited
;
4062 /* There's nothing to do for NULL_TREE. */
4067 memset (&id
, 0, sizeof (id
));
4068 id
.src_fn
= current_function_decl
;
4069 id
.dst_fn
= current_function_decl
;
4070 id
.decl_map
= pointer_map_create ();
4072 id
.copy_decl
= copy_decl_no_change
;
4073 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
4074 id
.transform_new_cfg
= false;
4075 id
.transform_return_to_modify
= false;
4076 id
.transform_lang_insert_block
= NULL
;
4078 /* Walk the tree once to find local labels. */
4079 memset (&wi
, 0, sizeof (wi
));
4080 visited
= pointer_set_create ();
4083 walk_gimple_seq (seq
, mark_local_labels_stmt
, NULL
, &wi
);
4084 pointer_set_destroy (visited
);
4086 copy
= gimple_seq_copy (seq
);
4088 /* Walk the copy, remapping decls. */
4089 memset (&wi
, 0, sizeof (wi
));
4091 walk_gimple_seq (copy
, replace_locals_stmt
, replace_locals_op
, &wi
);
4094 pointer_map_destroy (id
.decl_map
);
4100 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
4103 debug_find_tree_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
, void *data
)
4112 debug_find_tree (tree top
, tree search
)
4114 return walk_tree_without_duplicates (&top
, debug_find_tree_1
, search
) != 0;
4118 /* Declare the variables created by the inliner. Add all the variables in
4119 VARS to BIND_EXPR. */
4122 declare_inline_vars (tree block
, tree vars
)
4125 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4127 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
4128 gcc_assert (!TREE_STATIC (t
) && !TREE_ASM_WRITTEN (t
));
4129 cfun
->local_decls
= tree_cons (NULL_TREE
, t
, cfun
->local_decls
);
4133 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), vars
);
4136 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
4137 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
4138 VAR_DECL translation. */
4141 copy_decl_for_dup_finish (copy_body_data
*id
, tree decl
, tree copy
)
4143 /* Don't generate debug information for the copy if we wouldn't have
4144 generated it for the copy either. */
4145 DECL_ARTIFICIAL (copy
) = DECL_ARTIFICIAL (decl
);
4146 DECL_IGNORED_P (copy
) = DECL_IGNORED_P (decl
);
4148 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4149 declaration inspired this copy. */
4150 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
4152 /* The new variable/label has no RTL, yet. */
4153 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy
), TS_DECL_WRTL
)
4154 && !TREE_STATIC (copy
) && !DECL_EXTERNAL (copy
))
4155 SET_DECL_RTL (copy
, NULL_RTX
);
4157 /* These args would always appear unused, if not for this. */
4158 TREE_USED (copy
) = 1;
4160 /* Set the context for the new declaration. */
4161 if (!DECL_CONTEXT (decl
))
4162 /* Globals stay global. */
4164 else if (DECL_CONTEXT (decl
) != id
->src_fn
)
4165 /* Things that weren't in the scope of the function we're inlining
4166 from aren't in the scope we're inlining to, either. */
4168 else if (TREE_STATIC (decl
))
4169 /* Function-scoped static variables should stay in the original
4173 /* Ordinary automatic local variables are now in the scope of the
4175 DECL_CONTEXT (copy
) = id
->dst_fn
;
4181 copy_decl_to_var (tree decl
, copy_body_data
*id
)
4185 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4186 || TREE_CODE (decl
) == RESULT_DECL
);
4188 type
= TREE_TYPE (decl
);
4190 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), type
);
4191 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4192 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4193 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4194 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4195 DECL_NO_TBAA_P (copy
) = DECL_NO_TBAA_P (decl
);
4197 return copy_decl_for_dup_finish (id
, decl
, copy
);
4200 /* Like copy_decl_to_var, but create a return slot object instead of a
4201 pointer variable for return by invisible reference. */
4204 copy_result_decl_to_var (tree decl
, copy_body_data
*id
)
4208 gcc_assert (TREE_CODE (decl
) == PARM_DECL
4209 || TREE_CODE (decl
) == RESULT_DECL
);
4211 type
= TREE_TYPE (decl
);
4212 if (DECL_BY_REFERENCE (decl
))
4213 type
= TREE_TYPE (type
);
4215 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), type
);
4216 TREE_READONLY (copy
) = TREE_READONLY (decl
);
4217 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
4218 if (!DECL_BY_REFERENCE (decl
))
4220 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
4221 DECL_GIMPLE_REG_P (copy
) = DECL_GIMPLE_REG_P (decl
);
4222 DECL_NO_TBAA_P (copy
) = DECL_NO_TBAA_P (decl
);
4225 return copy_decl_for_dup_finish (id
, decl
, copy
);
4229 copy_decl_no_change (tree decl
, copy_body_data
*id
)
4233 copy
= copy_node (decl
);
4235 /* The COPY is not abstract; it will be generated in DST_FN. */
4236 DECL_ABSTRACT (copy
) = 0;
4237 lang_hooks
.dup_lang_specific_decl (copy
);
4239 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4240 been taken; it's for internal bookkeeping in expand_goto_internal. */
4241 if (TREE_CODE (copy
) == LABEL_DECL
)
4243 TREE_ADDRESSABLE (copy
) = 0;
4244 LABEL_DECL_UID (copy
) = -1;
4247 return copy_decl_for_dup_finish (id
, decl
, copy
);
4251 copy_decl_maybe_to_var (tree decl
, copy_body_data
*id
)
4253 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
4254 return copy_decl_to_var (decl
, id
);
4256 return copy_decl_no_change (decl
, id
);
4259 /* Return a copy of the function's argument tree. */
4261 copy_arguments_for_versioning (tree orig_parm
, copy_body_data
* id
,
4262 bitmap args_to_skip
, tree
*vars
)
4265 tree new_parm
= NULL
;
4270 for (arg
= orig_parm
; arg
; arg
= TREE_CHAIN (arg
), i
++)
4271 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
4273 tree new_tree
= remap_decl (arg
, id
);
4274 lang_hooks
.dup_lang_specific_decl (new_tree
);
4276 parg
= &TREE_CHAIN (new_tree
);
4278 else if (!pointer_map_contains (id
->decl_map
, arg
))
4280 /* Make an equivalent VAR_DECL. If the argument was used
4281 as temporary variable later in function, the uses will be
4282 replaced by local variable. */
4283 tree var
= copy_decl_to_var (arg
, id
);
4285 add_referenced_var (var
);
4286 insert_decl_map (id
, arg
, var
);
4287 /* Declare this new variable. */
4288 TREE_CHAIN (var
) = *vars
;
4294 /* Return a copy of the function's static chain. */
4296 copy_static_chain (tree static_chain
, copy_body_data
* id
)
4298 tree
*chain_copy
, *pvar
;
4300 chain_copy
= &static_chain
;
4301 for (pvar
= chain_copy
; *pvar
; pvar
= &TREE_CHAIN (*pvar
))
4303 tree new_tree
= remap_decl (*pvar
, id
);
4304 lang_hooks
.dup_lang_specific_decl (new_tree
);
4305 TREE_CHAIN (new_tree
) = TREE_CHAIN (*pvar
);
4308 return static_chain
;
4311 /* Return true if the function is allowed to be versioned.
4312 This is a guard for the versioning functionality. */
4314 tree_versionable_function_p (tree fndecl
)
4316 if (fndecl
== NULL_TREE
)
4318 /* ??? There are cases where a function is
4319 uninlinable but can be versioned. */
4320 if (!tree_inlinable_function_p (fndecl
))
4326 /* Delete all unreachable basic blocks and update callgraph.
4327 Doing so is somewhat nontrivial because we need to update all clones and
4328 remove inline function that become unreachable. */
4331 delete_unreachable_blocks_update_callgraph (copy_body_data
*id
)
4333 bool changed
= false;
4334 basic_block b
, next_bb
;
4336 find_unreachable_blocks ();
4338 /* Delete all unreachable basic blocks. */
4340 for (b
= ENTRY_BLOCK_PTR
->next_bb
; b
!= EXIT_BLOCK_PTR
; b
= next_bb
)
4342 next_bb
= b
->next_bb
;
4344 if (!(b
->flags
& BB_REACHABLE
))
4346 gimple_stmt_iterator bsi
;
4348 for (bsi
= gsi_start_bb (b
); !gsi_end_p (bsi
); gsi_next (&bsi
))
4349 if (gimple_code (gsi_stmt (bsi
)) == GIMPLE_CALL
)
4351 struct cgraph_edge
*e
;
4352 struct cgraph_node
*node
;
4354 if ((e
= cgraph_edge (id
->dst_node
, gsi_stmt (bsi
))) != NULL
)
4356 if (!e
->inline_failed
)
4357 cgraph_remove_node_and_inline_clones (e
->callee
);
4359 cgraph_remove_edge (e
);
4361 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
4362 && id
->dst_node
->clones
)
4363 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4365 if ((e
= cgraph_edge (node
, gsi_stmt (bsi
))) != NULL
)
4367 if (!e
->inline_failed
)
4368 cgraph_remove_node_and_inline_clones (e
->callee
);
4370 cgraph_remove_edge (e
);
4374 node
= node
->clones
;
4375 else if (node
->next_sibling_clone
)
4376 node
= node
->next_sibling_clone
;
4379 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4380 node
= node
->clone_of
;
4381 if (node
!= id
->dst_node
)
4382 node
= node
->next_sibling_clone
;
4386 delete_basic_block (b
);
4392 tidy_fallthru_edges ();
4393 #ifdef ENABLE_CHECKING0
4394 verify_cgraph_node (id
->dst_node
);
4395 if (id
->transform_call_graph_edges
== CB_CGE_MOVE_CLONES
4396 && id
->dst_node
->clones
)
4398 struct cgraph_node
*node
;
4399 for (node
= id
->dst_node
->clones
; node
!= id
->dst_node
;)
4401 verify_cgraph_node (node
);
4404 node
= node
->clones
;
4405 else if (node
->next_sibling_clone
)
4406 node
= node
->next_sibling_clone
;
4409 while (node
!= id
->dst_node
&& !node
->next_sibling_clone
)
4410 node
= node
->clone_of
;
4411 if (node
!= id
->dst_node
)
4412 node
= node
->next_sibling_clone
;
4420 /* Create a copy of a function's tree.
4421 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4422 of the original function and the new copied function
4423 respectively. In case we want to replace a DECL
4424 tree with another tree while duplicating the function's
4425 body, TREE_MAP represents the mapping between these
4426 trees. If UPDATE_CLONES is set, the call_stmt fields
4427 of edges of clones of the function will be updated. */
4429 tree_function_versioning (tree old_decl
, tree new_decl
, VEC(ipa_replace_map_p
,gc
)* tree_map
,
4430 bool update_clones
, bitmap args_to_skip
)
4432 struct cgraph_node
*old_version_node
;
4433 struct cgraph_node
*new_version_node
;
4437 struct ipa_replace_map
*replace_info
;
4438 basic_block old_entry_block
;
4439 VEC (gimple
, heap
) *init_stmts
= VEC_alloc (gimple
, heap
, 10);
4442 tree old_current_function_decl
= current_function_decl
;
4443 tree vars
= NULL_TREE
;
4445 gcc_assert (TREE_CODE (old_decl
) == FUNCTION_DECL
4446 && TREE_CODE (new_decl
) == FUNCTION_DECL
);
4447 DECL_POSSIBLY_INLINED (old_decl
) = 1;
4449 old_version_node
= cgraph_node (old_decl
);
4450 new_version_node
= cgraph_node (new_decl
);
4452 /* Output the inlining info for this abstract function, since it has been
4453 inlined. If we don't do this now, we can lose the information about the
4454 variables in the function when the blocks get blown away as soon as we
4455 remove the cgraph node. */
4456 (*debug_hooks
->outlining_inline_function
) (old_decl
);
4458 DECL_ARTIFICIAL (new_decl
) = 1;
4459 DECL_ABSTRACT_ORIGIN (new_decl
) = DECL_ORIGIN (old_decl
);
4461 /* Prepare the data structures for the tree copy. */
4462 memset (&id
, 0, sizeof (id
));
4464 /* Generate a new name for the new version. */
4465 id
.statements_to_fold
= pointer_set_create ();
4467 id
.decl_map
= pointer_map_create ();
4468 id
.src_fn
= old_decl
;
4469 id
.dst_fn
= new_decl
;
4470 id
.src_node
= old_version_node
;
4471 id
.dst_node
= new_version_node
;
4472 id
.src_cfun
= DECL_STRUCT_FUNCTION (old_decl
);
4474 id
.copy_decl
= copy_decl_no_change
;
4475 id
.transform_call_graph_edges
4476 = update_clones
? CB_CGE_MOVE_CLONES
: CB_CGE_MOVE
;
4477 id
.transform_new_cfg
= true;
4478 id
.transform_return_to_modify
= false;
4479 id
.transform_lang_insert_block
= NULL
;
4481 current_function_decl
= new_decl
;
4482 old_entry_block
= ENTRY_BLOCK_PTR_FOR_FUNCTION
4483 (DECL_STRUCT_FUNCTION (old_decl
));
4484 initialize_cfun (new_decl
, old_decl
,
4485 old_entry_block
->count
,
4486 old_entry_block
->frequency
);
4487 push_cfun (DECL_STRUCT_FUNCTION (new_decl
));
4489 /* Copy the function's static chain. */
4490 p
= DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
;
4492 DECL_STRUCT_FUNCTION (new_decl
)->static_chain_decl
=
4493 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl
)->static_chain_decl
,
4496 /* If there's a tree_map, prepare for substitution. */
4498 for (i
= 0; i
< VEC_length (ipa_replace_map_p
, tree_map
); i
++)
4501 replace_info
= VEC_index (ipa_replace_map_p
, tree_map
, i
);
4502 if (replace_info
->replace_p
)
4504 tree op
= replace_info
->new_tree
;
4508 if (TREE_CODE (op
) == VIEW_CONVERT_EXPR
)
4509 op
= TREE_OPERAND (op
, 0);
4511 if (TREE_CODE (op
) == ADDR_EXPR
)
4513 op
= TREE_OPERAND (op
, 0);
4514 while (handled_component_p (op
))
4515 op
= TREE_OPERAND (op
, 0);
4516 if (TREE_CODE (op
) == VAR_DECL
)
4517 add_referenced_var (op
);
4519 gcc_assert (TREE_CODE (replace_info
->old_tree
) == PARM_DECL
);
4520 init
= setup_one_parameter (&id
, replace_info
->old_tree
,
4521 replace_info
->new_tree
, id
.src_fn
,
4525 VEC_safe_push (gimple
, heap
, init_stmts
, init
);
4528 /* Copy the function's arguments. */
4529 if (DECL_ARGUMENTS (old_decl
) != NULL_TREE
)
4530 DECL_ARGUMENTS (new_decl
) =
4531 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl
), &id
,
4532 args_to_skip
, &vars
);
4534 DECL_INITIAL (new_decl
) = remap_blocks (DECL_INITIAL (id
.src_fn
), &id
);
4536 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4537 number_blocks (id
.dst_fn
);
4539 declare_inline_vars (DECL_INITIAL (new_decl
), vars
);
4541 if (DECL_STRUCT_FUNCTION (old_decl
)->local_decls
!= NULL_TREE
)
4542 /* Add local vars. */
4543 for (t_step
= DECL_STRUCT_FUNCTION (old_decl
)->local_decls
;
4544 t_step
; t_step
= TREE_CHAIN (t_step
))
4546 tree var
= TREE_VALUE (t_step
);
4547 if (TREE_STATIC (var
) && !TREE_ASM_WRITTEN (var
))
4548 cfun
->local_decls
= tree_cons (NULL_TREE
, var
, cfun
->local_decls
);
4549 else if (!can_be_nonlocal (var
, &id
))
4551 tree_cons (NULL_TREE
, remap_decl (var
, &id
),
4555 /* Copy the Function's body. */
4556 copy_body (&id
, old_entry_block
->count
, old_entry_block
->frequency
, ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
);
4558 if (DECL_RESULT (old_decl
) != NULL_TREE
)
4560 tree
*res_decl
= &DECL_RESULT (old_decl
);
4561 DECL_RESULT (new_decl
) = remap_decl (*res_decl
, &id
);
4562 lang_hooks
.dup_lang_specific_decl (DECL_RESULT (new_decl
));
4565 /* Renumber the lexical scoping (non-code) blocks consecutively. */
4566 number_blocks (new_decl
);
4568 if (VEC_length (gimple
, init_stmts
))
4570 basic_block bb
= split_edge (single_succ_edge (ENTRY_BLOCK_PTR
));
4571 while (VEC_length (gimple
, init_stmts
))
4572 insert_init_stmt (bb
, VEC_pop (gimple
, init_stmts
));
4576 pointer_map_destroy (id
.decl_map
);
4577 free_dominance_info (CDI_DOMINATORS
);
4578 free_dominance_info (CDI_POST_DOMINATORS
);
4580 fold_marked_statements (0, id
.statements_to_fold
);
4581 pointer_set_destroy (id
.statements_to_fold
);
4582 fold_cond_expr_cond ();
4583 delete_unreachable_blocks_update_callgraph (&id
);
4584 update_ssa (TODO_update_ssa
);
4585 free_dominance_info (CDI_DOMINATORS
);
4586 free_dominance_info (CDI_POST_DOMINATORS
);
4588 VEC_free (gimple
, heap
, init_stmts
);
4590 current_function_decl
= old_current_function_decl
;
4591 gcc_assert (!current_function_decl
4592 || DECL_STRUCT_FUNCTION (current_function_decl
) == cfun
);
4596 /* Duplicate a type, fields and all. */
4599 build_duplicate_type (tree type
)
4601 struct copy_body_data id
;
4603 memset (&id
, 0, sizeof (id
));
4604 id
.src_fn
= current_function_decl
;
4605 id
.dst_fn
= current_function_decl
;
4607 id
.decl_map
= pointer_map_create ();
4608 id
.copy_decl
= copy_decl_no_change
;
4610 type
= remap_type_1 (type
, &id
);
4612 pointer_map_destroy (id
.decl_map
);
4614 TYPE_CANONICAL (type
) = type
;
4619 /* Return whether it is safe to inline a function because it used different
4620 target specific options or different optimization options. */
4622 tree_can_inline_p (tree caller
, tree callee
)
4625 /* This causes a regression in SPEC in that it prevents a cold function from
4626 inlining a hot function. Perhaps this should only apply to functions
4627 that the user declares hot/cold/optimize explicitly. */
4629 /* Don't inline a function with a higher optimization level than the
4630 caller, or with different space constraints (hot/cold functions). */
4631 tree caller_tree
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller
);
4632 tree callee_tree
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee
);
4634 if (caller_tree
!= callee_tree
)
4636 struct cl_optimization
*caller_opt
4637 = TREE_OPTIMIZATION ((caller_tree
)
4639 : optimization_default_node
);
4641 struct cl_optimization
*callee_opt
4642 = TREE_OPTIMIZATION ((callee_tree
)
4644 : optimization_default_node
);
4646 if ((caller_opt
->optimize
> callee_opt
->optimize
)
4647 || (caller_opt
->optimize_size
!= callee_opt
->optimize_size
))
4652 /* Allow the backend to decide if inlining is ok. */
4653 return targetm
.target_option
.can_inline_p (caller
, callee
);