2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Public header for the automatically updating outs.
23 * @author Sebastian Hack
26 #ifndef FIRM_IR_IREDGES_H
27 #define FIRM_IR_IREDGES_H
29 #include "firm_types.h"
30 #include "iredgekinds.h"
35 * @defgroup iredges Dynamic Reverse Edges
40 * Returns the first edge pointing to some node.
41 * @note There is no order on out edges. First in this context only
42 * means, that you get some starting point into the list of edges.
43 * @param irn The node.
44 * @param kind The kind of the edge.
45 * @return The first out edge that points to this node.
47 FIRM_API const ir_edge_t *get_irn_out_edge_first_kind(const ir_node *irn,
51 * Returns the first edge pointing to some node.
52 * @note There is no order on out edges. First in this context only
53 * means, that you get some starting point into the list of edges.
54 * @param irn The node.
55 * @return The first out edge that points to this node.
57 FIRM_API const ir_edge_t *get_irn_out_edge_first(const ir_node *irn);
60 * Returns the first edge pointing to a successor block.
62 * You can navigate the list with the usual get_irn_out_edge_next().
63 * @param block the Block
64 * @return first block successor edge
66 FIRM_API const ir_edge_t *get_block_succ_first(const ir_node *block);
69 * Returns the next edge in the out list of some node.
70 * @param irn The node.
71 * @param last The last out edge you have seen.
72 * @return The next out edge in @p irn 's out list after @p last.
74 FIRM_API const ir_edge_t *get_irn_out_edge_next(const ir_node *irn,
75 const ir_edge_t *last);
78 * A convenience iteration macro over all out edges of a node.
79 * @param irn The node.
80 * @param kind The edge's kind.
81 * @param edge An ir_edge_t pointer which shall be set to the current
84 #define foreach_out_edge_kind(irn, edge, kind) \
85 for (ir_edge_t const *edge = get_irn_out_edge_first_kind(irn, kind); edge; edge = get_irn_out_edge_next(irn, edge))
88 * A convenience iteration macro over all out edges of a node, which is safe
89 * against alteration of the current edge.
91 * @param irn The node.
92 * @param edge An ir_edge_t pointer which shall be set to the current edge.
93 * @param kind The kind of the edge.
95 #define foreach_out_edge_kind_safe(irn, edge, kind) \
96 for (ir_edge_t const *edge = get_irn_out_edge_first_kind((irn), (kind)), *edge##__next; \
97 edge ? edge##__next = get_irn_out_edge_next((irn), edge), 1 : (edge##__next = NULL, 0); \
101 * Convenience macro for normal out edges.
103 #define foreach_out_edge(irn, edge) foreach_out_edge_kind(irn, edge, EDGE_KIND_NORMAL)
106 * Convenience macro for normal out edges.
108 #define foreach_out_edge_safe(irn, edge) foreach_out_edge_kind_safe(irn, edge, EDGE_KIND_NORMAL)
111 * A convenience iteration macro for all control flow edges.
113 #define foreach_block_succ(bl, edge) foreach_out_edge_kind(bl, edge, EDGE_KIND_BLOCK)
116 * Returns the source node of an edge.
117 * @param edge The edge.
118 * @return The source node of that edge.
120 FIRM_API ir_node *get_edge_src_irn(const ir_edge_t *edge);
123 * Returns the position of an edge.
124 * @param edge The edge.
125 * @return The position in the in array of that edges source.
127 FIRM_API int get_edge_src_pos(const ir_edge_t *edge);
130 * Returns the number of registered out edges for a specific kind.
131 * @param irn The node.
132 * @param kind The kind.
134 FIRM_API int get_irn_n_edges_kind(const ir_node *irn, ir_edge_kind_t kind);
137 * Returns the number of registered out edges with EDGE_KIND_NORMAL
138 * @param irn The node.
140 FIRM_API int get_irn_n_edges(const ir_node *irn);
143 * Checks if the out edges are activated.
145 * @param irg The graph.
146 * @param kind The edge kind.
148 * @return 1, if the edges are present for the given irg, 0 if not.
150 FIRM_API int edges_activated_kind(const ir_graph *irg, ir_edge_kind_t kind);
153 * Checks if out edges with EDG_KIND_NORMAL and EDGE_KIND_BLOCK are activated.
154 * @param irg The graph.
155 * @return 1, if the edges are present for the given irg, 0 if not.
157 FIRM_API int edges_activated(const ir_graph *irg);
160 * Activates the edges for an irg.
162 * @param irg The graph to activate the edges for.
163 * @param kind The edge kind.
165 FIRM_API void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind);
168 * Deactivates the edges for an irg.
170 * @param irg The graph.
171 * @param kind The edge kind.
173 FIRM_API void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind);
176 * Reroutes edges of a specified kind from an old node to a new one.
178 * @param old the old node
179 * @param nw the new node
180 * @param kind the edge kind
182 FIRM_API void edges_reroute_kind(ir_node *old, ir_node *nw, ir_edge_kind_t kind);
185 * Reroutes edges of EDGE_KIND_NORMAL from an old node to a new one.
187 * @param old the old node
188 * @param nw the new node
190 FIRM_API void edges_reroute(ir_node *old, ir_node *nw);
193 * reroutes (normal) edges from an old node to a new node, except for the
194 * @p exception which keeps its input even if it is old.
196 FIRM_API void edges_reroute_except(ir_node *old, ir_node *nw,
200 * Verifies the out edges of graph @p irg.
201 * @return 1 if a problem was found, 0 otherwise
203 FIRM_API int edges_verify(ir_graph *irg);
206 * Verifies a certrain kind of out edges of graph @p irg.
207 * @returns 1 if a problem was found, 0 otherwise
209 FIRM_API int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind);
212 * Sets edge verification flag.
214 FIRM_API void edges_init_dbg(int do_dbg);
217 * Creates an ir_graph pass for edges_verify().
219 * @param name the name of this pass or NULL
220 * @param assert_on_problem assert if problems were found
222 * @return the newly created ir_graph pass
224 FIRM_API ir_graph_pass_t *irg_verify_edges_pass(const char *name,
225 unsigned assert_on_problem);
228 * Activates data and block edges for an irg.
229 * If the irg phase is phase_backend, Dependence edges are
230 * additionally activated.
232 * @param irg The graph to activate the edges for.
234 FIRM_API void edges_activate(ir_graph *irg);
237 * Deactivates data and block edges for an irg.
238 * If the irg phase is phase_backend, Dependence edges are
239 * additionally deactivated.
240 * @param irg The graph.
242 FIRM_API void edges_deactivate(ir_graph *irg);
245 * Ensures that edges are activated.
247 * @param irg the IR graph
249 FIRM_API void assure_edges(ir_graph *irg);
252 * Ensures that edges of a given kind are activated.
254 * @param irg the IR graph
255 * @param kind the edge kind
257 FIRM_API void assure_edges_kind(ir_graph *irg, ir_edge_kind_t kind);
260 * Walks only over Block nodes in the graph. Uses the block visited
261 * flag, so that it can be interleaved with another walker.
263 * @param block the start block
264 * @param pre the pre visit function
265 * @param post the post visit function
266 * @param env the environment for the walker
268 FIRM_API void irg_block_edges_walk(ir_node *block, irg_walk_func *pre,
269 irg_walk_func *post, void *env);
271 /** Graph walker following #EDGE_KIND_NORMAL edges. */
272 FIRM_API void irg_walk_edges(ir_node *start, irg_walk_func *pre,
273 irg_walk_func *post, void *env);