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.43 2002-05-21 07:43:16 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++);
145 (*p)->value = nmem_strdup (nmem, *attr++);
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);
193 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
194 const char *buf, data1_node *parent)
196 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
199 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
200 const char *buf, size_t len,
203 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
204 res->u.data.what = DATA1I_text;
205 res->u.data.len = len;
207 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
211 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
212 const char *buf, data1_node *parent)
214 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
217 char *data1_insert_string_n (data1_handle dh, data1_node *res,
218 NMEM m, const char *str, size_t len)
221 if (len >= DATA1_LOCALDATA)
222 b = nmem_malloc (m, len+1);
225 memcpy (b, str, len);
230 char *data1_insert_string (data1_handle dh, data1_node *res,
231 NMEM m, const char *str)
233 return data1_insert_string_n (dh, res, m, str, strlen(str));
236 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
238 const char *tagname, NMEM m,
241 data1_node *root = at->root;
242 data1_node *partag = get_parent_tag (dh, at);
243 data1_element *e = NULL;
244 data1_node *datn = 0;
245 data1_node *tagn = 0;
248 e = partag->u.tag.element;
249 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
250 if (local_allowed || e)
252 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
253 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
254 tagn->u.tag.element = e;
255 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
260 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
261 const char *tagname, NMEM m)
263 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
268 * Insert a tagged node into the record root as first child of the node at
269 * which should be root or tag itself). Returns pointer to the data node,
270 * which can then be modified.
272 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
273 const char *tagname, NMEM m)
275 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
278 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
279 data1_node *at, const char *tagname,
282 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
285 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
286 data1_node *at, const char *tagname,
289 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
292 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
293 const char *tag, int num,
296 data1_node *node_data;
298 node_data = data1_mk_tag_data (dh, at, tag, nmem);
301 node_data->u.data.what = DATA1I_num;
302 node_data->u.data.data = node_data->lbuf;
303 sprintf (node_data->u.data.data, "%d", num);
304 node_data->u.data.len = strlen (node_data->u.data.data);
308 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
309 const char *tag, Odr_oid *oid,
312 data1_node *node_data;
313 char str[128], *p = str;
316 node_data = data1_mk_tag_data (dh, at, tag, nmem);
320 for (ii = oid; *ii >= 0; ii++)
324 sprintf (p, "%d", *ii);
327 node_data->u.data.what = DATA1I_oid;
328 node_data->u.data.len = strlen (str);
329 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
334 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
335 const char *tag, const char *str,
338 data1_node *node_data;
340 node_data = data1_mk_tag_data (dh, at, tag, nmem);
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, nmem, str);
350 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
351 const char *tag, const char *str,
354 data1_node *node = data1_search_tag (dh, at->child, tag);
356 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
359 data1_node *node_data = node->child;
360 node_data->u.data.what = DATA1I_text;
361 node_data->u.data.len = strlen (str);
362 node_data->u.data.data = data1_insert_string (dh, node_data,
364 node_data->child = node_data->last_child = 0;
370 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
371 int (*get_byte)(void *fh), void *fh,
372 WRBUF wrbuf, int *ch)
374 data1_xattr *p_first = 0;
375 data1_xattr **pp = &p_first;
381 while (c && d1_isspace(c))
383 if (!c || c == '>' || c == '/')
385 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
391 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
393 wrbuf_putc (wrbuf, c);
396 wrbuf_putc (wrbuf, '\0');
397 len = wrbuf_len(wrbuf);
398 p->name = (char*) nmem_malloc (m, len);
399 strcpy (p->name, wrbuf_buf(wrbuf));
407 while (c && c != '"')
409 wrbuf_putc (wrbuf, c);
418 while (c && c != '>' && c != '/')
420 wrbuf_putc (wrbuf, c);
424 wrbuf_putc (wrbuf, '\0');
425 len = wrbuf_len(wrbuf);
426 p->value = (char*) nmem_malloc (m, len);
427 strcpy (p->value, wrbuf_buf(wrbuf));
435 * Ugh. Sometimes functions just grow and grow on you. This one reads a
436 * 'node' and its children.
438 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
439 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
441 data1_node *d1_stack[256];
451 data1_node *parent = level ? d1_stack[level-1] : 0;
452 while (c != '\0' && d1_isspace(c))
461 if (c == '<') /* beginning of tag */
477 else if (c == '!') /* tags/comments that we don't deal with yet */
479 while (c && c != '>')
485 while (c && c != '>' && c != '/' && !d1_isspace(c))
487 if (i < (sizeof(tag)-1))
492 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
495 { /* <tag attrs/> or <tag/> */
501 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
517 parent = d1_stack[--i];
518 if ((parent->which == DATA1N_root &&
519 !strcmp(tag, parent->u.root.type)) ||
520 (parent->which == DATA1N_tag &&
521 !strcmp(tag, parent->u.tag.tag)))
529 yaz_log (LOG_WARN, "%d: no begin tag for %s",
538 if (level == 0) /* root ? */
540 res = data1_mk_root (dh, m, tag);
542 else if (!strcmp(tag, "var"))
544 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
548 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
550 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
554 data1_getvartypebyct(dh,
555 parent->root->u.root.absyn->varset,
559 * If we're the first variant in this group, create a parent
560 * variant, and insert it before the current variant.
562 if (parent->which != DATA1N_variant)
564 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
569 * now determine if one of our ancestor triples is of
570 * same type. If so, we break here.
573 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
574 if (d1_stack[i]->u.variant.type == tp)
579 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
580 res->u.variant.type = tp;
581 res->u.variant.value =
582 data1_insert_string (dh, res, m, args + val_offset);
587 /* tag.. acquire our element in the abstract syntax */
588 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
589 res->u.tag.attributes = xattr;
591 d1_stack[level] = res;
592 d1_stack[level+1] = 0;
593 if (level < 250 && !null_tag)
596 else /* != '<'... this is a body of text */
600 int len, prev_char = 0;
607 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
608 res->u.data.what = DATA1I_text;
609 res->u.data.formatted_text = 0;
610 d1_stack[level] = res;
614 while (c && c != '<')
616 wrbuf_putc (wrbuf, c);
619 len = wrbuf_len(wrbuf);
621 /* use local buffer of nmem if too large */
622 if (len >= DATA1_LOCALDATA)
623 res->u.data.data = (char*) nmem_malloc (m, len);
625 res->u.data.data = res->lbuf;
627 /* read "data" and transfer while removing white space */
628 dst = res->u.data.data;
629 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
633 if (d1_isspace (*src))
645 res->u.data.len = dst - res->u.data.data;
651 int getc_mem (void *fh)
653 const char **p = (const char **) fh;
659 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
661 WRBUF wrbuf = wrbuf_alloc();
664 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
665 wrbuf_free (wrbuf, 1);
670 * Read a record in the native syntax.
672 data1_node *data1_read_record(data1_handle dh,
673 int (*rf)(void *, char *, size_t), void *fh,
677 char **buf = data1_get_read_buf (dh, &size);
682 *buf = (char *)xmalloc(*size = 4096);
686 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
688 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
694 return data1_read_node(dh, &bp, m);
703 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
705 const char *bp = buf;
706 return data1_read_node (dh, &bp, m);