2 * Copyright (C) 1998-2002, Index Data ApS
4 * Sebastian Hammer, Adam Dickmeiss
6 * $Id: sortidx.c,v 1.6 2002-02-18 11:46:58 adam Exp $
15 #define SORT_IDX_BLOCKSIZE 64
24 struct sortFile *next;
25 struct sortFileHead head;
33 struct sortFile *current_file;
34 struct sortFile *files;
37 SortIdx sortIdx_open (BFiles bfs, int write_flag)
39 SortIdx si = (SortIdx) xmalloc (sizeof(*si));
41 si->write_flag = write_flag;
42 si->current_file = NULL;
44 si->entry_buf = (char *) xmalloc (SORT_IDX_ENTRYSIZE);
48 void sortIdx_close (SortIdx si)
50 struct sortFile *sf = si->files;
53 struct sortFile *sf_next = sf->next;
59 xfree (si->entry_buf);
63 int sortIdx_type (SortIdx si, int type)
67 if (si->current_file && si->current_file->type == type)
69 for (sf = si->files; sf; sf = sf->next)
72 si->current_file = sf;
75 sf = (struct sortFile *) xmalloc (sizeof(*sf));
78 sprintf (fname, "sort%d", type);
79 logf (LOG_DEBUG, "sort idx %s wr=%d", fname, si->write_flag);
80 sf->bf = bf_open (si->bfs, fname, SORT_IDX_BLOCKSIZE, si->write_flag);
86 if (!bf_read (sf->bf, 0, 0, sizeof(sf->head), &sf->head))
88 sf->head.sysno_max = 0;
97 si->current_file = si->files = sf;
101 void sortIdx_sysno (SortIdx si, int sysno)
106 void sortIdx_add (SortIdx si, const char *buf, int len)
108 if (!si->current_file || !si->current_file->bf)
110 if (len > SORT_IDX_ENTRYSIZE)
112 len = SORT_IDX_ENTRYSIZE;
113 memcpy (si->entry_buf, buf, len);
117 memcpy (si->entry_buf, buf, len);
118 memset (si->entry_buf+len, 0, SORT_IDX_ENTRYSIZE-len);
120 bf_write (si->current_file->bf, si->sysno+1, 0, 0, si->entry_buf);
123 void sortIdx_read (SortIdx si, char *buf)
125 bf_read (si->current_file->bf, si->sysno+1, 0, 0, buf);