2 * Copyright (c) 1995-1998, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
6 * $Log: d1_prtree.c,v $
7 * Revision 1.3 1998-02-27 14:05:34 adam
8 * Added printing of integer nodes.
10 * Revision 1.2 1997/11/06 11:36:44 adam
11 * Implemented variant match on simple elements -data1 tree and Espec-1.
13 * Revision 1.1 1997/10/27 14:04:07 adam
14 * New debug utility, data1_pr_tree, that dumps a data1 tree.
21 static void pr_tree (data1_handle dh, data1_node *n, FILE *out, int level)
23 fprintf (out, "%*s", level, "");
27 fprintf (out, "root abstract syntax=%s\n", n->u.root.type);
30 fprintf (out, "tag type=%s\n", n->u.tag.tag);
33 fprintf (out, "data type=");
34 switch (n->u.data.what)
37 fprintf (out, "inctxt\n");
40 fprintf (out, "incbin\n");
43 fprintf (out, "text '%.*s'\n", n->u.data.len, n->u.data.data);
46 fprintf (out, "num %.*s\n", n->u.data.len, n->u.data.data);
49 fprintf (out, "oid\n");
52 fprintf (out, "unknown(%d)\n", n->u.data.what);
57 fprintf (out, "variant\n");
59 if (n->u.variant.type->name)
60 fprintf (out, " class=%s type=%d value=%s\n",
61 n->u.variant.type->name, n->u.variant.type->type,
66 fprintf (out, "unknown(%d)\n", n->which);
69 pr_tree (dh, n->child, out, level+4);
71 pr_tree (dh, n->next, out, level);
75 void data1_pr_tree (data1_handle dh, data1_node *n, FILE *out)
77 pr_tree (dh, n, out, 0);