-/**********************************************************************/
-
-
-/* Returns the amount of out edges for not yet visited successors. */
-static int count_outs(ir_node *n) {
- int start, i, res, irn_arity;
- ir_node *succ;
-
- set_irn_visited(n, get_irg_visited(current_ir_graph));
- n->out = (ir_node **) 1; /* Space for array size. */
-
- start = get_irn_op(n) == op_Block ? 0 : -1;
- irn_arity = get_irn_arity(n);
- res = irn_arity - start +1; /* --1 or --0; 1 for array size. */
- for (i = start; i < irn_arity; i++) {
- /* Optimize Tuples. They annoy if walking the cfg. */
- succ = skip_Tuple(get_irn_n(n, i));
- set_irn_n(n, i, succ);
- /* count outs for successors */
- if (get_irn_visited(succ) < get_irg_visited(current_ir_graph)) {
- res += count_outs(succ);
- }
- /* Count my outs */
- succ->out = (ir_node **)( (int)succ->out +1);
- }
- return res;
-}
-
-static ir_node **set_out_edges(ir_node *n, ir_node **free) {
- int n_outs, start, i, irn_arity;
- ir_node *succ;
-
- set_irn_visited(n, get_irg_visited(current_ir_graph));
-
- /* Allocate my array */
- n_outs = (int) n->out;
- n->out = free;
-#ifdef DEBUG_libfirm
- n->out_valid = 1;
-#endif /* defined DEBUG_libfirm */
- 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;
-
- if (get_irn_op(n) == op_Block) start = 0; else start = -1;
- irn_arity = get_irn_arity(n);
- for (i = start; i < irn_arity; i++) {
- succ = get_irn_n(n, i);
- /* Recursion */
- if (get_irn_visited(succ) < get_irg_visited(current_ir_graph))
- free = set_out_edges(succ, free);
- /* Remember our back edge */
- succ->out[get_irn_n_outs(succ)+1] = n;
- succ->out[0] = (ir_node *) (get_irn_n_outs(succ) + 1);
- }
- return free;
-}