X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Fircons.h;h=62a822187f26a9b93992362962aa303b30451a2a;hb=49ad2542b4cc755e005cf7cd0f3fe76240130dba;hp=120de4a3a949254391d7ec90dabe367716f970c4;hpb=dddcc630819f338c3b45e2bc646233e6872d5bb6;p=libfirm diff --git a/ir/ir/ircons.h b/ir/ir/ircons.h index 120de4a3a..62a822187 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,48 +281,14 @@ * 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); * ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj); -======= - * ir_node *new_simpleSel(ir_node *store, ir_node *objptr, entity *ent); - * ir_node *new_Sel (ir_node *store, ir_node *objptr, int arity, - * ir_node **in, entity *ent); - * ir_node *new_Call (ir_node *store, ir_node *callee, int arity, - * ir_node **in, type_method *type); - * ir_node *new_Add (ir_node *op1, ir_node *op2, ir_mode *mode); - * ir_node *new_Sub (ir_node *op1, ir_node *op2, ir_mode *mode); - * ir_node *new_Minus (ir_node *op, ir_mode *mode); - * ir_node *new_Mul (ir_node *op1, ir_node *op2, ir_mode *mode); - * ir_node *new_Quot (ir_node *memop, ir_node *op1, ir_node *op2); - * ir_node *new_DivMod (ir_node *memop, ir_node *op1, ir_node *op2); - * ir_node *new_Div (ir_node *memop, ir_node *op1, ir_node *op2); - * ir_node *new_Mod (ir_node *memop, ir_node *op1, ir_node *op2); - * ir_node *new_Abs (ir_node *op, ir_mode *mode); - * ir_node *new_And (ir_node *op1, ir_node *op2, ir_mode *mode); - * ir_node *new_Or (ir_node *op1, ir_node *op2, ir_mode *mode); - * ir_node *new_Eor (ir_node *op1, ir_node *op2, ir_mode *mode); - * ir_node *new_Not (ir_node *op, ir_mode *mode); - * ir_node *new_Shl (ir_node *op, ir_node *k, ir_mode *mode); - * ir_node *new_Shr (ir_node *op, ir_node *k, ir_mode *mode); - * ir_node *new_Shrs (ir_node *op, ir_node *k, ir_mode *mode); - * ir_node *new_Rot (ir_node *op, ir_node *k, ir_mode *mode); - * 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_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); - * 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); * * void add_immBlock_pred (ir_node *block, ir_node *jmp); * void mature_immBlock (ir_node *block); @@ -620,8 +515,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. @@ -630,9 +525,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. * @@ -739,26 +634,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) * ------------------------------------------------------------ @@ -927,7 +802,7 @@ * 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. @@ -935,6 +810,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. @@ -1029,6 +905,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) * ---------------------------------------------------------- * @@ -1107,15 +990,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. @@ -1395,24 +1278,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. @@ -1669,9 +1534,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. * @@ -1877,6 +1743,14 @@ 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); /*-------------------------------------------------------------------------*/ /* The raw interface without debug support */ @@ -1972,7 +1846,7 @@ 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 SymConst node. * @@ -2035,7 +1909,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); @@ -2050,7 +1923,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[], @@ -2063,7 +1935,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); @@ -2076,7 +1947,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); @@ -2087,7 +1957,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); @@ -2098,7 +1967,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); @@ -2110,7 +1978,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); @@ -2122,7 +1989,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); @@ -2134,7 +2000,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); @@ -2146,7 +2011,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); @@ -2157,7 +2021,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); @@ -2169,7 +2032,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); @@ -2181,7 +2043,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); @@ -2193,7 +2054,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); @@ -2204,7 +2064,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); @@ -2215,7 +2074,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); @@ -2227,7 +2085,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); @@ -2239,7 +2096,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); @@ -2252,7 +2108,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); @@ -2264,7 +2119,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); @@ -2275,7 +2129,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); @@ -2288,7 +2141,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); @@ -2300,7 +2152,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); @@ -2311,10 +2162,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. @@ -2336,7 +2188,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); @@ -2352,7 +2203,6 @@ 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. - * */ ir_node *new_r_Free (ir_graph *irg, ir_node *block, ir_node *store, ir_node *ptr, ir_node *size, type *free_type); @@ -2368,7 +2218,6 @@ ir_node *new_r_Free (ir_graph *irg, ir_node *block, ir_node *store, * @param arity The number of memories to syncronize. * @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[]); @@ -2382,7 +2231,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); @@ -2395,7 +2243,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); @@ -2422,7 +2269,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); @@ -2476,7 +2322,6 @@ 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. - * */ ir_node *new_r_CallBegin(ir_graph *irg, ir_node *block, ir_node *callee); @@ -2486,7 +2331,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); @@ -2496,7 +2340,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); @@ -2509,7 +2352,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); @@ -2529,28 +2371,18 @@ 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. - * - * @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. + * 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_r_FuncCall (ir_graph *irg, ir_node *block, - ir_node *callee, int arity, ir_node *in[], - type *tp); +ir_node *new_r_NoMem (ir_graph *irg); /*-----------------------------------------------------------------------*/ /* The block oriented interface */ @@ -2590,7 +2422,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); @@ -2599,7 +2430,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); @@ -2610,7 +2440,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); @@ -2628,7 +2457,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); @@ -2644,7 +2472,6 @@ ir_node *new_d_Cond (dbg_info* db, ir_node *c); * @param *store The state of memory. * @param arity Number of array indexes. * @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[]); @@ -2656,7 +2483,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); @@ -2673,7 +2499,6 @@ ir_node *new_d_Raise (dbg_info* db, ir_node *store, ir_node *obj); * @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. - * */ ir_node *new_d_Const_type (dbg_info* db, ir_mode *mode, tarval *con, type *tp); @@ -2690,7 +2515,6 @@ ir_node *new_d_Const_type (dbg_info* db, ir_mode *mode, tarval *con, type *tp); * @param *mode The mode of the operands and redults. * @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); @@ -2742,7 +2566,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); @@ -2778,7 +2601,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); @@ -2793,7 +2615,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[], @@ -2807,7 +2628,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); @@ -2819,7 +2639,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); @@ -2831,7 +2650,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); @@ -2843,7 +2661,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); @@ -2855,7 +2672,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); @@ -2867,7 +2683,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); @@ -2879,7 +2694,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); @@ -2891,7 +2705,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); @@ -2902,7 +2715,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); @@ -2916,7 +2728,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); @@ -2928,7 +2739,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); @@ -2940,7 +2750,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); @@ -2951,7 +2760,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); @@ -2963,7 +2771,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); @@ -2975,7 +2782,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); @@ -2987,7 +2793,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); @@ -2999,7 +2804,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); @@ -3010,7 +2814,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); @@ -3021,7 +2824,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); @@ -3033,7 +2835,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); @@ -3045,7 +2846,6 @@ ir_node *new_d_Cast (dbg_info* db, ir_node *op, type *to_tp); * @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); @@ -3056,9 +2856,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. * @@ -3081,7 +2881,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); @@ -3097,7 +2896,6 @@ 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. - * */ ir_node *new_d_Free (dbg_info* db, ir_node *store, ir_node *ptr, ir_node *size, type *free_type); @@ -3113,7 +2911,6 @@ ir_node *new_d_Free (dbg_info* db, ir_node *store, ir_node *ptr, ir_node *size * @param arity The number of memories to syncronize. * @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[]); @@ -3128,7 +2925,6 @@ ir_node *new_d_Sync (dbg_info* db, 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_d_Proj (dbg_info* db, ir_node *arg, ir_mode *mode, long proj); @@ -3141,7 +2937,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); @@ -3154,7 +2949,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[]); @@ -3167,7 +2961,6 @@ 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); @@ -3175,7 +2968,6 @@ ir_node *new_d_Id (dbg_info* db, ir_node *val, ir_mode *mode); * * Returns the unique Bad node of the graph. The same as * get_irg_bad(). - * */ ir_node *new_d_Bad (void); @@ -3191,7 +2983,6 @@ 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); @@ -3202,7 +2993,6 @@ ir_node *new_d_Confirm (dbg_info* db, ir_node *val, ir_node *bound, pn_Cmp cmp); * the start block. * * @param *m The mode of the unknown value. - * */ ir_node *new_d_Unknown(ir_mode *m); @@ -3215,7 +3005,6 @@ ir_node *new_d_Unknown(ir_mode *m); * * @param *db A pointer for debug information. * @param *callee The call node bisible in the intra procedural view. - * */ ir_node *new_d_CallBegin(dbg_info *db, ir_node *callee); @@ -3224,7 +3013,6 @@ 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); @@ -3234,7 +3022,6 @@ ir_node *new_d_EndReg (dbg_info *db); * 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); @@ -3249,7 +3036,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); @@ -3269,26 +3055,16 @@ 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. - * - * 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. - * - * @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. +/** Constructor for a NoMem node. * + * Returns the unique NoMem node of the graph. The same as + * get_irg_no_mem(). */ -ir_node *new_d_FuncCall (dbg_info* db, ir_node *callee, int arity, ir_node *in[], - type *tp); +ir_node *new_d_NoMem (void); /*-----------------------------------------------------------------------*/ /* The block oriented interface without debug support */ @@ -3320,7 +3096,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); @@ -3328,7 +3103,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); @@ -3336,18 +3110,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); @@ -3356,8 +3126,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); @@ -3372,7 +3141,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); @@ -3384,7 +3152,6 @@ ir_node *new_Cond (ir_node *c); * @param *store The state of memory. * @param arity Number of array indexes. * @param *in Array with index inputs to the node. - * */ ir_node *new_Return (ir_node *store, int arity, ir_node *in[]); @@ -3394,7 +3161,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); @@ -3408,10 +3174,14 @@ ir_node *new_Raise (ir_node *store, ir_node *obj); * @param *mode The mode of the operands and redults. * @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. @@ -3436,7 +3206,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); @@ -3449,7 +3218,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); @@ -3482,7 +3250,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); @@ -3496,7 +3263,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); @@ -3506,7 +3272,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); @@ -3520,7 +3285,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); @@ -3531,7 +3295,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); @@ -3541,7 +3304,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); @@ -3551,7 +3313,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); @@ -3562,7 +3323,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); @@ -3573,7 +3333,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); @@ -3584,7 +3343,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); @@ -3595,7 +3353,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); @@ -3605,7 +3362,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); @@ -3616,7 +3372,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); @@ -3626,7 +3381,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); @@ -3636,7 +3390,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); @@ -3646,7 +3399,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); @@ -3657,7 +3409,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); @@ -3667,7 +3418,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); @@ -3678,7 +3428,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); @@ -3689,7 +3438,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); @@ -3699,7 +3447,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); @@ -3709,7 +3456,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); @@ -3720,7 +3466,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); @@ -3728,26 +3473,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); @@ -3760,7 +3504,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); @@ -3776,7 +3519,6 @@ 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. - * */ ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, type *free_type); @@ -3791,7 +3533,6 @@ ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, * @param arity The number of memories to syncronize. * @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[]); @@ -3804,7 +3545,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); @@ -3822,7 +3562,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); @@ -3833,7 +3572,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); @@ -3845,7 +3583,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[]); @@ -3856,7 +3593,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); @@ -3864,9 +3600,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. @@ -3880,7 +3614,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); @@ -3890,24 +3623,15 @@ 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. - * - * 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. - * - * @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. +/** Constructor for a NoMem node. * + * Returns the unique NoMem node of the graph. The same as + * get_irg_no_mem(). */ -ir_node *new_FuncCall (ir_node *callee, int arity, ir_node *in[], - type *tp); +ir_node *new_NoMem (void); /*---------------------------------------------------------------------*/ /* The comfortable interface. */ @@ -3935,6 +3659,7 @@ void add_immBlock_pred (ir_node *immblock, ir_node *jmp); /** Fix the number of predecessors of an immature block. */ void mature_immBlock (ir_node *block); +#define mature_cur_block() mature_immBlock(get_cur_block()); /** Get the current value of a local variable. @@ -3959,7 +3684,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. @@ -3967,7 +3692,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); @@ -3977,7 +3701,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