1 /* $Id: rsprox.c,v 1.28 2005-05-03 09:11:36 adam Exp $
2 Copyright (C) 1995-2005
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
28 #include <idzebra/util.h>
35 static RSFD r_open (RSET ct, int flag);
36 static void r_close (RSFD rfd);
37 static void r_delete (RSET ct);
38 static int r_forward(RSFD rfd, void *buf, TERMID *term, const void *untilbuf);
39 static int r_read (RSFD rfd, void *buf, TERMID *term);
40 static int r_write (RSFD rfd, const void *buf);
41 static void r_pos (RSFD rfd, double *current, double *total);
42 static void r_get_terms(RSET ct, TERMID *terms, int maxterms, int *curterm);
44 static const struct rset_control control =
57 struct rset_prox_info {
58 RSET *rset; /* array of 'child' rsets */
59 int rset_no; /* how many of them */
66 struct rset_prox_rfd {
68 char **buf; /* lookahead key buffers */
69 char *more; /* more in each lookahead? */
70 TERMID *terms; /* lookahead terms */
75 RSET rsprox_create(NMEM nmem, struct rset_key_control *kcontrol,
77 int rset_no, RSET *rset,
78 int ordered, int exclusion,
79 int relation, int distance)
81 RSET rnew = rset_create_base(&control, nmem, kcontrol, scope,0);
82 struct rset_prox_info *info;
83 info = (struct rset_prox_info *) nmem_malloc(rnew->nmem,sizeof(*info));
84 info->rset = nmem_malloc(rnew->nmem,rset_no * sizeof(*info->rset));
85 memcpy(info->rset, rset,
86 rset_no * sizeof(*info->rset));
87 info->rset_no = rset_no;
88 info->ordered = ordered;
89 info->exclusion = exclusion;
90 info->relation = relation;
91 info->distance = distance;
96 static void r_delete (RSET ct)
98 struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
101 for (i = 0; i<info->rset_no; i++)
102 rset_delete(info->rset[i]);
105 static RSFD r_open (RSET ct, int flag)
107 struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
109 struct rset_prox_rfd *p;
112 if (flag & RSETF_WRITE)
114 yaz_log(YLOG_FATAL, "prox set type is read-only");
117 rfd = rfd_create_base(ct);
119 p=(struct rset_prox_rfd *)(rfd->priv);
121 p = (struct rset_prox_rfd *) nmem_malloc(ct->nmem,sizeof(*p));
123 p->more = nmem_malloc (ct->nmem,sizeof(*p->more) * info->rset_no);
124 p->buf = nmem_malloc(ct->nmem,sizeof(*p->buf) * info->rset_no);
125 p->terms = nmem_malloc(ct->nmem,sizeof(*p->terms) * info->rset_no);
126 for (i = 0; i < info->rset_no; i++)
128 p->buf[i] = nmem_malloc(ct->nmem,ct->keycontrol->key_size);
131 p->rfd = nmem_malloc(ct->nmem,sizeof(*p->rfd) * info->rset_no);
133 yaz_log(YLOG_DEBUG,"rsprox (%s) open [%p] n=%d",
134 ct->control->desc, rfd, info->rset_no);
136 for (i = 0; i < info->rset_no; i++) {
137 p->rfd[i] = rset_open (info->rset[i], RSETF_READ);
138 p->more[i] = rset_read (p->rfd[i], p->buf[i], &p->terms[i]);
144 static void r_close (RSFD rfd)
146 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
147 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
150 for (i = 0; i<info->rset_no; i++)
151 rset_close (p->rfd[i]);
152 rfd_delete_base(rfd);
155 static int r_forward(RSFD rfd, void *buf, TERMID *term, const void *untilbuf)
157 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
158 struct rset_prox_rfd *p = (struct rset_prox_rfd *)(rfd->priv);
159 const struct rset_key_control *kctrl = rfd->rset->keycontrol;
165 /* it is enough to forward first one. Other will follow. */
166 if ( p->more[0] && /* was: cmp >=2 */
167 ((kctrl->cmp)(untilbuf, p->buf[0]) >= rfd->rset->scope) )
168 p->more[0] = rset_forward(p->rfd[0], p->buf[0],
169 &p->terms[0], untilbuf);
171 if (info->ordered && info->relation == 3 && info->exclusion == 0
172 && info->distance == 1)
176 for (i = 1; i < info->rset_no; i++)
180 p->more[0] = 0; /* saves us a goto out of while loop. */
183 cmp = (*kctrl->cmp) (p->buf[i], p->buf[i-1]);
184 if (cmp >= rfd->rset->scope ) /* cmp>1 */
186 p->more[i-1] = rset_forward (p->rfd[i-1],
192 else if ( cmp>0 ) /* cmp == 1*/
194 if ((*kctrl->getseq)(p->buf[i-1]) +1 !=
195 (*kctrl->getseq)(p->buf[i]))
196 { /* FIXME - We need more flexible multilevel stuff */
197 p->more[i-1] = rset_read ( p->rfd[i-1], p->buf[i-1],
204 p->more[i] = rset_forward (p->rfd[i],
205 p->buf[i], &p->terms[i], p->buf[i-1]);
209 if (i == info->rset_no)
211 memcpy (buf, p->buf[0], kctrl->key_size);
214 p->more[0] = rset_read (p->rfd[0], p->buf[0], &p->terms[0]);
220 else if (info->rset_no == 2)
222 while (p->more[0] && p->more[1])
224 int cmp = (*kctrl->cmp)(p->buf[0], p->buf[1]);
225 if ( cmp <= - rfd->rset->scope) /* cmp<-1*/
226 p->more[0] = rset_forward (p->rfd[0], p->buf[0],
227 &p->terms[0],p->buf[1]);
228 else if ( cmp >= rfd->rset->scope ) /* cmp>1 */
229 p->more[1] = rset_forward (p->rfd[1], p->buf[1],
230 &p->terms[1],p->buf[0]);
233 zint seqno[500]; /* FIXME - why 500 ?? */
236 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
237 while ((p->more[0] = rset_read (p->rfd[0],
238 p->buf[0], &p->terms[0])) >= -1 &&
241 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
243 for (i = 0; i<n; i++)
245 zint diff = (*kctrl->getseq)(p->buf[1]) - seqno[i];
246 int excl = info->exclusion;
247 if (!info->ordered && diff < 0)
249 switch (info->relation)
252 if (diff < info->distance && diff >= 0)
256 if (diff <= info->distance && diff >= 0)
260 if (diff == info->distance && diff >= 0)
264 if (diff >= info->distance && diff >= 0)
268 if (diff > info->distance && diff >= 0)
272 if (diff != info->distance && diff >= 0)
278 memcpy (buf, p->buf[1], kctrl->key_size);
281 p->more[1] = rset_read ( p->rfd[1], p->buf[1],
287 p->more[1] = rset_read (p->rfd[1], p->buf[1], &p->terms[1]);
295 static int r_read (RSFD rfd, void *buf, TERMID *term)
297 return r_forward(rfd, buf, term, 0);
300 static int r_write (RSFD rfd, const void *buf)
302 yaz_log(YLOG_FATAL, "prox set type is read-only");
306 static void r_pos (RSFD rfd, double *current, double *total)
308 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
309 struct rset_prox_rfd *p = (struct rset_prox_rfd *)(rfd->priv);
312 double cur, tot = -1.0;
313 double scur = 0.0, stot = 0.0;
315 yaz_log(YLOG_DEBUG, "rsprox_pos");
317 for (i = 0; i < info->rset_no; i++)
319 rset_pos(p->rfd[i], &cur, &tot);
325 if (tot <0) { /* nothing found */
328 } else if (tot < 1) { /* most likely tot==0 */
333 *current = (double) p->hits;
336 yaz_log(YLOG_DEBUG,"prox_pos: [%d] %0.1f/%0.1f= %0.4f ",
337 i,*current, *total, r);
342 static void r_get_terms(RSET ct, TERMID *terms, int maxterms, int *curterm)
344 struct rset_prox_info *info =
345 (struct rset_prox_info *) ct->priv;
347 for (i = 0; i<info->rset_no; i++)
348 rset_getterms(info->rset[i], terms, maxterms, curterm);