db/hash/ndbm-fbsd.c

   1 /*-
   2  * Copyright (c) 1990, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Margo Seltzer.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  * 3. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  */
  36
  37 #if defined(LIBC_SCCS) && !defined(lint)
  38 static char sccsid[] = "@(#)ndbm.c      8.4 (Berkeley) 7/21/94";
  39 #endif /* LIBC_SCCS and not lint */
  40 #include <sys/cdefs.h>
  41 __FBSDID("$FreeBSD: src/lib/libc/db/hash/ndbm.c,v 1.6 2002/03/22 21:52:01 obrien Exp $");
  42
  43 /*
  44  * This package provides a dbm compatible interface to the new hashing
  45  * package described in db(3).
  46  */
  47
  48 #include <sys/param.h>
  49
  50 #include <stdio.h>
  51 #include <string.h>
  52 #include <errno.h>
  53
  54 #include <db.h>
  55 #define _DBM
  56 typedef DB DBM;
  57 #include <ndbm.h>
  58 #include "hash.h"
  59
  60 /*
  61  * Returns:
  62  *      *DBM on success
  63  *       NULL on failure
  64  */
  65 extern DBM *
  66 dbm_open(file, flags, mode)
  67         const char *file;
  68         int flags;
  69         mode_t mode;
  70 {
  71         HASHINFO info;
  72         char path[MAXPATHLEN];
  73
  74         info.bsize = 4096;
  75         info.ffactor = 40;
  76         info.nelem = 1;
  77         info.cachesize = 0;
  78         info.hash = NULL;
  79         info.lorder = 0;
  80
  81         if( strlen(file) >= sizeof(path) - strlen(DBM_SUFFIX)) {
  82                 errno = ENAMETOOLONG;
  83                 return(NULL);
  84         }
  85         (void)strcpy(path, file);
  86         (void)strcat(path, DBM_SUFFIX);
  87         return ((DBM *)__hash_open(path, flags, mode, &info, 0));
  88 }
  89
  90 extern void
  91 dbm_close(db)
  92         DBM *db;
  93 {
  94         (void)(db->close)(db);
  95 }
  96
  97 /*
  98  * Returns:
  99  *      DATUM on success
 100  *      NULL on failure
 101  */
 102 extern datum
 103 dbm_fetch(db, key)
 104         DBM *db;
 105         datum key;
 106 {
 107         datum retdata;
 108         int status;
 109         DBT dbtkey, dbtretdata;
 110
 111         dbtkey.data = key.dptr;
 112         dbtkey.size = key.dsize;
 113         status = (db->get)(db, &dbtkey, &dbtretdata, 0);
 114         if (status) {
 115                 dbtretdata.data = NULL;
 116                 dbtretdata.size = 0;
 117         }
 118         retdata.dptr = dbtretdata.data;
 119         retdata.dsize = dbtretdata.size;
 120         return (retdata);
 121 }
 122
 123 /*
 124  * Returns:
 125  *      DATUM on success
 126  *      NULL on failure
 127  */
 128 extern datum
 129 dbm_firstkey(db)
 130         DBM *db;
 131 {
 132         int status;
 133         datum retkey;
 134         DBT dbtretkey, dbtretdata;
 135         HTAB *htab = (HTAB *)(db->internal);
 136
 137         status = (db->seq)(db, &dbtretkey, &dbtretdata, R_FIRST);
 138         if (status) {
 139                 dbtretkey.data = NULL;
 140                 htab->nextkey_eof = 1;
 141         } else
 142                 htab->nextkey_eof = 0;
 143         retkey.dptr = dbtretkey.data;
 144         retkey.dsize = dbtretkey.size;
 145         return (retkey);
 146 }
 147
 148 /*
 149  * Returns:
 150  *      DATUM on success
 151  *      NULL on failure
 152  */
 153 extern datum
 154 dbm_nextkey(db)
 155         DBM *db;
 156 {
 157         int status = 1;
 158         datum retkey;
 159         DBT dbtretkey, dbtretdata;
 160         HTAB *htab = (HTAB *)(db->internal);
 161
 162         if (htab->nextkey_eof)
 163                 dbtretkey.data = NULL;
 164         else {
 165                 status = (db->seq)(db, &dbtretkey, &dbtretdata, R_NEXT);
 166                 if (status) {
 167                         dbtretkey.data = NULL;
 168                         htab->nextkey_eof = 1;
 169                 }
 170         }
 171         retkey.dptr = dbtretkey.data;
 172         retkey.dsize = dbtretkey.size;
 173         return (retkey);
 174 }
 175
 176 /*
 177  * Returns:
 178  *       0 on success
 179  *      <0 failure
 180  */
 181 extern int
 182 dbm_delete(db, key)
 183         DBM *db;
 184         datum key;
 185 {
 186         int status;
 187         DBT dbtkey;
 188
 189         dbtkey.data = key.dptr;
 190         dbtkey.size = key.dsize;
 191         status = (db->del)(db, &dbtkey, 0);
 192         if (status)
 193                 return (-1);
 194         else
 195                 return (0);
 196 }
 197
 198 /*
 199  * Returns:
 200  *       0 on success
 201  *      <0 failure
 202  *       1 if DBM_INSERT and entry exists
 203  */
 204 extern int
 205 dbm_store(db, key, data, flags)
 206         DBM *db;
 207         datum key, data;
 208         int flags;
 209 {
 210         DBT dbtkey, dbtdata;
 211
 212         dbtkey.data = key.dptr;
 213         dbtkey.size = key.dsize;
 214         dbtdata.data = data.dptr;
 215         dbtdata.size = data.dsize;
 216         return ((db->put)(db, &dbtkey, &dbtdata,
 217             (flags == DBM_INSERT) ? R_NOOVERWRITE : 0));
 218 }
 219
 220 extern int
 221 dbm_error(db)
 222         DBM *db;
 223 {
 224         HTAB *hp;
 225
 226         hp = (HTAB *)db->internal;
 227         return (hp->error);
 228 }
 229
 230 extern int
 231 dbm_clearerr(db)
 232         DBM *db;
 233 {
 234         HTAB *hp;
 235
 236         hp = (HTAB *)db->internal;
 237         hp->error = 0;
 238         return (0);
 239 }
 240
 241 extern int
 242 dbm_dirfno(db)
 243         DBM *db;
 244 {
 245         return(((HTAB *)db->internal)->fp);
 246 }