return _get_irn_intra_n(node, n);
}
+/**
+ * returns a hash value for a node
+ */
+static INLINE unsigned hash_irn(const ir_node *node)
+{
+ return (unsigned) get_irn_idx(node);
+}
+
/**
* Access to the predecessors of a node.
* To iterate over the operands iterate from 0 to i < get_irn_arity(),
return (_get_irn_op(node) == op_Conv);
}
+static INLINE int
+_is_strictConv(const ir_node *node) {
+ return _is_Conv(node) && get_Conv_strict(node);
+}
+
static INLINE int
_is_Cast(const ir_node *node) {
assert(node);
}
static INLINE ir_node *
-_get_Block_cfgpred(ir_node *node, int pos) {
+_get_Block_cfgpred(const ir_node *node, int pos) {
assert(0 <= pos && pos < get_irn_arity(node));
assert(_is_Block(node));
return _get_irn_n(node, pos);
* Start, but the Bad node.
*/
static INLINE ir_node *
-_get_Block_cfgpred_block(ir_node *node, int pos) {
+_get_Block_cfgpred_block(const ir_node *node, int pos) {
ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
if (!is_Bad(res))
res = get_nodes_block(res);
#define is_Phi(node) _is_Phi(node)
#define is_Const(node) _is_Const(node)
#define is_Conv(node) _is_Conv(node)
+#define is_strictConv(node) _is_strictConv(node)
#define is_Cast(node) _is_Cast(node)
#define is_Unknown(node) _is_Unknown(node)
#define is_Return(node) _is_Return(node)