2 * Copyright (C) 1995-2011 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 Compute and access out edges (also called def-use edges).
23 * @author Goetz Lindenmaier, Michael Beck
33 #include "irgraph_t.h"
41 int get_irn_outs_computed(const ir_node *node)
43 return node->out != NULL;
46 int get_irn_n_outs(const ir_node *node)
48 assert(node->kind == k_ir_node);
49 assert(node->out_valid);
50 /* we misuse the first for the size info of the out array */
51 return node->out[0].pos;
54 ir_node *get_irn_out(const ir_node *def, int pos)
56 assert(pos >= 0 && pos < get_irn_n_outs(def));
57 assert(def->out_valid);
58 return def->out[pos+1].use;
61 ir_node *get_irn_out_ex(const ir_node *def, int pos, int *in_pos)
63 assert(pos >= 0 && pos < get_irn_n_outs(def));
64 assert(def->out_valid);
65 *in_pos = def->out[pos+1].pos;
66 return def->out[pos+1].use;
69 void set_irn_out(ir_node *def, int pos, ir_node *use, int in_pos)
72 assert(pos >= 0 && pos < get_irn_n_outs(def));
73 assert(def->out_valid);
74 def->out[pos+1].use = use;
75 def->out[pos+1].pos = in_pos;
78 int get_Block_n_cfg_outs(const ir_node *bl)
81 assert(bl->out_valid);
83 for (int i = 1; i <= bl->out[0].pos; ++i) {
84 const ir_node *succ = bl->out[i].use;
85 if (get_irn_mode(succ) == mode_X && !is_End(succ) && !is_Bad(succ))
86 n_cfg_outs += succ->out[0].pos;
91 int get_Block_n_cfg_outs_ka(const ir_node *bl)
94 assert(bl->out_valid);
96 for (int i = 1; i <= bl->out[0].pos; ++i) {
97 const ir_node *succ = bl->out[i].use;
98 if (get_irn_mode(succ) == mode_X) {
102 /* ignore End if we are in the Endblock */
103 if (get_nodes_block(succ) == bl)
105 else /* count Keep-alive as one */
108 n_cfg_outs += succ->out[0].pos;
114 ir_node *get_Block_cfg_out(const ir_node *bl, int pos)
116 assert(is_Block(bl));
117 assert(bl->out_valid);
118 for (int i = 1; i <= bl->out[0].pos; ++i) {
119 const ir_node *succ = bl->out[i].use;
120 if (get_irn_mode(succ) == mode_X && !is_End(succ) && !is_Bad(succ)) {
121 int n_outs = succ->out[0].pos;
123 return succ->out[pos + 1].use;
131 ir_node *get_Block_cfg_out_ka(const ir_node *bl, int pos)
133 assert(is_Block(bl));
134 assert(bl->out_valid);
135 for (int i = 1; i <= bl->out[0].pos; ++i) {
136 const ir_node *succ = bl->out[i].use;
137 if (get_irn_mode(succ) == mode_X) {
141 ir_node *end_bl = get_nodes_block(succ);
143 /* ignore End if we are in the Endblock */
147 /* handle keep-alive here: return the Endblock instead of the End node */
152 int n_outs = succ->out[0].pos;
154 return succ->out[pos + 1].use;
163 static void irg_out_walk_2(ir_node *node, irg_walk_func *pre,
164 irg_walk_func *post, void *env)
166 assert(get_irn_visited(node) < get_irg_visited(current_ir_graph));
168 set_irn_visited(node, get_irg_visited(current_ir_graph));
170 if (pre) pre(node, env);
172 int n = get_irn_n_outs(node);
173 for (int i = 0; i < n; ++i) {
174 ir_node *succ = get_irn_out(node, i);
175 if (get_irn_visited(succ) < get_irg_visited(current_ir_graph))
176 irg_out_walk_2(succ, pre, post, env);
179 if (post) post(node, env);
182 void irg_out_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
186 ir_graph *irg = get_irn_irg(node);
187 if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS)) {
188 inc_irg_visited(irg);
189 irg_out_walk_2(node, pre, post, env);
193 static void irg_out_block_walk2(ir_node *bl, irg_walk_func *pre,
194 irg_walk_func *post, void *env)
196 if (Block_block_visited(bl))
199 mark_Block_block_visited(bl);
204 int n = get_Block_n_cfg_outs(bl);
205 for (int i = 0; i < n; ++i) {
206 /* find the corresponding predecessor block. */
207 ir_node *pred = get_Block_cfg_out(bl, i);
209 irg_out_block_walk2(pred, pre, post, env);
216 void irg_out_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
219 ir_graph *irg = get_irn_irg(node);
220 assert(is_Block(node) || (get_irn_mode(node) == mode_X));
222 ir_graph *rem = current_ir_graph;
223 current_ir_graph = irg;
225 inc_irg_block_visited(irg);
227 if (get_irn_mode(node) == mode_X) {
228 int n = get_irn_n_outs(node);
229 for (int i = 0; i < n; ++i) {
230 ir_node *succ = get_irn_out(node, i);
231 irg_out_block_walk2(succ, pre, post, env);
234 irg_out_block_walk2(node, pre, post, env);
237 current_ir_graph = rem;
240 /*--------------------------------------------------------------------*/
241 /** Building and Removing the out datastructure **/
243 /** The outs of a graph are allocated in a single, large array. **/
244 /** This allows to allocate and deallocate the memory for the outs **/
245 /** on demand. The large array is separated into many small ones **/
246 /** for each node. Only a single field to reference the out array **/
247 /** is stored in each node and a field referencing the large out **/
248 /** array in irgraph. The 0 field of each out array contains the **/
249 /** size of this array. This saves memory in the irnodes themselves.**/
250 /** The construction does two passes over the graph. The first pass **/
251 /** counts the overall number of outs and the outs of each node. It **/
252 /** stores the outs of each node in the out reference of the node. **/
253 /** Then the large array is allocated. The second iteration chops **/
254 /** the large array into smaller parts, sets the out edges and **/
255 /** recounts the out edges. **/
256 /** Removes Tuple nodes! **/
257 /*--------------------------------------------------------------------*/
260 /** Returns the amount of out edges for not yet visited successors. */
261 static int _count_outs(ir_node *n)
264 n->out = (ir_def_use_edge*) INT_TO_PTR(1); /* Space for array size. */
266 int start = is_Block(n) ? 0 : -1;
267 int irn_arity = get_irn_arity(n);
268 int res = irn_arity - start + 1; /* --1 or --0; 1 for array size. */
270 for (int i = start; i < irn_arity; ++i) {
271 /* Optimize Tuples. They annoy if walking the cfg. */
272 ir_node *pred = get_irn_n(n, i);
273 ir_node *skipped_pred = skip_Tuple(pred);
275 if (skipped_pred != pred) {
276 set_irn_n(n, i, skipped_pred);
279 /* count Def-Use edges for predecessors */
280 if (!irn_visited(skipped_pred))
281 res += _count_outs(skipped_pred);
283 /*count my Def-Use edges */
284 skipped_pred->out = (ir_def_use_edge*) INT_TO_PTR(PTR_TO_INT(skipped_pred->out) + 1);
290 /** Returns the amount of out edges for not yet visited successors.
291 * This version handles some special nodes like irg_frame, irg_args etc.
293 static int count_outs(ir_graph *irg)
295 inc_irg_visited(irg);
296 int res = _count_outs(get_irg_end(irg));
298 /* Now handle anchored nodes. We need the out count of those
299 even if they are not visible. */
300 for (int i = anchor_last; i >= anchor_first; --i) {
301 ir_node *n = get_irg_anchor(irg, i);
302 if (!irn_visited_else_mark(n)) {
303 n->out = (ir_def_use_edge*) INT_TO_PTR(1);
311 * Enter memory for the outs to a node.
313 * @param use current node
314 * @param free current free address in the chunk allocated for the outs
316 * @return The next free address
318 static ir_def_use_edge *_set_out_edges(ir_node *use, ir_def_use_edge *free)
320 mark_irn_visited(use);
322 /* Allocate my array */
323 size_t n_outs = PTR_TO_INT(use->out);
327 #endif /* defined DEBUG_libfirm */
329 /* We count the successors again, the space will be sufficient.
330 We use this counter to remember the position for the next back
334 int start = is_Block(use) ? 0 : -1;
335 int irn_arity = get_irn_arity(use);
337 for (int i = start; i < irn_arity; ++i) {
338 ir_node *def = get_irn_n(use, i);
341 if (!irn_visited(def))
342 free = _set_out_edges(def, free);
344 /* Remember this Def-Use edge */
345 int pos = def->out[0].pos + 1;
346 def->out[pos].use = use;
347 def->out[pos].pos = i;
349 /* increase the number of Def-Use edges so far */
350 def->out[0].pos = pos;
356 * Enter memory for the outs to a node. Handles special nodes
358 * @param irg the graph
359 * @param free current free address in the chunk allocated for the outs
361 * @return The next free address
363 static ir_def_use_edge *set_out_edges(ir_graph *irg, ir_def_use_edge *free)
365 inc_irg_visited(irg);
366 free = _set_out_edges(get_irg_end(irg), free);
368 /* handle anchored nodes */
369 for (int i = anchor_last; i >= anchor_first; --i) {
370 ir_node *n = get_irg_anchor(irg, i);
371 if (!irn_visited_else_mark(n)) {
372 size_t n_outs = PTR_TO_INT(n->out);
384 void compute_irg_outs(ir_graph *irg)
387 ir_def_use_edge *end = NULL; /* Only for debugging */
389 /* Update graph state */
390 assert(get_irg_phase_state(irg) != phase_building);
394 /* This first iteration counts the overall number of out edges and the
395 number of out edges for each node. */
396 n_out_edges = count_outs(irg);
398 /* allocate memory for all out edges. */
399 irg->outs = XMALLOCNZ(ir_def_use_edge, n_out_edges);
401 irg->n_outs = n_out_edges;
404 /* The second iteration splits the irg->outs array into smaller arrays
405 for each node and writes the back edges into this array. */
406 end = set_out_edges(irg, irg->outs);
408 /* Check how much memory we have used */
409 assert (end == (irg->outs + n_out_edges));
411 add_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
414 void assure_irg_outs(ir_graph *irg)
416 if (! irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS))
417 compute_irg_outs(irg);
420 void compute_irp_outs(void)
422 size_t n = get_irp_n_irgs();
423 for (size_t i = 0; i < n; ++i)
424 compute_irg_outs(get_irp_irg(i));
427 void free_irp_outs(void)
429 size_t n = get_irp_n_irgs();
430 for (size_t i = 0; i < n; ++i)
431 free_irg_outs(get_irp_irg(i));
435 /** Clear the outs of a node */
436 static void reset_outs(ir_node *node, void *unused)
444 void free_irg_outs(ir_graph *irg)
446 if (irg->outs != NULL) {
448 memset(irg->outs, 0, irg->n_outs);
456 /* when debugging, *always* reset all nodes' outs! irg->outs might
457 have been lying to us */
458 irg_walk_graph (irg, reset_outs, NULL, NULL);