1 /* $Id: marcread.c,v 1.22 2003-11-09 11:49:49 oleg Exp $
2 Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002
5 This file is part of the Zebra server.
7 Zebra is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with Zebra; see the file LICENSE.zebra. If not, write to the
19 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
28 #include <yaz/yaz-util.h>
29 #include <yaz/marcdisp.h>
35 #define MARCOMP_DEBUG 0
37 static data1_node *grs_read_iso2709 (struct grs_read_info *p, int marc_xml)
43 int identifier_length;
45 int length_data_entry;
47 int length_implementation;
52 data1_node *res_root, *res_top;
54 data1_marctab *marctab;
56 if ((*p->readf)(p->fh, buf, 5) != 5)
58 record_length = atoi_n (buf, 5);
59 if (record_length < 25)
61 logf (LOG_WARN, "MARC record length < 25, is %d", record_length);
64 /* read remaining part - attempt to read one byte furhter... */
65 read_bytes = (*p->readf)(p->fh, buf+5, record_length-4);
66 if (read_bytes < record_length-5)
68 logf (LOG_WARN, "Couldn't read whole MARC record");
71 if (read_bytes == record_length - 4)
73 off_t cur_offset = (*p->tellf)(p->fh);
77 (*p->endf)(p->fh, cur_offset - 1);
80 res_root = data1_mk_root (p->dh, p->mem, absynName);
83 yaz_log (LOG_WARN, "cannot read MARC without an abstract syntax");
89 const char *attr[] = { "xmlns", "http://www.loc.gov/MARC21/slim", 0};
91 res_top = data1_mk_tag (p->dh, p->mem, "record", attr, res_root);
93 lead = data1_mk_tag(p->dh, p->mem, "leader", 0, res_top);
94 data1_mk_text_n(p->dh, p->mem, buf, 24, lead);
97 res_top = data1_mk_tag (p->dh, p->mem, absynName, 0, res_root);
99 if ((marctab = res_root->u.root.absyn->marc))
101 memcpy(marctab->leader, buf, 24);
102 memcpy(marctab->implementation_codes, buf+6, 4);
103 marctab->implementation_codes[4] = '\0';
104 memcpy(marctab->user_systems, buf+17, 3);
105 marctab->user_systems[3] = '\0';
108 if (marctab && marctab->force_indicator_length >= 0)
109 indicator_length = marctab->force_indicator_length;
111 indicator_length = atoi_n (buf+10, 1);
112 if (marctab && marctab->force_identifier_length >= 0)
113 identifier_length = marctab->force_identifier_length;
115 identifier_length = atoi_n (buf+11, 1);
116 base_address = atoi_n (buf+12, 4);
118 length_data_entry = atoi_n (buf+20, 1);
119 length_starting = atoi_n (buf+21, 1);
120 length_implementation = atoi_n (buf+22, 1);
122 for (entry_p = 24; buf[entry_p] != ISO2709_FS; )
123 entry_p += 3+length_data_entry+length_starting;
124 base_address = entry_p+1;
125 for (entry_p = 24; buf[entry_p] != ISO2709_FS; )
133 data1_node *parent = res_top;
135 memcpy (tag, buf+entry_p, 3);
142 res = data1_mk_tag_n (p->dh, p->mem, tag, 3, 0 /* attr */, parent);
145 fprintf (outf, "%s ", tag);
147 data_length = atoi_n (buf+entry_p, length_data_entry);
148 entry_p += length_data_entry;
149 data_offset = atoi_n (buf+entry_p, length_starting);
150 entry_p += length_starting;
151 i = data_offset + base_address;
152 end_offset = i+data_length-1;
154 if (memcmp (tag, "00", 2) && indicator_length)
156 /* generate indicator node */
159 const char *attr[10];
166 res = data1_mk_tag(p->dh, p->mem, "datafield", attr, res);
168 for (j = 0; j<indicator_length; j++)
170 char str1[18], str2[2];
171 sprintf (str1, "ind%d", j+1);
178 data1_tag_add_attr (p->dh, p->mem, res, attr);
186 res = data1_mk_tag_n (p->dh, p->mem,
187 buf+i, indicator_length, 0 /* attr */, res);
189 for (j = 0; j<indicator_length; j++)
190 fprintf (outf, "%c", buf[j+i]);
193 i += indicator_length;
199 const char *attr[10];
205 res = data1_mk_tag(p->dh, p->mem, "controlfield", attr, res);
209 /* traverse sub fields */
211 while (buf[i] != ISO2709_RS && buf[i] != ISO2709_FS && i < end_offset)
213 if (memcmp (tag, "00", 2) && identifier_length)
222 for (j = 1; j<identifier_length && j < 9; j++)
223 code[j-1] = buf[i+j];
228 res = data1_mk_tag(p->dh, p->mem, "subfield",
233 res = data1_mk_tag_n (p->dh, p->mem,
234 buf+i+1, identifier_length-1,
235 0 /* attr */, parent);
238 fprintf (outf, " $");
239 for (j = 1; j<identifier_length; j++)
240 fprintf (outf, "%c", buf[j+i]);
243 i += identifier_length;
245 while (buf[i] != ISO2709_RS && buf[i] != ISO2709_IDFS &&
246 buf[i] != ISO2709_FS && i < end_offset)
249 fprintf (outf, "%c", buf[i]);
253 data1_mk_text_n (p->dh, p->mem, buf + i0, i - i0, res);
259 fprintf (outf, "%c", buf[i]);
266 data1_mk_text_n (p->dh, p->mem, buf + i0, i - i0, parent);
269 fprintf (outf, "\n");
271 fprintf (outf, "-- separator but not at end of field\n");
272 if (buf[i] != ISO2709_RS && buf[i] != ISO2709_FS)
273 fprintf (outf, "-- no separator at end of field\n");
279 * Locate some data under this node. This routine should handle variants
282 static char *get_data(data1_node *n, int *len)
288 if (n->which == DATA1N_data)
291 *len = n->u.data.len;
293 for (i = 0; i<*len; i++)
294 if (!d1_isspace(n->u.data.data[i]))
296 while (*len && d1_isspace(n->u.data.data[*len - 1]))
300 return n->u.data.data + i;
302 if (n->which == DATA1N_tag)
304 else if (n->which == DATA1N_data)
313 static data1_node *lookup_subfield(data1_node *node, const char *name)
317 for (p=node; p; p=p->next)
319 if (!yaz_matchstr(p->u.tag.tag, name))
324 static inline_subfield *lookup_inline_subfield(inline_subfield *pisf, const char *name)
328 for (p=pisf; p; p=p->next)
330 if (!yaz_matchstr(p->name, name))
335 static inline_subfield *cat_inline_subfield(mc_subfield *psf, char *buf, inline_subfield *pisf)
339 for (p = psf; p && pisf; p = p->next)
341 if (p->which == MC_SF)
343 inline_subfield *found = lookup_inline_subfield(pisf, p->name);
347 if (strcmp(p->prefix, "_"))
349 strcat(strcat(buf, " "), p->prefix);
351 if (p->interval.start == -1)
353 strcat(buf, found->data);
357 strncat(buf, found->data+p->interval.start,
358 p->interval.end-p->interval.start+1);
360 if (strcmp(p->suffix, "_"))
362 strcat(strcat(buf, p->suffix), " ");
365 logf(LOG_LOG, "cat_inline_subfield(): add subfield $%s", found->name);
370 else if (p->which == MC_SFVARIANT)
372 inline_subfield *next;
375 next = cat_inline_subfield(p->u.child, buf, pisf);
381 else if (p->which == MC_SFGROUP)
386 for (pp = p->u.child, found = 0; pp; pp = pp->next)
388 if (!yaz_matchstr(pisf->name, p->name))
397 pisf = cat_inline_subfield(p->u.child, buf, pisf);
404 static void cat_inline_field(mc_field *pf, char *buf, data1_node *subfield)
406 if (!pf || !subfield)
412 inline_field *pif=NULL;
415 if (yaz_matchstr(subfield->u.tag.tag, "1"))
417 subfield = subfield->next;
422 pif = inline_mk_field();
426 if ((i=inline_parse(pif, psubf->u.tag.tag, get_data(psubf, &len)))<0)
428 logf(LOG_WARN, "inline subfield ($%s): parse error",
430 inline_destroy_field(pif);
434 } while (psubf && yaz_matchstr(psubf->u.tag.tag, "1"));
438 if (pif && !yaz_matchstr(pif->name, pf->name))
440 if (!pf->list && pif->list)
442 strcat(buf, pif->list->data);
452 ind1 = (pif->ind1[0] == ' ') ? '_':pif->ind1[0];
453 ind2 = (pif->ind2[0] == ' ') ? '_':pif->ind2[0];
455 if (((pf->ind1[0] == '.') || (ind1 == pf->ind1[0])) &&
456 ((pf->ind2[0] == '.') || (ind2 == pf->ind2[0])))
458 cat_inline_subfield(pf->list, buf, pif->list);
461 add separator for inline fields
470 logf(LOG_WARN, "In-line field %s missed -- indicators does not match", pif->name);
474 inline_destroy_field(pif);
477 logf(LOG_LOG, "cat_inline_field(): got buffer {%s}", buf);
480 static data1_node *cat_subfield(mc_subfield *psf, char *buf, data1_node *subfield)
484 for (p = psf; p && subfield; p = p->next)
486 if (p->which == MC_SF)
488 data1_node *found = lookup_subfield(subfield, p->name);
494 if (strcmp(p->prefix, "_"))
496 strcat(strcat(buf, " "), p->prefix);
501 cat_inline_field(p->u.in_line, buf, found);
503 else if (p->interval.start == -1)
505 strcat(buf, get_data(found, &len));
509 strncat(buf, get_data(found, &len)+p->interval.start,
510 p->interval.end-p->interval.start+1);
512 if (strcmp(p->suffix, "_"))
514 strcat(strcat(buf, p->suffix), " ");
517 logf(LOG_LOG, "cat_subfield(): add subfield $%s", found->u.tag.tag);
519 subfield = found->next;
522 else if (p->which == MC_SFVARIANT)
526 next = cat_subfield(p->u.child, buf, subfield);
527 if (next == subfield)
532 else if (p->which == MC_SFGROUP)
537 for (pp = p->u.child, found = 0; pp; pp = pp->next)
539 if (!yaz_matchstr(subfield->u.tag.tag, pp->name))
548 subfield = cat_subfield(p->u.child, buf, subfield);
555 static data1_node *cat_field(struct grs_read_info *p, mc_field *pf, char *buf, data1_node *field)
557 data1_node *subfield;
564 if (yaz_matchstr(field->u.tag.tag, pf->name))
567 subfield = field->child;
573 check subfield without indicators
576 if (!pf->list && subfield->which == DATA1N_data)
580 if (pf->interval.start == -1)
582 strcat(buf, get_data(field, &len));
586 strncat(buf, get_data(field, &len)+pf->interval.start,
587 pf->interval.end-pf->interval.start+1);
590 logf(LOG_LOG, "cat_field(): got buffer {%s}", buf);
599 ind1 = (subfield->u.tag.tag[0] == ' ') ? '_':subfield->u.tag.tag[0];
600 ind2 = (subfield->u.tag.tag[1] == ' ') ? '_':subfield->u.tag.tag[1];
603 ((pf->ind1[0] == '.') || (ind1 == pf->ind1[0])) &&
604 ((pf->ind2[0] == '.') || (ind2 == pf->ind2[0]))
608 logf(LOG_WARN, "Field %s missed -- does not match indicators", field->u.tag.tag);
613 subfield = subfield->child;
618 cat_subfield(pf->list, buf, subfield);
621 logf(LOG_LOG, "cat_field(): got buffer {%s}", buf);
626 static int is_empty(char *s)
637 static void parse_data1_tree(struct grs_read_info *p, const char *mc_stmnt, data1_node *root)
639 data1_marctab *marctab = root->u.root.absyn->marc;
640 data1_node *top = root->child;
646 c = mc_mk_context(mc_stmnt+3);
655 mc_destroy_context(c);
659 logf(LOG_LOG, "parse_data1_tree(): statement -{%s}", mc_stmnt);
661 if (!yaz_matchstr(pf->name, "ldr"))
665 logf(LOG_LOG,"parse_data1_tree(): try LEADER from {%d} to {%d} positions",
666 pf->interval.start, pf->interval.end);
668 new = data1_mk_tag_n(p->dh, p->mem, mc_stmnt, strlen(mc_stmnt), 0, top);
669 data1_mk_text_n(p->dh, p->mem, marctab->leader+pf->interval.start,
670 pf->interval.end-pf->interval.start+1, new);
678 if (!yaz_matchstr(field->u.tag.tag, pf->name))
683 logf(LOG_LOG, "parse_data1_tree(): try field {%s}", field->u.tag.tag);
686 field = cat_field(p, pf, buf, field);
688 for (pb = strtok(pb, "\n"); pb; pb = strtok(NULL, "\n"))
692 new = data1_mk_tag_n(p->dh, p->mem, mc_stmnt, strlen(mc_stmnt), 0, top);
693 data1_mk_text_n(p->dh, p->mem, pb, strlen(pb), new);
703 mc_destroy_field(pf);
704 mc_destroy_context(c);
707 data1_node *grs_read_marcxml(struct grs_read_info *p)
709 data1_node *root = grs_read_iso2709(p, 1);
715 for (e=root->u.root.absyn->main_elements; e; e=e->next)
717 data1_tag *tag = e->tag;
719 if (tag && tag->which == DATA1T_string &&
720 !yaz_matchstr(tag->value.string, "mc?"))
721 parse_data1_tree(p, tag->value.string, root);
727 data1_node *grs_read_marc(struct grs_read_info *p)
729 data1_node *root = grs_read_iso2709(p, 0);
735 for (e=root->u.root.absyn->main_elements; e; e=e->next)
737 data1_tag *tag = e->tag;
739 if (tag && tag->which == DATA1T_string &&
740 !yaz_matchstr(tag->value.string, "mc?"))
741 parse_data1_tree(p, tag->value.string, root);
745 static void *grs_init_marc(void)
750 static void grs_destroy_marc(void *clientData)
754 static struct recTypeGrs marc_type = {
761 RecTypeGrs recTypeGrs_marc = &marc_type;
763 static struct recTypeGrs marcxml_type = {
770 RecTypeGrs recTypeGrs_marcxml = &marcxml_type;