1 /* $Id: rsprox.c,v 1.5.2.2 2006-08-14 10:39:20 adam 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 this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
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, int *term_index,
41 int (*cmpfunc)(const void *p1, const void *p2),
42 const void *untilbuf);
43 static int r_read (RSFD rfd, void *buf, int *term_index);
44 static int r_write (RSFD rfd, const void *buf);
46 static const struct rset_control control_prox =
60 const struct rset_control *rset_kind_prox = &control_prox;
62 struct rset_prox_info {
63 struct rset_prox_parms p;
65 struct rset_prox_rfd *rfd_list;
68 struct rset_prox_rfd {
70 char **buf; /* lookahead key buffers */
71 char *more; /* more in each lookahead? */
72 struct rset_prox_rfd *next;
73 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;
84 int length_prox_term = 0;
85 int min_nn = 10000000;
86 const char *flags = NULL;
90 info = (struct rset_prox_info *) xmalloc (sizeof(*info));
91 memcpy(&info->p, prox_parms, sizeof(struct rset_prox_parms));
92 assert(info->p.rset_no >= 2);
93 info->p.rset = xmalloc(info->p.rset_no * sizeof(*info->p.rset));
94 memcpy(info->p.rset, prox_parms->rset,
95 info->p.rset_no * sizeof(*info->p.rset));
96 info->rfd_list = NULL;
98 for (i = 0; i<info->p.rset_no; i++)
99 if (rset_is_volatile(info->p.rset[i]))
100 ct->flags |= RSET_FLAG_VOLATILE;
103 for (i = 0; i<info->p.rset_no; i++)
106 for (j = 0; j < info->p.rset[i]->no_rset_terms; j++)
108 const char *nflags = info->p.rset[i]->rset_terms[j]->flags;
109 char *term = info->p.rset[i]->rset_terms[j]->name;
110 int lterm = strlen(term);
111 if (lterm + length_prox_term < sizeof(prox_term)-1)
113 if (length_prox_term)
114 prox_term[length_prox_term++] = ' ';
115 strcpy (prox_term + length_prox_term, term);
116 length_prox_term += lterm;
118 if (min_nn > info->p.rset[i]->rset_terms[j]->nn)
119 min_nn = info->p.rset[i]->rset_terms[j]->nn;
121 term_type = info->p.rset[i]->rset_terms[j]->type;
125 ct->no_rset_terms = 1;
126 ct->rset_terms = (RSET_TERM *)
127 xmalloc (sizeof (*ct->rset_terms) * ct->no_rset_terms);
129 ct->rset_terms[0] = rset_term_create (prox_term, length_prox_term,
135 static RSFD r_open (RSET ct, int flag)
137 struct rset_prox_info *info = (struct rset_prox_info *) ct->buf;
138 struct rset_prox_rfd *rfd;
141 if (flag & RSETF_WRITE)
143 logf (LOG_FATAL, "prox set type is read-only");
146 rfd = (struct rset_prox_rfd *) xmalloc (sizeof(*rfd));
147 logf(LOG_DEBUG,"rsprox (%s) open [%p]", ct->control->desc, rfd);
148 rfd->next = info->rfd_list;
149 info->rfd_list = rfd;
152 rfd->more = xmalloc (sizeof(*rfd->more) * info->p.rset_no);
154 rfd->buf = xmalloc(sizeof(*rfd->buf) * info->p.rset_no);
155 for (i = 0; i < info->p.rset_no; i++)
156 rfd->buf[i] = xmalloc (info->p.key_size);
158 rfd->rfd = xmalloc(sizeof(*rfd->rfd) * info->p.rset_no);
159 for (i = 0; i < info->p.rset_no; i++)
160 rfd->rfd[i] = rset_open (info->p.rset[i], RSETF_READ);
162 for (i = 0; i < info->p.rset_no; i++)
163 rfd->more[i] = rset_read (info->p.rset[i], rfd->rfd[i],
164 rfd->buf[i], &dummy);
166 rfd->countp = &ct->rset_terms[0]->count;
167 rfd->pbuf = xmalloc (info->p.key_size);
171 static void r_close (RSFD rfd)
173 struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
174 struct rset_prox_rfd **rfdp;
176 for (rfdp = &info->rfd_list; *rfdp; rfdp = &(*rfdp)->next)
180 for (i = 0; i<info->p.rset_no; i++)
181 xfree ((*rfdp)->buf[i]);
182 xfree ((*rfdp)->buf);
183 xfree ((*rfdp)->more);
185 xfree ((*rfdp)->pbuf);
187 for (i = 0; i<info->p.rset_no; i++)
188 rset_close (info->p.rset[i], (*rfdp)->rfd[i]);
189 xfree ((*rfdp)->rfd);
191 *rfdp = (*rfdp)->next;
195 logf (LOG_FATAL, "r_close but no rfd match!");
199 static void r_delete (RSET ct)
201 struct rset_prox_info *info = (struct rset_prox_info *) ct->buf;
204 assert (info->rfd_list == NULL);
205 rset_term_destroy(ct->rset_terms[0]);
206 xfree (ct->rset_terms);
207 for (i = 0; i<info->p.rset_no; i++)
208 rset_delete (info->p.rset[i]);
209 xfree (info->p.rset);
213 static void r_rewind (RSFD rfd)
215 struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
216 struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
219 logf (LOG_DEBUG, "rsprox_rewind");
221 for (i = 0; i < info->p.rset_no; i++)
223 rset_rewind (info->p.rset[i], p->rfd[i]);
224 p->more[i] = rset_read (info->p.rset[i], p->rfd[i], p->buf[i], &dummy);
228 static int r_forward (RSET ct, RSFD rfd, void *buf, int *term_index,
229 int (*cmpfunc)(const void *p1, const void *p2),
230 const void *untilbuf)
232 /* Note: CT is not used. We _can_ pass NULL for it */
233 struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
234 struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
241 /* it's enough to forward first one. Other will follow
243 if ( p->more[0] && ((cmpfunc)(untilbuf, p->buf[0]) >= 2) )
244 p->more[0] = rset_forward(info->p.rset[0], p->rfd[0],
245 p->buf[0], &dummy, info->p.cmp,
248 if (info->p.ordered && info->p.relation == 3 && info->p.exclusion == 0
249 && info->p.distance == 1)
253 for (i = 1; i < info->p.rset_no; i++)
257 p->more[0] = 0; /* saves us a goto out of while loop. */
260 cmp = (*info->p.cmp) (p->buf[i], p->buf[i-1]);
263 p->more[i-1] = rset_forward (info->p.rset[i-1],
272 if ((*info->p.getseq)(p->buf[i-1]) +1 !=
273 (*info->p.getseq)(p->buf[i]))
275 p->more[i-1] = rset_read (
276 info->p.rset[i-1], p->rfd[i-1],
277 p->buf[i-1], &dummy);
283 p->more[i] = rset_forward (info->p.rset[i], p->rfd[i],
290 if (i == p->info->p.rset_no)
292 memcpy (buf, p->buf[0], info->p.key_size);
295 p->more[0] = rset_read (info->p.rset[0], p->rfd[0],
299 *p->countp == 0 || (*info->p.cmp)(buf, p->pbuf) > 1))
301 memcpy (p->pbuf, buf, info->p.key_size);
308 else if (info->p.rset_no == 2)
310 while (p->more[0] && p->more[1])
312 int cmp = (*info->p.cmp)(p->buf[0], p->buf[1]);
314 p->more[0] = rset_forward (info->p.rset[0], p->rfd[0],
316 term_index, info->p.cmp, p->buf[0]);
318 p->more[1] = rset_forward (info->p.rset[1], p->rfd[1],
320 term_index, info->p.cmp, p->buf[1]);
326 seqno[n++] = (*info->p.getseq)(p->buf[0]);
327 while ((p->more[0] = rset_read (info->p.rset[0], p->rfd[0],
329 term_index)) >= -1 &&
332 seqno[n++] = (*info->p.getseq)(p->buf[0]);
334 for (i = 0; i<n; i++)
336 int diff = (*info->p.getseq)(p->buf[1]) - seqno[i];
337 int excl = info->p.exclusion;
338 if (!info->p.ordered && diff < 0)
340 switch (info->p.relation)
343 if (diff < info->p.distance && diff >= 0)
347 if (diff <= info->p.distance && diff >= 0)
351 if (diff == info->p.distance && diff >= 0)
355 if (diff >= info->p.distance && diff >= 0)
359 if (diff > info->p.distance && diff >= 0)
363 if (diff != info->p.distance && diff >= 0)
369 memcpy (buf, p->buf[1], info->p.key_size);
372 p->more[1] = rset_read (info->p.rset[1],
373 p->rfd[1], p->buf[1],
378 p->more[1] = rset_read (info->p.rset[1], p->rfd[1],
388 static int r_read (RSFD rfd, void *buf, int *term_index)
390 return r_forward(0, rfd, buf, term_index, 0, 0);
393 static int r_write (RSFD rfd, const void *buf)
395 logf (LOG_FATAL, "prox set type is read-only");