1 /* $Id: reckeys.c,v 1.12 2007-01-15 15:10:17 adam Exp $
2 Copyright (C) 1995-2007
5 This file is part of the Zebra server.
7 Zebra is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
31 #include <yaz/xmalloc.h>
36 struct zebra_rec_word_entry {
41 struct zebra_rec_word_entry *next;
42 struct zebra_rec_key_entry *keys;
43 struct zebra_rec_key_entry **last_key;
46 struct zebra_rec_key_entry {
48 struct zebra_rec_key_entry *next;
51 struct zebra_rec_key_entry {
55 struct zebra_rec_key_entry *next;
59 struct zebra_rec_keys_t_ {
71 struct zebra_rec_word_entry **entries;
73 struct zebra_rec_key_entry **entries;
79 struct zebra_rec_word_entry **zebra_rec_keys_mk_hash(zebra_rec_keys_t p,
87 for (i = 0; i<len; i++)
88 h = h * 65509 + buf[i];
89 return &p->entries[h % (unsigned) p->hash_size];
92 struct zebra_rec_key_entry **zebra_rec_keys_mk_hash(zebra_rec_keys_t p,
95 const struct it_key *key)
101 h = key->mem[key->len-1];
103 for (i = 0; i<len; i++)
104 h = h * 65509 + buf[i];
105 for (j = 0; j<key->len; j++)
106 h = h * 65509 + CAST_ZINT_TO_INT(key->mem[j]);
108 return &p->entries[h % (unsigned) p->hash_size];
112 static void init_hash(zebra_rec_keys_t p)
119 p->entries = nmem_malloc(p->nmem, p->hash_size * sizeof(*p->entries));
120 for (i = 0; i<p->hash_size; i++)
125 zebra_rec_keys_t zebra_rec_keys_open(void)
127 zebra_rec_keys_t p = xmalloc(sizeof(*p));
132 p->owner_of_buffer = 1;
133 p->encode_handle = iscz1_start();
134 p->decode_handle = iscz1_start();
136 p->nmem = nmem_create();
137 p->hash_size = 32767;
145 void zebra_rec_keys_set_buf(zebra_rec_keys_t p, char *buf, size_t sz,
148 if (p->owner_of_buffer)
162 p->buf = xmalloc(sz);
163 memcpy(p->buf, buf, sz);
166 p->owner_of_buffer = copy_buf;
169 void zebra_rec_keys_get_buf(zebra_rec_keys_t p, char **buf, size_t *sz)
179 void zebra_rec_keys_close(zebra_rec_keys_t p)
184 if (p->owner_of_buffer)
186 if (p->encode_handle)
187 iscz1_stop(p->encode_handle);
188 if (p->decode_handle)
189 iscz1_stop(p->decode_handle);
190 nmem_destroy(p->nmem);
195 void zebra_rec_keys_write(zebra_rec_keys_t keys,
196 const char *str, size_t slen,
197 const struct it_key *key)
200 const char *src = (char*) key;
202 struct zebra_rec_word_entry **wep;
203 struct zebra_rec_key_entry **kep;
204 int ord = key->mem[0];
205 int seq = key->mem[key->len-1];
207 assert(keys->owner_of_buffer);
209 wep = zebra_rec_keys_mk_hash(keys, str, slen, ord);
213 struct zebra_rec_word_entry *e = *wep;
214 if (ord == e->ord && slen == e->len && !memcmp(str, e->buf, slen))
221 *wep = nmem_malloc(keys->nmem, sizeof(**wep));
222 (*wep)->buf = nmem_malloc(keys->nmem, slen);
223 memcpy((*wep)->buf, str, slen);
229 (*wep)->last_key = &(*wep)->keys;
231 if (seq > (*wep)->max_seq)
232 kep = (*wep)->last_key;
238 if (!key_compare(key, &(*kep)->key))
243 *kep = nmem_malloc(keys->nmem, sizeof(**kep));
245 (*wep)->last_key = &(*kep)->next;
246 memcpy(&(*kep)->key, key, sizeof(*key));
247 if (seq > (*wep)->max_seq)
249 (*wep)->max_seq = seq;
253 int zebra_rec_keys_add_hash(zebra_rec_keys_t keys,
254 const char *str, size_t slen,
255 const struct it_key *key)
257 struct zebra_rec_key_entry **kep_first
258 = zebra_rec_keys_mk_hash(keys, str, slen, key);
259 struct zebra_rec_key_entry **kep = kep_first;
262 struct zebra_rec_key_entry *e = *kep;
263 if (slen == e->len && !memcmp(str, e->buf, slen) &&
264 !key_compare(key, &e->key))
266 *kep = (*kep)->next; /* out of queue */
267 e->next = *kep_first; /* move to front */
274 *kep = nmem_malloc(keys->nmem, sizeof(**kep));
277 memcpy(&(*kep)->key, key, sizeof(*key));
278 (*kep)->buf = nmem_malloc(keys->nmem, slen);
279 memcpy((*kep)->buf, str, slen);
283 void zebra_rec_keys_write(zebra_rec_keys_t keys,
284 const char *str, size_t slen,
285 const struct it_key *key)
288 const char *src = (char*) key;
290 assert(keys->owner_of_buffer);
293 if (!zebra_rec_keys_add_hash(keys, str, slen, key))
296 yaz_log(YLOG_LOG, "dup key slen=%d %.*s "
297 "ord=" ZINT_FORMAT " seq=" ZINT_FORMAT,
298 slen, slen, str, key->mem[0], key->mem[key->len-1]);
300 return; /* key already there . Omit it */
303 if (keys->buf_used+1024 > keys->buf_max)
305 char *b = (char *) xmalloc (keys->buf_max += 128000);
306 if (keys->buf_used > 0)
307 memcpy (b, keys->buf, keys->buf_used);
311 dst = keys->buf + keys->buf_used;
313 iscz1_encode(keys->encode_handle, &dst, &src);
315 memcpy (dst, str, slen);
318 keys->buf_used = dst - keys->buf;
322 void zebra_rec_keys_reset(zebra_rec_keys_t keys)
327 iscz1_reset(keys->encode_handle);
332 int zebra_rec_keys_rewind(zebra_rec_keys_t keys)
335 iscz1_reset(keys->decode_handle);
338 if (keys->buf_used == 0)
341 for (i = 0; i<keys->hash_size; i++)
343 struct zebra_rec_word_entry *we = keys->entries[i];
344 for (; we; we = we->next)
346 struct zebra_rec_key_entry *ke = we->keys;
347 for (; ke; ke = ke->next)
349 const char *src = (char*) &ke->key;
351 if (keys->buf_used+1024 > keys->buf_max)
353 char *b = (char *) xmalloc (keys->buf_max += 128000);
354 if (keys->buf_used > 0)
355 memcpy (b, keys->buf, keys->buf_used);
360 dst = keys->buf + keys->buf_used;
362 iscz1_encode(keys->encode_handle, &dst, &src);
364 memcpy (dst, we->buf, we->len);
367 keys->buf_used = dst - keys->buf;
374 keys->fetch_offset = 0;
375 if (keys->buf_used == 0)
380 int zebra_rec_keys_empty(zebra_rec_keys_t keys)
382 if (keys->buf_used == 0)
387 int zebra_rec_keys_read(zebra_rec_keys_t keys,
388 const char **str, size_t *slen,
392 if (keys->fetch_offset == keys->buf_used)
396 const char *src = keys->buf + keys->fetch_offset;
397 char *dst = (char*) key;
399 assert (keys->fetch_offset < keys->buf_used);
401 /* store the destination key */
402 iscz1_decode(keys->decode_handle, &dst, &src);
404 /* store pointer to string and length of it */
409 keys->fetch_offset = src - keys->buf;
416 * indent-tabs-mode: nil
418 * vim: shiftwidth=4 tabstop=8 expandtab