1 /* $Id: trunc.c,v 1.35 2004-08-19 12:49:14 heikki Exp $
2 Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
5 This file is part of the Zebra server.
7 Zebra is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with Zebra; see the file LICENSE.zebra. If not, write to the
19 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
38 #include <rsmultior.h>
45 int (*cmp)(const void *p1, const void *p2);
52 static void heap_swap (struct trunc_info *ti, int i1, int i2)
57 ti->ptr[i1] = ti->ptr[i2];
61 static void heap_delete (struct trunc_info *ti)
63 int cur = 1, child = 2;
65 heap_swap (ti, 1, ti->heapnum--);
66 while (child <= ti->heapnum) {
67 if (child < ti->heapnum &&
68 (*ti->cmp)(ti->heap[ti->ptr[child]],
69 ti->heap[ti->ptr[1+child]]) > 0)
71 if ((*ti->cmp)(ti->heap[ti->ptr[cur]],
72 ti->heap[ti->ptr[child]]) > 0)
74 heap_swap (ti, cur, child);
83 static void heap_insert (struct trunc_info *ti, const char *buf, int indx)
87 cur = ++(ti->heapnum);
88 memcpy (ti->heap[ti->ptr[cur]], buf, ti->keysize);
89 ti->indx[ti->ptr[cur]] = indx;
91 while (parent && (*ti->cmp)(ti->heap[ti->ptr[parent]],
92 ti->heap[ti->ptr[cur]]) > 0)
94 heap_swap (ti, cur, parent);
100 static struct trunc_info *heap_init (int size, int key_size,
101 int (*cmp)(const void *p1,
104 struct trunc_info *ti = (struct trunc_info *) xmalloc (sizeof(*ti));
109 ti->keysize = key_size;
111 ti->indx = (int *) xmalloc (size * sizeof(*ti->indx));
112 ti->heap = (char **) xmalloc (size * sizeof(*ti->heap));
113 ti->ptr = (int *) xmalloc (size * sizeof(*ti->ptr));
114 ti->swapbuf = (char *) xmalloc (ti->keysize);
115 ti->tmpbuf = (char *) xmalloc (ti->keysize);
116 ti->buf = (char *) xmalloc (size * ti->keysize);
117 for (i = size; --i >= 0; )
120 ti->heap[i] = ti->buf + ti->keysize * i;
125 static void heap_close (struct trunc_info *ti)
136 static RSET rset_trunc_r (ZebraHandle zi, const char *term, int length,
137 const char *flags, ISAMS_P *isam_p, int from, int to,
138 int merge_chunk, int preserve_position,
143 rset_temp_parms parms;
146 parms.cmp = key_compare_it;
147 parms.key_size = sizeof(struct it_key);
148 parms.temp_path = res_get (zi->res, "setTmpDir");
149 parms.rset_term = rset_term_create (term, length, flags, term_type);
150 result = rset_create (rset_kind_temp, &parms);
151 result_rsfd = rset_open (result, RSETF_WRITE);
153 if (to - from > merge_chunk)
158 int i, i_add = (to-from)/merge_chunk + 1;
159 struct trunc_info *ti;
161 int rsmax = (to-from)/i_add + 1;
163 rset = (RSET *) xmalloc (sizeof(*rset) * rsmax);
164 rsfd = (RSFD *) xmalloc (sizeof(*rsfd) * rsmax);
166 for (i = from; i < to; i += i_add)
169 rset[rscur] = rset_trunc_r (zi, term, length, flags,
171 merge_chunk, preserve_position,
174 rset[rscur] = rset_trunc_r (zi, term, length, flags,
176 merge_chunk, preserve_position,
180 ti = heap_init (rscur, sizeof(struct it_key), key_compare_it);
181 for (i = rscur; --i >= 0; )
183 rsfd[i] = rset_open (rset[i], RSETF_READ);
184 if (rset_read (rset[i], rsfd[i], ti->tmpbuf, &term_index))
185 heap_insert (ti, ti->tmpbuf, i);
188 rset_close (rset[i], rsfd[i]);
189 rset_delete (rset[i]);
194 int n = ti->indx[ti->ptr[1]];
196 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
201 if (!rset_read (rset[n], rsfd[n], ti->tmpbuf, &term_index))
204 rset_close (rset[n], rsfd[n]);
205 rset_delete (rset[n]);
208 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
211 heap_insert (ti, ti->tmpbuf, n);
220 else if (zi->reg->isamc)
224 struct trunc_info *ti;
226 ispt = (ISAMC_PP *) xmalloc (sizeof(*ispt) * (to-from));
228 ti = heap_init (to-from, sizeof(struct it_key),
230 for (i = to-from; --i >= 0; )
232 ispt[i] = isc_pp_open (zi->reg->isamc, isam_p[from+i]);
233 if (isc_pp_read (ispt[i], ti->tmpbuf))
234 heap_insert (ti, ti->tmpbuf, i);
236 isc_pp_close (ispt[i]);
240 int n = ti->indx[ti->ptr[1]];
242 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
244 if (preserve_position)
247 if (isc_pp_read (ispt[n], ti->tmpbuf))
248 heap_insert (ti, ti->tmpbuf, n);
250 isc_pp_close (ispt[n]);
256 if (!isc_pp_read (ispt[n], ti->tmpbuf))
259 isc_pp_close (ispt[n]);
262 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
265 heap_insert (ti, ti->tmpbuf, n);
274 else if (zi->reg->isams)
278 struct trunc_info *ti;
281 ispt = (ISAMS_PP *) xmalloc (sizeof(*ispt) * (to-from));
283 ti = heap_init (to-from, sizeof(struct it_key),
285 for (i = to-from; --i >= 0; )
287 ispt[i] = isams_pp_open (zi->reg->isams, isam_p[from+i]);
288 if (isams_pp_read (ispt[i], ti->tmpbuf))
289 heap_insert (ti, ti->tmpbuf, i);
291 isams_pp_close (ispt[i]);
295 int n = ti->indx[ti->ptr[1]];
297 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
301 if (!isams_pp_read (ispt[n], ti->tmpbuf))
304 isams_pp_close (ispt[n]);
307 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
310 heap_insert (ti, ti->tmpbuf, n);
318 else if (zi->reg->isamb)
322 struct trunc_info *ti;
324 ispt = (ISAMB_PP *) xmalloc (sizeof(*ispt) * (to-from));
326 ti = heap_init (to-from, sizeof(struct it_key),
328 for (i = to-from; --i >= 0; )
330 if (isam_p[from+i]) {
331 ispt[i] = isamb_pp_open (zi->reg->isamb, isam_p[from+i]);
332 if (isamb_pp_read (ispt[i], ti->tmpbuf))
333 heap_insert (ti, ti->tmpbuf, i);
335 isamb_pp_close (ispt[i]);
340 int n = ti->indx[ti->ptr[1]];
342 rset_write (result, result_rsfd, ti->heap[ti->ptr[1]]);
345 if (preserve_position)
348 if (isamb_pp_read (ispt[n], ti->tmpbuf))
349 heap_insert (ti, ti->tmpbuf, n);
351 isamb_pp_close (ispt[n]);
357 if (!isamb_pp_read (ispt[n], ti->tmpbuf))
360 isamb_pp_close (ispt[n]);
363 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
366 heap_insert (ti, ti->tmpbuf, n);
376 logf (LOG_WARN, "Unknown isam set in rset_trunc_r");
378 parms.rset_term->nn = nn;
379 rset_close (result, result_rsfd);
383 static int isams_trunc_cmp (const void *p1, const void *p2)
385 ISAMS_P i1 = *(ISAMS_P*) p1;
386 ISAMS_P i2 = *(ISAMS_P*) p2;
395 static int isamc_trunc_cmp (const void *p1, const void *p2)
397 ISAMC_P i1 = *(ISAMC_P*) p1;
398 ISAMC_P i2 = *(ISAMC_P*) p2;
401 d = (isc_type (i1) - isc_type (i2));
403 d = isc_block (i1) - isc_block (i2);
411 RSET rset_trunc (ZebraHandle zi, ISAMS_P *isam_p, int no,
412 const char *term, int length, const char *flags,
413 int preserve_position, int term_type)
415 logf (LOG_DEBUG, "rset_trunc no=%d", no);
418 rset_null_parms parms;
419 parms.rset_term = rset_term_create (term, length, flags, term_type);
420 return rset_create (rset_kind_null, &parms);
426 rset_isams_parms parms;
429 parms.is = zi->reg->isams;
430 parms.rset_term = rset_term_create (term, length, flags,
432 return rset_create (rset_kind_isams, &parms);
434 qsort (isam_p, no, sizeof(*isam_p), isams_trunc_cmp);
436 else if (zi->reg->isamc)
440 rset_isamc_parms parms;
442 parms.key_size = sizeof(struct it_key);
443 parms.cmp = key_compare_it;
445 parms.is = zi->reg->isamc;
446 parms.rset_term = rset_term_create (term, length, flags,
448 return rset_create (rset_kind_isamc, &parms);
453 rset_m_or_parms parms;
455 parms.key_size = sizeof(struct it_key);
456 parms.cmp = key_compare_it;
457 parms.isc = zi->reg->isamc;
458 parms.isam_positions = isam_p;
459 parms.no_isam_positions = no;
460 parms.no_save_positions = 100000;
461 parms.rset_term = rset_term_create (term, length, flags,
463 return rset_create (rset_kind_m_or, &parms);
466 qsort (isam_p, no, sizeof(*isam_p), isamc_trunc_cmp);
468 else if (zi->reg->isamb)
472 rset_isamb_parms parms;
473 parms.key_size = sizeof(struct it_key);
474 parms.cmp = key_compare_it;
476 parms.is = zi->reg->isamb;
477 parms.rset_term = rset_term_create (term, length, flags,
479 return rset_create (rset_kind_isamb, &parms);
482 else if (no <10000 ) /* FIXME - hardcoded number */
484 rset_multior_parms m_parms;
485 rset_isamb_parms b_parms;
487 m_parms.key_size = sizeof(struct it_key);
488 m_parms.cmp = key_compare_it;
490 m_parms.rsets=xmalloc(sizeof(*m_parms.rsets)*no);
491 m_parms.rset_term = rset_term_create (term, length, flags,
493 b_parms.key_size = sizeof(struct it_key);
494 b_parms.cmp = key_compare_it;
495 b_parms.is = zi->reg->isamb;
496 /* FIXME - make it so that we can pass a null ptr to term */
497 /* needs changes in all rsets, here and there! */
500 b_parms.pos = isam_p[i];
501 b_parms.rset_term = rset_term_create (term, length, flags,
503 m_parms.rsets[i]=rset_create (rset_kind_isamb, &b_parms);
505 return rset_create (rset_kind_multior, &m_parms);
506 } /* <10000 - rs_multior */
508 qsort (isam_p, no, sizeof(*isam_p), isamc_trunc_cmp);
512 logf (LOG_WARN, "Unknown isam set in rset_trunc");
513 return rset_create (rset_kind_null, NULL);
515 return rset_trunc_r (zi, term, length, flags, isam_p, 0, no, 100,
516 preserve_position, term_type);