2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.15 1995-12-06 09:59:45 quinn
8 * Fixed memory-consumption bug in memory.c
9 * Added more blocksizes to the default ISAM configuration.
11 * Revision 1.14 1995/11/24 17:26:19 quinn
12 * Mostly about making some ISAM stuff in the config file optional.
14 * Revision 1.13 1995/10/17 18:03:15 adam
15 * Commented out qsort in is_merge.
17 * Revision 1.12 1995/09/06 16:11:41 adam
18 * Keysize parameter to is_open (if non-zero).
20 * Revision 1.11 1995/09/04 12:33:46 adam
21 * Various cleanup. YAZ util used instead.
23 * Revision 1.10 1994/09/28 16:58:32 quinn
26 * Revision 1.9 1994/09/28 12:56:15 quinn
27 * Added access functions (ISPT)
29 * Revision 1.8 1994/09/28 12:32:17 quinn
32 * Revision 1.7 1994/09/28 11:56:25 quinn
33 * Added sort of input to is_merge
35 * Revision 1.6 1994/09/28 11:29:33 quinn
36 * Added cmp parameter.
38 * Revision 1.5 1994/09/27 20:03:50 quinn
39 * Seems relatively bug-free.
41 * Revision 1.4 1994/09/26 17:11:29 quinn
44 * Revision 1.3 1994/09/26 17:06:35 quinn
47 * Revision 1.1 1994/09/12 08:02:13 quinn
65 static int (*extcmp)(const void *p1, const void *p2);
66 static ispt_struct *ispt_freelist = 0;
68 static ISPT ispt_alloc()
75 ispt_freelist = ispt_freelist->next;
78 p = xmalloc(sizeof(ispt_struct));
82 static void ispt_free(ISPT pt)
84 pt->next = ispt_freelist;
88 static int splitargs(const char *s, char *bf[], int max)
93 while (*s && isspace(*s))
101 logf (LOG_WARN, "Ignoring extra args to is resource");
105 while (*s && !isspace(*s))
114 ISAM is_open(const char *name, int (*cmp)(const void *p1, const void *p2),
115 int writeflag, int keysize)
118 char *nm, *r, *pp[IS_MAX_BLOCKTYPES+1], m[2];
119 int num, size, rs, tmp, i;
122 logf (LOG_DEBUG, "is_open(%s, %s)", name, writeflag ? "RW" : "RDONLY");
123 new = xmalloc(sizeof(*new));
124 new->writeflag = writeflag;
125 for (i = 0; i < IS_MAX_BLOCKTYPES; i++)
126 new->types[i].index = 0; /* dummy */
128 /* determine number and size of blocktypes */
129 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
130 "blocktypes", 0), "64 512 4K 32K")) ||
131 !(num = splitargs(r, pp, IS_MAX_BLOCKTYPES)))
133 logf (LOG_FATAL, "Failed to locate resource %s", nm);
136 new->num_types = num;
137 for (i = 0; i < num; i++)
139 if ((rs = sscanf(pp[i], "%d%1[bBkKmM]", &size, m)) < 1)
141 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
149 new->types[i].blocksize = size; break;
151 new->types[i].blocksize = size * 1024; break;
153 new->types[i].blocksize = size * 1048576; break;
155 logf (LOG_FATAL, "Illegal size suffix: %c", *m);
158 new->types[i].dbuf = xmalloc(new->types[i].blocksize);
161 if (!(new->types[i].bf = bf_open(strconcat(name, m, 0),
162 new->types[i].blocksize, writeflag)))
164 logf (LOG_FATAL, "bf_open failed");
167 if ((rs = is_rb_read(&new->types[i], &th)) > 0)
169 if (th.blocksize != new->types[i].blocksize)
171 logf (LOG_FATAL, "File blocksize mismatch in %s", name);
174 new->types[i].freelist = th.freelist;
175 new->types[i].top = th.top;
177 else if (writeflag) /* write dummy superblock to determine top */
179 if ((rs = is_rb_write(&new->types[i], &th)) <=0) /* dummy */
181 logf (LOG_FATAL, "Failed to write initial superblock.");
184 new->types[i].freelist = -1;
185 new->types[i].top = rs;
187 /* ELSE: this is an empty file opened in read-only mode. */
190 new->keysize = keysize;
193 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
197 logf (LOG_FATAL, "Failed to locate resource %s", nm);
200 if ((new->keysize = atoi(r)) <= 0)
202 logf (LOG_FATAL, "Must specify positive keysize.");
207 /* determine repack percent */
208 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".", "repack",
209 0), IS_DEF_REPACK_PERCENT)))
211 logf (LOG_FATAL, "Failed to locate resource %s", nm);
214 new->repack = atoi(r);
216 /* determine max keys/blocksize */
217 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
218 "maxkeys", 0), "50 640 10000")) || !(num = splitargs(r, pp,
221 logf (LOG_FATAL, "Failed to locate resource %s", nm);
224 if (num < new->num_types -1)
226 logf (LOG_FATAL, "Not enough elements in %s", nm);
229 for (i = 0; i < num; i++)
231 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
233 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
236 new->types[i].max_keys = tmp;
239 /* determine max keys/block */
240 for (i = 0; i < new->num_types; i++)
242 if (!new->types[i].index)
244 new->types[i].max_keys_block = (new->types[i].blocksize - 2 *
245 sizeof(int)) / new->keysize;
246 new->types[i].max_keys_block0 = (new->types[i].blocksize - 3 *
247 sizeof(int)) / new->keysize;
250 new->types[i].max_keys_block = new->types[i].max_keys_block0 /
252 if (new->types[i].max_keys_block0 < 1)
254 logf (LOG_FATAL, "Blocksize too small in %s", name);
259 /* determine nice fill rates */
260 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
261 "nicefill", 0), "90 90 90 95")) || !(num = splitargs(r, pp,
264 logf (LOG_FATAL, "Failed to locate resource %s", nm);
267 if (num < new->num_types)
269 logf (LOG_FATAL, "Not enough elements in %s", nm);
272 for (i = 0; i < num; i++)
274 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
276 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
279 new->types[i].nice_keys_block = (new->types[i].max_keys_block0 * tmp) /
281 if (new->types[i].nice_keys_block < 1)
282 new->types[i].nice_keys_block = 1;
285 new->cmp = cmp ? cmp : is_default_cmp;
292 int is_close(ISAM is)
297 logf (LOG_DEBUG, "is_close()");
298 for (i = 0; i < is->num_types; i++)
304 th.blocksize = is->types[i].blocksize;
305 th.keysize = is->keysize;
306 th.freelist = is->types[i].freelist;
307 th.top = is->types[i].top;
308 if (is_rb_write(&is->types[i], &th) < 0)
310 logf (LOG_FATAL, "Failed to write headerblock");
314 bf_close(is->types[i].bf);
321 static ISAM_P is_address(int type, int pos)
330 int sort_input(const void *p1, const void *p2)
334 if ((rs = (*extcmp)(((char *)p1) + 1, ((char *)p2) + 1)))
336 return *((char *)p1) - *((char*)p2);
339 ISAM_P is_merge(ISAM is, ISAM_P pos, int num, char *data)
343 char keybuf[IS_MAX_RECORD];
344 int oldnum, oldtype, i;
345 char operation, *record;
349 qsort(data, num, is_keysize(is) + 1, sort_input);
351 is_m_establish_tab(is, &tab, pos);
353 if (is_m_read_full(&tab, tab.data) < 0)
355 logf (LOG_FATAL, "read_full failed");
358 oldnum = tab.num_records;
359 oldtype = tab.pos_type;
362 operation = *(data)++;
363 record = (char*) data;
364 data += is_keysize(is);
366 while (num && !memcmp(record - 1, data, is_keysize(tab.is) + 1))
368 data += 1 + is_keysize(is);
371 if ((res = is_m_seek_record(&tab, record)) > 0) /* no match */
373 if (operation == KEYOP_INSERT)
375 logf (LOG_DEBUG, "XXInserting new record.");
376 is_m_write_record(&tab, record);
379 logf (LOG_DEBUG, "XXDeletion failed to find match.");
381 else /* match found */
383 if (operation == KEYOP_INSERT)
385 logf (LOG_DEBUG, "XXSkipping insertion - match found.");
388 else if (operation == KEYOP_DELETE)
390 /* try to avoid needlessly moving data */
391 if (num && *(data) == KEYOP_INSERT)
393 /* next key is identical insert? - NOOP - skip it */
394 if (!memcmp(record, data + 1, is_keysize(is)))
396 logf (LOG_DEBUG, "XXNoop delete. skipping.");
397 data += 1 + is_keysize(is);
401 /* else check if next key can fit in this position */
402 is_m_peek_record(&tab, keybuf);
403 res = (*is->cmp)(data + 1, keybuf);
406 logf (LOG_DEBUG, "XXReplacing record.");
407 is_m_replace_record(&tab, data + 1);
408 data += 1 + is_keysize(is);
413 logf (LOG_DEBUG, "Deleting record.");
414 is_m_delete_record(&tab);
419 while (i < tab.is->num_types - 1 && tab.num_records >
420 tab.is->types[i].max_keys)
422 if (i != tab.pos_type)
427 if (!oldnum || tab.pos_type != oldtype || (abs(oldnum - tab.num_records) *
428 100) / oldnum > tab.is->repack)
435 pos = is_address(tab.pos_type, tab.data->diskpos);
439 is_m_release_tab(&tab);
444 * Locate a table of keys in an isam file. The ISPT is an individual
445 * position marker for that table.
447 ISPT is_position(ISAM is, ISAM_P pos)
452 is_m_establish_tab(is, &p->tab, pos);
459 void is_pt_free(ISPT ip)
461 is_m_release_tab(&ip->tab);
466 * Read a key from a table.
468 int is_readkey(ISPT ip, void *buf)
470 fprintf(stderr, "XXReadkey.\n");
471 return is_m_read_record(&ip->tab, buf);
474 int is_numkeys(ISPT ip)
476 fprintf(stderr, "XXNumkeys.\n");
477 return is_m_num_records(&ip->tab);
480 void is_rewind(ISPT ip)
482 is_m_rewind(&ip->tab);