1 /* $Id: rsprox.c,v 1.27 2005-04-26 10:09:38 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, const struct key_control *kcontrol, int scope,
76 int rset_no, RSET *rset,
77 int ordered, int exclusion,
78 int relation, int distance)
80 RSET rnew = rset_create_base(&control, nmem, kcontrol, scope,0);
81 struct rset_prox_info *info;
82 info = (struct rset_prox_info *) nmem_malloc(rnew->nmem,sizeof(*info));
83 info->rset = nmem_malloc(rnew->nmem,rset_no * sizeof(*info->rset));
84 memcpy(info->rset, rset,
85 rset_no * sizeof(*info->rset));
86 info->rset_no = rset_no;
87 info->ordered = ordered;
88 info->exclusion = exclusion;
89 info->relation = relation;
90 info->distance = distance;
95 static void r_delete (RSET ct)
97 struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
100 for (i = 0; i<info->rset_no; i++)
101 rset_delete(info->rset[i]);
104 static RSFD r_open (RSET ct, int flag)
106 struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
108 struct rset_prox_rfd *p;
111 if (flag & RSETF_WRITE)
113 yaz_log(YLOG_FATAL, "prox set type is read-only");
116 rfd = rfd_create_base(ct);
118 p=(struct rset_prox_rfd *)(rfd->priv);
120 p = (struct rset_prox_rfd *) nmem_malloc(ct->nmem,sizeof(*p));
122 p->more = nmem_malloc (ct->nmem,sizeof(*p->more) * info->rset_no);
123 p->buf = nmem_malloc(ct->nmem,sizeof(*p->buf) * info->rset_no);
124 p->terms = nmem_malloc(ct->nmem,sizeof(*p->terms) * info->rset_no);
125 for (i = 0; i < info->rset_no; i++)
127 p->buf[i] = nmem_malloc(ct->nmem,ct->keycontrol->key_size);
130 p->rfd = nmem_malloc(ct->nmem,sizeof(*p->rfd) * info->rset_no);
132 yaz_log(YLOG_DEBUG,"rsprox (%s) open [%p] n=%d",
133 ct->control->desc, rfd, info->rset_no);
135 for (i = 0; i < info->rset_no; i++) {
136 p->rfd[i] = rset_open (info->rset[i], RSETF_READ);
137 p->more[i] = rset_read (p->rfd[i], p->buf[i], &p->terms[i]);
143 static void r_close (RSFD rfd)
145 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
146 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
149 for (i = 0; i<info->rset_no; i++)
150 rset_close (p->rfd[i]);
151 rfd_delete_base(rfd);
154 static int r_forward (RSFD rfd, void *buf, TERMID *term, const void *untilbuf)
156 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
157 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
158 const struct key_control *kctrl = rfd->rset->keycontrol;
164 /* it is enough to forward first one. Other will follow. */
165 if ( p->more[0] && /* was: cmp >=2 */
166 ((kctrl->cmp)(untilbuf, p->buf[0]) >= rfd->rset->scope) )
167 p->more[0] = rset_forward(p->rfd[0], p->buf[0],
168 &p->terms[0], untilbuf);
170 if (info->ordered && info->relation == 3 && info->exclusion == 0
171 && info->distance == 1)
175 for (i = 1; i < info->rset_no; i++)
179 p->more[0] = 0; /* saves us a goto out of while loop. */
182 cmp = (*kctrl->cmp) (p->buf[i], p->buf[i-1]);
183 if (cmp >= rfd->rset->scope ) /* cmp>1 */
185 p->more[i-1] = rset_forward (p->rfd[i-1],
191 else if ( cmp>0 ) /* cmp == 1*/
193 if ((*kctrl->getseq)(p->buf[i-1]) +1 !=
194 (*kctrl->getseq)(p->buf[i]))
195 { /* FIXME - We need more flexible multilevel stuff */
196 p->more[i-1] = rset_read ( p->rfd[i-1], p->buf[i-1],
203 p->more[i] = rset_forward (p->rfd[i],
204 p->buf[i], &p->terms[i], p->buf[i-1]);
208 if (i == info->rset_no)
210 memcpy (buf, p->buf[0], kctrl->key_size);
213 p->more[0] = rset_read (p->rfd[0], p->buf[0], &p->terms[0]);
219 else if (info->rset_no == 2)
221 while (p->more[0] && p->more[1])
223 int cmp = (*kctrl->cmp)(p->buf[0], p->buf[1]);
224 if ( cmp <= - rfd->rset->scope) /* cmp<-1*/
225 p->more[0] = rset_forward (p->rfd[0], p->buf[0],
226 &p->terms[0],p->buf[1]);
227 else if ( cmp >= rfd->rset->scope ) /* cmp>1 */
228 p->more[1] = rset_forward (p->rfd[1], p->buf[1],
229 &p->terms[1],p->buf[0]);
232 zint seqno[500]; /* FIXME - why 500 ?? */
235 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
236 while ((p->more[0] = rset_read (p->rfd[0],
237 p->buf[0], &p->terms[0])) >= -1 &&
240 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
242 for (i = 0; i<n; i++)
244 zint diff = (*kctrl->getseq)(p->buf[1]) - seqno[i];
245 int excl = info->exclusion;
246 if (!info->ordered && diff < 0)
248 switch (info->relation)
251 if (diff < info->distance && diff >= 0)
255 if (diff <= info->distance && diff >= 0)
259 if (diff == info->distance && diff >= 0)
263 if (diff >= info->distance && diff >= 0)
267 if (diff > info->distance && diff >= 0)
271 if (diff != info->distance && diff >= 0)
277 memcpy (buf, p->buf[1], kctrl->key_size);
280 p->more[1] = rset_read ( p->rfd[1], p->buf[1],
286 p->more[1] = rset_read (p->rfd[1], p->buf[1], &p->terms[1]);
294 static int r_read (RSFD rfd, void *buf, TERMID *term)
296 return r_forward(rfd, buf, term, 0);
299 static int r_write (RSFD rfd, const void *buf)
301 yaz_log(YLOG_FATAL, "prox set type is read-only");
305 static void r_pos (RSFD rfd, double *current, double *total)
307 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
308 struct rset_prox_rfd *p = (struct rset_prox_rfd *)(rfd->priv);
311 double cur, tot = -1.0;
312 double scur = 0.0, stot = 0.0;
314 yaz_log(YLOG_DEBUG, "rsprox_pos");
316 for (i = 0; i < info->rset_no; i++)
318 rset_pos(p->rfd[i], &cur, &tot);
324 if (tot <0) { /* nothing found */
327 } else if (tot < 1) { /* most likely tot==0 */
332 *current = (double) p->hits;
335 yaz_log(YLOG_DEBUG,"prox_pos: [%d] %0.1f/%0.1f= %0.4f ",
336 i,*current, *total, r);
341 static void r_get_terms(RSET ct, TERMID *terms, int maxterms, int *curterm)
343 struct rset_prox_info *info =
344 (struct rset_prox_info *) ct->priv;
346 for (i = 0; i<info->rset_no; i++)
347 rset_getterms(info->rset[i], terms, maxterms, curterm);