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.50 2002-08-26 10:43:52 adam Exp $
19 #include <yaz/xmalloc.h>
21 #include <yaz/data1.h>
23 data1_node *data1_get_root_tag (data1_handle dh, data1_node *n)
27 if (data1_is_xmlmode(dh))
30 while (n && n->which != DATA1N_tag)
37 * get the tag which is the immediate parent of this node (this may mean
38 * traversing intermediate things like variants and stuff.
40 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
42 if (data1_is_xmlmode(dh))
44 for (; n && n->which != DATA1N_root; n = n->parent)
45 if (n->which == DATA1N_tag && n->parent &&
46 n->parent->which != DATA1N_root)
51 for (; n && n->which != DATA1N_root; n = n->parent)
52 if (n->which == DATA1N_tag)
58 data1_node *data1_mk_node (data1_handle dh, NMEM m)
60 return data1_mk_node2 (dh, m, DATA1N_root, 0);
63 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
65 return data1_mk_node2 (dh, m, type, 0);
68 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
73 r = (data1_node *)nmem_malloc(m, sizeof(*r));
74 r->next = r->child = r->last_child = 0;
83 r->root = parent->root;
86 parent->child = parent->last_child = r;
88 parent->last_child->next = r;
89 parent->last_child = r;
97 r->u.tag.no_data_requested = 0;
98 r->u.tag.node_selected = 0;
99 r->u.tag.make_variantlist = 0;
100 r->u.tag.get_bytes = -1;
101 r->u.tag.attributes = 0;
111 r->u.data.formatted_text = 0;
117 r->u.data.formatted_text = 1;
120 r->u.variant.type = 0;
121 r->u.variant.value = 0;
123 case DATA1N_preprocess:
124 r->u.preprocess.target = 0;
125 r->u.preprocess.attributes = 0;
128 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
133 void data1_free_tree (data1_handle dh, data1_node *t)
135 data1_node *p = t->child, *pn;
140 data1_free_tree (dh, p);
147 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
149 data1_absyn *absyn = data1_get_absyn (dh, name);
153 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
155 /* It's now OK for a record not to have an absyn */
157 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
158 res->u.root.type = data1_insert_string (dh, res, nmem, name);
159 res->u.root.absyn = absyn;
163 void data1_set_root(data1_handle dh, data1_node *res,
164 NMEM nmem, const char *name)
166 data1_absyn *absyn = data1_get_absyn (dh, name);
168 res->u.root.type = data1_insert_string (dh, res, nmem, name);
169 res->u.root.absyn = absyn;
172 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
173 const char *target, const char **attr,
177 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
178 res->u.preprocess.target = data1_insert_string (dh, res, nmem, target);
180 p = &res->u.preprocess.attributes;
181 while (attr && *attr)
183 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
184 (*p)->name = nmem_strdup (nmem, *attr++);
185 (*p)->value = nmem_strdup (nmem, *attr++);
192 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
193 const char *tag, size_t len, const char **attr,
196 data1_node *partag = get_parent_tag(dh, at);
197 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
199 data1_element *e = 0;
201 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
203 if (!partag) /* top tag? */
204 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
205 0 /* index as local */,
209 /* only set element for known tags */
210 e = partag->u.tag.element;
212 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
215 res->u.tag.element = e;
216 p = &res->u.tag.attributes;
217 while (attr && *attr)
219 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
220 (*p)->name = nmem_strdup (nmem, *attr++);
221 (*p)->value = nmem_strdup (nmem, *attr++);
228 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
229 data1_node *res, const char **attr)
233 if (res->which != DATA1N_tag)
236 p = &res->u.tag.attributes;
240 while (attr && *attr)
242 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
243 (*p)->name = nmem_strdup (nmem, *attr++);
244 (*p)->value = nmem_strdup (nmem, *attr++);
250 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
251 const char *tag, const char **attr, data1_node *at)
253 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
256 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
261 n = data1_get_root_tag (dh, n);
266 for (; n; n = n->next)
267 if (n->which == DATA1N_tag && n->u.tag.tag &&
268 !yaz_matchstr (tag, n->u.tag.tag))
275 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
276 const char *tag, data1_node *at)
278 data1_node *node = data1_search_tag (dh, at->child, tag);
280 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
282 node->child = node->last_child = 0;
286 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
287 const char *buf, size_t len, data1_node *parent)
289 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
290 res->u.data.what = DATA1I_text;
291 res->u.data.len = len;
293 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
297 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
298 const char *buf, size_t len, data1_node *parent)
300 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
301 res->u.data.formatted_text = 1;
305 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
306 const char *buf, data1_node *parent)
308 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
311 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
312 const char *buf, size_t len,
315 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
316 res->u.data.what = DATA1I_text;
317 res->u.data.len = len;
319 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
323 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
324 const char *buf, data1_node *parent)
326 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
329 char *data1_insert_string_n (data1_handle dh, data1_node *res,
330 NMEM m, const char *str, size_t len)
333 if (len >= DATA1_LOCALDATA)
334 b = nmem_malloc (m, len+1);
337 memcpy (b, str, len);
342 char *data1_insert_string (data1_handle dh, data1_node *res,
343 NMEM m, const char *str)
345 return data1_insert_string_n (dh, res, m, str, strlen(str));
348 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
350 const char *tagname, NMEM m,
353 data1_node *root = at->root;
354 data1_node *partag = get_parent_tag (dh, at);
355 data1_element *e = NULL;
356 data1_node *datn = 0;
357 data1_node *tagn = 0;
360 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
363 e = partag->u.tag.element;
365 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
367 if (local_allowed || e)
369 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
370 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
371 tagn->u.tag.element = e;
372 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
377 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
378 const char *tagname, NMEM m)
380 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
385 * Insert a tagged node into the record root as first child of the node at
386 * which should be root or tag itself). Returns pointer to the data node,
387 * which can then be modified.
389 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
390 const char *tagname, NMEM m)
392 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
395 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
396 data1_node *at, const char *tagname,
399 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
402 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
403 data1_node *at, const char *tagname,
406 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
409 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
410 const char *tag, int num,
413 data1_node *node_data;
415 node_data = data1_mk_tag_data (dh, at, tag, nmem);
418 node_data->u.data.what = DATA1I_num;
419 node_data->u.data.data = node_data->lbuf;
420 sprintf (node_data->u.data.data, "%d", num);
421 node_data->u.data.len = strlen (node_data->u.data.data);
425 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
426 const char *tag, Odr_oid *oid,
429 data1_node *node_data;
430 char str[128], *p = str;
433 node_data = data1_mk_tag_data (dh, at, tag, nmem);
437 for (ii = oid; *ii >= 0; ii++)
441 sprintf (p, "%d", *ii);
444 node_data->u.data.what = DATA1I_oid;
445 node_data->u.data.len = strlen (str);
446 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
451 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
452 const char *tag, const char *str,
455 data1_node *node_data;
457 node_data = data1_mk_tag_data (dh, at, tag, nmem);
460 node_data->u.data.what = DATA1I_text;
461 node_data->u.data.len = strlen (str);
462 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
467 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
468 const char *tag, const char *str,
471 data1_node *node = data1_search_tag (dh, at->child, tag);
473 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
476 data1_node *node_data = node->child;
477 node_data->u.data.what = DATA1I_text;
478 node_data->u.data.len = strlen (str);
479 node_data->u.data.data = data1_insert_string (dh, node_data,
481 node_data->child = node_data->last_child = 0;
486 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
488 int c = (*get_byte)(fh);
503 if (!strcmp (ent, "quot"))
505 if (!strcmp (ent, "apos"))
507 if (!strcmp (ent, "gt"))
509 if (!strcmp (ent, "lt"))
511 if (!strcmp (ent, "amp"))
516 else if (c == 0 || d1_isspace(c))
525 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
526 int (*get_byte)(void *fh), void *fh,
527 WRBUF wrbuf, int *ch, int *amp)
529 data1_xattr *p_first = 0;
530 data1_xattr **pp = &p_first;
536 while (*amp || (c && d1_isspace(c)))
537 c = ampr (get_byte, fh, amp);
538 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
540 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
546 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
548 wrbuf_putc (wrbuf, c);
549 c = ampr (get_byte, fh, amp);
551 wrbuf_putc (wrbuf, '\0');
552 len = wrbuf_len(wrbuf);
553 p->name = (char*) nmem_malloc (m, len);
554 strcpy (p->name, wrbuf_buf(wrbuf));
557 c = ampr (get_byte, fh, amp);
558 if (*amp == 0 && c == '"')
560 c = ampr (get_byte, fh, amp);
562 while (*amp || (c && c != '"'))
564 wrbuf_putc (wrbuf, c);
565 c = ampr (get_byte, fh, amp);
568 c = ampr (get_byte, fh, amp);
570 else if (*amp == 0 && c == '\'')
572 c = ampr (get_byte, fh, amp);
574 while (*amp || (c && c != '\''))
576 wrbuf_putc (wrbuf, c);
577 c = ampr (get_byte, fh, amp);
580 c = ampr (get_byte, fh, amp);
585 while (*amp || (c && c != '>' && c != '/'))
587 wrbuf_putc (wrbuf, c);
588 c = ampr (get_byte, fh, amp);
591 wrbuf_putc (wrbuf, '\0');
592 len = wrbuf_len(wrbuf);
593 p->value = (char*) nmem_malloc (m, len);
594 strcpy (p->value, wrbuf_buf(wrbuf));
602 * Ugh. Sometimes functions just grow and grow on you. This one reads a
603 * 'node' and its children.
605 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
606 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
608 data1_node *d1_stack[256];
615 c = ampr (get_byte, fh, &);
618 data1_node *parent = level ? d1_stack[level-1] : 0;
620 if (amp == 0 && c == '<') /* beginning of tag */
630 c = ampr (get_byte, fh, &);
631 if (amp == 0 && c == '/')
634 c = ampr (get_byte, fh, &);
636 else if (amp == 0 && c == '!')
637 /* tags/comments that we don't deal with yet */
639 while (amp || (c && c != '>'))
640 c = ampr (get_byte, fh, &);
642 c = ampr (get_byte, fh, &);
645 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
647 if (i < (sizeof(tag)-1))
649 c = ampr (get_byte, fh, &);
652 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
654 if (amp == 0 && c == '/')
655 { /* <tag attrs/> or <tag/> */
657 c = ampr (get_byte, fh, &);
661 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
665 c = ampr (get_byte, fh, &);
677 parent = d1_stack[--i];
678 if ((parent->which == DATA1N_root &&
679 !strcmp(tag, parent->u.root.type)) ||
680 (parent->which == DATA1N_tag &&
681 !strcmp(tag, parent->u.tag.tag)))
689 yaz_log (LOG_WARN, "%d: no begin tag for %s",
694 if (data1_is_xmlmode(dh))
706 else if (!strcmp(tag, "var"))
708 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
712 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
714 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
718 data1_getvartypebyct(dh,
719 parent->root->u.root.absyn->varset,
723 * If we're the first variant in this group, create a parent
724 * variant, and insert it before the current variant.
726 if (parent->which != DATA1N_variant)
728 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
733 * now determine if one of our ancestor triples is of
734 * same type. If so, we break here.
737 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
738 if (d1_stack[i]->u.variant.type == tp)
743 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
744 res->u.variant.type = tp;
745 res->u.variant.value =
746 data1_insert_string (dh, res, m, args + val_offset);
752 /* tag .. acquire our element in the abstract syntax */
755 parent = data1_mk_root (dh, m, tag);
756 res = d1_stack[level] = parent;
758 if (data1_is_xmlmode(dh))
761 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
762 res->u.tag.attributes = xattr;
767 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
768 res->u.tag.attributes = xattr;
771 d1_stack[level] = res;
772 d1_stack[level+1] = 0;
773 if (level < 250 && !null_tag)
776 else /* != '<'... this is a body of text */
782 c = ampr (get_byte, fh, &);
785 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
786 res->u.data.what = DATA1I_text;
787 res->u.data.formatted_text = 0;
788 d1_stack[level] = res;
792 while (amp || (c && c != '<'))
794 wrbuf_putc (wrbuf, c);
795 c = ampr (get_byte, fh, &);
797 len = wrbuf_len(wrbuf);
799 /* use local buffer of nmem if too large */
800 if (len >= DATA1_LOCALDATA)
801 res->u.data.data = (char*) nmem_malloc (m, len);
803 res->u.data.data = res->lbuf;
806 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
808 res->u.data.data = 0;
809 res->u.data.len = len;
815 int getc_mem (void *fh)
817 const char **p = (const char **) fh;
823 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
825 WRBUF wrbuf = wrbuf_alloc();
828 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
829 wrbuf_free (wrbuf, 1);
834 * Read a record in the native syntax.
836 data1_node *data1_read_record(data1_handle dh,
837 int (*rf)(void *, char *, size_t), void *fh,
841 char **buf = data1_get_read_buf (dh, &size);
846 *buf = (char *)xmalloc(*size = 4096);
850 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
852 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
858 return data1_read_node(dh, &bp, m);
867 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
869 const char *bp = buf;
870 return data1_read_node (dh, &bp, m);
876 static int conv_item (NMEM m, iconv_t t,
877 WRBUF wrbuf, char *inbuf, size_t inlen)
879 wrbuf_rewind (wrbuf);
880 if (wrbuf->size < 10)
881 wrbuf_grow (wrbuf, 10);
884 char *outbuf = wrbuf->buf + wrbuf->pos;
885 size_t outlen = wrbuf->size - wrbuf->pos;
886 if (iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
887 (size_t)(-1) && errno != E2BIG)
889 /* bad data. stop and skip conversion entirely */
893 { /* finished converting */
894 wrbuf->pos = wrbuf->size - outlen;
899 /* buffer too small: make sure we expand buffer */
900 wrbuf->pos = wrbuf->size - outlen;
901 wrbuf_grow(wrbuf, 20);
907 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
908 iconv_t t, WRBUF wrbuf, const char *tocode)
910 for (; n; n = n->next)
916 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
919 data1_insert_string_n (dh, n, m, wrbuf->buf,
921 n->u.data.len = wrbuf->pos;
925 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
929 data1_insert_string_n (dh, n, m,
930 wrbuf->buf, wrbuf->pos);
932 if (n->u.tag.attributes)
935 for (p = n->u.tag.attributes; p; p = p->next)
938 conv_item(m, t, wrbuf, p->value, strlen(p->value))
941 wrbuf_puts (wrbuf, "");
942 p->value = nmem_strdup (m, wrbuf->buf);
947 case DATA1N_preprocess:
948 if (strcmp(n->u.preprocess.target, "xml") == 0)
950 data1_xattr *p = n->u.preprocess.attributes;
951 for (; p; p = p->next)
952 if (strcmp (p->name, "encoding") == 0)
953 p->value = nmem_strdup (m, tocode);
957 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
962 const char *data1_get_encoding (data1_handle dh, data1_node *n)
964 /* see if we have an xml header that specifies encoding */
965 if (n && n->child && n->child->which == DATA1N_preprocess &&
966 strcmp (n->child->u.preprocess.target, "xml") == 0)
968 data1_xattr *xp = n->child->u.preprocess.attributes;
969 for (; xp; xp = xp->next)
970 if (!strcmp (xp->name, "encoding") == 0)
973 /* no encoding in header, so see if "encoding" was specified for abs */
974 if (n && n->which == DATA1N_root &&
975 n->u.root.absyn && n->u.root.absyn->encoding)
976 return n->u.root.absyn->encoding;
977 /* none of above, return a hard coded default */
981 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
983 const char *fromcode)
986 if (strcmp (tocode, fromcode))
988 WRBUF wrbuf = wrbuf_alloc();
989 iconv_t t = iconv_open (tocode, fromcode);
990 if (t == (iconv_t) (-1))
992 data1_iconv_s (dh, m, n, t, wrbuf, tocode);
994 wrbuf_free (wrbuf, 1);