2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.17 1995-12-06 15:48:44 quinn
8 * Fixed update-problem.
10 * Revision 1.16 1995/12/06 14:48:26 quinn
11 * Fixed some strange bugs.
13 * Revision 1.15 1995/12/06 09:59:45 quinn
14 * Fixed memory-consumption bug in memory.c
15 * Added more blocksizes to the default ISAM configuration.
17 * Revision 1.14 1995/11/24 17:26:19 quinn
18 * Mostly about making some ISAM stuff in the config file optional.
20 * Revision 1.13 1995/10/17 18:03:15 adam
21 * Commented out qsort in is_merge.
23 * Revision 1.12 1995/09/06 16:11:41 adam
24 * Keysize parameter to is_open (if non-zero).
26 * Revision 1.11 1995/09/04 12:33:46 adam
27 * Various cleanup. YAZ util used instead.
29 * Revision 1.10 1994/09/28 16:58:32 quinn
32 * Revision 1.9 1994/09/28 12:56:15 quinn
33 * Added access functions (ISPT)
35 * Revision 1.8 1994/09/28 12:32:17 quinn
38 * Revision 1.7 1994/09/28 11:56:25 quinn
39 * Added sort of input to is_merge
41 * Revision 1.6 1994/09/28 11:29:33 quinn
42 * Added cmp parameter.
44 * Revision 1.5 1994/09/27 20:03:50 quinn
45 * Seems relatively bug-free.
47 * Revision 1.4 1994/09/26 17:11:29 quinn
50 * Revision 1.3 1994/09/26 17:06:35 quinn
53 * Revision 1.1 1994/09/12 08:02:13 quinn
71 static int (*extcmp)(const void *p1, const void *p2);
72 static ispt_struct *ispt_freelist = 0;
74 static ISPT ispt_alloc()
81 ispt_freelist = ispt_freelist->next;
84 p = xmalloc(sizeof(ispt_struct));
88 static void ispt_free(ISPT pt)
90 pt->next = ispt_freelist;
94 static int splitargs(const char *s, char *bf[], int max)
99 while (*s && isspace(*s))
107 logf (LOG_WARN, "Ignoring extra args to is resource");
111 while (*s && !isspace(*s))
120 ISAM is_open(const char *name, int (*cmp)(const void *p1, const void *p2),
121 int writeflag, int keysize)
124 char *nm, *r, *pp[IS_MAX_BLOCKTYPES+1], m[2];
125 int num, size, rs, tmp, i;
128 logf (LOG_DEBUG, "is_open(%s, %s)", name, writeflag ? "RW" : "RDONLY");
129 new = xmalloc(sizeof(*new));
130 new->writeflag = writeflag;
131 for (i = 0; i < IS_MAX_BLOCKTYPES; i++)
132 new->types[i].index = 0; /* dummy */
134 /* determine number and size of blocktypes */
135 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
136 "blocktypes", 0), "64 512 4K 32K")) ||
137 !(num = splitargs(r, pp, IS_MAX_BLOCKTYPES)))
139 logf (LOG_FATAL, "Failed to locate resource %s", nm);
142 new->num_types = num;
143 for (i = 0; i < num; i++)
145 if ((rs = sscanf(pp[i], "%d%1[bBkKmM]", &size, m)) < 1)
147 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
155 new->types[i].blocksize = size; break;
157 new->types[i].blocksize = size * 1024; break;
159 new->types[i].blocksize = size * 1048576; break;
161 logf (LOG_FATAL, "Illegal size suffix: %c", *m);
164 new->types[i].dbuf = xmalloc(new->types[i].blocksize);
167 if (!(new->types[i].bf = bf_open(strconcat(name, m, 0),
168 new->types[i].blocksize, writeflag)))
170 logf (LOG_FATAL, "bf_open failed");
173 if ((rs = is_rb_read(&new->types[i], &th)) > 0)
175 if (th.blocksize != new->types[i].blocksize)
177 logf (LOG_FATAL, "File blocksize mismatch in %s", name);
180 new->types[i].freelist = th.freelist;
181 new->types[i].top = th.top;
183 else if (writeflag) /* write dummy superblock to determine top */
185 if ((rs = is_rb_write(&new->types[i], &th)) <=0) /* dummy */
187 logf (LOG_FATAL, "Failed to write initial superblock.");
190 new->types[i].freelist = -1;
191 new->types[i].top = rs;
193 /* ELSE: this is an empty file opened in read-only mode. */
196 new->keysize = keysize;
199 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
203 logf (LOG_FATAL, "Failed to locate resource %s", nm);
206 if ((new->keysize = atoi(r)) <= 0)
208 logf (LOG_FATAL, "Must specify positive keysize.");
213 /* determine repack percent */
214 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".", "repack",
215 0), IS_DEF_REPACK_PERCENT)))
217 logf (LOG_FATAL, "Failed to locate resource %s", nm);
220 new->repack = atoi(r);
222 /* determine max keys/blocksize */
223 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
224 "maxkeys", 0), "50 640 10000")) || !(num = splitargs(r, pp,
227 logf (LOG_FATAL, "Failed to locate resource %s", nm);
230 if (num < new->num_types -1)
232 logf (LOG_FATAL, "Not enough elements in %s", nm);
235 for (i = 0; i < num; i++)
237 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
239 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
242 new->types[i].max_keys = tmp;
245 /* determine max keys/block */
246 for (i = 0; i < new->num_types; i++)
248 if (!new->types[i].index)
250 new->types[i].max_keys_block = (new->types[i].blocksize - 2 *
251 sizeof(int)) / new->keysize;
252 new->types[i].max_keys_block0 = (new->types[i].blocksize - 3 *
253 sizeof(int)) / new->keysize;
256 new->types[i].max_keys_block = new->types[i].max_keys_block0 /
258 if (new->types[i].max_keys_block0 < 1)
260 logf (LOG_FATAL, "Blocksize too small in %s", name);
265 /* determine nice fill rates */
266 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
267 "nicefill", 0), "90 90 90 95")) || !(num = splitargs(r, pp,
270 logf (LOG_FATAL, "Failed to locate resource %s", nm);
273 if (num < new->num_types)
275 logf (LOG_FATAL, "Not enough elements in %s", nm);
278 for (i = 0; i < num; i++)
280 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
282 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
285 new->types[i].nice_keys_block = (new->types[i].max_keys_block0 * tmp) /
287 if (new->types[i].nice_keys_block < 1)
288 new->types[i].nice_keys_block = 1;
291 new->cmp = cmp ? cmp : is_default_cmp;
298 int is_close(ISAM is)
303 logf (LOG_DEBUG, "is_close()");
304 for (i = 0; i < is->num_types; i++)
310 th.blocksize = is->types[i].blocksize;
311 th.keysize = is->keysize;
312 th.freelist = is->types[i].freelist;
313 th.top = is->types[i].top;
314 if (is_rb_write(&is->types[i], &th) < 0)
316 logf (LOG_FATAL, "Failed to write headerblock");
320 bf_close(is->types[i].bf);
327 static ISAM_P is_address(int type, int pos)
336 int sort_input(const void *p1, const void *p2)
340 if ((rs = (*extcmp)(((char *)p1) + 1, ((char *)p2) + 1)))
342 return *((char *)p1) - *((char*)p2);
345 ISAM_P is_merge(ISAM is, ISAM_P pos, int num, char *data)
349 char keybuf[IS_MAX_RECORD];
350 int oldnum, oldtype, i;
351 char operation, *record;
355 qsort(data, num, is_keysize(is) + 1, sort_input);
357 is_m_establish_tab(is, &tab, pos);
359 if (is_m_read_full(&tab, tab.data) < 0)
361 logf (LOG_FATAL, "read_full failed");
364 oldnum = tab.num_records;
365 oldtype = tab.pos_type;
368 operation = *(data)++;
369 record = (char*) data;
370 data += is_keysize(is);
372 while (num && !memcmp(record - 1, data, is_keysize(tab.is) + 1))
374 data += 1 + is_keysize(is);
377 if ((res = is_m_seek_record(&tab, record)) > 0) /* no match */
379 if (operation == KEYOP_INSERT)
381 logf (LOG_DEBUG, "XXInserting new record.");
382 is_m_write_record(&tab, record);
385 logf (LOG_DEBUG, "XXDeletion failed to find match.");
387 else /* match found */
389 if (operation == KEYOP_INSERT)
391 logf (LOG_DEBUG, "XXSkipping insertion - match found.");
394 else if (operation == KEYOP_DELETE)
396 /* try to avoid needlessly moving data */
397 if (num && *(data) == KEYOP_INSERT)
399 /* next key is identical insert? - NOOP - skip it */
400 if (!memcmp(record, data + 1, is_keysize(is)))
402 logf (LOG_DEBUG, "XXNoop delete. skipping.");
403 data += 1 + is_keysize(is);
407 /* else check if next key can fit in this position */
408 is_m_peek_record(&tab, keybuf);
409 res = (*is->cmp)(data + 1, keybuf);
412 logf (LOG_DEBUG, "XXReplacing record.");
413 is_m_replace_record(&tab, data + 1);
414 data += 1 + is_keysize(is);
419 logf (LOG_DEBUG, "Deleting record.");
420 is_m_delete_record(&tab);
425 while (i < tab.is->num_types - 1 && tab.num_records >
426 tab.is->types[i].max_keys)
428 if (i != tab.pos_type)
433 if (!oldnum || tab.pos_type != oldtype || (abs(oldnum - tab.num_records) *
434 100) / oldnum > tab.is->repack)
441 pos = is_address(tab.pos_type, tab.data->diskpos);
445 is_m_release_tab(&tab);
450 * Locate a table of keys in an isam file. The ISPT is an individual
451 * position marker for that table.
453 ISPT is_position(ISAM is, ISAM_P pos)
458 is_m_establish_tab(is, &p->tab, pos);
465 void is_pt_free(ISPT ip)
467 is_m_release_tab(&ip->tab);
472 * Read a key from a table.
474 int is_readkey(ISPT ip, void *buf)
476 return is_m_read_record(&ip->tab, buf, 0);
479 int is_numkeys(ISPT ip)
481 return is_m_num_records(&ip->tab);
484 void is_rewind(ISPT ip)
486 is_m_rewind(&ip->tab);