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.53 2002-10-08 20:14:44 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,
169 const char **attr, data1_node *at)
171 return data1_mk_preprocess_n (dh, nmem, target, strlen(target),
175 data1_node *data1_mk_preprocess_n (data1_handle dh, NMEM nmem,
176 const char *target, size_t len,
177 const char **attr, data1_node *at)
180 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
181 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
184 p = &res->u.preprocess.attributes;
185 while (attr && *attr)
187 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
188 (*p)->name = nmem_strdup (nmem, *attr++);
189 (*p)->value = nmem_strdup (nmem, *attr++);
190 (*p)->what = DATA1I_text;
198 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
199 const char *tag, size_t len, const char **attr,
202 data1_node *partag = get_parent_tag(dh, at);
203 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
205 data1_element *e = 0;
207 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
209 if (!partag) /* top tag? */
210 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
211 0 /* index as local */,
215 /* only set element for known tags */
216 e = partag->u.tag.element;
218 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
221 res->u.tag.element = e;
222 p = &res->u.tag.attributes;
223 while (attr && *attr)
225 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
226 (*p)->name = nmem_strdup (nmem, *attr++);
227 (*p)->value = nmem_strdup (nmem, *attr++);
228 (*p)->what = DATA1I_text;
235 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
236 data1_node *res, const char **attr)
240 if (res->which != DATA1N_tag)
243 p = &res->u.tag.attributes;
247 while (attr && *attr)
249 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
250 (*p)->name = nmem_strdup (nmem, *attr++);
251 (*p)->value = nmem_strdup (nmem, *attr++);
252 (*p)->what = DATA1I_text;
258 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
259 const char *tag, const char **attr, data1_node *at)
261 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
264 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
269 n = data1_get_root_tag (dh, n);
274 for (; n; n = n->next)
275 if (n->which == DATA1N_tag && n->u.tag.tag &&
276 !yaz_matchstr (tag, n->u.tag.tag))
283 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
284 const char *tag, data1_node *at)
286 data1_node *node = data1_search_tag (dh, at->child, tag);
288 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
290 node->child = node->last_child = 0;
294 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
295 const char *buf, size_t len, data1_node *parent)
297 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
298 res->u.data.what = DATA1I_text;
299 res->u.data.len = len;
301 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
305 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
306 const char *buf, size_t len, data1_node *parent)
308 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
309 res->u.data.formatted_text = 1;
313 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
314 const char *buf, data1_node *parent)
316 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
319 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
320 const char *buf, size_t len,
323 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
324 res->u.data.what = DATA1I_text;
325 res->u.data.len = len;
327 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
331 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
332 const char *buf, data1_node *parent)
334 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
337 char *data1_insert_string_n (data1_handle dh, data1_node *res,
338 NMEM m, const char *str, size_t len)
341 if (len >= DATA1_LOCALDATA)
342 b = (char *) nmem_malloc (m, len+1);
345 memcpy (b, str, len);
350 char *data1_insert_string (data1_handle dh, data1_node *res,
351 NMEM m, const char *str)
353 return data1_insert_string_n (dh, res, m, str, strlen(str));
356 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
358 const char *tagname, NMEM m,
361 data1_node *root = at->root;
362 data1_node *partag = get_parent_tag (dh, at);
363 data1_element *e = NULL;
364 data1_node *datn = 0;
365 data1_node *tagn = 0;
368 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
371 e = partag->u.tag.element;
373 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
375 if (local_allowed || e)
377 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
378 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
379 tagn->u.tag.element = e;
380 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
385 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
386 const char *tagname, NMEM m)
388 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
393 * Insert a tagged node into the record root as first child of the node at
394 * which should be root or tag itself). Returns pointer to the data node,
395 * which can then be modified.
397 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
398 const char *tagname, NMEM m)
400 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
403 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
404 data1_node *at, const char *tagname,
407 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
410 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
411 data1_node *at, const char *tagname,
414 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
417 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
418 const char *tag, int num,
421 data1_node *node_data;
423 node_data = data1_mk_tag_data (dh, at, tag, nmem);
426 node_data->u.data.what = DATA1I_num;
427 node_data->u.data.data = node_data->lbuf;
428 sprintf (node_data->u.data.data, "%d", num);
429 node_data->u.data.len = strlen (node_data->u.data.data);
433 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
434 const char *tag, Odr_oid *oid,
437 data1_node *node_data;
438 char str[128], *p = str;
441 node_data = data1_mk_tag_data (dh, at, tag, nmem);
445 for (ii = oid; *ii >= 0; ii++)
449 sprintf (p, "%d", *ii);
452 node_data->u.data.what = DATA1I_oid;
453 node_data->u.data.len = strlen (str);
454 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
459 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
460 const char *tag, const char *str,
463 data1_node *node_data;
465 node_data = data1_mk_tag_data (dh, at, tag, nmem);
468 node_data->u.data.what = DATA1I_text;
469 node_data->u.data.len = strlen (str);
470 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
475 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
476 const char *tag, const char *str,
479 data1_node *node = data1_search_tag (dh, at->child, tag);
481 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
484 data1_node *node_data = node->child;
485 node_data->u.data.what = DATA1I_text;
486 node_data->u.data.len = strlen (str);
487 node_data->u.data.data = data1_insert_string (dh, node_data,
489 node_data->child = node_data->last_child = 0;
494 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
497 int c = (*get_byte)(fh);
501 int c = (*get_byte)(fh);
516 if (!strcmp (ent, "quot"))
518 if (!strcmp (ent, "apos"))
520 if (!strcmp (ent, "gt"))
522 if (!strcmp (ent, "lt"))
524 if (!strcmp (ent, "amp"))
529 else if (c == 0 || d1_isspace(c))
539 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
540 int (*get_byte)(void *fh), void *fh,
541 WRBUF wrbuf, int *ch, int *amp)
543 data1_xattr *p_first = 0;
544 data1_xattr **pp = &p_first;
550 while (*amp || (c && d1_isspace(c)))
551 c = ampr (get_byte, fh, amp);
552 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
554 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
558 p->what = DATA1I_xmltext;
561 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
563 wrbuf_putc (wrbuf, c);
564 c = ampr (get_byte, fh, amp);
566 wrbuf_putc (wrbuf, '\0');
567 len = wrbuf_len(wrbuf);
568 p->name = (char*) nmem_malloc (m, len);
569 strcpy (p->name, wrbuf_buf(wrbuf));
572 c = ampr (get_byte, fh, amp);
573 if (*amp == 0 && c == '"')
575 c = ampr (get_byte, fh, amp);
577 while (*amp || (c && c != '"'))
579 wrbuf_putc (wrbuf, c);
580 c = ampr (get_byte, fh, amp);
583 c = ampr (get_byte, fh, amp);
585 else if (*amp == 0 && c == '\'')
587 c = ampr (get_byte, fh, amp);
589 while (*amp || (c && c != '\''))
591 wrbuf_putc (wrbuf, c);
592 c = ampr (get_byte, fh, amp);
595 c = ampr (get_byte, fh, amp);
600 while (*amp || (c && c != '>' && c != '/'))
602 wrbuf_putc (wrbuf, c);
603 c = ampr (get_byte, fh, amp);
606 wrbuf_putc (wrbuf, '\0');
607 len = wrbuf_len(wrbuf);
608 p->value = (char*) nmem_malloc (m, len);
609 strcpy (p->value, wrbuf_buf(wrbuf));
617 * Ugh. Sometimes functions just grow and grow on you. This one reads a
618 * 'node' and its children.
620 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
621 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
623 data1_node *d1_stack[256];
630 c = ampr (get_byte, fh, &);
633 data1_node *parent = level ? d1_stack[level-1] : 0;
635 if (amp == 0 && c == '<') /* beginning of tag */
645 c = ampr (get_byte, fh, &);
646 if (amp == 0 && c == '/')
649 c = ampr (get_byte, fh, &);
651 else if (amp == 0 && c == '!')
657 c0 = ampr (get_byte, fh, &0);
658 if (amp0 == 0 && c0 == '\0')
660 c = ampr (get_byte, fh, &);
662 if (amp0 == 0 && c0 == '-' && amp == 0 && c == '-')
664 /* COMMENT: <!-- ... --> */
667 c = ampr (get_byte, fh, &);
670 if (amp == 0 && c == '-')
672 else if (amp == 0 && c == '>' && no_dash >= 2)
678 wrbuf_buf(wrbuf), wrbuf_len(wrbuf)-2,
680 c = ampr (get_byte, fh, &); /* skip > */
685 wrbuf_putc (wrbuf, c);
686 c = ampr (get_byte, fh, &);
691 { /* DIRECTIVE: <! .. > */
696 if (amp == 0 && c == '>' && blevel == 0)
698 c = ampr (get_byte, fh, &);
701 if (amp == 0 && c == '[')
703 if (amp == 0 && c == ']' && blevel > 0)
705 c = ampr (get_byte, fh, &);
710 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
712 if (i < (sizeof(tag)-1))
714 c = ampr (get_byte, fh, &);
717 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
719 if (amp == 0 && c == '/')
720 { /* <tag attrs/> or <tag/> */
722 c = ampr (get_byte, fh, &);
726 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
730 c = ampr (get_byte, fh, &);
742 parent = d1_stack[--i];
743 if ((parent->which == DATA1N_root &&
744 !strcmp(tag, parent->u.root.type)) ||
745 (parent->which == DATA1N_tag &&
746 !strcmp(tag, parent->u.tag.tag)))
754 yaz_log (LOG_WARN, "%d: no begin tag for %s",
759 if (data1_is_xmlmode(dh))
771 else if (!strcmp(tag, "var"))
773 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
777 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
779 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
783 data1_getvartypebyct(dh,
784 parent->root->u.root.absyn->varset,
788 * If we're the first variant in this group, create a parent
789 * variant, and insert it before the current variant.
791 if (parent->which != DATA1N_variant)
793 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
798 * now determine if one of our ancestor triples is of
799 * same type. If so, we break here.
802 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
803 if (d1_stack[i]->u.variant.type == tp)
808 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
809 res->u.variant.type = tp;
810 res->u.variant.value =
811 data1_insert_string (dh, res, m, args + val_offset);
817 /* tag .. acquire our element in the abstract syntax */
820 parent = data1_mk_root (dh, m, tag);
821 res = d1_stack[level] = parent;
823 if (data1_is_xmlmode(dh))
826 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
827 res->u.tag.attributes = xattr;
832 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
833 res->u.tag.attributes = xattr;
836 d1_stack[level] = res;
837 d1_stack[level+1] = 0;
838 if (level < 250 && !null_tag)
841 else /* != '<'... this is a body of text */
847 c = ampr (get_byte, fh, &);
850 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
851 res->u.data.what = DATA1I_xmltext;
852 res->u.data.formatted_text = 0;
853 d1_stack[level] = res;
857 while (amp || (c && c != '<'))
859 wrbuf_putc (wrbuf, c);
860 c = ampr (get_byte, fh, &);
862 len = wrbuf_len(wrbuf);
864 /* use local buffer of nmem if too large */
865 if (len >= DATA1_LOCALDATA)
866 res->u.data.data = (char*) nmem_malloc (m, len);
868 res->u.data.data = res->lbuf;
871 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
873 res->u.data.data = 0;
874 res->u.data.len = len;
880 int getc_mem (void *fh)
882 const char **p = (const char **) fh;
888 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
890 WRBUF wrbuf = wrbuf_alloc();
893 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
894 wrbuf_free (wrbuf, 1);
899 * Read a record in the native syntax.
901 data1_node *data1_read_record(data1_handle dh,
902 int (*rf)(void *, char *, size_t), void *fh,
906 char **buf = data1_get_read_buf (dh, &size);
911 *buf = (char *)xmalloc(*size = 4096);
915 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
917 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
923 return data1_read_node(dh, &bp, m);
932 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
934 const char *bp = buf;
935 return data1_read_node (dh, &bp, m);
939 static int conv_item (NMEM m, yaz_iconv_t t,
940 WRBUF wrbuf, char *inbuf, size_t inlen)
942 wrbuf_rewind (wrbuf);
943 if (wrbuf->size < 10)
944 wrbuf_grow (wrbuf, 10);
947 char *outbuf = wrbuf->buf + wrbuf->pos;
948 size_t outlen = wrbuf->size - wrbuf->pos;
949 if (yaz_iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
950 (size_t)(-1) && yaz_iconv_error(t) != YAZ_ICONV_E2BIG)
952 /* bad data. stop and skip conversion entirely */
956 { /* finished converting */
957 wrbuf->pos = wrbuf->size - outlen;
962 /* buffer too small: make sure we expand buffer */
963 wrbuf->pos = wrbuf->size - outlen;
964 wrbuf_grow(wrbuf, 20);
970 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
971 yaz_iconv_t t, WRBUF wrbuf, const char *tocode)
973 for (; n; n = n->next)
979 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
982 data1_insert_string_n (dh, n, m, wrbuf->buf,
984 n->u.data.len = wrbuf->pos;
988 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
992 data1_insert_string_n (dh, n, m,
993 wrbuf->buf, wrbuf->pos);
995 if (n->u.tag.attributes)
998 for (p = n->u.tag.attributes; p; p = p->next)
1001 conv_item(m, t, wrbuf, p->value, strlen(p->value))
1004 wrbuf_puts (wrbuf, "");
1005 p->value = nmem_strdup (m, wrbuf->buf);
1010 case DATA1N_preprocess:
1011 if (strcmp(n->u.preprocess.target, "xml") == 0)
1013 data1_xattr *p = n->u.preprocess.attributes;
1014 for (; p; p = p->next)
1015 if (strcmp (p->name, "encoding") == 0)
1016 p->value = nmem_strdup (m, tocode);
1020 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
1024 const char *data1_get_encoding (data1_handle dh, data1_node *n)
1026 /* see if we have an xml header that specifies encoding */
1027 if (n && n->child && n->child->which == DATA1N_preprocess &&
1028 strcmp (n->child->u.preprocess.target, "xml") == 0)
1030 data1_xattr *xp = n->child->u.preprocess.attributes;
1031 for (; xp; xp = xp->next)
1032 if (!strcmp (xp->name, "encoding") == 0)
1035 /* no encoding in header, so see if "encoding" was specified for abs */
1036 if (n && n->which == DATA1N_root &&
1037 n->u.root.absyn && n->u.root.absyn->encoding)
1038 return n->u.root.absyn->encoding;
1039 /* none of above, return a hard coded default */
1040 return "ISO-8859-1";
1043 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
1045 const char *fromcode)
1047 if (strcmp (tocode, fromcode))
1049 WRBUF wrbuf = wrbuf_alloc();
1050 yaz_iconv_t t = yaz_iconv_open (tocode, fromcode);
1053 data1_iconv_s (dh, m, n, t, wrbuf, tocode);
1054 yaz_iconv_close (t);
1055 wrbuf_free (wrbuf, 1);