2 * Copyright (c) 1995, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.5 1997-09-04 13:48:04 adam
8 * Added data1 to marc conversion.
10 * Revision 1.4 1996/03/25 10:18:03 quinn
11 * Removed trailing whitespace from data elements
13 * Revision 1.3 1995/11/01 16:34:57 quinn
14 * Making data1 look for tables in data1_tabpath
16 * Revision 1.2 1995/11/01 13:54:48 quinn
19 * Revision 1.1 1995/11/01 11:56:08 quinn
20 * Added Retrieval (data management) functions en masse.
39 data1_marctab *data1_read_marctab(char *file)
42 data1_marctab *res = xmalloc(sizeof(*res));
43 char line[512], *argv[50];
46 if (!(f = yaz_path_fopen(data1_tabpath, file, "r")))
48 logf(LOG_WARN|LOG_ERRNO, "%s", file);
53 res->reference = VAL_NONE;
55 res->length_data_entry = 4;
56 res->length_starting = 5;
57 res->length_implementation = 0;
58 strcpy(res->future_use, "4");
60 strcpy(res->record_status, "n");
61 strcpy(res->implementation_codes, " ");
62 res->indicator_length = 2;
63 res->identifier_length = 2;
64 strcpy(res->user_systems, "z ");
66 while ((argc = readconf_line(f, line, 512, argv, 50)))
67 if (!strcmp(argv[0], "name"))
71 logf(LOG_WARN, "%s: Bad name directive");
74 res->name = xmalloc(strlen(argv[1])+1);
75 strcpy(res->name, argv[1]);
77 else if (!strcmp(argv[0], "reference"))
81 logf(LOG_WARN, "%s: Bad name directive");
84 if ((res->reference = oid_getvalbyname(argv[1])) == VAL_NONE)
86 logf(LOG_WARN, "%s: Unknown tagset ref '%s' in %s", file,
91 else if (!strcmp(argv[0], "length-data-entry"))
95 logf(LOG_WARN, "%s: Bad data-length-entry");
98 res->length_data_entry = atoi(argv[1]);
100 else if (!strcmp(argv[0], "length-starting"))
104 logf(LOG_WARN, "%s: Bad length-starting");
107 res->length_starting = atoi(argv[1]);
109 else if (!strcmp(argv[0], "length-implementation"))
113 logf(LOG_WARN, "%s: Bad length-implentation");
116 res->length_implementation = atoi(argv[1]);
118 else if (!strcmp(argv[0], "future-use"))
122 logf(LOG_WARN, "%s: Bad future-use");
125 strncpy(res->future_use, argv[1], 2);
128 logf(LOG_WARN, "%s: Bad directive '%s'", file, argv[0]);
135 * Locate some data under this node. This routine should handle variants
138 static char *get_data(data1_node *n, int *len)
142 while (n->which != DATA1N_data && n->child)
144 if (n->which != DATA1N_data || n->u.data.what != DATA1I_text)
146 r = "[Structured/included data]";
151 *len = n->u.data.len;
152 while (*len && isspace(n->u.data.data[*len - 1]))
154 return n->u.data.data;
157 static void memint (char *p, int val, int len)
165 sprintf (buf, "%08d", val);
166 memcpy (p, buf+8-len, len);
170 static int is_indicator (data1_marctab *p, data1_node *subf)
173 if (p->indicator_length != 2 ||
174 (subf->which == DATA1N_tag && strlen(subf->u.tag.tag) == 2))
177 if (subf->which == DATA1N_tag && subf->child->which == DATA1N_tag)
183 static int nodetomarc(data1_marctab *p, data1_node *n, int selected,
184 char **buf, int *size)
188 int base_address = 25;
191 data1_node *field, *subf;
193 for (field = n->child; field; field = field->next)
195 if (field->which != DATA1N_tag)
197 logf(LOG_WARN, "Malformed field composition for marc output.");
200 if (selected && !field->u.tag.node_selected)
202 len += 4 + p->length_data_entry + p->length_starting
203 + p->length_implementation;
204 base_address += 3 + p->length_data_entry + p->length_starting
205 + p->length_implementation;
206 if (strncmp(field->u.tag.tag, "00", 2))
207 len += p->indicator_length; /* this is fairly bogus */
210 /* we'll allow no indicator if length is not 2 */
211 if (is_indicator (p, subf))
214 for (; subf; subf = subf->next)
216 if (subf->which != DATA1N_tag)
219 "Malformed subfield composition for marc output.");
222 if (strncmp(field->u.tag.tag, "00", 2))
223 len += p->identifier_length;
224 get_data(subf, &dlen);
230 *buf = xmalloc(*size = len);
231 else if (*size <= len)
232 *buf = xrealloc(*buf, *size = len);
236 memcpy (op+5, p->record_status, 1);
237 memcpy (op+6, p->implementation_codes, 4);
238 memint (op+10, p->indicator_length, 1);
239 memint (op+11, p->identifier_length, 1);
240 memint (op+12, base_address, 5);
241 memcpy (op+17, p->user_systems, 3);
242 memint (op+20, p->length_data_entry, 1);
243 memint (op+21, p->length_starting, 1);
244 memint (op+22, p->length_implementation, 1);
245 memcpy (op+23, p->future_use, 1);
248 data_p = base_address;
250 for (field = n->child; field; field = field->next)
253 char *indicator_data = " ";
254 if (selected && !field->u.tag.node_selected)
259 if (is_indicator (p, subf))
261 indicator_data = subf->u.tag.tag;
264 if (strncmp(field->u.tag.tag, "00", 2)) /* bogus */
266 memcpy (op + data_p, indicator_data, p->indicator_length);
267 data_p += p->indicator_length;
269 for (; subf; subf = subf->next)
273 if (strncmp(field->u.tag.tag, "00", 2))
275 op[data_p] = ISO2709_IDFS;
276 memcpy (op + data_p+1, subf->u.tag.tag, p->identifier_length-1);
277 data_p += p->identifier_length;
279 data = get_data(subf, &dlen);
280 memcpy (op + data_p, data, dlen);
283 op[data_p++] = ISO2709_FS;
285 memcpy (op + entry_p, field->u.tag.tag, 3);
287 memint (op + entry_p, data_p - data_0, p->length_data_entry);
288 entry_p += p->length_data_entry;
289 memint (op + entry_p, data_0 - base_address, p->length_starting);
290 entry_p += p->length_starting;
291 entry_p += p->length_implementation;
293 op[entry_p++] = ISO2709_FS;
294 assert (entry_p == base_address);
295 op[data_p++] = ISO2709_RS;
296 assert (data_p == len);
300 char *data1_nodetomarc(data1_marctab *p, data1_node *n, int selected, int *len)
302 static char *buf = 0;
305 *len = nodetomarc(p, n, selected, &buf, &size);