2 * Copyright (c) 1995, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.4 1995-11-13 09:27:36 quinn
8 * Fiddling with the variant stuff.
10 * Revision 1.3 1995/11/01 16:34:57 quinn
11 * Making data1 look for tables in data1_tabpath
13 * Revision 1.2 1995/11/01 13:54:48 quinn
16 * Revision 1.1 1995/11/01 11:56:09 quinn
17 * Added Retrieval (data management) functions en masse.
19 * Revision 1.14 1995/10/30 12:40:55 quinn
20 * Fixed a couple of bugs.
22 * Revision 1.13 1995/10/25 16:00:47 quinn
23 * USMARC support is now almost operational
25 * Revision 1.12 1995/10/16 14:02:55 quinn
26 * Changes to support element set names and espec1
28 * Revision 1.11 1995/10/13 16:05:08 quinn
29 * Adding Espec1-processing
31 * Revision 1.10 1995/10/11 14:53:44 quinn
34 * Revision 1.9 1995/10/06 16:56:50 quinn
35 * Fixed ranked result.
37 * Revision 1.8 1995/10/06 16:44:13 quinn
38 * Work on attribute set mapping, etc.
40 * Revision 1.7 1995/10/06 12:58:35 quinn
43 * Revision 1.6 1995/10/04 09:29:49 quinn
44 * Adjustments to support USGS test data
46 * Revision 1.5 1995/10/03 17:56:43 quinn
49 * Revision 1.4 1995/10/02 15:53:19 quinn
52 * Revision 1.3 1995/10/02 14:55:21 quinn
53 * *** empty log message ***
55 * Revision 1.2 1995/09/14 15:18:13 quinn
58 * Revision 1.1 1995/09/12 11:24:30 quinn
59 * Beginning to add code for structured records.
72 char *data1_tabpath = 0; /* global path for tables */
74 void data1_set_tabpath(char *p)
75 { data1_tabpath = p; }
77 static data1_node *freelist = 0;
80 * get the tag which is the immediate parent of this node (this may mean
81 * traversing intermediate things like variants and stuff.
83 data1_node *get_parent_tag(data1_node *n)
85 for (; n && n->which != DATA1N_root; n = n->parent)
86 if (n->which == DATA1N_tag)
91 data1_node *data1_mk_node(void)
98 if (!(r = xmalloc(sizeof(*r))))
100 r->next = r->child = r->parent = 0;
105 static void fr_node(data1_node *n)
111 void data1_free_tree(data1_node *t)
113 data1_node *p = t->child, *pn;
125 * Insert a tagged node into the record root as first child of the node at
126 * which should be root or tag itself). Returns pointer to the data node,
127 * which can then be modified.
129 data1_node *data1_insert_taggeddata(data1_node *root, data1_node *at,
132 data1_node *tagn = data1_mk_node();
135 tagn->which = DATA1N_tag;
138 tagn->u.tag.node_selected = 0;
139 tagn->u.tag.make_variantlist = 0;
140 tagn->u.tag.no_data_requested = 0;
141 if (!(tagn->u.tag.element = data1_getelementbytagname(root->u.root.absyn,
147 tagn->child = datn = data1_mk_node();
148 tagn->num_children = 1;
151 datn->which = DATA1N_data;
152 tagn->next = at->child;
160 * Ugh. Sometimes functions just grow and grow on you. This one reads a
161 * 'node' and its children.
163 data1_node *data1_read_node(char **buf, data1_node *parent, int *line,
168 while (**buf && isspace(**buf))
177 if (**buf == '<') /* beginning of tag */
179 char *tag = (*buf) + 1;
183 data1_element *elem = 0;
185 for (; *t && *t != '>' && !isspace(*t); t++);
186 if (*t != '>' && !isspace(*t))
188 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
191 if (isspace(*t)) /* the tag has arguments */
198 for (; *t && *t != '>'; t++);
199 if (*t != '>' && !isspace(*t))
201 logf(LOG_WARN, "d1: %d: Malformed tag", *line);
208 * if end-tag, see if we terminate parent. If so, consume and return.
216 if (!*(tag +1) || (parent->which == DATA1N_root && !strcmp(tag + 1,
217 parent->u.root.type)) ||
218 (parent->which == DATA1N_tag && !strcmp(tag + 1,
231 if (!absyn) /* parent node - what are we? */
233 if (!(absyn = data1_get_absyn(tag)))
235 logf(LOG_WARN, "Unable to acquire abstract syntax for '%s'",
239 res = data1_mk_node();
240 res->which = DATA1N_root;
241 res->u.root.type = tag;
242 res->u.root.absyn = absyn;
246 else if (!strncmp(tag, "var", 3))
248 char class[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
253 if (sscanf(args, "%s %s %n", class, type, &val_offset) != 2)
255 logf(LOG_WARN, "Malformed variant triple at '%s'", tag);
258 if (!(tp = data1_getvartypebyct(parent->root->u.root.absyn->varset,
263 * If we're the first variant in this group, create a parent var,
264 * and insert it before the current variant.
266 if (parent->which != DATA1N_variant)
268 res = data1_mk_node();
269 res->which = DATA1N_variant;
270 res->u.variant.type = 0;
271 res->u.variant.value = 0;
272 res->root = parent->root;
278 * now determine if one of our ancestor triples is of same type.
279 * If so, we break here. This will make the parser unwind until
280 * we become a sibling (alternate variant) to the aforementioned
281 * triple. It stinks that we re-parse these tags on every
282 * iteration of this. This is a function in need of a rewrite.
284 for (p = parent; p->which == DATA1N_variant; p = p->parent)
285 if (p->u.variant.type == tp)
291 res = data1_mk_node();
292 res->which = DATA1N_variant;
293 res->root = parent->root;
294 res->u.variant.type = tp;
295 res->u.variant.value = args + val_offset;
299 else /* tag.. acquire our element in the abstract syntax */
301 data1_node *partag = get_parent_tag(parent);
302 data1_element *e = 0;
305 if (parent->which == DATA1N_variant)
311 if (!(e = partag->u.tag.element))
312 localtag = 1; /* our parent is a local tag */
315 if (!localtag && !(elem = data1_getelementbytagname(absyn,
316 e, tag)) && (data1_gettagbyname(absyn->tagset, tag)))
318 if (parent->which == DATA1N_root)
319 logf(LOG_WARN, "Tag '%s' used out of context", tag);
324 elem = data1_getelementbytagname(absyn, e, tag);
326 res = data1_mk_node();
327 res->which = DATA1N_tag;
328 res->u.tag.element = elem;
329 res->u.tag.tag = tag;
330 res->u.tag.node_selected = 0;
331 res->u.tag.make_variantlist = 0;
332 res->u.tag.no_data_requested = 0;
333 res->root = parent->root;
337 res->parent = parent;
338 res->num_children = 0;
344 while ((*pp = data1_read_node(buf, res, line, absyn)))
350 else /* != '<'... this is a body of text */
353 char *data = *buf, *pp = *buf;
355 data1_node *partag = get_parent_tag(parent);
358 /* Determine length and remove newlines/extra blanks */
359 while (**buf && **buf != '<')
367 while (isspace(**buf))
371 *(pp++) = *((*buf)++);
374 while (isspace(data[len-1]))
376 res = data1_mk_node();
377 res->parent = parent;
378 res->which = DATA1N_data;
379 res->u.data.what = DATA1I_text;
380 res->u.data.len = len;
381 res->u.data.data = data;
382 res->root = parent->root;
385 * if the parent is structured, we'll insert a 'wellKnown' marker
386 * in front of the data.
389 if (partag->u.tag.element && partag->u.tag.element->tag->kind ==
392 data1_node *wk = mk_node();
393 static data1_element wk_element = { 0, 0, 0, 0, 0};
396 wk->root = partag->root;
397 wk->which = DATA1N_tag;
400 * get well-known tagdef if required.
402 if (!wk_element.tag && !(wk_element.tag =
403 data1_gettagbynum(wk->root->u.root.absyn->tagset, 1, 19)))
406 "Failed to initialize 'wellknown' tag from tagsetM");
409 wk->u.tag.element = &wk_element;
410 wk->child = partag->child;
412 wk->child->parent = wk;
421 * Read a record in the native syntax.
423 data1_node *data1_read_record(int (*rf)(int, char *, size_t), int fd)
425 static char *buf = 0;
431 if (!buf && !(buf = xmalloc(size = 4096)))
435 if (rd + 4096 > size && !(buf =xrealloc(buf, size *= 2)))
437 if ((res = (*rf)(fd, buf + rd, 4096)) <= 0)
442 return data1_read_node(&bp, 0, &line, 0);