2 * Copyright (C) 1997, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.2 1997-09-17 12:19:21 adam
8 * Zebra version corresponds to YAZ version 1.4.
9 * Changed Zebra server so that it doesn't depend on global common_resource.
11 * Revision 1.1 1997/09/04 13:54:40 adam
12 * Added MARC filter - type grs.marc.<syntax> where syntax refers
13 * to abstract syntax. New method tellf in retrieve/extract method.
25 data1_node *data1_mk_node_wp (data1_handle dh, NMEM mem, data1_node *parent)
27 data1_node *res = data1_mk_node (dh, mem);
33 res->root = parent->root;
36 parent->child = parent->last_child = res;
38 parent->last_child->next = res;
39 parent->num_children++;
40 parent->last_child = res;
45 static void destroy_data (struct data1_node *n)
47 assert (n->which == DATA1N_data);
48 xfree (n->u.data.data);
51 data1_node *data1_mk_node_text (data1_handle dh, NMEM mem, data1_node *parent,
52 const char *buf, size_t len)
54 data1_node *res = data1_mk_node_wp (dh, mem, parent);
55 res->which = DATA1N_data;
56 res->u.data.formatted_text = 0;
57 res->u.data.what = DATA1I_text;
58 res->u.data.len = len;
59 if (res->u.data.len > DATA1_LOCALDATA) {
60 res->u.data.data = xmalloc (res->u.data.len);
61 res->destroy = destroy_data;
64 res->u.data.data = res->lbuf;
65 memcpy (res->u.data.data, buf, res->u.data.len);
69 data1_node *data1_mk_node_tag (data1_handle dh, NMEM mem, data1_node *parent,
70 const char *tag, size_t len)
72 data1_element *elem = NULL;
73 data1_node *partag = get_parent_tag(dh, parent);
75 data1_element *e = NULL;
78 res = data1_mk_node_wp (dh, mem, parent);
80 res->which = DATA1N_tag;
81 res->u.tag.tag = res->lbuf;
82 res->u.tag.get_bytes = -1;
84 if (len >= DATA1_LOCALDATA)
85 len = DATA1_LOCALDATA-1;
87 memcpy (res->u.tag.tag, tag, len);
88 res->u.tag.tag[len] = '\0';
90 if (parent->which == DATA1N_variant)
93 if (!(e = partag->u.tag.element))
96 elem = data1_getelementbytagname (dh, res->root->u.root.absyn, e,
98 res->u.tag.element = elem;
99 res->u.tag.node_selected = 0;
100 res->u.tag.make_variantlist = 0;
101 res->u.tag.no_data_requested = 0;
107 data1_node *grs_read_marc (struct grs_read_info *p)
112 int indicator_length;
113 int identifier_length;
115 int length_data_entry;
117 int length_implementation;
123 data1_node *res_root;
127 if ((*p->readf)(p->fh, buf, 5) != 5)
129 record_length = atoi_n (buf, 5);
130 if (record_length < 25)
132 logf (LOG_WARN, "MARC record length < 25, is %d", record_length);
135 /* read remaining part - attempt to read one byte furhter... */
136 read_bytes = (*p->readf)(p->fh, buf+5, record_length-4);
137 if (read_bytes < record_length-5)
139 logf (LOG_WARN, "Couldn't read whole MARC record");
142 if (read_bytes == record_length - 4)
144 off_t cur_offset = (*p->tellf)(p->fh);
145 assert (cur_offset > 26);
147 (*p->endf)(p->fh, cur_offset - 1);
150 logf (LOG_DEBUG, "absynName = %s", absynName);
151 if (!(absyn = data1_get_absyn (p->dh, absynName)))
153 logf (LOG_WARN, "Unknown abstract syntax: %s", absynName);
156 res_root = data1_mk_node_wp (p->dh, p->mem, NULL);
157 res_root->u.root.type = nmem_malloc (p->mem, strlen(absynName)+1);
158 strcpy (res_root->u.root.type, absynName);
159 res_root->u.root.absyn = absyn;
161 indicator_length = atoi_n (buf+10, 1);
162 identifier_length = atoi_n (buf+11, 1);
163 base_address = atoi_n (buf+12, 4);
165 length_data_entry = atoi_n (buf+20, 1);
166 length_data_entry = atoi_n (buf+20, 1);
167 length_data_entry = atoi_n (buf+20, 1);
168 length_starting = atoi_n (buf+21, 1);
169 length_implementation = atoi_n (buf+22, 1);
171 for (entry_p = 24; buf[entry_p] != ISO2709_FS; )
172 entry_p += 3+length_data_entry+length_starting;
173 base_address = entry_p+1;
174 for (entry_p = 24; buf[entry_p] != ISO2709_FS; )
182 data1_node *parent = res_root;
184 memcpy (tag, buf+entry_p, 3);
188 /* generate field node */
189 res = data1_mk_node_tag (p->dh, p->mem, res_root, tag, 3);
192 fprintf (outf, "%s ", tag);
194 data_length = atoi_n (buf+entry_p, length_data_entry);
195 entry_p += length_data_entry;
196 data_offset = atoi_n (buf+entry_p, length_starting);
197 entry_p += length_starting;
198 i = data_offset + base_address;
199 end_offset = i+data_length-1;
201 if (memcmp (tag, "00", 2) && indicator_length)
203 /* generate indicator node */
207 res = data1_mk_node_tag (p->dh, p->mem, res, buf+i,
210 for (j = 0; j<indicator_length; j++)
211 fprintf (outf, "%c", buf[j+i]);
213 i += indicator_length;
216 /* traverse sub fields */
218 while (buf[i] != ISO2709_RS && buf[i] != ISO2709_FS && i < end_offset)
220 if (memcmp (tag, "00", 2) && identifier_length)
223 data1_mk_node_tag (p->dh, p->mem, parent,
224 buf+i+1, identifier_length-1);
226 fprintf (outf, " $");
227 for (j = 1; j<identifier_length; j++)
228 fprintf (outf, "%c", buf[j+i]);
231 i += identifier_length;
233 while (buf[i] != ISO2709_RS && buf[i] != ISO2709_IDFS &&
234 buf[i] != ISO2709_FS && i < end_offset)
237 fprintf (outf, "%c", buf[i]);
241 data1_mk_node_text (p->dh, p->mem, res, buf + i0, i - i0);
247 fprintf (outf, "%c", buf[i]);
254 data1_node *res = data1_mk_node_tag (p->dh, p->mem,
256 data1_mk_node_text (p->dh, p->mem, res, buf + i0, i - i0);
259 fprintf (outf, "\n");
261 fprintf (outf, "-- separator but not at end of field\n");
262 if (buf[i] != ISO2709_RS && buf[i] != ISO2709_FS)
263 fprintf (outf, "-- no separator at end of field\n");