1 /* $Id: rsprox.c,v 1.18 2004-10-15 10:07:34 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 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);
43 static const struct rset_control control =
55 const struct rset_control *rset_kind_prox = &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;
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]);
106 static RSFD r_open (RSET ct, int flag)
108 struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
110 struct rset_prox_rfd *p;
113 if (flag & RSETF_WRITE)
115 logf (LOG_FATAL, "prox set type is read-only");
118 rfd = rfd_create_base(ct);
120 p=(struct rset_prox_rfd *)(rfd->priv);
122 p = (struct rset_prox_rfd *) nmem_malloc (ct->nmem,sizeof(*p));
124 p->more = nmem_malloc (ct->nmem,sizeof(*p->more) * info->rset_no);
125 p->buf = nmem_malloc(ct->nmem,sizeof(*p->buf) * info->rset_no);
126 p->terms = nmem_malloc(ct->nmem,sizeof(*p->terms) * info->rset_no);
127 for (i = 0; i < info->rset_no; i++)
129 p->buf[i] = nmem_malloc(ct->nmem,ct->keycontrol->key_size);
132 p->rfd = nmem_malloc(ct->nmem,sizeof(*p->rfd) * info->rset_no);
134 logf(LOG_DEBUG,"rsprox (%s) open [%p] n=%d",
135 ct->control->desc, rfd, info->rset_no);
137 for (i = 0; i < info->rset_no; i++) {
138 p->rfd[i] = rset_open (info->rset[i], RSETF_READ);
139 p->more[i] = rset_read (p->rfd[i], p->buf[i], &p->terms[i]);
145 static void r_close (RSFD rfd)
147 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
148 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
151 for (i = 0; i<info->rset_no; i++)
152 rset_close (p->rfd[i]);
153 rfd_delete_base(rfd);
156 static int r_forward (RSFD rfd, void *buf, TERMID *term, const void *untilbuf)
158 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
159 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
160 const struct key_control *kctrl=rfd->rset->keycontrol;
166 /* it is enough to forward first one. Other will follow. */
167 if ( p->more[0] && /* was: cmp >=2 */
168 ((kctrl->cmp)(untilbuf, p->buf[0]) >= rfd->rset->scope) )
169 p->more[0] = rset_forward(p->rfd[0], p->buf[0],
170 &p->terms[0], untilbuf);
172 if (info->ordered && info->relation == 3 && info->exclusion == 0
173 && info->distance == 1)
177 for (i = 1; i < info->rset_no; i++)
181 p->more[0] = 0; /* saves us a goto out of while loop. */
184 cmp = (*kctrl->cmp) (p->buf[i], p->buf[i-1]);
185 if (cmp >= rfd->rset->scope ) /* cmp>1 */
187 p->more[i-1] = rset_forward (p->rfd[i-1],
193 else if ( cmp>0 ) /* cmp == 1*/
195 if ((*kctrl->getseq)(p->buf[i-1]) +1 !=
196 (*kctrl->getseq)(p->buf[i]))
197 { /* FIXME - We need more flexible multilevel stuff */
198 p->more[i-1] = rset_read ( p->rfd[i-1], p->buf[i-1],
205 p->more[i] = rset_forward (p->rfd[i],
206 p->buf[i], &p->terms[i], p->buf[i-1]);
210 if (i == info->rset_no)
212 memcpy (buf, p->buf[0], kctrl->key_size);
215 p->more[0] = rset_read (p->rfd[0], p->buf[0], &p->terms[i]);
221 else if (info->rset_no == 2)
223 while (p->more[0] && p->more[1])
225 int cmp = (*kctrl->cmp)(p->buf[0], p->buf[1]);
226 if ( cmp <= - rfd->rset->scope) /* cmp<-1*/
227 p->more[0] = rset_forward (p->rfd[0], p->buf[0],
228 &p->terms[0],p->buf[1]);
229 else if ( cmp >= rfd->rset->scope ) /* cmp>1 */
230 p->more[1] = rset_forward (p->rfd[1], p->buf[1],
231 &p->terms[1],p->buf[0]);
234 zint seqno[500]; /* FIXME - why 500 ?? */
237 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
238 while ((p->more[0] = rset_read (p->rfd[0],
239 p->buf[0], &p->terms[0])) >= -1 &&
242 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
244 for (i = 0; i<n; i++)
246 int diff = (*kctrl->getseq)(p->buf[1]) - seqno[i];
247 int excl = info->exclusion;
248 if (!info->ordered && diff < 0)
250 switch (info->relation)
253 if (diff < info->distance && diff >= 0)
257 if (diff <= info->distance && diff >= 0)
261 if (diff == info->distance && diff >= 0)
265 if (diff >= info->distance && diff >= 0)
269 if (diff > info->distance && diff >= 0)
273 if (diff != info->distance && diff >= 0)
279 memcpy (buf, p->buf[1], kctrl->key_size);
282 p->more[1] = rset_read ( p->rfd[1], p->buf[1],
288 p->more[1] = rset_read (p->rfd[1], p->buf[1],&p->terms[i]);
296 static int r_read (RSFD rfd, void *buf, TERMID *term)
298 return r_forward(rfd, buf, term, 0);
301 static int r_write (RSFD rfd, const void *buf)
303 logf (LOG_FATAL, "prox set type is read-only");
307 static void r_pos (RSFD rfd, double *current, double *total)
309 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
310 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
313 double scur=0,stot=0;
316 logf (LOG_DEBUG, "rsprox_pos");
318 for (i = 0; i < info->rset_no; i++)
320 rset_pos(p->rfd[i], &cur, &tot);
326 if (tot <0) { /* nothing found */
329 } else if (tot <1) { /* most likely tot==0 */
337 logf(LOG_DEBUG,"prox_pos: [%d] %0.1f/%0.1f= %0.4f ",
338 i,*current, *total, r);