2 * Copyright (c) 1995-1997, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.16 1997-09-17 12:10:37 adam
10 * Revision 1.15 1997/09/05 09:50:57 adam
11 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
13 * Revision 1.14 1997/05/14 06:54:04 adam
16 * Revision 1.13 1996/10/29 13:35:38 adam
17 * Implemented data1_set_tabpath and data1_get_tabpath.
19 * Revision 1.12 1996/10/11 10:35:38 adam
20 * Fixed a bug that caused data1_read_node to core dump when no abstract
21 * syntax was defined in a "sgml"-record.
23 * Revision 1.11 1996/07/06 19:58:35 quinn
24 * System headerfiles gathered in yconfig
26 * Revision 1.10 1996/01/19 15:41:47 quinn
27 * Fixed uninitialized boolean.
29 * Revision 1.9 1996/01/17 14:52:47 adam
30 * Changed prototype for reader function parsed to data1_read_record.
32 * Revision 1.8 1995/12/15 16:20:41 quinn
33 * Added formatted text.
35 * Revision 1.7 1995/12/13 13:44:32 quinn
36 * Modified Data1-system to use nmem
38 * Revision 1.6 1995/12/12 16:37:08 quinn
39 * Added destroy element to data1_node.
41 * Revision 1.5 1995/12/11 15:22:37 quinn
42 * Added last_child field to the node.
43 * Rewrote schema-mapping.
45 * Revision 1.4 1995/11/13 09:27:36 quinn
46 * Fiddling with the variant stuff.
48 * Revision 1.3 1995/11/01 16:34:57 quinn
49 * Making data1 look for tables in data1_tabpath
51 * Revision 1.2 1995/11/01 13:54:48 quinn
54 * Revision 1.1 1995/11/01 11:56:09 quinn
55 * Added Retrieval (data management) functions en masse.
57 * Revision 1.14 1995/10/30 12:40:55 quinn
58 * Fixed a couple of bugs.
60 * Revision 1.13 1995/10/25 16:00:47 quinn
61 * USMARC support is now almost operational
63 * Revision 1.12 1995/10/16 14:02:55 quinn
64 * Changes to support element set names and espec1
66 * Revision 1.11 1995/10/13 16:05:08 quinn
67 * Adding Espec1-processing
69 * Revision 1.10 1995/10/11 14:53:44 quinn
72 * Revision 1.9 1995/10/06 16:56:50 quinn
73 * Fixed ranked result.
75 * Revision 1.8 1995/10/06 16:44:13 quinn
76 * Work on attribute set mapping, etc.
78 * Revision 1.7 1995/10/06 12:58:35 quinn
81 * Revision 1.6 1995/10/04 09:29:49 quinn
82 * Adjustments to support USGS test data
84 * Revision 1.5 1995/10/03 17:56:43 quinn
87 * Revision 1.4 1995/10/02 15:53:19 quinn
90 * Revision 1.3 1995/10/02 14:55:21 quinn
91 * *** empty log message ***
93 * Revision 1.2 1995/09/14 15:18:13 quinn
96 * Revision 1.1 1995/09/12 11:24:30 quinn
97 * Beginning to add code for structured records.
111 * get the tag which is the immediate parent of this node (this may mean
112 * traversing intermediate things like variants and stuff.
114 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
116 for (; n && n->which != DATA1N_root; n = n->parent)
117 if (n->which == DATA1N_tag)
122 data1_node *data1_mk_node (data1_handle dh, NMEM m)
126 r = nmem_malloc(m, sizeof(*r));
127 r->next = r->child = r->last_child = r->parent = 0;
133 void data1_free_tree (data1_handle dh, data1_node *t)
135 data1_node *p = t->child, *pn;
140 data1_free_tree (dh, p);
148 * Insert a tagged node into the record root as first child of the node at
149 * which should be root or tag itself). Returns pointer to the data node,
150 * which can then be modified.
152 data1_node *data1_insert_taggeddata(data1_handle dh, data1_node *root,
154 char *tagname, NMEM m)
156 data1_node *tagn = data1_mk_node (dh, m);
159 tagn->which = DATA1N_tag;
162 tagn->u.tag.node_selected = 0;
163 tagn->u.tag.make_variantlist = 0;
164 tagn->u.tag.no_data_requested = 0;
165 tagn->u.tag.get_bytes = -1;
166 if (!(tagn->u.tag.element = data1_getelementbytagname (dh,
170 tagn->child = datn = data1_mk_node (dh, m);
171 tagn->num_children = 1;
174 datn->which = DATA1N_data;
175 datn->u.data.formatted_text = 0;
176 tagn->next = at->child;
184 * Ugh. Sometimes functions just grow and grow on you. This one reads a
185 * 'node' and its children.
187 data1_node *data1_read_node (data1_handle dh, char **buf,
188 data1_node *parent, int *line,
189 data1_absyn *absyn, NMEM m)
193 while (**buf && isspace(**buf))
202 if (**buf == '<') /* beginning of tag */
204 char *tag = (*buf) + 1;
208 data1_element *elem = 0;
210 for (; *t && *t != '>' && !isspace(*t); t++);
211 if (*t != '>' && !isspace(*t))
213 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
216 if (isspace(*t)) /* the tag has arguments */
223 for (; *t && *t != '>'; t++);
224 if (*t != '>' && !isspace(*t))
226 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
233 * if end-tag, see if we terminate parent. If so, consume and return.
241 if (!*(tag +1) || (parent->which == DATA1N_root && !strcmp(tag + 1,
242 parent->u.root.type)) ||
243 (parent->which == DATA1N_tag && !strcmp(tag + 1,
256 if (!absyn) /* parent node - what are we? */
258 if (!(absyn = data1_get_absyn (dh, tag)))
260 logf(LOG_WARN, "Unable to acquire abstract syntax for '%s'",
264 res = data1_mk_node (dh, m);
265 res->which = DATA1N_root;
266 res->u.root.type = tag;
267 res->u.root.absyn = absyn;
271 else if (!strncmp(tag, "var", 3))
273 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
278 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
280 logf(LOG_WARN, "Malformed variant triple at '%s'", tag);
283 if (!(tp = data1_getvartypebyct(dh, parent->root->u.root.absyn->varset,
288 * If we're the first variant in this group, create a parent var,
289 * and insert it before the current variant.
291 if (parent->which != DATA1N_variant)
293 res = data1_mk_node (dh, m);
294 res->which = DATA1N_variant;
295 res->u.variant.type = 0;
296 res->u.variant.value = 0;
297 res->root = parent->root;
303 * now determine if one of our ancestor triples is of same type.
304 * If so, we break here. This will make the parser unwind until
305 * we become a sibling (alternate variant) to the aforementioned
306 * triple. It stinks that we re-parse these tags on every
307 * iteration of this. This is a function in need of a rewrite.
309 for (p = parent; p->which == DATA1N_variant; p = p->parent)
310 if (p->u.variant.type == tp)
316 res = data1_mk_node (dh, m);
317 res->which = DATA1N_variant;
318 res->root = parent->root;
319 res->u.variant.type = tp;
320 res->u.variant.value = args + val_offset;
324 else /* tag.. acquire our element in the abstract syntax */
326 data1_node *partag = get_parent_tag (dh, parent);
327 data1_element *e = 0;
330 if (parent->which == DATA1N_variant)
336 if (!(e = partag->u.tag.element))
337 localtag = 1; /* our parent is a local tag */
340 if (!localtag && !(elem = data1_getelementbytagname(absyn,
341 e, tag)) && (data1_gettagbyname(absyn->tagset, tag)))
343 if (parent->which == DATA1N_root)
344 logf(LOG_WARN, "Tag '%s' used out of context", tag);
349 elem = data1_getelementbytagname(dh, absyn, e, tag);
351 res = data1_mk_node (dh, m);
352 res->which = DATA1N_tag;
353 res->u.tag.element = elem;
354 res->u.tag.tag = tag;
355 res->u.tag.node_selected = 0;
356 res->u.tag.make_variantlist = 0;
357 res->u.tag.no_data_requested = 0;
358 res->u.tag.get_bytes = -1;
359 res->root = parent->root;
363 res->parent = parent;
364 res->num_children = 0;
370 while ((*pp = data1_read_node(dh, buf, res, line, absyn, m)))
372 res->last_child = *pp;
377 else /* != '<'... this is a body of text */
380 char *data = *buf, *pp = *buf;
382 if (!parent) /* abort if abstract syntax is undefined */
384 /* Determine length and remove newlines/extra blanks */
385 while (**buf && **buf != '<')
393 while (isspace(**buf))
397 *(pp++) = *((*buf)++);
400 while (isspace(data[len-1]))
402 res = data1_mk_node(dh, m);
403 res->parent = parent;
404 res->which = DATA1N_data;
405 res->u.data.what = DATA1I_text;
406 res->u.data.len = len;
407 res->u.data.data = data;
408 res->u.data.formatted_text = 0;
409 res->root = parent->root;
415 * Read a record in the native syntax.
417 data1_node *data1_read_record(data1_handle dh,
418 int (*rf)(void *, char *, size_t), void *fh,
422 char **buf = data1_get_read_buf (dh, &size);
428 *buf = xmalloc(*size = 4096);
432 if (rd + 4096 > *size && !(*buf =xrealloc(*buf, *size *= 2)))
434 if ((res = (*rf)(fh, *buf + rd, 4096)) <= 0)
439 return data1_read_node(dh, &bp, 0, &line, 0, m);