2 Trivial Database 2: free list/block handling
3 Copyright (C) Rusty Russell 2010
5 This library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 3 of the License, or (at your option) any later version.
10 This library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with this library; if not, see <http://www.gnu.org/licenses/>.
19 #include <ccan/likely/likely.h>
20 #include <ccan/ilog/ilog.h>
25 static unsigned fls64(uint64_t val)
30 /* In which bucket would we find a particular record size? (ignoring header) */
31 unsigned int size_to_bucket(tdb_len_t data_len)
35 /* We can't have records smaller than this. */
36 assert(data_len >= TDB_MIN_DATA_LEN);
38 /* Ignoring the header... */
39 if (data_len - TDB_MIN_DATA_LEN <= 64) {
40 /* 0 in bucket 0, 8 in bucket 1... 64 in bucket 8. */
41 bucket = (data_len - TDB_MIN_DATA_LEN) / 8;
43 /* After that we go power of 2. */
44 bucket = fls64(data_len - TDB_MIN_DATA_LEN) + 2;
47 if (unlikely(bucket >= TDB_FREE_BUCKETS))
48 bucket = TDB_FREE_BUCKETS - 1;
52 tdb_off_t first_flist(struct tdb_context *tdb)
54 return tdb_read_off(tdb, offsetof(struct tdb_header, free_list));
57 tdb_off_t next_flist(struct tdb_context *tdb, tdb_off_t flist)
59 return tdb_read_off(tdb, flist + offsetof(struct tdb_freelist, next));
62 int tdb_flist_init(struct tdb_context *tdb)
64 /* Use reservoir sampling algorithm to select a free list at random. */
65 unsigned int rnd, max = 0, count = 0;
68 tdb->flist_off = off = first_flist(tdb);
72 if (off == TDB_OFF_ERR)
82 off = next_flist(tdb, off);
88 /* Offset of a given bucket. */
89 tdb_off_t bucket_off(tdb_off_t flist_off, unsigned bucket)
91 return flist_off + offsetof(struct tdb_freelist, buckets)
92 + bucket * sizeof(tdb_off_t);
95 /* Returns free_buckets + 1, or list number to search. */
96 static tdb_off_t find_free_head(struct tdb_context *tdb,
100 /* Speculatively search for a non-zero bucket. */
101 return tdb_find_nonzero_off(tdb, bucket_off(flist_off, 0),
102 bucket, TDB_FREE_BUCKETS);
105 /* Remove from free bucket. */
106 static int remove_from_list(struct tdb_context *tdb,
107 tdb_off_t b_off, tdb_off_t r_off,
108 const struct tdb_free_record *r)
113 if (frec_prev(r) == 0) {
116 off = frec_prev(r) + offsetof(struct tdb_free_record, next);
120 if (tdb_read_off(tdb, off) != r_off) {
121 tdb->log(tdb, TDB_DEBUG_FATAL, tdb->log_priv,
122 "remove_from_list: %llu bad prev in list %llu\n",
123 (long long)r_off, (long long)b_off);
128 /* r->prev->next = r->next */
129 if (tdb_write_off(tdb, off, r->next)) {
134 off = r->next + offsetof(struct tdb_free_record,magic_and_prev);
135 /* r->next->prev = r->prev */
138 if (tdb_read_off(tdb, off) & TDB_OFF_MASK != r_off) {
139 tdb->log(tdb, TDB_DEBUG_FATAL, tdb->log_priv,
140 "remove_from_list: %llu bad list %llu\n",
141 (long long)r_off, (long long)b_off);
146 if (tdb_write_off(tdb, off, r->magic_and_prev)) {
153 /* Enqueue in this free bucket. */
154 static int enqueue_in_free(struct tdb_context *tdb,
159 struct tdb_free_record new;
160 uint64_t magic = (TDB_FREE_MAGIC << (64 - TDB_OFF_UPPER_STEAL));
162 /* We only need to set flist_and_len; rest is set in enqueue_in_free */
163 new.flist_and_len = ((uint64_t)tdb->flist << (64 - TDB_OFF_UPPER_STEAL))
166 new.magic_and_prev = magic;
168 /* new->next = head. */
169 new.next = tdb_read_off(tdb, b_off);
170 if (new.next == TDB_OFF_ERR)
175 if (tdb_read_off(tdb,
176 new.next + offsetof(struct tdb_free_record,
179 tdb->log(tdb, TDB_DEBUG_FATAL, tdb->log_priv,
180 "enqueue_in_free: %llu bad head prev %llu\n",
181 (long long)new.next, (long long)b_off);
185 /* next->prev = new. */
186 if (tdb_write_off(tdb, new.next
187 + offsetof(struct tdb_free_record,
193 if (tdb_write_off(tdb, b_off, off) != 0)
196 return tdb_write_convert(tdb, off, &new, sizeof(new));
199 /* List need not be locked. */
200 int add_free_record(struct tdb_context *tdb,
201 tdb_off_t off, tdb_len_t len_with_header)
207 assert(len_with_header >= sizeof(struct tdb_free_record));
209 len = len_with_header - sizeof(struct tdb_used_record);
211 b_off = bucket_off(tdb->flist_off, size_to_bucket(len));
212 if (tdb_lock_free_bucket(tdb, b_off, TDB_LOCK_WAIT) != 0)
215 ret = enqueue_in_free(tdb, b_off, off, len);
216 tdb_unlock_free_bucket(tdb, b_off);
220 static size_t adjust_size(size_t keylen, size_t datalen)
222 size_t size = keylen + datalen;
224 if (size < TDB_MIN_DATA_LEN)
225 size = TDB_MIN_DATA_LEN;
227 /* Round to next uint64_t boundary. */
228 return (size + (sizeof(uint64_t) - 1ULL)) & ~(sizeof(uint64_t) - 1ULL);
231 /* If we have enough left over to be useful, split that off. */
232 static size_t record_leftover(size_t keylen, size_t datalen,
233 bool want_extra, size_t total_len)
238 datalen += datalen / 2;
239 leftover = total_len - adjust_size(keylen, datalen);
241 if (leftover < (ssize_t)sizeof(struct tdb_free_record))
247 static tdb_off_t flist_offset(struct tdb_context *tdb, unsigned int flist)
252 if (likely(tdb->flist == flist))
253 return tdb->flist_off;
255 off = first_flist(tdb);
256 for (i = 0; i < flist; i++)
257 off = next_flist(tdb, off);
261 /* Note: we unlock the current bucket if we coalesce or fail. */
262 static int coalesce(struct tdb_context *tdb,
263 tdb_off_t off, tdb_off_t b_off, tdb_len_t data_len)
266 struct tdb_free_record rec;
268 add_stat(tdb, alloc_coalesce_tried, 1);
269 end = off + sizeof(struct tdb_used_record) + data_len;
271 while (end < tdb->map_size) {
272 const struct tdb_free_record *r;
274 unsigned flist, bucket;
276 r = tdb_access_read(tdb, end, sizeof(*r), true);
280 if (frec_magic(r) != TDB_FREE_MAGIC) {
281 tdb_access_release(tdb, r);
285 flist = frec_flist(r);
286 bucket = size_to_bucket(frec_len(r));
287 nb_off = bucket_off(flist_offset(tdb, flist), bucket);
288 tdb_access_release(tdb, r);
290 /* We may be violating lock order here, so best effort. */
291 if (tdb_lock_free_bucket(tdb, nb_off, TDB_LOCK_NOWAIT) == -1) {
292 add_stat(tdb, alloc_coalesce_lockfail, 1);
296 /* Now we have lock, re-check. */
297 if (tdb_read_convert(tdb, end, &rec, sizeof(rec))) {
298 tdb_unlock_free_bucket(tdb, nb_off);
302 if (unlikely(frec_magic(&rec) != TDB_FREE_MAGIC)) {
303 add_stat(tdb, alloc_coalesce_race, 1);
304 tdb_unlock_free_bucket(tdb, nb_off);
308 if (unlikely(frec_flist(&rec) != flist)
309 || unlikely(size_to_bucket(frec_len(&rec)) != bucket)) {
310 add_stat(tdb, alloc_coalesce_race, 1);
311 tdb_unlock_free_bucket(tdb, nb_off);
315 if (remove_from_list(tdb, nb_off, end, &rec) == -1) {
316 tdb_unlock_free_bucket(tdb, nb_off);
320 end += sizeof(struct tdb_used_record) + frec_len(&rec);
321 tdb_unlock_free_bucket(tdb, nb_off);
322 add_stat(tdb, alloc_coalesce_num_merged, 1);
325 /* Didn't find any adjacent free? */
326 if (end == off + sizeof(struct tdb_used_record) + data_len)
329 /* OK, expand initial record */
330 if (tdb_read_convert(tdb, off, &rec, sizeof(rec)))
333 if (frec_len(&rec) != data_len) {
334 tdb->ecode = TDB_ERR_CORRUPT;
335 tdb->log(tdb, TDB_DEBUG_FATAL, tdb->log_priv,
336 "coalesce: expected data len %llu not %llu\n",
337 (long long)data_len, (long long)frec_len(&rec));
341 if (remove_from_list(tdb, b_off, off, &rec) == -1)
344 /* We have to drop this to avoid deadlocks, so make sure record
345 * doesn't get coalesced by someone else! */
346 rec.magic_and_prev = TDB_COALESCING_MAGIC
347 << (64 - TDB_OFF_UPPER_STEAL);
348 /* FIXME: Use 255 as invalid free list? */
349 rec.flist_and_len = end - off - sizeof(struct tdb_used_record);
350 if (tdb_write_convert(tdb, off, &rec, sizeof(rec)) != 0)
353 add_stat(tdb, alloc_coalesce_succeeded, 1);
354 tdb_unlock_free_bucket(tdb, b_off);
356 if (add_free_record(tdb, off, end - off) == -1)
361 /* To unify error paths, we *always* unlock bucket on error. */
362 tdb_unlock_free_bucket(tdb, b_off);
366 /* We need size bytes to put our key and data in. */
367 static tdb_off_t lock_and_alloc(struct tdb_context *tdb,
370 size_t keylen, size_t datalen,
374 tdb_off_t off, b_off,best_off;
375 struct tdb_free_record best = { 0 };
377 size_t size = adjust_size(keylen, datalen);
379 add_stat(tdb, allocs, 1);
381 b_off = bucket_off(flist_off, bucket);
383 /* FIXME: Try non-blocking wait first, to measure contention. */
384 /* Lock this bucket. */
385 if (tdb_lock_free_bucket(tdb, b_off, TDB_LOCK_WAIT) == -1) {
389 best.flist_and_len = -1ULL;
392 /* Get slack if we're after extra. */
398 /* Walk the list to see if any are large enough, getting less fussy
400 off = tdb_read_off(tdb, b_off);
401 if (unlikely(off == TDB_OFF_ERR))
405 const struct tdb_free_record *r;
409 r = tdb_access_read(tdb, off, sizeof(*r), true);
413 if (frec_magic(r) != TDB_FREE_MAGIC) {
414 tdb_access_release(tdb, r);
415 tdb->log(tdb, TDB_DEBUG_ERROR, tdb->log_priv,
416 "lock_and_alloc: %llu non-free 0x%llx\n",
417 (long long)off, (long long)r->magic_and_prev);
421 if (frec_len(r) >= size && frec_len(r) < frec_len(&best)) {
426 if (frec_len(&best) < size * multiplier && best_off) {
427 tdb_access_release(tdb, r);
435 tdb_access_release(tdb, r);
437 /* Since we're going slow anyway, try coalescing here. */
438 switch (coalesce(tdb, off, b_off, len)) {
440 /* This has already unlocked on error. */
443 /* This has unlocked list, restart. */
449 /* If we found anything at all, use it. */
451 struct tdb_used_record rec;
454 /* We're happy with this size: take it. */
455 if (remove_from_list(tdb, b_off, best_off, &best) != 0)
458 leftover = record_leftover(keylen, datalen, want_extra,
461 assert(keylen + datalen + leftover <= frec_len(&best));
462 /* We need to mark non-free before we drop lock, otherwise
463 * coalesce() could try to merge it! */
464 if (set_used_header(tdb, &rec, keylen, datalen,
465 frec_len(&best) - leftover,
469 if (tdb_write_convert(tdb, best_off, &rec, sizeof(rec)) != 0)
472 /* Bucket of leftover will be <= current bucket, so nested
473 * locking is allowed. */
475 add_stat(tdb, alloc_leftover, 1);
476 if (add_free_record(tdb,
477 best_off + sizeof(rec)
478 + frec_len(&best) - leftover,
480 best_off = TDB_OFF_ERR;
482 tdb_unlock_free_bucket(tdb, b_off);
487 tdb_unlock_free_bucket(tdb, b_off);
491 tdb_unlock_free_bucket(tdb, b_off);
495 /* Get a free block from current free list, or 0 if none. */
496 static tdb_off_t get_free(struct tdb_context *tdb,
497 size_t keylen, size_t datalen, bool want_extra,
500 tdb_off_t off, flist_off;
501 unsigned start_b, b, flist;
502 bool wrapped = false;
504 /* If they are growing, add 50% to get to higher bucket. */
506 start_b = size_to_bucket(adjust_size(keylen,
507 datalen + datalen / 2));
509 start_b = size_to_bucket(adjust_size(keylen, datalen));
511 flist_off = tdb->flist_off;
513 while (!wrapped || flist_off != tdb->flist_off) {
514 /* Start at exact size bucket, and search up... */
515 for (b = find_free_head(tdb, flist_off, start_b);
516 b < TDB_FREE_BUCKETS;
517 b = find_free_head(tdb, flist_off, b + 1)) {
518 /* Try getting one from list. */
519 off = lock_and_alloc(tdb, flist_off,
520 b, keylen, datalen, want_extra,
522 if (off == TDB_OFF_ERR)
526 add_stat(tdb, alloc_bucket_exact, 1);
527 if (b == TDB_FREE_BUCKETS - 1)
528 add_stat(tdb, alloc_bucket_max, 1);
529 /* Worked? Stay using this list. */
530 tdb->flist_off = flist_off;
534 /* Didn't work. Try next bucket. */
537 /* Hmm, try next list. */
538 flist_off = next_flist(tdb, flist_off);
541 if (flist_off == 0) {
543 flist_off = first_flist(tdb);
551 int set_used_header(struct tdb_context *tdb,
552 struct tdb_used_record *rec,
553 uint64_t keylen, uint64_t datalen,
554 uint64_t actuallen, unsigned hashlow)
556 uint64_t keybits = (fls64(keylen) + 1) / 2;
558 /* Use bottom bits of hash, so it's independent of hash table size. */
559 rec->magic_and_meta = (hashlow & ((1 << 11)-1))
560 | ((actuallen - (keylen + datalen)) << 11)
563 rec->key_and_data_len = (keylen | (datalen << (keybits*2)));
565 /* Encoding can fail on big values. */
566 if (rec_key_length(rec) != keylen
567 || rec_data_length(rec) != datalen
568 || rec_extra_padding(rec) != actuallen - (keylen + datalen)) {
569 tdb->ecode = TDB_ERR_IO;
570 tdb->log(tdb, TDB_DEBUG_ERROR, tdb->log_priv,
571 "Could not encode k=%llu,d=%llu,a=%llu\n",
572 (long long)keylen, (long long)datalen,
573 (long long)actuallen);
579 /* Expand the database. */
580 static int tdb_expand(struct tdb_context *tdb, tdb_len_t size)
585 /* We need room for the record header too. */
586 wanted = sizeof(struct tdb_used_record) + size;
588 /* Need to hold a hash lock to expand DB: transactions rely on it. */
589 if (!(tdb->flags & TDB_NOLOCK)
590 && !tdb->allrecord_lock.count && !tdb_has_hash_locks(tdb)) {
591 tdb->log(tdb, TDB_DEBUG_FATAL, tdb->log_priv,
592 "tdb_expand: must hold lock during expand\n");
596 /* always make room for at least 100 more records, and at
597 least 25% more space. */
598 if (size * TDB_EXTENSION_FACTOR > tdb->map_size / 4)
599 wanted = size * TDB_EXTENSION_FACTOR;
601 wanted = tdb->map_size / 4;
602 wanted = adjust_size(0, wanted);
604 /* Only one person can expand file at a time. */
605 if (tdb_lock_expand(tdb, F_WRLCK) != 0)
608 /* Someone else may have expanded the file, so retry. */
609 old_size = tdb->map_size;
610 tdb->methods->oob(tdb, tdb->map_size + 1, true);
611 if (tdb->map_size != old_size) {
612 tdb_unlock_expand(tdb, F_WRLCK);
616 if (tdb->methods->expand_file(tdb, wanted) == -1) {
617 tdb_unlock_expand(tdb, F_WRLCK);
621 /* We need to drop this lock before adding free record. */
622 tdb_unlock_expand(tdb, F_WRLCK);
624 add_stat(tdb, expands, 1);
625 return add_free_record(tdb, old_size, wanted);
628 /* This won't fail: it will expand the database if it has to. */
629 tdb_off_t alloc(struct tdb_context *tdb, size_t keylen, size_t datalen,
630 uint64_t hash, bool growing)
634 /* We can't hold pointers during this: we could unmap! */
635 assert(!tdb->direct_access);
638 off = get_free(tdb, keylen, datalen, growing, hash);
639 if (likely(off != 0))
642 if (tdb_expand(tdb, adjust_size(keylen, datalen)))