X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgraph.h;h=115dc9ff9c675c7e25d218ebde901ad40a6f07ee;hb=b78bdd4d94de46de4156272e6dbfe44e97933a5b;hp=d0e2ab7b9d109b68d4caa41bad6a18fc4c2c46d0;hpb=4e590dc907142aec3ca03d78b9b30e06c1ca42cd;p=libfirm diff --git a/ir/ir/irgraph.h b/ir/ir/irgraph.h index d0e2ab7b9..115dc9ff9 100644 --- a/ir/ir/irgraph.h +++ b/ir/ir/irgraph.h @@ -17,27 +17,15 @@ * * @author Martin Trapp, Christian Schaefer */ +#ifndef _FIRM_IR_IRGRAPH_H_ +#define _FIRM_IR_IRGRAPH_H_ #include +#include "firm_types.h" #include "irop.h" #include "irextbb.h" - -# ifndef _IRGRAPH_H_ -# define _IRGRAPH_H_ -# include "entity.h" - -/* to resolve recursion between irnode.h and irgraph.h */ -#ifndef _IR_NODE_TYPEDEF_ -#define _IR_NODE_TYPEDEF_ -typedef struct ir_node ir_node; -#endif - -/* to resolve recursion between entity.h and irgraph.h */ -#ifndef _IR_GRAPH_TYPEDEF_ -#define _IR_GRAPH_TYPEDEF_ -typedef struct ir_graph ir_graph; -#endif +#include "type.h" /** * @page ir_graph The struct ir_graph @@ -68,22 +56,26 @@ typedef struct ir_graph ir_graph; * *frame The ir_node producing the pointer to the stack frame of * the procedure as output. This is the Proj node on the * third output of the start node. This output of the start - * node is tagged as pns_frame_base. In FIRM most lokal + * node is tagged as pns_frame_base. In FIRM most local * variables are modeled as data flow edges. Static - * allocated arrays can not be represented as dataflow + * allocated arrays can not be represented as data flow * edges. Therefore FIRM has to represent them in the stack * frame. * * *globals This models a pointer to a space in the memory where - * _all_ global things are held. Select from this pointer - * with a Sel node the pointer to a global variable / - * procedure / compiler known function... . + * _all_ global things are held. Select from this pointer + * with a Sel node the pointer to a global variable / + * procedure / compiler known function... . * - * *args The ir_node that produces the arguments of the method as - * it's result. This is a Proj node on the fourth output of - * the start node. This output is tagged as pn_Start_T_args. + * *tls This models a pointer to a space in the memory where + * thread local things are held. Select from this pointer + * with a Sel node the pointer to a thread local variable. * - * *proj_args The proj nodes of the args node. + * *args The ir_node that produces the arguments of the method as + * it's result. This is a Proj node on the fourth output of + * the start node. This output is tagged as pn_Start_T_args. + * + * *proj_args The proj nodes of the args node. * * *bad The Bad node is an auxiliary node. It is needed only once, * so there is this globally reachable node. @@ -91,7 +83,7 @@ typedef struct ir_graph ir_graph; * *no_mem The NoMem node is an auxiliary node. It is needed only once, * so there is this globally reachable node. * - * Datastructures that are private to a graph: + * Data structures that are private to a graph: * * *obst An obstack that contains all nodes. * @@ -101,14 +93,14 @@ typedef struct ir_graph ir_graph; * Only needed for ir construction. * * params/n_loc An int giving the number of local variables in this - * procedure. This is neede for ir construction. Name will - * be changed. + * procedure. This is needed for ir construction. Name will + * be changed. * * *value_table This hash table (pset) is used for global value numbering - * for optimizing use in iropt.c. + * for optimizing use in iropt.c. * * *Phi_in_stack; a stack needed for automatic Phi construction, needed only - * during ir construction. + * during ir construction. * * visited A int used as flag to traverse the ir_graph. * @@ -126,7 +118,7 @@ extern ir_graph *current_ir_graph; ir_graph *get_current_ir_graph(void); void set_current_ir_graph(ir_graph *graph); -/** This flag indicate the current view. The behaviour of some methods +/** This flag indicate the current view. The behavior of some methods * (get_irn_*, set_irn_*) is influenced by this flag. */ int get_interprocedural_view(void); void set_interprocedural_view(int state); @@ -149,15 +141,15 @@ void set_interprocedural_view(int state); * procedure: * * - The start block containing a start node and Proj nodes for it's - * five results (X, M, P, P, T). + * seven results (X, M, P, P, P, T, P). * - The end block containing an end node. This block is not matured - * after executing new_ir_graph as predecessors need to be added to it. + * after executing new_ir_graph() as predecessors need to be added to it. * (Maturing a block means fixing it's number of predecessors.) * - The current block, which is empty and also not matured. * - * Further it enters the global store into the datastructure of the start - * block that contanis all valid values in this block (set_store()). This - * datastructure is used to build the Phi nodes and removed after + * Further it enters the global store into the data structure of the start + * block that contains all valid values in this block (set_store()). This + * data structure is used to build the Phi nodes and removed after * completion of the graph. There is no path from end to start in the * graph after calling ir_graph. * @@ -198,10 +190,8 @@ int is_ir_graph(const void *thing); entity *get_irg_entity (const ir_graph *irg); void set_irg_entity (ir_graph *irg, entity *ent); -type *get_irg_frame_type (const ir_graph *irg); -void set_irg_frame_type (ir_graph *irg, type *ftp); -/* To test for a frame type. O(#irgs) if ftp is class type. */ -int is_frame_type (const type *ftp); +ir_type *get_irg_frame_type (ir_graph *irg); +void set_irg_frame_type (ir_graph *irg, ir_type *ftp); ir_node *get_irg_start_block (const ir_graph *irg); void set_irg_start_block (ir_graph *irg, ir_node *node); @@ -217,19 +207,13 @@ void set_irg_end (ir_graph *irg, ir_node *node); /* The fields end_reg and end_except contain the end nodes of the interprocedural view. If the view is not constructed they contain - the nomal end node. */ + the normal end node. */ ir_node *get_irg_end_reg (const ir_graph *irg); void set_irg_end_reg (ir_graph *irg, ir_node *node); ir_node *get_irg_end_except (const ir_graph *irg); void set_irg_end_except (ir_graph *irg, ir_node *node); - -/* @@@ oblivious, no more supported. */ -ir_node *get_irg_cstore (const ir_graph *irg); -void set_irg_cstore (ir_graph *irg, ir_node *node); -/* end oblivious */ - /** Returns the node that represents the frame pointer. */ ir_node *get_irg_frame (const ir_graph *irg); /** Sets the node that represents the frame pointer. */ @@ -240,6 +224,11 @@ ir_node *get_irg_globals (const ir_graph *irg); /** Sets the node that represents the global pointer. */ void set_irg_globals (ir_graph *irg, ir_node *node); +/** Returns the node that represents the tls pointer. */ +ir_node *get_irg_tls (const ir_graph *irg); +/** Sets the node that represents the tls pointer. */ +void set_irg_tls (ir_graph *irg, ir_node *node); + /** Returns the node that represents the initial memory. */ ir_node *get_irg_initial_mem (const ir_graph *irg); /** Sets the node that represents the initial memory. */ @@ -284,31 +273,36 @@ long get_irg_graph_nr(ir_graph *irg); /** The states of an ir graph. * - * state phase values: phase_building, phase_high, phase_low. + * state phase values: phase_building, phase_high, phase_low, phase_backend. * * The graph is in phase_building during construction of the irgraph. * The construction is finished by a call to finalize_cons(). * - * Finalize_cons() sets the state to phase_high. All Firm nodes are + * Finalize_cons() sets the state to phase_high. All stadard Firm nodes are * allowed. * * To get the irgraph into phase_low all Sel nodes must be removed and * replaced by explicit address computations. SymConst size and - * typetag nodes must be removed (@@@ really?). Initialization of + * type tag nodes must be removed (@@@ really?). Initialization of * memory allocated by Alloc must be explicit. @@@ More conditions? * + * phase_backend is set if architecture specific machine nodes are inserted + * (and probally most standard Firm are removed). */ typedef enum { phase_building, phase_high, - phase_low + phase_low, + phase_backend } irg_phase_state; /** returns the phase_state of an IR graph. */ irg_phase_state get_irg_phase_state (const ir_graph *irg); /** sets the phase state of an IR graph. */ -void set_irg_phase_low(ir_graph *irg); +void set_irg_phase_state(ir_graph *irg, irg_phase_state state); + +#define set_irg_phase_low(irg) set_irg_phase_state(irg, phase_low) /** state: op_pin_state_pinned The graph is "op_pin_state_pinned" if all nodes are associated with a basic block. @@ -331,26 +325,32 @@ typedef enum { irg_outs_state get_irg_outs_state(const ir_graph *irg); void set_irg_outs_inconsistent(ir_graph *irg); +/** state: extended basic block state. */ +typedef enum { + extblk_none = 0, /**< No extended basic block information is constructed. Default. */ + extblk_valid = 1, /**< Extended basic block information is valid. */ + extblk_invalid = 2 /**< Extended basic block information is constructed but invalid. */ +} irg_extblk_state; +irg_extblk_state get_irg_extblk_state(const ir_graph *irg); +void set_irg_extblk_inconsistent(ir_graph *irg); + /** state: dom_state - Signals the state of the dominator infomation. - Values: dom_none, dom_consistent, dom_inconsistent - dom_none: doms are not computed, no memory is allocated. The access routines - may not be used. - dom_consistent: dominator information is computed and correct, - dom_inconsistent: dominator information is computed, memory is still allocated, - but the graph has been changed since. Using the access routines is possible, - obtained information may be incorrect. */ + * Signals the state of the dominator / post dominator information. + */ typedef enum { - dom_none, /**< doms are not computed, no memory is allocated */ + dom_none, /**< dominator are not computed, no memory is allocated */ dom_consistent, /**< dominator information is computed and correct */ - dom_inconsistent /**< dominator information is computed but the graph has been changed since */ + dom_inconsistent /**< dominator information is computed but the graph has been changed since */ } irg_dom_state; -/** returns the dom_state of an IR graph. */ +/** returns the dominator state of an IR graph. */ irg_dom_state get_irg_dom_state(const ir_graph *irg); -/** sets the dom_state of an IR graph. */ -void set_irg_dom_inconsistent(ir_graph *irg); +/** returns the post dominator state of an IR graph. */ +irg_dom_state get_irg_postdom_state(const ir_graph *irg); + +/** sets the dominator and post dominator state of an IR graph to inconsistent. */ +void set_irg_doms_inconsistent(ir_graph *irg); /** state: loopinfo_state * Loop information describes the loops within the control and @@ -435,6 +435,20 @@ irg_inline_property get_irg_inline_property(const ir_graph *irg); /** Sets the inline property of a graph. */ void set_irg_inline_property(ir_graph *irg, irg_inline_property s); +/** + * Returns the mask of the additional graph properties. + * The properties are automatically inherited from the method type + * if they were not set using set_irg_additional_properties() or + * set_irg_additional_property(). + */ +unsigned get_irg_additional_properties(const ir_graph *irg); + +/** Sets the mask of the additional graph properties. */ +void set_irg_additional_properties(ir_graph *irg, unsigned property_mask); + +/** Sets one additional graph property. */ +void set_irg_additional_property(ir_graph *irg, mtp_additional_property flag); + /** A void * field to link arbitrary information to the node. */ void set_irg_link (ir_graph *irg, void *thing); void *get_irg_link (const ir_graph *irg); @@ -465,6 +479,14 @@ void set_irg_loc_description(ir_graph *irg, int n, void *description); /** get the description for local value n */ void *get_irg_loc_description(ir_graph *irg, int n); +/** Returns a estimated node count of the irg. This count is updated + * after every irg_walk_graph(). + */ +unsigned get_irg_estimated_node_cnt(const ir_graph *irg); + +/** Returns the last irn index for this graph. */ +unsigned get_irg_last_idx(const ir_graph *irg); + /** * Access custom graph data. * The data must have been registered with @@ -489,10 +511,10 @@ void *get_irg_loc_description(ir_graph *irg, int n); /** * Request additional data to be allocated with an ir graph. * @param size The size of the additional data required. - * @return A positive number, if the opration was successful, which + * @return A positive number, if the operation was successful, which * must be passed to the access macro get_irg_data(), 0 if the * registration failed. */ size_t register_additional_graph_data(size_t size); -# endif /* _IRGRAPH_H_ */ +#endif /* _FIRM_IR_IRGRAPH_H_ */