2 Unix SMB/CIFS implementation.
4 trivial database library
6 Copyright (C) Andrew Tridgell 1999-2005
7 Copyright (C) Paul `Rusty' Russell 2000
8 Copyright (C) Jeremy Allison 2000-2003
10 ** NOTE! The following LGPL license applies to the tdb
11 ** library. This does NOT imply that all of Samba is released
14 This library is free software; you can redistribute it and/or
15 modify it under the terms of the GNU Lesser General Public
16 License as published by the Free Software Foundation; either
17 version 3 of the License, or (at your option) any later version.
19 This library is distributed in the hope that it will be useful,
20 but WITHOUT ANY WARRANTY; without even the implied warranty of
21 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
22 Lesser General Public License for more details.
24 You should have received a copy of the GNU Lesser General Public
25 License along with this library; if not, see <http://www.gnu.org/licenses/>.
28 #include "tdb1_private.h"
34 non-blocking increment of the tdb sequence number if the tdb has been opened using
37 void tdb1_increment_seqnum_nonblock(struct tdb_context *tdb)
41 if (!(tdb->flags & TDB_SEQNUM)) {
45 /* we ignore errors from this, as we have no sane way of
48 tdb1_ofs_read(tdb, TDB1_SEQNUM_OFS, &seqnum);
50 tdb1_ofs_write(tdb, TDB1_SEQNUM_OFS, &seqnum);
54 increment the tdb sequence number if the tdb has been opened using
57 static void tdb1_increment_seqnum(struct tdb_context *tdb)
59 if (!(tdb->flags & TDB_SEQNUM)) {
63 if (tdb1_nest_lock(tdb, TDB1_SEQNUM_OFS, F_WRLCK,
64 TDB_LOCK_WAIT|TDB_LOCK_PROBE) != 0) {
68 tdb1_increment_seqnum_nonblock(tdb);
70 tdb1_nest_unlock(tdb, TDB1_SEQNUM_OFS, F_WRLCK);
73 static int tdb1_key_compare(TDB_DATA key, TDB_DATA data, void *private_data)
75 return memcmp(data.dptr, key.dptr, data.dsize);
78 /* Returns 0 on fail. On success, return offset of record, and fills
80 static tdb1_off_t tdb1_find(struct tdb_context *tdb, TDB_DATA key, uint32_t hash,
81 struct tdb1_record *r)
85 /* read in the hash top */
86 if (tdb1_ofs_read(tdb, TDB1_HASH_TOP(hash), &rec_ptr) == -1)
89 /* keep looking until we find the right record */
91 if (tdb1_rec_read(tdb, rec_ptr, r) == -1)
94 if (!TDB1_DEAD(r) && hash==r->full_hash
95 && key.dsize==r->key_len
96 && tdb1_parse_data(tdb, key, rec_ptr + sizeof(*r),
97 r->key_len, tdb1_key_compare,
101 /* detect tight infinite loop */
102 if (rec_ptr == r->next) {
103 tdb->last_error = tdb_logerr(tdb, TDB_ERR_CORRUPT,
105 "tdb1_find: loop detected.");
110 tdb->last_error = TDB_ERR_NOEXIST;
114 /* As tdb1_find, but if you succeed, keep the lock */
115 tdb1_off_t tdb1_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, uint32_t hash, int locktype,
116 struct tdb1_record *rec)
120 if (tdb1_lock(tdb, TDB1_BUCKET(hash), locktype) == -1)
122 if (!(rec_ptr = tdb1_find(tdb, key, hash, rec)))
123 tdb1_unlock(tdb, TDB1_BUCKET(hash), locktype);
127 static TDB_DATA _tdb1_fetch(struct tdb_context *tdb, TDB_DATA key);
129 /* update an entry in place - this only works if the new data size
130 is <= the old data size and the key exists.
131 on failure return -1.
133 static int tdb1_update_hash(struct tdb_context *tdb, TDB_DATA key, uint32_t hash, TDB_DATA dbuf)
135 struct tdb1_record rec;
139 if (!(rec_ptr = tdb1_find(tdb, key, hash, &rec)))
142 /* it could be an exact duplicate of what is there - this is
143 * surprisingly common (eg. with a ldb re-index). */
144 if (rec.key_len == key.dsize &&
145 rec.data_len == dbuf.dsize &&
146 rec.full_hash == hash) {
147 TDB_DATA data = _tdb1_fetch(tdb, key);
148 if (data.dsize == dbuf.dsize &&
149 memcmp(data.dptr, dbuf.dptr, data.dsize) == 0) {
160 /* must be long enough key, data and tailer */
161 if (rec.rec_len < key.dsize + dbuf.dsize + sizeof(tdb1_off_t)) {
162 tdb->last_error = TDB_SUCCESS; /* Not really an error */
166 if (tdb->tdb1.io->tdb1_write(tdb, rec_ptr + sizeof(rec) + rec.key_len,
167 dbuf.dptr, dbuf.dsize) == -1)
170 if (dbuf.dsize != rec.data_len) {
172 rec.data_len = dbuf.dsize;
173 return tdb1_rec_write(tdb, rec_ptr, &rec);
179 /* find an entry in the database given a key */
180 /* If an entry doesn't exist tdb1_err will be set to
181 * TDB_ERR_NOEXIST. If a key has no data attached
182 * then the TDB_DATA will have zero length but
185 static TDB_DATA _tdb1_fetch(struct tdb_context *tdb, TDB_DATA key)
188 struct tdb1_record rec;
192 /* find which hash bucket it is in */
193 hash = tdb_hash(tdb, key.dptr, key.dsize);
194 if (!(rec_ptr = tdb1_find_lock_hash(tdb,key,hash,F_RDLCK,&rec)))
197 ret.dptr = tdb1_alloc_read(tdb, rec_ptr + sizeof(rec) + rec.key_len,
199 ret.dsize = rec.data_len;
200 tdb1_unlock(tdb, TDB1_BUCKET(rec.full_hash), F_RDLCK);
204 TDB_DATA tdb1_fetch(struct tdb_context *tdb, TDB_DATA key)
206 TDB_DATA ret = _tdb1_fetch(tdb, key);
212 * Find an entry in the database and hand the record's data to a parsing
213 * function. The parsing function is executed under the chain read lock, so it
214 * should be fast and should not block on other syscalls.
216 * DON'T CALL OTHER TDB CALLS FROM THE PARSER, THIS MIGHT LEAD TO SEGFAULTS.
218 * For mmapped tdb's that do not have a transaction open it points the parsing
219 * function directly at the mmap area, it avoids the malloc/memcpy in this
220 * case. If a transaction is open or no mmap is available, it has to do
221 * malloc/read/parse/free.
223 * This is interesting for all readers of potentially large data structures in
224 * the tdb records, ldb indexes being one example.
226 * Return -1 if the record was not found.
229 int tdb1_parse_record(struct tdb_context *tdb, TDB_DATA key,
230 int (*parser)(TDB_DATA key, TDB_DATA data,
235 struct tdb1_record rec;
239 /* find which hash bucket it is in */
240 hash = tdb_hash(tdb, key.dptr, key.dsize);
242 if (!(rec_ptr = tdb1_find_lock_hash(tdb,key,hash,F_RDLCK,&rec))) {
243 /* record not found */
244 tdb->last_error = TDB_ERR_NOEXIST;
248 ret = tdb1_parse_data(tdb, key, rec_ptr + sizeof(rec) + rec.key_len,
249 rec.data_len, parser, private_data);
251 tdb1_unlock(tdb, TDB1_BUCKET(rec.full_hash), F_RDLCK);
256 /* check if an entry in the database exists
258 note that 1 is returned if the key is found and 0 is returned if not found
259 this doesn't match the conventions in the rest of this module, but is
262 static int tdb1_exists_hash(struct tdb_context *tdb, TDB_DATA key, uint32_t hash)
264 struct tdb1_record rec;
266 if (tdb1_find_lock_hash(tdb, key, hash, F_RDLCK, &rec) == 0)
268 tdb1_unlock(tdb, TDB1_BUCKET(rec.full_hash), F_RDLCK);
272 int tdb1_exists(struct tdb_context *tdb, TDB_DATA key)
274 uint32_t hash = tdb_hash(tdb, key.dptr, key.dsize);
277 ret = tdb1_exists_hash(tdb, key, hash);
281 /* actually delete an entry in the database given the offset */
282 int tdb1_do_delete(struct tdb_context *tdb, tdb1_off_t rec_ptr, struct tdb1_record *rec)
284 tdb1_off_t last_ptr, i;
285 struct tdb1_record lastrec;
287 if ((tdb->flags & TDB_RDONLY) || tdb->tdb1.traverse_read) return -1;
289 if (((tdb->tdb1.traverse_write != 0) && (!TDB1_DEAD(rec))) ||
290 tdb1_write_lock_record(tdb, rec_ptr) == -1) {
291 /* Someone traversing here: mark it as dead */
292 rec->magic = TDB1_DEAD_MAGIC;
293 return tdb1_rec_write(tdb, rec_ptr, rec);
295 if (tdb1_write_unlock_record(tdb, rec_ptr) != 0)
298 /* find previous record in hash chain */
299 if (tdb1_ofs_read(tdb, TDB1_HASH_TOP(rec->full_hash), &i) == -1)
301 for (last_ptr = 0; i != rec_ptr; last_ptr = i, i = lastrec.next)
302 if (tdb1_rec_read(tdb, i, &lastrec) == -1)
305 /* unlink it: next ptr is at start of record. */
307 last_ptr = TDB1_HASH_TOP(rec->full_hash);
308 if (tdb1_ofs_write(tdb, last_ptr, &rec->next) == -1)
311 /* recover the space */
312 if (tdb1_free(tdb, rec_ptr, rec) == -1)
317 static int tdb1_count_dead(struct tdb_context *tdb, uint32_t hash)
321 struct tdb1_record rec;
323 /* read in the hash top */
324 if (tdb1_ofs_read(tdb, TDB1_HASH_TOP(hash), &rec_ptr) == -1)
328 if (tdb1_rec_read(tdb, rec_ptr, &rec) == -1)
331 if (rec.magic == TDB1_DEAD_MAGIC) {
340 * Purge all DEAD records from a hash chain
342 static int tdb1_purge_dead(struct tdb_context *tdb, uint32_t hash)
345 struct tdb1_record rec;
348 if (tdb1_lock(tdb, -1, F_WRLCK) == -1) {
352 /* read in the hash top */
353 if (tdb1_ofs_read(tdb, TDB1_HASH_TOP(hash), &rec_ptr) == -1)
359 if (tdb1_rec_read(tdb, rec_ptr, &rec) == -1) {
365 if (rec.magic == TDB1_DEAD_MAGIC
366 && tdb1_do_delete(tdb, rec_ptr, &rec) == -1) {
373 tdb1_unlock(tdb, -1, F_WRLCK);
377 /* delete an entry in the database given a key */
378 static int tdb1_delete_hash(struct tdb_context *tdb, TDB_DATA key, uint32_t hash)
381 struct tdb1_record rec;
384 if (tdb->tdb1.max_dead_records != 0) {
387 * Allow for some dead records per hash chain, mainly for
388 * tdb's with a very high create/delete rate like locking.tdb.
391 if (tdb1_lock(tdb, TDB1_BUCKET(hash), F_WRLCK) == -1)
394 if (tdb1_count_dead(tdb, hash) >= tdb->tdb1.max_dead_records) {
396 * Don't let the per-chain freelist grow too large,
397 * delete all existing dead records
399 tdb1_purge_dead(tdb, hash);
402 if (!(rec_ptr = tdb1_find(tdb, key, hash, &rec))) {
403 tdb1_unlock(tdb, TDB1_BUCKET(hash), F_WRLCK);
408 * Just mark the record as dead.
410 rec.magic = TDB1_DEAD_MAGIC;
411 ret = tdb1_rec_write(tdb, rec_ptr, &rec);
414 if (!(rec_ptr = tdb1_find_lock_hash(tdb, key, hash, F_WRLCK,
418 ret = tdb1_do_delete(tdb, rec_ptr, &rec);
422 tdb1_increment_seqnum(tdb);
425 if (tdb1_unlock(tdb, TDB1_BUCKET(rec.full_hash), F_WRLCK) != 0)
426 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
427 "tdb1_delete: WARNING tdb1_unlock failed!");
431 int tdb1_delete(struct tdb_context *tdb, TDB_DATA key)
433 uint32_t hash = tdb_hash(tdb, key.dptr, key.dsize);
436 ret = tdb1_delete_hash(tdb, key, hash);
441 * See if we have a dead record around with enough space
443 static tdb1_off_t tdb1_find_dead(struct tdb_context *tdb, uint32_t hash,
444 struct tdb1_record *r, tdb1_len_t length)
448 /* read in the hash top */
449 if (tdb1_ofs_read(tdb, TDB1_HASH_TOP(hash), &rec_ptr) == -1)
452 /* keep looking until we find the right record */
454 if (tdb1_rec_read(tdb, rec_ptr, r) == -1)
457 if (TDB1_DEAD(r) && r->rec_len >= length) {
459 * First fit for simple coding, TODO: change to best
469 static int _tdb1_store(struct tdb_context *tdb, TDB_DATA key,
470 TDB_DATA dbuf, int flag, uint32_t hash)
472 struct tdb1_record rec;
477 /* check for it existing, on insert. */
478 if (flag == TDB_INSERT) {
479 if (tdb1_exists_hash(tdb, key, hash)) {
480 tdb->last_error = TDB_ERR_EXISTS;
484 /* first try in-place update, on modify or replace. */
485 if (tdb1_update_hash(tdb, key, hash, dbuf) == 0) {
488 if (tdb->last_error == TDB_ERR_NOEXIST &&
489 flag == TDB_MODIFY) {
490 /* if the record doesn't exist and we are in TDB1_MODIFY mode then
491 we should fail the store */
495 /* reset the error code potentially set by the tdb1_update() */
496 tdb->last_error = TDB_SUCCESS;
498 /* delete any existing record - if it doesn't exist we don't
499 care. Doing this first reduces fragmentation, and avoids
500 coalescing with `allocated' block before it's updated. */
501 if (flag != TDB_INSERT)
502 tdb1_delete_hash(tdb, key, hash);
504 /* Copy key+value *before* allocating free space in case malloc
505 fails and we are left with a dead spot in the tdb. */
507 if (!(p = (char *)malloc(key.dsize + dbuf.dsize))) {
508 tdb->last_error = TDB_ERR_OOM;
512 memcpy(p, key.dptr, key.dsize);
514 memcpy(p+key.dsize, dbuf.dptr, dbuf.dsize);
516 if (tdb->tdb1.max_dead_records != 0) {
518 * Allow for some dead records per hash chain, look if we can
519 * find one that can hold the new record. We need enough space
520 * for key, data and tailer. If we find one, we don't have to
521 * consult the central freelist.
523 rec_ptr = tdb1_find_dead(
525 key.dsize + dbuf.dsize + sizeof(tdb1_off_t));
528 rec.key_len = key.dsize;
529 rec.data_len = dbuf.dsize;
530 rec.full_hash = hash;
531 rec.magic = TDB1_MAGIC;
532 if (tdb1_rec_write(tdb, rec_ptr, &rec) == -1
533 || tdb->tdb1.io->tdb1_write(
534 tdb, rec_ptr + sizeof(rec),
535 p, key.dsize + dbuf.dsize) == -1) {
543 * We have to allocate some space from the freelist, so this means we
544 * have to lock it. Use the chance to purge all the DEAD records from
545 * the hash chain under the freelist lock.
548 if (tdb1_lock(tdb, -1, F_WRLCK) == -1) {
552 if ((tdb->tdb1.max_dead_records != 0)
553 && (tdb1_purge_dead(tdb, hash) == -1)) {
554 tdb1_unlock(tdb, -1, F_WRLCK);
558 /* we have to allocate some space */
559 rec_ptr = tdb1_allocate(tdb, key.dsize + dbuf.dsize, &rec);
561 tdb1_unlock(tdb, -1, F_WRLCK);
567 /* Read hash top into next ptr */
568 if (tdb1_ofs_read(tdb, TDB1_HASH_TOP(hash), &rec.next) == -1)
571 rec.key_len = key.dsize;
572 rec.data_len = dbuf.dsize;
573 rec.full_hash = hash;
574 rec.magic = TDB1_MAGIC;
576 /* write out and point the top of the hash chain at it */
577 if (tdb1_rec_write(tdb, rec_ptr, &rec) == -1
578 || tdb->tdb1.io->tdb1_write(tdb, rec_ptr+sizeof(rec), p, key.dsize+dbuf.dsize)==-1
579 || tdb1_ofs_write(tdb, TDB1_HASH_TOP(hash), &rec_ptr) == -1) {
580 /* Need to tdb1_unallocate() here */
588 tdb1_increment_seqnum(tdb);
595 /* store an element in the database, replacing any existing element
598 return 0 on success, -1 on failure
600 int tdb1_store(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, int flag)
605 assert(tdb->flags & TDB_VERSION1);
607 if ((tdb->flags & TDB_RDONLY) || tdb->tdb1.traverse_read) {
608 tdb->last_error = TDB_ERR_RDONLY;
612 /* find which hash bucket it is in */
613 hash = tdb_hash(tdb, key.dptr, key.dsize);
614 if (tdb1_lock(tdb, TDB1_BUCKET(hash), F_WRLCK) == -1)
617 ret = _tdb1_store(tdb, key, dbuf, flag, hash);
618 tdb1_unlock(tdb, TDB1_BUCKET(hash), F_WRLCK);
622 /* Append to an entry. Create if not exist. */
623 int tdb1_append(struct tdb_context *tdb, TDB_DATA key, TDB_DATA new_dbuf)
629 /* find which hash bucket it is in */
630 hash = tdb_hash(tdb, key.dptr, key.dsize);
631 if (tdb1_lock(tdb, TDB1_BUCKET(hash), F_WRLCK) == -1)
634 dbuf = _tdb1_fetch(tdb, key);
636 if (dbuf.dptr == NULL) {
637 dbuf.dptr = (unsigned char *)malloc(new_dbuf.dsize);
639 unsigned int new_len = dbuf.dsize + new_dbuf.dsize;
640 unsigned char *new_dptr;
642 /* realloc '0' is special: don't do that. */
645 new_dptr = (unsigned char *)realloc(dbuf.dptr, new_len);
646 if (new_dptr == NULL) {
649 dbuf.dptr = new_dptr;
652 if (dbuf.dptr == NULL) {
653 tdb->last_error = TDB_ERR_OOM;
657 memcpy(dbuf.dptr + dbuf.dsize, new_dbuf.dptr, new_dbuf.dsize);
658 dbuf.dsize += new_dbuf.dsize;
660 ret = _tdb1_store(tdb, key, dbuf, 0, hash);
663 tdb1_unlock(tdb, TDB1_BUCKET(hash), F_WRLCK);
664 SAFE_FREE(dbuf.dptr);
670 get the tdb sequence number. Only makes sense if the writers opened
671 with TDB1_SEQNUM set. Note that this sequence number will wrap quite
672 quickly, so it should only be used for a 'has something changed'
673 test, not for code that relies on the count of the number of changes
674 made. If you want a counter then use a tdb record.
676 The aim of this sequence number is to allow for a very lightweight
677 test of a possible tdb change.
679 int tdb1_get_seqnum(struct tdb_context *tdb)
683 tdb1_ofs_read(tdb, TDB1_SEQNUM_OFS, &seqnum);
689 add a region of the file to the freelist. Length is the size of the region in bytes,
690 which includes the free list header that needs to be added
692 static int tdb1_free_region(struct tdb_context *tdb, tdb1_off_t offset, ssize_t length)
694 struct tdb1_record rec;
695 if (length <= sizeof(rec)) {
696 /* the region is not worth adding */
699 if (length + offset > tdb->file->map_size) {
700 tdb->last_error = tdb_logerr(tdb, TDB_ERR_CORRUPT, TDB_LOG_ERROR,
701 "tdb1_free_region: adding region beyond"
705 memset(&rec,'\0',sizeof(rec));
706 rec.rec_len = length - sizeof(rec);
707 if (tdb1_free(tdb, offset, &rec) == -1) {
708 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
709 "tdb1_free_region: failed to add free record");
716 wipe the entire database, deleting all records. This can be done
717 very fast by using a allrecord lock. The entire data portion of the
718 file becomes a single entry in the freelist.
720 This code carefully steps around the recovery area, leaving it alone
722 int tdb1_wipe_all(struct tdb_context *tdb)
725 tdb1_off_t offset = 0;
727 tdb1_off_t recovery_head;
728 tdb1_len_t recovery_size = 0;
730 if (tdb1_lockall(tdb) != 0) {
735 /* see if the tdb has a recovery area, and remember its size
736 if so. We don't want to lose this as otherwise each
737 tdb1_wipe_all() in a transaction will increase the size of
738 the tdb by the size of the recovery area */
739 if (tdb1_ofs_read(tdb, TDB1_RECOVERY_HEAD, &recovery_head) == -1) {
740 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
741 "tdb1_wipe_all: failed to read recovery head");
745 if (recovery_head != 0) {
746 struct tdb1_record rec;
747 if (tdb->tdb1.io->tdb1_read(tdb, recovery_head, &rec, sizeof(rec), TDB1_DOCONV()) == -1) {
748 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
749 "tdb1_wipe_all: failed to read recovery record");
752 recovery_size = rec.rec_len + sizeof(rec);
755 /* wipe the hashes */
756 for (i=0;i<tdb->tdb1.header.hash_size;i++) {
757 if (tdb1_ofs_write(tdb, TDB1_HASH_TOP(i), &offset) == -1) {
758 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
759 "tdb1_wipe_all: failed to write hash %d", i);
764 /* wipe the freelist */
765 if (tdb1_ofs_write(tdb, TDB1_FREELIST_TOP, &offset) == -1) {
766 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
767 "tdb1_wipe_all: failed to write freelist");
771 /* add all the rest of the file to the freelist, possibly leaving a gap
772 for the recovery area */
773 if (recovery_size == 0) {
774 /* the simple case - the whole file can be used as a freelist */
775 data_len = (tdb->file->map_size - TDB1_DATA_START(tdb->tdb1.header.hash_size));
776 if (tdb1_free_region(tdb, TDB1_DATA_START(tdb->tdb1.header.hash_size), data_len) != 0) {
780 /* we need to add two freelist entries - one on either
781 side of the recovery area
783 Note that we cannot shift the recovery area during
784 this operation. Only the transaction.c code may
785 move the recovery area or we risk subtle data
788 data_len = (recovery_head - TDB1_DATA_START(tdb->tdb1.header.hash_size));
789 if (tdb1_free_region(tdb, TDB1_DATA_START(tdb->tdb1.header.hash_size), data_len) != 0) {
792 /* and the 2nd free list entry after the recovery area - if any */
793 data_len = tdb->file->map_size - (recovery_head+recovery_size);
794 if (tdb1_free_region(tdb, recovery_head+recovery_size, data_len) != 0) {
799 if (tdb1_unlockall(tdb) != 0) {
800 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
801 "tdb1_wipe_all: failed to unlock");
812 struct traverse_state {
813 enum TDB_ERROR error;
814 struct tdb_context *dest_db;
818 traverse function for repacking
820 static int repack_traverse(struct tdb_context *tdb, TDB_DATA key, TDB_DATA data, void *private_data)
822 struct traverse_state *state = (struct traverse_state *)private_data;
823 if (tdb1_store(state->dest_db, key, data, TDB_INSERT) != 0) {
824 state->error = state->dest_db->last_error;
833 int tdb1_repack(struct tdb_context *tdb)
835 struct tdb_context *tmp_db;
836 struct traverse_state state;
837 union tdb_attribute hsize;
839 hsize.base.attr = TDB_ATTRIBUTE_TDB1_HASHSIZE;
840 hsize.base.next = NULL;
841 hsize.tdb1_hashsize.hsize = tdb->tdb1.header.hash_size;
843 if (tdb1_transaction_start(tdb) != 0) {
844 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
845 __location__ " Failed to start transaction");
849 tmp_db = tdb_open("tmpdb", TDB_INTERNAL, O_RDWR|O_CREAT, 0, &hsize);
850 if (tmp_db == NULL) {
851 tdb->last_error = tdb_logerr(tdb, TDB_ERR_OOM, TDB_LOG_ERROR,
852 __location__ " Failed to create tmp_db");
853 tdb1_transaction_cancel(tdb);
857 state.error = TDB_SUCCESS;
858 state.dest_db = tmp_db;
860 if (tdb1_traverse_read(tdb, repack_traverse, &state) == -1) {
861 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
862 __location__ " Failed to traverse copying out");
863 tdb1_transaction_cancel(tdb);
868 if (state.error != TDB_SUCCESS) {
869 tdb->last_error = tdb_logerr(tdb, state.error, TDB_LOG_ERROR,
870 __location__ " Error during traversal");
871 tdb1_transaction_cancel(tdb);
876 if (tdb1_wipe_all(tdb) != 0) {
877 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
878 __location__ " Failed to wipe database\n");
879 tdb1_transaction_cancel(tdb);
884 state.error = TDB_SUCCESS;
887 if (tdb1_traverse_read(tmp_db, repack_traverse, &state) == -1) {
888 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
889 __location__ " Failed to traverse copying back");
890 tdb1_transaction_cancel(tdb);
896 tdb->last_error = tdb_logerr(tdb, state.error, TDB_LOG_ERROR,
897 __location__ " Error during second traversal");
898 tdb1_transaction_cancel(tdb);
905 if (tdb1_transaction_commit(tdb) != 0) {
906 tdb_logerr(tdb, tdb->last_error, TDB_LOG_ERROR,
907 __location__ " Failed to commit");
914 /* Even on files, we can get partial writes due to signals. */
915 bool tdb1_write_all(int fd, const void *buf, size_t count)
919 ret = write(fd, buf, count);
922 buf = (const char *)buf + ret;