1 /* $Id: trunc.c,v 1.42 2004-09-01 15:01:32 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
35 int (*cmp)(const void *p1, const void *p2);
42 static void heap_swap (struct trunc_info *ti, int i1, int i2)
47 ti->ptr[i1] = ti->ptr[i2];
51 static void heap_delete (struct trunc_info *ti)
53 int cur = 1, child = 2;
55 heap_swap (ti, 1, ti->heapnum--);
56 while (child <= ti->heapnum) {
57 if (child < ti->heapnum &&
58 (*ti->cmp)(ti->heap[ti->ptr[child]],
59 ti->heap[ti->ptr[1+child]]) > 0)
61 if ((*ti->cmp)(ti->heap[ti->ptr[cur]],
62 ti->heap[ti->ptr[child]]) > 0)
64 heap_swap (ti, cur, child);
73 static void heap_insert (struct trunc_info *ti, const char *buf, int indx)
77 cur = ++(ti->heapnum);
78 memcpy (ti->heap[ti->ptr[cur]], buf, ti->keysize);
79 ti->indx[ti->ptr[cur]] = indx;
81 while (parent && (*ti->cmp)(ti->heap[ti->ptr[parent]],
82 ti->heap[ti->ptr[cur]]) > 0)
84 heap_swap (ti, cur, parent);
90 static struct trunc_info *heap_init (int size, int key_size,
91 int (*cmp)(const void *p1,
94 struct trunc_info *ti = (struct trunc_info *) xmalloc (sizeof(*ti));
99 ti->keysize = key_size;
101 ti->indx = (int *) xmalloc (size * sizeof(*ti->indx));
102 ti->heap = (char **) xmalloc (size * sizeof(*ti->heap));
103 ti->ptr = (int *) xmalloc (size * sizeof(*ti->ptr));
104 ti->swapbuf = (char *) xmalloc (ti->keysize);
105 ti->tmpbuf = (char *) xmalloc (ti->keysize);
106 ti->buf = (char *) xmalloc (size * ti->keysize);
107 for (i = size; --i >= 0; )
110 ti->heap[i] = ti->buf + ti->keysize * i;
115 static void heap_close (struct trunc_info *ti)
126 static RSET rset_trunc_r (ZebraHandle zi, const char *term, int length,
127 const char *flags, ISAMS_P *isam_p, int from, int to,
128 int merge_chunk, int preserve_position,
129 int term_type, NMEM rset_nmem,
130 const struct key_control *kctrl)
137 rset_temp_parms parms;
138 parms.cmp = key_compare_it;
139 parms.key_size = sizeof(struct it_key);
140 parms.temp_path = res_get (zi->res, "setTmpDir");
141 result = rset_create (rset_kind_temp, &parms);
143 result=rstemp_create( rset_nmem,kctrl,
144 res_get (zi->res, "setTmpDir"));
145 result_rsfd = rset_open (result, RSETF_WRITE);
147 if (to - from > merge_chunk)
151 int i, i_add = (to-from)/merge_chunk + 1;
152 struct trunc_info *ti;
154 int rsmax = (to-from)/i_add + 1;
156 rset = (RSET *) xmalloc (sizeof(*rset) * rsmax);
157 rsfd = (RSFD *) xmalloc (sizeof(*rsfd) * rsmax);
159 for (i = from; i < to; i += i_add)
162 rset[rscur] = rset_trunc_r (zi, term, length, flags,
164 merge_chunk, preserve_position,
165 term_type, rset_nmem, kctrl);
167 rset[rscur] = rset_trunc_r (zi, term, length, flags,
169 merge_chunk, preserve_position,
170 term_type, rset_nmem, kctrl);
173 ti = heap_init (rscur, sizeof(struct it_key), key_compare_it);
174 for (i = rscur; --i >= 0; )
176 rsfd[i] = rset_open (rset[i], RSETF_READ);
177 if (rset_read(rsfd[i], ti->tmpbuf))
178 heap_insert (ti, ti->tmpbuf, i);
181 rset_close (rsfd[i]);
182 rset_delete (rset[i]);
187 int n = ti->indx[ti->ptr[1]];
189 rset_write (result_rsfd, ti->heap[ti->ptr[1]]);
194 if (!rset_read (rsfd[n], ti->tmpbuf))
197 rset_close (rsfd[n]);
198 rset_delete (rset[n]);
201 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
204 heap_insert (ti, ti->tmpbuf, n);
213 else if (zi->reg->isamc)
217 struct trunc_info *ti;
219 ispt = (ISAMC_PP *) xmalloc (sizeof(*ispt) * (to-from));
221 ti = heap_init (to-from, sizeof(struct it_key),
223 for (i = to-from; --i >= 0; )
225 ispt[i] = isc_pp_open (zi->reg->isamc, isam_p[from+i]);
226 if (isc_pp_read (ispt[i], ti->tmpbuf))
227 heap_insert (ti, ti->tmpbuf, i);
229 isc_pp_close (ispt[i]);
233 int n = ti->indx[ti->ptr[1]];
235 rset_write (result_rsfd, ti->heap[ti->ptr[1]]);
237 if (preserve_position)
240 if (isc_pp_read (ispt[n], ti->tmpbuf))
241 heap_insert (ti, ti->tmpbuf, n);
243 isc_pp_close (ispt[n]);
249 if (!isc_pp_read (ispt[n], ti->tmpbuf))
252 isc_pp_close (ispt[n]);
255 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
258 heap_insert (ti, ti->tmpbuf, n);
267 else if (zi->reg->isams)
271 struct trunc_info *ti;
274 ispt = (ISAMS_PP *) xmalloc (sizeof(*ispt) * (to-from));
276 ti = heap_init (to-from, sizeof(struct it_key),
278 for (i = to-from; --i >= 0; )
280 ispt[i] = isams_pp_open (zi->reg->isams, isam_p[from+i]);
281 if (isams_pp_read (ispt[i], ti->tmpbuf))
282 heap_insert (ti, ti->tmpbuf, i);
284 isams_pp_close (ispt[i]);
288 int n = ti->indx[ti->ptr[1]];
290 rset_write (result_rsfd, ti->heap[ti->ptr[1]]);
294 if (!isams_pp_read (ispt[n], ti->tmpbuf))
297 isams_pp_close (ispt[n]);
300 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
303 heap_insert (ti, ti->tmpbuf, n);
311 else if (zi->reg->isamb)
315 struct trunc_info *ti;
317 ispt = (ISAMB_PP *) xmalloc (sizeof(*ispt) * (to-from));
319 ti = heap_init (to-from, sizeof(struct it_key),
321 for (i = to-from; --i >= 0; )
323 if (isam_p[from+i]) {
324 ispt[i] = isamb_pp_open (zi->reg->isamb, isam_p[from+i]);
325 if (isamb_pp_read (ispt[i], ti->tmpbuf))
326 heap_insert (ti, ti->tmpbuf, i);
328 isamb_pp_close (ispt[i]);
333 int n = ti->indx[ti->ptr[1]];
335 rset_write (result_rsfd, ti->heap[ti->ptr[1]]);
338 if (preserve_position)
341 if (isamb_pp_read (ispt[n], ti->tmpbuf))
342 heap_insert (ti, ti->tmpbuf, n);
344 isamb_pp_close (ispt[n]);
350 if (!isamb_pp_read (ispt[n], ti->tmpbuf))
353 isamb_pp_close (ispt[n]);
356 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
359 heap_insert (ti, ti->tmpbuf, n);
369 logf (LOG_WARN, "Unknown isam set in rset_trunc_r");
371 rset_close (result_rsfd);
375 static int isams_trunc_cmp (const void *p1, const void *p2)
377 ISAMS_P i1 = *(ISAMS_P*) p1;
378 ISAMS_P i2 = *(ISAMS_P*) p2;
387 static int isamc_trunc_cmp (const void *p1, const void *p2)
389 ISAMC_P i1 = *(ISAMC_P*) p1;
390 ISAMC_P i2 = *(ISAMC_P*) p2;
393 d = (isc_type (i1) - isc_type (i2));
395 d = isc_block (i1) - isc_block (i2);
403 RSET rset_trunc (ZebraHandle zi, ISAMS_P *isam_p, int no,
404 const char *term, int length, const char *flags,
405 int preserve_position, int term_type, NMEM rset_nmem,
406 const struct key_control *kctrl)
408 logf (LOG_DEBUG, "rset_trunc no=%d", no);
410 return rsnull_create (rset_nmem,kctrl);
414 return rsisams_create(rset_nmem, kctrl,
415 zi->reg->isams, *isam_p);
416 qsort (isam_p, no, sizeof(*isam_p), isams_trunc_cmp);
418 else if (zi->reg->isamc)
421 return rsisamc_create(rset_nmem, kctrl,
422 zi->reg->isamc, *isam_p);
424 #if 0 /* NEW_TRUNC */ /* FIXME - Use the new multi_or instead !! */
427 rset_m_or_parms parms;
429 parms.key_size = sizeof(struct it_key);
430 parms.cmp = key_compare_it;
431 parms.isc = zi->reg->isamc;
432 parms.isam_positions = isam_p;
433 parms.no_isam_positions = no;
434 parms.no_save_positions = 100000;
435 return rset_create (rset_kind_m_or, &parms);
438 qsort (isam_p, no, sizeof(*isam_p), isamc_trunc_cmp);
440 else if (zi->reg->isamb)
443 return rsisamb_create(rset_nmem,kctrl,
444 zi->reg->isamb, *isam_p);
445 else if (no <10000 ) /* FIXME - hardcoded number */
448 RSET *rsets=xmalloc(no*sizeof(RSET)); /* use nmem! */
451 rsets[i]=rsisamb_create(rset_nmem, kctrl,
452 zi->reg->isamb, isam_p[i] );
453 r=rsmultior_create( rset_nmem, kctrl, no, rsets);
456 qsort (isam_p, no, sizeof(*isam_p), isamc_trunc_cmp);
460 logf (LOG_WARN, "Unknown isam set in rset_trunc");
461 return rsnull_create (rset_nmem, kctrl);
463 return rset_trunc_r (zi, term, length, flags, isam_p, 0, no, 100,
464 preserve_position, term_type, rset_nmem,kctrl);