2 * Copyright (c) 1995-1999, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.27 1999-08-27 09:40:32 adam
8 * Renamed logf function to yaz_log. Removed VC++ project files.
10 * Revision 1.26 1999/07/13 13:23:48 adam
11 * Non-recursive version of data1_read_node. data1_read_nodex reads
12 * stream of bytes (instead of buffer in memory).
14 * Revision 1.25 1999/04/20 09:56:48 adam
15 * Added 'name' paramter to encoder/decoder routines (typedef Odr_fun).
16 * Modified all encoders/decoders to reflect this change.
18 * Revision 1.24 1998/10/28 15:10:09 adam
19 * Added --with-yc option to configure. For the data1_node in data1.h:
20 * decreased size of localdata and removed member "line" which wasn't useful.
22 * Revision 1.23 1998/03/12 11:28:45 adam
23 * Fix: didn't set root member of tagged node in function.
24 * data1_add_insert_taggeddata.
26 * Revision 1.22 1998/03/05 08:15:32 adam
27 * Implemented data1_add_insert_taggeddata utility which is more flexible
28 * than data1_insert_taggeddata.
30 * Revision 1.21 1998/02/27 14:08:05 adam
31 * Added const to some char pointer arguments.
32 * Reworked data1_read_node so that it doesn't create a tree with
33 * pointers to original "SGML"-buffer.
35 * Revision 1.20 1998/02/11 11:53:35 adam
36 * Changed code so that it compiles as C++.
38 * Revision 1.19 1997/12/09 16:17:09 adam
39 * Fix bug regarding variants. Tags with prefix "var" was incorrectly
40 * interpreted as "start of variants". Now, only "var" indicates such
42 * Cleaned up data1_read_node so tag names and variant names are
43 * copied and not pointed to by the generated data1 tree. Data nodes
44 * still point to old buffer.
46 * Revision 1.18 1997/11/18 09:51:09 adam
47 * Removed element num_children from data1_node. Minor changes in
50 * Revision 1.17 1997/11/05 09:20:51 adam
53 * Revision 1.16 1997/09/17 12:10:37 adam
56 * Revision 1.15 1997/09/05 09:50:57 adam
57 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
59 * Revision 1.14 1997/05/14 06:54:04 adam
62 * Revision 1.13 1996/10/29 13:35:38 adam
63 * Implemented data1_set_tabpath and data1_get_tabpath.
65 * Revision 1.12 1996/10/11 10:35:38 adam
66 * Fixed a bug that caused data1_read_node to core dump when no abstract
67 * syntax was defined in a "sgml"-record.
69 * Revision 1.11 1996/07/06 19:58:35 quinn
70 * System headerfiles gathered in yconfig
72 * Revision 1.10 1996/01/19 15:41:47 quinn
73 * Fixed uninitialized boolean.
75 * Revision 1.9 1996/01/17 14:52:47 adam
76 * Changed prototype for reader function parsed to data1_read_record.
78 * Revision 1.8 1995/12/15 16:20:41 quinn
79 * Added formatted text.
81 * Revision 1.7 1995/12/13 13:44:32 quinn
82 * Modified Data1-system to use nmem
84 * Revision 1.6 1995/12/12 16:37:08 quinn
85 * Added destroy element to data1_node.
87 * Revision 1.5 1995/12/11 15:22:37 quinn
88 * Added last_child field to the node.
89 * Rewrote schema-mapping.
91 * Revision 1.4 1995/11/13 09:27:36 quinn
92 * Fiddling with the variant stuff.
94 * Revision 1.3 1995/11/01 16:34:57 quinn
95 * Making data1 look for tables in data1_tabpath
97 * Revision 1.2 1995/11/01 13:54:48 quinn
100 * Revision 1.1 1995/11/01 11:56:09 quinn
101 * Added Retrieval (data management) functions en masse.
103 * Revision 1.14 1995/10/30 12:40:55 quinn
104 * Fixed a couple of bugs.
106 * Revision 1.13 1995/10/25 16:00:47 quinn
107 * USMARC support is now almost operational
109 * Revision 1.12 1995/10/16 14:02:55 quinn
110 * Changes to support element set names and espec1
112 * Revision 1.11 1995/10/13 16:05:08 quinn
113 * Adding Espec1-processing
115 * Revision 1.10 1995/10/11 14:53:44 quinn
118 * Revision 1.9 1995/10/06 16:56:50 quinn
119 * Fixed ranked result.
121 * Revision 1.8 1995/10/06 16:44:13 quinn
122 * Work on attribute set mapping, etc.
124 * Revision 1.7 1995/10/06 12:58:35 quinn
127 * Revision 1.6 1995/10/04 09:29:49 quinn
128 * Adjustments to support USGS test data
130 * Revision 1.5 1995/10/03 17:56:43 quinn
133 * Revision 1.4 1995/10/02 15:53:19 quinn
136 * Revision 1.3 1995/10/02 14:55:21 quinn
137 * *** empty log message ***
139 * Revision 1.2 1995/09/14 15:18:13 quinn
142 * Revision 1.1 1995/09/12 11:24:30 quinn
143 * Beginning to add code for structured records.
158 * get the tag which is the immediate parent of this node (this may mean
159 * traversing intermediate things like variants and stuff.
161 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
163 for (; n && n->which != DATA1N_root; n = n->parent)
164 if (n->which == DATA1N_tag)
169 data1_node *data1_mk_node (data1_handle dh, NMEM m)
173 r = (data1_node *)nmem_malloc(m, sizeof(*r));
174 r->next = r->child = r->last_child = r->parent = 0;
179 void data1_free_tree (data1_handle dh, data1_node *t)
181 data1_node *p = t->child, *pn;
186 data1_free_tree (dh, p);
193 char *data1_insert_string (data1_handle dh, data1_node *res,
194 NMEM m, const char *str)
196 int len = strlen(str);
198 if (len >= DATA1_LOCALDATA)
199 return nmem_strdup (m, str);
202 strcpy (res->lbuf, str);
207 data1_node *data1_add_insert_taggeddata(data1_handle dh, data1_node *root,
209 const char *tagname, NMEM m,
210 int first_flag, int local_allowed)
212 data1_node *partag = get_parent_tag (dh, at);
213 data1_node *tagn = data1_mk_node (dh, m);
214 data1_element *e = NULL;
217 tagn->which = DATA1N_tag;
218 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
219 tagn->u.tag.node_selected = 0;
220 tagn->u.tag.make_variantlist = 0;
221 tagn->u.tag.no_data_requested = 0;
222 tagn->u.tag.get_bytes = -1;
225 e = partag->u.tag.element;
226 tagn->u.tag.element =
227 data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
228 if (!local_allowed && !tagn->u.tag.element)
230 tagn->last_child = tagn->child = datn = data1_mk_node (dh, m);
234 datn->which = DATA1N_data;
235 datn->u.data.formatted_text = 0;
240 tagn->next = at->child;
242 at->last_child = tagn;
251 assert (at->last_child);
252 at->last_child->next = tagn;
254 at->last_child = tagn;
259 data1_node *data1_add_taggeddata(data1_handle dh, data1_node *root,
261 const char *tagname, NMEM m)
263 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 0, 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_insert_taggeddata(data1_handle dh, data1_node *root,
274 const char *tagname, NMEM m)
276 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 1, 0);
280 * Ugh. Sometimes functions just grow and grow on you. This one reads a
281 * 'node' and its children.
283 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
284 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
286 data1_absyn *absyn = 0;
287 data1_node *d1_stack[256];
297 data1_node *parent = level ? d1_stack[level-1] : 0;
298 while (c != '\0' && isspace(c))
307 if (c == '<') /* beginning of tag */
313 for (i = 0; (c=(*get_byte)(fh)) && c != '>' && !isspace(c);)
314 if (i < (sizeof(tag)-1))
319 for (i = 0; c && c != '>'; c = (*get_byte)(fh))
320 if (i < (sizeof(args)-1))
325 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
341 parent = d1_stack[--i];
342 if ((parent->which == DATA1N_root &&
343 !strcmp(tag+1, parent->u.root.type)) ||
344 (parent->which == DATA1N_tag &&
345 !strcmp(tag+1, parent->u.tag.tag)))
353 yaz_log (LOG_WARN, "%d: no begin tag for %s",
362 if (level == 0) /* root ? */
364 if (!(absyn = data1_get_absyn (dh, tag)))
366 yaz_log(LOG_WARN, "Unable to acquire abstract syntax "
370 res = data1_mk_node (dh, m);
371 res->which = DATA1N_root;
372 res->u.root.type = data1_insert_string (dh, res, m, tag);
373 res->u.root.absyn = absyn;
376 else if (!strcmp(tag, "var"))
378 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
382 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
384 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
388 data1_getvartypebyct(dh,
389 parent->root->u.root.absyn->varset,
393 * If we're the first variant in this group, create a parent
394 * variant, and insert it before the current variant.
396 if (parent->which != DATA1N_variant)
398 res = data1_mk_node (dh, m);
399 res->which = DATA1N_variant;
400 res->u.variant.type = 0;
401 res->u.variant.value = 0;
406 * now determine if one of our ancestor triples is of
407 * same type. If so, we break here.
410 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
411 if (d1_stack[i]->u.variant.type == tp)
416 res = data1_mk_node (dh, m);
417 res->which = DATA1N_variant;
418 res->u.variant.type = tp;
419 res->u.variant.value =
420 data1_insert_string (dh, res, m, args + val_offset);
423 else /* tag.. acquire our element in the abstract syntax */
425 data1_node *partag = get_parent_tag (dh, parent);
426 data1_element *elem, *e = 0;
429 if (parent->which == DATA1N_variant)
432 if (!(e = partag->u.tag.element))
433 localtag = 1; /* our parent is a local tag */
435 elem = data1_getelementbytagname(dh, absyn, e, tag);
436 res = data1_mk_node (dh, m);
437 res->which = DATA1N_tag;
438 res->u.tag.tag = data1_insert_string (dh, res, m, tag);
439 res->u.tag.element = elem;
440 res->u.tag.node_selected = 0;
441 res->u.tag.make_variantlist = 0;
442 res->u.tag.no_data_requested = 0;
443 res->u.tag.get_bytes = -1;
447 parent->last_child = res;
448 res->root = parent->root;
450 res->parent = parent;
452 d1_stack[level]->next = res;
455 d1_stack[level] = res;
456 d1_stack[++level] = 0;
458 else /* != '<'... this is a body of text */
462 int len, prev_char = 0;
469 res = data1_mk_node(dh, m);
470 res->parent = parent;
471 res->which = DATA1N_data;
472 res->u.data.what = DATA1I_text;
473 res->u.data.formatted_text = 0;
474 res->root = parent->root;
475 parent->last_child = res;
477 d1_stack[level]->next = res;
480 d1_stack[level] = res;
486 wrbuf_putc (wrbuf, c);
489 len = wrbuf_len(wrbuf);
491 /* use local buffer of nmem if too large */
492 if (len >= DATA1_LOCALDATA)
493 res->u.data.data = (char*) nmem_malloc (m, len);
495 res->u.data.data = res->lbuf;
497 /* read "data" and transfer while removing white space */
498 dst = res->u.data.data;
499 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
515 res->u.data.len = dst - res->u.data.data;
521 int getc_mem (void *fh)
523 const char **p = (const char **) fh;
529 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
531 WRBUF wrbuf = wrbuf_alloc();
534 node = data1_read_nodex(dh, m, getc_mem, buf, wrbuf);
535 wrbuf_free (wrbuf, 1);
540 * Read a record in the native syntax.
542 data1_node *data1_read_record(data1_handle dh,
543 int (*rf)(void *, char *, size_t), void *fh,
547 char **buf = data1_get_read_buf (dh, &size);
552 *buf = (char *)xmalloc(*size = 4096);
556 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
558 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
564 return data1_read_node(dh, &bp, m);
573 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
575 const char *bp = buf;
576 return data1_read_node (dh, &bp, m);