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.52 2002-09-24 07:58:59 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++);
196 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
197 const char *tag, size_t len, const char **attr,
200 data1_node *partag = get_parent_tag(dh, at);
201 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
203 data1_element *e = 0;
205 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
207 if (!partag) /* top tag? */
208 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
209 0 /* index as local */,
213 /* only set element for known tags */
214 e = partag->u.tag.element;
216 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
219 res->u.tag.element = e;
220 p = &res->u.tag.attributes;
221 while (attr && *attr)
223 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
224 (*p)->name = nmem_strdup (nmem, *attr++);
225 (*p)->value = nmem_strdup (nmem, *attr++);
232 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
233 data1_node *res, const char **attr)
237 if (res->which != DATA1N_tag)
240 p = &res->u.tag.attributes;
244 while (attr && *attr)
246 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
247 (*p)->name = nmem_strdup (nmem, *attr++);
248 (*p)->value = nmem_strdup (nmem, *attr++);
254 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
255 const char *tag, const char **attr, data1_node *at)
257 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
260 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
265 n = data1_get_root_tag (dh, n);
270 for (; n; n = n->next)
271 if (n->which == DATA1N_tag && n->u.tag.tag &&
272 !yaz_matchstr (tag, n->u.tag.tag))
279 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
280 const char *tag, data1_node *at)
282 data1_node *node = data1_search_tag (dh, at->child, tag);
284 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
286 node->child = node->last_child = 0;
290 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
291 const char *buf, size_t len, data1_node *parent)
293 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
294 res->u.data.what = DATA1I_text;
295 res->u.data.len = len;
297 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
301 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
302 const char *buf, size_t len, data1_node *parent)
304 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
305 res->u.data.formatted_text = 1;
309 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
310 const char *buf, data1_node *parent)
312 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
315 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
316 const char *buf, size_t len,
319 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
320 res->u.data.what = DATA1I_text;
321 res->u.data.len = len;
323 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
327 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
328 const char *buf, data1_node *parent)
330 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
333 char *data1_insert_string_n (data1_handle dh, data1_node *res,
334 NMEM m, const char *str, size_t len)
337 if (len >= DATA1_LOCALDATA)
338 b = (char *) nmem_malloc (m, len+1);
341 memcpy (b, str, len);
346 char *data1_insert_string (data1_handle dh, data1_node *res,
347 NMEM m, const char *str)
349 return data1_insert_string_n (dh, res, m, str, strlen(str));
352 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
354 const char *tagname, NMEM m,
357 data1_node *root = at->root;
358 data1_node *partag = get_parent_tag (dh, at);
359 data1_element *e = NULL;
360 data1_node *datn = 0;
361 data1_node *tagn = 0;
364 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
367 e = partag->u.tag.element;
369 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
371 if (local_allowed || e)
373 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
374 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
375 tagn->u.tag.element = e;
376 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
381 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
382 const char *tagname, NMEM m)
384 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
389 * Insert a tagged node into the record root as first child of the node at
390 * which should be root or tag itself). Returns pointer to the data node,
391 * which can then be modified.
393 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
394 const char *tagname, NMEM m)
396 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
399 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
400 data1_node *at, const char *tagname,
403 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
406 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
407 data1_node *at, const char *tagname,
410 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
413 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
414 const char *tag, int num,
417 data1_node *node_data;
419 node_data = data1_mk_tag_data (dh, at, tag, nmem);
422 node_data->u.data.what = DATA1I_num;
423 node_data->u.data.data = node_data->lbuf;
424 sprintf (node_data->u.data.data, "%d", num);
425 node_data->u.data.len = strlen (node_data->u.data.data);
429 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
430 const char *tag, Odr_oid *oid,
433 data1_node *node_data;
434 char str[128], *p = str;
437 node_data = data1_mk_tag_data (dh, at, tag, nmem);
441 for (ii = oid; *ii >= 0; ii++)
445 sprintf (p, "%d", *ii);
448 node_data->u.data.what = DATA1I_oid;
449 node_data->u.data.len = strlen (str);
450 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
455 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
456 const char *tag, const char *str,
459 data1_node *node_data;
461 node_data = data1_mk_tag_data (dh, at, tag, nmem);
464 node_data->u.data.what = DATA1I_text;
465 node_data->u.data.len = strlen (str);
466 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
471 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
472 const char *tag, const char *str,
475 data1_node *node = data1_search_tag (dh, at->child, tag);
477 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
480 data1_node *node_data = node->child;
481 node_data->u.data.what = DATA1I_text;
482 node_data->u.data.len = strlen (str);
483 node_data->u.data.data = data1_insert_string (dh, node_data,
485 node_data->child = node_data->last_child = 0;
490 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
492 int c = (*get_byte)(fh);
507 if (!strcmp (ent, "quot"))
509 if (!strcmp (ent, "apos"))
511 if (!strcmp (ent, "gt"))
513 if (!strcmp (ent, "lt"))
515 if (!strcmp (ent, "amp"))
520 else if (c == 0 || d1_isspace(c))
529 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
530 int (*get_byte)(void *fh), void *fh,
531 WRBUF wrbuf, int *ch, int *amp)
533 data1_xattr *p_first = 0;
534 data1_xattr **pp = &p_first;
540 while (*amp || (c && d1_isspace(c)))
541 c = ampr (get_byte, fh, amp);
542 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
544 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
550 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
552 wrbuf_putc (wrbuf, c);
553 c = ampr (get_byte, fh, amp);
555 wrbuf_putc (wrbuf, '\0');
556 len = wrbuf_len(wrbuf);
557 p->name = (char*) nmem_malloc (m, len);
558 strcpy (p->name, wrbuf_buf(wrbuf));
561 c = ampr (get_byte, fh, amp);
562 if (*amp == 0 && c == '"')
564 c = ampr (get_byte, fh, amp);
566 while (*amp || (c && c != '"'))
568 wrbuf_putc (wrbuf, c);
569 c = ampr (get_byte, fh, amp);
572 c = ampr (get_byte, fh, amp);
574 else if (*amp == 0 && c == '\'')
576 c = ampr (get_byte, fh, amp);
578 while (*amp || (c && c != '\''))
580 wrbuf_putc (wrbuf, c);
581 c = ampr (get_byte, fh, amp);
584 c = ampr (get_byte, fh, amp);
589 while (*amp || (c && c != '>' && c != '/'))
591 wrbuf_putc (wrbuf, c);
592 c = ampr (get_byte, fh, amp);
595 wrbuf_putc (wrbuf, '\0');
596 len = wrbuf_len(wrbuf);
597 p->value = (char*) nmem_malloc (m, len);
598 strcpy (p->value, wrbuf_buf(wrbuf));
606 * Ugh. Sometimes functions just grow and grow on you. This one reads a
607 * 'node' and its children.
609 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
610 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
612 data1_node *d1_stack[256];
619 c = ampr (get_byte, fh, &);
622 data1_node *parent = level ? d1_stack[level-1] : 0;
624 if (amp == 0 && c == '<') /* beginning of tag */
634 c = ampr (get_byte, fh, &);
635 if (amp == 0 && c == '/')
638 c = ampr (get_byte, fh, &);
640 else if (amp == 0 && c == '!')
646 c0 = ampr (get_byte, fh, &0);
647 if (amp0 == 0 && c0 == '\0')
649 c = ampr (get_byte, fh, &);
651 if (amp0 == 0 && c0 == '-' && amp == 0 && c == '-')
653 /* COMMENT: <!-- ... --> */
656 c = ampr (get_byte, fh, &);
659 if (amp == 0 && c == '-')
661 else if (amp == 0 && c == '>' && no_dash >= 2)
667 wrbuf_buf(wrbuf), wrbuf_len(wrbuf)-2,
669 c = ampr (get_byte, fh, &); /* skip > */
674 wrbuf_putc (wrbuf, c);
675 c = ampr (get_byte, fh, &);
680 { /* DIRECTIVE: <! .. > */
685 if (amp == 0 && c == '>' && blevel == 0)
687 c = ampr (get_byte, fh, &);
690 if (amp == 0 && c == '[')
692 if (amp == 0 && c == ']' && blevel > 0)
694 c = ampr (get_byte, fh, &);
699 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
701 if (i < (sizeof(tag)-1))
703 c = ampr (get_byte, fh, &);
706 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
708 if (amp == 0 && c == '/')
709 { /* <tag attrs/> or <tag/> */
711 c = ampr (get_byte, fh, &);
715 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
719 c = ampr (get_byte, fh, &);
731 parent = d1_stack[--i];
732 if ((parent->which == DATA1N_root &&
733 !strcmp(tag, parent->u.root.type)) ||
734 (parent->which == DATA1N_tag &&
735 !strcmp(tag, parent->u.tag.tag)))
743 yaz_log (LOG_WARN, "%d: no begin tag for %s",
748 if (data1_is_xmlmode(dh))
760 else if (!strcmp(tag, "var"))
762 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
766 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
768 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
772 data1_getvartypebyct(dh,
773 parent->root->u.root.absyn->varset,
777 * If we're the first variant in this group, create a parent
778 * variant, and insert it before the current variant.
780 if (parent->which != DATA1N_variant)
782 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
787 * now determine if one of our ancestor triples is of
788 * same type. If so, we break here.
791 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
792 if (d1_stack[i]->u.variant.type == tp)
797 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
798 res->u.variant.type = tp;
799 res->u.variant.value =
800 data1_insert_string (dh, res, m, args + val_offset);
806 /* tag .. acquire our element in the abstract syntax */
809 parent = data1_mk_root (dh, m, tag);
810 res = d1_stack[level] = parent;
812 if (data1_is_xmlmode(dh))
815 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
816 res->u.tag.attributes = xattr;
821 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
822 res->u.tag.attributes = xattr;
825 d1_stack[level] = res;
826 d1_stack[level+1] = 0;
827 if (level < 250 && !null_tag)
830 else /* != '<'... this is a body of text */
836 c = ampr (get_byte, fh, &);
839 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
840 res->u.data.what = DATA1I_text;
841 res->u.data.formatted_text = 0;
842 d1_stack[level] = res;
846 while (amp || (c && c != '<'))
848 wrbuf_putc (wrbuf, c);
849 c = ampr (get_byte, fh, &);
851 len = wrbuf_len(wrbuf);
853 /* use local buffer of nmem if too large */
854 if (len >= DATA1_LOCALDATA)
855 res->u.data.data = (char*) nmem_malloc (m, len);
857 res->u.data.data = res->lbuf;
860 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
862 res->u.data.data = 0;
863 res->u.data.len = len;
869 int getc_mem (void *fh)
871 const char **p = (const char **) fh;
877 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
879 WRBUF wrbuf = wrbuf_alloc();
882 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
883 wrbuf_free (wrbuf, 1);
888 * Read a record in the native syntax.
890 data1_node *data1_read_record(data1_handle dh,
891 int (*rf)(void *, char *, size_t), void *fh,
895 char **buf = data1_get_read_buf (dh, &size);
900 *buf = (char *)xmalloc(*size = 4096);
904 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
906 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
912 return data1_read_node(dh, &bp, m);
921 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
923 const char *bp = buf;
924 return data1_read_node (dh, &bp, m);
928 static int conv_item (NMEM m, yaz_iconv_t t,
929 WRBUF wrbuf, char *inbuf, size_t inlen)
931 wrbuf_rewind (wrbuf);
932 if (wrbuf->size < 10)
933 wrbuf_grow (wrbuf, 10);
936 char *outbuf = wrbuf->buf + wrbuf->pos;
937 size_t outlen = wrbuf->size - wrbuf->pos;
938 if (yaz_iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
939 (size_t)(-1) && yaz_iconv_error(t) != YAZ_ICONV_E2BIG)
941 /* bad data. stop and skip conversion entirely */
945 { /* finished converting */
946 wrbuf->pos = wrbuf->size - outlen;
951 /* buffer too small: make sure we expand buffer */
952 wrbuf->pos = wrbuf->size - outlen;
953 wrbuf_grow(wrbuf, 20);
959 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
960 yaz_iconv_t t, WRBUF wrbuf, const char *tocode)
962 for (; n; n = n->next)
968 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
971 data1_insert_string_n (dh, n, m, wrbuf->buf,
973 n->u.data.len = wrbuf->pos;
977 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
981 data1_insert_string_n (dh, n, m,
982 wrbuf->buf, wrbuf->pos);
984 if (n->u.tag.attributes)
987 for (p = n->u.tag.attributes; p; p = p->next)
990 conv_item(m, t, wrbuf, p->value, strlen(p->value))
993 wrbuf_puts (wrbuf, "");
994 p->value = nmem_strdup (m, wrbuf->buf);
999 case DATA1N_preprocess:
1000 if (strcmp(n->u.preprocess.target, "xml") == 0)
1002 data1_xattr *p = n->u.preprocess.attributes;
1003 for (; p; p = p->next)
1004 if (strcmp (p->name, "encoding") == 0)
1005 p->value = nmem_strdup (m, tocode);
1009 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
1013 const char *data1_get_encoding (data1_handle dh, data1_node *n)
1015 /* see if we have an xml header that specifies encoding */
1016 if (n && n->child && n->child->which == DATA1N_preprocess &&
1017 strcmp (n->child->u.preprocess.target, "xml") == 0)
1019 data1_xattr *xp = n->child->u.preprocess.attributes;
1020 for (; xp; xp = xp->next)
1021 if (!strcmp (xp->name, "encoding") == 0)
1024 /* no encoding in header, so see if "encoding" was specified for abs */
1025 if (n && n->which == DATA1N_root &&
1026 n->u.root.absyn && n->u.root.absyn->encoding)
1027 return n->u.root.absyn->encoding;
1028 /* none of above, return a hard coded default */
1029 return "ISO-8859-1";
1032 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
1034 const char *fromcode)
1036 if (strcmp (tocode, fromcode))
1038 WRBUF wrbuf = wrbuf_alloc();
1039 yaz_iconv_t t = yaz_iconv_open (tocode, fromcode);
1042 data1_iconv_s (dh, m, n, t, wrbuf, tocode);
1043 yaz_iconv_close (t);
1044 wrbuf_free (wrbuf, 1);