2 * Copyright (c) 1995-1999, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.29 1999-10-21 12:06:29 adam
8 * Retrieval module no longer uses ctype.h - functions.
10 * Revision 1.28 1999/10/21 09:50:33 adam
11 * SGML reader uses own isspace - it doesn't do 8-bit on WIN32!
13 * Revision 1.27 1999/08/27 09:40:32 adam
14 * Renamed logf function to yaz_log. Removed VC++ project files.
16 * Revision 1.26 1999/07/13 13:23:48 adam
17 * Non-recursive version of data1_read_node. data1_read_nodex reads
18 * stream of bytes (instead of buffer in memory).
20 * Revision 1.25 1999/04/20 09:56:48 adam
21 * Added 'name' paramter to encoder/decoder routines (typedef Odr_fun).
22 * Modified all encoders/decoders to reflect this change.
24 * Revision 1.24 1998/10/28 15:10:09 adam
25 * Added --with-yc option to configure. For the data1_node in data1.h:
26 * decreased size of localdata and removed member "line" which wasn't useful.
28 * Revision 1.23 1998/03/12 11:28:45 adam
29 * Fix: didn't set root member of tagged node in function.
30 * data1_add_insert_taggeddata.
32 * Revision 1.22 1998/03/05 08:15:32 adam
33 * Implemented data1_add_insert_taggeddata utility which is more flexible
34 * than data1_insert_taggeddata.
36 * Revision 1.21 1998/02/27 14:08:05 adam
37 * Added const to some char pointer arguments.
38 * Reworked data1_read_node so that it doesn't create a tree with
39 * pointers to original "SGML"-buffer.
41 * Revision 1.20 1998/02/11 11:53:35 adam
42 * Changed code so that it compiles as C++.
44 * Revision 1.19 1997/12/09 16:17:09 adam
45 * Fix bug regarding variants. Tags with prefix "var" was incorrectly
46 * interpreted as "start of variants". Now, only "var" indicates such
48 * Cleaned up data1_read_node so tag names and variant names are
49 * copied and not pointed to by the generated data1 tree. Data nodes
50 * still point to old buffer.
52 * Revision 1.18 1997/11/18 09:51:09 adam
53 * Removed element num_children from data1_node. Minor changes in
56 * Revision 1.17 1997/11/05 09:20:51 adam
59 * Revision 1.16 1997/09/17 12:10:37 adam
62 * Revision 1.15 1997/09/05 09:50:57 adam
63 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
65 * Revision 1.14 1997/05/14 06:54:04 adam
68 * Revision 1.13 1996/10/29 13:35:38 adam
69 * Implemented data1_set_tabpath and data1_get_tabpath.
71 * Revision 1.12 1996/10/11 10:35:38 adam
72 * Fixed a bug that caused data1_read_node to core dump when no abstract
73 * syntax was defined in a "sgml"-record.
75 * Revision 1.11 1996/07/06 19:58:35 quinn
76 * System headerfiles gathered in yconfig
78 * Revision 1.10 1996/01/19 15:41:47 quinn
79 * Fixed uninitialized boolean.
81 * Revision 1.9 1996/01/17 14:52:47 adam
82 * Changed prototype for reader function parsed to data1_read_record.
84 * Revision 1.8 1995/12/15 16:20:41 quinn
85 * Added formatted text.
87 * Revision 1.7 1995/12/13 13:44:32 quinn
88 * Modified Data1-system to use nmem
90 * Revision 1.6 1995/12/12 16:37:08 quinn
91 * Added destroy element to data1_node.
93 * Revision 1.5 1995/12/11 15:22:37 quinn
94 * Added last_child field to the node.
95 * Rewrote schema-mapping.
97 * Revision 1.4 1995/11/13 09:27:36 quinn
98 * Fiddling with the variant stuff.
100 * Revision 1.3 1995/11/01 16:34:57 quinn
101 * Making data1 look for tables in data1_tabpath
103 * Revision 1.2 1995/11/01 13:54:48 quinn
106 * Revision 1.1 1995/11/01 11:56:09 quinn
107 * Added Retrieval (data management) functions en masse.
109 * Revision 1.14 1995/10/30 12:40:55 quinn
110 * Fixed a couple of bugs.
112 * Revision 1.13 1995/10/25 16:00:47 quinn
113 * USMARC support is now almost operational
115 * Revision 1.12 1995/10/16 14:02:55 quinn
116 * Changes to support element set names and espec1
118 * Revision 1.11 1995/10/13 16:05:08 quinn
119 * Adding Espec1-processing
121 * Revision 1.10 1995/10/11 14:53:44 quinn
124 * Revision 1.9 1995/10/06 16:56:50 quinn
125 * Fixed ranked result.
127 * Revision 1.8 1995/10/06 16:44:13 quinn
128 * Work on attribute set mapping, etc.
130 * Revision 1.7 1995/10/06 12:58:35 quinn
133 * Revision 1.6 1995/10/04 09:29:49 quinn
134 * Adjustments to support USGS test data
136 * Revision 1.5 1995/10/03 17:56:43 quinn
139 * Revision 1.4 1995/10/02 15:53:19 quinn
142 * Revision 1.3 1995/10/02 14:55:21 quinn
143 * *** empty log message ***
145 * Revision 1.2 1995/09/14 15:18:13 quinn
148 * Revision 1.1 1995/09/12 11:24:30 quinn
149 * Beginning to add code for structured records.
163 * get the tag which is the immediate parent of this node (this may mean
164 * traversing intermediate things like variants and stuff.
166 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
168 for (; n && n->which != DATA1N_root; n = n->parent)
169 if (n->which == DATA1N_tag)
174 data1_node *data1_mk_node (data1_handle dh, NMEM m)
178 r = (data1_node *)nmem_malloc(m, sizeof(*r));
179 r->next = r->child = r->last_child = r->parent = 0;
184 void data1_free_tree (data1_handle dh, data1_node *t)
186 data1_node *p = t->child, *pn;
191 data1_free_tree (dh, p);
198 char *data1_insert_string (data1_handle dh, data1_node *res,
199 NMEM m, const char *str)
201 int len = strlen(str);
203 if (len >= DATA1_LOCALDATA)
204 return nmem_strdup (m, str);
207 strcpy (res->lbuf, str);
212 data1_node *data1_add_insert_taggeddata(data1_handle dh, data1_node *root,
214 const char *tagname, NMEM m,
215 int first_flag, int local_allowed)
217 data1_node *partag = get_parent_tag (dh, at);
218 data1_node *tagn = data1_mk_node (dh, m);
219 data1_element *e = NULL;
222 tagn->which = DATA1N_tag;
223 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
224 tagn->u.tag.node_selected = 0;
225 tagn->u.tag.make_variantlist = 0;
226 tagn->u.tag.no_data_requested = 0;
227 tagn->u.tag.get_bytes = -1;
230 e = partag->u.tag.element;
231 tagn->u.tag.element =
232 data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
233 if (!local_allowed && !tagn->u.tag.element)
235 tagn->last_child = tagn->child = datn = data1_mk_node (dh, m);
239 datn->which = DATA1N_data;
240 datn->u.data.formatted_text = 0;
245 tagn->next = at->child;
247 at->last_child = tagn;
256 assert (at->last_child);
257 at->last_child->next = tagn;
259 at->last_child = tagn;
264 data1_node *data1_add_taggeddata(data1_handle dh, data1_node *root,
266 const char *tagname, NMEM m)
268 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 0, 1);
273 * Insert a tagged node into the record root as first child of the node at
274 * which should be root or tag itself). Returns pointer to the data node,
275 * which can then be modified.
277 data1_node *data1_insert_taggeddata(data1_handle dh, data1_node *root,
279 const char *tagname, NMEM m)
281 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 1, 0);
285 * Ugh. Sometimes functions just grow and grow on you. This one reads a
286 * 'node' and its children.
288 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
289 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
291 data1_absyn *absyn = 0;
292 data1_node *d1_stack[256];
302 data1_node *parent = level ? d1_stack[level-1] : 0;
303 while (c != '\0' && d1_isspace(c))
312 if (c == '<') /* beginning of tag */
318 for (i = 0; (c=(*get_byte)(fh)) && c != '>' && !d1_isspace(c);)
319 if (i < (sizeof(tag)-1))
322 while (d1_isspace(c))
324 for (i = 0; c && c != '>'; c = (*get_byte)(fh))
325 if (i < (sizeof(args)-1))
330 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
346 parent = d1_stack[--i];
347 if ((parent->which == DATA1N_root &&
348 !strcmp(tag+1, parent->u.root.type)) ||
349 (parent->which == DATA1N_tag &&
350 !strcmp(tag+1, parent->u.tag.tag)))
358 yaz_log (LOG_WARN, "%d: no begin tag for %s",
367 if (level == 0) /* root ? */
369 if (!(absyn = data1_get_absyn (dh, tag)))
371 yaz_log(LOG_WARN, "Unable to acquire abstract syntax "
375 res = data1_mk_node (dh, m);
376 res->which = DATA1N_root;
377 res->u.root.type = data1_insert_string (dh, res, m, tag);
378 res->u.root.absyn = absyn;
381 else if (!strcmp(tag, "var"))
383 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
387 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
389 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
393 data1_getvartypebyct(dh,
394 parent->root->u.root.absyn->varset,
398 * If we're the first variant in this group, create a parent
399 * variant, and insert it before the current variant.
401 if (parent->which != DATA1N_variant)
403 res = data1_mk_node (dh, m);
404 res->which = DATA1N_variant;
405 res->u.variant.type = 0;
406 res->u.variant.value = 0;
411 * now determine if one of our ancestor triples is of
412 * same type. If so, we break here.
415 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
416 if (d1_stack[i]->u.variant.type == tp)
421 res = data1_mk_node (dh, m);
422 res->which = DATA1N_variant;
423 res->u.variant.type = tp;
424 res->u.variant.value =
425 data1_insert_string (dh, res, m, args + val_offset);
428 else /* tag.. acquire our element in the abstract syntax */
430 data1_node *partag = get_parent_tag (dh, parent);
431 data1_element *elem, *e = 0;
434 if (parent->which == DATA1N_variant)
437 if (!(e = partag->u.tag.element))
438 localtag = 1; /* our parent is a local tag */
440 elem = data1_getelementbytagname(dh, absyn, e, tag);
441 res = data1_mk_node (dh, m);
442 res->which = DATA1N_tag;
443 res->u.tag.tag = data1_insert_string (dh, res, m, tag);
444 res->u.tag.element = elem;
445 res->u.tag.node_selected = 0;
446 res->u.tag.make_variantlist = 0;
447 res->u.tag.no_data_requested = 0;
448 res->u.tag.get_bytes = -1;
452 parent->last_child = res;
453 res->root = parent->root;
455 res->parent = parent;
457 d1_stack[level]->next = res;
460 d1_stack[level] = res;
461 d1_stack[++level] = 0;
463 else /* != '<'... this is a body of text */
467 int len, prev_char = 0;
474 res = data1_mk_node(dh, m);
475 res->parent = parent;
476 res->which = DATA1N_data;
477 res->u.data.what = DATA1I_text;
478 res->u.data.formatted_text = 0;
479 res->root = parent->root;
480 parent->last_child = res;
482 d1_stack[level]->next = res;
485 d1_stack[level] = res;
491 wrbuf_putc (wrbuf, c);
494 len = wrbuf_len(wrbuf);
496 /* use local buffer of nmem if too large */
497 if (len >= DATA1_LOCALDATA)
498 res->u.data.data = (char*) nmem_malloc (m, len);
500 res->u.data.data = res->lbuf;
502 /* read "data" and transfer while removing white space */
503 dst = res->u.data.data;
504 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
508 if (d1_isspace (*src))
520 res->u.data.len = dst - res->u.data.data;
526 int getc_mem (void *fh)
528 const char **p = (const char **) fh;
534 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
536 WRBUF wrbuf = wrbuf_alloc();
539 node = data1_read_nodex(dh, m, getc_mem, buf, wrbuf);
540 wrbuf_free (wrbuf, 1);
545 * Read a record in the native syntax.
547 data1_node *data1_read_record(data1_handle dh,
548 int (*rf)(void *, char *, size_t), void *fh,
552 char **buf = data1_get_read_buf (dh, &size);
557 *buf = (char *)xmalloc(*size = 4096);
561 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
563 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
569 return data1_read_node(dh, &bp, m);
578 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
580 const char *bp = buf;
581 return data1_read_node (dh, &bp, m);