X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgraph.h;h=bb612fd735ce1a5a02424dad5010a9bdc1b7c5d2;hb=005e4e81424397a0cb96cd961427bddee14d7b4e;hp=8a3fe64481ba75274d97be50044372b9aebc17e4;hpb=5cf3f4134c6d6e9b00749fcbaca703b6c19d90b1;p=libfirm diff --git a/ir/ir/irgraph.h b/ir/ir/irgraph.h index 8a3fe6448..bb612fd73 100644 --- a/ir/ir/irgraph.h +++ b/ir/ir/irgraph.h @@ -17,26 +17,15 @@ * * @author Martin Trapp, Christian Schaefer */ +#ifndef _IRGRAPH_H_ +#define _IRGRAPH_H_ #include +#include "firm_types.h" #include "irop.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 "irextbb.h" +#include "type.h" /** * @page ir_graph The struct ir_graph @@ -67,9 +56,9 @@ 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. * @@ -82,7 +71,7 @@ typedef struct ir_graph ir_graph; * 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 off the args node. + * *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. @@ -90,7 +79,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. * @@ -100,7 +89,7 @@ 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 + * procedure. This is needed for ir construction. Name will * be changed. * * *value_table This hash table (pset) is used for global value numbering @@ -125,7 +114,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); @@ -150,13 +139,13 @@ void set_interprocedural_view(int state); * - The start block containing a start node and Proj nodes for it's * five results (X, M, P, P, T). * - 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. * @@ -197,10 +186,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); @@ -216,7 +203,7 @@ 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); @@ -249,9 +236,9 @@ ir_node *get_irg_args (const ir_graph *irg); /** Sets the node that represents the argument pointer. */ void set_irg_args (ir_graph *irg, ir_node *node); -/** Returns an array of the nodes off the argument pointer. */ +/** Returns an array of the nodes of the argument pointer. */ ir_node **get_irg_proj_args (const ir_graph *irg); -/** Sets the array of the nodes off the argument pointer. */ +/** Sets the array of the nodes of the argument pointer. */ void set_irg_proj_args (ir_graph *irg, ir_node **nodes); /** Returns the current block of a graph. */ @@ -293,7 +280,7 @@ long get_irg_graph_nr(ir_graph *irg); * * 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? * */ @@ -331,29 +318,27 @@ irg_outs_state get_irg_outs_state(const ir_graph *irg); void set_irg_outs_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 - data flow of the procedure. */ + * Loop information describes the loops within the control and + * data flow of the procedure. + */ typedef enum { loopinfo_none = 0, /**< No loop information is constructed. Default. */ loopinfo_constructed = 1, /**< Some kind of loop information is constructed. */ @@ -362,10 +347,10 @@ typedef enum { loopinfo_inter = 8, /**< Loop information for interprocedural view. */ loopinfo_for_firmjni = 16, /**< A hack for firmjni: all enums must differ as they - are used in a switch. */ + are used in a switch. */ /** IntRAprocedural loop information constructed and valid. */ - loopinfo_consistent = loopinfo_constructed | loopinfo_valid, + loopinfo_consistent = loopinfo_constructed | loopinfo_for_firmjni | loopinfo_valid, /** IntRAprocedural loop information constructed and invalid. */ loopinfo_inconsistent = loopinfo_constructed | loopinfo_for_firmjni, @@ -385,11 +370,19 @@ typedef enum { loopinfo_cf_ip_inconsistent = loopinfo_constructed | loopinfo_cf | loopinfo_inter } irg_loopinfo_state; +/** Return the current loop information state. */ irg_loopinfo_state get_irg_loopinfo_state(const ir_graph *irg); + +/** Sets the current loop information state. */ void set_irg_loopinfo_state(ir_graph *irg, irg_loopinfo_state s); -/** Sets the loopinformation state to the appropriate inconsistent state. - If state is 'none' does not change. */ + +/** Sets the loop information state to the appropriate inconsistent state. + * If state is 'none' does not change. */ void set_irg_loopinfo_inconsistent(ir_graph *irg); +/** Sets the loop information state to the appropriate inconsistent state. + * If state is 'none' does not change. + * Does this for all irgs. */ +void set_irp_loopinfo_inconsistent(void); /** state: callee_information_state * Call nodes contain a list of possible callees. This list must be @@ -425,6 +418,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); @@ -455,6 +462,11 @@ 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); + /** * Access custom graph data. * The data must have been registered with @@ -479,7 +491,7 @@ 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. */