xref: /freebsd/lib/libc/db/hash/ndbm.c (revision 0d66206fff44f864ea8a4b220c3a53b4caa959a0)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
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 #if defined(LIBC_SCCS) && !defined(lint)
36 static char sccsid[] = "@(#)ndbm.c	8.4 (Berkeley) 7/21/94";
37 #endif /* LIBC_SCCS and not lint */
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
40 
41 /*
42  * This package provides a dbm compatible interface to the new hashing
43  * package described in db(3).
44  */
45 
46 #include <sys/param.h>
47 
48 #include <stdio.h>
49 #include <string.h>
50 #include <errno.h>
51 
52 #include <ndbm.h>
53 #include "hash.h"
54 
55 /*
56  * Returns:
57  * 	*DBM on success
58  *	 NULL on failure
59  */
60 extern DBM *
61 dbm_open(const char *file, int flags, mode_t mode)
62 {
63 	HASHINFO info;
64 	char path[MAXPATHLEN];
65 
66 	info.bsize = 4096;
67 	info.ffactor = 40;
68 	info.nelem = 1;
69 	info.cachesize = 0;
70 	info.hash = NULL;
71 	info.lorder = 0;
72 
73 	if( strlen(file) >= sizeof(path) - strlen(DBM_SUFFIX)) {
74 		errno = ENAMETOOLONG;
75 		return(NULL);
76 	}
77 	(void)strcpy(path, file);
78 	(void)strcat(path, DBM_SUFFIX);
79 	return ((DBM *)__hash_open(path, flags, mode, &info, 0));
80 }
81 
82 extern void
83 dbm_close(DBM *db)
84 {
85 	(void)(db->close)(db);
86 }
87 
88 /*
89  * Returns:
90  *	DATUM on success
91  *	NULL on failure
92  */
93 extern datum
94 dbm_fetch(DBM *db, datum key)
95 {
96 	datum retdata;
97 	int status;
98 	DBT dbtkey, dbtretdata;
99 
100 	dbtkey.data = key.dptr;
101 	dbtkey.size = key.dsize;
102 	status = (db->get)(db, &dbtkey, &dbtretdata, 0);
103 	if (status) {
104 		dbtretdata.data = NULL;
105 		dbtretdata.size = 0;
106 	}
107 	retdata.dptr = dbtretdata.data;
108 	retdata.dsize = dbtretdata.size;
109 	return (retdata);
110 }
111 
112 /*
113  * Returns:
114  *	DATUM on success
115  *	NULL on failure
116  */
117 extern datum
118 dbm_firstkey(DBM *db)
119 {
120 	int status;
121 	datum retkey;
122 	DBT dbtretkey, dbtretdata;
123 
124 	status = (db->seq)(db, &dbtretkey, &dbtretdata, R_FIRST);
125 	if (status)
126 		dbtretkey.data = NULL;
127 	retkey.dptr = dbtretkey.data;
128 	retkey.dsize = dbtretkey.size;
129 	return (retkey);
130 }
131 
132 /*
133  * Returns:
134  *	DATUM on success
135  *	NULL on failure
136  */
137 extern datum
138 dbm_nextkey(DBM *db)
139 {
140 	int status;
141 	datum retkey;
142 	DBT dbtretkey, dbtretdata;
143 
144 	status = (db->seq)(db, &dbtretkey, &dbtretdata, R_NEXT);
145 	if (status)
146 		dbtretkey.data = NULL;
147 	retkey.dptr = dbtretkey.data;
148 	retkey.dsize = dbtretkey.size;
149 	return (retkey);
150 }
151 
152 /*
153  * Returns:
154  *	 0 on success
155  *	<0 failure
156  */
157 extern int
158 dbm_delete(DBM *db, datum key)
159 {
160 	int status;
161 	DBT dbtkey;
162 
163 	dbtkey.data = key.dptr;
164 	dbtkey.size = key.dsize;
165 	status = (db->del)(db, &dbtkey, 0);
166 	if (status)
167 		return (-1);
168 	else
169 		return (0);
170 }
171 
172 /*
173  * Returns:
174  *	 0 on success
175  *	<0 failure
176  *	 1 if DBM_INSERT and entry exists
177  */
178 extern int
179 dbm_store(DBM *db, datum key, datum data, int flags)
180 {
181 	DBT dbtkey, dbtdata;
182 
183 	dbtkey.data = key.dptr;
184 	dbtkey.size = key.dsize;
185 	dbtdata.data = data.dptr;
186 	dbtdata.size = data.dsize;
187 	return ((db->put)(db, &dbtkey, &dbtdata,
188 	    (flags == DBM_INSERT) ? R_NOOVERWRITE : 0));
189 }
190 
191 extern int
192 dbm_error(DBM *db)
193 {
194 	HTAB *hp;
195 
196 	hp = (HTAB *)db->internal;
197 	return (hp->error);
198 }
199 
200 extern int
201 dbm_clearerr(DBM *db)
202 {
203 	HTAB *hp;
204 
205 	hp = (HTAB *)db->internal;
206 	hp->error = 0;
207 	return (0);
208 }
209 
210 extern int
211 dbm_dirfno(DBM *db)
212 {
213 	return(((HTAB *)db->internal)->fp);
214 }
215