X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Fircons.h;h=e4eda0d02fd1d08eb623c3ab22304202fd821259;hb=8399216d8aebc713bbda04b6e3e250a1d52b20bf;hp=56cb597b97c3ef69c8579ed5e1ea1e322b20d361;hpb=b8f363d7be29eb5702e130be3796ff7162410e6a;p=libfirm diff --git a/ir/ir/ircons.h b/ir/ir/ircons.h index 56cb597b9..e4eda0d02 100644 --- a/ir/ir/ircons.h +++ b/ir/ir/ircons.h @@ -40,77 +40,6 @@ * * For extensive documentation of FIRM see UKA Techreport 1999-14. * - * ========= - * - * The struct ir_graph - * ------------------- - * - * This struct contains all information about a procedure. - * It's allocated directly to memory. - * - * The fields of ir_graph: - * - * *ent The entity describing this procedure. - * - * The beginning and end of a graph: - * - * *start_block This ir_node is the block that contains the unique - * start node of the procedure. With it it contains - * the Proj's on starts results. - * Further all Const nodes are placed in the start block. - * *start This ir_node is the unique start node of the procedure. - * - * *end_block This ir_node is the block that contains the unique - * end node of the procedure. This block contains no - * further nodes. - * *end This ir_node is the unique end node of the procedure. - * - * The following nodes are Projs from the start node, held in ir_graph for - * simple access: - * - * *frame The ir_node producing the pointer to the stack frame of - * the procedure as output. This is the Proj node on the - * third output of the start node. This output of the start - * node is tagged as pns_frame_base. In FIRM most lokal - * variables are modeled as data flow edges. Static - * allocated arrays can not be represented as dataflow - * edges. Therefore FIRM has to represent them in the stack - * frame. - * - * *globals This models a pointer to a space in the memory where - * _all_ global things are held. Select from this pointer - * with a Sel node the pointer to a global variable / - * procedure / compiler known function... . - * - * *args The ir_node that produces the arguments of the method as - * it's result. This is a Proj node on the fourth output of - * the start node. This output is tagged as pns_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 switch_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 * -------------------- @@ -182,7 +111,7 @@ * *link A pointer to an ir_node. With this pointer all Phi nodes * are attached to a Block, i.e., a Block points to it's * first Phi node, this node points to the second Phi node - * in the Block and so fourth. Used in mature_block + * in the Block and so fourth. Used in mature_immBlock * to find all Phi nodes to be matured. It's also used to * annotate a node with a better, optimized version of it. * @@ -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 switch_block()). This interface + * 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. * @@ -257,16 +186,16 @@ * * A global variable holds the current basic block. All (non block) nodes * generated are added to this block. The current block can be set with - * switch_block(block). If several blocks are constructed in parallel block + * set_cur_block(block). If several blocks are constructed in parallel block * switches need to be performed constantly. * * To generate a Block node (with the comfortable interface) it's predecessor * control flow nodes need not be known. In case of cyclic control flow these - * can not be known when the block is constructed. With add_in_edge(block, + * can not be known when the block is constructed. With add_immBlock_pred(block, * cfnode) predecessors can be added to the block. If all predecessors are - * added to the block mature_block(b) needs to be called. Calling mature_block + * added to the block mature_immBlock(b) needs to be called. Calling mature_immBlock * early improves the efficiency of the Phi node construction algorithm. - * But if several blocks are constructed at once, mature_block must only + * But if several blocks are constructed at once, mature_immBlock must only * be called after performing all set_values and set_stores in the block! * (See documentation of new_immBlock constructor.) * @@ -298,9 +227,9 @@ * ir_node *this_block, *cf_pred1, *cf_pred2, *a_val, *mem, *div, *res, *cf_op; * * this_block = new_immBlock(); - * add_in_edge(this_block, cf_pred1); - * add_in_edge(this_block, cf_pred2); - * mature_block(this_block); + * add_immBlock_pred(this_block, cf_pred1); + * add_immBlock_pred(this_block, cf_pred2); + * mature_immBlock(this_block); * a_val = get_value(42, mode_Iu); * mem = get_store(); * div = new_Div(mem, a_val, a_val); @@ -352,52 +281,19 @@ * 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); - * - * void add_in_edge (ir_node *block, ir_node *jmp); - * void mature_block (ir_node *block); - * void switch_block (ir_node *target); + * 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); + * void set_cur_block (ir_node *target); * ir_node *get_value (int pos, ir_mode *mode); * void set_value (int pos, ir_node *value); * ir_node *get_store (void); @@ -433,14 +329,14 @@ * Creates a new block. Sets current_block to itself. When a new block is * created it cannot be known how many predecessors this block will have in the * control flow graph. Therefore the list of inputs can not be fixed at - * creation. Predecessors can be added with add_in_edge (block, control flow + * creation. Predecessors can be added with add_immBlock_pred (block, control flow * operation). With every added predecessor the number of inputs to Phi nodes * also changes. * - * The block can be completed by mature_block(block) if all predecessors are - * known. If several blocks are built at once, mature_block can only be called + * 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 by mature_block + * 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 @@ -451,7 +347,7 @@ * * block_before_loop = new_block(); * set_value(x); - * mature_block(block_before_loop); + * mature_immBlock(block_before_loop); * before2header = new_Jmp; * * loop_header = new_block (); @@ -460,18 +356,18 @@ * loop_body = new_block (); * body2header = new_Jmp(); * - * add_in_edge(loop_header, before2header); - * add_in_edge(loop_header, body2header); - * add_in_edge(loop_body, header2body); + * add_immBlock_pred(loop_header, before2header); + * add_immBlock_pred(loop_header, body2header); + * add_immBlock_pred(loop_body, header2body); * - * mature_block(loop_header); - * mature_block(loop_body); + * mature_immBlock(loop_header); + * mature_immBlock(loop_body); * * get_value(loop_body, x); // gets the Phi in loop_header * set_value(loop_header, x); // sets the value the above get_value should * // have returned!!! * - * Mature_block also fixes the number of inputs to the Phi nodes. Mature_block + * Mature_immBlock also fixes the number of inputs to the Phi nodes. Mature_immBlock * should be called as early as possible, as afterwards the generation of Phi * nodes is more efficient. * @@ -503,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 @@ -523,16 +419,12 @@ * No inputs except the block it belogns to. * Output: * A tuple of 4 (5, 6) distinct values. These are labeled by the following - * projection numbers (pns_number): - * * pns_initial_exec - * mode X, points to the first block to be executed. - * * pns_global_store - * mode M, the global store - * * pns_frame_base mode P, a pointer to the base of the procedures - * stack frame. - * * pns_globals mode P, a pointer to the part of the memory containing - * _all_ global things. - * * pns_args mode T, a tuple containing all arguments of the procedure. + * projection numbers (pn_Start): + * * pn_Start_X_initial_exec mode X, points to the first block to be exe * cuted. + * * pn_Start_M mode M, the global store + * * pn_Start_P_frame_base mode P, a pointer to the base of the proce * dures stack frame. + * * pn_Start_P_globals mode P, a pointer to the part of the memory * containing_all_ global things. + * * pn_Start_T_args mode T, a tuple containing all arguments of * the procedure. * * * ir_node *new_End (void) @@ -625,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. @@ -635,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. * @@ -694,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. * @@ -744,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) * ------------------------------------------------------------ @@ -915,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 @@ -928,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. @@ -940,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. @@ -1016,7 +896,7 @@ * unifying the memories with a preceding Sync operation. * * Parameters - * arity The number of memories to syncronize. + * arity The number of memories to synchronize. * **in An array of pointers to nodes that produce an output of * type memory. * Inputs @@ -1034,6 +914,13 @@ * Returns the unique Bad node current_ir_graph->bad. * This node is used to express results of dead code elimination. * + * ir_node *new_NoMem (void) + * ----------------------------------------------------------------------------------- + * + * Returns the unique NoMem node current_ir_graph->no_mem. + * This node is used as input for operations that need a Memory, but do not + * change it like Div by const != 0, analyzed calls etc. + * * ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj) * ---------------------------------------------------------- * @@ -1112,15 +999,15 @@ * * There are two special routines for the global store: * - * inline void set_store (ir_node *store) - * -------------------------------------- + * void set_store (ir_node *store) + * ------------------------------- * * Adds the store to the array of known values at a reserved * position. * Requires current_block to be set correctly. * - * inline ir_node *get_store (void) - * -------------------------------- + * ir_node *get_store (void) + * ------------------------- * * Returns the node defining the actual store. * Requires current_block to be set correctly. @@ -1257,7 +1144,7 @@ ir_node *new_rd_Raise (dbg_info *db, ir_graph *irg, ir_node *block, * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. - * @param *mode The mode of the operands and redults. + * @param *mode The mode of the operands and results. * @param *con Points to an entry in the constant table. * @param *tp The type of the constant. */ @@ -1273,13 +1160,13 @@ 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, ir_mode *mode, tarval *con); -/** Constructor for a SymConst node. +/** Constructor for a SymConst_type node. * * This is the constructor for a symbolic constant. * There are four kinds of symbolic constants: @@ -1300,14 +1187,52 @@ ir_node *new_rd_Const (dbg_info *db, ir_graph *irg, ir_node *block, * Outputs of the node. * An unsigned integer (I_u) or a pointer (P). * + * Mention union in declaration so that the firmjni generator recognizes that + * it can not cast the argument to an int. + * * @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 symkind The kind of the symbolic constant: type_tag, size, addr_name or addr_ent. * @param value A type, entity or a ident depending on the SymConst kind. + * @param tp The source type of the constant. */ +ir_node *new_rd_SymConst_type (dbg_info* db, ir_graph *irg, ir_node *block, union symconst_symbol value, + symconst_kind symkind, type *tp); + +/** Constructor for a SymConst node. + * + * Same as new_rd_SymConst_type, except that it sets the type to type_unknown. */ ir_node *new_rd_SymConst (dbg_info *db, ir_graph *irg, ir_node *block, - symconst_symbol value, symconst_kind symkind); + union symconst_symbol value, symconst_kind symkind); + +/** Constructor for a SymConst addr_ent 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. */ +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. */ +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. */ +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. */ +ir_node *new_rd_SymConst_size (dbg_info *db, ir_graph *irg, type *symbol, type *tp); /** Constructor for a Sel node. * @@ -1315,7 +1240,7 @@ ir_node *new_rd_SymConst (dbg_info *db, 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 *db A pointer for debug information. * @param *irg The ir graph the node belongs to. @@ -1324,13 +1249,13 @@ ir_node *new_rd_SymConst (dbg_info *db, 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. */ ir_node *new_rd_Sel (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, - ir_node *objptr, int n_index, ir_node *index[], entity *ent); + ir_node *objptr, int n_index, ir_node *index[], entity *ent); /** Constructor for a InstOf node. * @@ -1343,7 +1268,8 @@ ir_node *new_rd_Sel (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *st * @param *objptr * @param *ent */ -ir_node *new_rd_InstOf (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, ir_node *objptr, type *ent); +ir_node *new_rd_InstOf (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, + ir_node *objptr, type *ent); /** Constructor for a Call node. * @@ -1361,24 +1287,6 @@ ir_node *new_rd_InstOf (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *st ir_node *new_rd_Call (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, ir_node *callee, int arity, ir_node *in[], type *tp); -/** Constructor for a FuncCall node. - * - * FuncCall is a function Call that has no side effects. Therefore there - * is not memory operand or result. - * - * @param *db A pointer for debug information. - * @param *irg The ir graph the node belong to. - * @param *block The block the node belong to. - * @param *callee A pointer to the called procedure. - * @param arity The number of procedure parameters. - * @param *in[] An array with the pointers to the parameters. The constructor - * copies this array. - * @param *tp Type information of the procedure called. - */ -ir_node *new_rd_FuncCall (dbg_info *db, ir_graph *irg, ir_node *block, - ir_node *callee, int arity, ir_node *in[], - type *tp); - /** Constructor for a Add node. * * @param *db A pointer for debug information. @@ -1389,7 +1297,7 @@ ir_node *new_rd_FuncCall (dbg_info *db, ir_graph *irg, ir_node *block, * @param *mode The mode of the operands and the result. */ ir_node *new_rd_Add (dbg_info *db, ir_graph *irg, ir_node *block, - ir_node *op1, ir_node *op2, ir_mode *mode); + ir_node *op1, ir_node *op2, ir_mode *mode); /** Constructor for a Sub node. * @@ -1401,7 +1309,7 @@ ir_node *new_rd_Add (dbg_info *db, ir_graph *irg, ir_node *block, * @param *mode The mode of the operands and the result. */ ir_node *new_rd_Sub (dbg_info *db, ir_graph *irg, ir_node *block, - ir_node *op1, ir_node *op2, ir_mode *mode); + ir_node *op1, ir_node *op2, ir_mode *mode); /** Constructor for a Minus node. * @@ -1412,7 +1320,7 @@ ir_node *new_rd_Sub (dbg_info *db, ir_graph *irg, ir_node *block, * @param *mode The mode of the operand and the result. */ ir_node *new_rd_Minus (dbg_info *db, ir_graph *irg, ir_node *block, - ir_node *op, ir_mode *mode); + ir_node *op, ir_mode *mode); /** Constructor for a Mul node. * @@ -1635,9 +1543,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. * @@ -1691,7 +1600,7 @@ ir_node *new_rd_Free (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *st * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. - * @param arity The number of memories to syncronize. + * @param arity The number of memories to synchronize. * @param *in[] An array of pointers to nodes that produce an output of type * memory. The constructor copies this array. */ @@ -1702,7 +1611,7 @@ ir_node *new_rd_Sync (dbg_info *db, ir_graph *irg, ir_node *block, int arity, * Projects a single value out of a tuple. The parameter proj gives the * position of the value within the tuple. * - * @param *db A pointer for deubugginformation. + * @param *db A pointer for debug information. * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. * @param arg A node producing a tuple. The node must have mode_T. @@ -1834,6 +1743,7 @@ ir_node *new_rd_EndExcept(dbg_info *db, ir_graph *irg, ir_node *block); * * The constructor builds the Filter in intraprocedural view. * + * @param *db A pointer for debug information. * @param *irg The ir graph the node belong to. * @param *block The block the node belong to. * @param *arg The tuple value to project from. @@ -1843,6 +1753,29 @@ ir_node *new_rd_EndExcept(dbg_info *db, ir_graph *irg, ir_node *block); ir_node *new_rd_Filter (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode, long proj); +/** Constructor for a NoMem node. + * + * Returns the unique NoMem node of the graph. The same as + * get_irg_no_mem(). + * + * @param *irg The ir graph the node belongs to. + */ +ir_node *new_rd_NoMem (ir_graph *irg); + +/** Constructor for a Mux node. + * + * Adds the node to the block in current_ir_block. + * + * @param *db A pointer for debug information. + * @param *irg The ir graph the node belong to. + * @param *block The block the node belong to. + * @param *sel The ir_node that calculates the boolean select. + * @param *ir_true The ir_node that calculates the true result. + * @param *ir_false The ir_node that calculates the false result. + * @param *mode The mode of the node (and it_true and ir_false). + */ +ir_node *new_rd_Mux (dbg_info *db, ir_graph *irg, ir_node *block, + ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode); /*-------------------------------------------------------------------------*/ /* The raw interface without debug support */ @@ -1910,7 +1843,7 @@ ir_node *new_r_Cond (ir_graph *irg, ir_node *block, ir_node *c); * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. * @param *store The state of memory. - * @param arity Number of array indexes. + * @param arity Number of array indices. * @param *in[] Array with index inputs to the node. The constructor copies this array. */ ir_node *new_r_Return (ir_graph *irg, ir_node *block, @@ -1938,7 +1871,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. * @@ -1963,11 +1896,11 @@ 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, - symconst_symbol value, symconst_kind symkind); + union symconst_symbol value, symconst_kind symkind); /** Constructor for a Sel node. * @@ -1975,7 +1908,7 @@ ir_node *new_r_SymConst (ir_graph *irg, ir_node *block, * with a compound type. It explicitly specifies the entity selected. * Dynamically the node may select entities that overwrite the given * entity. If the selected entity is an array element entity the Sel - * node takes the required array indicees as inputs. + * node takes the required array indices as inputs. * * @param *irg The ir graph the node belongs to. * @param *block The ir block the node belongs to. @@ -1983,8 +1916,8 @@ ir_node *new_r_SymConst (ir_graph *irg, ir_node *block, * from is allocated. * @param *objptr A pointer to a compound entity the Sel operation selects a * single attribute from. - * @param *n_index The number of array indicees needed to select an array element entity. - * @param *index[] If the compound entity is an array the indicees of the selected + * @param *n_index The number of array indices needed to select an array element entity. + * @param *index[] If the compound entity is an array the indices of the selected * element entity. The constructor copies this array. * @param *ent The entity to select. */ @@ -2001,7 +1934,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); @@ -2016,7 +1948,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[], @@ -2029,7 +1960,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); @@ -2042,7 +1972,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); @@ -2053,7 +1982,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); @@ -2064,7 +1992,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); @@ -2076,7 +2003,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); @@ -2088,7 +2014,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); @@ -2100,7 +2025,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); @@ -2112,7 +2036,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); @@ -2123,7 +2046,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); @@ -2135,7 +2057,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); @@ -2147,7 +2068,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); @@ -2159,7 +2079,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); @@ -2170,7 +2089,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); @@ -2181,7 +2099,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); @@ -2193,7 +2110,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); @@ -2205,7 +2121,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); @@ -2218,7 +2133,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); @@ -2230,7 +2144,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); @@ -2241,7 +2154,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); @@ -2254,7 +2166,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); @@ -2266,7 +2177,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); @@ -2277,10 +2187,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. @@ -2289,9 +2200,9 @@ ir_node *new_r_Load (ir_graph *irg, ir_node *block, * @param *adr A pointer to the variable to be read in this memory. * @param *val The value to write to this variable. */ - ir_node *new_r_Store (ir_graph *irg, ir_node *block, - ir_node *store, ir_node *adr, ir_node *val); + ir_node *store, ir_node *adr, ir_node *val); + /** Constructor for a Alloc node. * * The Alloc node extends the memory by space for an entity of type alloc_type. @@ -2302,9 +2213,7 @@ 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,7 +2228,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); @@ -2332,10 +2240,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 +2256,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 +2268,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 +2294,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 +2329,7 @@ ir_node *new_r_Confirm (ir_graph *irg, ir_node *block, /** Constructor for a Unknown node. * - * Represents an arbtrary valus. Places the node in + * Represents an arbitrary value. Places the node in * the start block. * * @param *irg The ir graph the node belongs to. @@ -2442,8 +2346,7 @@ ir_node *new_r_Unknown(ir_graph *irg, ir_mode *m); * * @param *irg The ir graph the node belong to. * @param *block The block the node belong to. - * @param *callee The call node bisible in the intra procedural view. - * + * @param *callee The call node visible in the intra procedural view. */ ir_node *new_r_CallBegin(ir_graph *irg, ir_node *block, ir_node *callee); @@ -2453,7 +2356,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 +2365,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 +2377,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,42 +2396,60 @@ 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 */ /*-----------------------------------------------------------------------*/ /** Sets the current block in which the following constructors place the - nodes they construct. */ -void switch_block (ir_node *target); + * nodes they construct. + * + * @param target The new current block. + */ +void set_cur_block (ir_node *target); + +/** Returns the current block of the current graph. */ +ir_node *get_cur_block(void); + +/** Returns the fixed nodes of the current graph. */ +#define get_cur_end_block() get_irg_end_block(current_ir_graph) +#define get_cur_end() get_irg_end(current_ir_graph) +#define get_cur_start_block() get_irg_start_block(current_ir_graph) +#define get_cur_start() get_irg_start(current_ir_graph) /** Constructor for a Block node. * - * Adds the block to the graph in current_ir_graph. + * Adds the block to the graph in current_ir_graph. Constructs a Block + * 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'. @@ -2543,7 +2461,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); @@ -2552,7 +2469,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); @@ -2563,7 +2479,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); @@ -2581,7 +2496,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); @@ -2595,9 +2509,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[]); @@ -2609,7 +2522,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); @@ -2622,12 +2534,11 @@ ir_node *new_d_Raise (dbg_info* db, ir_node *store, ir_node *obj); * level type information for the constant value. * * @param *db A pointer for debug information. - * @param *mode The mode of the operands and redults. - * @param *con Points to an entry in the constant table. This pointer is added to the attributes of the node (self->attr.con). - * @param *tp The type of the constante. - * + * @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 constant. */ - ir_node *new_d_Const_type (dbg_info* db, ir_mode *mode, tarval *con, type *tp); /** Constructor for a Const node. @@ -2639,13 +2550,13 @@ 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 *con Points to an entry in the constant table. This pointer is added to the attributes of the node (self->attr.con). - * + * @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); -/** Constructor for a SymConst node. +/** Constructor for a SymConst_type node. * * Adds the node to the block in current_ir_block. * This is the constructor for a symbolic constant. @@ -2669,20 +2580,30 @@ ir_node *new_d_Const (dbg_info* db, ir_mode *mode, tarval *con); * * @param *db A pointer for debug information. * @param value A type, entity or ident depending on the SymConst kind. - * @param symkind The kind of the symbolic constant: symconst_type_tag, symconst_size or symconst_addr_name. + * @param symkind The kind of the symbolic constant: symconst_type_tag, symconst_size + * or symconst_addr_name. + * @param tp The source type of the constant. * */ -ir_node *new_d_SymConst (dbg_info* db, symconst_symbol value, symconst_kind kind); +ir_node *new_d_SymConst_type (dbg_info* db, union symconst_symbol value, symconst_kind kind, type* tp); + +/** Constructor for a SymConst node. + * + * Same as new_d_SymConst_type, except that it sets the type to type_unknown. */ +ir_node *new_d_SymConst (dbg_info* db, union symconst_symbol value, symconst_kind kind); /** Constructor for a simpleSel node. * - * Adds the node to the block in current_ir_block. + * This is a shortcut for the new_d_Sel() constructor. To be used for + * Sel nodes that do not select from an array, i.e., have no index + * inputs. It adds the two parameters 0, NULL. * * @param *db A pointer for debug information. - * @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 *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_d_simpleSel(dbg_info* db, ir_node *store, ir_node *objptr, entity *ent); @@ -2692,15 +2613,16 @@ 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. * @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. */ @@ -2717,7 +2639,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); @@ -2732,7 +2653,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[], @@ -2746,7 +2666,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); @@ -2758,7 +2677,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); @@ -2770,7 +2688,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); @@ -2782,7 +2699,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); @@ -2794,7 +2710,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); @@ -2806,7 +2721,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); @@ -2818,7 +2732,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); @@ -2830,7 +2743,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); @@ -2841,7 +2753,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); @@ -2855,7 +2766,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); @@ -2867,7 +2777,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); @@ -2879,7 +2788,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); @@ -2890,7 +2798,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); @@ -2902,7 +2809,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); @@ -2914,7 +2820,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); @@ -2926,7 +2831,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); @@ -2938,7 +2842,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); @@ -2949,7 +2852,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); @@ -2960,7 +2862,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); @@ -2972,7 +2873,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); @@ -2980,11 +2880,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); @@ -2995,9 +2894,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. * @@ -3010,7 +2909,7 @@ ir_node *new_d_Load (dbg_info* db, ir_node *store, ir_node *addr); */ ir_node *new_d_Store (dbg_info* db, ir_node *store, ir_node *addr, ir_node *val); -/**Constructor for a Alloc node. +/** Constructor for a Alloc node. * * The Alloc node extends the memory by space for an entity of type alloc_type. * Adds the node to the block in current_ir_block. @@ -3020,12 +2919,11 @@ 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); -/**Constructor for a Free node. + /** Constructor for a Free node. * * Frees the memory occupied by the entity pointed to by the pointer * arg. Type indicates the type of the entity the argument points to. @@ -3036,12 +2934,11 @@ 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); -/**Constructor for a Sync node. +/** Constructor for a Sync node. * * Merges several memory values. The node assumes that a variable * either occurs only in one of the memories, or it contains the same @@ -3049,30 +2946,28 @@ 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[]); -/**Constructor for a Proj node. +/** Constructor for a Proj node. * * Projects a single value out of a tuple. The parameter proj gives the * 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); -/**Constructor for a defaultProj node. +/** Constructor for a defaultProj node. * * Represents the default control flow of a Switch-Cond node. * Adds the node to the block in current_ir_block. @@ -3080,11 +2975,10 @@ 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); -/**Constructor for a Tuple node. +/** Constructor for a Tuple node. * * This is an auxiliary node to replace a node that returns a tuple * without changing the corresponding Proj nodes. @@ -3093,12 +2987,11 @@ 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[]); -/**Constructor for a Id node. +/** Constructor for a Id node. * * This is an auxiliary node to replace a node that returns a single * value. Adds the node to the block in current_ir_block. @@ -3106,15 +2999,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); @@ -3130,18 +3021,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 a Unknown node. +/** 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); @@ -3153,31 +3042,28 @@ 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); -/** Constructor for a EndReg node. +/** Constructor for an EndReg node. * *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 a 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); -/**Constructor for a Breake node. +/** Constructor for a Break node. * * Used to represent exceptional procedure end in interprocedural view. * Adds the node to the block in current_ir_block. @@ -3188,7 +3074,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); @@ -3208,42 +3093,43 @@ 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: -void switch_block (ir_node *target); */ - -/* Constructs a Block with a fixed number of predecessors. - Does set current_block. Can be used with automatic Phi - node construction. */ +/* Needed from the interface with debug support: +void set_cur_block (ir_node *target); */ /** Constructor for a Block node. * * Constructor for a Block node. Adds the block to the graph in - * current_ir_graph . + * current_ir_graph. Constructs a Block with a fixed number of + * predecessors. Does set current_block. Can be used with automatic + * Phi node construction. * * @param arity The number of control predecessors. * @param in An array of control predecessors. The length of @@ -3258,18 +3144,16 @@ ir_node *new_Block(int arity, ir_node *in[]); */ ir_node *new_Start (void); -/** Constructor for a End node. +/** Constructor for an End node. * * Adds the node to the block in current_ir_block. - * */ ir_node *new_End (void); -/** Constructor for a EndReg node. +/** Constructor for an EndReg node. * * Used to represent regular procedure end in interprocedual view. * Adds the node to the block in current_ir_block. - * */ ir_node *new_EndReg (void); @@ -3277,18 +3161,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); @@ -3297,12 +3177,11 @@ 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); -/**Constructor for a Cond node. +/** Constructor for a Cond node. * * If c is mode_b represents a conditional branch (if/else). If c is * mode_Is/mode_Iu (?) represents a switch. (Allocates dense Cond @@ -3313,7 +3192,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); @@ -3323,9 +3201,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[]); @@ -3335,7 +3212,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); @@ -3346,12 +3222,17 @@ ir_node *new_Raise (ir_node *store, ir_node *obj); * supported: If tv is entity derives a somehow useful type.) * Adds the node to the block in current_ir_block. * - * @param *mode The mode of the operands and redults. - * @param *con Points to an entry in the constant table. This pointer is added to the attributes of the node (self->attr.con). - * + * @param *mode The mode of the operands and results. + * @param *con Points to an entry in the constant table. This pointer is + * added to the attributes of the node. */ ir_node *new_Const (ir_mode *mode, tarval *con); +/** Constructor for a Const node. + * + * Derives mode from passed type. */ +ir_node *new_Const_type(tarval *con, type *tp); + /** Constructor for a SymConst node. * * Adds the node to the block in current_ir_block. @@ -3376,16 +3257,18 @@ 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 (symconst_symbol value, symconst_kind kind); +ir_node *new_SymConst (union symconst_symbol value, symconst_kind kind); /** Constructor for a simpelSel node. + * + * This is a shortcut for the new_Sel() constructor. To be used for + * Sel nodes that do not select from an array, i.e., have no index + * inputs. It adds the two parameters 0, NULL. * * @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); @@ -3395,21 +3278,22 @@ 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. */ ir_node *new_Sel (ir_node *store, ir_node *objptr, int arity, ir_node *in[], entity *ent); -/** Constructor for a InstOf node. +/** Constructor for an InstOf node. * * Adds the node to the block in current_ir_block. * For translating Java. Not supported as standard firm node. @@ -3417,7 +3301,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); @@ -3431,7 +3314,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); @@ -3441,7 +3323,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); @@ -3455,7 +3336,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); @@ -3466,7 +3346,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); @@ -3476,7 +3355,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); @@ -3486,7 +3364,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); @@ -3497,7 +3374,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); @@ -3508,7 +3384,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); @@ -3519,7 +3394,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); @@ -3530,7 +3404,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); @@ -3540,7 +3413,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); @@ -3551,7 +3423,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); @@ -3561,7 +3432,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); @@ -3571,7 +3441,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); @@ -3581,7 +3450,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); @@ -3592,7 +3460,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); @@ -3602,7 +3469,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); @@ -3613,7 +3479,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); @@ -3624,7 +3489,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); @@ -3634,7 +3498,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); @@ -3644,7 +3507,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); @@ -3655,7 +3517,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); @@ -3663,26 +3524,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); @@ -3695,7 +3555,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); @@ -3711,26 +3570,24 @@ 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); + type *free_type); -/**Constructor for a Sync node. +/** Constructor for a Sync node. * * Merges several memory values. The node assumes that a variable * either occurs only in one of the memories, or it contains the same * 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[]); -/**Constructor for a Proj node. +/** Constructor for a Proj node. * * Projects a single value out of a tuple. The parameter proj gives the * position of the value within the tuple. @@ -3739,11 +3596,10 @@ 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); -/**Costructor for a Filter node. +/** Costructor for a Filter node. * * Constructor for a Filter node. Adds the node to the block in current_ir_block. * Filter is a node with two views used to construct the interprocedural view. @@ -3757,22 +3613,20 @@ 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); -/**Constructor for a defaultProj node. +/** Constructor for a defaultProj node. * * Represents the default control flow of a Switch-Cond node. * Adds the node to the block in current_ir_block. * * @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); -/**Constructor for a Tuple node. +/** Constructor for a Tuple node. * * This is an auxiliary node to replace a node that returns a tuple * without changing the corresponding Proj nodes. @@ -3780,28 +3634,24 @@ 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[]); -/**Constructor for a Id node. +/** Constructor for an Id node. * * This is an auxiliary node to replace a node that returns a single * value. Adds the node to the block in current_ir_block. * * @param *val The operand to Id. * @param *mode The mode of *val. - * */ ir_node *new_Id (ir_node *val, ir_mode *mode); -/**Constructor 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_Bad (void); /** Constructor for a Confirm node. @@ -3815,34 +3665,35 @@ 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); -/** Constructor for a Unknown node. +/** Constructor for an Unknown node. * * Represents an arbitrary value. Places the node in * 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. */ @@ -3851,45 +3702,76 @@ ir_node *new_FuncCall (ir_node *callee, int arity, ir_node *in[], /* needed also. */ /*---------------------------------------------------------------------*/ -/* --- Block construction --- */ -/* immature Block without predecessors */ +/** Create an immature block. + * + * An immature block has an unknown number of predecessors. Predecessors + * can be added with add_immBlock_pred(). Once all predecessors are + * added the block must be matured. + * + * Adds the block to the graph in current_ir_graph. Does set + * current_block. Can be used with automatic Phi node construction. + * This constructor can only be used if the graph is in + * state_building. + */ ir_node *new_d_immBlock (dbg_info* db); ir_node *new_immBlock (void); /** Add a control flow edge to an immature block. */ -void add_in_edge (ir_node *immblock, ir_node *jmp); +void add_immBlock_pred (ir_node *immblock, ir_node *jmp); -/** fixes the number of predecessors of a block. */ -void mature_block (ir_node *block); +/** Fix the number of predecessors of an immature block. */ +void mature_immBlock (ir_node *block); +#define mature_cur_block() mature_immBlock(get_cur_block()); -/* --- Parameter administration --- */ -/* Read a value from the array with the local variables. Use this - function to obtain the last definition of the value associated with - pos. Pos may not exceed the value passed as n_loc to new_ir_graph. */ + +/** Get the current value of a local variable. + * + * Use this function to obtain the last definition of the local variable + * associated with pos. Pos may not exceed the value passed as n_loc + * to new_ir_graph. This call automatically inserts Phi nodes. + * + * @param *db A pointer for debug information. + * @param pos The position/id of the local variable. + * @param *mode The mode of the value to get. + */ ir_node *get_d_value (dbg_info* db, int pos, ir_mode *mode); ir_node *get_value (int pos, ir_mode *mode); -/** Write a value in the array with the local variables. Use this function - to remember a new definition of the value associated with pos. Pos may - not exceed the value passed as n_loc to new_ir_graph. */ +/** Remark a new definition of a variable. + * + * Use this function to remember a new definition of the value + * associated with pos. Pos may not exceed the value passed as n_loc + * to new_ir_graph. This call is needed to automatically inserts Phi + * nodes. + * + * @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); -/** Read a store. - Use this function to get the most recent version of the store (type M). - Internally it does the same as get_value. */ +/** Get the current memory state. + * + * 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); -/** Write a store. */ +/** Remark a new definition of the memory state. + * + * Use this function to remember a new definition of the memory state. + * 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 */ +/** keep this node alive even if End is not control-reachable from it + * + * @param ka The node to keep alive. + */ void keep_alive (ir_node *ka); -/* --- Useful access routines --- */ -/** Returns the current block of the current graph. To set the current - block use switch_block(). */ -ir_node *get_cur_block(void); - /** Returns the frame type of the current graph */ type *get_cur_frame_type(void); @@ -3905,9 +3787,9 @@ void finalize_cons (ir_graph *irg); * This function is called, whenever a local variable is used before definition * * @parameter mode the mode of the local var - * @pos position choosen be the frontend for this var + * @pos position chosen be the frontend for this var * - * @return a firm node of mode @p mode that initialises the var at position pos + * @return a firm node of mode @p mode that initializes the var at position pos * * @note * Do not return NULL @@ -3915,11 +3797,5 @@ void finalize_cons (ir_graph *irg); */ typedef ir_node *default_initialize_local_variable_func_t(ir_mode *mode, int pos); -/** - * Initializes the graph construction. - * - * @param func @see default_initialize_local_variable_func_t - */ -void init_cons (default_initialize_local_variable_func_t *func); # endif /* _IRCONS_H_ */