2 * Copyright (C) 1998, Index Data ApS
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.3 1999-05-26 07:49:13 adam
10 * Revision 1.2 1998/06/25 09:55:50 adam
11 * Minor changes - fixex headers.
21 #define SORT_IDX_BLOCKSIZE 64
30 struct sortFile *next;
31 struct sortFileHead head;
39 struct sortFile *current_file;
40 struct sortFile *files;
43 SortIdx sortIdx_open (BFiles bfs, int write_flag)
45 SortIdx si = (SortIdx) xmalloc (sizeof(*si));
47 si->write_flag = write_flag;
48 si->current_file = NULL;
50 si->entry_buf = (char *) xmalloc (SORT_IDX_ENTRYSIZE);
54 void sortIdx_close (SortIdx si)
56 struct sortFile *sf = si->files;
59 struct sortFile *sf_next = sf->next;
65 xfree (si->entry_buf);
69 int sortIdx_type (SortIdx si, int type)
73 if (si->current_file && si->current_file->type == type)
75 for (sf = si->files; sf; sf = sf->next)
78 si->current_file = sf;
81 sf = (struct sortFile *) xmalloc (sizeof(*sf));
85 si->current_file = si->files = sf;
86 sprintf (fname, "sort%d", type);
87 logf (LOG_DEBUG, "sort idx %s wr=%d", fname, si->write_flag);
88 sf->bf = bf_open (si->bfs, fname, SORT_IDX_BLOCKSIZE, si->write_flag);
91 if (!bf_read (sf->bf, 0, 0, sizeof(sf->head), &sf->head))
93 sf->head.sysno_max = 0;
100 void sortIdx_sysno (SortIdx si, int sysno)
105 void sortIdx_add (SortIdx si, const char *buf, int len)
107 if (!si->current_file || !si->current_file->bf)
109 if (len > SORT_IDX_ENTRYSIZE)
111 len = SORT_IDX_ENTRYSIZE;
112 memcpy (si->entry_buf, buf, len);
116 memcpy (si->entry_buf, buf, len);
117 memset (si->entry_buf+len, 0, SORT_IDX_ENTRYSIZE-len);
119 bf_write (si->current_file->bf, si->sysno+1, 0, 0, si->entry_buf);
122 void sortIdx_read (SortIdx si, char *buf)
124 bf_read (si->current_file->bf, si->sysno+1, 0, 0, buf);