1 /* $Id: rsprox.c,v 1.16 2004-09-09 10:08:06 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 void r_rewind (RSFD rfd);
39 static int r_forward(RSFD rfd, void *buf, const void *untilbuf);
40 static int r_read (RSFD rfd, void *buf);
41 static int r_write (RSFD rfd, const void *buf);
42 static void r_pos (RSFD rfd, double *current, double *total);
44 static const struct rset_control control =
57 const struct rset_control *rset_kind_prox = &control;
59 struct rset_prox_info {
60 RSET *rset; /* array of 'child' rsets */
61 int rset_no; /* how many of them */
68 struct rset_prox_rfd {
70 char **buf; /* lookahead key buffers */
71 char *more; /* more in each lookahead? */
76 RSET rsprox_create( NMEM nmem, const struct key_control *kcontrol, int scope,
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);
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;
97 static void r_delete (RSET ct)
99 struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
102 for (i = 0; i<info->rset_no; i++)
103 rset_delete (info->rset[i]);
107 static RSFD r_open (RSET ct, int flag)
109 struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
111 struct rset_prox_rfd *p;
114 if (flag & RSETF_WRITE)
116 logf (LOG_FATAL, "prox set type is read-only");
119 rfd = rfd_create_base(ct);
121 p=(struct rset_prox_rfd *)(rfd->priv);
123 p = (struct rset_prox_rfd *) nmem_malloc (ct->nmem,sizeof(*p));
125 p->more = nmem_malloc (ct->nmem,sizeof(*p->more) * info->rset_no);
126 p->buf = nmem_malloc(ct->nmem,sizeof(*p->buf) * info->rset_no);
127 for (i = 0; i < info->rset_no; i++)
128 p->buf[i] = nmem_malloc(ct->nmem,ct->keycontrol->key_size);
129 p->rfd = nmem_malloc(ct->nmem,sizeof(*p->rfd) * info->rset_no);
131 logf(LOG_DEBUG,"rsprox (%s) open [%p] n=%d",
132 ct->control->desc, rfd, info->rset_no);
134 for (i = 0; i < info->rset_no; i++) {
135 p->rfd[i] = rset_open (info->rset[i], RSETF_READ);
136 p->more[i] = rset_read (p->rfd[i], p->buf[i]);
142 static void r_close (RSFD rfd)
144 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
145 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
148 for (i = 0; i<info->rset_no; i++)
149 rset_close (p->rfd[i]);
150 rfd_delete_base(rfd);
153 static void r_rewind (RSFD rfd)
155 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
156 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
159 logf (LOG_DEBUG, "rsprox_rewind");
161 for (i = 0; i < info->rset_no; i++)
163 rset_rewind (p->rfd[i]);
164 p->more[i] = rset_read (p->rfd[i], p->buf[i]);
169 static int r_forward (RSFD rfd, void *buf, const void *untilbuf)
171 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
172 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
173 const struct key_control *kctrl=rfd->rset->keycontrol;
179 /* it is enough to forward first one. Other will follow. */
180 if ( p->more[0] && /* was: cmp >=2 */
181 ((kctrl->cmp)(untilbuf, p->buf[0]) >= rfd->rset->scope) )
182 p->more[0] = rset_forward(p->rfd[0], p->buf[0], untilbuf);
184 if (info->ordered && info->relation == 3 && info->exclusion == 0
185 && info->distance == 1)
189 for (i = 1; i < info->rset_no; i++)
193 p->more[0] = 0; /* saves us a goto out of while loop. */
196 cmp = (*kctrl->cmp) (p->buf[i], p->buf[i-1]);
197 if (cmp >= rfd->rset->scope ) /* cmp>1 */
199 p->more[i-1] = rset_forward (p->rfd[i-1],
204 else if ( cmp>0 ) /* cmp == 1*/
206 if ((*kctrl->getseq)(p->buf[i-1]) +1 !=
207 (*kctrl->getseq)(p->buf[i]))
208 { /* FIXME - We need more flexible multilevel stuff */
209 p->more[i-1] = rset_read ( p->rfd[i-1], p->buf[i-1]);
215 p->more[i] = rset_forward (p->rfd[i],
216 p->buf[i], p->buf[i-1]);
220 if (i == info->rset_no)
222 memcpy (buf, p->buf[0], kctrl->key_size);
223 p->more[0] = rset_read (p->rfd[0], p->buf[0]);
229 else if (info->rset_no == 2)
231 while (p->more[0] && p->more[1])
233 int cmp = (*kctrl->cmp)(p->buf[0], p->buf[1]);
234 if ( cmp <= - rfd->rset->scope) /* cmp<-1*/
235 p->more[0] = rset_forward (p->rfd[0],
236 p->buf[0], p->buf[1]);
237 else if ( cmp >= rfd->rset->scope ) /* cmp>1 */
238 p->more[1] = rset_forward (p->rfd[1],
239 p->buf[1], p->buf[0]);
242 zint seqno[500]; /* FIXME - why 500 ?? */
245 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
246 while ((p->more[0] = rset_read (p->rfd[0],
250 seqno[n++] = (*kctrl->getseq)(p->buf[0]);
252 for (i = 0; i<n; i++)
254 int diff = (*kctrl->getseq)(p->buf[1]) - seqno[i];
255 int excl = info->exclusion;
256 if (!info->ordered && diff < 0)
258 switch (info->relation)
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)
277 if (diff > info->distance && diff >= 0)
281 if (diff != info->distance && diff >= 0)
287 memcpy (buf, p->buf[1], kctrl->key_size);
289 p->more[1] = rset_read ( p->rfd[1], p->buf[1]);
294 p->more[1] = rset_read (p->rfd[1], p->buf[1]);
302 static int r_read (RSFD rfd, void *buf)
304 return r_forward(rfd, buf, 0);
307 static int r_write (RSFD rfd, const void *buf)
309 logf (LOG_FATAL, "prox set type is read-only");
313 static void r_pos (RSFD rfd, double *current, double *total)
315 struct rset_prox_info *info = (struct rset_prox_info *)(rfd->rset->priv);
316 struct rset_prox_rfd *p=(struct rset_prox_rfd *)(rfd->priv);
319 double scur=0,stot=0;
322 logf (LOG_DEBUG, "rsprox_pos");
324 for (i = 0; i < info->rset_no; i++)
326 rset_pos(p->rfd[i], &cur, &tot);
332 if (tot <0) { /* nothing found */
335 } else if (tot <1) { /* most likely tot==0 */
343 logf(LOG_DEBUG,"prox_pos: [%d] %0.1f/%0.1f= %0.4f ",
344 i,*current, *total, r);