2 * Copyright (c) 1995-2000, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.18 2000-11-29 14:22:47 adam
8 * Implemented XML/SGML attributes for data1 so that d1_read reads them
9 * and d1_write generates proper attributes for XML/SGML records. Added
10 * register locking for threaded version.
12 * Revision 1.17 1999/11/30 13:47:12 adam
13 * Improved installation. Moved header files to include/yaz.
15 * Revision 1.16 1999/10/21 12:06:29 adam
16 * Retrieval module no longer uses ctype.h - functions.
18 * Revision 1.15 1999/08/27 09:40:32 adam
19 * Renamed logf function to yaz_log. Removed VC++ project files.
21 * Revision 1.14 1998/10/13 16:09:50 adam
22 * Added support for arbitrary OID's for tagsets, schemas and attribute sets.
23 * Added support for multiple attribute set references and tagset references
24 * from an abstract syntax file.
25 * Fixed many bad logs-calls in routines that read the various
26 * specifications regarding data1 (*.abs,*.att,...) and made the messages
27 * consistent whenever possible.
28 * Added extra 'lineno' argument to function readconf_line.
30 * Revision 1.13 1998/02/11 11:53:35 adam
31 * Changed code so that it compiles as C++.
33 * Revision 1.12 1997/11/18 09:51:09 adam
34 * Removed element num_children from data1_node. Minor changes in
37 * Revision 1.11 1997/09/17 12:10:36 adam
40 * Revision 1.10 1997/09/05 09:50:56 adam
41 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
43 * Revision 1.9 1996/06/10 08:56:02 quinn
46 * Revision 1.8 1996/05/01 12:45:31 quinn
47 * Support use of local tag names in abs file.
49 * Revision 1.7 1995/12/13 13:44:31 quinn
50 * Modified Data1-system to use nmem
52 * Revision 1.6 1995/12/12 16:37:08 quinn
53 * Added destroy element to data1_node.
55 * Revision 1.5 1995/12/12 14:11:31 quinn
56 * More work on the large-record problem.
58 * Revision 1.4 1995/12/11 15:22:37 quinn
59 * Added last_child field to the node.
60 * Rewrote schema-mapping.
62 * Revision 1.3 1995/11/01 16:34:56 quinn
63 * Making data1 look for tables in data1_tabpath
65 * Revision 1.2 1995/11/01 13:54:46 quinn
68 * Revision 1.1 1995/11/01 11:56:08 quinn
69 * Added Retrieval (data management) functions en masse.
80 #include <yaz/readconf.h>
81 #include <yaz/tpath.h>
82 #include <yaz/data1.h>
83 #include <yaz/d1_map.h>
85 data1_maptab *data1_read_maptab (data1_handle dh, const char *file)
87 NMEM mem = data1_nmem_get (dh);
88 data1_maptab *res = (data1_maptab *)nmem_malloc(mem, sizeof(*res));
92 char *argv[50], line[512];
94 int local_numeric = 0;
96 if (!(f = yaz_path_fopen(data1_get_tabpath(dh), file, "r")))
98 yaz_log(LOG_WARN|LOG_ERRNO, "%s", file);
103 res->target_absyn_ref = VAL_NONE;
108 while ((argc = readconf_line(f, &lineno, line, 512, argv, 50)))
109 if (!strcmp(argv[0], "targetref"))
113 yaz_log(LOG_WARN, "%s:%d: Bad # args for targetref",
117 if ((res->target_absyn_ref = oid_getvalbyname(argv[1]))
120 yaz_log(LOG_WARN, "%s:%d: Unknown reference '%s'",
121 file, lineno, argv[1]);
125 else if (!strcmp(argv[0], "targetname"))
129 yaz_log(LOG_WARN, "%s:%d: Bad # args for targetname",
133 res->target_absyn_name =
134 (char *)nmem_malloc(mem, strlen(argv[1])+1);
135 strcpy(res->target_absyn_name, argv[1]);
137 else if (!yaz_matchstr(argv[0], "localnumeric"))
139 else if (!strcmp(argv[0], "name"))
143 yaz_log(LOG_WARN, "%s:%d: Bad # args for name", file, lineno);
146 res->name = (char *)nmem_malloc(mem, strlen(argv[1])+1);
147 strcpy(res->name, argv[1]);
149 else if (!strcmp(argv[0], "map"))
152 char *ep, *path = argv[2];
156 yaz_log(LOG_WARN, "%s:%d: Bad # of args for map",
160 *mapp = (data1_mapunit *)nmem_malloc(mem, sizeof(**mapp));
162 if (argc > 3 && !data1_matchstr(argv[3], "nodata"))
163 (*mapp)->no_data = 1;
165 (*mapp)->no_data = 0;
166 (*mapp)->source_element_name =
167 (char *)nmem_malloc(mem, strlen(argv[1])+1);
168 strcpy((*mapp)->source_element_name, argv[1]);
169 mtp = &(*mapp)->target_path;
172 for (ep = strchr(path, '/'); path; (void)((path = ep) &&
173 (ep = strchr(path, '/'))))
176 char valstr[512], parm[512];
180 if ((np = sscanf(path, "(%d,%[^)]):%[^/]", &type, valstr,
183 yaz_log(LOG_WARN, "%s:%d: Syntax error in map "
184 "directive: %s", file, lineno, argv[2]);
188 *mtp = (data1_maptag *)nmem_malloc(mem, sizeof(**mtp));
191 if (np > 2 && !data1_matchstr(parm, "new"))
192 (*mtp)->new_field = 1;
194 (*mtp)->new_field = 0;
195 if ((type != 3 || local_numeric) && d1_isdigit(*valstr))
197 (*mtp)->which = D1_MAPTAG_numeric;
198 (*mtp)->value.numeric = atoi(valstr);
202 (*mtp)->which = D1_MAPTAG_string;
203 (*mtp)->value.string =
204 (char *)nmem_malloc(mem, strlen(valstr)+1);
205 strcpy((*mtp)->value.string, valstr);
209 mapp = &(*mapp)->next;
212 yaz_log(LOG_WARN, "%s:%d: Unknown directive '%s'",
213 file, lineno, argv[0]);
220 * Locate node with given elementname.
221 * NOTE: This is stupid - we don't find repeats this way.
223 static data1_node *find_node(data1_node *p, char *elementname)
227 for (c = p->child; c; c = c->next)
228 if (c->which == DATA1N_tag && c->u.tag.element &&
229 !data1_matchstr(c->u.tag.element->name, elementname))
231 else if ((r = find_node(c, elementname)))
237 * See if the node n is equivalent to the tag t.
239 static int tagmatch(data1_node *n, data1_maptag *t)
241 if (n->which != DATA1N_tag)
243 if (n->u.tag.element)
245 if (n->u.tag.element->tag->tagset)
247 if (n->u.tag.element->tag->tagset->type != t->type)
250 else if (t->type != 3)
252 if (n->u.tag.element->tag->which == DATA1T_numeric)
254 if (t->which != D1_MAPTAG_numeric)
256 if (n->u.tag.element->tag->value.numeric != t->value.numeric)
261 if (t->which != D1_MAPTAG_string)
263 if (data1_matchstr(n->u.tag.element->tag->value.string,
274 if (t->which == D1_MAPTAG_numeric)
275 sprintf(str, "%d", t->value.numeric);
277 strcpy(str, t->value.string);
278 if (data1_matchstr(n->u.tag.tag, str))
284 static int map_children(data1_handle dh, data1_node *n, data1_maptab *map,
285 data1_node *res, NMEM mem)
290 * locate each source element in turn.
292 for (c = n->child; c; c = c->next)
293 if (c->which == DATA1N_tag && c->u.tag.element)
295 for (m = map->map; m; m = m->next)
297 if (!data1_matchstr(m->source_element_name,
298 c->u.tag.element->name))
300 data1_node *pn = res;
301 data1_node *cur = pn->last_child;
305 * process the target path specification.
307 for (mt = m->target_path; mt; mt = mt->next)
309 if (!cur || mt->new_field || !tagmatch(cur, mt))
311 cur = data1_mk_node_type (dh, mem, DATA1N_tag);
312 cur->u.tag.tag = mt->value.string;
315 cur->root = pn->root;
319 pn->last_child->next = cur;
320 pn->last_child = cur;
325 else if (!m->no_data)
327 cur->child = c->child;
328 cur->last_child = c->last_child;
336 if (map_children(dh, c, map, res, mem) < 0)
343 * Create a (possibly lossy) copy of the given record based on the
344 * table. The new copy will refer back to the data of the original record,
345 * which should not be discarded during the lifetime of the copy.
347 data1_node *data1_map_record (data1_handle dh, data1_node *n,
348 data1_maptab *map, NMEM m)
350 data1_node *res = data1_mk_node(dh, m);
352 res->which = DATA1N_root;
353 res->u.root.type = map->target_absyn_name;
354 if (!(res->u.root.absyn = data1_get_absyn(dh, map->target_absyn_name)))
356 yaz_log(LOG_WARN, "%s: Failed to load target absyn '%s'",
357 map->name, map->target_absyn_name);
362 if (map_children(dh, n, map, res, m) < 0)
364 data1_free_tree(dh, res);