* Copyright: (c) 1998-2003 Universität Karlsruhe
* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
-
# ifndef _IRNODE_H_
# define _IRNODE_H_
#include <stddef.h>
-/**
- * Projection numbers of compare: use for Proj nodes!
- * @remark there are numbers with normalized names below!
- */
-typedef enum {
- False = 0, /**< false */
- Eq, /**< equal */
- Lt, /**< less */
- Le, /**< less or equal */
- Gt, /**< greater */
- Ge, /**< greater or equal */
- Lg, /**< less or greater */
- Leg = 7, /**< 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 = 15 /**< true */
- /* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for jni interface */
-} pnc_number; /* pnc: Projection Number Cmp */
-#define not_mask Leg
-
-# include "tv.h"
# include "irgraph.h"
# include "entity.h"
# include "firm_common.h"
# include "irmode.h"
# include "type.h"
# include "dbginfo.h"
-/* # include "exc.h" */
/**
* @file irnode.h
Assumes that current_ir_graph is set to the graph containing "node".
"in" must contain all predecessors except the block that are required for
the nodes opcode. */
-void set_irn_in (ir_node *node, int arity,
- ir_node *in[]);
+void set_irn_in (ir_node *node, int arity, ir_node *in[]);
+
/* to iterate through the predecessors without touching the array. No
order of predecessors guaranteed.
To iterate over the operands iterate from 0 to i < get_irn_arity(),
We differ two flavours of this Cond. The first, the dense Cond, passes
control along output i if the selector value is i, 0 <= i <= n. If the
selector value is >n it passes control along output n.
- The second Cond flavor differes in the treatment of cases not specified in
+ The second Cond flavor diffirences in the treatment of cases not specified in
the source program. It magically knows about the existence of Proj nodes.
It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
exists. Else it passes control along output n (even if this Proj does not
pn_Raise_max /**< number of projections from a Raise */
} pn_Raise; /* Projection numbers for Raise. */
+typedef enum {
+ CNST_NULL = 0, /**< The node is a const(0). */
+ CNST_ONE = +1, /**< The node is a const(1). */
+ CNST_ALL_ONE = -1, /**< The node is a const(11111...). */
+ CNST_OTHER = 2, /**< The tarvel of the const has another value. */
+ CNST_SYMCONST = 3, /**< The node is symconst. */
+ CNST_NO_CONST = 4 /**< The node is no const at all. */
+} cnst_classify_t;
+
tarval *get_Const_tarval (ir_node *node);
void set_Const_tarval (ir_node *node, tarval *con);
+/**
+ * Classify a node concerning constant properties.
+ * @param irn A node to check for.
+ * @return Constant properties of that node.
+ */
+cnst_classify_t classify_Const(ir_node *irn);
+
/** Returns the source language type of a Const node.
* Must be an atomic type. Mode of type must be mode of node.
*/
*/
typedef enum {
pn_Quot_M, /**< Memory result. */
- pn_Quot_X_except, /**< Execution result if exception occured. */
+ pn_Quot_X_except, /**< Execution result if exception occurred. */
pn_Quot_res, /**< Result of computation. */
pn_Quot_max /**< number of projections from a Quot */
} pn_Quot; /* Projection numbers for Quot. */
*/
typedef enum {
pn_DivMod_M, /**< Memory result. */
- pn_DivMod_X_except, /**< Execution result if exception occured. */
+ pn_DivMod_X_except, /**< Execution result if exception occurred. */
pn_DivMod_res_div, /**< Result of computation a / b. */
pn_DivMod_res_mod, /**< Result of computation a % b. */
pn_DivMod_max /**< number of projections from a DivMod */
*/
typedef enum {
pn_Div_M, /**< Memory result. */
- pn_Div_X_except, /**< Execution result if exception occured. */
+ pn_Div_X_except, /**< Execution result if exception occurred. */
pn_Div_res /**< Result of computation. */
} pn_Div; /* Projection numbers for Div. */
*/
typedef enum {
pn_Mod_M, /**< Memory result. */
- pn_Mod_X_except, /**< Execution result if exception occured. */
+ pn_Mod_X_except, /**< Execution result if exception occurred. */
pn_Mod_res, /**< Result of computation. */
pn_Mod_max /**< number of projections from a Mod */
} pn_Mod; /* Projection numbers for Mod. */
/* Does Cast need a mem operator?
* Cast should only depend on the type, not on the state of an
- * entity. But: we initialze various fields after Alloc, that
+ * entity. But: we initialize various fields after Alloc, that
* are accessed in the cast. This required some precaution, to
* get the right memory into the Loads generated from the cast.
*/
*/
typedef enum {
pn_Load_M, /**< Memory result. */
- pn_Load_X_except, /**< Execution result if exception occured. */
+ pn_Load_X_except, /**< Execution result if exception occurred. */
pn_Load_res, /**< Result of load operation. */
pn_Load_max /**< number of projections from a Load */
} pn_Load; /* Projection numbers for Load. */
*/
typedef enum {
pn_Store_M, /**< Memory result. */
- pn_Store_X_except, /**< Execution result if exception occured. */
+ pn_Store_X_except, /**< Execution result if exception occurred. */
pn_Store_max /**< number of projections from a Store */
} pn_Store; /* Projection numbers for Store. */
*/
typedef enum {
pn_Alloc_M, /**< Memory result. */
- pn_Alloc_X_except, /**< Execution result if exception occured. */
+ pn_Alloc_X_except, /**< Execution result if exception occurred. */
pn_Alloc_res, /**< Result of allocation. */
pn_Alloc_max /**< number of projections from an Alloc */
} pn_Alloc; /* Projection numbers for Alloc. */
type *get_Free_type (ir_node *node);
void set_Free_type (ir_node *node, type *tp);
+where_alloc get_Free_where (ir_node *node);
+void set_Free_where (ir_node *node, where_alloc where);
+
ir_node **get_Sync_preds_arr (ir_node *node);
int get_Sync_n_preds (ir_node *node);
ir_node *get_Sync_pred (ir_node *node, int pos);
void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
+/** Returns the source language type of a Proj node.
+ * Must be an atomic type. Mode of type must be mode of node.
+ */
+type *get_Proj_type (ir_node *node);
+
+/** Return the predecessor of a Proj node. */
ir_node *get_Proj_pred (ir_node *node);
void set_Proj_pred (ir_node *node, ir_node *pred);
+/** Return the projection number of a Proj node. */
long get_Proj_proj (ir_node *node);
void set_Proj_proj (ir_node *node, long proj);
int is_ip_cfop(const ir_node *node);
/** Returns true if the operation can change the control flow because
of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
- Bad. */
+ Bad. Raise is not fragile, but a unconditional jump. */
int is_fragile_op(const ir_node *node);
/** Returns the memory operand of fragile operations. */
ir_node *get_fragile_op_mem(ir_node *node);
* operation: Cond. */
int is_forking_op(const ir_node *node);
+/** Return the type associated with the value produced by n
+ * if the node remarks this type as it is the case for
+ * Cast, Const, SymConst and some Proj nodes. */
+type *get_irn_type(ir_node *n);
+
/**
* Access custom node data.
* The data must have been registered with
/**
* Request additional data to be allocated with an ir node.
* @param size The size of the additional data required.
- * @return A positive number, if the opration was successful, which
+ * @return A positive number, if the operation was successful, which
* must be passed to the access macro get_irn_data(), 0 if the
* registration failed.
*/