1N/A/*-
1N/A * See the file LICENSE for redistribution information.
1N/A *
1N/A * Copyright (c) 1996, 1997, 1998
1N/A * Sleepycat Software. All rights reserved.
1N/A */
1N/A/*
1N/A * Copyright (c) 1990, 1993
1N/A * Margo Seltzer. All rights reserved.
1N/A */
1N/A/*
1N/A * Copyright (c) 1990, 1993
1N/A * The Regents of the University of California. All rights reserved.
1N/A *
1N/A * This code is derived from software contributed to Berkeley by
1N/A * Margo Seltzer.
1N/A *
1N/A * Redistribution and use in source and binary forms, with or without
1N/A * modification, are permitted provided that the following conditions
1N/A * are met:
1N/A * 1. Redistributions of source code must retain the above copyright
1N/A * notice, this list of conditions and the following disclaimer.
1N/A * 2. Redistributions in binary form must reproduce the above copyright
1N/A * notice, this list of conditions and the following disclaimer in the
1N/A * documentation and/or other materials provided with the distribution.
1N/A * 3. All advertising materials mentioning features or use of this software
1N/A * must display the following acknowledgement:
1N/A * This product includes software developed by the University of
1N/A * California, Berkeley and its contributors.
1N/A * 4. Neither the name of the University nor the names of its contributors
1N/A * may be used to endorse or promote products derived from this software
1N/A * without specific prior written permission.
1N/A *
1N/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
1N/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
1N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1N/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1N/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1N/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1N/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1N/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1N/A * SUCH DAMAGE.
1N/A */
1N/A
1N/A#include "config.h"
1N/A
1N/A#ifndef lint
1N/Astatic const char sccsid[] = "@(#)dbm.c 10.23 (Sleepycat) 11/22/98";
1N/A#endif /* not lint */
1N/A
1N/A#ifndef NO_SYSTEM_INCLUDES
1N/A#include <sys/types.h>
1N/A
1N/A#include <errno.h>
1N/A#include <fcntl.h>
1N/A#include <string.h>
1N/A#endif
1N/A
1N/A#define DB_DBM_HSEARCH 1
1N/A#include "db_int.h"
1N/A
1N/A#include "db_page.h"
1N/A#include "hash.h"
1N/A
1N/A/*
1N/A *
1N/A * This package provides dbm and ndbm compatible interfaces to DB.
1N/A *
1N/A * The DBM routines, which call the NDBM routines.
1N/A */
1N/Astatic DBM *__cur_db;
1N/A
1N/Astatic void __db_no_open __P((void));
1N/A
1N/Aint
1N/A__db_dbm_init(file)
1N/A char *file;
1N/A{
1N/A if (__cur_db != NULL)
1N/A (void)dbm_close(__cur_db);
1N/A if ((__cur_db =
1N/A dbm_open(file, O_CREAT | O_RDWR, __db_omode("rw----"))) != NULL)
1N/A return (0);
1N/A if ((__cur_db = dbm_open(file, O_RDONLY, 0)) != NULL)
1N/A return (0);
1N/A return (-1);
1N/A}
1N/A
1N/Aint
1N/A__db_dbm_close()
1N/A{
1N/A if (__cur_db != NULL) {
1N/A dbm_close(__cur_db);
1N/A __cur_db = NULL;
1N/A }
1N/A return (0);
1N/A}
1N/A
1N/Adatum
1N/A__db_dbm_fetch(key)
1N/A datum key;
1N/A{
1N/A datum item;
1N/A
1N/A if (__cur_db == NULL) {
1N/A __db_no_open();
1N/A item.dptr = 0;
1N/A return (item);
1N/A }
1N/A return (dbm_fetch(__cur_db, key));
1N/A}
1N/A
1N/Adatum
1N/A__db_dbm_firstkey()
1N/A{
1N/A datum item;
1N/A
1N/A if (__cur_db == NULL) {
1N/A __db_no_open();
1N/A item.dptr = 0;
1N/A return (item);
1N/A }
1N/A return (dbm_firstkey(__cur_db));
1N/A}
1N/A
1N/Adatum
1N/A__db_dbm_nextkey(key)
1N/A datum key;
1N/A{
1N/A datum item;
1N/A
1N/A COMPQUIET(key.dsize, 0);
1N/A
1N/A if (__cur_db == NULL) {
1N/A __db_no_open();
1N/A item.dptr = 0;
1N/A return (item);
1N/A }
1N/A return (dbm_nextkey(__cur_db));
1N/A}
1N/A
1N/Aint
1N/A__db_dbm_delete(key)
1N/A datum key;
1N/A{
1N/A if (__cur_db == NULL) {
1N/A __db_no_open();
1N/A return (-1);
1N/A }
1N/A return (dbm_delete(__cur_db, key));
1N/A}
1N/A
1N/Aint
1N/A__db_dbm_store(key, dat)
1N/A datum key, dat;
1N/A{
1N/A if (__cur_db == NULL) {
1N/A __db_no_open();
1N/A return (-1);
1N/A }
1N/A return (dbm_store(__cur_db, key, dat, DBM_REPLACE));
1N/A}
1N/A
1N/Astatic void
1N/A__db_no_open()
1N/A{
1N/A (void)fprintf(stderr, "dbm: no open database.\n");
1N/A}
1N/A
1N/A/*
1N/A * This package provides dbm and ndbm compatible interfaces to DB.
1N/A *
1N/A * The NDBM routines, which call the DB routines.
1N/A */
1N/A/*
1N/A * Returns:
1N/A * *DBM on success
1N/A * NULL on failure
1N/A */
1N/ADBM *
1N/A__db_ndbm_open(file, oflags, mode)
1N/A const char *file;
1N/A int oflags, mode;
1N/A{
1N/A DB *dbp;
1N/A DBC *dbc;
1N/A DB_INFO dbinfo;
1N/A int sv_errno;
1N/A char path[MAXPATHLEN];
1N/A
1N/A memset(&dbinfo, 0, sizeof(dbinfo));
1N/A dbinfo.db_pagesize = 4096;
1N/A dbinfo.h_ffactor = 40;
1N/A dbinfo.h_nelem = 1;
1N/A
1N/A /*
1N/A * XXX
1N/A * Don't use sprintf(3)/snprintf(3) -- the former is dangerous, and
1N/A * the latter isn't standard, and we're manipulating strings handed
1N/A * us by the application.
1N/A */
1N/A if (strlen(file) + strlen(DBM_SUFFIX) + 1 > sizeof(path)) {
1N/A errno = ENAMETOOLONG;
1N/A return (NULL);
1N/A }
1N/A (void)strcpy(path, file);
1N/A (void)strcat(path, DBM_SUFFIX);
1N/A if ((errno = db_open(path,
1N/A DB_HASH, __db_oflags(oflags), mode, NULL, &dbinfo, &dbp)) != 0)
1N/A return (NULL);
1N/A
1N/A if ((errno = dbp->cursor(dbp, NULL, &dbc, 0)) != 0) {
1N/A sv_errno = errno;
1N/A (void)dbp->close(dbp, 0);
1N/A errno = sv_errno;
1N/A return (NULL);
1N/A }
1N/A
1N/A return ((DBM *)dbc);
1N/A}
1N/A
1N/A/*
1N/A * Returns:
1N/A * Nothing.
1N/A */
1N/Avoid
1N/A__db_ndbm_close(dbm)
1N/A DBM *dbm;
1N/A{
1N/A DBC *dbc;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A (void)dbc->dbp->close(dbc->dbp, 0);
1N/A}
1N/A
1N/A/*
1N/A * Returns:
1N/A * DATUM on success
1N/A * NULL on failure
1N/A */
1N/Adatum
1N/A__db_ndbm_fetch(dbm, key)
1N/A DBM *dbm;
1N/A datum key;
1N/A{
1N/A DBC *dbc;
1N/A DBT _key, _data;
1N/A datum data;
1N/A int ret;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A memset(&_key, 0, sizeof(DBT));
1N/A memset(&_data, 0, sizeof(DBT));
1N/A _key.size = key.dsize;
1N/A _key.data = key.dptr;
1N/A
1N/A /*
1N/A * Note that we can't simply use the dbc we have to do a c_get/SET,
1N/A * because that cursor is the one used for sequential iteration and
1N/A * it has to remain stable in the face of intervening gets and puts.
1N/A */
1N/A if ((ret = dbc->dbp->get(dbc->dbp, NULL, &_key, &_data, 0)) == 0) {
1N/A data.dptr = _data.data;
1N/A data.dsize = _data.size;
1N/A } else {
1N/A data.dptr = NULL;
1N/A data.dsize = 0;
1N/A if (ret == DB_NOTFOUND)
1N/A errno = ENOENT;
1N/A else {
1N/A errno = ret;
1N/A F_SET(dbc->dbp, DB_DBM_ERROR);
1N/A }
1N/A }
1N/A return (data);
1N/A}
1N/A
1N/A/*
1N/A * Returns:
1N/A * DATUM on success
1N/A * NULL on failure
1N/A */
1N/Adatum
1N/A__db_ndbm_firstkey(dbm)
1N/A DBM *dbm;
1N/A{
1N/A DBC *dbc;
1N/A DBT _key, _data;
1N/A datum key;
1N/A int ret;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A memset(&_key, 0, sizeof(DBT));
1N/A memset(&_data, 0, sizeof(DBT));
1N/A
1N/A if ((ret = dbc->c_get(dbc, &_key, &_data, DB_FIRST)) == 0) {
1N/A key.dptr = _key.data;
1N/A key.dsize = _key.size;
1N/A } else {
1N/A key.dptr = NULL;
1N/A key.dsize = 0;
1N/A if (ret == DB_NOTFOUND)
1N/A errno = ENOENT;
1N/A else {
1N/A errno = ret;
1N/A F_SET(dbc->dbp, DB_DBM_ERROR);
1N/A }
1N/A }
1N/A return (key);
1N/A}
1N/A
1N/A/*
1N/A * Returns:
1N/A * DATUM on success
1N/A * NULL on failure
1N/A */
1N/Adatum
1N/A__db_ndbm_nextkey(dbm)
1N/A DBM *dbm;
1N/A{
1N/A DBC *dbc;
1N/A DBT _key, _data;
1N/A datum key;
1N/A int ret;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A memset(&_key, 0, sizeof(DBT));
1N/A memset(&_data, 0, sizeof(DBT));
1N/A
1N/A if ((ret = dbc->c_get(dbc, &_key, &_data, DB_NEXT)) == 0) {
1N/A key.dptr = _key.data;
1N/A key.dsize = _key.size;
1N/A } else {
1N/A key.dptr = NULL;
1N/A key.dsize = 0;
1N/A if (ret == DB_NOTFOUND)
1N/A errno = ENOENT;
1N/A else {
1N/A errno = ret;
1N/A F_SET(dbc->dbp, DB_DBM_ERROR);
1N/A }
1N/A }
1N/A return (key);
1N/A}
1N/A
1N/A/*
1N/A * Returns:
1N/A * 0 on success
1N/A * <0 failure
1N/A */
1N/Aint
1N/A__db_ndbm_delete(dbm, key)
1N/A DBM *dbm;
1N/A datum key;
1N/A{
1N/A DBC *dbc;
1N/A DBT _key;
1N/A int ret;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A memset(&_key, 0, sizeof(DBT));
1N/A _key.data = key.dptr;
1N/A _key.size = key.dsize;
1N/A
1N/A if ((ret = dbc->dbp->del(dbc->dbp, NULL, &_key, 0)) == 0)
1N/A return (0);
1N/A
1N/A if (ret == DB_NOTFOUND)
1N/A errno = ENOENT;
1N/A else {
1N/A errno = ret;
1N/A F_SET(dbc->dbp, DB_DBM_ERROR);
1N/A }
1N/A return (-1);
1N/A}
1N/A
1N/A/*
1N/A * Returns:
1N/A * 0 on success
1N/A * <0 failure
1N/A * 1 if DBM_INSERT and entry exists
1N/A */
1N/Aint
1N/A__db_ndbm_store(dbm, key, data, flags)
1N/A DBM *dbm;
1N/A datum key, data;
1N/A int flags;
1N/A{
1N/A DBC *dbc;
1N/A DBT _key, _data;
1N/A int ret;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A memset(&_key, 0, sizeof(DBT));
1N/A _key.data = key.dptr;
1N/A _key.size = key.dsize;
1N/A
1N/A memset(&_data, 0, sizeof(DBT));
1N/A _data.data = data.dptr;
1N/A _data.size = data.dsize;
1N/A
1N/A if ((ret = dbc->dbp->put(dbc->dbp, NULL,
1N/A &_key, &_data, flags == DBM_INSERT ? DB_NOOVERWRITE : 0)) == 0)
1N/A return (0);
1N/A
1N/A if (ret == DB_KEYEXIST)
1N/A return (1);
1N/A
1N/A errno = ret;
1N/A F_SET(dbc->dbp, DB_DBM_ERROR);
1N/A return (-1);
1N/A}
1N/A
1N/Aint
1N/A__db_ndbm_error(dbm)
1N/A DBM *dbm;
1N/A{
1N/A DBC *dbc;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A return (F_ISSET(dbc->dbp, DB_DBM_ERROR));
1N/A}
1N/A
1N/Aint
1N/A__db_ndbm_clearerr(dbm)
1N/A DBM *dbm;
1N/A{
1N/A DBC *dbc;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A F_CLR(dbc->dbp, DB_DBM_ERROR);
1N/A return (0);
1N/A}
1N/A
1N/A/*
1N/A * Returns:
1N/A * 1 if read-only
1N/A * 0 if not read-only
1N/A */
1N/Aint
1N/A__db_ndbm_rdonly(dbm)
1N/A DBM *dbm;
1N/A{
1N/A DBC *dbc;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A return (F_ISSET(dbc->dbp, DB_AM_RDONLY) ? 1 : 0);
1N/A}
1N/A
1N/A/*
1N/A * XXX
1N/A * We only have a single file descriptor that we can return, not two. Return
1N/A * the same one for both files. Hopefully, the user is using it for locking
1N/A * and picked one to use at random.
1N/A */
1N/Aint
1N/A__db_ndbm_dirfno(dbm)
1N/A DBM *dbm;
1N/A{
1N/A return (dbm_pagfno(dbm));
1N/A}
1N/A
1N/Aint
1N/A__db_ndbm_pagfno(dbm)
1N/A DBM *dbm;
1N/A{
1N/A DBC *dbc;
1N/A int fd;
1N/A
1N/A dbc = (DBC *)dbm;
1N/A
1N/A (void)dbc->dbp->fd(dbc->dbp, &fd);
1N/A return (fd);
1N/A}