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.40 2002-05-03 13:48:27 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, int type,
34 r = (data1_node *)nmem_malloc(m, sizeof(*r));
35 r->next = r->child = r->last_child = 0;
41 assert (type == DATA1N_root);
45 r->root = parent->root;
48 parent->child = parent->last_child = r;
50 parent->last_child->next = r;
51 parent->last_child = r;
59 r->u.tag.no_data_requested = 0;
60 r->u.tag.node_selected = 0;
61 r->u.tag.make_variantlist = 0;
62 r->u.tag.get_bytes = -1;
64 r->u.tag.attributes = 0;
75 r->u.data.formatted_text = 0;
78 r->u.variant.type = 0;
79 r->u.variant.value = 0;
82 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
87 void data1_free_tree (data1_handle dh, data1_node *t)
89 data1_node *p = t->child, *pn;
94 data1_free_tree (dh, p);
101 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
103 data1_absyn *absyn = data1_get_absyn (dh, name);
107 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
109 /* It's now OK for a record not to have an absyn */
111 res = data1_mk_node (dh, nmem, DATA1N_root, 0);
112 res->u.root.type = data1_insert_string (dh, res, nmem, name);
113 res->u.root.absyn = absyn;
117 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
118 const char *tag, size_t len, data1_node *at)
120 data1_node *partag = get_parent_tag(dh, at);
121 data1_node *res = data1_mk_node (dh, nmem, DATA1N_tag, at);
122 data1_element *e = NULL;
124 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
127 e = partag->u.tag.element;
129 data1_getelementbytagname (dh, at->root->u.root.absyn,
134 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
135 const char *tag, data1_node *at)
137 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), at);
140 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
143 for (; n; n = n->next)
144 if (n->which == DATA1N_tag && n->u.tag.tag &&
145 !yaz_matchstr (tag, n->u.tag.tag))
152 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
153 const char *tag, data1_node *at)
155 data1_node *node = data1_search_tag (dh, at->child, tag);
157 node = data1_mk_tag (dh, nmem, tag, at);
162 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
163 const char *buf, size_t len, data1_node *parent)
165 data1_node *res = data1_mk_node (dh, mem, DATA1N_data, parent);
166 res->u.data.what = DATA1I_text;
167 res->u.data.len = len;
169 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
174 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
175 const char *buf, data1_node *parent)
177 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
180 char *data1_insert_string_n (data1_handle dh, data1_node *res,
181 NMEM m, const char *str, size_t len)
184 if (len >= DATA1_LOCALDATA)
185 b = nmem_malloc (m, len+1);
188 memcpy (b, str, len);
193 char *data1_insert_string (data1_handle dh, data1_node *res,
194 NMEM m, const char *str)
196 return data1_insert_string_n (dh, res, m, str, strlen(str));
199 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
202 const char *tagname, NMEM m,
205 data1_node *partag = get_parent_tag (dh, at);
206 data1_element *e = NULL;
207 data1_node *datn = 0;
208 data1_node *tagn = 0;
211 e = partag->u.tag.element;
212 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
213 if (local_allowed || e)
215 tagn = data1_mk_node (dh, m, DATA1N_tag, at);
216 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
217 tagn->u.tag.element = e;
218 datn = data1_mk_node (dh, m, DATA1N_data, tagn);
223 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *root,
225 const char *tagname, NMEM m)
227 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 1);
232 * Insert a tagged node into the record root as first child of the node at
233 * which should be root or tag itself). Returns pointer to the data node,
234 * which can then be modified.
236 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *root,
238 const char *tagname, NMEM m)
240 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 0);
244 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
245 const char *tag, int num,
248 data1_node *node_data;
250 node_data = data1_mk_tag_data (dh, at->root, at, tag, nmem);
253 node_data->u.data.what = DATA1I_num;
254 node_data->u.data.data = node_data->lbuf;
255 sprintf (node_data->u.data.data, "%d", num);
256 node_data->u.data.len = strlen (node_data->u.data.data);
260 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
261 const char *tag, Odr_oid *oid,
264 data1_node *node_data;
265 char str[128], *p = str;
268 node_data = data1_mk_tag_data (dh, at->root, at, tag, nmem);
272 for (ii = oid; *ii >= 0; ii++)
276 sprintf (p, "%d", *ii);
279 node_data->u.data.what = DATA1I_oid;
280 node_data->u.data.len = strlen (str);
281 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
286 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
287 const char *tag, const char *str,
290 data1_node *node_data;
292 node_data = data1_mk_tag_data (dh, at->root, at, tag, nmem);
295 node_data->u.data.what = DATA1I_text;
296 node_data->u.data.len = strlen (str);
297 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
302 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
303 const char *tag, const char *str,
306 data1_node *node = data1_search_tag (dh, at->child, tag);
308 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
311 data1_node *node_data = node->child;
312 node_data->u.data.what = DATA1I_text;
313 node_data->u.data.len = strlen (str);
314 node_data->u.data.data = data1_insert_string (dh, node_data,
321 #if DATA1_USING_XATTR
322 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
323 int (*get_byte)(void *fh), void *fh,
324 WRBUF wrbuf, int *ch)
326 data1_xattr *p_first = 0;
327 data1_xattr **pp = &p_first;
333 while (c && d1_isspace(c))
335 if (!c || c == '>' || c == '/')
337 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
343 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
345 wrbuf_putc (wrbuf, c);
348 wrbuf_putc (wrbuf, '\0');
349 len = wrbuf_len(wrbuf);
350 p->name = (char*) nmem_malloc (m, len);
351 strcpy (p->name, wrbuf_buf(wrbuf));
359 while (c && c != '"')
361 wrbuf_putc (wrbuf, c);
370 while (c && c != '>' && c != '/')
372 wrbuf_putc (wrbuf, c);
376 wrbuf_putc (wrbuf, '\0');
377 len = wrbuf_len(wrbuf);
378 p->value = (char*) nmem_malloc (m, len);
379 strcpy (p->value, wrbuf_buf(wrbuf));
388 * Ugh. Sometimes functions just grow and grow on you. This one reads a
389 * 'node' and its children.
391 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
392 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
394 data1_node *d1_stack[256];
404 data1_node *parent = level ? d1_stack[level-1] : 0;
405 while (c != '\0' && d1_isspace(c))
414 if (c == '<') /* beginning of tag */
416 #if DATA1_USING_XATTR
431 else if (c == '!') /* tags/comments that we don't deal with yet */
433 while (c && c != '>')
439 while (c && c != '>' && c != '/' && !d1_isspace(c))
441 if (i < (sizeof(tag)-1))
446 #if DATA1_USING_XATTR
447 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
450 while (d1_isspace(c))
452 for (i = 0; c && c != '>' && c != '/'; c = (*get_byte)(fh))
453 if (i < (sizeof(args)-1))
458 { /* <tag attrs/> or <tag/> */
464 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
480 parent = d1_stack[--i];
481 if ((parent->which == DATA1N_root &&
482 !strcmp(tag, parent->u.root.type)) ||
483 (parent->which == DATA1N_tag &&
484 !strcmp(tag, parent->u.tag.tag)))
492 yaz_log (LOG_WARN, "%d: no begin tag for %s",
501 if (level == 0) /* root ? */
503 res = data1_mk_root (dh, m, tag);
505 else if (!strcmp(tag, "var"))
507 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
511 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
513 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
517 data1_getvartypebyct(dh,
518 parent->root->u.root.absyn->varset,
522 * If we're the first variant in this group, create a parent
523 * variant, and insert it before the current variant.
525 if (parent->which != DATA1N_variant)
527 res = data1_mk_node (dh, m, DATA1N_variant, parent);
532 * now determine if one of our ancestor triples is of
533 * same type. If so, we break here.
536 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
537 if (d1_stack[i]->u.variant.type == tp)
542 res = data1_mk_node (dh, m, DATA1N_variant, parent);
543 res->u.variant.type = tp;
544 res->u.variant.value =
545 data1_insert_string (dh, res, m, args + val_offset);
548 else /* tag.. acquire our element in the abstract syntax */
549 res = data1_mk_tag (dh, m, tag, parent);
550 d1_stack[level] = res;
551 d1_stack[level+1] = 0;
552 if (level < 250 && !null_tag)
555 else /* != '<'... this is a body of text */
559 int len, prev_char = 0;
566 res = data1_mk_node (dh, m, DATA1N_data, parent);
567 res->u.data.what = DATA1I_text;
568 res->u.data.formatted_text = 0;
569 d1_stack[level] = res;
573 while (c && c != '<')
575 wrbuf_putc (wrbuf, c);
578 len = wrbuf_len(wrbuf);
580 /* use local buffer of nmem if too large */
581 if (len >= DATA1_LOCALDATA)
582 res->u.data.data = (char*) nmem_malloc (m, len);
584 res->u.data.data = res->lbuf;
586 /* read "data" and transfer while removing white space */
587 dst = res->u.data.data;
588 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
592 if (d1_isspace (*src))
604 res->u.data.len = dst - res->u.data.data;
610 int getc_mem (void *fh)
612 const char **p = (const char **) fh;
618 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
620 WRBUF wrbuf = wrbuf_alloc();
623 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
624 wrbuf_free (wrbuf, 1);
629 * Read a record in the native syntax.
631 data1_node *data1_read_record(data1_handle dh,
632 int (*rf)(void *, char *, size_t), void *fh,
636 char **buf = data1_get_read_buf (dh, &size);
641 *buf = (char *)xmalloc(*size = 4096);
645 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
647 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
653 return data1_read_node(dh, &bp, m);
662 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
664 const char *bp = buf;
665 return data1_read_node (dh, &bp, m);