* 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);
* 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)
* ------------------------------
*
* 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
*
*
*
*/
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_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
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_type(ir_graph *irg, ir_node *block,
+ ir_mode *mode, tarval *con, type *tp);
+
/** Constructor for a SymConst node.
*
* This is the constructor for a symbolic constant.
*
* @param *db A pointer for debug information.
*/
-
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.
*
* Adds the node to the block in current_ir_block.
*/
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.
/* --- 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 --- */
projects / libfirm / blobdiff