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.39 2002-04-15 09:06:30 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)
33 r = (data1_node *)nmem_malloc(m, sizeof(*r));
34 r->next = r->child = r->last_child = r->parent = 0;
39 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
43 r = data1_mk_node(dh, m);
50 r->u.tag.no_data_requested = 0;
51 r->u.tag.node_selected = 0;
52 r->u.tag.make_variantlist = 0;
53 r->u.tag.get_bytes = -1;
55 r->u.tag.attributes = 0;
66 r->u.data.formatted_text = 0;
69 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
74 void data1_free_tree (data1_handle dh, data1_node *t)
76 data1_node *p = t->child, *pn;
81 data1_free_tree (dh, p);
88 char *data1_insert_string (data1_handle dh, data1_node *res,
89 NMEM m, const char *str)
91 int len = strlen(str);
93 if (len >= DATA1_LOCALDATA)
94 return nmem_strdup (m, str);
97 strcpy (res->lbuf, str);
102 data1_node *data1_add_insert_taggeddata(data1_handle dh, data1_node *root,
104 const char *tagname, NMEM m,
105 int first_flag, int local_allowed)
107 data1_node *partag = get_parent_tag (dh, at);
108 data1_node *tagn = data1_mk_node_type (dh, m, DATA1N_tag);
109 data1_element *e = NULL;
112 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
115 e = partag->u.tag.element;
116 tagn->u.tag.element =
117 data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
118 if (!local_allowed && !tagn->u.tag.element)
120 tagn->last_child = tagn->child = datn = data1_mk_node_type (dh, m, DATA1N_data);
124 datn->u.data.formatted_text = 0;
129 tagn->next = at->child;
131 at->last_child = tagn;
140 assert (at->last_child);
141 at->last_child->next = tagn;
143 at->last_child = tagn;
148 data1_node *data1_add_taggeddata(data1_handle dh, data1_node *root,
150 const char *tagname, NMEM m)
152 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 0, 1);
157 * Insert a tagged node into the record root as first child of the node at
158 * which should be root or tag itself). Returns pointer to the data node,
159 * which can then be modified.
161 data1_node *data1_insert_taggeddata(data1_handle dh, data1_node *root,
163 const char *tagname, NMEM m)
165 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 1, 0);
168 #if DATA1_USING_XATTR
169 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
170 int (*get_byte)(void *fh), void *fh,
171 WRBUF wrbuf, int *ch)
173 data1_xattr *p_first = 0;
174 data1_xattr **pp = &p_first;
180 while (c && d1_isspace(c))
182 if (!c || c == '>' || c == '/')
184 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
190 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
192 wrbuf_putc (wrbuf, c);
195 wrbuf_putc (wrbuf, '\0');
196 len = wrbuf_len(wrbuf);
197 p->name = (char*) nmem_malloc (m, len);
198 strcpy (p->name, wrbuf_buf(wrbuf));
206 while (c && c != '"')
208 wrbuf_putc (wrbuf, c);
217 while (c && c != '>' && c != '/')
219 wrbuf_putc (wrbuf, c);
223 wrbuf_putc (wrbuf, '\0');
224 len = wrbuf_len(wrbuf);
225 p->value = (char*) nmem_malloc (m, len);
226 strcpy (p->value, wrbuf_buf(wrbuf));
235 * Ugh. Sometimes functions just grow and grow on you. This one reads a
236 * 'node' and its children.
238 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
239 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
241 data1_absyn *absyn = 0;
242 data1_node *d1_stack[256];
252 data1_node *parent = level ? d1_stack[level-1] : 0;
253 while (c != '\0' && d1_isspace(c))
262 if (c == '<') /* beginning of tag */
264 #if DATA1_USING_XATTR
279 else if (c == '!') /* tags/comments that we don't deal with yet */
281 while (c && c != '>')
287 while (c && c != '>' && c != '/' && !d1_isspace(c))
289 if (i < (sizeof(tag)-1))
294 #if DATA1_USING_XATTR
295 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
298 while (d1_isspace(c))
300 for (i = 0; c && c != '>' && c != '/'; c = (*get_byte)(fh))
301 if (i < (sizeof(args)-1))
306 { /* <tag attrs/> or <tag/> */
312 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
328 parent = d1_stack[--i];
329 if ((parent->which == DATA1N_root &&
330 !strcmp(tag, parent->u.root.type)) ||
331 (parent->which == DATA1N_tag &&
332 !strcmp(tag, parent->u.tag.tag)))
340 yaz_log (LOG_WARN, "%d: no begin tag for %s",
349 if (level == 0) /* root ? */
351 if (!(absyn = data1_get_absyn (dh, tag)))
353 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'", tag);
354 /* It's now OK for a record not to have an absyn */
356 res = data1_mk_node_type (dh, m, DATA1N_root);
357 res->u.root.type = data1_insert_string (dh, res, m, tag);
358 res->u.root.absyn = absyn;
361 else if (!strcmp(tag, "var"))
363 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
367 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
369 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
373 data1_getvartypebyct(dh,
374 parent->root->u.root.absyn->varset,
378 * If we're the first variant in this group, create a parent
379 * variant, and insert it before the current variant.
381 if (parent->which != DATA1N_variant)
383 res = data1_mk_node (dh, m);
384 res->which = DATA1N_variant;
385 res->u.variant.type = 0;
386 res->u.variant.value = 0;
391 * now determine if one of our ancestor triples is of
392 * same type. If so, we break here.
395 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
396 if (d1_stack[i]->u.variant.type == tp)
401 res = data1_mk_node (dh, m);
402 res->which = DATA1N_variant;
403 res->u.variant.type = tp;
404 res->u.variant.value =
405 data1_insert_string (dh, res, m, args + val_offset);
408 else /* tag.. acquire our element in the abstract syntax */
410 data1_node *partag = get_parent_tag (dh, parent);
411 data1_element *elem, *e = 0;
414 if (parent->which == DATA1N_variant)
417 if (!(e = partag->u.tag.element))
418 localtag = 1; /* our parent is a local tag */
420 elem = data1_getelementbytagname(dh, absyn, e, tag);
421 res = data1_mk_node_type (dh, m, DATA1N_tag);
422 res->u.tag.tag = data1_insert_string (dh, res, m, tag);
423 res->u.tag.element = elem;
424 #if DATA1_USING_XATTR
425 res->u.tag.attributes = xattr;
430 parent->last_child = res;
431 res->root = parent->root;
433 res->parent = parent;
435 d1_stack[level]->next = res;
438 d1_stack[level] = res;
439 d1_stack[level+1] = 0;
440 if (level < 250 && !null_tag)
443 else /* != '<'... this is a body of text */
447 int len, prev_char = 0;
454 res = data1_mk_node_type (dh, m, DATA1N_data);
455 res->parent = parent;
456 res->u.data.what = DATA1I_text;
457 res->u.data.formatted_text = 0;
458 res->root = parent->root;
459 parent->last_child = res;
461 d1_stack[level]->next = res;
464 d1_stack[level] = res;
468 while (c && c != '<')
470 wrbuf_putc (wrbuf, c);
473 len = wrbuf_len(wrbuf);
475 /* use local buffer of nmem if too large */
476 if (len >= DATA1_LOCALDATA)
477 res->u.data.data = (char*) nmem_malloc (m, len);
479 res->u.data.data = res->lbuf;
481 /* read "data" and transfer while removing white space */
482 dst = res->u.data.data;
483 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
487 if (d1_isspace (*src))
499 res->u.data.len = dst - res->u.data.data;
505 int getc_mem (void *fh)
507 const char **p = (const char **) fh;
513 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
515 WRBUF wrbuf = wrbuf_alloc();
518 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
519 wrbuf_free (wrbuf, 1);
524 * Read a record in the native syntax.
526 data1_node *data1_read_record(data1_handle dh,
527 int (*rf)(void *, char *, size_t), void *fh,
531 char **buf = data1_get_read_buf (dh, &size);
536 *buf = (char *)xmalloc(*size = 4096);
540 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
542 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
548 return data1_read_node(dh, &bp, m);
557 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
559 const char *bp = buf;
560 return data1_read_node (dh, &bp, m);