static INLINE int
_is_Proj(const ir_node *node) {
+ ir_op *op;
+ assert(node);
+
+ op = _get_irn_op(node);
+#ifdef INTERPROCEDURAL_VIEW
+ if (op == op_Filter) return !get_interprocedural_view();
+#endif
+ return (op == op_Proj);
+}
+
+static INLINE int
+_is_Filter(const ir_node *node) {
assert(node);
- return (_get_irn_op(node) == op_Proj);
+ return (_get_irn_op(node) == op_Filter);
}
static INLINE int
}
static INLINE int
-_is_Rot(const ir_node *node) {
+_is_Rotl(const ir_node *node) {
assert(node);
- return (_get_irn_op(node) == op_Rot);
+ return (_get_irn_op(node) == op_Rotl);
}
static INLINE int
return (_get_irn_op(node) == op_Psi);
}
+static INLINE int
+_is_Id(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Id);
+}
+
static INLINE int
_is_Tuple(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Call);
}
+static INLINE int
+_is_CallBegin(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_CallBegin);
+}
+
static INLINE int
_is_Sel(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Alloc);
}
+static INLINE int
+_is_Free(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Free);
+}
+
static INLINE int
_is_Jmp(const ir_node *node) {
assert(node);
return (_get_irn_op(node) == op_Jmp);
}
+static INLINE int
+_is_IJmp(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_IJmp);
+}
+
static INLINE int
_is_Raise(const ir_node *node) {
assert(node);
block->attr.block.marked = mark;
}
+/** Returns non-zero if a node is a routine parameter. */
+static INLINE int
+_is_arg_Proj(const ir_node *node) {
+ if (! is_Proj(node))
+ return 0;
+ node = get_Proj_pred(node);
+ if (! is_Proj(node))
+ return 0;
+ return pn_Start_T_args == get_Proj_proj(node) && is_Start(get_Proj_pred(node));
+}
+
+
/* this section MUST contain all inline functions */
#define is_ir_node(thing) _is_ir_node(thing)
#define get_irn_intra_arity(node) _get_irn_intra_arity(node)
#define is_unop(node) _is_unop(node)
#define is_binop(node) _is_binop(node)
#define is_Proj(node) _is_Proj(node)
+#define is_Filter(node) _is_Filter(node)
#define is_Phi(node) _is_Phi(node)
#define is_Const(node) _is_Const(node)
#define is_Conv(node) _is_Conv(node)
#define is_Unknown(node) _is_Unknown(node)
#define is_Return(node) _is_Return(node)
#define is_Call(node) _is_Call(node)
+#define is_CallBegin(node) _is_CallBegin(node)
#define is_Sel(node) _is_Sel(node)
#define is_Mul(node) _is_Mul(node)
#define is_Mulh(node) _is_Mulh(node)
#define is_CopyB(node) _is_CopyB(node)
#define is_Cmp(node) _is_Cmp(node)
#define is_Alloc(node) _is_Alloc(node)
+#define is_Free(node) _is_Free(node)
#define is_Jmp(node) _is_Jmp(node)
+#define is_IJmp(node) _is_IJmp(node)
#define is_Raise(node) _is_Raise(node)
#define is_ASM(node) _is_ASM(node)
#define is_Anchor(node) _is_Anchor(node)
#define is_Shl(node) _is_Shl(node)
#define is_Shr(node) _is_Shr(node)
#define is_Shrs(node) _is_Shrs(node)
-#define is_Rot(node) _is_Rot(node)
+#define is_Rotl(node) _is_Rotl(node)
#define is_Psi(node) _is_Psi(node)
+#define is_Id(node) _is_Id(node)
#define is_Tuple(node) _is_Tuple(node)
#define is_Bound(node) _is_Bound(node)
#define is_no_Block(node) _is_no_Block(node)
#define set_Phi_next(node, phi) _set_Phi_next(node, phi)
#define get_Phi_next(node) _get_Phi_next(node)
+#define is_arg_Proj(node) _is_arg_Proj(node)
+
#endif