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.41 2002-05-07 11:02:56 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;
73 r->u.tag.attributes = 0;
84 r->u.data.formatted_text = 0;
87 r->u.variant.type = 0;
88 r->u.variant.value = 0;
91 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
96 void data1_free_tree (data1_handle dh, data1_node *t)
98 data1_node *p = t->child, *pn;
103 data1_free_tree (dh, p);
110 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
112 data1_absyn *absyn = data1_get_absyn (dh, name);
116 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
118 /* It's now OK for a record not to have an absyn */
120 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
121 res->u.root.type = data1_insert_string (dh, res, nmem, name);
122 res->u.root.absyn = absyn;
126 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
127 const char *tag, size_t len, data1_node *at)
129 data1_node *partag = get_parent_tag(dh, at);
130 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
131 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,
143 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
144 const char *tag, data1_node *at)
146 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), at);
149 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
152 for (; n; n = n->next)
153 if (n->which == DATA1N_tag && n->u.tag.tag &&
154 !yaz_matchstr (tag, n->u.tag.tag))
161 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
162 const char *tag, data1_node *at)
164 data1_node *node = data1_search_tag (dh, at->child, tag);
166 node = data1_mk_tag (dh, nmem, tag, at);
168 node->child = node->last_child = 0;
173 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
174 const char *buf, size_t len, data1_node *parent)
176 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
177 res->u.data.what = DATA1I_text;
178 res->u.data.len = len;
180 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
185 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
186 const char *buf, data1_node *parent)
188 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
191 char *data1_insert_string_n (data1_handle dh, data1_node *res,
192 NMEM m, const char *str, size_t len)
195 if (len >= DATA1_LOCALDATA)
196 b = nmem_malloc (m, len+1);
199 memcpy (b, str, len);
204 char *data1_insert_string (data1_handle dh, data1_node *res,
205 NMEM m, const char *str)
207 return data1_insert_string_n (dh, res, m, str, strlen(str));
210 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
212 const char *tagname, NMEM m,
215 data1_node *root = at->root;
216 data1_node *partag = get_parent_tag (dh, at);
217 data1_element *e = NULL;
218 data1_node *datn = 0;
219 data1_node *tagn = 0;
222 e = partag->u.tag.element;
223 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
224 if (local_allowed || e)
226 tagn = data1_mk_node2 (dh, m, DATA1N_tag, at);
227 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
228 tagn->u.tag.element = e;
229 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
234 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
235 const char *tagname, NMEM m)
237 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
242 * Insert a tagged node into the record root as first child of the node at
243 * which should be root or tag itself). Returns pointer to the data node,
244 * which can then be modified.
246 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
247 const char *tagname, NMEM m)
249 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
252 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
253 data1_node *at, const char *tagname,
256 return data1_add_insert_taggeddata (dh, at, tagname, m, 0);
259 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
260 data1_node *at, const char *tagname,
263 return data1_add_insert_taggeddata (dh, at, tagname, m, 1);
266 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
267 const char *tag, int num,
270 data1_node *node_data;
272 node_data = data1_mk_tag_data (dh, at, tag, nmem);
275 node_data->u.data.what = DATA1I_num;
276 node_data->u.data.data = node_data->lbuf;
277 sprintf (node_data->u.data.data, "%d", num);
278 node_data->u.data.len = strlen (node_data->u.data.data);
282 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
283 const char *tag, Odr_oid *oid,
286 data1_node *node_data;
287 char str[128], *p = str;
290 node_data = data1_mk_tag_data (dh, at, tag, nmem);
294 for (ii = oid; *ii >= 0; ii++)
298 sprintf (p, "%d", *ii);
301 node_data->u.data.what = DATA1I_oid;
302 node_data->u.data.len = strlen (str);
303 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
308 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
309 const char *tag, const char *str,
312 data1_node *node_data;
314 node_data = data1_mk_tag_data (dh, at, tag, nmem);
317 node_data->u.data.what = DATA1I_text;
318 node_data->u.data.len = strlen (str);
319 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
324 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
325 const char *tag, const char *str,
328 data1_node *node = data1_search_tag (dh, at->child, tag);
330 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
333 data1_node *node_data = node->child;
334 node_data->u.data.what = DATA1I_text;
335 node_data->u.data.len = strlen (str);
336 node_data->u.data.data = data1_insert_string (dh, node_data,
338 node_data->child = node_data->last_child = 0;
344 #if DATA1_USING_XATTR
345 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
346 int (*get_byte)(void *fh), void *fh,
347 WRBUF wrbuf, int *ch)
349 data1_xattr *p_first = 0;
350 data1_xattr **pp = &p_first;
356 while (c && d1_isspace(c))
358 if (!c || c == '>' || c == '/')
360 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
366 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
368 wrbuf_putc (wrbuf, c);
371 wrbuf_putc (wrbuf, '\0');
372 len = wrbuf_len(wrbuf);
373 p->name = (char*) nmem_malloc (m, len);
374 strcpy (p->name, wrbuf_buf(wrbuf));
382 while (c && c != '"')
384 wrbuf_putc (wrbuf, c);
393 while (c && c != '>' && c != '/')
395 wrbuf_putc (wrbuf, c);
399 wrbuf_putc (wrbuf, '\0');
400 len = wrbuf_len(wrbuf);
401 p->value = (char*) nmem_malloc (m, len);
402 strcpy (p->value, wrbuf_buf(wrbuf));
411 * Ugh. Sometimes functions just grow and grow on you. This one reads a
412 * 'node' and its children.
414 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
415 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
417 data1_node *d1_stack[256];
427 data1_node *parent = level ? d1_stack[level-1] : 0;
428 while (c != '\0' && d1_isspace(c))
437 if (c == '<') /* beginning of tag */
439 #if DATA1_USING_XATTR
454 else if (c == '!') /* tags/comments that we don't deal with yet */
456 while (c && c != '>')
462 while (c && c != '>' && c != '/' && !d1_isspace(c))
464 if (i < (sizeof(tag)-1))
469 #if DATA1_USING_XATTR
470 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c);
473 while (d1_isspace(c))
475 for (i = 0; c && c != '>' && c != '/'; c = (*get_byte)(fh))
476 if (i < (sizeof(args)-1))
481 { /* <tag attrs/> or <tag/> */
487 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
503 parent = d1_stack[--i];
504 if ((parent->which == DATA1N_root &&
505 !strcmp(tag, parent->u.root.type)) ||
506 (parent->which == DATA1N_tag &&
507 !strcmp(tag, parent->u.tag.tag)))
515 yaz_log (LOG_WARN, "%d: no begin tag for %s",
524 if (level == 0) /* root ? */
526 res = data1_mk_root (dh, m, tag);
528 else if (!strcmp(tag, "var"))
530 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
534 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
536 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
540 data1_getvartypebyct(dh,
541 parent->root->u.root.absyn->varset,
545 * If we're the first variant in this group, create a parent
546 * variant, and insert it before the current variant.
548 if (parent->which != DATA1N_variant)
550 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
555 * now determine if one of our ancestor triples is of
556 * same type. If so, we break here.
559 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
560 if (d1_stack[i]->u.variant.type == tp)
565 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
566 res->u.variant.type = tp;
567 res->u.variant.value =
568 data1_insert_string (dh, res, m, args + val_offset);
571 else /* tag.. acquire our element in the abstract syntax */
572 res = data1_mk_tag (dh, m, tag, parent);
573 d1_stack[level] = res;
574 d1_stack[level+1] = 0;
575 if (level < 250 && !null_tag)
578 else /* != '<'... this is a body of text */
582 int len, prev_char = 0;
589 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
590 res->u.data.what = DATA1I_text;
591 res->u.data.formatted_text = 0;
592 d1_stack[level] = res;
596 while (c && c != '<')
598 wrbuf_putc (wrbuf, c);
601 len = wrbuf_len(wrbuf);
603 /* use local buffer of nmem if too large */
604 if (len >= DATA1_LOCALDATA)
605 res->u.data.data = (char*) nmem_malloc (m, len);
607 res->u.data.data = res->lbuf;
609 /* read "data" and transfer while removing white space */
610 dst = res->u.data.data;
611 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
615 if (d1_isspace (*src))
627 res->u.data.len = dst - res->u.data.data;
633 int getc_mem (void *fh)
635 const char **p = (const char **) fh;
641 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
643 WRBUF wrbuf = wrbuf_alloc();
646 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
647 wrbuf_free (wrbuf, 1);
652 * Read a record in the native syntax.
654 data1_node *data1_read_record(data1_handle dh,
655 int (*rf)(void *, char *, size_t), void *fh,
659 char **buf = data1_get_read_buf (dh, &size);
664 *buf = (char *)xmalloc(*size = 4096);
668 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
670 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
676 return data1_read_node(dh, &bp, m);
685 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
687 const char *bp = buf;
688 return data1_read_node (dh, &bp, m);