Print all dag nodes in a dag.

Dags can have multiple roots, so only recursing once could miss much of the
dag.
This commit is contained in:
Bill Currie 2012-07-18 16:03:08 +09:00
parent dbf1aa8f72
commit c57df8b5f3

View file

@ -99,5 +99,6 @@ void
print_dag (dstring_t *dstr, dagnode_t *dag)
{
print_count++;
print_node (dstr, dag);
for (; dag; dag = dag->next)
print_node (dstr, dag);
}