#include "firm_types.h"
#include "iredgekinds.h"
+#include "begin.h"
/**
* Get the first edge pointing to some node.
* @param kind The kind of the edge.
* @return The first out edge that points to this node.
*/
-const ir_edge_t *get_irn_out_edge_first_kind(const ir_node *irn, ir_edge_kind_t kind);
+FIRM_API const ir_edge_t *get_irn_out_edge_first_kind(const ir_node *irn,
+ ir_edge_kind_t kind);
/**
* Get the next edge in the out list of some node.
* @param last The last out edge you have seen.
* @return The next out edge in @p irn 's out list after @p last.
*/
-const ir_edge_t *get_irn_out_edge_next(const ir_node *irn, const ir_edge_t *last);
+FIRM_API const ir_edge_t *get_irn_out_edge_next(const ir_node *irn,
+ const ir_edge_t *last);
/**
* A convenience iteration macro over all out edges of a node.
* @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); \
* @param edge The edge.
* @return The source node of that edge.
*/
-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);
+FIRM_API ir_node *get_edge_src_irn(const ir_edge_t *edge);
/**
* Get the position of an edge.
* @param edge The edge.
* @return The position in the in array of that edges source.
*/
-int get_edge_src_pos(const ir_edge_t *edge);
+FIRM_API int get_edge_src_pos(const ir_edge_t *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.
*/
-const ir_edge_t *get_irn_edge_kind(ir_graph *irg, const ir_node *irn, int pos, ir_edge_kind_t kind);
+FIRM_API const ir_edge_t *get_irn_edge_kind(const ir_node *irn,
+ int pos, ir_edge_kind_t kind);
/**
* Get the number of registered out edges for a specific kind.
* @param irn The node.
* @param kind The kind.
*/
-int get_irn_n_edges_kind(const ir_node *irn, ir_edge_kind_t kind);
+FIRM_API int get_irn_n_edges_kind(const ir_node *irn, ir_edge_kind_t kind);
/**
* Check, if the out edges are activated.
*
* @return 1, if the edges are present for the given irg, 0 if not.
*/
-int edges_activated_kind(const ir_graph *irg, ir_edge_kind_t kind);
+FIRM_API int edges_activated_kind(const ir_graph *irg, ir_edge_kind_t kind);
/**
* Activate the edges for an irg.
* @param irg The graph to activate the edges for.
* @param kind The edge kind.
*/
-void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind);
+FIRM_API void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind);
/**
* Deactivate the edges for an irg.
* @param irg The graph.
* @param kind The edge kind.
*/
-void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind);
+FIRM_API void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind);
/**
* Reroute edges of a specified kind from an old node to
* @param old the old node
* @param nw the new node
* @param kind the edge kind
- * @param irg the graph on which the rerouting occurs
*/
-void edges_reroute_kind(ir_node *old, ir_node *nw, ir_edge_kind_t kind, ir_graph *irg);
+FIRM_API void edges_reroute_kind(ir_node *old, ir_node *nw, ir_edge_kind_t kind);
/**
* Verifies the out edges of graph @p irg.
* @return 1 if a problem was found, 0 otherwise
*/
-int edges_verify(ir_graph *irg);
+FIRM_API int edges_verify(ir_graph *irg);
/**
- * Set edge verification flag.
+ * veriy a certrain kind of out edges of graph @p irg.
+ * @returns 1 if a problem was found, 0 otherwise
*/
-void edges_init_dbg(int do_dbg);
+FIRM_API int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind);
-/************************************************************************/
-/* Begin Old Interface */
-/************************************************************************/
+/**
+ * Set edge verification flag.
+ */
+FIRM_API void edges_init_dbg(int do_dbg);
-const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos);
+/**
+ * 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
+ */
+FIRM_API ir_graph_pass_t *irg_verify_edges_pass(const char *name,
+ unsigned assert_on_problem);
-#define edges_reroute(old, nw, irg) edges_reroute_kind(old, nw, EDGE_KIND_NORMAL, irg)
+#define edges_reroute(old, nw) edges_reroute_kind(old, nw, EDGE_KIND_NORMAL)
#define edges_activated(irg) (edges_activated_kind(irg, EDGE_KIND_NORMAL) && edges_activated_kind(irg, EDGE_KIND_BLOCK))
#ifndef get_irn_n_edges
*
* @param irg The graph to activate the edges for.
*/
-void edges_activate(ir_graph *irg);
+FIRM_API void edges_activate(ir_graph *irg);
/**
* Deactivate data and block edges for an irg.
* additionally deactivated.
* @param irg The graph.
*/
-void edges_deactivate(ir_graph *irg);
+FIRM_API void edges_deactivate(ir_graph *irg);
/**
* Ensure that edges are activated.
*
* @return 0 if edges was deactivated before the call, 1 else
*/
-int edges_assure(ir_graph *irg);
+FIRM_API int edges_assure(ir_graph *irg);
/**
* Ensure that edges of a given kind are activated.
*
* @return 0 if edges was deactivated before the call, 1 else
*/
-int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind);
+FIRM_API int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind);
-void edges_node_deleted(ir_node *irn, ir_graph *irg);
-
-/**
- * Notify normal and block edges.
- */
-void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg);
+FIRM_API void edges_node_deleted(ir_node *irn);
/**
* Walks only over Block nodes in the graph. Uses the block visited
* @param post the post visit function
* @param env the environment for the walker
*/
-void irg_block_edges_walk(ir_node *block, irg_walk_func *pre, irg_walk_func *post, void *env);
+FIRM_API void irg_block_edges_walk(ir_node *block, irg_walk_func *pre,
+ irg_walk_func *post, void *env);
+
+FIRM_API void irg_walk_edges(ir_node *start, irg_walk_func *pre,
+ irg_walk_func *post, void *env);
-void edges_reset_private_data(ir_graph *irg, int offset, size_t size);
+/**
+ * Reset the user's private data at offset 'offset'
+ * The user has to remember his offset and the size of his data!
+ * Caution: Using wrong values here can destroy other users private data!
+ *
+ * @param irg the IR graph to operate on
+ * @param offset offset of the private data inside the edge
+ * @param size length of the private data inside the edge
+ */
+FIRM_API void edges_reset_private_data(ir_graph *irg, int offset,
+ unsigned size);
-/************************************************************************/
-/* End Old Interface */
-/************************************************************************/
+#include "end.h"
#endif
projects / libfirm / blobdiff