- /* Allocate my array */
- n_outs = (int) n->out;
- n->out = free;
- free = &free[n_outs];
- /* We count the successors again, the space will be sufficient.
- We use this counter to remember the position for the next back
- edge. */
- n->out[0] = (ir_node *)0;
+/**
+ * Enter memory for the outs to a node.
+ *
+ * @param use current node
+ * @param free current free address in the chunk allocated for the outs
+ *
+ * @return The next free address
+ */
+static ir_def_use_edge *_set_out_edges(ir_node *use, ir_def_use_edge *free)
+{
+ int start, i, irn_arity, pos;
+ size_t n_outs;
+
+ mark_irn_visited(use);
+
+ /* Allocate my array */
+ n_outs = PTR_TO_INT(use->out);
+ use->out = free;
+#ifdef DEBUG_libfirm
+ use->out_valid = 1;
+#endif /* defined DEBUG_libfirm */
+ free += n_outs;
+ /* We count the successors again, the space will be sufficient.
+ We use this counter to remember the position for the next back
+ edge. */
+ use->out[0].pos = 0;
+
+ start = is_Block(use) ? 0 : -1;
+ irn_arity = get_irn_arity(use);
+
+ for (i = start; i < irn_arity; ++i) {
+ ir_node *def = get_irn_n(use, i);
+
+ /* Recursion */
+ if (!irn_visited(def))
+ free = _set_out_edges(def, free);
+
+ /* Remember this Def-Use edge */
+ pos = def->out[0].pos + 1;
+ def->out[pos].use = use;
+ def->out[pos].pos = i;
+
+ /* increase the number of Def-Use edges so far */
+ def->out[0].pos = pos;
+ }
+ return free;
+}