+static INLINE int
+_is_Cond(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Cond);
+}
+
+static INLINE int
+_is_Cmp(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Cmp);
+}
+
+static INLINE int
+_is_Alloc(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);
+ return (_get_irn_op(node) == op_Raise);
+}
+
+static INLINE int
+_is_ASM(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_ASM);
+}
+
+static INLINE int
+_is_Anchor(const ir_node *node) {
+ return (_get_irn_op(node) == op_Anchor);
+}
+
+static INLINE int
+_is_no_Block(const ir_node *node) {
+ assert(node && _is_ir_node(node));
+ return (_get_irn_op(node) != op_Block);
+}
+
+static INLINE int
+_is_Block(const ir_node *node) {
+ assert(node && _is_ir_node(node));
+ return (_get_irn_op(node) == op_Block);
+}
+
+static INLINE int
+_get_Block_n_cfgpreds(const ir_node *node) {
+ assert(_is_Block(node));
+ return _get_irn_arity(node);
+}
+
+static INLINE ir_node *
+_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);
+}
+
+/* Get the predecessor block.
+ *
+ * Returns the block corresponding to the predecessor pos.
+ *
+ * There are several ambiguities we resolve with this function:
+ * - The direct predecessor can be a Proj, which is not pinned.
+ * We walk from the predecessor to the next pinned node
+ * (skip_Proj) and return the block that node is in.
+ * - If we encounter the Bad node, this function does not return
+ * Start, but the Bad node.
+ */
+static INLINE ir_node *
+_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);
+ return res;
+}
+
+static INLINE ir_visited_t
+_get_Block_block_visited(const ir_node *node) {
+ assert(node->op == op_Block);
+ return node->attr.block.block_visited;
+}
+
+static INLINE void
+_set_Block_block_visited(ir_node *node, ir_visited_t visit) {
+ assert(node->op == op_Block);
+ node->attr.block.block_visited = visit;
+}
+
+/* For this current_ir_graph must be set. */
+static INLINE void
+_mark_Block_block_visited(ir_node *node) {
+ assert(node->op == op_Block);
+ node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
+}
+
+static INLINE int
+_Block_block_visited(const ir_node *node) {
+ assert(node->op == op_Block);
+ return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
+}
+
+static INLINE ir_node *
+_set_Block_dead(ir_node *block) {
+ assert(_get_irn_op(block) == op_Block);
+ block->attr.block.dom.dom_depth = -1;
+ block->attr.block.is_dead = 1;
+ return block;
+}
+
+static INLINE int
+_is_Block_dead(const ir_node *block) {
+ ir_op *op = _get_irn_op(block);
+
+ if (op == op_Bad)
+ return 1;
+ else {
+ assert(op == op_Block);
+ return block->attr.block.is_dead;
+ }
+}
+
+static INLINE tarval *_get_Const_tarval(const ir_node *node) {
+ assert(_get_irn_op(node) == op_Const);
+ return node->attr.con.tv;
+}
+
+static INLINE int _is_Const_null(const ir_node *node) {
+ return tarval_is_null(_get_Const_tarval(node));
+}
+
+static INLINE int _is_Const_one(const ir_node *node) {
+ return tarval_is_one(_get_Const_tarval(node));
+}
+
+static INLINE int _is_Const_all_one(const ir_node *node) {
+ return tarval_is_all_one(_get_Const_tarval(node));
+}
+
+static INLINE int _is_irn_forking(const ir_node *node) {
+ return is_op_forking(_get_irn_op(node));
+}
+
+static INLINE ir_type *_get_irn_type(ir_node *node) {
+ return _get_irn_op(node)->ops.get_type(node);
+}
+
+static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
+ return _get_irn_op(node)->ops.get_type_attr(node);
+}
+
+static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
+ return _get_irn_op(node)->ops.get_entity_attr(node);
+}
+
+static INLINE int _is_irn_constlike(const ir_node *node) {
+ return is_op_constlike(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_always_opt(const ir_node *node) {
+ return is_op_always_opt(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_keep(const ir_node *node) {
+ return is_op_keep(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_start_block_placed(const ir_node *node) {
+ return is_op_start_block_placed(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_machine_op(const ir_node *node) {
+ return is_op_machine(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_machine_operand(const ir_node *node) {
+ return is_op_machine_operand(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
+ return is_op_machine_user(_get_irn_op(node), n);
+}
+
+static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) {
+ assert(_get_irn_op(node) == op_Cond);
+ return node->attr.cond.pred;
+}
+
+static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
+ assert(_get_irn_op(node) == op_Cond);
+ node->attr.cond.pred = pred;
+}
+
+static INLINE void *_get_irn_generic_attr(ir_node *node) {
+ return &node->attr;
+}
+
+static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
+ return &node->attr;
+}
+
+static INLINE unsigned _get_irn_idx(const ir_node *node) {
+ return node->node_idx;
+}
+
+static INLINE dbg_info *_get_irn_dbg_info(const ir_node *n) {
+ return n->dbi;
+} /* get_irn_dbg_info */
+
+static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) {
+ n->dbi = db;
+}
+
+/**
+ * Sets the Phi list of a block.
+ */
+static INLINE void
+_set_Block_phis(ir_node *block, ir_node *phi) {
+ assert(_is_Block(block));
+ assert(phi == NULL || _is_Phi(phi));
+ block->attr.block.phis = phi;
+}
+
+/**
+ * Returns the link of a node.
+ * Intern version of libFirm.
+ */
+static INLINE ir_node *
+_get_Block_phis(const ir_node *block) {
+ assert(_is_Block(block));
+ return block->attr.block.phis;
+}
+
+/**
+ * Sets the next link of a Phi.
+ */
+static INLINE void
+_set_Phi_next(ir_node *phi, ir_node *next) {
+ assert(_is_Phi(phi));
+ phi->attr.phi.next = next;
+}
+
+/**
+ * Returns the link of a node.
+ * Intern version of libFirm.
+ */
+static INLINE ir_node *
+_get_Phi_next(const ir_node *phi) {
+ assert(_is_Phi(phi));
+ return phi->attr.phi.next;
+}
+
+/** Add a Phi node to the list of Block Phi's. */
+static INLINE void
+_add_Block_phi(ir_node *block, ir_node *phi) {
+ _set_Phi_next(phi, _get_Block_phis(block));
+ _set_Block_phis(block, phi);
+}
+
+/** Get the Block mark (single bit). */
+static INLINE unsigned
+_get_Block_mark(const ir_node *block) {
+ assert(_is_Block(block));
+ return block->attr.block.marked;
+}
+
+/** Set the Block mark (single bit). */
+static INLINE void
+_set_Block_mark(ir_node *block, unsigned mark) {
+ assert(_is_Block(block));
+ 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));
+}
+
+