2 * Copyright (C) 1994-1999, Index Data
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.20 2002-03-20 20:24:29 adam
8 * Hits per term. Returned in SearchResult-1
10 * Revision 1.19 2001/01/16 16:56:15 heikki
11 * Searching in my isam-d
13 * Revision 1.18 2000/05/18 12:01:36 adam
14 * System call times(2) used again. More 64-bit fixes.
16 * Revision 1.17 2000/03/15 15:00:30 adam
17 * First work on threaded version.
19 * Revision 1.16 1999/11/30 13:48:03 adam
20 * Improved installation. Updated for inclusion of YAZ header files.
22 * Revision 1.15 1999/07/20 13:59:18 adam
23 * Fixed bug that occurred when phrases had 0 hits.
25 * Revision 1.14 1999/05/26 07:49:13 adam
28 * Revision 1.13 1999/05/12 13:08:06 adam
29 * First version of ISAMS.
31 * Revision 1.12 1999/02/02 14:51:10 adam
32 * Updated WIN32 code specific sections. Changed header.
34 * Revision 1.11 1998/03/25 13:48:02 adam
35 * Fixed bug in rset_trunc_r.
37 * Revision 1.10 1998/03/05 08:45:13 adam
38 * New result set model and modular ranking system. Moved towards
39 * descent server API. System information stored as "SGML" records.
41 * Revision 1.9 1998/01/12 15:04:09 adam
42 * The test option (-s) only uses read-lock (and not write lock).
44 * Revision 1.8 1997/10/31 12:34:27 adam
45 * Bug fix: memory leak.
47 * Revision 1.7 1997/09/29 09:07:29 adam
50 * Revision 1.6 1997/09/22 12:39:06 adam
51 * Added get_pos method for the ranked result sets.
53 * Revision 1.5 1997/09/17 12:19:17 adam
54 * Zebra version corresponds to YAZ version 1.4.
55 * Changed Zebra server so that it doesn't depend on global common_resource.
57 * Revision 1.4 1996/12/23 15:30:44 adam
59 * Bug fix: result sets weren't deleted after server shut down.
61 * Revision 1.3 1996/12/20 11:07:14 adam
62 * Multi-or result set.
64 * Revision 1.2 1996/11/08 11:10:28 adam
65 * Buffers used during file match got bigger.
66 * Compressed ISAM support everywhere.
67 * Bug fixes regarding masking characters in queries.
68 * Redesigned Regexp-2 queries.
70 * Revision 1.1 1996/11/04 14:07:40 adam
71 * Moved truncation code to trunc.c.
97 int (*cmp)(const void *p1, const void *p2);
104 static void heap_swap (struct trunc_info *ti, int i1, int i2)
109 ti->ptr[i1] = ti->ptr[i2];
113 static void heap_delete (struct trunc_info *ti)
115 int cur = 1, child = 2;
117 heap_swap (ti, 1, ti->heapnum--);
118 while (child <= ti->heapnum) {
119 if (child < ti->heapnum &&
120 (*ti->cmp)(ti->heap[ti->ptr[child]],
121 ti->heap[ti->ptr[1+child]]) > 0)
123 if ((*ti->cmp)(ti->heap[ti->ptr[cur]],
124 ti->heap[ti->ptr[child]]) > 0)
126 heap_swap (ti, cur, child);
135 static void heap_insert (struct trunc_info *ti, const char *buf, int indx)
139 cur = ++(ti->heapnum);
140 memcpy (ti->heap[ti->ptr[cur]], buf, ti->keysize);
141 ti->indx[ti->ptr[cur]] = indx;
143 while (parent && (*ti->cmp)(ti->heap[ti->ptr[parent]],
144 ti->heap[ti->ptr[cur]]) > 0)
146 heap_swap (ti, cur, parent);
152 static struct trunc_info *heap_init (int size, int key_size,
153 int (*cmp)(const void *p1,
156 struct trunc_info *ti = (struct trunc_info *) xmalloc (sizeof(*ti));
161 ti->keysize = key_size;
163 ti->indx = (int *) xmalloc (size * sizeof(*ti->indx));
164 ti->heap = (char **) xmalloc (size * sizeof(*ti->heap));
165 ti->ptr = (int *) xmalloc (size * sizeof(*ti->ptr));
166 ti->swapbuf = (char *) xmalloc (ti->keysize);
167 ti->tmpbuf = (char *) xmalloc (ti->keysize);
168 ti->buf = (char *) xmalloc (size * ti->keysize);
169 for (i = size; --i >= 0; )
172 ti->heap[i] = ti->buf + ti->keysize * i;
177 static void heap_close (struct trunc_info *ti)
188 static RSET rset_trunc_r (ZebraHandle zi, const char *term, int length,
189 const char *flags, ISAMS_P *isam_p, int from, int to,
194 rset_temp_parms parms;
196 parms.cmp = key_compare_it;
197 parms.key_size = sizeof(struct it_key);
198 parms.temp_path = res_get (zi->service->res, "setTmpDir");
199 parms.rset_term = rset_term_create (term, length, flags);
200 result = rset_create (rset_kind_temp, &parms);
201 result_rsfd = rset_open (result, RSETF_WRITE);
203 if (to - from > merge_chunk)
208 int i, i_add = (to-from)/merge_chunk + 1;
209 struct trunc_info *ti;
211 int rsmax = (to-from)/i_add + 1;
213 rset = (RSET *) xmalloc (sizeof(*rset) * rsmax);
214 rsfd = (RSFD *) xmalloc (sizeof(*rsfd) * rsmax);
216 for (i = from; i < to; i += i_add)
219 rset[rscur] = rset_trunc_r (zi, term, length, flags,
220 isam_p, i, i+i_add, merge_chunk);
222 rset[rscur] = rset_trunc_r (zi, term, length, flags,
223 isam_p, i, to, merge_chunk);
226 ti = heap_init (rscur, sizeof(struct it_key), key_compare_it);
227 for (i = rscur; --i >= 0; )
229 rsfd[i] = rset_open (rset[i], RSETF_READ);
230 if (rset_read (rset[i], rsfd[i], ti->tmpbuf, &term_index))
231 heap_insert (ti, ti->tmpbuf, i);
234 rset_close (rset[i], rsfd[i]);
235 rset_delete (rset[i]);
240 int n = ti->indx[ti->ptr[1]];
242 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
246 if (!rset_read (rset[n], rsfd[n], ti->tmpbuf, &term_index))
249 rset_close (rset[n], rsfd[n]);
250 rset_delete (rset[n]);
253 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
256 heap_insert (ti, ti->tmpbuf, n);
266 else if (zi->service->isam)
270 struct trunc_info *ti;
272 ispt = (ISPT *) xmalloc (sizeof(*ispt) * (to-from));
274 ti = heap_init (to-from, sizeof(struct it_key),
276 for (i = to-from; --i >= 0; )
278 ispt[i] = is_position (zi->service->isam, isam_p[from+i]);
279 if (is_readkey (ispt[i], ti->tmpbuf))
280 heap_insert (ti, ti->tmpbuf, i);
282 is_pt_free (ispt[i]);
286 int n = ti->indx[ti->ptr[1]];
288 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
290 /* section that preserve all keys */
292 if (is_readkey (ispt[n], ti->tmpbuf))
293 heap_insert (ti, ti->tmpbuf, n);
295 is_pt_free (ispt[n]);
297 /* section that preserve all keys with unique sysnos */
300 if (!is_readkey (ispt[n], ti->tmpbuf))
303 is_pt_free (ispt[n]);
306 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
309 heap_insert (ti, ti->tmpbuf, n);
318 else if (zi->service->isamc)
322 struct trunc_info *ti;
324 ispt = (ISAMC_PP *) xmalloc (sizeof(*ispt) * (to-from));
326 ti = heap_init (to-from, sizeof(struct it_key),
328 for (i = to-from; --i >= 0; )
330 ispt[i] = isc_pp_open (zi->service->isamc, isam_p[from+i]);
331 if (isc_pp_read (ispt[i], ti->tmpbuf))
332 heap_insert (ti, ti->tmpbuf, i);
334 isc_pp_close (ispt[i]);
338 int n = ti->indx[ti->ptr[1]];
340 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
342 /* section that preserve all keys */
344 if (isc_pp_read (ispt[n], ti->tmpbuf))
345 heap_insert (ti, ti->tmpbuf, n);
347 isc_pp_close (ispt[n]);
349 /* section that preserve all keys with unique sysnos */
352 if (!isc_pp_read (ispt[n], ti->tmpbuf))
355 isc_pp_close (ispt[n]);
358 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
361 heap_insert (ti, ti->tmpbuf, n);
371 else if (zi->service->isamd)
375 struct trunc_info *ti;
377 ispt = (ISAMD_PP *) xmalloc (sizeof(*ispt) * (to-from));
379 ti = heap_init (to-from, sizeof(struct it_key),
381 for (i = to-from; --i >= 0; )
383 ispt[i] = isamd_pp_open (zi->service->isamd, isam_p[from+i]);
384 if (isamd_pp_read (ispt[i], ti->tmpbuf))
385 heap_insert (ti, ti->tmpbuf, i);
387 isamd_pp_close (ispt[i]);
391 int n = ti->indx[ti->ptr[1]];
393 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
395 /* section that preserve all keys */
397 if (isamd_pp_read (ispt[n], ti->tmpbuf))
398 heap_insert (ti, ti->tmpbuf, n);
400 isamd_pp_close (ispt[n]);
402 /* section that preserve all keys with unique sysnos */
405 if (!isamd_pp_read (ispt[n], ti->tmpbuf))
408 isamd_pp_close (ispt[n]);
411 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
414 heap_insert (ti, ti->tmpbuf, n);
425 else if (zi->service->isams)
429 struct trunc_info *ti;
431 ispt = (ISAMS_PP *) xmalloc (sizeof(*ispt) * (to-from));
433 ti = heap_init (to-from, sizeof(struct it_key),
435 for (i = to-from; --i >= 0; )
437 ispt[i] = isams_pp_open (zi->service->isams, isam_p[from+i]);
438 if (isams_pp_read (ispt[i], ti->tmpbuf))
439 heap_insert (ti, ti->tmpbuf, i);
441 isams_pp_close (ispt[i]);
445 int n = ti->indx[ti->ptr[1]];
447 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
450 if (!isams_pp_read (ispt[n], ti->tmpbuf))
453 isams_pp_close (ispt[n]);
456 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
459 heap_insert (ti, ti->tmpbuf, n);
468 logf (LOG_WARN, "Unknown isam set in rset_trunc_r");
470 rset_close (result, result_rsfd);
474 static int isams_trunc_cmp (const void *p1, const void *p2)
476 ISAMS_P i1 = *(ISAMS_P*) p1;
477 ISAMS_P i2 = *(ISAMS_P*) p2;
483 static int isam_trunc_cmp (const void *p1, const void *p2)
485 ISAM_P i1 = *(ISAM_P*) p1;
486 ISAM_P i2 = *(ISAM_P*) p2;
489 d = is_type (i1) - is_type (i2);
492 return is_block (i1) - is_block (i2);
495 static int isamc_trunc_cmp (const void *p1, const void *p2)
497 ISAMC_P i1 = *(ISAMC_P*) p1;
498 ISAMC_P i2 = *(ISAMC_P*) p2;
501 d = isc_type (i1) - isc_type (i2);
504 return isc_block (i1) - isc_block (i2);
506 static int isamd_trunc_cmp (const void *p1, const void *p2)
508 ISAMD_P i1 = *(ISAMD_P*) p1;
509 ISAMD_P i2 = *(ISAMD_P*) p2;
512 d = isamd_type (i1) - isamd_type (i2);
515 return isamd_block (i1) - isamd_block (i2);
519 RSET rset_trunc (ZebraHandle zi, ISAMS_P *isam_p, int no,
520 const char *term, int length, const char *flags)
522 logf (LOG_DEBUG, "rset_trunc no=%d", no);
525 rset_null_parms parms;
526 parms.rset_term = rset_term_create (term, length, flags);
527 return rset_create (rset_kind_null, &parms);
529 if (zi->service->isams)
533 rset_isams_parms parms;
536 parms.is = zi->service->isams;
537 parms.rset_term = rset_term_create (term, length, flags);
538 return rset_create (rset_kind_isams, &parms);
540 qsort (isam_p, no, sizeof(*isam_p), isams_trunc_cmp);
543 else if (zi->service->isam)
547 rset_isam_parms parms;
550 parms.is = zi->service->isam;
551 parms.rset_term = rset_term_create (term, length, flags);
552 return rset_create (rset_kind_isam, &parms);
554 qsort (isam_p, no, sizeof(*isam_p), isam_trunc_cmp);
556 else if (zi->service->isamc)
560 rset_isamc_parms parms;
562 parms.key_size = sizeof(struct it_key);
563 parms.cmp = key_compare_it;
565 parms.is = zi->service->isamc;
566 parms.rset_term = rset_term_create (term, length, flags);
567 return rset_create (rset_kind_isamc, &parms);
572 rset_m_or_parms parms;
574 parms.key_size = sizeof(struct it_key);
575 parms.cmp = key_compare_it;
576 parms.isc = zi->service->isamc;
577 parms.isam_positions = isam_p;
578 parms.no_isam_positions = no;
579 parms.no_save_positions = 100000;
580 parms.rset_term = rset_term_create (term, length, flags);
581 return rset_create (rset_kind_m_or, &parms);
584 qsort (isam_p, no, sizeof(*isam_p), isamc_trunc_cmp);
586 else if (zi->service->isamd)
590 rset_isamd_parms parms;
593 parms.is = zi->service->isamd;
594 parms.rset_term = rset_term_create (term, length, flags);
595 return rset_create (rset_kind_isamd, &parms);
597 #if NEW_TRUNC_NOT_DONE_FOR_ISAM_D
600 rset_m_or_parms parms;
602 parms.key_size = sizeof(struct it_key);
603 parms.cmp = key_compare_it;
605 parms.isamd=zi->service->isamd;
606 parms.isam_positions = isam_p;
607 parms.no_isam_positions = no;
608 parms.no_save_positions = 100000;
609 parms.rset_term = rset_term_create (term, length, flags);
610 return rset_create (rset_kind_m_or, &parms);
613 qsort (isam_p, no, sizeof(*isam_p), isamd_trunc_cmp);
618 logf (LOG_WARN, "Unknown isam set in rset_trunc");
619 return rset_create (rset_kind_null, NULL);
621 return rset_trunc_r (zi, term, length, flags, isam_p, 0, no, 100);