From c57df8b5f3f043fdbfa6f01675e99e41a3132f6f Mon Sep 17 00:00:00 2001 From: Bill Currie Date: Wed, 18 Jul 2012 16:03:08 +0900 Subject: [PATCH] Print all dag nodes in a dag. Dags can have multiple roots, so only recursing once could miss much of the dag. --- tools/qfcc/source/dot_dag.c | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/tools/qfcc/source/dot_dag.c b/tools/qfcc/source/dot_dag.c index 67bdcf4ad..6f6a4d675 100644 --- a/tools/qfcc/source/dot_dag.c +++ b/tools/qfcc/source/dot_dag.c @@ -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); }