/* Code style: -*- linux-c -*- */
/* File : xfw/find/display.c */
/* this program is simply to use recursion to dump out the linked list */
/* generated by the network tree build */
printf("Curr node out [0] = 0x%x\n", curr_node->out[0]);
printf("Curr node out [1] = 0x%x\n", curr_node->out[1]);
printf("Curr node out [2] = 0x%x\n", curr_node->out[2]);
printf("Curr node out [3] = 0x%x\n", curr_node->out[3]);
printf("Curr node out [4] = 0x%x\n", curr_node->out[4]);
for (list = 0 ; list < MAXROUTER; list++) {
printf("list in loop is %d\n", list);
if (curr_node->out[list] == NULL) return; /* jump out! another naughty */