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.44 2002-07-03 10:04:04 adam Exp $
13 #include <yaz/xmalloc.h>
15 #include <yaz/data1.h>
17 data1_node *data1_get_root_tag (data1_handle dh, data1_node *n)
22 while (n && n->which != DATA1N_tag)
28 * get the tag which is the immediate parent of this node (this may mean
29 * traversing intermediate things like variants and stuff.
31 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
33 for (; n && n->which != DATA1N_root; n = n->parent)
34 if (n->which == DATA1N_tag)
39 data1_node *data1_mk_node (data1_handle dh, NMEM m)
41 return data1_mk_node2 (dh, m, DATA1N_root, 0);
44 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
46 return data1_mk_node2 (dh, m, type, 0);
49 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
54 r = (data1_node *)nmem_malloc(m, sizeof(*r));
55 r->next = r->child = r->last_child = 0;
64 r->root = parent->root;
67 parent->child = parent->last_child = r;
69 parent->last_child->next = r;
70 parent->last_child = r;
78 r->u.tag.no_data_requested = 0;
79 r->u.tag.node_selected = 0;
80 r->u.tag.make_variantlist = 0;
81 r->u.tag.get_bytes = -1;
82 r->u.tag.attributes = 0;
92 r->u.data.formatted_text = 0;
98 r->u.data.formatted_text = 1;
101 r->u.variant.type = 0;
102 r->u.variant.value = 0;
104 case DATA1N_preprocess:
105 r->u.preprocess.target = 0;
106 r->u.preprocess.attributes = 0;
109 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
114 void data1_free_tree (data1_handle dh, data1_node *t)
116 data1_node *p = t->child, *pn;
121 data1_free_tree (dh, p);
128 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
130 data1_absyn *absyn = data1_get_absyn (dh, name);
134 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
136 /* It's now OK for a record not to have an absyn */
138 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
139 res->u.root.type = data1_insert_string (dh, res, nmem, name);
140 res->u.root.absyn = absyn;
144 void data1_set_root(data1_handle dh, data1_node *res,
145 NMEM nmem, const char *name)
147 data1_absyn *absyn = data1_get_absyn (dh, name);
149 res->u.root.type = data1_insert_string (dh, res, nmem, name);
150 res->u.root.absyn = absyn;
153 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
154 const char *target, const char **attr,
158 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
159 res->u.preprocess.target = data1_insert_string (dh, res, nmem, target);
161 p = &res->u.preprocess.attributes;
162 while (attr && *attr)
164 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
165 (*p)->name = nmem_strdup (nmem, *attr++);
166 (*p)->value = nmem_strdup (nmem, *attr++);
173 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
174 const char *tag, size_t len, const char **attr,
177 data1_node *partag = get_parent_tag(dh, at);
178 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
179 data1_element *e = NULL;
182 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
185 e = partag->u.tag.element;
187 data1_getelementbytagname (dh, at->root->u.root.absyn,
189 p = &res->u.tag.attributes;
190 while (attr && *attr)
192 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
193 (*p)->name = nmem_strdup (nmem, *attr++);
194 (*p)->value = nmem_strdup (nmem, *attr++);
201 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
202 data1_node *res, const char **attr)
206 if (res->which != DATA1N_tag)
209 p = &res->u.tag.attributes;
213 while (attr && *attr)
215 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
216 (*p)->name = nmem_strdup (nmem, *attr++);
217 (*p)->value = nmem_strdup (nmem, *attr++);
223 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
224 const char *tag, const char **attr, data1_node *at)
226 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
229 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
234 n = data1_get_root_tag (dh, n);
239 for (; n; n = n->next)
240 if (n->which == DATA1N_tag && n->u.tag.tag &&
241 !yaz_matchstr (tag, n->u.tag.tag))
248 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
249 const char *tag, data1_node *at)
251 data1_node *node = data1_search_tag (dh, at->child, tag);
253 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
255 node->child = node->last_child = 0;
259 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
260 const char *buf, size_t len, data1_node *parent)
262 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
263 res->u.data.what = DATA1I_text;
264 res->u.data.len = len;
266 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
270 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
271 const char *buf, size_t len, data1_node *parent)
273 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
274 res->u.data.formatted_text = 1;
278 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
279 const char *buf, data1_node *parent)
281 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
284 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
285 const char *buf, size_t len,
288 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
289 res->u.data.what = DATA1I_text;
290 res->u.data.len = len;
292 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
296 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
297 const char *buf, data1_node *parent)
299 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
302 char *data1_insert_string_n (data1_handle dh, data1_node *res,
303 NMEM m, const char *str, size_t len)
306 if (len >= DATA1_LOCALDATA)
307 b = nmem_malloc (m, len+1);
310 memcpy (b, str, len);
315 char *data1_insert_string (data1_handle dh, data1_node *res,
316 NMEM m, const char *str)
318 return data1_insert_string_n (dh, res, m, str, strlen(str));
321 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
323 const char *tagname, NMEM m,
326 data1_node *root = at->root;
327 data1_node *partag = get_parent_tag (dh, at);
328 data1_element *e = NULL;
329 data1_node *datn = 0;
330 data1_node *tagn = 0;
333 e = partag->u.tag.element;
334 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
335 if (local_allowed || e)
337 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
338 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
339 tagn->u.tag.element = e;
340 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
345 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
346 const char *tagname, NMEM m)
348 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
353 * Insert a tagged node into the record root as first child of the node at
354 * which should be root or tag itself). Returns pointer to the data node,
355 * which can then be modified.
357 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
358 const char *tagname, NMEM m)
360 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
363 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
364 data1_node *at, const char *tagname,
367 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
370 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
371 data1_node *at, const char *tagname,
374 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
377 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
378 const char *tag, int num,
381 data1_node *node_data;
383 node_data = data1_mk_tag_data (dh, at, tag, nmem);
386 node_data->u.data.what = DATA1I_num;
387 node_data->u.data.data = node_data->lbuf;
388 sprintf (node_data->u.data.data, "%d", num);
389 node_data->u.data.len = strlen (node_data->u.data.data);
393 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
394 const char *tag, Odr_oid *oid,
397 data1_node *node_data;
398 char str[128], *p = str;
401 node_data = data1_mk_tag_data (dh, at, tag, nmem);
405 for (ii = oid; *ii >= 0; ii++)
409 sprintf (p, "%d", *ii);
412 node_data->u.data.what = DATA1I_oid;
413 node_data->u.data.len = strlen (str);
414 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
419 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
420 const char *tag, const char *str,
423 data1_node *node_data;
425 node_data = data1_mk_tag_data (dh, at, tag, nmem);
428 node_data->u.data.what = DATA1I_text;
429 node_data->u.data.len = strlen (str);
430 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
435 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
436 const char *tag, const char *str,
439 data1_node *node = data1_search_tag (dh, at->child, tag);
441 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
444 data1_node *node_data = node->child;
445 node_data->u.data.what = DATA1I_text;
446 node_data->u.data.len = strlen (str);
447 node_data->u.data.data = data1_insert_string (dh, node_data,
449 node_data->child = node_data->last_child = 0;
455 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
456 int (*get_byte)(void *fh), void *fh,
457 WRBUF wrbuf, int *ch)
459 data1_xattr *p_first = 0;
460 data1_xattr **pp = &p_first;
466 while (c && d1_isspace(c))
468 if (!c || c == '>' || c == '/')
470 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
476 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
478 wrbuf_putc (wrbuf, c);
481 wrbuf_putc (wrbuf, '\0');
482 len = wrbuf_len(wrbuf);
483 p->name = (char*) nmem_malloc (m, len);
484 strcpy (p->name, wrbuf_buf(wrbuf));
492 while (c && c != '"')
494 wrbuf_putc (wrbuf, c);
503 while (c && c != '>' && c != '/')
505 wrbuf_putc (wrbuf, c);
509 wrbuf_putc (wrbuf, '\0');
510 len = wrbuf_len(wrbuf);
511 p->value = (char*) nmem_malloc (m, len);
512 strcpy (p->value, wrbuf_buf(wrbuf));
520 * Ugh. Sometimes functions just grow and grow on you. This one reads a
521 * 'node' and its children.
523 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
524 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
526 data1_node *d1_stack[256];
536 data1_node *parent = level ? d1_stack[level-1] : 0;
537 while (c != '\0' && d1_isspace(c))
546 if (c == '<') /* beginning of tag */
562 else if (c == '!') /* tags/comments that we don't deal with yet */
564 while (c && c != '>')
570 while (c && c != '>' && c != '/' && !d1_isspace(c))
572 if (i < (sizeof(tag)-1))
577 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
580 { /* <tag attrs/> or <tag/> */
586 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
602 parent = d1_stack[--i];
603 if ((parent->which == DATA1N_root &&
604 !strcmp(tag, parent->u.root.type)) ||
605 (parent->which == DATA1N_tag &&
606 !strcmp(tag, parent->u.tag.tag)))
614 yaz_log (LOG_WARN, "%d: no begin tag for %s",
623 else if (!strcmp(tag, "var"))
625 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
629 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
631 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
635 data1_getvartypebyct(dh,
636 parent->root->u.root.absyn->varset,
640 * If we're the first variant in this group, create a parent
641 * variant, and insert it before the current variant.
643 if (parent->which != DATA1N_variant)
645 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
650 * now determine if one of our ancestor triples is of
651 * same type. If so, we break here.
654 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
655 if (d1_stack[i]->u.variant.type == tp)
660 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
661 res->u.variant.type = tp;
662 res->u.variant.value =
663 data1_insert_string (dh, res, m, args + val_offset);
669 /* tag .. acquire our element in the abstract syntax */
672 parent = data1_mk_root (dh, m, tag);
673 d1_stack[level++] = parent;
675 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
676 res->u.tag.attributes = xattr;
678 d1_stack[level] = res;
679 d1_stack[level+1] = 0;
680 if (level < 250 && !null_tag)
683 else /* != '<'... this is a body of text */
687 int len, prev_char = 0;
694 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
695 res->u.data.what = DATA1I_text;
696 res->u.data.formatted_text = 0;
697 d1_stack[level] = res;
701 while (c && c != '<')
703 wrbuf_putc (wrbuf, c);
706 len = wrbuf_len(wrbuf);
708 /* use local buffer of nmem if too large */
709 if (len >= DATA1_LOCALDATA)
710 res->u.data.data = (char*) nmem_malloc (m, len);
712 res->u.data.data = res->lbuf;
714 /* read "data" and transfer while removing white space */
715 dst = res->u.data.data;
716 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
720 if (d1_isspace (*src))
732 res->u.data.len = dst - res->u.data.data;
738 int getc_mem (void *fh)
740 const char **p = (const char **) fh;
746 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
748 WRBUF wrbuf = wrbuf_alloc();
751 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
752 wrbuf_free (wrbuf, 1);
757 * Read a record in the native syntax.
759 data1_node *data1_read_record(data1_handle dh,
760 int (*rf)(void *, char *, size_t), void *fh,
764 char **buf = data1_get_read_buf (dh, &size);
769 *buf = (char *)xmalloc(*size = 4096);
773 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
775 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
781 return data1_read_node(dh, &bp, m);
790 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
792 const char *bp = buf;
793 return data1_read_node (dh, &bp, m);