1 /* TDB tools to create various canned database layouts. */
9 struct tdb_layout *new_tdb_layout(const char *filename)
11 struct tdb_layout *layout = malloc(sizeof(*layout));
12 layout->filename = filename;
13 layout->num_elems = 0;
18 static void add(struct tdb_layout *layout, union tdb_layout_elem elem)
20 layout->elem = realloc(layout->elem,
21 sizeof(layout->elem[0])
22 * (layout->num_elems+1));
23 layout->elem[layout->num_elems++] = elem;
26 void tdb_layout_add_freetable(struct tdb_layout *layout)
28 union tdb_layout_elem elem;
29 elem.base.type = FREETABLE;
33 void tdb_layout_add_free(struct tdb_layout *layout, tdb_len_t len,
36 union tdb_layout_elem elem;
37 elem.base.type = FREE;
39 elem.free.ftable_num = ftable;
43 static struct tdb_data dup_key(struct tdb_data key)
46 ret.dsize = key.dsize;
47 ret.dptr = malloc(ret.dsize);
48 memcpy(ret.dptr, key.dptr, ret.dsize);
52 void tdb_layout_add_used(struct tdb_layout *layout,
53 TDB_DATA key, TDB_DATA data,
56 union tdb_layout_elem elem;
57 elem.base.type = DATA;
58 elem.used.key = dup_key(key);
59 elem.used.data = dup_key(data);
60 elem.used.extra = extra;
64 static tdb_len_t free_record_len(tdb_len_t len)
66 return sizeof(struct tdb_used_record) + len;
69 static tdb_len_t data_record_len(struct tle_used *used)
72 len = sizeof(struct tdb_used_record)
73 + used->key.dsize + used->data.dsize + used->extra;
74 assert(len >= sizeof(struct tdb_free_record));
78 static tdb_len_t hashtable_len(struct tle_hashtable *htable)
80 return sizeof(struct tdb_used_record)
81 + (sizeof(tdb_off_t) << TDB_SUBLEVEL_HASH_BITS)
85 static tdb_len_t freetable_len(struct tle_freetable *ftable)
87 return sizeof(struct tdb_freetable);
90 static void set_free_record(void *mem, tdb_len_t len)
92 /* We do all the work in add_to_freetable */
95 static void set_data_record(void *mem, struct tdb_context *tdb,
96 struct tle_used *used)
98 struct tdb_used_record *u = mem;
100 set_header(tdb, u, TDB_USED_MAGIC, used->key.dsize, used->data.dsize,
101 used->key.dsize + used->data.dsize + used->extra,
102 tdb_hash(tdb, used->key.dptr, used->key.dsize));
103 memcpy(u + 1, used->key.dptr, used->key.dsize);
104 memcpy((char *)(u + 1) + used->key.dsize,
105 used->data.dptr, used->data.dsize);
108 static void set_hashtable(void *mem, struct tdb_context *tdb,
109 struct tle_hashtable *htable)
111 struct tdb_used_record *u = mem;
112 tdb_len_t len = sizeof(tdb_off_t) << TDB_SUBLEVEL_HASH_BITS;
114 set_header(tdb, u, TDB_HTABLE_MAGIC, 0, len, len + htable->extra, 0);
115 memset(u + 1, 0, len);
118 static void set_freetable(void *mem, struct tdb_context *tdb,
119 struct tle_freetable *freetable, struct tdb_header *hdr,
120 tdb_off_t last_ftable)
122 struct tdb_freetable *ftable = mem;
123 memset(ftable, 0, sizeof(*ftable));
124 set_header(tdb, &ftable->hdr, TDB_FTABLE_MAGIC, 0,
125 sizeof(*ftable) - sizeof(ftable->hdr),
126 sizeof(*ftable) - sizeof(ftable->hdr), 0);
129 ftable = (struct tdb_freetable *)((char *)hdr + last_ftable);
130 ftable->next = freetable->base.off;
132 hdr->free_table = freetable->base.off;
136 static void add_to_freetable(struct tdb_context *tdb,
140 struct tle_freetable *freetable)
142 tdb->ftable_off = freetable->base.off;
143 tdb->ftable = ftable;
144 add_free_record(tdb, eoff, sizeof(struct tdb_used_record) + elen);
147 static tdb_off_t hbucket_off(tdb_off_t group_start, unsigned ingroup)
150 + (ingroup % (1 << TDB_HASH_GROUP_BITS)) * sizeof(tdb_off_t);
153 /* Get bits from a value. */
154 static uint32_t bits(uint64_t val, unsigned start, unsigned num)
157 return (val >> start) & ((1U << num) - 1);
160 /* We take bits from the top: that way we can lock whole sections of the hash
161 * by using lock ranges. */
162 static uint32_t use_bits(uint64_t h, unsigned num, unsigned *used)
165 return bits(h, 64 - *used, num);
168 static tdb_off_t encode_offset(tdb_off_t new_off, unsigned bucket,
173 | ((uint64_t)bits(h, 64 - TDB_OFF_UPPER_STEAL_EXTRA,
174 TDB_OFF_UPPER_STEAL_EXTRA)
175 << TDB_OFF_HASH_EXTRA_BIT);
178 /* FIXME: Our hash table handling here is primitive: we don't expand! */
179 static void add_to_hashtable(struct tdb_context *tdb,
183 uint64_t h = tdb_hash(tdb, key.dptr, key.dsize);
184 tdb_off_t b_off, group_start;
185 unsigned i, group, in_group;
188 group = use_bits(h, TDB_TOPLEVEL_HASH_BITS-TDB_HASH_GROUP_BITS, &used);
189 in_group = use_bits(h, TDB_HASH_GROUP_BITS, &used);
191 group_start = offsetof(struct tdb_header, hashtable)
192 + group * (sizeof(tdb_off_t) << TDB_HASH_GROUP_BITS);
194 for (i = 0; i < (1 << TDB_HASH_GROUP_BITS); i++) {
195 unsigned bucket = (in_group + i) % (1 << TDB_HASH_GROUP_BITS);
197 b_off = hbucket_off(group_start, bucket);
198 if (tdb_read_off(tdb, b_off) == 0) {
199 tdb_write_off(tdb, b_off,
200 encode_offset(eoff, bucket, h));
207 static struct tle_freetable *find_ftable(struct tdb_layout *layout, unsigned num)
211 for (i = 0; i < layout->num_elems; i++) {
212 if (layout->elem[i].base.type != FREETABLE)
215 return &layout->elem[i].ftable;
221 /* FIXME: Support TDB_CONVERT */
222 struct tdb_context *tdb_layout_get(struct tdb_layout *layout)
225 tdb_off_t off, len, last_ftable;
227 struct tdb_context *tdb;
229 off = sizeof(struct tdb_header);
231 /* First pass of layout: calc lengths */
232 for (i = 0; i < layout->num_elems; i++) {
233 union tdb_layout_elem *e = &layout->elem[i];
235 switch (e->base.type) {
237 len = freetable_len(&e->ftable);
240 len = free_record_len(e->free.len);
243 len = data_record_len(&e->used);
246 len = hashtable_len(&e->hashtable);
255 /* Now populate our header, cribbing from a real TDB header. */
256 tdb = tdb_open(NULL, TDB_INTERNAL, O_RDWR, 0, &tap_log_attr);
257 memcpy(mem, tdb->map_ptr, sizeof(struct tdb_header));
259 /* Mug the tdb we have to make it use this. */
265 for (i = 0; i < layout->num_elems; i++) {
266 union tdb_layout_elem *e = &layout->elem[i];
267 switch (e->base.type) {
269 set_freetable(mem + e->base.off, tdb, &e->ftable,
270 (struct tdb_header *)mem, last_ftable);
271 last_ftable = e->base.off;
274 set_free_record(mem + e->base.off, e->free.len);
277 set_data_record(mem + e->base.off, tdb, &e->used);
280 set_hashtable(mem + e->base.off, tdb, &e->hashtable);
284 /* Must have a free table! */
287 /* Now fill the free and hash tables. */
288 for (i = 0; i < layout->num_elems; i++) {
289 union tdb_layout_elem *e = &layout->elem[i];
290 switch (e->base.type) {
292 add_to_freetable(tdb, e->base.off, e->free.len,
294 find_ftable(layout, e->free.ftable_num));
297 add_to_hashtable(tdb, e->base.off, e->used.key);
304 tdb->ftable_off = find_ftable(layout, 0)->base.off;
306 /* Get physical if they asked for it. */
307 if (layout->filename) {
308 int fd = open(layout->filename, O_WRONLY|O_TRUNC|O_CREAT,
311 err(1, "opening %s for writing", layout->filename);
312 if (write(fd, tdb->map_ptr, tdb->map_size) != tdb->map_size)
313 err(1, "writing %s", layout->filename);
316 /* NOMMAP is for lockcheck. */
317 tdb = tdb_open(layout->filename, TDB_NOMMAP, O_RDWR, 0,
324 void tdb_layout_free(struct tdb_layout *layout)
328 for (i = 0; i < layout->num_elems; i++) {
329 if (layout->elem[i].base.type == DATA) {
330 free(layout->elem[i].used.key.dptr);
331 free(layout->elem[i].used.data.dptr);