2 * Copyright (c) 1995-1999, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.26 1999-07-13 13:23:48 adam
8 * Non-recursive version of data1_read_node. data1_read_nodex reads
9 * stream of bytes (instead of buffer in memory).
11 * Revision 1.25 1999/04/20 09:56:48 adam
12 * Added 'name' paramter to encoder/decoder routines (typedef Odr_fun).
13 * Modified all encoders/decoders to reflect this change.
15 * Revision 1.24 1998/10/28 15:10:09 adam
16 * Added --with-yc option to configure. For the data1_node in data1.h:
17 * decreased size of localdata and removed member "line" which wasn't useful.
19 * Revision 1.23 1998/03/12 11:28:45 adam
20 * Fix: didn't set root member of tagged node in function.
21 * data1_add_insert_taggeddata.
23 * Revision 1.22 1998/03/05 08:15:32 adam
24 * Implemented data1_add_insert_taggeddata utility which is more flexible
25 * than data1_insert_taggeddata.
27 * Revision 1.21 1998/02/27 14:08:05 adam
28 * Added const to some char pointer arguments.
29 * Reworked data1_read_node so that it doesn't create a tree with
30 * pointers to original "SGML"-buffer.
32 * Revision 1.20 1998/02/11 11:53:35 adam
33 * Changed code so that it compiles as C++.
35 * Revision 1.19 1997/12/09 16:17:09 adam
36 * Fix bug regarding variants. Tags with prefix "var" was incorrectly
37 * interpreted as "start of variants". Now, only "var" indicates such
39 * Cleaned up data1_read_node so tag names and variant names are
40 * copied and not pointed to by the generated data1 tree. Data nodes
41 * still point to old buffer.
43 * Revision 1.18 1997/11/18 09:51:09 adam
44 * Removed element num_children from data1_node. Minor changes in
47 * Revision 1.17 1997/11/05 09:20:51 adam
50 * Revision 1.16 1997/09/17 12:10:37 adam
53 * Revision 1.15 1997/09/05 09:50:57 adam
54 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
56 * Revision 1.14 1997/05/14 06:54:04 adam
59 * Revision 1.13 1996/10/29 13:35:38 adam
60 * Implemented data1_set_tabpath and data1_get_tabpath.
62 * Revision 1.12 1996/10/11 10:35:38 adam
63 * Fixed a bug that caused data1_read_node to core dump when no abstract
64 * syntax was defined in a "sgml"-record.
66 * Revision 1.11 1996/07/06 19:58:35 quinn
67 * System headerfiles gathered in yconfig
69 * Revision 1.10 1996/01/19 15:41:47 quinn
70 * Fixed uninitialized boolean.
72 * Revision 1.9 1996/01/17 14:52:47 adam
73 * Changed prototype for reader function parsed to data1_read_record.
75 * Revision 1.8 1995/12/15 16:20:41 quinn
76 * Added formatted text.
78 * Revision 1.7 1995/12/13 13:44:32 quinn
79 * Modified Data1-system to use nmem
81 * Revision 1.6 1995/12/12 16:37:08 quinn
82 * Added destroy element to data1_node.
84 * Revision 1.5 1995/12/11 15:22:37 quinn
85 * Added last_child field to the node.
86 * Rewrote schema-mapping.
88 * Revision 1.4 1995/11/13 09:27:36 quinn
89 * Fiddling with the variant stuff.
91 * Revision 1.3 1995/11/01 16:34:57 quinn
92 * Making data1 look for tables in data1_tabpath
94 * Revision 1.2 1995/11/01 13:54:48 quinn
97 * Revision 1.1 1995/11/01 11:56:09 quinn
98 * Added Retrieval (data management) functions en masse.
100 * Revision 1.14 1995/10/30 12:40:55 quinn
101 * Fixed a couple of bugs.
103 * Revision 1.13 1995/10/25 16:00:47 quinn
104 * USMARC support is now almost operational
106 * Revision 1.12 1995/10/16 14:02:55 quinn
107 * Changes to support element set names and espec1
109 * Revision 1.11 1995/10/13 16:05:08 quinn
110 * Adding Espec1-processing
112 * Revision 1.10 1995/10/11 14:53:44 quinn
115 * Revision 1.9 1995/10/06 16:56:50 quinn
116 * Fixed ranked result.
118 * Revision 1.8 1995/10/06 16:44:13 quinn
119 * Work on attribute set mapping, etc.
121 * Revision 1.7 1995/10/06 12:58:35 quinn
124 * Revision 1.6 1995/10/04 09:29:49 quinn
125 * Adjustments to support USGS test data
127 * Revision 1.5 1995/10/03 17:56:43 quinn
130 * Revision 1.4 1995/10/02 15:53:19 quinn
133 * Revision 1.3 1995/10/02 14:55:21 quinn
134 * *** empty log message ***
136 * Revision 1.2 1995/09/14 15:18:13 quinn
139 * Revision 1.1 1995/09/12 11:24:30 quinn
140 * Beginning to add code for structured records.
155 * get the tag which is the immediate parent of this node (this may mean
156 * traversing intermediate things like variants and stuff.
158 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
160 for (; n && n->which != DATA1N_root; n = n->parent)
161 if (n->which == DATA1N_tag)
166 data1_node *data1_mk_node (data1_handle dh, NMEM m)
170 r = (data1_node *)nmem_malloc(m, sizeof(*r));
171 r->next = r->child = r->last_child = r->parent = 0;
176 void data1_free_tree (data1_handle dh, data1_node *t)
178 data1_node *p = t->child, *pn;
183 data1_free_tree (dh, p);
190 char *data1_insert_string (data1_handle dh, data1_node *res,
191 NMEM m, const char *str)
193 int len = strlen(str);
195 if (len >= DATA1_LOCALDATA)
196 return nmem_strdup (m, str);
199 strcpy (res->lbuf, str);
204 data1_node *data1_add_insert_taggeddata(data1_handle dh, data1_node *root,
206 const char *tagname, NMEM m,
207 int first_flag, int local_allowed)
209 data1_node *partag = get_parent_tag (dh, at);
210 data1_node *tagn = data1_mk_node (dh, m);
211 data1_element *e = NULL;
214 tagn->which = DATA1N_tag;
215 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
216 tagn->u.tag.node_selected = 0;
217 tagn->u.tag.make_variantlist = 0;
218 tagn->u.tag.no_data_requested = 0;
219 tagn->u.tag.get_bytes = -1;
222 e = partag->u.tag.element;
223 tagn->u.tag.element =
224 data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
225 if (!local_allowed && !tagn->u.tag.element)
227 tagn->last_child = tagn->child = datn = data1_mk_node (dh, m);
231 datn->which = DATA1N_data;
232 datn->u.data.formatted_text = 0;
237 tagn->next = at->child;
239 at->last_child = tagn;
248 assert (at->last_child);
249 at->last_child->next = tagn;
251 at->last_child = tagn;
256 data1_node *data1_add_taggeddata(data1_handle dh, data1_node *root,
258 const char *tagname, NMEM m)
260 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 0, 1);
265 * Insert a tagged node into the record root as first child of the node at
266 * which should be root or tag itself). Returns pointer to the data node,
267 * which can then be modified.
269 data1_node *data1_insert_taggeddata(data1_handle dh, data1_node *root,
271 const char *tagname, NMEM m)
273 return data1_add_insert_taggeddata (dh, root, at, tagname, m, 1, 0);
277 * Ugh. Sometimes functions just grow and grow on you. This one reads a
278 * 'node' and its children.
280 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
281 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
283 data1_absyn *absyn = 0;
284 data1_node *d1_stack[256];
294 data1_node *parent = level ? d1_stack[level-1] : 0;
295 while (c != '\0' && isspace(c))
304 if (c == '<') /* beginning of tag */
310 for (i = 0; (c=(*get_byte)(fh)) && c != '>' && !isspace(c);)
311 if (i < (sizeof(tag)-1))
316 for (i = 0; c && c != '>'; c = (*get_byte)(fh))
317 if (i < (sizeof(args)-1))
322 logf(LOG_WARN, "d1: %d: Malformed tag", line);
338 parent = d1_stack[--i];
339 if ((parent->which == DATA1N_root &&
340 !strcmp(tag+1, parent->u.root.type)) ||
341 (parent->which == DATA1N_tag &&
342 !strcmp(tag+1, parent->u.tag.tag)))
350 logf (LOG_WARN, "%d: no begin tag for %s",
359 if (level == 0) /* root ? */
361 if (!(absyn = data1_get_absyn (dh, tag)))
363 logf(LOG_WARN, "Unable to acquire abstract syntax "
367 res = data1_mk_node (dh, m);
368 res->which = DATA1N_root;
369 res->u.root.type = data1_insert_string (dh, res, m, tag);
370 res->u.root.absyn = absyn;
373 else if (!strcmp(tag, "var"))
375 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
379 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
381 logf(LOG_WARN, "Malformed variant triple at '%s'", tag);
385 data1_getvartypebyct(dh,
386 parent->root->u.root.absyn->varset,
390 * If we're the first variant in this group, create a parent
391 * variant, and insert it before the current variant.
393 if (parent->which != DATA1N_variant)
395 res = data1_mk_node (dh, m);
396 res->which = DATA1N_variant;
397 res->u.variant.type = 0;
398 res->u.variant.value = 0;
403 * now determine if one of our ancestor triples is of
404 * same type. If so, we break here.
407 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
408 if (d1_stack[i]->u.variant.type == tp)
413 res = data1_mk_node (dh, m);
414 res->which = DATA1N_variant;
415 res->u.variant.type = tp;
416 res->u.variant.value =
417 data1_insert_string (dh, res, m, args + val_offset);
420 else /* tag.. acquire our element in the abstract syntax */
422 data1_node *partag = get_parent_tag (dh, parent);
423 data1_element *elem, *e = 0;
426 if (parent->which == DATA1N_variant)
429 if (!(e = partag->u.tag.element))
430 localtag = 1; /* our parent is a local tag */
432 elem = data1_getelementbytagname(dh, absyn, e, tag);
433 res = data1_mk_node (dh, m);
434 res->which = DATA1N_tag;
435 res->u.tag.tag = data1_insert_string (dh, res, m, tag);
436 res->u.tag.element = elem;
437 res->u.tag.node_selected = 0;
438 res->u.tag.make_variantlist = 0;
439 res->u.tag.no_data_requested = 0;
440 res->u.tag.get_bytes = -1;
444 parent->last_child = res;
445 res->root = parent->root;
447 res->parent = parent;
449 d1_stack[level]->next = res;
452 d1_stack[level] = res;
453 d1_stack[++level] = 0;
455 else /* != '<'... this is a body of text */
459 int len, prev_char = 0;
466 res = data1_mk_node(dh, m);
467 res->parent = parent;
468 res->which = DATA1N_data;
469 res->u.data.what = DATA1I_text;
470 res->u.data.formatted_text = 0;
471 res->root = parent->root;
472 parent->last_child = res;
474 d1_stack[level]->next = res;
477 d1_stack[level] = res;
483 wrbuf_putc (wrbuf, c);
486 len = wrbuf_len(wrbuf);
488 /* use local buffer of nmem if too large */
489 if (len >= DATA1_LOCALDATA)
490 res->u.data.data = (char*) nmem_malloc (m, len);
492 res->u.data.data = res->lbuf;
494 /* read "data" and transfer while removing white space */
495 dst = res->u.data.data;
496 for (src = wrbuf_buf(wrbuf); --len >= 0; src++)
512 res->u.data.len = dst - res->u.data.data;
518 int getc_mem (void *fh)
520 const char **p = (const char **) fh;
526 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
528 WRBUF wrbuf = wrbuf_alloc();
531 node = data1_read_nodex(dh, m, getc_mem, buf, wrbuf);
532 wrbuf_free (wrbuf, 1);
537 * Read a record in the native syntax.
539 data1_node *data1_read_record(data1_handle dh,
540 int (*rf)(void *, char *, size_t), void *fh,
544 char **buf = data1_get_read_buf (dh, &size);
549 *buf = (char *)xmalloc(*size = 4096);
553 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
555 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
561 return data1_read_node(dh, &bp, m);
570 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
572 const char *bp = buf;
573 return data1_read_node (dh, &bp, m);