1 /* $Id: rsprox.c,v 1.9 2004-08-20 14:44:46 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 void *r_create(RSET ct, const struct rset_control *sel, void *parms);
36 static RSFD r_open (RSET ct, int flag);
37 static void r_close (RSFD rfd);
38 static void r_delete (RSET ct);
39 static void r_rewind (RSFD rfd);
40 static int r_forward(RSET ct, RSFD rfd, void *buf,
41 int (*cmpfunc)(const void *p1, const void *p2),
42 const void *untilbuf);
43 static int r_read (RSFD rfd, void *buf);
44 static int r_write (RSFD rfd, const void *buf);
45 static void r_pos (RSFD rfd, double *current, double *total);
47 static const struct rset_control control_prox =
61 const struct rset_control *rset_kind_prox = &control_prox;
63 struct rset_prox_info {
64 struct rset_prox_parms p;
66 struct rset_prox_rfd *rfd_list;
69 struct rset_prox_rfd {
71 char **buf; /* lookahead key buffers */
72 char *more; /* more in each lookahead? */
73 struct rset_prox_rfd *next;
74 struct rset_prox_info *info;
78 static void *r_create (RSET ct, const struct rset_control *sel, void *parms)
80 rset_prox_parms *prox_parms = (rset_prox_parms *) parms;
81 struct rset_prox_info *info;
85 int length_prox_term = 0;
86 zint min_nn = 10000000;
87 const char *flags = NULL;
91 info = (struct rset_prox_info *) xmalloc (sizeof(*info));
92 memcpy(&info->p, prox_parms, sizeof(struct rset_prox_parms));
93 assert(info->p.rset_no >= 2);
94 info->p.rset = xmalloc(info->p.rset_no * sizeof(*info->p.rset));
95 memcpy(info->p.rset, prox_parms->rset,
96 info->p.rset_no * sizeof(*info->p.rset));
97 info->rfd_list = NULL;
99 for (i = 0; i<info->p.rset_no; i++)
100 if (rset_is_volatile(info->p.rset[i]))
101 ct->flags |= RSET_FLAG_VOLATILE;
103 #if 0 /* This should all be about terms! */
105 for (i = 0; i<info->p.rset_no; i++)
108 for (j = 0; j < info->p.rset[i]->no_rset_terms; j++)
110 const char *nflags = info->p.rset[i]->rset_terms[j]->flags;
111 char *term = info->p.rset[i]->rset_terms[j]->name;
112 int lterm = strlen(term);
113 if (lterm + length_prox_term < sizeof(prox_term)-1)
115 if (length_prox_term)
116 prox_term[length_prox_term++] = ' ';
117 strcpy (prox_term + length_prox_term, term);
118 length_prox_term += lterm;
120 if (min_nn > info->p.rset[i]->rset_terms[j]->nn)
121 min_nn = info->p.rset[i]->rset_terms[j]->nn;
123 term_type = info->p.rset[i]->rset_terms[j]->type;
130 static RSFD r_open (RSET ct, int flag)
132 struct rset_prox_info *info = (struct rset_prox_info *) ct->buf;
133 struct rset_prox_rfd *rfd;
136 if (flag & RSETF_WRITE)
138 logf (LOG_FATAL, "prox set type is read-only");
141 rfd = (struct rset_prox_rfd *) xmalloc (sizeof(*rfd));
142 logf(LOG_DEBUG,"rsprox (%s) open [%p]", ct->control->desc, rfd);
143 rfd->next = info->rfd_list;
144 info->rfd_list = rfd;
147 rfd->more = xmalloc (sizeof(*rfd->more) * info->p.rset_no);
149 rfd->buf = xmalloc(sizeof(*rfd->buf) * info->p.rset_no);
150 for (i = 0; i < info->p.rset_no; i++)
151 rfd->buf[i] = xmalloc (info->p.key_size);
153 rfd->rfd = xmalloc(sizeof(*rfd->rfd) * info->p.rset_no);
154 for (i = 0; i < info->p.rset_no; i++)
155 rfd->rfd[i] = rset_open (info->p.rset[i], RSETF_READ);
157 for (i = 0; i < info->p.rset_no; i++)
158 rfd->more[i] = rset_read (info->p.rset[i], rfd->rfd[i],
164 static void r_close (RSFD rfd)
166 struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
167 struct rset_prox_rfd **rfdp;
169 for (rfdp = &info->rfd_list; *rfdp; rfdp = &(*rfdp)->next)
173 for (i = 0; i<info->p.rset_no; i++)
174 xfree ((*rfdp)->buf[i]);
175 xfree ((*rfdp)->buf);
176 xfree ((*rfdp)->more);
178 for (i = 0; i<info->p.rset_no; i++)
179 rset_close (info->p.rset[i], (*rfdp)->rfd[i]);
180 xfree ((*rfdp)->rfd);
182 *rfdp = (*rfdp)->next;
186 logf (LOG_FATAL, "r_close but no rfd match!");
190 static void r_delete (RSET ct)
192 struct rset_prox_info *info = (struct rset_prox_info *) ct->buf;
195 assert (info->rfd_list == NULL);
196 for (i = 0; i<info->p.rset_no; i++)
197 rset_delete (info->p.rset[i]);
198 xfree (info->p.rset);
202 static void r_rewind (RSFD rfd)
204 struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
205 struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
208 logf (LOG_DEBUG, "rsprox_rewind");
210 for (i = 0; i < info->p.rset_no; i++)
212 rset_rewind (info->p.rset[i], p->rfd[i]);
213 p->more[i] = rset_read (info->p.rset[i], p->rfd[i], p->buf[i]);
218 static int r_forward (RSET ct, RSFD rfd, void *buf,
219 int (*cmpfunc)(const void *p1, const void *p2),
220 const void *untilbuf)
222 /* Note: CT is not used. We _can_ pass NULL for it */
223 struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
224 struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
230 /* it's enough to forward first one. Other will follow
232 if ( p->more[0] && ((cmpfunc)(untilbuf, p->buf[0]) >= 2) )
233 p->more[0] = rset_forward(info->p.rset[0], p->rfd[0],
234 p->buf[0], info->p.cmp,
237 if (info->p.ordered && info->p.relation == 3 && info->p.exclusion == 0
238 && info->p.distance == 1)
242 for (i = 1; i < info->p.rset_no; i++)
246 p->more[0] = 0; /* saves us a goto out of while loop. */
249 cmp = (*info->p.cmp) (p->buf[i], p->buf[i-1]);
252 p->more[i-1] = rset_forward (info->p.rset[i-1],
261 if ((*info->p.getseq)(p->buf[i-1]) +1 !=
262 (*info->p.getseq)(p->buf[i]))
264 p->more[i-1] = rset_read ( info->p.rset[i-1],
265 p->rfd[i-1], p->buf[i-1]);
271 p->more[i] = rset_forward (info->p.rset[i], p->rfd[i],
272 p->buf[i], info->p.cmp,
277 if (i == p->info->p.rset_no)
279 memcpy (buf, p->buf[0], info->p.key_size);
280 p->more[0] = rset_read (info->p.rset[0], p->rfd[0], p->buf[0]);
286 else if (info->p.rset_no == 2)
288 while (p->more[0] && p->more[1])
290 int cmp = (*info->p.cmp)(p->buf[0], p->buf[1]);
292 p->more[0] = rset_forward (info->p.rset[0], p->rfd[0],
293 p->buf[0], info->p.cmp, p->buf[0]);
295 p->more[1] = rset_forward (info->p.rset[1], p->rfd[1],
296 p->buf[1], info->p.cmp, p->buf[1]);
302 seqno[n++] = (*info->p.getseq)(p->buf[0]);
303 while ((p->more[0] = rset_read (info->p.rset[0], p->rfd[0],
307 seqno[n++] = (*info->p.getseq)(p->buf[0]);
309 for (i = 0; i<n; i++)
311 int diff = (*info->p.getseq)(p->buf[1]) - seqno[i];
312 int excl = info->p.exclusion;
313 if (!info->p.ordered && diff < 0)
315 switch (info->p.relation)
318 if (diff < info->p.distance && diff >= 0)
322 if (diff <= info->p.distance && diff >= 0)
326 if (diff == info->p.distance && diff >= 0)
330 if (diff >= info->p.distance && diff >= 0)
334 if (diff > info->p.distance && diff >= 0)
338 if (diff != info->p.distance && diff >= 0)
344 memcpy (buf, p->buf[1], info->p.key_size);
346 p->more[1] = rset_read (info->p.rset[1],
347 p->rfd[1], p->buf[1]);
352 p->more[1] = rset_read (info->p.rset[1], p->rfd[1],
361 static int r_read (RSFD rfd, void *buf)
363 { double cur,tot; r_pos(rfd,&cur,&tot); } /*!*/
364 return r_forward(0, rfd, buf, 0, 0);
367 static int r_write (RSFD rfd, const void *buf)
369 logf (LOG_FATAL, "prox set type is read-only");
373 static void r_pos (RSFD rfd, double *current, double *total)
375 struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
376 struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
379 double scur=0,stot=0;
382 logf (LOG_DEBUG, "rsprox_pos");
384 for (i = 0; i < info->p.rset_no; i++)
386 rset_pos(info->p.rset[i], p->rfd[i], &cur, &tot);
392 if (tot <0) { /* nothing found */
395 } else if (tot <1) { /* most likely tot==0 */
403 logf(LOG_DEBUG,"prox_pos: [%d] %0.1f/%0.1f= %0.4f ",
404 i,*current, *total, r);