Figured out some meanings for category data.

[pspp] / dump.c

diff --git a/dump.c b/dump.c
index 65955d81995b16e50c631e430ee33fe95cf485d1..e9a068699e005fba3778c5597181c93d0f8a6d4a 100644 (file)
--- a/dump.c
+++ b/dump.c
@@ -569,38 +569,41 @@ check_permutation(int *a, int n, const char *name)
 }
 
 static void
-dump_category(int level, int *indexes, int *n_indexes, int max_indexes)
+dump_category(FILE *stream, int level, int *indexes, int *n_indexes, int max_indexes)
 {
   for (int i = 0; i <= level; i++)
-    fprintf (stdout, "    ");
+    fprintf (stream, "    ");
   printf ("<category>\n");
-  dump_value (stdout, level + 1);
+  dump_value (stream, level + 1);
 
-  int start = pos;
-  int d0 = data[pos];
-  match_byte(1);
-  int c = 0;
-  c += match_byte(0);
-  c += match_byte(0);
-  c += match_byte(0);
-
-  int d1 = data[pos];
-  int d2 = 9;
-  if (match_byte (1))
-    {
-      d2 = data[pos];
-      if (!match_u32 (0) && !match_u32 (1))
-        match_u32_assert (2);
-    }
-  else
+  int merge = data[pos];
+  if (!match_byte(0))
+    match_byte_assert (1);
+  match_byte_assert (0);
+  int unindexed = data[pos];
+  if (!match_byte(0))
+    match_byte_assert (1);
+  if (!match_u32 (0))
     match_u32_assert (2);
-  int len = pos - start;
 
   int indx = get_u32();
   int n_categories = get_u32();
-  if (indx != -1)
+  if (indx == -1)
+    {
+      if (merge)
+        {
+          for (int i = 0; i <= level + 1; i++)
+            fprintf (stream, "    ");
+          fprintf (stream, "<merge/>\n");
+        }
+    }
+  else
     {
-      fprintf (stderr, "category %d %d %d %d %d:", d0, c, d1, d2, len);
+      if (merge)
+        {
+          fprintf(stderr, "index not -1 but merged\n");
+          exit(1);
+        }
       if (n_categories != 0)
         {
           fprintf(stderr, "index not -1 but subcategories\n");
@@ -613,22 +616,25 @@ dump_category(int level, int *indexes, int *n_indexes, int max_indexes)
         }
       indexes[(*n_indexes)++] = indx;
     }
-  else
-    fprintf (stderr, "group    %d %d %d %d %d:", d0, c, d1, d2, len);
-  for (int i = 0; i < len; i++)
-    fprintf (stderr, " %02x", data[start + i]);
-  putc ('\n', stderr);
+
+  int expected_unindexed = indx == -1;
+  if (unindexed != expected_unindexed)
+    {
+      fprintf(stderr, "unindexed (%d) mismatch with indx (%d)\n",
+              unindexed, indx);
+      exit(1);
+    }
 
   if (n_categories == 0)
     {
       for (int i = 0; i <= level + 1; i++)
-        fprintf (stdout, "    ");
-      fprintf (stdout, "<category-index>%d</category-index>\n", indx);
+        fprintf (stream, "    ");
+      fprintf (stream, "<category-index>%d</category-index>\n", indx);
     }
   for (int i = 0; i < n_categories; i++)
-    dump_category (level + 1, indexes, n_indexes, max_indexes);
+    dump_category (stream, level + 1, indexes, n_indexes, max_indexes);
   for (int i = 0; i <= level; i++)
-    fprintf (stdout, "    ");
+    fprintf (stream, "    ");
   printf ("</category>\n");
 }
 
@@ -659,7 +665,7 @@ dump_dim(int indx)
   int indexes[2048];
   int n_indexes = 0;
   for (int i = 0; i < n_categories; i++)
-    dump_category (0, indexes, &n_indexes, sizeof indexes / sizeof *indexes);
+    dump_category (stdout, 0, indexes, &n_indexes, sizeof indexes / sizeof *indexes);
   check_permutation(indexes, n_indexes, "categories");
 
   fprintf (stdout, "</dimension>\n");