/*
- * Copyright (c) 1995, Index Data.
+ * Copyright (c) 1995-1997, Index Data.
* See the file LICENSE for details.
* Sebastian Hammer, Adam Dickmeiss
*
* $Log: d1_read.c,v $
- * Revision 1.4 1995-11-13 09:27:36 quinn
+ * Revision 1.16 1997-09-17 12:10:37 adam
+ * YAZ version 1.4.
+ *
+ * Revision 1.15 1997/09/05 09:50:57 adam
+ * Removed global data1_tabpath - uses data1_get_tabpath() instead.
+ *
+ * Revision 1.14 1997/05/14 06:54:04 adam
+ * C++ support.
+ *
+ * Revision 1.13 1996/10/29 13:35:38 adam
+ * Implemented data1_set_tabpath and data1_get_tabpath.
+ *
+ * Revision 1.12 1996/10/11 10:35:38 adam
+ * Fixed a bug that caused data1_read_node to core dump when no abstract
+ * syntax was defined in a "sgml"-record.
+ *
+ * Revision 1.11 1996/07/06 19:58:35 quinn
+ * System headerfiles gathered in yconfig
+ *
+ * Revision 1.10 1996/01/19 15:41:47 quinn
+ * Fixed uninitialized boolean.
+ *
+ * Revision 1.9 1996/01/17 14:52:47 adam
+ * Changed prototype for reader function parsed to data1_read_record.
+ *
+ * Revision 1.8 1995/12/15 16:20:41 quinn
+ * Added formatted text.
+ *
+ * Revision 1.7 1995/12/13 13:44:32 quinn
+ * Modified Data1-system to use nmem
+ *
+ * Revision 1.6 1995/12/12 16:37:08 quinn
+ * Added destroy element to data1_node.
+ *
+ * Revision 1.5 1995/12/11 15:22:37 quinn
+ * Added last_child field to the node.
+ * Rewrote schema-mapping.
+ *
+ * Revision 1.4 1995/11/13 09:27:36 quinn
* Fiddling with the variant stuff.
*
* Revision 1.3 1995/11/01 16:34:57 quinn
#include <log.h>
#include <data1.h>
-char *data1_tabpath = 0; /* global path for tables */
-
-void data1_set_tabpath(char *p)
-{ data1_tabpath = p; }
-
-static data1_node *freelist = 0;
-
/*
* get the tag which is the immediate parent of this node (this may mean
* traversing intermediate things like variants and stuff.
*/
-data1_node *get_parent_tag(data1_node *n)
+data1_node *get_parent_tag (data1_handle dh, data1_node *n)
{
for (; n && n->which != DATA1N_root; n = n->parent)
if (n->which == DATA1N_tag)
return 0;
}
-data1_node *data1_mk_node(void)
+data1_node *data1_mk_node (data1_handle dh, NMEM m)
{
data1_node *r;
- if ((r = freelist))
- freelist = r->next;
- else
- if (!(r = xmalloc(sizeof(*r))))
- abort();
- r->next = r->child = r->parent = 0;
+ r = nmem_malloc(m, sizeof(*r));
+ r->next = r->child = r->last_child = r->parent = 0;
r->num_children = 0;
+ r->destroy = 0;
return r;
}
-static void fr_node(data1_node *n)
-{
- n->next = freelist;
- freelist = n;
-}
-
-void data1_free_tree(data1_node *t)
+void data1_free_tree (data1_handle dh, data1_node *t)
{
data1_node *p = t->child, *pn;
while (p)
{
pn = p->next;
- data1_free_tree(p);
+ data1_free_tree (dh, p);
p = pn;
}
- fr_node(t);
+ if (t->destroy)
+ (*t->destroy)(t);
}
/*
* which should be root or tag itself). Returns pointer to the data node,
* which can then be modified.
*/
-data1_node *data1_insert_taggeddata(data1_node *root, data1_node *at,
- char *tagname)
+data1_node *data1_insert_taggeddata(data1_handle dh, data1_node *root,
+ data1_node *at,
+ char *tagname, NMEM m)
{
- data1_node *tagn = data1_mk_node();
+ data1_node *tagn = data1_mk_node (dh, m);
data1_node *datn;
tagn->which = DATA1N_tag;
tagn->u.tag.node_selected = 0;
tagn->u.tag.make_variantlist = 0;
tagn->u.tag.no_data_requested = 0;
- if (!(tagn->u.tag.element = data1_getelementbytagname(root->u.root.absyn,
- 0, tagname)))
- {
- fr_node(tagn);
+ tagn->u.tag.get_bytes = -1;
+ if (!(tagn->u.tag.element = data1_getelementbytagname (dh,
+ root->u.root.absyn,
+ 0, tagname)))
return 0;
- }
- tagn->child = datn = data1_mk_node();
+ tagn->child = datn = data1_mk_node (dh, m);
tagn->num_children = 1;
datn->parent = tagn;
datn->root = root;
datn->which = DATA1N_data;
+ datn->u.data.formatted_text = 0;
tagn->next = at->child;
tagn->parent = at;
at->child = tagn;
* Ugh. Sometimes functions just grow and grow on you. This one reads a
* 'node' and its children.
*/
-data1_node *data1_read_node(char **buf, data1_node *parent, int *line,
- data1_absyn *absyn)
+data1_node *data1_read_node (data1_handle dh, char **buf,
+ data1_node *parent, int *line,
+ data1_absyn *absyn, NMEM m)
{
data1_node *res;
if (!absyn) /* parent node - what are we? */
{
- if (!(absyn = data1_get_absyn(tag)))
+ if (!(absyn = data1_get_absyn (dh, tag)))
{
logf(LOG_WARN, "Unable to acquire abstract syntax for '%s'",
tag);
return 0;
}
- res = data1_mk_node();
+ res = data1_mk_node (dh, m);
res->which = DATA1N_root;
res->u.root.type = tag;
res->u.root.absyn = absyn;
}
else if (!strncmp(tag, "var", 3))
{
- char class[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
+ char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
data1_vartype *tp;
int val_offset;
data1_node *p;
- if (sscanf(args, "%s %s %n", class, type, &val_offset) != 2)
+ if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
{
logf(LOG_WARN, "Malformed variant triple at '%s'", tag);
return 0;
}
- if (!(tp = data1_getvartypebyct(parent->root->u.root.absyn->varset,
- class, type)))
+ if (!(tp = data1_getvartypebyct(dh, parent->root->u.root.absyn->varset,
+ tclass, type)))
return 0;
/*
*/
if (parent->which != DATA1N_variant)
{
- res = data1_mk_node();
+ res = data1_mk_node (dh, m);
res->which = DATA1N_variant;
res->u.variant.type = 0;
res->u.variant.value = 0;
return 0;
}
- res = data1_mk_node();
+ res = data1_mk_node (dh, m);
res->which = DATA1N_variant;
res->root = parent->root;
res->u.variant.type = tp;
}
else /* tag.. acquire our element in the abstract syntax */
{
- data1_node *partag = get_parent_tag(parent);
+ data1_node *partag = get_parent_tag (dh, parent);
data1_element *e = 0;
int localtag = 0;
return 0;
}
#else
- elem = data1_getelementbytagname(absyn, e, tag);
+ elem = data1_getelementbytagname(dh, absyn, e, tag);
#endif
- res = data1_mk_node();
+ res = data1_mk_node (dh, m);
res->which = DATA1N_tag;
res->u.tag.element = elem;
res->u.tag.tag = tag;
res->u.tag.node_selected = 0;
res->u.tag.make_variantlist = 0;
res->u.tag.no_data_requested = 0;
+ res->u.tag.get_bytes = -1;
res->root = parent->root;
*buf = t + 1;
}
/*
* Read child nodes.
*/
- while ((*pp = data1_read_node(buf, res, line, absyn)))
+ while ((*pp = data1_read_node(dh, buf, res, line, absyn, m)))
{
+ res->last_child = *pp;
res->num_children++;
pp = &(*pp)->next;
}
{
int len = 0;
char *data = *buf, *pp = *buf;
-#if 0
- data1_node *partag = get_parent_tag(parent);
-#endif
+ if (!parent) /* abort if abstract syntax is undefined */
+ return 0;
/* Determine length and remove newlines/extra blanks */
while (**buf && **buf != '<')
{
}
while (isspace(data[len-1]))
len--;
- res = data1_mk_node();
+ res = data1_mk_node(dh, m);
res->parent = parent;
res->which = DATA1N_data;
res->u.data.what = DATA1I_text;
res->u.data.len = len;
res->u.data.data = data;
+ res->u.data.formatted_text = 0;
res->root = parent->root;
-
- /*
- * if the parent is structured, we'll insert a 'wellKnown' marker
- * in front of the data.
- */
-#if 0
- if (partag->u.tag.element && partag->u.tag.element->tag->kind ==
- DATA1K_structured)
- {
- data1_node *wk = mk_node();
- static data1_element wk_element = { 0, 0, 0, 0, 0};
-
- wk->parent = partag;
- wk->root = partag->root;
- wk->which = DATA1N_tag;
- wk->u.tag.tag = 0;
- /*
- * get well-known tagdef if required.
- */
- if (!wk_element.tag && !(wk_element.tag =
- data1_gettagbynum(wk->root->u.root.absyn->tagset, 1, 19)))
- {
- logf(LOG_WARN,
- "Failed to initialize 'wellknown' tag from tagsetM");
- return 0;
- }
- wk->u.tag.element = &wk_element;
- wk->child = partag->child;
- if (wk->child)
- wk->child->parent = wk;
- partag->child = wk;
- }
-#endif
}
return res;
}
/*
* Read a record in the native syntax.
*/
-data1_node *data1_read_record(int (*rf)(int, char *, size_t), int fd)
+data1_node *data1_read_record(data1_handle dh,
+ int (*rf)(void *, char *, size_t), void *fh,
+ NMEM m)
{
- static char *buf = 0;
+ int *size;
+ char **buf = data1_get_read_buf (dh, &size);
char *bp;
- static int size;
int rd = 0, res;
int line = 0;
-
- if (!buf && !(buf = xmalloc(size = 4096)))
- abort();
+
+ if (!*buf)
+ *buf = xmalloc(*size = 4096);
+
for (;;)
{
- if (rd + 4096 > size && !(buf =xrealloc(buf, size *= 2)))
+ if (rd + 4096 > *size && !(*buf =xrealloc(*buf, *size *= 2)))
abort();
- if ((res = (*rf)(fd, buf + rd, 4096)) <= 0)
+ if ((res = (*rf)(fh, *buf + rd, 4096)) <= 0)
{
if (!res)
{
- bp = buf;
- return data1_read_node(&bp, 0, &line, 0);
+ bp = *buf;
+ return data1_read_node(dh, &bp, 0, &line, 0, m);
}
else
return 0;
projects / yaz-moved-to-github.git / blobdiff