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.8 1998-02-11 11:53:36 adam
11 * Changed code so that it compiles as C++.
13 * Revision 1.7 1998/02/10 11:03:57 adam
14 * Added support for extended handlers in backend server interface.
16 * Revision 1.6 1998/01/29 13:16:02 adam
17 * Added dummy sort in test server.
19 * Revision 1.5 1997/11/07 13:31:58 adam
20 * Added NT Service name part of statserv_options_block. Moved NT
21 * service utility to server library.
23 * Revision 1.4 1997/09/17 12:10:43 adam
26 * Revision 1.3 1997/09/09 10:10:20 adam
27 * Another MSV5.0 port. Changed projects to include proper
28 * library/include paths.
29 * Server starts server in test-mode when no options are given.
31 * Revision 1.2 1997/09/04 13:50:31 adam
37 * Demonstration of simple server
50 Z_GenericRecord *read_grs1(FILE *f, ODR o);
52 int ztest_search (void *handle, bend_search_rr *rr);
53 int ztest_sort (void *handle, bend_sort_rr *rr);
54 int ztest_present (void *handle, bend_present_rr *rr);
56 bend_initresult *bend_init(bend_initrequest *q)
58 bend_initresult *r = (bend_initresult *) odr_malloc (q->stream, sizeof(*r));
59 static char *dummy = "Hej fister";
64 q->bend_sort = ztest_sort; /* register sort handler */
65 q->bend_search = ztest_search; /* register search handler */
66 q->bend_present = ztest_present; /* register present handle */
70 int ztest_search (void *handle, bend_search_rr *rr)
72 rr->hits = rand() % 22;
76 int ztest_present (void *handle, bend_present_rr *rr)
81 /* Obsolete bend_search, never called because handler is registered */
82 bend_searchresult *bend_search(void *handle, bend_searchrequest *q, int *fd)
87 /* Our sort handler really doesn't sort... */
88 int ztest_sort (void *handle, bend_sort_rr *rr)
91 rr->sort_status = Z_SortStatus_success;
95 static int atoin (const char *buf, int n)
101 val = val*10 + (*buf - '0');
107 char *marc_read(FILE *inf)
113 if (fread (length_str, 1, 5, inf) != 5)
115 size = atoin (length_str, 5);
118 if (!(buf = (char*) xmalloc (size+1)))
120 if (fread (buf+5, 1, size-5, inf) != (size-5))
125 memcpy (buf, length_str, 5);
130 static char *dummy_database_record (int num)
132 FILE *inf = fopen ("dummy-records", "r");
143 assert(buf = (char*) xmalloc(2101));
144 memset(buf, 'A', 2100);
149 buf = marc_read (inf);
159 static Z_GenericRecord *dummy_grs_record (int num, ODR o)
161 FILE *f = fopen("dummy-grs", "r");
163 Z_GenericRecord *r = 0;
168 while (fgets(line, 512, f))
169 if (*line == '#' && sscanf(line, "#%d", &n) == 1 && n == num)
178 bend_fetchresult *bend_fetch(void *handle, bend_fetchrequest *q, int *num)
180 bend_fetchresult *r = (bend_fetchresult *)
181 odr_malloc (q->stream, sizeof(*r));
182 static char *bbb = 0;
186 r->basename = "DUMMY";
192 r->format = q->format;
193 if (q->format == VAL_SUTRS)
197 sprintf(buf, "This is dummy SUTRS record number %d\n", q->number);
198 assert(r->record = bbb = (char*) xmalloc(strlen(buf)+1));
200 r->len = strlen(buf);
202 else if (q->format == VAL_GRS1)
205 r->record = (char*) dummy_grs_record(q->number, q->stream);
212 else if (!(r->record = bbb = dummy_database_record(q->number)))
215 r->format = VAL_USMARC;
219 r->len = strlen(r->record);
224 bend_deleteresult *bend_delete(void *handle, bend_deleterequest *q, int *num)
230 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *num)
232 static struct scan_entry list[200];
233 static char buf[200][200];
234 static bend_scanresult r;
237 r.term_position = q->term_position;
238 r.num_entries = q->num_entries;
240 for (i = 0; i < r.num_entries; i++)
242 list[i].term = buf[i];
243 sprintf(list[i].term, "term-%d", i+1);
244 list[i].occurrences = rand() % 100000;
252 * silly dummy-scan what reads words from a file.
254 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *num)
256 bend_scanresult *r = (bend_scanresult *) odr_malloc (q->stream, sizeof(*r));
258 static struct scan_entry list[200];
259 static char entries[200][80];
267 r->status = BEND_SCAN_SUCCESS;
268 if (!f && !(f = fopen("dummy-words", "r")))
270 perror("dummy-words");
273 if (q->term->term->which != Z_Term_general)
275 r->errcode = 229; /* unsupported term type */
278 if (q->term->term->u.general->len >= 80)
280 r->errcode = 11; /* term too long */
283 if (q->num_entries > 200)
288 memcpy(term, q->term->term->u.general->buf, q->term->term->u.general->len);
289 term[q->term->term->u.general->len] = '\0';
290 for (p = term; *p; p++)
294 fseek(f, 0, SEEK_SET);
296 for (i = 0, pos = 0; fscanf(f, " %79[^:]:%d", entries[pos], &hits[pos]) == 2;
297 i++, pos < 199 ? pos++ : (pos = 0))
299 if (!r->num_entries && strcmp(entries[pos], term) >= 0) /* s-point fnd */
301 if ((r->term_position = q->term_position) > i + 1)
303 r->term_position = i + 1;
304 r->status = BEND_SCAN_PARTIAL;
306 for (; r->num_entries < r->term_position; r->num_entries++)
310 po = pos - r->term_position + r->num_entries + 1; /* find pos */
313 list[r->num_entries].term = entries[po];
314 list[r->num_entries].occurrences = hits[po];
317 else if (r->num_entries)
319 list[r->num_entries].term = entries[pos];
320 list[r->num_entries].occurrences = hits[pos];
323 if (r->num_entries >= q->num_entries)
327 r->status = BEND_SCAN_PARTIAL;
333 void bend_close(void *handle)
338 int main(int argc, char **argv)
340 return statserv_main(argc, argv);