2 * Copyright (c) 1995, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.10 1996-01-19 15:41:47 quinn
8 * Fixed uninitialized boolean.
10 * Revision 1.9 1996/01/17 14:52:47 adam
11 * Changed prototype for reader function parsed to data1_read_record.
13 * Revision 1.8 1995/12/15 16:20:41 quinn
14 * Added formatted text.
16 * Revision 1.7 1995/12/13 13:44:32 quinn
17 * Modified Data1-system to use nmem
19 * Revision 1.6 1995/12/12 16:37:08 quinn
20 * Added destroy element to data1_node.
22 * Revision 1.5 1995/12/11 15:22:37 quinn
23 * Added last_child field to the node.
24 * Rewrote schema-mapping.
26 * Revision 1.4 1995/11/13 09:27:36 quinn
27 * Fiddling with the variant stuff.
29 * Revision 1.3 1995/11/01 16:34:57 quinn
30 * Making data1 look for tables in data1_tabpath
32 * Revision 1.2 1995/11/01 13:54:48 quinn
35 * Revision 1.1 1995/11/01 11:56:09 quinn
36 * Added Retrieval (data management) functions en masse.
38 * Revision 1.14 1995/10/30 12:40:55 quinn
39 * Fixed a couple of bugs.
41 * Revision 1.13 1995/10/25 16:00:47 quinn
42 * USMARC support is now almost operational
44 * Revision 1.12 1995/10/16 14:02:55 quinn
45 * Changes to support element set names and espec1
47 * Revision 1.11 1995/10/13 16:05:08 quinn
48 * Adding Espec1-processing
50 * Revision 1.10 1995/10/11 14:53:44 quinn
53 * Revision 1.9 1995/10/06 16:56:50 quinn
54 * Fixed ranked result.
56 * Revision 1.8 1995/10/06 16:44:13 quinn
57 * Work on attribute set mapping, etc.
59 * Revision 1.7 1995/10/06 12:58:35 quinn
62 * Revision 1.6 1995/10/04 09:29:49 quinn
63 * Adjustments to support USGS test data
65 * Revision 1.5 1995/10/03 17:56:43 quinn
68 * Revision 1.4 1995/10/02 15:53:19 quinn
71 * Revision 1.3 1995/10/02 14:55:21 quinn
72 * *** empty log message ***
74 * Revision 1.2 1995/09/14 15:18:13 quinn
77 * Revision 1.1 1995/09/12 11:24:30 quinn
78 * Beginning to add code for structured records.
91 char *data1_tabpath = 0; /* global path for tables */
93 void data1_set_tabpath(char *p)
94 { data1_tabpath = p; }
97 static data1_node *freelist = 0;
101 * get the tag which is the immediate parent of this node (this may mean
102 * traversing intermediate things like variants and stuff.
104 data1_node *get_parent_tag(data1_node *n)
106 for (; n && n->which != DATA1N_root; n = n->parent)
107 if (n->which == DATA1N_tag)
112 data1_node *data1_mk_node(NMEM m)
120 if (!(r = xmalloc(sizeof(*r))))
123 r = nmem_malloc(m, sizeof(*r));
125 r->next = r->child = r->last_child = r->parent = 0;
132 static void fr_node(data1_node *n)
139 void data1_free_tree(data1_node *t)
141 data1_node *p = t->child, *pn;
157 * Insert a tagged node into the record root as first child of the node at
158 * which should be root or tag itself). Returns pointer to the data node,
159 * which can then be modified.
161 data1_node *data1_insert_taggeddata(data1_node *root, data1_node *at,
162 char *tagname, NMEM m)
164 data1_node *tagn = data1_mk_node(m);
167 tagn->which = DATA1N_tag;
170 tagn->u.tag.node_selected = 0;
171 tagn->u.tag.make_variantlist = 0;
172 tagn->u.tag.no_data_requested = 0;
173 if (!(tagn->u.tag.element = data1_getelementbytagname(root->u.root.absyn,
176 tagn->child = datn = data1_mk_node(m);
177 tagn->num_children = 1;
180 datn->which = DATA1N_data;
181 datn->u.data.formatted_text = 0;
182 tagn->next = at->child;
190 * Ugh. Sometimes functions just grow and grow on you. This one reads a
191 * 'node' and its children.
193 data1_node *data1_read_node(char **buf, data1_node *parent, int *line,
194 data1_absyn *absyn, NMEM m)
198 while (**buf && isspace(**buf))
207 if (**buf == '<') /* beginning of tag */
209 char *tag = (*buf) + 1;
213 data1_element *elem = 0;
215 for (; *t && *t != '>' && !isspace(*t); t++);
216 if (*t != '>' && !isspace(*t))
218 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
221 if (isspace(*t)) /* the tag has arguments */
228 for (; *t && *t != '>'; t++);
229 if (*t != '>' && !isspace(*t))
231 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
238 * if end-tag, see if we terminate parent. If so, consume and return.
246 if (!*(tag +1) || (parent->which == DATA1N_root && !strcmp(tag + 1,
247 parent->u.root.type)) ||
248 (parent->which == DATA1N_tag && !strcmp(tag + 1,
261 if (!absyn) /* parent node - what are we? */
263 if (!(absyn = data1_get_absyn(tag)))
265 logf(LOG_WARN, "Unable to acquire abstract syntax for '%s'",
269 res = data1_mk_node(m);
270 res->which = DATA1N_root;
271 res->u.root.type = tag;
272 res->u.root.absyn = absyn;
276 else if (!strncmp(tag, "var", 3))
278 char class[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
283 if (sscanf(args, "%s %s %n", class, type, &val_offset) != 2)
285 logf(LOG_WARN, "Malformed variant triple at '%s'", tag);
288 if (!(tp = data1_getvartypebyct(parent->root->u.root.absyn->varset,
293 * If we're the first variant in this group, create a parent var,
294 * and insert it before the current variant.
296 if (parent->which != DATA1N_variant)
298 res = data1_mk_node(m);
299 res->which = DATA1N_variant;
300 res->u.variant.type = 0;
301 res->u.variant.value = 0;
302 res->root = parent->root;
308 * now determine if one of our ancestor triples is of same type.
309 * If so, we break here. This will make the parser unwind until
310 * we become a sibling (alternate variant) to the aforementioned
311 * triple. It stinks that we re-parse these tags on every
312 * iteration of this. This is a function in need of a rewrite.
314 for (p = parent; p->which == DATA1N_variant; p = p->parent)
315 if (p->u.variant.type == tp)
321 res = data1_mk_node(m);
322 res->which = DATA1N_variant;
323 res->root = parent->root;
324 res->u.variant.type = tp;
325 res->u.variant.value = args + val_offset;
329 else /* tag.. acquire our element in the abstract syntax */
331 data1_node *partag = get_parent_tag(parent);
332 data1_element *e = 0;
335 if (parent->which == DATA1N_variant)
341 if (!(e = partag->u.tag.element))
342 localtag = 1; /* our parent is a local tag */
345 if (!localtag && !(elem = data1_getelementbytagname(absyn,
346 e, tag)) && (data1_gettagbyname(absyn->tagset, tag)))
348 if (parent->which == DATA1N_root)
349 logf(LOG_WARN, "Tag '%s' used out of context", tag);
354 elem = data1_getelementbytagname(absyn, e, tag);
356 res = data1_mk_node(m);
357 res->which = DATA1N_tag;
358 res->u.tag.element = elem;
359 res->u.tag.tag = tag;
360 res->u.tag.node_selected = 0;
361 res->u.tag.make_variantlist = 0;
362 res->u.tag.no_data_requested = 0;
363 res->root = parent->root;
367 res->parent = parent;
368 res->num_children = 0;
374 while ((*pp = data1_read_node(buf, res, line, absyn, m)))
376 res->last_child = *pp;
381 else /* != '<'... this is a body of text */
384 char *data = *buf, *pp = *buf;
386 data1_node *partag = get_parent_tag(parent);
389 /* Determine length and remove newlines/extra blanks */
390 while (**buf && **buf != '<')
398 while (isspace(**buf))
402 *(pp++) = *((*buf)++);
405 while (isspace(data[len-1]))
407 res = data1_mk_node(m);
408 res->parent = parent;
409 res->which = DATA1N_data;
410 res->u.data.what = DATA1I_text;
411 res->u.data.len = len;
412 res->u.data.data = data;
413 res->u.data.formatted_text = 0;
414 res->root = parent->root;
420 * Read a record in the native syntax.
422 data1_node *data1_read_record(int (*rf)(void *, char *, size_t), void *fh,
425 static char *buf = 0;
431 if (!buf && !(buf = xmalloc(size = 4096)))
436 if (rd + 4096 > size && !(buf =xrealloc(buf, size *= 2)))
438 if ((res = (*rf)(fh, buf + rd, 4096)) <= 0)
443 return data1_read_node(&bp, 0, &line, 0, m);