2 * Copyright (C) 1994-1996, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.2 1996-12-23 15:30:49 adam
10 * Revision 1.1 1996/12/20 11:07:21 adam
11 * Implemented Multi-or result set.
24 static void *r_create(const struct rset_control *sel, void *parms,
26 static RSFD r_open (RSET ct, int flag);
27 static void r_close (RSFD rfd);
28 static void r_delete (RSET ct);
29 static void r_rewind (RSFD rfd);
30 static int r_count (RSET ct);
31 static int r_read (RSFD rfd, void *buf);
32 static int r_write (RSFD rfd, const void *buf);
33 static int r_score (RSFD rfd, int *score);
35 static const rset_control control =
49 const rset_control *rset_kind_m_or = &control;
51 struct rset_mor_info {
54 int (*cmp)(const void *p1, const void *p2);
56 ISAM_P *isam_positions;
58 int no_isam_positions;
59 int no_save_positions;
60 struct rset_mor_rfd *rfd_list;
68 int (*cmp)(const void *p1, const void *p2);
80 struct rset_mor_rfd *next;
81 struct rset_mor_info *info;
82 struct trunc_info *ti;
85 static void heap_swap (struct trunc_info *ti, int i1, int i2)
90 ti->ptr[i1] = ti->ptr[i2];
94 static void heap_delete (struct trunc_info *ti)
96 int cur = 1, child = 2;
98 heap_swap (ti, 1, ti->heapnum--);
99 while (child <= ti->heapnum) {
100 if (child < ti->heapnum &&
101 (*ti->cmp)(ti->heap[ti->ptr[child]],
102 ti->heap[ti->ptr[1+child]]) > 0)
104 if ((*ti->cmp)(ti->heap[ti->ptr[cur]],
105 ti->heap[ti->ptr[child]]) > 0)
107 heap_swap (ti, cur, child);
116 static void heap_insert (struct trunc_info *ti, const char *buf, int indx)
120 cur = ++(ti->heapnum);
121 memcpy (ti->heap[ti->ptr[cur]], buf, ti->keysize);
122 ti->indx[ti->ptr[cur]] = indx;
124 while (parent && (*ti->cmp)(ti->heap[ti->ptr[parent]],
125 ti->heap[ti->ptr[cur]]) > 0)
127 heap_swap (ti, cur, parent);
134 struct trunc_info *heap_init (int size, int key_size,
135 int (*cmp)(const void *p1, const void *p2))
137 struct trunc_info *ti = xmalloc (sizeof(*ti));
142 ti->keysize = key_size;
144 ti->indx = xmalloc (size * sizeof(*ti->indx));
145 ti->heap = xmalloc (size * sizeof(*ti->heap));
146 ti->ptr = xmalloc (size * sizeof(*ti->ptr));
147 ti->swapbuf = xmalloc (ti->keysize);
148 ti->tmpbuf = xmalloc (ti->keysize);
149 ti->buf = xmalloc (size * ti->keysize);
150 for (i = size; --i >= 0; )
153 ti->heap[i] = ti->buf + ti->keysize * i;
158 static void heap_close (struct trunc_info *ti)
169 static void *r_create (const struct rset_control *sel, void *parms,
172 rset_m_or_parms *r_parms = parms;
173 struct rset_mor_info *info;
175 *flags |= RSET_FLAG_VOLATILE;
176 info = xmalloc (sizeof(*info));
177 info->key_size = r_parms->key_size;
178 assert (info->key_size > 1);
179 info->cmp = r_parms->cmp;
181 info->no_save_positions = r_parms->no_save_positions;
183 info->isc = r_parms->isc;
184 info->no_isam_positions = r_parms->no_isam_positions;
185 info->isam_positions = xmalloc (sizeof(*info->isam_positions) *
186 info->no_isam_positions);
187 memcpy (info->isam_positions, r_parms->isam_positions,
188 sizeof(*info->isam_positions) * info->no_isam_positions);
189 info->rfd_list = NULL;
194 static RSFD r_open (RSET ct, int flag)
196 struct rset_mor_rfd *rfd;
197 struct rset_mor_info *info = ct->buf;
200 if (flag & RSETF_WRITE)
202 logf (LOG_FATAL, "m_or set type is read-only");
205 rfd = xmalloc (sizeof(*rfd));
207 rfd->next = info->rfd_list;
209 info->rfd_list = rfd;
211 rfd->ispt = xmalloc (sizeof(*rfd->ispt) * info->no_isam_positions);
213 rfd->ti = heap_init (info->no_isam_positions, info->key_size, info->cmp);
215 for (i = 0; i<info->no_isam_positions; i++)
217 rfd->ispt[i] = isc_pp_open (info->isc, info->isam_positions[i]);
218 if (isc_pp_read (rfd->ispt[i], rfd->ti->tmpbuf))
219 heap_insert (rfd->ti, rfd->ti->tmpbuf, i);
222 isc_pp_close (rfd->ispt[i]);
226 rfd->position = info->no_save_positions;
231 static void r_close (RSFD rfd)
233 struct rset_mor_info *info = ((struct rset_mor_rfd*)rfd)->info;
234 struct rset_mor_rfd **rfdp;
237 for (rfdp = &info->rfd_list; *rfdp; rfdp = &(*rfdp)->next)
240 *rfdp = (*rfdp)->next;
242 heap_close (((struct rset_mor_rfd *) rfd)->ti);
243 for (i = 0; i<info->no_isam_positions; i++)
244 if (((struct rset_mor_rfd *) rfd)->ispt[i])
245 isc_pp_close (((struct rset_mor_rfd *) rfd)->ispt[i]);
246 free (((struct rset_mor_rfd *)rfd)->ispt);
250 logf (LOG_FATAL, "r_close but no rfd match!");
254 static void r_delete (RSET ct)
256 struct rset_mor_info *info = ct->buf;
258 assert (info->rfd_list == NULL);
259 xfree (info->isam_positions);
263 static void r_rewind (RSFD rfd)
267 static int r_count (RSET ct)
272 static int r_read (RSFD rfd, void *buf)
274 struct trunc_info *ti = ((struct rset_mor_rfd *) rfd)->ti;
275 int n = ti->indx[ti->ptr[1]];
279 memcpy (buf, ti->heap[ti->ptr[1]], ti->keysize);
280 if (((struct rset_mor_rfd *) rfd)->position)
282 if (isc_pp_read (((struct rset_mor_rfd *) rfd)->ispt[n], ti->tmpbuf))
285 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
286 ((struct rset_mor_rfd *) rfd)->position--;
287 heap_insert (ti, ti->tmpbuf, n);
295 if (!isc_pp_read (((struct rset_mor_rfd *) rfd)->ispt[n], ti->tmpbuf))
300 if ((*ti->cmp)(ti->tmpbuf, ti->heap[ti->ptr[1]]) > 1)
303 heap_insert (ti, ti->tmpbuf, n);
310 static int r_score (RSFD rfd, int *score)
316 static int r_write (RSFD rfd, const void *buf)
318 logf (LOG_FATAL, "mor set type is read-only");