2 * Copyright (c) 1995-1997, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
6 * $Log: d1_prtree.c,v $
7 * Revision 1.2 1997-11-06 11:36:44 adam
8 * Implemented variant match on simple elements -data1 tree and Espec-1.
10 * Revision 1.1 1997/10/27 14:04:07 adam
11 * New debug utility, data1_pr_tree, that dumps a data1 tree.
18 static void pr_tree (data1_handle dh, data1_node *n, FILE *out, int level)
20 fprintf (out, "%*s", level, "");
24 fprintf (out, "root abstract syntax=%s\n", n->u.root.type);
27 fprintf (out, "tag type=%s\n", n->u.tag.tag);
30 fprintf (out, "data type=");
31 switch (n->u.data.what)
34 fprintf (out, "inctxt\n");
37 fprintf (out, "incbin\n");
40 fprintf (out, "text '%.*s'\n", n->u.data.len, n->u.data.data);
43 fprintf (out, "num\n");
46 fprintf (out, "oid\n");
49 fprintf (out, "unknown(%d)\n", n->u.data.what);
54 fprintf (out, "variant\n");
56 if (n->u.variant.type->name)
57 fprintf (out, " class=%s type=%d value=%s\n",
58 n->u.variant.type->name, n->u.variant.type->type,
63 fprintf (out, "unknown(%d)\n", n->which);
66 pr_tree (dh, n->child, out, level+4);
68 pr_tree (dh, n->next, out, level);
72 void data1_pr_tree (data1_handle dh, data1_node *n, FILE *out)
74 pr_tree (dh, n, out, 0);