1 /* Tree inlining hooks and declarations.
2 Copyright 2001, 2003, 2004, 2005, 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/>. */
22 #ifndef GCC_TREE_INLINE_H
23 #define GCC_TREE_INLINE_H
25 #include "pointer-set.h"
28 /* Indicate the desired behavior wrt call graph edges. We can either
29 duplicate the edge (inlining, cloning), move the edge (versioning,
30 parallelization), or move the edges of the clones (saving). */
32 enum copy_body_cge_which
39 /* Data required for function body duplication. */
41 typedef struct copy_body_data
43 /* FUNCTION_DECL for function being inlined, or in general the
44 source function providing the original trees. */
47 /* FUNCTION_DECL for function being inlined into, or in general
48 the destination function receiving the new trees. */
51 /* Callgraph node of the source function. */
52 struct cgraph_node
*src_node
;
54 /* Callgraph node of the destination function. */
55 struct cgraph_node
*dst_node
;
57 /* struct function for function being inlined. Usually this is the same
58 as DECL_STRUCT_FUNCTION (src_fn), but can be different if saved_cfg
59 and saved_eh are in use. */
60 struct function
*src_cfun
;
62 /* The VAR_DECL for the return value. */
65 /* The map from local declarations in the inlined function to
66 equivalents in the function into which it is being inlined. */
67 struct pointer_map_t
*decl_map
;
69 /* Create a new decl to replace DECL in the destination function. */
70 tree (*copy_decl
) (tree
, struct copy_body_data
*);
75 /* GIMPLE_CALL if va arg parameter packs should be expanded or NULL
79 /* Exception region the inlined call lie in. */
82 /* Take region number in the function being copied, add this value and
83 get eh region number of the duplicate in the function we inline into. */
86 /* We use the same mechanism do all sorts of different things. Rather
87 than enumerating the different cases, we categorize the behavior
88 in the various situations. */
90 /* What to do with call graph edges. */
91 enum copy_body_cge_which transform_call_graph_edges
;
93 /* True if a new CFG should be created. False for inlining, true for
95 bool transform_new_cfg
;
97 /* True if RETURN_EXPRs should be transformed to just the contained
98 MODIFY_EXPR. The branch semantics of the return will be handled
99 by manipulating the CFG rather than a statement. */
100 bool transform_return_to_modify
;
102 /* True if this statement will need to be regimplified. */
105 /* True if trees should not be unshared. */
108 /* > 0 if we are remapping a type currently. */
109 int remapping_type_depth
;
111 /* A function to be called when duplicating BLOCK nodes. */
112 void (*transform_lang_insert_block
) (tree
);
114 /* Statements that might be possibly folded. */
115 struct pointer_set_t
*statements_to_fold
;
117 /* Entry basic block to currently copied body. */
118 struct basic_block_def
*entry_bb
;
121 /* Weights of constructions for estimate_num_insns. */
123 typedef struct eni_weights_d
128 /* Cost per call to a target specific builtin */
129 unsigned target_builtin_call_cost
;
131 /* Cost of "expensive" div and mod operations. */
132 unsigned div_mod_cost
;
134 /* Cost for omp construct. */
137 /* True when time of statemnt should be estimated. Thus i.e
138 cost of switch statement is logarithmic rather than linear in number
143 /* Weights that estimate_num_insns uses for heuristics in inlining. */
145 extern eni_weights eni_inlining_weights
;
147 /* Weights that estimate_num_insns uses to estimate the size of the
150 extern eni_weights eni_size_weights
;
152 /* Weights that estimate_num_insns uses to estimate the time necessary
153 to execute the produced code. */
155 extern eni_weights eni_time_weights
;
157 /* Function prototypes. */
159 extern tree
copy_tree_body_r (tree
*, int *, void *);
160 extern void insert_decl_map (copy_body_data
*, tree
, tree
);
162 unsigned int optimize_inline_calls (tree
);
163 tree
maybe_inline_call_in_expr (tree
);
164 bool tree_inlinable_function_p (tree
);
165 tree
copy_tree_r (tree
*, int *, void *);
166 tree
copy_decl_no_change (tree decl
, copy_body_data
*id
);
167 void save_body (tree
, tree
*, tree
*);
168 int estimate_move_cost (tree type
);
169 int estimate_num_insns (gimple
, eni_weights
*);
170 int estimate_num_insns_fn (tree
, eni_weights
*);
171 int count_insns_seq (gimple_seq
, eni_weights
*);
172 bool tree_versionable_function_p (tree
);
173 bool tree_can_inline_p (tree
, tree
);
175 extern gimple_seq
remap_gimple_seq (gimple_seq
, copy_body_data
*);
176 extern tree
remap_decl (tree decl
, copy_body_data
*id
);
177 extern tree
remap_type (tree type
, copy_body_data
*id
);
178 extern gimple_seq
copy_gimple_seq_and_replace_locals (gimple_seq seq
);
180 extern HOST_WIDE_INT
estimated_stack_frame_size (void);
182 #endif /* GCC_TREE_INLINE_H */