2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.13 1995-10-17 18:03:15 adam
8 * Commented out qsort in is_merge.
10 * Revision 1.12 1995/09/06 16:11:41 adam
11 * Keysize parameter to is_open (if non-zero).
13 * Revision 1.11 1995/09/04 12:33:46 adam
14 * Various cleanup. YAZ util used instead.
16 * Revision 1.10 1994/09/28 16:58:32 quinn
19 * Revision 1.9 1994/09/28 12:56:15 quinn
20 * Added access functions (ISPT)
22 * Revision 1.8 1994/09/28 12:32:17 quinn
25 * Revision 1.7 1994/09/28 11:56:25 quinn
26 * Added sort of input to is_merge
28 * Revision 1.6 1994/09/28 11:29:33 quinn
29 * Added cmp parameter.
31 * Revision 1.5 1994/09/27 20:03:50 quinn
32 * Seems relatively bug-free.
34 * Revision 1.4 1994/09/26 17:11:29 quinn
37 * Revision 1.3 1994/09/26 17:06:35 quinn
40 * Revision 1.1 1994/09/12 08:02:13 quinn
58 static int (*extcmp)(const void *p1, const void *p2);
59 static ispt_struct *ispt_freelist = 0;
61 static ISPT ispt_alloc()
68 ispt_freelist = ispt_freelist->next;
71 p = xmalloc(sizeof(ispt_struct));
75 static void ispt_free(ISPT pt)
77 pt->next = ispt_freelist;
81 static int splitargs(const char *s, char *bf[], int max)
86 while (*s && isspace(*s))
94 logf (LOG_WARN, "Ignoring extra args to is resource");
98 while (*s && !isspace(*s))
107 ISAM is_open(const char *name, int (*cmp)(const void *p1, const void *p2),
108 int writeflag, int keysize)
111 char *nm, *r, *pp[IS_MAX_BLOCKTYPES+1], m[2];
112 int num, size, rs, tmp, i;
115 logf (LOG_DEBUG, "is_open(%s, %s)", name, writeflag ? "RW" : "RDONLY");
116 new = xmalloc(sizeof(*new));
117 new->writeflag = writeflag;
118 for (i = 0; i < IS_MAX_BLOCKTYPES; i++)
119 new->types[i].index = 0; /* dummy */
121 /* determine number and size of blocktypes */
122 if (!(r = res_get(common_resource, nm = strconcat(name, ".",
123 "blocktypes", 0))) || !(num = splitargs(r, pp, IS_MAX_BLOCKTYPES)))
125 logf (LOG_FATAL, "Failed to locate resource %s", nm);
128 new->num_types = num;
129 for (i = 0; i < num; i++)
131 if ((rs = sscanf(pp[i], "%d%1[bBkKmM]", &size, m)) < 1)
133 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
141 new->types[i].blocksize = size; break;
143 new->types[i].blocksize = size * 1024; break;
145 new->types[i].blocksize = size * 1048576; break;
147 logf (LOG_FATAL, "Illegal size suffix: %c", *m);
150 new->types[i].dbuf = xmalloc(new->types[i].blocksize);
153 if (!(new->types[i].bf = bf_open(strconcat(name, m, 0),
154 new->types[i].blocksize, writeflag)))
156 logf (LOG_FATAL, "bf_open failed");
159 if ((rs = is_rb_read(&new->types[i], &th)) > 0)
161 if (th.blocksize != new->types[i].blocksize)
163 logf (LOG_FATAL, "File blocksize mismatch in %s", name);
166 new->types[i].freelist = th.freelist;
167 new->types[i].top = th.top;
169 else if (writeflag) /* write dummy superblock to determine top */
171 if ((rs = is_rb_write(&new->types[i], &th)) <=0) /* dummy */
173 logf (LOG_FATAL, "Failed to write initial superblock.");
176 new->types[i].freelist = -1;
177 new->types[i].top = rs;
179 /* ELSE: this is an empty file opened in read-only mode. */
182 new->keysize = keysize;
185 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".",
189 logf (LOG_FATAL, "Failed to locate resource %s", nm);
192 if ((new->keysize = atoi(r)) <= 0)
194 logf (LOG_FATAL, "Must specify positive keysize.");
199 /* determine repack percent */
200 if (!(r = res_get_def(common_resource, nm = strconcat(name, ".", "repack",
201 0), IS_DEF_REPACK_PERCENT)))
203 logf (LOG_FATAL, "Failed to locate resource %s", nm);
206 new->repack = atoi(r);
208 /* determine max keys/blocksize */
209 if (!(r = res_get(common_resource, nm = strconcat(name, ".",
210 "maxkeys", 0))) || !(num = splitargs(r, pp, IS_MAX_BLOCKTYPES)))
212 logf (LOG_FATAL, "Failed to locate resource %s", nm);
215 if (num < new->num_types -1)
217 logf (LOG_FATAL, "Not enough elements in %s", nm);
220 for (i = 0; i < num; i++)
222 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
224 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
227 new->types[i].max_keys = tmp;
230 /* determine max keys/block */
231 for (i = 0; i < new->num_types; i++)
233 if (!new->types[i].index)
235 new->types[i].max_keys_block = (new->types[i].blocksize - 2 *
236 sizeof(int)) / new->keysize;
237 new->types[i].max_keys_block0 = (new->types[i].blocksize - 3 *
238 sizeof(int)) / new->keysize;
241 new->types[i].max_keys_block = new->types[i].max_keys_block0 /
243 if (new->types[i].max_keys_block0 < 1)
245 logf (LOG_FATAL, "Blocksize too small in %s", name);
250 /* determine nice fill rates */
251 if (!(r = res_get(common_resource, nm = strconcat(name, ".",
252 "nicefill", 0))) || !(num = splitargs(r, pp, IS_MAX_BLOCKTYPES)))
254 logf (LOG_FATAL, "Failed to locate resource %s", nm);
257 if (num < new->num_types)
259 logf (LOG_FATAL, "Not enough elements in %s", nm);
262 for (i = 0; i < num; i++)
264 if ((rs = sscanf(pp[i], "%d", &tmp)) < 1)
266 logf (LOG_FATAL, "Error in resource %s: %s", r, pp[i]);
269 new->types[i].nice_keys_block = (new->types[i].max_keys_block0 * tmp) /
271 if (new->types[i].nice_keys_block < 1)
272 new->types[i].nice_keys_block = 1;
275 new->cmp = cmp ? cmp : is_default_cmp;
282 int is_close(ISAM is)
287 logf (LOG_DEBUG, "is_close()");
288 for (i = 0; i < is->num_types; i++)
294 th.blocksize = is->types[i].blocksize;
295 th.keysize = is->keysize;
296 th.freelist = is->types[i].freelist;
297 th.top = is->types[i].top;
298 if (is_rb_write(&is->types[i], &th) < 0)
300 logf (LOG_FATAL, "Failed to write headerblock");
304 bf_close(is->types[i].bf);
311 static ISAM_P is_address(int type, int pos)
320 int sort_input(const void *p1, const void *p2)
324 if ((rs = (*extcmp)(((char *)p1) + 1, ((char *)p2) + 1)))
326 return *((char *)p1) - *((char*)p2);
329 ISAM_P is_merge(ISAM is, ISAM_P pos, int num, char *data)
333 char keybuf[IS_MAX_RECORD];
334 int oldnum, oldtype, i;
335 char operation, *record;
339 qsort(data, num, is_keysize(is) + 1, sort_input);
341 is_m_establish_tab(is, &tab, pos);
343 if (is_m_read_full(&tab, tab.data) < 0)
345 logf (LOG_FATAL, "read_full failed");
348 oldnum = tab.num_records;
349 oldtype = tab.pos_type;
352 operation = *(data)++;
353 record = (char*) data;
354 data += is_keysize(is);
356 while (num && !memcmp(record - 1, data, is_keysize(tab.is) + 1))
358 data += 1 + is_keysize(is);
361 if ((res = is_m_seek_record(&tab, record)) > 0) /* no match */
363 if (operation == KEYOP_INSERT)
365 logf (LOG_DEBUG, "XXInserting new record.");
366 is_m_write_record(&tab, record);
369 logf (LOG_DEBUG, "XXDeletion failed to find match.");
371 else /* match found */
373 if (operation == KEYOP_INSERT)
375 logf (LOG_DEBUG, "XXSkipping insertion - match found.");
378 else if (operation == KEYOP_DELETE)
380 /* try to avoid needlessly moving data */
381 if (num && *(data) == KEYOP_INSERT)
383 /* next key is identical insert? - NOOP - skip it */
384 if (!memcmp(record, data + 1, is_keysize(is)))
386 logf (LOG_DEBUG, "XXNoop delete. skipping.");
387 data += 1 + is_keysize(is);
391 /* else check if next key can fit in this position */
392 is_m_peek_record(&tab, keybuf);
393 res = (*is->cmp)(data + 1, keybuf);
396 logf (LOG_DEBUG, "XXReplacing record.");
397 is_m_replace_record(&tab, data + 1);
398 data += 1 + is_keysize(is);
403 logf (LOG_DEBUG, "Deleting record.");
404 is_m_delete_record(&tab);
409 while (i < tab.is->num_types - 1 && tab.num_records >
410 tab.is->types[i].max_keys)
412 if (i != tab.pos_type)
417 if (!oldnum || tab.pos_type != oldtype || (abs(oldnum - tab.num_records) *
418 100) / oldnum > tab.is->repack)
425 pos = is_address(tab.pos_type, tab.data->diskpos);
429 is_m_release_tab(&tab);
434 * Locate a table of keys in an isam file. The ISPT is an individual
435 * position marker for that table.
437 ISPT is_position(ISAM is, ISAM_P pos)
442 is_m_establish_tab(is, &p->tab, pos);
449 void is_pt_free(ISPT ip)
451 is_m_release_tab(&ip->tab);
456 * Read a key from a table.
458 int is_readkey(ISPT ip, void *buf)
460 return is_m_read_record(&ip->tab, buf);
463 int is_numkeys(ISPT ip)
465 return is_m_num_records(&ip->tab);
468 void is_rewind(ISPT ip)
470 is_m_rewind(&ip->tab);