1 /* $FreeBSD: head/lib/libc/iconv/citrus_db_factory.c 219019 2011-02-25 00:04:39Z gabor $ */
2 /* $NetBSD: citrus_db_factory.c,v 1.9 2008/02/09 14:56:20 junyoung Exp $ */
5 * Copyright (c)2003 Citrus Project,
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 #include <sys/types.h>
32 #include <sys/queue.h>
34 #include <arpa/inet.h>
41 #include "citrus_namespace.h"
42 #include "citrus_region.h"
43 #include "citrus_db_file.h"
44 #include "citrus_db_factory.h"
46 struct _citrus_db_factory_entry {
47 STAILQ_ENTRY(_citrus_db_factory_entry) de_entry;
48 struct _citrus_db_factory_entry *de_next;
49 uint32_t de_hashvalue;
50 struct _region de_key;
52 struct _region de_data;
57 struct _citrus_db_factory {
58 size_t df_num_entries;
59 STAILQ_HEAD(, _citrus_db_factory_entry) df_entries;
60 size_t df_total_key_size;
61 size_t df_total_data_size;
62 uint32_t (*df_hashfunc)(struct _citrus_region *);
63 void *df_hashfunc_closure;
69 _citrus_db_factory_create(struct _citrus_db_factory **rdf,
70 _citrus_db_hash_func_t hashfunc, void *hashfunc_closure)
72 struct _citrus_db_factory *df;
74 df = malloc(sizeof(*df));
77 df->df_num_entries = 0;
78 df->df_total_key_size = df->df_total_data_size = 0;
79 STAILQ_INIT(&df->df_entries);
80 df->df_hashfunc = hashfunc;
81 df->df_hashfunc_closure = hashfunc_closure;
89 _citrus_db_factory_free(struct _citrus_db_factory *df)
91 struct _citrus_db_factory_entry *de;
93 while ((de = STAILQ_FIRST(&df->df_entries)) != NULL) {
94 STAILQ_REMOVE_HEAD(&df->df_entries, de_entry);
96 free(_region_head(&de->de_key));
98 free(_region_head(&de->de_data));
104 static __inline size_t
107 return ((sz + DB_ALIGN - 1) & ~(DB_ALIGN - 1));
111 _citrus_db_factory_add(struct _citrus_db_factory *df, struct _region *key,
112 int keyfree, struct _region *data, int datafree)
114 struct _citrus_db_factory_entry *de;
116 de = malloc(sizeof(*de));
120 de->de_hashvalue = df->df_hashfunc(key);
122 de->de_key_free = keyfree;
124 de->de_data_free = datafree;
127 STAILQ_INSERT_TAIL(&df->df_entries, de, de_entry);
128 df->df_total_key_size += _region_size(key);
129 df->df_total_data_size += ceilto(_region_size(data));
130 df->df_num_entries++;
137 _citrus_db_factory_add_by_string(struct _citrus_db_factory *df,
138 const char *key, struct _citrus_region *data, int datafree)
146 _region_init(&r, tmp, strlen(key));
147 return _citrus_db_factory_add(df, &r, 1, data, datafree);
151 _citrus_db_factory_add8_by_string(struct _citrus_db_factory *df,
152 const char *key, uint8_t val)
157 p = malloc(sizeof(*p));
161 _region_init(&r, p, 1);
162 return (_citrus_db_factory_add_by_string(df, key, &r, 1));
166 _citrus_db_factory_add16_by_string(struct _citrus_db_factory *df,
167 const char *key, uint16_t val)
172 p = malloc(sizeof(*p));
176 _region_init(&r, p, 2);
177 return (_citrus_db_factory_add_by_string(df, key, &r, 1));
181 _citrus_db_factory_add32_by_string(struct _citrus_db_factory *df,
182 const char *key, uint32_t val)
187 p = malloc(sizeof(*p));
191 _region_init(&r, p, 4);
192 return (_citrus_db_factory_add_by_string(df, key, &r, 1));
196 _citrus_db_factory_add_string_by_string(struct _citrus_db_factory *df,
197 const char *key, const char *data)
205 _region_init(&r, p, strlen(p) + 1);
206 return (_citrus_db_factory_add_by_string(df, key, &r, 1));
210 _citrus_db_factory_calc_size(struct _citrus_db_factory *df)
214 sz = ceilto(_CITRUS_DB_HEADER_SIZE);
215 sz += ceilto(_CITRUS_DB_ENTRY_SIZE * df->df_num_entries);
216 sz += ceilto(df->df_total_key_size);
217 sz += df->df_total_data_size;
223 put8(struct _region *r, size_t *rofs, uint8_t val)
226 *(uint8_t *)_region_offset(r, *rofs) = val;
231 put16(struct _region *r, size_t *rofs, uint16_t val)
235 memcpy(_region_offset(r, *rofs), &val, 2);
240 put32(struct _region *r, size_t *rofs, uint32_t val)
244 memcpy(_region_offset(r, *rofs), &val, 4);
249 putpad(struct _region *r, size_t *rofs)
253 for (i = ceilto(*rofs) - *rofs; i > 0; i--)
258 dump_header(struct _region *r, const char *magic, size_t *rofs,
262 while (*rofs<_CITRUS_DB_MAGIC_SIZE)
263 put8(r, rofs, *magic++);
264 put32(r, rofs, num_entries);
265 put32(r, rofs, _CITRUS_DB_HEADER_SIZE);
269 _citrus_db_factory_serialize(struct _citrus_db_factory *df, const char *magic,
272 struct _citrus_db_factory_entry *de, **depp, *det;
273 size_t dataofs, i, keyofs, nextofs, ofs;
276 /* check whether more than 0 entries exist */
277 if (df->df_num_entries == 0) {
278 dump_header(r, magic, &ofs, 0);
281 /* allocate hash table */
282 depp = malloc(sizeof(*depp) * df->df_num_entries);
285 for (i = 0; i < df->df_num_entries; i++)
288 /* step1: store the entries which are not conflicting */
289 STAILQ_FOREACH(de, &df->df_entries, de_entry) {
290 de->de_hashvalue %= df->df_num_entries;
293 if (depp[de->de_hashvalue] == NULL) {
294 depp[de->de_hashvalue] = de;
295 de->de_idx = (int)de->de_hashvalue;
299 /* step2: resolve conflicts */
301 STAILQ_FOREACH(de, &df->df_entries, de_entry) {
302 if (de->de_idx == -1) {
303 det = depp[de->de_hashvalue];
304 while (det->de_next != NULL)
307 while (depp[i] != NULL)
314 keyofs = _CITRUS_DB_HEADER_SIZE +
315 ceilto(df->df_num_entries*_CITRUS_DB_ENTRY_SIZE);
316 dataofs = keyofs + ceilto(df->df_total_key_size);
319 dump_header(r, magic, &ofs, df->df_num_entries);
322 for (i = 0; i < df->df_num_entries; i++) {
326 nextofs = _CITRUS_DB_HEADER_SIZE +
327 de->de_next->de_idx * _CITRUS_DB_ENTRY_SIZE;
329 put32(r, &ofs, de->de_hashvalue);
330 put32(r, &ofs, nextofs);
331 put32(r, &ofs, keyofs);
332 put32(r, &ofs, _region_size(&de->de_key));
333 put32(r, &ofs, dataofs);
334 put32(r, &ofs, _region_size(&de->de_data));
335 memcpy(_region_offset(r, keyofs),
336 _region_head(&de->de_key), _region_size(&de->de_key));
337 keyofs += _region_size(&de->de_key);
338 memcpy(_region_offset(r, dataofs),
339 _region_head(&de->de_data), _region_size(&de->de_data));
340 dataofs += _region_size(&de->de_data);