2 * Copyright (c) 1995-1997, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.17 1997-11-05 09:20:51 adam
10 * Revision 1.16 1997/09/17 12:10:37 adam
13 * Revision 1.15 1997/09/05 09:50:57 adam
14 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
16 * Revision 1.14 1997/05/14 06:54:04 adam
19 * Revision 1.13 1996/10/29 13:35:38 adam
20 * Implemented data1_set_tabpath and data1_get_tabpath.
22 * Revision 1.12 1996/10/11 10:35:38 adam
23 * Fixed a bug that caused data1_read_node to core dump when no abstract
24 * syntax was defined in a "sgml"-record.
26 * Revision 1.11 1996/07/06 19:58:35 quinn
27 * System headerfiles gathered in yconfig
29 * Revision 1.10 1996/01/19 15:41:47 quinn
30 * Fixed uninitialized boolean.
32 * Revision 1.9 1996/01/17 14:52:47 adam
33 * Changed prototype for reader function parsed to data1_read_record.
35 * Revision 1.8 1995/12/15 16:20:41 quinn
36 * Added formatted text.
38 * Revision 1.7 1995/12/13 13:44:32 quinn
39 * Modified Data1-system to use nmem
41 * Revision 1.6 1995/12/12 16:37:08 quinn
42 * Added destroy element to data1_node.
44 * Revision 1.5 1995/12/11 15:22:37 quinn
45 * Added last_child field to the node.
46 * Rewrote schema-mapping.
48 * Revision 1.4 1995/11/13 09:27:36 quinn
49 * Fiddling with the variant stuff.
51 * Revision 1.3 1995/11/01 16:34:57 quinn
52 * Making data1 look for tables in data1_tabpath
54 * Revision 1.2 1995/11/01 13:54:48 quinn
57 * Revision 1.1 1995/11/01 11:56:09 quinn
58 * Added Retrieval (data management) functions en masse.
60 * Revision 1.14 1995/10/30 12:40:55 quinn
61 * Fixed a couple of bugs.
63 * Revision 1.13 1995/10/25 16:00:47 quinn
64 * USMARC support is now almost operational
66 * Revision 1.12 1995/10/16 14:02:55 quinn
67 * Changes to support element set names and espec1
69 * Revision 1.11 1995/10/13 16:05:08 quinn
70 * Adding Espec1-processing
72 * Revision 1.10 1995/10/11 14:53:44 quinn
75 * Revision 1.9 1995/10/06 16:56:50 quinn
76 * Fixed ranked result.
78 * Revision 1.8 1995/10/06 16:44:13 quinn
79 * Work on attribute set mapping, etc.
81 * Revision 1.7 1995/10/06 12:58:35 quinn
84 * Revision 1.6 1995/10/04 09:29:49 quinn
85 * Adjustments to support USGS test data
87 * Revision 1.5 1995/10/03 17:56:43 quinn
90 * Revision 1.4 1995/10/02 15:53:19 quinn
93 * Revision 1.3 1995/10/02 14:55:21 quinn
94 * *** empty log message ***
96 * Revision 1.2 1995/09/14 15:18:13 quinn
99 * Revision 1.1 1995/09/12 11:24:30 quinn
100 * Beginning to add code for structured records.
114 * get the tag which is the immediate parent of this node (this may mean
115 * traversing intermediate things like variants and stuff.
117 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
119 for (; n && n->which != DATA1N_root; n = n->parent)
120 if (n->which == DATA1N_tag)
125 data1_node *data1_mk_node (data1_handle dh, NMEM m)
129 r = nmem_malloc(m, sizeof(*r));
130 r->next = r->child = r->last_child = r->parent = 0;
136 void data1_free_tree (data1_handle dh, data1_node *t)
138 data1_node *p = t->child, *pn;
143 data1_free_tree (dh, p);
151 * Insert a tagged node into the record root as first child of the node at
152 * which should be root or tag itself). Returns pointer to the data node,
153 * which can then be modified.
155 data1_node *data1_insert_taggeddata(data1_handle dh, data1_node *root,
157 char *tagname, NMEM m)
159 data1_node *tagn = data1_mk_node (dh, m);
162 tagn->which = DATA1N_tag;
165 tagn->u.tag.node_selected = 0;
166 tagn->u.tag.make_variantlist = 0;
167 tagn->u.tag.no_data_requested = 0;
168 tagn->u.tag.get_bytes = -1;
169 if (!(tagn->u.tag.element = data1_getelementbytagname (dh,
173 tagn->child = datn = data1_mk_node (dh, m);
174 tagn->num_children = 1;
177 datn->which = DATA1N_data;
178 datn->u.data.formatted_text = 0;
179 tagn->next = at->child;
187 * Ugh. Sometimes functions just grow and grow on you. This one reads a
188 * 'node' and its children.
190 data1_node *data1_read_node (data1_handle dh, char **buf,
191 data1_node *parent, int *line,
192 data1_absyn *absyn, NMEM m)
196 while (**buf && isspace(**buf))
205 if (**buf == '<') /* beginning of tag */
207 char *tag = (*buf) + 1;
211 data1_element *elem = 0;
213 for (; *t && *t != '>' && !isspace(*t); t++);
214 if (*t != '>' && !isspace(*t))
216 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
219 if (isspace(*t)) /* the tag has arguments */
226 for (; *t && *t != '>'; t++);
227 if (*t != '>' && !isspace(*t))
229 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
236 * if end-tag, see if we terminate parent. If so, consume and return.
245 (parent->which == DATA1N_root &&
246 !strcmp(tag + 1,parent->u.root.type)) ||
247 (parent->which == DATA1N_tag &&
248 !strcmp(tag + 1, parent->u.tag.tag)))
260 if (!absyn) /* parent node - what are we? */
262 if (!(absyn = data1_get_absyn (dh, tag)))
264 logf(LOG_WARN, "Unable to acquire abstract syntax for '%s'",
268 res = data1_mk_node (dh, m);
269 res->which = DATA1N_root;
270 res->u.root.type = tag;
271 res->u.root.absyn = absyn;
275 else if (!strncmp(tag, "var", 3))
277 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
282 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
284 logf(LOG_WARN, "Malformed variant triple at '%s'", tag);
288 data1_getvartypebyct(dh, 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 (dh, 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 (dh, 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 (dh, 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(dh, absyn, e, tag);
356 res = data1_mk_node (dh, 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->u.tag.get_bytes = -1;
364 res->root = parent->root;
368 res->parent = parent;
369 res->num_children = 0;
375 while ((*pp = data1_read_node(dh, buf, res, line, absyn, m)))
377 res->last_child = *pp;
382 else /* != '<'... this is a body of text */
385 char *data = *buf, *pp = *buf;
387 if (!parent) /* abort if abstract syntax is undefined */
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(dh, 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(data1_handle dh,
423 int (*rf)(void *, char *, size_t), void *fh,
427 char **buf = data1_get_read_buf (dh, &size);
433 *buf = xmalloc(*size = 4096);
437 if (rd + 4096 > *size && !(*buf =xrealloc(*buf, *size *= 2)))
439 if ((res = (*rf)(fh, *buf + rd, 4096)) <= 0)
444 return data1_read_node(dh, &bp, 0, &line, 0, m);