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.6 1998-01-29 13:16:02 adam
11 * Added dummy sort in test server.
13 * Revision 1.5 1997/11/07 13:31:58 adam
14 * Added NT Service name part of statserv_options_block. Moved NT
15 * service utility to server library.
17 * Revision 1.4 1997/09/17 12:10:43 adam
20 * Revision 1.3 1997/09/09 10:10:20 adam
21 * Another MSV5.0 port. Changed projects to include proper
22 * library/include paths.
23 * Server starts server in test-mode when no options are given.
25 * Revision 1.2 1997/09/04 13:50:31 adam
31 * Demonstration of simple server
43 Z_GenericRecord *read_grs1(FILE *f, ODR o);
45 int bend_sort (void *handle, bend_sortrequest *req, bend_sortresult *res)
48 res->errstring = "Sort not implemented";
49 res->sort_status = Z_SortStatus_failure;
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 = bend_sort; /* register sort handler */
65 bend_searchresult *bend_search(void *handle, bend_searchrequest *q, int *fd)
67 bend_searchresult *r = odr_malloc (q->stream, sizeof(*r));
71 r->hits = rand() % 22;
76 static int atoin (const char *buf, int n)
82 val = val*10 + (*buf - '0');
88 char *marc_read(FILE *inf)
94 if (fread (length_str, 1, 5, inf) != 5)
96 size = atoin (length_str, 5);
99 if (!(buf = xmalloc (size+1)))
101 if (fread (buf+5, 1, size-5, inf) != (size-5))
106 memcpy (buf, length_str, 5);
111 static char *dummy_database_record (int num)
113 FILE *inf = fopen ("dummy-records", "r");
124 assert(buf = xmalloc(2101));
125 memset(buf, 'A', 2100);
130 buf = marc_read (inf);
140 static Z_GenericRecord *dummy_grs_record (int num, ODR o)
142 FILE *f = fopen("dummy-grs", "r");
144 Z_GenericRecord *r = 0;
149 while (fgets(line, 512, f))
150 if (*line == '#' && sscanf(line, "#%d", &n) == 1 && n == num)
159 bend_fetchresult *bend_fetch(void *handle, bend_fetchrequest *q, int *num)
161 bend_fetchresult *r = odr_malloc (q->stream, sizeof(*r));
162 static char *bbb = 0;
166 r->basename = "DUMMY";
172 r->format = q->format;
173 if (q->format == VAL_SUTRS)
177 sprintf(buf, "This is dummy SUTRS record number %d\n", q->number);
178 assert(r->record = bbb = xmalloc(strlen(buf)+1));
180 r->len = strlen(buf);
182 else if (q->format == VAL_GRS1)
185 r->record = (char*) dummy_grs_record(q->number, q->stream);
192 else if (!(r->record = bbb = dummy_database_record(q->number)))
195 r->format = VAL_USMARC;
199 r->len = strlen(r->record);
204 bend_deleteresult *bend_delete(void *handle, bend_deleterequest *q, int *num)
210 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *num)
212 static struct scan_entry list[200];
213 static char buf[200][200];
214 static bend_scanresult r;
217 r.term_position = q->term_position;
218 r.num_entries = q->num_entries;
220 for (i = 0; i < r.num_entries; i++)
222 list[i].term = buf[i];
223 sprintf(list[i].term, "term-%d", i+1);
224 list[i].occurrences = rand() % 100000;
232 * silly dummy-scan what reads words from a file.
234 bend_scanresult *bend_scan(void *handle, bend_scanrequest *q, int *num)
236 bend_scanresult *r = odr_malloc (q->stream, sizeof(*r));
238 static struct scan_entry list[200];
239 static char entries[200][80];
246 r->status = BEND_SCAN_SUCCESS;
247 if (!f && !(f = fopen("dummy-words", "r")))
249 perror("dummy-words");
252 if (q->term->term->which != Z_Term_general)
254 r->errcode = 229; /* unsupported term type */
257 if (q->term->term->u.general->len >= 80)
259 r->errcode = 11; /* term too long */
262 if (q->num_entries > 200)
267 memcpy(term, q->term->term->u.general->buf, q->term->term->u.general->len);
268 term[q->term->term->u.general->len] = '\0';
269 for (p = term; *p; p++)
275 for (i = 0, pos = 0; fscanf(f, " %79[^:]:%d", entries[pos], &hits[pos]) == 2;
276 i++, pos < 199 ? pos++ : (pos = 0))
278 if (!r->num_entries && strcmp(entries[pos], term) >= 0) /* s-point fnd */
280 if ((r->term_position = q->term_position) > i + 1)
282 r->term_position = i + 1;
283 r->status = BEND_SCAN_PARTIAL;
285 for (; r->num_entries < r->term_position; r->num_entries++)
289 po = pos - r->term_position + r->num_entries + 1; /* find pos */
292 list[r->num_entries].term = entries[po];
293 list[r->num_entries].occurrences = hits[po];
296 else if (r->num_entries)
298 list[r->num_entries].term = entries[pos];
299 list[r->num_entries].occurrences = hits[pos];
302 if (r->num_entries >= q->num_entries)
306 r->status = BEND_SCAN_PARTIAL;
312 void bend_close(void *handle)
317 int main(int argc, char **argv)
319 return statserv_main(argc, argv);