Bug fix: If at and of leaf, then reset descending and go up again.

[idzebra-moved-to-github.git] / isamb / isamb.c

diff --git a/isamb/isamb.c b/isamb/isamb.c
index 33a3691..2f43971 100644 (file)
--- a/isamb/isamb.c
+++ b/isamb/isamb.c
@@ -1,4 +1,4 @@
-/* $Id: isamb.c,v 1.32 2004-06-01 14:51:00 heikki Exp $
+/* $Id: isamb.c,v 1.35 2004-06-02 07:53:31 adam Exp $
    Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
    Index Data Aps
 
@@ -27,7 +27,7 @@ Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 #include <assert.h>
 
 #ifndef ISAMB_DEBUG
-#define ISAMB_DEBUG 1
+#define ISAMB_DEBUG 0
 #endif
 
 struct ISAMB_head {
@@ -208,6 +208,9 @@ ISAMB isamb_open (BFiles bfs, const char *name, int writeflag, ISAMC_M *method,
         assert(isamb->file[i].head.block_size == b_size);
         b_size = b_size * 4;
     }
+#if ISAMB_DEBUG
+    logf(LOG_WARN, "isamb debug enabled. Things will be slower than usual");
+#endif
     return isamb;
 }
 
@@ -1117,6 +1120,7 @@ int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilbuf)
     {
         while ( (p->offset == p->size) && !descending )
         {  /* end of this block - climb higher */
+           assert (p->offset <= p->size);
 #if ISAMB_DEBUG
             logf(LOG_DEBUG,"isamb_pp_forward climbing from l=%d",
                             pp->level);
@@ -1137,6 +1141,7 @@ int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilbuf)
                             p->pos, p->offset);
 #endif
             assert(!p->leaf);
+           assert(p->offset <= p->size);
             /* skip the child we have handled */
             if (p->offset != p->size)
             { 
@@ -1150,21 +1155,23 @@ int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilbuf)
                 src += item_len;
                 decode_ptr(&src,&pos);
                 p->offset = src - (char*) p->bytes;
-                break; /* even if this puts us at the end of the block, we need to */
-                       /* descend to the last pos. UGLY coding, clean up some */
-                       /* day */
+                break; /* even if this puts us at the end of the block, we
+                         need to descend to the last pos. UGLY coding,
+                         clean up some day */
             }
         }
         if (!p->leaf)
         { 
             src = p->bytes + p->offset;
             if (p->offset == p->size)
-                cmp=-2 ; /* descend to the last node, as we have no value to cmp */
+                cmp=-2 ; /* descend to the last node, as we have
+                           no value to cmp */
             else
             {
                 decode_ptr(&src, &item_len);
 #if ISAMB_DEBUG
-                logf(LOG_DEBUG,"isamb_pp_forward (B) on a high node. ofs=%d sz=%d nxtpos=%d ",
+                logf(LOG_DEBUG,"isamb_pp_forward (B) on a high node. "
+                    "ofs=%d sz=%d nxtpos=%d ",
                         p->offset,p->size,pos);
                (*pp->isamb->method->log_item)(LOG_DEBUG, src, "");
 #endif
@@ -1206,7 +1213,8 @@ int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilbuf)
                 (pp->skipped_nodes[pp->maxlevel - pp->level -1])++;
 #if ISAMB_DEBUG
                 logf(LOG_DEBUG,
-                    "isamb_pp_forward: skipping block on level %d, noting on %d (%d)",
+                    "isamb_pp_forward: skipping block on level %d, noting "
+                    "on %d (%d)",
                     pp->level, pp->maxlevel - pp->level-1 , 
                     pp->skipped_nodes[pp->maxlevel - pp->level-1 ]);
 #endif
@@ -1216,39 +1224,46 @@ int isamb_pp_forward (ISAMB_PP pp, void *buf, const void *untilbuf)
         } /* not on a leaf */
         else
         { /* on a leaf */
-            src = p->bytes + p->offset;
-            dst=buf;
-            (*pp->isamb->method->code_item)(ISAMC_DECODE, p->decodeClientData,
-                                            &dst, &src);
-            p->offset = src - (char*) p->bytes;
-            if (untilbuf)
-                cmp=(*pp->isamb->method->compare_item)(untilbuf,buf);
-            else
-                cmp=-2;
+           if (p->offset == p->size) { 
+               descending = 0;
+           }
+           else
+           {
+               assert (p->offset < p->size);
+               src = p->bytes + p->offset;
+               dst=buf;
+               (*pp->isamb->method->code_item)(ISAMC_DECODE, p->decodeClientData,
+                                               &dst, &src);
+               p->offset = src - (char*) p->bytes;
+               if (untilbuf)
+                   cmp=(*pp->isamb->method->compare_item)(untilbuf,buf);
+               else
+                   cmp=-2;
 #if ISAMB_DEBUG
-            logf(LOG_DEBUG,"isamb_pp_forward on a leaf. cmp=%d", 
-                              cmp);
-           (*pp->isamb->method->log_item)(LOG_DEBUG, buf, "");
+               logf(LOG_DEBUG,"isamb_pp_forward on a leaf. cmp=%d", 
+                    cmp);
+               (*pp->isamb->method->log_item)(LOG_DEBUG, buf, "");
 #endif
-            if (cmp <2)
-            {
-#if ISAMB_DEBUG
-                if (untilbuf)
+               if (cmp <2)
                {
-                   (*pp->isamb->method->log_item)(LOG_DEBUG, buf, 
-                                                  "isamb_pp_forward returning 1");
-               }
-                else
-               {
-                   (*pp->isamb->method->log_item)(LOG_DEBUG, buf, 
-                                                  "isamb_pp_read returning 1 (fwd)");
-               }
+#if ISAMB_DEBUG
+                   if (untilbuf)
+                   {
+                       (*pp->isamb->method->log_item)(
+                           LOG_DEBUG, buf,  "isamb_pp_forward returning 1");
+                   }
+                   else
+                   {
+                       (*pp->isamb->method->log_item)(
+                           LOG_DEBUG, buf, "isamb_pp_read returning 1 (fwd)");
+                   }
 #endif
-                pp->returned_numbers++;
-                return 1;
-            }
-            else
-                pp->skipped_numbers++;
+                   pp->returned_numbers++;
+                   return 1;
+               }
+               else
+                   pp->skipped_numbers++;
+           }
         } /* leaf */
     } /* main loop */
 }