2 * Copyright (C) 1997, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.3 1997-09-24 13:36:51 adam
8 * *** empty log message ***
10 * Revision 1.2 1997/09/17 12:19:21 adam
11 * Zebra version corresponds to YAZ version 1.4.
12 * Changed Zebra server so that it doesn't depend on global common_resource.
14 * Revision 1.1 1997/09/04 13:54:40 adam
15 * Added MARC filter - type grs.marc.<syntax> where syntax refers
16 * to abstract syntax. New method tellf in retrieve/extract method.
28 data1_node *data1_mk_node_wp (data1_handle dh, NMEM mem, data1_node *parent)
30 data1_node *res = data1_mk_node (dh, mem);
36 res->root = parent->root;
39 parent->child = parent->last_child = res;
41 parent->last_child->next = res;
42 parent->num_children++;
43 parent->last_child = res;
48 static void destroy_data (struct data1_node *n)
50 assert (n->which == DATA1N_data);
51 xfree (n->u.data.data);
54 data1_node *data1_mk_node_text (data1_handle dh, NMEM mem, data1_node *parent,
55 const char *buf, size_t len)
57 data1_node *res = data1_mk_node_wp (dh, mem, parent);
58 res->which = DATA1N_data;
59 res->u.data.formatted_text = 0;
60 res->u.data.what = DATA1I_text;
61 res->u.data.len = len;
62 if (res->u.data.len > DATA1_LOCALDATA) {
63 res->u.data.data = xmalloc (res->u.data.len);
64 res->destroy = destroy_data;
67 res->u.data.data = res->lbuf;
68 memcpy (res->u.data.data, buf, res->u.data.len);
72 data1_node *data1_mk_node_tag (data1_handle dh, NMEM mem, data1_node *parent,
73 const char *tag, size_t len)
75 data1_element *elem = NULL;
76 data1_node *partag = get_parent_tag(dh, parent);
78 data1_element *e = NULL;
81 res = data1_mk_node_wp (dh, mem, parent);
83 res->which = DATA1N_tag;
84 res->u.tag.tag = res->lbuf;
85 res->u.tag.get_bytes = -1;
87 if (len >= DATA1_LOCALDATA)
88 len = DATA1_LOCALDATA-1;
90 memcpy (res->u.tag.tag, tag, len);
91 res->u.tag.tag[len] = '\0';
93 if (parent->which == DATA1N_variant)
96 if (!(e = partag->u.tag.element))
99 elem = data1_getelementbytagname (dh, res->root->u.root.absyn, e,
101 res->u.tag.element = elem;
102 res->u.tag.node_selected = 0;
103 res->u.tag.make_variantlist = 0;
104 res->u.tag.no_data_requested = 0;
110 data1_node *grs_read_marc (struct grs_read_info *p)
115 int indicator_length;
116 int identifier_length;
118 int length_data_entry;
120 int length_implementation;
126 data1_node *res_root;
129 data1_marctab *marctab;
131 if ((*p->readf)(p->fh, buf, 5) != 5)
133 record_length = atoi_n (buf, 5);
134 if (record_length < 25)
136 logf (LOG_WARN, "MARC record length < 25, is %d", record_length);
139 /* read remaining part - attempt to read one byte furhter... */
140 read_bytes = (*p->readf)(p->fh, buf+5, record_length-4);
141 if (read_bytes < record_length-5)
143 logf (LOG_WARN, "Couldn't read whole MARC record");
146 if (read_bytes == record_length - 4)
148 off_t cur_offset = (*p->tellf)(p->fh);
149 assert (cur_offset > 26);
151 (*p->endf)(p->fh, cur_offset - 1);
154 logf (LOG_DEBUG, "absynName = %s", absynName);
155 if (!(absyn = data1_get_absyn (p->dh, absynName)))
157 logf (LOG_WARN, "Unknown abstract syntax: %s", absynName);
160 res_root = data1_mk_node_wp (p->dh, p->mem, NULL);
161 res_root->u.root.type = nmem_malloc (p->mem, strlen(absynName)+1);
162 strcpy (res_root->u.root.type, absynName);
163 res_root->u.root.absyn = absyn;
165 marctab = absyn->marc;
167 if (marctab && marctab->force_indicator_length >= 0)
168 indicator_length = marctab->force_indicator_length;
170 indicator_length = atoi_n (buf+10, 1);
171 if (marctab && marctab->force_identifier_length >= 0)
172 identifier_length = marctab->force_identifier_length;
174 identifier_length = atoi_n (buf+11, 1);
175 base_address = atoi_n (buf+12, 4);
178 length_data_entry = atoi_n (buf+20, 1);
179 length_starting = atoi_n (buf+21, 1);
180 length_implementation = atoi_n (buf+22, 1);
182 for (entry_p = 24; buf[entry_p] != ISO2709_FS; )
183 entry_p += 3+length_data_entry+length_starting;
184 base_address = entry_p+1;
185 for (entry_p = 24; buf[entry_p] != ISO2709_FS; )
193 data1_node *parent = res_root;
195 memcpy (tag, buf+entry_p, 3);
199 /* generate field node */
200 res = data1_mk_node_tag (p->dh, p->mem, res_root, tag, 3);
203 fprintf (outf, "%s ", tag);
205 data_length = atoi_n (buf+entry_p, length_data_entry);
206 entry_p += length_data_entry;
207 data_offset = atoi_n (buf+entry_p, length_starting);
208 entry_p += length_starting;
209 i = data_offset + base_address;
210 end_offset = i+data_length-1;
212 if (memcmp (tag, "00", 2) && indicator_length)
214 /* generate indicator node */
218 res = data1_mk_node_tag (p->dh, p->mem, res, buf+i,
221 for (j = 0; j<indicator_length; j++)
222 fprintf (outf, "%c", buf[j+i]);
224 i += indicator_length;
227 /* traverse sub fields */
229 while (buf[i] != ISO2709_RS && buf[i] != ISO2709_FS && i < end_offset)
231 if (memcmp (tag, "00", 2) && identifier_length)
234 data1_mk_node_tag (p->dh, p->mem, parent,
235 buf+i+1, identifier_length-1);
237 fprintf (outf, " $");
238 for (j = 1; j<identifier_length; j++)
239 fprintf (outf, "%c", buf[j+i]);
242 i += identifier_length;
244 while (buf[i] != ISO2709_RS && buf[i] != ISO2709_IDFS &&
245 buf[i] != ISO2709_FS && i < end_offset)
248 fprintf (outf, "%c", buf[i]);
252 data1_mk_node_text (p->dh, p->mem, res, buf + i0, i - i0);
258 fprintf (outf, "%c", buf[i]);
265 data1_node *res = data1_mk_node_tag (p->dh, p->mem,
267 data1_mk_node_text (p->dh, p->mem, res, buf + i0, i - i0);
270 fprintf (outf, "\n");
272 fprintf (outf, "-- separator but not at end of field\n");
273 if (buf[i] != ISO2709_RS && buf[i] != ISO2709_FS)
274 fprintf (outf, "-- no separator at end of field\n");