wmi-1.3.16 from opsview.com
This commit is contained in:
@@ -0,0 +1,89 @@
|
||||
#!gmake
|
||||
#
|
||||
# Makefile for tdb directory
|
||||
#
|
||||
|
||||
CC = @CC@
|
||||
prefix = @prefix@
|
||||
exec_prefix = @exec_prefix@
|
||||
bindir = @bindir@
|
||||
includedir = @includedir@
|
||||
libdir = @libdir@
|
||||
VPATH = @srcdir@:@libreplacedir@
|
||||
srcdir = @srcdir@
|
||||
builddir = @builddir@
|
||||
CPPFLAGS = @CPPFLAGS@ -I$(srcdir)/include -Iinclude -I@libreplacedir@
|
||||
CFLAGS = $(CPPFLAGS) @CFLAGS@
|
||||
LDFLAGS = @LDFLAGS@
|
||||
EXEEXT = @EXEEXT@
|
||||
|
||||
.PHONY: test
|
||||
|
||||
PROGS = bin/tdbtool$(EXEEXT) bin/tdbtorture$(EXEEXT)
|
||||
PROGS_NOINSTALL = bin/tdbtest$(EXEEXT) bin/tdbdump$(EXEEXT) bin/tdbbackup$(EXEEXT)
|
||||
ALL_PROGS = $(PROGS) $(PROGS_NOINSTALL)
|
||||
|
||||
TDB_OBJ = @TDBOBJ@ @LIBREPLACEOBJ@
|
||||
|
||||
DIRS = bin common tools
|
||||
|
||||
all: showflags dirs $(PROGS)
|
||||
|
||||
showflags:
|
||||
@echo 'tdb will be compiled with flags:'
|
||||
@echo ' CFLAGS = $(CFLAGS)'
|
||||
@echo ' CPPFLAGS = $(CPPFLAGS)'
|
||||
@echo ' LDFLAGS = $(LDFLAGS)'
|
||||
@echo ' LIBS = $(LIBS)'
|
||||
|
||||
.c.o:
|
||||
@echo Compiling $*.c
|
||||
@mkdir -p `dirname $@`
|
||||
@$(CC) $(CFLAGS) -c $< -o $@
|
||||
|
||||
dirs:
|
||||
@mkdir -p $(DIRS)
|
||||
|
||||
install: all
|
||||
mkdir -p $(bindir)
|
||||
mkdir -p $(includedir)
|
||||
mkdir -p $(libdir)
|
||||
mkdir -p $(libdir)/pkgconfig
|
||||
cp $(PROGS) $(bindir)
|
||||
cp $(srcdir)/include/tdb.h $(includedir)
|
||||
cp tdb.pc $(libdir)/pkgconfig
|
||||
|
||||
libtdb.a: $(TDB_OBJ)
|
||||
ar -rv libtdb.a $(TDB_OBJ)
|
||||
|
||||
bin/tdbtest$(EXEEXT): tools/tdbtest.o libtdb.a
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbtest tools/tdbtest.o -L. -ltdb -lgdbm
|
||||
|
||||
bin/tdbtool$(EXEEXT): tools/tdbtool.o libtdb.a
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbtool tools/tdbtool.o -L. -ltdb
|
||||
|
||||
bin/tdbtorture$(EXEEXT): tools/tdbtorture.o libtdb.a
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbtorture tools/tdbtorture.o -L. -ltdb
|
||||
|
||||
bin/tdbdump$(EXEEXT): tools/tdbdump.o libtdb.a
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbdump tools/tdbdump.o -L. -ltdb
|
||||
|
||||
bin/tdbbackup$(EXEEXT): tools/tdbbackup.o libtdb.a
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbbackup tools/tdbbackup.o -L. -ltdb
|
||||
|
||||
test: bin/tdbtorture$(EXEEXT)
|
||||
bin/tdbtorture$(EXEEXT)
|
||||
|
||||
installcheck: test install
|
||||
|
||||
clean:
|
||||
rm -f $(ALL_PROGS) *.o *.a common/*.o tools/*.o tdb.pc
|
||||
rm -f test.db test.tdb torture.tdb test.gdbm
|
||||
|
||||
distclean: clean
|
||||
rm -f *~ */*~
|
||||
rm -f config.log config.status include/config.h config.cache
|
||||
rm -f Makefile
|
||||
|
||||
realdistclean: distclean
|
||||
rm -f configure include/config.h.in
|
||||
Vendored
+1
@@ -0,0 +1 @@
|
||||
m4_include(libreplace.m4)
|
||||
Executable
+14
@@ -0,0 +1,14 @@
|
||||
#!/bin/sh
|
||||
|
||||
rm -rf autom4te.cache
|
||||
rm -f configure config.h.in
|
||||
|
||||
IPATHS="-I libreplace -I lib/replace -I ../libreplace -I ../replace"
|
||||
autoconf $IPATHS || exit 1
|
||||
autoheader $IPATHS || exit 1
|
||||
|
||||
rm -rf autom4te.cache
|
||||
|
||||
echo "Now run ./configure and then make."
|
||||
exit 0
|
||||
|
||||
@@ -0,0 +1,135 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
static tdb_off_t tdb_dump_record(struct tdb_context *tdb, tdb_off_t offset)
|
||||
{
|
||||
struct list_struct rec;
|
||||
tdb_off_t tailer_ofs, tailer;
|
||||
|
||||
if (tdb->methods->tdb_read(tdb, offset, (char *)&rec,
|
||||
sizeof(rec), DOCONV()) == -1) {
|
||||
printf("ERROR: failed to read record at %u\n", offset);
|
||||
return 0;
|
||||
}
|
||||
|
||||
printf(" rec: offset=0x%08x next=0x%08x rec_len=%d key_len=%d data_len=%d full_hash=0x%x magic=0x%x\n",
|
||||
offset, rec.next, rec.rec_len, rec.key_len, rec.data_len, rec.full_hash, rec.magic);
|
||||
|
||||
tailer_ofs = offset + sizeof(rec) + rec.rec_len - sizeof(tdb_off_t);
|
||||
|
||||
if (tdb_ofs_read(tdb, tailer_ofs, &tailer) == -1) {
|
||||
printf("ERROR: failed to read tailer at %u\n", tailer_ofs);
|
||||
return rec.next;
|
||||
}
|
||||
|
||||
if (tailer != rec.rec_len + sizeof(rec)) {
|
||||
printf("ERROR: tailer does not match record! tailer=%u totalsize=%u\n",
|
||||
(unsigned int)tailer, (unsigned int)(rec.rec_len + sizeof(rec)));
|
||||
}
|
||||
return rec.next;
|
||||
}
|
||||
|
||||
static int tdb_dump_chain(struct tdb_context *tdb, int i)
|
||||
{
|
||||
tdb_off_t rec_ptr, top;
|
||||
|
||||
top = TDB_HASH_TOP(i);
|
||||
|
||||
if (tdb_lock(tdb, i, F_WRLCK) != 0)
|
||||
return -1;
|
||||
|
||||
if (tdb_ofs_read(tdb, top, &rec_ptr) == -1)
|
||||
return tdb_unlock(tdb, i, F_WRLCK);
|
||||
|
||||
if (rec_ptr)
|
||||
printf("hash=%d\n", i);
|
||||
|
||||
while (rec_ptr) {
|
||||
rec_ptr = tdb_dump_record(tdb, rec_ptr);
|
||||
}
|
||||
|
||||
return tdb_unlock(tdb, i, F_WRLCK);
|
||||
}
|
||||
|
||||
void tdb_dump_all(struct tdb_context *tdb)
|
||||
{
|
||||
int i;
|
||||
for (i=0;i<tdb->header.hash_size;i++) {
|
||||
tdb_dump_chain(tdb, i);
|
||||
}
|
||||
printf("freelist:\n");
|
||||
tdb_dump_chain(tdb, -1);
|
||||
}
|
||||
|
||||
int tdb_printfreelist(struct tdb_context *tdb)
|
||||
{
|
||||
int ret;
|
||||
long total_free = 0;
|
||||
tdb_off_t offset, rec_ptr;
|
||||
struct list_struct rec;
|
||||
|
||||
if ((ret = tdb_lock(tdb, -1, F_WRLCK)) != 0)
|
||||
return ret;
|
||||
|
||||
offset = FREELIST_TOP;
|
||||
|
||||
/* read in the freelist top */
|
||||
if (tdb_ofs_read(tdb, offset, &rec_ptr) == -1) {
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return 0;
|
||||
}
|
||||
|
||||
printf("freelist top=[0x%08x]\n", rec_ptr );
|
||||
while (rec_ptr) {
|
||||
if (tdb->methods->tdb_read(tdb, rec_ptr, (char *)&rec,
|
||||
sizeof(rec), DOCONV()) == -1) {
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (rec.magic != TDB_FREE_MAGIC) {
|
||||
printf("bad magic 0x%08x in free list\n", rec.magic);
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return -1;
|
||||
}
|
||||
|
||||
printf("entry offset=[0x%08x], rec.rec_len = [0x%08x (%d)] (end = 0x%08x)\n",
|
||||
rec_ptr, rec.rec_len, rec.rec_len, rec_ptr + rec.rec_len);
|
||||
total_free += rec.rec_len;
|
||||
|
||||
/* move to the next record */
|
||||
rec_ptr = rec.next;
|
||||
}
|
||||
printf("total rec_len = [0x%08x (%d)]\n", (int)total_free,
|
||||
(int)total_free);
|
||||
|
||||
return tdb_unlock(tdb, -1, F_WRLCK);
|
||||
}
|
||||
|
||||
@@ -0,0 +1,58 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
enum TDB_ERROR tdb_error(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->ecode;
|
||||
}
|
||||
|
||||
static struct tdb_errname {
|
||||
enum TDB_ERROR ecode; const char *estring;
|
||||
} emap[] = { {TDB_SUCCESS, "Success"},
|
||||
{TDB_ERR_CORRUPT, "Corrupt database"},
|
||||
{TDB_ERR_IO, "IO Error"},
|
||||
{TDB_ERR_LOCK, "Locking error"},
|
||||
{TDB_ERR_OOM, "Out of memory"},
|
||||
{TDB_ERR_EXISTS, "Record exists"},
|
||||
{TDB_ERR_NOLOCK, "Lock exists on other keys"},
|
||||
{TDB_ERR_EINVAL, "Invalid parameter"},
|
||||
{TDB_ERR_NOEXIST, "Record does not exist"},
|
||||
{TDB_ERR_RDONLY, "write not permitted"} };
|
||||
|
||||
/* Error string for the last tdb error */
|
||||
const char *tdb_errorstr(struct tdb_context *tdb)
|
||||
{
|
||||
u32 i;
|
||||
for (i = 0; i < sizeof(emap) / sizeof(struct tdb_errname); i++)
|
||||
if (tdb->ecode == emap[i].ecode)
|
||||
return emap[i].estring;
|
||||
return "Invalid error code";
|
||||
}
|
||||
|
||||
@@ -0,0 +1,331 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
/* read a freelist record and check for simple errors */
|
||||
int rec_free_read(struct tdb_context *tdb, tdb_off_t off, struct list_struct *rec)
|
||||
{
|
||||
if (tdb->methods->tdb_read(tdb, off, rec, sizeof(*rec),DOCONV()) == -1)
|
||||
return -1;
|
||||
|
||||
if (rec->magic == TDB_MAGIC) {
|
||||
/* this happens when a app is showdown while deleting a record - we should
|
||||
not completely fail when this happens */
|
||||
TDB_LOG((tdb, TDB_DEBUG_WARNING, "rec_free_read non-free magic 0x%x at offset=%d - fixing\n",
|
||||
rec->magic, off));
|
||||
rec->magic = TDB_FREE_MAGIC;
|
||||
if (tdb->methods->tdb_write(tdb, off, rec, sizeof(*rec)) == -1)
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (rec->magic != TDB_FREE_MAGIC) {
|
||||
/* Ensure ecode is set for log fn. */
|
||||
tdb->ecode = TDB_ERR_CORRUPT;
|
||||
TDB_LOG((tdb, TDB_DEBUG_WARNING, "rec_free_read bad magic 0x%x at offset=%d\n",
|
||||
rec->magic, off));
|
||||
return TDB_ERRCODE(TDB_ERR_CORRUPT, -1);
|
||||
}
|
||||
if (tdb->methods->tdb_oob(tdb, rec->next+sizeof(*rec), 0) != 0)
|
||||
return -1;
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/* Remove an element from the freelist. Must have alloc lock. */
|
||||
static int remove_from_freelist(struct tdb_context *tdb, tdb_off_t off, tdb_off_t next)
|
||||
{
|
||||
tdb_off_t last_ptr, i;
|
||||
|
||||
/* read in the freelist top */
|
||||
last_ptr = FREELIST_TOP;
|
||||
while (tdb_ofs_read(tdb, last_ptr, &i) != -1 && i != 0) {
|
||||
if (i == off) {
|
||||
/* We've found it! */
|
||||
return tdb_ofs_write(tdb, last_ptr, &next);
|
||||
}
|
||||
/* Follow chain (next offset is at start of record) */
|
||||
last_ptr = i;
|
||||
}
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"remove_from_freelist: not on list at off=%d\n", off));
|
||||
return TDB_ERRCODE(TDB_ERR_CORRUPT, -1);
|
||||
}
|
||||
|
||||
|
||||
/* update a record tailer (must hold allocation lock) */
|
||||
static int update_tailer(struct tdb_context *tdb, tdb_off_t offset,
|
||||
const struct list_struct *rec)
|
||||
{
|
||||
tdb_off_t totalsize;
|
||||
|
||||
/* Offset of tailer from record header */
|
||||
totalsize = sizeof(*rec) + rec->rec_len;
|
||||
return tdb_ofs_write(tdb, offset + totalsize - sizeof(tdb_off_t),
|
||||
&totalsize);
|
||||
}
|
||||
|
||||
/* Add an element into the freelist. Merge adjacent records if
|
||||
neccessary. */
|
||||
int tdb_free(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec)
|
||||
{
|
||||
tdb_off_t right, left;
|
||||
|
||||
/* Allocation and tailer lock */
|
||||
if (tdb_lock(tdb, -1, F_WRLCK) != 0)
|
||||
return -1;
|
||||
|
||||
/* set an initial tailer, so if we fail we don't leave a bogus record */
|
||||
if (update_tailer(tdb, offset, rec) != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: update_tailer failed!\n"));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* Look right first (I'm an Australian, dammit) */
|
||||
right = offset + sizeof(*rec) + rec->rec_len;
|
||||
if (right + sizeof(*rec) <= tdb->map_size) {
|
||||
struct list_struct r;
|
||||
|
||||
if (tdb->methods->tdb_read(tdb, right, &r, sizeof(r), DOCONV()) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: right read failed at %u\n", right));
|
||||
goto left;
|
||||
}
|
||||
|
||||
/* If it's free, expand to include it. */
|
||||
if (r.magic == TDB_FREE_MAGIC) {
|
||||
if (remove_from_freelist(tdb, right, r.next) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: right free failed at %u\n", right));
|
||||
goto left;
|
||||
}
|
||||
rec->rec_len += sizeof(r) + r.rec_len;
|
||||
}
|
||||
}
|
||||
|
||||
left:
|
||||
/* Look left */
|
||||
left = offset - sizeof(tdb_off_t);
|
||||
if (left > TDB_DATA_START(tdb->header.hash_size)) {
|
||||
struct list_struct l;
|
||||
tdb_off_t leftsize;
|
||||
|
||||
/* Read in tailer and jump back to header */
|
||||
if (tdb_ofs_read(tdb, left, &leftsize) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: left offset read failed at %u\n", left));
|
||||
goto update;
|
||||
}
|
||||
|
||||
/* it could be uninitialised data */
|
||||
if (leftsize == 0 || leftsize == TDB_PAD_U32) {
|
||||
goto update;
|
||||
}
|
||||
|
||||
left = offset - leftsize;
|
||||
|
||||
/* Now read in record */
|
||||
if (tdb->methods->tdb_read(tdb, left, &l, sizeof(l), DOCONV()) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: left read failed at %u (%u)\n", left, leftsize));
|
||||
goto update;
|
||||
}
|
||||
|
||||
/* If it's free, expand to include it. */
|
||||
if (l.magic == TDB_FREE_MAGIC) {
|
||||
if (remove_from_freelist(tdb, left, l.next) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: left free failed at %u\n", left));
|
||||
goto update;
|
||||
} else {
|
||||
offset = left;
|
||||
rec->rec_len += leftsize;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
update:
|
||||
if (update_tailer(tdb, offset, rec) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: update_tailer failed at %u\n", offset));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* Now, prepend to free list */
|
||||
rec->magic = TDB_FREE_MAGIC;
|
||||
|
||||
if (tdb_ofs_read(tdb, FREELIST_TOP, &rec->next) == -1 ||
|
||||
tdb_rec_write(tdb, offset, rec) == -1 ||
|
||||
tdb_ofs_write(tdb, FREELIST_TOP, &offset) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free record write failed at offset=%d\n", offset));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* And we're done. */
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return 0;
|
||||
|
||||
fail:
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return -1;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
the core of tdb_allocate - called when we have decided which
|
||||
free list entry to use
|
||||
*/
|
||||
static tdb_off_t tdb_allocate_ofs(struct tdb_context *tdb, tdb_len_t length, tdb_off_t rec_ptr,
|
||||
struct list_struct *rec, tdb_off_t last_ptr)
|
||||
{
|
||||
struct list_struct newrec;
|
||||
tdb_off_t newrec_ptr;
|
||||
|
||||
memset(&newrec, '\0', sizeof(newrec));
|
||||
|
||||
/* found it - now possibly split it up */
|
||||
if (rec->rec_len > length + MIN_REC_SIZE) {
|
||||
/* Length of left piece */
|
||||
length = TDB_ALIGN(length, TDB_ALIGNMENT);
|
||||
|
||||
/* Right piece to go on free list */
|
||||
newrec.rec_len = rec->rec_len - (sizeof(*rec) + length);
|
||||
newrec_ptr = rec_ptr + sizeof(*rec) + length;
|
||||
|
||||
/* And left record is shortened */
|
||||
rec->rec_len = length;
|
||||
} else {
|
||||
newrec_ptr = 0;
|
||||
}
|
||||
|
||||
/* Remove allocated record from the free list */
|
||||
if (tdb_ofs_write(tdb, last_ptr, &rec->next) == -1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Update header: do this before we drop alloc
|
||||
lock, otherwise tdb_free() might try to
|
||||
merge with us, thinking we're free.
|
||||
(Thanks Jeremy Allison). */
|
||||
rec->magic = TDB_MAGIC;
|
||||
if (tdb_rec_write(tdb, rec_ptr, rec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Did we create new block? */
|
||||
if (newrec_ptr) {
|
||||
/* Update allocated record tailer (we
|
||||
shortened it). */
|
||||
if (update_tailer(tdb, rec_ptr, rec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Free new record */
|
||||
if (tdb_free(tdb, newrec_ptr, &newrec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
/* all done - return the new record offset */
|
||||
return rec_ptr;
|
||||
}
|
||||
|
||||
/* allocate some space from the free list. The offset returned points
|
||||
to a unconnected list_struct within the database with room for at
|
||||
least length bytes of total data
|
||||
|
||||
0 is returned if the space could not be allocated
|
||||
*/
|
||||
tdb_off_t tdb_allocate(struct tdb_context *tdb, tdb_len_t length, struct list_struct *rec)
|
||||
{
|
||||
tdb_off_t rec_ptr, last_ptr, newrec_ptr;
|
||||
struct {
|
||||
tdb_off_t rec_ptr, last_ptr;
|
||||
tdb_len_t rec_len;
|
||||
} bestfit;
|
||||
|
||||
if (tdb_lock(tdb, -1, F_WRLCK) == -1)
|
||||
return 0;
|
||||
|
||||
/* Extra bytes required for tailer */
|
||||
length += sizeof(tdb_off_t);
|
||||
|
||||
again:
|
||||
last_ptr = FREELIST_TOP;
|
||||
|
||||
/* read in the freelist top */
|
||||
if (tdb_ofs_read(tdb, FREELIST_TOP, &rec_ptr) == -1)
|
||||
goto fail;
|
||||
|
||||
bestfit.rec_ptr = 0;
|
||||
bestfit.last_ptr = 0;
|
||||
bestfit.rec_len = 0;
|
||||
|
||||
/*
|
||||
this is a best fit allocation strategy. Originally we used
|
||||
a first fit strategy, but it suffered from massive fragmentation
|
||||
issues when faced with a slowly increasing record size.
|
||||
*/
|
||||
while (rec_ptr) {
|
||||
if (rec_free_read(tdb, rec_ptr, rec) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (rec->rec_len >= length) {
|
||||
if (bestfit.rec_ptr == 0 ||
|
||||
rec->rec_len < bestfit.rec_len) {
|
||||
bestfit.rec_len = rec->rec_len;
|
||||
bestfit.rec_ptr = rec_ptr;
|
||||
bestfit.last_ptr = last_ptr;
|
||||
/* consider a fit to be good enough if
|
||||
we aren't wasting more than half
|
||||
the space */
|
||||
if (bestfit.rec_len < 2*length) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* move to the next record */
|
||||
last_ptr = rec_ptr;
|
||||
rec_ptr = rec->next;
|
||||
}
|
||||
|
||||
if (bestfit.rec_ptr != 0) {
|
||||
if (rec_free_read(tdb, bestfit.rec_ptr, rec) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
|
||||
newrec_ptr = tdb_allocate_ofs(tdb, length, bestfit.rec_ptr, rec, bestfit.last_ptr);
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return newrec_ptr;
|
||||
}
|
||||
|
||||
/* we didn't find enough space. See if we can expand the
|
||||
database and if we can then try again */
|
||||
if (tdb_expand(tdb, length + sizeof(*rec)) == 0)
|
||||
goto again;
|
||||
fail:
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,108 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Jeremy Allison 2006
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
/* Check the freelist is good and contains no loops.
|
||||
Very memory intensive - only do this as a consistency
|
||||
checker. Heh heh - uses an in memory tdb as the storage
|
||||
for the "seen" record list. For some reason this strikes
|
||||
me as extremely clever as I don't have to write another tree
|
||||
data structure implementation :-).
|
||||
*/
|
||||
|
||||
static int seen_insert(struct tdb_context *mem_tdb, tdb_off_t rec_ptr)
|
||||
{
|
||||
TDB_DATA key, data;
|
||||
|
||||
memset(&data, '\0', sizeof(data));
|
||||
key.dptr = (char *)&rec_ptr;
|
||||
key.dsize = sizeof(rec_ptr);
|
||||
return tdb_store(mem_tdb, key, data, TDB_INSERT);
|
||||
}
|
||||
|
||||
int tdb_validate_freelist(struct tdb_context *tdb, int *pnum_entries)
|
||||
{
|
||||
struct tdb_context *mem_tdb = NULL;
|
||||
struct list_struct rec;
|
||||
tdb_off_t rec_ptr, last_ptr;
|
||||
int ret = -1;
|
||||
|
||||
*pnum_entries = 0;
|
||||
|
||||
mem_tdb = tdb_open("flval", tdb->header.hash_size,
|
||||
TDB_INTERNAL, O_RDWR, 0600);
|
||||
if (!mem_tdb) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (tdb_lock(tdb, -1, F_WRLCK) == -1) {
|
||||
tdb_close(mem_tdb);
|
||||
return 0;
|
||||
}
|
||||
|
||||
last_ptr = FREELIST_TOP;
|
||||
|
||||
/* Store the FREELIST_TOP record. */
|
||||
if (seen_insert(mem_tdb, last_ptr) == -1) {
|
||||
ret = TDB_ERRCODE(TDB_ERR_CORRUPT, -1);
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* read in the freelist top */
|
||||
if (tdb_ofs_read(tdb, FREELIST_TOP, &rec_ptr) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
|
||||
while (rec_ptr) {
|
||||
|
||||
/* If we can't store this record (we've seen it
|
||||
before) then the free list has a loop and must
|
||||
be corrupt. */
|
||||
|
||||
if (seen_insert(mem_tdb, rec_ptr)) {
|
||||
ret = TDB_ERRCODE(TDB_ERR_CORRUPT, -1);
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (rec_free_read(tdb, rec_ptr, &rec) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* move to the next record */
|
||||
last_ptr = rec_ptr;
|
||||
rec_ptr = rec.next;
|
||||
*pnum_entries += 1;
|
||||
}
|
||||
|
||||
ret = 0;
|
||||
|
||||
fail:
|
||||
|
||||
tdb_close(mem_tdb);
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return ret;
|
||||
}
|
||||
@@ -0,0 +1,391 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
/* check for an out of bounds access - if it is out of bounds then
|
||||
see if the database has been expanded by someone else and expand
|
||||
if necessary
|
||||
note that "len" is the minimum length needed for the db
|
||||
*/
|
||||
static int tdb_oob(struct tdb_context *tdb, tdb_off_t len, int probe)
|
||||
{
|
||||
struct stat st;
|
||||
if (len <= tdb->map_size)
|
||||
return 0;
|
||||
if (tdb->flags & TDB_INTERNAL) {
|
||||
if (!probe) {
|
||||
/* Ensure ecode is set for log fn. */
|
||||
tdb->ecode = TDB_ERR_IO;
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_oob len %d beyond internal malloc size %d\n",
|
||||
(int)len, (int)tdb->map_size));
|
||||
}
|
||||
return TDB_ERRCODE(TDB_ERR_IO, -1);
|
||||
}
|
||||
|
||||
if (fstat(tdb->fd, &st) == -1) {
|
||||
return TDB_ERRCODE(TDB_ERR_IO, -1);
|
||||
}
|
||||
|
||||
if (st.st_size < (size_t)len) {
|
||||
if (!probe) {
|
||||
/* Ensure ecode is set for log fn. */
|
||||
tdb->ecode = TDB_ERR_IO;
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_oob len %d beyond eof at %d\n",
|
||||
(int)len, (int)st.st_size));
|
||||
}
|
||||
return TDB_ERRCODE(TDB_ERR_IO, -1);
|
||||
}
|
||||
|
||||
/* Unmap, update size, remap */
|
||||
if (tdb_munmap(tdb) == -1)
|
||||
return TDB_ERRCODE(TDB_ERR_IO, -1);
|
||||
tdb->map_size = st.st_size;
|
||||
tdb_mmap(tdb);
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* write a lump of data at a specified offset */
|
||||
static int tdb_write(struct tdb_context *tdb, tdb_off_t off,
|
||||
const void *buf, tdb_len_t len)
|
||||
{
|
||||
if (len == 0) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (tdb->read_only || tdb->traverse_read) {
|
||||
tdb->ecode = TDB_ERR_RDONLY;
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (tdb->methods->tdb_oob(tdb, off + len, 0) != 0)
|
||||
return -1;
|
||||
|
||||
if (tdb->map_ptr) {
|
||||
memcpy(off + (char *)tdb->map_ptr, buf, len);
|
||||
} else if (pwrite(tdb->fd, buf, len, off) != (ssize_t)len) {
|
||||
/* Ensure ecode is set for log fn. */
|
||||
tdb->ecode = TDB_ERR_IO;
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_write failed at %d len=%d (%s)\n",
|
||||
off, len, strerror(errno)));
|
||||
return TDB_ERRCODE(TDB_ERR_IO, -1);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Endian conversion: we only ever deal with 4 byte quantities */
|
||||
void *tdb_convert(void *buf, u32 size)
|
||||
{
|
||||
u32 i, *p = (u32 *)buf;
|
||||
for (i = 0; i < size / 4; i++)
|
||||
p[i] = TDB_BYTEREV(p[i]);
|
||||
return buf;
|
||||
}
|
||||
|
||||
|
||||
/* read a lump of data at a specified offset, maybe convert */
|
||||
static int tdb_read(struct tdb_context *tdb, tdb_off_t off, void *buf,
|
||||
tdb_len_t len, int cv)
|
||||
{
|
||||
if (tdb->methods->tdb_oob(tdb, off + len, 0) != 0) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (tdb->map_ptr) {
|
||||
memcpy(buf, off + (char *)tdb->map_ptr, len);
|
||||
} else {
|
||||
ssize_t ret = pread(tdb->fd, buf, len, off);
|
||||
if (ret != (ssize_t)len) {
|
||||
/* Ensure ecode is set for log fn. */
|
||||
tdb->ecode = TDB_ERR_IO;
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_read failed at %d len=%d ret=%d (%s) map_size=%d\n",
|
||||
off, len, ret, strerror(errno), (int)tdb->map_size));
|
||||
return TDB_ERRCODE(TDB_ERR_IO, -1);
|
||||
}
|
||||
}
|
||||
if (cv) {
|
||||
tdb_convert(buf, len);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*
|
||||
do an unlocked scan of the hash table heads to find the next non-zero head. The value
|
||||
will then be confirmed with the lock held
|
||||
*/
|
||||
static void tdb_next_hash_chain(struct tdb_context *tdb, u32 *chain)
|
||||
{
|
||||
u32 h = *chain;
|
||||
if (tdb->map_ptr) {
|
||||
for (;h < tdb->header.hash_size;h++) {
|
||||
if (0 != *(u32 *)(TDB_HASH_TOP(h) + (unsigned char *)tdb->map_ptr)) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
u32 off=0;
|
||||
for (;h < tdb->header.hash_size;h++) {
|
||||
if (tdb_ofs_read(tdb, TDB_HASH_TOP(h), &off) != 0 || off != 0) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
(*chain) = h;
|
||||
}
|
||||
|
||||
|
||||
int tdb_munmap(struct tdb_context *tdb)
|
||||
{
|
||||
if (tdb->flags & TDB_INTERNAL)
|
||||
return 0;
|
||||
|
||||
#ifdef HAVE_MMAP
|
||||
if (tdb->map_ptr) {
|
||||
int ret = munmap(tdb->map_ptr, tdb->map_size);
|
||||
if (ret != 0)
|
||||
return ret;
|
||||
}
|
||||
#endif
|
||||
tdb->map_ptr = NULL;
|
||||
return 0;
|
||||
}
|
||||
|
||||
void tdb_mmap(struct tdb_context *tdb)
|
||||
{
|
||||
if (tdb->flags & TDB_INTERNAL)
|
||||
return;
|
||||
|
||||
#ifdef HAVE_MMAP
|
||||
if (!(tdb->flags & TDB_NOMMAP)) {
|
||||
tdb->map_ptr = mmap(NULL, tdb->map_size,
|
||||
PROT_READ|(tdb->read_only? 0:PROT_WRITE),
|
||||
MAP_SHARED|MAP_FILE, tdb->fd, 0);
|
||||
|
||||
/*
|
||||
* NB. When mmap fails it returns MAP_FAILED *NOT* NULL !!!!
|
||||
*/
|
||||
|
||||
if (tdb->map_ptr == MAP_FAILED) {
|
||||
tdb->map_ptr = NULL;
|
||||
TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_mmap failed for size %d (%s)\n",
|
||||
tdb->map_size, strerror(errno)));
|
||||
}
|
||||
} else {
|
||||
tdb->map_ptr = NULL;
|
||||
}
|
||||
#else
|
||||
tdb->map_ptr = NULL;
|
||||
#endif
|
||||
}
|
||||
|
||||
/* expand a file. we prefer to use ftruncate, as that is what posix
|
||||
says to use for mmap expansion */
|
||||
static int tdb_expand_file(struct tdb_context *tdb, tdb_off_t size, tdb_off_t addition)
|
||||
{
|
||||
char buf[1024];
|
||||
|
||||
if (tdb->read_only || tdb->traverse_read) {
|
||||
tdb->ecode = TDB_ERR_RDONLY;
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (ftruncate(tdb->fd, size+addition) == -1) {
|
||||
char b = 0;
|
||||
if (pwrite(tdb->fd, &b, 1, (size+addition) - 1) != 1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "expand_file to %d failed (%s)\n",
|
||||
size+addition, strerror(errno)));
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
/* now fill the file with something. This ensures that the
|
||||
file isn't sparse, which would be very bad if we ran out of
|
||||
disk. This must be done with write, not via mmap */
|
||||
memset(buf, TDB_PAD_BYTE, sizeof(buf));
|
||||
while (addition) {
|
||||
int n = addition>sizeof(buf)?sizeof(buf):addition;
|
||||
int ret = pwrite(tdb->fd, buf, n, size);
|
||||
if (ret != n) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "expand_file write of %d failed (%s)\n",
|
||||
n, strerror(errno)));
|
||||
return -1;
|
||||
}
|
||||
addition -= n;
|
||||
size += n;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
/* expand the database at least size bytes by expanding the underlying
|
||||
file and doing the mmap again if necessary */
|
||||
int tdb_expand(struct tdb_context *tdb, tdb_off_t size)
|
||||
{
|
||||
struct list_struct rec;
|
||||
tdb_off_t offset;
|
||||
|
||||
if (tdb_lock(tdb, -1, F_WRLCK) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "lock failed in tdb_expand\n"));
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* must know about any previous expansions by another process */
|
||||
tdb->methods->tdb_oob(tdb, tdb->map_size + 1, 1);
|
||||
|
||||
/* always make room for at least 10 more records, and round
|
||||
the database up to a multiple of the page size */
|
||||
size = TDB_ALIGN(tdb->map_size + size*10, tdb->page_size) - tdb->map_size;
|
||||
|
||||
if (!(tdb->flags & TDB_INTERNAL))
|
||||
tdb_munmap(tdb);
|
||||
|
||||
/*
|
||||
* We must ensure the file is unmapped before doing this
|
||||
* to ensure consistency with systems like OpenBSD where
|
||||
* writes and mmaps are not consistent.
|
||||
*/
|
||||
|
||||
/* expand the file itself */
|
||||
if (!(tdb->flags & TDB_INTERNAL)) {
|
||||
if (tdb->methods->tdb_expand_file(tdb, tdb->map_size, size) != 0)
|
||||
goto fail;
|
||||
}
|
||||
|
||||
tdb->map_size += size;
|
||||
|
||||
if (tdb->flags & TDB_INTERNAL) {
|
||||
char *new_map_ptr = (char *)realloc(tdb->map_ptr,
|
||||
tdb->map_size);
|
||||
if (!new_map_ptr) {
|
||||
tdb->map_size -= size;
|
||||
goto fail;
|
||||
}
|
||||
tdb->map_ptr = new_map_ptr;
|
||||
} else {
|
||||
/*
|
||||
* We must ensure the file is remapped before adding the space
|
||||
* to ensure consistency with systems like OpenBSD where
|
||||
* writes and mmaps are not consistent.
|
||||
*/
|
||||
|
||||
/* We're ok if the mmap fails as we'll fallback to read/write */
|
||||
tdb_mmap(tdb);
|
||||
}
|
||||
|
||||
/* form a new freelist record */
|
||||
memset(&rec,'\0',sizeof(rec));
|
||||
rec.rec_len = size - sizeof(rec);
|
||||
|
||||
/* link it into the free list */
|
||||
offset = tdb->map_size - size;
|
||||
if (tdb_free(tdb, offset, &rec) == -1)
|
||||
goto fail;
|
||||
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return 0;
|
||||
fail:
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* read/write a tdb_off_t */
|
||||
int tdb_ofs_read(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d)
|
||||
{
|
||||
return tdb->methods->tdb_read(tdb, offset, (char*)d, sizeof(*d), DOCONV());
|
||||
}
|
||||
|
||||
int tdb_ofs_write(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d)
|
||||
{
|
||||
tdb_off_t off = *d;
|
||||
return tdb->methods->tdb_write(tdb, offset, CONVERT(off), sizeof(*d));
|
||||
}
|
||||
|
||||
|
||||
/* read a lump of data, allocating the space for it */
|
||||
unsigned char *tdb_alloc_read(struct tdb_context *tdb, tdb_off_t offset, tdb_len_t len)
|
||||
{
|
||||
unsigned char *buf;
|
||||
|
||||
/* some systems don't like zero length malloc */
|
||||
if (len == 0) {
|
||||
len = 1;
|
||||
}
|
||||
|
||||
if (!(buf = malloc(len))) {
|
||||
/* Ensure ecode is set for log fn. */
|
||||
tdb->ecode = TDB_ERR_OOM;
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR,"tdb_alloc_read malloc failed len=%d (%s)\n",
|
||||
len, strerror(errno)));
|
||||
return TDB_ERRCODE(TDB_ERR_OOM, buf);
|
||||
}
|
||||
if (tdb->methods->tdb_read(tdb, offset, buf, len, 0) == -1) {
|
||||
SAFE_FREE(buf);
|
||||
return NULL;
|
||||
}
|
||||
return buf;
|
||||
}
|
||||
|
||||
/* read/write a record */
|
||||
int tdb_rec_read(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec)
|
||||
{
|
||||
if (tdb->methods->tdb_read(tdb, offset, rec, sizeof(*rec),DOCONV()) == -1)
|
||||
return -1;
|
||||
if (TDB_BAD_MAGIC(rec)) {
|
||||
/* Ensure ecode is set for log fn. */
|
||||
tdb->ecode = TDB_ERR_CORRUPT;
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_rec_read bad magic 0x%x at offset=%d\n", rec->magic, offset));
|
||||
return TDB_ERRCODE(TDB_ERR_CORRUPT, -1);
|
||||
}
|
||||
return tdb->methods->tdb_oob(tdb, rec->next+sizeof(*rec), 0);
|
||||
}
|
||||
|
||||
int tdb_rec_write(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec)
|
||||
{
|
||||
struct list_struct r = *rec;
|
||||
return tdb->methods->tdb_write(tdb, offset, CONVERT(r), sizeof(r));
|
||||
}
|
||||
|
||||
static const struct tdb_methods io_methods = {
|
||||
tdb_read,
|
||||
tdb_write,
|
||||
tdb_next_hash_chain,
|
||||
tdb_oob,
|
||||
tdb_expand_file,
|
||||
tdb_brlock
|
||||
};
|
||||
|
||||
/*
|
||||
initialise the default methods table
|
||||
*/
|
||||
void tdb_io_init(struct tdb_context *tdb)
|
||||
{
|
||||
tdb->methods = &io_methods;
|
||||
}
|
||||
@@ -0,0 +1,342 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
/* a byte range locking function - return 0 on success
|
||||
this functions locks/unlocks 1 byte at the specified offset.
|
||||
|
||||
On error, errno is also set so that errors are passed back properly
|
||||
through tdb_open().
|
||||
|
||||
note that a len of zero means lock to end of file
|
||||
*/
|
||||
int tdb_brlock(struct tdb_context *tdb, tdb_off_t offset,
|
||||
int rw_type, int lck_type, int probe, size_t len)
|
||||
{
|
||||
struct flock fl;
|
||||
int ret;
|
||||
|
||||
if (tdb->flags & TDB_NOLOCK) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
if ((rw_type == F_WRLCK) && (tdb->read_only || tdb->traverse_read)) {
|
||||
tdb->ecode = TDB_ERR_RDONLY;
|
||||
return -1;
|
||||
}
|
||||
|
||||
fl.l_type = rw_type;
|
||||
fl.l_whence = SEEK_SET;
|
||||
fl.l_start = offset;
|
||||
fl.l_len = len;
|
||||
fl.l_pid = 0;
|
||||
|
||||
do {
|
||||
ret = fcntl(tdb->fd,lck_type,&fl);
|
||||
} while (ret == -1 && errno == EINTR);
|
||||
|
||||
if (ret == -1) {
|
||||
/* Generic lock error. errno set by fcntl.
|
||||
* EAGAIN is an expected return from non-blocking
|
||||
* locks. */
|
||||
if (!probe && lck_type != F_SETLK) {
|
||||
/* Ensure error code is set for log fun to examine. */
|
||||
tdb->ecode = TDB_ERR_LOCK;
|
||||
TDB_LOG((tdb, TDB_DEBUG_TRACE,"tdb_brlock failed (fd=%d) at offset %d rw_type=%d lck_type=%d len=%d\n",
|
||||
tdb->fd, offset, rw_type, lck_type, (int)len));
|
||||
}
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
upgrade a read lock to a write lock. This needs to be handled in a
|
||||
special way as some OSes (such as solaris) have too conservative
|
||||
deadlock detection and claim a deadlock when progress can be
|
||||
made. For those OSes we may loop for a while.
|
||||
*/
|
||||
int tdb_brlock_upgrade(struct tdb_context *tdb, tdb_off_t offset, size_t len)
|
||||
{
|
||||
int count = 1000;
|
||||
while (count--) {
|
||||
struct timeval tv;
|
||||
if (tdb_brlock(tdb, offset, F_WRLCK, F_SETLKW, 1, len) == 0) {
|
||||
return 0;
|
||||
}
|
||||
if (errno != EDEADLK) {
|
||||
break;
|
||||
}
|
||||
/* sleep for as short a time as we can - more portable than usleep() */
|
||||
tv.tv_sec = 0;
|
||||
tv.tv_usec = 1;
|
||||
select(0, NULL, NULL, NULL, &tv);
|
||||
}
|
||||
TDB_LOG((tdb, TDB_DEBUG_TRACE,"tdb_brlock_upgrade failed at offset %d\n", offset));
|
||||
return -1;
|
||||
}
|
||||
|
||||
|
||||
/* lock a list in the database. list -1 is the alloc list */
|
||||
int tdb_lock(struct tdb_context *tdb, int list, int ltype)
|
||||
{
|
||||
/* a global lock allows us to avoid per chain locks */
|
||||
if (tdb->global_lock.count &&
|
||||
(ltype == tdb->global_lock.ltype || ltype == F_RDLCK)) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (tdb->global_lock.count) {
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
}
|
||||
|
||||
if (list < -1 || list >= (int)tdb->header.hash_size) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR,"tdb_lock: invalid list %d for ltype=%d\n",
|
||||
list, ltype));
|
||||
return -1;
|
||||
}
|
||||
if (tdb->flags & TDB_NOLOCK)
|
||||
return 0;
|
||||
|
||||
/* Since fcntl locks don't nest, we do a lock for the first one,
|
||||
and simply bump the count for future ones */
|
||||
if (tdb->locked[list+1].count == 0) {
|
||||
if (tdb->methods->tdb_brlock(tdb,FREELIST_TOP+4*list,ltype,F_SETLKW, 0, 1)) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_lock failed on list %d ltype=%d (%s)\n",
|
||||
list, ltype, strerror(errno)));
|
||||
return -1;
|
||||
}
|
||||
tdb->locked[list+1].ltype = ltype;
|
||||
tdb->num_locks++;
|
||||
}
|
||||
tdb->locked[list+1].count++;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* unlock the database: returns void because it's too late for errors. */
|
||||
/* changed to return int it may be interesting to know there
|
||||
has been an error --simo */
|
||||
int tdb_unlock(struct tdb_context *tdb, int list, int ltype)
|
||||
{
|
||||
int ret = -1;
|
||||
|
||||
/* a global lock allows us to avoid per chain locks */
|
||||
if (tdb->global_lock.count &&
|
||||
(ltype == tdb->global_lock.ltype || ltype == F_RDLCK)) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (tdb->global_lock.count) {
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
}
|
||||
|
||||
if (tdb->flags & TDB_NOLOCK)
|
||||
return 0;
|
||||
|
||||
/* Sanity checks */
|
||||
if (list < -1 || list >= (int)tdb->header.hash_size) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: list %d invalid (%d)\n", list, tdb->header.hash_size));
|
||||
return ret;
|
||||
}
|
||||
|
||||
if (tdb->locked[list+1].count==0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: count is 0\n"));
|
||||
return ret;
|
||||
}
|
||||
|
||||
if (tdb->locked[list+1].count == 1) {
|
||||
/* Down to last nested lock: unlock underneath */
|
||||
ret = tdb->methods->tdb_brlock(tdb, FREELIST_TOP+4*list, F_UNLCK, F_SETLKW, 0, 1);
|
||||
tdb->num_locks--;
|
||||
} else {
|
||||
ret = 0;
|
||||
}
|
||||
tdb->locked[list+1].count--;
|
||||
|
||||
if (ret)
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: An error occurred unlocking!\n"));
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/* lock/unlock entire database */
|
||||
static int _tdb_lockall(struct tdb_context *tdb, int ltype)
|
||||
{
|
||||
/* There are no locks on read-only dbs */
|
||||
if (tdb->read_only || tdb->traverse_read)
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
|
||||
if (tdb->global_lock.count && tdb->global_lock.ltype == ltype) {
|
||||
tdb->global_lock.count++;
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (tdb->global_lock.count) {
|
||||
/* a global lock of a different type exists */
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
}
|
||||
|
||||
if (tdb->num_locks != 0) {
|
||||
/* can't combine global and chain locks */
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
}
|
||||
|
||||
if (tdb->methods->tdb_brlock(tdb, FREELIST_TOP, ltype, F_SETLKW,
|
||||
0, 4*tdb->header.hash_size)) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_lockall failed (%s)\n", strerror(errno)));
|
||||
return -1;
|
||||
}
|
||||
|
||||
tdb->global_lock.count = 1;
|
||||
tdb->global_lock.ltype = ltype;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* unlock entire db */
|
||||
static int _tdb_unlockall(struct tdb_context *tdb, int ltype)
|
||||
{
|
||||
/* There are no locks on read-only dbs */
|
||||
if (tdb->read_only || tdb->traverse_read) {
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
}
|
||||
|
||||
if (tdb->global_lock.ltype != ltype || tdb->global_lock.count == 0) {
|
||||
return TDB_ERRCODE(TDB_ERR_LOCK, -1);
|
||||
}
|
||||
|
||||
if (tdb->global_lock.count > 1) {
|
||||
tdb->global_lock.count--;
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (tdb->methods->tdb_brlock(tdb, FREELIST_TOP, F_UNLCK, F_SETLKW,
|
||||
0, 4*tdb->header.hash_size)) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlockall failed (%s)\n", strerror(errno)));
|
||||
return -1;
|
||||
}
|
||||
|
||||
tdb->global_lock.count = 0;
|
||||
tdb->global_lock.ltype = 0;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* lock entire database with write lock */
|
||||
int tdb_lockall(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_lockall(tdb, F_WRLCK);
|
||||
}
|
||||
|
||||
/* unlock entire database with write lock */
|
||||
int tdb_unlockall(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_unlockall(tdb, F_WRLCK);
|
||||
}
|
||||
|
||||
/* lock entire database with read lock */
|
||||
int tdb_lockall_read(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_lockall(tdb, F_RDLCK);
|
||||
}
|
||||
|
||||
/* unlock entire database with read lock */
|
||||
int tdb_unlockall_read(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_unlockall(tdb, F_RDLCK);
|
||||
}
|
||||
|
||||
/* lock/unlock one hash chain. This is meant to be used to reduce
|
||||
contention - it cannot guarantee how many records will be locked */
|
||||
int tdb_chainlock(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
return tdb_lock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK);
|
||||
}
|
||||
|
||||
int tdb_chainunlock(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
return tdb_unlock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK);
|
||||
}
|
||||
|
||||
int tdb_chainlock_read(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
return tdb_lock(tdb, BUCKET(tdb->hash_fn(&key)), F_RDLCK);
|
||||
}
|
||||
|
||||
int tdb_chainunlock_read(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
return tdb_unlock(tdb, BUCKET(tdb->hash_fn(&key)), F_RDLCK);
|
||||
}
|
||||
|
||||
|
||||
|
||||
/* record lock stops delete underneath */
|
||||
int tdb_lock_record(struct tdb_context *tdb, tdb_off_t off)
|
||||
{
|
||||
return off ? tdb->methods->tdb_brlock(tdb, off, F_RDLCK, F_SETLKW, 0, 1) : 0;
|
||||
}
|
||||
|
||||
/*
|
||||
Write locks override our own fcntl readlocks, so check it here.
|
||||
Note this is meant to be F_SETLK, *not* F_SETLKW, as it's not
|
||||
an error to fail to get the lock here.
|
||||
*/
|
||||
int tdb_write_lock_record(struct tdb_context *tdb, tdb_off_t off)
|
||||
{
|
||||
struct tdb_traverse_lock *i;
|
||||
for (i = &tdb->travlocks; i; i = i->next)
|
||||
if (i->off == off)
|
||||
return -1;
|
||||
return tdb->methods->tdb_brlock(tdb, off, F_WRLCK, F_SETLK, 1, 1);
|
||||
}
|
||||
|
||||
/*
|
||||
Note this is meant to be F_SETLK, *not* F_SETLKW, as it's not
|
||||
an error to fail to get the lock here.
|
||||
*/
|
||||
int tdb_write_unlock_record(struct tdb_context *tdb, tdb_off_t off)
|
||||
{
|
||||
return tdb->methods->tdb_brlock(tdb, off, F_UNLCK, F_SETLK, 0, 1);
|
||||
}
|
||||
|
||||
/* fcntl locks don't stack: avoid unlocking someone else's */
|
||||
int tdb_unlock_record(struct tdb_context *tdb, tdb_off_t off)
|
||||
{
|
||||
struct tdb_traverse_lock *i;
|
||||
u32 count = 0;
|
||||
|
||||
if (off == 0)
|
||||
return 0;
|
||||
for (i = &tdb->travlocks; i; i = i->next)
|
||||
if (i->off == off)
|
||||
count++;
|
||||
return (count == 1 ? tdb->methods->tdb_brlock(tdb, off, F_UNLCK, F_SETLKW, 0, 1) : 0);
|
||||
}
|
||||
@@ -0,0 +1,465 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
/* all contexts, to ensure no double-opens (fcntl locks don't nest!) */
|
||||
static struct tdb_context *tdbs = NULL;
|
||||
|
||||
|
||||
/* This is based on the hash algorithm from gdbm */
|
||||
static unsigned int default_tdb_hash(TDB_DATA *key)
|
||||
{
|
||||
u32 value; /* Used to compute the hash value. */
|
||||
u32 i; /* Used to cycle through random values. */
|
||||
|
||||
/* Set the initial value from the key size. */
|
||||
for (value = 0x238F13AF * key->dsize, i=0; i < key->dsize; i++)
|
||||
value = (value + (key->dptr[i] << (i*5 % 24)));
|
||||
|
||||
return (1103515243 * value + 12345);
|
||||
}
|
||||
|
||||
|
||||
/* initialise a new database with a specified hash size */
|
||||
static int tdb_new_database(struct tdb_context *tdb, int hash_size)
|
||||
{
|
||||
struct tdb_header *newdb;
|
||||
int size, ret = -1;
|
||||
|
||||
/* We make it up in memory, then write it out if not internal */
|
||||
size = sizeof(struct tdb_header) + (hash_size+1)*sizeof(tdb_off_t);
|
||||
if (!(newdb = (struct tdb_header *)calloc(size, 1)))
|
||||
return TDB_ERRCODE(TDB_ERR_OOM, -1);
|
||||
|
||||
/* Fill in the header */
|
||||
newdb->version = TDB_VERSION;
|
||||
newdb->hash_size = hash_size;
|
||||
if (tdb->flags & TDB_INTERNAL) {
|
||||
tdb->map_size = size;
|
||||
tdb->map_ptr = (char *)newdb;
|
||||
memcpy(&tdb->header, newdb, sizeof(tdb->header));
|
||||
/* Convert the `ondisk' version if asked. */
|
||||
CONVERT(*newdb);
|
||||
return 0;
|
||||
}
|
||||
if (lseek(tdb->fd, 0, SEEK_SET) == -1)
|
||||
goto fail;
|
||||
|
||||
if (ftruncate(tdb->fd, 0) == -1)
|
||||
goto fail;
|
||||
|
||||
/* This creates an endian-converted header, as if read from disk */
|
||||
CONVERT(*newdb);
|
||||
memcpy(&tdb->header, newdb, sizeof(tdb->header));
|
||||
/* Don't endian-convert the magic food! */
|
||||
memcpy(newdb->magic_food, TDB_MAGIC_FOOD, strlen(TDB_MAGIC_FOOD)+1);
|
||||
if (write(tdb->fd, newdb, size) != size) {
|
||||
ret = -1;
|
||||
} else {
|
||||
ret = 0;
|
||||
}
|
||||
|
||||
fail:
|
||||
SAFE_FREE(newdb);
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
|
||||
static int tdb_already_open(dev_t device,
|
||||
ino_t ino)
|
||||
{
|
||||
struct tdb_context *i;
|
||||
|
||||
for (i = tdbs; i; i = i->next) {
|
||||
if (i->device == device && i->inode == ino) {
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* open the database, creating it if necessary
|
||||
|
||||
The open_flags and mode are passed straight to the open call on the
|
||||
database file. A flags value of O_WRONLY is invalid. The hash size
|
||||
is advisory, use zero for a default value.
|
||||
|
||||
Return is NULL on error, in which case errno is also set. Don't
|
||||
try to call tdb_error or tdb_errname, just do strerror(errno).
|
||||
|
||||
@param name may be NULL for internal databases. */
|
||||
struct tdb_context *tdb_open(const char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode)
|
||||
{
|
||||
return tdb_open_ex(name, hash_size, tdb_flags, open_flags, mode, NULL, NULL);
|
||||
}
|
||||
|
||||
/* a default logging function */
|
||||
static void null_log_fn(struct tdb_context *tdb, enum tdb_debug_level level, const char *fmt, ...) PRINTF_ATTRIBUTE(3, 4);
|
||||
static void null_log_fn(struct tdb_context *tdb, enum tdb_debug_level level, const char *fmt, ...)
|
||||
{
|
||||
}
|
||||
|
||||
|
||||
struct tdb_context *tdb_open_ex(const char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode,
|
||||
const struct tdb_logging_context *log_ctx,
|
||||
tdb_hash_func hash_fn)
|
||||
{
|
||||
struct tdb_context *tdb;
|
||||
struct stat st;
|
||||
int rev = 0, locked = 0;
|
||||
unsigned char *vp;
|
||||
u32 vertest;
|
||||
|
||||
if (!(tdb = (struct tdb_context *)calloc(1, sizeof *tdb))) {
|
||||
/* Can't log this */
|
||||
errno = ENOMEM;
|
||||
goto fail;
|
||||
}
|
||||
tdb_io_init(tdb);
|
||||
tdb->fd = -1;
|
||||
tdb->name = NULL;
|
||||
tdb->map_ptr = NULL;
|
||||
tdb->flags = tdb_flags;
|
||||
tdb->open_flags = open_flags;
|
||||
if (log_ctx) {
|
||||
tdb->log = *log_ctx;
|
||||
} else {
|
||||
tdb->log.log_fn = null_log_fn;
|
||||
tdb->log.log_private = NULL;
|
||||
}
|
||||
tdb->hash_fn = hash_fn ? hash_fn : default_tdb_hash;
|
||||
|
||||
/* cache the page size */
|
||||
tdb->page_size = getpagesize();
|
||||
if (tdb->page_size <= 0) {
|
||||
tdb->page_size = 0x2000;
|
||||
}
|
||||
|
||||
if ((open_flags & O_ACCMODE) == O_WRONLY) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: can't open tdb %s write-only\n",
|
||||
name));
|
||||
errno = EINVAL;
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (hash_size == 0)
|
||||
hash_size = DEFAULT_HASH_SIZE;
|
||||
if ((open_flags & O_ACCMODE) == O_RDONLY) {
|
||||
tdb->read_only = 1;
|
||||
/* read only databases don't do locking or clear if first */
|
||||
tdb->flags |= TDB_NOLOCK;
|
||||
tdb->flags &= ~TDB_CLEAR_IF_FIRST;
|
||||
}
|
||||
|
||||
/* internal databases don't mmap or lock, and start off cleared */
|
||||
if (tdb->flags & TDB_INTERNAL) {
|
||||
tdb->flags |= (TDB_NOLOCK | TDB_NOMMAP);
|
||||
tdb->flags &= ~TDB_CLEAR_IF_FIRST;
|
||||
if (tdb_new_database(tdb, hash_size) != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: tdb_new_database failed!"));
|
||||
goto fail;
|
||||
}
|
||||
goto internal;
|
||||
}
|
||||
|
||||
if ((tdb->fd = open(name, open_flags, mode)) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_open_ex: could not open file %s: %s\n",
|
||||
name, strerror(errno)));
|
||||
goto fail; /* errno set by open(2) */
|
||||
}
|
||||
|
||||
/* ensure there is only one process initialising at once */
|
||||
if (tdb->methods->tdb_brlock(tdb, GLOBAL_LOCK, F_WRLCK, F_SETLKW, 0, 1) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: failed to get global lock on %s: %s\n",
|
||||
name, strerror(errno)));
|
||||
goto fail; /* errno set by tdb_brlock */
|
||||
}
|
||||
|
||||
/* we need to zero database if we are the only one with it open */
|
||||
if ((tdb_flags & TDB_CLEAR_IF_FIRST) &&
|
||||
(locked = (tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_WRLCK, F_SETLK, 0, 1) == 0))) {
|
||||
open_flags |= O_CREAT;
|
||||
if (ftruncate(tdb->fd, 0) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_open_ex: "
|
||||
"failed to truncate %s: %s\n",
|
||||
name, strerror(errno)));
|
||||
goto fail; /* errno set by ftruncate */
|
||||
}
|
||||
}
|
||||
|
||||
if (read(tdb->fd, &tdb->header, sizeof(tdb->header)) != sizeof(tdb->header)
|
||||
|| strcmp(tdb->header.magic_food, TDB_MAGIC_FOOD) != 0
|
||||
|| (tdb->header.version != TDB_VERSION
|
||||
&& !(rev = (tdb->header.version==TDB_BYTEREV(TDB_VERSION))))) {
|
||||
/* its not a valid database - possibly initialise it */
|
||||
if (!(open_flags & O_CREAT) || tdb_new_database(tdb, hash_size) == -1) {
|
||||
errno = EIO; /* ie bad format or something */
|
||||
goto fail;
|
||||
}
|
||||
rev = (tdb->flags & TDB_CONVERT);
|
||||
}
|
||||
vp = (unsigned char *)&tdb->header.version;
|
||||
vertest = (((u32)vp[0]) << 24) | (((u32)vp[1]) << 16) |
|
||||
(((u32)vp[2]) << 8) | (u32)vp[3];
|
||||
tdb->flags |= (vertest==TDB_VERSION) ? TDB_BIGENDIAN : 0;
|
||||
if (!rev)
|
||||
tdb->flags &= ~TDB_CONVERT;
|
||||
else {
|
||||
tdb->flags |= TDB_CONVERT;
|
||||
tdb_convert(&tdb->header, sizeof(tdb->header));
|
||||
}
|
||||
if (fstat(tdb->fd, &st) == -1)
|
||||
goto fail;
|
||||
|
||||
if (tdb->header.rwlocks != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: spinlocks no longer supported\n"));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* Is it already in the open list? If so, fail. */
|
||||
if (tdb_already_open(st.st_dev, st.st_ino)) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: "
|
||||
"%s (%d,%d) is already open in this process\n",
|
||||
name, (int)st.st_dev, (int)st.st_ino));
|
||||
errno = EBUSY;
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (!(tdb->name = (char *)strdup(name))) {
|
||||
errno = ENOMEM;
|
||||
goto fail;
|
||||
}
|
||||
|
||||
tdb->map_size = st.st_size;
|
||||
tdb->device = st.st_dev;
|
||||
tdb->inode = st.st_ino;
|
||||
tdb->locked = (struct tdb_lock_type *)calloc(tdb->header.hash_size+1,
|
||||
sizeof(tdb->locked[0]));
|
||||
if (!tdb->locked) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: "
|
||||
"failed to allocate lock structure for %s\n",
|
||||
name));
|
||||
errno = ENOMEM;
|
||||
goto fail;
|
||||
}
|
||||
tdb_mmap(tdb);
|
||||
if (locked) {
|
||||
if (tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_UNLCK, F_SETLK, 0, 1) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: "
|
||||
"failed to take ACTIVE_LOCK on %s: %s\n",
|
||||
name, strerror(errno)));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/* We always need to do this if the CLEAR_IF_FIRST flag is set, even if
|
||||
we didn't get the initial exclusive lock as we need to let all other
|
||||
users know we're using it. */
|
||||
|
||||
if (tdb_flags & TDB_CLEAR_IF_FIRST) {
|
||||
/* leave this lock in place to indicate it's in use */
|
||||
if (tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_RDLCK, F_SETLKW, 0, 1) == -1)
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* if needed, run recovery */
|
||||
if (tdb_transaction_recover(tdb) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
|
||||
internal:
|
||||
/* Internal (memory-only) databases skip all the code above to
|
||||
* do with disk files, and resume here by releasing their
|
||||
* global lock and hooking into the active list. */
|
||||
if (tdb->methods->tdb_brlock(tdb, GLOBAL_LOCK, F_UNLCK, F_SETLKW, 0, 1) == -1)
|
||||
goto fail;
|
||||
tdb->next = tdbs;
|
||||
tdbs = tdb;
|
||||
return tdb;
|
||||
|
||||
fail:
|
||||
{ int save_errno = errno;
|
||||
|
||||
if (!tdb)
|
||||
return NULL;
|
||||
|
||||
if (tdb->map_ptr) {
|
||||
if (tdb->flags & TDB_INTERNAL)
|
||||
SAFE_FREE(tdb->map_ptr);
|
||||
else
|
||||
tdb_munmap(tdb);
|
||||
}
|
||||
SAFE_FREE(tdb->name);
|
||||
if (tdb->fd != -1)
|
||||
if (close(tdb->fd) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: failed to close tdb->fd on error!\n"));
|
||||
SAFE_FREE(tdb->locked);
|
||||
SAFE_FREE(tdb);
|
||||
errno = save_errno;
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Close a database.
|
||||
*
|
||||
* @returns -1 for error; 0 for success.
|
||||
**/
|
||||
int tdb_close(struct tdb_context *tdb)
|
||||
{
|
||||
struct tdb_context **i;
|
||||
int ret = 0;
|
||||
|
||||
if (tdb->transaction) {
|
||||
tdb_transaction_cancel(tdb);
|
||||
}
|
||||
|
||||
if (tdb->map_ptr) {
|
||||
if (tdb->flags & TDB_INTERNAL)
|
||||
SAFE_FREE(tdb->map_ptr);
|
||||
else
|
||||
tdb_munmap(tdb);
|
||||
}
|
||||
SAFE_FREE(tdb->name);
|
||||
if (tdb->fd != -1)
|
||||
ret = close(tdb->fd);
|
||||
SAFE_FREE(tdb->locked);
|
||||
|
||||
/* Remove from contexts list */
|
||||
for (i = &tdbs; *i; i = &(*i)->next) {
|
||||
if (*i == tdb) {
|
||||
*i = tdb->next;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
memset(tdb, 0, sizeof(*tdb));
|
||||
SAFE_FREE(tdb);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
/* register a loging function */
|
||||
void tdb_set_logging_function(struct tdb_context *tdb,
|
||||
const struct tdb_logging_context *log)
|
||||
{
|
||||
tdb->log = *log;
|
||||
}
|
||||
|
||||
void *tdb_get_logging_private(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->log.log_private;
|
||||
}
|
||||
|
||||
/* reopen a tdb - this can be used after a fork to ensure that we have an independent
|
||||
seek pointer from our parent and to re-establish locks */
|
||||
int tdb_reopen(struct tdb_context *tdb)
|
||||
{
|
||||
struct stat st;
|
||||
|
||||
if (tdb->flags & TDB_INTERNAL) {
|
||||
return 0; /* Nothing to do. */
|
||||
}
|
||||
|
||||
if (tdb->num_locks != 0 || tdb->global_lock.count) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_reopen: reopen not allowed with locks held\n"));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (tdb->transaction != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_reopen: reopen not allowed inside a transaction\n"));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (tdb_munmap(tdb) != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: munmap failed (%s)\n", strerror(errno)));
|
||||
goto fail;
|
||||
}
|
||||
if (close(tdb->fd) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: WARNING closing tdb->fd failed!\n"));
|
||||
tdb->fd = open(tdb->name, tdb->open_flags & ~(O_CREAT|O_TRUNC), 0);
|
||||
if (tdb->fd == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: open failed (%s)\n", strerror(errno)));
|
||||
goto fail;
|
||||
}
|
||||
if ((tdb->flags & TDB_CLEAR_IF_FIRST) &&
|
||||
(tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_RDLCK, F_SETLKW, 0, 1) == -1)) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: failed to obtain active lock\n"));
|
||||
goto fail;
|
||||
}
|
||||
if (fstat(tdb->fd, &st) != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: fstat failed (%s)\n", strerror(errno)));
|
||||
goto fail;
|
||||
}
|
||||
if (st.st_ino != tdb->inode || st.st_dev != tdb->device) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: file dev/inode has changed!\n"));
|
||||
goto fail;
|
||||
}
|
||||
tdb_mmap(tdb);
|
||||
|
||||
return 0;
|
||||
|
||||
fail:
|
||||
tdb_close(tdb);
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* reopen all tdb's */
|
||||
int tdb_reopen_all(int parent_longlived)
|
||||
{
|
||||
struct tdb_context *tdb;
|
||||
|
||||
for (tdb=tdbs; tdb; tdb = tdb->next) {
|
||||
/*
|
||||
* If the parent is longlived (ie. a
|
||||
* parent daemon architecture), we know
|
||||
* it will keep it's active lock on a
|
||||
* tdb opened with CLEAR_IF_FIRST. Thus
|
||||
* for child processes we don't have to
|
||||
* add an active lock. This is essential
|
||||
* to improve performance on systems that
|
||||
* keep POSIX locks as a non-scalable data
|
||||
* structure in the kernel.
|
||||
*/
|
||||
if (parent_longlived) {
|
||||
/* Ensure no clear-if-first. */
|
||||
tdb->flags &= ~TDB_CLEAR_IF_FIRST;
|
||||
}
|
||||
|
||||
if (tdb_reopen(tdb) != 0)
|
||||
return -1;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,441 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
TDB_DATA tdb_null;
|
||||
|
||||
/*
|
||||
increment the tdb sequence number if the tdb has been opened using
|
||||
the TDB_SEQNUM flag
|
||||
*/
|
||||
static void tdb_increment_seqnum(struct tdb_context *tdb)
|
||||
{
|
||||
tdb_off_t seqnum=0;
|
||||
|
||||
if (!(tdb->flags & TDB_SEQNUM)) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (tdb_brlock(tdb, TDB_SEQNUM_OFS, F_WRLCK, F_SETLKW, 1, 1) != 0) {
|
||||
return;
|
||||
}
|
||||
|
||||
/* we ignore errors from this, as we have no sane way of
|
||||
dealing with them.
|
||||
*/
|
||||
tdb_ofs_read(tdb, TDB_SEQNUM_OFS, &seqnum);
|
||||
seqnum++;
|
||||
tdb_ofs_write(tdb, TDB_SEQNUM_OFS, &seqnum);
|
||||
|
||||
tdb_brlock(tdb, TDB_SEQNUM_OFS, F_UNLCK, F_SETLKW, 1, 1);
|
||||
}
|
||||
|
||||
|
||||
/* Returns 0 on fail. On success, return offset of record, and fills
|
||||
in rec */
|
||||
static tdb_off_t tdb_find(struct tdb_context *tdb, TDB_DATA key, u32 hash,
|
||||
struct list_struct *r)
|
||||
{
|
||||
tdb_off_t rec_ptr;
|
||||
|
||||
/* read in the hash top */
|
||||
if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1)
|
||||
return 0;
|
||||
|
||||
/* keep looking until we find the right record */
|
||||
while (rec_ptr) {
|
||||
if (tdb_rec_read(tdb, rec_ptr, r) == -1)
|
||||
return 0;
|
||||
|
||||
if (!TDB_DEAD(r) && hash==r->full_hash && key.dsize==r->key_len) {
|
||||
unsigned char *k;
|
||||
/* a very likely hit - read the key */
|
||||
k = tdb_alloc_read(tdb, rec_ptr + sizeof(*r),
|
||||
r->key_len);
|
||||
if (!k)
|
||||
return 0;
|
||||
|
||||
if (memcmp(key.dptr, k, key.dsize) == 0) {
|
||||
SAFE_FREE(k);
|
||||
return rec_ptr;
|
||||
}
|
||||
SAFE_FREE(k);
|
||||
}
|
||||
rec_ptr = r->next;
|
||||
}
|
||||
return TDB_ERRCODE(TDB_ERR_NOEXIST, 0);
|
||||
}
|
||||
|
||||
/* As tdb_find, but if you succeed, keep the lock */
|
||||
tdb_off_t tdb_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, int locktype,
|
||||
struct list_struct *rec)
|
||||
{
|
||||
u32 rec_ptr;
|
||||
|
||||
if (tdb_lock(tdb, BUCKET(hash), locktype) == -1)
|
||||
return 0;
|
||||
if (!(rec_ptr = tdb_find(tdb, key, hash, rec)))
|
||||
tdb_unlock(tdb, BUCKET(hash), locktype);
|
||||
return rec_ptr;
|
||||
}
|
||||
|
||||
|
||||
/* update an entry in place - this only works if the new data size
|
||||
is <= the old data size and the key exists.
|
||||
on failure return -1.
|
||||
*/
|
||||
static int tdb_update_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, TDB_DATA dbuf)
|
||||
{
|
||||
struct list_struct rec;
|
||||
tdb_off_t rec_ptr;
|
||||
|
||||
/* find entry */
|
||||
if (!(rec_ptr = tdb_find(tdb, key, hash, &rec)))
|
||||
return -1;
|
||||
|
||||
/* must be long enough key, data and tailer */
|
||||
if (rec.rec_len < key.dsize + dbuf.dsize + sizeof(tdb_off_t)) {
|
||||
tdb->ecode = TDB_SUCCESS; /* Not really an error */
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (tdb->methods->tdb_write(tdb, rec_ptr + sizeof(rec) + rec.key_len,
|
||||
dbuf.dptr, dbuf.dsize) == -1)
|
||||
return -1;
|
||||
|
||||
if (dbuf.dsize != rec.data_len) {
|
||||
/* update size */
|
||||
rec.data_len = dbuf.dsize;
|
||||
return tdb_rec_write(tdb, rec_ptr, &rec);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* find an entry in the database given a key */
|
||||
/* If an entry doesn't exist tdb_err will be set to
|
||||
* TDB_ERR_NOEXIST. If a key has no data attached
|
||||
* then the TDB_DATA will have zero length but
|
||||
* a non-zero pointer
|
||||
*/
|
||||
TDB_DATA tdb_fetch(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
tdb_off_t rec_ptr;
|
||||
struct list_struct rec;
|
||||
TDB_DATA ret;
|
||||
u32 hash;
|
||||
|
||||
/* find which hash bucket it is in */
|
||||
hash = tdb->hash_fn(&key);
|
||||
if (!(rec_ptr = tdb_find_lock_hash(tdb,key,hash,F_RDLCK,&rec)))
|
||||
return tdb_null;
|
||||
|
||||
ret.dptr = tdb_alloc_read(tdb, rec_ptr + sizeof(rec) + rec.key_len,
|
||||
rec.data_len);
|
||||
ret.dsize = rec.data_len;
|
||||
tdb_unlock(tdb, BUCKET(rec.full_hash), F_RDLCK);
|
||||
return ret;
|
||||
}
|
||||
|
||||
/* check if an entry in the database exists
|
||||
|
||||
note that 1 is returned if the key is found and 0 is returned if not found
|
||||
this doesn't match the conventions in the rest of this module, but is
|
||||
compatible with gdbm
|
||||
*/
|
||||
static int tdb_exists_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash)
|
||||
{
|
||||
struct list_struct rec;
|
||||
|
||||
if (tdb_find_lock_hash(tdb, key, hash, F_RDLCK, &rec) == 0)
|
||||
return 0;
|
||||
tdb_unlock(tdb, BUCKET(rec.full_hash), F_RDLCK);
|
||||
return 1;
|
||||
}
|
||||
|
||||
int tdb_exists(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
u32 hash = tdb->hash_fn(&key);
|
||||
return tdb_exists_hash(tdb, key, hash);
|
||||
}
|
||||
|
||||
/* actually delete an entry in the database given the offset */
|
||||
int tdb_do_delete(struct tdb_context *tdb, tdb_off_t rec_ptr, struct list_struct*rec)
|
||||
{
|
||||
tdb_off_t last_ptr, i;
|
||||
struct list_struct lastrec;
|
||||
|
||||
if (tdb->read_only || tdb->traverse_read) return -1;
|
||||
|
||||
if (tdb_write_lock_record(tdb, rec_ptr) == -1) {
|
||||
/* Someone traversing here: mark it as dead */
|
||||
rec->magic = TDB_DEAD_MAGIC;
|
||||
return tdb_rec_write(tdb, rec_ptr, rec);
|
||||
}
|
||||
if (tdb_write_unlock_record(tdb, rec_ptr) != 0)
|
||||
return -1;
|
||||
|
||||
/* find previous record in hash chain */
|
||||
if (tdb_ofs_read(tdb, TDB_HASH_TOP(rec->full_hash), &i) == -1)
|
||||
return -1;
|
||||
for (last_ptr = 0; i != rec_ptr; last_ptr = i, i = lastrec.next)
|
||||
if (tdb_rec_read(tdb, i, &lastrec) == -1)
|
||||
return -1;
|
||||
|
||||
/* unlink it: next ptr is at start of record. */
|
||||
if (last_ptr == 0)
|
||||
last_ptr = TDB_HASH_TOP(rec->full_hash);
|
||||
if (tdb_ofs_write(tdb, last_ptr, &rec->next) == -1)
|
||||
return -1;
|
||||
|
||||
/* recover the space */
|
||||
if (tdb_free(tdb, rec_ptr, rec) == -1)
|
||||
return -1;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* delete an entry in the database given a key */
|
||||
static int tdb_delete_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash)
|
||||
{
|
||||
tdb_off_t rec_ptr;
|
||||
struct list_struct rec;
|
||||
int ret;
|
||||
|
||||
if (!(rec_ptr = tdb_find_lock_hash(tdb, key, hash, F_WRLCK, &rec)))
|
||||
return -1;
|
||||
ret = tdb_do_delete(tdb, rec_ptr, &rec);
|
||||
|
||||
if (ret == 0) {
|
||||
tdb_increment_seqnum(tdb);
|
||||
}
|
||||
|
||||
if (tdb_unlock(tdb, BUCKET(rec.full_hash), F_WRLCK) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_delete: WARNING tdb_unlock failed!\n"));
|
||||
return ret;
|
||||
}
|
||||
|
||||
int tdb_delete(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
u32 hash = tdb->hash_fn(&key);
|
||||
return tdb_delete_hash(tdb, key, hash);
|
||||
}
|
||||
|
||||
/* store an element in the database, replacing any existing element
|
||||
with the same key
|
||||
|
||||
return 0 on success, -1 on failure
|
||||
*/
|
||||
int tdb_store(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, int flag)
|
||||
{
|
||||
struct list_struct rec;
|
||||
u32 hash;
|
||||
tdb_off_t rec_ptr;
|
||||
char *p = NULL;
|
||||
int ret = 0;
|
||||
|
||||
if (tdb->read_only || tdb->traverse_read) {
|
||||
tdb->ecode = TDB_ERR_RDONLY;
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* find which hash bucket it is in */
|
||||
hash = tdb->hash_fn(&key);
|
||||
if (tdb_lock(tdb, BUCKET(hash), F_WRLCK) == -1)
|
||||
return -1;
|
||||
|
||||
/* check for it existing, on insert. */
|
||||
if (flag == TDB_INSERT) {
|
||||
if (tdb_exists_hash(tdb, key, hash)) {
|
||||
tdb->ecode = TDB_ERR_EXISTS;
|
||||
goto fail;
|
||||
}
|
||||
} else {
|
||||
/* first try in-place update, on modify or replace. */
|
||||
if (tdb_update_hash(tdb, key, hash, dbuf) == 0)
|
||||
goto out;
|
||||
if (tdb->ecode == TDB_ERR_NOEXIST &&
|
||||
flag == TDB_MODIFY) {
|
||||
/* if the record doesn't exist and we are in TDB_MODIFY mode then
|
||||
we should fail the store */
|
||||
goto fail;
|
||||
}
|
||||
}
|
||||
/* reset the error code potentially set by the tdb_update() */
|
||||
tdb->ecode = TDB_SUCCESS;
|
||||
|
||||
/* delete any existing record - if it doesn't exist we don't
|
||||
care. Doing this first reduces fragmentation, and avoids
|
||||
coalescing with `allocated' block before it's updated. */
|
||||
if (flag != TDB_INSERT)
|
||||
tdb_delete_hash(tdb, key, hash);
|
||||
|
||||
/* Copy key+value *before* allocating free space in case malloc
|
||||
fails and we are left with a dead spot in the tdb. */
|
||||
|
||||
if (!(p = (char *)malloc(key.dsize + dbuf.dsize))) {
|
||||
tdb->ecode = TDB_ERR_OOM;
|
||||
goto fail;
|
||||
}
|
||||
|
||||
memcpy(p, key.dptr, key.dsize);
|
||||
if (dbuf.dsize)
|
||||
memcpy(p+key.dsize, dbuf.dptr, dbuf.dsize);
|
||||
|
||||
/* we have to allocate some space */
|
||||
if (!(rec_ptr = tdb_allocate(tdb, key.dsize + dbuf.dsize, &rec)))
|
||||
goto fail;
|
||||
|
||||
/* Read hash top into next ptr */
|
||||
if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec.next) == -1)
|
||||
goto fail;
|
||||
|
||||
rec.key_len = key.dsize;
|
||||
rec.data_len = dbuf.dsize;
|
||||
rec.full_hash = hash;
|
||||
rec.magic = TDB_MAGIC;
|
||||
|
||||
/* write out and point the top of the hash chain at it */
|
||||
if (tdb_rec_write(tdb, rec_ptr, &rec) == -1
|
||||
|| tdb->methods->tdb_write(tdb, rec_ptr+sizeof(rec), p, key.dsize+dbuf.dsize)==-1
|
||||
|| tdb_ofs_write(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1) {
|
||||
/* Need to tdb_unallocate() here */
|
||||
goto fail;
|
||||
}
|
||||
|
||||
tdb_increment_seqnum(tdb);
|
||||
|
||||
out:
|
||||
SAFE_FREE(p);
|
||||
tdb_unlock(tdb, BUCKET(hash), F_WRLCK);
|
||||
return ret;
|
||||
fail:
|
||||
ret = -1;
|
||||
goto out;
|
||||
}
|
||||
|
||||
|
||||
/* Append to an entry. Create if not exist. */
|
||||
int tdb_append(struct tdb_context *tdb, TDB_DATA key, TDB_DATA new_dbuf)
|
||||
{
|
||||
u32 hash;
|
||||
TDB_DATA dbuf;
|
||||
int ret = -1;
|
||||
|
||||
/* find which hash bucket it is in */
|
||||
hash = tdb->hash_fn(&key);
|
||||
if (tdb_lock(tdb, BUCKET(hash), F_WRLCK) == -1)
|
||||
return -1;
|
||||
|
||||
dbuf = tdb_fetch(tdb, key);
|
||||
|
||||
if (dbuf.dptr == NULL) {
|
||||
dbuf.dptr = malloc(new_dbuf.dsize);
|
||||
} else {
|
||||
dbuf.dptr = realloc(dbuf.dptr, dbuf.dsize + new_dbuf.dsize);
|
||||
}
|
||||
|
||||
if (dbuf.dptr == NULL) {
|
||||
tdb->ecode = TDB_ERR_OOM;
|
||||
goto failed;
|
||||
}
|
||||
|
||||
memcpy(dbuf.dptr + dbuf.dsize, new_dbuf.dptr, new_dbuf.dsize);
|
||||
dbuf.dsize += new_dbuf.dsize;
|
||||
|
||||
ret = tdb_store(tdb, key, dbuf, 0);
|
||||
|
||||
failed:
|
||||
tdb_unlock(tdb, BUCKET(hash), F_WRLCK);
|
||||
SAFE_FREE(dbuf.dptr);
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
return the name of the current tdb file
|
||||
useful for external logging functions
|
||||
*/
|
||||
const char *tdb_name(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->name;
|
||||
}
|
||||
|
||||
/*
|
||||
return the underlying file descriptor being used by tdb, or -1
|
||||
useful for external routines that want to check the device/inode
|
||||
of the fd
|
||||
*/
|
||||
int tdb_fd(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->fd;
|
||||
}
|
||||
|
||||
/*
|
||||
return the current logging function
|
||||
useful for external tdb routines that wish to log tdb errors
|
||||
*/
|
||||
tdb_log_func tdb_log_fn(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->log.log_fn;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
get the tdb sequence number. Only makes sense if the writers opened
|
||||
with TDB_SEQNUM set. Note that this sequence number will wrap quite
|
||||
quickly, so it should only be used for a 'has something changed'
|
||||
test, not for code that relies on the count of the number of changes
|
||||
made. If you want a counter then use a tdb record.
|
||||
|
||||
The aim of this sequence number is to allow for a very lightweight
|
||||
test of a possible tdb change.
|
||||
*/
|
||||
int tdb_get_seqnum(struct tdb_context *tdb)
|
||||
{
|
||||
tdb_off_t seqnum=0;
|
||||
|
||||
tdb_ofs_read(tdb, TDB_SEQNUM_OFS, &seqnum);
|
||||
return seqnum;
|
||||
}
|
||||
|
||||
int tdb_hash_size(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->header.hash_size;
|
||||
}
|
||||
|
||||
size_t tdb_map_size(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->map_size;
|
||||
}
|
||||
|
||||
int tdb_get_flags(struct tdb_context *tdb)
|
||||
{
|
||||
return tdb->flags;
|
||||
}
|
||||
|
||||
@@ -0,0 +1,202 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library - private includes
|
||||
|
||||
Copyright (C) Andrew Tridgell 2005
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/time.h"
|
||||
#include "system/shmem.h"
|
||||
#include "system/select.h"
|
||||
#include "tdb.h"
|
||||
|
||||
#ifndef u32
|
||||
#define u32 unsigned
|
||||
#endif
|
||||
|
||||
#ifndef HAVE_GETPAGESIZE
|
||||
#define getpagesize() 0x2000
|
||||
#endif
|
||||
|
||||
typedef u32 tdb_len_t;
|
||||
typedef u32 tdb_off_t;
|
||||
|
||||
#ifndef offsetof
|
||||
#define offsetof(t,f) ((unsigned int)&((t *)0)->f)
|
||||
#endif
|
||||
|
||||
#define TDB_MAGIC_FOOD "TDB file\n"
|
||||
#define TDB_VERSION (0x26011967 + 6)
|
||||
#define TDB_MAGIC (0x26011999U)
|
||||
#define TDB_FREE_MAGIC (~TDB_MAGIC)
|
||||
#define TDB_DEAD_MAGIC (0xFEE1DEAD)
|
||||
#define TDB_RECOVERY_MAGIC (0xf53bc0e7U)
|
||||
#define TDB_ALIGNMENT 4
|
||||
#define MIN_REC_SIZE (2*sizeof(struct list_struct) + TDB_ALIGNMENT)
|
||||
#define DEFAULT_HASH_SIZE 131
|
||||
#define FREELIST_TOP (sizeof(struct tdb_header))
|
||||
#define TDB_ALIGN(x,a) (((x) + (a)-1) & ~((a)-1))
|
||||
#define TDB_BYTEREV(x) (((((x)&0xff)<<24)|((x)&0xFF00)<<8)|(((x)>>8)&0xFF00)|((x)>>24))
|
||||
#define TDB_DEAD(r) ((r)->magic == TDB_DEAD_MAGIC)
|
||||
#define TDB_BAD_MAGIC(r) ((r)->magic != TDB_MAGIC && !TDB_DEAD(r))
|
||||
#define TDB_HASH_TOP(hash) (FREELIST_TOP + (BUCKET(hash)+1)*sizeof(tdb_off_t))
|
||||
#define TDB_HASHTABLE_SIZE(tdb) ((tdb->header.hash_size+1)*sizeof(tdb_off_t))
|
||||
#define TDB_DATA_START(hash_size) TDB_HASH_TOP(hash_size-1)
|
||||
#define TDB_RECOVERY_HEAD offsetof(struct tdb_header, recovery_start)
|
||||
#define TDB_SEQNUM_OFS offsetof(struct tdb_header, sequence_number)
|
||||
#define TDB_PAD_BYTE 0x42
|
||||
#define TDB_PAD_U32 0x42424242
|
||||
|
||||
/* NB assumes there is a local variable called "tdb" that is the
|
||||
* current context, also takes doubly-parenthesized print-style
|
||||
* argument. */
|
||||
#define TDB_LOG(x) tdb->log.log_fn x
|
||||
|
||||
/* lock offsets */
|
||||
#define GLOBAL_LOCK 0
|
||||
#define ACTIVE_LOCK 4
|
||||
#define TRANSACTION_LOCK 8
|
||||
|
||||
/* free memory if the pointer is valid and zero the pointer */
|
||||
#ifndef SAFE_FREE
|
||||
#define SAFE_FREE(x) do { if ((x) != NULL) {free(x); (x)=NULL;} } while(0)
|
||||
#endif
|
||||
|
||||
#define BUCKET(hash) ((hash) % tdb->header.hash_size)
|
||||
|
||||
#define DOCONV() (tdb->flags & TDB_CONVERT)
|
||||
#define CONVERT(x) (DOCONV() ? tdb_convert(&x, sizeof(x)) : &x)
|
||||
|
||||
|
||||
/* the body of the database is made of one list_struct for the free space
|
||||
plus a separate data list for each hash value */
|
||||
struct list_struct {
|
||||
tdb_off_t next; /* offset of the next record in the list */
|
||||
tdb_len_t rec_len; /* total byte length of record */
|
||||
tdb_len_t key_len; /* byte length of key */
|
||||
tdb_len_t data_len; /* byte length of data */
|
||||
u32 full_hash; /* the full 32 bit hash of the key */
|
||||
u32 magic; /* try to catch errors */
|
||||
/* the following union is implied:
|
||||
union {
|
||||
char record[rec_len];
|
||||
struct {
|
||||
char key[key_len];
|
||||
char data[data_len];
|
||||
}
|
||||
u32 totalsize; (tailer)
|
||||
}
|
||||
*/
|
||||
};
|
||||
|
||||
|
||||
/* this is stored at the front of every database */
|
||||
struct tdb_header {
|
||||
char magic_food[32]; /* for /etc/magic */
|
||||
u32 version; /* version of the code */
|
||||
u32 hash_size; /* number of hash entries */
|
||||
tdb_off_t rwlocks; /* obsolete - kept to detect old formats */
|
||||
tdb_off_t recovery_start; /* offset of transaction recovery region */
|
||||
tdb_off_t sequence_number; /* used when TDB_SEQNUM is set */
|
||||
tdb_off_t reserved[29];
|
||||
};
|
||||
|
||||
struct tdb_lock_type {
|
||||
u32 count;
|
||||
u32 ltype;
|
||||
};
|
||||
|
||||
struct tdb_traverse_lock {
|
||||
struct tdb_traverse_lock *next;
|
||||
u32 off;
|
||||
u32 hash;
|
||||
int lock_rw;
|
||||
};
|
||||
|
||||
|
||||
struct tdb_methods {
|
||||
int (*tdb_read)(struct tdb_context *, tdb_off_t , void *, tdb_len_t , int );
|
||||
int (*tdb_write)(struct tdb_context *, tdb_off_t, const void *, tdb_len_t);
|
||||
void (*next_hash_chain)(struct tdb_context *, u32 *);
|
||||
int (*tdb_oob)(struct tdb_context *, tdb_off_t , int );
|
||||
int (*tdb_expand_file)(struct tdb_context *, tdb_off_t , tdb_off_t );
|
||||
int (*tdb_brlock)(struct tdb_context *, tdb_off_t , int, int, int, size_t);
|
||||
};
|
||||
|
||||
struct tdb_context {
|
||||
char *name; /* the name of the database */
|
||||
void *map_ptr; /* where it is currently mapped */
|
||||
int fd; /* open file descriptor for the database */
|
||||
tdb_len_t map_size; /* how much space has been mapped */
|
||||
int read_only; /* opened read-only */
|
||||
int traverse_read; /* read-only traversal */
|
||||
struct tdb_lock_type global_lock;
|
||||
struct tdb_lock_type *locked; /* array of chain locks */
|
||||
enum TDB_ERROR ecode; /* error code for last tdb error */
|
||||
struct tdb_header header; /* a cached copy of the header */
|
||||
u32 flags; /* the flags passed to tdb_open */
|
||||
struct tdb_traverse_lock travlocks; /* current traversal locks */
|
||||
struct tdb_context *next; /* all tdbs to avoid multiple opens */
|
||||
dev_t device; /* uniquely identifies this tdb */
|
||||
ino_t inode; /* uniquely identifies this tdb */
|
||||
struct tdb_logging_context log;
|
||||
unsigned int (*hash_fn)(TDB_DATA *key);
|
||||
int open_flags; /* flags used in the open - needed by reopen */
|
||||
unsigned int num_locks; /* number of chain locks held */
|
||||
const struct tdb_methods *methods;
|
||||
struct tdb_transaction *transaction;
|
||||
int page_size;
|
||||
};
|
||||
|
||||
|
||||
/*
|
||||
internal prototypes
|
||||
*/
|
||||
int tdb_munmap(struct tdb_context *tdb);
|
||||
void tdb_mmap(struct tdb_context *tdb);
|
||||
int tdb_lock(struct tdb_context *tdb, int list, int ltype);
|
||||
int tdb_unlock(struct tdb_context *tdb, int list, int ltype);
|
||||
int tdb_brlock(struct tdb_context *tdb, tdb_off_t offset, int rw_type, int lck_type, int probe, size_t len);
|
||||
int tdb_brlock_upgrade(struct tdb_context *tdb, tdb_off_t offset, size_t len);
|
||||
int tdb_write_lock_record(struct tdb_context *tdb, tdb_off_t off);
|
||||
int tdb_write_unlock_record(struct tdb_context *tdb, tdb_off_t off);
|
||||
int tdb_ofs_read(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d);
|
||||
int tdb_ofs_write(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d);
|
||||
void *tdb_convert(void *buf, u32 size);
|
||||
int tdb_free(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec);
|
||||
tdb_off_t tdb_allocate(struct tdb_context *tdb, tdb_len_t length, struct list_struct *rec);
|
||||
int tdb_ofs_read(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d);
|
||||
int tdb_ofs_write(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d);
|
||||
int tdb_lock_record(struct tdb_context *tdb, tdb_off_t off);
|
||||
int tdb_unlock_record(struct tdb_context *tdb, tdb_off_t off);
|
||||
int tdb_rec_read(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec);
|
||||
int tdb_rec_write(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec);
|
||||
int tdb_do_delete(struct tdb_context *tdb, tdb_off_t rec_ptr, struct list_struct *rec);
|
||||
unsigned char *tdb_alloc_read(struct tdb_context *tdb, tdb_off_t offset, tdb_len_t len);
|
||||
tdb_off_t tdb_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, int locktype,
|
||||
struct list_struct *rec);
|
||||
void tdb_io_init(struct tdb_context *tdb);
|
||||
int tdb_expand(struct tdb_context *tdb, tdb_off_t size);
|
||||
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,335 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2005
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000-2003
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
/* Uses traverse lock: 0 = finish, -1 = error, other = record offset */
|
||||
static int tdb_next_lock(struct tdb_context *tdb, struct tdb_traverse_lock *tlock,
|
||||
struct list_struct *rec)
|
||||
{
|
||||
int want_next = (tlock->off != 0);
|
||||
|
||||
/* Lock each chain from the start one. */
|
||||
for (; tlock->hash < tdb->header.hash_size; tlock->hash++) {
|
||||
if (!tlock->off && tlock->hash != 0) {
|
||||
/* this is an optimisation for the common case where
|
||||
the hash chain is empty, which is particularly
|
||||
common for the use of tdb with ldb, where large
|
||||
hashes are used. In that case we spend most of our
|
||||
time in tdb_brlock(), locking empty hash chains.
|
||||
|
||||
To avoid this, we do an unlocked pre-check to see
|
||||
if the hash chain is empty before starting to look
|
||||
inside it. If it is empty then we can avoid that
|
||||
hash chain. If it isn't empty then we can't believe
|
||||
the value we get back, as we read it without a
|
||||
lock, so instead we get the lock and re-fetch the
|
||||
value below.
|
||||
|
||||
Notice that not doing this optimisation on the
|
||||
first hash chain is critical. We must guarantee
|
||||
that we have done at least one fcntl lock at the
|
||||
start of a search to guarantee that memory is
|
||||
coherent on SMP systems. If records are added by
|
||||
others during the search then thats OK, and we
|
||||
could possibly miss those with this trick, but we
|
||||
could miss them anyway without this trick, so the
|
||||
semantics don't change.
|
||||
|
||||
With a non-indexed ldb search this trick gains us a
|
||||
factor of around 80 in speed on a linux 2.6.x
|
||||
system (testing using ldbtest).
|
||||
*/
|
||||
tdb->methods->next_hash_chain(tdb, &tlock->hash);
|
||||
if (tlock->hash == tdb->header.hash_size) {
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (tdb_lock(tdb, tlock->hash, tlock->lock_rw) == -1)
|
||||
return -1;
|
||||
|
||||
/* No previous record? Start at top of chain. */
|
||||
if (!tlock->off) {
|
||||
if (tdb_ofs_read(tdb, TDB_HASH_TOP(tlock->hash),
|
||||
&tlock->off) == -1)
|
||||
goto fail;
|
||||
} else {
|
||||
/* Otherwise unlock the previous record. */
|
||||
if (tdb_unlock_record(tdb, tlock->off) != 0)
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (want_next) {
|
||||
/* We have offset of old record: grab next */
|
||||
if (tdb_rec_read(tdb, tlock->off, rec) == -1)
|
||||
goto fail;
|
||||
tlock->off = rec->next;
|
||||
}
|
||||
|
||||
/* Iterate through chain */
|
||||
while( tlock->off) {
|
||||
tdb_off_t current;
|
||||
if (tdb_rec_read(tdb, tlock->off, rec) == -1)
|
||||
goto fail;
|
||||
|
||||
/* Detect infinite loops. From "Shlomi Yaakobovich" <Shlomi@exanet.com>. */
|
||||
if (tlock->off == rec->next) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_next_lock: loop detected.\n"));
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if (!TDB_DEAD(rec)) {
|
||||
/* Woohoo: we found one! */
|
||||
if (tdb_lock_record(tdb, tlock->off) != 0)
|
||||
goto fail;
|
||||
return tlock->off;
|
||||
}
|
||||
|
||||
/* Try to clean dead ones from old traverses */
|
||||
current = tlock->off;
|
||||
tlock->off = rec->next;
|
||||
if (!(tdb->read_only || tdb->traverse_read) &&
|
||||
tdb_do_delete(tdb, current, rec) != 0)
|
||||
goto fail;
|
||||
}
|
||||
tdb_unlock(tdb, tlock->hash, tlock->lock_rw);
|
||||
want_next = 0;
|
||||
}
|
||||
/* We finished iteration without finding anything */
|
||||
return TDB_ERRCODE(TDB_SUCCESS, 0);
|
||||
|
||||
fail:
|
||||
tlock->off = 0;
|
||||
if (tdb_unlock(tdb, tlock->hash, tlock->lock_rw) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_next_lock: On error unlock failed!\n"));
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* traverse the entire database - calling fn(tdb, key, data) on each element.
|
||||
return -1 on error or the record count traversed
|
||||
if fn is NULL then it is not called
|
||||
a non-zero return value from fn() indicates that the traversal should stop
|
||||
*/
|
||||
static int tdb_traverse_internal(struct tdb_context *tdb,
|
||||
tdb_traverse_func fn, void *private_data,
|
||||
struct tdb_traverse_lock *tl)
|
||||
{
|
||||
TDB_DATA key, dbuf;
|
||||
struct list_struct rec;
|
||||
int ret, count = 0;
|
||||
|
||||
/* This was in the initializaton, above, but the IRIX compiler
|
||||
* did not like it. crh
|
||||
*/
|
||||
tl->next = tdb->travlocks.next;
|
||||
|
||||
/* fcntl locks don't stack: beware traverse inside traverse */
|
||||
tdb->travlocks.next = tl;
|
||||
|
||||
/* tdb_next_lock places locks on the record returned, and its chain */
|
||||
while ((ret = tdb_next_lock(tdb, tl, &rec)) > 0) {
|
||||
count++;
|
||||
/* now read the full record */
|
||||
key.dptr = tdb_alloc_read(tdb, tl->off + sizeof(rec),
|
||||
rec.key_len + rec.data_len);
|
||||
if (!key.dptr) {
|
||||
ret = -1;
|
||||
if (tdb_unlock(tdb, tl->hash, tl->lock_rw) != 0)
|
||||
goto out;
|
||||
if (tdb_unlock_record(tdb, tl->off) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_traverse: key.dptr == NULL and unlock_record failed!\n"));
|
||||
goto out;
|
||||
}
|
||||
key.dsize = rec.key_len;
|
||||
dbuf.dptr = key.dptr + rec.key_len;
|
||||
dbuf.dsize = rec.data_len;
|
||||
|
||||
/* Drop chain lock, call out */
|
||||
if (tdb_unlock(tdb, tl->hash, tl->lock_rw) != 0) {
|
||||
ret = -1;
|
||||
SAFE_FREE(key.dptr);
|
||||
goto out;
|
||||
}
|
||||
if (fn && fn(tdb, key, dbuf, private_data)) {
|
||||
/* They want us to terminate traversal */
|
||||
ret = count;
|
||||
if (tdb_unlock_record(tdb, tl->off) != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_traverse: unlock_record failed!\n"));;
|
||||
ret = -1;
|
||||
}
|
||||
SAFE_FREE(key.dptr);
|
||||
goto out;
|
||||
}
|
||||
SAFE_FREE(key.dptr);
|
||||
}
|
||||
out:
|
||||
tdb->travlocks.next = tl->next;
|
||||
if (ret < 0)
|
||||
return -1;
|
||||
else
|
||||
return count;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
a write style traverse - temporarily marks the db read only
|
||||
*/
|
||||
int tdb_traverse_read(struct tdb_context *tdb,
|
||||
tdb_traverse_func fn, void *private_data)
|
||||
{
|
||||
struct tdb_traverse_lock tl = { NULL, 0, 0, F_RDLCK };
|
||||
int ret;
|
||||
|
||||
/* we need to get a read lock on the transaction lock here to
|
||||
cope with the lock ordering semantics of solaris10 */
|
||||
if (tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, F_RDLCK, F_SETLKW, 0, 1) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_traverse_read: failed to get transaction lock\n"));
|
||||
tdb->ecode = TDB_ERR_LOCK;
|
||||
return -1;
|
||||
}
|
||||
|
||||
tdb->traverse_read++;
|
||||
ret = tdb_traverse_internal(tdb, fn, private_data, &tl);
|
||||
tdb->traverse_read--;
|
||||
|
||||
tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, F_UNLCK, F_SETLKW, 0, 1);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
a write style traverse - needs to get the transaction lock to
|
||||
prevent deadlocks
|
||||
*/
|
||||
int tdb_traverse(struct tdb_context *tdb,
|
||||
tdb_traverse_func fn, void *private_data)
|
||||
{
|
||||
struct tdb_traverse_lock tl = { NULL, 0, 0, F_WRLCK };
|
||||
int ret;
|
||||
|
||||
if (tdb->read_only || tdb->traverse_read) {
|
||||
return tdb_traverse_read(tdb, fn, private_data);
|
||||
}
|
||||
|
||||
if (tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, F_WRLCK, F_SETLKW, 0, 1) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_traverse: failed to get transaction lock\n"));
|
||||
tdb->ecode = TDB_ERR_LOCK;
|
||||
return -1;
|
||||
}
|
||||
|
||||
ret = tdb_traverse_internal(tdb, fn, private_data, &tl);
|
||||
|
||||
tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, F_UNLCK, F_SETLKW, 0, 1);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
/* find the first entry in the database and return its key */
|
||||
TDB_DATA tdb_firstkey(struct tdb_context *tdb)
|
||||
{
|
||||
TDB_DATA key;
|
||||
struct list_struct rec;
|
||||
|
||||
/* release any old lock */
|
||||
if (tdb_unlock_record(tdb, tdb->travlocks.off) != 0)
|
||||
return tdb_null;
|
||||
tdb->travlocks.off = tdb->travlocks.hash = 0;
|
||||
tdb->travlocks.lock_rw = F_RDLCK;
|
||||
|
||||
if (tdb_next_lock(tdb, &tdb->travlocks, &rec) <= 0)
|
||||
return tdb_null;
|
||||
/* now read the key */
|
||||
key.dsize = rec.key_len;
|
||||
key.dptr =tdb_alloc_read(tdb,tdb->travlocks.off+sizeof(rec),key.dsize);
|
||||
if (tdb_unlock(tdb, BUCKET(tdb->travlocks.hash), F_WRLCK) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_firstkey: error occurred while tdb_unlocking!\n"));
|
||||
return key;
|
||||
}
|
||||
|
||||
/* find the next entry in the database, returning its key */
|
||||
TDB_DATA tdb_nextkey(struct tdb_context *tdb, TDB_DATA oldkey)
|
||||
{
|
||||
u32 oldhash;
|
||||
TDB_DATA key = tdb_null;
|
||||
struct list_struct rec;
|
||||
unsigned char *k = NULL;
|
||||
|
||||
/* Is locked key the old key? If so, traverse will be reliable. */
|
||||
if (tdb->travlocks.off) {
|
||||
if (tdb_lock(tdb,tdb->travlocks.hash,F_WRLCK))
|
||||
return tdb_null;
|
||||
if (tdb_rec_read(tdb, tdb->travlocks.off, &rec) == -1
|
||||
|| !(k = tdb_alloc_read(tdb,tdb->travlocks.off+sizeof(rec),
|
||||
rec.key_len))
|
||||
|| memcmp(k, oldkey.dptr, oldkey.dsize) != 0) {
|
||||
/* No, it wasn't: unlock it and start from scratch */
|
||||
if (tdb_unlock_record(tdb, tdb->travlocks.off) != 0) {
|
||||
SAFE_FREE(k);
|
||||
return tdb_null;
|
||||
}
|
||||
if (tdb_unlock(tdb, tdb->travlocks.hash, F_WRLCK) != 0) {
|
||||
SAFE_FREE(k);
|
||||
return tdb_null;
|
||||
}
|
||||
tdb->travlocks.off = 0;
|
||||
}
|
||||
|
||||
SAFE_FREE(k);
|
||||
}
|
||||
|
||||
if (!tdb->travlocks.off) {
|
||||
/* No previous element: do normal find, and lock record */
|
||||
tdb->travlocks.off = tdb_find_lock_hash(tdb, oldkey, tdb->hash_fn(&oldkey), F_WRLCK, &rec);
|
||||
if (!tdb->travlocks.off)
|
||||
return tdb_null;
|
||||
tdb->travlocks.hash = BUCKET(rec.full_hash);
|
||||
if (tdb_lock_record(tdb, tdb->travlocks.off) != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_nextkey: lock_record failed (%s)!\n", strerror(errno)));
|
||||
return tdb_null;
|
||||
}
|
||||
}
|
||||
oldhash = tdb->travlocks.hash;
|
||||
|
||||
/* Grab next record: locks chain and returned record,
|
||||
unlocks old record */
|
||||
if (tdb_next_lock(tdb, &tdb->travlocks, &rec) > 0) {
|
||||
key.dsize = rec.key_len;
|
||||
key.dptr = tdb_alloc_read(tdb, tdb->travlocks.off+sizeof(rec),
|
||||
key.dsize);
|
||||
/* Unlock the chain of this new record */
|
||||
if (tdb_unlock(tdb, tdb->travlocks.hash, F_WRLCK) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_nextkey: WARNING tdb_unlock failed!\n"));
|
||||
}
|
||||
/* Unlock the chain of old record */
|
||||
if (tdb_unlock(tdb, BUCKET(oldhash), F_WRLCK) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_nextkey: WARNING tdb_unlock failed!\n"));
|
||||
return key;
|
||||
}
|
||||
|
||||
+1466
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,70 @@
|
||||
################################################
|
||||
# Start SUBSYSTEM LIBTDB
|
||||
[LIBRARY::LIBTDB]
|
||||
VERSION = 0.0.1
|
||||
SO_VERSION = 0
|
||||
DESCRIPTION = Trivial Database Library
|
||||
OBJ_FILES = \
|
||||
common/tdb.o common/dump.o common/io.o common/lock.o \
|
||||
common/open.o common/traverse.o common/freelist.o \
|
||||
common/error.o common/transaction.o
|
||||
CFLAGS = -Ilib/tdb/include
|
||||
PUBLIC_HEADERS = include/tdb.h
|
||||
#
|
||||
# End SUBSYSTEM ldb
|
||||
################################################
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbtool
|
||||
[BINARY::tdbtool]
|
||||
INSTALLDIR = BINDIR
|
||||
ENABLE = NO
|
||||
OBJ_FILES= \
|
||||
tools/tdbtool.o
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbtool
|
||||
################################################
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbtorture
|
||||
[BINARY::tdbtorture]
|
||||
INSTALLDIR = BINDIR
|
||||
OBJ_FILES= \
|
||||
tools/tdbtorture.o
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbtorture
|
||||
################################################
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbdump
|
||||
[BINARY::tdbdump]
|
||||
INSTALLDIR = BINDIR
|
||||
OBJ_FILES= \
|
||||
tools/tdbdump.o
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbdump
|
||||
################################################
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbbackup
|
||||
[BINARY::tdbbackup]
|
||||
INSTALLDIR = BINDIR
|
||||
ENABLE = NO
|
||||
OBJ_FILES= \
|
||||
tools/tdbbackup.o
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbbackup
|
||||
################################################
|
||||
|
||||
#######################
|
||||
# Start LIBRARY swig_tdb
|
||||
[LIBRARY::swig_tdb]
|
||||
LIBRARY_REALNAME = swig/_tdb.$(SHLIBEXT)
|
||||
OBJ_FILES = swig/tdb_wrap.o
|
||||
PUBLIC_DEPENDENCIES = LIBTDB DYNCONFIG
|
||||
# End LIBRARY swig_tdb
|
||||
#######################
|
||||
+1579
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,10 @@
|
||||
AC_PREREQ(2.50)
|
||||
AC_DEFUN([SMB_MODULE_DEFAULT], [echo -n ""])
|
||||
AC_DEFUN([SMB_LIBRARY_ENABLE], [echo -n ""])
|
||||
AC_DEFUN([SMB_ENABLE], [echo -n ""])
|
||||
AC_INIT(include/tdb.h)
|
||||
AC_CONFIG_SRCDIR([common/tdb.c])
|
||||
AC_CONFIG_HEADER(include/config.h)
|
||||
AC_LIBREPLACE_ALL_CHECKS
|
||||
m4_include(libtdb.m4)
|
||||
AC_OUTPUT(Makefile tdb.pc)
|
||||
@@ -0,0 +1,235 @@
|
||||
tdb - a trivial database system
|
||||
tridge@linuxcare.com December 1999
|
||||
==================================
|
||||
|
||||
This is a simple database API. It was inspired by the realisation that
|
||||
in Samba we have several ad-hoc bits of code that essentially
|
||||
implement small databases for sharing structures between parts of
|
||||
Samba. As I was about to add another I realised that a generic
|
||||
database module was called for to replace all the ad-hoc bits.
|
||||
|
||||
I based the interface on gdbm. I couldn't use gdbm as we need to be
|
||||
able to have multiple writers to the databases at one time.
|
||||
|
||||
Compilation
|
||||
-----------
|
||||
|
||||
add HAVE_MMAP=1 to use mmap instead of read/write
|
||||
add NOLOCK=1 to disable locking code
|
||||
|
||||
Testing
|
||||
-------
|
||||
|
||||
Compile tdbtest.c and link with gdbm for testing. tdbtest will perform
|
||||
identical operations via tdb and gdbm then make sure the result is the
|
||||
same
|
||||
|
||||
Also included is tdbtool, which allows simple database manipulation
|
||||
on the commandline.
|
||||
|
||||
tdbtest and tdbtool are not built as part of Samba, but are included
|
||||
for completeness.
|
||||
|
||||
Interface
|
||||
---------
|
||||
|
||||
The interface is very similar to gdbm except for the following:
|
||||
|
||||
- different open interface. The tdb_open call is more similar to a
|
||||
traditional open()
|
||||
- no tdbm_reorganise() function
|
||||
- no tdbm_sync() function. No operations are cached in the library anyway
|
||||
- added a tdb_traverse() function for traversing the whole database
|
||||
- added transactions support
|
||||
|
||||
A general rule for using tdb is that the caller frees any returned
|
||||
TDB_DATA structures. Just call free(p.dptr) to free a TDB_DATA
|
||||
return value called p. This is the same as gdbm.
|
||||
|
||||
here is a full list of tdb functions with brief descriptions.
|
||||
|
||||
|
||||
----------------------------------------------------------------------
|
||||
TDB_CONTEXT *tdb_open(char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode)
|
||||
|
||||
open the database, creating it if necessary
|
||||
|
||||
The open_flags and mode are passed straight to the open call on the database
|
||||
file. A flags value of O_WRONLY is invalid
|
||||
|
||||
The hash size is advisory, use zero for a default value.
|
||||
|
||||
return is NULL on error
|
||||
|
||||
possible tdb_flags are:
|
||||
TDB_CLEAR_IF_FIRST - clear database if we are the only one with it open
|
||||
TDB_INTERNAL - don't use a file, instaed store the data in
|
||||
memory. The filename is ignored in this case.
|
||||
TDB_NOLOCK - don't do any locking
|
||||
TDB_NOMMAP - don't use mmap
|
||||
TDB_NOSYNC - don't synchronise transactions to disk
|
||||
|
||||
----------------------------------------------------------------------
|
||||
TDB_CONTEXT *tdb_open_ex(char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode,
|
||||
tdb_log_func log_fn,
|
||||
tdb_hash_func hash_fn)
|
||||
|
||||
This is like tdb_open(), but allows you to pass an initial logging and
|
||||
hash function. Be careful when passing a hash function - all users of
|
||||
the database must use the same hash function or you will get data
|
||||
corruption.
|
||||
|
||||
|
||||
----------------------------------------------------------------------
|
||||
char *tdb_error(TDB_CONTEXT *tdb);
|
||||
|
||||
return a error string for the last tdb error
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_close(TDB_CONTEXT *tdb);
|
||||
|
||||
close a database
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_update(TDB_CONTEXT *tdb, TDB_DATA key, TDB_DATA dbuf);
|
||||
|
||||
update an entry in place - this only works if the new data size
|
||||
is <= the old data size and the key exists.
|
||||
on failure return -1
|
||||
|
||||
----------------------------------------------------------------------
|
||||
TDB_DATA tdb_fetch(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
fetch an entry in the database given a key
|
||||
if the return value has a null dptr then a error occurred
|
||||
|
||||
caller must free the resulting data
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_exists(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
check if an entry in the database exists
|
||||
|
||||
note that 1 is returned if the key is found and 0 is returned if not found
|
||||
this doesn't match the conventions in the rest of this module, but is
|
||||
compatible with gdbm
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_traverse(TDB_CONTEXT *tdb, int (*fn)(TDB_CONTEXT *tdb,
|
||||
TDB_DATA key, TDB_DATA dbuf, void *state), void *state);
|
||||
|
||||
traverse the entire database - calling fn(tdb, key, data, state) on each
|
||||
element.
|
||||
|
||||
return -1 on error or the record count traversed
|
||||
|
||||
if fn is NULL then it is not called
|
||||
|
||||
a non-zero return value from fn() indicates that the traversal
|
||||
should stop. Traversal callbacks may not start transactions.
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_traverse_read(TDB_CONTEXT *tdb, int (*fn)(TDB_CONTEXT *tdb,
|
||||
TDB_DATA key, TDB_DATA dbuf, void *state), void *state);
|
||||
|
||||
traverse the entire database - calling fn(tdb, key, data, state) on
|
||||
each element, but marking the database read only during the
|
||||
traversal, so any write operations will fail. This allows tdb to
|
||||
use read locks, which increases the parallelism possible during the
|
||||
traversal.
|
||||
|
||||
return -1 on error or the record count traversed
|
||||
|
||||
if fn is NULL then it is not called
|
||||
|
||||
a non-zero return value from fn() indicates that the traversal
|
||||
should stop. Traversal callbacks may not start transactions.
|
||||
|
||||
----------------------------------------------------------------------
|
||||
TDB_DATA tdb_firstkey(TDB_CONTEXT *tdb);
|
||||
|
||||
find the first entry in the database and return its key
|
||||
|
||||
the caller must free the returned data
|
||||
|
||||
----------------------------------------------------------------------
|
||||
TDB_DATA tdb_nextkey(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
find the next entry in the database, returning its key
|
||||
|
||||
the caller must free the returned data
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_delete(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
delete an entry in the database given a key
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_store(TDB_CONTEXT *tdb, TDB_DATA key, TDB_DATA dbuf, int flag);
|
||||
|
||||
store an element in the database, replacing any existing element
|
||||
with the same key
|
||||
|
||||
If flag==TDB_INSERT then don't overwrite an existing entry
|
||||
If flag==TDB_MODIFY then don't create a new entry
|
||||
|
||||
return 0 on success, -1 on failure
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_writelock(TDB_CONTEXT *tdb);
|
||||
|
||||
lock the database. If we already have it locked then don't do anything
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_writeunlock(TDB_CONTEXT *tdb);
|
||||
unlock the database
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_lockchain(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
lock one hash chain. This is meant to be used to reduce locking
|
||||
contention - it cannot guarantee how many records will be locked
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_unlockchain(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
unlock one hash chain
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_transaction_start(TDB_CONTEXT *tdb)
|
||||
|
||||
start a transaction. All operations after the transaction start can
|
||||
either be committed with tdb_transaction_commit() or cancelled with
|
||||
tdb_transaction_cancel().
|
||||
|
||||
If you call tdb_transaction_start() again on the same tdb context
|
||||
while a transaction is in progress, then the same transaction
|
||||
buffer is re-used. The number of tdb_transaction_{commit,cancel}
|
||||
operations must match the number of successful
|
||||
tdb_transaction_start() calls.
|
||||
|
||||
Note that transactions are by default disk synchronous, and use a
|
||||
recover area in the database to automatically recover the database
|
||||
on the next open if the system crashes during a transaction. You
|
||||
can disable the synchronous transaction recovery setup using the
|
||||
TDB_NOSYNC flag, which will greatly speed up operations at the risk
|
||||
of corrupting your database if the system crashes.
|
||||
|
||||
Operations made within a transaction are not visible to other users
|
||||
of the database until a successful commit.
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_transaction_cancel(TDB_CONTEXT *tdb)
|
||||
|
||||
cancel a current transaction, discarding all write and lock
|
||||
operations that have been made since the transaction started.
|
||||
|
||||
|
||||
----------------------------------------------------------------------
|
||||
int tdb_transaction_commit(TDB_CONTEXT *tdb)
|
||||
|
||||
commit a current transaction, updating the database and releasing
|
||||
the transaction locks.
|
||||
|
||||
@@ -0,0 +1,10 @@
|
||||
# Magic file(1) information about tdb files.
|
||||
#
|
||||
# Install this into /etc/magic or the corresponding location for your
|
||||
# system, or pass as a -m argument to file(1).
|
||||
|
||||
# You may use and redistribute this file without restriction.
|
||||
|
||||
0 string TDB\ file TDB database
|
||||
>32 lelong =0x2601196D version 6, little-endian
|
||||
>>36 lelong x hash size %d bytes
|
||||
@@ -0,0 +1,147 @@
|
||||
#ifndef __TDB_H__
|
||||
#define __TDB_H__
|
||||
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
trivial database library
|
||||
|
||||
Copyright (C) Andrew Tridgell 1999-2004
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
|
||||
/* flags to tdb_store() */
|
||||
#define TDB_REPLACE 1
|
||||
#define TDB_INSERT 2
|
||||
#define TDB_MODIFY 3
|
||||
|
||||
/* flags for tdb_open() */
|
||||
#define TDB_DEFAULT 0 /* just a readability place holder */
|
||||
#define TDB_CLEAR_IF_FIRST 1
|
||||
#define TDB_INTERNAL 2 /* don't store on disk */
|
||||
#define TDB_NOLOCK 4 /* don't do any locking */
|
||||
#define TDB_NOMMAP 8 /* don't use mmap */
|
||||
#define TDB_CONVERT 16 /* convert endian (internal use) */
|
||||
#define TDB_BIGENDIAN 32 /* header is big-endian (internal use) */
|
||||
#define TDB_NOSYNC 64 /* don't use synchronous transactions */
|
||||
#define TDB_SEQNUM 128 /* maintain a sequence number */
|
||||
|
||||
#define TDB_ERRCODE(code, ret) ((tdb->ecode = (code)), ret)
|
||||
|
||||
/* error codes */
|
||||
enum TDB_ERROR {TDB_SUCCESS=0, TDB_ERR_CORRUPT, TDB_ERR_IO, TDB_ERR_LOCK,
|
||||
TDB_ERR_OOM, TDB_ERR_EXISTS, TDB_ERR_NOLOCK, TDB_ERR_LOCK_TIMEOUT,
|
||||
TDB_ERR_NOEXIST, TDB_ERR_EINVAL, TDB_ERR_RDONLY};
|
||||
|
||||
/* debugging uses one of the following levels */
|
||||
enum tdb_debug_level {TDB_DEBUG_FATAL = 0, TDB_DEBUG_ERROR,
|
||||
TDB_DEBUG_WARNING, TDB_DEBUG_TRACE};
|
||||
|
||||
typedef struct TDB_DATA {
|
||||
unsigned char *dptr;
|
||||
size_t dsize;
|
||||
} TDB_DATA;
|
||||
|
||||
#ifndef PRINTF_ATTRIBUTE
|
||||
#if (__GNUC__ >= 3)
|
||||
/** Use gcc attribute to check printf fns. a1 is the 1-based index of
|
||||
* the parameter containing the format, and a2 the index of the first
|
||||
* argument. Note that some gcc 2.x versions don't handle this
|
||||
* properly **/
|
||||
#define PRINTF_ATTRIBUTE(a1, a2) __attribute__ ((format (__printf__, a1, a2)))
|
||||
#else
|
||||
#define PRINTF_ATTRIBUTE(a1, a2)
|
||||
#endif
|
||||
#endif
|
||||
|
||||
/* this is the context structure that is returned from a db open */
|
||||
typedef struct tdb_context TDB_CONTEXT;
|
||||
|
||||
typedef int (*tdb_traverse_func)(struct tdb_context *, TDB_DATA, TDB_DATA, void *);
|
||||
typedef void (*tdb_log_func)(struct tdb_context *, enum tdb_debug_level, const char *, ...) PRINTF_ATTRIBUTE(3, 4);
|
||||
typedef unsigned int (*tdb_hash_func)(TDB_DATA *key);
|
||||
|
||||
struct tdb_logging_context {
|
||||
tdb_log_func log_fn;
|
||||
void *log_private;
|
||||
};
|
||||
|
||||
struct tdb_context *tdb_open(const char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode);
|
||||
struct tdb_context *tdb_open_ex(const char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode,
|
||||
const struct tdb_logging_context *log_ctx,
|
||||
tdb_hash_func hash_fn);
|
||||
|
||||
int tdb_reopen(struct tdb_context *tdb);
|
||||
int tdb_reopen_all(int parent_longlived);
|
||||
void tdb_set_logging_function(struct tdb_context *tdb, const struct tdb_logging_context *log);
|
||||
enum TDB_ERROR tdb_error(struct tdb_context *tdb);
|
||||
const char *tdb_errorstr(struct tdb_context *tdb);
|
||||
TDB_DATA tdb_fetch(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_delete(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_store(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, int flag);
|
||||
int tdb_append(struct tdb_context *tdb, TDB_DATA key, TDB_DATA new_dbuf);
|
||||
int tdb_close(struct tdb_context *tdb);
|
||||
TDB_DATA tdb_firstkey(struct tdb_context *tdb);
|
||||
TDB_DATA tdb_nextkey(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_traverse(struct tdb_context *tdb, tdb_traverse_func fn, void *);
|
||||
int tdb_traverse_read(struct tdb_context *tdb, tdb_traverse_func fn, void *);
|
||||
int tdb_exists(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_lockall(struct tdb_context *tdb);
|
||||
int tdb_unlockall(struct tdb_context *tdb);
|
||||
int tdb_lockall_read(struct tdb_context *tdb);
|
||||
int tdb_unlockall_read(struct tdb_context *tdb);
|
||||
const char *tdb_name(struct tdb_context *tdb);
|
||||
int tdb_fd(struct tdb_context *tdb);
|
||||
tdb_log_func tdb_log_fn(struct tdb_context *tdb);
|
||||
void *tdb_get_logging_private(struct tdb_context *tdb);
|
||||
int tdb_transaction_start(struct tdb_context *tdb);
|
||||
int tdb_transaction_commit(struct tdb_context *tdb);
|
||||
int tdb_transaction_cancel(struct tdb_context *tdb);
|
||||
int tdb_transaction_recover(struct tdb_context *tdb);
|
||||
int tdb_get_seqnum(struct tdb_context *tdb);
|
||||
int tdb_hash_size(struct tdb_context *tdb);
|
||||
size_t tdb_map_size(struct tdb_context *tdb);
|
||||
int tdb_get_flags(struct tdb_context *tdb);
|
||||
|
||||
/* Low level locking functions: use with care */
|
||||
int tdb_chainlock(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_chainunlock(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_chainlock_read(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_chainunlock_read(struct tdb_context *tdb, TDB_DATA key);
|
||||
|
||||
/* Debug functions. Not used in production. */
|
||||
void tdb_dump_all(struct tdb_context *tdb);
|
||||
int tdb_printfreelist(struct tdb_context *tdb);
|
||||
int tdb_validate_freelist(struct tdb_context *tdb, int *pnum_entries);
|
||||
|
||||
extern TDB_DATA tdb_null;
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* tdb.h */
|
||||
Executable
+238
@@ -0,0 +1,238 @@
|
||||
#! /bin/sh
|
||||
#
|
||||
# install - install a program, script, or datafile
|
||||
# This comes from X11R5.
|
||||
#
|
||||
# Calling this script install-sh is preferred over install.sh, to prevent
|
||||
# `make' implicit rules from creating a file called install from it
|
||||
# when there is no Makefile.
|
||||
#
|
||||
# This script is compatible with the BSD install script, but was written
|
||||
# from scratch.
|
||||
#
|
||||
|
||||
|
||||
# set DOITPROG to echo to test this script
|
||||
|
||||
# Don't use :- since 4.3BSD and earlier shells don't like it.
|
||||
doit="${DOITPROG-}"
|
||||
|
||||
|
||||
# put in absolute paths if you don't have them in your path; or use env. vars.
|
||||
|
||||
mvprog="${MVPROG-mv}"
|
||||
cpprog="${CPPROG-cp}"
|
||||
chmodprog="${CHMODPROG-chmod}"
|
||||
chownprog="${CHOWNPROG-chown}"
|
||||
chgrpprog="${CHGRPPROG-chgrp}"
|
||||
stripprog="${STRIPPROG-strip}"
|
||||
rmprog="${RMPROG-rm}"
|
||||
mkdirprog="${MKDIRPROG-mkdir}"
|
||||
|
||||
transformbasename=""
|
||||
transform_arg=""
|
||||
instcmd="$mvprog"
|
||||
chmodcmd="$chmodprog 0755"
|
||||
chowncmd=""
|
||||
chgrpcmd=""
|
||||
stripcmd=""
|
||||
rmcmd="$rmprog -f"
|
||||
mvcmd="$mvprog"
|
||||
src=""
|
||||
dst=""
|
||||
dir_arg=""
|
||||
|
||||
while [ x"$1" != x ]; do
|
||||
case $1 in
|
||||
-c) instcmd="$cpprog"
|
||||
shift
|
||||
continue;;
|
||||
|
||||
-d) dir_arg=true
|
||||
shift
|
||||
continue;;
|
||||
|
||||
-m) chmodcmd="$chmodprog $2"
|
||||
shift
|
||||
shift
|
||||
continue;;
|
||||
|
||||
-o) chowncmd="$chownprog $2"
|
||||
shift
|
||||
shift
|
||||
continue;;
|
||||
|
||||
-g) chgrpcmd="$chgrpprog $2"
|
||||
shift
|
||||
shift
|
||||
continue;;
|
||||
|
||||
-s) stripcmd="$stripprog"
|
||||
shift
|
||||
continue;;
|
||||
|
||||
-t=*) transformarg=`echo $1 | sed 's/-t=//'`
|
||||
shift
|
||||
continue;;
|
||||
|
||||
-b=*) transformbasename=`echo $1 | sed 's/-b=//'`
|
||||
shift
|
||||
continue;;
|
||||
|
||||
*) if [ x"$src" = x ]
|
||||
then
|
||||
src=$1
|
||||
else
|
||||
# this colon is to work around a 386BSD /bin/sh bug
|
||||
:
|
||||
dst=$1
|
||||
fi
|
||||
shift
|
||||
continue;;
|
||||
esac
|
||||
done
|
||||
|
||||
if [ x"$src" = x ]
|
||||
then
|
||||
echo "install: no input file specified"
|
||||
exit 1
|
||||
else
|
||||
true
|
||||
fi
|
||||
|
||||
if [ x"$dir_arg" != x ]; then
|
||||
dst=$src
|
||||
src=""
|
||||
|
||||
if [ -d $dst ]; then
|
||||
instcmd=:
|
||||
else
|
||||
instcmd=mkdir
|
||||
fi
|
||||
else
|
||||
|
||||
# Waiting for this to be detected by the "$instcmd $src $dsttmp" command
|
||||
# might cause directories to be created, which would be especially bad
|
||||
# if $src (and thus $dsttmp) contains '*'.
|
||||
|
||||
if [ -f $src -o -d $src ]
|
||||
then
|
||||
true
|
||||
else
|
||||
echo "install: $src does not exist"
|
||||
exit 1
|
||||
fi
|
||||
|
||||
if [ x"$dst" = x ]
|
||||
then
|
||||
echo "install: no destination specified"
|
||||
exit 1
|
||||
else
|
||||
true
|
||||
fi
|
||||
|
||||
# If destination is a directory, append the input filename; if your system
|
||||
# does not like double slashes in filenames, you may need to add some logic
|
||||
|
||||
if [ -d $dst ]
|
||||
then
|
||||
dst="$dst"/`basename $src`
|
||||
else
|
||||
true
|
||||
fi
|
||||
fi
|
||||
|
||||
## this sed command emulates the dirname command
|
||||
dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'`
|
||||
|
||||
# Make sure that the destination directory exists.
|
||||
# this part is taken from Noah Friedman's mkinstalldirs script
|
||||
|
||||
# Skip lots of stat calls in the usual case.
|
||||
if [ ! -d "$dstdir" ]; then
|
||||
defaultIFS='
|
||||
'
|
||||
IFS="${IFS-${defaultIFS}}"
|
||||
|
||||
oIFS="${IFS}"
|
||||
# Some sh's can't handle IFS=/ for some reason.
|
||||
IFS='%'
|
||||
set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'`
|
||||
IFS="${oIFS}"
|
||||
|
||||
pathcomp=''
|
||||
|
||||
while [ $# -ne 0 ] ; do
|
||||
pathcomp="${pathcomp}${1}"
|
||||
shift
|
||||
|
||||
if [ ! -d "${pathcomp}" ] ;
|
||||
then
|
||||
$mkdirprog "${pathcomp}"
|
||||
else
|
||||
true
|
||||
fi
|
||||
|
||||
pathcomp="${pathcomp}/"
|
||||
done
|
||||
fi
|
||||
|
||||
if [ x"$dir_arg" != x ]
|
||||
then
|
||||
$doit $instcmd $dst &&
|
||||
|
||||
if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi &&
|
||||
if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi &&
|
||||
if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi &&
|
||||
if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi
|
||||
else
|
||||
|
||||
# If we're going to rename the final executable, determine the name now.
|
||||
|
||||
if [ x"$transformarg" = x ]
|
||||
then
|
||||
dstfile=`basename $dst`
|
||||
else
|
||||
dstfile=`basename $dst $transformbasename |
|
||||
sed $transformarg`$transformbasename
|
||||
fi
|
||||
|
||||
# don't allow the sed command to completely eliminate the filename
|
||||
|
||||
if [ x"$dstfile" = x ]
|
||||
then
|
||||
dstfile=`basename $dst`
|
||||
else
|
||||
true
|
||||
fi
|
||||
|
||||
# Make a temp file name in the proper directory.
|
||||
|
||||
dsttmp=$dstdir/#inst.$$#
|
||||
|
||||
# Move or copy the file name to the temp name
|
||||
|
||||
$doit $instcmd $src $dsttmp &&
|
||||
|
||||
trap "rm -f ${dsttmp}" 0 &&
|
||||
|
||||
# and set any options; do chmod last to preserve setuid bits
|
||||
|
||||
# If any of these fail, we abort the whole thing. If we want to
|
||||
# ignore errors from any of these, just make sure not to ignore
|
||||
# errors from the above "$doit $instcmd $src $dsttmp" command.
|
||||
|
||||
if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi &&
|
||||
if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi &&
|
||||
if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi &&
|
||||
if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi &&
|
||||
|
||||
# Now rename the file to the real destination.
|
||||
|
||||
$doit $rmcmd -f $dstdir/$dstfile &&
|
||||
$doit $mvcmd $dsttmp $dstdir/$dstfile
|
||||
|
||||
fi &&
|
||||
|
||||
|
||||
exit 0
|
||||
@@ -0,0 +1,56 @@
|
||||
dnl find the tdb sources. This is meant to work both for
|
||||
dnl tdb standalone builds, and builds of packages using tdb
|
||||
tdbdir=""
|
||||
tdbpaths="$srcdir $srcdir/lib/tdb $srcdir/tdb $srcdir/../tdb"
|
||||
for d in $tdbpaths; do
|
||||
if test -f "$d/common/tdb.c"; then
|
||||
tdbdir="$d"
|
||||
AC_SUBST(tdbdir)
|
||||
break;
|
||||
fi
|
||||
done
|
||||
if test x"$tdbdir" = "x"; then
|
||||
AC_MSG_ERROR([cannot find tdb source in $tdbpaths])
|
||||
fi
|
||||
TDBOBJ="common/tdb.o common/dump.o common/transaction.o common/error.o common/traverse.o"
|
||||
TDBOBJ="$TDBOBJ common/freelist.o common/freelistcheck.o common/io.o common/lock.o common/open.o"
|
||||
AC_SUBST(TDBOBJ)
|
||||
AC_SUBST(LIBREPLACEOBJ)
|
||||
|
||||
AC_CHECK_FUNCS(mmap pread pwrite getpagesize utime)
|
||||
AC_CHECK_HEADERS(getopt.h sys/select.h sys/time.h)
|
||||
|
||||
AC_HAVE_DECL(pread, [#include <unistd.h>])
|
||||
AC_HAVE_DECL(pwrite, [#include <unistd.h>])
|
||||
|
||||
AC_MSG_CHECKING([for Python])
|
||||
|
||||
PYTHON=
|
||||
|
||||
AC_ARG_WITH(python,
|
||||
[ --with-python=PYTHONNAME build Python libraries],
|
||||
[ case "${withval-python}" in
|
||||
yes)
|
||||
PYTHON=python
|
||||
;;
|
||||
no)
|
||||
PYTHON=
|
||||
;;
|
||||
*)
|
||||
PYTHON=${withval-python}
|
||||
;;
|
||||
esac ])
|
||||
|
||||
if test x"$PYTHON" != "x"; then
|
||||
incdir=`python -c 'import sys; print "%s/include/python%d.%d" % (sys.prefix, sys.version_info[[0]], sys.version_info[[1]])'`
|
||||
CPPFLAGS="$CPPFLAGS -I $incdir"
|
||||
fi
|
||||
|
||||
if test x"$PYTHON" != "x"; then
|
||||
AC_MSG_RESULT([${withval-python}])
|
||||
else
|
||||
SMB_ENABLE(swig_tdb, NO)
|
||||
AC_MSG_RESULT(no)
|
||||
fi
|
||||
|
||||
AC_SUBST(PYTHON)
|
||||
@@ -0,0 +1,116 @@
|
||||
"""Provide a more Pythonic and object-oriented interface to tdb."""
|
||||
|
||||
#
|
||||
# Swig interface to Samba
|
||||
#
|
||||
# Copyright (C) Tim Potter 2006
|
||||
#
|
||||
# This program is free software; you can redistribute it and/or modify
|
||||
# it under the terms of the GNU General Public License as published by
|
||||
# the Free Software Foundation; either version 2 of the License, or
|
||||
# (at your option) any later version.
|
||||
#
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
# GNU General Public License for more details.
|
||||
#
|
||||
# You should have received a copy of the GNU General Public License
|
||||
# along with this program; if not, write to the Free Software
|
||||
# Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||
#
|
||||
|
||||
import os
|
||||
from tdb import *
|
||||
|
||||
# Open flags
|
||||
|
||||
DEFAULT = TDB_DEFAULT
|
||||
CLEAR_IF_FIRST = TDB_CLEAR_IF_FIRST
|
||||
INTERNAL = TDB_INTERNAL
|
||||
NOLOCK = TDB_NOLOCK
|
||||
NOMMAP = TDB_NOMMAP
|
||||
|
||||
# Class representing a TDB file
|
||||
|
||||
class Tdb:
|
||||
|
||||
# Create and destroy Tdb objects
|
||||
|
||||
def __init__(self, name, hash_size = 0, flags = TDB_DEFAULT,
|
||||
open_flags = os.O_RDWR | os.O_CREAT, mode = 0600):
|
||||
self.tdb = tdb_open(name, hash_size, flags, open_flags, mode)
|
||||
if self.tdb is None:
|
||||
raise IOError, tdb_errorstr(self.tdb)
|
||||
|
||||
def __del__(self):
|
||||
self.close()
|
||||
|
||||
def close(self):
|
||||
if hasattr(self, 'tdb') and self.tdb is not None:
|
||||
if tdb_close(self.tdb) == -1:
|
||||
raise IOError, tdb_errorstr(self.tdb)
|
||||
self.tdb = None
|
||||
|
||||
# Random access to keys, values
|
||||
|
||||
def __getitem__(self, key):
|
||||
result = tdb_fetch(self.tdb, key)
|
||||
if result is None:
|
||||
raise KeyError, '%s: %s' % (key, tdb_errorstr(self.tdb))
|
||||
return result
|
||||
|
||||
def __setitem__(self, key, item):
|
||||
if tdb_store(self.tdb, key, item) == -1:
|
||||
raise IOError, tdb_errorstr(self.tdb)
|
||||
|
||||
def __delitem__(self, key):
|
||||
if not tdb_exists(self.tdb, key):
|
||||
raise KeyError, '%s: %s' % (key, tdb_errorstr(self.tdb))
|
||||
tdb_delete(self.tdb, key)
|
||||
|
||||
def has_key(self, key):
|
||||
return tdb_exists(self.tdb, key)
|
||||
|
||||
# Tdb iterator
|
||||
|
||||
class TdbIterator:
|
||||
def __init__(self, tdb):
|
||||
self.tdb = tdb
|
||||
self.key = None
|
||||
|
||||
def __iter__(self):
|
||||
return self
|
||||
|
||||
def next(self):
|
||||
if self.key is None:
|
||||
self.key = tdb_firstkey(self.tdb)
|
||||
if self.key is None:
|
||||
raise StopIteration
|
||||
return self.key
|
||||
else:
|
||||
self.key = tdb_nextkey(self.tdb, self.key)
|
||||
if self.key is None:
|
||||
raise StopIteration
|
||||
return self.key
|
||||
|
||||
def __iter__(self):
|
||||
return Tdb.TdbIterator(self.tdb)
|
||||
|
||||
# Implement other dict functions using TdbIterator
|
||||
|
||||
def keys(self):
|
||||
return [k for k in iter(self)]
|
||||
|
||||
def values(self):
|
||||
return [self[k] for k in iter(self)]
|
||||
|
||||
def items(self):
|
||||
return [(k, self[k]) for k in iter(self)]
|
||||
|
||||
def __len__(self):
|
||||
return len(self.keys())
|
||||
|
||||
def clear(self):
|
||||
for k in iter(self):
|
||||
del(self[k])
|
||||
@@ -0,0 +1,168 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
Swig interface to tdb.
|
||||
|
||||
Copyright (C) 2004,2005 Tim Potter <tpot@samba.org>
|
||||
|
||||
** NOTE! The following LGPL license applies to the tdb
|
||||
** library. This does NOT imply that all of Samba is released
|
||||
** under the LGPL
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
%module tdb
|
||||
|
||||
%{
|
||||
|
||||
/* This symbol is used in both includes.h and Python.h which causes an
|
||||
annoying compiler warning. */
|
||||
|
||||
#ifdef HAVE_FSTAT
|
||||
#undef HAVE_FSTAT
|
||||
#endif
|
||||
|
||||
#if (__GNUC__ >= 3)
|
||||
/** Use gcc attribute to check printf fns. a1 is the 1-based index of
|
||||
* the parameter containing the format, and a2 the index of the first
|
||||
* argument. Note that some gcc 2.x versions don't handle this
|
||||
* properly **/
|
||||
#define PRINTF_ATTRIBUTE(a1, a2) __attribute__ ((format (__printf__, a1, a2)))
|
||||
#else
|
||||
#define PRINTF_ATTRIBUTE(a1, a2)
|
||||
#endif
|
||||
|
||||
/* Include tdb headers */
|
||||
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
|
||||
%}
|
||||
|
||||
/* The tdb functions will crash if a NULL tdb context is passed */
|
||||
|
||||
%include exception.i
|
||||
|
||||
%typemap(check) TDB_CONTEXT* {
|
||||
if ($1 == NULL)
|
||||
SWIG_exception(SWIG_ValueError,
|
||||
"tdb context must be non-NULL");
|
||||
}
|
||||
|
||||
/* In and out typemaps for the TDB_DATA structure. This is converted to
|
||||
and from the Python string type which can contain arbitrary binary
|
||||
data.. */
|
||||
|
||||
%typemap(in) TDB_DATA {
|
||||
if (!PyString_Check($input)) {
|
||||
PyErr_SetString(PyExc_TypeError, "string arg expected");
|
||||
return NULL;
|
||||
}
|
||||
$1.dsize = PyString_Size($input);
|
||||
$1.dptr = PyString_AsString($input);
|
||||
}
|
||||
|
||||
%typemap(out) TDB_DATA {
|
||||
if ($1.dptr == NULL && $1.dsize == 0) {
|
||||
$result = Py_None;
|
||||
} else {
|
||||
$result = PyString_FromStringAndSize($1.dptr, $1.dsize);
|
||||
free($1.dptr);
|
||||
}
|
||||
}
|
||||
|
||||
/* Treat a mode_t as an unsigned integer */
|
||||
|
||||
typedef int mode_t;
|
||||
|
||||
/* flags to tdb_store() */
|
||||
|
||||
#define TDB_REPLACE 1
|
||||
#define TDB_INSERT 2
|
||||
#define TDB_MODIFY 3
|
||||
|
||||
/* flags for tdb_open() */
|
||||
|
||||
#define TDB_DEFAULT 0 /* just a readability place holder */
|
||||
#define TDB_CLEAR_IF_FIRST 1
|
||||
#define TDB_INTERNAL 2 /* don't store on disk */
|
||||
#define TDB_NOLOCK 4 /* don't do any locking */
|
||||
#define TDB_NOMMAP 8 /* don't use mmap */
|
||||
#define TDB_CONVERT 16 /* convert endian (internal use) */
|
||||
#define TDB_BIGENDIAN 32 /* header is big-endian (internal use) */
|
||||
|
||||
/* Throw an IOError exception if tdb_open() or tdb_open_ex() returns NULL */
|
||||
|
||||
%exception {
|
||||
$action
|
||||
if (result == NULL) {
|
||||
PyErr_SetFromErrno(PyExc_IOError);
|
||||
SWIG_fail;
|
||||
}
|
||||
}
|
||||
|
||||
TDB_CONTEXT *tdb_open(const char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode);
|
||||
|
||||
TDB_CONTEXT *tdb_open_ex(const char *name, int hash_size, int tdb_flags,
|
||||
int open_flags, mode_t mode,
|
||||
tdb_log_func log_fn,
|
||||
tdb_hash_func hash_fn);
|
||||
|
||||
%exception;
|
||||
|
||||
int tdb_reopen(TDB_CONTEXT *tdb);
|
||||
|
||||
int tdb_reopen_all(int parent_longlived);
|
||||
|
||||
void tdb_logging_function(TDB_CONTEXT *tdb, tdb_log_func);
|
||||
|
||||
enum TDB_ERROR tdb_error(TDB_CONTEXT *tdb);
|
||||
|
||||
const char *tdb_errorstr(TDB_CONTEXT *tdb);
|
||||
|
||||
TDB_DATA tdb_fetch(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
int tdb_delete(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
int tdb_store(TDB_CONTEXT *tdb, TDB_DATA key, TDB_DATA dbuf, int flag = TDB_REPLACE);
|
||||
|
||||
int tdb_append(TDB_CONTEXT *tdb, TDB_DATA key, TDB_DATA new_dbuf);
|
||||
|
||||
int tdb_close(TDB_CONTEXT *tdb);
|
||||
|
||||
TDB_DATA tdb_firstkey(TDB_CONTEXT *tdb);
|
||||
|
||||
TDB_DATA tdb_nextkey(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
int tdb_traverse(TDB_CONTEXT *tdb, tdb_traverse_func fn, void *state);
|
||||
|
||||
int tdb_exists(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
int tdb_lockall(TDB_CONTEXT *tdb);
|
||||
|
||||
void tdb_unlockall(TDB_CONTEXT *tdb);
|
||||
|
||||
/* Low level locking functions: use with care */
|
||||
|
||||
int tdb_chainlock(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
int tdb_chainunlock(TDB_CONTEXT *tdb, TDB_DATA key);
|
||||
|
||||
/* Debug functions. Not used in production. */
|
||||
|
||||
void tdb_dump_all(TDB_CONTEXT *tdb);
|
||||
|
||||
int tdb_printfreelist(TDB_CONTEXT *tdb);
|
||||
@@ -0,0 +1,10 @@
|
||||
prefix=@prefix@
|
||||
exec_prefix=@exec_prefix@
|
||||
libdir=@libdir@
|
||||
includedir=@includedir@
|
||||
|
||||
Name: tdb
|
||||
Description: A trivial database
|
||||
Version: 4.0
|
||||
Libs: -L${libdir} -ltdb
|
||||
Cflags: -I${includedir}
|
||||
@@ -0,0 +1,125 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
low level tdb backup and restore utility
|
||||
Copyright (C) Andrew Tridgell 2002
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program; if not, write to the Free Software
|
||||
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||
*/
|
||||
|
||||
/*
|
||||
|
||||
This program is meant for backup/restore of tdb databases. Typical usage would be:
|
||||
tdbbackup *.tdb
|
||||
when Samba shuts down cleanly, which will make a backup of all the local databases
|
||||
to *.bak files. Then on Samba startup you would use:
|
||||
tdbbackup -v *.tdb
|
||||
and this will check the databases for corruption and if corruption is detected then
|
||||
the backup will be restored.
|
||||
|
||||
You may also like to do a backup on a regular basis while Samba is
|
||||
running, perhaps using cron.
|
||||
|
||||
The reason this program is needed is to cope with power failures
|
||||
while Samba is running. A power failure could lead to database
|
||||
corruption and Samba will then not start correctly.
|
||||
|
||||
Note that many of the databases in Samba are transient and thus
|
||||
don't need to be backed up, so you can optimise the above a little
|
||||
by only running the backup on the critical databases.
|
||||
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "tdb.h"
|
||||
#include "system/filesys.h"
|
||||
|
||||
/*
|
||||
see if one file is newer than another
|
||||
*/
|
||||
static int file_newer(const char *fname1, const char *fname2)
|
||||
{
|
||||
struct stat st1, st2;
|
||||
if (stat(fname1, &st1) != 0) {
|
||||
return 0;
|
||||
}
|
||||
if (stat(fname2, &st2) != 0) {
|
||||
return 1;
|
||||
}
|
||||
return (st1.st_mtime > st2.st_mtime);
|
||||
}
|
||||
|
||||
static void usage(void)
|
||||
{
|
||||
printf("Usage: tdbbackup [options] <fname...>\n\n");
|
||||
printf(" -h this help message\n");
|
||||
printf(" -s suffix set the backup suffix\n");
|
||||
printf(" -v verify mode (restore if corrupt)\n");
|
||||
}
|
||||
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
int i;
|
||||
int ret = 0;
|
||||
int c;
|
||||
int verify = 0;
|
||||
const char *suffix = ".bak";
|
||||
extern int optind;
|
||||
extern char *optarg;
|
||||
|
||||
while ((c = getopt(argc, argv, "vhs:")) != -1) {
|
||||
switch (c) {
|
||||
case 'h':
|
||||
usage();
|
||||
exit(0);
|
||||
case 'v':
|
||||
verify = 1;
|
||||
break;
|
||||
case 's':
|
||||
suffix = optarg;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
argc -= optind;
|
||||
argv += optind;
|
||||
|
||||
if (argc < 1) {
|
||||
usage();
|
||||
exit(1);
|
||||
}
|
||||
|
||||
for (i=0; i<argc; i++) {
|
||||
const char *fname = argv[i];
|
||||
char *bak_name;
|
||||
|
||||
bak_name = add_suffix(fname, suffix);
|
||||
|
||||
if (verify) {
|
||||
if (verify_tdb(fname, bak_name) != 0) {
|
||||
ret = 1;
|
||||
}
|
||||
} else {
|
||||
if (file_newer(fname, bak_name) &&
|
||||
backup_tdb(fname, bak_name) != 0) {
|
||||
ret = 1;
|
||||
}
|
||||
}
|
||||
|
||||
free(bak_name);
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
@@ -0,0 +1,79 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
simple tdb dump util
|
||||
Copyright (C) Andrew Tridgell 2001
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program; if not, write to the Free Software
|
||||
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "tdb.h"
|
||||
#include "system/locale.h"
|
||||
#include "system/filesys.h"
|
||||
|
||||
static void print_data(TDB_DATA d)
|
||||
{
|
||||
unsigned char *p = (unsigned char *)d.dptr;
|
||||
int len = d.dsize;
|
||||
while (len--) {
|
||||
if (isprint(*p) && !strchr("\"\\", *p)) {
|
||||
fputc(*p, stdout);
|
||||
} else {
|
||||
printf("\\%02X", *p);
|
||||
}
|
||||
p++;
|
||||
}
|
||||
}
|
||||
|
||||
static int traverse_fn(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
printf("{\n");
|
||||
printf("key = \"");
|
||||
print_data(key);
|
||||
printf("\"\n");
|
||||
printf("data = \"");
|
||||
print_data(dbuf);
|
||||
printf("\"\n");
|
||||
printf("}\n");
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int dump_tdb(const char *fname)
|
||||
{
|
||||
struct tdb_context *tdb;
|
||||
|
||||
tdb = tdb_open(fname, 0, 0, O_RDONLY, 0);
|
||||
if (!tdb) {
|
||||
printf("Failed to open %s\n", fname);
|
||||
return 1;
|
||||
}
|
||||
|
||||
tdb_traverse(tdb, traverse_fn, NULL);
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
char *fname;
|
||||
|
||||
if (argc < 2) {
|
||||
printf("Usage: tdbdump <fname>\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
fname = argv[1];
|
||||
|
||||
return dump_tdb(fname);
|
||||
}
|
||||
@@ -0,0 +1,265 @@
|
||||
/* a test program for tdb - the trivial database */
|
||||
|
||||
#include "replace.h"
|
||||
#include "tdb.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/time.h"
|
||||
|
||||
#include <gdbm.h>
|
||||
|
||||
|
||||
#define DELETE_PROB 7
|
||||
#define STORE_PROB 5
|
||||
|
||||
static struct tdb_context *db;
|
||||
static GDBM_FILE gdbm;
|
||||
|
||||
struct timeval tp1,tp2;
|
||||
|
||||
static void _start_timer(void)
|
||||
{
|
||||
gettimeofday(&tp1,NULL);
|
||||
}
|
||||
|
||||
static double _end_timer(void)
|
||||
{
|
||||
gettimeofday(&tp2,NULL);
|
||||
return((tp2.tv_sec - tp1.tv_sec) +
|
||||
(tp2.tv_usec - tp1.tv_usec)*1.0e-6);
|
||||
}
|
||||
|
||||
static void fatal(const char *why)
|
||||
{
|
||||
perror(why);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
#ifdef PRINTF_ATTRIBUTE
|
||||
static void tdb_log(struct tdb_context *tdb, int level, const char *format, ...) PRINTF_ATTRIBUTE(3,4);
|
||||
#endif
|
||||
static void tdb_log(struct tdb_context *tdb, int level, const char *format, ...)
|
||||
{
|
||||
va_list ap;
|
||||
|
||||
va_start(ap, format);
|
||||
vfprintf(stdout, format, ap);
|
||||
va_end(ap);
|
||||
fflush(stdout);
|
||||
}
|
||||
|
||||
static void compare_db(void)
|
||||
{
|
||||
TDB_DATA d, key, nextkey;
|
||||
datum gd, gkey, gnextkey;
|
||||
|
||||
key = tdb_firstkey(db);
|
||||
while (key.dptr) {
|
||||
d = tdb_fetch(db, key);
|
||||
gkey.dptr = key.dptr;
|
||||
gkey.dsize = key.dsize;
|
||||
|
||||
gd = gdbm_fetch(gdbm, gkey);
|
||||
|
||||
if (!gd.dptr) fatal("key not in gdbm");
|
||||
if (gd.dsize != d.dsize) fatal("data sizes differ");
|
||||
if (memcmp(gd.dptr, d.dptr, d.dsize)) {
|
||||
fatal("data differs");
|
||||
}
|
||||
|
||||
nextkey = tdb_nextkey(db, key);
|
||||
free(key.dptr);
|
||||
free(d.dptr);
|
||||
free(gd.dptr);
|
||||
key = nextkey;
|
||||
}
|
||||
|
||||
gkey = gdbm_firstkey(gdbm);
|
||||
while (gkey.dptr) {
|
||||
gd = gdbm_fetch(gdbm, gkey);
|
||||
key.dptr = gkey.dptr;
|
||||
key.dsize = gkey.dsize;
|
||||
|
||||
d = tdb_fetch(db, key);
|
||||
|
||||
if (!d.dptr) fatal("key not in db");
|
||||
if (d.dsize != gd.dsize) fatal("data sizes differ");
|
||||
if (memcmp(d.dptr, gd.dptr, gd.dsize)) {
|
||||
fatal("data differs");
|
||||
}
|
||||
|
||||
gnextkey = gdbm_nextkey(gdbm, gkey);
|
||||
free(gkey.dptr);
|
||||
free(gd.dptr);
|
||||
free(d.dptr);
|
||||
gkey = gnextkey;
|
||||
}
|
||||
}
|
||||
|
||||
static char *randbuf(int len)
|
||||
{
|
||||
char *buf;
|
||||
int i;
|
||||
buf = (char *)malloc(len+1);
|
||||
|
||||
for (i=0;i<len;i++) {
|
||||
buf[i] = 'a' + (rand() % 26);
|
||||
}
|
||||
buf[i] = 0;
|
||||
return buf;
|
||||
}
|
||||
|
||||
static void addrec_db(void)
|
||||
{
|
||||
int klen, dlen;
|
||||
char *k, *d;
|
||||
TDB_DATA key, data;
|
||||
|
||||
klen = 1 + (rand() % 4);
|
||||
dlen = 1 + (rand() % 100);
|
||||
|
||||
k = randbuf(klen);
|
||||
d = randbuf(dlen);
|
||||
|
||||
key.dptr = k;
|
||||
key.dsize = klen+1;
|
||||
|
||||
data.dptr = d;
|
||||
data.dsize = dlen+1;
|
||||
|
||||
if (rand() % DELETE_PROB == 0) {
|
||||
tdb_delete(db, key);
|
||||
} else if (rand() % STORE_PROB == 0) {
|
||||
if (tdb_store(db, key, data, TDB_REPLACE) != 0) {
|
||||
fatal("tdb_store failed");
|
||||
}
|
||||
} else {
|
||||
data = tdb_fetch(db, key);
|
||||
if (data.dptr) free(data.dptr);
|
||||
}
|
||||
|
||||
free(k);
|
||||
free(d);
|
||||
}
|
||||
|
||||
static void addrec_gdbm(void)
|
||||
{
|
||||
int klen, dlen;
|
||||
char *k, *d;
|
||||
datum key, data;
|
||||
|
||||
klen = 1 + (rand() % 4);
|
||||
dlen = 1 + (rand() % 100);
|
||||
|
||||
k = randbuf(klen);
|
||||
d = randbuf(dlen);
|
||||
|
||||
key.dptr = k;
|
||||
key.dsize = klen+1;
|
||||
|
||||
data.dptr = d;
|
||||
data.dsize = dlen+1;
|
||||
|
||||
if (rand() % DELETE_PROB == 0) {
|
||||
gdbm_delete(gdbm, key);
|
||||
} else if (rand() % STORE_PROB == 0) {
|
||||
if (gdbm_store(gdbm, key, data, GDBM_REPLACE) != 0) {
|
||||
fatal("gdbm_store failed");
|
||||
}
|
||||
} else {
|
||||
data = gdbm_fetch(gdbm, key);
|
||||
if (data.dptr) free(data.dptr);
|
||||
}
|
||||
|
||||
free(k);
|
||||
free(d);
|
||||
}
|
||||
|
||||
static int traverse_fn(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
#if 0
|
||||
printf("[%s] [%s]\n", key.dptr, dbuf.dptr);
|
||||
#endif
|
||||
tdb_delete(tdb, key);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void merge_test(void)
|
||||
{
|
||||
int i;
|
||||
char keys[5][2];
|
||||
char tdata[] = "test";
|
||||
TDB_DATA key, data;
|
||||
|
||||
for (i = 0; i < 5; i++) {
|
||||
snprintf(keys[i],2, "%d", i);
|
||||
key.dptr = keys[i];
|
||||
key.dsize = 2;
|
||||
|
||||
data.dptr = tdata;
|
||||
data.dsize = 4;
|
||||
|
||||
if (tdb_store(db, key, data, TDB_REPLACE) != 0) {
|
||||
fatal("tdb_store failed");
|
||||
}
|
||||
}
|
||||
|
||||
key.dptr = keys[0];
|
||||
tdb_delete(db, key);
|
||||
key.dptr = keys[4];
|
||||
tdb_delete(db, key);
|
||||
key.dptr = keys[2];
|
||||
tdb_delete(db, key);
|
||||
key.dptr = keys[1];
|
||||
tdb_delete(db, key);
|
||||
key.dptr = keys[3];
|
||||
tdb_delete(db, key);
|
||||
}
|
||||
|
||||
int main(int argc, const char *argv[])
|
||||
{
|
||||
int i, seed=0;
|
||||
int loops = 10000;
|
||||
int num_entries;
|
||||
char test_gdbm[] = "test.gdbm";
|
||||
|
||||
unlink("test.gdbm");
|
||||
|
||||
db = tdb_open("test.tdb", 0, TDB_CLEAR_IF_FIRST,
|
||||
O_RDWR | O_CREAT | O_TRUNC, 0600);
|
||||
gdbm = gdbm_open(test_gdbm, 512, GDBM_WRITER|GDBM_NEWDB|GDBM_FAST,
|
||||
0600, NULL);
|
||||
|
||||
if (!db || !gdbm) {
|
||||
fatal("db open failed");
|
||||
}
|
||||
|
||||
#if 1
|
||||
srand(seed);
|
||||
_start_timer();
|
||||
for (i=0;i<loops;i++) addrec_gdbm();
|
||||
printf("gdbm got %.2f ops/sec\n", i/_end_timer());
|
||||
#endif
|
||||
|
||||
merge_test();
|
||||
|
||||
srand(seed);
|
||||
_start_timer();
|
||||
for (i=0;i<loops;i++) addrec_db();
|
||||
printf("tdb got %.2f ops/sec\n", i/_end_timer());
|
||||
|
||||
if (tdb_validate_freelist(db, &num_entries) == -1) {
|
||||
printf("tdb freelist is corrupt\n");
|
||||
} else {
|
||||
printf("tdb freelist is good (%d entries)\n", num_entries);
|
||||
}
|
||||
|
||||
compare_db();
|
||||
|
||||
printf("traversed %d records\n", tdb_traverse(db, traverse_fn, NULL));
|
||||
printf("traversed %d records\n", tdb_traverse(db, traverse_fn, NULL));
|
||||
|
||||
tdb_close(db);
|
||||
gdbm_close(gdbm);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,542 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
Samba database functions
|
||||
Copyright (C) Andrew Tridgell 1999-2000
|
||||
Copyright (C) Paul `Rusty' Russell 2000
|
||||
Copyright (C) Jeremy Allison 2000
|
||||
Copyright (C) Andrew Esh 2001
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program; if not, write to the Free Software
|
||||
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||
*/
|
||||
|
||||
#include <errno.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <fcntl.h>
|
||||
#include <unistd.h>
|
||||
#include <string.h>
|
||||
#include <fcntl.h>
|
||||
#include <time.h>
|
||||
#include <sys/mman.h>
|
||||
#include <sys/stat.h>
|
||||
#include <sys/time.h>
|
||||
#include <ctype.h>
|
||||
#include <signal.h>
|
||||
#include <stdarg.h>
|
||||
#include "tdb.h"
|
||||
|
||||
/* a tdb tool for manipulating a tdb database */
|
||||
|
||||
#define FSTRING_LEN 256
|
||||
typedef char fstring[FSTRING_LEN];
|
||||
|
||||
typedef struct connections_key {
|
||||
pid_t pid;
|
||||
int cnum;
|
||||
fstring name;
|
||||
} connections_key;
|
||||
|
||||
typedef struct connections_data {
|
||||
int magic;
|
||||
pid_t pid;
|
||||
int cnum;
|
||||
uid_t uid;
|
||||
gid_t gid;
|
||||
char name[24];
|
||||
char addr[24];
|
||||
char machine[128];
|
||||
time_t start;
|
||||
} connections_data;
|
||||
|
||||
static struct tdb_context *tdb;
|
||||
|
||||
static int print_rec(struct tdb_context *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state);
|
||||
|
||||
static void print_asc(unsigned char *buf,int len)
|
||||
{
|
||||
int i;
|
||||
|
||||
/* We're probably printing ASCII strings so don't try to display
|
||||
the trailing NULL character. */
|
||||
|
||||
if (buf[len - 1] == 0)
|
||||
len--;
|
||||
|
||||
for (i=0;i<len;i++)
|
||||
printf("%c",isprint(buf[i])?buf[i]:'.');
|
||||
}
|
||||
|
||||
#ifdef PRINTF_ATTRIBUTE
|
||||
static void tdb_log(struct tdb_context *t, enum tdb_debug_level level, const char *format, ...) PRINTF_ATTRIBUTE(3,4);
|
||||
#endif
|
||||
static void tdb_log(struct tdb_context *t, enum tdb_debug_level level, const char *format, ...)
|
||||
{
|
||||
va_list ap;
|
||||
|
||||
va_start(ap, format);
|
||||
vfprintf(stdout, format, ap);
|
||||
va_end(ap);
|
||||
fflush(stdout);
|
||||
}
|
||||
|
||||
static void print_data(unsigned char *buf,int len)
|
||||
{
|
||||
int i=0;
|
||||
if (len<=0) return;
|
||||
printf("[%03X] ",i);
|
||||
for (i=0;i<len;) {
|
||||
printf("%02X ",(int)buf[i]);
|
||||
i++;
|
||||
if (i%8 == 0) printf(" ");
|
||||
if (i%16 == 0) {
|
||||
print_asc(&buf[i-16],8); printf(" ");
|
||||
print_asc(&buf[i-8],8); printf("\n");
|
||||
if (i<len) printf("[%03X] ",i);
|
||||
}
|
||||
}
|
||||
if (i%16) {
|
||||
int n;
|
||||
|
||||
n = 16 - (i%16);
|
||||
printf(" ");
|
||||
if (n>8) printf(" ");
|
||||
while (n--) printf(" ");
|
||||
|
||||
n = i%16;
|
||||
if (n > 8) n = 8;
|
||||
print_asc(&buf[i-(i%16)],n); printf(" ");
|
||||
n = (i%16) - n;
|
||||
if (n>0) print_asc(&buf[i-n],n);
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
static void help(void)
|
||||
{
|
||||
printf("\n"
|
||||
"tdbtool: \n"
|
||||
" create dbname : create a database\n"
|
||||
" open dbname : open an existing database\n"
|
||||
" erase : erase the database\n"
|
||||
" dump : dump the database as strings\n"
|
||||
" insert key data : insert a record\n"
|
||||
" move key file : move a record to a destination tdb\n"
|
||||
" store key data : store a record (replace)\n"
|
||||
" show key : show a record by key\n"
|
||||
" delete key : delete a record by key\n"
|
||||
" list : print the database hash table and freelist\n"
|
||||
" free : print the database freelist\n"
|
||||
" 1 | first : print the first record\n"
|
||||
" n | next : print the next record\n"
|
||||
" q | quit : terminate\n"
|
||||
" \\n : repeat 'next' command\n"
|
||||
"\n");
|
||||
}
|
||||
|
||||
static void terror(const char *why)
|
||||
{
|
||||
printf("%s\n", why);
|
||||
}
|
||||
|
||||
static char *get_token(int startover)
|
||||
{
|
||||
static char tmp[1024];
|
||||
static char *cont = NULL;
|
||||
char *insert, *start;
|
||||
char *k = strtok(NULL, " ");
|
||||
|
||||
if (!k)
|
||||
return NULL;
|
||||
|
||||
if (startover)
|
||||
start = tmp;
|
||||
else
|
||||
start = cont;
|
||||
|
||||
strcpy(start, k);
|
||||
insert = start + strlen(start) - 1;
|
||||
while (*insert == '\\') {
|
||||
*insert++ = ' ';
|
||||
k = strtok(NULL, " ");
|
||||
if (!k)
|
||||
break;
|
||||
strcpy(insert, k);
|
||||
insert = start + strlen(start) - 1;
|
||||
}
|
||||
|
||||
/* Get ready for next call */
|
||||
cont = start + strlen(start) + 1;
|
||||
return start;
|
||||
}
|
||||
|
||||
static void create_tdb(void)
|
||||
{
|
||||
char *tok = get_token(1);
|
||||
|
||||
struct tdb_logging_context log_ctx;
|
||||
log_ctx.log_fn = tdb_log;
|
||||
|
||||
if (!tok) {
|
||||
help();
|
||||
return;
|
||||
}
|
||||
if (tdb) tdb_close(tdb);
|
||||
tdb = tdb_open_ex(tok, 0, TDB_CLEAR_IF_FIRST,
|
||||
O_RDWR | O_CREAT | O_TRUNC, 0600, &log_ctx, NULL);
|
||||
if (!tdb) {
|
||||
printf("Could not create %s: %s\n", tok, strerror(errno));
|
||||
}
|
||||
}
|
||||
|
||||
static void open_tdb(void)
|
||||
{
|
||||
struct tdb_logging_context log_ctx;
|
||||
char *tok = get_token(1);
|
||||
|
||||
log_ctx.log_fn = tdb_log;
|
||||
|
||||
if (!tok) {
|
||||
help();
|
||||
return;
|
||||
}
|
||||
if (tdb) tdb_close(tdb);
|
||||
tdb = tdb_open_ex(tok, 0, 0, O_RDWR, 0600, &log_ctx, NULL);
|
||||
if (!tdb) {
|
||||
printf("Could not open %s: %s\n", tok, strerror(errno));
|
||||
}
|
||||
}
|
||||
|
||||
static void insert_tdb(void)
|
||||
{
|
||||
char *k = get_token(1);
|
||||
char *d = get_token(0);
|
||||
TDB_DATA key, dbuf;
|
||||
|
||||
if (!k || !d) {
|
||||
help();
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)k;
|
||||
key.dsize = strlen(k)+1;
|
||||
dbuf.dptr = (unsigned char *)d;
|
||||
dbuf.dsize = strlen(d)+1;
|
||||
|
||||
if (tdb_store(tdb, key, dbuf, TDB_INSERT) == -1) {
|
||||
terror("insert failed");
|
||||
}
|
||||
}
|
||||
|
||||
static void store_tdb(void)
|
||||
{
|
||||
char *k = get_token(1);
|
||||
char *d = get_token(0);
|
||||
TDB_DATA key, dbuf;
|
||||
|
||||
if (!k || !d) {
|
||||
help();
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)k;
|
||||
key.dsize = strlen(k)+1;
|
||||
dbuf.dptr = (unsigned char *)d;
|
||||
dbuf.dsize = strlen(d)+1;
|
||||
|
||||
printf("Storing key:\n");
|
||||
print_rec(tdb, key, dbuf, NULL);
|
||||
|
||||
if (tdb_store(tdb, key, dbuf, TDB_REPLACE) == -1) {
|
||||
terror("store failed");
|
||||
}
|
||||
}
|
||||
|
||||
static void show_tdb(void)
|
||||
{
|
||||
char *k = get_token(1);
|
||||
TDB_DATA key, dbuf;
|
||||
|
||||
if (!k) {
|
||||
help();
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)k;
|
||||
key.dsize = strlen(k)+1;
|
||||
|
||||
dbuf = tdb_fetch(tdb, key);
|
||||
if (!dbuf.dptr) {
|
||||
/* maybe it is non-NULL terminated key? */
|
||||
key.dsize = strlen(k);
|
||||
dbuf = tdb_fetch(tdb, key);
|
||||
|
||||
if ( !dbuf.dptr ) {
|
||||
terror("fetch failed");
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
/* printf("%s : %*.*s\n", k, (int)dbuf.dsize, (int)dbuf.dsize, dbuf.dptr); */
|
||||
print_rec(tdb, key, dbuf, NULL);
|
||||
|
||||
free( dbuf.dptr );
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
static void delete_tdb(void)
|
||||
{
|
||||
char *k = get_token(1);
|
||||
TDB_DATA key;
|
||||
|
||||
if (!k) {
|
||||
help();
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)k;
|
||||
key.dsize = strlen(k)+1;
|
||||
|
||||
if (tdb_delete(tdb, key) != 0) {
|
||||
terror("delete failed");
|
||||
}
|
||||
}
|
||||
|
||||
static void move_rec(void)
|
||||
{
|
||||
char *k = get_token(1);
|
||||
char *file = get_token(0);
|
||||
TDB_DATA key, dbuf;
|
||||
struct tdb_context *dst_tdb;
|
||||
|
||||
struct tdb_logging_context log_ctx;
|
||||
log_ctx.log_fn = tdb_log;
|
||||
|
||||
if (!k) {
|
||||
help();
|
||||
return;
|
||||
}
|
||||
|
||||
if ( !file ) {
|
||||
terror("need destination tdb name");
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)k;
|
||||
key.dsize = strlen(k)+1;
|
||||
|
||||
dbuf = tdb_fetch(tdb, key);
|
||||
if (!dbuf.dptr) {
|
||||
/* maybe it is non-NULL terminated key? */
|
||||
key.dsize = strlen(k);
|
||||
dbuf = tdb_fetch(tdb, key);
|
||||
|
||||
if ( !dbuf.dptr ) {
|
||||
terror("fetch failed");
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
print_rec(tdb, key, dbuf, NULL);
|
||||
|
||||
dst_tdb = tdb_open_ex(file, 0, 0, O_RDWR, 0600, &log_ctx, NULL);
|
||||
if ( !dst_tdb ) {
|
||||
terror("unable to open destination tdb");
|
||||
return;
|
||||
}
|
||||
|
||||
if ( tdb_store( dst_tdb, key, dbuf, TDB_REPLACE ) == -1 ) {
|
||||
terror("failed to move record");
|
||||
}
|
||||
else
|
||||
printf("record moved\n");
|
||||
|
||||
tdb_close( dst_tdb );
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
static int print_rec(struct tdb_context *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
printf("\nkey %d bytes\n", key.dsize);
|
||||
print_asc(key.dptr, key.dsize);
|
||||
printf("\ndata %d bytes\n", dbuf.dsize);
|
||||
print_data(dbuf.dptr, dbuf.dsize);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int print_key(struct tdb_context *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
print_asc(key.dptr, key.dsize);
|
||||
printf("\n");
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int total_bytes;
|
||||
|
||||
static int traverse_fn(struct tdb_context *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
total_bytes += dbuf.dsize;
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void info_tdb(void)
|
||||
{
|
||||
int count;
|
||||
total_bytes = 0;
|
||||
if ((count = tdb_traverse(tdb, traverse_fn, NULL) == -1))
|
||||
printf("Error = %s\n", tdb_errorstr(tdb));
|
||||
else
|
||||
printf("%d records totalling %d bytes\n", count, total_bytes);
|
||||
}
|
||||
|
||||
static char *tdb_getline(const char *prompt)
|
||||
{
|
||||
static char line[1024];
|
||||
char *p;
|
||||
fputs(prompt, stdout);
|
||||
line[0] = 0;
|
||||
p = fgets(line, sizeof(line)-1, stdin);
|
||||
if (p) p = strchr(p, '\n');
|
||||
if (p) *p = 0;
|
||||
return p?line:NULL;
|
||||
}
|
||||
|
||||
static int do_delete_fn(struct tdb_context *the_tdb, TDB_DATA key, TDB_DATA dbuf,
|
||||
void *state)
|
||||
{
|
||||
return tdb_delete(the_tdb, key);
|
||||
}
|
||||
|
||||
static void first_record(struct tdb_context *the_tdb, TDB_DATA *pkey)
|
||||
{
|
||||
TDB_DATA dbuf;
|
||||
*pkey = tdb_firstkey(the_tdb);
|
||||
|
||||
dbuf = tdb_fetch(the_tdb, *pkey);
|
||||
if (!dbuf.dptr) terror("fetch failed");
|
||||
else {
|
||||
/* printf("%s : %*.*s\n", k, (int)dbuf.dsize, (int)dbuf.dsize, dbuf.dptr); */
|
||||
print_rec(the_tdb, *pkey, dbuf, NULL);
|
||||
}
|
||||
}
|
||||
|
||||
static void next_record(struct tdb_context *the_tdb, TDB_DATA *pkey)
|
||||
{
|
||||
TDB_DATA dbuf;
|
||||
*pkey = tdb_nextkey(the_tdb, *pkey);
|
||||
|
||||
dbuf = tdb_fetch(the_tdb, *pkey);
|
||||
if (!dbuf.dptr)
|
||||
terror("fetch failed");
|
||||
else
|
||||
/* printf("%s : %*.*s\n", k, (int)dbuf.dsize, (int)dbuf.dsize, dbuf.dptr); */
|
||||
print_rec(the_tdb, *pkey, dbuf, NULL);
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
int bIterate = 0;
|
||||
char *line;
|
||||
char *tok;
|
||||
TDB_DATA iterate_kbuf;
|
||||
|
||||
if (argv[1]) {
|
||||
static char tmp[1024];
|
||||
sprintf(tmp, "open %s", argv[1]);
|
||||
tok=strtok(tmp," ");
|
||||
open_tdb();
|
||||
}
|
||||
|
||||
while ((line = tdb_getline("tdb> "))) {
|
||||
|
||||
/* Shell command */
|
||||
|
||||
if (line[0] == '!') {
|
||||
system(line + 1);
|
||||
continue;
|
||||
}
|
||||
|
||||
if ((tok = strtok(line," "))==NULL) {
|
||||
if (bIterate)
|
||||
next_record(tdb, &iterate_kbuf);
|
||||
continue;
|
||||
}
|
||||
if (strcmp(tok,"create") == 0) {
|
||||
bIterate = 0;
|
||||
create_tdb();
|
||||
continue;
|
||||
} else if (strcmp(tok,"open") == 0) {
|
||||
open_tdb();
|
||||
continue;
|
||||
} else if ((strcmp(tok, "q") == 0) ||
|
||||
(strcmp(tok, "quit") == 0)) {
|
||||
break;
|
||||
}
|
||||
|
||||
/* all the rest require a open database */
|
||||
if (!tdb) {
|
||||
bIterate = 0;
|
||||
terror("database not open");
|
||||
help();
|
||||
continue;
|
||||
}
|
||||
|
||||
if (strcmp(tok,"insert") == 0) {
|
||||
bIterate = 0;
|
||||
insert_tdb();
|
||||
} else if (strcmp(tok,"store") == 0) {
|
||||
bIterate = 0;
|
||||
store_tdb();
|
||||
} else if (strcmp(tok,"show") == 0) {
|
||||
bIterate = 0;
|
||||
show_tdb();
|
||||
} else if (strcmp(tok,"erase") == 0) {
|
||||
bIterate = 0;
|
||||
tdb_traverse(tdb, do_delete_fn, NULL);
|
||||
} else if (strcmp(tok,"delete") == 0) {
|
||||
bIterate = 0;
|
||||
delete_tdb();
|
||||
} else if (strcmp(tok,"dump") == 0) {
|
||||
bIterate = 0;
|
||||
tdb_traverse(tdb, print_rec, NULL);
|
||||
} else if (strcmp(tok,"move") == 0) {
|
||||
bIterate = 0;
|
||||
move_rec();
|
||||
} else if (strcmp(tok,"list") == 0) {
|
||||
tdb_dump_all(tdb);
|
||||
} else if (strcmp(tok, "free") == 0) {
|
||||
tdb_printfreelist(tdb);
|
||||
} else if (strcmp(tok,"info") == 0) {
|
||||
info_tdb();
|
||||
} else if ( (strcmp(tok, "1") == 0) ||
|
||||
(strcmp(tok, "first") == 0)) {
|
||||
bIterate = 1;
|
||||
first_record(tdb, &iterate_kbuf);
|
||||
} else if ((strcmp(tok, "n") == 0) ||
|
||||
(strcmp(tok, "next") == 0)) {
|
||||
next_record(tdb, &iterate_kbuf);
|
||||
} else if ((strcmp(tok, "keys") == 0)) {
|
||||
bIterate = 0;
|
||||
tdb_traverse(tdb, print_key, NULL);
|
||||
} else {
|
||||
help();
|
||||
}
|
||||
}
|
||||
|
||||
if (tdb) tdb_close(tdb);
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,318 @@
|
||||
/* this tests tdb by doing lots of ops from several simultaneous
|
||||
writers - that stresses the locking code.
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "tdb.h"
|
||||
#include "system/time.h"
|
||||
#include "system/wait.h"
|
||||
#include "system/filesys.h"
|
||||
|
||||
#ifdef HAVE_GETOPT_H
|
||||
#include <getopt.h>
|
||||
#endif
|
||||
|
||||
|
||||
#define REOPEN_PROB 30
|
||||
#define DELETE_PROB 8
|
||||
#define STORE_PROB 4
|
||||
#define APPEND_PROB 6
|
||||
#define TRANSACTION_PROB 10
|
||||
#define LOCKSTORE_PROB 5
|
||||
#define TRAVERSE_PROB 20
|
||||
#define TRAVERSE_READ_PROB 20
|
||||
#define CULL_PROB 100
|
||||
#define KEYLEN 3
|
||||
#define DATALEN 100
|
||||
|
||||
static struct tdb_context *db;
|
||||
static int in_transaction;
|
||||
static int error_count;
|
||||
|
||||
#ifdef PRINTF_ATTRIBUTE
|
||||
static void tdb_log(struct tdb_context *tdb, enum tdb_debug_level level, const char *format, ...) PRINTF_ATTRIBUTE(3,4);
|
||||
#endif
|
||||
static void tdb_log(struct tdb_context *tdb, enum tdb_debug_level level, const char *format, ...)
|
||||
{
|
||||
va_list ap;
|
||||
|
||||
error_count++;
|
||||
|
||||
va_start(ap, format);
|
||||
vfprintf(stdout, format, ap);
|
||||
va_end(ap);
|
||||
fflush(stdout);
|
||||
#if 0
|
||||
{
|
||||
char *ptr;
|
||||
asprintf(&ptr,"xterm -e gdb /proc/%d/exe %d", getpid(), getpid());
|
||||
system(ptr);
|
||||
free(ptr);
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
||||
static void fatal(const char *why)
|
||||
{
|
||||
perror(why);
|
||||
error_count++;
|
||||
}
|
||||
|
||||
static char *randbuf(int len)
|
||||
{
|
||||
char *buf;
|
||||
int i;
|
||||
buf = (char *)malloc(len+1);
|
||||
|
||||
for (i=0;i<len;i++) {
|
||||
buf[i] = 'a' + (rand() % 26);
|
||||
}
|
||||
buf[i] = 0;
|
||||
return buf;
|
||||
}
|
||||
|
||||
static int cull_traverse(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf,
|
||||
void *state)
|
||||
{
|
||||
#if CULL_PROB
|
||||
if (random() % CULL_PROB == 0) {
|
||||
tdb_delete(tdb, key);
|
||||
}
|
||||
#endif
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void addrec_db(void)
|
||||
{
|
||||
int klen, dlen;
|
||||
char *k, *d;
|
||||
TDB_DATA key, data;
|
||||
|
||||
klen = 1 + (rand() % KEYLEN);
|
||||
dlen = 1 + (rand() % DATALEN);
|
||||
|
||||
k = randbuf(klen);
|
||||
d = randbuf(dlen);
|
||||
|
||||
key.dptr = (unsigned char *)k;
|
||||
key.dsize = klen+1;
|
||||
|
||||
data.dptr = (unsigned char *)d;
|
||||
data.dsize = dlen+1;
|
||||
|
||||
#if TRANSACTION_PROB
|
||||
if (in_transaction == 0 && random() % TRANSACTION_PROB == 0) {
|
||||
if (tdb_transaction_start(db) != 0) {
|
||||
fatal("tdb_transaction_start failed");
|
||||
}
|
||||
in_transaction++;
|
||||
goto next;
|
||||
}
|
||||
if (in_transaction && random() % TRANSACTION_PROB == 0) {
|
||||
if (tdb_transaction_commit(db) != 0) {
|
||||
fatal("tdb_transaction_commit failed");
|
||||
}
|
||||
in_transaction--;
|
||||
goto next;
|
||||
}
|
||||
if (in_transaction && random() % TRANSACTION_PROB == 0) {
|
||||
if (tdb_transaction_cancel(db) != 0) {
|
||||
fatal("tdb_transaction_cancel failed");
|
||||
}
|
||||
in_transaction--;
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if REOPEN_PROB
|
||||
if (in_transaction == 0 && random() % REOPEN_PROB == 0) {
|
||||
tdb_reopen_all(0);
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if DELETE_PROB
|
||||
if (random() % DELETE_PROB == 0) {
|
||||
tdb_delete(db, key);
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if STORE_PROB
|
||||
if (random() % STORE_PROB == 0) {
|
||||
if (tdb_store(db, key, data, TDB_REPLACE) != 0) {
|
||||
fatal("tdb_store failed");
|
||||
}
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if APPEND_PROB
|
||||
if (random() % APPEND_PROB == 0) {
|
||||
if (tdb_append(db, key, data) != 0) {
|
||||
fatal("tdb_append failed");
|
||||
}
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if LOCKSTORE_PROB
|
||||
if (random() % LOCKSTORE_PROB == 0) {
|
||||
tdb_chainlock(db, key);
|
||||
data = tdb_fetch(db, key);
|
||||
if (tdb_store(db, key, data, TDB_REPLACE) != 0) {
|
||||
fatal("tdb_store failed");
|
||||
}
|
||||
if (data.dptr) free(data.dptr);
|
||||
tdb_chainunlock(db, key);
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if TRAVERSE_PROB
|
||||
if (random() % TRAVERSE_PROB == 0) {
|
||||
tdb_traverse(db, cull_traverse, NULL);
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if TRAVERSE_READ_PROB
|
||||
if (random() % TRAVERSE_READ_PROB == 0) {
|
||||
tdb_traverse_read(db, NULL, NULL);
|
||||
goto next;
|
||||
}
|
||||
#endif
|
||||
|
||||
data = tdb_fetch(db, key);
|
||||
if (data.dptr) free(data.dptr);
|
||||
|
||||
next:
|
||||
free(k);
|
||||
free(d);
|
||||
}
|
||||
|
||||
static int traverse_fn(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf,
|
||||
void *state)
|
||||
{
|
||||
tdb_delete(tdb, key);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void usage(void)
|
||||
{
|
||||
printf("Usage: tdbtorture [-n NUM_PROCS] [-l NUM_LOOPS] [-s SEED] [-H HASH_SIZE]\n");
|
||||
exit(0);
|
||||
}
|
||||
|
||||
int main(int argc, char * const *argv)
|
||||
{
|
||||
int i, seed = -1;
|
||||
int num_procs = 3;
|
||||
int num_loops = 5000;
|
||||
int hash_size = 2;
|
||||
int c;
|
||||
extern char *optarg;
|
||||
pid_t *pids;
|
||||
|
||||
struct tdb_logging_context log_ctx;
|
||||
log_ctx.log_fn = tdb_log;
|
||||
|
||||
while ((c = getopt(argc, argv, "n:l:s:H:h")) != -1) {
|
||||
switch (c) {
|
||||
case 'n':
|
||||
num_procs = strtol(optarg, NULL, 0);
|
||||
break;
|
||||
case 'l':
|
||||
num_loops = strtol(optarg, NULL, 0);
|
||||
break;
|
||||
case 'H':
|
||||
hash_size = strtol(optarg, NULL, 0);
|
||||
break;
|
||||
case 's':
|
||||
seed = strtol(optarg, NULL, 0);
|
||||
break;
|
||||
default:
|
||||
usage();
|
||||
}
|
||||
}
|
||||
|
||||
unlink("torture.tdb");
|
||||
|
||||
pids = calloc(sizeof(pid_t), num_procs);
|
||||
pids[0] = getpid();
|
||||
|
||||
for (i=0;i<num_procs-1;i++) {
|
||||
if ((pids[i+1]=fork()) == 0) break;
|
||||
}
|
||||
|
||||
db = tdb_open_ex("torture.tdb", hash_size, TDB_CLEAR_IF_FIRST,
|
||||
O_RDWR | O_CREAT, 0600, &log_ctx, NULL);
|
||||
if (!db) {
|
||||
fatal("db open failed");
|
||||
}
|
||||
|
||||
if (seed == -1) {
|
||||
seed = (getpid() + time(NULL)) & 0x7FFFFFFF;
|
||||
}
|
||||
|
||||
if (i == 0) {
|
||||
printf("testing with %d processes, %d loops, %d hash_size, seed=%d\n",
|
||||
num_procs, num_loops, hash_size, seed);
|
||||
}
|
||||
|
||||
srand(seed + i);
|
||||
srandom(seed + i);
|
||||
|
||||
for (i=0;i<num_loops && error_count == 0;i++) {
|
||||
addrec_db();
|
||||
}
|
||||
|
||||
if (error_count == 0) {
|
||||
tdb_traverse_read(db, NULL, NULL);
|
||||
tdb_traverse(db, traverse_fn, NULL);
|
||||
tdb_traverse(db, traverse_fn, NULL);
|
||||
}
|
||||
|
||||
tdb_close(db);
|
||||
|
||||
if (getpid() != pids[0]) {
|
||||
return error_count;
|
||||
}
|
||||
|
||||
for (i=1;i<num_procs;i++) {
|
||||
int status, j;
|
||||
pid_t pid;
|
||||
if (error_count != 0) {
|
||||
/* try and stop the test on any failure */
|
||||
for (j=1;j<num_procs;j++) {
|
||||
if (pids[j] != 0) {
|
||||
kill(pids[j], SIGTERM);
|
||||
}
|
||||
}
|
||||
}
|
||||
pid = waitpid(-1, &status, 0);
|
||||
if (pid == -1) {
|
||||
perror("failed to wait for child\n");
|
||||
exit(1);
|
||||
}
|
||||
for (j=1;j<num_procs;j++) {
|
||||
if (pids[j] == pid) break;
|
||||
}
|
||||
if (j == num_procs) {
|
||||
printf("unknown child %d exited!?\n", (int)pid);
|
||||
exit(1);
|
||||
}
|
||||
if (WEXITSTATUS(status) != 0) {
|
||||
printf("child %d exited with status %d\n",
|
||||
(int)pid, WEXITSTATUS(status));
|
||||
error_count++;
|
||||
}
|
||||
pids[j] = 0;
|
||||
}
|
||||
|
||||
if (error_count == 0) {
|
||||
printf("OK\n");
|
||||
}
|
||||
|
||||
return error_count;
|
||||
}
|
||||
Reference in New Issue
Block a user