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.42 2002-05-13 14:13:37 adam Exp $
13 #include <yaz/xmalloc.h>
15 #include <yaz/data1.h>
18 * get the tag which is the immediate parent of this node (this may mean
19 * traversing intermediate things like variants and stuff.
21 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
23 for (; n && n->which != DATA1N_root; n = n->parent)
24 if (n->which == DATA1N_tag)
29 data1_node *data1_mk_node (data1_handle dh, NMEM m)
31 return data1_mk_node2 (dh, m, DATA1N_root, 0);
34 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
36 return data1_mk_node2 (dh, m, type, 0);
39 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
44 r = (data1_node *)nmem_malloc(m, sizeof(*r));
45 r->next = r->child = r->last_child = 0;
54 r->root = parent->root;
57 parent->child = parent->last_child = r;
59 parent->last_child->next = r;
60 parent->last_child = r;
68 r->u.tag.no_data_requested = 0;
69 r->u.tag.node_selected = 0;
70 r->u.tag.make_variantlist = 0;
71 r->u.tag.get_bytes = -1;
72 r->u.tag.attributes = 0;
82 r->u.data.formatted_text = 0;
85 r->u.variant.type = 0;
86 r->u.variant.value = 0;
89 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
94 void data1_free_tree (data1_handle dh, data1_node *t)
96 data1_node *p = t->child, *pn;
101 data1_free_tree (dh, p);
108 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
110 data1_absyn *absyn = data1_get_absyn (dh, name);
114 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
116 /* It's now OK for a record not to have an absyn */
118 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
119 res->u.root.type = data1_insert_string (dh, res, nmem, name);
120 res->u.root.absyn = absyn;
124 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
125 const char *tag, size_t len, const char **attr,
128 data1_node *partag = get_parent_tag(dh, at);
129 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
130 data1_element *e = NULL;
133 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
136 e = partag->u.tag.element;
138 data1_getelementbytagname (dh, at->root->u.root.absyn,
140 p = &res->u.tag.attributes;
141 while (attr && *attr)
143 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
144 (*p)->name = nmem_strdup (nmem, attr[0]);
145 (*p)->value = nmem_strdup (nmem, attr[1]);
152 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
153 const char *tag, const char **attr, data1_node *at)
155 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
158 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
161 for (; n; n = n->next)
162 if (n->which == DATA1N_tag && n->u.tag.tag &&
163 !yaz_matchstr (tag, n->u.tag.tag))
170 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
171 const char *tag, data1_node *at)
173 data1_node *node = data1_search_tag (dh, at->child, tag);
175 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
177 node->child = node->last_child = 0;
182 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
183 const char *buf, size_t len, data1_node *parent)
185 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
186 res->u.data.what = DATA1I_text;
187 res->u.data.len = len;
189 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
194 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
195 const char *buf, data1_node *parent)
197 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
200 char *data1_insert_string_n (data1_handle dh, data1_node *res,
201 NMEM m, const char *str, size_t len)
204 if (len >= DATA1_LOCALDATA)
205 b = nmem_malloc (m, len+1);
208 memcpy (b, str, len);
213 char *data1_insert_string (data1_handle dh, data1_node *res,
214 NMEM m, const char *str)
216 return data1_insert_string_n (dh, res, m, str, strlen(str));
219 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
221 const char *tagname, NMEM m,
224 data1_node *root = at->root;
225 data1_node *partag = get_parent_tag (dh, at);
226 data1_element *e = NULL;
227 data1_node *datn = 0;
228 data1_node *tagn = 0;
231 e = partag->u.tag.element;
232 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
233 if (local_allowed || e)
235 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
236 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
237 tagn->u.tag.element = e;
238 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
243 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
244 const char *tagname, NMEM m)
246 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
251 * Insert a tagged node into the record root as first child of the node at
252 * which should be root or tag itself). Returns pointer to the data node,
253 * which can then be modified.
255 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
256 const char *tagname, NMEM m)
258 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
261 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
262 data1_node *at, const char *tagname,
265 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
268 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
269 data1_node *at, const char *tagname,
272 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
275 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
276 const char *tag, int num,
279 data1_node *node_data;
281 node_data = data1_mk_tag_data (dh, at, tag, nmem);
284 node_data->u.data.what = DATA1I_num;
285 node_data->u.data.data = node_data->lbuf;
286 sprintf (node_data->u.data.data, "%d", num);
287 node_data->u.data.len = strlen (node_data->u.data.data);
291 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
292 const char *tag, Odr_oid *oid,
295 data1_node *node_data;
296 char str[128], *p = str;
299 node_data = data1_mk_tag_data (dh, at, tag, nmem);
303 for (ii = oid; *ii >= 0; ii++)
307 sprintf (p, "%d", *ii);
310 node_data->u.data.what = DATA1I_oid;
311 node_data->u.data.len = strlen (str);
312 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
317 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
318 const char *tag, const char *str,
321 data1_node *node_data;
323 node_data = data1_mk_tag_data (dh, at, tag, nmem);
326 node_data->u.data.what = DATA1I_text;
327 node_data->u.data.len = strlen (str);
328 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
333 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
334 const char *tag, const char *str,
337 data1_node *node = data1_search_tag (dh, at->child, tag);
339 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
342 data1_node *node_data = node->child;
343 node_data->u.data.what = DATA1I_text;
344 node_data->u.data.len = strlen (str);
345 node_data->u.data.data = data1_insert_string (dh, node_data,
347 node_data->child = node_data->last_child = 0;
353 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
354 int (*get_byte)(void *fh), void *fh,
355 WRBUF wrbuf, int *ch)
357 data1_xattr *p_first = 0;
358 data1_xattr **pp = &p_first;
364 while (c && d1_isspace(c))
366 if (!c || c == '>' || c == '/')
368 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
374 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
376 wrbuf_putc (wrbuf, c);
379 wrbuf_putc (wrbuf, '\0');
380 len = wrbuf_len(wrbuf);
381 p->name = (char*) nmem_malloc (m, len);
382 strcpy (p->name, wrbuf_buf(wrbuf));
390 while (c && c != '"')
392 wrbuf_putc (wrbuf, c);
401 while (c && c != '>' && c != '/')
403 wrbuf_putc (wrbuf, c);
407 wrbuf_putc (wrbuf, '\0');
408 len = wrbuf_len(wrbuf);
409 p->value = (char*) nmem_malloc (m, len);
410 strcpy (p->value, wrbuf_buf(wrbuf));
418 * Ugh. Sometimes functions just grow and grow on you. This one reads a
419 * 'node' and its children.
421 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
422 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
424 data1_node *d1_stack[256];
434 data1_node *parent = level ? d1_stack[level-1] : 0;
435 while (c != '\0' && d1_isspace(c))
444 if (c == '<') /* beginning of tag */
460 else if (c == '!') /* tags/comments that we don't deal with yet */
462 while (c && c != '>')
468 while (c && c != '>' && c != '/' && !d1_isspace(c))
470 if (i < (sizeof(tag)-1))
475 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
478 { /* <tag attrs/> or <tag/> */
484 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
500 parent = d1_stack[--i];
501 if ((parent->which == DATA1N_root &&
502 !strcmp(tag, parent->u.root.type)) ||
503 (parent->which == DATA1N_tag &&
504 !strcmp(tag, parent->u.tag.tag)))
512 yaz_log (LOG_WARN, "%d: no begin tag for %s",
521 if (level == 0) /* root ? */
523 res = data1_mk_root (dh, m, tag);
525 else if (!strcmp(tag, "var"))
527 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
531 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
533 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
537 data1_getvartypebyct(dh,
538 parent->root->u.root.absyn->varset,
542 * If we're the first variant in this group, create a parent
543 * variant, and insert it before the current variant.
545 if (parent->which != DATA1N_variant)
547 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
552 * now determine if one of our ancestor triples is of
553 * same type. If so, we break here.
556 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
557 if (d1_stack[i]->u.variant.type == tp)
562 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
563 res->u.variant.type = tp;
564 res->u.variant.value =
565 data1_insert_string (dh, res, m, args + val_offset);
570 /* tag.. acquire our element in the abstract syntax */
571 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
572 res->u.tag.attributes = xattr;
574 d1_stack[level] = res;
575 d1_stack[level+1] = 0;
576 if (level < 250 && !null_tag)
579 else /* != '<'... this is a body of text */
583 int len, prev_char = 0;
590 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
591 res->u.data.what = DATA1I_text;
592 res->u.data.formatted_text = 0;
593 d1_stack[level] = res;
597 while (c && c != '<')
599 wrbuf_putc (wrbuf, c);
602 len = wrbuf_len(wrbuf);
604 /* use local buffer of nmem if too large */
605 if (len >= DATA1_LOCALDATA)
606 res->u.data.data = (char*) nmem_malloc (m, len);
608 res->u.data.data = res->lbuf;
610 /* read "data" and transfer while removing white space */
611 dst = res->u.data.data;
612 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
616 if (d1_isspace (*src))
628 res->u.data.len = dst - res->u.data.data;
634 int getc_mem (void *fh)
636 const char **p = (const char **) fh;
642 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
644 WRBUF wrbuf = wrbuf_alloc();
647 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
648 wrbuf_free (wrbuf, 1);
653 * Read a record in the native syntax.
655 data1_node *data1_read_record(data1_handle dh,
656 int (*rf)(void *, char *, size_t), void *fh,
660 char **buf = data1_get_read_buf (dh, &size);
665 *buf = (char *)xmalloc(*size = 4096);
669 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
671 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
677 return data1_read_node(dh, &bp, m);
686 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
688 const char *bp = buf;
689 return data1_read_node (dh, &bp, m);