2 Unix SMB/CIFS implementation.
4 trivial database library
6 Copyright (C) Andrew Tridgell 1999-2004
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 2 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, write to the Free Software
26 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
30 /* NOTE: If you use tdbs under valgrind, and in particular if you run
31 * tdbtorture, you may get spurious "uninitialized value" warnings. I
32 * think this is because valgrind doesn't understand that the mmap'd
33 * area may be written to by other processes. Memory can, from the
34 * point of view of the grinded process, spontaneously become
37 * I can think of a few solutions. [mbp 20030311]
39 * 1 - Write suppressions for Valgrind so that it doesn't complain
40 * about this. Probably the most reasonable but people need to
41 * remember to use them.
43 * 2 - Use IO not mmap when running under valgrind. Not so nice.
45 * 3 - Use the special valgrind macros to mark memory as valid at the
46 * right time. Probably too hard -- the process just doesn't know.
69 #if defined(PARANOID_MALLOC_CHECKER)
94 #define TDB_MAGIC_FOOD "TDB file\n"
95 #define TDB_VERSION (0x26011967 + 6)
96 #define TDB_MAGIC (0x26011999U)
97 #define TDB_FREE_MAGIC (~TDB_MAGIC)
98 #define TDB_DEAD_MAGIC (0xFEE1DEAD)
99 #define TDB_ALIGNMENT 4
100 #define MIN_REC_SIZE (2*sizeof(struct list_struct) + TDB_ALIGNMENT)
101 #define DEFAULT_HASH_SIZE 131
102 #define TDB_PAGE_SIZE 0x2000
103 #define FREELIST_TOP (sizeof(struct tdb_header))
104 #define TDB_ALIGN(x,a) (((x) + (a)-1) & ~((a)-1))
105 #define TDB_BYTEREV(x) (((((x)&0xff)<<24)|((x)&0xFF00)<<8)|(((x)>>8)&0xFF00)|((x)>>24))
106 #define TDB_DEAD(r) ((r)->magic == TDB_DEAD_MAGIC)
107 #define TDB_BAD_MAGIC(r) ((r)->magic != TDB_MAGIC && !TDB_DEAD(r))
108 #define TDB_HASH_TOP(hash) (FREELIST_TOP + (BUCKET(hash)+1)*sizeof(tdb_off))
109 #define TDB_DATA_START(hash_size) (TDB_HASH_TOP(hash_size-1) + TDB_SPINLOCK_SIZE(hash_size))
112 /* NB assumes there is a local variable called "tdb" that is the
113 * current context, also takes doubly-parenthesized print-style
115 #define TDB_LOG(x) (tdb->log_fn?((tdb->log_fn x),0) : 0)
118 #define GLOBAL_LOCK 0
119 #define ACTIVE_LOCK 4
126 #define MAP_FAILED ((void *)-1)
129 /* free memory if the pointer is valid and zero the pointer */
131 #define SAFE_FREE(x) do { if ((x) != NULL) {free((x)); (x)=NULL;} } while(0)
134 #define BUCKET(hash) ((hash) % tdb->header.hash_size)
137 /* all contexts, to ensure no double-opens (fcntl locks don't nest!) */
138 static TDB_CONTEXT
*tdbs
= NULL
;
140 static int tdb_munmap(TDB_CONTEXT
*tdb
)
142 if (tdb
->flags
& TDB_INTERNAL
)
147 int ret
= munmap(tdb
->map_ptr
, tdb
->map_size
);
156 static void tdb_mmap(TDB_CONTEXT
*tdb
)
158 if (tdb
->flags
& TDB_INTERNAL
)
162 if (!(tdb
->flags
& TDB_NOMMAP
)) {
163 tdb
->map_ptr
= mmap(NULL
, tdb
->map_size
,
164 PROT_READ
|(tdb
->read_only
? 0:PROT_WRITE
),
165 MAP_SHARED
|MAP_FILE
, tdb
->fd
, 0);
168 * NB. When mmap fails it returns MAP_FAILED *NOT* NULL !!!!
171 if (tdb
->map_ptr
== MAP_FAILED
) {
173 TDB_LOG((tdb
, 2, "tdb_mmap failed for size %d (%s)\n",
174 tdb
->map_size
, strerror(errno
)));
184 /* Endian conversion: we only ever deal with 4 byte quantities */
185 static void *convert(void *buf
, u32 size
)
188 for (i
= 0; i
< size
/ 4; i
++)
189 p
[i
] = TDB_BYTEREV(p
[i
]);
192 #define DOCONV() (tdb->flags & TDB_CONVERT)
193 #define CONVERT(x) (DOCONV() ? convert(&x, sizeof(x)) : &x)
195 /* the body of the database is made of one list_struct for the free space
196 plus a separate data list for each hash value */
198 tdb_off next
; /* offset of the next record in the list */
199 tdb_len rec_len
; /* total byte length of record */
200 tdb_len key_len
; /* byte length of key */
201 tdb_len data_len
; /* byte length of data */
202 u32 full_hash
; /* the full 32 bit hash of the key */
203 u32 magic
; /* try to catch errors */
204 /* the following union is implied:
206 char record[rec_len];
211 u32 totalsize; (tailer)
216 /***************************************************************
217 Allow a caller to set a "alarm" flag that tdb can check to abort
218 a blocking lock on SIGALRM.
219 ***************************************************************/
221 static sig_atomic_t *palarm_fired
;
223 void tdb_set_lock_alarm(sig_atomic_t *palarm
)
225 palarm_fired
= palarm
;
228 /* a byte range locking function - return 0 on success
229 this functions locks/unlocks 1 byte at the specified offset.
231 On error, errno is also set so that errors are passed back properly
232 through tdb_open(). */
233 static int tdb_brlock(TDB_CONTEXT
*tdb
, tdb_off offset
,
234 int rw_type
, int lck_type
, int probe
)
239 if (tdb
->flags
& TDB_NOLOCK
)
241 if ((rw_type
== F_WRLCK
) && (tdb
->read_only
)) {
247 fl
.l_whence
= SEEK_SET
;
253 ret
= fcntl(tdb
->fd
,lck_type
,&fl
);
254 if (ret
== -1 && errno
== EINTR
&& palarm_fired
&& *palarm_fired
)
256 } while (ret
== -1 && errno
== EINTR
);
259 if (!probe
&& lck_type
!= F_SETLK
) {
260 /* Ensure error code is set for log fun to examine. */
261 if (errno
== EINTR
&& palarm_fired
&& *palarm_fired
)
262 tdb
->ecode
= TDB_ERR_LOCK_TIMEOUT
;
264 tdb
->ecode
= TDB_ERR_LOCK
;
265 TDB_LOG((tdb
, 5,"tdb_brlock failed (fd=%d) at offset %d rw_type=%d lck_type=%d\n",
266 tdb
->fd
, offset
, rw_type
, lck_type
));
268 /* Was it an alarm timeout ? */
269 if (errno
== EINTR
&& palarm_fired
&& *palarm_fired
) {
270 TDB_LOG((tdb
, 5, "tdb_brlock timed out (fd=%d) at offset %d rw_type=%d lck_type=%d\n",
271 tdb
->fd
, offset
, rw_type
, lck_type
));
272 return TDB_ERRCODE(TDB_ERR_LOCK_TIMEOUT
, -1);
274 /* Otherwise - generic lock error. errno set by fcntl.
275 * EAGAIN is an expected return from non-blocking
277 if (errno
!= EAGAIN
) {
278 TDB_LOG((tdb
, 5, "tdb_brlock failed (fd=%d) at offset %d rw_type=%d lck_type=%d: %s\n",
279 tdb
->fd
, offset
, rw_type
, lck_type
,
282 return TDB_ERRCODE(TDB_ERR_LOCK
, -1);
287 /* lock a list in the database. list -1 is the alloc list */
288 static int tdb_lock(TDB_CONTEXT
*tdb
, int list
, int ltype
)
290 if (list
< -1 || list
>= (int)tdb
->header
.hash_size
) {
291 TDB_LOG((tdb
, 0,"tdb_lock: invalid list %d for ltype=%d\n",
295 if (tdb
->flags
& TDB_NOLOCK
)
298 /* Since fcntl locks don't nest, we do a lock for the first one,
299 and simply bump the count for future ones */
300 if (tdb
->locked
[list
+1].count
== 0) {
301 if (!tdb
->read_only
&& tdb
->header
.rwlocks
) {
302 if (tdb_spinlock(tdb
, list
, ltype
)) {
303 TDB_LOG((tdb
, 0, "tdb_lock spinlock failed on list %d ltype=%d\n",
307 } else if (tdb_brlock(tdb
,FREELIST_TOP
+4*list
,ltype
,F_SETLKW
, 0)) {
308 TDB_LOG((tdb
, 0,"tdb_lock failed on list %d ltype=%d (%s)\n",
309 list
, ltype
, strerror(errno
)));
312 tdb
->locked
[list
+1].ltype
= ltype
;
314 tdb
->locked
[list
+1].count
++;
318 /* unlock the database: returns void because it's too late for errors. */
319 /* changed to return int it may be interesting to know there
320 has been an error --simo */
321 static int tdb_unlock(TDB_CONTEXT
*tdb
, int list
, int ltype
)
325 if (tdb
->flags
& TDB_NOLOCK
)
329 if (list
< -1 || list
>= (int)tdb
->header
.hash_size
) {
330 TDB_LOG((tdb
, 0, "tdb_unlock: list %d invalid (%d)\n", list
, tdb
->header
.hash_size
));
334 if (tdb
->locked
[list
+1].count
==0) {
335 TDB_LOG((tdb
, 0, "tdb_unlock: count is 0\n"));
339 if (tdb
->locked
[list
+1].count
== 1) {
340 /* Down to last nested lock: unlock underneath */
341 if (!tdb
->read_only
&& tdb
->header
.rwlocks
) {
342 ret
= tdb_spinunlock(tdb
, list
, ltype
);
344 ret
= tdb_brlock(tdb
, FREELIST_TOP
+4*list
, F_UNLCK
, F_SETLKW
, 0);
349 tdb
->locked
[list
+1].count
--;
352 TDB_LOG((tdb
, 0,"tdb_unlock: An error occurred unlocking!\n"));
356 /* check for an out of bounds access - if it is out of bounds then
357 see if the database has been expanded by someone else and expand
359 note that "len" is the minimum length needed for the db
361 static int tdb_oob(TDB_CONTEXT
*tdb
, tdb_off len
, int probe
)
364 if (len
<= tdb
->map_size
)
366 if (tdb
->flags
& TDB_INTERNAL
) {
368 /* Ensure ecode is set for log fn. */
369 tdb
->ecode
= TDB_ERR_IO
;
370 TDB_LOG((tdb
, 0,"tdb_oob len %d beyond internal malloc size %d\n",
371 (int)len
, (int)tdb
->map_size
));
373 return TDB_ERRCODE(TDB_ERR_IO
, -1);
376 if (fstat(tdb
->fd
, &st
) == -1)
377 return TDB_ERRCODE(TDB_ERR_IO
, -1);
379 if (st
.st_size
< (size_t)len
) {
381 /* Ensure ecode is set for log fn. */
382 tdb
->ecode
= TDB_ERR_IO
;
383 TDB_LOG((tdb
, 0,"tdb_oob len %d beyond eof at %d\n",
384 (int)len
, (int)st
.st_size
));
386 return TDB_ERRCODE(TDB_ERR_IO
, -1);
389 /* Unmap, update size, remap */
390 if (tdb_munmap(tdb
) == -1)
391 return TDB_ERRCODE(TDB_ERR_IO
, -1);
392 tdb
->map_size
= st
.st_size
;
397 /* write a lump of data at a specified offset */
398 static int tdb_write(TDB_CONTEXT
*tdb
, tdb_off off
, void *buf
, tdb_len len
)
400 if (tdb_oob(tdb
, off
+ len
, 0) != 0)
404 memcpy(off
+ (char *)tdb
->map_ptr
, buf
, len
);
406 else if (pwrite(tdb
->fd
, buf
, len
, off
) != (ssize_t
)len
) {
408 else if (lseek(tdb
->fd
, off
, SEEK_SET
) != off
409 || write(tdb
->fd
, buf
, len
) != (ssize_t
)len
) {
411 /* Ensure ecode is set for log fn. */
412 tdb
->ecode
= TDB_ERR_IO
;
413 TDB_LOG((tdb
, 0,"tdb_write failed at %d len=%d (%s)\n",
414 off
, len
, strerror(errno
)));
415 return TDB_ERRCODE(TDB_ERR_IO
, -1);
420 /* read a lump of data at a specified offset, maybe convert */
421 static int tdb_read(TDB_CONTEXT
*tdb
,tdb_off off
,void *buf
,tdb_len len
,int cv
)
423 if (tdb_oob(tdb
, off
+ len
, 0) != 0)
427 memcpy(buf
, off
+ (char *)tdb
->map_ptr
, len
);
429 else if (pread(tdb
->fd
, buf
, len
, off
) != (ssize_t
)len
) {
431 else if (lseek(tdb
->fd
, off
, SEEK_SET
) != off
432 || read(tdb
->fd
, buf
, len
) != (ssize_t
)len
) {
434 /* Ensure ecode is set for log fn. */
435 tdb
->ecode
= TDB_ERR_IO
;
436 TDB_LOG((tdb
, 0,"tdb_read failed at %d len=%d (%s)\n",
437 off
, len
, strerror(errno
)));
438 return TDB_ERRCODE(TDB_ERR_IO
, -1);
445 /* read a lump of data, allocating the space for it */
446 static char *tdb_alloc_read(TDB_CONTEXT
*tdb
, tdb_off offset
, tdb_len len
)
450 if (!(buf
= malloc(len
))) {
451 /* Ensure ecode is set for log fn. */
452 tdb
->ecode
= TDB_ERR_OOM
;
453 TDB_LOG((tdb
, 0,"tdb_alloc_read malloc failed len=%d (%s)\n",
454 len
, strerror(errno
)));
455 return TDB_ERRCODE(TDB_ERR_OOM
, buf
);
457 if (tdb_read(tdb
, offset
, buf
, len
, 0) == -1) {
464 /* read/write a tdb_off */
465 static int ofs_read(TDB_CONTEXT
*tdb
, tdb_off offset
, tdb_off
*d
)
467 return tdb_read(tdb
, offset
, (char*)d
, sizeof(*d
), DOCONV());
469 static int ofs_write(TDB_CONTEXT
*tdb
, tdb_off offset
, tdb_off
*d
)
472 return tdb_write(tdb
, offset
, CONVERT(off
), sizeof(*d
));
475 /* read/write a record */
476 static int rec_read(TDB_CONTEXT
*tdb
, tdb_off offset
, struct list_struct
*rec
)
478 if (tdb_read(tdb
, offset
, rec
, sizeof(*rec
),DOCONV()) == -1)
480 if (TDB_BAD_MAGIC(rec
)) {
481 /* Ensure ecode is set for log fn. */
482 tdb
->ecode
= TDB_ERR_CORRUPT
;
483 TDB_LOG((tdb
, 0,"rec_read bad magic 0x%x at offset=%d\n", rec
->magic
, offset
));
484 return TDB_ERRCODE(TDB_ERR_CORRUPT
, -1);
486 return tdb_oob(tdb
, rec
->next
+sizeof(*rec
), 0);
488 static int rec_write(TDB_CONTEXT
*tdb
, tdb_off offset
, struct list_struct
*rec
)
490 struct list_struct r
= *rec
;
491 return tdb_write(tdb
, offset
, CONVERT(r
), sizeof(r
));
494 /* read a freelist record and check for simple errors */
495 static int rec_free_read(TDB_CONTEXT
*tdb
, tdb_off off
, struct list_struct
*rec
)
497 if (tdb_read(tdb
, off
, rec
, sizeof(*rec
),DOCONV()) == -1)
500 if (rec
->magic
== TDB_MAGIC
) {
501 /* this happens when a app is showdown while deleting a record - we should
502 not completely fail when this happens */
503 TDB_LOG((tdb
, 0,"rec_free_read non-free magic 0x%x at offset=%d - fixing\n",
505 rec
->magic
= TDB_FREE_MAGIC
;
506 if (tdb_write(tdb
, off
, rec
, sizeof(*rec
)) == -1)
510 if (rec
->magic
!= TDB_FREE_MAGIC
) {
511 /* Ensure ecode is set for log fn. */
512 tdb
->ecode
= TDB_ERR_CORRUPT
;
513 TDB_LOG((tdb
, 0,"rec_free_read bad magic 0x%x at offset=%d\n",
515 return TDB_ERRCODE(TDB_ERR_CORRUPT
, -1);
517 if (tdb_oob(tdb
, rec
->next
+sizeof(*rec
), 0) != 0)
522 /* update a record tailer (must hold allocation lock) */
523 static int update_tailer(TDB_CONTEXT
*tdb
, tdb_off offset
,
524 const struct list_struct
*rec
)
528 /* Offset of tailer from record header */
529 totalsize
= sizeof(*rec
) + rec
->rec_len
;
530 return ofs_write(tdb
, offset
+ totalsize
- sizeof(tdb_off
),
534 static tdb_off
tdb_dump_record(TDB_CONTEXT
*tdb
, tdb_off offset
)
536 struct list_struct rec
;
537 tdb_off tailer_ofs
, tailer
;
539 if (tdb_read(tdb
, offset
, (char *)&rec
, sizeof(rec
), DOCONV()) == -1) {
540 printf("ERROR: failed to read record at %u\n", offset
);
544 printf(" rec: offset=%u next=%d rec_len=%d key_len=%d data_len=%d full_hash=0x%x magic=0x%x\n",
545 offset
, rec
.next
, rec
.rec_len
, rec
.key_len
, rec
.data_len
, rec
.full_hash
, rec
.magic
);
547 tailer_ofs
= offset
+ sizeof(rec
) + rec
.rec_len
- sizeof(tdb_off
);
548 if (ofs_read(tdb
, tailer_ofs
, &tailer
) == -1) {
549 printf("ERROR: failed to read tailer at %u\n", tailer_ofs
);
553 if (tailer
!= rec
.rec_len
+ sizeof(rec
)) {
554 printf("ERROR: tailer does not match record! tailer=%u totalsize=%u\n",
555 (unsigned)tailer
, (unsigned)(rec
.rec_len
+ sizeof(rec
)));
560 static int tdb_dump_chain(TDB_CONTEXT
*tdb
, int i
)
562 tdb_off rec_ptr
, top
;
564 top
= TDB_HASH_TOP(i
);
566 if (tdb_lock(tdb
, i
, F_WRLCK
) != 0)
569 if (ofs_read(tdb
, top
, &rec_ptr
) == -1)
570 return tdb_unlock(tdb
, i
, F_WRLCK
);
573 printf("hash=%d\n", i
);
576 rec_ptr
= tdb_dump_record(tdb
, rec_ptr
);
579 return tdb_unlock(tdb
, i
, F_WRLCK
);
582 void tdb_dump_all(TDB_CONTEXT
*tdb
)
585 for (i
=0;i
<tdb
->header
.hash_size
;i
++) {
586 tdb_dump_chain(tdb
, i
);
588 printf("freelist:\n");
589 tdb_dump_chain(tdb
, -1);
592 int tdb_printfreelist(TDB_CONTEXT
*tdb
)
596 tdb_off offset
, rec_ptr
;
597 struct list_struct rec
;
599 if ((ret
= tdb_lock(tdb
, -1, F_WRLCK
)) != 0)
602 offset
= FREELIST_TOP
;
604 /* read in the freelist top */
605 if (ofs_read(tdb
, offset
, &rec_ptr
) == -1) {
606 tdb_unlock(tdb
, -1, F_WRLCK
);
610 printf("freelist top=[0x%08x]\n", rec_ptr
);
612 if (tdb_read(tdb
, rec_ptr
, (char *)&rec
, sizeof(rec
), DOCONV()) == -1) {
613 tdb_unlock(tdb
, -1, F_WRLCK
);
617 if (rec
.magic
!= TDB_FREE_MAGIC
) {
618 printf("bad magic 0x%08x in free list\n", rec
.magic
);
619 tdb_unlock(tdb
, -1, F_WRLCK
);
623 printf("entry offset=[0x%08x], rec.rec_len = [0x%08x (%d)]\n", rec
.next
, rec
.rec_len
, rec
.rec_len
);
624 total_free
+= rec
.rec_len
;
626 /* move to the next record */
629 printf("total rec_len = [0x%08x (%d)]\n", (int)total_free
,
632 return tdb_unlock(tdb
, -1, F_WRLCK
);
635 /* Remove an element from the freelist. Must have alloc lock. */
636 static int remove_from_freelist(TDB_CONTEXT
*tdb
, tdb_off off
, tdb_off next
)
640 /* read in the freelist top */
641 last_ptr
= FREELIST_TOP
;
642 while (ofs_read(tdb
, last_ptr
, &i
) != -1 && i
!= 0) {
644 /* We've found it! */
645 return ofs_write(tdb
, last_ptr
, &next
);
647 /* Follow chain (next offset is at start of record) */
650 TDB_LOG((tdb
, 0,"remove_from_freelist: not on list at off=%d\n", off
));
651 return TDB_ERRCODE(TDB_ERR_CORRUPT
, -1);
654 /* Add an element into the freelist. Merge adjacent records if
656 static int tdb_free(TDB_CONTEXT
*tdb
, tdb_off offset
, struct list_struct
*rec
)
660 /* Allocation and tailer lock */
661 if (tdb_lock(tdb
, -1, F_WRLCK
) != 0)
664 /* set an initial tailer, so if we fail we don't leave a bogus record */
665 if (update_tailer(tdb
, offset
, rec
) != 0) {
666 TDB_LOG((tdb
, 0, "tdb_free: upfate_tailer failed!\n"));
670 /* Look right first (I'm an Australian, dammit) */
671 right
= offset
+ sizeof(*rec
) + rec
->rec_len
;
672 if (right
+ sizeof(*rec
) <= tdb
->map_size
) {
673 struct list_struct r
;
675 if (tdb_read(tdb
, right
, &r
, sizeof(r
), DOCONV()) == -1) {
676 TDB_LOG((tdb
, 0, "tdb_free: right read failed at %u\n", right
));
680 /* If it's free, expand to include it. */
681 if (r
.magic
== TDB_FREE_MAGIC
) {
682 if (remove_from_freelist(tdb
, right
, r
.next
) == -1) {
683 TDB_LOG((tdb
, 0, "tdb_free: right free failed at %u\n", right
));
686 rec
->rec_len
+= sizeof(r
) + r
.rec_len
;
692 left
= offset
- sizeof(tdb_off
);
693 if (left
> TDB_DATA_START(tdb
->header
.hash_size
)) {
694 struct list_struct l
;
697 /* Read in tailer and jump back to header */
698 if (ofs_read(tdb
, left
, &leftsize
) == -1) {
699 TDB_LOG((tdb
, 0, "tdb_free: left offset read failed at %u\n", left
));
702 left
= offset
- leftsize
;
704 /* Now read in record */
705 if (tdb_read(tdb
, left
, &l
, sizeof(l
), DOCONV()) == -1) {
706 TDB_LOG((tdb
, 0, "tdb_free: left read failed at %u (%u)\n", left
, leftsize
));
710 /* If it's free, expand to include it. */
711 if (l
.magic
== TDB_FREE_MAGIC
) {
712 if (remove_from_freelist(tdb
, left
, l
.next
) == -1) {
713 TDB_LOG((tdb
, 0, "tdb_free: left free failed at %u\n", left
));
717 rec
->rec_len
+= leftsize
;
723 if (update_tailer(tdb
, offset
, rec
) == -1) {
724 TDB_LOG((tdb
, 0, "tdb_free: update_tailer failed at %u\n", offset
));
728 /* Now, prepend to free list */
729 rec
->magic
= TDB_FREE_MAGIC
;
731 if (ofs_read(tdb
, FREELIST_TOP
, &rec
->next
) == -1 ||
732 rec_write(tdb
, offset
, rec
) == -1 ||
733 ofs_write(tdb
, FREELIST_TOP
, &offset
) == -1) {
734 TDB_LOG((tdb
, 0, "tdb_free record write failed at offset=%d\n", offset
));
738 /* And we're done. */
739 tdb_unlock(tdb
, -1, F_WRLCK
);
743 tdb_unlock(tdb
, -1, F_WRLCK
);
748 /* expand a file. we prefer to use ftruncate, as that is what posix
749 says to use for mmap expansion */
750 static int expand_file(TDB_CONTEXT
*tdb
, tdb_off size
, tdb_off addition
)
753 #if HAVE_FTRUNCATE_EXTEND
754 if (ftruncate(tdb
->fd
, size
+addition
) != 0) {
755 TDB_LOG((tdb
, 0, "expand_file ftruncate to %d failed (%s)\n",
756 size
+addition
, strerror(errno
)));
763 if (pwrite(tdb
->fd
, &b
, 1, (size
+addition
) - 1) != 1) {
765 if (lseek(tdb
->fd
, (size
+addition
) - 1, SEEK_SET
) != (size
+addition
) - 1 ||
766 write(tdb
->fd
, &b
, 1) != 1) {
768 TDB_LOG((tdb
, 0, "expand_file to %d failed (%s)\n",
769 size
+addition
, strerror(errno
)));
774 /* now fill the file with something. This ensures that the file isn't sparse, which would be
775 very bad if we ran out of disk. This must be done with write, not via mmap */
776 memset(buf
, 0x42, sizeof(buf
));
778 int n
= addition
>sizeof(buf
)?sizeof(buf
):addition
;
780 int ret
= pwrite(tdb
->fd
, buf
, n
, size
);
783 if (lseek(tdb
->fd
, size
, SEEK_SET
) != size
)
785 ret
= write(tdb
->fd
, buf
, n
);
788 TDB_LOG((tdb
, 0, "expand_file write of %d failed (%s)\n",
789 n
, strerror(errno
)));
799 /* expand the database at least size bytes by expanding the underlying
800 file and doing the mmap again if necessary */
801 static int tdb_expand(TDB_CONTEXT
*tdb
, tdb_off size
)
803 struct list_struct rec
;
806 if (tdb_lock(tdb
, -1, F_WRLCK
) == -1) {
807 TDB_LOG((tdb
, 0, "lock failed in tdb_expand\n"));
811 /* must know about any previous expansions by another process */
812 tdb_oob(tdb
, tdb
->map_size
+ 1, 1);
814 /* always make room for at least 10 more records, and round
815 the database up to a multiple of TDB_PAGE_SIZE */
816 size
= TDB_ALIGN(tdb
->map_size
+ size
*10, TDB_PAGE_SIZE
) - tdb
->map_size
;
818 if (!(tdb
->flags
& TDB_INTERNAL
))
822 * We must ensure the file is unmapped before doing this
823 * to ensure consistency with systems like OpenBSD where
824 * writes and mmaps are not consistent.
827 /* expand the file itself */
828 if (!(tdb
->flags
& TDB_INTERNAL
)) {
829 if (expand_file(tdb
, tdb
->map_size
, size
) != 0)
833 tdb
->map_size
+= size
;
835 if (tdb
->flags
& TDB_INTERNAL
)
836 tdb
->map_ptr
= realloc(tdb
->map_ptr
, tdb
->map_size
);
839 * We must ensure the file is remapped before adding the space
840 * to ensure consistency with systems like OpenBSD where
841 * writes and mmaps are not consistent.
844 /* We're ok if the mmap fails as we'll fallback to read/write */
848 /* form a new freelist record */
849 memset(&rec
,'\0',sizeof(rec
));
850 rec
.rec_len
= size
- sizeof(rec
);
852 /* link it into the free list */
853 offset
= tdb
->map_size
- size
;
854 if (tdb_free(tdb
, offset
, &rec
) == -1)
857 tdb_unlock(tdb
, -1, F_WRLCK
);
860 tdb_unlock(tdb
, -1, F_WRLCK
);
864 /* allocate some space from the free list. The offset returned points
865 to a unconnected list_struct within the database with room for at
866 least length bytes of total data
868 0 is returned if the space could not be allocated
870 static tdb_off
tdb_allocate(TDB_CONTEXT
*tdb
, tdb_len length
,
871 struct list_struct
*rec
)
873 tdb_off rec_ptr
, last_ptr
, newrec_ptr
;
874 struct list_struct newrec
;
876 memset(&newrec
, '\0', sizeof(newrec
));
878 if (tdb_lock(tdb
, -1, F_WRLCK
) == -1)
881 /* Extra bytes required for tailer */
882 length
+= sizeof(tdb_off
);
885 last_ptr
= FREELIST_TOP
;
887 /* read in the freelist top */
888 if (ofs_read(tdb
, FREELIST_TOP
, &rec_ptr
) == -1)
891 /* keep looking until we find a freelist record big enough */
893 if (rec_free_read(tdb
, rec_ptr
, rec
) == -1)
896 if (rec
->rec_len
>= length
) {
897 /* found it - now possibly split it up */
898 if (rec
->rec_len
> length
+ MIN_REC_SIZE
) {
899 /* Length of left piece */
900 length
= TDB_ALIGN(length
, TDB_ALIGNMENT
);
902 /* Right piece to go on free list */
903 newrec
.rec_len
= rec
->rec_len
904 - (sizeof(*rec
) + length
);
905 newrec_ptr
= rec_ptr
+ sizeof(*rec
) + length
;
907 /* And left record is shortened */
908 rec
->rec_len
= length
;
912 /* Remove allocated record from the free list */
913 if (ofs_write(tdb
, last_ptr
, &rec
->next
) == -1)
916 /* Update header: do this before we drop alloc
917 lock, otherwise tdb_free() might try to
918 merge with us, thinking we're free.
919 (Thanks Jeremy Allison). */
920 rec
->magic
= TDB_MAGIC
;
921 if (rec_write(tdb
, rec_ptr
, rec
) == -1)
924 /* Did we create new block? */
926 /* Update allocated record tailer (we
928 if (update_tailer(tdb
, rec_ptr
, rec
) == -1)
931 /* Free new record */
932 if (tdb_free(tdb
, newrec_ptr
, &newrec
) == -1)
936 /* all done - return the new record offset */
937 tdb_unlock(tdb
, -1, F_WRLCK
);
940 /* move to the next record */
944 /* we didn't find enough space. See if we can expand the
945 database and if we can then try again */
946 if (tdb_expand(tdb
, length
+ sizeof(*rec
)) == 0)
949 tdb_unlock(tdb
, -1, F_WRLCK
);
953 /* initialise a new database with a specified hash size */
954 static int tdb_new_database(TDB_CONTEXT
*tdb
, int hash_size
)
956 struct tdb_header
*newdb
;
959 /* We make it up in memory, then write it out if not internal */
960 size
= sizeof(struct tdb_header
) + (hash_size
+1)*sizeof(tdb_off
);
961 if (!(newdb
= calloc(size
, 1)))
962 return TDB_ERRCODE(TDB_ERR_OOM
, -1);
964 /* Fill in the header */
965 newdb
->version
= TDB_VERSION
;
966 newdb
->hash_size
= hash_size
;
968 newdb
->rwlocks
= size
;
970 if (tdb
->flags
& TDB_INTERNAL
) {
971 tdb
->map_size
= size
;
972 tdb
->map_ptr
= (char *)newdb
;
973 memcpy(&tdb
->header
, newdb
, sizeof(tdb
->header
));
974 /* Convert the `ondisk' version if asked. */
978 if (lseek(tdb
->fd
, 0, SEEK_SET
) == -1)
981 if (ftruncate(tdb
->fd
, 0) == -1)
984 /* This creates an endian-converted header, as if read from disk */
986 memcpy(&tdb
->header
, newdb
, sizeof(tdb
->header
));
987 /* Don't endian-convert the magic food! */
988 memcpy(newdb
->magic_food
, TDB_MAGIC_FOOD
, strlen(TDB_MAGIC_FOOD
)+1);
989 if (write(tdb
->fd
, newdb
, size
) != size
)
992 ret
= tdb_create_rwlocks(tdb
->fd
, hash_size
);
999 /* Returns 0 on fail. On success, return offset of record, and fills
1001 static tdb_off
tdb_find(TDB_CONTEXT
*tdb
, TDB_DATA key
, u32 hash
,
1002 struct list_struct
*r
)
1006 /* read in the hash top */
1007 if (ofs_read(tdb
, TDB_HASH_TOP(hash
), &rec_ptr
) == -1)
1010 /* keep looking until we find the right record */
1012 if (rec_read(tdb
, rec_ptr
, r
) == -1)
1015 if (!TDB_DEAD(r
) && hash
==r
->full_hash
&& key
.dsize
==r
->key_len
) {
1017 /* a very likely hit - read the key */
1018 k
= tdb_alloc_read(tdb
, rec_ptr
+ sizeof(*r
),
1023 if (memcmp(key
.dptr
, k
, key
.dsize
) == 0) {
1031 return TDB_ERRCODE(TDB_ERR_NOEXIST
, 0);
1034 /* As tdb_find, but if you succeed, keep the lock */
1035 static tdb_off
tdb_find_lock_hash(TDB_CONTEXT
*tdb
, TDB_DATA key
, u32 hash
, int locktype
,
1036 struct list_struct
*rec
)
1040 if (tdb_lock(tdb
, BUCKET(hash
), locktype
) == -1)
1042 if (!(rec_ptr
= tdb_find(tdb
, key
, hash
, rec
)))
1043 tdb_unlock(tdb
, BUCKET(hash
), locktype
);
1047 enum TDB_ERROR
tdb_error(TDB_CONTEXT
*tdb
)
1052 static struct tdb_errname
{
1053 enum TDB_ERROR ecode
; const char *estring
;
1054 } emap
[] = { {TDB_SUCCESS
, "Success"},
1055 {TDB_ERR_CORRUPT
, "Corrupt database"},
1056 {TDB_ERR_IO
, "IO Error"},
1057 {TDB_ERR_LOCK
, "Locking error"},
1058 {TDB_ERR_OOM
, "Out of memory"},
1059 {TDB_ERR_EXISTS
, "Record exists"},
1060 {TDB_ERR_NOLOCK
, "Lock exists on other keys"},
1061 {TDB_ERR_NOEXIST
, "Record does not exist"} };
1063 /* Error string for the last tdb error */
1064 const char *tdb_errorstr(TDB_CONTEXT
*tdb
)
1067 for (i
= 0; i
< sizeof(emap
) / sizeof(struct tdb_errname
); i
++)
1068 if (tdb
->ecode
== emap
[i
].ecode
)
1069 return emap
[i
].estring
;
1070 return "Invalid error code";
1073 /* update an entry in place - this only works if the new data size
1074 is <= the old data size and the key exists.
1075 on failure return -1.
1078 static int tdb_update_hash(TDB_CONTEXT
*tdb
, TDB_DATA key
, u32 hash
, TDB_DATA dbuf
)
1080 struct list_struct rec
;
1084 if (!(rec_ptr
= tdb_find(tdb
, key
, hash
, &rec
)))
1087 /* must be long enough key, data and tailer */
1088 if (rec
.rec_len
< key
.dsize
+ dbuf
.dsize
+ sizeof(tdb_off
)) {
1089 tdb
->ecode
= TDB_SUCCESS
; /* Not really an error */
1093 if (tdb_write(tdb
, rec_ptr
+ sizeof(rec
) + rec
.key_len
,
1094 dbuf
.dptr
, dbuf
.dsize
) == -1)
1097 if (dbuf
.dsize
!= rec
.data_len
) {
1099 rec
.data_len
= dbuf
.dsize
;
1100 return rec_write(tdb
, rec_ptr
, &rec
);
1106 /* find an entry in the database given a key */
1107 /* If an entry doesn't exist tdb_err will be set to
1108 * TDB_ERR_NOEXIST. If a key has no data attached
1109 * tdb_err will not be set. Both will return a
1110 * zero pptr and zero dsize.
1113 TDB_DATA
tdb_fetch(TDB_CONTEXT
*tdb
, TDB_DATA key
)
1116 struct list_struct rec
;
1120 /* find which hash bucket it is in */
1121 hash
= tdb
->hash_fn(&key
);
1122 if (!(rec_ptr
= tdb_find_lock_hash(tdb
,key
,hash
,F_RDLCK
,&rec
)))
1126 ret
.dptr
= tdb_alloc_read(tdb
, rec_ptr
+ sizeof(rec
) + rec
.key_len
,
1130 ret
.dsize
= rec
.data_len
;
1131 tdb_unlock(tdb
, BUCKET(rec
.full_hash
), F_RDLCK
);
1135 /* check if an entry in the database exists
1137 note that 1 is returned if the key is found and 0 is returned if not found
1138 this doesn't match the conventions in the rest of this module, but is
1139 compatible with gdbm
1141 static int tdb_exists_hash(TDB_CONTEXT
*tdb
, TDB_DATA key
, u32 hash
)
1143 struct list_struct rec
;
1145 if (tdb_find_lock_hash(tdb
, key
, hash
, F_RDLCK
, &rec
) == 0)
1147 tdb_unlock(tdb
, BUCKET(rec
.full_hash
), F_RDLCK
);
1151 int tdb_exists(TDB_CONTEXT
*tdb
, TDB_DATA key
)
1153 u32 hash
= tdb
->hash_fn(&key
);
1154 return tdb_exists_hash(tdb
, key
, hash
);
1157 /* record lock stops delete underneath */
1158 static int lock_record(TDB_CONTEXT
*tdb
, tdb_off off
)
1160 return off
? tdb_brlock(tdb
, off
, F_RDLCK
, F_SETLKW
, 0) : 0;
1163 Write locks override our own fcntl readlocks, so check it here.
1164 Note this is meant to be F_SETLK, *not* F_SETLKW, as it's not
1165 an error to fail to get the lock here.
1168 static int write_lock_record(TDB_CONTEXT
*tdb
, tdb_off off
)
1170 struct tdb_traverse_lock
*i
;
1171 for (i
= &tdb
->travlocks
; i
; i
= i
->next
)
1174 return tdb_brlock(tdb
, off
, F_WRLCK
, F_SETLK
, 1);
1178 Note this is meant to be F_SETLK, *not* F_SETLKW, as it's not
1179 an error to fail to get the lock here.
1182 static int write_unlock_record(TDB_CONTEXT
*tdb
, tdb_off off
)
1184 return tdb_brlock(tdb
, off
, F_UNLCK
, F_SETLK
, 0);
1186 /* fcntl locks don't stack: avoid unlocking someone else's */
1187 static int unlock_record(TDB_CONTEXT
*tdb
, tdb_off off
)
1189 struct tdb_traverse_lock
*i
;
1194 for (i
= &tdb
->travlocks
; i
; i
= i
->next
)
1197 return (count
== 1 ? tdb_brlock(tdb
, off
, F_UNLCK
, F_SETLKW
, 0) : 0);
1200 /* actually delete an entry in the database given the offset */
1201 static int do_delete(TDB_CONTEXT
*tdb
, tdb_off rec_ptr
, struct list_struct
*rec
)
1203 tdb_off last_ptr
, i
;
1204 struct list_struct lastrec
;
1206 if (tdb
->read_only
) return -1;
1208 if (write_lock_record(tdb
, rec_ptr
) == -1) {
1209 /* Someone traversing here: mark it as dead */
1210 rec
->magic
= TDB_DEAD_MAGIC
;
1211 return rec_write(tdb
, rec_ptr
, rec
);
1213 if (write_unlock_record(tdb
, rec_ptr
) != 0)
1216 /* find previous record in hash chain */
1217 if (ofs_read(tdb
, TDB_HASH_TOP(rec
->full_hash
), &i
) == -1)
1219 for (last_ptr
= 0; i
!= rec_ptr
; last_ptr
= i
, i
= lastrec
.next
)
1220 if (rec_read(tdb
, i
, &lastrec
) == -1)
1223 /* unlink it: next ptr is at start of record. */
1225 last_ptr
= TDB_HASH_TOP(rec
->full_hash
);
1226 if (ofs_write(tdb
, last_ptr
, &rec
->next
) == -1)
1229 /* recover the space */
1230 if (tdb_free(tdb
, rec_ptr
, rec
) == -1)
1235 /* Uses traverse lock: 0 = finish, -1 = error, other = record offset */
1236 static int tdb_next_lock(TDB_CONTEXT
*tdb
, struct tdb_traverse_lock
*tlock
,
1237 struct list_struct
*rec
)
1239 int want_next
= (tlock
->off
!= 0);
1241 /* Lock each chain from the start one. */
1242 for (; tlock
->hash
< tdb
->header
.hash_size
; tlock
->hash
++) {
1243 if (tdb_lock(tdb
, tlock
->hash
, F_WRLCK
) == -1)
1246 /* No previous record? Start at top of chain. */
1248 if (ofs_read(tdb
, TDB_HASH_TOP(tlock
->hash
),
1252 /* Otherwise unlock the previous record. */
1253 if (unlock_record(tdb
, tlock
->off
) != 0)
1258 /* We have offset of old record: grab next */
1259 if (rec_read(tdb
, tlock
->off
, rec
) == -1)
1261 tlock
->off
= rec
->next
;
1264 /* Iterate through chain */
1265 while( tlock
->off
) {
1267 if (rec_read(tdb
, tlock
->off
, rec
) == -1)
1269 if (!TDB_DEAD(rec
)) {
1270 /* Woohoo: we found one! */
1271 if (lock_record(tdb
, tlock
->off
) != 0)
1275 /* Try to clean dead ones from old traverses */
1276 current
= tlock
->off
;
1277 tlock
->off
= rec
->next
;
1278 if (!tdb
->read_only
&&
1279 do_delete(tdb
, current
, rec
) != 0)
1282 tdb_unlock(tdb
, tlock
->hash
, F_WRLCK
);
1285 /* We finished iteration without finding anything */
1286 return TDB_ERRCODE(TDB_SUCCESS
, 0);
1290 if (tdb_unlock(tdb
, tlock
->hash
, F_WRLCK
) != 0)
1291 TDB_LOG((tdb
, 0, "tdb_next_lock: On error unlock failed!\n"));
1295 /* traverse the entire database - calling fn(tdb, key, data) on each element.
1296 return -1 on error or the record count traversed
1297 if fn is NULL then it is not called
1298 a non-zero return value from fn() indicates that the traversal should stop
1300 int tdb_traverse(TDB_CONTEXT
*tdb
, tdb_traverse_func fn
, void *private)
1303 struct list_struct rec
;
1304 struct tdb_traverse_lock tl
= { NULL
, 0, 0 };
1307 /* This was in the initializaton, above, but the IRIX compiler
1308 * did not like it. crh
1310 tl
.next
= tdb
->travlocks
.next
;
1312 /* fcntl locks don't stack: beware traverse inside traverse */
1313 tdb
->travlocks
.next
= &tl
;
1315 /* tdb_next_lock places locks on the record returned, and its chain */
1316 while ((ret
= tdb_next_lock(tdb
, &tl
, &rec
)) > 0) {
1318 /* now read the full record */
1319 key
.dptr
= tdb_alloc_read(tdb
, tl
.off
+ sizeof(rec
),
1320 rec
.key_len
+ rec
.data_len
);
1323 if (tdb_unlock(tdb
, tl
.hash
, F_WRLCK
) != 0)
1325 if (unlock_record(tdb
, tl
.off
) != 0)
1326 TDB_LOG((tdb
, 0, "tdb_traverse: key.dptr == NULL and unlock_record failed!\n"));
1329 key
.dsize
= rec
.key_len
;
1330 dbuf
.dptr
= key
.dptr
+ rec
.key_len
;
1331 dbuf
.dsize
= rec
.data_len
;
1333 /* Drop chain lock, call out */
1334 if (tdb_unlock(tdb
, tl
.hash
, F_WRLCK
) != 0) {
1338 if (fn
&& fn(tdb
, key
, dbuf
, private)) {
1339 /* They want us to terminate traversal */
1341 if (unlock_record(tdb
, tl
.off
) != 0) {
1342 TDB_LOG((tdb
, 0, "tdb_traverse: unlock_record failed!\n"));;
1345 tdb
->travlocks
.next
= tl
.next
;
1346 SAFE_FREE(key
.dptr
);
1349 SAFE_FREE(key
.dptr
);
1352 tdb
->travlocks
.next
= tl
.next
;
1359 /* find the first entry in the database and return its key */
1360 TDB_DATA
tdb_firstkey(TDB_CONTEXT
*tdb
)
1363 struct list_struct rec
;
1365 /* release any old lock */
1366 if (unlock_record(tdb
, tdb
->travlocks
.off
) != 0)
1368 tdb
->travlocks
.off
= tdb
->travlocks
.hash
= 0;
1370 if (tdb_next_lock(tdb
, &tdb
->travlocks
, &rec
) <= 0)
1372 /* now read the key */
1373 key
.dsize
= rec
.key_len
;
1374 key
.dptr
=tdb_alloc_read(tdb
,tdb
->travlocks
.off
+sizeof(rec
),key
.dsize
);
1375 if (tdb_unlock(tdb
, BUCKET(tdb
->travlocks
.hash
), F_WRLCK
) != 0)
1376 TDB_LOG((tdb
, 0, "tdb_firstkey: error occurred while tdb_unlocking!\n"));
1380 /* find the next entry in the database, returning its key */
1381 TDB_DATA
tdb_nextkey(TDB_CONTEXT
*tdb
, TDB_DATA oldkey
)
1384 TDB_DATA key
= tdb_null
;
1385 struct list_struct rec
;
1388 /* Is locked key the old key? If so, traverse will be reliable. */
1389 if (tdb
->travlocks
.off
) {
1390 if (tdb_lock(tdb
,tdb
->travlocks
.hash
,F_WRLCK
))
1392 if (rec_read(tdb
, tdb
->travlocks
.off
, &rec
) == -1
1393 || !(k
= tdb_alloc_read(tdb
,tdb
->travlocks
.off
+sizeof(rec
),
1395 || memcmp(k
, oldkey
.dptr
, oldkey
.dsize
) != 0) {
1396 /* No, it wasn't: unlock it and start from scratch */
1397 if (unlock_record(tdb
, tdb
->travlocks
.off
) != 0)
1399 if (tdb_unlock(tdb
, tdb
->travlocks
.hash
, F_WRLCK
) != 0)
1401 tdb
->travlocks
.off
= 0;
1407 if (!tdb
->travlocks
.off
) {
1408 /* No previous element: do normal find, and lock record */
1409 tdb
->travlocks
.off
= tdb_find_lock_hash(tdb
, oldkey
, tdb
->hash_fn(&oldkey
), F_WRLCK
, &rec
);
1410 if (!tdb
->travlocks
.off
)
1412 tdb
->travlocks
.hash
= BUCKET(rec
.full_hash
);
1413 if (lock_record(tdb
, tdb
->travlocks
.off
) != 0) {
1414 TDB_LOG((tdb
, 0, "tdb_nextkey: lock_record failed (%s)!\n", strerror(errno
)));
1418 oldhash
= tdb
->travlocks
.hash
;
1420 /* Grab next record: locks chain and returned record,
1421 unlocks old record */
1422 if (tdb_next_lock(tdb
, &tdb
->travlocks
, &rec
) > 0) {
1423 key
.dsize
= rec
.key_len
;
1424 key
.dptr
= tdb_alloc_read(tdb
, tdb
->travlocks
.off
+sizeof(rec
),
1426 /* Unlock the chain of this new record */
1427 if (tdb_unlock(tdb
, tdb
->travlocks
.hash
, F_WRLCK
) != 0)
1428 TDB_LOG((tdb
, 0, "tdb_nextkey: WARNING tdb_unlock failed!\n"));
1430 /* Unlock the chain of old record */
1431 if (tdb_unlock(tdb
, BUCKET(oldhash
), F_WRLCK
) != 0)
1432 TDB_LOG((tdb
, 0, "tdb_nextkey: WARNING tdb_unlock failed!\n"));
1436 /* delete an entry in the database given a key */
1437 static int tdb_delete_hash(TDB_CONTEXT
*tdb
, TDB_DATA key
, u32 hash
)
1440 struct list_struct rec
;
1443 if (!(rec_ptr
= tdb_find_lock_hash(tdb
, key
, hash
, F_WRLCK
, &rec
)))
1445 ret
= do_delete(tdb
, rec_ptr
, &rec
);
1446 if (tdb_unlock(tdb
, BUCKET(rec
.full_hash
), F_WRLCK
) != 0)
1447 TDB_LOG((tdb
, 0, "tdb_delete: WARNING tdb_unlock failed!\n"));
1451 int tdb_delete(TDB_CONTEXT
*tdb
, TDB_DATA key
)
1453 u32 hash
= tdb
->hash_fn(&key
);
1454 return tdb_delete_hash(tdb
, key
, hash
);
1457 /* store an element in the database, replacing any existing element
1460 return 0 on success, -1 on failure
1462 int tdb_store(TDB_CONTEXT
*tdb
, TDB_DATA key
, TDB_DATA dbuf
, int flag
)
1464 struct list_struct rec
;
1470 /* find which hash bucket it is in */
1471 hash
= tdb
->hash_fn(&key
);
1472 if (tdb_lock(tdb
, BUCKET(hash
), F_WRLCK
) == -1)
1475 /* check for it existing, on insert. */
1476 if (flag
== TDB_INSERT
) {
1477 if (tdb_exists_hash(tdb
, key
, hash
)) {
1478 tdb
->ecode
= TDB_ERR_EXISTS
;
1482 /* first try in-place update, on modify or replace. */
1483 if (tdb_update_hash(tdb
, key
, hash
, dbuf
) == 0)
1485 if (tdb
->ecode
== TDB_ERR_NOEXIST
&&
1486 flag
== TDB_MODIFY
) {
1487 /* if the record doesn't exist and we are in TDB_MODIFY mode then
1488 we should fail the store */
1492 /* reset the error code potentially set by the tdb_update() */
1493 tdb
->ecode
= TDB_SUCCESS
;
1495 /* delete any existing record - if it doesn't exist we don't
1496 care. Doing this first reduces fragmentation, and avoids
1497 coalescing with `allocated' block before it's updated. */
1498 if (flag
!= TDB_INSERT
)
1499 tdb_delete_hash(tdb
, key
, hash
);
1501 /* Copy key+value *before* allocating free space in case malloc
1502 fails and we are left with a dead spot in the tdb. */
1504 if (!(p
= (char *)malloc(key
.dsize
+ dbuf
.dsize
))) {
1505 tdb
->ecode
= TDB_ERR_OOM
;
1509 memcpy(p
, key
.dptr
, key
.dsize
);
1511 memcpy(p
+key
.dsize
, dbuf
.dptr
, dbuf
.dsize
);
1513 /* we have to allocate some space */
1514 if (!(rec_ptr
= tdb_allocate(tdb
, key
.dsize
+ dbuf
.dsize
, &rec
)))
1517 /* Read hash top into next ptr */
1518 if (ofs_read(tdb
, TDB_HASH_TOP(hash
), &rec
.next
) == -1)
1521 rec
.key_len
= key
.dsize
;
1522 rec
.data_len
= dbuf
.dsize
;
1523 rec
.full_hash
= hash
;
1524 rec
.magic
= TDB_MAGIC
;
1526 /* write out and point the top of the hash chain at it */
1527 if (rec_write(tdb
, rec_ptr
, &rec
) == -1
1528 || tdb_write(tdb
, rec_ptr
+sizeof(rec
), p
, key
.dsize
+dbuf
.dsize
)==-1
1529 || ofs_write(tdb
, TDB_HASH_TOP(hash
), &rec_ptr
) == -1) {
1530 /* Need to tdb_unallocate() here */
1535 tdb_unlock(tdb
, BUCKET(hash
), F_WRLCK
);
1542 /* Attempt to append data to an entry in place - this only works if the new data size
1543 is <= the old data size and the key exists.
1544 on failure return -1. Record must be locked before calling.
1546 static int tdb_append_inplace(TDB_CONTEXT
*tdb
, TDB_DATA key
, u32 hash
, TDB_DATA new_dbuf
)
1548 struct list_struct rec
;
1552 if (!(rec_ptr
= tdb_find(tdb
, key
, hash
, &rec
)))
1555 /* Append of 0 is always ok. */
1556 if (new_dbuf
.dsize
== 0)
1559 /* must be long enough for key, old data + new data and tailer */
1560 if (rec
.rec_len
< key
.dsize
+ rec
.data_len
+ new_dbuf
.dsize
+ sizeof(tdb_off
)) {
1562 tdb
->ecode
= TDB_SUCCESS
; /* Not really an error */
1566 if (tdb_write(tdb
, rec_ptr
+ sizeof(rec
) + rec
.key_len
+ rec
.data_len
,
1567 new_dbuf
.dptr
, new_dbuf
.dsize
) == -1)
1571 rec
.data_len
+= new_dbuf
.dsize
;
1572 return rec_write(tdb
, rec_ptr
, &rec
);
1575 /* Append to an entry. Create if not exist. */
1577 int tdb_append(TDB_CONTEXT
*tdb
, TDB_DATA key
, TDB_DATA new_dbuf
)
1579 struct list_struct rec
;
1584 size_t new_data_size
= 0;
1586 /* find which hash bucket it is in */
1587 hash
= tdb
->hash_fn(&key
);
1588 if (tdb_lock(tdb
, BUCKET(hash
), F_WRLCK
) == -1)
1591 /* first try in-place. */
1592 if (tdb_append_inplace(tdb
, key
, hash
, new_dbuf
) == 0)
1595 /* reset the error code potentially set by the tdb_append_inplace() */
1596 tdb
->ecode
= TDB_SUCCESS
;
1599 if (!(rec_ptr
= tdb_find(tdb
, key
, hash
, &rec
))) {
1600 if (tdb
->ecode
!= TDB_ERR_NOEXIST
)
1603 /* Not found - create. */
1605 ret
= tdb_store(tdb
, key
, new_dbuf
, TDB_INSERT
);
1609 new_data_size
= rec
.data_len
+ new_dbuf
.dsize
;
1611 /* Copy key+old_value+value *before* allocating free space in case malloc
1612 fails and we are left with a dead spot in the tdb. */
1614 if (!(p
= (char *)malloc(key
.dsize
+ new_data_size
))) {
1615 tdb
->ecode
= TDB_ERR_OOM
;
1619 /* Copy the key in place. */
1620 memcpy(p
, key
.dptr
, key
.dsize
);
1622 /* Now read the old data into place. */
1624 tdb_read(tdb
, rec_ptr
+ sizeof(rec
) + rec
.key_len
, p
+ key
.dsize
, rec
.data_len
, 0) == -1)
1627 /* Finally append the new data. */
1629 memcpy(p
+key
.dsize
+rec
.data_len
, new_dbuf
.dptr
, new_dbuf
.dsize
);
1631 /* delete any existing record - if it doesn't exist we don't
1632 care. Doing this first reduces fragmentation, and avoids
1633 coalescing with `allocated' block before it's updated. */
1635 tdb_delete_hash(tdb
, key
, hash
);
1637 if (!(rec_ptr
= tdb_allocate(tdb
, key
.dsize
+ new_data_size
, &rec
)))
1640 /* Read hash top into next ptr */
1641 if (ofs_read(tdb
, TDB_HASH_TOP(hash
), &rec
.next
) == -1)
1644 rec
.key_len
= key
.dsize
;
1645 rec
.data_len
= new_data_size
;
1646 rec
.full_hash
= hash
;
1647 rec
.magic
= TDB_MAGIC
;
1649 /* write out and point the top of the hash chain at it */
1650 if (rec_write(tdb
, rec_ptr
, &rec
) == -1
1651 || tdb_write(tdb
, rec_ptr
+sizeof(rec
), p
, key
.dsize
+new_data_size
)==-1
1652 || ofs_write(tdb
, TDB_HASH_TOP(hash
), &rec_ptr
) == -1) {
1653 /* Need to tdb_unallocate() here */
1659 tdb_unlock(tdb
, BUCKET(hash
), F_WRLCK
);
1667 static int tdb_already_open(dev_t device
,
1672 for (i
= tdbs
; i
; i
= i
->next
) {
1673 if (i
->device
== device
&& i
->inode
== ino
) {
1681 /* This is based on the hash algorithm from gdbm */
1682 static u32
default_tdb_hash(TDB_DATA
*key
)
1684 u32 value
; /* Used to compute the hash value. */
1685 u32 i
; /* Used to cycle through random values. */
1687 /* Set the initial value from the key size. */
1688 for (value
= 0x238F13AF * key
->dsize
, i
=0; i
< key
->dsize
; i
++)
1689 value
= (value
+ (key
->dptr
[i
] << (i
*5 % 24)));
1691 return (1103515243 * value
+ 12345);
1694 /* open the database, creating it if necessary
1696 The open_flags and mode are passed straight to the open call on the
1697 database file. A flags value of O_WRONLY is invalid. The hash size
1698 is advisory, use zero for a default value.
1700 Return is NULL on error, in which case errno is also set. Don't
1701 try to call tdb_error or tdb_errname, just do strerror(errno).
1703 @param name may be NULL for internal databases. */
1704 TDB_CONTEXT
*tdb_open(const char *name
, int hash_size
, int tdb_flags
,
1705 int open_flags
, mode_t mode
)
1707 return tdb_open_ex(name
, hash_size
, tdb_flags
, open_flags
, mode
, NULL
, NULL
);
1711 TDB_CONTEXT
*tdb_open_ex(const char *name
, int hash_size
, int tdb_flags
,
1712 int open_flags
, mode_t mode
,
1713 tdb_log_func log_fn
,
1714 tdb_hash_func hash_fn
)
1718 int rev
= 0, locked
= 0;
1722 if (!(tdb
= calloc(1, sizeof *tdb
))) {
1723 /* Can't log this */
1729 tdb
->map_ptr
= NULL
;
1730 tdb
->flags
= tdb_flags
;
1731 tdb
->open_flags
= open_flags
;
1732 tdb
->log_fn
= log_fn
;
1733 tdb
->hash_fn
= hash_fn
? hash_fn
: default_tdb_hash
;
1735 if ((open_flags
& O_ACCMODE
) == O_WRONLY
) {
1736 TDB_LOG((tdb
, 0, "tdb_open_ex: can't open tdb %s write-only\n",
1743 hash_size
= DEFAULT_HASH_SIZE
;
1744 if ((open_flags
& O_ACCMODE
) == O_RDONLY
) {
1746 /* read only databases don't do locking or clear if first */
1747 tdb
->flags
|= TDB_NOLOCK
;
1748 tdb
->flags
&= ~TDB_CLEAR_IF_FIRST
;
1751 /* internal databases don't mmap or lock, and start off cleared */
1752 if (tdb
->flags
& TDB_INTERNAL
) {
1753 tdb
->flags
|= (TDB_NOLOCK
| TDB_NOMMAP
);
1754 tdb
->flags
&= ~TDB_CLEAR_IF_FIRST
;
1755 if (tdb_new_database(tdb
, hash_size
) != 0) {
1756 TDB_LOG((tdb
, 0, "tdb_open_ex: tdb_new_database failed!"));
1762 if ((tdb
->fd
= open(name
, open_flags
, mode
)) == -1) {
1763 TDB_LOG((tdb
, 5, "tdb_open_ex: could not open file %s: %s\n",
1764 name
, strerror(errno
)));
1765 goto fail
; /* errno set by open(2) */
1768 /* ensure there is only one process initialising at once */
1769 if (tdb_brlock(tdb
, GLOBAL_LOCK
, F_WRLCK
, F_SETLKW
, 0) == -1) {
1770 TDB_LOG((tdb
, 0, "tdb_open_ex: failed to get global lock on %s: %s\n",
1771 name
, strerror(errno
)));
1772 goto fail
; /* errno set by tdb_brlock */
1775 /* we need to zero database if we are the only one with it open */
1776 if ((tdb_flags
& TDB_CLEAR_IF_FIRST
) &&
1777 (locked
= (tdb_brlock(tdb
, ACTIVE_LOCK
, F_WRLCK
, F_SETLK
, 0) == 0))) {
1778 open_flags
|= O_CREAT
;
1779 if (ftruncate(tdb
->fd
, 0) == -1) {
1780 TDB_LOG((tdb
, 0, "tdb_open_ex: "
1781 "failed to truncate %s: %s\n",
1782 name
, strerror(errno
)));
1783 goto fail
; /* errno set by ftruncate */
1787 if (read(tdb
->fd
, &tdb
->header
, sizeof(tdb
->header
)) != sizeof(tdb
->header
)
1788 || strcmp(tdb
->header
.magic_food
, TDB_MAGIC_FOOD
) != 0
1789 || (tdb
->header
.version
!= TDB_VERSION
1790 && !(rev
= (tdb
->header
.version
==TDB_BYTEREV(TDB_VERSION
))))) {
1791 /* its not a valid database - possibly initialise it */
1792 if (!(open_flags
& O_CREAT
) || tdb_new_database(tdb
, hash_size
) == -1) {
1793 errno
= EIO
; /* ie bad format or something */
1796 rev
= (tdb
->flags
& TDB_CONVERT
);
1798 vp
= (unsigned char *)&tdb
->header
.version
;
1799 vertest
= (((u32
)vp
[0]) << 24) | (((u32
)vp
[1]) << 16) |
1800 (((u32
)vp
[2]) << 8) | (u32
)vp
[3];
1801 tdb
->flags
|= (vertest
==TDB_VERSION
) ? TDB_BIGENDIAN
: 0;
1803 tdb
->flags
&= ~TDB_CONVERT
;
1805 tdb
->flags
|= TDB_CONVERT
;
1806 convert(&tdb
->header
, sizeof(tdb
->header
));
1808 if (fstat(tdb
->fd
, &st
) == -1)
1811 /* Is it already in the open list? If so, fail. */
1812 if (tdb_already_open(st
.st_dev
, st
.st_ino
)) {
1813 TDB_LOG((tdb
, 2, "tdb_open_ex: "
1814 "%s (%d,%d) is already open in this process\n",
1815 name
, (int)st
.st_dev
, (int)st
.st_ino
));
1820 if (!(tdb
->name
= (char *)strdup(name
))) {
1825 tdb
->map_size
= st
.st_size
;
1826 tdb
->device
= st
.st_dev
;
1827 tdb
->inode
= st
.st_ino
;
1828 tdb
->locked
= calloc(tdb
->header
.hash_size
+1, sizeof(tdb
->locked
[0]));
1830 TDB_LOG((tdb
, 2, "tdb_open_ex: "
1831 "failed to allocate lock structure for %s\n",
1838 if (!tdb
->read_only
)
1839 if (tdb_clear_spinlocks(tdb
) != 0) {
1840 TDB_LOG((tdb
, 0, "tdb_open_ex: "
1841 "failed to clear spinlock\n"));
1844 if (tdb_brlock(tdb
, ACTIVE_LOCK
, F_UNLCK
, F_SETLK
, 0) == -1) {
1845 TDB_LOG((tdb
, 0, "tdb_open_ex: "
1846 "failed to take ACTIVE_LOCK on %s: %s\n",
1847 name
, strerror(errno
)));
1853 /* We always need to do this if the CLEAR_IF_FIRST flag is set, even if
1854 we didn't get the initial exclusive lock as we need to let all other
1855 users know we're using it. */
1857 if (tdb_flags
& TDB_CLEAR_IF_FIRST
) {
1858 /* leave this lock in place to indicate it's in use */
1859 if (tdb_brlock(tdb
, ACTIVE_LOCK
, F_RDLCK
, F_SETLKW
, 0) == -1)
1865 /* Internal (memory-only) databases skip all the code above to
1866 * do with disk files, and resume here by releasing their
1867 * global lock and hooking into the active list. */
1868 if (tdb_brlock(tdb
, GLOBAL_LOCK
, F_UNLCK
, F_SETLKW
, 0) == -1)
1875 { int save_errno
= errno
;
1881 if (tdb
->flags
& TDB_INTERNAL
)
1882 SAFE_FREE(tdb
->map_ptr
);
1886 SAFE_FREE(tdb
->name
);
1888 if (close(tdb
->fd
) != 0)
1889 TDB_LOG((tdb
, 5, "tdb_open_ex: failed to close tdb->fd on error!\n"));
1890 SAFE_FREE(tdb
->locked
);
1900 * @returns -1 for error; 0 for success.
1902 int tdb_close(TDB_CONTEXT
*tdb
)
1908 if (tdb
->flags
& TDB_INTERNAL
)
1909 SAFE_FREE(tdb
->map_ptr
);
1913 SAFE_FREE(tdb
->name
);
1915 ret
= close(tdb
->fd
);
1916 SAFE_FREE(tdb
->locked
);
1918 /* Remove from contexts list */
1919 for (i
= &tdbs
; *i
; i
= &(*i
)->next
) {
1926 memset(tdb
, 0, sizeof(*tdb
));
1932 /* lock/unlock entire database */
1933 int tdb_lockall(TDB_CONTEXT
*tdb
)
1937 /* There are no locks on read-only dbs */
1939 return TDB_ERRCODE(TDB_ERR_LOCK
, -1);
1940 for (i
= 0; i
< tdb
->header
.hash_size
; i
++)
1941 if (tdb_lock(tdb
, i
, F_WRLCK
))
1944 /* If error, release locks we have... */
1945 if (i
< tdb
->header
.hash_size
) {
1948 for ( j
= 0; j
< i
; j
++)
1949 tdb_unlock(tdb
, j
, F_WRLCK
);
1950 return TDB_ERRCODE(TDB_ERR_NOLOCK
, -1);
1955 void tdb_unlockall(TDB_CONTEXT
*tdb
)
1958 for (i
=0; i
< tdb
->header
.hash_size
; i
++)
1959 tdb_unlock(tdb
, i
, F_WRLCK
);
1962 /* lock/unlock one hash chain. This is meant to be used to reduce
1963 contention - it cannot guarantee how many records will be locked */
1964 int tdb_chainlock(TDB_CONTEXT
*tdb
, TDB_DATA key
)
1966 return tdb_lock(tdb
, BUCKET(tdb
->hash_fn(&key
)), F_WRLCK
);
1969 int tdb_chainunlock(TDB_CONTEXT
*tdb
, TDB_DATA key
)
1971 return tdb_unlock(tdb
, BUCKET(tdb
->hash_fn(&key
)), F_WRLCK
);
1974 int tdb_chainlock_read(TDB_CONTEXT
*tdb
, TDB_DATA key
)
1976 return tdb_lock(tdb
, BUCKET(tdb
->hash_fn(&key
)), F_RDLCK
);
1979 int tdb_chainunlock_read(TDB_CONTEXT
*tdb
, TDB_DATA key
)
1981 return tdb_unlock(tdb
, BUCKET(tdb
->hash_fn(&key
)), F_RDLCK
);
1985 /* register a loging function */
1986 void tdb_logging_function(TDB_CONTEXT
*tdb
, void (*fn
)(TDB_CONTEXT
*, int , const char *, ...))
1991 /* reopen a tdb - this can be used after a fork to ensure that we have an independent
1992 seek pointer from our parent and to re-establish locks */
1993 int tdb_reopen(TDB_CONTEXT
*tdb
)
1997 if (tdb
->flags
& TDB_INTERNAL
)
1998 return 0; /* Nothing to do. */
1999 if (tdb_munmap(tdb
) != 0) {
2000 TDB_LOG((tdb
, 0, "tdb_reopen: munmap failed (%s)\n", strerror(errno
)));
2003 if (close(tdb
->fd
) != 0)
2004 TDB_LOG((tdb
, 0, "tdb_reopen: WARNING closing tdb->fd failed!\n"));
2005 tdb
->fd
= open(tdb
->name
, tdb
->open_flags
& ~(O_CREAT
|O_TRUNC
), 0);
2006 if (tdb
->fd
== -1) {
2007 TDB_LOG((tdb
, 0, "tdb_reopen: open failed (%s)\n", strerror(errno
)));
2010 if (fstat(tdb
->fd
, &st
) != 0) {
2011 TDB_LOG((tdb
, 0, "tdb_reopen: fstat failed (%s)\n", strerror(errno
)));
2014 if (st
.st_ino
!= tdb
->inode
|| st
.st_dev
!= tdb
->device
) {
2015 TDB_LOG((tdb
, 0, "tdb_reopen: file dev/inode has changed!\n"));
2019 if ((tdb
->flags
& TDB_CLEAR_IF_FIRST
) && (tdb_brlock(tdb
, ACTIVE_LOCK
, F_RDLCK
, F_SETLKW
, 0) == -1)) {
2020 TDB_LOG((tdb
, 0, "tdb_reopen: failed to obtain active lock\n"));
2031 /* reopen all tdb's */
2032 int tdb_reopen_all(void)
2036 for (tdb
=tdbs
; tdb
; tdb
= tdb
->next
) {
2037 /* Ensure no clear-if-first. */
2038 tdb
->flags
&= ~TDB_CLEAR_IF_FIRST
;
2039 if (tdb_reopen(tdb
) != 0)