mirror of
https://github.com/samba-team/samba.git
synced 2025-03-27 22:50:26 +03:00
Use single copy of tdb in both samba3 and samba4.
This commit is contained in:
parent
ec1c854f21
commit
7111645d3c
@ -33,7 +33,7 @@ AC_SUBST(LIBTALLOC_OBJ0)
|
||||
|
||||
# TODO: These should come from m4_include(lib/tdb/libtdb.m4)
|
||||
# but currently this fails: things have to get merged from s4.
|
||||
tdbdir="lib/tdb"
|
||||
tdbdir="../tdb"
|
||||
AC_SUBST(tdbdir)
|
||||
TDB_CFLAGS="-I${srcdir-.}/$tdbdir/include"
|
||||
AC_SUBST(TDB_CFLAGS)
|
||||
@ -43,7 +43,7 @@ for o in common/tdb.o common/dump.o common/transaction.o common/error.o \
|
||||
common/traverse.o common/freelist.o common/freelistcheck.o \
|
||||
common/io.o common/lock.o common/open.o;
|
||||
do
|
||||
LIBTDB_OBJ0="$LIBTDB_OBJ0 lib/tdb/$o"
|
||||
LIBTDB_OBJ0="$LIBTDB_OBJ0 $tdbdir/$o"
|
||||
done
|
||||
|
||||
AC_SUBST(LIBTDB_OBJ0)
|
||||
|
@ -6,7 +6,7 @@
|
||||
#if (_SAMBA_BUILD_ >= 4)
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#elif defined(_SAMBA_BUILD_)
|
||||
#include "tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#else
|
||||
#include "tdb.h"
|
||||
#endif
|
||||
|
@ -38,12 +38,12 @@ SMB_EXT_LIB_FROM_PKGCONFIG(LIBTALLOC, talloc >= 1.2.0,
|
||||
SMB_EXT_LIB_FROM_PKGCONFIG(LIBTDB, tdb >= 1.1.0,
|
||||
[],
|
||||
[
|
||||
m4_include(lib/tdb/libtdb.m4)
|
||||
SMB_INCLUDE_MK(lib/tdb/config.mk)
|
||||
m4_include(../tdb/libtdb.m4)
|
||||
SMB_INCLUDE_MK(../tdb/config.mk)
|
||||
]
|
||||
)
|
||||
|
||||
SMB_INCLUDE_MK(lib/tdb/python.mk)
|
||||
SMB_INCLUDE_MK(../tdb/python.mk)
|
||||
|
||||
SMB_EXT_LIB_FROM_PKGCONFIG(LIBLDB, ldb >= 0.9.1,
|
||||
[
|
||||
|
@ -62,7 +62,7 @@ libsrcdir := lib
|
||||
libsocketsrcdir := lib/socket
|
||||
libcharsetsrcdir := lib/charset
|
||||
ldb_sambasrcdir := lib/ldb-samba
|
||||
tdbsrcdir := lib/tdb
|
||||
tdbsrcdir := ../tdb
|
||||
ldbsrcdir := lib/ldb
|
||||
libtlssrcdir := lib/tls
|
||||
libregistrysrcdir := lib/registry
|
||||
|
@ -20,7 +20,7 @@
|
||||
|
||||
#include "includes.h"
|
||||
#include "tdb_wrap.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "system/network.h"
|
||||
|
@ -21,7 +21,7 @@
|
||||
*/
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "system/network.h"
|
||||
|
@ -19,7 +19,7 @@
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
@ -22,7 +22,7 @@
|
||||
*/
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
@ -19,7 +19,7 @@
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
@ -24,7 +24,7 @@
|
||||
#include "cluster/cluster.h"
|
||||
#include "system/filesys.h"
|
||||
#include "cluster/cluster_private.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "include/ctdb.h"
|
||||
#include "tdb_wrap.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
|
@ -22,7 +22,7 @@
|
||||
*/
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
|
@ -18,7 +18,7 @@
|
||||
*/
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
|
@ -18,7 +18,7 @@
|
||||
*/
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "system/network.h"
|
||||
|
@ -18,7 +18,7 @@
|
||||
*/
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
|
@ -21,7 +21,7 @@
|
||||
#include "lib/events/events.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
||||
|
||||
|
@ -19,7 +19,7 @@
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
@ -19,7 +19,7 @@
|
||||
*/
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
|
@ -18,7 +18,7 @@
|
||||
*/
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "system/network.h"
|
||||
|
@ -19,7 +19,7 @@
|
||||
*/
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
|
@ -21,7 +21,7 @@
|
||||
#include "lib/events/events.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
||||
typedef void (*ctdb_traverse_fn_t)(void *private_data, TDB_DATA key, TDB_DATA data);
|
||||
|
@ -19,7 +19,7 @@
|
||||
*/
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
|
@ -19,7 +19,7 @@
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
@ -18,7 +18,7 @@
|
||||
*/
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
|
@ -20,7 +20,7 @@
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "system/network.h"
|
||||
#include "system/filesys.h"
|
||||
#include "../include/ctdb_private.h"
|
||||
|
@ -22,7 +22,7 @@
|
||||
#include "includes.h"
|
||||
#include "cluster/cluster.h"
|
||||
#include "cluster/cluster_private.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "tdb_wrap.h"
|
||||
#include "system/filesys.h"
|
||||
#include "param/param.h"
|
||||
|
@ -49,12 +49,12 @@ SMB_EXT_LIB_FROM_PKGCONFIG(LIBTALLOC, talloc >= 1.2.0,
|
||||
SMB_EXT_LIB_FROM_PKGCONFIG(LIBTDB, tdb >= 1.1.0,
|
||||
[],
|
||||
[
|
||||
m4_include(lib/tdb/libtdb.m4)
|
||||
SMB_INCLUDE_MK(lib/tdb/config.mk)
|
||||
m4_include(../tdb/libtdb.m4)
|
||||
SMB_INCLUDE_MK(../tdb/config.mk)
|
||||
]
|
||||
)
|
||||
|
||||
SMB_INCLUDE_MK(lib/tdb/python.mk)
|
||||
SMB_INCLUDE_MK(../tdb/python.mk)
|
||||
|
||||
SMB_EXT_LIB_FROM_PKGCONFIG(LIBLDB, ldb >= 0.9.1,
|
||||
[
|
||||
|
@ -30,8 +30,7 @@
|
||||
#include "tdb_wrap.h"
|
||||
#include "lib/util/unix_privs.h"
|
||||
#include "librpc/rpc/dcerpc.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "lib/util/util_tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/util/util_tdb.h"
|
||||
#include "cluster/cluster.h"
|
||||
#include "param/param.h"
|
||||
|
@ -1,59 +0,0 @@
|
||||
#!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
|
||||
CFLAGS = $(CPPFLAGS) @CFLAGS@
|
||||
LDFLAGS = @LDFLAGS@
|
||||
EXEEXT = @EXEEXT@
|
||||
SHLD = @SHLD@
|
||||
SHLD_FLAGS = @SHLD_FLAGS@
|
||||
PACKAGE_VERSION = @PACKAGE_VERSION@
|
||||
PICFLAG = @PICFLAG@
|
||||
SHLIBEXT = @SHLIBEXT@
|
||||
SWIG = swig
|
||||
PYTHON = @PYTHON@
|
||||
PYTHON_CONFIG = @PYTHON_CONFIG@
|
||||
PYTHON_BUILD_TARGET = @PYTHON_BUILD_TARGET@
|
||||
PYTHON_INSTALL_TARGET = @PYTHON_INSTALL_TARGET@
|
||||
PYTHON_CHECK_TARGET = @PYTHON_CHECK_TARGET@
|
||||
LIB_PATH_VAR = @LIB_PATH_VAR@
|
||||
tdbdir = @tdbdir@
|
||||
|
||||
TDB_OBJ = @TDB_OBJ@ @LIBREPLACEOBJ@
|
||||
|
||||
default: all
|
||||
|
||||
include $(tdbdir)/tdb.mk
|
||||
include $(tdbdir)/rules.mk
|
||||
|
||||
all:: showflags dirs $(PROGS) $(TDB_SOLIB) libtdb.a $(PYTHON_BUILD_TARGET)
|
||||
|
||||
install:: all
|
||||
$(TDB_SOLIB): $(TDB_OBJ)
|
||||
$(SHLD) $(SHLD_FLAGS) -o $@ $(TDB_OBJ) @SONAMEFLAG@$(TDB_SONAME)
|
||||
|
||||
check: test
|
||||
|
||||
test:: $(PYTHON_CHECK_TARGET)
|
||||
installcheck:: test install
|
||||
|
||||
clean::
|
||||
rm -f *.o *.a */*.o
|
||||
|
||||
distclean:: clean
|
||||
rm -f config.log config.status include/config.h config.cache
|
||||
rm -f Makefile
|
||||
|
||||
realdistclean:: distclean
|
||||
rm -f configure include/config.h.in
|
1
source4/lib/tdb/aclocal.m4
vendored
1
source4/lib/tdb/aclocal.m4
vendored
@ -1 +0,0 @@
|
||||
m4_include(libreplace.m4)
|
@ -1,16 +0,0 @@
|
||||
#!/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
|
||||
|
||||
swig -O -Wall -python -keyword tdb.i # Ignore errors for now
|
||||
|
||||
echo "Now run ./configure and then make."
|
||||
exit 0
|
||||
|
@ -1,137 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
static tdb_off_t tdb_dump_record(struct tdb_context *tdb, int hash,
|
||||
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: hash=%d offset=0x%08x next=0x%08x rec_len=%d "
|
||||
"key_len=%d data_len=%d full_hash=0x%x magic=0x%x\n",
|
||||
hash, 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, i, 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);
|
||||
}
|
||||
|
@ -1,57 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#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)
|
||||
{
|
||||
uint32_t 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";
|
||||
}
|
||||
|
@ -1,382 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
/* 'right' merges can involve O(n^2) cost when combined with a
|
||||
traverse, so they are disabled until we find a way to do them in
|
||||
O(1) time
|
||||
*/
|
||||
#define USE_RIGHT_MERGES 0
|
||||
|
||||
/* read a freelist record and check for simple errors */
|
||||
int tdb_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, "tdb_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, "tdb_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;
|
||||
}
|
||||
|
||||
|
||||
#if USE_RIGHT_MERGES
|
||||
/* 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);
|
||||
}
|
||||
#endif
|
||||
|
||||
|
||||
/* 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)
|
||||
{
|
||||
/* 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;
|
||||
}
|
||||
|
||||
#if USE_RIGHT_MERGES
|
||||
/* Look right first (I'm an Australian, dammit) */
|
||||
if (offset + sizeof(*rec) + rec->rec_len + sizeof(*rec) <= tdb->map_size) {
|
||||
tdb_off_t right = offset + sizeof(*rec) + rec->rec_len;
|
||||
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;
|
||||
if (update_tailer(tdb, offset, rec) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: update_tailer failed at %u\n", offset));
|
||||
goto fail;
|
||||
}
|
||||
}
|
||||
}
|
||||
left:
|
||||
#endif
|
||||
|
||||
/* Look left */
|
||||
if (offset - sizeof(tdb_off_t) > TDB_DATA_START(tdb->header.hash_size)) {
|
||||
tdb_off_t left = offset - sizeof(tdb_off_t);
|
||||
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;
|
||||
|
||||
if (leftsize > offset ||
|
||||
left < TDB_DATA_START(tdb->header.hash_size)) {
|
||||
goto update;
|
||||
}
|
||||
|
||||
/* Now read in the left 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) {
|
||||
/* we now merge the new record into the left record, rather than the other
|
||||
way around. This makes the operation O(1) instead of O(n). This change
|
||||
prevents traverse from being O(n^2) after a lot of deletes */
|
||||
l.rec_len += sizeof(*rec) + rec->rec_len;
|
||||
if (tdb_rec_write(tdb, left, &l) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: update_left failed at %u\n", left));
|
||||
goto fail;
|
||||
}
|
||||
if (update_tailer(tdb, left, &l) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: update_tailer failed at %u\n", offset));
|
||||
goto fail;
|
||||
}
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
update:
|
||||
|
||||
/* 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
|
||||
|
||||
Note that we try to allocate by grabbing data from the end of an existing record,
|
||||
not the beginning. This is so the left merge in a free is more likely to be
|
||||
able to free up the record without fragmentation
|
||||
*/
|
||||
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)
|
||||
{
|
||||
#define MIN_REC_SIZE (sizeof(struct list_struct) + sizeof(tdb_off_t) + 8)
|
||||
|
||||
if (rec->rec_len < length + MIN_REC_SIZE) {
|
||||
/* we have to grab the whole record */
|
||||
|
||||
/* unlink it from the previous record */
|
||||
if (tdb_ofs_write(tdb, last_ptr, &rec->next) == -1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* mark it not free */
|
||||
rec->magic = TDB_MAGIC;
|
||||
if (tdb_rec_write(tdb, rec_ptr, rec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
return rec_ptr;
|
||||
}
|
||||
|
||||
/* we're going to just shorten the existing record */
|
||||
rec->rec_len -= (length + sizeof(*rec));
|
||||
if (tdb_rec_write(tdb, rec_ptr, rec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
if (update_tailer(tdb, rec_ptr, rec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* and setup the new record */
|
||||
rec_ptr += sizeof(*rec) + rec->rec_len;
|
||||
|
||||
memset(rec, '\0', sizeof(*rec));
|
||||
rec->rec_len = length;
|
||||
rec->magic = TDB_MAGIC;
|
||||
|
||||
if (tdb_rec_write(tdb, rec_ptr, rec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (update_tailer(tdb, rec_ptr, rec) == -1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
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;
|
||||
float multiplier = 1.0;
|
||||
|
||||
if (tdb_lock(tdb, -1, F_WRLCK) == -1)
|
||||
return 0;
|
||||
|
||||
/* Extra bytes required for tailer */
|
||||
length += sizeof(tdb_off_t);
|
||||
length = TDB_ALIGN(length, TDB_ALIGNMENT);
|
||||
|
||||
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 (tdb_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;
|
||||
}
|
||||
}
|
||||
|
||||
/* move to the next record */
|
||||
last_ptr = rec_ptr;
|
||||
rec_ptr = rec->next;
|
||||
|
||||
/* if we've found a record that is big enough, then
|
||||
stop searching if its also not too big. The
|
||||
definition of 'too big' changes as we scan
|
||||
through */
|
||||
if (bestfit.rec_len > 0 &&
|
||||
bestfit.rec_len < length * multiplier) {
|
||||
break;
|
||||
}
|
||||
|
||||
/* this multiplier means we only extremely rarely
|
||||
search more than 50 or so records. At 50 records we
|
||||
accept records up to 11 times larger than what we
|
||||
want */
|
||||
multiplier *= 1.05;
|
||||
}
|
||||
|
||||
if (bestfit.rec_ptr != 0) {
|
||||
if (tdb_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;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*
|
||||
return the size of the freelist - used to decide if we should repack
|
||||
*/
|
||||
int tdb_freelist_size(struct tdb_context *tdb)
|
||||
{
|
||||
tdb_off_t ptr;
|
||||
int count=0;
|
||||
|
||||
if (tdb_lock(tdb, -1, F_RDLCK) == -1) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
ptr = FREELIST_TOP;
|
||||
while (tdb_ofs_read(tdb, ptr, &ptr) == 0 && ptr != 0) {
|
||||
count++;
|
||||
}
|
||||
|
||||
tdb_unlock(tdb, -1, F_RDLCK);
|
||||
return count;
|
||||
}
|
@ -1,107 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#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 = (unsigned 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 (tdb_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;
|
||||
}
|
@ -1,473 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#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 {
|
||||
ssize_t written = pwrite(tdb->fd, buf, len, off);
|
||||
if ((written != (ssize_t)len) && (written != -1)) {
|
||||
/* try once more */
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_write: wrote only "
|
||||
"%d of %d bytes at %d, trying once more\n",
|
||||
(int)written, len, off));
|
||||
errno = ENOSPC;
|
||||
written = pwrite(tdb->fd, (const void *)((const char *)buf+written),
|
||||
len-written,
|
||||
off+written);
|
||||
}
|
||||
if (written == -1) {
|
||||
/* 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);
|
||||
} else if (written != (ssize_t)len) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_write: failed to "
|
||||
"write %d bytes at %d in two attempts\n",
|
||||
len, off));
|
||||
errno = ENOSPC;
|
||||
return TDB_ERRCODE(TDB_ERR_IO, -1);
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Endian conversion: we only ever deal with 4 byte quantities */
|
||||
void *tdb_convert(void *buf, uint32_t size)
|
||||
{
|
||||
uint32_t i, *p = (uint32_t *)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",
|
||||
(int)off, (int)len, (int)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, uint32_t *chain)
|
||||
{
|
||||
uint32_t h = *chain;
|
||||
if (tdb->map_ptr) {
|
||||
for (;h < tdb->header.hash_size;h++) {
|
||||
if (0 != *(uint32_t *)(TDB_HASH_TOP(h) + (unsigned char *)tdb->map_ptr)) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
uint32_t 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;
|
||||
|
||||
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[8192];
|
||||
|
||||
if (tdb->read_only || tdb->traverse_read) {
|
||||
tdb->ecode = TDB_ERR_RDONLY;
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (ftruncate(tdb->fd, size+addition) == -1) {
|
||||
char b = 0;
|
||||
ssize_t written = pwrite(tdb->fd, &b, 1, (size+addition) - 1);
|
||||
if (written == 0) {
|
||||
/* try once more, potentially revealing errno */
|
||||
written = pwrite(tdb->fd, &b, 1, (size+addition) - 1);
|
||||
}
|
||||
if (written == 0) {
|
||||
/* again - give up, guessing errno */
|
||||
errno = ENOSPC;
|
||||
}
|
||||
if (written != 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) {
|
||||
size_t n = addition>sizeof(buf)?sizeof(buf):addition;
|
||||
ssize_t written = pwrite(tdb->fd, buf, n, size);
|
||||
if (written == 0) {
|
||||
/* prevent infinite loops: try _once_ more */
|
||||
written = pwrite(tdb->fd, buf, n, size);
|
||||
}
|
||||
if (written == 0) {
|
||||
/* give up, trying to provide a useful errno */
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "expand_file write "
|
||||
"returned 0 twice: giving up!\n"));
|
||||
errno = ENOSPC;
|
||||
return -1;
|
||||
} else if (written == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "expand_file write of "
|
||||
"%d bytes failed (%s)\n", (int)n,
|
||||
strerror(errno)));
|
||||
return -1;
|
||||
} else if (written != n) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_WARNING, "expand_file: wrote "
|
||||
"only %d of %d bytes - retrying\n", (int)written,
|
||||
(int)n));
|
||||
}
|
||||
addition -= written;
|
||||
size += written;
|
||||
}
|
||||
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, new_size;
|
||||
|
||||
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 100 more records, and at
|
||||
least 25% more space. Round the database up to a multiple
|
||||
of the page size */
|
||||
new_size = MAX(tdb->map_size + size*100, tdb->map_size * 1.25);
|
||||
size = TDB_ALIGN(new_size, 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 = (unsigned char *)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;
|
||||
}
|
||||
|
||||
/* Give a piece of tdb data to a parser */
|
||||
|
||||
int tdb_parse_data(struct tdb_context *tdb, TDB_DATA key,
|
||||
tdb_off_t offset, tdb_len_t len,
|
||||
int (*parser)(TDB_DATA key, TDB_DATA data,
|
||||
void *private_data),
|
||||
void *private_data)
|
||||
{
|
||||
TDB_DATA data;
|
||||
int result;
|
||||
|
||||
data.dsize = len;
|
||||
|
||||
if ((tdb->transaction == NULL) && (tdb->map_ptr != NULL)) {
|
||||
/*
|
||||
* Optimize by avoiding the malloc/memcpy/free, point the
|
||||
* parser directly at the mmap area.
|
||||
*/
|
||||
if (tdb->methods->tdb_oob(tdb, offset+len, 0) != 0) {
|
||||
return -1;
|
||||
}
|
||||
data.dptr = offset + (unsigned char *)tdb->map_ptr;
|
||||
return parser(key, data, private_data);
|
||||
}
|
||||
|
||||
if (!(data.dptr = tdb_alloc_read(tdb, offset, len))) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
result = parser(key, data, private_data);
|
||||
free(data.dptr);
|
||||
return result;
|
||||
}
|
||||
|
||||
/* 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;
|
||||
}
|
@ -1,553 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
#define TDB_MARK_LOCK 0x80000000
|
||||
|
||||
void tdb_setalarm_sigptr(struct tdb_context *tdb, volatile sig_atomic_t *ptr)
|
||||
{
|
||||
tdb->interrupt_sig_ptr = ptr;
|
||||
}
|
||||
|
||||
/* 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);
|
||||
|
||||
/* Check for a sigalarm break. */
|
||||
if (ret == -1 && errno == EINTR &&
|
||||
tdb->interrupt_sig_ptr &&
|
||||
*tdb->interrupt_sig_ptr) {
|
||||
break;
|
||||
}
|
||||
} 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 */
|
||||
static int _tdb_lock(struct tdb_context *tdb, int list, int ltype, int op)
|
||||
{
|
||||
struct tdb_lock_type *new_lck;
|
||||
int i;
|
||||
bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK);
|
||||
|
||||
ltype &= ~TDB_MARK_LOCK;
|
||||
|
||||
/* 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;
|
||||
|
||||
for (i=0; i<tdb->num_lockrecs; i++) {
|
||||
if (tdb->lockrecs[i].list == list) {
|
||||
if (tdb->lockrecs[i].count == 0) {
|
||||
/*
|
||||
* Can't happen, see tdb_unlock(). It should
|
||||
* be an assert.
|
||||
*/
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_lock: "
|
||||
"lck->count == 0 for list %d", list));
|
||||
}
|
||||
/*
|
||||
* Just increment the in-memory struct, posix locks
|
||||
* don't stack.
|
||||
*/
|
||||
tdb->lockrecs[i].count++;
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
new_lck = (struct tdb_lock_type *)realloc(
|
||||
tdb->lockrecs,
|
||||
sizeof(*tdb->lockrecs) * (tdb->num_lockrecs+1));
|
||||
if (new_lck == NULL) {
|
||||
errno = ENOMEM;
|
||||
return -1;
|
||||
}
|
||||
tdb->lockrecs = new_lck;
|
||||
|
||||
/* Since fcntl locks don't nest, we do a lock for the first one,
|
||||
and simply bump the count for future ones */
|
||||
if (!mark_lock &&
|
||||
tdb->methods->tdb_brlock(tdb,FREELIST_TOP+4*list, ltype, op,
|
||||
0, 1)) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
tdb->num_locks++;
|
||||
|
||||
tdb->lockrecs[tdb->num_lockrecs].list = list;
|
||||
tdb->lockrecs[tdb->num_lockrecs].count = 1;
|
||||
tdb->lockrecs[tdb->num_lockrecs].ltype = ltype;
|
||||
tdb->num_lockrecs += 1;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* lock a list in the database. list -1 is the alloc list */
|
||||
int tdb_lock(struct tdb_context *tdb, int list, int ltype)
|
||||
{
|
||||
int ret;
|
||||
ret = _tdb_lock(tdb, list, ltype, F_SETLKW);
|
||||
if (ret) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_lock failed on list %d "
|
||||
"ltype=%d (%s)\n", list, ltype, strerror(errno)));
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
/* lock a list in the database. list -1 is the alloc list. non-blocking lock */
|
||||
int tdb_lock_nonblock(struct tdb_context *tdb, int list, int ltype)
|
||||
{
|
||||
return _tdb_lock(tdb, list, ltype, F_SETLK);
|
||||
}
|
||||
|
||||
|
||||
/* 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;
|
||||
int i;
|
||||
struct tdb_lock_type *lck = NULL;
|
||||
bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK);
|
||||
|
||||
ltype &= ~TDB_MARK_LOCK;
|
||||
|
||||
/* 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;
|
||||
}
|
||||
|
||||
for (i=0; i<tdb->num_lockrecs; i++) {
|
||||
if (tdb->lockrecs[i].list == list) {
|
||||
lck = &tdb->lockrecs[i];
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if ((lck == NULL) || (lck->count == 0)) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: count is 0\n"));
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (lck->count > 1) {
|
||||
lck->count--;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* This lock has count==1 left, so we need to unlock it in the
|
||||
* kernel. We don't bother with decrementing the in-memory array
|
||||
* element, we're about to overwrite it with the last array element
|
||||
* anyway.
|
||||
*/
|
||||
|
||||
if (mark_lock) {
|
||||
ret = 0;
|
||||
} else {
|
||||
ret = tdb->methods->tdb_brlock(tdb, FREELIST_TOP+4*list, F_UNLCK,
|
||||
F_SETLKW, 0, 1);
|
||||
}
|
||||
tdb->num_locks--;
|
||||
|
||||
/*
|
||||
* Shrink the array by overwriting the element just unlocked with the
|
||||
* last array element.
|
||||
*/
|
||||
|
||||
if (tdb->num_lockrecs > 1) {
|
||||
*lck = tdb->lockrecs[tdb->num_lockrecs-1];
|
||||
}
|
||||
tdb->num_lockrecs -= 1;
|
||||
|
||||
/*
|
||||
* We don't bother with realloc when the array shrinks, but if we have
|
||||
* a completely idle tdb we should get rid of the locked array.
|
||||
*/
|
||||
|
||||
if (tdb->num_lockrecs == 0) {
|
||||
SAFE_FREE(tdb->lockrecs);
|
||||
}
|
||||
|
||||
if (ret)
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: An error occurred unlocking!\n"));
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
get the transaction lock
|
||||
*/
|
||||
int tdb_transaction_lock(struct tdb_context *tdb, int ltype)
|
||||
{
|
||||
if (tdb->have_transaction_lock || tdb->global_lock.count) {
|
||||
return 0;
|
||||
}
|
||||
if (tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, ltype,
|
||||
F_SETLKW, 0, 1) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_lock: failed to get transaction lock\n"));
|
||||
tdb->ecode = TDB_ERR_LOCK;
|
||||
return -1;
|
||||
}
|
||||
tdb->have_transaction_lock = 1;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
release the transaction lock
|
||||
*/
|
||||
int tdb_transaction_unlock(struct tdb_context *tdb)
|
||||
{
|
||||
int ret;
|
||||
if (!tdb->have_transaction_lock) {
|
||||
return 0;
|
||||
}
|
||||
ret = tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, F_UNLCK, F_SETLKW, 0, 1);
|
||||
if (ret == 0) {
|
||||
tdb->have_transaction_lock = 0;
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
/* lock/unlock entire database */
|
||||
static int _tdb_lockall(struct tdb_context *tdb, int ltype, int op)
|
||||
{
|
||||
bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK);
|
||||
|
||||
ltype &= ~TDB_MARK_LOCK;
|
||||
|
||||
/* 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 (!mark_lock &&
|
||||
tdb->methods->tdb_brlock(tdb, FREELIST_TOP, ltype, op,
|
||||
0, 4*tdb->header.hash_size)) {
|
||||
if (op == F_SETLKW) {
|
||||
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)
|
||||
{
|
||||
bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK);
|
||||
|
||||
ltype &= ~TDB_MARK_LOCK;
|
||||
|
||||
/* 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 (!mark_lock &&
|
||||
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, F_SETLKW);
|
||||
}
|
||||
|
||||
/* lock entire database with write lock - mark only */
|
||||
int tdb_lockall_mark(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_lockall(tdb, F_WRLCK | TDB_MARK_LOCK, F_SETLKW);
|
||||
}
|
||||
|
||||
/* unlock entire database with write lock - unmark only */
|
||||
int tdb_lockall_unmark(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_unlockall(tdb, F_WRLCK | TDB_MARK_LOCK);
|
||||
}
|
||||
|
||||
/* lock entire database with write lock - nonblocking varient */
|
||||
int tdb_lockall_nonblock(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_lockall(tdb, F_WRLCK, F_SETLK);
|
||||
}
|
||||
|
||||
/* 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, F_SETLKW);
|
||||
}
|
||||
|
||||
/* lock entire database with read lock - nonblock varient */
|
||||
int tdb_lockall_read_nonblock(struct tdb_context *tdb)
|
||||
{
|
||||
return _tdb_lockall(tdb, F_RDLCK, F_SETLK);
|
||||
}
|
||||
|
||||
/* 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);
|
||||
}
|
||||
|
||||
/* lock/unlock one hash chain, non-blocking. This is meant to be used
|
||||
to reduce contention - it cannot guarantee how many records will be
|
||||
locked */
|
||||
int tdb_chainlock_nonblock(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
return tdb_lock_nonblock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK);
|
||||
}
|
||||
|
||||
/* mark a chain as locked without actually locking it. Warning! use with great caution! */
|
||||
int tdb_chainlock_mark(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
return tdb_lock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK | TDB_MARK_LOCK);
|
||||
}
|
||||
|
||||
/* unmark a chain as locked without actually locking it. Warning! use with great caution! */
|
||||
int tdb_chainlock_unmark(struct tdb_context *tdb, TDB_DATA key)
|
||||
{
|
||||
return tdb_unlock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK | TDB_MARK_LOCK);
|
||||
}
|
||||
|
||||
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)
|
||||
{
|
||||
if (tdb->global_lock.count) {
|
||||
return 0;
|
||||
}
|
||||
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;
|
||||
uint32_t count = 0;
|
||||
|
||||
if (tdb->global_lock.count) {
|
||||
return 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);
|
||||
}
|
@ -1,488 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#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)
|
||||
{
|
||||
uint32_t value; /* Used to compute the hash value. */
|
||||
uint32_t 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;
|
||||
size_t size;
|
||||
int ret = -1;
|
||||
ssize_t written;
|
||||
|
||||
/* 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);
|
||||
/* we still have "ret == -1" here */
|
||||
written = write(tdb->fd, newdb, size);
|
||||
if (written == size) {
|
||||
ret = 0;
|
||||
} else if (written != -1) {
|
||||
/* call write once again, this usually should return -1 and
|
||||
* set errno appropriately */
|
||||
size -= written;
|
||||
written = write(tdb->fd, newdb+written, size);
|
||||
if (written == size) {
|
||||
ret = 0;
|
||||
} else if (written >= 0) {
|
||||
/* a second incomplete write - we give up.
|
||||
* guessing the errno... */
|
||||
errno = ENOSPC;
|
||||
}
|
||||
}
|
||||
|
||||
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;
|
||||
uint32_t vertest;
|
||||
unsigned v;
|
||||
|
||||
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;
|
||||
}
|
||||
|
||||
tdb->max_dead_records = (tdb_flags & TDB_VOLATILE) ? 5 : 0;
|
||||
|
||||
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) */
|
||||
}
|
||||
|
||||
/* on exec, don't inherit the fd */
|
||||
v = fcntl(tdb->fd, F_GETFD, 0);
|
||||
fcntl(tdb->fd, F_SETFD, v | FD_CLOEXEC);
|
||||
|
||||
/* 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) &&
|
||||
(!tdb->read_only) &&
|
||||
(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 */
|
||||
}
|
||||
}
|
||||
|
||||
errno = 0;
|
||||
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) {
|
||||
if (errno == 0) {
|
||||
errno = EIO; /* ie bad format or something */
|
||||
}
|
||||
goto fail;
|
||||
}
|
||||
rev = (tdb->flags & TDB_CONVERT);
|
||||
}
|
||||
vp = (unsigned char *)&tdb->header.version;
|
||||
vertest = (((uint32_t)vp[0]) << 24) | (((uint32_t)vp[1]) << 16) |
|
||||
(((uint32_t)vp[2]) << 8) | (uint32_t)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_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);
|
||||
errno = save_errno;
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Set the maximum number of dead records per hash chain
|
||||
*/
|
||||
|
||||
void tdb_set_max_dead(struct tdb_context *tdb, int max_dead)
|
||||
{
|
||||
tdb->max_dead_records = max_dead;
|
||||
}
|
||||
|
||||
/**
|
||||
* 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->lockrecs);
|
||||
|
||||
/* 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_ctx)
|
||||
{
|
||||
tdb->log = *log_ctx;
|
||||
}
|
||||
|
||||
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;
|
||||
}
|
@ -1,802 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "tdb_private.h"
|
||||
|
||||
TDB_DATA tdb_null;
|
||||
|
||||
/*
|
||||
non-blocking increment of the tdb sequence number if the tdb has been opened using
|
||||
the TDB_SEQNUM flag
|
||||
*/
|
||||
void tdb_increment_seqnum_nonblock(struct tdb_context *tdb)
|
||||
{
|
||||
tdb_off_t seqnum=0;
|
||||
|
||||
if (!(tdb->flags & TDB_SEQNUM)) {
|
||||
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);
|
||||
}
|
||||
|
||||
/*
|
||||
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)
|
||||
{
|
||||
if (!(tdb->flags & TDB_SEQNUM)) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (tdb_brlock(tdb, TDB_SEQNUM_OFS, F_WRLCK, F_SETLKW, 1, 1) != 0) {
|
||||
return;
|
||||
}
|
||||
|
||||
tdb_increment_seqnum_nonblock(tdb);
|
||||
|
||||
tdb_brlock(tdb, TDB_SEQNUM_OFS, F_UNLCK, F_SETLKW, 1, 1);
|
||||
}
|
||||
|
||||
static int tdb_key_compare(TDB_DATA key, TDB_DATA data, void *private_data)
|
||||
{
|
||||
return memcmp(data.dptr, key.dptr, data.dsize);
|
||||
}
|
||||
|
||||
/* 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, uint32_t 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
|
||||
&& tdb_parse_data(tdb, key, rec_ptr + sizeof(*r),
|
||||
r->key_len, tdb_key_compare,
|
||||
NULL) == 0) {
|
||||
return rec_ptr;
|
||||
}
|
||||
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, uint32_t hash, int locktype,
|
||||
struct list_struct *rec)
|
||||
{
|
||||
uint32_t 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, uint32_t 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;
|
||||
uint32_t 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;
|
||||
}
|
||||
|
||||
/*
|
||||
* Find an entry in the database and hand the record's data to a parsing
|
||||
* function. The parsing function is executed under the chain read lock, so it
|
||||
* should be fast and should not block on other syscalls.
|
||||
*
|
||||
* DONT CALL OTHER TDB CALLS FROM THE PARSER, THIS MIGHT LEAD TO SEGFAULTS.
|
||||
*
|
||||
* For mmapped tdb's that do not have a transaction open it points the parsing
|
||||
* function directly at the mmap area, it avoids the malloc/memcpy in this
|
||||
* case. If a transaction is open or no mmap is available, it has to do
|
||||
* malloc/read/parse/free.
|
||||
*
|
||||
* This is interesting for all readers of potentially large data structures in
|
||||
* the tdb records, ldb indexes being one example.
|
||||
*/
|
||||
|
||||
int tdb_parse_record(struct tdb_context *tdb, TDB_DATA key,
|
||||
int (*parser)(TDB_DATA key, TDB_DATA data,
|
||||
void *private_data),
|
||||
void *private_data)
|
||||
{
|
||||
tdb_off_t rec_ptr;
|
||||
struct list_struct rec;
|
||||
int ret;
|
||||
uint32_t 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_ERRCODE(TDB_ERR_NOEXIST, 0);
|
||||
}
|
||||
|
||||
ret = tdb_parse_data(tdb, key, rec_ptr + sizeof(rec) + rec.key_len,
|
||||
rec.data_len, parser, private_data);
|
||||
|
||||
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, uint32_t 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)
|
||||
{
|
||||
uint32_t 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->traverse_write != 0) && (!TDB_DEAD(rec))) ||
|
||||
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;
|
||||
}
|
||||
|
||||
static int tdb_count_dead(struct tdb_context *tdb, uint32_t hash)
|
||||
{
|
||||
int res = 0;
|
||||
tdb_off_t rec_ptr;
|
||||
struct list_struct rec;
|
||||
|
||||
/* read in the hash top */
|
||||
if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1)
|
||||
return 0;
|
||||
|
||||
while (rec_ptr) {
|
||||
if (tdb_rec_read(tdb, rec_ptr, &rec) == -1)
|
||||
return 0;
|
||||
|
||||
if (rec.magic == TDB_DEAD_MAGIC) {
|
||||
res += 1;
|
||||
}
|
||||
rec_ptr = rec.next;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
/*
|
||||
* Purge all DEAD records from a hash chain
|
||||
*/
|
||||
static int tdb_purge_dead(struct tdb_context *tdb, uint32_t hash)
|
||||
{
|
||||
int res = -1;
|
||||
struct list_struct rec;
|
||||
tdb_off_t rec_ptr;
|
||||
|
||||
if (tdb_lock(tdb, -1, F_WRLCK) == -1) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* read in the hash top */
|
||||
if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1)
|
||||
goto fail;
|
||||
|
||||
while (rec_ptr) {
|
||||
tdb_off_t next;
|
||||
|
||||
if (tdb_rec_read(tdb, rec_ptr, &rec) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
|
||||
next = rec.next;
|
||||
|
||||
if (rec.magic == TDB_DEAD_MAGIC
|
||||
&& tdb_do_delete(tdb, rec_ptr, &rec) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
rec_ptr = next;
|
||||
}
|
||||
res = 0;
|
||||
fail:
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
return res;
|
||||
}
|
||||
|
||||
/* delete an entry in the database given a key */
|
||||
static int tdb_delete_hash(struct tdb_context *tdb, TDB_DATA key, uint32_t hash)
|
||||
{
|
||||
tdb_off_t rec_ptr;
|
||||
struct list_struct rec;
|
||||
int ret;
|
||||
|
||||
if (tdb->max_dead_records != 0) {
|
||||
|
||||
/*
|
||||
* Allow for some dead records per hash chain, mainly for
|
||||
* tdb's with a very high create/delete rate like locking.tdb.
|
||||
*/
|
||||
|
||||
if (tdb_lock(tdb, BUCKET(hash), F_WRLCK) == -1)
|
||||
return -1;
|
||||
|
||||
if (tdb_count_dead(tdb, hash) >= tdb->max_dead_records) {
|
||||
/*
|
||||
* Don't let the per-chain freelist grow too large,
|
||||
* delete all existing dead records
|
||||
*/
|
||||
tdb_purge_dead(tdb, hash);
|
||||
}
|
||||
|
||||
if (!(rec_ptr = tdb_find(tdb, key, hash, &rec))) {
|
||||
tdb_unlock(tdb, BUCKET(hash), F_WRLCK);
|
||||
return -1;
|
||||
}
|
||||
|
||||
/*
|
||||
* Just mark the record as dead.
|
||||
*/
|
||||
rec.magic = TDB_DEAD_MAGIC;
|
||||
ret = tdb_rec_write(tdb, rec_ptr, &rec);
|
||||
}
|
||||
else {
|
||||
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)
|
||||
{
|
||||
uint32_t hash = tdb->hash_fn(&key);
|
||||
return tdb_delete_hash(tdb, key, hash);
|
||||
}
|
||||
|
||||
/*
|
||||
* See if we have a dead record around with enough space
|
||||
*/
|
||||
static tdb_off_t tdb_find_dead(struct tdb_context *tdb, uint32_t hash,
|
||||
struct list_struct *r, tdb_len_t length)
|
||||
{
|
||||
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) && r->rec_len >= length) {
|
||||
/*
|
||||
* First fit for simple coding, TODO: change to best
|
||||
* fit
|
||||
*/
|
||||
return rec_ptr;
|
||||
}
|
||||
rec_ptr = r->next;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* 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;
|
||||
uint32_t hash;
|
||||
tdb_off_t rec_ptr;
|
||||
char *p = NULL;
|
||||
int ret = -1;
|
||||
|
||||
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 done;
|
||||
}
|
||||
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);
|
||||
|
||||
if (tdb->max_dead_records != 0) {
|
||||
/*
|
||||
* Allow for some dead records per hash chain, look if we can
|
||||
* find one that can hold the new record. We need enough space
|
||||
* for key, data and tailer. If we find one, we don't have to
|
||||
* consult the central freelist.
|
||||
*/
|
||||
rec_ptr = tdb_find_dead(
|
||||
tdb, hash, &rec,
|
||||
key.dsize + dbuf.dsize + sizeof(tdb_off_t));
|
||||
|
||||
if (rec_ptr != 0) {
|
||||
rec.key_len = key.dsize;
|
||||
rec.data_len = dbuf.dsize;
|
||||
rec.full_hash = hash;
|
||||
rec.magic = TDB_MAGIC;
|
||||
if (tdb_rec_write(tdb, rec_ptr, &rec) == -1
|
||||
|| tdb->methods->tdb_write(
|
||||
tdb, rec_ptr + sizeof(rec),
|
||||
p, key.dsize + dbuf.dsize) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
goto done;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* We have to allocate some space from the freelist, so this means we
|
||||
* have to lock it. Use the chance to purge all the DEAD records from
|
||||
* the hash chain under the freelist lock.
|
||||
*/
|
||||
|
||||
if (tdb_lock(tdb, -1, F_WRLCK) == -1) {
|
||||
goto fail;
|
||||
}
|
||||
|
||||
if ((tdb->max_dead_records != 0)
|
||||
&& (tdb_purge_dead(tdb, hash) == -1)) {
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
goto fail;
|
||||
}
|
||||
|
||||
/* we have to allocate some space */
|
||||
rec_ptr = tdb_allocate(tdb, key.dsize + dbuf.dsize, &rec);
|
||||
|
||||
tdb_unlock(tdb, -1, F_WRLCK);
|
||||
|
||||
if (rec_ptr == 0) {
|
||||
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;
|
||||
}
|
||||
|
||||
done:
|
||||
ret = 0;
|
||||
fail:
|
||||
if (ret == 0) {
|
||||
tdb_increment_seqnum(tdb);
|
||||
}
|
||||
|
||||
SAFE_FREE(p);
|
||||
tdb_unlock(tdb, BUCKET(hash), F_WRLCK);
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
/* Append to an entry. Create if not exist. */
|
||||
int tdb_append(struct tdb_context *tdb, TDB_DATA key, TDB_DATA new_dbuf)
|
||||
{
|
||||
uint32_t 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 = (unsigned char *)malloc(new_dbuf.dsize);
|
||||
} else {
|
||||
unsigned char *new_dptr = (unsigned char *)realloc(dbuf.dptr,
|
||||
dbuf.dsize + new_dbuf.dsize);
|
||||
if (new_dptr == NULL) {
|
||||
free(dbuf.dptr);
|
||||
}
|
||||
dbuf.dptr = new_dptr;
|
||||
}
|
||||
|
||||
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;
|
||||
}
|
||||
|
||||
void tdb_add_flags(struct tdb_context *tdb, unsigned flags)
|
||||
{
|
||||
tdb->flags |= flags;
|
||||
}
|
||||
|
||||
void tdb_remove_flags(struct tdb_context *tdb, unsigned flags)
|
||||
{
|
||||
tdb->flags &= ~flags;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
enable sequence number handling on an open tdb
|
||||
*/
|
||||
void tdb_enable_seqnum(struct tdb_context *tdb)
|
||||
{
|
||||
tdb->flags |= TDB_SEQNUM;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
add a region of the file to the freelist. Length is the size of the region in bytes,
|
||||
which includes the free list header that needs to be added
|
||||
*/
|
||||
static int tdb_free_region(struct tdb_context *tdb, tdb_off_t offset, ssize_t length)
|
||||
{
|
||||
struct list_struct rec;
|
||||
if (length <= sizeof(rec)) {
|
||||
/* the region is not worth adding */
|
||||
return 0;
|
||||
}
|
||||
if (length + offset > tdb->map_size) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_free_region: adding region beyond end of file\n"));
|
||||
return -1;
|
||||
}
|
||||
memset(&rec,'\0',sizeof(rec));
|
||||
rec.rec_len = length - sizeof(rec);
|
||||
if (tdb_free(tdb, offset, &rec) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_free_region: failed to add free record\n"));
|
||||
return -1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
wipe the entire database, deleting all records. This can be done
|
||||
very fast by using a global lock. The entire data portion of the
|
||||
file becomes a single entry in the freelist.
|
||||
|
||||
This code carefully steps around the recovery area, leaving it alone
|
||||
*/
|
||||
int tdb_wipe_all(struct tdb_context *tdb)
|
||||
{
|
||||
int i;
|
||||
tdb_off_t offset = 0;
|
||||
ssize_t data_len;
|
||||
tdb_off_t recovery_head;
|
||||
tdb_len_t recovery_size = 0;
|
||||
|
||||
if (tdb_lockall(tdb) != 0) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* see if the tdb has a recovery area, and remember its size
|
||||
if so. We don't want to lose this as otherwise each
|
||||
tdb_wipe_all() in a transaction will increase the size of
|
||||
the tdb by the size of the recovery area */
|
||||
if (tdb_ofs_read(tdb, TDB_RECOVERY_HEAD, &recovery_head) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_wipe_all: failed to read recovery head\n"));
|
||||
goto failed;
|
||||
}
|
||||
|
||||
if (recovery_head != 0) {
|
||||
struct list_struct rec;
|
||||
if (tdb->methods->tdb_read(tdb, recovery_head, &rec, sizeof(rec), DOCONV()) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_wipe_all: failed to read recovery record\n"));
|
||||
return -1;
|
||||
}
|
||||
recovery_size = rec.rec_len + sizeof(rec);
|
||||
}
|
||||
|
||||
/* wipe the hashes */
|
||||
for (i=0;i<tdb->header.hash_size;i++) {
|
||||
if (tdb_ofs_write(tdb, TDB_HASH_TOP(i), &offset) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_wipe_all: failed to write hash %d\n", i));
|
||||
goto failed;
|
||||
}
|
||||
}
|
||||
|
||||
/* wipe the freelist */
|
||||
if (tdb_ofs_write(tdb, FREELIST_TOP, &offset) == -1) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_wipe_all: failed to write freelist\n"));
|
||||
goto failed;
|
||||
}
|
||||
|
||||
/* add all the rest of the file to the freelist, possibly leaving a gap
|
||||
for the recovery area */
|
||||
if (recovery_size == 0) {
|
||||
/* the simple case - the whole file can be used as a freelist */
|
||||
data_len = (tdb->map_size - TDB_DATA_START(tdb->header.hash_size));
|
||||
if (tdb_free_region(tdb, TDB_DATA_START(tdb->header.hash_size), data_len) != 0) {
|
||||
goto failed;
|
||||
}
|
||||
} else {
|
||||
/* we need to add two freelist entries - one on either
|
||||
side of the recovery area
|
||||
|
||||
Note that we cannot shift the recovery area during
|
||||
this operation. Only the transaction.c code may
|
||||
move the recovery area or we risk subtle data
|
||||
corruption
|
||||
*/
|
||||
data_len = (recovery_head - TDB_DATA_START(tdb->header.hash_size));
|
||||
if (tdb_free_region(tdb, TDB_DATA_START(tdb->header.hash_size), data_len) != 0) {
|
||||
goto failed;
|
||||
}
|
||||
/* and the 2nd free list entry after the recovery area - if any */
|
||||
data_len = tdb->map_size - (recovery_head+recovery_size);
|
||||
if (tdb_free_region(tdb, recovery_head+recovery_size, data_len) != 0) {
|
||||
goto failed;
|
||||
}
|
||||
}
|
||||
|
||||
if (tdb_unlockall(tdb) != 0) {
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_wipe_all: failed to unlock\n"));
|
||||
goto failed;
|
||||
}
|
||||
|
||||
return 0;
|
||||
|
||||
failed:
|
||||
tdb_unlockall(tdb);
|
||||
return -1;
|
||||
}
|
@ -1,213 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/time.h"
|
||||
#include "system/shmem.h"
|
||||
#include "system/select.h"
|
||||
#include "system/wait.h"
|
||||
#include "tdb.h"
|
||||
|
||||
#ifndef HAVE_GETPAGESIZE
|
||||
#define getpagesize() 0x2000
|
||||
#endif
|
||||
|
||||
typedef uint32_t tdb_len_t;
|
||||
typedef uint32_t 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 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) + sizeof(tdb_off_t))
|
||||
#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 */
|
||||
uint32_t full_hash; /* the full 32 bit hash of the key */
|
||||
uint32_t magic; /* try to catch errors */
|
||||
/* the following union is implied:
|
||||
union {
|
||||
char record[rec_len];
|
||||
struct {
|
||||
char key[key_len];
|
||||
char data[data_len];
|
||||
}
|
||||
uint32_t totalsize; (tailer)
|
||||
}
|
||||
*/
|
||||
};
|
||||
|
||||
|
||||
/* this is stored at the front of every database */
|
||||
struct tdb_header {
|
||||
char magic_food[32]; /* for /etc/magic */
|
||||
uint32_t version; /* version of the code */
|
||||
uint32_t 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 {
|
||||
int list;
|
||||
uint32_t count;
|
||||
uint32_t ltype;
|
||||
};
|
||||
|
||||
struct tdb_traverse_lock {
|
||||
struct tdb_traverse_lock *next;
|
||||
uint32_t off;
|
||||
uint32_t 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 *, uint32_t *);
|
||||
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 */
|
||||
int traverse_write; /* read-write traversal */
|
||||
struct tdb_lock_type global_lock;
|
||||
int num_lockrecs;
|
||||
struct tdb_lock_type *lockrecs; /* only real locks, all with count>0 */
|
||||
enum TDB_ERROR ecode; /* error code for last tdb error */
|
||||
struct tdb_header header; /* a cached copy of the header */
|
||||
uint32_t 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;
|
||||
int max_dead_records;
|
||||
bool have_transaction_lock;
|
||||
volatile sig_atomic_t *interrupt_sig_ptr;
|
||||
};
|
||||
|
||||
|
||||
/*
|
||||
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_lock_nonblock(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_transaction_lock(struct tdb_context *tdb, int ltype);
|
||||
int tdb_transaction_unlock(struct tdb_context *tdb);
|
||||
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, uint32_t 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);
|
||||
int tdb_parse_data(struct tdb_context *tdb, TDB_DATA key,
|
||||
tdb_off_t offset, tdb_len_t len,
|
||||
int (*parser)(TDB_DATA key, TDB_DATA data,
|
||||
void *private_data),
|
||||
void *private_data);
|
||||
tdb_off_t tdb_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, uint32_t 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);
|
||||
int tdb_rec_free_read(struct tdb_context *tdb, tdb_off_t off,
|
||||
struct list_struct *rec);
|
||||
|
||||
|
File diff suppressed because it is too large
Load Diff
@ -1,348 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#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;
|
||||
bool in_transaction = (tdb->transaction != NULL);
|
||||
|
||||
/* we need to get a read lock on the transaction lock here to
|
||||
cope with the lock ordering semantics of solaris10 */
|
||||
if (!in_transaction) {
|
||||
if (tdb_transaction_lock(tdb, F_RDLCK)) {
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
tdb->traverse_read++;
|
||||
ret = tdb_traverse_internal(tdb, fn, private_data, &tl);
|
||||
tdb->traverse_read--;
|
||||
|
||||
if (!in_transaction) {
|
||||
tdb_transaction_unlock(tdb);
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
/*
|
||||
a write style traverse - needs to get the transaction lock to
|
||||
prevent deadlocks
|
||||
|
||||
WARNING: The data buffer given to the callback fn does NOT meet the
|
||||
alignment restrictions malloc gives you.
|
||||
*/
|
||||
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;
|
||||
bool in_transaction = (tdb->transaction != NULL);
|
||||
|
||||
if (tdb->read_only || tdb->traverse_read) {
|
||||
return tdb_traverse_read(tdb, fn, private_data);
|
||||
}
|
||||
|
||||
if (!in_transaction) {
|
||||
if (tdb_transaction_lock(tdb, F_WRLCK)) {
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
tdb->traverse_write++;
|
||||
ret = tdb_traverse_internal(tdb, fn, private_data, &tl);
|
||||
tdb->traverse_write--;
|
||||
|
||||
if (!in_transaction) {
|
||||
tdb_transaction_unlock(tdb);
|
||||
}
|
||||
|
||||
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;
|
||||
|
||||
/* Grab first record: locks chain and returned record. */
|
||||
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);
|
||||
|
||||
/* Unlock the hash chain of the record we just read. */
|
||||
if (tdb_unlock(tdb, tdb->travlocks.hash, tdb->travlocks.lock_rw) != 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)
|
||||
{
|
||||
uint32_t 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,tdb->travlocks.lock_rw))
|
||||
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, tdb->travlocks.lock_rw) != 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), tdb->travlocks.lock_rw, &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, tdb->travlocks.lock_rw) != 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), tdb->travlocks.lock_rw) != 0)
|
||||
TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_nextkey: WARNING tdb_unlock failed!\n"));
|
||||
return key;
|
||||
}
|
||||
|
1464
source4/lib/tdb/config.guess
vendored
1464
source4/lib/tdb/config.guess
vendored
File diff suppressed because it is too large
Load Diff
@ -1,57 +0,0 @@
|
||||
################################################
|
||||
# Start SUBSYSTEM LIBTDB
|
||||
[LIBRARY::LIBTDB]
|
||||
OUTPUT_TYPE = STATIC_LIBRARY
|
||||
CFLAGS = -Ilib/tdb/include
|
||||
#
|
||||
# End SUBSYSTEM ldb
|
||||
################################################
|
||||
|
||||
LIBTDB_OBJ_FILES = $(addprefix lib/tdb/common/, \
|
||||
tdb.o dump.o io.o lock.o \
|
||||
open.o traverse.o freelist.o \
|
||||
error.o transaction.o)
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbtool
|
||||
[BINARY::tdbtool]
|
||||
INSTALLDIR = BINDIR
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbtool
|
||||
################################################
|
||||
|
||||
tdbtool_OBJ_FILES = lib/tdb/tools/tdbtool.o
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbtorture
|
||||
[BINARY::tdbtorture]
|
||||
INSTALLDIR = BINDIR
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbtorture
|
||||
################################################
|
||||
|
||||
tdbtorture_OBJ_FILES = lib/tdb/tools/tdbtorture.o
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbdump
|
||||
[BINARY::tdbdump]
|
||||
INSTALLDIR = BINDIR
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbdump
|
||||
################################################
|
||||
|
||||
tdbdump_OBJ_FILES = lib/tdb/tools/tdbdump.o
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbbackup
|
||||
[BINARY::tdbbackup]
|
||||
INSTALLDIR = BINDIR
|
||||
PRIVATE_DEPENDENCIES = \
|
||||
LIBTDB
|
||||
# End BINARY tdbbackup
|
||||
################################################
|
||||
|
||||
tdbbackup_OBJ_FILES = lib/tdb/tools/tdbbackup.o
|
1577
source4/lib/tdb/config.sub
vendored
1577
source4/lib/tdb/config.sub
vendored
File diff suppressed because it is too large
Load Diff
@ -1,30 +0,0 @@
|
||||
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(tdb, 1.1.2)
|
||||
AC_CONFIG_SRCDIR([common/tdb.c])
|
||||
AC_CONFIG_HEADER(include/config.h)
|
||||
AC_LIBREPLACE_ALL_CHECKS
|
||||
AC_LD_SONAMEFLAG
|
||||
AC_LD_PICFLAG
|
||||
AC_LD_SHLIBEXT
|
||||
AC_LIBREPLACE_SHLD
|
||||
AC_LIBREPLACE_SHLD_FLAGS
|
||||
AC_LIBREPLACE_RUNTIME_LIB_PATH_VAR
|
||||
m4_include(libtdb.m4)
|
||||
AC_PATH_PROGS([PYTHON_CONFIG], [python2.6-config python2.5-config python2.4-config python-config])
|
||||
AC_PATH_PROGS([PYTHON], [python2.6 python2.5 python2.4 python])
|
||||
|
||||
PYTHON_BUILD_TARGET="build-python"
|
||||
PYTHON_INSTALL_TARGET="install-python"
|
||||
PYTHON_CHECK_TARGET="check-python"
|
||||
AC_SUBST(PYTHON_BUILD_TARGET)
|
||||
AC_SUBST(PYTHON_INSTALL_TARGET)
|
||||
AC_SUBST(PYTHON_CHECK_TARGET)
|
||||
if test -z "$PYTHON_CONFIG"; then
|
||||
PYTHON_BUILD_TARGET=""
|
||||
PYTHON_INSTALL_TARGET=""
|
||||
PYTHON_CHECK_TARGET=""
|
||||
fi
|
||||
AC_OUTPUT(Makefile tdb.pc)
|
@ -1,238 +0,0 @@
|
||||
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.
|
||||
|
||||
WARNING: The data buffer given to the callback fn does NOT meet the
|
||||
alignment restrictions malloc gives you.
|
||||
|
||||
----------------------------------------------------------------------
|
||||
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.
|
||||
|
@ -1,10 +0,0 @@
|
||||
# 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
|
@ -1,167 +0,0 @@
|
||||
#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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
|
||||
/* flags to tdb_store() */
|
||||
#define TDB_REPLACE 1 /* Unused */
|
||||
#define TDB_INSERT 2 /* Don't overwrite an existing entry */
|
||||
#define TDB_MODIFY 3 /* Don't create an existing entry */
|
||||
|
||||
/* 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_VOLATILE 256 /* Activate the per-hashchain freelist, default 5 */
|
||||
|
||||
#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);
|
||||
void tdb_set_max_dead(struct tdb_context *tdb, int max_dead);
|
||||
|
||||
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_ctx);
|
||||
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_parse_record(struct tdb_context *tdb, TDB_DATA key,
|
||||
int (*parser)(TDB_DATA key, TDB_DATA data,
|
||||
void *private_data),
|
||||
void *private_data);
|
||||
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_lockall_nonblock(struct tdb_context *tdb);
|
||||
int tdb_unlockall(struct tdb_context *tdb);
|
||||
int tdb_lockall_read(struct tdb_context *tdb);
|
||||
int tdb_lockall_read_nonblock(struct tdb_context *tdb);
|
||||
int tdb_unlockall_read(struct tdb_context *tdb);
|
||||
int tdb_lockall_mark(struct tdb_context *tdb);
|
||||
int tdb_lockall_unmark(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);
|
||||
void tdb_add_flags(struct tdb_context *tdb, unsigned flag);
|
||||
void tdb_remove_flags(struct tdb_context *tdb, unsigned flag);
|
||||
void tdb_enable_seqnum(struct tdb_context *tdb);
|
||||
void tdb_increment_seqnum_nonblock(struct tdb_context *tdb);
|
||||
|
||||
/* Low level locking functions: use with care */
|
||||
int tdb_chainlock(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_chainlock_nonblock(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);
|
||||
int tdb_chainlock_mark(struct tdb_context *tdb, TDB_DATA key);
|
||||
int tdb_chainlock_unmark(struct tdb_context *tdb, TDB_DATA key);
|
||||
|
||||
void tdb_setalarm_sigptr(struct tdb_context *tdb, volatile sig_atomic_t *sigptr);
|
||||
|
||||
/* 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);
|
||||
int tdb_wipe_all(struct tdb_context *tdb);
|
||||
int tdb_freelist_size(struct tdb_context *tdb);
|
||||
|
||||
extern TDB_DATA tdb_null;
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* tdb.h */
|
@ -1,238 +0,0 @@
|
||||
#! /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
|
@ -1,30 +0,0 @@
|
||||
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
|
||||
TDB_OBJ="common/tdb.o common/dump.o common/transaction.o common/error.o common/traverse.o"
|
||||
TDB_OBJ="$TDB_OBJ common/freelist.o common/freelistcheck.o common/io.o common/lock.o common/open.o"
|
||||
AC_SUBST(TDB_OBJ)
|
||||
AC_SUBST(LIBREPLACEOBJ)
|
||||
|
||||
TDB_LIBS=""
|
||||
AC_SUBST(TDB_LIBS)
|
||||
|
||||
TDB_CFLAGS="-I$tdbdir/include"
|
||||
AC_SUBST(TDB_CFLAGS)
|
||||
|
||||
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>])
|
@ -1,10 +0,0 @@
|
||||
[PYTHON::swig_tdb]
|
||||
LIBRARY_REALNAME = _tdb.$(SHLIBEXT)
|
||||
PUBLIC_DEPENDENCIES = LIBTDB DYNCONFIG
|
||||
|
||||
swig_tdb_OBJ_FILES = $(tdbsrcdir)/tdb_wrap.o
|
||||
|
||||
$(eval $(call python_py_module_template,tdb.py,$(tdbsrcdir)/tdb.py))
|
||||
|
||||
$(swig_tdb_OBJ_FILES): CFLAGS+=$(CFLAG_NO_UNUSED_MACROS) $(CFLAG_NO_CAST_QUAL)
|
||||
|
@ -1,12 +0,0 @@
|
||||
#!/usr/bin/python
|
||||
# Trivial reimplementation of tdbdump in Python
|
||||
|
||||
import tdb, sys
|
||||
|
||||
if len(sys.argv) < 2:
|
||||
print "Usage: tdbdump.py <tdb-file>"
|
||||
sys.exit(1)
|
||||
|
||||
db = tdb.Tdb(sys.argv[1])
|
||||
for (k, v) in db.iteritems():
|
||||
print "{\nkey(%d) = %r\ndata(%d) = %r\n}" % (len(k), k, len(v), v)
|
@ -1,152 +0,0 @@
|
||||
#!/usr/bin/python
|
||||
# Some simple tests for the Python bindings for TDB
|
||||
# Note that this tests the interface of the Python bindings
|
||||
# It does not test tdb itself.
|
||||
#
|
||||
# Copyright (C) 2007-2008 Jelmer Vernooij <jelmer@samba.org>
|
||||
# Published under the GNU LGPLv3 or later
|
||||
|
||||
import tdb
|
||||
from unittest import TestCase
|
||||
import os, tempfile
|
||||
|
||||
|
||||
class OpenTdbTests(TestCase):
|
||||
def test_nonexistant_read(self):
|
||||
self.assertRaises(IOError, tdb.Tdb, "/some/nonexistant/file", 0, tdb.DEFAULT, os.O_RDWR)
|
||||
|
||||
|
||||
class SimpleTdbTests(TestCase):
|
||||
def setUp(self):
|
||||
super(SimpleTdbTests, self).setUp()
|
||||
self.tdb = tdb.Tdb(tempfile.mkstemp()[1], 0, tdb.DEFAULT, os.O_CREAT|os.O_RDWR)
|
||||
self.assertNotEqual(None, self.tdb)
|
||||
|
||||
def tearDown(self):
|
||||
del self.tdb
|
||||
|
||||
def test_repr(self):
|
||||
self.assertTrue(repr(self.tdb).startswith("Tdb('"))
|
||||
|
||||
def test_lockall(self):
|
||||
self.tdb.lock_all()
|
||||
|
||||
def test_max_dead(self):
|
||||
self.tdb.max_dead = 20
|
||||
|
||||
def test_unlockall(self):
|
||||
self.tdb.lock_all()
|
||||
self.tdb.unlock_all()
|
||||
|
||||
def test_lockall_read(self):
|
||||
self.tdb.read_lock_all()
|
||||
self.tdb.read_unlock_all()
|
||||
|
||||
def test_reopen(self):
|
||||
self.tdb.reopen()
|
||||
|
||||
def test_store(self):
|
||||
self.tdb.store("bar", "bla")
|
||||
self.assertEquals("bla", self.tdb.get("bar"))
|
||||
|
||||
def test_getitem(self):
|
||||
self.tdb["bar"] = "foo"
|
||||
self.tdb.reopen()
|
||||
self.assertEquals("foo", self.tdb["bar"])
|
||||
|
||||
def test_delete(self):
|
||||
self.tdb["bar"] = "foo"
|
||||
del self.tdb["bar"]
|
||||
self.assertRaises(KeyError, lambda: self.tdb["bar"])
|
||||
|
||||
def test_contains(self):
|
||||
self.tdb["bla"] = "bloe"
|
||||
self.assertTrue("bla" in self.tdb)
|
||||
|
||||
def test_keyerror(self):
|
||||
self.assertRaises(KeyError, lambda: self.tdb["bla"])
|
||||
|
||||
def test_hash_size(self):
|
||||
self.tdb.hash_size
|
||||
|
||||
def test_map_size(self):
|
||||
self.tdb.map_size
|
||||
|
||||
def test_name(self):
|
||||
self.tdb.name
|
||||
|
||||
def test_iterator(self):
|
||||
self.tdb["bla"] = "1"
|
||||
self.tdb["brainslug"] = "2"
|
||||
self.assertEquals(["bla", "brainslug"], list(self.tdb))
|
||||
|
||||
def test_items(self):
|
||||
self.tdb["bla"] = "1"
|
||||
self.tdb["brainslug"] = "2"
|
||||
self.assertEquals([("bla", "1"), ("brainslug", "2")], self.tdb.items())
|
||||
|
||||
def test_iteritems(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb["bla"] = "25"
|
||||
i = self.tdb.iteritems()
|
||||
self.assertEquals(set([("bla", "25"), ("bloe", "2")]),
|
||||
set([i.next(), i.next()]))
|
||||
|
||||
def test_transaction_cancel(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb.transaction_start()
|
||||
self.tdb["bloe"] = "1"
|
||||
self.tdb.transaction_cancel()
|
||||
self.assertEquals("2", self.tdb["bloe"])
|
||||
|
||||
def test_transaction_commit(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb.transaction_start()
|
||||
self.tdb["bloe"] = "1"
|
||||
self.tdb.transaction_commit()
|
||||
self.assertEquals("1", self.tdb["bloe"])
|
||||
|
||||
def test_iterator(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb["bla"] = "hoi"
|
||||
i = iter(self.tdb)
|
||||
self.assertEquals(set(["bloe", "bla"]), set([i.next(), i.next()]))
|
||||
|
||||
def test_keys(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb["bla"] = "25"
|
||||
self.assertEquals(["bla", "bloe"], self.tdb.keys())
|
||||
|
||||
def test_iterkeys(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb["bla"] = "25"
|
||||
i = self.tdb.iterkeys()
|
||||
self.assertEquals(set(["bloe", "bla"]), set([i.next(), i.next()]))
|
||||
|
||||
def test_values(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb["bla"] = "25"
|
||||
self.assertEquals(["25", "2"], self.tdb.values())
|
||||
|
||||
def test_itervalues(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb["bla"] = "25"
|
||||
i = self.tdb.itervalues()
|
||||
self.assertEquals(set(["25", "2"]), set([i.next(), i.next()]))
|
||||
|
||||
def test_clear(self):
|
||||
self.tdb["bloe"] = "2"
|
||||
self.tdb["bla"] = "25"
|
||||
self.assertEquals(2, len(self.tdb))
|
||||
self.tdb.clear()
|
||||
self.assertEquals(0, len(self.tdb))
|
||||
|
||||
def test_len(self):
|
||||
self.assertEquals(0, len(self.tdb))
|
||||
self.tdb["entry"] = "value"
|
||||
self.assertEquals(1, len(self.tdb))
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
import unittest
|
||||
unittest.TestProgram()
|
@ -1,21 +0,0 @@
|
||||
.SUFFIXES: .i _wrap.c
|
||||
|
||||
.i_wrap.c:
|
||||
$(SWIG) -O -Wall -python -keyword $<
|
||||
|
||||
showflags::
|
||||
@echo 'tdb will be compiled with flags:'
|
||||
@echo ' CFLAGS = $(CFLAGS)'
|
||||
@echo ' CPPFLAGS = $(CPPFLAGS)'
|
||||
@echo ' LDFLAGS = $(LDFLAGS)'
|
||||
@echo ' LIBS = $(LIBS)'
|
||||
|
||||
.SUFFIXES: .c .o
|
||||
|
||||
.c.o:
|
||||
@echo Compiling $*.c
|
||||
@mkdir -p `dirname $@`
|
||||
@$(CC) $(PICFLAG) $(CFLAGS) -c $< -o $@
|
||||
|
||||
distclean::
|
||||
rm -f *~ */*~
|
@ -1,323 +0,0 @@
|
||||
/*
|
||||
Unix SMB/CIFS implementation.
|
||||
|
||||
Swig interface to tdb.
|
||||
|
||||
Copyright (C) 2004-2006 Tim Potter <tpot@samba.org>
|
||||
Copyright (C) 2007 Jelmer Vernooij <jelmer@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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
%define DOCSTRING
|
||||
"TDB is a simple key-value database similar to GDBM that supports multiple writers."
|
||||
%enddef
|
||||
|
||||
%module(docstring=DOCSTRING) 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
|
||||
|
||||
/* Include tdb headers */
|
||||
#include <stdint.h>
|
||||
#include <signal.h>
|
||||
#include <tdb.h>
|
||||
#include <fcntl.h>
|
||||
|
||||
typedef TDB_CONTEXT tdb;
|
||||
%}
|
||||
|
||||
/* The tdb functions will crash if a NULL tdb context is passed */
|
||||
|
||||
%import exception.i
|
||||
%import stdint.i
|
||||
|
||||
%typemap(check,noblock=1) 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,noblock=1) TDB_DATA {
|
||||
if ($input == Py_None) {
|
||||
$1.dsize = 0;
|
||||
$1.dptr = NULL;
|
||||
} else if (!PyString_Check($input)) {
|
||||
PyErr_SetString(PyExc_TypeError, "string arg expected");
|
||||
return NULL;
|
||||
} else {
|
||||
$1.dsize = PyString_Size($input);
|
||||
$1.dptr = (uint8_t *)PyString_AsString($input);
|
||||
}
|
||||
}
|
||||
|
||||
%typemap(out,noblock=1) TDB_DATA {
|
||||
if ($1.dptr == NULL && $1.dsize == 0) {
|
||||
$result = Py_None;
|
||||
} else {
|
||||
$result = PyString_FromStringAndSize((const char *)$1.dptr, $1.dsize);
|
||||
free($1.dptr);
|
||||
}
|
||||
}
|
||||
|
||||
/* Treat a mode_t as an unsigned integer */
|
||||
typedef int mode_t;
|
||||
|
||||
/* flags to tdb_store() */
|
||||
%constant int REPLACE = TDB_REPLACE;
|
||||
%constant int INSERT = TDB_INSERT;
|
||||
%constant int MODIFY = TDB_MODIFY;
|
||||
|
||||
/* flags for tdb_open() */
|
||||
%constant int DEFAULT = TDB_DEFAULT;
|
||||
%constant int CLEAR_IF_FIRST = TDB_CLEAR_IF_FIRST;
|
||||
%constant int INTERNAL = TDB_INTERNAL;
|
||||
%constant int NOLOCK = TDB_NOLOCK;
|
||||
%constant int NOMMAP = TDB_NOMMAP;
|
||||
%constant int CONVERT = TDB_CONVERT;
|
||||
%constant int BIGENDIAN = TDB_BIGENDIAN;
|
||||
|
||||
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
|
||||
};
|
||||
|
||||
%rename(lock_all) tdb_context::lockall;
|
||||
%rename(unlock_all) tdb_context::unlockall;
|
||||
|
||||
%rename(read_lock_all) tdb_context::lockall_read;
|
||||
%rename(read_unlock_all) tdb_context::unlockall_read;
|
||||
|
||||
%typemap(default,noblock=1) int tdb_flags {
|
||||
$1 = TDB_DEFAULT;
|
||||
}
|
||||
|
||||
%typemap(default,noblock=1) int flags {
|
||||
$1 = O_RDWR;
|
||||
}
|
||||
|
||||
%typemap(default,noblock=1) int hash_size {
|
||||
$1 = 0;
|
||||
}
|
||||
|
||||
%typemap(default,noblock=1) mode_t mode {
|
||||
$1 = 0600;
|
||||
}
|
||||
|
||||
%typemap(default,noblock=1) int flag {
|
||||
$1 = TDB_REPLACE;
|
||||
}
|
||||
|
||||
%rename(Tdb) tdb_context;
|
||||
%feature("docstring") tdb_context "A TDB file.";
|
||||
%typemap(out,noblock=1) tdb * {
|
||||
/* Throw an IOError exception from errno if tdb_open() returns NULL */
|
||||
if ($1 == NULL) {
|
||||
PyErr_SetFromErrno(PyExc_IOError);
|
||||
SWIG_fail;
|
||||
}
|
||||
$result = SWIG_NewPointerObj($1, $1_descriptor, 0);
|
||||
}
|
||||
|
||||
typedef struct tdb_context {
|
||||
%extend {
|
||||
%feature("docstring") tdb "S.__init__(name,hash_size=0,tdb_flags=TDB_DEFAULT,flags=O_RDWR,mode=0600)\n"
|
||||
"Open a TDB file.";
|
||||
tdb(const char *name, int hash_size, int tdb_flags, int flags, mode_t mode) {
|
||||
return tdb_open(name, hash_size, tdb_flags, flags, mode);
|
||||
}
|
||||
%feature("docstring") error "S.error() -> int\n"
|
||||
"Find last error number returned by operation on this TDB.";
|
||||
enum TDB_ERROR error();
|
||||
~tdb() { tdb_close($self); }
|
||||
%feature("docstring") close "S.close() -> None\n"
|
||||
"Close the TDB file.";
|
||||
int close();
|
||||
int append(TDB_DATA key, TDB_DATA new_dbuf);
|
||||
%feature("docstring") errorstr "S.errorstr() -> errorstring\n"
|
||||
"Obtain last error message.";
|
||||
const char *errorstr();
|
||||
%rename(get) fetch;
|
||||
%feature("docstring") fetch "S.fetch(key) -> value\n"
|
||||
"Fetch a value.";
|
||||
TDB_DATA fetch(TDB_DATA key);
|
||||
%feature("docstring") delete "S.delete(key) -> None\n"
|
||||
"Delete an entry.";
|
||||
int delete(TDB_DATA key);
|
||||
%feature("docstring") store "S.store(key, value, flag=TDB_REPLACE) -> None\n"
|
||||
"Store an entry.";
|
||||
int store(TDB_DATA key, TDB_DATA dbuf, int flag);
|
||||
%feature("docstring") exists "S.exists(key) -> bool\n"
|
||||
"Check whether key exists in this database.";
|
||||
int exists(TDB_DATA key);
|
||||
%feature("docstring") firstkey "S.firstkey() -> data\n"
|
||||
"Return the first key in this database.";
|
||||
TDB_DATA firstkey();
|
||||
%feature("docstring") nextkey "S.nextkey(prev) -> data\n"
|
||||
"Return the next key in this database.";
|
||||
TDB_DATA nextkey(TDB_DATA key);
|
||||
%feature("docstring") lockall "S.lockall() -> bool";
|
||||
int lockall();
|
||||
%feature("docstring") unlockall "S.unlockall() -> bool";
|
||||
int unlockall();
|
||||
%feature("docstring") unlockall "S.lockall_read() -> bool";
|
||||
int lockall_read();
|
||||
%feature("docstring") unlockall "S.unlockall_read() -> bool";
|
||||
int unlockall_read();
|
||||
%feature("docstring") reopen "S.reopen() -> bool\n"
|
||||
"Reopen this file.";
|
||||
int reopen();
|
||||
%feature("docstring") transaction_start "S.transaction_start() -> None\n"
|
||||
"Start a new transaction.";
|
||||
int transaction_start();
|
||||
%feature("docstring") transaction_commit "S.transaction_commit() -> None\n"
|
||||
"Commit the currently active transaction.";
|
||||
int transaction_commit();
|
||||
%feature("docstring") transaction_cancel "S.transaction_cancel() -> None\n"
|
||||
"Cancel the currently active transaction.";
|
||||
int transaction_cancel();
|
||||
int transaction_recover();
|
||||
%feature("docstring") hash_size "S.hash_size() -> int";
|
||||
int hash_size();
|
||||
%feature("docstring") map_size "S.map_size() -> int";
|
||||
size_t map_size();
|
||||
%feature("docstring") get_flags "S.get_flags() -> int";
|
||||
int get_flags();
|
||||
%feature("docstring") set_max_dead "S.set_max_dead(int) -> None";
|
||||
void set_max_dead(int max_dead);
|
||||
%feature("docstring") name "S.name() -> path\n" \
|
||||
"Return filename of this TDB file.";
|
||||
const char *name();
|
||||
}
|
||||
|
||||
%pythoncode {
|
||||
def __repr__(self):
|
||||
return "Tdb('%s')" % self.name()
|
||||
|
||||
# Random access to keys, values
|
||||
def __getitem__(self, key):
|
||||
result = self.get(key)
|
||||
if result is None:
|
||||
raise KeyError, '%s: %s' % (key, self.errorstr())
|
||||
return result
|
||||
|
||||
def __setitem__(self, key, item):
|
||||
if self.store(key, item) == -1:
|
||||
raise IOError, self.errorstr()
|
||||
|
||||
def __delitem__(self, key):
|
||||
if not self.exists(key):
|
||||
raise KeyError, '%s: %s' % (key, self.errorstr())
|
||||
self.delete(key)
|
||||
|
||||
def __contains__(self, key):
|
||||
return self.exists(key) != 0
|
||||
|
||||
def has_key(self, key):
|
||||
return self.exists(key) != 0
|
||||
|
||||
def fetch_uint32(self, key):
|
||||
data = self.get(key)
|
||||
if data is None:
|
||||
return None
|
||||
import struct
|
||||
return struct.unpack("<L", data)[0]
|
||||
|
||||
def fetch_int32(self, key):
|
||||
data = self.get(key)
|
||||
if data is None:
|
||||
return None
|
||||
import struct
|
||||
return struct.unpack("<l", data)[0]
|
||||
|
||||
# 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 = self.tdb.firstkey()
|
||||
if self.key is None:
|
||||
raise StopIteration
|
||||
return self.key
|
||||
else:
|
||||
self.key = self.tdb.nextkey(self.key)
|
||||
if self.key is None:
|
||||
raise StopIteration
|
||||
return self.key
|
||||
|
||||
def __iter__(self):
|
||||
return self.TdbIterator(self)
|
||||
|
||||
# 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])
|
||||
|
||||
def iterkeys(self):
|
||||
for k in iter(self):
|
||||
yield k
|
||||
|
||||
def itervalues(self):
|
||||
for k in iter(self):
|
||||
yield self[k]
|
||||
|
||||
def iteritems(self):
|
||||
for k in iter(self):
|
||||
yield (k, self[k])
|
||||
|
||||
# TODO: any other missing methods for container types
|
||||
}
|
||||
} tdb;
|
@ -1,86 +0,0 @@
|
||||
dirs::
|
||||
@mkdir -p bin common tools
|
||||
|
||||
PROGS = bin/tdbtool$(EXEEXT) bin/tdbdump$(EXEEXT) bin/tdbbackup$(EXEEXT)
|
||||
PROGS_NOINSTALL = bin/tdbtest$(EXEEXT) bin/tdbtorture$(EXEEXT)
|
||||
ALL_PROGS = $(PROGS) $(PROGS_NOINSTALL)
|
||||
|
||||
TDB_SONAME = libtdb.$(SHLIBEXT).1
|
||||
TDB_SOLIB = libtdb.$(SHLIBEXT).$(PACKAGE_VERSION)
|
||||
|
||||
TDB_LIB = libtdb.a
|
||||
|
||||
bin/tdbtest$(EXEEXT): tools/tdbtest.o $(TDB_LIB)
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbtest tools/tdbtest.o -L. -ltdb -lgdbm
|
||||
|
||||
bin/tdbtool$(EXEEXT): tools/tdbtool.o $(TDB_LIB)
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbtool tools/tdbtool.o -L. -ltdb
|
||||
|
||||
bin/tdbtorture$(EXEEXT): tools/tdbtorture.o $(TDB_LIB)
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbtorture tools/tdbtorture.o -L. -ltdb
|
||||
|
||||
bin/tdbdump$(EXEEXT): tools/tdbdump.o $(TDB_LIB)
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbdump tools/tdbdump.o -L. -ltdb
|
||||
|
||||
bin/tdbbackup$(EXEEXT): tools/tdbbackup.o $(TDB_LIB)
|
||||
$(CC) $(CFLAGS) $(LDFLAGS) -o bin/tdbbackup tools/tdbbackup.o -L. -ltdb
|
||||
|
||||
test:: bin/tdbtorture$(EXEEXT) $(TDB_SONAME)
|
||||
$(LIB_PATH_VAR)=. bin/tdbtorture$(EXEEXT)
|
||||
|
||||
clean::
|
||||
rm -f test.db test.tdb torture.tdb test.gdbm
|
||||
rm -f $(TDB_SONAME) $(TDB_SOLIB) libtdb.a libtdb.$(SHLIBEXT)
|
||||
rm -f $(ALL_PROGS) tdb.pc
|
||||
|
||||
build-python:: _tdb.$(SHLIBEXT)
|
||||
|
||||
tdb_wrap.o: $(tdbdir)/tdb_wrap.c
|
||||
$(CC) $(PICFLAG) -c $(tdbdir)/tdb_wrap.c $(CFLAGS) `$(PYTHON_CONFIG) --cflags`
|
||||
|
||||
_tdb.$(SHLIBEXT): libtdb.$(SHLIBEXT) tdb_wrap.o
|
||||
$(SHLD) $(SHLD_FLAGS) -o $@ tdb_wrap.o -L. -ltdb `$(PYTHON_CONFIG) --ldflags`
|
||||
|
||||
install:: installdirs installbin installheaders installlibs \
|
||||
$(PYTHON_INSTALL_TARGET)
|
||||
|
||||
install-python:: build-python
|
||||
mkdir -p $(DESTDIR)`$(PYTHON) -c "import distutils.sysconfig; print distutils.sysconfig.get_python_lib(0, prefix='$(prefix)')"` \
|
||||
$(DESTDIR)`$(PYTHON) -c "import distutils.sysconfig; print distutils.sysconfig.get_python_lib(1, prefix='$(prefix)')"`
|
||||
cp $(tdbdir)/tdb.py $(DESTDIR)`$(PYTHON) -c "import distutils.sysconfig; print distutils.sysconfig.get_python_lib(0, prefix='$(prefix)')"`
|
||||
cp _tdb.$(SHLIBEXT) $(DESTDIR)`$(PYTHON) -c "import distutils.sysconfig; print distutils.sysconfig.get_python_lib(1, prefix='$(prefix)')"`
|
||||
|
||||
check-python:: build-python $(TDB_SONAME)
|
||||
$(LIB_PATH_VAR)=. PYTHONPATH=".:$(tdbdir)" $(PYTHON) $(tdbdir)/python/tests/simple.py
|
||||
|
||||
install-swig::
|
||||
mkdir -p $(DESTDIR)`$(SWIG) -swiglib`
|
||||
cp tdb.i $(DESTDIR)`$(SWIG) -swiglib`
|
||||
|
||||
clean::
|
||||
rm -f _tdb.$(SHLIBEXT)
|
||||
|
||||
installdirs::
|
||||
mkdir -p $(DESTDIR)$(bindir)
|
||||
mkdir -p $(DESTDIR)$(includedir)
|
||||
mkdir -p $(DESTDIR)$(libdir)
|
||||
mkdir -p $(DESTDIR)$(libdir)/pkgconfig
|
||||
|
||||
installbin:: all installdirs
|
||||
cp $(PROGS) $(DESTDIR)$(bindir)
|
||||
|
||||
installheaders:: installdirs
|
||||
cp $(srcdir)/include/tdb.h $(DESTDIR)$(includedir)
|
||||
|
||||
installlibs:: all installdirs
|
||||
cp tdb.pc $(DESTDIR)$(libdir)/pkgconfig
|
||||
cp libtdb.a $(TDB_SOLIB) $(DESTDIR)$(libdir)
|
||||
|
||||
libtdb.a: $(TDB_OBJ)
|
||||
ar -rv libtdb.a $(TDB_OBJ)
|
||||
|
||||
libtdb.$(SHLIBEXT): $(TDB_SOLIB)
|
||||
ln -fs $< $@
|
||||
|
||||
$(TDB_SONAME): $(TDB_SOLIB)
|
||||
ln -fs $< $@
|
@ -1,11 +0,0 @@
|
||||
prefix=@prefix@
|
||||
exec_prefix=@exec_prefix@
|
||||
libdir=@libdir@
|
||||
includedir=@includedir@
|
||||
|
||||
Name: tdb
|
||||
Description: A trivial database
|
||||
Version: @PACKAGE_VERSION@
|
||||
Libs: -L${libdir} -ltdb
|
||||
Cflags: -I${includedir}
|
||||
URL: http://tdb.samba.org/
|
@ -1,341 +0,0 @@
|
||||
# This file was automatically generated by SWIG (http://www.swig.org).
|
||||
# Version 1.3.35
|
||||
#
|
||||
# Don't modify this file, modify the SWIG interface instead.
|
||||
|
||||
"""
|
||||
TDB is a simple key-value database similar to GDBM that supports multiple writers.
|
||||
"""
|
||||
|
||||
import _tdb
|
||||
import new
|
||||
new_instancemethod = new.instancemethod
|
||||
try:
|
||||
_swig_property = property
|
||||
except NameError:
|
||||
pass # Python < 2.2 doesn't have 'property'.
|
||||
def _swig_setattr_nondynamic(self,class_type,name,value,static=1):
|
||||
if (name == "thisown"): return self.this.own(value)
|
||||
if (name == "this"):
|
||||
if type(value).__name__ == 'PySwigObject':
|
||||
self.__dict__[name] = value
|
||||
return
|
||||
method = class_type.__swig_setmethods__.get(name,None)
|
||||
if method: return method(self,value)
|
||||
if (not static) or hasattr(self,name):
|
||||
self.__dict__[name] = value
|
||||
else:
|
||||
raise AttributeError("You cannot add attributes to %s" % self)
|
||||
|
||||
def _swig_setattr(self,class_type,name,value):
|
||||
return _swig_setattr_nondynamic(self,class_type,name,value,0)
|
||||
|
||||
def _swig_getattr(self,class_type,name):
|
||||
if (name == "thisown"): return self.this.own()
|
||||
method = class_type.__swig_getmethods__.get(name,None)
|
||||
if method: return method(self)
|
||||
raise AttributeError,name
|
||||
|
||||
def _swig_repr(self):
|
||||
try: strthis = "proxy of " + self.this.__repr__()
|
||||
except: strthis = ""
|
||||
return "<%s.%s; %s >" % (self.__class__.__module__, self.__class__.__name__, strthis,)
|
||||
|
||||
import types
|
||||
try:
|
||||
_object = types.ObjectType
|
||||
_newclass = 1
|
||||
except AttributeError:
|
||||
class _object : pass
|
||||
_newclass = 0
|
||||
del types
|
||||
|
||||
|
||||
def _swig_setattr_nondynamic_method(set):
|
||||
def set_attr(self,name,value):
|
||||
if (name == "thisown"): return self.this.own(value)
|
||||
if hasattr(self,name) or (name == "this"):
|
||||
set(self,name,value)
|
||||
else:
|
||||
raise AttributeError("You cannot add attributes to %s" % self)
|
||||
return set_attr
|
||||
|
||||
|
||||
REPLACE = _tdb.REPLACE
|
||||
INSERT = _tdb.INSERT
|
||||
MODIFY = _tdb.MODIFY
|
||||
DEFAULT = _tdb.DEFAULT
|
||||
CLEAR_IF_FIRST = _tdb.CLEAR_IF_FIRST
|
||||
INTERNAL = _tdb.INTERNAL
|
||||
NOLOCK = _tdb.NOLOCK
|
||||
NOMMAP = _tdb.NOMMAP
|
||||
CONVERT = _tdb.CONVERT
|
||||
BIGENDIAN = _tdb.BIGENDIAN
|
||||
TDB_SUCCESS = _tdb.TDB_SUCCESS
|
||||
TDB_ERR_CORRUPT = _tdb.TDB_ERR_CORRUPT
|
||||
TDB_ERR_IO = _tdb.TDB_ERR_IO
|
||||
TDB_ERR_LOCK = _tdb.TDB_ERR_LOCK
|
||||
TDB_ERR_OOM = _tdb.TDB_ERR_OOM
|
||||
TDB_ERR_EXISTS = _tdb.TDB_ERR_EXISTS
|
||||
TDB_ERR_NOLOCK = _tdb.TDB_ERR_NOLOCK
|
||||
TDB_ERR_LOCK_TIMEOUT = _tdb.TDB_ERR_LOCK_TIMEOUT
|
||||
TDB_ERR_NOEXIST = _tdb.TDB_ERR_NOEXIST
|
||||
TDB_ERR_EINVAL = _tdb.TDB_ERR_EINVAL
|
||||
TDB_ERR_RDONLY = _tdb.TDB_ERR_RDONLY
|
||||
class Tdb(object):
|
||||
"""A TDB file."""
|
||||
thisown = _swig_property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc='The membership flag')
|
||||
__repr__ = _swig_repr
|
||||
def __init__(self, *args, **kwargs):
|
||||
"""
|
||||
S.__init__(name,hash_size=0,tdb_flags=TDB_DEFAULT,flags=O_RDWR,mode=0600)
|
||||
Open a TDB file.
|
||||
"""
|
||||
_tdb.Tdb_swiginit(self,_tdb.new_Tdb(*args, **kwargs))
|
||||
def error(*args, **kwargs):
|
||||
"""
|
||||
S.error() -> int
|
||||
Find last error number returned by operation on this TDB.
|
||||
"""
|
||||
return _tdb.Tdb_error(*args, **kwargs)
|
||||
|
||||
__swig_destroy__ = _tdb.delete_Tdb
|
||||
def close(*args, **kwargs):
|
||||
"""
|
||||
S.close() -> None
|
||||
Close the TDB file.
|
||||
"""
|
||||
return _tdb.Tdb_close(*args, **kwargs)
|
||||
|
||||
def errorstr(*args, **kwargs):
|
||||
"""
|
||||
S.errorstr() -> errorstring
|
||||
Obtain last error message.
|
||||
"""
|
||||
return _tdb.Tdb_errorstr(*args, **kwargs)
|
||||
|
||||
def get(*args, **kwargs):
|
||||
"""
|
||||
S.fetch(key) -> value
|
||||
Fetch a value.
|
||||
"""
|
||||
return _tdb.Tdb_get(*args, **kwargs)
|
||||
|
||||
def delete(*args, **kwargs):
|
||||
"""
|
||||
S.delete(key) -> None
|
||||
Delete an entry.
|
||||
"""
|
||||
return _tdb.Tdb_delete(*args, **kwargs)
|
||||
|
||||
def store(*args, **kwargs):
|
||||
"""
|
||||
S.store(key, value, flag=TDB_REPLACE) -> None
|
||||
Store an entry.
|
||||
"""
|
||||
return _tdb.Tdb_store(*args, **kwargs)
|
||||
|
||||
def exists(*args, **kwargs):
|
||||
"""
|
||||
S.exists(key) -> bool
|
||||
Check whether key exists in this database.
|
||||
"""
|
||||
return _tdb.Tdb_exists(*args, **kwargs)
|
||||
|
||||
def firstkey(*args, **kwargs):
|
||||
"""
|
||||
S.firstkey() -> data
|
||||
Return the first key in this database.
|
||||
"""
|
||||
return _tdb.Tdb_firstkey(*args, **kwargs)
|
||||
|
||||
def nextkey(*args, **kwargs):
|
||||
"""
|
||||
S.nextkey(prev) -> data
|
||||
Return the next key in this database.
|
||||
"""
|
||||
return _tdb.Tdb_nextkey(*args, **kwargs)
|
||||
|
||||
def lock_all(*args, **kwargs):
|
||||
"""S.lockall() -> bool"""
|
||||
return _tdb.Tdb_lock_all(*args, **kwargs)
|
||||
|
||||
def unlock_all(*args, **kwargs):
|
||||
"""S.unlockall() -> bool"""
|
||||
return _tdb.Tdb_unlock_all(*args, **kwargs)
|
||||
|
||||
def reopen(*args, **kwargs):
|
||||
"""
|
||||
S.reopen() -> bool
|
||||
Reopen this file.
|
||||
"""
|
||||
return _tdb.Tdb_reopen(*args, **kwargs)
|
||||
|
||||
def transaction_start(*args, **kwargs):
|
||||
"""
|
||||
S.transaction_start() -> None
|
||||
Start a new transaction.
|
||||
"""
|
||||
return _tdb.Tdb_transaction_start(*args, **kwargs)
|
||||
|
||||
def transaction_commit(*args, **kwargs):
|
||||
"""
|
||||
S.transaction_commit() -> None
|
||||
Commit the currently active transaction.
|
||||
"""
|
||||
return _tdb.Tdb_transaction_commit(*args, **kwargs)
|
||||
|
||||
def transaction_cancel(*args, **kwargs):
|
||||
"""
|
||||
S.transaction_cancel() -> None
|
||||
Cancel the currently active transaction.
|
||||
"""
|
||||
return _tdb.Tdb_transaction_cancel(*args, **kwargs)
|
||||
|
||||
def hash_size(*args, **kwargs):
|
||||
"""S.hash_size() -> int"""
|
||||
return _tdb.Tdb_hash_size(*args, **kwargs)
|
||||
|
||||
def map_size(*args, **kwargs):
|
||||
"""S.map_size() -> int"""
|
||||
return _tdb.Tdb_map_size(*args, **kwargs)
|
||||
|
||||
def get_flags(*args, **kwargs):
|
||||
"""S.get_flags() -> int"""
|
||||
return _tdb.Tdb_get_flags(*args, **kwargs)
|
||||
|
||||
def set_max_dead(*args, **kwargs):
|
||||
"""S.set_max_dead(int) -> None"""
|
||||
return _tdb.Tdb_set_max_dead(*args, **kwargs)
|
||||
|
||||
def name(*args, **kwargs):
|
||||
"""
|
||||
S.name() -> path
|
||||
Return filename of this TDB file.
|
||||
"""
|
||||
return _tdb.Tdb_name(*args, **kwargs)
|
||||
|
||||
def __repr__(self):
|
||||
return "Tdb('%s')" % self.name()
|
||||
|
||||
|
||||
def __getitem__(self, key):
|
||||
result = self.get(key)
|
||||
if result is None:
|
||||
raise KeyError, '%s: %s' % (key, self.errorstr())
|
||||
return result
|
||||
|
||||
def __setitem__(self, key, item):
|
||||
if self.store(key, item) == -1:
|
||||
raise IOError, self.errorstr()
|
||||
|
||||
def __delitem__(self, key):
|
||||
if not self.exists(key):
|
||||
raise KeyError, '%s: %s' % (key, self.errorstr())
|
||||
self.delete(key)
|
||||
|
||||
def __contains__(self, key):
|
||||
return self.exists(key) != 0
|
||||
|
||||
def has_key(self, key):
|
||||
return self.exists(key) != 0
|
||||
|
||||
def fetch_uint32(self, key):
|
||||
data = self.get(key)
|
||||
if data is None:
|
||||
return None
|
||||
import struct
|
||||
return struct.unpack("<L", data)[0]
|
||||
|
||||
def fetch_int32(self, key):
|
||||
data = self.get(key)
|
||||
if data is None:
|
||||
return None
|
||||
import struct
|
||||
return struct.unpack("<l", data)[0]
|
||||
|
||||
|
||||
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 = self.tdb.firstkey()
|
||||
if self.key is None:
|
||||
raise StopIteration
|
||||
return self.key
|
||||
else:
|
||||
self.key = self.tdb.nextkey(self.key)
|
||||
if self.key is None:
|
||||
raise StopIteration
|
||||
return self.key
|
||||
|
||||
def __iter__(self):
|
||||
return self.TdbIterator(self)
|
||||
|
||||
|
||||
|
||||
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])
|
||||
|
||||
def iterkeys(self):
|
||||
for k in iter(self):
|
||||
yield k
|
||||
|
||||
def itervalues(self):
|
||||
for k in iter(self):
|
||||
yield self[k]
|
||||
|
||||
def iteritems(self):
|
||||
for k in iter(self):
|
||||
yield (k, self[k])
|
||||
|
||||
|
||||
|
||||
Tdb.error = new_instancemethod(_tdb.Tdb_error,None,Tdb)
|
||||
Tdb.close = new_instancemethod(_tdb.Tdb_close,None,Tdb)
|
||||
Tdb.append = new_instancemethod(_tdb.Tdb_append,None,Tdb)
|
||||
Tdb.errorstr = new_instancemethod(_tdb.Tdb_errorstr,None,Tdb)
|
||||
Tdb.get = new_instancemethod(_tdb.Tdb_get,None,Tdb)
|
||||
Tdb.delete = new_instancemethod(_tdb.Tdb_delete,None,Tdb)
|
||||
Tdb.store = new_instancemethod(_tdb.Tdb_store,None,Tdb)
|
||||
Tdb.exists = new_instancemethod(_tdb.Tdb_exists,None,Tdb)
|
||||
Tdb.firstkey = new_instancemethod(_tdb.Tdb_firstkey,None,Tdb)
|
||||
Tdb.nextkey = new_instancemethod(_tdb.Tdb_nextkey,None,Tdb)
|
||||
Tdb.lock_all = new_instancemethod(_tdb.Tdb_lock_all,None,Tdb)
|
||||
Tdb.unlock_all = new_instancemethod(_tdb.Tdb_unlock_all,None,Tdb)
|
||||
Tdb.read_lock_all = new_instancemethod(_tdb.Tdb_read_lock_all,None,Tdb)
|
||||
Tdb.read_unlock_all = new_instancemethod(_tdb.Tdb_read_unlock_all,None,Tdb)
|
||||
Tdb.reopen = new_instancemethod(_tdb.Tdb_reopen,None,Tdb)
|
||||
Tdb.transaction_start = new_instancemethod(_tdb.Tdb_transaction_start,None,Tdb)
|
||||
Tdb.transaction_commit = new_instancemethod(_tdb.Tdb_transaction_commit,None,Tdb)
|
||||
Tdb.transaction_cancel = new_instancemethod(_tdb.Tdb_transaction_cancel,None,Tdb)
|
||||
Tdb.transaction_recover = new_instancemethod(_tdb.Tdb_transaction_recover,None,Tdb)
|
||||
Tdb.hash_size = new_instancemethod(_tdb.Tdb_hash_size,None,Tdb)
|
||||
Tdb.map_size = new_instancemethod(_tdb.Tdb_map_size,None,Tdb)
|
||||
Tdb.get_flags = new_instancemethod(_tdb.Tdb_get_flags,None,Tdb)
|
||||
Tdb.set_max_dead = new_instancemethod(_tdb.Tdb_set_max_dead,None,Tdb)
|
||||
Tdb.name = new_instancemethod(_tdb.Tdb_name,None,Tdb)
|
||||
Tdb_swigregister = _tdb.Tdb_swigregister
|
||||
Tdb_swigregister(Tdb)
|
||||
|
||||
|
||||
|
File diff suppressed because it is too large
Load Diff
@ -1,300 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
/*
|
||||
|
||||
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 "system/locale.h"
|
||||
#include "system/time.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
#include "tdb.h"
|
||||
|
||||
#ifdef HAVE_GETOPT_H
|
||||
#include <getopt.h>
|
||||
#endif
|
||||
|
||||
static int failed;
|
||||
|
||||
static char *add_suffix(const char *name, const char *suffix)
|
||||
{
|
||||
char *ret;
|
||||
int len = strlen(name) + strlen(suffix) + 1;
|
||||
ret = (char *)malloc(len);
|
||||
if (!ret) {
|
||||
fprintf(stderr,"Out of memory!\n");
|
||||
exit(1);
|
||||
}
|
||||
snprintf(ret, len, "%s%s", name, suffix);
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int copy_fn(TDB_CONTEXT *tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
TDB_CONTEXT *tdb_new = (TDB_CONTEXT *)state;
|
||||
|
||||
if (tdb_store(tdb_new, key, dbuf, TDB_INSERT) != 0) {
|
||||
fprintf(stderr,"Failed to insert into %s\n", tdb_name(tdb_new));
|
||||
failed = 1;
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
static int test_fn(TDB_CONTEXT *tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
carefully backup a tdb, validating the contents and
|
||||
only doing the backup if its OK
|
||||
this function is also used for restore
|
||||
*/
|
||||
static int backup_tdb(const char *old_name, const char *new_name, int hash_size)
|
||||
{
|
||||
TDB_CONTEXT *tdb;
|
||||
TDB_CONTEXT *tdb_new;
|
||||
char *tmp_name;
|
||||
struct stat st;
|
||||
int count1, count2;
|
||||
|
||||
tmp_name = add_suffix(new_name, ".tmp");
|
||||
|
||||
/* stat the old tdb to find its permissions */
|
||||
if (stat(old_name, &st) != 0) {
|
||||
perror(old_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
/* open the old tdb */
|
||||
tdb = tdb_open(old_name, 0, 0, O_RDWR, 0);
|
||||
if (!tdb) {
|
||||
printf("Failed to open %s\n", old_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
/* create the new tdb */
|
||||
unlink(tmp_name);
|
||||
tdb_new = tdb_open(tmp_name,
|
||||
hash_size ? hash_size : tdb_hash_size(tdb),
|
||||
TDB_DEFAULT, O_RDWR|O_CREAT|O_EXCL,
|
||||
st.st_mode & 0777);
|
||||
if (!tdb_new) {
|
||||
perror(tmp_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
/* lock the old tdb */
|
||||
if (tdb_lockall(tdb) != 0) {
|
||||
fprintf(stderr,"Failed to lock %s\n", old_name);
|
||||
tdb_close(tdb);
|
||||
tdb_close(tdb_new);
|
||||
unlink(tmp_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
failed = 0;
|
||||
|
||||
/* traverse and copy */
|
||||
count1 = tdb_traverse(tdb, copy_fn, (void *)tdb_new);
|
||||
if (count1 < 0 || failed) {
|
||||
fprintf(stderr,"failed to copy %s\n", old_name);
|
||||
tdb_close(tdb);
|
||||
tdb_close(tdb_new);
|
||||
unlink(tmp_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
/* close the old tdb */
|
||||
tdb_close(tdb);
|
||||
|
||||
/* close the new tdb and re-open read-only */
|
||||
tdb_close(tdb_new);
|
||||
tdb_new = tdb_open(tmp_name, 0, TDB_DEFAULT, O_RDONLY, 0);
|
||||
if (!tdb_new) {
|
||||
fprintf(stderr,"failed to reopen %s\n", tmp_name);
|
||||
unlink(tmp_name);
|
||||
perror(tmp_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
/* traverse the new tdb to confirm */
|
||||
count2 = tdb_traverse(tdb_new, test_fn, NULL);
|
||||
if (count2 != count1) {
|
||||
fprintf(stderr,"failed to copy %s\n", old_name);
|
||||
tdb_close(tdb_new);
|
||||
unlink(tmp_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
/* make sure the new tdb has reached stable storage */
|
||||
fsync(tdb_fd(tdb_new));
|
||||
|
||||
/* close the new tdb and rename it to .bak */
|
||||
tdb_close(tdb_new);
|
||||
if (rename(tmp_name, new_name) != 0) {
|
||||
perror(new_name);
|
||||
free(tmp_name);
|
||||
return 1;
|
||||
}
|
||||
|
||||
free(tmp_name);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
verify a tdb and if it is corrupt then restore from *.bak
|
||||
*/
|
||||
static int verify_tdb(const char *fname, const char *bak_name)
|
||||
{
|
||||
TDB_CONTEXT *tdb;
|
||||
int count = -1;
|
||||
|
||||
/* open the tdb */
|
||||
tdb = tdb_open(fname, 0, 0, O_RDONLY, 0);
|
||||
|
||||
/* traverse the tdb, then close it */
|
||||
if (tdb) {
|
||||
count = tdb_traverse(tdb, test_fn, NULL);
|
||||
tdb_close(tdb);
|
||||
}
|
||||
|
||||
/* count is < 0 means an error */
|
||||
if (count < 0) {
|
||||
printf("restoring %s\n", fname);
|
||||
return backup_tdb(bak_name, fname, 0);
|
||||
}
|
||||
|
||||
printf("%s : %d records\n", fname, count);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
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");
|
||||
printf(" -n hashsize set the new hash size for the backup\n");
|
||||
}
|
||||
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
int i;
|
||||
int ret = 0;
|
||||
int c;
|
||||
int verify = 0;
|
||||
int hashsize = 0;
|
||||
const char *suffix = ".bak";
|
||||
|
||||
while ((c = getopt(argc, argv, "vhs:n:")) != -1) {
|
||||
switch (c) {
|
||||
case 'h':
|
||||
usage();
|
||||
exit(0);
|
||||
case 'v':
|
||||
verify = 1;
|
||||
break;
|
||||
case 's':
|
||||
suffix = optarg;
|
||||
break;
|
||||
case 'n':
|
||||
hashsize = atoi(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, hashsize) != 0) {
|
||||
ret = 1;
|
||||
}
|
||||
}
|
||||
|
||||
free(bak_name);
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
@ -1,116 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "system/locale.h"
|
||||
#include "system/time.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
#include "tdb.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(TDB_CONTEXT *tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
printf("{\n");
|
||||
printf("key(%d) = \"", (int)key.dsize);
|
||||
print_data(key);
|
||||
printf("\"\n");
|
||||
printf("data(%d) = \"", (int)dbuf.dsize);
|
||||
print_data(dbuf);
|
||||
printf("\"\n");
|
||||
printf("}\n");
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int dump_tdb(const char *fname, const char *keyname)
|
||||
{
|
||||
TDB_CONTEXT *tdb;
|
||||
TDB_DATA key, value;
|
||||
|
||||
tdb = tdb_open(fname, 0, 0, O_RDONLY, 0);
|
||||
if (!tdb) {
|
||||
printf("Failed to open %s\n", fname);
|
||||
return 1;
|
||||
}
|
||||
|
||||
if (!keyname) {
|
||||
tdb_traverse(tdb, traverse_fn, NULL);
|
||||
} else {
|
||||
key.dptr = discard_const_p(uint8_t,keyname);
|
||||
key.dsize = strlen( keyname);
|
||||
value = tdb_fetch(tdb, key);
|
||||
if (!value.dptr) {
|
||||
return 1;
|
||||
} else {
|
||||
print_data(value);
|
||||
free(value.dptr);
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void usage( void)
|
||||
{
|
||||
printf( "Usage: tdbdump [options] <filename>\n\n");
|
||||
printf( " -h this help message\n");
|
||||
printf( " -k keyname dumps value of keyname\n");
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
char *fname, *keyname=NULL;
|
||||
int c;
|
||||
|
||||
if (argc < 2) {
|
||||
printf("Usage: tdbdump <fname>\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
while ((c = getopt( argc, argv, "hk:")) != -1) {
|
||||
switch (c) {
|
||||
case 'h':
|
||||
usage();
|
||||
exit( 0);
|
||||
case 'k':
|
||||
keyname = optarg;
|
||||
break;
|
||||
default:
|
||||
usage();
|
||||
exit( 1);
|
||||
}
|
||||
}
|
||||
|
||||
fname = argv[optind];
|
||||
|
||||
return dump_tdb(fname, keyname);
|
||||
}
|
@ -1,265 +0,0 @@
|
||||
/* 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;
|
||||
}
|
@ -1,659 +0,0 @@
|
||||
/*
|
||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "system/locale.h"
|
||||
#include "system/time.h"
|
||||
#include "system/filesys.h"
|
||||
#include "system/wait.h"
|
||||
#include "tdb.h"
|
||||
|
||||
static int do_command(void);
|
||||
const char *cmdname;
|
||||
char *arg1, *arg2;
|
||||
size_t arg1len, arg2len;
|
||||
int bIterate = 0;
|
||||
char *line;
|
||||
TDB_DATA iterate_kbuf;
|
||||
char cmdline[1024];
|
||||
static int disable_mmap;
|
||||
|
||||
enum commands {
|
||||
CMD_CREATE_TDB,
|
||||
CMD_OPEN_TDB,
|
||||
CMD_ERASE,
|
||||
CMD_DUMP,
|
||||
CMD_INSERT,
|
||||
CMD_MOVE,
|
||||
CMD_STORE,
|
||||
CMD_SHOW,
|
||||
CMD_KEYS,
|
||||
CMD_HEXKEYS,
|
||||
CMD_DELETE,
|
||||
CMD_LIST_HASH_FREE,
|
||||
CMD_LIST_FREE,
|
||||
CMD_INFO,
|
||||
CMD_MMAP,
|
||||
CMD_SPEED,
|
||||
CMD_FIRST,
|
||||
CMD_NEXT,
|
||||
CMD_SYSTEM,
|
||||
CMD_QUIT,
|
||||
CMD_HELP
|
||||
};
|
||||
|
||||
typedef struct {
|
||||
const char *name;
|
||||
enum commands cmd;
|
||||
} COMMAND_TABLE;
|
||||
|
||||
COMMAND_TABLE cmd_table[] = {
|
||||
{"create", CMD_CREATE_TDB},
|
||||
{"open", CMD_OPEN_TDB},
|
||||
{"erase", CMD_ERASE},
|
||||
{"dump", CMD_DUMP},
|
||||
{"insert", CMD_INSERT},
|
||||
{"move", CMD_MOVE},
|
||||
{"store", CMD_STORE},
|
||||
{"show", CMD_SHOW},
|
||||
{"keys", CMD_KEYS},
|
||||
{"hexkeys", CMD_HEXKEYS},
|
||||
{"delete", CMD_DELETE},
|
||||
{"list", CMD_LIST_HASH_FREE},
|
||||
{"free", CMD_LIST_FREE},
|
||||
{"info", CMD_INFO},
|
||||
{"speed", CMD_SPEED},
|
||||
{"mmap", CMD_MMAP},
|
||||
{"first", CMD_FIRST},
|
||||
{"1", CMD_FIRST},
|
||||
{"next", CMD_NEXT},
|
||||
{"n", CMD_NEXT},
|
||||
{"quit", CMD_QUIT},
|
||||
{"q", CMD_QUIT},
|
||||
{"!", CMD_SYSTEM},
|
||||
{NULL, CMD_HELP}
|
||||
};
|
||||
|
||||
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);
|
||||
}
|
||||
|
||||
/* a tdb tool for manipulating a tdb database */
|
||||
|
||||
static TDB_CONTEXT *tdb;
|
||||
|
||||
static int print_rec(TDB_CONTEXT *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state);
|
||||
static int print_key(TDB_CONTEXT *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state);
|
||||
static int print_hexkey(TDB_CONTEXT *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state);
|
||||
|
||||
static void print_asc(const 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]:'.');
|
||||
}
|
||||
|
||||
static void print_data(const char *buf,int len)
|
||||
{
|
||||
int i=0;
|
||||
if (len<=0) return;
|
||||
printf("[%03X] ",i);
|
||||
for (i=0;i<len;) {
|
||||
printf("%02X ",(int)((unsigned char)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"
|
||||
" keys : dump the database keys as strings\n"
|
||||
" hexkeys : dump the database keys as hex values\n"
|
||||
" info : print summary info about the database\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"
|
||||
" ! command : execute system command\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 void create_tdb(const char *tdbname)
|
||||
{
|
||||
if (tdb) tdb_close(tdb);
|
||||
tdb = tdb_open(tdbname, 0, TDB_CLEAR_IF_FIRST | (disable_mmap?TDB_NOMMAP:0),
|
||||
O_RDWR | O_CREAT | O_TRUNC, 0600);
|
||||
if (!tdb) {
|
||||
printf("Could not create %s: %s\n", tdbname, strerror(errno));
|
||||
}
|
||||
}
|
||||
|
||||
static void open_tdb(const char *tdbname)
|
||||
{
|
||||
if (tdb) tdb_close(tdb);
|
||||
tdb = tdb_open(tdbname, 0, disable_mmap?TDB_NOMMAP:0, O_RDWR, 0600);
|
||||
if (!tdb) {
|
||||
printf("Could not open %s: %s\n", tdbname, strerror(errno));
|
||||
}
|
||||
}
|
||||
|
||||
static void insert_tdb(char *keyname, size_t keylen, char* data, size_t datalen)
|
||||
{
|
||||
TDB_DATA key, dbuf;
|
||||
|
||||
if ((keyname == NULL) || (keylen == 0)) {
|
||||
terror("need key");
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)keyname;
|
||||
key.dsize = keylen;
|
||||
dbuf.dptr = (unsigned char *)data;
|
||||
dbuf.dsize = datalen;
|
||||
|
||||
if (tdb_store(tdb, key, dbuf, TDB_INSERT) == -1) {
|
||||
terror("insert failed");
|
||||
}
|
||||
}
|
||||
|
||||
static void store_tdb(char *keyname, size_t keylen, char* data, size_t datalen)
|
||||
{
|
||||
TDB_DATA key, dbuf;
|
||||
|
||||
if ((keyname == NULL) || (keylen == 0)) {
|
||||
terror("need key");
|
||||
return;
|
||||
}
|
||||
|
||||
if ((data == NULL) || (datalen == 0)) {
|
||||
terror("need data");
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)keyname;
|
||||
key.dsize = keylen;
|
||||
dbuf.dptr = (unsigned char *)data;
|
||||
dbuf.dsize = datalen;
|
||||
|
||||
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(char *keyname, size_t keylen)
|
||||
{
|
||||
TDB_DATA key, dbuf;
|
||||
|
||||
if ((keyname == NULL) || (keylen == 0)) {
|
||||
terror("need key");
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)keyname;
|
||||
key.dsize = keylen;
|
||||
|
||||
dbuf = tdb_fetch(tdb, key);
|
||||
if (!dbuf.dptr) {
|
||||
terror("fetch failed");
|
||||
return;
|
||||
}
|
||||
|
||||
print_rec(tdb, key, dbuf, NULL);
|
||||
|
||||
free( dbuf.dptr );
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
static void delete_tdb(char *keyname, size_t keylen)
|
||||
{
|
||||
TDB_DATA key;
|
||||
|
||||
if ((keyname == NULL) || (keylen == 0)) {
|
||||
terror("need key");
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)keyname;
|
||||
key.dsize = keylen;
|
||||
|
||||
if (tdb_delete(tdb, key) != 0) {
|
||||
terror("delete failed");
|
||||
}
|
||||
}
|
||||
|
||||
static void move_rec(char *keyname, size_t keylen, char* tdbname)
|
||||
{
|
||||
TDB_DATA key, dbuf;
|
||||
TDB_CONTEXT *dst_tdb;
|
||||
|
||||
if ((keyname == NULL) || (keylen == 0)) {
|
||||
terror("need key");
|
||||
return;
|
||||
}
|
||||
|
||||
if ( !tdbname ) {
|
||||
terror("need destination tdb name");
|
||||
return;
|
||||
}
|
||||
|
||||
key.dptr = (unsigned char *)keyname;
|
||||
key.dsize = keylen;
|
||||
|
||||
dbuf = tdb_fetch(tdb, key);
|
||||
if (!dbuf.dptr) {
|
||||
terror("fetch failed");
|
||||
return;
|
||||
}
|
||||
|
||||
print_rec(tdb, key, dbuf, NULL);
|
||||
|
||||
dst_tdb = tdb_open(tdbname, 0, 0, O_RDWR, 0600);
|
||||
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(TDB_CONTEXT *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
printf("\nkey %d bytes\n", (int)key.dsize);
|
||||
print_asc((const char *)key.dptr, key.dsize);
|
||||
printf("\ndata %d bytes\n", (int)dbuf.dsize);
|
||||
print_data((const char *)dbuf.dptr, dbuf.dsize);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int print_key(TDB_CONTEXT *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
printf("key %d bytes: ", (int)key.dsize);
|
||||
print_asc((const char *)key.dptr, key.dsize);
|
||||
printf("\n");
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int print_hexkey(TDB_CONTEXT *the_tdb, TDB_DATA key, TDB_DATA dbuf, void *state)
|
||||
{
|
||||
printf("key %d bytes\n", (int)key.dsize);
|
||||
print_data((const char *)key.dptr, key.dsize);
|
||||
printf("\n");
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int total_bytes;
|
||||
|
||||
static int traverse_fn(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 void speed_tdb(const char *tlimit)
|
||||
{
|
||||
unsigned timelimit = tlimit?atoi(tlimit):0;
|
||||
double t;
|
||||
int ops=0;
|
||||
if (timelimit == 0) timelimit = 10;
|
||||
printf("Testing traverse speed for %u seconds\n", timelimit);
|
||||
_start_timer();
|
||||
while ((t=_end_timer()) < timelimit) {
|
||||
tdb_traverse(tdb, traverse_fn, NULL);
|
||||
printf("%10.3f ops/sec\r", (++ops)/t);
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
static void toggle_mmap(void)
|
||||
{
|
||||
disable_mmap = !disable_mmap;
|
||||
if (disable_mmap) {
|
||||
printf("mmap is disabled\n");
|
||||
} else {
|
||||
printf("mmap is enabled\n");
|
||||
}
|
||||
}
|
||||
|
||||
static char *tdb_getline(const char *prompt)
|
||||
{
|
||||
static char thisline[1024];
|
||||
char *p;
|
||||
fputs(prompt, stdout);
|
||||
thisline[0] = 0;
|
||||
p = fgets(thisline, sizeof(thisline)-1, stdin);
|
||||
if (p) p = strchr(p, '\n');
|
||||
if (p) *p = 0;
|
||||
return p?thisline:NULL;
|
||||
}
|
||||
|
||||
static int do_delete_fn(TDB_CONTEXT *the_tdb, TDB_DATA key, TDB_DATA dbuf,
|
||||
void *state)
|
||||
{
|
||||
return tdb_delete(the_tdb, key);
|
||||
}
|
||||
|
||||
static void first_record(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 {
|
||||
print_rec(the_tdb, *pkey, dbuf, NULL);
|
||||
}
|
||||
}
|
||||
|
||||
static void next_record(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
|
||||
print_rec(the_tdb, *pkey, dbuf, NULL);
|
||||
}
|
||||
|
||||
static int do_command(void)
|
||||
{
|
||||
COMMAND_TABLE *ctp = cmd_table;
|
||||
enum commands mycmd = CMD_HELP;
|
||||
int cmd_len;
|
||||
|
||||
if (cmdname && strlen(cmdname) == 0) {
|
||||
mycmd = CMD_NEXT;
|
||||
} else {
|
||||
while (ctp->name) {
|
||||
cmd_len = strlen(ctp->name);
|
||||
if (strncmp(ctp->name,cmdname,cmd_len) == 0) {
|
||||
mycmd = ctp->cmd;
|
||||
break;
|
||||
}
|
||||
ctp++;
|
||||
}
|
||||
}
|
||||
|
||||
switch (mycmd) {
|
||||
case CMD_CREATE_TDB:
|
||||
bIterate = 0;
|
||||
create_tdb(arg1);
|
||||
return 0;
|
||||
case CMD_OPEN_TDB:
|
||||
bIterate = 0;
|
||||
open_tdb(arg1);
|
||||
return 0;
|
||||
case CMD_SYSTEM:
|
||||
/* Shell command */
|
||||
system(arg1);
|
||||
return 0;
|
||||
case CMD_QUIT:
|
||||
return 1;
|
||||
default:
|
||||
/* all the rest require a open database */
|
||||
if (!tdb) {
|
||||
bIterate = 0;
|
||||
terror("database not open");
|
||||
help();
|
||||
return 0;
|
||||
}
|
||||
switch (mycmd) {
|
||||
case CMD_ERASE:
|
||||
bIterate = 0;
|
||||
tdb_traverse(tdb, do_delete_fn, NULL);
|
||||
return 0;
|
||||
case CMD_DUMP:
|
||||
bIterate = 0;
|
||||
tdb_traverse(tdb, print_rec, NULL);
|
||||
return 0;
|
||||
case CMD_INSERT:
|
||||
bIterate = 0;
|
||||
insert_tdb(arg1, arg1len,arg2,arg2len);
|
||||
return 0;
|
||||
case CMD_MOVE:
|
||||
bIterate = 0;
|
||||
move_rec(arg1,arg1len,arg2);
|
||||
return 0;
|
||||
case CMD_STORE:
|
||||
bIterate = 0;
|
||||
store_tdb(arg1,arg1len,arg2,arg2len);
|
||||
return 0;
|
||||
case CMD_SHOW:
|
||||
bIterate = 0;
|
||||
show_tdb(arg1, arg1len);
|
||||
return 0;
|
||||
case CMD_KEYS:
|
||||
tdb_traverse(tdb, print_key, NULL);
|
||||
return 0;
|
||||
case CMD_HEXKEYS:
|
||||
tdb_traverse(tdb, print_hexkey, NULL);
|
||||
return 0;
|
||||
case CMD_DELETE:
|
||||
bIterate = 0;
|
||||
delete_tdb(arg1,arg1len);
|
||||
return 0;
|
||||
case CMD_LIST_HASH_FREE:
|
||||
tdb_dump_all(tdb);
|
||||
return 0;
|
||||
case CMD_LIST_FREE:
|
||||
tdb_printfreelist(tdb);
|
||||
return 0;
|
||||
case CMD_INFO:
|
||||
info_tdb();
|
||||
return 0;
|
||||
case CMD_SPEED:
|
||||
speed_tdb(arg1);
|
||||
return 0;
|
||||
case CMD_MMAP:
|
||||
toggle_mmap();
|
||||
return 0;
|
||||
case CMD_FIRST:
|
||||
bIterate = 1;
|
||||
first_record(tdb, &iterate_kbuf);
|
||||
return 0;
|
||||
case CMD_NEXT:
|
||||
if (bIterate)
|
||||
next_record(tdb, &iterate_kbuf);
|
||||
return 0;
|
||||
case CMD_HELP:
|
||||
help();
|
||||
return 0;
|
||||
case CMD_CREATE_TDB:
|
||||
case CMD_OPEN_TDB:
|
||||
case CMD_SYSTEM:
|
||||
case CMD_QUIT:
|
||||
/*
|
||||
* unhandled commands. cases included here to avoid compiler
|
||||
* warnings.
|
||||
*/
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static char *convert_string(char *instring, size_t *sizep)
|
||||
{
|
||||
size_t length = 0;
|
||||
char *outp, *inp;
|
||||
char temp[3];
|
||||
|
||||
|
||||
outp = inp = instring;
|
||||
|
||||
while (*inp) {
|
||||
if (*inp == '\\') {
|
||||
inp++;
|
||||
if (*inp && strchr("0123456789abcdefABCDEF",(int)*inp)) {
|
||||
temp[0] = *inp++;
|
||||
temp[1] = '\0';
|
||||
if (*inp && strchr("0123456789abcdefABCDEF",(int)*inp)) {
|
||||
temp[1] = *inp++;
|
||||
temp[2] = '\0';
|
||||
}
|
||||
*outp++ = (char)strtol((const char *)temp,NULL,16);
|
||||
} else {
|
||||
*outp++ = *inp++;
|
||||
}
|
||||
} else {
|
||||
*outp++ = *inp++;
|
||||
}
|
||||
length++;
|
||||
}
|
||||
*sizep = length;
|
||||
return instring;
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
cmdname = "";
|
||||
arg1 = NULL;
|
||||
arg1len = 0;
|
||||
arg2 = NULL;
|
||||
arg2len = 0;
|
||||
|
||||
if (argv[1]) {
|
||||
cmdname = "open";
|
||||
arg1 = argv[1];
|
||||
do_command();
|
||||
cmdname = "";
|
||||
arg1 = NULL;
|
||||
}
|
||||
|
||||
switch (argc) {
|
||||
case 1:
|
||||
case 2:
|
||||
/* Interactive mode */
|
||||
while ((cmdname = tdb_getline("tdb> "))) {
|
||||
arg2 = arg1 = NULL;
|
||||
if ((arg1 = strchr((const char *)cmdname,' ')) != NULL) {
|
||||
arg1++;
|
||||
arg2 = arg1;
|
||||
while (*arg2) {
|
||||
if (*arg2 == ' ') {
|
||||
*arg2++ = '\0';
|
||||
break;
|
||||
}
|
||||
if ((*arg2++ == '\\') && (*arg2 == ' ')) {
|
||||
arg2++;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (arg1) arg1 = convert_string(arg1,&arg1len);
|
||||
if (arg2) arg2 = convert_string(arg2,&arg2len);
|
||||
if (do_command()) break;
|
||||
}
|
||||
break;
|
||||
case 5:
|
||||
arg2 = convert_string(argv[4],&arg2len);
|
||||
case 4:
|
||||
arg1 = convert_string(argv[3],&arg1len);
|
||||
case 3:
|
||||
cmdname = argv[2];
|
||||
default:
|
||||
do_command();
|
||||
break;
|
||||
}
|
||||
|
||||
if (tdb) tdb_close(tdb);
|
||||
|
||||
return 0;
|
||||
}
|
@ -1,318 +0,0 @@
|
||||
/* this tests tdb by doing lots of ops from several simultaneous
|
||||
writers - that stresses the locking code.
|
||||
*/
|
||||
|
||||
#include "replace.h"
|
||||
#include "system/time.h"
|
||||
#include "system/wait.h"
|
||||
#include "system/filesys.h"
|
||||
#include "tdb.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 = (pid_t *)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;
|
||||
}
|
@ -1,42 +0,0 @@
|
||||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
|
||||
<HTML>
|
||||
<HEAD>
|
||||
<TITLE>ldb</TITLE>
|
||||
</HEAD>
|
||||
<BODY BGCOLOR="#ffffff" TEXT="#000000" VLINK="#292555" LINK="#292555" ALINK="#cc0033">
|
||||
|
||||
<h1>tdb</h1>
|
||||
|
||||
TDB is a Trivial Database. In concept, it is very much like GDBM, and BSD's DB
|
||||
except that it allows multiple simultaneous writers and uses locking
|
||||
internally to keep writers from trampling on each other. TDB is also extremely
|
||||
small.
|
||||
|
||||
<h2>Discussion and bug reports</h2>
|
||||
|
||||
tdb does not currently have its own mailing list or bug tracking
|
||||
system. For now, please use the <a
|
||||
href="https://lists.samba.org/mailman/listinfo/samba-technical">samba-technical</a>
|
||||
mailing list, and the <a href="http://bugzilla.samba.org/">Samba
|
||||
bugzilla</a> bug tracking system.
|
||||
|
||||
<h2>Download</h2>
|
||||
|
||||
You can download the latest release either via rsync or git.<br>
|
||||
<br>
|
||||
To fetch via git see the following guide:<br>
|
||||
<a href="http://wiki.samba.org/index.php/Using_Git_for_Samba_Development">Using Git for Samba Development</a><br>
|
||||
Once you have cloned the tree switch to the v4-0-test branch and cd into the source/lib/tdb directory.<br>
|
||||
<br>
|
||||
To fetch via rsync use these commands:
|
||||
|
||||
<pre>
|
||||
rsync -Pavz samba.org::ftp/unpacked/tdb .
|
||||
rsync -Pavz samba.org::ftp/unpacked/libreplace .
|
||||
</pre>
|
||||
|
||||
and build in tdb. It will find the replace library in the directory
|
||||
above automatically.
|
||||
|
||||
</BODY>
|
||||
</HTML>
|
@ -20,7 +20,7 @@
|
||||
*/
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/util/dlinklist.h"
|
||||
#include "tdb_wrap.h"
|
||||
#include "tdb.h"
|
||||
|
@ -20,7 +20,7 @@
|
||||
*/
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "pstring.h"
|
||||
#include "lib/util/util_tdb.h"
|
||||
|
||||
|
@ -27,7 +27,7 @@
|
||||
#include "system/filesys.h"
|
||||
#include "tdb_wrap.h"
|
||||
#include "lib/ldb/include/ldb.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/util/util_tdb.h"
|
||||
#include "lib/util/util_ldb.h"
|
||||
#include "librpc/gen_ndr/ndr_security.h"
|
||||
|
@ -25,7 +25,7 @@
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/socket/socket.h"
|
||||
#include "smbd/process_model.h"
|
||||
#include "param/secrets.h"
|
||||
|
@ -23,7 +23,7 @@
|
||||
|
||||
#include "includes.h"
|
||||
#include "lib/events/events.h"
|
||||
#include "lib/tdb/include/tdb.h"
|
||||
#include "../tdb/include/tdb.h"
|
||||
#include "lib/socket/socket.h"
|
||||
#include "smbd/process_model.h"
|
||||
#include "param/secrets.h"
|
||||
|
@ -2,12 +2,12 @@
|
||||
# Start SUBSYSTEM LIBTDB
|
||||
[LIBRARY::LIBTDB]
|
||||
OUTPUT_TYPE = STATIC_LIBRARY
|
||||
CFLAGS = -Ilib/tdb/include
|
||||
CFLAGS = -I$(tdbsrcdir)/include
|
||||
#
|
||||
# End SUBSYSTEM ldb
|
||||
################################################
|
||||
|
||||
LIBTDB_OBJ_FILES = $(addprefix lib/tdb/common/, \
|
||||
LIBTDB_OBJ_FILES = $(addprefix $(tdbsrcdir)/common/, \
|
||||
tdb.o dump.o io.o lock.o \
|
||||
open.o traverse.o freelist.o \
|
||||
error.o transaction.o)
|
||||
@ -21,7 +21,7 @@ PRIVATE_DEPENDENCIES = \
|
||||
# End BINARY tdbtool
|
||||
################################################
|
||||
|
||||
tdbtool_OBJ_FILES = lib/tdb/tools/tdbtool.o
|
||||
tdbtool_OBJ_FILES = $(tdbsrcdir)/tools/tdbtool.o
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbtorture
|
||||
@ -32,7 +32,7 @@ PRIVATE_DEPENDENCIES = \
|
||||
# End BINARY tdbtorture
|
||||
################################################
|
||||
|
||||
tdbtorture_OBJ_FILES = lib/tdb/tools/tdbtorture.o
|
||||
tdbtorture_OBJ_FILES = $(tdbsrcdir)/tools/tdbtorture.o
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbdump
|
||||
@ -43,7 +43,7 @@ PRIVATE_DEPENDENCIES = \
|
||||
# End BINARY tdbdump
|
||||
################################################
|
||||
|
||||
tdbdump_OBJ_FILES = lib/tdb/tools/tdbdump.o
|
||||
tdbdump_OBJ_FILES = $(tdbsrcdir)/tools/tdbdump.o
|
||||
|
||||
################################################
|
||||
# Start BINARY tdbbackup
|
||||
@ -54,4 +54,4 @@ PRIVATE_DEPENDENCIES = \
|
||||
# End BINARY tdbbackup
|
||||
################################################
|
||||
|
||||
tdbbackup_OBJ_FILES = lib/tdb/tools/tdbbackup.o
|
||||
tdbbackup_OBJ_FILES = $(tdbsrcdir)/tools/tdbbackup.o
|
Some files were not shown because too many files have changed in this diff Show More
Loading…
x
Reference in New Issue
Block a user