2 * Copyright (c) 1995, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.3 1995-11-01 16:34:56 quinn
8 * Making data1 look for tables in data1_tabpath
10 * Revision 1.2 1995/11/01 13:54:46 quinn
13 * Revision 1.1 1995/11/01 11:56:08 quinn
14 * Added Retrieval (data management) functions en masse.
32 data1_maptab *data1_read_maptab(char *file)
34 data1_maptab *res = xmalloc(sizeof(*res));
37 char *argv[50], line[512];
40 if (!(f = yaz_path_fopen(data1_tabpath, file, "r")))
42 logf(LOG_WARN|LOG_ERRNO, "%s", file);
47 res->target_absyn_ref = ODR_NONE;
52 while ((argc = readconf_line(f, line, 512, argv, 50)))
53 if (!strcmp(argv[0], "targetref"))
57 logf(LOG_WARN, "%s: one argument required for targetref",
61 if ((res->target_absyn_ref = oid_getvalbyname(argv[1])) == ODR_NONE)
63 logf(LOG_WARN, "%s: Unknown reference '%s'", file, argv[1]);
67 else if (!strcmp(argv[0], "targetname"))
71 logf(LOG_WARN, "%s: one argument required for targetref",
75 res->target_absyn_name = xmalloc(strlen(argv[1])+1);
76 strcpy(res->target_absyn_name, argv[1]);
78 else if (!strcmp(argv[0], "name"))
82 logf(LOG_WARN, "%s: one argument required for name",
86 res->name = xmalloc(strlen(argv[1])+1);
87 strcpy(res->name, argv[1]);
89 else if (!strcmp(argv[0], "map"))
92 char *ep, *path = argv[2];
96 logf(LOG_WARN, "%s: At least 2 arguments required for map",
100 *mapp = xmalloc(sizeof(**mapp));
102 if (argc > 3 && !data1_matchstr(argv[3], "nodata"))
103 (*mapp)->no_data = 1;
105 (*mapp)->no_data = 0;
106 (*mapp)->source_element_name = xmalloc(strlen(argv[1])+1);
107 strcpy((*mapp)->source_element_name, argv[1]);
108 mtp = &(*mapp)->target_path;
111 for (ep = strchr(path, '/'); path; (void)((path = ep) &&
112 (ep = strchr(path, '/'))))
115 char valstr[512], parm[512];
120 if ((np = sscanf(path, "(%d,%[^)]):%[^/]", &type, valstr,
123 logf(LOG_WARN, "%s: Syntax error in map directive: %s",
128 *mtp = xmalloc(sizeof(**mtp));
131 if (np > 2 && !data1_matchstr(parm, "new"))
132 (*mtp)->new_field = 1;
134 (*mtp)->new_field = 0;
136 if ((numval = atoi(valstr)))
138 (*mtp)->which = D1_MAPTAG_numeric;
139 (*mtp)->value.numeric = numval;
144 (*mtp)->which = D1_MAPTAG_string;
145 (*mtp)->value.string = xmalloc(strlen(valstr)+1);
146 strcpy((*mtp)->value.string, valstr);
152 mapp = &(*mapp)->next;
155 logf(LOG_WARN, "%s: Unknown directive '%s'", argv[0]);
162 * Locate node with givel elementname.
163 * NOTE: This is stupid - we don't find repeats this way.
165 static data1_node *find_node(data1_node *p, char *elementname)
169 for (c = p->child; c; c = c->next)
170 if (c->which == DATA1N_tag && c->u.tag.element &&
171 !data1_matchstr(c->u.tag.element->name, elementname))
173 else if ((r = find_node(c, elementname)))
179 * See if the node n is equivalent to the tag t.
181 static int tagmatch(data1_node *n, data1_maptag *t)
183 if (n->which != DATA1N_tag)
185 if (n->u.tag.element)
187 if (n->u.tag.element->tag->tagset->type != t->type)
189 if (n->u.tag.element->tag->which == DATA1T_numeric)
191 if (t->which != D1_MAPTAG_numeric)
193 if (n->u.tag.element->tag->value.numeric != t->value.numeric)
198 if (t->which != D1_MAPTAG_string)
200 if (data1_matchstr(n->u.tag.element->tag->value.string,
211 if (t->which == D1_MAPTAG_numeric)
212 sprintf(str, "%d", t->value.numeric);
214 strcpy(str, t->value.string);
215 if (data1_matchstr(n->u.tag.tag, str))
221 static int map_children(data1_node *n, data1_maptab *map, data1_node *res)
226 * locate each source element in turn.
228 for (c = n->child; c; c = c->next)
229 if (c->which == DATA1N_tag && c->u.tag.element)
231 for (m = map->map; m; m = m->next)
233 if (!data1_matchstr(m->source_element_name,
234 c->u.tag.element->name))
236 data1_node *pn = res;
241 * process the target path specification.
243 for (mt = m->target_path; mt; mt = mt->next)
249 for (l = pn->child, last = 0; l; last = l, l = l->next)
251 match = tagmatch(l, mt);
253 if (!tagmatch(l, mt))
255 if (!match || !mt->next || mt->new_field)
257 cur = data1_mk_node();
258 cur->which = DATA1N_tag;
259 cur->u.tag.element = 0;
260 cur->u.tag.tag = mt->value.string;
261 cur->u.tag.node_selected = 0;
263 cur->root = pn->root;
266 cur->next = pn->child;
271 cur->next = last->next;
277 cur = last ? last : pn->child;
281 else if (!m->no_data)
283 cur->child = c->child;
284 cur->num_children = c->num_children;
291 if (map_children(c, map, res) < 0)
298 * Create a (possibly lossy) copy of the given record based on the
299 * table. The new copy will refer back to the data of the original record,
300 * which should not be discarded during the lifetime of the copy.
302 data1_node *data1_map_record(data1_node *n, data1_maptab *map)
304 data1_node *res = data1_mk_node();
306 res->which = DATA1N_root;
307 res->u.root.type = map->target_absyn_name;
308 if (!(res->u.root.absyn = data1_get_absyn(map->target_absyn_name)))
310 logf(LOG_WARN, "%s: Failed to load target absyn '%s'",
311 map->name, map->target_absyn_name);
316 if (map_children(n, map, res) < 0)
318 data1_free_tree(res);