2 * Copyright (C) 1994-1999, Index Data
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.18 2000-05-18 12:01:36 adam
8 * System call times(2) used again. More 64-bit fixes.
10 * Revision 1.17 2000/03/15 15:00:30 adam
11 * First work on threaded version.
13 * Revision 1.16 1999/11/30 13:48:03 adam
14 * Improved installation. Updated for inclusion of YAZ header files.
16 * Revision 1.15 1999/07/20 13:59:18 adam
17 * Fixed bug that occurred when phrases had 0 hits.
19 * Revision 1.14 1999/05/26 07:49:13 adam
22 * Revision 1.13 1999/05/12 13:08:06 adam
23 * First version of ISAMS.
25 * Revision 1.12 1999/02/02 14:51:10 adam
26 * Updated WIN32 code specific sections. Changed header.
28 * Revision 1.11 1998/03/25 13:48:02 adam
29 * Fixed bug in rset_trunc_r.
31 * Revision 1.10 1998/03/05 08:45:13 adam
32 * New result set model and modular ranking system. Moved towards
33 * descent server API. System information stored as "SGML" records.
35 * Revision 1.9 1998/01/12 15:04:09 adam
36 * The test option (-s) only uses read-lock (and not write lock).
38 * Revision 1.8 1997/10/31 12:34:27 adam
39 * Bug fix: memory leak.
41 * Revision 1.7 1997/09/29 09:07:29 adam
44 * Revision 1.6 1997/09/22 12:39:06 adam
45 * Added get_pos method for the ranked result sets.
47 * Revision 1.5 1997/09/17 12:19:17 adam
48 * Zebra version corresponds to YAZ version 1.4.
49 * Changed Zebra server so that it doesn't depend on global common_resource.
51 * Revision 1.4 1996/12/23 15:30:44 adam
53 * Bug fix: result sets weren't deleted after server shut down.
55 * Revision 1.3 1996/12/20 11:07:14 adam
56 * Multi-or result set.
58 * Revision 1.2 1996/11/08 11:10:28 adam
59 * Buffers used during file match got bigger.
60 * Compressed ISAM support everywhere.
61 * Bug fixes regarding masking characters in queries.
62 * Redesigned Regexp-2 queries.
64 * Revision 1.1 1996/11/04 14:07:40 adam
65 * Moved truncation code to trunc.c.
90 int (*cmp)(const void *p1, const void *p2);
97 static void heap_swap (struct trunc_info *ti, int i1, int i2)
102 ti->ptr[i1] = ti->ptr[i2];
106 static void heap_delete (struct trunc_info *ti)
108 int cur = 1, child = 2;
110 heap_swap (ti, 1, ti->heapnum--);
111 while (child <= ti->heapnum) {
112 if (child < ti->heapnum &&
113 (*ti->cmp)(ti->heap[ti->ptr[child]],
114 ti->heap[ti->ptr[1+child]]) > 0)
116 if ((*ti->cmp)(ti->heap[ti->ptr[cur]],
117 ti->heap[ti->ptr[child]]) > 0)
119 heap_swap (ti, cur, child);
128 static void heap_insert (struct trunc_info *ti, const char *buf, int indx)
132 cur = ++(ti->heapnum);
133 memcpy (ti->heap[ti->ptr[cur]], buf, ti->keysize);
134 ti->indx[ti->ptr[cur]] = indx;
136 while (parent && (*ti->cmp)(ti->heap[ti->ptr[parent]],
137 ti->heap[ti->ptr[cur]]) > 0)
139 heap_swap (ti, cur, parent);
145 static struct trunc_info *heap_init (int size, int key_size,
146 int (*cmp)(const void *p1,
149 struct trunc_info *ti = (struct trunc_info *) xmalloc (sizeof(*ti));
154 ti->keysize = key_size;
156 ti->indx = (int *) xmalloc (size * sizeof(*ti->indx));
157 ti->heap = (char **) xmalloc (size * sizeof(*ti->heap));
158 ti->ptr = (int *) xmalloc (size * sizeof(*ti->ptr));
159 ti->swapbuf = (char *) xmalloc (ti->keysize);
160 ti->tmpbuf = (char *) xmalloc (ti->keysize);
161 ti->buf = (char *) xmalloc (size * ti->keysize);
162 for (i = size; --i >= 0; )
165 ti->heap[i] = ti->buf + ti->keysize * i;
170 static void heap_close (struct trunc_info *ti)
181 static RSET rset_trunc_r (ZebraHandle zi, const char *term, int length,
182 const char *flags, ISAMS_P *isam_p, int from, int to,
187 rset_temp_parms parms;
189 parms.key_size = sizeof(struct it_key);
190 parms.temp_path = res_get (zi->service->res, "setTmpDir");
191 parms.rset_term = rset_term_create (term, length, flags);
192 result = rset_create (rset_kind_temp, &parms);
193 result_rsfd = rset_open (result, RSETF_WRITE);
195 if (to - from > merge_chunk)
200 int i, i_add = (to-from)/merge_chunk + 1;
201 struct trunc_info *ti;
203 int rsmax = (to-from)/i_add + 1;
205 rset = (RSET *) xmalloc (sizeof(*rset) * rsmax);
206 rsfd = (RSFD *) xmalloc (sizeof(*rsfd) * rsmax);
208 for (i = from; i < to; i += i_add)
211 rset[rscur] = rset_trunc_r (zi, term, length, flags,
212 isam_p, i, i+i_add, merge_chunk);
214 rset[rscur] = rset_trunc_r (zi, term, length, flags,
215 isam_p, i, to, merge_chunk);
218 ti = heap_init (rscur, sizeof(struct it_key), key_compare_it);
219 for (i = rscur; --i >= 0; )
221 rsfd[i] = rset_open (rset[i], RSETF_READ);
222 if (rset_read (rset[i], rsfd[i], ti->tmpbuf, &term_index))
223 heap_insert (ti, ti->tmpbuf, i);
226 rset_close (rset[i], rsfd[i]);
227 rset_delete (rset[i]);
232 int n = ti->indx[ti->ptr[1]];
234 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
238 if (!rset_read (rset[n], rsfd[n], ti->tmpbuf, &term_index))
241 rset_close (rset[n], rsfd[n]);
242 rset_delete (rset[n]);
245 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
248 heap_insert (ti, ti->tmpbuf, n);
258 else if (zi->service->isam)
262 struct trunc_info *ti;
264 ispt = (ISPT *) xmalloc (sizeof(*ispt) * (to-from));
266 ti = heap_init (to-from, sizeof(struct it_key),
268 for (i = to-from; --i >= 0; )
270 ispt[i] = is_position (zi->service->isam, isam_p[from+i]);
271 if (is_readkey (ispt[i], ti->tmpbuf))
272 heap_insert (ti, ti->tmpbuf, i);
274 is_pt_free (ispt[i]);
278 int n = ti->indx[ti->ptr[1]];
280 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
282 /* section that preserve all keys */
284 if (is_readkey (ispt[n], ti->tmpbuf))
285 heap_insert (ti, ti->tmpbuf, n);
287 is_pt_free (ispt[n]);
289 /* section that preserve all keys with unique sysnos */
292 if (!is_readkey (ispt[n], ti->tmpbuf))
295 is_pt_free (ispt[n]);
298 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
301 heap_insert (ti, ti->tmpbuf, n);
310 else if (zi->service->isamc)
314 struct trunc_info *ti;
316 ispt = (ISAMC_PP *) xmalloc (sizeof(*ispt) * (to-from));
318 ti = heap_init (to-from, sizeof(struct it_key),
320 for (i = to-from; --i >= 0; )
322 ispt[i] = isc_pp_open (zi->service->isamc, isam_p[from+i]);
323 if (isc_pp_read (ispt[i], ti->tmpbuf))
324 heap_insert (ti, ti->tmpbuf, i);
326 isc_pp_close (ispt[i]);
330 int n = ti->indx[ti->ptr[1]];
332 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
334 /* section that preserve all keys */
336 if (isc_pp_read (ispt[n], ti->tmpbuf))
337 heap_insert (ti, ti->tmpbuf, n);
339 isc_pp_close (ispt[n]);
341 /* section that preserve all keys with unique sysnos */
344 if (!isc_pp_read (ispt[n], ti->tmpbuf))
347 isc_pp_close (ispt[n]);
350 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
353 heap_insert (ti, ti->tmpbuf, n);
363 else if (zi->service->isams)
367 struct trunc_info *ti;
369 ispt = (ISAMS_PP *) xmalloc (sizeof(*ispt) * (to-from));
371 ti = heap_init (to-from, sizeof(struct it_key),
373 for (i = to-from; --i >= 0; )
375 ispt[i] = isams_pp_open (zi->service->isams, isam_p[from+i]);
376 if (isams_pp_read (ispt[i], ti->tmpbuf))
377 heap_insert (ti, ti->tmpbuf, i);
379 isams_pp_close (ispt[i]);
383 int n = ti->indx[ti->ptr[1]];
385 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
388 if (!isams_pp_read (ispt[n], ti->tmpbuf))
391 isams_pp_close (ispt[n]);
394 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
397 heap_insert (ti, ti->tmpbuf, n);
405 rset_close (result, result_rsfd);
409 static int isams_trunc_cmp (const void *p1, const void *p2)
411 ISAMS_P i1 = *(ISAMS_P*) p1;
412 ISAMS_P i2 = *(ISAMS_P*) p2;
418 static int isam_trunc_cmp (const void *p1, const void *p2)
420 ISAM_P i1 = *(ISAM_P*) p1;
421 ISAM_P i2 = *(ISAM_P*) p2;
424 d = is_type (i1) - is_type (i2);
427 return is_block (i1) - is_block (i2);
430 static int isamc_trunc_cmp (const void *p1, const void *p2)
432 ISAMC_P i1 = *(ISAMC_P*) p1;
433 ISAMC_P i2 = *(ISAMC_P*) p2;
436 d = isc_type (i1) - isc_type (i2);
439 return isc_block (i1) - isc_block (i2);
443 RSET rset_trunc (ZebraHandle zi, ISAMS_P *isam_p, int no,
444 const char *term, int length, const char *flags)
446 logf (LOG_DEBUG, "rset_trunc no=%d", no);
449 rset_null_parms parms;
450 parms.rset_term = rset_term_create (term, length, flags);
451 return rset_create (rset_kind_null, &parms);
453 if (zi->service->isams)
457 rset_isams_parms parms;
460 parms.is = zi->service->isams;
461 parms.rset_term = rset_term_create (term, length, flags);
462 return rset_create (rset_kind_isams, &parms);
464 qsort (isam_p, no, sizeof(*isam_p), isams_trunc_cmp);
467 else if (zi->service->isam)
471 rset_isam_parms parms;
474 parms.is = zi->service->isam;
475 parms.rset_term = rset_term_create (term, length, flags);
476 return rset_create (rset_kind_isam, &parms);
478 qsort (isam_p, no, sizeof(*isam_p), isam_trunc_cmp);
480 else if (zi->service->isamc)
484 rset_isamc_parms parms;
487 parms.is = zi->service->isamc;
488 parms.rset_term = rset_term_create (term, length, flags);
489 return rset_create (rset_kind_isamc, &parms);
494 rset_m_or_parms parms;
496 parms.key_size = sizeof(struct it_key);
497 parms.cmp = key_compare_it;
498 parms.isc = zi->service->isamc;
499 parms.isam_positions = isam_p;
500 parms.no_isam_positions = no;
501 parms.no_save_positions = 100000;
502 parms.rset_term = rset_term_create (term, length, flags);
503 return rset_create (rset_kind_m_or, &parms);
506 qsort (isam_p, no, sizeof(*isam_p), isamc_trunc_cmp);
511 logf (LOG_WARN, "Neither isam / isamc / isams set in rset_trunc");
512 return rset_create (rset_kind_null, NULL);
514 return rset_trunc_r (zi, term, length, flags, isam_p, 0, no, 100);