} store_attr;
typedef struct {
- int pos; /**< For Phi. Used to remember the value defined by
- this Phi node. Needed when the Phi is completed
- to call get_r_internal_value to find the
- predecessors. If this attribute is set, the Phi
- node takes the role of the obsolete Phi0 node,
- therefore the name. */
+ int pos; /**< For Phi0. Used to remember the value defined by
+ this Phi node. Needed when the Phi is completed
+ to call get_r_internal_value to find the
+ predecessors. If this attribute is set, the Phi
+ node takes the role of the obsolete Phi0 node,
+ therefore the name. */
} phi0_attr;
-typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
+/**< Confirm attribute. */
+typedef struct {
+ pn_Cmp cmp; /**< The compare operation. */
+} confirm_attr;
/** CopyB attribute. */
typedef struct {
ident *asm_text; /**< The inline assembler text. */
ir_asm_constraint *inputs; /**< Input constraints. */
ir_asm_constraint *outputs; /**< Output constraints. */
+ ident **clobber; /**< List of clobbered registers. */
} asm_attr;
/** Some IR-nodes just have one attribute, these are stored here,
Field n set to true if pred n is backedge.
@todo Ev. replace by bitfield! */
long proj; /**< For Proj: contains the result position to project */
- confirm_attr confirm_cmp; /**< For Confirm: compare operation */
+ confirm_attr confirm; /**< For Confirm: compare operation and region. */
filter_attr filter; /**< For Filter */
except_attr except; /**< For Phi node construction in case of exceptions */
copyb_attr copyb; /**< For CopyB operation */
return (_get_irn_op(node) == op_NoMem);
}
+static INLINE int
+_is_Minus(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Minus);
+}
+
static INLINE int
_is_Mod(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Sub);
}
+static INLINE int
+_is_Tuple(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Tuple);
+}
+
static INLINE int
_is_Start(const ir_node *node) {
assert(node);
#define is_NoMem(node) _is_NoMem(node)
#define is_Start(node) _is_Start(node)
#define is_End(node) _is_End(node)
+#define is_Minus(node) _is_Minus(node)
#define is_Mod(node) _is_Mod(node)
#define is_Div(node) _is_Div(node)
#define is_DivMod(node) _is_DivMod(node)
#define is_Quot(node) _is_Quot(node)
#define is_Add(node) _is_Add(node)
#define is_Sub(node) _is_Sub(node)
+#define is_Tuple(node) _is_Tuple(node)
#define is_no_Block(node) _is_no_Block(node)
#define is_Block(node) _is_Block(node)
#define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)