X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fipa-prop.h;h=110044e4da4568c4bcdfe2431712dc9b02a2195c;hb=cf445e1459b831213ec88159e1f720f31efdee05;hp=db9b91691a59859f6392418422beeaf7ff365a5d;hpb=3b22db66ca59822a0c28b056ebab946fe8eec643;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/ipa-prop.h b/gcc/ipa-prop.h index db9b91691a5..110044e4da4 100644 --- a/gcc/ipa-prop.h +++ b/gcc/ipa-prop.h @@ -1,11 +1,12 @@ /* Interprocedural analyses. - Copyright (C) 2005 Free Software Foundation, Inc. + Copyright (C) 2005, 2007, 2008, 2009 + Free Software Foundation, Inc. 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) any later +Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY @@ -14,191 +15,493 @@ 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, 59 Temple Place - Suite 330, Boston, MA -02111-1307, USA. */ +along with GCC; see the file COPYING3. If not see +. */ #ifndef IPA_PROP_H #define IPA_PROP_H #include "tree.h" +#include "vec.h" +#include "cgraph.h" /* The following definitions and interfaces are used by - interprocedural analyses. */ + interprocedural analyses or parameters. */ -/* A jump function for a callsite represents the values passed as actual +/* ipa-prop.c stuff (ipa-cp, indirect inlining): */ + +/* A jump function for a callsite represents the values passed as actual arguments of the callsite. There are three main types of values : - Formal - the caller's formal parameter is passed as an actual argument. - Constant - a constant is passed as a an actual argument. - Unknown - neither of the above. - Integer and real constants are represented as CONST_IPATYPE and Fortran - constants are represented as CONST_IPATYPE_REF. */ + + Pass-through - the caller's formal parameter is passed as an actual + argument, possibly one simple operation performed on it. + Constant - a constant (is_gimple_ip_invariant)is passed as an actual + argument. + Unknown - neither of the above. + + IPA_JF_CONST_MEMBER_PTR stands for C++ member pointers, it is a special + constant in this regard. Other constants are represented with IPA_JF_CONST. + + IPA_JF_ANCESTOR is a special pass-through jump function, which means that + the result is an address of a part of the object pointed to by the formal + parameter to which the function refers. It is mainly intended to represent + getting addresses of of ancestor fields in C++ + (e.g. &this_1(D)->D.1766.D.1756). Note that if the original pointer is + NULL, ancestor jump function must behave like a simple pass-through. + + Other pass-through functions can either simply pass on an unchanged formal + parameter or can apply one simple binary operation to it (such jump + functions are called polynomial). + + IPA_JF_KNOWN_TYPE is a special type of an "unknown" function that applies + only to pointer parameters. It means that even though we cannot prove that + the passed value is an interprocedural constant, we still know the exact + type of the containing object which may be valuable for devirtualization. + + Jump functions are computed in ipa-prop.c by function + update_call_notes_after_inlining. Some information can be lost and jump + functions degraded accordingly when inlining, see + update_call_notes_after_inlining in the same file. */ + enum jump_func_type { - UNKNOWN_IPATYPE, - CONST_IPATYPE, - CONST_IPATYPE_REF, - FORMAL_IPATYPE + IPA_JF_UNKNOWN = 0, /* newly allocated and zeroed jump functions default */ + IPA_JF_KNOWN_TYPE, /* represented by field base_binfo */ + IPA_JF_CONST, /* represented by field costant */ + IPA_JF_CONST_MEMBER_PTR, /* represented by field member_cst */ + IPA_JF_PASS_THROUGH, /* represented by field pass_through */ + IPA_JF_ANCESTOR /* represented by field ancestor */ }; -/* All formal parameters in the program have a cval computed by - the interprocedural stage of IPCP. - There are three main values of cval : - TOP - unknown. - BOTTOM - non constant. - CONSTANT_TYPE - constant value. - Cval of formal f will have a constant value if all callsites to this - function have the same constant value passed to f. - Integer and real constants are represented as CONST_IPATYPE and Fortran - constants are represented as CONST_IPATYPE_REF. */ -enum cvalue_type -{ - BOTTOM, - CONST_VALUE, - CONST_VALUE_REF, - TOP +/* Structure holding data required to describe a pass-through jump function. */ + +struct GTY(()) ipa_pass_through_data +{ + /* If an operation is to be performed on the original parameter, this is the + second (constant) operand. */ + tree operand; + /* Number of the caller's formal parameter being passed. */ + int formal_id; + /* Operation that is performed on the argument before it is passed on. + NOP_EXPR means no operation. Otherwise oper must be a simple binary + arithmetic operation where the caller's parameter is the first operand and + operand field from this structure is the second one. */ + enum tree_code operation; }; -/* Represents the value of either jump function or cval. - value represnts a constant. - formal_id is used only in jump function context and represents - pass-through parameter (the formal of caller is passed - as argument). */ -union parameter_info +/* Structure holding data required to describe an ancestor pass-through + jump function. */ + +struct GTY(()) ipa_ancestor_jf_data { - unsigned int formal_id; - tree value; + /* Offset of the field representing the ancestor. */ + HOST_WIDE_INT offset; + /* TYpe of the result. */ + tree type; + /* Number of the caller's formal parameter being passed. */ + int formal_id; }; -/* A jump function for a callsite represents the values passed as actual - arguments of the callsite. See enum jump_func_type for the various +/* Structure holding a C++ member pointer constant. Holds a pointer to the + method and delta offset. */ +struct GTY(()) ipa_member_ptr_cst +{ + tree pfn; + tree delta; +}; + +/* A jump function for a callsite represents the values passed as actual + arguments of the callsite. See enum jump_func_type for the various types of jump functions supported. */ -struct ipa_jump_func +struct GTY (()) ipa_jump_func { enum jump_func_type type; - union parameter_info info_type; + /* Represents a value of a jump function. pass_through is used only in jump + function context. constant represents the actual constant in constant jump + functions and member_cst holds constant c++ member functions. */ + union jump_func_value + { + tree GTY ((tag ("IPA_JF_KNOWN_TYPE"))) base_binfo; + tree GTY ((tag ("IPA_JF_CONST"))) constant; + struct ipa_member_ptr_cst GTY ((tag ("IPA_JF_CONST_MEMBER_PTR"))) member_cst; + struct ipa_pass_through_data GTY ((tag ("IPA_JF_PASS_THROUGH"))) pass_through; + struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; + } GTY ((desc ("%1.type"))) value; }; -/* All formal parameters in the program have a cval computed by - the interprocedural stage of IPCP. See enum cvalue_type for - the various types of cvals supported */ -struct ipcp_formal +/* All formal parameters in the program have a lattice associated with it + computed by the interprocedural stage of IPCP. + There are three main values of the lattice: + IPA_TOP - unknown, + IPA_BOTTOM - non constant, + IPA_CONST_VALUE - simple scalar constant, + Cval of formal f will have a constant value if all callsites to this + function have the same constant value passed to f. + Integer and real constants are represented as IPA_CONST_VALUE. */ +enum ipa_lattice_type { - enum cvalue_type cval_type; - union parameter_info cvalue; + IPA_BOTTOM, + IPA_CONST_VALUE, + IPA_TOP }; -/* Represent which DECL tree (or reference to such tree) - will be replaced by another tree while versioning. */ -struct ipa_replace_map -{ - /* The tree that will be replaced. */ - tree old_tree; - /* The new (replacing) tree. */ - tree new_tree; - /* True when a substitution should be done, false otherwise. */ - bool replace_p; - /* True when we replace a reference to old_tree. */ - bool ref_p; +/* All formal parameters in the program have a cval computed by + the interprocedural stage of IPCP. See enum ipa_lattice_type for + the various types of lattices supported */ +struct ipcp_lattice +{ + enum ipa_lattice_type type; + tree constant; }; -/* Return the field in cgraph_node/cgraph_edge struct that points - to ipa_node/ipa_edge struct. */ -#define IPA_NODE_REF(MT) ((struct ipa_node *)(MT)->aux) -#define IPA_EDGE_REF(EDGE) ((struct ipa_edge *)(EDGE)->aux) - -/* ipa_node stores information related to a method and - its formal parameters. It is pointed to by a field in the - method's corresponding cgraph_node. +/* Structure describing a single formal parameter. */ +struct ipa_param_descriptor +{ + /* IPA-CP lattice. */ + struct ipcp_lattice ipcp_lattice; + /* PARAM_DECL of this parameter. */ + tree decl; + /* Whether the value parameter has been modified within the function. */ + unsigned modified : 1; + /* The parameter is used. */ + unsigned used : 1; +}; - ipa_edge stores information related to a callsite and - its arguments. It is pointed to by a field in the - callsite's corresponding cgraph_edge. */ -struct ipa_node +/* ipa_node_params stores information related to formal parameters of functions + and some other information for interprocedural passes that operate on + parameters (such as ipa-cp). */ +struct ipa_node_params { - /* Number of formal parameters of this method. When set to 0, - this method's parameters would not be analyzed by the different + /* Number of formal parameters of this function. When set to 0, + this function's parameters would not be analyzed by the different stages of IPA CP. */ - int ipa_arg_num; - /* Array of cvals. */ - struct ipcp_formal *ipcp_cval; - /* Mapping each parameter to its PARM_DECL tree. */ - tree *ipa_param_tree; - /* Indicating which parameter is modified in its method. */ - bool *ipa_mod; + int param_count; + /* Whether this function is called with variable number of actual + arguments. */ + unsigned called_with_var_arguments : 1; + /* Whether the modification analysis has already been performed. */ + unsigned modification_analysis_done : 1; + /* Whether the param uses analysis has already been performed. */ + unsigned uses_analysis_done : 1; + /* Whether the function is enqueued in an ipa_func_list. */ + unsigned node_enqueued : 1; + /* Pointer to an array of structures describing individual formal + parameters. */ + struct ipa_param_descriptor *params; /* Only for versioned nodes this field would not be NULL, it points to the node that IPA cp cloned from. */ struct cgraph_node *ipcp_orig_node; - /* Meaningful only for original methods. Expresses the - ratio between the direct calls and sum of all invocations of - this function (given by profiling info). It is used to calculate + /* Meaningful only for original functions. Expresses the + ratio between the direct calls and sum of all invocations of + this function (given by profiling info). It is used to calculate the profiling information of the original function and the versioned one. */ gcov_type count_scale; }; -struct ipa_edge +/* ipa_node_params access functions. Please use these to access fields that + are or will be shared among various passes. */ + +/* Set the number of formal parameters. */ + +static inline void +ipa_set_param_count (struct ipa_node_params *info, int count) +{ + info->param_count = count; +} + +/* Return the number of formal parameters. */ + +static inline int +ipa_get_param_count (struct ipa_node_params *info) +{ + return info->param_count; +} + +/* Return the declaration of Ith formal parameter of the function corresponding + to INFO. Note there is no setter function as this array is built just once + using ipa_initialize_node_params. */ + +static inline tree +ipa_get_param (struct ipa_node_params *info, int i) +{ + return info->params[i].decl; +} + +/* Return the modification flag corresponding to the Ith formal parameter of + the function associated with INFO. Note that there is no setter method as + the goal is to set all flags when building the array in + ipa_detect_param_modifications. */ + +static inline bool +ipa_is_param_modified (struct ipa_node_params *info, int i) +{ + return info->params[i].modified; +} + +/* Return the used flag corresponding to the Ith formal parameter of + the function associated with INFO. */ + +static inline bool +ipa_is_param_used (struct ipa_node_params *info, int i) +{ + return info->params[i].used; +} + +/* Flag this node as having callers with variable number of arguments. */ + +static inline void +ipa_set_called_with_variable_arg (struct ipa_node_params *info) +{ + info->called_with_var_arguments = 1; +} + +/* Have we detected this node was called with variable number of arguments? */ + +static inline bool +ipa_is_called_with_var_arguments (struct ipa_node_params *info) +{ + return info->called_with_var_arguments; +} + + + +/* ipa_edge_args stores information related to a callsite and particularly + its arguments. It is pointed to by a field in the + callsite's corresponding cgraph_edge. */ +typedef struct GTY(()) ipa_edge_args { /* Number of actual arguments in this callsite. When set to 0, this callsite's parameters would not be analyzed by the different stages of IPA CP. */ - int ipa_param_num; + int argument_count; /* Array of the callsite's jump function of each parameter. */ - struct ipa_jump_func *ipa_param_map; -}; + struct ipa_jump_func GTY ((length ("%h.argument_count"))) *jump_functions; +} ipa_edge_args_t; + +/* ipa_edge_args access functions. Please use these to access fields that + are or will be shared among various passes. */ + +/* Set the number of actual arguments. */ + +static inline void +ipa_set_cs_argument_count (struct ipa_edge_args *args, int count) +{ + args->argument_count = count; +} + +/* Return the number of actual arguments. */ -/* A methodlist element (referred to also as methodlist node). It is used - to create a temporary worklist used in - the propagation stage of IPCP. (can be used for more IPA - optimizations) */ -struct ipa_methodlist +static inline int +ipa_get_cs_argument_count (struct ipa_edge_args *args) { - struct cgraph_node *method_p; - struct ipa_methodlist *next_method; + return args->argument_count; +} + +/* Returns a pointer to the jump function for the ith argument. Please note + there is no setter function as jump functions are all set up in + ipa_compute_jump_functions. */ + +static inline struct ipa_jump_func * +ipa_get_ith_jump_func (struct ipa_edge_args *args, int i) +{ + return &args->jump_functions[i]; +} + +/* Vectors need to have typedefs of structures. */ +typedef struct ipa_node_params ipa_node_params_t; + +/* Types of vectors holding the infos. */ +DEF_VEC_O (ipa_node_params_t); +DEF_VEC_ALLOC_O (ipa_node_params_t, heap); +DEF_VEC_O (ipa_edge_args_t); +DEF_VEC_ALLOC_O (ipa_edge_args_t, gc); + +/* Vector where the parameter infos are actually stored. */ +extern VEC (ipa_node_params_t, heap) *ipa_node_params_vector; +/* Vector where the parameter infos are actually stored. */ +extern GTY(()) VEC (ipa_edge_args_t, gc) *ipa_edge_args_vector; + +/* Return the associated parameter/argument info corresponding to the given + node/edge. */ +#define IPA_NODE_REF(NODE) (VEC_index (ipa_node_params_t, \ + ipa_node_params_vector, (NODE)->uid)) +#define IPA_EDGE_REF(EDGE) (VEC_index (ipa_edge_args_t, \ + ipa_edge_args_vector, (EDGE)->uid)) +/* This macro checks validity of index returned by + ipa_get_param_decl_index function. */ +#define IS_VALID_JUMP_FUNC_INDEX(I) ((I) != -1) + +/* Creating and freeing ipa_node_params and ipa_edge_args. */ +void ipa_create_all_node_params (void); +void ipa_create_all_edge_args (void); +void ipa_free_edge_args_substructures (struct ipa_edge_args *); +void ipa_free_node_params_substructures (struct ipa_node_params *); +void ipa_free_all_node_params (void); +void ipa_free_all_edge_args (void); +void ipa_create_all_structures_for_iinln (void); +void ipa_free_all_structures_after_ipa_cp (void); +void ipa_free_all_structures_after_iinln (void); +void ipa_register_cgraph_hooks (void); + +/* This function ensures the array of node param infos is big enough to + accommodate a structure for all nodes and reallocates it if not. */ + +static inline void +ipa_check_create_node_params (void) +{ + if (!ipa_node_params_vector) + ipa_node_params_vector = VEC_alloc (ipa_node_params_t, heap, + cgraph_max_uid); + + if (VEC_length (ipa_node_params_t, ipa_node_params_vector) + <= (unsigned) cgraph_max_uid) + VEC_safe_grow_cleared (ipa_node_params_t, heap, + ipa_node_params_vector, cgraph_max_uid + 1); +} + +/* This function ensures the array of edge arguments infos is big enough to + accommodate a structure for all edges and reallocates it if not. */ + +static inline void +ipa_check_create_edge_args (void) +{ + if (!ipa_edge_args_vector) + ipa_edge_args_vector = VEC_alloc (ipa_edge_args_t, gc, + cgraph_edge_max_uid); + + if (VEC_length (ipa_edge_args_t, ipa_edge_args_vector) + <= (unsigned) cgraph_edge_max_uid) + VEC_safe_grow_cleared (ipa_edge_args_t, gc, ipa_edge_args_vector, + cgraph_edge_max_uid + 1); +} + +/* Returns true if the array of edge infos is large enough to accommodate an + info for EDGE. The main purpose of this function is that debug dumping + function can check info availability without causing reallocations. */ + +static inline bool +ipa_edge_args_info_available_for_edge_p (struct cgraph_edge *edge) +{ + return ((unsigned) edge->uid < VEC_length (ipa_edge_args_t, + ipa_edge_args_vector)); +} + +/* A function list element. It is used to create a temporary worklist used in + the propagation stage of IPCP. (can be used for more IPA optimizations) */ +struct ipa_func_list +{ + struct cgraph_node *node; + struct ipa_func_list *next; }; -/* A pointer to a methodlist elemement. */ -typedef struct ipa_methodlist *ipa_methodlist_p; - -/* ipa_methodlist interface. */ -ipa_methodlist_p ipa_methodlist_init (void); -bool ipa_methodlist_not_empty (ipa_methodlist_p); -void ipa_add_method (ipa_methodlist_p *, struct cgraph_node *); -struct cgraph_node *ipa_remove_method (ipa_methodlist_p *); - -/* ipa_callsite interface. */ -int ipa_callsite_param_count (struct cgraph_edge *); -void ipa_callsite_param_count_set (struct cgraph_edge *, int); -struct ipa_jump_func *ipa_callsite_param (struct cgraph_edge *, int); -struct cgraph_node *ipa_callsite_callee (struct cgraph_edge *); -void ipa_callsite_compute_param (struct cgraph_edge *); -void ipa_callsite_compute_count (struct cgraph_edge *); - -/* ipa_method interface. */ -int ipa_method_formal_count (struct cgraph_node *); -void ipa_method_formal_count_set (struct cgraph_node *, int); -tree ipa_method_get_tree (struct cgraph_node *, int); -void ipa_method_compute_tree_map (struct cgraph_node *); -void ipa_method_formal_compute_count (struct cgraph_node *); -void ipa_method_compute_modify (struct cgraph_node *); - -/* jump function interface. */ -enum jump_func_type get_type (struct ipa_jump_func *); -union parameter_info *ipa_jf_get_info_type (struct ipa_jump_func *); - -/* ipa_node and ipa_edge interfaces. */ -void ipa_node_create (struct cgraph_node *); -void ipa_free (void); -void ipa_nodes_create (void); -void ipa_edges_create (void); -void ipa_edges_free (void); -void ipa_nodes_free (void); +/* ipa_func_list interface. */ +struct ipa_func_list *ipa_init_func_list (void); +void ipa_push_func_to_list_1 (struct ipa_func_list **, struct cgraph_node *, + struct ipa_node_params *); +struct cgraph_node *ipa_pop_func_from_list (struct ipa_func_list **); + +/* Add cgraph NODE to the worklist WL if it is not already in one. */ + +static inline void +ipa_push_func_to_list (struct ipa_func_list **wl, struct cgraph_node *node) +{ + struct ipa_node_params *info = IPA_NODE_REF (node); + + if (!info->node_enqueued) + ipa_push_func_to_list_1 (wl, node, info); +} + +/* Callsite related calculations. */ +void ipa_compute_jump_functions (struct cgraph_node *); +void ipa_count_arguments (struct cgraph_edge *); +/* Function formal parameters related computations. */ +void ipa_initialize_node_params (struct cgraph_node *node); +void ipa_detect_param_modifications (struct cgraph_node *); +void ipa_analyze_params_uses (struct cgraph_node *); +bool ipa_propagate_indirect_call_infos (struct cgraph_edge *cs, + VEC (cgraph_edge_p, heap) **new_edges); /* Debugging interface. */ -void ipa_method_tree_print (FILE *); -void ipa_method_modify_print (FILE *); +void ipa_print_node_params (FILE *, struct cgraph_node *node); +void ipa_print_all_params (FILE *); +void ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node); +void ipa_print_all_jump_functions (FILE * f); + +/* Structure to describe transformations of formal parameters and actual + arguments. Each instance describes one new parameter and they are meant to + be stored in a vector. Additionally, most users will probably want to store + adjustments about parameters that are being removed altogether so that SSA + names belonging to them can be replaced by SSA names of an artificial + variable. */ +struct ipa_parm_adjustment +{ + /* The original PARM_DECL itself, helpful for processing of the body of the + function itself. Intended for traversing function bodies. + ipa_modify_formal_parameters, ipa_modify_call_arguments and + ipa_combine_adjustments ignore this and use base_index. + ipa_modify_formal_parameters actually sets this. */ + tree base; + + /* Type of the new parameter. However, if by_ref is true, the real type will + be a pointer to this type. */ + tree type; + + /* The new declaration when creating/replacing a parameter. Created by + ipa_modify_formal_parameters, useful for functions modifying the body + accordingly. */ + tree reduction; + + /* New declaration of a substitute variable that we may use to replace all + non-default-def ssa names when a parm decl is going away. */ + tree new_ssa_base; + + /* If non-NULL and the original parameter is to be removed (copy_param below + is NULL), this is going to be its nonlocalized vars value. */ + tree nonlocal_value; + + /* Offset into the original parameter (for the cases when the new parameter + is a component of an original one). */ + HOST_WIDE_INT offset; + + /* Zero based index of the original parameter this one is based on. (ATM + there is no way to insert a new parameter out of the blue because there is + no need but if it arises the code can be easily exteded to do so.) */ + int base_index; + + /* This new parameter is an unmodified parameter at index base_index. */ + unsigned copy_param : 1; + + /* This adjustment describes a parameter that is about to be removed + completely. Most users will probably need to book keep those so that they + don't leave behinfd any non default def ssa names belonging to them. */ + unsigned remove_param : 1; + + /* The parameter is to be passed by reference. */ + unsigned by_ref : 1; +}; + +typedef struct ipa_parm_adjustment ipa_parm_adjustment_t; +DEF_VEC_O (ipa_parm_adjustment_t); +DEF_VEC_ALLOC_O (ipa_parm_adjustment_t, heap); + +typedef VEC (ipa_parm_adjustment_t, heap) *ipa_parm_adjustment_vec; + +VEC(tree, heap) *ipa_get_vector_of_formal_parms (tree fndecl); +void ipa_modify_formal_parameters (tree fndecl, ipa_parm_adjustment_vec, + const char *); +void ipa_modify_call_arguments (struct cgraph_edge *, gimple, + ipa_parm_adjustment_vec); +ipa_parm_adjustment_vec ipa_combine_adjustments (ipa_parm_adjustment_vec, + ipa_parm_adjustment_vec); +void ipa_dump_param_adjustments (FILE *, ipa_parm_adjustment_vec, tree); + +void ipa_prop_write_jump_functions (cgraph_node_set set); +void ipa_prop_read_jump_functions (void); +void ipa_update_after_lto_read (void); -void ipcp_driver (void); +/* From tree-sra.c: */ +bool build_ref_for_offset (tree *, tree, HOST_WIDE_INT, tree, bool); #endif /* IPA_PROP_H */