X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgraph_t.h;h=1a5bbd0f7e31ad703825e8fe1583949c7864791a;hb=0952881a2714f8ec2e87a6f4829bd55f41a0c68d;hp=39ea3a8c94c22db012b0794ec1d5ecf12fbb0fd2;hpb=75bba3420ce91776ab8690b6cd3fc9ad1c5be965;p=libfirm diff --git a/ir/ir/irgraph_t.h b/ir/ir/irgraph_t.h index 39ea3a8c9..1a5bbd0f7 100644 --- a/ir/ir/irgraph_t.h +++ b/ir/ir/irgraph_t.h @@ -6,7 +6,7 @@ * Modified by: Goetz Lindenmaier, Michael Beck * Created: * CVS-ID: $Id$ - * Copyright: (c) 1998-2003 Universität Karlsruhe + * Copyright: (c) 1998-2007 Universität Karlsruhe * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. */ @@ -30,6 +30,7 @@ #include "typegmod.h" #include "tr_inheritance.h" #include "iredgekinds.h" +#include "irmemory.h" #include "irloop.h" #include "execution_frequency.h" @@ -75,26 +76,35 @@ enum irg_anchors { anchor_max }; -/** ir_graph holds all information for a procedure */ +/** A callgraph entry for callees. */ +typedef struct cg_callee_entry { + ir_graph *irg; /**< The called irg. */ + ir_node **call_list; /**< The list of all calls to the irg. */ + int max_depth; /**< Maximum depth of all Call nodes to irg. */ +} cg_callee_entry; + +/** + * An ir_graph holds all information for a procedure. + */ struct ir_graph { - firm_kind kind; /**< always set to k_ir_graph*/ + firm_kind kind; /**< Always set to k_ir_graph. */ /* -- Basics of the representation -- */ ir_entity *ent; /**< The entity of this procedure, i.e., the type of the procedure and the class it belongs to. */ ir_type *frame_type; /**< A class type representing the stack frame. Can include "inner" methods. */ - ir_node *anchors[anchor_max]; /**< anchor nodes */ - ir_node **proj_args; /**< projs of the methods arguments */ - struct obstack *obst; /**< obstack where all of the ir_nodes live */ - ir_node *current_block; /**< block for newly gen_*()-erated ir_nodes */ - struct obstack *extbb_obst; /**< obstack for extended basic block info */ + ir_node *anchors[anchor_max]; /**< List of anchor nodes. */ + ir_node **proj_args; /**< Projs of the methods arguments. */ + struct obstack *obst; /**< The obstack where all of the ir_nodes live. */ + ir_node *current_block; /**< Current block for newly gen_*()-erated ir_nodes. */ + struct obstack *extbb_obst; /**< The obstack for extended basic block info. */ - unsigned last_node_idx; /**< last IR node index for this graph */ + unsigned last_node_idx; /**< The last IR node index for this graph. */ /* -- Fields for graph properties -- */ irg_inline_property inline_property; /**< How to handle inlineing. */ - unsigned additional_properties; /**< additional graph properties. */ + unsigned additional_properties; /**< Additional graph properties. */ /* -- Fields indicating different states of irgraph -- */ irg_phase_state phase_state; /**< Compiler phase. */ @@ -108,34 +118,36 @@ struct ir_graph { ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */ irg_extblk_info_state extblk_state; /**< State of extended basic block info. */ exec_freq_state execfreq_state; /**< Execution frequency state. */ + ir_address_taken_computed_state adr_taken_state; /**< Address taken state. */ + unsigned mem_disambig_opt; /**< Options for the memory disambiguator. */ unsigned fp_model; /**< floating point model of the graph. */ /* -- Fields for construction -- */ #if USE_EXPLICIT_PHI_IN_STACK - struct Phi_in_stack *Phi_in_stack; /**< needed for automatic Phi construction */ + struct Phi_in_stack *Phi_in_stack; /**< Needed for automatic Phi construction. */ #endif - int n_loc; /**< number of local variable in this + int n_loc; /**< Number of local variables in this procedure including procedure parameters. */ - void **loc_descriptions; /**< storage for local variable descriptions */ + void **loc_descriptions; /**< Storage for local variable descriptions. */ /* -- Fields for optimizations / analysis information -- */ - pset *value_table; /**< hash table for global value numbering (cse) - for optimizing use in iropt.c */ + pset *value_table; /**< Hash table for global value numbering (cse) + for optimizing use in iropt.c */ ir_node **outs; /**< Space for the out arrays. */ - ir_loop *loop; /**< The outermost loop */ + ir_loop *loop; /**< The outermost loop for this graph. */ void *link; /**< A void* field to link any information to - the node. */ + the node. */ - ir_graph **callers; /**< For callgraph analysis. */ + ir_graph **callers; /**< For callgraph analysis: list of caller graphs. */ unsigned char *caller_isbe; /**< For callgraph analysis: set if backedge. */ - ir_graph **callees; /**< For callgraph analysis. */ + cg_callee_entry **callees; /**< For callgraph analysis: list of callee calls */ unsigned char *callee_isbe; /**< For callgraph analysis: set if backedge. */ int callgraph_loop_depth; /**< For callgraph analysis */ int callgraph_recursion_depth; /**< For callgraph analysis */ double method_execution_frequency; /**< For callgraph analysis */ - ir_loop *l; + ir_loop *l; /**< For callgraph analysis. */ /* -- Fields for Walking the graph -- */ unsigned long visited; /**< this flag is an identifier for @@ -143,6 +155,8 @@ struct ir_graph { every time someone walks through the graph */ unsigned long block_visited; /**< same as visited, for a complete block */ + unsigned inside_irg_walk : 1; /**< set to 1 if we are currently in an irg walk */ + unsigned inside_block_walk : 1; /**< set to 1 if we are currently in a block walk */ unsigned estimated_node_count; /**< estimated number of nodes in this graph, updated after every walk */ irg_edges_info_t edge_info; /**< edge info for automatic outs */ @@ -150,8 +164,8 @@ struct ir_graph { #ifdef DEBUG_libfirm int n_outs; /**< Size wasted for outs */ - long graph_nr; /**< a unique graph number for each graph to make output - readable. */ + long graph_nr; /**< a unique graph number for each graph to make output + readable. */ #endif }; @@ -543,6 +557,36 @@ _dec_irg_block_visited(ir_graph *irg) { --irg->block_visited; } +static INLINE void +_set_inside_block_walk(ir_graph *irg) { + irg->inside_block_walk = 1; +} + +static INLINE void +_clear_inside_block_walk(ir_graph *irg) { + irg->inside_block_walk = 0; +} + +static INLINE unsigned +_inside_block_walk(const ir_graph *irg) { + return irg->inside_block_walk; +} + +static INLINE void +_set_inside_irg_walk(ir_graph *irg) { + irg->inside_irg_walk = 1; +} + +static INLINE void +_clear_inside_irg_walk(ir_graph *irg) { + irg->inside_irg_walk = 0; +} + +static INLINE unsigned +_inside_irg_walk(const ir_graph *irg) { + return irg->inside_irg_walk; +} + static INLINE unsigned _get_irg_estimated_node_cnt(const ir_graph *irg) { return irg->estimated_node_count; @@ -660,6 +704,12 @@ get_idx_irn(ir_graph *irg, unsigned idx) { #define set_irg_block_visited(irg, v) _set_irg_block_visited(irg, v) #define inc_irg_block_visited(irg) _inc_irg_block_visited(irg) #define dec_irg_block_visited(irg) _dec_irg_block_visited(irg) +#define set_inside_block_walk(irg) _set_inside_block_walk(irg) +#define clear_inside_block_walk(irg) _clear_inside_block_walk(irg) +#define inside_block_walk(irg) _inside_block_walk(irg) +#define set_inside_irg_walk(irg) _set_inside_irg_walk(irg) +#define clear_inside_irg_walk(irg) _clear_inside_irg_walk(irg) +#define inside_irg_walk(irg) _inside_irg_walk(irg) #define get_irg_estimated_node_cnt(irg) _get_irg_estimated_node_cnt(irg) #define get_irg_fp_model(irg) _get_irg_fp_model(irg)