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.17 1998-10-18 22:33:35 quinn
11 * Added diagnostic dump of Item Order Eservice.
13 * Revision 1.16 1998/10/15 08:26:23 adam
14 * Added type cast to make C++ happy.
16 * Revision 1.15 1998/10/13 20:05:57 adam
19 * Revision 1.14 1998/10/13 16:12:25 adam
20 * Added support for Surrogate Diagnostics for Scan Term entries.
22 * Revision 1.13 1998/08/19 16:10:09 adam
23 * Changed som member names of DeleteResultSetRequest/Response.
25 * Revision 1.12 1998/07/20 12:38:44 adam
26 * Implemented delete result set service to server API.
28 * Revision 1.11 1998/06/09 13:55:08 adam
31 * Revision 1.10 1998/05/27 16:55:54 adam
34 * Revision 1.9 1998/03/31 11:07:45 adam
35 * Furhter work on UNIverse resource report.
36 * Added Extended Services handling in frontend server.
38 * Revision 1.8 1998/02/11 11:53:36 adam
39 * Changed code so that it compiles as C++.
41 * Revision 1.7 1998/02/10 11:03:57 adam
42 * Added support for extended handlers in backend server interface.
44 * Revision 1.6 1998/01/29 13:16:02 adam
45 * Added dummy sort in test server.
47 * Revision 1.5 1997/11/07 13:31:58 adam
48 * Added NT Service name part of statserv_options_block. Moved NT
49 * service utility to server library.
51 * Revision 1.4 1997/09/17 12:10:43 adam
54 * Revision 1.3 1997/09/09 10:10:20 adam
55 * Another MSV5.0 port. Changed projects to include proper
56 * library/include paths.
57 * Server starts server in test-mode when no options are given.
59 * Revision 1.2 1997/09/04 13:50:31 adam
65 * Demonstration of simple server
78 Z_GenericRecord *read_grs1(FILE *f, ODR o);
80 int ztest_search (void *handle, bend_search_rr *rr);
81 int ztest_sort (void *handle, bend_sort_rr *rr);
82 int ztest_present (void *handle, bend_present_rr *rr);
83 int ztest_esrequest (void *handle, bend_esrequest_rr *rr);
84 int ztest_delete (void *handle, bend_delete_rr *rr);
86 bend_initresult *bend_init(bend_initrequest *q)
88 bend_initresult *r = (bend_initresult *) odr_malloc (q->stream, sizeof(*r));
89 static char *dummy = "Hej fister";
94 q->bend_sort = ztest_sort; /* register sort handler */
95 q->bend_search = ztest_search; /* register search handler */
96 q->bend_present = ztest_present; /* register present handle */
97 q->bend_esrequest = ztest_esrequest;
98 q->bend_delete = ztest_delete;
102 int ztest_search (void *handle, bend_search_rr *rr)
104 rr->hits = rand() % 22;
108 int ztest_present (void *handle, bend_present_rr *rr)
113 int ztest_esrequest (void *handle, bend_esrequest_rr *rr)
115 logf(LOG_LOG, "function: %d", *rr->esr->function);
116 if (rr->esr->packageName)
117 logf(LOG_LOG, "packagename: %s", rr->esr->packageName);
118 logf(LOG_LOG, "Waitaction: %d", *rr->esr->waitAction);
120 if (rr->esr->taskSpecificParameters &&
121 rr->esr->taskSpecificParameters->which == Z_External_itemOrder)
123 Z_ItemOrder *it = rr->esr->taskSpecificParameters->u.itemOrder;
124 if (it->which != Z_ItemOrder_esRequest)
125 logf(LOG_WARN, "Expected EsRequest");
128 Z_IORequest *ir = it->u.esRequest;
129 Z_IOOriginPartToKeep *k = ir->toKeep;
130 Z_IOOriginPartNotToKeep *n = ir->notToKeep;
134 if (k->contact->name)
135 logf(LOG_LOG, "contact name %s", k->contact->name);
136 if (k->contact->phone)
137 logf(LOG_LOG, "contact phone %s", k->contact->phone);
138 if (k->contact->email)
139 logf(LOG_LOG, "contact email %s", k->contact->email);
143 logf(LOG_LOG, "Billing info (not shown)");
146 if (n->resultSetItem)
148 logf(LOG_LOG, "resultsetItem");
149 logf(LOG_LOG, "setId: %s", n->resultSetItem->resultSetId);
150 logf(LOG_LOG, "item: %d", *n->resultSetItem->item);
159 int ztest_delete (void *handle, bend_delete_rr *rr)
161 if (rr->num_setnames == 1 && !strcmp (rr->setnames[0], "1"))
162 rr->delete_status = Z_DeleteStatus_success;
164 rr->delete_status = Z_DeleteStatus_resultSetDidNotExist;
168 /* Obsolete bend_search, never called because handler is registered */
169 bend_searchresult *bend_search(void *handle, bend_searchrequest *q, int *fd)
174 /* Our sort handler really doesn't sort... */
175 int ztest_sort (void *handle, bend_sort_rr *rr)
178 rr->sort_status = Z_SortStatus_success;
182 static int atoin (const char *buf, int n)
188 val = val*10 + (*buf - '0');
194 char *marc_read(FILE *inf)
200 if (fread (length_str, 1, 5, inf) != 5)
202 size = atoin (length_str, 5);
205 if (!(buf = (char*) xmalloc (size+1)))
207 if (fread (buf+5, 1, size-5, inf) != (size-5))
212 memcpy (buf, length_str, 5);
217 static char *dummy_database_record (int num)
219 FILE *inf = fopen ("dummy-records", "r");
230 buf = (char*) xmalloc(2101);
232 memset(buf, 'A', 2100);
237 buf = marc_read (inf);
247 static Z_GenericRecord *dummy_grs_record (int num, ODR o)
249 FILE *f = fopen("dummy-grs", "r");
251 Z_GenericRecord *r = 0;
256 while (fgets(line, 512, f))
257 if (*line == '#' && sscanf(line, "#%d", &n) == 1 && n == num)
266 bend_fetchresult *bend_fetch(void *handle, bend_fetchrequest *q, int *fd)
268 bend_fetchresult *r = (bend_fetchresult *)
269 odr_malloc (q->stream, sizeof(*r));
273 r->basename = "DUMMY";
274 r->format = q->format;
275 if (q->format == VAL_SUTRS)
279 sprintf(buf, "This is dummy SUTRS record number %d\n", q->number);
280 r->len = strlen(buf);
281 r->record = (char *) odr_malloc (q->stream, r->len+1);
282 strcpy(r->record, buf);
284 else if (q->format == VAL_GRS1)
287 r->record = (char*) dummy_grs_record(q->number, q->stream);
294 else if ((cp = dummy_database_record(q->number)))
297 r->record = (char *) odr_malloc (q->stream, 1+r->len);
298 strcpy (r->record, cp);
299 r->format = VAL_USMARC;
311 * silly dummy-scan what reads words from a file.
313 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *fd)
315 bend_scanresult *r = (bend_scanresult *)
316 odr_malloc (q->stream, sizeof(*r));
318 static struct scan_entry list[200];
319 static char entries[200][80];
327 r->status = BEND_SCAN_SUCCESS;
328 if (!f && !(f = fopen("dummy-words", "r")))
330 perror("dummy-words");
333 if (q->term->term->which != Z_Term_general)
335 r->errcode = 229; /* unsupported term type */
338 if (q->term->term->u.general->len >= 80)
340 r->errcode = 11; /* term too long */
343 if (q->num_entries > 200)
348 memcpy(term, q->term->term->u.general->buf, q->term->term->u.general->len);
349 term[q->term->term->u.general->len] = '\0';
350 for (p = term; *p; p++)
354 fseek(f, 0, SEEK_SET);
356 for (i = 0, pos = 0; fscanf(f, " %79[^:]:%d", entries[pos], &hits[pos]) == 2;
357 i++, pos < 199 ? pos++ : (pos = 0))
359 if (!r->num_entries && strcmp(entries[pos], term) >= 0) /* s-point fnd */
361 if ((r->term_position = q->term_position) > i + 1)
363 r->term_position = i + 1;
364 r->status = BEND_SCAN_PARTIAL;
366 for (; r->num_entries < r->term_position; r->num_entries++)
370 po = pos - r->term_position + r->num_entries + 1; /* find pos */
374 if (!strcmp (term, "SD") && r->num_entries == 2)
376 list[r->num_entries].term = entries[pos];
377 list[r->num_entries].occurrences = -1;
378 list[r->num_entries].errcode = 233;
379 list[r->num_entries].errstring = "SD for Scan Term";
383 list[r->num_entries].term = entries[po];
384 list[r->num_entries].occurrences = hits[po];
388 else if (r->num_entries)
390 list[r->num_entries].term = entries[pos];
391 list[r->num_entries].occurrences = hits[pos];
394 if (r->num_entries >= q->num_entries)
398 r->status = BEND_SCAN_PARTIAL;
402 void bend_close(void *handle)
407 int main(int argc, char **argv)
409 return statserv_main(argc, argv);