X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fcgraph.h;h=782580466dd5e2851a3f96b9a9cef30e5d4e1172;hb=d4c3dca6accbdc3c4573c6078880ad1b36a81d44;hp=78b0fad3e862f3bfa77fae60d0e0bf178bc42693;hpb=469679aba0e296a3f7635b30532d76ea6a433861;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/cgraph.h b/gcc/cgraph.h index 78b0fad3e86..782580466dd 100644 --- a/gcc/cgraph.h +++ b/gcc/cgraph.h @@ -1,12 +1,13 @@ /* Callgraph handling code. - Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc. + Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 + Free Software Foundation, Inc. Contributed by Jan Hubicka 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 @@ -15,9 +16,8 @@ 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_CGRAPH_H #define GCC_CGRAPH_H @@ -46,49 +46,62 @@ enum availability AVAIL_LOCAL }; +extern const char * const cgraph_availability_names[]; + /* Information about the function collected locally. Available after function is analyzed. */ struct cgraph_local_info GTY(()) { - /* Size of the function before inlining. */ - int self_insns; + struct inline_summary { + /* Estimated stack frame consumption by the function. */ + HOST_WIDE_INT estimated_self_stack_size; + + /* Size of the function before inlining. */ + int self_insns; + } inline_summary; /* Set when function function is visible in current compilation unit only and its address is never taken. */ - bool local; + unsigned local : 1; /* Set when function is visible by other units. */ - bool externally_visible; + unsigned externally_visible : 1; /* Set once it has been finalized so we consider it to be output. */ - bool finalized; + unsigned finalized : 1; /* False when there something makes inlining impossible (such as va_arg). */ - bool inlinable; + unsigned inlinable : 1; /* True when function should be inlined independently on its size. */ - bool disregard_inline_limits; + unsigned disregard_inline_limits : 1; /* True when the function has been originally extern inline, but it is redefined now. */ - bool redefined_extern_inline; + unsigned redefined_extern_inline : 1; /* True if statics_read_for_function and statics_written_for_function contain valid data. */ - bool for_functions_valid; + unsigned for_functions_valid : 1; /* True if the function is going to be emitted in some other translation unit, referenced from vtable. */ - bool vtable_method; + unsigned vtable_method : 1; }; /* Information about the function that needs to be computed globally - once compilation is finished. Available only with -funit-at-time. */ + once compilation is finished. Available only with -funit-at-a-time. */ struct cgraph_global_info GTY(()) { - /* For inline clones this points to the function they will be inlined into. */ + /* Estimated stack frame consumption by the function. */ + HOST_WIDE_INT estimated_stack_size; + /* Expected offset of the stack frame of inlined function. */ + HOST_WIDE_INT stack_frame_offset; + + /* For inline clones this points to the function they will be + inlined into. */ struct cgraph_node *inlined_to; /* Estimated size of the function after inlining. */ @@ -106,7 +119,7 @@ struct cgraph_global_info GTY(()) struct cgraph_rtl_info GTY(()) { - int preferred_incoming_stack_boundary; + unsigned int preferred_incoming_stack_boundary; }; /* The cgraph data structure. @@ -133,39 +146,50 @@ struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous"))) /* Pointer to a single unique cgraph node for this function. If the function is to be output, this is the copy that will survive. */ struct cgraph_node *master_clone; - + /* For functions with many calls sites it holds map from call expression + to the edge to speed up cgraph_edge function. */ + htab_t GTY((param_is (struct cgraph_edge))) call_site_hash; + PTR GTY ((skip)) aux; struct cgraph_local_info local; struct cgraph_global_info global; struct cgraph_rtl_info rtl; - + /* Expected number of executions: calculated in profile.c. */ gcov_type count; /* Unique id of the node. */ int uid; + /* Ordering of all cgraph nodes. */ + int order; + /* Set when function must be output - it is externally visible or its address is taken. */ - bool needed; + unsigned needed : 1; + /* Set when decl is an abstract function pointed to by the + ABSTRACT_DECL_ORIGIN of a reachable function. */ + unsigned abstract_and_needed : 1; /* Set when function is reachable by call from other function that is either reachable or needed. */ - bool reachable; - /* Set once the function is lowered (ie it's CFG is built). */ - bool lowered; + unsigned reachable : 1; + /* Set once the function is lowered (i.e. its CFG is built). */ + unsigned lowered : 1; /* Set once the function has been instantiated and its callee lists created. */ - bool analyzed; + unsigned analyzed : 1; /* Set when function is scheduled to be assembled. */ - bool output; - /* Set when function is visible by other units. */ - bool externally_visible; + unsigned output : 1; /* Set for aliases once they got through assemble_alias. */ - bool alias; + unsigned alias : 1; /* In non-unit-at-a-time mode the function body of inline candidates is saved into clone before compiling so the function in original form can be inlined later. This pointer points to the clone. */ tree inline_decl; + + /* unique id for profiling. pid is not suitable because of different + number of cfg nodes with -fprofile-generate and -fprofile-use */ + int pid; }; struct cgraph_edge GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"))) @@ -176,104 +200,147 @@ struct cgraph_edge GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_call struct cgraph_edge *next_caller; struct cgraph_edge *prev_callee; struct cgraph_edge *next_callee; - tree call_stmt; + gimple call_stmt; PTR GTY ((skip (""))) aux; /* When NULL, inline this call. When non-NULL, points to the explanation why function was not inlined. */ const char *inline_failed; /* Expected number of executions: calculated in profile.c. */ gcov_type count; + /* Expected frequency of executions within the function. + When set to CGRAPH_FREQ_BASE, the edge is expected to be called once + per function call. The range is 0 to CGRAPH_FREQ_MAX. */ + int frequency; /* Depth of loop nest, 1 means no loop nest. */ - int loop_nest; + unsigned int loop_nest : 31; + /* Whether this edge describes a call that was originally indirect. */ + unsigned int indirect_call : 1; + /* Unique id of the edge. */ + int uid; }; -/* The cgraph_varpool data structure. - Each static variable decl has assigned cgraph_varpool_node. */ +#define CGRAPH_FREQ_BASE 1000 +#define CGRAPH_FREQ_MAX 100000 + +typedef struct cgraph_edge *cgraph_edge_p; + +DEF_VEC_P(cgraph_edge_p); +DEF_VEC_ALLOC_P(cgraph_edge_p,heap); + +/* The varpool data structure. + Each static variable decl has assigned varpool_node. */ -struct cgraph_varpool_node GTY(()) +struct varpool_node GTY((chain_next ("%h.next"))) { tree decl; - /* Pointer to the next function in cgraph_varpool_nodes. */ - struct cgraph_varpool_node *next; - /* Pointer to the next function in cgraph_varpool_nodes_queue. */ - struct cgraph_varpool_node *next_needed; + /* Pointer to the next function in varpool_nodes. */ + struct varpool_node *next; + /* Pointer to the next function in varpool_nodes_queue. */ + struct varpool_node *next_needed; + /* Ordering of all cgraph nodes. */ + int order; /* Set when function must be output - it is externally visible or its address is taken. */ - bool needed; + unsigned needed : 1; /* Needed variables might become dead by optimization. This flag forces the variable to be output even if it appears dead otherwise. */ - bool force_output; + unsigned force_output : 1; /* Set once the variable has been instantiated and its callee lists created. */ - bool analyzed; + unsigned analyzed : 1; /* Set once it has been finalized so we consider it to be output. */ - bool finalized; + unsigned finalized : 1; /* Set when variable is scheduled to be assembled. */ - bool output; + unsigned output : 1; /* Set when function is visible by other units. */ - bool externally_visible; + unsigned externally_visible : 1; /* Set for aliases once they got through assemble_alias. */ - bool alias; + unsigned alias : 1; +}; + +/* Every top level asm statement is put into a cgraph_asm_node. */ + +struct cgraph_asm_node GTY(()) +{ + /* Next asm node. */ + struct cgraph_asm_node *next; + /* String for this asm node. */ + tree asm_str; + /* Ordering of all cgraph nodes. */ + int order; }; extern GTY(()) struct cgraph_node *cgraph_nodes; extern GTY(()) int cgraph_n_nodes; extern GTY(()) int cgraph_max_uid; +extern GTY(()) int cgraph_edge_max_uid; +extern GTY(()) int cgraph_max_pid; extern bool cgraph_global_info_ready; +enum cgraph_state +{ + /* Callgraph is being constructed. It is safe to add new functions. */ + CGRAPH_STATE_CONSTRUCTION, + /* Callgraph is built and IPA passes are being run. */ + CGRAPH_STATE_IPA, + /* Callgraph is built and all functions are transformed to SSA form. */ + CGRAPH_STATE_IPA_SSA, + /* Functions are now ordered and being passed to RTL expanders. */ + CGRAPH_STATE_EXPANSION, + /* All cgraph expansion is done. */ + CGRAPH_STATE_FINISHED +}; +extern enum cgraph_state cgraph_state; extern bool cgraph_function_flags_ready; extern GTY(()) struct cgraph_node *cgraph_nodes_queue; +extern GTY(()) struct cgraph_node *cgraph_new_nodes; -extern GTY(()) struct cgraph_varpool_node *cgraph_varpool_first_unanalyzed_node; -extern GTY(()) struct cgraph_varpool_node *cgraph_varpool_nodes_queue; +extern GTY(()) struct cgraph_asm_node *cgraph_asm_nodes; +extern GTY(()) int cgraph_order; /* In cgraph.c */ void dump_cgraph (FILE *); +void debug_cgraph (void); void dump_cgraph_node (FILE *, struct cgraph_node *); +void debug_cgraph_node (struct cgraph_node *); void cgraph_insert_node_to_hashtable (struct cgraph_node *node); -void dump_varpool (FILE *); -void dump_cgraph_varpool_node (FILE *, struct cgraph_varpool_node *); void cgraph_remove_edge (struct cgraph_edge *); void cgraph_remove_node (struct cgraph_node *); +void cgraph_release_function_body (struct cgraph_node *); void cgraph_node_remove_callees (struct cgraph_node *node); struct cgraph_edge *cgraph_create_edge (struct cgraph_node *, struct cgraph_node *, - tree, gcov_type, int); + gimple, gcov_type, int, int); struct cgraph_node *cgraph_node (tree); struct cgraph_node *cgraph_node_for_asm (tree asmname); -struct cgraph_edge *cgraph_edge (struct cgraph_node *, tree); +struct cgraph_edge *cgraph_edge (struct cgraph_node *, gimple); +void cgraph_set_call_stmt (struct cgraph_edge *, gimple); +void cgraph_update_edges_for_call_stmt (gimple, gimple); struct cgraph_local_info *cgraph_local_info (tree); struct cgraph_global_info *cgraph_global_info (tree); struct cgraph_rtl_info *cgraph_rtl_info (tree); const char * cgraph_node_name (struct cgraph_node *); struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *, - struct cgraph_node *, - tree, gcov_type, int, bool); -struct cgraph_node * cgraph_clone_node (struct cgraph_node *, gcov_type, + struct cgraph_node *, + gimple, gcov_type, int, int, bool); +struct cgraph_node * cgraph_clone_node (struct cgraph_node *, gcov_type, int, int, bool); -struct cgraph_varpool_node *cgraph_varpool_node (tree); -struct cgraph_varpool_node *cgraph_varpool_node_for_asm (tree asmname); -void cgraph_varpool_mark_needed_node (struct cgraph_varpool_node *); -void cgraph_varpool_finalize_decl (tree); void cgraph_redirect_edge_callee (struct cgraph_edge *, struct cgraph_node *); +struct cgraph_asm_node *cgraph_add_asm_node (tree); + bool cgraph_function_possibly_inlined_p (tree); void cgraph_unnest_node (struct cgraph_node *); -void cgraph_varpool_enqueue_needed_node (struct cgraph_varpool_node *); -void cgraph_varpool_reset_queue (void); -bool decide_is_variable_needed (struct cgraph_varpool_node *, tree); enum availability cgraph_function_body_availability (struct cgraph_node *); -enum availability cgraph_variable_initializer_availability (struct cgraph_varpool_node *); bool cgraph_is_master_clone (struct cgraph_node *); struct cgraph_node *cgraph_master_clone (struct cgraph_node *); +void cgraph_add_new_function (tree, bool); /* In cgraphunit.c */ -bool cgraph_assemble_pending_functions (void); -bool cgraph_varpool_assemble_pending_decls (void); void cgraph_finalize_function (tree, bool); -void cgraph_lower_function (struct cgraph_node *); +void cgraph_mark_if_needed (tree); void cgraph_finalize_compilation_unit (void); void cgraph_optimize (void); void cgraph_mark_needed_node (struct cgraph_node *); @@ -286,16 +353,113 @@ void cgraph_build_static_cdtor (char which, tree body, int priority); void cgraph_reset_static_var_maps (void); void init_cgraph (void); struct cgraph_node *cgraph_function_versioning (struct cgraph_node *, - varray_type, varray_type); + VEC(cgraph_edge_p,heap)*, + varray_type, + bitmap); +void cgraph_analyze_function (struct cgraph_node *); struct cgraph_node *save_inline_function_body (struct cgraph_node *); +void record_references_in_initializer (tree); +bool cgraph_process_new_functions (void); + +typedef void (*cgraph_edge_hook)(struct cgraph_edge *, void *); +typedef void (*cgraph_node_hook)(struct cgraph_node *, void *); +typedef void (*cgraph_2edge_hook)(struct cgraph_edge *, struct cgraph_edge *, + void *); +typedef void (*cgraph_2node_hook)(struct cgraph_node *, struct cgraph_node *, + void *); +struct cgraph_edge_hook_list; +struct cgraph_node_hook_list; +struct cgraph_2edge_hook_list; +struct cgraph_2node_hook_list; +struct cgraph_edge_hook_list *cgraph_add_edge_removal_hook (cgraph_edge_hook, void *); +void cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *); +struct cgraph_node_hook_list *cgraph_add_node_removal_hook (cgraph_node_hook, + void *); +void cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *); +struct cgraph_node_hook_list *cgraph_add_function_insertion_hook (cgraph_node_hook, + void *); +void cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *); +void cgraph_call_function_insertion_hooks (struct cgraph_node *node); +struct cgraph_2edge_hook_list *cgraph_add_edge_duplication_hook (cgraph_2edge_hook, void *); +void cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *); +struct cgraph_2node_hook_list *cgraph_add_node_duplication_hook (cgraph_2node_hook, void *); +void cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *); + +/* In cgraphbuild.c */ +unsigned int rebuild_cgraph_edges (void); +int compute_call_stmt_bb_frequency (basic_block bb); /* In ipa.c */ bool cgraph_remove_unreachable_nodes (bool, FILE *); int cgraph_postorder (struct cgraph_node **); +bool cgraph_maybe_hot_edge_p (struct cgraph_edge *e); + +/* In varpool.c */ + +extern GTY(()) struct varpool_node *varpool_nodes_queue; +extern GTY(()) struct varpool_node *varpool_nodes; + +struct varpool_node *varpool_node (tree); +struct varpool_node *varpool_node_for_asm (tree asmname); +void varpool_mark_needed_node (struct varpool_node *); +void dump_varpool (FILE *); +void dump_varpool_node (FILE *, struct varpool_node *); + +void varpool_finalize_decl (tree); +bool decide_is_variable_needed (struct varpool_node *, tree); +enum availability cgraph_variable_initializer_availability (struct varpool_node *); + +bool varpool_assemble_pending_decls (void); +bool varpool_assemble_decl (struct varpool_node *node); +bool varpool_analyze_pending_decls (void); +void varpool_output_debug_info (void); +void varpool_remove_unreferenced_decls (void); +void varpool_empty_needed_queue (void); + +/* Walk all reachable static variables. */ +#define FOR_EACH_STATIC_VARIABLE(node) \ + for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed) + +/* Return first reachable static variable with initializer. */ +static inline struct varpool_node * +varpool_first_static_initializer (void) +{ + struct varpool_node *node; + for (node = varpool_nodes_queue; node; node = node->next_needed) + { + gcc_assert (TREE_CODE (node->decl) == VAR_DECL); + if (DECL_INITIAL (node->decl)) + return node; + } + return NULL; +} + +/* Return next reachable static variable with initializer after NODE. */ +static inline struct varpool_node * +varpool_next_static_initializer (struct varpool_node *node) +{ + for (node = node->next_needed; node; node = node->next_needed) + { + gcc_assert (TREE_CODE (node->decl) == VAR_DECL); + if (DECL_INITIAL (node->decl)) + return node; + } + return NULL; +} + +/* Walk all static variables with initializer set. */ +#define FOR_EACH_STATIC_INITIALIZER(node) \ + for ((node) = varpool_first_static_initializer (); (node); \ + (node) = varpool_next_static_initializer (node)) + /* In ipa-inline.c */ -bool cgraph_decide_inlining_incrementally (struct cgraph_node *, bool); void cgraph_clone_inlined_nodes (struct cgraph_edge *, bool, bool); -void cgraph_mark_inline_edge (struct cgraph_edge *, bool); bool cgraph_default_inline_p (struct cgraph_node *, const char **); +unsigned int compute_inline_parameters (struct cgraph_node *); + + +/* Create a new static variable of type TYPE. */ +tree add_new_static_var (tree type); + #endif /* GCC_CGRAPH_H */