2 * Copyright (c) 1995-1997, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.11 1998-02-11 11:53:35 adam
8 * Changed code so that it compiles as C++.
10 * Revision 1.10 1997/09/30 11:50:04 adam
11 * Added handler data1_get_map_buf that is used by data1_nodetomarc.
13 * Revision 1.9 1997/09/24 13:35:45 adam
14 * Added two members to data1_marctab to ease reading of weird MARC records.
16 * Revision 1.8 1997/09/17 12:10:37 adam
19 * Revision 1.7 1997/09/05 09:50:57 adam
20 * Removed global data1_tabpath - uses data1_get_tabpath() instead.
22 * Revision 1.6 1997/09/04 13:51:58 adam
23 * Added data1 to marc conversion with indicators.
25 * Revision 1.5 1997/09/04 13:48:04 adam
26 * Added data1 to marc conversion.
28 * Revision 1.4 1996/03/25 10:18:03 quinn
29 * Removed trailing whitespace from data elements
31 * Revision 1.3 1995/11/01 16:34:57 quinn
32 * Making data1 look for tables in data1_tabpath
34 * Revision 1.2 1995/11/01 13:54:48 quinn
37 * Revision 1.1 1995/11/01 11:56:08 quinn
38 * Added Retrieval (data management) functions en masse.
57 data1_marctab *data1_read_marctab (data1_handle dh, const char *file)
60 NMEM mem = data1_nmem_get (dh);
61 data1_marctab *res = (data1_marctab *)nmem_malloc(mem, sizeof(*res));
62 char line[512], *argv[50];
65 if (!(f = yaz_path_fopen(data1_get_tabpath(dh), file, "r")))
67 logf(LOG_WARN|LOG_ERRNO, "%s", file);
72 res->reference = VAL_NONE;
74 res->length_data_entry = 4;
75 res->length_starting = 5;
76 res->length_implementation = 0;
77 strcpy(res->future_use, "4");
79 strcpy(res->record_status, "n");
80 strcpy(res->implementation_codes, " ");
81 res->indicator_length = 2;
82 res->identifier_length = 2;
83 res->force_indicator_length = -1;
84 res->force_identifier_length = -1;
85 strcpy(res->user_systems, "z ");
87 while ((argc = readconf_line(f, line, 512, argv, 50)))
88 if (!strcmp(argv[0], "name"))
92 logf(LOG_WARN, "%s: Bad name directive");
95 res->name = nmem_strdup(mem, argv[1]);
97 else if (!strcmp(argv[0], "reference"))
101 logf(LOG_WARN, "%s: Bad name directive");
104 if ((res->reference = oid_getvalbyname(argv[1])) == VAL_NONE)
106 logf(LOG_WARN, "%s: Unknown tagset ref '%s' in %s", file,
111 else if (!strcmp(argv[0], "length-data-entry"))
115 logf(LOG_WARN, "%s: Bad data-length-entry");
118 res->length_data_entry = atoi(argv[1]);
120 else if (!strcmp(argv[0], "length-starting"))
124 logf(LOG_WARN, "%s: Bad length-starting");
127 res->length_starting = atoi(argv[1]);
129 else if (!strcmp(argv[0], "length-implementation"))
133 logf(LOG_WARN, "%s: Bad length-implentation");
136 res->length_implementation = atoi(argv[1]);
138 else if (!strcmp(argv[0], "future-use"))
142 logf(LOG_WARN, "%s: Bad future-use");
145 strncpy(res->future_use, argv[1], 2);
147 else if (!strcmp(argv[0], "force-indicator-length"))
151 logf(LOG_WARN, "%s: Bad future-use");
154 res->force_indicator_length = atoi(argv[1]);
156 else if (!strcmp(argv[0], "force-identifier-length"))
160 logf(LOG_WARN, "%s: Bad future-use");
163 res->force_identifier_length = atoi(argv[1]);
166 logf(LOG_WARN, "%s: Bad directive '%s'", file, argv[0]);
173 * Locate some data under this node. This routine should handle variants
176 static char *get_data(data1_node *n, int *len)
180 while (n->which != DATA1N_data && n->child)
182 if (n->which != DATA1N_data || n->u.data.what != DATA1I_text)
184 r = "[Structured/included data]";
189 *len = n->u.data.len;
190 while (*len && isspace(n->u.data.data[*len - 1]))
192 return n->u.data.data;
195 static void memint (char *p, int val, int len)
203 sprintf (buf, "%08d", val);
204 memcpy (p, buf+8-len, len);
208 static int is_indicator (data1_marctab *p, data1_node *subf)
211 if (p->indicator_length != 2 ||
212 (subf->which == DATA1N_tag && strlen(subf->u.tag.tag) == 2))
215 if (subf->which == DATA1N_tag && subf->child->which == DATA1N_tag)
221 static int nodetomarc(data1_marctab *p, data1_node *n, int selected,
222 char **buf, int *size)
226 int base_address = 25;
229 data1_node *field, *subf;
231 logf (LOG_DEBUG, "nodetomarc");
232 for (field = n->child; field; field = field->next)
234 if (field->which != DATA1N_tag)
236 logf(LOG_WARN, "Malformed field composition for marc output.");
239 if (selected && !field->u.tag.node_selected)
241 len += 4 + p->length_data_entry + p->length_starting
242 + p->length_implementation;
243 base_address += 3 + p->length_data_entry + p->length_starting
244 + p->length_implementation;
245 if (strncmp(field->u.tag.tag, "00", 2))
246 len += p->indicator_length; /* this is fairly bogus */
249 /* we'll allow no indicator if length is not 2 */
250 if (is_indicator (p, subf))
253 for (; subf; subf = subf->next)
255 if (subf->which != DATA1N_tag)
258 "Malformed subfield composition for marc output.");
261 if (strncmp(field->u.tag.tag, "00", 2))
262 len += p->identifier_length;
263 get_data(subf, &dlen);
269 *buf = (char *)xmalloc(*size = len);
270 else if (*size <= len)
271 *buf = (char *)xrealloc(*buf, *size = len);
275 memcpy (op+5, p->record_status, 1);
276 memcpy (op+6, p->implementation_codes, 4);
277 memint (op+10, p->indicator_length, 1);
278 memint (op+11, p->identifier_length, 1);
279 memint (op+12, base_address, 5);
280 memcpy (op+17, p->user_systems, 3);
281 memint (op+20, p->length_data_entry, 1);
282 memint (op+21, p->length_starting, 1);
283 memint (op+22, p->length_implementation, 1);
284 memcpy (op+23, p->future_use, 1);
287 data_p = base_address;
289 for (field = n->child; field; field = field->next)
292 char *indicator_data = " ";
293 if (selected && !field->u.tag.node_selected)
298 if (is_indicator (p, subf))
300 indicator_data = subf->u.tag.tag;
303 if (strncmp(field->u.tag.tag, "00", 2)) /* bogus */
305 memcpy (op + data_p, indicator_data, p->indicator_length);
306 data_p += p->indicator_length;
308 for (; subf; subf = subf->next)
312 if (strncmp(field->u.tag.tag, "00", 2))
314 op[data_p] = ISO2709_IDFS;
315 memcpy (op + data_p+1, subf->u.tag.tag, p->identifier_length-1);
316 data_p += p->identifier_length;
318 data = get_data(subf, &dlen);
319 memcpy (op + data_p, data, dlen);
322 op[data_p++] = ISO2709_FS;
324 memcpy (op + entry_p, field->u.tag.tag, 3);
326 memint (op + entry_p, data_p - data_0, p->length_data_entry);
327 entry_p += p->length_data_entry;
328 memint (op + entry_p, data_0 - base_address, p->length_starting);
329 entry_p += p->length_starting;
330 entry_p += p->length_implementation;
332 op[entry_p++] = ISO2709_FS;
333 assert (entry_p == base_address);
334 op[data_p++] = ISO2709_RS;
335 assert (data_p == len);
339 char *data1_nodetomarc(data1_handle dh, data1_marctab *p, data1_node *n,
340 int selected, int *len)
343 char **buf = data1_get_map_buf (dh, &size);
345 *len = nodetomarc(p, n, selected, buf, size);