1
0
mirror of https://github.com/samba-team/samba.git synced 2024-12-24 21:34:56 +03:00
samba-mirror/source3/lib/dbwrap/dbwrap.c

354 lines
7.9 KiB
C
Raw Normal View History

/*
Unix SMB/CIFS implementation.
Database interface wrapper
Copyright (C) Jim McDonough <jmcd@us.ibm.com> 2006
Major code contributions from Aleksey Fedoseev (fedoseev@ru.ibm.com)
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 "includes.h"
#include "dbwrap/dbwrap.h"
#include "dbwrap/dbwrap_private.h"
#include "util_tdb.h"
/*
* Fall back using fetch if no genuine exists operation is provided
*/
static int dbwrap_fallback_exists(struct db_context *db, TDB_DATA key)
{
NTSTATUS status = dbwrap_parse_record(db, key, NULL, NULL);
return NT_STATUS_IS_OK(status) ? 1 : 0;
}
static int delete_record(struct db_record *rec, void *data)
{
NTSTATUS status = dbwrap_record_delete(rec);
return NT_STATUS_IS_OK(status) ? 0 : -1;
}
/*
* Fallback wipe implementation using traverse and delete if no genuine
* wipe operation is provided
*/
static int dbwrap_fallback_wipe(struct db_context *db)
{
NTSTATUS status = dbwrap_trans_traverse(db, delete_record, NULL);
return NT_STATUS_IS_OK(status) ? 0 : -1;
}
2011-08-17 16:42:50 +04:00
/*
* Wrapper functions for the backend methods
*/
TDB_DATA dbwrap_record_get_key(const struct db_record *rec)
{
return rec->key;
}
TDB_DATA dbwrap_record_get_value(const struct db_record *rec)
{
return rec->value;
}
NTSTATUS dbwrap_record_store(struct db_record *rec, TDB_DATA data, int flags)
{
return rec->store(rec, data, flags);
}
NTSTATUS dbwrap_record_delete(struct db_record *rec)
{
return rec->delete_rec(rec);
}
struct dbwrap_lock_order_state {
uint8_t *plock_order_mask;
uint8_t bitmask;
};
static int dbwrap_lock_order_state_destructor(
struct dbwrap_lock_order_state *s)
{
*s->plock_order_mask &= ~s->bitmask;
return 0;
}
static struct dbwrap_lock_order_state *dbwrap_check_lock_order(
struct db_context *db, TALLOC_CTX *mem_ctx)
{
/*
* Store the lock_order of currently locked records as bits in
* "lock_order_mask". We only use levels 1,2,3 right now, so a
* single uint8_t is enough.
*/
static uint8_t lock_order_mask;
struct dbwrap_lock_order_state *state;
uint8_t idx;
int used;
if (db->lock_order == 0) {
/*
* lock order 0 is for example for dbwrap_rbt without
* real locking. Return state nevertheless to avoid
* special cases.
*/
return talloc(mem_ctx, struct dbwrap_lock_order_state);
}
/*
* We fill bits from the high bits, to be able to use
* "ffs(lock_order_mask)"
*/
idx = sizeof(lock_order_mask)*8 - db->lock_order;
used = ffs(lock_order_mask);
DEBUG(5, ("used=%d, lock_order=%d, idx=%d\n", used,
(int)db->lock_order, (int)idx));
if ((used != 0) && (used-1 <= idx)) {
DEBUG(0, ("Lock order violation: Trying %d, order_mask=%x\n",
(int)db->lock_order, (int)lock_order_mask));
return NULL;
}
state = talloc(mem_ctx, struct dbwrap_lock_order_state);
if (state == NULL) {
DEBUG(1, ("talloc failed\n"));
return NULL;
}
state->bitmask = 1 << idx;
state->plock_order_mask = &lock_order_mask;
talloc_set_destructor(state, dbwrap_lock_order_state_destructor);
lock_order_mask |= state->bitmask;
return state;
}
static struct db_record *dbwrap_fetch_locked_internal(
struct db_context *db, TALLOC_CTX *mem_ctx, TDB_DATA key,
struct db_record *(*db_fn)(struct db_context *db, TALLOC_CTX *mem_ctx,
TDB_DATA key))
{
struct db_record *rec;
struct dbwrap_lock_order_state *lock_order;
TALLOC_CTX *frame = talloc_stackframe();
lock_order = dbwrap_check_lock_order(db, frame);
if (lock_order == NULL) {
TALLOC_FREE(frame);
return NULL;
}
rec = db_fn(db, mem_ctx, key);
if (rec == NULL) {
TALLOC_FREE(frame);
return NULL;
}
(void)talloc_steal(rec, lock_order);
TALLOC_FREE(frame);
return rec;
}
struct db_record *dbwrap_fetch_locked(struct db_context *db,
TALLOC_CTX *mem_ctx,
TDB_DATA key)
{
return dbwrap_fetch_locked_internal(db, mem_ctx, key,
db->fetch_locked);
}
struct db_record *dbwrap_try_fetch_locked(struct db_context *db,
TALLOC_CTX *mem_ctx,
TDB_DATA key)
{
return dbwrap_fetch_locked_internal(
db, mem_ctx, key,
db->try_fetch_locked
? db->try_fetch_locked : db->fetch_locked);
}
struct dbwrap_fetch_state {
TALLOC_CTX *mem_ctx;
TDB_DATA data;
};
static void dbwrap_fetch_parser(TDB_DATA key, TDB_DATA data,
void *private_data)
{
struct dbwrap_fetch_state *state =
(struct dbwrap_fetch_state *)private_data;
state->data.dsize = data.dsize;
state->data.dptr = (uint8_t *)talloc_memdup(state->mem_ctx, data.dptr,
data.dsize);
}
NTSTATUS dbwrap_fetch(struct db_context *db, TALLOC_CTX *mem_ctx,
TDB_DATA key, TDB_DATA *value)
{
struct dbwrap_fetch_state state;
NTSTATUS status;
if (value == NULL) {
return NT_STATUS_INVALID_PARAMETER;
}
state.mem_ctx = mem_ctx;
status = dbwrap_parse_record(db, key, dbwrap_fetch_parser, &state);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
if ((state.data.dsize != 0) && (state.data.dptr == NULL)) {
return NT_STATUS_NO_MEMORY;
}
*value = state.data;
return NT_STATUS_OK;
}
bool dbwrap_exists(struct db_context *db, TDB_DATA key)
{
int result;
if (db->exists != NULL) {
result = db->exists(db, key);
} else {
result = dbwrap_fallback_exists(db,key);
}
return (result == 1);
}
NTSTATUS dbwrap_store(struct db_context *db, TDB_DATA key,
TDB_DATA data, int flags)
{
struct db_record *rec;
NTSTATUS status;
TALLOC_CTX *frame = talloc_stackframe();
rec = dbwrap_fetch_locked(db, frame, key);
if (rec == NULL) {
TALLOC_FREE(frame);
return NT_STATUS_NO_MEMORY;
}
status = dbwrap_record_store(rec, data, flags);
TALLOC_FREE(frame);
return status;
}
NTSTATUS dbwrap_delete(struct db_context *db, TDB_DATA key)
{
struct db_record *rec;
NTSTATUS status;
TALLOC_CTX *frame = talloc_stackframe();
rec = dbwrap_fetch_locked(db, frame, key);
if (rec == NULL) {
TALLOC_FREE(frame);
return NT_STATUS_NO_MEMORY;
}
status = dbwrap_record_delete(rec);
TALLOC_FREE(frame);
return status;
}
NTSTATUS dbwrap_traverse(struct db_context *db,
int (*f)(struct db_record*, void*),
void *private_data,
int *count)
{
int ret = db->traverse(db, f, private_data);
if (ret < 0) {
return NT_STATUS_INTERNAL_DB_CORRUPTION;
}
if (count != NULL) {
*count = ret;
}
return NT_STATUS_OK;
}
NTSTATUS dbwrap_traverse_read(struct db_context *db,
int (*f)(struct db_record*, void*),
void *private_data,
int *count)
{
int ret = db->traverse_read(db, f, private_data);
if (ret < 0) {
return NT_STATUS_INTERNAL_DB_CORRUPTION;
}
if (count != NULL) {
*count = ret;
}
return NT_STATUS_OK;
}
static void dbwrap_null_parser(TDB_DATA key, TDB_DATA val, void* data)
{
return;
}
NTSTATUS dbwrap_parse_record(struct db_context *db, TDB_DATA key,
void (*parser)(TDB_DATA key, TDB_DATA data,
void *private_data),
void *private_data)
{
if (parser == NULL) {
parser = dbwrap_null_parser;
}
return db->parse_record(db, key, parser, private_data);
}
int dbwrap_wipe(struct db_context *db)
{
if (db->wipe == NULL) {
return dbwrap_fallback_wipe(db);
}
return db->wipe(db);
}
int dbwrap_get_seqnum(struct db_context *db)
{
return db->get_seqnum(db);
}
int dbwrap_get_flags(struct db_context *db)
{
return db->get_flags(db);
}
int dbwrap_transaction_start(struct db_context *db)
{
return db->transaction_start(db);
}
int dbwrap_transaction_commit(struct db_context *db)
{
return db->transaction_commit(db);
}
int dbwrap_transaction_cancel(struct db_context *db)
{
return db->transaction_cancel(db);
}