Index: ext/lsm1/lsm-test/lsmtest_tdb3.c
==================================================================
--- ext/lsm1/lsm-test/lsmtest_tdb3.c
+++ ext/lsm1/lsm-test/lsmtest_tdb3.c
@@ -666,10 +666,22 @@
     if( rc!=LSM_OK ) return rc;
   }else{
     rc = LSM_OK;
     csr = pDb->pCsr;
   }
+
+  /* To enhance testing, if both pLast and pFirst are defined, seek the
+  ** cursor to the "end" boundary here. Then the next block seeks it to
+  ** the "start" ready for the scan. The point is to test that cursors
+  ** can be reused.  */
+  if( pLast && pFirst ){
+    if( bReverse ){
+      rc = lsm_csr_seek(csr, pFirst, nFirst, LSM_SEEK_LE);
+    }else{
+      rc = lsm_csr_seek(csr, pLast, nLast, LSM_SEEK_GE);
+    }
+  }
 
   if( bReverse ){
     if( pLast ){
       rc = lsm_csr_seek(csr, pLast, nLast, LSM_SEEK_LE);
     }else{

Index: ext/lsm1/lsm_sorted.c
==================================================================
--- ext/lsm1/lsm_sorted.c
+++ ext/lsm1/lsm_sorted.c
@@ -1920,25 +1920,30 @@
 
   /* If (res<0), then key pKey/nKey is smaller than the split-key (or this
   ** is not a composite level and there is no split-key). Search the 
   ** left-hand-side of the level in this case.  */
   if( res<0 ){
+    int i;
     int iPtr = 0;
     if( nRhs==0 ) iPtr = (int)*piPgno;
 
     rc = seekInSegment(
         pCsr, &aPtr[0], iTopic, pKey, nKey, iPtr, eSeek, &iOut, &bStop
     );
     if( rc==LSM_OK && nRhs>0 && eSeek==LSM_SEEK_GE && aPtr[0].pPg==0 ){
       res = 0;
     }
+    for(i=1; i<=nRhs; i++){
+      segmentPtrReset(&aPtr[i], LSM_SEGMENTPTR_FREE_THRESHOLD);
+    }
   }
   
   if( res>=0 ){
     int bHit = 0;                 /* True if at least one rhs is not EOF */
     int iPtr = (int)*piPgno;
     int i;
+    segmentPtrReset(&aPtr[0], LSM_SEGMENTPTR_FREE_THRESHOLD);
     for(i=1; rc==LSM_OK && i<=nRhs && bStop==0; i++){
       SegmentPtr *pPtr = &aPtr[i];
       iOut = 0;
       rc = seekInSegment(
           pCsr, pPtr, iTopic, pKey, nKey, iPtr, eSeek, &iOut, &bStop