* @param irn The node.
* @param edge An ir_edge_t pointer which shall be set to the current edge.
* @param ne The next edge, enables alteration safe edge processing.
+ * @param kind The kind of the edge.
*/
#define foreach_out_edge_kind_safe(irn, edge, ne, kind) \
for((edge) = (get_irn_out_edge_first_kind(irn, kind)), (ne) = ((edge) ? (get_irn_out_edge_next(irn, edge)) : NULL); \
*/
ir_node *get_edge_src_irn(const ir_edge_t *edge);
-/**
- * Get the number of edges pointing to a node.
- * @param irn The node.
- * @return The number of edges pointing to this node.
- */
-int get_irn_n_edges(const ir_node *irn);
-
/**
* Get the position of an edge.
* @param edge The edge.
/**
* Get the edge object of an outgoing edge at a node.
- * @param irg The graph, the node is in.
- * @param irn The node at which the edge originates.
- * @param pos The position of the edge.
+ * @param irg The graph, the node is in.
+ * @param irn The node at which the edge originates.
+ * @param pos The position of the edge.
+ * @param kind The kind of the edge.
* @return The corresponding edge object or NULL,
* if no such edge exists.
*/
*/
void edges_init_dbg(int do_dbg);
+/**
+ * Creates an ir_graph pass for edges_verify().
+ *
+ * @param name the name of this pass or NULL
+ * @param assert_on_problem assert if problems were found
+ *
+ * @return the newly created ir_graph pass
+ */
+ir_graph_pass_t *irg_verify_edges_pass(const char *name, unsigned assert_on_problem);
+
/************************************************************************/
/* Begin Old Interface */
/************************************************************************/