X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Ftree-inline.h;h=76ac17adcee63f3a323e268ed9b2da8b6eb09d5e;hb=d0aaf3990d011abe5d7c65905f240a60d2fdccb6;hp=4755fbbf9fdcf86a9c28f5128be7d8d51215c9f3;hpb=5a02d67bef967122bde442b874452e3bb1c96791;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/tree-inline.h b/gcc/tree-inline.h index 4755fbbf9fd..76ac17adcee 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 + 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 "pointer-set.h" +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,8 +73,13 @@ typedef struct copy_body_data /* Current BLOCK. */ tree block; + /* GIMPLE_CALL if va arg parameter packs should be expanded or NULL + is not. */ + gimple gimple_call; + /* 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; @@ -67,14 +88,8 @@ typedef struct copy_body_data 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,38 +100,84 @@ 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; } copy_body_data; +/* Weights of constructions for estimate_num_insns. */ + +typedef struct eni_weights_d +{ + /* Cost per call. */ + unsigned 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 for omp construct. */ + unsigned omp_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. */ + +extern eni_weights eni_inlining_weights; + +/* Weights that estimate_num_insns uses to estimate the size of the + produced code. */ + +extern eni_weights eni_size_weights; + +/* Weights that estimate_num_insns uses to estimate the time necessary + to execute the produced code. */ + +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); -void optimize_inline_calls (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 *); +tree copy_decl_no_change (tree decl, copy_body_data *id); void save_body (tree, tree *, tree *); int estimate_move_cost (tree type); -void push_cfun (struct function *new_cfun); -void pop_cfun (void); -int estimate_num_insns (tree expr); +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); +bool tree_can_inline_p (struct cgraph_edge *e); +extern gimple_seq remap_gimple_seq (gimple_seq, copy_body_data *); 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; - #endif /* GCC_TREE_INLINE_H */