- struct list_head *next = last->list.next;
- return next == _get_irn_outs_head(irn) ? NULL : list_entry(next, ir_edge_t, list);
-}
-
-/**
- * Get the first successor edge of a block.
- * A successor edge is an edge originated from another block, pointing
- * to a mode_X node in the given block and is thus a control flow
- * successor edge.
- * @param irn The block.
- * @return The first successor edge of the block.
- */
-static INLINE const ir_edge_t *_get_block_succ_first(const ir_node *irn)
-{
- const struct list_head *head;
-
- assert(is_Block(irn) && "Node must be a block here");
- head = _get_block_succ_head(irn);
- return (ir_edge_t *) (list_empty(head) ? NULL :
- list_entry(head->next, ir_block_edge_t, succ_list));
-}
-
-/**
- * Get the next block successor edge.
- * @see See _get_block_succ_first() for details.
- * @param irn The block.
- * @param last The last edge.
- * @return The next edge, or NULL if there is no further.
- */
-static INLINE const ir_edge_t *_get_block_succ_next(const ir_node *irn, const ir_edge_t *last)
-{
- const ir_block_edge_t *block_edge;
- struct list_head *next;
-
- assert(is_Block(irn) && "Node must be a block here");
- block_edge = (const ir_block_edge_t *) last;
- next = block_edge->succ_list.next;
- return (ir_edge_t *) (next == _get_block_succ_head(irn) ? NULL :
- list_entry(next, ir_block_edge_t, succ_list));
-}
-
-/**
- * Get the source node of an edge.
- * @param edge The edge.
- * @return The source node of that edge.
- */
-static INLINE ir_node *_get_edge_src_irn(const ir_edge_t *edge)
-{
- return edge ? edge->src : NULL;
-}
-
-/**
- * Get the position of an edge.
- * @param edge.
- * @return The position in the in array of that edges source.
- */
-static INLINE int _get_edge_src_pos(const ir_edge_t *edge)
-{
- return edge ? edge->pos : -1;