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.47 2002-07-29 20:04:08 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 for (; n && n->which != DATA1N_root; n = n->parent)
43 if (n->which == DATA1N_tag)
48 data1_node *data1_mk_node (data1_handle dh, NMEM m)
50 return data1_mk_node2 (dh, m, DATA1N_root, 0);
53 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
55 return data1_mk_node2 (dh, m, type, 0);
58 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
63 r = (data1_node *)nmem_malloc(m, sizeof(*r));
64 r->next = r->child = r->last_child = 0;
73 r->root = parent->root;
76 parent->child = parent->last_child = r;
78 parent->last_child->next = r;
79 parent->last_child = r;
87 r->u.tag.no_data_requested = 0;
88 r->u.tag.node_selected = 0;
89 r->u.tag.make_variantlist = 0;
90 r->u.tag.get_bytes = -1;
91 r->u.tag.attributes = 0;
101 r->u.data.formatted_text = 0;
107 r->u.data.formatted_text = 1;
110 r->u.variant.type = 0;
111 r->u.variant.value = 0;
113 case DATA1N_preprocess:
114 r->u.preprocess.target = 0;
115 r->u.preprocess.attributes = 0;
118 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
123 void data1_free_tree (data1_handle dh, data1_node *t)
125 data1_node *p = t->child, *pn;
130 data1_free_tree (dh, p);
137 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
139 data1_absyn *absyn = data1_get_absyn (dh, name);
143 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
145 /* It's now OK for a record not to have an absyn */
147 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
148 res->u.root.type = data1_insert_string (dh, res, nmem, name);
149 res->u.root.absyn = absyn;
153 void data1_set_root(data1_handle dh, data1_node *res,
154 NMEM nmem, const char *name)
156 data1_absyn *absyn = data1_get_absyn (dh, name);
158 res->u.root.type = data1_insert_string (dh, res, nmem, name);
159 res->u.root.absyn = absyn;
162 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
163 const char *target, const char **attr,
167 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
168 res->u.preprocess.target = data1_insert_string (dh, res, nmem, target);
170 p = &res->u.preprocess.attributes;
171 while (attr && *attr)
173 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
174 (*p)->name = nmem_strdup (nmem, *attr++);
175 (*p)->value = nmem_strdup (nmem, *attr++);
182 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
183 const char *tag, size_t len, const char **attr,
186 data1_node *partag = get_parent_tag(dh, at);
187 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
188 data1_element *e = NULL;
191 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
194 e = partag->u.tag.element;
196 data1_getelementbytagname (dh, at->root->u.root.absyn,
198 p = &res->u.tag.attributes;
199 while (attr && *attr)
201 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
202 (*p)->name = nmem_strdup (nmem, *attr++);
203 (*p)->value = nmem_strdup (nmem, *attr++);
210 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
211 data1_node *res, const char **attr)
215 if (res->which != DATA1N_tag)
218 p = &res->u.tag.attributes;
222 while (attr && *attr)
224 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
225 (*p)->name = nmem_strdup (nmem, *attr++);
226 (*p)->value = nmem_strdup (nmem, *attr++);
232 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
233 const char *tag, const char **attr, data1_node *at)
235 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
238 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
243 n = data1_get_root_tag (dh, n);
248 for (; n; n = n->next)
249 if (n->which == DATA1N_tag && n->u.tag.tag &&
250 !yaz_matchstr (tag, n->u.tag.tag))
257 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
258 const char *tag, data1_node *at)
260 data1_node *node = data1_search_tag (dh, at->child, tag);
262 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
264 node->child = node->last_child = 0;
268 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
269 const char *buf, size_t len, data1_node *parent)
271 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
272 res->u.data.what = DATA1I_text;
273 res->u.data.len = len;
275 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
279 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
280 const char *buf, size_t len, data1_node *parent)
282 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
283 res->u.data.formatted_text = 1;
287 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
288 const char *buf, data1_node *parent)
290 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
293 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
294 const char *buf, size_t len,
297 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, 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_comment (data1_handle dh, NMEM mem,
306 const char *buf, data1_node *parent)
308 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
311 char *data1_insert_string_n (data1_handle dh, data1_node *res,
312 NMEM m, const char *str, size_t len)
315 if (len >= DATA1_LOCALDATA)
316 b = nmem_malloc (m, len+1);
319 memcpy (b, str, len);
324 char *data1_insert_string (data1_handle dh, data1_node *res,
325 NMEM m, const char *str)
327 return data1_insert_string_n (dh, res, m, str, strlen(str));
330 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
332 const char *tagname, NMEM m,
335 data1_node *root = at->root;
336 data1_node *partag = get_parent_tag (dh, at);
337 data1_element *e = NULL;
338 data1_node *datn = 0;
339 data1_node *tagn = 0;
342 e = partag->u.tag.element;
343 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
344 if (local_allowed || e)
346 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
347 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
348 tagn->u.tag.element = e;
349 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
354 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
355 const char *tagname, NMEM m)
357 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
362 * Insert a tagged node into the record root as first child of the node at
363 * which should be root or tag itself). Returns pointer to the data node,
364 * which can then be modified.
366 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
367 const char *tagname, NMEM m)
369 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
372 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
373 data1_node *at, const char *tagname,
376 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
379 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
380 data1_node *at, const char *tagname,
383 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
386 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
387 const char *tag, int num,
390 data1_node *node_data;
392 node_data = data1_mk_tag_data (dh, at, tag, nmem);
395 node_data->u.data.what = DATA1I_num;
396 node_data->u.data.data = node_data->lbuf;
397 sprintf (node_data->u.data.data, "%d", num);
398 node_data->u.data.len = strlen (node_data->u.data.data);
402 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
403 const char *tag, Odr_oid *oid,
406 data1_node *node_data;
407 char str[128], *p = str;
410 node_data = data1_mk_tag_data (dh, at, tag, nmem);
414 for (ii = oid; *ii >= 0; ii++)
418 sprintf (p, "%d", *ii);
421 node_data->u.data.what = DATA1I_oid;
422 node_data->u.data.len = strlen (str);
423 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
428 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
429 const char *tag, const char *str,
432 data1_node *node_data;
434 node_data = data1_mk_tag_data (dh, at, tag, nmem);
437 node_data->u.data.what = DATA1I_text;
438 node_data->u.data.len = strlen (str);
439 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
444 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
445 const char *tag, const char *str,
448 data1_node *node = data1_search_tag (dh, at->child, tag);
450 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
453 data1_node *node_data = node->child;
454 node_data->u.data.what = DATA1I_text;
455 node_data->u.data.len = strlen (str);
456 node_data->u.data.data = data1_insert_string (dh, node_data,
458 node_data->child = node_data->last_child = 0;
464 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
465 int (*get_byte)(void *fh), void *fh,
466 WRBUF wrbuf, int *ch)
468 data1_xattr *p_first = 0;
469 data1_xattr **pp = &p_first;
475 while (c && d1_isspace(c))
477 if (!c || c == '>' || c == '/')
479 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
485 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
487 wrbuf_putc (wrbuf, c);
490 wrbuf_putc (wrbuf, '\0');
491 len = wrbuf_len(wrbuf);
492 p->name = (char*) nmem_malloc (m, len);
493 strcpy (p->name, wrbuf_buf(wrbuf));
501 while (c && c != '"')
503 wrbuf_putc (wrbuf, c);
512 while (c && c != '>' && c != '/')
514 wrbuf_putc (wrbuf, c);
518 wrbuf_putc (wrbuf, '\0');
519 len = wrbuf_len(wrbuf);
520 p->value = (char*) nmem_malloc (m, len);
521 strcpy (p->value, wrbuf_buf(wrbuf));
529 * Ugh. Sometimes functions just grow and grow on you. This one reads a
530 * 'node' and its children.
532 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
533 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
535 data1_node *d1_stack[256];
545 data1_node *parent = level ? d1_stack[level-1] : 0;
546 while (c != '\0' && d1_isspace(c))
555 if (c == '<') /* beginning of tag */
571 else if (c == '!') /* tags/comments that we don't deal with yet */
573 while (c && c != '>')
579 while (c && c != '>' && c != '/' && !d1_isspace(c))
581 if (i < (sizeof(tag)-1))
586 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
589 { /* <tag attrs/> or <tag/> */
595 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
611 parent = d1_stack[--i];
612 if ((parent->which == DATA1N_root &&
613 !strcmp(tag, parent->u.root.type)) ||
614 (parent->which == DATA1N_tag &&
615 !strcmp(tag, parent->u.tag.tag)))
623 yaz_log (LOG_WARN, "%d: no begin tag for %s",
628 if (data1_is_xmlmode(dh))
640 else if (!strcmp(tag, "var"))
642 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
646 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
648 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
652 data1_getvartypebyct(dh,
653 parent->root->u.root.absyn->varset,
657 * If we're the first variant in this group, create a parent
658 * variant, and insert it before the current variant.
660 if (parent->which != DATA1N_variant)
662 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
667 * now determine if one of our ancestor triples is of
668 * same type. If so, we break here.
671 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
672 if (d1_stack[i]->u.variant.type == tp)
677 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
678 res->u.variant.type = tp;
679 res->u.variant.value =
680 data1_insert_string (dh, res, m, args + val_offset);
686 /* tag .. acquire our element in the abstract syntax */
689 parent = data1_mk_root (dh, m, tag);
690 res = d1_stack[level] = parent;
692 if (data1_is_xmlmode(dh))
695 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
696 res->u.tag.attributes = xattr;
701 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
702 res->u.tag.attributes = xattr;
705 d1_stack[level] = res;
706 d1_stack[level+1] = 0;
707 if (level < 250 && !null_tag)
710 else /* != '<'... this is a body of text */
714 int len, prev_char = 0;
721 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
722 res->u.data.what = DATA1I_text;
723 res->u.data.formatted_text = 0;
724 d1_stack[level] = res;
728 while (c && c != '<')
730 wrbuf_putc (wrbuf, c);
733 len = wrbuf_len(wrbuf);
735 /* use local buffer of nmem if too large */
736 if (len >= DATA1_LOCALDATA)
737 res->u.data.data = (char*) nmem_malloc (m, len);
739 res->u.data.data = res->lbuf;
741 /* read "data" and transfer while removing white space */
742 dst = res->u.data.data;
743 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
747 if (d1_isspace (*src))
759 res->u.data.len = dst - res->u.data.data;
765 int getc_mem (void *fh)
767 const char **p = (const char **) fh;
773 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
775 WRBUF wrbuf = wrbuf_alloc();
778 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
779 wrbuf_free (wrbuf, 1);
784 * Read a record in the native syntax.
786 data1_node *data1_read_record(data1_handle dh,
787 int (*rf)(void *, char *, size_t), void *fh,
791 char **buf = data1_get_read_buf (dh, &size);
796 *buf = (char *)xmalloc(*size = 4096);
800 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
802 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
808 return data1_read_node(dh, &bp, m);
817 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
819 const char *bp = buf;
820 return data1_read_node (dh, &bp, m);
826 static int conv_item (NMEM m, iconv_t t,
827 WRBUF wrbuf, char *inbuf, size_t inlen)
829 wrbuf_rewind (wrbuf);
830 if (wrbuf->size < 10)
831 wrbuf_grow (wrbuf, 10);
834 char *outbuf = wrbuf->buf + wrbuf->pos;
835 size_t outlen = wrbuf->size - wrbuf->pos;
836 if (iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
837 (size_t)(-1) && errno != E2BIG)
839 /* bad data. stop and skip conversion entirely */
843 { /* finished converting */
844 wrbuf->pos = wrbuf->size - outlen;
849 /* buffer too small: make sure we expand buffer */
850 wrbuf->pos = wrbuf->size - outlen;
851 wrbuf_grow(wrbuf, 20);
857 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
858 iconv_t t, WRBUF wrbuf, const char *tocode)
860 for (; n; n = n->next)
866 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
869 data1_insert_string_n (dh, n, m, wrbuf->buf,
871 n->u.data.len = wrbuf->pos;
875 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
879 data1_insert_string_n (dh, n, m,
880 wrbuf->buf, wrbuf->pos);
882 if (n->u.tag.attributes)
885 for (p = n->u.tag.attributes; p; p = p->next)
887 if (conv_item(m, t, wrbuf, p->value, strlen(p->value))
890 wrbuf_puts (wrbuf, "");
891 p->value = nmem_strdup (m, wrbuf->buf);
896 case DATA1N_preprocess:
897 if (strcmp(n->u.preprocess.target, "xml") == 0)
899 data1_xattr *p = n->u.preprocess.attributes;
900 for (; p; p = p->next)
901 if (strcmp (p->name, "encoding") == 0)
902 p->value = nmem_strdup (m, tocode);
906 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
911 const char *data1_get_encoding (data1_handle dh, data1_node *n)
913 /* see if we have an xml header that specifies encoding */
914 if (n && n->child && n->child->which == DATA1N_preprocess &&
915 strcmp (n->child->u.preprocess.target, "xml") == 0)
917 data1_xattr *xp = n->child->u.preprocess.attributes;
918 for (; xp; xp = xp->next)
919 if (!strcmp (xp->name, "encoding") == 0)
922 /* no encoding in header, so see if "encoding" was specified for abs */
923 if (n && n->which == DATA1N_root &&
924 n->u.root.absyn && n->u.root.absyn->encoding)
925 return n->u.root.absyn->encoding;
926 /* none of above, return a hard coded default */
930 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
932 const char *fromcode)
935 if (strcmp (tocode, fromcode))
937 WRBUF wrbuf = wrbuf_alloc();
938 iconv_t t = iconv_open (tocode, fromcode);
939 if (t == (iconv_t) (-1))
941 data1_iconv_s (dh, m, n, t, wrbuf, tocode);
943 wrbuf_free (wrbuf, 1);