2 * Copyright (C) 1994-1999, Index Data
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.27 1999-05-12 13:08:06 adam
8 * First version of ISAMS.
10 * Revision 1.26 1999/02/02 14:50:54 adam
11 * Updated WIN32 code specific sections. Changed header.
13 * Revision 1.25 1998/06/08 15:26:06 adam
16 * Revision 1.24 1998/06/08 14:43:12 adam
17 * Added suport for EXPLAIN Proxy servers - added settings databasePath
18 * and explainDatabase to facilitate this. Increased maximum number
19 * of databases and attributes in one register.
21 * Revision 1.23 1998/03/05 08:45:12 adam
22 * New result set model and modular ranking system. Moved towards
23 * descent server API. System information stored as "SGML" records.
25 * Revision 1.22 1997/09/22 12:39:06 adam
26 * Added get_pos method for the ranked result sets.
28 * Revision 1.21 1997/09/17 12:19:13 adam
29 * Zebra version corresponds to YAZ version 1.4.
30 * Changed Zebra server so that it doesn't depend on global common_resource.
32 * Revision 1.20 1996/12/23 15:30:44 adam
34 * Bug fix: result sets weren't deleted after server shut down.
36 * Revision 1.19 1996/12/11 12:08:00 adam
37 * Added better compression.
39 * Revision 1.18 1996/10/29 14:09:44 adam
40 * Use of cisam system - enabled if setting isamc is 1.
42 * Revision 1.17 1996/06/04 10:18:58 adam
43 * Minor changes - removed include of ctype.h.
45 * Revision 1.16 1996/05/13 14:23:05 adam
46 * Work on compaction of set/use bytes in dictionary.
48 * Revision 1.15 1995/11/20 16:59:46 adam
49 * New update method: the 'old' keys are saved for each records.
51 * Revision 1.14 1995/10/30 15:08:08 adam
54 * Revision 1.13 1995/10/27 14:00:11 adam
55 * Implemented detection of database availability.
57 * Revision 1.12 1995/10/17 18:02:08 adam
58 * New feature: databases. Implemented as prefix to words in dictionary.
60 * Revision 1.11 1995/10/06 16:33:37 adam
61 * Use attribute mappings.
63 * Revision 1.10 1995/09/29 14:01:41 adam
66 * Revision 1.9 1995/09/28 12:10:32 adam
67 * Bug fixes. Field prefix used in queries.
69 * Revision 1.8 1995/09/28 09:19:42 adam
70 * xfree/xmalloc used everywhere.
71 * Extract/retrieve method seems to work for text records.
73 * Revision 1.7 1995/09/27 12:22:28 adam
74 * More work on extract in record control.
75 * Field name is not in isam keys but in prefix in dictionary words.
77 * Revision 1.6 1995/09/14 07:48:23 adam
78 * Record control management.
80 * Revision 1.5 1995/09/11 13:09:34 adam
81 * More work on relevance feedback.
83 * Revision 1.4 1995/09/08 14:52:27 adam
84 * Minor changes. Dictionary is lower case now.
86 * Revision 1.3 1995/09/07 13:58:36 adam
87 * New parameter: result-set file descriptor (RSFD) to support multiple
88 * positions within the same result-set.
89 * Boolean operators: and, or, not implemented.
90 * Result-set references.
92 * Revision 1.2 1995/09/06 16:11:17 adam
93 * Option: only one word key per file.
95 * Revision 1.1 1995/09/04 09:10:36 adam
96 * More work on index add/del/update.
97 * Merge sort implemented.
98 * Initial work on z39 server.
109 void key_logdump (int logmask, const void *p)
113 memcpy (&key, p, sizeof(key));
114 logf (logmask, "%7d s=%-4d", key.sysno, key.seqno);
117 int key_compare_it (const void *p1, const void *p2)
119 if (((struct it_key *) p1)->sysno != ((struct it_key *) p2)->sysno)
121 if (((struct it_key *) p1)->sysno > ((struct it_key *) p2)->sysno)
126 if (((struct it_key *) p1)->seqno != ((struct it_key *) p2)->seqno)
128 if (((struct it_key *) p1)->seqno > ((struct it_key *) p2)->seqno)
136 int key_compare (const void *p1, const void *p2)
138 struct it_key i1, i2;
139 memcpy (&i1, p1, sizeof(i1));
140 memcpy (&i2, p2, sizeof(i2));
141 if (i1.sysno != i2.sysno)
143 if (i1.sysno > i2.sysno)
148 if (i1.seqno != i2.seqno)
150 if (i1.seqno > i2.seqno)
158 int key_qsort_compare (const void *p1, const void *p2)
162 char *cp1 = *(char **) p1;
163 char *cp2 = *(char **) p2;
165 if ((r = strcmp (cp1, cp2)))
168 if ((r = key_compare (cp1+l+1, cp2+l+1)))
170 return cp1[l] - cp2[l];
173 int key_get_pos (const void *p)
176 memcpy (&key, p, sizeof(key));
180 struct iscz1_code_info {
184 static void *iscz1_code_start (int mode)
186 struct iscz1_code_info *p = xmalloc (sizeof(*p));
192 static void iscz1_code_stop (int mode, void *p)
197 void iscz1_encode_int (unsigned d, char **dst)
199 unsigned char *bp = (unsigned char*) *dst;
208 else if (d <= 4194303)
210 *bp++ = 128 + (d>>16);
211 *bp++ = (d>>8) & 255;
216 *bp++ = 192 + (d>>24);
217 *bp++ = (d>>16) & 255;
218 *bp++ = (d>>8) & 255;
224 int iscz1_decode_int (unsigned char **src)
226 unsigned c = *(*src)++;
232 return ((c & 63) << 8) + *(*src)++;
234 c = ((c & 63) << 8) + *(*src)++;
235 c = (c << 8) + *(*src)++;
238 c = ((c & 63) << 8) + *(*src)++;
239 c = (c << 8) + *(*src)++;
240 c = (c << 8) + *(*src)++;
244 static void iscz1_code_item (int mode, void *vp, char **dst, char **src)
246 struct iscz1_code_info *p = vp;
250 if (mode == ISAMC_ENCODE)
252 memcpy (&tkey, *src, sizeof(struct it_key));
253 d = tkey.sysno - p->key.sysno;
256 iscz1_encode_int (2*tkey.seqno + 1, dst);
257 iscz1_encode_int (d, dst);
259 p->key.seqno = tkey.seqno;
263 iscz1_encode_int (2*(tkey.seqno - p->key.seqno), dst);
264 p->key.seqno = tkey.seqno;
266 (*src) += sizeof(struct it_key);
270 d = iscz1_decode_int ((unsigned char **) src);
274 p->key.sysno += iscz1_decode_int ((unsigned char **) src);
277 p->key.seqno += d>>1;
278 memcpy (*dst, &p->key, sizeof(struct it_key));
279 (*dst) += sizeof(struct it_key);
283 ISAMC_M key_isamc_m (Res res)
285 static ISAMC_M me = NULL;
290 me = isc_getmethod ();
292 me->compare_item = key_compare;
294 me->code_start = iscz1_code_start;
295 me->code_item = iscz1_code_item;
296 me->code_stop = iscz1_code_stop;
298 me->debug = atoi(res_get_def (res, "isamcDebug", "0"));
303 ISAMS_M key_isams_m (Res res)
305 static ISAMS_M me = NULL;
310 me = isams_getmethod ();
312 me->compare_item = key_compare;
314 me->code_start = iscz1_code_start;
315 me->code_item = iscz1_code_item;
316 me->code_stop = iscz1_code_stop;
318 me->debug = atoi(res_get_def (res, "isamsDebug", "0"));
324 int key_SU_code (int ch, char *out)
330 out[i] = 128 + (ch & 63);