X-Git-Url: http://git.sourceforge.jp/view?p=pf3gnuchains%2Fgcc-fork.git;a=blobdiff_plain;f=gcc%2Ftree-inline.h;h=ba0b2c46995c6f9d825999550dc5d939378e536f;hp=998494e1aaa98b8e80c3258a1e6bba20b493e566;hb=0958a641e614f832728291f512df7a293137f784;hpb=bc8bb82538304e37bc9163580496d69daf1c1d36 diff --git a/gcc/tree-inline.h b/gcc/tree-inline.h index 998494e1aaa..ba0b2c46995 100644 --- a/gcc/tree-inline.h +++ b/gcc/tree-inline.h @@ -1,12 +1,13 @@ /* Tree inlining hooks and declarations. - Copyright 2001, 2003, 2004, 2005 Free Software Foundation, Inc. + Copyright 2001, 2003, 2004, 2005, 2007, 2008, 2009, 2010 + Free Software Foundation, Inc. Contributed by Alexandre Oliva This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by -the Free Software Foundation; either version 2, or (at your option) +the Free Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, @@ -15,16 +16,26 @@ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License -along with GCC; see the file COPYING. If not, write to -the Free Software Foundation, 51 Franklin Street, Fifth Floor, -Boston, MA 02110-1301, USA. */ +along with GCC; see the file COPYING3. If not see +. */ #ifndef GCC_TREE_INLINE_H #define GCC_TREE_INLINE_H -#include "varray.h" -#include "splay-tree.h" +#include "vecir.h" /* For VEC(gimple,heap). */ +struct cgraph_edge; + +/* Indicate the desired behavior wrt call graph edges. We can either + duplicate the edge (inlining, cloning), move the edge (versioning, + parallelization), or move the edges of the clones (saving). */ + +enum copy_body_cge_which +{ + CB_CGE_DUPLICATE, + CB_CGE_MOVE, + CB_CGE_MOVE_CLONES +}; /* Data required for function body duplication. */ @@ -33,13 +44,17 @@ typedef struct copy_body_data /* FUNCTION_DECL for function being inlined, or in general the source function providing the original trees. */ tree src_fn; + /* FUNCTION_DECL for function being inlined into, or in general the destination function receiving the new trees. */ tree dst_fn; + /* Callgraph node of the source function. */ struct cgraph_node *src_node; + /* Callgraph node of the destination function. */ struct cgraph_node *dst_node; + /* struct function for function being inlined. Usually this is the same as DECL_STRUCT_FUNCTION (src_fn), but can be different if saved_cfg and saved_eh are in use. */ @@ -47,9 +62,10 @@ typedef struct copy_body_data /* The VAR_DECL for the return value. */ tree retvar; + /* The map from local declarations in the inlined function to equivalents in the function into which it is being inlined. */ - splay_tree decl_map; + struct pointer_map_t *decl_map; /* Create a new decl to replace DECL in the destination function. */ tree (*copy_decl) (tree, struct copy_body_data *); @@ -57,24 +73,23 @@ typedef struct copy_body_data /* Current BLOCK. */ tree block; - /* Exception region the inlined call lie in. */ - int eh_region; - /* Take region number in the function being copied, add this value and - get eh region number of the duplicate in the function we inline into. */ - int eh_region_offset; + /* GIMPLE_CALL if va arg parameter packs should be expanded or NULL + is not. */ + gimple gimple_call; + + /* Exception landing pad the inlined call lies in. */ + int eh_lp_nr; + + /* Maps region and landing pad structures from the function being copied + to duplicates created within the function we inline into. */ + struct pointer_map_t *eh_map; /* We use the same mechanism do all sorts of different things. Rather than enumerating the different cases, we categorize the behavior in the various situations. */ - /* Indicate the desired behavior wrt call graph edges. We can either - duplicate the edge (inlining, cloning), move the edge (versioning, - parallelization), or move the edges of the clones (saving). */ - enum copy_body_cge_which { - CB_CGE_DUPLICATE, - CB_CGE_MOVE, - CB_CGE_MOVE_CLONES - } transform_call_graph_edges; + /* What to do with call graph edges. */ + enum copy_body_cge_which transform_call_graph_edges; /* True if a new CFG should be created. False for inlining, true for everything else. */ @@ -85,12 +100,32 @@ typedef struct copy_body_data by manipulating the CFG rather than a statement. */ bool transform_return_to_modify; - /* True if lang_hooks.decls.insert_block should be invoked when - duplicating BLOCK nodes. */ - bool transform_lang_insert_block; + /* True if this statement will need to be regimplified. */ + bool regimplify; + + /* True if trees should not be unshared. */ + bool do_not_unshare; + + /* > 0 if we are remapping a type currently. */ + int remapping_type_depth; + + /* A function to be called when duplicating BLOCK nodes. */ + void (*transform_lang_insert_block) (tree); /* Statements that might be possibly folded. */ struct pointer_set_t *statements_to_fold; + + /* Entry basic block to currently copied body. */ + struct basic_block_def *entry_bb; + + /* Debug statements that need processing. */ + VEC(gimple,heap) *debug_stmts; + + /* A map from local declarations in the inlined function to + equivalents in the function into which it is being inlined, where + the originals have been mapped to a value rather than to a + variable. */ + struct pointer_map_t *debug_map; } copy_body_data; /* Weights of constructions for estimate_num_insns. */ @@ -100,14 +135,28 @@ typedef struct eni_weights_d /* Cost per call. */ unsigned call_cost; + /* Cost per indirect call. */ + unsigned indirect_call_cost; + + /* Cost per call to a target specific builtin */ + unsigned target_builtin_call_cost; + /* Cost of "expensive" div and mod operations. */ unsigned div_mod_cost; - /* Cost of switch statement. */ - unsigned switch_cost; - /* Cost for omp construct. */ unsigned omp_cost; + + /* Cost for tm transaction. */ + unsigned tm_cost; + + /* Cost of return. */ + unsigned return_cost; + + /* True when time of statemnt should be estimated. Thus i.e + cost of switch statement is logarithmic rather than linear in number + of cases. */ + bool time_based; } eni_weights; /* Weights that estimate_num_insns uses for heuristics in inlining. */ @@ -126,31 +175,24 @@ extern eni_weights eni_time_weights; /* Function prototypes. */ -extern tree copy_body_r (tree *, int *, void *); +extern tree copy_tree_body_r (tree *, int *, void *); extern void insert_decl_map (copy_body_data *, tree, tree); unsigned int optimize_inline_calls (tree); +tree maybe_inline_call_in_expr (tree); bool tree_inlinable_function_p (tree); tree copy_tree_r (tree *, int *, void *); -void clone_body (tree, tree, void *); -void save_body (tree, tree *, tree *); +tree copy_decl_no_change (tree decl, copy_body_data *id); int estimate_move_cost (tree type); -void push_cfun (struct function *new_cfun); -void pop_cfun (void); -int estimate_num_insns (tree expr, eni_weights *); +int estimate_num_insns (gimple, eni_weights *); +int estimate_num_insns_fn (tree, eni_weights *); +int count_insns_seq (gimple_seq, eni_weights *); bool tree_versionable_function_p (tree); -void tree_function_versioning (tree, tree, varray_type, bool); extern tree remap_decl (tree decl, copy_body_data *id); extern tree remap_type (tree type, copy_body_data *id); +extern gimple_seq copy_gimple_seq_and_replace_locals (gimple_seq seq); -extern HOST_WIDE_INT estimated_stack_frame_size (void); - -/* 0 if we should not perform inlining. - 1 if we should expand functions calls inline at the tree level. - 2 if we should consider *all* functions to be inline - candidates. */ - -extern int flag_inline_trees; +extern HOST_WIDE_INT estimated_stack_frame_size (struct cgraph_node *); #endif /* GCC_TREE_INLINE_H */