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