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.45 2002-07-05 16:04:28 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)
28 while (n && n->which != DATA1N_tag)
34 * get the tag which is the immediate parent of this node (this may mean
35 * traversing intermediate things like variants and stuff.
37 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
39 for (; n && n->which != DATA1N_root; n = n->parent)
40 if (n->which == DATA1N_tag)
45 data1_node *data1_mk_node (data1_handle dh, NMEM m)
47 return data1_mk_node2 (dh, m, DATA1N_root, 0);
50 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
52 return data1_mk_node2 (dh, m, type, 0);
55 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
60 r = (data1_node *)nmem_malloc(m, sizeof(*r));
61 r->next = r->child = r->last_child = 0;
70 r->root = parent->root;
73 parent->child = parent->last_child = r;
75 parent->last_child->next = r;
76 parent->last_child = r;
84 r->u.tag.no_data_requested = 0;
85 r->u.tag.node_selected = 0;
86 r->u.tag.make_variantlist = 0;
87 r->u.tag.get_bytes = -1;
88 r->u.tag.attributes = 0;
98 r->u.data.formatted_text = 0;
104 r->u.data.formatted_text = 1;
107 r->u.variant.type = 0;
108 r->u.variant.value = 0;
110 case DATA1N_preprocess:
111 r->u.preprocess.target = 0;
112 r->u.preprocess.attributes = 0;
115 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
120 void data1_free_tree (data1_handle dh, data1_node *t)
122 data1_node *p = t->child, *pn;
127 data1_free_tree (dh, p);
134 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
136 data1_absyn *absyn = data1_get_absyn (dh, name);
140 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
142 /* It's now OK for a record not to have an absyn */
144 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
145 res->u.root.type = data1_insert_string (dh, res, nmem, name);
146 res->u.root.absyn = absyn;
150 void data1_set_root(data1_handle dh, data1_node *res,
151 NMEM nmem, const char *name)
153 data1_absyn *absyn = data1_get_absyn (dh, name);
155 res->u.root.type = data1_insert_string (dh, res, nmem, name);
156 res->u.root.absyn = absyn;
159 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
160 const char *target, const char **attr,
164 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
165 res->u.preprocess.target = data1_insert_string (dh, res, nmem, target);
167 p = &res->u.preprocess.attributes;
168 while (attr && *attr)
170 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
171 (*p)->name = nmem_strdup (nmem, *attr++);
172 (*p)->value = nmem_strdup (nmem, *attr++);
179 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
180 const char *tag, size_t len, const char **attr,
183 data1_node *partag = get_parent_tag(dh, at);
184 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
185 data1_element *e = NULL;
188 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
191 e = partag->u.tag.element;
193 data1_getelementbytagname (dh, at->root->u.root.absyn,
195 p = &res->u.tag.attributes;
196 while (attr && *attr)
198 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
199 (*p)->name = nmem_strdup (nmem, *attr++);
200 (*p)->value = nmem_strdup (nmem, *attr++);
207 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
208 data1_node *res, const char **attr)
212 if (res->which != DATA1N_tag)
215 p = &res->u.tag.attributes;
219 while (attr && *attr)
221 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
222 (*p)->name = nmem_strdup (nmem, *attr++);
223 (*p)->value = nmem_strdup (nmem, *attr++);
229 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
230 const char *tag, const char **attr, data1_node *at)
232 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
235 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
240 n = data1_get_root_tag (dh, n);
245 for (; n; n = n->next)
246 if (n->which == DATA1N_tag && n->u.tag.tag &&
247 !yaz_matchstr (tag, n->u.tag.tag))
254 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
255 const char *tag, data1_node *at)
257 data1_node *node = data1_search_tag (dh, at->child, tag);
259 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
261 node->child = node->last_child = 0;
265 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
266 const char *buf, size_t len, data1_node *parent)
268 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
269 res->u.data.what = DATA1I_text;
270 res->u.data.len = len;
272 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
276 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
277 const char *buf, size_t len, data1_node *parent)
279 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
280 res->u.data.formatted_text = 1;
284 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
285 const char *buf, data1_node *parent)
287 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
290 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
291 const char *buf, size_t len,
294 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
295 res->u.data.what = DATA1I_text;
296 res->u.data.len = len;
298 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
302 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
303 const char *buf, data1_node *parent)
305 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
308 char *data1_insert_string_n (data1_handle dh, data1_node *res,
309 NMEM m, const char *str, size_t len)
312 if (len >= DATA1_LOCALDATA)
313 b = nmem_malloc (m, len+1);
316 memcpy (b, str, len);
321 char *data1_insert_string (data1_handle dh, data1_node *res,
322 NMEM m, const char *str)
324 return data1_insert_string_n (dh, res, m, str, strlen(str));
327 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
329 const char *tagname, NMEM m,
332 data1_node *root = at->root;
333 data1_node *partag = get_parent_tag (dh, at);
334 data1_element *e = NULL;
335 data1_node *datn = 0;
336 data1_node *tagn = 0;
339 e = partag->u.tag.element;
340 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
341 if (local_allowed || e)
343 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
344 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
345 tagn->u.tag.element = e;
346 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
351 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
352 const char *tagname, NMEM m)
354 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
359 * Insert a tagged node into the record root as first child of the node at
360 * which should be root or tag itself). Returns pointer to the data node,
361 * which can then be modified.
363 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
364 const char *tagname, NMEM m)
366 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
369 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
370 data1_node *at, const char *tagname,
373 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
376 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
377 data1_node *at, const char *tagname,
380 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
383 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
384 const char *tag, int num,
387 data1_node *node_data;
389 node_data = data1_mk_tag_data (dh, at, tag, nmem);
392 node_data->u.data.what = DATA1I_num;
393 node_data->u.data.data = node_data->lbuf;
394 sprintf (node_data->u.data.data, "%d", num);
395 node_data->u.data.len = strlen (node_data->u.data.data);
399 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
400 const char *tag, Odr_oid *oid,
403 data1_node *node_data;
404 char str[128], *p = str;
407 node_data = data1_mk_tag_data (dh, at, tag, nmem);
411 for (ii = oid; *ii >= 0; ii++)
415 sprintf (p, "%d", *ii);
418 node_data->u.data.what = DATA1I_oid;
419 node_data->u.data.len = strlen (str);
420 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
425 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
426 const char *tag, const char *str,
429 data1_node *node_data;
431 node_data = data1_mk_tag_data (dh, at, tag, nmem);
434 node_data->u.data.what = DATA1I_text;
435 node_data->u.data.len = strlen (str);
436 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
441 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
442 const char *tag, const char *str,
445 data1_node *node = data1_search_tag (dh, at->child, tag);
447 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
450 data1_node *node_data = node->child;
451 node_data->u.data.what = DATA1I_text;
452 node_data->u.data.len = strlen (str);
453 node_data->u.data.data = data1_insert_string (dh, node_data,
455 node_data->child = node_data->last_child = 0;
461 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
462 int (*get_byte)(void *fh), void *fh,
463 WRBUF wrbuf, int *ch)
465 data1_xattr *p_first = 0;
466 data1_xattr **pp = &p_first;
472 while (c && d1_isspace(c))
474 if (!c || c == '>' || c == '/')
476 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
482 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
484 wrbuf_putc (wrbuf, c);
487 wrbuf_putc (wrbuf, '\0');
488 len = wrbuf_len(wrbuf);
489 p->name = (char*) nmem_malloc (m, len);
490 strcpy (p->name, wrbuf_buf(wrbuf));
498 while (c && c != '"')
500 wrbuf_putc (wrbuf, c);
509 while (c && c != '>' && c != '/')
511 wrbuf_putc (wrbuf, c);
515 wrbuf_putc (wrbuf, '\0');
516 len = wrbuf_len(wrbuf);
517 p->value = (char*) nmem_malloc (m, len);
518 strcpy (p->value, wrbuf_buf(wrbuf));
526 * Ugh. Sometimes functions just grow and grow on you. This one reads a
527 * 'node' and its children.
529 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
530 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
532 data1_node *d1_stack[256];
542 data1_node *parent = level ? d1_stack[level-1] : 0;
543 while (c != '\0' && d1_isspace(c))
552 if (c == '<') /* beginning of tag */
568 else if (c == '!') /* tags/comments that we don't deal with yet */
570 while (c && c != '>')
576 while (c && c != '>' && c != '/' && !d1_isspace(c))
578 if (i < (sizeof(tag)-1))
583 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
586 { /* <tag attrs/> or <tag/> */
592 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
608 parent = d1_stack[--i];
609 if ((parent->which == DATA1N_root &&
610 !strcmp(tag, parent->u.root.type)) ||
611 (parent->which == DATA1N_tag &&
612 !strcmp(tag, parent->u.tag.tag)))
620 yaz_log (LOG_WARN, "%d: no begin tag for %s",
629 else if (!strcmp(tag, "var"))
631 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
635 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
637 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
641 data1_getvartypebyct(dh,
642 parent->root->u.root.absyn->varset,
646 * If we're the first variant in this group, create a parent
647 * variant, and insert it before the current variant.
649 if (parent->which != DATA1N_variant)
651 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
656 * now determine if one of our ancestor triples is of
657 * same type. If so, we break here.
660 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
661 if (d1_stack[i]->u.variant.type == tp)
666 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
667 res->u.variant.type = tp;
668 res->u.variant.value =
669 data1_insert_string (dh, res, m, args + val_offset);
675 /* tag .. acquire our element in the abstract syntax */
678 parent = data1_mk_root (dh, m, tag);
679 d1_stack[level++] = parent;
681 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
682 res->u.tag.attributes = xattr;
684 d1_stack[level] = res;
685 d1_stack[level+1] = 0;
686 if (level < 250 && !null_tag)
689 else /* != '<'... this is a body of text */
693 int len, prev_char = 0;
700 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
701 res->u.data.what = DATA1I_text;
702 res->u.data.formatted_text = 0;
703 d1_stack[level] = res;
707 while (c && c != '<')
709 wrbuf_putc (wrbuf, c);
712 len = wrbuf_len(wrbuf);
714 /* use local buffer of nmem if too large */
715 if (len >= DATA1_LOCALDATA)
716 res->u.data.data = (char*) nmem_malloc (m, len);
718 res->u.data.data = res->lbuf;
720 /* read "data" and transfer while removing white space */
721 dst = res->u.data.data;
722 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
726 if (d1_isspace (*src))
738 res->u.data.len = dst - res->u.data.data;
744 int getc_mem (void *fh)
746 const char **p = (const char **) fh;
752 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
754 WRBUF wrbuf = wrbuf_alloc();
757 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
758 wrbuf_free (wrbuf, 1);
763 * Read a record in the native syntax.
765 data1_node *data1_read_record(data1_handle dh,
766 int (*rf)(void *, char *, size_t), void *fh,
770 char **buf = data1_get_read_buf (dh, &size);
775 *buf = (char *)xmalloc(*size = 4096);
779 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
781 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
787 return data1_read_node(dh, &bp, m);
796 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
798 const char *bp = buf;
799 return data1_read_node (dh, &bp, m);
805 static int conv_item (NMEM m, iconv_t t,
806 WRBUF wrbuf, char *inbuf, size_t inlen)
808 wrbuf_rewind (wrbuf);
809 if (wrbuf->size < 10)
810 wrbuf_grow (wrbuf, 10);
813 char *outbuf = wrbuf->buf + wrbuf->pos;
814 size_t outlen = wrbuf->size - wrbuf->pos;
815 if (iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
816 (size_t)(-1) && errno != E2BIG)
818 /* bad data. stop and skip conversion entirely */
822 { /* finished converting */
823 wrbuf->pos = wrbuf->size - outlen;
828 /* buffer too small: make sure we expand buffer */
829 wrbuf->pos = wrbuf->size - outlen;
830 wrbuf_grow(wrbuf, 20);
836 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
837 iconv_t t, WRBUF wrbuf)
839 for (; n; n = n->next)
845 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
848 data1_insert_string_n (dh, n, m, wrbuf->buf,
850 n->u.data.len = wrbuf->pos;
854 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
858 data1_insert_string_n (dh, n, m,
859 wrbuf->buf, wrbuf->pos);
861 if (n->u.tag.attributes)
864 for (p = n->u.tag.attributes; p; p = p->next)
866 if (conv_item(m, t, wrbuf, p->value, strlen(p->value))
869 wrbuf_puts (wrbuf, "");
870 p->value = nmem_strdup (m, wrbuf->buf);
876 data1_iconv_s (dh, m, n->child, t, wrbuf);
881 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
883 const char *fromcode)
886 WRBUF wrbuf = wrbuf_alloc();
887 iconv_t t = iconv_open (tocode, fromcode);
888 if (t == (iconv_t) (-1))
890 data1_iconv_s (dh, m, n, t, wrbuf);
892 wrbuf_free (wrbuf, 1);