-/* $Id: isamb.c,v 1.75 2005-03-21 17:20:54 adam Exp $
- Copyright (C) 1995-2005
+/* $Id: isamb.c,v 1.83 2006-08-14 10:40:17 adam Exp $
+ Copyright (C) 1995-2006
Index Data ApS
This file is part of the Zebra server.
for more details.
You should have received a copy of the GNU General Public License
-along with Zebra; see the file LICENSE.zebra. If not, write to the
-Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
-02111-1307, USA.
+along with this program; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
*/
#include <stdlib.h>
#define ISAMB_PTR_CODEC 1
struct ISAMB_cache_entry {
- ISAMB_P pos;
+ ISAM_P pos;
unsigned char *buf;
int dirty;
int hits;
};
struct ISAMB_block {
- ISAMB_P pos;
+ ISAM_P pos;
int cat;
int size;
int leaf;
struct ISAMB_PP_s {
ISAMB isamb;
- ISAMB_P pos;
+ ISAM_P pos;
int level;
int maxlevel; /* total depth */
zint total_size;
#endif
ISAMB isamb_open(BFiles bfs, const char *name, int writeflag, ISAMC_M *method,
- int cache)
+ int cache)
{
ISAMB isamb = xmalloc(sizeof(*isamb));
int i, b_size = ISAMB_MIN_SIZE;
isamb->skipped_numbers = 0;
isamb->returned_numbers = 0;
for (i = 0; i<ISAMB_MAX_LEVEL; i++)
- isamb->skipped_nodes[i] = isamb->accessed_nodes[i] = 0;
+ isamb->skipped_nodes[i] = isamb->accessed_nodes[i] = 0;
assert(cache == 0);
isamb->file = xmalloc(sizeof(*isamb->file) * isamb->no_cat);
}
}
-static int cache_block (ISAMB b, ISAMC_P pos, char *userbuf, int wr)
+static int cache_block (ISAMB b, ISAM_P pos, unsigned char *userbuf, int wr)
{
int cat = (int) (pos&CAT_MASK);
int off = (int) (((pos/CAT_MAX) &
* Reserve 5 bytes for large block sizes. 1 for small ones .. Number
of items. We can thus have at most 2^40 nodes.
*/
-static struct ISAMB_block *open_block(ISAMB b, ISAMC_P pos)
+static struct ISAMB_block *open_block(ISAMB b, ISAM_P pos)
{
int cat = (int) (pos&CAT_MASK);
const char *src;
abort();
}
}
- p->bytes = p->buf + offset;
+ p->bytes = (char *)p->buf + offset;
p->leaf = p->buf[0];
p->size = (p->buf[1] + 256 * p->buf[2]) - offset;
if (p->size < 0)
p->size, pos);
}
assert (p->size >= 0);
- src = p->buf + 3;
+ src = (char*) p->buf + 3;
decode_ptr(&src, &p->no_items);
p->offset = 0;
p->cat = cat;
b->file[cat].head_dirty = 1;
memset (p->buf, 0, b->file[cat].head.block_size);
- p->bytes = p->buf + b->file[cat].head.block_offset;
+ p->bytes = (char*)p->buf + b->file[cat].head.block_offset;
p->leaf = leaf;
p->size = 0;
p->dirty = 1;
char *startp = p->bytes;
const char *src = startp;
char *endp = p->bytes + p->size;
- ISAMB_P pos;
+ ISAM_P pos;
void *c1 = (*b->method->codec.start)();
decode_ptr(&src, &pos);
{
int offset = b->file[p->cat].head.block_offset;
int size = p->size + offset;
- char *dst = p->buf + 3;
+ char *dst = (char*)p->buf + 3;
assert (p->size >= 0);
/* memset becuase encode_ptr usually does not write all bytes */
char *startp = p->bytes;
const char *src = startp;
char *endp = p->bytes + p->size;
- ISAMB_P pos;
+ ISAM_P pos;
struct ISAMB_block *sub_p1 = 0, *sub_p2 = 0;
char sub_item[DST_ITEM_MAX];
int sub_size;
p->size = dst - dst_buf;
assert (p->size >= 0);
-
if (p->size <= b->file[p->cat].head.block_max)
{
/* it fits OK in this block */
memcpy (startp, dst_buf, dst - dst_buf);
+
+ close_block(b, sub_p2);
}
else
{
src = dst_buf;
endp = dst;
+ p->dirty = 1;
+ close_block(b, sub_p2);
+
half = src + b->file[p->cat].head.block_size/2;
decode_ptr(&src, &pos);
(*sp)->no_items = p->no_items - no_items_first_half;
p->no_items = no_items_first_half;
}
- p->dirty = 1;
- close_block(b, sub_p2);
+ p->dirty = 1;
}
close_block(b, sub_p1);
(*b->method->codec.stop)(c1);
sub_size, max_item);
}
-int isamb_unlink (ISAMB b, ISAMC_P pos)
+int isamb_unlink (ISAMB b, ISAM_P pos)
{
struct ISAMB_block *p1;
return 0;
}
-ISAMB_P isamb_merge (ISAMB b, ISAMC_P pos, ISAMC_I *stream)
+void isamb_merge(ISAMB b, ISAM_P *pos, ISAMC_I *stream)
{
char item_buf[DST_ITEM_MAX];
char *item_ptr;
more =
(*stream->read_item)(stream->clientData, &item_ptr, &i_mode);
}
- return 1;
+ *pos = 1;
+ return;
}
item_ptr = item_buf;
more = (*stream->read_item)(stream->clientData, &item_ptr, &i_mode);
char sub_item[DST_ITEM_MAX];
int sub_size;
- if (pos)
- p = open_block(b, pos);
+ if (*pos)
+ p = open_block(b, *pos);
more = insert_sub (b, &p, item_buf, &i_mode, stream, &sp,
sub_item, &sub_size, 0);
if (sp)
p2->size = dst - p2->bytes;
p2->no_items = p->no_items + sp->no_items;
- pos = p2->pos; /* return new super page */
+ *pos = p2->pos; /* return new super page */
close_block(b, sp);
close_block(b, p2);
#if INT_ENCODE
}
else
{
- pos = p->pos; /* return current one (again) */
+ *pos = p->pos; /* return current one (again) */
}
if (p->no_items == 0)
must_delete = 1;
}
if (must_delete)
{
- isamb_unlink(b, pos);
- return 0;
+ isamb_unlink(b, *pos);
+ *pos = 0;
}
- return pos;
}
-ISAMB_PP isamb_pp_open_x(ISAMB isamb, ISAMB_P pos, int *level, int scope)
+ISAMB_PP isamb_pp_open_x(ISAMB isamb, ISAM_P pos, int *level, int scope)
{
ISAMB_PP pp = xmalloc(sizeof(*pp));
int i;
return pp;
}
-ISAMB_PP isamb_pp_open (ISAMB isamb, ISAMB_P pos, int scope)
+ISAMB_PP isamb_pp_open (ISAMB isamb, ISAM_P pos, int scope)
{
return isamb_pp_open_x(isamb, pos, 0, scope);
}
}
/* simple recursive dumper .. */
-static void isamb_dump_r (ISAMB b, ISAMB_P pos, void (*pr)(const char *str),
+static void isamb_dump_r (ISAMB b, ISAM_P pos, void (*pr)(const char *str),
int level)
{
char buf[1024];
else
{
const char *src = p->bytes + p->offset;
- ISAMB_P sub;
+ ISAM_P sub;
decode_ptr(&src, &sub);
p->offset = src - (char*) p->bytes;
}
}
-void isamb_dump(ISAMB b, ISAMB_P pos, void (*pr)(const char *str))
+void isamb_dump(ISAMB b, ISAM_P pos, void (*pr)(const char *str))
{
isamb_dump_r(b, pos, pr, 0);
}
}
} /* forward_on_leaf */
-static int isamb_pp_climb_level(ISAMB_PP pp, ISAMB_P *pos)
+static int isamb_pp_climb_level(ISAMB_PP pp, ISAM_P *pos)
{ /* climbs higher in the tree, until finds a level with data left */
/* returns the node to (consider to) descend to in *pos) */
struct ISAMB_block *p = pp->block[pp->level];
} /* forward_unode */
-static void isamb_pp_descend_to_leaf(ISAMB_PP pp, ISAMB_P pos,
+static void isamb_pp_descend_to_leaf(ISAMB_PP pp, ISAM_P pos,
const void *untilbuf)
{ /* climbs down the tree, from pos, to the leftmost leaf */
struct ISAMB_block *p = pp->block[pp->level];
static int isamb_pp_find_next_leaf(ISAMB_PP pp)
{ /* finds the next leaf by climbing up and down */
- ISAMB_P pos;
+ ISAM_P pos;
if (!isamb_pp_climb_level(pp, &pos))
return 0;
isamb_pp_descend_to_leaf(pp, pos, 0);
static int isamb_pp_climb_desc(ISAMB_PP pp, const void *untilbuf)
{ /* climbs up and descends to a leaf where values >= *untilbuf are found */
- ISAMB_P pos;
+ ISAM_P pos;
#if ISAMB_DEBUG
struct ISAMB_block *p = pp->block[pp->level];
yaz_log(YLOG_DEBUG, "isamb_pp_climb_desc starting "
void isamb_pp_pos(ISAMB_PP pp, double *current, double *total)
{ /* return an estimate of the current position and of the total number of */
/* occureences in the isam tree, based on the current leaf */
- struct ISAMB_block *p = pp->block[pp->level];
assert(total);
assert(current);
- assert(p->leaf);
+
+ /* if end-of-stream PP may not be leaf */
*total = (double) (pp->block[0]->no_items);
*current = (double) pp->returned_numbers;
again:
while (p->offset == p->size)
{
- ISAMB_P pos;
+ ISAM_P pos;
#if INT_ENCODE
const char *src_0;
void *c1;
}
return 1;
}
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * indent-tabs-mode: nil
+ * End:
+ * vim: shiftwidth=4 tabstop=8 expandtab
+ */
+