2 * Copyright (c) 1995-1998, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
6 * NT Service interface by
7 * Chas Woodfield, Fretwell Downing Datasystems.
10 * Revision 1.7 1998-02-10 11:03:57 adam
11 * Added support for extended handlers in backend server interface.
13 * Revision 1.6 1998/01/29 13:16:02 adam
14 * Added dummy sort in test server.
16 * Revision 1.5 1997/11/07 13:31:58 adam
17 * Added NT Service name part of statserv_options_block. Moved NT
18 * service utility to server library.
20 * Revision 1.4 1997/09/17 12:10:43 adam
23 * Revision 1.3 1997/09/09 10:10:20 adam
24 * Another MSV5.0 port. Changed projects to include proper
25 * library/include paths.
26 * Server starts server in test-mode when no options are given.
28 * Revision 1.2 1997/09/04 13:50:31 adam
34 * Demonstration of simple server
47 Z_GenericRecord *read_grs1(FILE *f, ODR o);
49 int ztest_search (void *handle, bend_search_rr *rr);
50 int ztest_sort (void *handle, bend_sort_rr *rr);
51 int ztest_present (void *handle, bend_present_rr *rr);
53 bend_initresult *bend_init(bend_initrequest *q)
55 bend_initresult *r = odr_malloc (q->stream, sizeof(*r));
56 static char *dummy = "Hej fister";
61 q->bend_sort = ztest_sort; /* register sort handler */
62 q->bend_search = ztest_search; /* register search handler */
63 q->bend_present = ztest_present; /* register present handle */
67 int ztest_search (void *handle, bend_search_rr *rr)
69 rr->hits = rand() % 22;
73 int ztest_present (void *handle, bend_present_rr *rr)
78 /* Obsolete bend_search, never called because handler is registered */
79 bend_searchresult *bend_search(void *handle, bend_searchrequest *q, int *fd)
84 /* Our sort handler really doesn't sort... */
85 int ztest_sort (void *handle, bend_sort_rr *rr)
88 rr->sort_status = Z_SortStatus_success;
92 static int atoin (const char *buf, int n)
98 val = val*10 + (*buf - '0');
104 char *marc_read(FILE *inf)
110 if (fread (length_str, 1, 5, inf) != 5)
112 size = atoin (length_str, 5);
115 if (!(buf = xmalloc (size+1)))
117 if (fread (buf+5, 1, size-5, inf) != (size-5))
122 memcpy (buf, length_str, 5);
127 static char *dummy_database_record (int num)
129 FILE *inf = fopen ("dummy-records", "r");
140 assert(buf = xmalloc(2101));
141 memset(buf, 'A', 2100);
146 buf = marc_read (inf);
156 static Z_GenericRecord *dummy_grs_record (int num, ODR o)
158 FILE *f = fopen("dummy-grs", "r");
160 Z_GenericRecord *r = 0;
165 while (fgets(line, 512, f))
166 if (*line == '#' && sscanf(line, "#%d", &n) == 1 && n == num)
175 bend_fetchresult *bend_fetch(void *handle, bend_fetchrequest *q, int *num)
177 bend_fetchresult *r = odr_malloc (q->stream, sizeof(*r));
178 static char *bbb = 0;
182 r->basename = "DUMMY";
188 r->format = q->format;
189 if (q->format == VAL_SUTRS)
193 sprintf(buf, "This is dummy SUTRS record number %d\n", q->number);
194 assert(r->record = bbb = xmalloc(strlen(buf)+1));
196 r->len = strlen(buf);
198 else if (q->format == VAL_GRS1)
201 r->record = (char*) dummy_grs_record(q->number, q->stream);
208 else if (!(r->record = bbb = dummy_database_record(q->number)))
211 r->format = VAL_USMARC;
215 r->len = strlen(r->record);
220 bend_deleteresult *bend_delete(void *handle, bend_deleterequest *q, int *num)
226 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *num)
228 static struct scan_entry list[200];
229 static char buf[200][200];
230 static bend_scanresult r;
233 r.term_position = q->term_position;
234 r.num_entries = q->num_entries;
236 for (i = 0; i < r.num_entries; i++)
238 list[i].term = buf[i];
239 sprintf(list[i].term, "term-%d", i+1);
240 list[i].occurrences = rand() % 100000;
248 * silly dummy-scan what reads words from a file.
250 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *num)
252 bend_scanresult *r = odr_malloc (q->stream, sizeof(*r));
254 static struct scan_entry list[200];
255 static char entries[200][80];
263 r->status = BEND_SCAN_SUCCESS;
264 if (!f && !(f = fopen("dummy-words", "r")))
266 perror("dummy-words");
269 if (q->term->term->which != Z_Term_general)
271 r->errcode = 229; /* unsupported term type */
274 if (q->term->term->u.general->len >= 80)
276 r->errcode = 11; /* term too long */
279 if (q->num_entries > 200)
284 memcpy(term, q->term->term->u.general->buf, q->term->term->u.general->len);
285 term[q->term->term->u.general->len] = '\0';
286 for (p = term; *p; p++)
290 fseek(f, 0, SEEK_SET);
292 for (i = 0, pos = 0; fscanf(f, " %79[^:]:%d", entries[pos], &hits[pos]) == 2;
293 i++, pos < 199 ? pos++ : (pos = 0))
295 if (!r->num_entries && strcmp(entries[pos], term) >= 0) /* s-point fnd */
297 if ((r->term_position = q->term_position) > i + 1)
299 r->term_position = i + 1;
300 r->status = BEND_SCAN_PARTIAL;
302 for (; r->num_entries < r->term_position; r->num_entries++)
306 po = pos - r->term_position + r->num_entries + 1; /* find pos */
309 list[r->num_entries].term = entries[po];
310 list[r->num_entries].occurrences = hits[po];
313 else if (r->num_entries)
315 list[r->num_entries].term = entries[pos];
316 list[r->num_entries].occurrences = hits[pos];
319 if (r->num_entries >= q->num_entries)
323 r->status = BEND_SCAN_PARTIAL;
329 void bend_close(void *handle)
334 int main(int argc, char **argv)
336 return statserv_main(argc, argv);