2 * Copyright (c) 1995-1997, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.18 1997-11-18 09:51:09 adam
8 * Removed element num_children from data1_node. Minor changes in
11 * Revision 1.17 1997/11/05 09:20:51 adam
14 * Revision 1.16 1997/09/17 12:10:37 adam
17 * Revision 1.15 1997/09/05 09:50:57 adam
18 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
20 * Revision 1.14 1997/05/14 06:54:04 adam
23 * Revision 1.13 1996/10/29 13:35:38 adam
24 * Implemented data1_set_tabpath and data1_get_tabpath.
26 * Revision 1.12 1996/10/11 10:35:38 adam
27 * Fixed a bug that caused data1_read_node to core dump when no abstract
28 * syntax was defined in a "sgml"-record.
30 * Revision 1.11 1996/07/06 19:58:35 quinn
31 * System headerfiles gathered in yconfig
33 * Revision 1.10 1996/01/19 15:41:47 quinn
34 * Fixed uninitialized boolean.
36 * Revision 1.9 1996/01/17 14:52:47 adam
37 * Changed prototype for reader function parsed to data1_read_record.
39 * Revision 1.8 1995/12/15 16:20:41 quinn
40 * Added formatted text.
42 * Revision 1.7 1995/12/13 13:44:32 quinn
43 * Modified Data1-system to use nmem
45 * Revision 1.6 1995/12/12 16:37:08 quinn
46 * Added destroy element to data1_node.
48 * Revision 1.5 1995/12/11 15:22:37 quinn
49 * Added last_child field to the node.
50 * Rewrote schema-mapping.
52 * Revision 1.4 1995/11/13 09:27:36 quinn
53 * Fiddling with the variant stuff.
55 * Revision 1.3 1995/11/01 16:34:57 quinn
56 * Making data1 look for tables in data1_tabpath
58 * Revision 1.2 1995/11/01 13:54:48 quinn
61 * Revision 1.1 1995/11/01 11:56:09 quinn
62 * Added Retrieval (data management) functions en masse.
64 * Revision 1.14 1995/10/30 12:40:55 quinn
65 * Fixed a couple of bugs.
67 * Revision 1.13 1995/10/25 16:00:47 quinn
68 * USMARC support is now almost operational
70 * Revision 1.12 1995/10/16 14:02:55 quinn
71 * Changes to support element set names and espec1
73 * Revision 1.11 1995/10/13 16:05:08 quinn
74 * Adding Espec1-processing
76 * Revision 1.10 1995/10/11 14:53:44 quinn
79 * Revision 1.9 1995/10/06 16:56:50 quinn
80 * Fixed ranked result.
82 * Revision 1.8 1995/10/06 16:44:13 quinn
83 * Work on attribute set mapping, etc.
85 * Revision 1.7 1995/10/06 12:58:35 quinn
88 * Revision 1.6 1995/10/04 09:29:49 quinn
89 * Adjustments to support USGS test data
91 * Revision 1.5 1995/10/03 17:56:43 quinn
94 * Revision 1.4 1995/10/02 15:53:19 quinn
97 * Revision 1.3 1995/10/02 14:55:21 quinn
98 * *** empty log message ***
100 * Revision 1.2 1995/09/14 15:18:13 quinn
103 * Revision 1.1 1995/09/12 11:24:30 quinn
104 * Beginning to add code for structured records.
118 * get the tag which is the immediate parent of this node (this may mean
119 * traversing intermediate things like variants and stuff.
121 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
123 for (; n && n->which != DATA1N_root; n = n->parent)
124 if (n->which == DATA1N_tag)
129 data1_node *data1_mk_node (data1_handle dh, NMEM m)
133 r = nmem_malloc(m, sizeof(*r));
134 r->next = r->child = r->last_child = r->parent = 0;
139 void data1_free_tree (data1_handle dh, data1_node *t)
141 data1_node *p = t->child, *pn;
146 data1_free_tree (dh, p);
154 * Insert a tagged node into the record root as first child of the node at
155 * which should be root or tag itself). Returns pointer to the data node,
156 * which can then be modified.
158 data1_node *data1_insert_taggeddata(data1_handle dh, data1_node *root,
160 char *tagname, NMEM m)
162 data1_node *tagn = data1_mk_node (dh, m);
165 tagn->which = DATA1N_tag;
168 tagn->u.tag.node_selected = 0;
169 tagn->u.tag.make_variantlist = 0;
170 tagn->u.tag.no_data_requested = 0;
171 tagn->u.tag.get_bytes = -1;
172 if (!(tagn->u.tag.element = data1_getelementbytagname (dh,
176 tagn->child = datn = data1_mk_node (dh, m);
179 datn->which = DATA1N_data;
180 datn->u.data.formatted_text = 0;
181 tagn->next = at->child;
188 * Ugh. Sometimes functions just grow and grow on you. This one reads a
189 * 'node' and its children.
191 data1_node *data1_read_node (data1_handle dh, char **buf,
192 data1_node *parent, int *line,
193 data1_absyn *absyn, NMEM m)
197 while (**buf && isspace(**buf))
206 if (**buf == '<') /* beginning of tag */
208 char *tag = (*buf) + 1;
212 data1_element *elem = 0;
214 for (; *t && *t != '>' && !isspace(*t); t++);
215 if (*t != '>' && !isspace(*t))
217 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
220 if (isspace(*t)) /* the tag has arguments */
227 for (; *t && *t != '>'; t++);
228 if (*t != '>' && !isspace(*t))
230 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
237 * if end-tag, see if we terminate parent. If so, consume and return.
246 (parent->which == DATA1N_root &&
247 !strcmp(tag + 1,parent->u.root.type)) ||
248 (parent->which == DATA1N_tag &&
249 !strcmp(tag + 1, parent->u.tag.tag)))
261 if (!absyn) /* parent node - what are we? */
263 if (!(absyn = data1_get_absyn (dh, tag)))
265 logf(LOG_WARN, "Unable to acquire abstract syntax for '%s'",
269 res = data1_mk_node (dh, 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 tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
283 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
285 logf(LOG_WARN, "Malformed variant triple at '%s'", tag);
289 data1_getvartypebyct(dh, parent->root->u.root.absyn->varset,
294 * If we're the first variant in this group, create a parent var,
295 * and insert it before the current variant.
297 if (parent->which != DATA1N_variant)
299 res = data1_mk_node (dh, m);
300 res->which = DATA1N_variant;
301 res->u.variant.type = 0;
302 res->u.variant.value = 0;
303 res->root = parent->root;
309 * now determine if one of our ancestor triples is of same type.
310 * If so, we break here. This will make the parser unwind until
311 * we become a sibling (alternate variant) to the aforementioned
312 * triple. It stinks that we re-parse these tags on every
313 * iteration of this. This is a function in need of a rewrite.
315 for (p = parent; p->which == DATA1N_variant; p = p->parent)
316 if (p->u.variant.type == tp)
322 res = data1_mk_node (dh, m);
323 res->which = DATA1N_variant;
324 res->root = parent->root;
325 res->u.variant.type = tp;
326 res->u.variant.value = args + val_offset;
330 else /* tag.. acquire our element in the abstract syntax */
332 data1_node *partag = get_parent_tag (dh, parent);
333 data1_element *e = 0;
336 if (parent->which == DATA1N_variant)
342 if (!(e = partag->u.tag.element))
343 localtag = 1; /* our parent is a local tag */
346 if (!localtag && !(elem = data1_getelementbytagname(absyn,
347 e, tag)) && (data1_gettagbyname(absyn->tagset, tag)))
349 if (parent->which == DATA1N_root)
350 logf(LOG_WARN, "Tag '%s' used out of context", tag);
355 elem = data1_getelementbytagname(dh, absyn, e, tag);
357 res = data1_mk_node (dh, m);
358 res->which = DATA1N_tag;
359 res->u.tag.element = elem;
360 res->u.tag.tag = tag;
361 res->u.tag.node_selected = 0;
362 res->u.tag.make_variantlist = 0;
363 res->u.tag.no_data_requested = 0;
364 res->u.tag.get_bytes = -1;
365 res->root = parent->root;
369 res->parent = parent;
374 while ((*pp = data1_read_node(dh, buf, res, line, absyn, m)))
376 res->last_child = *pp;
380 else /* != '<'... this is a body of text */
383 char *data = *buf, *pp = *buf;
385 if (!parent) /* abort if abstract syntax is undefined */
387 /* Determine length and remove newlines/extra blanks */
388 while (**buf && **buf != '<')
396 while (isspace(**buf))
400 *(pp++) = *((*buf)++);
403 while (isspace(data[len-1]))
405 res = data1_mk_node(dh, m);
406 res->parent = parent;
407 res->which = DATA1N_data;
408 res->u.data.what = DATA1I_text;
409 res->u.data.len = len;
410 res->u.data.data = data;
411 res->u.data.formatted_text = 0;
412 res->root = parent->root;
418 * Read a record in the native syntax.
420 data1_node *data1_read_record(data1_handle dh,
421 int (*rf)(void *, char *, size_t), void *fh,
425 char **buf = data1_get_read_buf (dh, &size);
431 *buf = xmalloc(*size = 4096);
435 if (rd + 4096 > *size && !(*buf =xrealloc(*buf, *size *= 2)))
437 if ((res = (*rf)(fh, *buf + rd, 4096)) <= 0)
442 return data1_read_node(dh, &bp, 0, &line, 0, m);