2 * Copyright (c) 1995-2002, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
6 * $Id: d1_read.c,v 1.51 2002-08-28 07:54:11 adam Exp $
13 #include <yaz/xmalloc.h>
14 #include <yaz/yaz-util.h>
16 #include <yaz/data1.h>
18 data1_node *data1_get_root_tag (data1_handle dh, data1_node *n)
22 if (data1_is_xmlmode(dh))
25 while (n && n->which != DATA1N_tag)
32 * get the tag which is the immediate parent of this node (this may mean
33 * traversing intermediate things like variants and stuff.
35 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
37 if (data1_is_xmlmode(dh))
39 for (; n && n->which != DATA1N_root; n = n->parent)
40 if (n->which == DATA1N_tag && n->parent &&
41 n->parent->which != DATA1N_root)
46 for (; n && n->which != DATA1N_root; n = n->parent)
47 if (n->which == DATA1N_tag)
53 data1_node *data1_mk_node (data1_handle dh, NMEM m)
55 return data1_mk_node2 (dh, m, DATA1N_root, 0);
58 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
60 return data1_mk_node2 (dh, m, type, 0);
63 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
68 r = (data1_node *)nmem_malloc(m, sizeof(*r));
69 r->next = r->child = r->last_child = 0;
78 r->root = parent->root;
81 parent->child = parent->last_child = r;
83 parent->last_child->next = r;
84 parent->last_child = r;
92 r->u.tag.no_data_requested = 0;
93 r->u.tag.node_selected = 0;
94 r->u.tag.make_variantlist = 0;
95 r->u.tag.get_bytes = -1;
96 r->u.tag.attributes = 0;
106 r->u.data.formatted_text = 0;
112 r->u.data.formatted_text = 1;
115 r->u.variant.type = 0;
116 r->u.variant.value = 0;
118 case DATA1N_preprocess:
119 r->u.preprocess.target = 0;
120 r->u.preprocess.attributes = 0;
123 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
128 void data1_free_tree (data1_handle dh, data1_node *t)
130 data1_node *p = t->child, *pn;
135 data1_free_tree (dh, p);
142 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
144 data1_absyn *absyn = data1_get_absyn (dh, name);
148 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
150 /* It's now OK for a record not to have an absyn */
152 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
153 res->u.root.type = data1_insert_string (dh, res, nmem, name);
154 res->u.root.absyn = absyn;
158 void data1_set_root(data1_handle dh, data1_node *res,
159 NMEM nmem, const char *name)
161 data1_absyn *absyn = data1_get_absyn (dh, name);
163 res->u.root.type = data1_insert_string (dh, res, nmem, name);
164 res->u.root.absyn = absyn;
167 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
168 const char *target, const char **attr,
172 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
173 res->u.preprocess.target = data1_insert_string (dh, res, nmem, target);
175 p = &res->u.preprocess.attributes;
176 while (attr && *attr)
178 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
179 (*p)->name = nmem_strdup (nmem, *attr++);
180 (*p)->value = nmem_strdup (nmem, *attr++);
187 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
188 const char *tag, size_t len, const char **attr,
191 data1_node *partag = get_parent_tag(dh, at);
192 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
194 data1_element *e = 0;
196 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
198 if (!partag) /* top tag? */
199 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
200 0 /* index as local */,
204 /* only set element for known tags */
205 e = partag->u.tag.element;
207 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
210 res->u.tag.element = e;
211 p = &res->u.tag.attributes;
212 while (attr && *attr)
214 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
215 (*p)->name = nmem_strdup (nmem, *attr++);
216 (*p)->value = nmem_strdup (nmem, *attr++);
223 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
224 data1_node *res, const char **attr)
228 if (res->which != DATA1N_tag)
231 p = &res->u.tag.attributes;
235 while (attr && *attr)
237 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
238 (*p)->name = nmem_strdup (nmem, *attr++);
239 (*p)->value = nmem_strdup (nmem, *attr++);
245 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
246 const char *tag, const char **attr, data1_node *at)
248 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
251 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
256 n = data1_get_root_tag (dh, n);
261 for (; n; n = n->next)
262 if (n->which == DATA1N_tag && n->u.tag.tag &&
263 !yaz_matchstr (tag, n->u.tag.tag))
270 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
271 const char *tag, data1_node *at)
273 data1_node *node = data1_search_tag (dh, at->child, tag);
275 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
277 node->child = node->last_child = 0;
281 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
282 const char *buf, size_t len, data1_node *parent)
284 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
285 res->u.data.what = DATA1I_text;
286 res->u.data.len = len;
288 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
292 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
293 const char *buf, size_t len, data1_node *parent)
295 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
296 res->u.data.formatted_text = 1;
300 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
301 const char *buf, data1_node *parent)
303 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
306 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
307 const char *buf, size_t len,
310 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
311 res->u.data.what = DATA1I_text;
312 res->u.data.len = len;
314 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
318 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
319 const char *buf, data1_node *parent)
321 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
324 char *data1_insert_string_n (data1_handle dh, data1_node *res,
325 NMEM m, const char *str, size_t len)
328 if (len >= DATA1_LOCALDATA)
329 b = nmem_malloc (m, len+1);
332 memcpy (b, str, len);
337 char *data1_insert_string (data1_handle dh, data1_node *res,
338 NMEM m, const char *str)
340 return data1_insert_string_n (dh, res, m, str, strlen(str));
343 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
345 const char *tagname, NMEM m,
348 data1_node *root = at->root;
349 data1_node *partag = get_parent_tag (dh, at);
350 data1_element *e = NULL;
351 data1_node *datn = 0;
352 data1_node *tagn = 0;
355 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
358 e = partag->u.tag.element;
360 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
362 if (local_allowed || e)
364 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
365 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
366 tagn->u.tag.element = e;
367 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
372 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
373 const char *tagname, NMEM m)
375 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
380 * Insert a tagged node into the record root as first child of the node at
381 * which should be root or tag itself). Returns pointer to the data node,
382 * which can then be modified.
384 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
385 const char *tagname, NMEM m)
387 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
390 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
391 data1_node *at, const char *tagname,
394 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
397 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
398 data1_node *at, const char *tagname,
401 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
404 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
405 const char *tag, int num,
408 data1_node *node_data;
410 node_data = data1_mk_tag_data (dh, at, tag, nmem);
413 node_data->u.data.what = DATA1I_num;
414 node_data->u.data.data = node_data->lbuf;
415 sprintf (node_data->u.data.data, "%d", num);
416 node_data->u.data.len = strlen (node_data->u.data.data);
420 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
421 const char *tag, Odr_oid *oid,
424 data1_node *node_data;
425 char str[128], *p = str;
428 node_data = data1_mk_tag_data (dh, at, tag, nmem);
432 for (ii = oid; *ii >= 0; ii++)
436 sprintf (p, "%d", *ii);
439 node_data->u.data.what = DATA1I_oid;
440 node_data->u.data.len = strlen (str);
441 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
446 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
447 const char *tag, const char *str,
450 data1_node *node_data;
452 node_data = data1_mk_tag_data (dh, at, tag, nmem);
455 node_data->u.data.what = DATA1I_text;
456 node_data->u.data.len = strlen (str);
457 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
462 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
463 const char *tag, const char *str,
466 data1_node *node = data1_search_tag (dh, at->child, tag);
468 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
471 data1_node *node_data = node->child;
472 node_data->u.data.what = DATA1I_text;
473 node_data->u.data.len = strlen (str);
474 node_data->u.data.data = data1_insert_string (dh, node_data,
476 node_data->child = node_data->last_child = 0;
481 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
483 int c = (*get_byte)(fh);
498 if (!strcmp (ent, "quot"))
500 if (!strcmp (ent, "apos"))
502 if (!strcmp (ent, "gt"))
504 if (!strcmp (ent, "lt"))
506 if (!strcmp (ent, "amp"))
511 else if (c == 0 || d1_isspace(c))
520 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
521 int (*get_byte)(void *fh), void *fh,
522 WRBUF wrbuf, int *ch, int *amp)
524 data1_xattr *p_first = 0;
525 data1_xattr **pp = &p_first;
531 while (*amp || (c && d1_isspace(c)))
532 c = ampr (get_byte, fh, amp);
533 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
535 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
541 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
543 wrbuf_putc (wrbuf, c);
544 c = ampr (get_byte, fh, amp);
546 wrbuf_putc (wrbuf, '\0');
547 len = wrbuf_len(wrbuf);
548 p->name = (char*) nmem_malloc (m, len);
549 strcpy (p->name, wrbuf_buf(wrbuf));
552 c = ampr (get_byte, fh, amp);
553 if (*amp == 0 && c == '"')
555 c = ampr (get_byte, fh, amp);
557 while (*amp || (c && c != '"'))
559 wrbuf_putc (wrbuf, c);
560 c = ampr (get_byte, fh, amp);
563 c = ampr (get_byte, fh, amp);
565 else if (*amp == 0 && c == '\'')
567 c = ampr (get_byte, fh, amp);
569 while (*amp || (c && c != '\''))
571 wrbuf_putc (wrbuf, c);
572 c = ampr (get_byte, fh, amp);
575 c = ampr (get_byte, fh, amp);
580 while (*amp || (c && c != '>' && c != '/'))
582 wrbuf_putc (wrbuf, c);
583 c = ampr (get_byte, fh, amp);
586 wrbuf_putc (wrbuf, '\0');
587 len = wrbuf_len(wrbuf);
588 p->value = (char*) nmem_malloc (m, len);
589 strcpy (p->value, wrbuf_buf(wrbuf));
597 * Ugh. Sometimes functions just grow and grow on you. This one reads a
598 * 'node' and its children.
600 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
601 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
603 data1_node *d1_stack[256];
610 c = ampr (get_byte, fh, &);
613 data1_node *parent = level ? d1_stack[level-1] : 0;
615 if (amp == 0 && c == '<') /* beginning of tag */
625 c = ampr (get_byte, fh, &);
626 if (amp == 0 && c == '/')
629 c = ampr (get_byte, fh, &);
631 else if (amp == 0 && c == '!')
632 /* tags/comments that we don't deal with yet */
634 while (amp || (c && c != '>'))
635 c = ampr (get_byte, fh, &);
637 c = ampr (get_byte, fh, &);
640 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
642 if (i < (sizeof(tag)-1))
644 c = ampr (get_byte, fh, &);
647 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
649 if (amp == 0 && c == '/')
650 { /* <tag attrs/> or <tag/> */
652 c = ampr (get_byte, fh, &);
656 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
660 c = ampr (get_byte, fh, &);
672 parent = d1_stack[--i];
673 if ((parent->which == DATA1N_root &&
674 !strcmp(tag, parent->u.root.type)) ||
675 (parent->which == DATA1N_tag &&
676 !strcmp(tag, parent->u.tag.tag)))
684 yaz_log (LOG_WARN, "%d: no begin tag for %s",
689 if (data1_is_xmlmode(dh))
701 else if (!strcmp(tag, "var"))
703 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
707 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
709 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
713 data1_getvartypebyct(dh,
714 parent->root->u.root.absyn->varset,
718 * If we're the first variant in this group, create a parent
719 * variant, and insert it before the current variant.
721 if (parent->which != DATA1N_variant)
723 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
728 * now determine if one of our ancestor triples is of
729 * same type. If so, we break here.
732 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
733 if (d1_stack[i]->u.variant.type == tp)
738 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
739 res->u.variant.type = tp;
740 res->u.variant.value =
741 data1_insert_string (dh, res, m, args + val_offset);
747 /* tag .. acquire our element in the abstract syntax */
750 parent = data1_mk_root (dh, m, tag);
751 res = d1_stack[level] = parent;
753 if (data1_is_xmlmode(dh))
756 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
757 res->u.tag.attributes = xattr;
762 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
763 res->u.tag.attributes = xattr;
766 d1_stack[level] = res;
767 d1_stack[level+1] = 0;
768 if (level < 250 && !null_tag)
771 else /* != '<'... this is a body of text */
777 c = ampr (get_byte, fh, &);
780 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
781 res->u.data.what = DATA1I_text;
782 res->u.data.formatted_text = 0;
783 d1_stack[level] = res;
787 while (amp || (c && c != '<'))
789 wrbuf_putc (wrbuf, c);
790 c = ampr (get_byte, fh, &);
792 len = wrbuf_len(wrbuf);
794 /* use local buffer of nmem if too large */
795 if (len >= DATA1_LOCALDATA)
796 res->u.data.data = (char*) nmem_malloc (m, len);
798 res->u.data.data = res->lbuf;
801 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
803 res->u.data.data = 0;
804 res->u.data.len = len;
810 int getc_mem (void *fh)
812 const char **p = (const char **) fh;
818 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
820 WRBUF wrbuf = wrbuf_alloc();
823 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
824 wrbuf_free (wrbuf, 1);
829 * Read a record in the native syntax.
831 data1_node *data1_read_record(data1_handle dh,
832 int (*rf)(void *, char *, size_t), void *fh,
836 char **buf = data1_get_read_buf (dh, &size);
841 *buf = (char *)xmalloc(*size = 4096);
845 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
847 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
853 return data1_read_node(dh, &bp, m);
862 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
864 const char *bp = buf;
865 return data1_read_node (dh, &bp, m);
869 static int conv_item (NMEM m, yaz_iconv_t t,
870 WRBUF wrbuf, char *inbuf, size_t inlen)
872 wrbuf_rewind (wrbuf);
873 if (wrbuf->size < 10)
874 wrbuf_grow (wrbuf, 10);
877 char *outbuf = wrbuf->buf + wrbuf->pos;
878 size_t outlen = wrbuf->size - wrbuf->pos;
879 if (yaz_iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
880 (size_t)(-1) && yaz_iconv_error(t) != YAZ_ICONV_E2BIG)
882 /* bad data. stop and skip conversion entirely */
886 { /* finished converting */
887 wrbuf->pos = wrbuf->size - outlen;
892 /* buffer too small: make sure we expand buffer */
893 wrbuf->pos = wrbuf->size - outlen;
894 wrbuf_grow(wrbuf, 20);
900 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
901 yaz_iconv_t t, WRBUF wrbuf, const char *tocode)
903 for (; n; n = n->next)
909 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
912 data1_insert_string_n (dh, n, m, wrbuf->buf,
914 n->u.data.len = wrbuf->pos;
918 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
922 data1_insert_string_n (dh, n, m,
923 wrbuf->buf, wrbuf->pos);
925 if (n->u.tag.attributes)
928 for (p = n->u.tag.attributes; p; p = p->next)
931 conv_item(m, t, wrbuf, p->value, strlen(p->value))
934 wrbuf_puts (wrbuf, "");
935 p->value = nmem_strdup (m, wrbuf->buf);
940 case DATA1N_preprocess:
941 if (strcmp(n->u.preprocess.target, "xml") == 0)
943 data1_xattr *p = n->u.preprocess.attributes;
944 for (; p; p = p->next)
945 if (strcmp (p->name, "encoding") == 0)
946 p->value = nmem_strdup (m, tocode);
950 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
954 const char *data1_get_encoding (data1_handle dh, data1_node *n)
956 /* see if we have an xml header that specifies encoding */
957 if (n && n->child && n->child->which == DATA1N_preprocess &&
958 strcmp (n->child->u.preprocess.target, "xml") == 0)
960 data1_xattr *xp = n->child->u.preprocess.attributes;
961 for (; xp; xp = xp->next)
962 if (!strcmp (xp->name, "encoding") == 0)
965 /* no encoding in header, so see if "encoding" was specified for abs */
966 if (n && n->which == DATA1N_root &&
967 n->u.root.absyn && n->u.root.absyn->encoding)
968 return n->u.root.absyn->encoding;
969 /* none of above, return a hard coded default */
973 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
975 const char *fromcode)
977 if (strcmp (tocode, fromcode))
979 WRBUF wrbuf = wrbuf_alloc();
980 yaz_iconv_t t = yaz_iconv_open (tocode, fromcode);
983 data1_iconv_s (dh, m, n, t, wrbuf, tocode);
985 wrbuf_free (wrbuf, 1);