1 /* $Id: rsmultior.c,v 1.5 2004-08-23 12:38:53 heikki Exp $
2 Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002
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
33 #include <rsmultior.h>
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_read (RSFD rfd, void *buf);
41 static int r_write (RSFD rfd, const void *buf);
42 static int r_forward(RSET ct, RSFD rfd, void *buf,
43 int (*cmpfunc)(const void *p1, const void *p2),
44 const void *untilbuf);
45 static void r_pos (RSFD rfd, double *current, double *total);
47 static const struct rset_control control =
61 const struct rset_control *rset_kind_multior = &control;
63 /* The heap structure:
64 * The rset contains a list or rsets we are ORing together
65 * The rfd contains a heap of heap-items, which contain
66 * a rfd opened to those rsets, and a buffer for one key.
67 * They also contain a ptr to the rset list in the rset
68 * itself, for practical reasons.
81 int (*cmp)(const void *p1, const void *p2);
82 struct heap_item **heap; /* ptrs to the rfd */
84 typedef struct heap *HEAP;
87 struct rset_multior_info {
90 int (*cmp)(const void *p1, const void *p2);
93 struct rset_multior_rfd *rfd_list;
97 struct rset_multior_rfd {
99 struct heap_item *items; /* we alloc and free them here */
101 struct rset_multior_rfd *next;
102 struct rset_multior_info *info;
103 zint hits; /* returned so far */
104 char *prevvalue; /* to see if we are in another record */
105 /* FIXME - is this really needed? */
109 static void heap_dump_item( HEAP h, int i, int level) {
113 (void)rset_pos(h->heap[i]->rset,h->heap[i]->fd, &cur, &tot);
114 logf(LOG_LOG," %d %*s i=%p buf=%p %0.1f/%0.1f",i, level, "",
115 &(h->heap[i]), h->heap[i]->buf, cur,tot );
116 heap_dump_item(h, 2*i, level+1);
117 heap_dump_item(h, 2*i+1, level+1);
119 static void heap_dump( HEAP h,char *msg) {
120 logf(LOG_LOG, "heap dump: %s num=%d max=%d",msg, h->heapnum, h->heapmax);
121 heap_dump_item(h,1,1);
125 static void heap_swap (HEAP h, int x, int y)
127 struct heap_item *swap;
129 h->heap[x]=h->heap[y];
133 static int heap_cmp(HEAP h, int x, int y)
135 return (*h->cmp)(h->heap[x]->buf,h->heap[y]->buf);
138 static int heap_empty(HEAP h)
140 return ( 0==h->heapnum );
143 static void heap_delete (HEAP h)
144 { /* deletes the first item in the heap, and balances the rest */
145 int cur = 1, child = 2;
146 h->heap[1]=0; /* been deleted */
147 heap_swap (h, 1, h->heapnum--);
148 while (child <= h->heapnum) {
149 if (child < h->heapnum && heap_cmp(h,child,1+child)>0 )
151 if (heap_cmp(h,cur,child) > 0)
153 heap_swap (h, cur, child);
162 static void heap_balance (HEAP h)
163 { /* The heap root element has changed value (to bigger) */
164 /* swap downwards until the heap is ordered again */
165 int cur = 1, child = 2;
166 while (child <= h->heapnum) {
167 if (child < h->heapnum && heap_cmp(h,child,1+child)>0 )
169 if (heap_cmp(h,cur,child) > 0)
171 heap_swap (h, cur, child);
181 static void heap_insert (HEAP h, struct heap_item *hi)
185 cur = ++(h->heapnum);
186 assert(cur <= h->heapmax);
189 while (parent && (heap_cmp(h,parent,cur) > 0))
192 heap_swap (h, cur, parent);
200 HEAP heap_create (int size, int key_size,
201 int (*cmp)(const void *p1, const void *p2))
203 HEAP h = (HEAP) xmalloc (sizeof(*h));
205 ++size; /* heap array starts at 1 */
208 h->keysize = key_size;
210 h->heap = (struct heap_item**) xmalloc((size)*sizeof(*h->heap));
211 h->heap[0]=0; /* not used */
215 static void heap_destroy (HEAP h)
217 xfree (h->heap); /* safe, they all point to the rfd */
222 static void *r_create (RSET ct, const struct rset_control *sel, void *parms)
224 rset_multior_parms *r_parms = (rset_multior_parms *) parms;
225 struct rset_multior_info *info;
226 info = (struct rset_multior_info *) xmalloc (sizeof(*info));
227 info->key_size = r_parms->key_size;
228 assert (info->key_size > 1);
229 info->cmp = r_parms->cmp;
230 info->no_rsets= r_parms->no_rsets;
231 info->rsets=r_parms->rsets; /* now we own it! */
236 static RSFD r_open (RSET ct, int flag)
238 struct rset_multior_rfd *rfd;
239 struct rset_multior_info *info = (struct rset_multior_info *) ct->buf;
242 if (flag & RSETF_WRITE)
244 logf (LOG_FATAL, "multior set type is read-only");
247 rfd = (struct rset_multior_rfd *) xmalloc (sizeof(*rfd));
249 rfd->next = info->rfd_list;
251 info->rfd_list = rfd;
252 rfd->h = heap_create( info->no_rsets, info->key_size, info->cmp);
255 rfd->items=(struct heap_item *) xmalloc(info->no_rsets*sizeof(*rfd->items));
256 for (i=0; i<info->no_rsets; i++){
257 rfd->items[i].rset=info->rsets[i];
258 rfd->items[i].buf=xmalloc(info->key_size);
259 rfd->items[i].fd=rset_open(info->rsets[i],RSETF_READ);
260 /* if (item_readbuf(&(rfd->items[i]))) */
261 if ( rset_read(rfd->items[i].rset, rfd->items[i].fd,
263 heap_insert(rfd->h, &(rfd->items[i]));
268 static void r_close (RSFD rfd)
270 struct rset_multior_rfd *mrfd = (struct rset_multior_rfd *) rfd;
271 struct rset_multior_info *info = mrfd->info;
272 struct rset_multior_rfd **rfdp;
275 for (rfdp = &info->rfd_list; *rfdp; rfdp = &(*rfdp)->next)
278 *rfdp = (*rfdp)->next;
280 heap_destroy (mrfd->h);
281 for (i = 0; i<info->no_rsets; i++) {
282 if (mrfd->items[i].fd)
283 rset_close(info->rsets[i],mrfd->items[i].fd);
284 xfree(mrfd->items[i].buf);
288 xfree(mrfd->prevvalue);
292 logf (LOG_FATAL, "r_close but no rfd match!");
296 static void r_delete (RSET ct)
298 struct rset_multior_info *info = (struct rset_multior_info *) ct->buf;
301 assert (info->rfd_list == NULL);
302 for(i=0;i<info->no_rsets;i++)
303 rset_delete(info->rsets[i]);
308 static void r_rewind (RSFD rfd)
310 assert(!"rewind not implemented yet");
314 static int r_forward(RSET ct, RSFD rfd, void *buf,
315 int (*cmpfunc)(const void *p1, const void *p2),
316 const void *untilbuf)
318 struct rset_multior_rfd *mrfd = (struct rset_multior_rfd *) rfd;
319 struct rset_multior_info *info = mrfd->info;
322 if (heap_empty(mrfd->h))
325 assert(cmpfunc==mrfd->info->cmp);
326 it = *(mrfd->h->heap[1]);
327 memcpy(buf,it.buf, info->key_size);
330 rdres=rset_forward(it.rset, it.fd, it.buf, cmpfunc,untilbuf);
332 rdres=rset_read(it.rset, it.fd, it.buf);
334 heap_balance(mrfd->h);
336 heap_delete(mrfd->h);
341 static int r_read (RSFD rfd, void *buf)
343 return r_forward(0,rfd, buf,0,0);
346 static void r_pos (RSFD rfd, double *current, double *total)
348 struct rset_multior_rfd *mrfd = (struct rset_multior_rfd *) rfd;
349 struct rset_multior_info *info = mrfd->info;
351 double scur=0.0, stot=0.0;
353 for (i=0; i<info->no_rsets; i++){
354 rset_pos(mrfd->items[i].rset, mrfd->items[i].fd, &cur, &tot);
355 logf(LOG_LOG, "r_pos: %d %0.1f %0.1f", i, cur,tot);
359 if (stot <1.0) { /* nothing there */
365 *total=*current*stot/scur;
368 static int r_write (RSFD rfd, const void *buf)
370 logf (LOG_FATAL, "multior set type is read-only");