2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.16 1995-12-06 14:48:26 quinn
8 * Fixed some strange bugs.
10 * Revision 1.15 1995/12/06 09:59:45 quinn
11 * Fixed memory-consumption bug in memory.c
12 * Added more blocksizes to the default ISAM configuration.
14 * Revision 1.14 1995/11/24 17:26:19 quinn
15 * Mostly about making some ISAM stuff in the config file optional.
17 * Revision 1.13 1995/10/17 18:03:15 adam
18 * Commented out qsort in is_merge.
20 * Revision 1.12 1995/09/06 16:11:41 adam
21 * Keysize parameter to is_open (if non-zero).
23 * Revision 1.11 1995/09/04 12:33:46 adam
24 * Various cleanup. YAZ util used instead.
26 * Revision 1.10 1994/09/28 16:58:32 quinn
29 * Revision 1.9 1994/09/28 12:56:15 quinn
30 * Added access functions (ISPT)
32 * Revision 1.8 1994/09/28 12:32:17 quinn
35 * Revision 1.7 1994/09/28 11:56:25 quinn
36 * Added sort of input to is_merge
38 * Revision 1.6 1994/09/28 11:29:33 quinn
39 * Added cmp parameter.
41 * Revision 1.5 1994/09/27 20:03:50 quinn
42 * Seems relatively bug-free.
44 * Revision 1.4 1994/09/26 17:11:29 quinn
47 * Revision 1.3 1994/09/26 17:06:35 quinn
50 * Revision 1.1 1994/09/12 08:02:13 quinn
68 static int (*extcmp)(const void *p1, const void *p2);
69 static ispt_struct *ispt_freelist = 0;
71 static ISPT ispt_alloc()
78 ispt_freelist = ispt_freelist->next;
81 p = xmalloc(sizeof(ispt_struct));
85 static void ispt_free(ISPT pt)
87 pt->next = ispt_freelist;
91 static int splitargs(const char *s, char *bf[], int max)
96 while (*s && isspace(*s))
104 logf (LOG_WARN, "Ignoring extra args to is resource");
108 while (*s && !isspace(*s))
117 ISAM is_open(const char *name, int (*cmp)(const void *p1, const void *p2),
118 int writeflag, int keysize)
121 char *nm, *r, *pp[IS_MAX_BLOCKTYPES+1], m[2];
122 int num, size, rs, tmp, i;
125 logf (LOG_DEBUG, "is_open(%s, %s)", name, writeflag ? "RW" : "RDONLY");
126 new = xmalloc(sizeof(*new));
127 new->writeflag = writeflag;
128 for (i = 0; i < IS_MAX_BLOCKTYPES; i++)
129 new->types[i].index = 0; /* dummy */
131 /* determine number and size of blocktypes */
132 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
133 "blocktypes", 0), "64 512 4K 32K")) ||
134 !(num = splitargs(r, pp, IS_MAX_BLOCKTYPES)))
136 logf (LOG_FATAL, "Failed to locate resource %s", nm);
139 new->num_types = num;
140 for (i = 0; i < num; i++)
142 if ((rs = sscanf(pp[i], "%d%1[bBkKmM]", &size, m)) < 1)
144 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
152 new->types[i].blocksize = size; break;
154 new->types[i].blocksize = size * 1024; break;
156 new->types[i].blocksize = size * 1048576; break;
158 logf (LOG_FATAL, "Illegal size suffix: %c", *m);
161 new->types[i].dbuf = xmalloc(new->types[i].blocksize);
164 if (!(new->types[i].bf = bf_open(strconcat(name, m, 0),
165 new->types[i].blocksize, writeflag)))
167 logf (LOG_FATAL, "bf_open failed");
170 if ((rs = is_rb_read(&new->types[i], &th)) > 0)
172 if (th.blocksize != new->types[i].blocksize)
174 logf (LOG_FATAL, "File blocksize mismatch in %s", name);
177 new->types[i].freelist = th.freelist;
178 new->types[i].top = th.top;
180 else if (writeflag) /* write dummy superblock to determine top */
182 if ((rs = is_rb_write(&new->types[i], &th)) <=0) /* dummy */
184 logf (LOG_FATAL, "Failed to write initial superblock.");
187 new->types[i].freelist = -1;
188 new->types[i].top = rs;
190 /* ELSE: this is an empty file opened in read-only mode. */
193 new->keysize = keysize;
196 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
200 logf (LOG_FATAL, "Failed to locate resource %s", nm);
203 if ((new->keysize = atoi(r)) <= 0)
205 logf (LOG_FATAL, "Must specify positive keysize.");
210 /* determine repack percent */
211 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".", "repack",
212 0), IS_DEF_REPACK_PERCENT)))
214 logf (LOG_FATAL, "Failed to locate resource %s", nm);
217 new->repack = atoi(r);
219 /* determine max keys/blocksize */
220 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
221 "maxkeys", 0), "50 640 10000")) || !(num = splitargs(r, pp,
224 logf (LOG_FATAL, "Failed to locate resource %s", nm);
227 if (num < new->num_types -1)
229 logf (LOG_FATAL, "Not enough elements in %s", nm);
232 for (i = 0; i < num; i++)
234 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
236 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
239 new->types[i].max_keys = tmp;
242 /* determine max keys/block */
243 for (i = 0; i < new->num_types; i++)
245 if (!new->types[i].index)
247 new->types[i].max_keys_block = (new->types[i].blocksize - 2 *
248 sizeof(int)) / new->keysize;
249 new->types[i].max_keys_block0 = (new->types[i].blocksize - 3 *
250 sizeof(int)) / new->keysize;
253 new->types[i].max_keys_block = new->types[i].max_keys_block0 /
255 if (new->types[i].max_keys_block0 < 1)
257 logf (LOG_FATAL, "Blocksize too small in %s", name);
262 /* determine nice fill rates */
263 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
264 "nicefill", 0), "90 90 90 95")) || !(num = splitargs(r, pp,
267 logf (LOG_FATAL, "Failed to locate resource %s", nm);
270 if (num < new->num_types)
272 logf (LOG_FATAL, "Not enough elements in %s", nm);
275 for (i = 0; i < num; i++)
277 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
279 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
282 new->types[i].nice_keys_block = (new->types[i].max_keys_block0 * tmp) /
284 if (new->types[i].nice_keys_block < 1)
285 new->types[i].nice_keys_block = 1;
288 new->cmp = cmp ? cmp : is_default_cmp;
295 int is_close(ISAM is)
300 logf (LOG_DEBUG, "is_close()");
301 for (i = 0; i < is->num_types; i++)
307 th.blocksize = is->types[i].blocksize;
308 th.keysize = is->keysize;
309 th.freelist = is->types[i].freelist;
310 th.top = is->types[i].top;
311 if (is_rb_write(&is->types[i], &th) < 0)
313 logf (LOG_FATAL, "Failed to write headerblock");
317 bf_close(is->types[i].bf);
324 static ISAM_P is_address(int type, int pos)
333 int sort_input(const void *p1, const void *p2)
337 if ((rs = (*extcmp)(((char *)p1) + 1, ((char *)p2) + 1)))
339 return *((char *)p1) - *((char*)p2);
342 ISAM_P is_merge(ISAM is, ISAM_P pos, int num, char *data)
346 char keybuf[IS_MAX_RECORD];
347 int oldnum, oldtype, i;
348 char operation, *record;
352 qsort(data, num, is_keysize(is) + 1, sort_input);
354 is_m_establish_tab(is, &tab, pos);
356 if (is_m_read_full(&tab, tab.data) < 0)
358 logf (LOG_FATAL, "read_full failed");
361 oldnum = tab.num_records;
362 oldtype = tab.pos_type;
365 operation = *(data)++;
366 record = (char*) data;
367 data += is_keysize(is);
369 while (num && !memcmp(record - 1, data, is_keysize(tab.is) + 1))
371 data += 1 + is_keysize(is);
374 if ((res = is_m_seek_record(&tab, record)) > 0) /* no match */
376 if (operation == KEYOP_INSERT)
378 logf (LOG_DEBUG, "XXInserting new record.");
379 is_m_write_record(&tab, record);
382 logf (LOG_DEBUG, "XXDeletion failed to find match.");
384 else /* match found */
386 if (operation == KEYOP_INSERT)
388 logf (LOG_DEBUG, "XXSkipping insertion - match found.");
391 else if (operation == KEYOP_DELETE)
393 /* try to avoid needlessly moving data */
394 if (num && *(data) == KEYOP_INSERT)
396 /* next key is identical insert? - NOOP - skip it */
397 if (!memcmp(record, data + 1, is_keysize(is)))
399 logf (LOG_DEBUG, "XXNoop delete. skipping.");
400 data += 1 + is_keysize(is);
404 /* else check if next key can fit in this position */
405 is_m_peek_record(&tab, keybuf);
406 res = (*is->cmp)(data + 1, keybuf);
409 logf (LOG_DEBUG, "XXReplacing record.");
410 is_m_replace_record(&tab, data + 1);
411 data += 1 + is_keysize(is);
416 logf (LOG_DEBUG, "Deleting record.");
417 is_m_delete_record(&tab);
422 while (i < tab.is->num_types - 1 && tab.num_records >
423 tab.is->types[i].max_keys)
425 if (i != tab.pos_type)
430 if (!oldnum || tab.pos_type != oldtype || (abs(oldnum - tab.num_records) *
431 100) / oldnum > tab.is->repack)
438 pos = is_address(tab.pos_type, tab.data->diskpos);
442 is_m_release_tab(&tab);
447 * Locate a table of keys in an isam file. The ISPT is an individual
448 * position marker for that table.
450 ISPT is_position(ISAM is, ISAM_P pos)
455 is_m_establish_tab(is, &p->tab, pos);
462 void is_pt_free(ISPT ip)
464 is_m_release_tab(&ip->tab);
469 * Read a key from a table.
471 int is_readkey(ISPT ip, void *buf)
473 return is_m_read_record(&ip->tab, buf);
476 int is_numkeys(ISPT ip)
478 return is_m_num_records(&ip->tab);
481 void is_rewind(ISPT ip)
483 is_m_rewind(&ip->tab);