2 * Copyright (c) 1996-1998, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss, Heikki Levanto
16 struct isc_merge_block {
17 int offset; /* offset in r_buf */
18 int block; /* block number of file (0 if none) */
19 int dirty; /* block is different from that on file */
22 static void opt_blocks (ISAMC is, struct isc_merge_block *mb, int ptr,
26 for (i = 0; i<ptr; i++)
29 if (no_dirty*4 < ptr*3)
32 for (i = 0; i<ptr; i++)
34 int tmp, j, j_min = -1;
35 for (j = i; j<ptr; j++)
37 if (j_min < 0 || mb[j_min].block > mb[j].block)
41 tmp = mb[j_min].block;
42 mb[j_min].block = mb[i].block;
50 static void flush_blocks (ISAMC is, struct isc_merge_block *mb, int ptr,
51 char *r_buf, int *firstpos, int cat, int last,
56 for (i = 0; i<ptr; i++)
58 /* consider this block number */
61 mb[i].block = isc_alloc_block (is, cat);
65 /* consider next block pointer */
66 if (last && i == ptr-1)
68 else if (!mb[i+1].block)
70 mb[i+1].block = isc_alloc_block (is, cat);
76 for (i = 0; i<ptr; i++)
79 ISAMC_BLOCK_SIZE ssize = mb[i+1].offset - mb[i].offset;
83 /* skip rest if not dirty */
88 *firstpos = mb[i].block;
89 if (is->method->debug > 2)
90 logf (LOG_LOG, "isc: skip ptr=%d size=%d %d %d",
91 i, ssize, cat, mb[i].block);
92 ++(is->files[cat].no_skip_writes);
99 *firstpos = mb[i].block;
100 src = r_buf + mb[i].offset - ISAMC_BLOCK_OFFSET_1;
101 ssize += ISAMC_BLOCK_OFFSET_1;
103 memcpy (src+sizeof(int)+sizeof(ssize), numkeys,
105 if (is->method->debug > 2)
106 logf (LOG_LOG, "isc: flush ptr=%d numk=%d size=%d nextpos=%d",
107 i, *numkeys, (int) ssize, mb[i+1].block);
111 src = r_buf + mb[i].offset - ISAMC_BLOCK_OFFSET_N;
112 ssize += ISAMC_BLOCK_OFFSET_N;
113 if (is->method->debug > 2)
114 logf (LOG_LOG, "isc: flush ptr=%d size=%d nextpos=%d",
115 i, (int) ssize, mb[i+1].block);
117 memcpy (src, &mb[i+1].block, sizeof(int));
118 memcpy (src+sizeof(int), &ssize, sizeof(ssize));
119 isc_write_block (is, cat, mb[i].block, src);
123 static int get_border (ISAMC is, struct isc_merge_block *mb, int ptr,
124 int cat, int firstpos)
126 /* Border set to initial fill or block size depending on
127 whether we are creating a new one or updating and old one.
130 int fill = mb[ptr].block ? is->method->filecat[cat].bsize :
131 is->method->filecat[cat].ifill;
132 int off = (ptr||firstpos) ? ISAMC_BLOCK_OFFSET_N : ISAMC_BLOCK_OFFSET_1;
136 return mb[ptr].offset + fill - off;
139 ISAMC_P isc_merge (ISAMC is, ISAMC_P ipos, ISAMC_I data)
142 char i_item[128], *i_item_ptr;
143 int i_more, i_mode, i;
146 char f_item[128], *f_item_ptr;
149 int debug = is->method->debug;
151 struct isc_merge_block mb[200];
155 char r_item_buf[128]; /* temporary result output */
156 char *r_buf; /* block with resulting data */
157 int r_offset = 0; /* current offset in r_buf */
158 int ptr = 0; /* pointer */
159 void *r_clientData; /* encode client data */
163 r_clientData = (*is->method->code_start)(ISAMC_ENCODE);
164 r_buf = is->merge_buf + 128;
166 pp = isc_pp_open (is, ipos);
167 /* read first item from file. make sure f_more indicates no boundary */
169 f_more = isc_read_item (pp, &f_item_ptr);
175 logf (LOG_LOG, "isc: isc_merge begin %d %d", cat, pp->pos);
177 /* read first item from i */
179 i_more = (*data->read_item)(data->clientData, &i_item_ptr, &i_mode);
181 mb[ptr].block = pp->pos; /* is zero if no block on disk */
185 border = get_border (is, mb, ptr, cat, firstpos);
186 while (i_more || f_more)
188 char *r_item = r_item_buf;
193 /* block to block boundary in the original file. */
197 /* the resulting output is of the same category as the
200 if (r_offset <= mb[ptr].offset +is->method->filecat[cat].mfill)
202 /* the resulting output block is too small/empty. Delete
203 the original (if any)
206 logf (LOG_LOG, "isc: release A");
208 isc_release_block (is, pp->cat, mb[ptr].block);
209 mb[ptr].block = pp->pos;
217 /* indicate new boundary based on the original file */
218 mb[++ptr].block = pp->pos;
219 mb[ptr].dirty = last_dirty;
220 mb[ptr].offset = r_offset;
222 logf (LOG_LOG, "isc: bound ptr=%d,offset=%d",
224 if (cat==is->max_cat && ptr >= is->method->max_blocks_mem)
226 /* We are dealing with block(s) of max size. Block(s)
227 except 1 will be flushed.
230 logf (LOG_LOG, "isc: flush A %d sections", ptr);
231 flush_blocks (is, mb, ptr-1, r_buf, &firstpos, cat,
233 mb[0].block = mb[ptr-1].block;
234 mb[0].dirty = mb[ptr-1].dirty;
235 memcpy (r_buf, r_buf + mb[ptr-1].offset,
236 mb[ptr].offset - mb[ptr-1].offset);
239 mb[1].block = mb[ptr].block;
240 mb[1].dirty = mb[ptr].dirty;
241 mb[1].offset = mb[ptr].offset - mb[ptr-1].offset;
243 r_offset = mb[ptr].offset;
247 border = get_border (is, mb, ptr, cat, firstpos);
255 cmp = (*is->method->compare_item)(i_item, f_item);
256 if (cmp == 0) /* insert i=f */
258 if (!i_mode) /* delete item? */
262 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
264 /* is next input item the same as current except
265 for the delete flag? */
266 cmp = (*is->method->compare_item)(i_item, f_item);
267 if (!cmp && i_mode) /* delete/insert nop? */
269 /* yes! insert as if it was an insert only */
270 memcpy (r_item, i_item, i_item_ptr - i_item);
272 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
277 /* no! delete the item */
285 memcpy (r_item, f_item, f_item_ptr - f_item);
289 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
294 f_more = isc_read_item (pp, &f_item_ptr);
296 else if (cmp > 0) /* insert f */
298 memcpy (r_item, f_item, f_item_ptr - f_item);
301 f_more = isc_read_item (pp, &f_item_ptr);
305 if (!i_mode) /* delete item which isn't there? */
307 logf (LOG_FATAL, "Inconsistent register at offset %d",
311 memcpy (r_item, i_item, i_item_ptr - i_item);
316 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
319 if (r_item) /* insert resulting item? */
321 char *r_out_ptr = r_buf + r_offset;
324 (*is->method->code_item)(ISAMC_ENCODE, r_clientData,
325 &r_out_ptr, &r_item);
326 new_offset = r_out_ptr - r_buf;
330 if (border < new_offset && border >= r_offset)
333 logf (LOG_LOG, "isc: border %d %d", ptr, border);
334 /* Max size of current block category reached ...
335 make new virtual block entry */
338 mb[ptr].offset = r_offset;
339 if (cat == is->max_cat && ptr >= is->method->max_blocks_mem)
341 /* We are dealing with block(s) of max size. Block(s)
342 except one will be flushed. Note: the block(s) are
343 surely not the last one(s).
346 logf (LOG_LOG, "isc: flush B %d sections", ptr-1);
347 flush_blocks (is, mb, ptr-1, r_buf, &firstpos, cat,
349 mb[0].block = mb[ptr-1].block;
350 mb[0].dirty = mb[ptr-1].dirty;
351 memcpy (r_buf, r_buf + mb[ptr-1].offset,
352 mb[ptr].offset - mb[ptr-1].offset);
355 mb[1].block = mb[ptr].block;
356 mb[1].dirty = mb[0].dirty;
357 mb[1].offset = mb[ptr].offset - mb[ptr-1].offset;
358 memcpy (r_buf + mb[1].offset, r_buf + r_offset,
359 new_offset - r_offset);
360 new_offset = (new_offset - r_offset) + mb[1].offset;
363 border = get_border (is, mb, ptr, cat, firstpos);
365 r_offset = new_offset;
367 if (cat < is->max_cat && ptr >= is->method->filecat[cat].mblocks)
369 /* Max number blocks in current category reached ->
370 must switch to next category (with larger block size)
374 (is->files[cat].no_remap)++;
375 /* delete all original block(s) read so far */
376 for (i = 0; i < ptr; i++)
378 isc_release_block (is, pp->cat, mb[i].block);
379 /* also delete all block to be read in the future */
382 /* remap block offsets */
383 assert (mb[j].offset == 0);
387 mb[ptr].offset = r_offset;
388 for (i = 1; i < ptr; i++)
390 int border = is->method->filecat[cat].ifill -
391 ISAMC_BLOCK_OFFSET_1 + mb[j].offset;
393 logf (LOG_LOG, "isc: remap %d border=%d", i, border);
394 if (mb[i+1].offset > border && mb[i].offset <= border)
397 logf (LOG_LOG, "isc: to %d %d", j, mb[i].offset);
400 mb[j].offset = mb[i].offset;
404 logf (LOG_LOG, "isc: remap from %d to %d sections to cat %d",
407 border = get_border (is, mb, ptr, cat, firstpos);
409 logf (LOG_LOG, "isc: border=%d r_offset=%d", border, r_offset);
412 if (mb[ptr].offset < r_offset)
413 { /* make the final boundary offset */
416 mb[ptr].offset = r_offset;
419 { /* empty output. Release last block if any */
420 if (cat == pp->cat && mb[ptr].block)
423 logf (LOG_LOG, "isc: release C");
424 isc_release_block (is, pp->cat, mb[ptr].block);
432 logf (LOG_LOG, "isc: flush C, %d sections", ptr);
436 /* we have to patch initial block with num keys if that
438 if (numKeys != isc_pp_num (pp))
441 logf (LOG_LOG, "isc: patch num keys firstpos=%d num=%d",
443 bf_write (is->files[cat].bf, firstpos, ISAMC_BLOCK_OFFSET_N,
444 sizeof(numKeys), &numKeys);
448 { /* we haven't flushed initial block yet and there surely are some
449 blocks to flush. Make first block dirty if numKeys differ */
450 if (numKeys != isc_pp_num (pp))
453 /* flush rest of block(s) in r_buf */
454 flush_blocks (is, mb, ptr, r_buf, &firstpos, cat, 1, &numKeys);
456 (*is->method->code_stop)(ISAMC_ENCODE, r_clientData);
460 logf (LOG_LOG, "isc: isc_merge return %d %d", cat, firstpos);
462 return cat + firstpos * 8;
465 char *hexdump(unsigned char *p, int len, char *buff) {
466 static char localbuff[128];
468 if (!buff) buff=localbuff;
471 sprintf(bytebuff,"%02x",*p);
473 strcat(buff,bytebuff);
474 if (len) strcat(buff,",");
479 ISAMC_P isamh_append (ISAMH is, ISAMH_P ipos, ISAMH_I data)
484 char *f_item_ptr=f_item;
489 int i_more=1, i_mode, i;
493 char codebuffer[128];
498 void *r_clientData; /* encode client data */
505 pp = firstpp = isamh_pp_open (is, ipos);
506 assert (*is->method->code_reset);
511 pp->pos = isamh_alloc_block(is,pp->cat);
512 pp->size= pp->offset = ISAMH_BLOCK_OFFSET_1 ;
513 logf(LOG_LOG,"isamh_append: starting with new block");
516 { /* existing block */
517 if (firstpp->lastblock == firstpp->pos)
518 { /* only one block, we have it already */
519 pp->offset=ISAMH_BLOCK_OFFSET_1;
520 logf(LOG_LOG,"isamh_append: starting with one block");
523 { /* TODO: Read the last block (into what buffer?) */
524 pp->offset=ISAMH_BLOCK_OFFSET_N;
525 logf(LOG_LOG,"isamh_append: starting with multiple blocks");
527 /* read pointers in it to synchronize the encoder ??!! */
531 } /* existing block */
533 r_clientData = (*is->method->code_start)(ISAMH_ENCODE);
536 i_more = (*data->read_item)(data->clientData,&i_item_ptr,&i_mode);
537 logf(LOG_LOG,"isamh_append 1: m=%d l=%d %s",
538 i_mode, i_item_ptr-i_item, hexdump(i_item,i_item_ptr-i_item,0));
540 maxsize = is->method->filecat[pp->cat].bsize;
543 codeptr = codebuffer;
545 (*is->method->code_item)(ISAMH_ENCODE, r_clientData, &codeptr, &i_item_ptr);
546 codelen = codeptr-codebuffer;
548 assert( (codelen < 128) && (codelen>0));
550 logf(LOG_LOG,"isamh_append: coded into %d:%s",
551 codelen,hexdump(codebuffer,codelen,0));
554 if ( pp->offset + codelen > maxsize )
556 logf(LOG_LOG,"isamh_append: need new block: %d > %d ",
557 pp->offset + codelen, maxsize );
558 newcat = pp->cat; /* TODO - grow that block some day... */
559 newblock = isamh_alloc_block(is,newcat);
562 { /* not first block, write to disk already now */
563 isamh_buildlaterblock(pp);
564 isamh_write_block(is,pp->cat,pp->pos,pp->buf);
569 { /* we had only one block, allocate a second buffer */
570 pp = (ISAMH_PP) xmalloc (sizeof(*pp));
572 *pp = *firstpp; /* copy most fields directly over */
573 pp->buf = (char *) xmalloc (is->method->filecat[newcat].bsize);
577 pp->size=pp->offset=ISAMH_BLOCK_OFFSET_N ;
579 logf(LOG_LOG,"isamh_append: got a new block %d",pp->pos);
581 /* reset the encoding, and code again */
582 (*is->method->code_reset)(r_clientData);
583 codeptr = codebuffer;
585 (*is->method->code_item)(ISAMH_ENCODE, r_clientData, &codeptr, &i_item_ptr);
586 codelen = codeptr-codebuffer;
587 logf(LOG_LOG,"isamh_append: coded again %d:%s",
588 codelen,hexdump(codebuffer,codelen,0));
590 } /* new block needed */
592 /* ok, now we can write it */
593 memcpy(&(pp->buf[pp->offset]), codebuffer, codelen);
594 pp->offset += codelen;
598 /* and try to read the next element */
600 i_more = (*data->read_item)(data->clientData,&i_item_ptr,&i_mode);
601 logf(LOG_LOG,"isamh_append 2: m=%d l=%d %s",
602 i_mode, i_item_ptr-i_item, hexdump(i_item,i_item_ptr-i_item,0));
606 /* Write the last (partial) block, if needed. */
609 isamh_buildlaterblock(pp);
610 isamh_write_block(is,pp->cat,pp->pos,pp->buf);
613 /* update first block and write it */
614 firstpp->lastblock = pp->pos;
615 isamh_buildfirstblock(firstpp);
616 isamh_write_block(is,firstpp->cat,firstpp->pos,firstpp->buf);
618 /* release the second block, if we allocated one */
625 retval = firstpp->pos*8 + firstpp->cat;
627 isamh_pp_close(firstpp);
633 ISAMC_P test_isamh_append (ISAMH is, ISAMH_P ipos, ISAMH_I data)
634 /* test routines while fighting it */
636 /* ipos is always ==0, in my test, as I have no earlier base to insert */
637 /* into. The key extractor calls this only once for each key to be inserted */
642 char *f_item_ptr=f_item;
647 int i_more=1, i_mode, i;
649 pp = isamh_pp_open (is, ipos);
650 logf (LOG_LOG, "isamh_append:scannig fmore loop (ipos=%d)",ipos);
654 fmore = isamh_read_item (pp,&f_item_ptr);
655 logf (LOG_LOG, "isamh_append: fmore=%d len=%d",
656 fmore, f_item_ptr-f_item);
659 logf (LOG_LOG, "isamh_append:scannig imore loop");
663 i_more = (*data->read_item)(data->clientData,&i_item_ptr,&i_mode);
664 logf(LOG_LOG,"isamh_append: mode=%d len=%d",i_mode, i_item_ptr-i_item);
668 } /* foo isamh_append */
672 ISAMC_P old_isamh_append (ISAMH is, ISAMH_P ipos, ISAMH_I data)
675 char i_item[128], *i_item_ptr;
676 int i_more, i_mode, i;
679 char f_item[128], *f_item_ptr;
682 int debug = is->method->debug;
684 struct isc_merge_block mb[200];
688 char r_item_buf[128]; /* temporary result output */
689 char *r_buf; /* block with resulting data */
690 int r_offset = 0; /* current offset in r_buf */
691 int ptr = 0; /* pointer */
692 void *r_clientData; /* encode client data */
696 r_clientData = (*is->method->code_start)(ISAMH_ENCODE);
697 r_buf = is->merge_buf + 128;
699 pp = isamh_pp_open (is, ipos);
700 /* read first item from file. make sure f_more indicates no boundary */
702 f_more = isamh_read_item (pp, &f_item_ptr);
708 logf (LOG_LOG, "isc: isamh_append begin %d %d %d", cat, pp->pos, ipos);
710 /* read first item from i */
712 i_more = (*data->read_item)(data->clientData, &i_item_ptr, &i_mode);
714 mb[ptr].block = pp->pos; /* is zero if no block on disk */
718 border = is->method->filecat[cat].bsize;
719 /* border = get_border (is, mb, ptr, cat, firstpos); */
720 while (i_more || f_more)
722 char *r_item = r_item_buf;
727 /* block to block boundary in the original file. */
731 /* the resulting output is of the same category as the
735 #ifdef SKIPTHIS /* should not happen when just appending new records */
736 if (r_offset <= mb[ptr].offset +is->method->filecat[cat].mfill)
741 /* the resulting output block is too small/empty. Delete
742 the original (if any)
745 logf (LOG_LOG, "isc: release A");
747 isamh_release_block (is, pp->cat, mb[ptr].block);
748 mb[ptr].block = pp->pos;
757 /* indicate new boundary based on the original file */
758 mb[++ptr].block = pp->pos;
759 mb[ptr].dirty = last_dirty;
760 mb[ptr].offset = r_offset;
762 logf (LOG_LOG, "isc: bound ptr=%d,offset=%d",
764 if (cat==is->max_cat && ptr >= is->method->max_blocks_mem)
766 /* We are dealing with block(s) of max size. Block(s)
767 except 1 will be flushed.
770 logf (LOG_LOG, "isc: flush A %d sections", ptr);
771 flush_blocks ((ISAMC)is, mb, ptr-1, r_buf, &firstpos, cat,
773 mb[0].block = mb[ptr-1].block;
774 mb[0].dirty = mb[ptr-1].dirty;
775 memcpy (r_buf, r_buf + mb[ptr-1].offset,
776 mb[ptr].offset - mb[ptr-1].offset);
779 mb[1].block = mb[ptr].block;
780 mb[1].dirty = mb[ptr].dirty;
781 mb[1].offset = mb[ptr].offset - mb[ptr-1].offset;
783 r_offset = mb[ptr].offset;
787 /*border = get_border (is, mb, ptr, cat, firstpos);*/
788 border = is->method->filecat[cat].bsize;
796 cmp = (*is->method->compare_item)(i_item, f_item);
797 if (cmp == 0) /* insert i=f */
799 if (!i_mode) /* delete item? */
803 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
805 /* is next input item the same as current except
806 for the delete flag? */
807 cmp = (*is->method->compare_item)(i_item, f_item);
808 if (!cmp && i_mode) /* delete/insert nop? */
810 /* yes! insert as if it was an insert only */
811 memcpy (r_item, i_item, i_item_ptr - i_item);
813 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
818 /* no! delete the item */
826 memcpy (r_item, f_item, f_item_ptr - f_item);
830 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
835 f_more = isamh_read_item (pp, &f_item_ptr);
837 else if (cmp > 0) /* insert f */
839 memcpy (r_item, f_item, f_item_ptr - f_item);
842 f_more = isamh_read_item (pp, &f_item_ptr);
846 if (!i_mode) /* delete item which isn't there? */
848 logf (LOG_FATAL, "Inconsistent register at offset %d",
852 memcpy (r_item, i_item, i_item_ptr - i_item);
857 i_more = (*data->read_item)(data->clientData, &i_item_ptr,
860 if (r_item) /* insert resulting item? */
862 char *r_out_ptr = r_buf + r_offset;
865 (*is->method->code_item)(ISAMH_ENCODE, r_clientData,
866 &r_out_ptr, &r_item);
867 new_offset = r_out_ptr - r_buf;
871 if (border < new_offset && border >= r_offset)
874 logf (LOG_LOG, "isc: border %d %d", ptr, border);
875 /* Max size of current block category reached ...
876 make new virtual block entry */
879 mb[ptr].offset = r_offset;
880 if (cat == is->max_cat && ptr >= is->method->max_blocks_mem)
882 /* We are dealing with block(s) of max size. Block(s)
883 except one will be flushed. Note: the block(s) are
884 surely not the last one(s).
887 logf (LOG_LOG, "isc: flush B %d sections", ptr-1);
888 flush_blocks ((ISAMC)is, mb, ptr-1, r_buf, &firstpos, cat,
890 mb[0].block = mb[ptr-1].block;
891 mb[0].dirty = mb[ptr-1].dirty;
892 memcpy (r_buf, r_buf + mb[ptr-1].offset,
893 mb[ptr].offset - mb[ptr-1].offset);
896 mb[1].block = mb[ptr].block;
897 mb[1].dirty = mb[0].dirty;
898 mb[1].offset = mb[ptr].offset - mb[ptr-1].offset;
899 memcpy (r_buf + mb[1].offset, r_buf + r_offset,
900 new_offset - r_offset);
901 new_offset = (new_offset - r_offset) + mb[1].offset;
904 border = is->method->filecat[cat].bsize;
905 /* get_border (is, mb, ptr, cat, firstpos); */
907 r_offset = new_offset;
909 #ifdef SKIPTHIS /* categories are handled differently in isamH */
910 /* to be implemented later... */
912 if (cat < is->max_cat && ptr >= is->method->filecat[cat].mblocks)
914 /* Max number blocks in current category reached ->
915 must switch to next category (with larger block size)
919 (is->files[cat].no_remap)++;
920 /* delete all original block(s) read so far */
921 for (i = 0; i < ptr; i++)
923 isamh_release_block (is, pp->cat, mb[i].block);
924 /* also delete all block to be read in the future */
927 /* remap block offsets */
928 assert (mb[j].offset == 0);
932 mb[ptr].offset = r_offset;
933 for (i = 1; i < ptr; i++)
935 int border = is->method->filecat[cat].ifill -
936 ISAMH_BLOCK_OFFSET_1 + mb[j].offset;
938 logf (LOG_LOG, "isc: remap %d border=%d", i, border);
939 if (mb[i+1].offset > border && mb[i].offset <= border)
942 logf (LOG_LOG, "isc: to %d %d", j, mb[i].offset);
945 mb[j].offset = mb[i].offset;
949 logf (LOG_LOG, "isc: remap from %d to %d sections to cat %d",
952 border = is->method->filecat[cat].bsize;
953 /*border = get_border (is, mb, ptr, cat, firstpos);*/
955 logf (LOG_LOG, "isc: border=%d r_offset=%d", border, r_offset);
957 #endif /* skipthis */
960 if (mb[ptr].offset < r_offset)
961 { /* make the final boundary offset */
964 mb[ptr].offset = r_offset;
967 { /* empty output. Release last block if any */
968 if (cat == pp->cat && mb[ptr].block)
971 logf (LOG_LOG, "isc: release C");
972 isamh_release_block (is, pp->cat, mb[ptr].block);
980 logf (LOG_LOG, "isc: flush C, %d sections", ptr);
984 /* we have to patch initial block with num keys if that
986 if (numKeys != isamh_pp_num (pp))
989 logf (LOG_LOG, "isc: patch num keys firstpos=%d num=%d",
991 bf_write (is->files[cat].bf, firstpos, ISAMH_BLOCK_OFFSET_N,
992 sizeof(numKeys), &numKeys);
996 { /* we haven't flushed initial block yet and there surely are some
997 blocks to flush. Make first block dirty if numKeys differ */
998 if (numKeys != isamh_pp_num (pp))
1001 /* flush rest of block(s) in r_buf */
1002 flush_blocks ((ISAMC)is, mb, ptr, r_buf, &firstpos, cat, 1, &numKeys);
1004 (*is->method->code_stop)(ISAMH_ENCODE, r_clientData);
1008 logf (LOG_LOG, "isc: isamh_append return %d %d", cat, firstpos);
1009 isamh_pp_close (pp);
1010 return cat + firstpos * 8;
1012 #endif /* SKIPOLDISAM */
1016 * Revision 1.13 1999-07-06 09:37:05 heikki
1017 * Working on isamh - not ready yet.
1019 * Revision 1.12 1999/06/30 15:03:55 heikki
1020 * first take on isamh, the append-only isam structure
1022 * Revision 1.11 1999/05/26 07:49:14 adam
1025 * Revision 1.10 1998/03/19 12:22:09 adam
1028 * Revision 1.9 1998/03/19 10:04:38 adam
1031 * Revision 1.8 1998/03/18 09:23:55 adam
1032 * Blocks are stored in chunks on free list - up to factor 2 in speed.
1033 * Fixed bug that could occur in block category rearrangemen.
1035 * Revision 1.7 1998/03/11 11:18:18 adam
1036 * Changed the isc_merge to take into account the mfill (minimum-fill).
1038 * Revision 1.6 1998/03/06 13:54:03 adam
1039 * Fixed two nasty bugs in isc_merge.
1041 * Revision 1.5 1997/02/12 20:42:43 adam
1042 * Bug fix: during isc_merge operations, some pages weren't marked dirty
1043 * even though they should be. At this point the merge operation marks
1044 * a page dirty if the previous page changed at all. A better approach is
1045 * to mark it dirty if the last key written changed in previous page.
1047 * Revision 1.4 1996/11/08 11:15:31 adam
1048 * Number of keys in chain are stored in first block and the function
1049 * to retrieve this information, isc_pp_num is implemented.
1051 * Revision 1.3 1996/11/04 14:08:59 adam
1052 * Optimized free block usage.
1054 * Revision 1.2 1996/11/01 13:36:46 adam
1055 * New element, max_blocks_mem, that control how many blocks of max size
1056 * to store in memory during isc_merge.
1057 * Function isc_merge now ignores delete/update of identical keys and
1058 * the proper blocks are then non-dirty and not written in flush_blocks.
1060 * Revision 1.1 1996/11/01 08:59:15 adam
1061 * First version of isc_merge that supports update/delete.