Commit 8e2c4cdb authored by Michael Beck's avatar Michael Beck
Browse files

- added is_Id, is_CallBegin, is_Free

- placed mode #ifdef INTERPROCEDURAL_VIEW
- used is_*(x) fucntions instead of x->op == op_X

[r19805]
parent db9740e3
......@@ -1272,6 +1272,8 @@ int is_Shrs(const ir_node *node);
int is_Rot(const ir_node *node);
/** Returns true if node is a Psi node. */
int is_Psi(const ir_node *node);
/** Returns true if node is an Id node. */
int is_Id(const ir_node *node);
/** Returns true if node is a Tuple node. */
int is_Tuple(const ir_node *node);
/** Returns true if node is a Bound node. */
......@@ -1286,6 +1288,8 @@ int is_Unknown(const ir_node *node);
int is_Return(const ir_node *node);
/** Returns true if node is a Call node. */
int is_Call(const ir_node *node);
/** Returns true if node is a CallBegin node. */
int is_CallBegin(const ir_node *node);
/** Returns true if node is a Sel node. */
int is_Sel(const ir_node *node);
/** Returns true if node is a Mul node. */
......@@ -1316,8 +1320,12 @@ int is_CopyB(const ir_node *node);
int is_Cmp(const ir_node *node);
/** Returns true if node is an Alloc node. */
int is_Alloc(const ir_node *node);
/** Returns true if node is a Free node. */
int is_Free(const ir_node *node);
/** Returns true if a node is a Jmp node. */
int is_Jmp(const ir_node *node);
/** Returns true if a node is a IJmp node. */
int is_IJmp(const ir_node *node);
/** Returns true if a node is a Raise node. */
int is_Raise(const ir_node *node);
/** Returns true if a node is an ASM node. */
......@@ -1326,6 +1334,7 @@ int is_ASM(const ir_node *node);
int is_Proj(const ir_node *node);
/** Returns true if node is a Filter node. */
int is_Filter(const ir_node *node);
/** Returns true if the operation manipulates control flow:
Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
int is_cfop(const ir_node *node);
......
This diff is collapsed.
......@@ -553,6 +553,12 @@ _is_Psi(const ir_node *node) {
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);
......@@ -624,6 +630,12 @@ _is_Call(const ir_node *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);
......@@ -711,12 +723,24 @@ _is_Alloc(const ir_node *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);
......@@ -1019,6 +1043,7 @@ _set_Block_mark(ir_node *block, unsigned mark) {
#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)
......@@ -1033,7 +1058,9 @@ _set_Block_mark(ir_node *block, unsigned mark) {
#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)
......@@ -1058,6 +1085,7 @@ _set_Block_mark(ir_node *block, unsigned mark) {
#define is_Shrs(node) _is_Shrs(node)
#define is_Rot(node) _is_Rot(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)
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment