X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Fircons.h;h=1dd71514df2f2d7710c7cbaeb0ab05c06dd40501;hb=637542932dc27dcdfc7def09b58d9d5d4c34fb77;hp=b13fd19dd335d291f4302e5f3a677a6925a1be54;hpb=b751adfd19f36b83ed09d00deec0602ffeba0909;p=libfirm diff --git a/ir/ir/ircons.h b/ir/ir/ircons.h index b13fd19dd..1dd71514d 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. * @@ -352,15 +281,15 @@ * ir_node *new_Cmp (ir_node *op1, ir_node *op2); * ir_node *new_Conv (ir_node *op, ir_mode *mode); * ir_node *new_Cast (ir_node *op, type *to_tp); - * ir_node *new_Load (ir_node *store, ir_node *addr); + * ir_node *new_Load (ir_node *store, ir_node *addr, ir_mode *mode); * ir_node *new_Store (ir_node *store, ir_node *addr, ir_node *val); * ir_node *new_Alloc (ir_node *store, ir_node *size, type *alloc_type, * where_alloc where); * ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, - * type *free_type); + * type *free_type, where_alloc where); * 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) * ------------------------------------------------------------ @@ -740,7 +650,7 @@ * ir_node *new_Minus (ir_node *op, ir_mode *mode) * ----------------------------------------------- * - * Unary Minus operations on floating point values. + * Unary Minus operations on integer and floating point values. * * ir_node *new_Mul (ir_node *op1, ir_node *op2, ir_mode *mode) * ------------------------------------------------------------ @@ -841,23 +751,23 @@ * Output: * A 16-tuple containing the results of the 16 different comparisons. * The following is a list giving the comparisons and a projection - * number (pnc_number) to use in Proj nodes to extract the proper result. - * False false - * Eq equal - * Lt less - * Le less or equal - * Gt greater - * Ge greater of equal - * Lg less or greater - * Leg less, equal or greater = ordered - * Uo unordered - * Ue unordered or equal - * Ul unordered or less - * Ule unordered, less or equal - * Ug unordered or greater - * Uge unordered, greater or equal - * Ne unordered, less or greater = not equal - * True true + * number (pn_Cmp) to use in Proj nodes to extract the proper result. + * pn_Cmp_False false + * pn_Cmp_Eq equal + * pn_Cmp_Lt less + * pn_Cmp_Le less or equal + * pn_Cmp_Gt greater + * pn_Cmp_Ge greater of equal + * pn_Cmp_Lg less or greater + * pn_Cmp_Leg less, equal or greater = ordered + * pn_Cmp_Uo unordered + * pn_Cmp_Ue unordered or equal + * pn_Cmp_Ul unordered or less + * pn_Cmp_Ule unordered, less or equal + * pn_Cmp_Ug unordered or greater + * pn_Cmp_Uge unordered, greater or equal + * pn_Cmp_Ne unordered, less or greater = not equal + * pn_Cmp_True true * * * @@ -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,11 +800,18 @@ * 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 * -------------------------------------- * - * ir_node *new_Load (ir_node *store, ir_node *addr) + * ir_node *new_Load (ir_node *store, ir_node *addr, ir_mode *mode) * ---------------------------------------------------------------- * * The Load operation reads a value from memory. @@ -902,6 +819,7 @@ * Parameters: * *store The current memory. * *addr A pointer to the variable to be read in this memory. + * *mode The mode of the value to be loaded. * * Inputs: * The memory and a pointer to a variable in this memory. @@ -948,8 +866,10 @@ * a.*type A pointer to the class the allocated data object * belongs to. * - * ir_node *new_Free (ir_node *store, ir_node *ptr, type *free_type) - * ------------------------------------------------------------------ + * ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, type *free_type, + * -------------------------------------------------------------------------------- + * where_alloc where) + * ------------------ * * The Free node frees memory of the given variable. * @@ -958,6 +878,7 @@ * *ptr The pointer to the object to free. * *size The number of objects of type free_type to free in a sequence. * *free_type The type of the freed variable. + * where Where the variable was allocated, either heap_alloc or stack_alloc. * * Inputs: * A memory, a pointer and an unsigned integer. @@ -978,7 +899,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 @@ -996,6 +917,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) * ---------------------------------------------------------- * @@ -1074,15 +1002,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. @@ -1219,7 +1147,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. */ @@ -1235,7 +1163,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, @@ -1285,28 +1213,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. @@ -1315,7 +1243,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. @@ -1324,8 +1252,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. */ @@ -1362,24 +1290,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. @@ -1636,9 +1546,10 @@ ir_node *new_rd_Phi (dbg_info *db, ir_graph *irg, ir_node *block, int arity, * @param *block The ir block the node belongs to. * @param *store The current memory * @param *adr A pointer to the variable to be read in this memory. + * @param *mode The mode of the value to be loaded. */ ir_node *new_rd_Load (dbg_info *db, ir_graph *irg, ir_node *block, - ir_node *store, ir_node *adr); + ir_node *store, ir_node *adr, ir_mode *mode); /** Constructor for a Store node. * @@ -1679,9 +1590,10 @@ ir_node *new_rd_Alloc (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *st * @param *ptr The pointer to the object to free. * @param *size The number of objects of type free_type to free in a sequence. * @param *free_type The type of the freed variable. + * @param where Where the variable was allocated, either heap_alloc or stack_alloc. */ ir_node *new_rd_Free (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, - ir_node *ptr, ir_node *size, type *free_type); + ir_node *ptr, ir_node *size, type *free_type, where_alloc where); /** Constructor for a Sync node. * @@ -1692,7 +1604,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. */ @@ -1703,7 +1615,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. @@ -1835,6 +1747,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. @@ -1844,6 +1757,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 */ @@ -1911,7 +1847,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, @@ -1939,7 +1875,21 @@ ir_node *new_r_Raise (ir_graph *irg, ir_node *block, * @param *con Points to an entry in the constant table. */ ir_node *new_r_Const (ir_graph *irg, ir_node *block, - ir_mode *mode, tarval *con); + ir_mode *mode, tarval *con); + +/** Constructor for a Const node. + * + * Constructor for a Const node. The constant represents a target + * value. Sets the type information to type_unknown. (No more + * supported: If tv is entity derives a somehow useful type.) + * + * @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 the results. + * @param value A value from which the tarval is made. + */ +ir_node *new_r_Const_long(ir_graph *irg, ir_node *block, + ir_mode *mode, long value); /** Constructor for a SymConst node. * @@ -1964,7 +1914,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, @@ -1976,7 +1926,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. @@ -1984,8 +1934,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. */ @@ -2002,7 +1952,6 @@ ir_node *new_r_Sel (ir_graph *irg, ir_node *block, ir_node *store, * @param *x * @param *y * @param *z - * */ ir_node *new_r_InstOf (ir_graph *irg, ir_node *block, ir_node *x, ir_node *y, type *z); @@ -2017,7 +1966,6 @@ ir_node *new_r_InstOf (ir_graph *irg, ir_node *block, ir_node *x, ir_node *y, ty * @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_r_Call (ir_graph *irg, ir_node *block, ir_node *store, ir_node *callee, int arity, ir_node *in[], @@ -2030,7 +1978,6 @@ ir_node *new_r_Call (ir_graph *irg, ir_node *block, ir_node *store, * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_r_Add (ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2043,7 +1990,6 @@ ir_node *new_r_Add (ir_graph *irg, ir_node *block, * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the results. - * */ ir_node *new_r_Sub (ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2054,7 +2000,6 @@ ir_node *new_r_Sub (ir_graph *irg, ir_node *block, * @param *block The ir block the node belongs to. * @param *op The operand. * @param *mode The mode of the operand and the result. - * */ ir_node *new_r_Minus (ir_graph *irg, ir_node *block, ir_node *op, ir_mode *mode); @@ -2065,7 +2010,6 @@ ir_node *new_r_Minus (ir_graph *irg, ir_node *block, * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_r_Mul (ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2077,7 +2021,6 @@ ir_node *new_r_Mul (ir_graph *irg, ir_node *block, * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_r_Quot (ir_graph *irg, ir_node *block, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2089,7 +2032,6 @@ ir_node *new_r_Quot (ir_graph *irg, ir_node *block, * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_r_DivMod (ir_graph *irg, ir_node *block, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2101,7 +2043,6 @@ ir_node *new_r_DivMod (ir_graph *irg, ir_node *block, * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_r_Div (ir_graph *irg, ir_node *block, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2113,7 +2054,6 @@ ir_node *new_r_Div (ir_graph *irg, ir_node *block, * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_r_Mod (ir_graph *irg, ir_node *block, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2124,7 +2064,6 @@ ir_node *new_r_Mod (ir_graph *irg, ir_node *block, * @param *block The ir block the node belongs to. * @param *op The operand * @param *mode The mode of the operands and the result. - * */ ir_node *new_r_Abs (ir_graph *irg, ir_node *block, ir_node *op, ir_mode *mode); @@ -2136,7 +2075,6 @@ ir_node *new_r_Abs (ir_graph *irg, ir_node *block, * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_r_And (ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2148,7 +2086,6 @@ ir_node *new_r_And (ir_graph *irg, ir_node *block, * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_r_Or (ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2160,7 +2097,6 @@ ir_node *new_r_Or (ir_graph *irg, ir_node *block, * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the results. - * */ ir_node *new_r_Eor (ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2171,7 +2107,6 @@ ir_node *new_r_Eor (ir_graph *irg, ir_node *block, * @param *block The ir block the node belongs to. * @param *op The operand. * @param *mode The mode of the operand and the result. - * */ ir_node *new_r_Not (ir_graph *irg, ir_node *block, ir_node *op, ir_mode *mode); @@ -2182,7 +2117,6 @@ ir_node *new_r_Not (ir_graph *irg, ir_node *block, * @param *block The ir block the node belongs to. * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_r_Cmp (ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2); @@ -2194,7 +2128,6 @@ ir_node *new_r_Cmp (ir_graph *irg, ir_node *block, * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_r_Shl (ir_graph *irg, ir_node *block, ir_node *op, ir_node *k, ir_mode *mode); @@ -2206,7 +2139,6 @@ ir_node *new_r_Shl (ir_graph *irg, ir_node *block, * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_r_Shr (ir_graph *irg, ir_node *block, ir_node *op, ir_node *k, ir_mode *mode); @@ -2219,7 +2151,6 @@ ir_node *new_r_Shr (ir_graph *irg, ir_node *block, * @param *op The operand. * @param *k The number of bits to shift the operand. * @param *mode The mode of the operand and the result. - * */ ir_node *new_r_Shrs (ir_graph *irg, ir_node *block, ir_node *op, ir_node *k, ir_mode *mode); @@ -2231,7 +2162,6 @@ ir_node *new_r_Shrs (ir_graph *irg, ir_node *block, * @param *op The operand. * @param *k The number of bits to rotate the operand. * @param *mode The mode of the operand. - * */ ir_node *new_r_Rot (ir_graph *irg, ir_node *block, ir_node *op, ir_node *k, ir_mode *mode); @@ -2242,7 +2172,6 @@ ir_node *new_r_Rot (ir_graph *irg, ir_node *block, * @param *block The ir block the node belongs to. * @param *op The operand. * @param *mode The mode of this the operand muss be converted . - * */ ir_node *new_r_Conv (ir_graph *irg, ir_node *block, ir_node *op, ir_mode *mode); @@ -2255,7 +2184,6 @@ ir_node *new_r_Conv (ir_graph *irg, ir_node *block, * @param *block The ir block the node belongs to. * @param *op The operand. * @param *to_tp The type of this the operand muss be casted . - * */ ir_node *new_r_Cast (ir_graph *irg, ir_node *block, ir_node *op, type *to_tp); @@ -2267,7 +2195,6 @@ ir_node *new_r_Cast (ir_graph *irg, ir_node *block, * @param arity The number of predecessors * @param *in[] Array with predecessors. The constructor copies this array. * @param *mode The mode of it's inputs and output. - * */ ir_node *new_r_Phi (ir_graph *irg, ir_node *block, int arity, ir_node *in[], ir_mode *mode); @@ -2278,10 +2205,11 @@ ir_node *new_r_Phi (ir_graph *irg, ir_node *block, int arity, * @param *block The ir block the node belongs to. * @param *store The current memory * @param *adr A pointer to the variable to be read in this memory. - * + * @param *mode The mode of the value to be loaded. */ ir_node *new_r_Load (ir_graph *irg, ir_node *block, - ir_node *store, ir_node *adr); + ir_node *store, ir_node *adr, ir_mode *mode); + /** Constructor for a Store node. * * @param *irg The ir graph the node belongs to. @@ -2303,7 +2231,6 @@ ir_node *new_r_Store (ir_graph *irg, ir_node *block, * @param *size The number of bytes to allocate. * @param *alloc_type The type of the allocated variable. * @param where Where to allocate the variable, either heap_alloc or stack_alloc. - * */ ir_node *new_r_Alloc (ir_graph *irg, ir_node *block, ir_node *store, ir_node *size, type *alloc_type, where_alloc where); @@ -2319,10 +2246,10 @@ ir_node *new_r_Alloc (ir_graph *irg, ir_node *block, ir_node *store, * @param *ptr The pointer to the object to free. * @param *size The number of objects of type free_type to free in a sequence. * @param *free_type The type of the freed variable. - * + * @param where Where the variable was allocated, either heap_alloc or stack_alloc. */ ir_node *new_r_Free (ir_graph *irg, ir_node *block, ir_node *store, - ir_node *ptr, ir_node *size, type *free_type); + ir_node *ptr, ir_node *size, type *free_type, where_alloc where); /** Constructor for a Sync node. * @@ -2332,10 +2259,9 @@ 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. - * */ ir_node *new_r_Sync (ir_graph *irg, ir_node *block, int arity, ir_node *in[]); @@ -2349,7 +2275,6 @@ ir_node *new_r_Sync (ir_graph *irg, ir_node *block, int arity, ir_node *in[]); * @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. - * */ ir_node *new_r_Proj (ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode, long proj); @@ -2362,7 +2287,6 @@ ir_node *new_r_Proj (ir_graph *irg, ir_node *block, ir_node *arg, * @param *block The ir block the node belongs to. * @param arg A node producing a tuple. * @param max_ proj The end position of the value in the tuple. - * */ ir_node *new_r_defaultProj (ir_graph *irg, ir_node *block, ir_node *arg, long max_proj); @@ -2389,7 +2313,6 @@ ir_node *new_r_Tuple (ir_graph *irg, ir_node *block, int arity, ir_node *in[]); * @param *block The ir block the node belongs to. * @param *val The operand to Id. * @param *mode The mode of *val. - * */ ir_node *new_r_Id (ir_graph *irg, ir_node *block, ir_node *val, ir_mode *mode); @@ -2425,7 +2348,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. @@ -2442,8 +2365,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); @@ -2453,7 +2375,6 @@ ir_node *new_r_CallBegin(ir_graph *irg, ir_node *block, ir_node *callee); * * @param *irg The ir graph the node belong to. * @param *block The block the node belong to. - * */ ir_node *new_r_EndReg (ir_graph *irg, ir_node *block); @@ -2463,7 +2384,6 @@ ir_node *new_r_EndReg (ir_graph *irg, ir_node *block); * * @param *irg The ir graph the node belong to. * @param *block The block the node belong to. - * */ ir_node *new_r_EndExcept(ir_graph *irg, ir_node *block); @@ -2476,7 +2396,6 @@ ir_node *new_r_EndExcept(ir_graph *irg, ir_node *block); * * @param *irg The ir graph the node belong to. * @param *block The block the node belong to. - * */ ir_node *new_r_Break (ir_graph *irg, ir_node *block); @@ -2496,28 +2415,32 @@ ir_node *new_r_Break (ir_graph *irg, ir_node *block); * @param *arg The tuple value to project from. * @param *mode The mode of the projected value. * @param proj The position in the tuple to project from. - * */ 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 */ @@ -2545,7 +2468,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'. @@ -2557,7 +2480,6 @@ ir_node *new_d_Block(dbg_info* db, int arity, ir_node *in[]); * Adds the node to the block in current_ir_block. * * @param *db A pointer for debug information. - * */ ir_node *new_d_Start (dbg_info* db); @@ -2566,7 +2488,6 @@ ir_node *new_d_Start (dbg_info* db); * Adds the node to the block in current_ir_block. * * @param *db A pointer for debug information. - * */ ir_node *new_d_End (dbg_info* db); @@ -2577,7 +2498,6 @@ ir_node *new_d_End (dbg_info* db); * Jmp represents control flow to a single control successor. * * @param *db A pointer for debug information. - * */ ir_node *new_d_Jmp (dbg_info* db); @@ -2595,7 +2515,6 @@ ir_node *new_d_Jmp (dbg_info* db); * * @param *db A pointer for debug information. * @param *c The conditions parameter.Can be of mode b or I_u. - * */ ir_node *new_d_Cond (dbg_info* db, ir_node *c); @@ -2609,9 +2528,8 @@ 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. - * */ ir_node *new_d_Return (dbg_info* db, ir_node *store, int arity, ir_node *in[]); @@ -2623,7 +2541,6 @@ ir_node *new_d_Return (dbg_info* db, ir_node *store, int arity, ir_node *in[]); * @param *db A pointer for debug information. * @param *store The current memory. * @param *obj A pointer to the Except variable. - * */ ir_node *new_d_Raise (dbg_info* db, ir_node *store, ir_node *obj); @@ -2636,13 +2553,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. @@ -2654,10 +2569,9 @@ 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. - * */ ir_node *new_d_Const (dbg_info* db, ir_mode *mode, tarval *con); @@ -2709,7 +2623,6 @@ ir_node *new_d_SymConst (dbg_info* db, union symconst_symbol value, symconst_kin * @param *objptr The object from that the Sel operation selects a * single attribute out. * @param *ent The entity to select. - * */ ir_node *new_d_simpleSel(dbg_info* db, ir_node *store, ir_node *objptr, entity *ent); @@ -2719,7 +2632,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. @@ -2727,8 +2640,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. */ @@ -2745,7 +2658,6 @@ ir_node *new_d_Sel (dbg_info* db, ir_node *store, ir_node *objptr, int arity, * @param *store * @param *objptr * @param *ent - * */ ir_node *new_d_InstOf (dbg_info* db, ir_node *store, ir_node *objptr, type *ent); @@ -2760,7 +2672,6 @@ ir_node *new_d_InstOf (dbg_info* db, ir_node *store, ir_node *objptr, type *ent) * @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_d_Call (dbg_info* db, ir_node *store, ir_node *callee, int arity, ir_node *in[], @@ -2774,7 +2685,6 @@ ir_node *new_d_Call (dbg_info* db, ir_node *store, ir_node *callee, int arity, * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_d_Add (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2786,7 +2696,6 @@ ir_node *new_d_Add (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_d_Sub (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2798,7 +2707,6 @@ ir_node *new_d_Sub (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); * @param *db A pointer for debug information. * @param *op The operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_d_Minus (dbg_info* db, ir_node *op, ir_mode *mode); @@ -2810,7 +2718,6 @@ ir_node *new_d_Minus (dbg_info* db, ir_node *op, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_d_Mul (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2822,7 +2729,6 @@ ir_node *new_d_Mul (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_d_Quot (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2834,7 +2740,6 @@ ir_node *new_d_Quot (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2) * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_d_DivMod (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2846,7 +2751,6 @@ ir_node *new_d_DivMod (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2) * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_d_Div (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2858,7 +2762,6 @@ ir_node *new_d_Div (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2) * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_d_Mod (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2); @@ -2869,7 +2772,6 @@ ir_node *new_d_Mod (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2) * @param *db A pointer for debug information. * @param *op The operand * @param *mode The mode of the operands and the result. - * */ ir_node *new_d_Abs (dbg_info* db, ir_node *op, ir_mode *mode); @@ -2883,7 +2785,6 @@ ir_node *new_d_Abs (dbg_info* db, ir_node *op, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_d_And (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2895,7 +2796,6 @@ ir_node *new_d_And (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_d_Or (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2907,7 +2807,6 @@ ir_node *new_d_Or (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the results. - * */ ir_node *new_d_Eor (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); @@ -2918,7 +2817,6 @@ ir_node *new_d_Eor (dbg_info* db, ir_node *op1, ir_node *op2, ir_mode *mode); * @param *db A pointer for debug information. * @param *op The operand. * @param *mode The mode of the operand and the result. - * */ ir_node *new_d_Not (dbg_info* db, ir_node *op, ir_mode *mode); @@ -2930,7 +2828,6 @@ ir_node *new_d_Not (dbg_info* db, ir_node *op, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_d_Shl (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); @@ -2942,7 +2839,6 @@ ir_node *new_d_Shl (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_d_Shr (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); @@ -2954,7 +2850,6 @@ ir_node *new_d_Shr (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_d_Shrs (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); @@ -2966,7 +2861,6 @@ ir_node *new_d_Shrs (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to rotate the operand. * @param *mode The mode of the operand. - * */ ir_node *new_d_Rot (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); @@ -2977,7 +2871,6 @@ ir_node *new_d_Rot (dbg_info* db, ir_node *op, ir_node *k, ir_mode *mode); * @param *db A pointer for debug information. * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_d_Cmp (dbg_info* db, ir_node *op1, ir_node *op2); @@ -2988,7 +2881,6 @@ ir_node *new_d_Cmp (dbg_info* db, ir_node *op1, ir_node *op2); * @param *db A pointer for debug information. * @param *op The operand. * @param *mode The mode of this the operand muss be converted . - * */ ir_node *new_d_Conv (dbg_info* db, ir_node *op, ir_mode *mode); @@ -3000,7 +2892,6 @@ ir_node *new_d_Conv (dbg_info* db, ir_node *op, ir_mode *mode); * @param *db A pointer for debug information. * @param *op The operand. * @param *to_tp The type of this the operand muss be casted . - * */ ir_node *new_d_Cast (dbg_info* db, ir_node *op, type *to_tp); @@ -3008,11 +2899,10 @@ 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. - * */ ir_node *new_d_Phi (dbg_info* db, int arity, ir_node *in[], ir_mode *mode); @@ -3023,9 +2913,9 @@ ir_node *new_d_Phi (dbg_info* db, int arity, ir_node *in[], ir_mode *mode); * @param *db A pointer for debug information. * @param *store The current memory * @param *adr A pointer to the variable to be read in this memory. - * + * @param *mode The mode of the value to be loaded. */ -ir_node *new_d_Load (dbg_info* db, ir_node *store, ir_node *addr); +ir_node *new_d_Load (dbg_info* db, ir_node *store, ir_node *addr, ir_mode *mode); /** Constructor for a Store node. * @@ -3048,7 +2938,6 @@ ir_node *new_d_Store (dbg_info* db, ir_node *store, ir_node *addr, ir_node *val * @param *size The number of bytes to allocate. * @param *alloc_type The type of the allocated variable. * @param where Where to allocate the variable, either heap_alloc or stack_alloc. - * */ ir_node *new_d_Alloc (dbg_info* db, ir_node *store, ir_node *size, type *alloc_type, where_alloc where); @@ -3064,10 +2953,10 @@ ir_node *new_d_Alloc (dbg_info* db, ir_node *store, ir_node *size, type *alloc_ * @param *ptr The pointer to the object to free. * @param *size The number of objects of type free_type to free in a sequence. * @param *free_type The type of the freed variable. - * + * @param where Where the variable was allocated, either heap_alloc or stack_alloc. */ ir_node *new_d_Free (dbg_info* db, ir_node *store, ir_node *ptr, ir_node *size, - type *free_type); + type *free_type, where_alloc where); /** Constructor for a Sync node. * @@ -3077,10 +2966,9 @@ 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. - * */ ir_node *new_d_Sync (dbg_info* db, int arity, ir_node *in[]); @@ -3091,11 +2979,10 @@ 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. - * */ ir_node *new_d_Proj (dbg_info* db, ir_node *arg, ir_mode *mode, long proj); @@ -3108,7 +2995,6 @@ ir_node *new_d_Proj (dbg_info* db, ir_node *arg, ir_mode *mode, long proj); * @param *db A pointer for debug information. * @param arg A node producing a tuple. * @param max_ proj The end position of the value in the tuple. - * */ ir_node *new_d_defaultProj (dbg_info* db, ir_node *arg, long max_proj); @@ -3121,7 +3007,6 @@ ir_node *new_d_defaultProj (dbg_info* db, ir_node *arg, long max_proj); * @param *db A pointer for debug information. * @param arity The number of tuple elements. * @param **in An array containing pointers to the nodes producing the tuple elements. - * */ ir_node *new_d_Tuple (dbg_info* db, int arity, ir_node *in[]); @@ -3134,15 +3019,13 @@ ir_node *new_d_Tuple (dbg_info* db, int arity, ir_node *in[]); * @param *db A pointer for debug information. * @param *val The operand to Id. * @param *mode The mode of *val. - * */ 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(). - * */ ir_node *new_d_Bad (void); @@ -3158,18 +3041,16 @@ ir_node *new_d_Bad (void); * @param *val The value we express a constraint for * @param *bound The value to compare against. Must be a firm node, typically a constant. * @param cmp The compare operation. - * */ 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. - * */ ir_node *new_d_Unknown(ir_mode *m); @@ -3181,8 +3062,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); @@ -3191,17 +3071,15 @@ ir_node *new_d_CallBegin(dbg_info *db, ir_node *callee); *Adds the node to the block in current_ir_block. * * @param *db A pointer for debug information. - * */ 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. * * @param *db A pointer for debug information. - * */ ir_node *new_d_EndExcept(dbg_info *db); @@ -3216,7 +3094,6 @@ ir_node *new_d_EndExcept(dbg_info *db); * behind Call nodes to represent the control flow to called procedures. * * @param *db A pointer for debug information. - * */ ir_node *new_d_Break (dbg_info *db); @@ -3236,32 +3113,35 @@ ir_node *new_d_Break (dbg_info *db); * @param *arg The tuple value to project from. * @param *mode The mode of the projected value. * @param proj The position in the tuple to project from. - * */ 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. @@ -3287,7 +3167,6 @@ ir_node *new_Start (void); /** Constructor for an End node. * * Adds the node to the block in current_ir_block. - * */ ir_node *new_End (void); @@ -3295,7 +3174,6 @@ ir_node *new_End (void); * * Used to represent regular procedure end in interprocedual view. * Adds the node to the block in current_ir_block. - * */ ir_node *new_EndReg (void); @@ -3303,18 +3181,14 @@ ir_node *new_EndReg (void); * * Used to represent exceptional procedure end in interprocedural view. * Adds the node to the block in current_ir_block. - * - * - * */ ir_node *new_EndExcept(void); -/** +/** Constructor for a Jump node. * - * Constructor for a Jump node. Adds the node to the block in current_ir_block. + * Adds the node to the block in current_ir_block. * * Jmp represents control flow to a single control successor. - * */ ir_node *new_Jmp (void); @@ -3323,8 +3197,7 @@ ir_node *new_Jmp (void); * The blocks separated by a break may not be concatenated by an optimization. * It is used for the interprocedural representation where blocks are parted * behind Call nodes to represent the control flow to called procedures. - *Adds the node to the block in current_ir_block. - * + * Adds the node to the block in current_ir_block. */ ir_node *new_Break (void); @@ -3339,7 +3212,6 @@ ir_node *new_Break (void); * * * @param *c The conditions parameter.Can be of mode b or I_u. - * */ ir_node *new_Cond (ir_node *c); @@ -3349,9 +3221,8 @@ 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[]); @@ -3361,7 +3232,6 @@ ir_node *new_Return (ir_node *store, int arity, ir_node *in[]); * * @param *store The current memory. * @param *obj A pointer to the Except variable. - * */ ir_node *new_Raise (ir_node *store, ir_node *obj); @@ -3372,13 +3242,30 @@ 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); +/** + * Make a const from a long. + * This is just convenience for the usual + * + * new_Const(mode, tarval_from_long(mode, ...)) + * + * pain. + * @param mode The mode for the const. + * @param value The value of the constant. + * @return A new const node. + */ +ir_node *new_Const_long(ir_mode *mode, long value); + +/** 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. @@ -3403,7 +3290,6 @@ ir_node *new_Const (ir_mode *mode, tarval *con); * * @param value A type or a ident depending on the SymConst kind. * @param symkind The kind of the symbolic constant: symconst_type_tag, symconst_size or symconst_addr_name. - * */ ir_node *new_SymConst (union symconst_symbol value, symconst_kind kind); @@ -3416,7 +3302,6 @@ ir_node *new_SymConst (union symconst_symbol value, symconst_kind kind); * @param *store The memory in which the object the entity should be selected from is allocated. * @param *objptr The object from that the Sel operation selects a single attribute out. * @param *ent The entity to select. - * */ ir_node *new_simpleSel(ir_node *store, ir_node *objptr, entity *ent); @@ -3426,15 +3311,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. */ @@ -3449,7 +3334,6 @@ ir_node *new_Sel (ir_node *store, ir_node *objptr, int arity, ir_node *in[], * @param *store * @param *objptr * @param *ent - * */ ir_node *new_InstOf (ir_node *store, ir_node *obj, type *ent); @@ -3463,7 +3347,6 @@ ir_node *new_InstOf (ir_node *store, ir_node *obj, type *ent); * @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_Call (ir_node *store, ir_node *callee, int arity, ir_node *in[], type *tp); @@ -3473,7 +3356,6 @@ ir_node *new_Call (ir_node *store, ir_node *callee, int arity, ir_node *in[], * Adds the node to the block in current_ir_block. * * @param *callee A pointer to the called procedure. - * */ ir_node *new_CallBegin(ir_node *callee); @@ -3487,7 +3369,6 @@ ir_node *new_CallBegin(ir_node *callee); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_Add (ir_node *op1, ir_node *op2, ir_mode *mode); @@ -3498,7 +3379,6 @@ ir_node *new_Add (ir_node *op1, ir_node *op2, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_Sub (ir_node *op1, ir_node *op2, ir_mode *mode); @@ -3508,7 +3388,6 @@ ir_node *new_Sub (ir_node *op1, ir_node *op2, ir_mode *mode); * * @param *op The operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_Minus (ir_node *op, ir_mode *mode); @@ -3518,7 +3397,6 @@ ir_node *new_Minus (ir_node *op, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_Mul (ir_node *op1, ir_node *op2, ir_mode *mode); @@ -3529,7 +3407,6 @@ ir_node *new_Mul (ir_node *op1, ir_node *op2, ir_mode *mode); * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_Quot (ir_node *memop, ir_node *op1, ir_node *op2); @@ -3540,7 +3417,6 @@ ir_node *new_Quot (ir_node *memop, ir_node *op1, ir_node *op2); * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_DivMod (ir_node *memop, ir_node *op1, ir_node *op2); @@ -3551,7 +3427,6 @@ ir_node *new_DivMod (ir_node *memop, ir_node *op1, ir_node *op2); * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_Div (ir_node *memop, ir_node *op1, ir_node *op2); @@ -3562,7 +3437,6 @@ ir_node *new_Div (ir_node *memop, ir_node *op1, ir_node *op2); * @param *memop The store needed to model exceptions * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_Mod (ir_node *memop, ir_node *op1, ir_node *op2); @@ -3572,7 +3446,6 @@ ir_node *new_Mod (ir_node *memop, ir_node *op1, ir_node *op2); * * @param *op The operand * @param *mode The mode of the operands and the result. - * */ ir_node *new_Abs (ir_node *op, ir_mode *mode); @@ -3583,7 +3456,6 @@ ir_node *new_Abs (ir_node *op, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_And (ir_node *op1, ir_node *op2, ir_mode *mode); @@ -3593,7 +3465,6 @@ ir_node *new_And (ir_node *op1, ir_node *op2, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the result. - * */ ir_node *new_Or (ir_node *op1, ir_node *op2, ir_mode *mode); @@ -3603,7 +3474,6 @@ ir_node *new_Or (ir_node *op1, ir_node *op2, ir_mode *mode); * @param *op1 The operand 1. * @param *op2 The operand 2. * @param *mode The mode of the operands and the results. - * */ ir_node *new_Eor (ir_node *op1, ir_node *op2, ir_mode *mode); @@ -3613,7 +3483,6 @@ ir_node *new_Eor (ir_node *op1, ir_node *op2, ir_mode *mode); * * @param *op The operand. * @param *mode The mode of the operand and the result. - * */ ir_node *new_Not (ir_node *op, ir_mode *mode); @@ -3624,7 +3493,6 @@ ir_node *new_Not (ir_node *op, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_Shl (ir_node *op, ir_node *k, ir_mode *mode); @@ -3634,7 +3502,6 @@ ir_node *new_Shl (ir_node *op, ir_node *k, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_Shr (ir_node *op, ir_node *k, ir_mode *mode); @@ -3645,7 +3512,6 @@ ir_node *new_Shr (ir_node *op, ir_node *k, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to shift the operand . * @param *mode The mode of the operand and the result. - * */ ir_node *new_Shrs (ir_node *op, ir_node *k, ir_mode *mode); @@ -3656,7 +3522,6 @@ ir_node *new_Shrs (ir_node *op, ir_node *k, ir_mode *mode); * @param *op The operand. * @param *k The number of bits to rotate the operand. * @param *mode The mode of the operand. - * */ ir_node *new_Rot (ir_node *op, ir_node *k, ir_mode *mode); @@ -3666,7 +3531,6 @@ ir_node *new_Rot (ir_node *op, ir_node *k, ir_mode *mode); * * @param *op1 The operand 1. * @param *op2 The operand 2. - * */ ir_node *new_Cmp (ir_node *op1, ir_node *op2); @@ -3676,7 +3540,6 @@ ir_node *new_Cmp (ir_node *op1, ir_node *op2); * * @param *op The operand. * @param *mode The mode of this the operand muss be converted . - * */ ir_node *new_Conv (ir_node *op, ir_mode *mode); @@ -3687,7 +3550,6 @@ ir_node *new_Conv (ir_node *op, ir_mode *mode); * * @param *op The operand. * @param *to_tp The type of this the operand muss be casted . - * */ ir_node *new_Cast (ir_node *op, type *to_tp); @@ -3695,26 +3557,25 @@ ir_node *new_Cast (ir_node *op, type *to_tp); * * Adds the node to the block in current_ir_block. * - * @param arity The number of predecessors - * @param *in Array with predecessors + * @param arity The number of predecessors. + * @param *in Array with predecessors. * @param *mode The mode of it's inputs and output. - * */ ir_node *new_Phi (int arity, ir_node *in[], ir_mode *mode); /** Constructor for a Load node. * - * @param *store The current memory + * @param *store The current memory. * @param *addr A pointer to the variable to be read in this memory. - * + * @param *mode The mode of the value to be loaded. */ -ir_node *new_Load (ir_node *store, ir_node *addr); +ir_node *new_Load (ir_node *store, ir_node *addr, ir_mode *mode); /** Constructor for a Store node. * - * @param *store The current memory + * @param *store The current memory. * @param *addr A pointer to the variable to be read in this memory. - * @param *val The value to write to this variable. + * @param *val The value to write to this variable. */ ir_node *new_Store (ir_node *store, ir_node *addr, ir_node *val); @@ -3727,7 +3588,6 @@ ir_node *new_Store (ir_node *store, ir_node *addr, ir_node *val); * @param *size The number of bytes to allocate. * @param *alloc_type The type of the allocated variable. * @param where Where to allocate the variable, either heap_alloc or stack_alloc. - * */ ir_node *new_Alloc (ir_node *store, ir_node *size, type *alloc_type, where_alloc where); @@ -3743,10 +3603,10 @@ ir_node *new_Alloc (ir_node *store, ir_node *size, type *alloc_type, * @param *ptr The pointer to the object to free. * @param *size The number of objects of type free_type to free in a sequence. * @param *free_type The type of the freed variable. - * + * @param where Where the variable was allocated, either heap_alloc or stack_alloc. */ ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, - type *free_type); + type *free_type, where_alloc where); /** Constructor for a Sync node. * @@ -3755,10 +3615,9 @@ 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. - * */ ir_node *new_Sync (int arity, ir_node *in[]); @@ -3771,7 +3630,6 @@ ir_node *new_Sync (int arity, ir_node *in[]); * @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. - * */ ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj); @@ -3789,7 +3647,6 @@ ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj); * @param *arg The tuple value to project from. * @param *mode The mode of the projected value. * @param proj The position in the tuple to project from. - * */ ir_node *new_Filter (ir_node *arg, ir_mode *mode, long proj); @@ -3800,7 +3657,6 @@ ir_node *new_Filter (ir_node *arg, ir_mode *mode, long proj); * * @param arg A node producing a tuple. * @param max_ proj The end position of the value in the tuple. - * */ ir_node *new_defaultProj (ir_node *arg, long max_proj); @@ -3812,7 +3668,6 @@ ir_node *new_defaultProj (ir_node *arg, long max_proj); * * @param arity The number of tuple elements. * @param **in An array containing pointers to the nodes producing the tuple elements. - * */ ir_node *new_Tuple (int arity, ir_node *in[]); @@ -3823,7 +3678,6 @@ ir_node *new_Tuple (int arity, ir_node *in[]); * * @param *val The operand to Id. * @param *mode The mode of *val. - * */ ir_node *new_Id (ir_node *val, ir_mode *mode); @@ -3831,9 +3685,7 @@ 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. @@ -3847,7 +3699,6 @@ ir_node *new_Bad (void); * @param *val The value we express a constraint for * @param *bound The value to compare against. Must be a firm node, typically a constant. * @param cmp The compare operation. - * */ ir_node *new_Confirm (ir_node *val, ir_node *bound, pn_Cmp cmp); @@ -3857,24 +3708,26 @@ ir_node *new_Confirm (ir_node *val, ir_node *bound, pn_Cmp cmp); * the start block. * * @param *m The mode of the unknown value. - * */ 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. */ @@ -3927,7 +3780,7 @@ ir_node *get_value (int pos, ir_mode *mode); * * @param pos The position/id of the local variable. * @param *value The new value written to the local variable. -*/ + */ void set_value (int pos, ir_node *value); /** Get the current memory state. @@ -3935,7 +3788,6 @@ void set_value (int pos, ir_node *value); * Use this function to obtain the last definition of the memory * state. This call automatically inserts Phi nodes for the memory * state value. - * */ ir_node *get_store (void); @@ -3945,7 +3797,7 @@ ir_node *get_store (void); * This call is needed to automatically inserts Phi nodes. * * @param *store The new memory state. -*/ + */ void set_store (ir_node *store); /** keep this node alive even if End is not control-reachable from it @@ -3961,23 +3813,31 @@ type *get_cur_frame_type(void); /* --- initialize and finalize ir construction --- */ /** Puts the graph into state "phase_high" */ -void finalize_cons (ir_graph *irg); +void irg_finalize_cons (ir_graph *irg); + +/** Puts the program and all graphs into state phase_high. + * + * This also remarks, the construction of types is finished, + * e.g., that no more subtypes will be added. */ +void irp_finalize_cons(void); /* --- Initialization --- */ /** * 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 + * @param irg the IR graph on which this happens + * @param mode the mode of the local var + * @param pos position chosen be the frontend for this variable (n_loc) * - * @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 - * If this function is not set, FIRM will create a const node with tarval BAD + * If this function is not set, FIRM will create a const node with tarval BAD. + * Use set_irg_loc_description()/get_irg_loc_description() to assign additional + * informations to local variables. */ -typedef ir_node *default_initialize_local_variable_func_t(ir_mode *mode, int pos); - +typedef ir_node *uninitialized_local_variable_func_t(ir_graph *irg, ir_mode *mode, int pos); # endif /* _IRCONS_H_ */