1 /* $Id: isamb.c,v 1.47.2.2 2004-08-19 12:39:29 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 Zebra; see the file LICENSE.zebra. If not, write to the
19 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include <yaz/xmalloc.h>
41 #define ISAMB_DATA_OFFSET 3
43 /* maximum size of encoded buffer */
44 #define DST_ITEM_MAX 256
46 #define ISAMB_MAX_LEVEL 10
47 /* approx 2*max page + max size of item */
48 #define DST_BUF_SIZE 16840
50 #define ISAMB_CACHE_ENTRY_SIZE 4096
52 /* CAT_MAX: _must_ be power of 2 */
54 #define CAT_MASK (CAT_MAX-1)
55 /* CAT_NO: <= CAT_MAX */
58 /* ISAMB_PTR_CODEC=1 var, =0 fixed */
59 #define ISAMB_PTR_CODEC 0
61 struct ISAMB_cache_entry {
66 struct ISAMB_cache_entry *next;
72 struct ISAMB_head head;
73 struct ISAMB_cache_entry *cache_entries;
80 struct ISAMB_file *file;
82 int cache; /* 0=no cache, 1=use cache, -1=dummy isam (for testing only) */
83 int log_io; /* log level for bf_read/bf_write calls */
84 int log_freelist; /* log level for freelist handling */
85 int skipped_numbers; /* on a leaf node */
87 int skipped_nodes[ISAMB_MAX_LEVEL]; /* [0]=skipped leaves, 1=higher etc */
88 int accessed_nodes[ISAMB_MAX_LEVEL]; /* nodes we did not skip */
102 void *decodeClientData;
110 int maxlevel; /* total depth */
113 int skipped_numbers; /* on a leaf node */
114 int returned_numbers;
115 int skipped_nodes[ISAMB_MAX_LEVEL]; /* [0]=skipped leaves, 1=higher etc */
116 int accessed_nodes[ISAMB_MAX_LEVEL]; /* nodes we did not skip */
117 struct ISAMB_block **block;
122 static void encode_ptr (char **dst, unsigned pos)
124 unsigned char *bp = (unsigned char*) *dst;
128 *bp++ = 128 | (pos & 127);
135 static void encode_ptr (char **dst, unsigned pos)
137 memcpy(*dst, &pos, sizeof(pos));
138 (*dst) += sizeof(pos);
143 static void decode_ptr (char **src1, int *pos)
145 unsigned char **src = (unsigned char **) src1;
150 while (((c = *(*src)++) & 128))
152 d += ((c & 127) << r);
159 static void decode_ptr (char **src, int *pos)
161 memcpy (pos, *src, sizeof(*pos));
162 (*src) += sizeof(*pos);
166 ISAMB isamb_open (BFiles bfs, const char *name, int writeflag, ISAMC_M *method,
169 ISAMB isamb = xmalloc (sizeof(*isamb));
173 isamb->method = (ISAMC_M *) xmalloc (sizeof(*method));
174 memcpy (isamb->method, method, sizeof(*method));
175 isamb->no_cat = CAT_NO;
177 isamb->log_freelist = 0;
178 isamb->cache = cache;
179 isamb->skipped_numbers=0;
180 isamb->returned_numbers=0;
181 for (i=0;i<ISAMB_MAX_LEVEL;i++)
182 isamb->skipped_nodes[i]= isamb->accessed_nodes[i]=0;
185 isamb->file = xmalloc (sizeof(*isamb->file) * isamb->no_cat);
186 for (i = 0; i<isamb->no_cat; i++)
188 char fname[DST_BUF_SIZE];
189 isamb->file[i].cache_entries = 0;
190 isamb->file[i].head_dirty = 0;
191 sprintf (fname, "%s%c", name, i+'A');
193 isamb->file[i].bf = bf_open (bfs, fname, ISAMB_CACHE_ENTRY_SIZE,
196 isamb->file[i].bf = bf_open (bfs, fname, b_size, writeflag);
199 if (!bf_read (isamb->file[i].bf, 0, 0, sizeof(struct ISAMB_head),
200 &isamb->file[i].head))
202 isamb->file[i].head.first_block = ISAMB_CACHE_ENTRY_SIZE/b_size+1;
203 isamb->file[i].head.last_block = isamb->file[i].head.first_block;
204 isamb->file[i].head.block_size = b_size;
205 isamb->file[i].head.block_max = b_size - ISAMB_DATA_OFFSET;
206 isamb->file[i].head.free_list = 0;
208 assert (isamb->file[i].head.block_size >= ISAMB_DATA_OFFSET);
209 isamb->file[i].head_dirty = 0;
210 assert(isamb->file[i].head.block_size == b_size);
214 logf(LOG_WARN, "isamb debug enabled. Things will be slower than usual");
219 static void flush_blocks (ISAMB b, int cat)
221 while (b->file[cat].cache_entries)
223 struct ISAMB_cache_entry *ce_this = b->file[cat].cache_entries;
224 b->file[cat].cache_entries = ce_this->next;
228 yaz_log (b->log_io, "bf_write: flush_blocks");
229 bf_write (b->file[cat].bf, ce_this->pos, 0, 0, ce_this->buf);
231 xfree (ce_this->buf);
236 static int get_block (ISAMB b, ISAMC_P pos, char *userbuf, int wr)
238 int cat = pos&CAT_MASK;
239 int off = ((pos/CAT_MAX) &
240 (ISAMB_CACHE_ENTRY_SIZE / b->file[cat].head.block_size - 1))
241 * b->file[cat].head.block_size;
242 int norm = pos / (CAT_MASK*ISAMB_CACHE_ENTRY_SIZE / b->file[cat].head.block_size);
244 struct ISAMB_cache_entry **ce, *ce_this = 0, **ce_last = 0;
249 assert (ISAMB_CACHE_ENTRY_SIZE >= b->file[cat].head.block_size);
250 for (ce = &b->file[cat].cache_entries; *ce; ce = &(*ce)->next, no++)
253 if ((*ce)->pos == norm)
256 *ce = (*ce)->next; /* remove from list */
258 ce_this->next = b->file[cat].cache_entries; /* move to front */
259 b->file[cat].cache_entries = ce_this;
263 memcpy (ce_this->buf + off, userbuf,
264 b->file[cat].head.block_size);
268 memcpy (userbuf, ce_this->buf + off,
269 b->file[cat].head.block_size);
276 assert (ce_last && *ce_last);
278 *ce_last = 0; /* remove the last entry from list */
281 yaz_log (b->log_io, "bf_write: get_block");
282 bf_write (b->file[cat].bf, ce_this->pos, 0, 0, ce_this->buf);
284 xfree (ce_this->buf);
287 ce_this = xmalloc (sizeof(*ce_this));
288 ce_this->next = b->file[cat].cache_entries;
289 b->file[cat].cache_entries = ce_this;
290 ce_this->buf = xmalloc (ISAMB_CACHE_ENTRY_SIZE);
292 yaz_log (b->log_io, "bf_read: get_block");
293 if (!bf_read (b->file[cat].bf, norm, 0, 0, ce_this->buf))
294 memset (ce_this->buf, 0, ISAMB_CACHE_ENTRY_SIZE);
297 memcpy (ce_this->buf + off, userbuf, b->file[cat].head.block_size);
303 memcpy (userbuf, ce_this->buf + off, b->file[cat].head.block_size);
309 void isamb_close (ISAMB isamb)
312 for (i=0;isamb->accessed_nodes[i];i++)
313 logf(LOG_DEBUG,"isamb_close level leaf-%d: %d read, %d skipped",
314 i, isamb->accessed_nodes[i], isamb->skipped_nodes[i]);
315 logf(LOG_DEBUG,"isamb_close returned %d values, skipped %d",
316 isamb->skipped_numbers, isamb->returned_numbers);
317 for (i = 0; i<isamb->no_cat; i++)
319 flush_blocks (isamb, i);
320 if (isamb->file[i].head_dirty)
321 bf_write (isamb->file[i].bf, 0, 0,
322 sizeof(struct ISAMB_head), &isamb->file[i].head);
324 bf_close (isamb->file[i].bf);
327 xfree (isamb->method);
331 static struct ISAMB_block *open_block (ISAMB b, ISAMC_P pos)
333 int cat = pos&CAT_MASK;
334 struct ISAMB_block *p;
337 p = xmalloc (sizeof(*p));
339 p->cat = pos & CAT_MASK;
340 p->buf = xmalloc (b->file[cat].head.block_size);
343 if (!get_block (b, pos, p->buf, 0))
345 yaz_log (b->log_io, "bf_read: open_block");
346 if (!bf_read (b->file[cat].bf, pos/CAT_MAX, 0, 0, p->buf))
348 yaz_log (LOG_FATAL, "isamb: read fail for pos=%ld block=%ld",
349 (long) pos, (long) pos/CAT_MAX);
353 p->bytes = p->buf + ISAMB_DATA_OFFSET;
355 p->size = (p->buf[1] + 256 * p->buf[2]) - ISAMB_DATA_OFFSET;
358 yaz_log (LOG_FATAL, "Bad block size %d in pos=%d\n", p->size, pos);
360 assert (p->size >= 0);
364 p->decodeClientData = (*b->method->code_start)(ISAMC_DECODE);
365 yaz_log (LOG_DEBUG, "isamb_open_block: Opened block %d ofs=%d",pos, p->offset);
369 struct ISAMB_block *new_block (ISAMB b, int leaf, int cat)
371 struct ISAMB_block *p;
373 p = xmalloc (sizeof(*p));
374 p->buf = xmalloc (b->file[cat].head.block_size);
376 if (!b->file[cat].head.free_list)
379 block_no = b->file[cat].head.last_block++;
380 p->pos = block_no * CAT_MAX + cat;
384 p->pos = b->file[cat].head.free_list;
385 assert((p->pos & CAT_MASK) == cat);
386 if (!get_block (b, p->pos, p->buf, 0))
388 yaz_log (b->log_io, "bf_read: new_block");
389 if (!bf_read (b->file[cat].bf, p->pos/CAT_MAX, 0, 0, p->buf))
391 yaz_log (LOG_FATAL, "isamb: read fail for pos=%ld block=%ld",
392 (long) p->pos/CAT_MAX, (long) p->pos/CAT_MAX);
396 yaz_log (b->log_freelist, "got block %d from freelist %d:%d", p->pos,
397 cat, p->pos/CAT_MAX);
398 memcpy (&b->file[cat].head.free_list, p->buf, sizeof(int));
401 b->file[cat].head_dirty = 1;
402 memset (p->buf, 0, b->file[cat].head.block_size);
403 p->bytes = p->buf + ISAMB_DATA_OFFSET;
409 p->decodeClientData = (*b->method->code_start)(ISAMC_DECODE);
413 struct ISAMB_block *new_leaf (ISAMB b, int cat)
415 return new_block (b, 1, cat);
419 struct ISAMB_block *new_int (ISAMB b, int cat)
421 return new_block (b, 0, cat);
424 static void check_block (ISAMB b, struct ISAMB_block *p)
433 char *startp = p->bytes;
435 char *endp = p->bytes + p->size;
438 decode_ptr (&src, &pos);
439 assert ((pos&CAT_MASK) == p->cat);
443 decode_ptr (&src, &item_len);
444 assert (item_len > 0 && item_len < 30);
446 decode_ptr (&src, &pos);
447 assert ((pos&CAT_MASK) == p->cat);
452 void close_block (ISAMB b, struct ISAMB_block *p)
458 yaz_log (b->log_freelist, "release block %d from freelist %d:%d",
459 p->pos, p->cat, p->pos/CAT_MAX);
460 memcpy (p->buf, &b->file[p->cat].head.free_list, sizeof(int));
461 b->file[p->cat].head.free_list = p->pos;
462 if (!get_block (b, p->pos, p->buf, 1))
464 yaz_log (b->log_io, "bf_write: close_block (deleted)");
465 bf_write (b->file[p->cat].bf, p->pos/CAT_MAX, 0, 0, p->buf);
470 int size = p->size + ISAMB_DATA_OFFSET;
471 assert (p->size >= 0);
473 p->buf[1] = size & 255;
474 p->buf[2] = size >> 8;
476 if (!get_block (b, p->pos, p->buf, 1))
478 yaz_log (b->log_io, "bf_write: close_block");
479 bf_write (b->file[p->cat].bf, p->pos/CAT_MAX, 0, 0, p->buf);
482 (*b->method->code_stop)(ISAMC_DECODE, p->decodeClientData);
487 int insert_sub (ISAMB b, struct ISAMB_block **p,
488 void *new_item, int *mode,
490 struct ISAMB_block **sp,
491 void *sub_item, int *sub_size,
494 int insert_int (ISAMB b, struct ISAMB_block *p, void *lookahead_item,
496 ISAMC_I *stream, struct ISAMB_block **sp,
497 void *split_item, int *split_size, void *last_max_item)
499 char *startp = p->bytes;
501 char *endp = p->bytes + p->size;
503 struct ISAMB_block *sub_p1 = 0, *sub_p2 = 0;
504 char sub_item[DST_ITEM_MAX];
510 assert(p->size >= 0);
511 decode_ptr (&src, &pos);
517 decode_ptr (&src, &item_len);
518 d = (*b->method->compare_item)(src, lookahead_item);
521 sub_p1 = open_block (b, pos);
523 more = insert_sub (b, &sub_p1, lookahead_item, mode,
525 sub_item, &sub_size, src);
530 decode_ptr (&src, &pos);
534 sub_p1 = open_block (b, pos);
536 more = insert_sub (b, &sub_p1, lookahead_item, mode, stream, &sub_p2,
537 sub_item, &sub_size, last_max_item);
541 /* there was a split - must insert pointer in this one */
542 char dst_buf[DST_BUF_SIZE];
545 assert (sub_size < 30 && sub_size > 1);
547 memcpy (dst, startp, src - startp);
551 encode_ptr (&dst, sub_size); /* sub length and item */
552 memcpy (dst, sub_item, sub_size);
555 encode_ptr (&dst, sub_p2->pos); /* pos */
557 if (endp - src) /* remaining data */
559 memcpy (dst, src, endp - src);
562 p->size = dst - dst_buf;
563 assert (p->size >= 0);
564 if (p->size <= b->file[p->cat].head.block_max)
566 memcpy (startp, dst_buf, dst - dst_buf);
575 half = src + b->file[p->cat].head.block_size/2;
576 decode_ptr (&src, &pos);
579 decode_ptr (&src, split_size);
581 decode_ptr (&src, &pos);
583 p_new_size = src - dst_buf;
584 memcpy (p->bytes, dst_buf, p_new_size);
586 decode_ptr (&src, split_size);
587 memcpy (split_item, src, *split_size);
590 *sp = new_int (b, p->cat);
591 (*sp)->size = endp - src;
592 memcpy ((*sp)->bytes, src, (*sp)->size);
594 p->size = p_new_size;
597 close_block (b, sub_p2);
599 close_block (b, sub_p1);
604 int insert_leaf (ISAMB b, struct ISAMB_block **sp1, void *lookahead_item,
605 int *lookahead_mode, ISAMC_I *stream,
606 struct ISAMB_block **sp2,
607 void *sub_item, int *sub_size,
610 struct ISAMB_block *p = *sp1;
611 char *src = 0, *endp = 0;
612 char dst_buf[DST_BUF_SIZE], *dst = dst_buf;
614 void *c1 = (*b->method->code_start)(ISAMC_DECODE);
615 void *c2 = (*b->method->code_start)(ISAMC_ENCODE);
617 int quater = b->file[b->no_cat-1].head.block_max / CAT_MAX;
618 char *cut = dst_buf + quater * 2;
619 char *maxp = dst_buf + b->file[b->no_cat-1].head.block_max;
622 char cut_item_buf[DST_ITEM_MAX];
623 int cut_item_size = 0;
627 char file_item_buf[DST_ITEM_MAX];
628 char *file_item = file_item_buf;
631 endp = p->bytes + p->size;
632 (*b->method->code_item)(ISAMC_DECODE, c1, &file_item, &src);
636 char *lookahead_next;
640 d = (*b->method->compare_item)(file_item_buf, lookahead_item);
644 dst_item = lookahead_item;
645 if (!*lookahead_mode)
647 yaz_log (LOG_WARN, "isamb: Inconsistent register (1)");
648 assert (*lookahead_mode);
652 dst_item = file_item_buf;
653 if (!*lookahead_mode && d == 0)
657 else if (!half1 && dst > cut)
659 char *dst_item_0 = dst_item;
660 half1 = dst; /* candidate for splitting */
662 (*b->method->code_item)(ISAMC_ENCODE, c2, &dst, &dst_item);
664 cut_item_size = dst_item - dst_item_0;
665 memcpy (cut_item_buf, dst_item_0, cut_item_size);
670 (*b->method->code_item)(ISAMC_ENCODE, c2, &dst, &dst_item);
677 lookahead_next = lookahead_item;
678 if (!(*stream->read_item)(stream->clientData,
685 if (lookahead_item && max_item &&
686 (*b->method->compare_item)(max_item, lookahead_item) <= 0)
697 lookahead_next = lookahead_item;
698 if (!(*stream->read_item)(stream->clientData,
699 &lookahead_next, lookahead_mode))
706 file_item = file_item_buf;
707 (*b->method->code_item)(ISAMC_DECODE, c1, &file_item, &src);
713 file_item = file_item_buf;
714 (*b->method->code_item)(ISAMC_DECODE, c1, &file_item, &src);
718 maxp = dst_buf + b->file[b->no_cat-1].head.block_max + quater;
719 while (lookahead_item)
721 char *dst_item = lookahead_item;
725 (*b->method->compare_item)(max_item, lookahead_item) <= 0)
730 if (!*lookahead_mode)
732 yaz_log (LOG_WARN, "isamb: Inconsistent register (2)");
735 else if (!half1 && dst > cut)
737 char *dst_item_0 = dst_item;
738 half1 = dst; /* candidate for splitting */
740 (*b->method->code_item)(ISAMC_ENCODE, c2, &dst, &dst_item);
742 cut_item_size = dst_item - dst_item_0;
743 memcpy (cut_item_buf, dst_item_0, cut_item_size);
748 (*b->method->code_item)(ISAMC_ENCODE, c2, &dst, &dst_item);
757 dst_item = lookahead_item;
758 if (!(*stream->read_item)(stream->clientData, &dst_item,
765 new_size = dst - dst_buf;
766 if (p && p->cat != b->no_cat-1 &&
767 new_size > b->file[p->cat].head.block_max)
769 /* non-btree block will be removed */
772 /* delete it too!! */
773 p = 0; /* make a new one anyway */
776 { /* must create a new one */
778 for (i = 0; i < b->no_cat; i++)
779 if (new_size <= b->file[i].head.block_max)
785 if (new_size > b->file[p->cat].head.block_max)
788 char *cut_item = cut_item_buf;
794 p->size = half1 - dst_buf;
795 memcpy (p->bytes, dst_buf, half1 - dst_buf);
798 *sp2 = new_leaf (b, p->cat);
800 (*b->method->code_reset)(c2);
802 first_dst = (*sp2)->bytes;
804 (*b->method->code_item)(ISAMC_ENCODE, c2, &first_dst, &cut_item);
806 memcpy (first_dst, half2, dst - half2);
808 (*sp2)->size = (first_dst - (*sp2)->bytes) + (dst - half2);
811 memcpy (sub_item, cut_item_buf, cut_item_size);
812 *sub_size = cut_item_size;
816 memcpy (p->bytes, dst_buf, dst - dst_buf);
819 (*b->method->code_stop)(ISAMC_DECODE, c1);
820 (*b->method->code_stop)(ISAMC_ENCODE, c2);
825 int insert_sub (ISAMB b, struct ISAMB_block **p, void *new_item,
828 struct ISAMB_block **sp,
829 void *sub_item, int *sub_size,
832 if (!*p || (*p)->leaf)
833 return insert_leaf (b, p, new_item, mode, stream, sp, sub_item,
836 return insert_int (b, *p, new_item, mode, stream, sp, sub_item,
840 int isamb_unlink (ISAMB b, ISAMC_P pos)
842 struct ISAMB_block *p1;
846 p1 = open_block(b, pos);
852 char *src = p1->bytes + p1->offset;
854 decode_ptr(&src, &sub_p);
855 isamb_unlink(b, sub_p);
857 while (src != p1->bytes + p1->size)
859 decode_ptr(&src, &item_len);
861 decode_ptr(&src, &sub_p);
862 isamb_unlink(b, sub_p);
869 int isamb_merge (ISAMB b, ISAMC_P pos, ISAMC_I *stream)
871 char item_buf[DST_ITEM_MAX];
883 (*stream->read_item)(stream->clientData, &item_ptr, &i_mode);
888 more = (*stream->read_item)(stream->clientData, &item_ptr, &i_mode);
891 struct ISAMB_block *p = 0, *sp = 0;
892 char sub_item[DST_ITEM_MAX];
896 p = open_block (b, pos);
897 more = insert_sub (b, &p, item_buf, &i_mode, stream, &sp,
898 sub_item, &sub_size, 0);
900 { /* increase level of tree by one */
901 struct ISAMB_block *p2 = new_int (b, p->cat);
902 char *dst = p2->bytes + p2->size;
904 encode_ptr (&dst, p->pos);
905 assert (sub_size < 20);
906 encode_ptr (&dst, sub_size);
907 memcpy (dst, sub_item, sub_size);
909 encode_ptr (&dst, sp->pos);
911 p2->size = dst - p2->bytes;
912 pos = p2->pos; /* return new super page */
917 pos = p->pos; /* return current one (again) */
923 ISAMB_PP isamb_pp_open_x (ISAMB isamb, ISAMB_P pos, int *level)
925 ISAMB_PP pp = xmalloc (sizeof(*pp));
929 pp->block = xmalloc (ISAMB_MAX_LEVEL * sizeof(*pp->block));
936 pp->skipped_numbers=0;
937 pp->returned_numbers=0;
938 for (i=0;i<ISAMB_MAX_LEVEL;i++)
939 pp->skipped_nodes[i] = pp->accessed_nodes[i]=0;
942 struct ISAMB_block *p = open_block (isamb, pos);
943 char *src = p->bytes + p->offset;
944 pp->block[pp->level] = p;
946 pp->total_size += p->size;
952 decode_ptr (&src, &pos);
953 p->offset = src - p->bytes;
955 pp->accessed_nodes[pp->level]++;
957 pp->block[pp->level+1] = 0;
958 pp->maxlevel=pp->level;
964 ISAMB_PP isamb_pp_open (ISAMB isamb, ISAMB_P pos)
966 return isamb_pp_open_x (isamb, pos, 0);
969 void isamb_pp_close_x (ISAMB_PP pp, int *size, int *blocks)
974 logf(LOG_DEBUG,"isamb_pp_close lev=%d returned %d values, skipped %d",
975 pp->maxlevel, pp->skipped_numbers, pp->returned_numbers);
976 for (i=pp->maxlevel;i>=0;i--)
977 if ( pp->skipped_nodes[i] || pp->accessed_nodes[i])
978 logf(LOG_DEBUG,"isamb_pp_close level leaf-%d: %d read, %d skipped", i,
979 pp->accessed_nodes[i], pp->skipped_nodes[i]);
980 pp->isamb->skipped_numbers += pp->skipped_numbers;
981 pp->isamb->returned_numbers += pp->returned_numbers;
982 for (i=pp->maxlevel;i>=0;i--)
984 pp->isamb->accessed_nodes[i] += pp->accessed_nodes[i];
985 pp->isamb->skipped_nodes[i] += pp->skipped_nodes[i];
988 *size = pp->total_size;
990 *blocks = pp->no_blocks;
991 for (i = 0; i <= pp->level; i++)
992 close_block (pp->isamb, pp->block[i]);
997 int isamb_block_info (ISAMB isamb, int cat)
999 if (cat >= 0 && cat < isamb->no_cat)
1000 return isamb->file[cat].head.block_size;
1004 void isamb_pp_close (ISAMB_PP pp)
1006 isamb_pp_close_x (pp, 0, 0);
1009 /* simple recursive dumper .. */
1010 static void isamb_dump_r (ISAMB b, ISAMB_P pos, void (*pr)(const char *str),
1014 char prefix_str[1024];
1017 struct ISAMB_block *p = open_block (b, pos);
1018 sprintf(prefix_str, "%*s %d cat=%d size=%d max=%d", level*2, "",
1019 pos, p->cat, p->size, b->file[p->cat].head.block_max);
1021 sprintf(prefix_str, "%*s %d", level*2, "", pos);
1024 while (p->offset < p->size)
1026 char *src = p->bytes + p->offset;
1028 (*b->method->code_item)(ISAMC_DECODE, p->decodeClientData,
1030 (*b->method->log_item)(LOG_DEBUG, buf, prefix_str);
1031 p->offset = src - (char*) p->bytes;
1033 assert(p->offset == p->size);
1037 char *src = p->bytes + p->offset;
1041 decode_ptr (&src, &sub);
1042 p->offset = src - (char*) p->bytes;
1044 isamb_dump_r(b, sub, pr, level+1);
1046 while (p->offset < p->size)
1048 decode_ptr (&src, &item_len);
1049 (*b->method->log_item)(LOG_DEBUG, src, prefix_str);
1051 decode_ptr (&src, &sub);
1053 p->offset = src - (char*) p->bytes;
1055 isamb_dump_r(b, sub, pr, level+1);
1062 void isamb_dump (ISAMB b, ISAMB_P pos, void (*pr)(const char *str))
1064 isamb_dump_r(b, pos, pr, 0);
1068 /* Old isamb_pp_read that Adam wrote, kept as a reference in case we need to
1069 debug the more complex pp_read that also forwards. May be deleted near end
1070 of 2004, if it has not shown to be useful */
1073 int isamb_pp_read (ISAMB_PP pp, void *buf)
1077 struct ISAMB_block *p = pp->block[pp->level];
1081 while (p->offset == p->size)
1084 while (p->offset == p->size)
1088 close_block (pp->isamb, pp->block[pp->level]);
1089 pp->block[pp->level] = 0;
1091 p = pp->block[pp->level];
1094 src = p->bytes + p->offset;
1096 decode_ptr (&src, &item_len);
1098 decode_ptr (&src, &pos);
1100 p->offset = src - (char*) p->bytes;
1106 pp->block[pp->level] = p = open_block (pp->isamb, pos);
1108 pp->total_size += p->size;
1115 src = p->bytes + p->offset;
1116 decode_ptr (&src, &pos);
1117 p->offset = src - (char*) p->bytes;
1121 assert (p->offset < p->size);
1123 src = p->bytes + p->offset;
1124 (*pp->isamb->method->code_item)(ISAMC_DECODE, p->decodeClientData,
1126 p->offset = src - (char*) p->bytes;
1127 /* key_logdump_txt(LOG_DEBUG,buf, "isamb_pp_read returning 1"); */
1132 int isamb_pp_read (ISAMB_PP pp, void *buf)
1134 return isamb_pp_forward(pp,buf,0);
1138 #define NEW_FORWARD 1
1140 #if NEW_FORWARD == 1
1144 #define ISAMB_DEBUG 1
1146 static int isamb_pp_on_right_node(ISAMB_PP pp, int level, const void *untilbuf)
1147 { /* looks one node higher to see if we should be on this node at all */
1148 /* useful in backing off quickly, and in avoiding tail descends */
1149 /* call with pp->level to begin with */
1150 struct ISAMB_block *p;
1157 logf(LOG_DEBUG,"isamb_pp_on_right returning true for root");
1159 return 1; /* we can never skip the root node */
1163 assert(p->offset <= p->size);
1164 if (p->offset < p->size )
1166 assert(p->offset>0);
1167 src=p->bytes + p->offset;
1168 decode_ptr(&src,&item_len);
1170 (*pp->isamb->method->log_item)(LOG_DEBUG,untilbuf,"on_leaf: until");
1171 (*pp->isamb->method->log_item)(LOG_DEBUG,src,"on_leaf: value");
1173 cmp=(*pp->isamb->method->compare_item)(untilbuf,src);
1176 logf(LOG_DEBUG,"isamb_pp_on_right returning true "
1177 "cmp=%d lev=%d ofs=%d",cmp,level,p->offset);
1183 logf(LOG_DEBUG,"isamb_pp_on_right returning false "
1184 "cmp=%d lev=%d ofs=%d",cmp,level,p->offset);
1191 logf(LOG_DEBUG,"isamb_pp_on_right at tail, looking higher "
1194 return isamb_pp_on_right_node(pp, level, untilbuf);
1196 } /* isamb_pp_on_right_node */
1198 static int isamb_pp_read_on_leaf(ISAMB_PP pp, void *buf)
1199 { /* reads the next item on the current leaf, returns 0 if end of leaf*/
1200 struct ISAMB_block *p = pp->block[pp->level];
1205 if (p->offset == p->size) {
1207 logf(LOG_DEBUG,"isamb_pp_read_on_leaf returning 0 on node %d",p->pos);
1209 return 0; /* at end of leaf */
1211 src=p->bytes + p->offset;
1213 (*pp->isamb->method->code_item)
1214 (ISAMC_DECODE, p->decodeClientData,&dst, &src);
1215 p->offset = src - (char*) p->bytes;
1218 (*pp->isamb->method->log_item)(LOG_DEBUG, buf, "read_on_leaf returning 1");
1222 } /* read_on_leaf */
1224 static int isamb_pp_forward_on_leaf(ISAMB_PP pp, void *buf, const void *untilbuf)
1225 { /* forwards on the current leaf, returns 0 if not found */
1229 if (!isamb_pp_read_on_leaf(pp,buf))
1231 /* FIXME - this is an extra function call, inline the read? */
1232 cmp=(*pp->isamb->method->compare_item)(untilbuf,buf);
1233 if (cmp <2){ /* found a good one */
1236 logf(LOG_DEBUG, "isam_pp_fwd_on_leaf skipped %d items",skips);
1238 pp->returned_numbers++;
1242 if (!isamb_pp_on_right_node(pp, pp->level, untilbuf))
1243 return 0; /* never mind the rest of this leaf */
1244 pp->skipped_numbers++;
1247 } /* forward_on_leaf */
1249 static int isamb_pp_climb_level(ISAMB_PP pp, int *pos)
1250 { /* climbs higher in the tree, until finds a level with data left */
1251 /* returns the node to (consider to) descend to in *pos) */
1252 struct ISAMB_block *p = pp->block[pp->level];
1256 logf(LOG_DEBUG,"isamb_pp_climb_level starting "
1257 "at level %d node %d ofs=%d sz=%d",
1258 pp->level, p->pos, p->offset, p->size);
1260 assert(pp->level >= 0);
1261 assert(p->offset <= p->size);
1265 logf(LOG_DEBUG,"isamb_pp_climb_level returning 0 at root");
1269 assert(pp->level>0);
1270 close_block(pp->isamb, pp->block[pp->level]);
1271 pp->block[pp->level]=0;
1273 p=pp->block[pp->level];
1275 logf(LOG_DEBUG,"isamb_pp_climb_level climbed to level %d node %d ofs=%d",
1276 pp->level, p->pos, p->offset);
1279 assert(p->offset <= p->size);
1280 if (p->offset == p->size ) {
1281 /* we came from the last pointer, climb on */
1282 if (!isamb_pp_climb_level(pp,pos))
1284 p=pp->block[pp->level];
1288 /* skip the child we just came from */
1290 logf(LOG_DEBUG,"isam_pp_climb_level: skipping lev=%d ofs=%d sz=%d",
1291 pp->level, p->offset, p->size);
1293 assert (p->offset < p->size );
1294 src=p->bytes + p->offset;
1295 decode_ptr(&src, &item_len);
1297 decode_ptr(&src, pos);
1298 p->offset=src - (char *)p->bytes;
1305 static int isamb_pp_forward_unode(ISAMB_PP pp, int pos, const void *untilbuf)
1306 { /* scans a upper node until it finds a child <= untilbuf */
1307 /* pp points to the key value, as always. pos is the child read from */
1309 /* if all values are too small, returns the last child in the node */
1310 /* FIXME - this can be detected, and avoided by looking at the */
1311 /* parent node, but that gets messy. Presumably the cost is */
1312 /* pretty low anyway */
1313 struct ISAMB_block *p = pp->block[pp->level];
1314 char *src=p->bytes + p->offset;
1320 logf(LOG_DEBUG,"isamb_pp_forward_unode starting "
1321 "at level %d node %d ofs=%di sz=%d",
1322 pp->level, p->pos, p->offset, p->size);
1325 assert(p->offset <= p->size);
1326 if (p->offset == p->size) {
1328 logf(LOG_DEBUG,"isamb_pp_forward_unode returning at end "
1329 "at level %d node %d ofs=%di sz=%d",
1330 pp->level, p->pos, p->offset, p->size);
1332 return pos; /* already at the end of it */
1334 while(p->offset < p->size) {
1335 decode_ptr(&src,&item_len);
1336 cmp=(*pp->isamb->method->compare_item)(untilbuf,src);
1338 decode_ptr(&src,&nxtpos);
1342 logf(LOG_DEBUG,"isamb_pp_forward_unode returning a hit "
1343 "at level %d node %d ofs=%d sz=%d",
1344 pp->level, p->pos, p->offset, p->size);
1349 p->offset=src-(char*)p->bytes;
1350 (pp->skipped_nodes[pp->maxlevel - pp->level -1])++;
1356 logf(LOG_DEBUG,"isamb_pp_forward_unode returning at tail "
1357 "at level %d node %d ofs=%d sz=%d skips=%d",
1358 pp->level, p->pos, p->offset, p->size, skips);
1360 return pos; /* that's the last one in the line */
1362 } /* forward_unode */
1364 static void isamb_pp_descend_to_leaf(ISAMB_PP pp, int pos, const void *untilbuf)
1365 { /* climbs down the tree, from pos, to the leftmost leaf */
1366 struct ISAMB_block *p = pp->block[pp->level];
1370 logf(LOG_DEBUG,"isamb_pp_descend_to_leaf "
1371 "starting at lev %d node %d ofs=%d lf=%d u=%p",
1372 pp->level, p->pos, p->offset, p->leaf, untilbuf);
1375 pos=isamb_pp_forward_unode(pp,pos,untilbuf);
1378 p=open_block(pp->isamb, pos);
1379 pp->block[pp->level]=p;
1380 ++(pp->accessed_nodes[pp->maxlevel-pp->level]);
1383 logf(LOG_DEBUG,"isamb_pp_descend_to_leaf "
1384 "got lev %d node %d lf=%d",
1385 pp->level, p->pos, p->leaf);
1389 assert (p->offset==0 );
1390 src=p->bytes + p->offset;
1391 decode_ptr(&src, &pos);
1392 p->offset=src-(char*)p->bytes;
1393 isamb_pp_descend_to_leaf(pp,pos,untilbuf);
1395 logf(LOG_DEBUG,"isamb_pp_descend_to_leaf "
1396 "returning at lev %d node %d ofs=%d lf=%d",
1397 pp->level, p->pos, p->offset, p->leaf);
1399 } /* descend_to_leaf */
1401 static int isamb_pp_find_next_leaf(ISAMB_PP pp)
1402 { /* finds the next leaf by climbing up and down */
1404 if (!isamb_pp_climb_level(pp,&pos))
1406 isamb_pp_descend_to_leaf(pp, pos,0);
1410 static int isamb_pp_climb_desc(ISAMB_PP pp, void *buf, const void *untilbuf)
1411 { /* climbs up and descends to a leaf where values >= *untilbuf are found */
1414 struct ISAMB_block *p = pp->block[pp->level];
1415 logf(LOG_DEBUG,"isamb_pp_climb_desc starting "
1416 "at level %d node %d ofs=%d sz=%d",
1417 pp->level, p->pos, p->offset, p->size);
1419 if (!isamb_pp_climb_level(pp,&pos))
1421 /* see if it would pay to climb one higher */
1422 if (!isamb_pp_on_right_node(pp, pp->level, untilbuf))
1423 if (!isamb_pp_climb_level(pp,&pos))
1425 isamb_pp_descend_to_leaf(pp, pos,untilbuf);
1427 p = pp->block[pp->level];
1428 logf(LOG_DEBUG,"isamb_pp_climb_desc done "
1429 "at level %d node %d ofs=%d sz=%d",
1430 pp->level, p->pos, p->offset, p->size);
1435 int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilbuf)
1438 struct ISAMB_block *p = pp->block[pp->level];
1440 logf(LOG_DEBUG,"isamb_pp_forward starting "
1441 "at level %d node %d ofs=%d sz=%d u=%p",
1442 pp->level, p->pos, p->offset, p->size,untilbuf);
1445 if (isamb_pp_forward_on_leaf( pp, buf, untilbuf)) {
1447 logf(LOG_DEBUG,"isamb_pp_forward (f) returning (A) "
1448 "at level %d node %d ofs=%d sz=%d",
1449 pp->level, p->pos, p->offset, p->size);
1453 if (! isamb_pp_climb_desc( pp, buf, untilbuf)) {
1455 logf(LOG_DEBUG,"isamb_pp_forward (f) returning notfound (B) "
1456 "at level %d node %d ofs=%d sz=%d",
1457 pp->level, p->pos, p->offset, p->size);
1459 return 0; /* could not find a leaf */
1462 if (isamb_pp_forward_on_leaf( pp, buf, untilbuf)) {
1464 logf(LOG_DEBUG,"isamb_pp_forward (f) returning (C) "
1465 "at level %d node %d ofs=%d sz=%d",
1466 pp->level, p->pos, p->offset, p->size);
1470 }while ( isamb_pp_find_next_leaf(pp));
1471 return 0; /* could not find at all */
1473 else { /* no untilbuf, a straight read */
1474 /* FIXME - this should be moved
1475 * directly into the pp_read */
1476 /* keeping here now, to keep same
1477 * interface as the old fwd */
1478 if (isamb_pp_read_on_leaf( pp, buf)) {
1480 logf(LOG_DEBUG,"isamb_pp_forward (read) returning (D) "
1481 "at level %d node %d ofs=%d sz=%d",
1482 pp->level, p->pos, p->offset, p->size);
1486 if (isamb_pp_find_next_leaf(pp)) {
1488 logf(LOG_DEBUG,"isamb_pp_forward (read) returning (E) "
1489 "at level %d node %d ofs=%d sz=%d",
1490 pp->level, p->pos, p->offset, p->size);
1492 return isamb_pp_read_on_leaf(pp, buf);
1497 } /* isam_pp_forward (new version) */
1499 #elif NEW_FORWARD == 0
1501 int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilbuf)
1505 * while at end of node
1506 * climb higher. If out, return 0
1507 * while not on a leaf (and not at its end)
1516 * The upper nodes consist of a sequence of nodenumbers and keys
1517 * When opening a block, the first node number is read in, and
1518 * offset points to the first key, which is the upper limit of keys
1519 * in the node just read.
1523 struct ISAMB_block *p = pp->block[pp->level];
1528 int descending=0; /* used to prevent a border condition error */
1532 logf(LOG_DEBUG,"isamb_pp_forward starting [%p] p=%d",pp,p->pos);
1534 (*pp->isamb->method->log_item)(LOG_DEBUG, untilbuf, "until");
1535 (*pp->isamb->method->log_item)(LOG_DEBUG, buf, "buf");
1540 while ( (p->offset == p->size) && !descending )
1541 { /* end of this block - climb higher */
1542 assert (p->offset <= p->size);
1544 logf(LOG_DEBUG,"isamb_pp_forward climbing from l=%d",
1550 logf(LOG_DEBUG,"isamb_pp_forward returning 0 at root");
1552 return 0; /* at end of the root, nothing left */
1554 close_block(pp->isamb, pp->block[pp->level]);
1555 pp->block[pp->level]=0;
1557 p=pp->block[pp->level];
1559 logf(LOG_DEBUG,"isamb_pp_forward climbed to node %d off=%d",
1563 assert(p->offset <= p->size);
1564 /* skip the child we have handled */
1565 if (p->offset != p->size)
1567 src = p->bytes + p->offset;
1568 decode_ptr(&src, &item_len);
1570 (*pp->isamb->method->log_item)(LOG_DEBUG, src,
1571 " isamb_pp_forward "
1572 "climb skipping old key");
1575 decode_ptr(&src,&pos);
1576 p->offset = src - (char*) p->bytes;
1577 break; /* even if this puts us at the end of the block, we
1578 need to descend to the last pos. UGLY coding,
1579 clean up some day */
1584 src = p->bytes + p->offset;
1585 if (p->offset == p->size)
1586 cmp=-2 ; /* descend to the last node, as we have
1590 decode_ptr(&src, &item_len);
1592 logf(LOG_DEBUG,"isamb_pp_forward (B) on a high node. "
1593 "ofs=%d sz=%d nxtpos=%d ",
1594 p->offset,p->size,pos);
1595 (*pp->isamb->method->log_item)(LOG_DEBUG, src, "");
1598 cmp=(*pp->isamb->method->compare_item)(untilbuf,src);
1602 decode_ptr(&src,&nxtpos);
1607 logf(LOG_DEBUG,"isambb_pp_forward descending l=%d p=%d ",
1610 descending=1; /* prevent climbing for a while */
1612 p = open_block(pp->isamb,pos);
1613 pp->block[pp->level] = p ;
1614 pp->total_size += p->size;
1615 (pp->accessed_nodes[pp->maxlevel - pp->level])++;
1618 { /* block starts with a pos */
1619 src = p->bytes + p->offset;
1620 decode_ptr(&src,&pos);
1621 p->offset=src-(char*) p->bytes;
1623 logf(LOG_DEBUG,"isamb_pp_forward: block %d starts with %d",
1627 } /* descend to the node */
1629 { /* skip the node */
1630 p->offset = src - (char*) p->bytes;
1632 (pp->skipped_nodes[pp->maxlevel - pp->level -1])++;
1635 "isamb_pp_forward: skipping block on level %d, noting "
1637 pp->level, pp->maxlevel - pp->level-1 ,
1638 pp->skipped_nodes[pp->maxlevel - pp->level-1 ]);
1640 /* 0 is always leafs, 1 is one level above leafs etc, no
1641 * matter how high tree */
1643 } /* not on a leaf */
1646 if (p->offset == p->size) {
1651 assert (p->offset < p->size);
1652 src = p->bytes + p->offset;
1654 (*pp->isamb->method->code_item)(ISAMC_DECODE, p->decodeClientData,
1656 p->offset = src - (char*) p->bytes;
1658 cmp=(*pp->isamb->method->compare_item)(untilbuf,buf);
1662 logf(LOG_DEBUG,"isamb_pp_forward on a leaf. cmp=%d",
1664 (*pp->isamb->method->log_item)(LOG_DEBUG, buf, "");
1671 (*pp->isamb->method->log_item)(
1672 LOG_DEBUG, buf, "isamb_pp_forward returning 1");
1676 (*pp->isamb->method->log_item)(
1677 LOG_DEBUG, buf, "isamb_pp_read returning 1 (fwd)");
1680 pp->returned_numbers++;
1684 pp->skipped_numbers++;
1690 #elif NEW_FORWARD == 2
1692 int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilb)
1696 struct ISAMB_block *p = pp->block[pp->level];
1701 while (p->offset == p->size)
1704 while (p->offset == p->size)
1708 close_block (pp->isamb, pp->block[pp->level]);
1709 pp->block[pp->level] = 0;
1711 p = pp->block[pp->level];
1716 src = p->bytes + p->offset;
1718 decode_ptr (&src, &item_len);
1720 decode_ptr (&src, &pos);
1722 p->offset = src - (char*) p->bytes;
1724 src = p->bytes + p->offset;
1728 if (!untilb || p->offset == p->size)
1730 assert(p->offset < p->size);
1731 decode_ptr (&src, &item_len);
1732 if ((*pp->isamb->method->compare_item)(untilb, src) <= 1)
1735 decode_ptr (&src, &pos);
1736 p->offset = src - (char*) p->bytes;
1743 pp->block[pp->level] = p = open_block (pp->isamb, pos);
1745 pp->total_size += p->size;
1753 src = p->bytes + p->offset;
1756 decode_ptr (&src, &pos);
1757 p->offset = src - (char*) p->bytes;
1759 if (!untilb || p->offset == p->size)
1761 assert(p->offset < p->size);
1762 decode_ptr (&src, &item_len);
1763 if ((*pp->isamb->method->compare_item)(untilb, src) <= 1)
1770 assert (p->offset < p->size);
1775 src = p->bytes + p->offset;
1776 (*pp->isamb->method->code_item)(ISAMC_DECODE, p->decodeClientData,
1778 p->offset = src - (char*) p->bytes;
1779 if (!untilb || (*pp->isamb->method->compare_item)(untilb, dst0) <= 1)
1782 if (p->offset == p->size) goto again;
1784 /* key_logdump_txt(LOG_DEBUG,buf, "isamb_pp_read returning 1"); */
1790 int isamb_pp_num (ISAMB_PP pp)
1795 static void isamb_pp_leaf_pos( ISAMB_PP pp,
1796 int *current, int *total, void *dummybuf )
1798 struct ISAMB_block *p = pp->block[pp->level];
1800 char *end=p->bytes+p->size;
1801 char *cur=p->bytes+p->offset;
1803 assert(p->offset <= p->size);
1811 (*pp->isamb->method->code_item)
1812 (ISAMC_DECODE, p->decodeClientData,&dst, &src);
1813 assert(dst<(char*) dummybuf+100); /*FIXME */
1818 logf(LOG_DEBUG, "isamb_pp_leaf_pos: cur=%d tot=%d ofs=%d sz=%d lev=%d",
1819 *current, *total, p->offset, p->size, pp->level);
1823 static void isamb_pp_upper_pos( ISAMB_PP pp, int *current, int *total,
1824 int size, int level )
1825 { /* estimates total/current occurrences from here up, excl leaf */
1826 struct ISAMB_block *p = pp->block[level];
1828 char *end=p->bytes+p->size;
1829 char *cur=p->bytes+p->offset;
1834 logf(LOG_DEBUG,"isamb_pp_upper_pos at beginning l=%d "
1835 "cur=%d tot=%d ofs=%d sz=%d pos=%d",
1836 level, *current, *total, p->offset, p->size, p->pos);
1837 assert (p->offset <= p->size);
1838 decode_ptr (&src, &child ); /* first child */
1845 decode_ptr (&src, &item_size );
1846 assert(src+item_size<=end);
1848 decode_ptr (&src, &child );
1851 isamb_pp_upper_pos(pp, current, total, *total, level-1);
1854 void isamb_pp_pos( ISAMB_PP pp, int *current, int *total )
1855 { /* return an estimate of the current position and of the total number of */
1856 /* occureences in the isam tree, based on the current leaf */
1857 struct ISAMB_block *p = pp->block[pp->level];
1858 char dummy[100]; /* 100 bytes/entry must be enough */
1862 isamb_pp_leaf_pos(pp,current, total, dummy);
1864 isamb_pp_upper_pos(pp, current, total, *total, pp->level-1);
1866 logf(LOG_DEBUG,"isamb_pp_pos: C=%d T=%d =%6.2f%%",
1867 *current, *total, 100.0*(*current)/(*total));