- int start, i, res, irn_arity;
-
- set_irn_visited(n, get_irg_visited(current_ir_graph));
- n->out = (ir_node **) 1; /* Space for array size. */
-
- start = is_Block(n) ? 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. */
- ir_node *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;
+ int start, i, res, irn_arity;
+
+ mark_irn_visited(n);
+ n->out = (ir_node **) 1; /* Space for array size. */
+
+ start = is_Block(n) ? 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. */
+ ir_node *pred = skip_Tuple(get_irn_n(n, i));
+ set_irn_n(n, i, pred);
+
+ /* count outs for successors */
+ if (irn_not_visited(pred))
+ res += _count_outs(pred);
+
+ /* Count my outs */
+ pred->out = (ir_node **)INT_TO_PTR(PTR_TO_INT(pred->out) + 1);
+ }
+ return res;