X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;f=retrieval%2Fd1_prtree.c;h=e5df6fe57f46c93728bbf938c8dc5ab0522203ea;hb=a9950f112b740bd1b6a2ccf20a584995608d26d6;hp=1607a2e35c1fe9cfc4b24fea2dc5da5c258417e8;hpb=bc6408d690659dbefebbbde30e284962aeee6e24;p=yaz-moved-to-github.git

diff --git a/retrieval/d1_prtree.c b/retrieval/d1_prtree.c
index 1607a2e..e5df6fe 100644
--- a/retrieval/d1_prtree.c
+++ b/retrieval/d1_prtree.c
@@ -1,66 +1,98 @@
 /*
- * Copyright (c) 1995-1997, Index Data.
+ * Copyright (c) 1995-2002, Index Data.
  * See the file LICENSE for details.
  * Sebastian Hammer, Adam Dickmeiss
  *
- * $Log: d1_prtree.c,v $
- * Revision 1.1  1997-10-27 14:04:07  adam
- * New debug utility, data1_pr_tree, that dumps a data1 tree.
- *
+ * $Id: d1_prtree.c,v 1.7 2002-01-26 19:20:25 adam Exp $
  */
 
-#include <log.h>
-#include <data1.h>
+#include <yaz/log.h>
+#include <yaz/data1.h>
+
+static void pr_string (FILE *out, const char *str, int len)
+{
+    int i;
+    for (i = 0; i<len; i++)
+    {
+	int c = str[i];
+	if (c < 32 || c >126)
+	    fprintf (out, "\\x%02x", c);
+	else
+	    fputc (c, out);
+    }
+}
 
 static void pr_tree (data1_handle dh, data1_node *n, FILE *out, int level)
 {
-     fprintf (out, "%*s", level, "");
-     switch (n->which)
-     {
+    fprintf (out, "%*s", level, "");
+    switch (n->which)
+    {
      case DATA1N_root:
          fprintf (out, "root abstract syntax=%s\n", n->u.root.type);
          break;
-     case DATA1N_tag:
-         fprintf (out, "tag type=%s\n", n->u.tag.tag);
-         break;
-     case DATA1N_data:
-         fprintf (out, "data type=");
-         switch (n->u.data.what)
-         {
-         case DATA1I_inctxt:
-             fprintf (out, "inctxt\n");
-             break;
-         case DATA1I_incbin:
-             fprintf (out, "incbin\n");
-             break;
-         case DATA1I_text:
-             fprintf (out, "text '%.*s'\n", n->u.data.len, n->u.data.data);
-             break;
-         case DATA1I_num:
-             fprintf (out, "num\n");
-             break;
-         case DATA1I_oid:
-             fprintf (out, "oid\n");
-             break;
-         default:
-             fprintf (out, "unknown(%d)\n", n->u.data.what);
-             break;
-         }
-         break;
-     case DATA1N_variant:
-         fprintf (out, "variant\n");
-         break;
-     default:
-         fprintf (out, "unknown(%d)\n", n->which);
-     }
-     if (n->child)
-         pr_tree (dh, n->child, out, level+4);
-     if (n->next)
-         pr_tree (dh, n->next, out, level);
+    case DATA1N_tag:
+	fprintf (out, "tag type=%s\n", n->u.tag.tag);
+#if DATA1_USING_XATTR
+        if (n->u.tag.attributes)
+        {
+            data1_xattr *xattr = n->u.tag.attributes;
+            fprintf (out, "%*s attr", level, "");
+            for (; xattr; xattr = xattr->next)
+                fprintf (out, " %s=%s ", xattr->name, xattr->value);
+            fprintf (out, "\n");
+        }
+#endif
+	break;
+    case DATA1N_data:
+	fprintf (out, "data type=");
+	switch (n->u.data.what)
+	{
+	case DATA1I_inctxt:
+	    fprintf (out, "inctxt\n");
+	    break;
+	case DATA1I_incbin:
+	    fprintf (out, "incbin\n");
+	    break;
+	case DATA1I_text:
+	    fprintf (out, "text '");
+	    pr_string (out, n->u.data.data, n->u.data.len);
+	    fprintf (out, "'\n");
+	    break;
+	case DATA1I_num:
+	    fprintf (out, "num '");
+	    pr_string (out, n->u.data.data, n->u.data.len);
+	    fprintf (out, "'\n");
+	    break;
+	case DATA1I_oid:
+	    fprintf (out, "oid '");
+	    pr_string (out, n->u.data.data, n->u.data.len);
+	    fprintf (out, "'\n");
+	    break;
+	default:
+	    fprintf (out, "unknown(%d)\n", n->u.data.what);
+	    break;
+	}
+	break;
+    case DATA1N_variant:
+	fprintf (out, "variant\n");
+#if 0
+	if (n->u.variant.type->name)
+	    fprintf (out, " class=%s type=%d value=%s\n",
+		     n->u.variant.type->name, n->u.variant.type->type,
+		     n->u.variant.value);
+#endif
+	break;
+    default:
+	fprintf (out, "unknown(%d)\n", n->which);
+    }
+    if (n->child)
+	pr_tree (dh, n->child, out, level+4);
+    if (n->next)
+	pr_tree (dh, n->next, out, level);
 }
 
 
 void data1_pr_tree (data1_handle dh, data1_node *n, FILE *out)
 {
-     pr_tree (dh, n, out, 0);
+    pr_tree (dh, n, out, 0);
 }