+ yaz_log(YLOG_WARN|YLOG_ERRNO, "cannot open %s", fname);
+ return ;
+ }
+ if (!f->length)
+ {
+ if ((f->length = lseek(fd, 0L, SEEK_END)) == (off_t) -1)
+ {
+ yaz_log(YLOG_WARN|YLOG_ERRNO, "cannot seek %s", fname);
+ close(fd);
+ return ;
+ }
+ }
+ if (lseek(fd, f->offset, SEEK_SET) == -1)
+ {
+ yaz_log(YLOG_WARN|YLOG_ERRNO, "cannot seek %s", fname);
+ close(fd);
+ return ;
+ }
+ while (f->chunk - nr > 0)
+ {
+ r = read(fd, f->buf + nr, f->chunk - nr);
+ if (r <= 0)
+ break;
+ nr += r;
+ }
+ if (r == -1)
+ {
+ yaz_log(YLOG_WARN|YLOG_ERRNO, "read of %s", fname);
+ close(fd);
+ return;
+ }
+ f->buf_size = nr;
+ if (f->readHandler)
+ (*f->readHandler)(f, f->readInfo);
+ close(fd);
+}
+
+void key_file_destroy(struct key_file *f)
+{
+ iscz1_stop(f->decode_handle);
+ xfree(f->buf);
+ xfree(f->prev_name);
+ xfree(f);
+}
+
+struct key_file *key_file_init(int no, int chunk, Res res)
+{
+ struct key_file *f;
+
+ f = (struct key_file *) xmalloc(sizeof(*f));
+ f->res = res;
+ f->decode_handle = iscz1_start();
+ f->no = no;
+ f->chunk = chunk;
+ f->offset = 0;
+ f->length = 0;
+ f->readHandler = NULL;
+ f->buf = (unsigned char *) xmalloc(f->chunk);
+ f->prev_name = (char *) xmalloc(INP_NAME_MAX);
+ *f->prev_name = '\0';
+ key_file_chunk_read(f);
+ return f;
+}
+
+int key_file_getc(struct key_file *f)
+{
+ if (f->buf_ptr < f->buf_size)
+ return f->buf[(f->buf_ptr)++];
+ if (f->buf_size < f->chunk)
+ return EOF;
+ f->offset += f->buf_size;
+ key_file_chunk_read(f);
+ if (f->buf_ptr < f->buf_size)
+ return f->buf[(f->buf_ptr)++];
+ else
+ return EOF;
+}
+
+int key_file_read(struct key_file *f, char *key)
+{
+ int i, c;
+ char srcbuf[128];
+ const char *src = srcbuf;
+ char *dst;
+ int j;
+
+ c = key_file_getc(f);
+ if (c == 0)
+ {
+ strcpy(key, f->prev_name);
+ i = 1+strlen(key);
+ }
+ else if (c == EOF)
+ return 0;
+ else
+ {
+ i = 0;
+ key[i++] = c;
+ while ((key[i++] = key_file_getc(f)))
+ ;
+ strcpy(f->prev_name, key);
+ iscz1_reset(f->decode_handle);
+ }
+ c = key_file_getc(f); /* length + insert/delete combined */
+ key[i++] = c & 128;
+ c = c & 127;
+ for (j = 0; j < c; j++)
+ srcbuf[j] = key_file_getc(f);
+ dst = key + i;
+ iscz1_decode(f->decode_handle, &dst, &src);
+
+#if 0
+ /* debugging */
+ if (1)
+ {
+ struct it_key k;
+ memcpy(&k, key+i, sizeof(k));
+ if (!k.mem[1])
+ yaz_log(YLOG_LOG, "00 KEY");
+ }
+#endif
+ return i + sizeof(struct it_key);
+}
+
+struct heap_info {
+ struct {
+ struct key_file **file;
+ char **buf;
+ } info;
+ int heapnum;
+ int *ptr;
+ int (*cmp)(const void *p1, const void *p2);
+ struct zebra_register *reg;
+ ZebraHandle zh;
+ int raw_reading; /* 1=raw /mem read. 0=file reading */
+ zint no_diffs;
+ zint no_updates;
+ zint no_deletions;
+ zint no_insertions;
+ zint no_iterations;
+};
+
+static struct heap_info *key_heap_malloc(void)
+{ /* malloc and clear it */
+ struct heap_info *hi;
+ hi = (struct heap_info *) xmalloc(sizeof(*hi));
+ hi->info.file = 0;
+ hi->info.buf = 0;
+ hi->heapnum = 0;
+ hi->ptr = 0;
+ hi->raw_reading = 0;
+ hi->no_diffs = 0;
+ hi->no_diffs = 0;
+ hi->no_updates = 0;
+ hi->no_deletions = 0;
+ hi->no_insertions = 0;
+ hi->no_iterations = 0;
+ return hi;
+}
+
+struct heap_info *key_heap_init_file(ZebraHandle zh,
+ int nkeys,
+ int (*cmp)(const void *p1, const void *p2))
+{
+ struct heap_info *hi;
+ int i;
+
+ hi = key_heap_malloc();
+ hi->zh = zh;
+ hi->info.file = (struct key_file **)
+ xmalloc(sizeof(*hi->info.file) * (1+nkeys));
+ hi->info.buf = (char **) xmalloc(sizeof(*hi->info.buf) * (1+nkeys));
+ hi->ptr = (int *) xmalloc(sizeof(*hi->ptr) * (1+nkeys));
+ hi->cmp = cmp;
+ for (i = 0; i<= nkeys; i++)
+ {
+ hi->ptr[i] = i;
+ hi->info.buf[i] = (char *) xmalloc(INP_NAME_MAX);
+ }
+ return hi;
+}
+
+struct heap_info *key_heap_init_raw(ZebraHandle zh,
+ int (*cmp)(const void *p1, const void *p2))
+{
+ struct heap_info *hi=key_heap_malloc();
+ hi->cmp = cmp;
+ hi->zh = zh;
+ hi->raw_reading = 1;
+ return hi;
+}
+
+void key_heap_destroy(struct heap_info *hi, int nkeys)
+{
+ int i;
+ if (!hi->raw_reading)
+ for (i = 0; i<=nkeys; i++)
+ xfree(hi->info.buf[i]);
+
+ xfree(hi->info.buf);
+ xfree(hi->ptr);
+ xfree(hi->info.file);
+ xfree(hi);
+}
+
+static void key_heap_swap(struct heap_info *hi, int i1, int i2)
+{
+ int swap;
+
+ swap = hi->ptr[i1];
+ hi->ptr[i1] = hi->ptr[i2];
+ hi->ptr[i2] = swap;
+}
+
+
+static void key_heap_delete(struct heap_info *hi)
+{
+ int cur = 1, child = 2;
+
+ assert(hi->heapnum > 0);
+
+ key_heap_swap(hi, 1, hi->heapnum);
+ hi->heapnum--;
+ while (child <= hi->heapnum) {
+ if (child < hi->heapnum &&
+ (*hi->cmp)(&hi->info.buf[hi->ptr[child]],
+ &hi->info.buf[hi->ptr[child+1]]) > 0)
+ child++;
+ if ((*hi->cmp)(&hi->info.buf[hi->ptr[cur]],
+ &hi->info.buf[hi->ptr[child]]) > 0)
+ {
+ key_heap_swap(hi, cur, child);
+ cur = child;
+ child = 2*cur;
+ }
+ else
+ break;
+ }
+}
+
+static void key_heap_insert(struct heap_info *hi, const char *buf, int nbytes,
+ struct key_file *kf)
+{
+ int cur, parent;
+
+ cur = ++(hi->heapnum);
+ memcpy(hi->info.buf[hi->ptr[cur]], buf, nbytes);
+ hi->info.file[hi->ptr[cur]] = kf;
+
+ parent = cur/2;
+ while (parent && (*hi->cmp)(&hi->info.buf[hi->ptr[parent]],
+ &hi->info.buf[hi->ptr[cur]]) > 0)
+ {
+ key_heap_swap(hi, cur, parent);
+ cur = parent;
+ parent = cur/2;
+ }
+}
+
+static int heap_read_one(struct heap_info *hi, char *name, char *key)
+{
+ int n, r;
+ char rbuf[INP_NAME_MAX];
+ struct key_file *kf;
+
+ if (!hi->heapnum)
+ return 0;
+ n = hi->ptr[1];
+ strcpy(name, hi->info.buf[n]);
+ kf = hi->info.file[n];
+ r = strlen(name);
+ memcpy(key, hi->info.buf[n] + r+1, KEY_SIZE);
+ key_heap_delete(hi);
+ if ((r = key_file_read(kf, rbuf)))
+ key_heap_insert(hi, rbuf, r, kf);
+ hi->no_iterations++;