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.10 1998-05-27 16:55:54 adam
13 * Revision 1.9 1998/03/31 11:07:45 adam
14 * Furhter work on UNIverse resource report.
15 * Added Extended Services handling in frontend server.
17 * Revision 1.8 1998/02/11 11:53:36 adam
18 * Changed code so that it compiles as C++.
20 * Revision 1.7 1998/02/10 11:03:57 adam
21 * Added support for extended handlers in backend server interface.
23 * Revision 1.6 1998/01/29 13:16:02 adam
24 * Added dummy sort in test server.
26 * Revision 1.5 1997/11/07 13:31:58 adam
27 * Added NT Service name part of statserv_options_block. Moved NT
28 * service utility to server library.
30 * Revision 1.4 1997/09/17 12:10:43 adam
33 * Revision 1.3 1997/09/09 10:10:20 adam
34 * Another MSV5.0 port. Changed projects to include proper
35 * library/include paths.
36 * Server starts server in test-mode when no options are given.
38 * Revision 1.2 1997/09/04 13:50:31 adam
44 * Demonstration of simple server
57 Z_GenericRecord *read_grs1(FILE *f, ODR o);
59 int ztest_search (void *handle, bend_search_rr *rr);
60 int ztest_sort (void *handle, bend_sort_rr *rr);
61 int ztest_present (void *handle, bend_present_rr *rr);
62 int ztest_esrequest (void *handle, bend_esrequest_rr *rr);
64 bend_initresult *bend_init(bend_initrequest *q)
66 bend_initresult *r = (bend_initresult *) odr_malloc (q->stream, sizeof(*r));
67 static char *dummy = "Hej fister";
72 q->bend_sort = ztest_sort; /* register sort handler */
73 q->bend_search = ztest_search; /* register search handler */
74 q->bend_present = ztest_present; /* register present handle */
75 q->bend_esrequest = ztest_esrequest;
79 int ztest_search (void *handle, bend_search_rr *rr)
81 rr->hits = rand() % 22;
85 int ztest_present (void *handle, bend_present_rr *rr)
90 int ztest_esrequest (void *handle, bend_esrequest_rr *rr)
96 /* Obsolete bend_search, never called because handler is registered */
97 bend_searchresult *bend_search(void *handle, bend_searchrequest *q, int *fd)
102 /* Our sort handler really doesn't sort... */
103 int ztest_sort (void *handle, bend_sort_rr *rr)
106 rr->sort_status = Z_SortStatus_success;
110 static int atoin (const char *buf, int n)
116 val = val*10 + (*buf - '0');
122 char *marc_read(FILE *inf)
128 if (fread (length_str, 1, 5, inf) != 5)
130 size = atoin (length_str, 5);
133 if (!(buf = (char*) xmalloc (size+1)))
135 if (fread (buf+5, 1, size-5, inf) != (size-5))
140 memcpy (buf, length_str, 5);
145 static char *dummy_database_record (int num)
147 FILE *inf = fopen ("dummy-records", "r");
158 assert(buf = (char*) xmalloc(2101));
159 memset(buf, 'A', 2100);
164 buf = marc_read (inf);
174 static Z_GenericRecord *dummy_grs_record (int num, ODR o)
176 FILE *f = fopen("dummy-grs", "r");
178 Z_GenericRecord *r = 0;
183 while (fgets(line, 512, f))
184 if (*line == '#' && sscanf(line, "#%d", &n) == 1 && n == num)
193 bend_fetchresult *bend_fetch(void *handle, bend_fetchrequest *q, int *num)
195 bend_fetchresult *r = (bend_fetchresult *)
196 odr_malloc (q->stream, sizeof(*r));
200 r->basename = "DUMMY";
201 r->format = q->format;
202 if (q->format == VAL_SUTRS)
206 sprintf(buf, "This is dummy SUTRS record number %d\n", q->number);
207 r->len = strlen(buf);
208 r->record = odr_malloc (q->stream, r->len+1);
209 strcpy(r->record, buf);
211 else if (q->format == VAL_GRS1)
214 r->record = (char*) dummy_grs_record(q->number, q->stream);
221 else if ((cp = dummy_database_record(q->number)))
224 r->record = (char *) odr_malloc (q->stream, 1+r->len);
225 strcpy (r->record, cp);
226 r->format = VAL_USMARC;
237 bend_deleteresult *bend_delete(void *handle, bend_deleterequest *q, int *num)
243 * silly dummy-scan what reads words from a file.
245 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *num)
247 bend_scanresult *r = (bend_scanresult *) odr_malloc (q->stream, sizeof(*r));
249 static struct scan_entry list[200];
250 static char entries[200][80];
258 r->status = BEND_SCAN_SUCCESS;
259 if (!f && !(f = fopen("dummy-words", "r")))
261 perror("dummy-words");
264 if (q->term->term->which != Z_Term_general)
266 r->errcode = 229; /* unsupported term type */
269 if (q->term->term->u.general->len >= 80)
271 r->errcode = 11; /* term too long */
274 if (q->num_entries > 200)
279 memcpy(term, q->term->term->u.general->buf, q->term->term->u.general->len);
280 term[q->term->term->u.general->len] = '\0';
281 for (p = term; *p; p++)
285 fseek(f, 0, SEEK_SET);
287 for (i = 0, pos = 0; fscanf(f, " %79[^:]:%d", entries[pos], &hits[pos]) == 2;
288 i++, pos < 199 ? pos++ : (pos = 0))
290 if (!r->num_entries && strcmp(entries[pos], term) >= 0) /* s-point fnd */
292 if ((r->term_position = q->term_position) > i + 1)
294 r->term_position = i + 1;
295 r->status = BEND_SCAN_PARTIAL;
297 for (; r->num_entries < r->term_position; r->num_entries++)
301 po = pos - r->term_position + r->num_entries + 1; /* find pos */
304 list[r->num_entries].term = entries[po];
305 list[r->num_entries].occurrences = hits[po];
308 else if (r->num_entries)
310 list[r->num_entries].term = entries[pos];
311 list[r->num_entries].occurrences = hits[pos];
314 if (r->num_entries >= q->num_entries)
318 r->status = BEND_SCAN_PARTIAL;
322 void bend_close(void *handle)
327 int main(int argc, char **argv)
329 return statserv_main(argc, argv);