X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Fircons.h;h=e4eda0d02fd1d08eb623c3ab22304202fd821259;hb=8399216d8aebc713bbda04b6e3e250a1d52b20bf;hp=8b7840652c9442a8a67a54918c6b5c55e4e0ecf7;hpb=13b742c94a08566a0a8183f86490fa6292460eb7;p=libfirm diff --git a/ir/ir/ircons.h b/ir/ir/ircons.h index 8b7840652..e4eda0d02 100644 --- a/ir/ir/ircons.h +++ b/ir/ir/ircons.h @@ -40,77 +40,6 @@ * * For extensive documentation of FIRM see UKA Techreport 1999-14. * - * ========= - * - * The struct ir_graph - * ------------------- - * - * This struct contains all information about a procedure. - * It's allocated directly to memory. - * - * The fields of ir_graph: - * - * *ent The entity describing this procedure. - * - * The beginning and end of a graph: - * - * *start_block This ir_node is the block that contains the unique - * start node of the procedure. With it it contains - * the Proj's on starts results. - * Further all Const nodes are placed in the start block. - * *start This ir_node is the unique start node of the procedure. - * - * *end_block This ir_node is the block that contains the unique - * end node of the procedure. This block contains no - * further nodes. - * *end This ir_node is the unique end node of the procedure. - * - * The following nodes are Projs from the start node, held in ir_graph for - * simple access: - * - * *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 - * variables are modeled as data flow edges. Static - * allocated arrays can not be represented as dataflow - * 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... . - * - * *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. - * - * *bad The bad node is an auxiliary node. It is needed only once, - * so there is this globally reachable node. - * - * Datastructures that are private to a graph: - * - * *obst An obstack that contains all nodes. - * - * *current_block A pointer to the current block. Any node created with - * one of the node constructors (new_) are assigned - * to this block. It can be set with set_cur_block(block). - * 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. - * - * *value_table This hash table (pset) is used for global value numbering - * for optimizing use in iropt.c. - * - * *Phi_in_stack; a stack needed for automatic Phi construction, needed only - * during ir construction. - * - * visited A int used as flag to traverse the ir_graph. - * - * block_visited A int used as a flag to traverse block nodes in the graph. * * Three kinds of nodes * -------------------- @@ -222,15 +151,15 @@ * * This library supplies several interfaces to construct a FIRM graph for * a program: - * * A "comfortable" interface generating SSA automatically. Automatically + * - A "comfortable" interface generating SSA automatically. Automatically * computed predecessors of nodes need not be specified in the constructors. * (new_ constructurs and a set of additional routines.) - * * A less comfortable interface where all predecessors except the block + * - A less comfortable interface where all predecessors except the block * an operation belongs to need to be specified. SSA must be constructed * by hand. (new_ constructors and set_cur_block()). This interface * is called "block oriented". It automatically calles the local optimizations * for each new node. - * * An even less comfortable interface where the block needs to be specified + * - An even less comfortable interface where the block needs to be specified * explicitly. This is called the "raw" interface. (new_r_ * constructors). These nodes are not optimized. * @@ -359,8 +288,8 @@ * ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, * type *free_type); * ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj); - * ir_node *new_FuncCall (ir_node *store, ir_node *callee, int arity, - * ir_node **in, type_method *type); + * ir_node *new_NoMem (void); + * ir_node *new_Mux (ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode); * * void add_immBlock_pred (ir_node *block, ir_node *jmp); * void mature_immBlock (ir_node *block); @@ -407,7 +336,8 @@ * The block can be completed by mature_immBlock(block) if all predecessors are * known. If several blocks are built at once, mature_immBlock can only be called * after set_value has been called for all values that are life at the end - * of the block. This is necessary so that Phi nodes created mature_immBlock * get the right predecessors in case of cyclic dependencies. If all set_values + * of the block. This is necessary so that Phi nodes created mature_immBlock + * get the right predecessors in case of cyclic dependencies. If all set_values * of this block are called after maturing it and before calling get_value * in some block that is control flow dependent on this block, the construction * is correct. @@ -469,7 +399,7 @@ * later) optimizations are skipped. This is necessary to * construct Blocks in loops. Leaving Unknown in the Block after finishing * the construction may have strange effects, especially for interprocedural - * representation and analyses. + * representation and analysis. * * * CONTROL FLOW OPERATIONS @@ -587,8 +517,8 @@ * attr.con A tarval* pointer to the proper entry in the constant * table. * - * ir_node *new_SymConst (type *tp, symconst_addr_ent kind) - * ------------------------------------------------------------ + * ir_node *new_SymConst (union symconst_symbol value, symconst_addr_ent kind) + * --------------------------------------------------------------------------- * * There are three kinds of symbolic constants: * symconst_type_tag The symbolic constant represents a type tag. @@ -597,9 +527,9 @@ * variable. * To represent a pointer to an entity that is represented by an entity * datastructure don't use - * new_SymConst((type_or_id*)get_entity_ld_ident(ent), linkage_ptr_info);. + * new_SymConst((type_or_id*)get_entity_ld_ident(ent), symconst_addr_name);. * Use a real const instead: - * new_Const(mode_P_mach, tarval_p_from_entity(ent)); + * new_SymConst(mode_P_mach, tarval_p_from_entity(ent)); * This makes the Constant independent of name changes of the entity due to * mangling. * @@ -656,14 +586,14 @@ * ------------ * * Selects a field from an array type. The entity has as owner the array, as - * type the arrays element type. The indexes to access an array element are + * type the arrays element type. The indices to access an array element are * given also. * * Parameters: * *store The memory in which the object the entity should be selected from * is allocated. * *frame The pointer to the object. - * *arity number of array indexes. + * *arity number of array indices. * *in array with index inputs to the node. * *sel The entity to select. * @@ -706,26 +636,6 @@ * Attributes: * attr.call Contains the type information for the procedure. * - * ir_node *new_FuncCall (ir_node *callee, int arity, ir_node **in, type_method *type) - * ----------------------------------------------------------------------------------- - * - * Creates a procedure call to a function WITHOUT memory side effects. - * nodes of this kind are floating in contrast to Call nodes. - * Further, a procedure call with FuncCall cannot raise an exception! - * - * Parameters - * *callee A pointer to the called procedure. - * arity The number of procedure parameters. - * **in An array with the pointers to the parameters. - * The constructor copies this array. - * *type Type information of the procedure called. - * - * Inputs: - * The callee and the parameters. - * Output: - * A tuple containing the procedure results. - * Attributes: - * attr.call Contains the type information for the procedure. * * ir_node *new_Add (ir_node *op1, ir_node *op2, ir_mode *mode) * ------------------------------------------------------------ @@ -877,7 +787,7 @@ * later) optimizations are skipped. This is necessary to * construct Phi nodes in loops. Leaving Unknown in the Phi after finishing * the construction may have strange effects, especially for interprocedural - * representation and analyses. + * representation and analysis. * * Parameter * arity number of predecessors @@ -890,6 +800,13 @@ * Output * The definition valid in this block. * + * ir_node *new_Mux (ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode) + * ----------------------------------------------------------------------------- + * + * Creates a Mux node. This node implements the following semantic: + * If the sel node (which must be of mode_b) evaluates to true, its value is + * ir_true, else ir_false; + * * * OPERATIONS TO MANAGE MEMORY EXPLICITLY * -------------------------------------- @@ -979,7 +896,7 @@ * unifying the memories with a preceding Sync operation. * * Parameters - * arity The number of memories to syncronize. + * arity The number of memories to synchronize. * **in An array of pointers to nodes that produce an output of * type memory. * Inputs @@ -997,6 +914,13 @@ * Returns the unique Bad node current_ir_graph->bad. * This node is used to express results of dead code elimination. * + * ir_node *new_NoMem (void) + * ----------------------------------------------------------------------------------- + * + * Returns the unique NoMem node current_ir_graph->no_mem. + * This node is used as input for operations that need a Memory, but do not + * change it like Div by const != 0, analyzed calls etc. + * * ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj) * ---------------------------------------------------------- * @@ -1075,15 +999,15 @@ * * There are two special routines for the global store: * - * inline void set_store (ir_node *store) - * -------------------------------------- + * void set_store (ir_node *store) + * ------------------------------- * * Adds the store to the array of known values at a reserved * position. * Requires current_block to be set correctly. * - * inline ir_node *get_store (void) - * -------------------------------- + * ir_node *get_store (void) + * ------------------------- * * Returns the node defining the actual store. * Requires current_block to be set correctly. @@ -1220,7 +1144,7 @@ ir_node *new_rd_Raise (dbg_info *db, ir_graph *irg, ir_node *block, * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. - * @param *mode The mode of the operands and redults. + * @param *mode The mode of the operands and results. * @param *con Points to an entry in the constant table. * @param *tp The type of the constant. */ @@ -1236,7 +1160,7 @@ ir_node *new_rd_Const_type (dbg_info* db, ir_graph *irg, ir_node *block, * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. - * @param *mode The mode of the operands and redults. + * @param *mode The mode of the operands and results. * @param *con Points to an entry in the constant table. */ ir_node *new_rd_Const (dbg_info *db, ir_graph *irg, ir_node *block, @@ -1286,28 +1210,28 @@ ir_node *new_rd_SymConst (dbg_info *db, ir_graph *irg, ir_node *block, * * Same as new_rd_SymConst_type, except that the constructor is tailored for * symconst_addr_ent. - * Adds the symconst to the start block of irg. */ + * Adds the SymConst to the start block of irg. */ ir_node *new_rd_SymConst_addr_ent (dbg_info *db, ir_graph *irg, entity *symbol, type *tp); /** Constructor for a SymConst addr_name node. * * Same as new_rd_SymConst_type, except that the constructor is tailored for * symconst_addr_ent. - * Adds the symconst to the start block of irg. */ + * Adds the SymConst to the start block of irg. */ ir_node *new_rd_SymConst_addr_name (dbg_info *db, ir_graph *irg, ident *symbol, type *tp); /** Constructor for a SymConst type_tag node. * * Same as new_rd_SymConst_type, except that the constructor is tailored for * symconst_addr_ent. - * Adds the symconst to the start block of irg. */ + * Adds the SymConst to the start block of irg. */ ir_node *new_rd_SymConst_type_tag (dbg_info *db, ir_graph *irg, type *symbol, type *tp); /** Constructor for a SymConst size node. * * Same as new_rd_SymConst_type, except that the constructor is tailored for * symconst_addr_ent. - * Adds the symconst to the start block of irg. */ + * Adds the SymConst to the start block of irg. */ ir_node *new_rd_SymConst_size (dbg_info *db, ir_graph *irg, type *symbol, type *tp); /** Constructor for a Sel node. @@ -1316,7 +1240,7 @@ ir_node *new_rd_SymConst_size (dbg_info *db, ir_graph *irg, type *symbol, type * * with a compound type. It explicitly specifies the entity selected. * Dynamically the node may select entities that overwrite the given * entity. If the selected entity is an array element entity the Sel - * node takes the required array indicees as inputs. + * node takes the required array indices as inputs. * * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. @@ -1325,8 +1249,8 @@ ir_node *new_rd_SymConst_size (dbg_info *db, ir_graph *irg, type *symbol, type * * from is allocated. * @param *objptr A pointer to a compound entity the Sel operation selects a * single attribute from. - * @param *n_index The number of array indicees needed to select an array element entity. - * @param *index[] If the compound entity is an array the indicees of the selected + * @param *n_index The number of array indices needed to select an array element entity. + * @param *index[] If the compound entity is an array the indices of the selected * element entity. The constructor copies this array. * @param *ent The entity to select. */ @@ -1363,24 +1287,6 @@ ir_node *new_rd_InstOf (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *st ir_node *new_rd_Call (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, ir_node *callee, int arity, ir_node *in[], type *tp); -/** Constructor for a FuncCall node. - * - * FuncCall is a function Call that has no side effects. Therefore there - * is not memory operand or result. - * - * @param *db A pointer for debug information. - * @param *irg The ir graph the node belong to. - * @param *block The block the node belong to. - * @param *callee A pointer to the called procedure. - * @param arity The number of procedure parameters. - * @param *in[] An array with the pointers to the parameters. The constructor - * copies this array. - * @param *tp Type information of the procedure called. - */ -ir_node *new_rd_FuncCall (dbg_info *db, ir_graph *irg, ir_node *block, - ir_node *callee, int arity, ir_node *in[], - type *tp); - /** Constructor for a Add node. * * @param *db A pointer for debug information. @@ -1694,7 +1600,7 @@ ir_node *new_rd_Free (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *st * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. - * @param arity The number of memories to syncronize. + * @param arity The number of memories to synchronize. * @param *in[] An array of pointers to nodes that produce an output of type * memory. The constructor copies this array. */ @@ -1705,7 +1611,7 @@ ir_node *new_rd_Sync (dbg_info *db, ir_graph *irg, ir_node *block, int arity, * Projects a single value out of a tuple. The parameter proj gives the * position of the value within the tuple. * - * @param *db A pointer for deubugginformation. + * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. * @param arg A node producing a tuple. The node must have mode_T. @@ -1837,6 +1743,7 @@ ir_node *new_rd_EndExcept(dbg_info *db, ir_graph *irg, ir_node *block); * * The constructor builds the Filter in intraprocedural view. * + * @param *db A pointer for debug information. * @param *irg The ir graph the node belong to. * @param *block The block the node belong to. * @param *arg The tuple value to project from. @@ -1846,6 +1753,29 @@ ir_node *new_rd_EndExcept(dbg_info *db, ir_graph *irg, ir_node *block); ir_node *new_rd_Filter (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode, long proj); +/** Constructor for a NoMem node. + * + * Returns the unique NoMem node of the graph. The same as + * get_irg_no_mem(). + * + * @param *irg The ir graph the node belongs to. + */ +ir_node *new_rd_NoMem (ir_graph *irg); + +/** Constructor for a Mux node. + * + * Adds the node to the block in current_ir_block. + * + * @param *db A pointer for debug information. + * @param *irg The ir graph the node belong to. + * @param *block The block the node belong to. + * @param *sel The ir_node that calculates the boolean select. + * @param *ir_true The ir_node that calculates the true result. + * @param *ir_false The ir_node that calculates the false result. + * @param *mode The mode of the node (and it_true and ir_false). + */ +ir_node *new_rd_Mux (dbg_info *db, ir_graph *irg, ir_node *block, + ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode); /*-------------------------------------------------------------------------*/ /* The raw interface without debug support */ @@ -1913,7 +1843,7 @@ ir_node *new_r_Cond (ir_graph *irg, ir_node *block, ir_node *c); * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. * @param *store The state of memory. - * @param arity Number of array indexes. + * @param arity Number of array indices. * @param *in[] Array with index inputs to the node. The constructor copies this array. */ ir_node *new_r_Return (ir_graph *irg, ir_node *block, @@ -1966,7 +1896,7 @@ ir_node *new_r_Const (ir_graph *irg, ir_node *block, * * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. - * @param volue A type, entity or a ident depending on the SymConst kind. + * @param value A type, entity or a ident depending on the SymConst kind. * @param symkind The kind of the symbolic constant: type_tag, size or link_info. */ ir_node *new_r_SymConst (ir_graph *irg, ir_node *block, @@ -1978,7 +1908,7 @@ ir_node *new_r_SymConst (ir_graph *irg, ir_node *block, * with a compound type. It explicitly specifies the entity selected. * Dynamically the node may select entities that overwrite the given * entity. If the selected entity is an array element entity the Sel - * node takes the required array indicees as inputs. + * node takes the required array indices as inputs. * * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. @@ -1986,8 +1916,8 @@ ir_node *new_r_SymConst (ir_graph *irg, ir_node *block, * from is allocated. * @param *objptr A pointer to a compound entity the Sel operation selects a * single attribute from. - * @param *n_index The number of array indicees needed to select an array element entity. - * @param *index[] If the compound entity is an array the indicees of the selected + * @param *n_index The number of array indices needed to select an array element entity. + * @param *index[] If the compound entity is an array the indices of the selected * element entity. The constructor copies this array. * @param *ent The entity to select. */ @@ -2310,7 +2240,7 @@ ir_node *new_r_Free (ir_graph *irg, ir_node *block, ir_node *store, * * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. - * @param arity The number of memories to syncronize. + * @param arity The number of memories to synchronize. * @param *in[] An array of pointers to nodes that produce an output of type memory. * The constructor copies this array. */ @@ -2399,7 +2329,7 @@ ir_node *new_r_Confirm (ir_graph *irg, ir_node *block, /** Constructor for a Unknown node. * - * Represents an arbtrary valus. Places the node in + * Represents an arbitrary value. Places the node in * the start block. * * @param *irg The ir graph the node belongs to. @@ -2416,7 +2346,7 @@ ir_node *new_r_Unknown(ir_graph *irg, ir_mode *m); * * @param *irg The ir graph the node belong to. * @param *block The block the node belong to. - * @param *callee The call node bisible in the intra procedural view. + * @param *callee The call node visible in the intra procedural view. */ ir_node *new_r_CallBegin(ir_graph *irg, ir_node *block, ir_node *callee); @@ -2470,22 +2400,28 @@ ir_node *new_r_Break (ir_graph *irg, ir_node *block); ir_node *new_r_Filter (ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode, long proj); -/** Constructor for a FuncCall node. +/** Constructor for a NoMem node. * - * FuncCall is a function Call that has no side effects. Therefore there - * is not memory operand or result. + * Returns the unique NoMem node of the graph. The same as + * get_irg_no_mem(). * - * @param *irg The ir graph the node belong to. - * @param *block The block the node belong to. - * @param *callee A pointer to the called procedure. - * @param arity The number of procedure parameters. - * @param *in[] An array with the pointers to the parameters. - * The constructor copies this array. - * @param *type Type information of the procedure called. + * @param *irg The ir graph the node belongs to. + */ +ir_node *new_r_NoMem (ir_graph *irg); + +/** Constructor for a Mux node. + * + * Adds the node to the block in current_ir_block. + * + * @param *irg The ir graph the node belong to. + * @param *block The block the node belong to. + * @param *sel The ir_node that calculates the boolean select. + * @param *ir_true The ir_node that calculates the true result. + * @param *ir_false The ir_node that calculates the false result. + * @param *mode The mode of the node (and it_true and ir_false). */ -ir_node *new_r_FuncCall (ir_graph *irg, ir_node *block, - ir_node *callee, int arity, ir_node *in[], - type *tp); +ir_node *new_r_Mux (ir_graph *irg, ir_node *block, + ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode); /*-----------------------------------------------------------------------*/ /* The block oriented interface */ @@ -2513,7 +2449,7 @@ ir_node *get_cur_block(void); * with a fixed number of predecessors. Does set current_block. Can * be used with automatic Phi node construction. * - * @param *db A Pointer for debugginfomation. + * @param *db A Pointer for debug information. * @param arity The number of control predecessors. * @param in[] An array of control predecessors. The length of * the array must be 'arity'. @@ -2573,7 +2509,7 @@ ir_node *new_d_Cond (dbg_info* db, ir_node *c); * * @param *db A pointer for debug information. * @param *store The state of memory. - * @param arity Number of array indexes. + * @param arity Number of array indices. * @param *in Array with index inputs to the node. */ @@ -2598,12 +2534,11 @@ ir_node *new_d_Raise (dbg_info* db, ir_node *store, ir_node *obj); * level type information for the constant value. * * @param *db A pointer for debug information. - * @param *mode The mode of the operands and redults. + * @param *mode The mode of the operands and results. * @param *con Points to an entry in the constant table. This pointer is added to the attributes of the node. - * @param *tp The type of the constante. + * @param *tp The type of the constant. */ - ir_node *new_d_Const_type (dbg_info* db, ir_mode *mode, tarval *con, type *tp); /** Constructor for a Const node. @@ -2615,7 +2550,7 @@ ir_node *new_d_Const_type (dbg_info* db, ir_mode *mode, tarval *con, type *tp); * supported: If tv is entity derives a somehow useful type.) * * @param *db A pointer for debug information. - * @param *mode The mode of the operands and redults. + * @param *mode The mode of the operands and results. * @param *con Points to an entry in the constant table. This pointer is added * to the attributes of the node. */ @@ -2678,7 +2613,7 @@ ir_node *new_d_simpleSel(dbg_info* db, ir_node *store, ir_node *objptr, entity * * with a compound type. It explicitly specifies the entity selected. * Dynamically the node may select entities that overwrite the given * entity. If the selected entity is an array element entity the Sel - * node takes the required array indicees as inputs. + * node takes the required array indices as inputs. * Adds the node to the block in current_ir_block. * * @param *db A pointer for debug information. @@ -2686,8 +2621,8 @@ ir_node *new_d_simpleSel(dbg_info* db, ir_node *store, ir_node *objptr, entity * * from is allocated. * @param *objptr A pointer to a compound entity the Sel operation selects a * single attribute from. - * @param *n_index The number of array indicees needed to select an array element entity. - * @param *index[] If the compound entity is an array the indicees of the selected + * @param *n_index The number of array indices needed to select an array element entity. + * @param *index[] If the compound entity is an array the indices of the selected * element entity. The constructor copies this array. * @param *ent The entity to select. */ @@ -2945,7 +2880,7 @@ ir_node *new_d_Cast (dbg_info* db, ir_node *op, type *to_tp); * * Adds the node to the block in current_ir_block. * - * @param *db A pointer for debugginaromation. + * @param *db A pointer for debug information. * @param arity The number of predecessors * @param *in Array with predecessors * @param *mode The mode of it's inputs and output. @@ -3011,7 +2946,7 @@ ir_node *new_d_Free (dbg_info* db, ir_node *store, ir_node *ptr, ir_node *size * Adds the node to the block in current_ir_block. * * @param *db A pointer for debug information. - * @param arity The number of memories to syncronize. + * @param arity The number of memories to synchronize. * @param **in An array of pointers to nodes that produce an output of type * memory. The constructor copies this array. */ @@ -3024,7 +2959,7 @@ ir_node *new_d_Sync (dbg_info* db, int arity, ir_node *in[]); * position of the value within the tuple. * Adds the node to the block in current_ir_block. * - * @param *db A pointer for deubugginformation. + * @param *db A pointer for deubug information. * @param arg A node producing a tuple. * @param *mode The mode of the value to project. * @param proj The position of the value in the tuple. @@ -3067,7 +3002,7 @@ ir_node *new_d_Tuple (dbg_info* db, int arity, ir_node *in[]); */ ir_node *new_d_Id (dbg_info* db, ir_node *val, ir_mode *mode); -/** Costructor for a Bad node. +/** Constructor for a Bad node. * * Returns the unique Bad node of the graph. The same as * get_irg_bad(). @@ -3092,7 +3027,7 @@ ir_node *new_d_Confirm (dbg_info* db, ir_node *val, ir_node *bound, pn_Cmp cmp); /** Constructor for an Unknown node. * - * Represents an arbtrary valus. Places the node in + * Represents an arbitrary value. Places the node in * the start block. * * @param *m The mode of the unknown value. @@ -3107,7 +3042,7 @@ ir_node *new_d_Unknown(ir_mode *m); * node.Adds the node to the block in current_ir_block. * * @param *db A pointer for debug information. - * @param *callee The call node bisible in the intra procedural view. + * @param *callee The call node visible in the intra procedural view. */ ir_node *new_d_CallBegin(dbg_info *db, ir_node *callee); @@ -3119,7 +3054,7 @@ ir_node *new_d_CallBegin(dbg_info *db, ir_node *callee); */ ir_node *new_d_EndReg (dbg_info *db); -/** Constructor for an Endexcept node. +/** Constructor for an EndExcept node. * * Used to represent regular procedure end in interprocedual view. * Adds the node to the block in current_ir_block. @@ -3162,26 +3097,31 @@ ir_node *new_d_Break (dbg_info *db); ir_node *new_d_Filter (dbg_info *db, ir_node *arg, ir_mode *mode, long proj); -/** Constructor for a FuncCall node. +/** Constructor for a NoMem node. * - * FuncCall is a function Call that has no side effects. Therefore there - * is not memory operand or result. Adds the node to the block in current_ir_block. + * Returns the unique NoMem node of the graph. The same as + * get_irg_no_mem(). + */ +ir_node *new_d_NoMem (void); + +/** Constructor for a Mux node. * - * @param *db A pointer for debug information. - * @param *callee A pointer to the called procedure. - * @param arity The number of procedure parameters. - * @param **in An array with the pointers to the parameters. - * The constructor copies this array. - * @param *tp Type information of the procedure called. + * Adds the node to the block in current_ir_block. + * + * @param *db A pointer for debug information. + * @param *sel The ir_node that calculates the boolean select. + * @param *ir_true The ir_node that calculates the true result. + * @param *ir_false The ir_node that calculates the false result. + * @param *mode The mode of the node (and it_true and ir_false). */ -ir_node *new_d_FuncCall (dbg_info* db, ir_node *callee, int arity, ir_node *in[], - type *tp); +ir_node *new_d_Mux (dbg_info *db, ir_node *sel, + ir_node *ir_false, ir_node *ir_true, ir_mode *mode); /*-----------------------------------------------------------------------*/ /* The block oriented interface without debug support */ /*-----------------------------------------------------------------------*/ -/* Needed from the interfase with debug support: +/* Needed from the interface with debug support: void set_cur_block (ir_node *target); */ /** Constructor for a Block node. @@ -3261,7 +3201,7 @@ ir_node *new_Cond (ir_node *c); * can end regular control flow. Adds the node to the block in current_ir_block. * * @param *store The state of memory. - * @param arity Number of array indexes. + * @param arity Number of array indices. * @param *in Array with index inputs to the node. */ ir_node *new_Return (ir_node *store, int arity, ir_node *in[]); @@ -3282,12 +3222,17 @@ ir_node *new_Raise (ir_node *store, ir_node *obj); * supported: If tv is entity derives a somehow useful type.) * Adds the node to the block in current_ir_block. * - * @param *mode The mode of the operands and redults. + * @param *mode The mode of the operands and results. * @param *con Points to an entry in the constant table. This pointer is * added to the attributes of the node. */ ir_node *new_Const (ir_mode *mode, tarval *con); +/** Constructor for a Const node. + * + * Derives mode from passed type. */ +ir_node *new_Const_type(tarval *con, type *tp); + /** Constructor for a SymConst node. * * Adds the node to the block in current_ir_block. @@ -3333,15 +3278,15 @@ ir_node *new_simpleSel(ir_node *store, ir_node *objptr, entity *ent); * with a compound type. It explicitly specifies the entity selected. * Dynamically the node may select entities that overwrite the given * entity. If the selected entity is an array element entity the Sel - * node takes the required array indicees as inputs. + * node takes the required array indices as inputs. * Adds the node to the block in current_ir_block. * * @param *store The memory in which the object the entity should be selected * from is allocated. * @param *objptr A pointer to a compound entity the Sel operation selects a * single attribute from. - * @param *n_index The number of array indicees needed to select an array element entity. - * @param *index[] If the compound entity is an array the indicees of the selected + * @param *n_index The number of array indices needed to select an array element entity. + * @param *index[] If the compound entity is an array the indices of the selected * element entity. The constructor copies this array. * @param *ent The entity to select. */ @@ -3636,7 +3581,7 @@ ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, * value in all memories where it occurs. * Adds the node to the block in current_ir_block. * - * @param arity The number of memories to syncronize. + * @param arity The number of memories to synchronize. * @param **in An array of pointers to nodes that produce an output of type * memory. The constructor copies this array. */ @@ -3707,7 +3652,6 @@ ir_node *new_Id (ir_node *val, ir_mode *mode); * Returns the unique Bad node of the graph. The same as * get_irg_bad(). */ - ir_node *new_Bad (void); /** Constructor for a Confirm node. @@ -3733,19 +3677,23 @@ ir_node *new_Confirm (ir_node *val, ir_node *bound, pn_Cmp cmp); */ ir_node *new_Unknown(ir_mode *m); -/** Constructor for a FuncCall node. +/** Constructor for a NoMem node. * - * FuncCall is a function Call that has no side effects. Therefore there - * is not memory operand or result.Adds the node to the block in current_ir_block. + * Returns the unique NoMem node of the graph. The same as + * get_irg_no_mem(). + */ +ir_node *new_NoMem (void); + +/** Constructor for a Mux node. * - * @param *callee A pointer to the called procedure. - * @param arity The number of procedure parameters. - * @param **in An array with the pointers to the parameters. - * The constructor copies this array. - * @param *tp Type information of the procedure called. + * Adds the node to the block in current_ir_block. + * + * @param *sel The ir_node that calculates the boolean select. + * @param *ir_true The ir_node that calculates the true result. + * @param *ir_false The ir_node that calculates the false result. + * @param *mode The mode of the node (and it_true and ir_false). */ -ir_node *new_FuncCall (ir_node *callee, int arity, ir_node *in[], - type *tp); +ir_node *new_Mux (ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode); /*---------------------------------------------------------------------*/ /* The comfortable interface. */ @@ -3839,9 +3787,9 @@ void finalize_cons (ir_graph *irg); * This function is called, whenever a local variable is used before definition * * @parameter mode the mode of the local var - * @pos position choosen be the frontend for this var + * @pos position chosen be the frontend for this var * - * @return a firm node of mode @p mode that initialises the var at position pos + * @return a firm node of mode @p mode that initializes the var at position pos * * @note * Do not return NULL