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.16 1998-10-15 08:26:23 adam
11 * Added type cast to make C++ happy.
13 * Revision 1.15 1998/10/13 20:05:57 adam
16 * Revision 1.14 1998/10/13 16:12:25 adam
17 * Added support for Surrogate Diagnostics for Scan Term entries.
19 * Revision 1.13 1998/08/19 16:10:09 adam
20 * Changed som member names of DeleteResultSetRequest/Response.
22 * Revision 1.12 1998/07/20 12:38:44 adam
23 * Implemented delete result set service to server API.
25 * Revision 1.11 1998/06/09 13:55:08 adam
28 * Revision 1.10 1998/05/27 16:55:54 adam
31 * Revision 1.9 1998/03/31 11:07:45 adam
32 * Furhter work on UNIverse resource report.
33 * Added Extended Services handling in frontend server.
35 * Revision 1.8 1998/02/11 11:53:36 adam
36 * Changed code so that it compiles as C++.
38 * Revision 1.7 1998/02/10 11:03:57 adam
39 * Added support for extended handlers in backend server interface.
41 * Revision 1.6 1998/01/29 13:16:02 adam
42 * Added dummy sort in test server.
44 * Revision 1.5 1997/11/07 13:31:58 adam
45 * Added NT Service name part of statserv_options_block. Moved NT
46 * service utility to server library.
48 * Revision 1.4 1997/09/17 12:10:43 adam
51 * Revision 1.3 1997/09/09 10:10:20 adam
52 * Another MSV5.0 port. Changed projects to include proper
53 * library/include paths.
54 * Server starts server in test-mode when no options are given.
56 * Revision 1.2 1997/09/04 13:50:31 adam
62 * Demonstration of simple server
75 Z_GenericRecord *read_grs1(FILE *f, ODR o);
77 int ztest_search (void *handle, bend_search_rr *rr);
78 int ztest_sort (void *handle, bend_sort_rr *rr);
79 int ztest_present (void *handle, bend_present_rr *rr);
80 int ztest_esrequest (void *handle, bend_esrequest_rr *rr);
81 int ztest_delete (void *handle, bend_delete_rr *rr);
83 bend_initresult *bend_init(bend_initrequest *q)
85 bend_initresult *r = (bend_initresult *) odr_malloc (q->stream, sizeof(*r));
86 static char *dummy = "Hej fister";
91 q->bend_sort = ztest_sort; /* register sort handler */
92 q->bend_search = ztest_search; /* register search handler */
93 q->bend_present = ztest_present; /* register present handle */
94 q->bend_esrequest = ztest_esrequest;
95 q->bend_delete = ztest_delete;
99 int ztest_search (void *handle, bend_search_rr *rr)
101 rr->hits = rand() % 22;
105 int ztest_present (void *handle, bend_present_rr *rr)
110 int ztest_esrequest (void *handle, bend_esrequest_rr *rr)
116 int ztest_delete (void *handle, bend_delete_rr *rr)
118 if (rr->num_setnames == 1 && !strcmp (rr->setnames[0], "1"))
119 rr->delete_status = Z_DeleteStatus_success;
121 rr->delete_status = Z_DeleteStatus_resultSetDidNotExist;
125 /* Obsolete bend_search, never called because handler is registered */
126 bend_searchresult *bend_search(void *handle, bend_searchrequest *q, int *fd)
131 /* Our sort handler really doesn't sort... */
132 int ztest_sort (void *handle, bend_sort_rr *rr)
135 rr->sort_status = Z_SortStatus_success;
139 static int atoin (const char *buf, int n)
145 val = val*10 + (*buf - '0');
151 char *marc_read(FILE *inf)
157 if (fread (length_str, 1, 5, inf) != 5)
159 size = atoin (length_str, 5);
162 if (!(buf = (char*) xmalloc (size+1)))
164 if (fread (buf+5, 1, size-5, inf) != (size-5))
169 memcpy (buf, length_str, 5);
174 static char *dummy_database_record (int num)
176 FILE *inf = fopen ("dummy-records", "r");
187 buf = (char*) xmalloc(2101);
189 memset(buf, 'A', 2100);
194 buf = marc_read (inf);
204 static Z_GenericRecord *dummy_grs_record (int num, ODR o)
206 FILE *f = fopen("dummy-grs", "r");
208 Z_GenericRecord *r = 0;
213 while (fgets(line, 512, f))
214 if (*line == '#' && sscanf(line, "#%d", &n) == 1 && n == num)
223 bend_fetchresult *bend_fetch(void *handle, bend_fetchrequest *q, int *fd)
225 bend_fetchresult *r = (bend_fetchresult *)
226 odr_malloc (q->stream, sizeof(*r));
230 r->basename = "DUMMY";
231 r->format = q->format;
232 if (q->format == VAL_SUTRS)
236 sprintf(buf, "This is dummy SUTRS record number %d\n", q->number);
237 r->len = strlen(buf);
238 r->record = (char *) odr_malloc (q->stream, r->len+1);
239 strcpy(r->record, buf);
241 else if (q->format == VAL_GRS1)
244 r->record = (char*) dummy_grs_record(q->number, q->stream);
251 else if ((cp = dummy_database_record(q->number)))
254 r->record = (char *) odr_malloc (q->stream, 1+r->len);
255 strcpy (r->record, cp);
256 r->format = VAL_USMARC;
268 * silly dummy-scan what reads words from a file.
270 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *fd)
272 bend_scanresult *r = (bend_scanresult *)
273 odr_malloc (q->stream, sizeof(*r));
275 static struct scan_entry list[200];
276 static char entries[200][80];
284 r->status = BEND_SCAN_SUCCESS;
285 if (!f && !(f = fopen("dummy-words", "r")))
287 perror("dummy-words");
290 if (q->term->term->which != Z_Term_general)
292 r->errcode = 229; /* unsupported term type */
295 if (q->term->term->u.general->len >= 80)
297 r->errcode = 11; /* term too long */
300 if (q->num_entries > 200)
305 memcpy(term, q->term->term->u.general->buf, q->term->term->u.general->len);
306 term[q->term->term->u.general->len] = '\0';
307 for (p = term; *p; p++)
311 fseek(f, 0, SEEK_SET);
313 for (i = 0, pos = 0; fscanf(f, " %79[^:]:%d", entries[pos], &hits[pos]) == 2;
314 i++, pos < 199 ? pos++ : (pos = 0))
316 if (!r->num_entries && strcmp(entries[pos], term) >= 0) /* s-point fnd */
318 if ((r->term_position = q->term_position) > i + 1)
320 r->term_position = i + 1;
321 r->status = BEND_SCAN_PARTIAL;
323 for (; r->num_entries < r->term_position; r->num_entries++)
327 po = pos - r->term_position + r->num_entries + 1; /* find pos */
331 if (!strcmp (term, "SD") && r->num_entries == 2)
333 list[r->num_entries].term = entries[pos];
334 list[r->num_entries].occurrences = -1;
335 list[r->num_entries].errcode = 233;
336 list[r->num_entries].errstring = "SD for Scan Term";
340 list[r->num_entries].term = entries[po];
341 list[r->num_entries].occurrences = hits[po];
345 else if (r->num_entries)
347 list[r->num_entries].term = entries[pos];
348 list[r->num_entries].occurrences = hits[pos];
351 if (r->num_entries >= q->num_entries)
355 r->status = BEND_SCAN_PARTIAL;
359 void bend_close(void *handle)
364 int main(int argc, char **argv)
366 return statserv_main(argc, argv);