*
* For extensive documentation of FIRM see UKA Techreport 1999-14.
*
- * =========
- *
- * The struct ir_graph
- * -------------------
- *
- * This struct contains all information about a procedure.
- * It's allocated directly to memory.
- *
- * The fields of ir_graph:
- *
- * *ent The entity describing this procedure.
- *
- * The beginning and end of a graph:
- *
- * *start_block This ir_node is the block that contains the unique
- * start node of the procedure. With it it contains
- * the Proj's on starts results.
- * Further all Const nodes are placed in the start block.
- * *start This ir_node is the unique start node of the procedure.
- *
- * *end_block This ir_node is the block that contains the unique
- * end node of the procedure. This block contains no
- * further nodes.
- * *end This ir_node is the unique end node of the procedure.
- *
- * The following nodes are Projs from the start node, held in ir_graph for
- * simple access:
- *
- * *frame The ir_node producing the pointer to the stack frame of
- * the procedure as output. This is the Proj node on the
- * third output of the start node. This output of the start
- * node is tagged as pns_frame_base. In FIRM most lokal
- * variables are modeled as data flow edges. Static
- * allocated arrays can not be represented as dataflow
- * edges. Therefore FIRM has to represent them in the stack
- * frame.
- *
- * *globals This models a pointer to a space in the memory where
- * _all_ global things are held. Select from this pointer
- * with a Sel node the pointer to a global variable /
- * procedure / compiler known function... .
- *
- * *args The ir_node that produces the arguments of the method as
- * it's result. This is a Proj node on the fourth output of
- * the start node. This output is tagged as pn_Start_T_args.
- *
- * *bad The bad node is an auxiliary node. It is needed only once,
- * so there is this globally reachable node.
- *
- * Datastructures that are private to a graph:
- *
- * *obst An obstack that contains all nodes.
- *
- * *current_block A pointer to the current block. Any node created with
- * one of the node constructors (new_<opcode>) are assigned
- * to this block. It can be set with set_cur_block(block).
- * Only needed for ir construction.
- *
- * params/n_loc An int giving the number of local variables in this
- * procedure. This is neede for ir construction. Name will
- * be changed.
- *
- * *value_table This hash table (pset) is used for global value numbering
- * for optimizing use in iropt.c.
- *
- * *Phi_in_stack; a stack needed for automatic Phi construction, needed only
- * during ir construction.
- *
- * visited A int used as flag to traverse the ir_graph.
- *
- * block_visited A int used as a flag to traverse block nodes in the graph.
*
* Three kinds of nodes
* --------------------
*
* 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_<Node> 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_<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
+ * - An even less comfortable interface where the block needs to be specified
* explicitly. This is called the "raw" interface. (new_r_<Node>
* constructors). These nodes are not optimized.
*
* constructors and at the paragraph COPING WITH DATA OBJECTS at the
* end of this documentation.
*
- * The comfortable interface contains the following routines further explained
+ * The comfortable interface contains the following routines further explained
* below:
*
* ir_node *new_immBlock (void);
* ir_node *new_Start (void);
* ir_node *new_End (void);
* ir_node *new_Jmp (void);
+ * ir_node *new_IJmp (ir_node *tgt);
* ir_node *new_Cond (ir_node *c);
* ir_node *new_Return (ir_node *store, int arity, ir_node **in);
- * ir_node *new_Raise (ir_node *store, ir_node *obj);
* ir_node *new_Const (ir_mode *mode, tarval *con);
* ir_node *new_SymConst (symconst_symbol value, symconst_kind kind);
* 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_InstOf (ir_node *store, ir_node obj, type *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_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_Cast (ir_node *op, ir_type *to_tp);
* 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,
+ * ir_node *new_Alloc (ir_node *store, ir_node *size, ir_type *alloc_type,
* where_alloc where);
* ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size,
- * type *free_type);
+ * ir_type *free_type, where_alloc where);
* ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj);
* ir_node *new_NoMem (void);
+ * ir_node *new_Mux (ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode);
+ * ir_node *new_CopyB (ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type);
+ * ir_node *new_InstOf (ir_node *store, ir_node obj, ir_type *ent);
+ * ir_node *new_Raise (ir_node *store, ir_node *obj);
+ * ir_node *new_Bound (ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper);
*
* void add_immBlock_pred (ir_node *block, ir_node *jmp);
* void mature_immBlock (ir_node *block);
* The block can be completed by mature_immBlock(block) if all predecessors are
* known. If several blocks are built at once, mature_immBlock can only be called
* after set_value has been called for all values that are life at the end
- * of the block. This is necessary so that Phi nodes created mature_immBlock * get the right predecessors in case of cyclic dependencies. If all set_values
+ * of the block. This is necessary so that Phi nodes created mature_immBlock
+ * get the right predecessors in case of cyclic dependencies. If all set_values
* of this block are called after maturing it and before calling get_value
* in some block that is control flow dependent on this block, the construction
* is correct.
* 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
* Output:
* Control flow to the next block.
*
+ * ir_node *new_IJmp (ir_node *tgt)
+ * -----------------------
+ *
+ * Creates an IJmp node.
+ *
+ * Inputs:
+ * The node that represents the target jump address
+ * Output:
+ * Control flow to an unknown target, must be pinned by
+ * the End node.
+ *
* ir_node *new_Cond (ir_node *c)
* ------------------------------
*
* Output
* Control flow to the end block.
*
- * ir_node *new_Raise (ir_node *store, ir_node *obj)
- * -------------------------------------------------
- *
- * Raises an exception. Unconditional change of control flow. Writes
- * an explicit Except variable to memory to pass it to the exception
- * handler. See TechReport 1999-14, chapter Exceptions.
- *
- * Inputs:
- * The memory state.
- * A pointer to the Except variable.
- * Output:
- * A tuple of control flow and the changed memory state. The control flow
- * points to the exception handler if it is definied in this procedure,
- * else it points to the end_block.
- *
- *
* ---------
*
* ir_node *new_Const (ir_mode *mode, tarval *con)
* 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.
* 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.
*
* ------------
*
* 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.
*
* ir_node *new_Minus (ir_node *op, ir_mode *mode)
* -----------------------------------------------
*
- * Unary Minus operations on floating point values.
+ * Unary Minus operations on integer and floating point values.
*
* ir_node *new_Mul (ir_node *op1, ir_node *op2, ir_mode *mode)
* ------------------------------------------------------------
* Output:
* A 16-tuple containing the results of the 16 different comparisons.
* The following is a list giving the comparisons and a projection
- * number (pnc_number) to use in Proj nodes to extract the proper result.
- * False false
- * Eq equal
- * Lt less
- * Le less or equal
- * Gt greater
- * Ge greater of equal
- * Lg less or greater
- * Leg less, equal or greater = ordered
- * Uo unordered
- * Ue unordered or equal
- * Ul unordered or less
- * Ule unordered, less or equal
- * Ug unordered or greater
- * Uge unordered, greater or equal
- * Ne unordered, less or greater = not equal
- * True true
+ * number (pn_Cmp) to use in Proj nodes to extract the proper result.
+ * pn_Cmp_False false
+ * pn_Cmp_Eq equal
+ * pn_Cmp_Lt less
+ * pn_Cmp_Le less or equal
+ * pn_Cmp_Gt greater
+ * pn_Cmp_Ge greater of equal
+ * pn_Cmp_Lg less or greater
+ * pn_Cmp_Leg less, equal or greater = ordered
+ * pn_Cmp_Uo unordered
+ * pn_Cmp_Ue unordered or equal
+ * pn_Cmp_Ul unordered or less
+ * pn_Cmp_Ule unordered, less or equal
+ * pn_Cmp_Ug unordered or greater
+ * pn_Cmp_Uge unordered, greater or equal
+ * pn_Cmp_Ne unordered, less or greater = not equal
+ * pn_Cmp_True true
*
*
*
* 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
* 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
* --------------------------------------
* A tuple of the changed memory and a control flow to be taken in
* case of an exception.
*
- * ir_node *new_Alloc (ir_node *store, ir_node *size, type *alloc_type,
- * --------------------------------------------------------------------
+ * ir_node *new_Alloc (ir_node *store, ir_node *size, ir_type *alloc_type,
+ * -----------------------------------------------------------------------
* where_alloc where)
* ------------------
*
* a.*type A pointer to the class the allocated data object
* belongs to.
*
- * ir_node *new_Free (ir_node *store, ir_node *ptr, type *free_type)
- * ------------------------------------------------------------------
+ * ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size, ir_type *free_type,
+ * -----------------------------------------------------------------------------------
+ * where_alloc where)
+ * ------------------
*
* The Free node frees memory of the given variable.
*
* *ptr The pointer to the object to free.
* *size The number of objects of type free_type to free in a sequence.
* *free_type The type of the freed variable.
+ * where Where the variable was allocated, either heap_alloc or stack_alloc.
*
* Inputs:
* A memory, a pointer and an unsigned integer.
* 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
* ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj)
* ----------------------------------------------------------
*
- * Selects one entry of a tuple. This is a hidden `fat edge'.
+ * Selects one entry of a tuple. This is a hidden edge with attributes.
*
* Parameters
* *arg A node producing a tuple.
* replaced by the Tuple operation so that the following Proj nodes have not to
* be changed. (They are hard to find due to the implementation with pointers
* in only one direction.) The Tuple node is smaller than any other
- * node, so that a node can be changed into a Tuple by just changing it's
+ * node, so that a node can be changed into a Tuple by just changing it's
* opcode and giving it a new in array.
*
* Parameters
* for optimizations.
*
*
+ * HIGH LEVEL OPERATIONS
+ * ---------------------
+ *
+ * ir_node *new_CopyB (ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type)
+ * -----------------------------------------------------------------------------------
+ *
+ * Describes a high level block copy of a compound type from address src to
+ * address dst. Must be lowered to a Call to a runtime memory copy function.
+ *
+ *
+ * HIGH LEVEL OPERATIONS: Exception Support
+ * ----------------------------------------
+ * See TechReport 1999-14, chapter Exceptions.
+ *
+ * ir_node *new_InstOf(ir_node *store, ir_node *ptr, ir_type *type);
+ * -----------------------------------------------------------------------------------
+ *
+ * Describes a high level type check. Must be lowered to a Call to a runtime check
+ * function.
+ *
+ * ir_node *new_Raise (ir_node *store, ir_node *obj)
+ * -------------------------------------------------
+ *
+ * Raises an exception. Unconditional change of control flow. Writes
+ * an explicit Except variable to memory to pass it to the exception
+ * handler. Must be lowered to a Call to a runtime check
+ * function.
+ *
+ * Inputs:
+ * The memory state.
+ * A pointer to the Except variable.
+ * Output:
+ * A tuple of control flow and the changed memory state. The control flow
+ * points to the exception handler if it is definied in this procedure,
+ * else it points to the end_block.
+ *
+ * ir_node *new_Bound (ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper);
+ * -----------------------------------------------------------------------------------
+ *
+ * Describes a high level bounds check. Must be lowered to a Call to a runtime check
+ * function.
+ *
+ *
* COPING WITH DATA OBJECTS
* ========================
*
*
* 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.
* node.
*
*/
+#ifndef _IRCONS_H_
+#define _IRCONS_H_
-
-# ifndef _IRCONS_H_
-# define _IRCONS_H_
-
-# include "firm_common.h"
-# include "irgraph.h"
-# include "irnode.h"
-# include "irmode.h"
-# include "entity.h"
-# include "tv.h"
-# include "type.h"
-# include "dbginfo.h"
+#include "firm_common.h"
+#include "irnode.h"
+#include "dbginfo.h"
/*-------------------------------------------------------------------------*/
/* The raw interface */
*/
ir_node *new_rd_Jmp (dbg_info *db, ir_graph *irg, ir_node *block);
+/** Constructor for an IJmp node.
+ *
+ * IJmp represents control flow to a single control successor not
+ * statically known i.e. an indirect Jmp.
+ *
+ * @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 *tgt The ir node representing the target address.
+ */
+ir_node *new_rd_IJmp (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *tgt);
+
/** Constructor for a Break node.
*
* Break represents control flow to a single control successor just as Jmp.
ir_node *new_rd_Return (dbg_info *db, ir_graph *irg, ir_node *block,
ir_node *store, int arity, ir_node *in[]);
-/** Constructor for a Raise node.
- *
- * @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 *store The current memory.
- * @param *obj A pointer to the Except variable.
- */
-ir_node *new_rd_Raise (dbg_info *db, ir_graph *irg, ir_node *block,
- ir_node *store, ir_node *obj);
-
/** Constructor for a Const_type node.
*
* The constant represents a target value. This constructor sets high
* @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.
*/
-ir_node *new_rd_Const_type (dbg_info* db, ir_graph *irg, ir_node *block,
- ir_mode *mode, tarval *con, type *tp);
+ir_node *new_rd_Const_type (dbg_info *db, ir_graph *irg, ir_node *block,
+ ir_mode *mode, tarval *con, ir_type *tp);
/** Constructor for a Const node.
*
* @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,
* @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);
+ir_node *new_rd_SymConst_type (dbg_info *db, ir_graph *irg, ir_node *block, union symconst_symbol value,
+ symconst_kind symkind, ir_type *tp);
/** Constructor for a SymConst 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);
+ * Adds the SymConst to the start block of irg. */
+ir_node *new_rd_SymConst_addr_ent (dbg_info *db, ir_graph *irg, entity *symbol, ir_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);
+ * Adds the SymConst to the start block of irg. */
+ir_node *new_rd_SymConst_addr_name (dbg_info *db, ir_graph *irg, ident *symbol, ir_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);
+ * Adds the SymConst to the start block of irg. */
+ir_node *new_rd_SymConst_type_tag (dbg_info *db, ir_graph *irg, ir_type *symbol, ir_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);
+ * Adds the SymConst to the start block of irg. */
+ir_node *new_rd_SymConst_size (dbg_info *db, ir_graph *irg, ir_type *symbol, ir_type *tp);
+
+/** Constructor for a simpleSel node.
+ *
+ * This is a shortcut for the new_rd_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 *irg The ir graph the node belongs to.
+ * @param *block The ir block the node belongs to.
+ * @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_rd_simpleSel (dbg_info *db, ir_graph *irg, ir_node *block,
+ ir_node *store, ir_node *objptr, entity *ent);
/** Constructor for a Sel node.
*
* 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.
* 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);
-/** Constructor for a InstOf node.
- *
- * For translating Java. Not supported as standard firm node.
- *
- * @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 *store
- * @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);
-
/** Constructor for a Call node.
*
* Represents all kinds of method and function calls.
* @param *tp Type information of the procedure called.
*/
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);
+ ir_node *callee, int arity, ir_node *in[], ir_type *tp);
/** Constructor for a Add node.
*
* @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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_rd_Add (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_rd_Sub (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_rd_Mul (dbg_info *db, 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 *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_rd_Quot (dbg_info *db, ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_rd_DivMod (dbg_info *db, ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_rd_Div (dbg_info *db, ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_rd_Mod (dbg_info *db, ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
* @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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_rd_And (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_rd_Or (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the results.
*/
ir_node *new_rd_Eor (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_rd_Cmp (dbg_info *db, ir_graph *irg, ir_node *block,
ir_node *op1, ir_node *op2);
* @param *op The operand.
* @param *to_tp The type of this the operand muss be casted .
*/
-ir_node *new_rd_Cast (dbg_info* db, ir_graph *irg, ir_node *block,
- ir_node *op, type *to_tp);
+ir_node *new_rd_Cast (dbg_info *db, ir_graph *irg, ir_node *block,
+ ir_node *op, ir_type *to_tp);
/** Constructor for a Phi node.
*
* @param where Where to allocate the variable, either heap_alloc or stack_alloc.
*/
ir_node *new_rd_Alloc (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store,
- ir_node *size, type *alloc_type, where_alloc where);
+ ir_node *size, ir_type *alloc_type, where_alloc where);
/** Constructor for a Free node.
*
* @param *ptr The pointer to the object to free.
* @param *size The number of objects of type free_type to free in a sequence.
* @param *free_type The type of the freed variable.
+ * @param where Where the variable was allocated, either heap_alloc or stack_alloc.
*/
ir_node *new_rd_Free (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store,
- ir_node *ptr, ir_node *size, type *free_type);
+ ir_node *ptr, ir_node *size, ir_type *free_type, where_alloc where);
/** Constructor for a Sync node.
*
* @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.
*/
* 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.
*
* 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.
*/
ir_node *new_rd_NoMem (ir_graph *irg);
+/** Constructor for a Mux node.
+ *
+ * @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);
+
+/** Constructor for a CopyB node.
+ *
+ * @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 *store The current memory
+ * @param *dst The ir_node that represents the destination address.
+ * @param *src The ir_node that represents the source address.
+ * @param *data_type The type of the copied data
+ */
+ir_node *new_rd_CopyB(dbg_info *db, ir_graph *irg, ir_node *block,
+ ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type);
+
+/** Constructor for a InstOf node.
+ *
+ * A High-Level Type check.
+ *
+ * @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 *store The memory in which the object the entity should be selected
+ * from is allocated.
+ * @param *objptr A pointer to a object of a class type.
+ * @param *type The type of which objptr must be.
+ */
+ir_node *new_rd_InstOf (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store,
+ ir_node *objptr, ir_type *type);
+
+/** Constructor for a Raise node.
+ *
+ * A High-Level Exception throw.
+ *
+ * @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 *store The current memory.
+ * @param *obj A pointer to the Except variable.
+ */
+ir_node *new_rd_Raise (dbg_info *db, ir_graph *irg, ir_node *block,
+ ir_node *store, ir_node *obj);
+
+/** Constructor for a Bound node.
+ *
+ * A High-Level bounds check. Checks whether lower <= idx && idx < upper.
+ *
+ * @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 *store The current memory
+ * @param *idx The ir_node that represents an index.
+ * @param *lower The ir_node that represents the lower bound for the index.
+ * @param *upper The ir_node that represents the upper bound for the index.
+ */
+ir_node *new_rd_Bound(dbg_info *db, ir_graph *irg, ir_node *block,
+ ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper);
+
/*-------------------------------------------------------------------------*/
/* The raw interface without debug support */
/*-------------------------------------------------------------------------*/
*/
ir_node *new_r_Jmp (ir_graph *irg, ir_node *block);
+/** Constructor for an IJmp node.
+ *
+ * IJmp represents control flow to a single control successor not
+ * statically known i.e. an indirect Jmp.
+ *
+ * @param *irg The ir graph the node belongs to.
+ * @param *block The ir block the node belongs to.
+ * @param *tgt The ir node representing the target address.
+ */
+ir_node *new_r_IJmp (ir_graph *irg, ir_node *block, ir_node *tgt);
+
/** Constructor for a Cond node.
*
* If c is mode_b represents a conditional branch (if/else). If c is
* @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,
ir_node *store, int arity, ir_node *in[]);
-/** Constructor for a Raise node.
+/** Constructor for a Const node.
+ *
+ * Constructor for a Const node. The constant represents a target
+ * value. Sets the type information to type_unknown. (No more
+ * supported: If tv is entity derives a somehow useful type.)
*
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
- * @param *store The current memory.
- * @param *obj A pointer to the Except variable.
+ * @param *mode The mode of the operands and the results.
+ * @param *con Points to an entry in the constant table.
*/
-ir_node *new_r_Raise (ir_graph *irg, ir_node *block,
- ir_node *store, ir_node *obj);
+ir_node *new_r_Const (ir_graph *irg, ir_node *block,
+ ir_mode *mode, tarval *con);
/** Constructor for a Const node.
*
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
* @param *mode The mode of the operands and the results.
+ * @param value A value from which the tarval is made.
+ */
+ir_node *new_r_Const_long(ir_graph *irg, ir_node *block,
+ ir_mode *mode, long value);
+
+/** Constructor for a Const_type node.
+ *
+ * The constant represents a target value. This constructor sets high
+ * level type information for the constant value.
+ *
+ * @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 results.
* @param *con Points to an entry in the constant table.
+ * @param *tp The type of the constant.
*/
-ir_node *new_r_Const (ir_graph *irg, ir_node *block,
- ir_mode *mode, tarval *con);
+ir_node *new_r_Const_type(ir_graph *irg, ir_node *block,
+ ir_mode *mode, tarval *con, ir_type *tp);
/** Constructor for a SymConst node.
*
*
* @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,
* 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.
* 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 *objptr, int n_index, ir_node *index[],
entity *ent);
-/** Constructor for a InstOf node.
- *
- * For translating Java. Not supported as standard firm node.
- *
- * @param *irg The ir graph the node belongs to.
- * @param *block The ir block the node belongs to.
- * @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);
-
/** Constructor for a Call node.
*
* Represents all kinds of method and function calls.
*
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
- * @param * store The actual store.
+ * @param *store The actual store.
* @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.
*/
ir_node *new_r_Call (ir_graph *irg, ir_node *block, ir_node *store,
ir_node *callee, int arity, ir_node *in[],
- type *tp);
+ ir_type *tp);
/** Constructor for a Add node.
*
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_r_Add (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the results.
*/
ir_node *new_r_Sub (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_r_Mul (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 *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_r_Quot (ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_r_DivMod (ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_r_Div (ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_r_Mod (ir_graph *irg, ir_node *block,
ir_node *memop, ir_node *op1, ir_node *op2);
*
* @param *irg The ir graph the node belongs to.
* @param *block The ir block the node belongs to.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_r_And (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_r_Or (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the results.
*/
ir_node *new_r_Eor (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 *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_r_Cmp (ir_graph *irg, ir_node *block,
ir_node *op1, ir_node *op2);
* @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);
+ ir_node *op, ir_type *to_tp);
/** Constructor for a Phi node.
*
* @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);
+ ir_node *size, ir_type *alloc_type, where_alloc where);
/** Constructor for a Free node.
*
* @param *ptr The pointer to the object to free.
* @param *size The number of objects of type free_type to free in a sequence.
* @param *free_type The type of the freed variable.
+ * @param where Where the variable was allocated, either heap_alloc or stack_alloc.
*/
ir_node *new_r_Free (ir_graph *irg, ir_node *block, ir_node *store,
- ir_node *ptr, ir_node *size, type *free_type);
+ ir_node *ptr, ir_node *size, ir_type *free_type, where_alloc where);
/** Constructor for a Sync node.
*
*
* @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.
*/
* @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.
- * @param max_ proj The end position of the value in the 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 *irg The ir graph the node belongs to.
*
*/
-
ir_node *new_r_Bad (ir_graph *irg);
/** Constructor for a Confirm node.
*
* @param *irg The ir graph the node belong to.
* @param *block The ir block the node belong to.
- * @param *db A pointer for debug information.
* @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_r_Confirm (ir_graph *irg, ir_node *block,
ir_node *val, ir_node *bound, pn_Cmp cmp);
/** 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.
*
* @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);
*/
ir_node *new_r_NoMem (ir_graph *irg);
+/** Constructor for a Mux node.
+ *
+ * @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_Mux (ir_graph *irg, ir_node *block,
+ ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode);
+
+/** Constructor for a CopyB node.
+ *
+ * @param *irg The ir graph the node belong to.
+ * @param *block The block the node belong to.
+ * @param *store The current memory
+ * @param *dst The ir_node that represents the destination address.
+ * @param *src The ir_node that represents the source address.
+ * @param *data_type The type of the copied data
+ */
+ir_node *new_r_CopyB(ir_graph *irg, ir_node *block,
+ ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type);
+
+/** Constructor for a InstOf node.
+ *
+ * A High-Level Type check.
+ *
+ * @param *irg The ir graph the node belongs to.
+ * @param *block The ir block the node belongs to.
+ * @param *store The memory in which the object the entity should be selected
+ * from is allocated.
+ * @param *objptr A pointer to a object of a class type.
+ * @param *type The type of which objptr must be.
+ */
+ir_node *new_r_InstOf (ir_graph *irg, ir_node *block, ir_node *store,
+ ir_node *objptr, ir_type *type);
+
+/** Constructor for a Raise node.
+ *
+ * A High-Level Exception throw.
+ *
+ * @param *irg The ir graph the node belongs to.
+ * @param *block The ir block the node belongs to.
+ * @param *store The current memory.
+ * @param *obj A pointer to the Except variable.
+ */
+ir_node *new_r_Raise (ir_graph *irg, ir_node *block,
+ ir_node *store, ir_node *obj);
+
+/** Constructor for a Bound node.
+ *
+ * A High-Level bounds check. Checks whether lower <= idx && idx < upper.
+ *
+ * @param *irg The ir graph the node belong to.
+ * @param *block The block the node belong to.
+ * @param *store The current memory
+ * @param *idx The ir_node that represents an index.
+ * @param *lower The ir_node that represents the lower bound for the index.
+ * @param *upper The ir_node that represents the upper bound for the index.
+ */
+ir_node *new_r_Bound(ir_graph *irg, ir_node *block,
+ ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper);
+
/*-----------------------------------------------------------------------*/
/* The block oriented interface */
/*-----------------------------------------------------------------------*/
* 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'.
*/
-ir_node *new_d_Block(dbg_info* db, int arity, ir_node *in[]);
+ir_node *new_d_Block(dbg_info *db, int arity, ir_node *in[]);
/** Constructor for a Start node.
*
*
* @param *db A pointer for debug information.
*/
-ir_node *new_d_Start (dbg_info* db);
+ir_node *new_d_Start (dbg_info *db);
/** Constructor for a End node.
*
*
* @param *db A pointer for debug information.
*/
-ir_node *new_d_End (dbg_info* db);
+ir_node *new_d_End (dbg_info *db);
/** Constructor for a Jmp node.
*
*
* @param *db A pointer for debug information.
*/
+ir_node *new_d_Jmp (dbg_info *db);
-ir_node *new_d_Jmp (dbg_info* db);
+/** Constructor for an IJmp node.
+ *
+ * IJmp represents control flow to a single control successor not
+ * statically known i.e. an indirect Jmp.
+ *
+ * @param *db A pointer for debug information.
+ * @param *tgt The ir node representing the target address.
+ */
+ir_node *new_d_IJmp (dbg_info *db, ir_node *tgt);
/** Constructor for a Cond node.
*
* @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);
+ir_node *new_d_Cond (dbg_info *db, ir_node *c);
/** Constructor for a Return node.
*
*
* @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[]);
-
-/** Constructor for a Raise node.
- *
- * Adds the node to the block in current_ir_block.
- *
- * @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);
+ir_node *new_d_Return (dbg_info *db, ir_node *store, int arity, ir_node *in[]);
/** Constructor for a Const_type node.
*
* level type information for the constant value.
*
* @param *db A pointer for debug information.
- * @param *mode The mode of the operands and redults.
+ * @param *mode The mode of the operands and results.
* @param *con Points to an entry in the constant table. This pointer is
added to the attributes of the node.
- * @param *tp The type of the constante.
+ * @param *tp The type of the constant.
*/
-
-ir_node *new_d_Const_type (dbg_info* db, ir_mode *mode, tarval *con, type *tp);
+ir_node *new_d_Const_type (dbg_info *db, ir_mode *mode, tarval *con, ir_type *tp);
/** Constructor for a Const node.
*
* supported: If tv is entity derives a somehow useful type.)
*
* @param *db A pointer for debug information.
- * @param *mode The mode of the operands and redults.
+ * @param *mode The mode of the operands and results.
* @param *con Points to an entry in the constant table. This pointer is added
* to the attributes of the node.
*/
-ir_node *new_d_Const (dbg_info* db, ir_mode *mode, tarval *con);
+ir_node *new_d_Const (dbg_info *db, ir_mode *mode, tarval *con);
/** Constructor for a SymConst_type node.
*
*
* @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
+ * @param kind 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_type (dbg_info* db, union symconst_symbol value, symconst_kind kind, type* tp);
+ir_node *new_d_SymConst_type (dbg_info *db, union symconst_symbol value, symconst_kind kind, ir_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);
+ir_node *new_d_SymConst (dbg_info *db, union symconst_symbol value, symconst_kind kind);
/** Constructor for a simpleSel node.
*
* 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);
+ir_node *new_d_simpleSel(dbg_info *db, ir_node *store, ir_node *objptr, entity *ent);
/** Constructor for a Sel node.
*
* 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.
* 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 arity The number of array indices needed to select an array element entity.
+ * @param *in[] 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_d_Sel (dbg_info* db, ir_node *store, ir_node *objptr, int arity, ir_node *in[],
+ir_node *new_d_Sel (dbg_info *db, ir_node *store, ir_node *objptr, int arity, ir_node *in[],
entity *ent);
-/** Constructor for a InstOf node.
- *
- * Adds the node to the block in current_ir_block.
- *
- * For translating Java. Not supported as standard firm node.
- *
- * @param *db A pointer for debug information.
- * @param *store
- * @param *objptr
- * @param *ent
- */
-ir_node *new_d_InstOf (dbg_info* db, ir_node *store, ir_node *objptr, type *ent);
-
/** Constructor for a Call node.
*
* Represents all kinds of method and function calls.
* @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[],
- type *tp);
+ir_node *new_d_Call (dbg_info *db, ir_node *store, ir_node *callee, int arity, ir_node *in[],
+ ir_type *tp);
/** Constructor for a Add node.
*
* Adds the node to the block in current_ir_block.
*
* @param *db A pointer for debug information.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @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);
+ir_node *new_d_Add (dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode);
/** Constructor for a Sub node.
*
* Adds the node to the block in current_ir_block.
*
* @param *db A pointer for debug information.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @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);
+ir_node *new_d_Sub (dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode);
/** Constructor for a Minus node.
*
* @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);
+ir_node *new_d_Minus (dbg_info *db, ir_node *op, ir_mode *mode);
/** Constructor for a Mul node.
*
* Adds the node to the block in current_ir_block.
*
* @param *db A pointer for debug information.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @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);
+ir_node *new_d_Mul (dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode);
/** Constructor for a Quot node.
*
*
* @param *db A pointer for debug information.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
-ir_node *new_d_Quot (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2);
+ir_node *new_d_Quot (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2);
/** Constructor for a DivMod node.
*
*
* @param *db A pointer for debug information.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
-ir_node *new_d_DivMod (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2);
+ir_node *new_d_DivMod (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2);
/** Constructor for a Div node.
*
*
* @param *db A pointer for debug information.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
-ir_node *new_d_Div (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2);
+ir_node *new_d_Div (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2);
/** Constructor for a Mod node.
*
*
* @param *db A pointer for debug information.
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
-ir_node *new_d_Mod (dbg_info* db, ir_node *memop, ir_node *op1, ir_node *op2);
+ir_node *new_d_Mod (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2);
/** Constructor for a Abs node.
*
* @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);
+ir_node *new_d_Abs (dbg_info *db, ir_node *op, ir_mode *mode);
/** Constructor for a And 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 belongs to.
- * @param *block The ir block the node belongs to.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @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);
+ir_node *new_d_And (dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode);
/** Constructor for a Or node.
*
* Adds the node to the block in current_ir_block.
*
* @param *db A pointer for debug information.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @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);
+ir_node *new_d_Or (dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode);
/** Constructor for a Eor node.
*
* Adds the node to the block in current_ir_block.
*
* @param *db A pointer for debug information.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @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);
+ir_node *new_d_Eor (dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode);
/** Constructor for a Not node.
*
* @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);
+ir_node *new_d_Not (dbg_info *db, ir_node *op, ir_mode *mode);
/** Constructor for a Shl node.
*
* @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);
+ir_node *new_d_Shl (dbg_info *db, ir_node *op, ir_node *k, ir_mode *mode);
/** Constructor for a Shr node.
*
* @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);
+ir_node *new_d_Shr (dbg_info *db, ir_node *op, ir_node *k, ir_mode *mode);
/** Constructor for a Shrs node.
*
* @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);
+ir_node *new_d_Shrs (dbg_info *db, ir_node *op, ir_node *k, ir_mode *mode);
/** Constructor for a Rot node.
*
* @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);
+ir_node *new_d_Rot (dbg_info *db, ir_node *op, ir_node *k, ir_mode *mode);
/** Constructor for a Cmp node.
*
* Adds the node to the block in current_ir_block.
*
* @param *db A pointer for debug information.
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
-ir_node *new_d_Cmp (dbg_info* db, ir_node *op1, ir_node *op2);
+ir_node *new_d_Cmp (dbg_info *db, ir_node *op1, ir_node *op2);
/** Constructor for a Conv node.
*
* @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);
+ir_node *new_d_Conv (dbg_info *db, ir_node *op, ir_mode *mode);
/**Constructor for a Cast node.
*
* @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);
+ir_node *new_d_Cast (dbg_info *db, ir_node *op, ir_type *to_tp);
/**Constructor for a Phi node.
*
* 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);
+ir_node *new_d_Phi (dbg_info *db, int arity, ir_node *in[], ir_mode *mode);
/** Constructor for a Load node.
*
*
* @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 *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_d_Load (dbg_info* db, ir_node *store, ir_node *addr, ir_mode *mode);
+ir_node *new_d_Load (dbg_info *db, ir_node *store, ir_node *addr, ir_mode *mode);
/** Constructor for a Store node.
*
*
* @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 *addr A pointer to the variable to be read in this memory.
* @param *val The value to write to this variable.
*/
-ir_node *new_d_Store (dbg_info* db, ir_node *store, ir_node *addr, ir_node *val);
+ir_node *new_d_Store (dbg_info *db, ir_node *store, ir_node *addr, ir_node *val);
/** Constructor for a Alloc node.
*
* @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,
+ir_node *new_d_Alloc (dbg_info *db, ir_node *store, ir_node *size, ir_type *alloc_type,
where_alloc where);
/** Constructor for a Free node.
* @param *ptr The pointer to the object to free.
* @param *size The number of objects of type free_type to free in a sequence.
* @param *free_type The type of the freed variable.
+ * @param where Where the variable was allocated, either heap_alloc or stack_alloc.
*/
-ir_node *new_d_Free (dbg_info* db, ir_node *store, ir_node *ptr, ir_node *size,
- type *free_type);
+ir_node *new_d_Free (dbg_info *db, ir_node *store, ir_node *ptr, ir_node *size,
+ ir_type *free_type, where_alloc where);
/** Constructor for a Sync node.
*
* 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[]);
-
+ir_node *new_d_Sync (dbg_info *db, int arity, ir_node *in[]);
/** Constructor for a Proj node.
*
* 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);
-
+ir_node *new_d_Proj (dbg_info *db, ir_node *arg, ir_mode *mode, long proj);
/** Constructor for a defaultProj node.
*
*
* @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.
+ * @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);
+ir_node *new_d_defaultProj (dbg_info *db, ir_node *arg, long max_proj);
/** Constructor for a Tuple node.
*
* @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[]);
-
+ir_node *new_d_Tuple (dbg_info *db, int arity, ir_node *in[]);
/** Constructor for a Id node.
*
* @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);
+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().
* @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);
-
+ir_node *new_d_Confirm (dbg_info *db, ir_node *val, ir_node *bound, pn_Cmp cmp);
/** Constructor for an Unknown node.
*
- * Represents an arbtrary valus. Places the node in
+ * Represents an arbitrary value. Places the node in
* the start block.
*
* @param *m The mode of the unknown value.
* 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);
*/
ir_node *new_d_EndReg (dbg_info *db);
-/** Constructor for an Endexcept node.
+/** Constructor for an EndExcept node.
*
* Used to represent regular procedure end in interprocedual view.
* Adds the node to the block in current_ir_block.
*/
ir_node *new_d_NoMem (void);
+/** Constructor for a Mux node.
+ *
+ * @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_Mux (dbg_info *db, ir_node *sel,
+ ir_node *ir_false, ir_node *ir_true, ir_mode *mode);
+
+/** Constructor for a CopyB node.
+ *
+ * @param *db A pointer for debug information.
+ * @param *store The current memory
+ * @param *dst The ir_node that represents the destination address.
+ * @param *src The ir_node that represents the source address.
+ * @param *data_type The type of the copied data
+ */
+ir_node *new_d_CopyB(dbg_info *db, ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type);
+
+/** Constructor for a InstOf node.
+ *
+ * A High-Level Type check.
+ *
+ * @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 object of a class type.
+ * @param *type The type of which objptr must be.
+ */
+ir_node *new_d_InstOf (dbg_info *db, ir_node *store, ir_node *objptr, ir_type *type);
+
+/** Constructor for a Raise node.
+ *
+ * A High-Level Exception throw.
+ *
+ * @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);
+
+/** Constructor for a Bound node.
+ *
+ * A High-Level bounds check. Checks whether lower <= idx && idx < upper.
+ *
+ * @param *db A pointer for debug information.
+ * @param *store The current memory
+ * @param *idx The ir_node that represents an index.
+ * @param *lower The ir_node that represents the lower bound for the index.
+ * @param *upper The ir_node that represents the upper bound for the index.
+ */
+ir_node *new_d_Bound(dbg_info *db, ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper);
+
/*-----------------------------------------------------------------------*/
/* The block oriented interface without debug support */
/*-----------------------------------------------------------------------*/
-/* Needed from the interfase with debug support:
+/* Needed from the interface with debug support:
void set_cur_block (ir_node *target); */
/** Constructor for a Block node.
*/
ir_node *new_Jmp (void);
+/** Constructor for an IJmp node.
+ *
+ * IJmp represents control flow to a single control successor not
+ * statically known i.e. an indirect Jmp.
+ *
+ * @param *tgt The ir node representing the target address.
+ */
+ir_node *new_IJmp (ir_node *tgt);
+
/** Constructor for a Break node.
* Break represents control flow to a single control successor just as Jmp.
* The blocks separated by a break may not be concatenated by an optimization.
* 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[]);
-/**Constructor for a Raise node.
- *
- * Adds the node to the block in current_ir_block.
- *
- * @param *store The current memory.
- * @param *obj A pointer to the Except variable.
- */
-ir_node *new_Raise (ir_node *store, ir_node *obj);
-
/** Constructor for a Const node.
*
* Constructor for a Const node. The constant represents a target
* supported: If tv is entity derives a somehow useful type.)
* Adds the node to the block in current_ir_block.
*
- * @param *mode The mode of the operands and redults.
+ * @param *mode The mode of the operands and results.
* @param *con Points to an entry in the constant table. This pointer is
* added to the attributes of the node.
*/
ir_node *new_Const (ir_mode *mode, tarval *con);
+/**
+ * Make a const from a long.
+ * This is just convenience for the usual
+ * <code>
+ * new_Const(mode, tarval_from_long(mode, ...))
+ * </code>
+ * pain.
+ * @param mode The mode for the const.
+ * @param value The value of the constant.
+ * @return A new const node.
+ */
+ir_node *new_Const_long(ir_mode *mode, long value);
+
/** Constructor for a Const node.
*
* Derives mode from passed type. */
-ir_node *new_Const_type(tarval *con, type *tp);
+ir_node *new_Const_type(tarval *con, ir_type *tp);
/** Constructor for a SymConst node.
*
* Adds the node to the block in current_ir_block.
- * This is the constructor for a symbolic constant.
- * There are four kinds of symbolic constants:
- * - type_tag The symbolic constant represents a type tag. The type the
- * tag stands for is given explicitly.
- * - size The symbolic constant represents the size of a type. The
- * type of which the constant represents the size is given
- * explicitly.
- * - addr_name The symbolic constant represents the address of an entity
- * (variable or method). The variable is indicated by a name
- * that is valid for linking.
- * - addr_ent The symbolic constant represents the address of an entity
- * (variable or method). The variable is given explicitly by
- * a firm entity.
+ * This is the constructor for a symbolic constant.
+ * There are four kinds of symbolic constants:
+ * -# type_tag The symbolic constant represents a type tag. The type the
+ * tag stands for is given explicitly.
+ * -# size The symbolic constant represents the size of a type. The
+ * type of which the constant represents the size is given
+ * explicitly.
+ * -# addr_name The symbolic constant represents the address of an entity
+ * (variable or method). The variable is indicated by a name
+ * that is valid for linking.
+ * -# addr_ent The symbolic constant represents the address of an entity
+ * (variable or method). The variable is given explicitly by
+ * a firm entity.
*
* Inputs to the node:
* No inputs except the block it belongs to.
* An unsigned integer (I_u) or a pointer (P).
*
* @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.
+ * @param kind 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);
* 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 arity The number of array indices needed to select an array element entity.
+ * @param *in[] 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 an InstOf node.
- *
- * Adds the node to the block in current_ir_block.
- * For translating Java. Not supported as standard firm node.
- *
- * @param *store
- * @param *objptr
- * @param *ent
- */
-ir_node *new_InstOf (ir_node *store, ir_node *obj, type *ent);
-
/** Constructor for a Call node.
*
* Adds the node to the block in current_ir_block.
* @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);
+ ir_type *tp);
/** Constructor for a CallBegin node.
*
* constructor copies the method pointer input from the passed Call
* node.Adds the node to the block in current_ir_block.
*
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_Add (ir_node *op1, ir_node *op2, ir_mode *mode);
*
* Adds the node to the block in current_ir_block.
*
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_Sub (ir_node *op1, ir_node *op2, ir_mode *mode);
/**
* Constructor for a Mul node. Adds the node to the block in current_ir_block.
*
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_Mul (ir_node *op1, ir_node *op2, ir_mode *mode);
* Adds the node to the block in current_ir_block.
*
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_Quot (ir_node *memop, ir_node *op1, ir_node *op2);
* Adds the node to the block in current_ir_block.
*
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_DivMod (ir_node *memop, ir_node *op1, ir_node *op2);
* Adds the node to the block in current_ir_block.
*
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_Div (ir_node *memop, ir_node *op1, ir_node *op2);
* Adds the node to the block in current_ir_block.
*
* @param *memop The store needed to model exceptions
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_Mod (ir_node *memop, ir_node *op1, ir_node *op2);
*
* Adds the node to the block in current_ir_block.
*
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_And (ir_node *op1, ir_node *op2, ir_mode *mode);
/**
* Constructor for a Or node. Adds the node to the block in current_ir_block.
*
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the result.
*/
ir_node *new_Or (ir_node *op1, ir_node *op2, ir_mode *mode);
/**
* Constructor for a Eor node. Adds the node to the block in current_ir_block.
*
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
* @param *mode The mode of the operands and the results.
*/
ir_node *new_Eor (ir_node *op1, ir_node *op2, ir_mode *mode);
*
* Adds the node to the block in current_ir_block.
*
- * @param *op1 The operand 1.
- * @param *op2 The operand 2.
+ * @param *op1 The first operand.
+ * @param *op2 The second operand.
*/
ir_node *new_Cmp (ir_node *op1, ir_node *op2);
* @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);
+ir_node *new_Cast (ir_node *op, ir_type *to_tp);
/** Constructor for a Phi node.
*
*/
ir_node *new_Store (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.
* @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,
+ir_node *new_Alloc (ir_node *store, ir_node *size, ir_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.
* @param *ptr The pointer to the object to free.
* @param *size The number of objects of type free_type to free in a sequence.
* @param *free_type The type of the freed variable.
+ * @param where Where the variable was allocated, either heap_alloc or stack_alloc.
*/
ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size,
- type *free_type);
+ ir_type *free_type, where_alloc where);
/** Constructor for a Sync node.
*
* 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_Proj (ir_node *arg, ir_mode *mode, long proj);
-/** Costructor for a Filter node.
+/** Constructor 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.
* 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.
+ * @param max_proj The end position of the value in the tuple.
*/
ir_node *new_defaultProj (ir_node *arg, long max_proj);
*/
ir_node *new_NoMem (void);
+/** Constructor for a Mux node.
+ *
+ * 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_Mux (ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode);
+
+/** Constructor for a CopyB node.
+ *
+ * Adds the node to the block in current_ir_block.
+ *
+ * @param *store The current memory
+ * @param *dst The ir_node that represents the destination address.
+ * @param *src The ir_node that represents the source address.
+ * @param *data_type The type of the copied data
+ */
+ir_node *new_CopyB(ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type);
+
+/** Constructor for a InstOf node.
+ *
+ * A High-Level Type check.
+ *
+ * @param *store The memory in which the object the entity should be selected
+ * from is allocated.
+ * @param *objptr A pointer to a object of a class type.
+ * @param *type The type of which objptr must be.
+ */
+ir_node *new_InstOf (ir_node *store, ir_node *objptr, ir_type *type);
+
+/**Constructor for a Raise node.
+ *
+ * A High-Level Exception throw.
+ *
+ * @param *store The current memory.
+ * @param *obj A pointer to the Except variable.
+ */
+ir_node *new_Raise (ir_node *store, ir_node *obj);
+
+/** Constructor for a Bound node.
+ *
+ * A High-Level bounds check. Checks whether lower <= idx && idx < upper.
+ *
+ * Adds the node to the block in current_ir_block.
+ *
+ * @param *store The current memory
+ * @param *idx The ir_node that represents an index.
+ * @param *lower The ir_node that represents the lower bound for the index.
+ * @param *upper The ir_node that represents the upper bound for the index.
+ */
+ir_node *new_Bound(ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper);
+
/*---------------------------------------------------------------------*/
/* The comfortable interface. */
/* Supports 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_d_immBlock (dbg_info *db);
ir_node *new_immBlock (void);
/** Add a control flow edge to an immature block. */
void add_immBlock_pred (ir_node *immblock, ir_node *jmp);
-/** Fix the number of predecessors of an immature block. */
+/** Finalize a Block node, when all control flows are known. */
void mature_immBlock (ir_node *block);
#define mature_cur_block() mature_immBlock(get_cur_block());
* @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_d_value (dbg_info *db, int pos, ir_mode *mode);
ir_node *get_value (int pos, ir_mode *mode);
/** Remark a new definition of a variable.
void keep_alive (ir_node *ka);
/** Returns the frame type of the current graph */
-type *get_cur_frame_type(void);
+ir_type *get_cur_frame_type(void);
/* --- initialize and finalize ir construction --- */
/** Puts the graph into state "phase_high" */
-void finalize_cons (ir_graph *irg);
+void irg_finalize_cons (ir_graph *irg);
+
+/** Puts the program and all graphs into state phase_high.
+ *
+ * This also remarks, the construction of types is finished,
+ * e.g., that no more subtypes will be added. */
+void irp_finalize_cons(void);
/* --- Initialization --- */
/**
* This function is called, whenever a local variable is used before definition
*
- * @parameter mode the mode of the local var
- * @pos position choosen be the frontend for this var
+ * @param irg the IR graph on which this happens
+ * @param mode the mode of the local var
+ * @param pos position chosen be the frontend for this variable (n_loc)
*
- * @return a firm node of mode @p mode that initialises the var at position pos
+ * @return a firm node of mode @p mode that initializes the var at position pos
*
* @note
- * Do not return NULL
- * If this function is not set, FIRM will create a const node with tarval BAD
+ * Do not return NULL!
+ * If this function is not set, FIRM will create a const node with tarval BAD.
+ * Use set_irg_loc_description()/get_irg_loc_description() to assign additional
+ * informations to local variables.
*/
-typedef ir_node *default_initialize_local_variable_func_t(ir_mode *mode, int pos);
-
+typedef ir_node *uninitialized_local_variable_func_t(ir_graph *irg, ir_mode *mode, int pos);
-# endif /* _IRCONS_H_ */
+#endif /* _IRCONS_H_ */
projects / libfirm / blobdiff