2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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.
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
36 * @(#)ndbm.c 8.4 (Berkeley) 7/21/94
40 * This package provides a dbm compatible interface to the new hashing
41 * package described in db(3).
44 #include <sys/param.h>
59 dbm_open(file, flags, mode)
64 char path[MAXPATHLEN];
73 if( strlen(file) >= sizeof(path) - strlen(DBM_SUFFIX)) {
77 (void)strcpy(path, file);
78 (void)strcat(path, DBM_SUFFIX);
79 return ((DBM *)__hash_open(path, flags, mode, &info, 0));
86 (void)(db->close)(db);
101 DBT dbtkey, dbtretdata;
103 dbtkey.data = key.dptr;
104 dbtkey.size = key.dsize;
105 status = (db->get)(db, &dbtkey, &dbtretdata, 0);
107 dbtretdata.data = NULL;
110 retdata.dptr = dbtretdata.data;
111 retdata.dsize = dbtretdata.size;
126 DBT dbtretkey, dbtretdata;
128 status = (db->seq)(db, &dbtretkey, &dbtretdata, R_FIRST);
130 dbtretkey.data = NULL;
131 retkey.dptr = dbtretkey.data;
132 retkey.dsize = dbtretkey.size;
147 DBT dbtretkey, dbtretdata;
149 status = (db->seq)(db, &dbtretkey, &dbtretdata, R_NEXT);
151 dbtretkey.data = NULL;
152 retkey.dptr = dbtretkey.data;
153 retkey.dsize = dbtretkey.size;
170 dbtkey.data = key.dptr;
171 dbtkey.size = key.dsize;
172 status = (db->del)(db, &dbtkey, 0);
183 * 1 if DBM_INSERT and entry exists
186 dbm_store(db, key, data, flags)
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 (flags == DBM_INSERT) ? R_NOOVERWRITE : 0));
207 hp = (HTAB *)db->internal;
217 hp = (HTAB *)db->internal;
226 return(((HTAB *)db->internal)->fp);