*
* *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.
+ * 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.
*
* *current_block A pointer to the current block. Any node created with
* one of the node constructors (new_<opcode>) are assigned
- * to this block. It can be set with switch_block(block).
+ * 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
* *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.
*
* (new_<Node> constructurs and a set of additional routines.)
* * 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_<Node> constructors and switch_block()). This interface
+ * by hand. (new_<Node> 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
*
* 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.)
*
* 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);
* 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);
+ * 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);
* 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
- * get the right predecessors in case of cyclic dependencies. If all set_values
+ * of the block. This is necessary so that Phi nodes created mature_immBlock * get the right predecessors in case of cyclic dependencies. If all set_values
* of this block are called after maturing it and before calling get_value
* in some block that is control flow dependent on this block, the construction
* is correct.
*
* 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 ();
* 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.
*
* 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)
* 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.
* 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.
* @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.
*
* @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.
*
* @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);
* @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[],
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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.
* @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);
* @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);
* @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[]);
* @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);
* @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);
* @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);
* @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);
*
* @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);
*
* @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);
*
* @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);
* @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);
* @param *in[] An array with the pointers to the parameters.
* The constructor copies this array.
* @param *type Type information of the procedure called.
- *
*/
ir_node *new_r_FuncCall (ir_graph *irg, ir_node *block,
ir_node *callee, int arity, ir_node *in[],
*
* @param target The new current block.
*/
-void switch_block (ir_node *target);
+void set_cur_block (ir_node *target);
/** Returns the current block of the current graph. */
ir_node *get_cur_block(void);
* 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);
* 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);
* Jmp represents control flow to a single control successor.
*
* @param *db A pointer for debug information.
- *
*/
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);
* @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[]);
* @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);
* @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);
* @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);
* @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);
* @param *store
* @param *objptr
* @param *ent
- *
*/
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[],
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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);
* @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.
*
* @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);
* @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);
* @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[]);
* @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);
* @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);
* @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[]);
* @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);
*
* Returns the unique Bad node of the graph. The same as
* get_irg_bad().
- *
*/
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);
* the start block.
*
* @param *m The mode of the unknown value.
- *
*/
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);
*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);
* 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);
* 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);
* @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);
* @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_FuncCall (dbg_info* db, ir_node *callee, int arity, ir_node *in[],
type *tp);
/*-----------------------------------------------------------------------*/
/* Needed from the interfase with debug support:
-void switch_block (ir_node *target); */
+void set_cur_block (ir_node *target); */
/** Constructor for a Block node.
*
/** Constructor for an End node.
*
* Adds the node to the block in current_ir_block.
- *
*/
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);
*
* 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);
* 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);
*
*
* @param *c The conditions parameter.Can be of mode b or I_u.
- *
*/
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[]);
*
* @param *store The current memory.
* @param *obj A pointer to the Except variable.
- *
*/
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);
*
* @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);
* @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);
* @param *store
* @param *objptr
* @param *ent
- *
*/
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);
* 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);
* @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);
* @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);
*
* @param *op The operand .
* @param *mode The mode of the operand and the result.
- *
*/
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);
* @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);
* @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);
* @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);
* @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);
*
* @param *op The operand
* @param *mode The mode of the operands and the result.
- *
*/
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);
* @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);
* @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);
*
* @param *op The operand.
* @param *mode The mode of the operand and the result.
- *
*/
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);
* @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);
* @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);
* @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);
*
* @param *op1 The operand 1.
* @param *op2 The operand 2.
- *
*/
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);
*
* @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);
*
* 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);
* @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);
* @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);
* @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[]);
* @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);
* @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);
*
* @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);
*
* @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[]);
*
* @param *val The operand to Id.
* @param *mode The mode of *val.
- *
*/
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);
* @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);
* the start block.
*
* @param *m The mode of the unknown value.
- *
*/
ir_node *new_Unknown(ir_mode *m);
* @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_FuncCall (ir_node *callee, int arity, ir_node *in[],
type *tp);
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);
/** Fix the number of predecessors of an immature block. */
-void mature_block (ir_node *block);
+void mature_immBlock (ir_node *block);
+#define mature_cur_block() mature_immBlock(get_cur_block());
/** Get the current value of a local variable.
*
* @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.
* 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);
* 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
*/
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_ */