]>
Commit | Line | Data |
---|---|---|
9385eb3d | 1 | /*- |
e9ce8d39 A |
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 | ||
9385eb3d A |
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> | |
59e0d9fe | 41 | __FBSDID("$FreeBSD: src/lib/libc/db/hash/ndbm.c,v 1.6 2002/03/22 21:52:01 obrien Exp $"); |
e9ce8d39 A |
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 | ||
e9ce8d39 A |
50 | #include <stdio.h> |
51 | #include <string.h> | |
9385eb3d | 52 | #include <errno.h> |
e9ce8d39 | 53 | |
9385eb3d | 54 | #include <ndbm.h> |
e9ce8d39 A |
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, mode; | |
66 | { | |
67 | HASHINFO info; | |
68 | char path[MAXPATHLEN]; | |
69 | ||
70 | info.bsize = 4096; | |
71 | info.ffactor = 40; | |
72 | info.nelem = 1; | |
9385eb3d | 73 | info.cachesize = 0; |
e9ce8d39 A |
74 | info.hash = NULL; |
75 | info.lorder = 0; | |
9385eb3d A |
76 | |
77 | if( strlen(file) >= sizeof(path) - strlen(DBM_SUFFIX)) { | |
78 | errno = ENAMETOOLONG; | |
79 | return(NULL); | |
80 | } | |
e9ce8d39 A |
81 | (void)strcpy(path, file); |
82 | (void)strcat(path, DBM_SUFFIX); | |
83 | return ((DBM *)__hash_open(path, flags, mode, &info, 0)); | |
84 | } | |
85 | ||
86 | extern void | |
87 | dbm_close(db) | |
88 | DBM *db; | |
89 | { | |
90 | (void)(db->close)(db); | |
91 | } | |
92 | ||
93 | /* | |
94 | * Returns: | |
95 | * DATUM on success | |
96 | * NULL on failure | |
97 | */ | |
98 | extern datum | |
99 | dbm_fetch(db, key) | |
100 | DBM *db; | |
101 | datum key; | |
102 | { | |
9385eb3d | 103 | datum retdata; |
e9ce8d39 | 104 | int status; |
9385eb3d | 105 | DBT dbtkey, dbtretdata; |
e9ce8d39 | 106 | |
9385eb3d A |
107 | dbtkey.data = key.dptr; |
108 | dbtkey.size = key.dsize; | |
109 | status = (db->get)(db, &dbtkey, &dbtretdata, 0); | |
e9ce8d39 | 110 | if (status) { |
9385eb3d A |
111 | dbtretdata.data = NULL; |
112 | dbtretdata.size = 0; | |
e9ce8d39 | 113 | } |
9385eb3d A |
114 | retdata.dptr = dbtretdata.data; |
115 | retdata.dsize = dbtretdata.size; | |
116 | return (retdata); | |
e9ce8d39 A |
117 | } |
118 | ||
119 | /* | |
120 | * Returns: | |
121 | * DATUM on success | |
122 | * NULL on failure | |
123 | */ | |
124 | extern datum | |
125 | dbm_firstkey(db) | |
126 | DBM *db; | |
127 | { | |
128 | int status; | |
9385eb3d A |
129 | datum retkey; |
130 | DBT dbtretkey, dbtretdata; | |
e9ce8d39 | 131 | |
9385eb3d | 132 | status = (db->seq)(db, &dbtretkey, &dbtretdata, R_FIRST); |
e9ce8d39 | 133 | if (status) |
9385eb3d A |
134 | dbtretkey.data = NULL; |
135 | retkey.dptr = dbtretkey.data; | |
136 | retkey.dsize = dbtretkey.size; | |
e9ce8d39 A |
137 | return (retkey); |
138 | } | |
139 | ||
140 | /* | |
141 | * Returns: | |
142 | * DATUM on success | |
143 | * NULL on failure | |
144 | */ | |
145 | extern datum | |
146 | dbm_nextkey(db) | |
147 | DBM *db; | |
148 | { | |
149 | int status; | |
9385eb3d A |
150 | datum retkey; |
151 | DBT dbtretkey, dbtretdata; | |
e9ce8d39 | 152 | |
9385eb3d | 153 | status = (db->seq)(db, &dbtretkey, &dbtretdata, R_NEXT); |
e9ce8d39 | 154 | if (status) |
9385eb3d A |
155 | dbtretkey.data = NULL; |
156 | retkey.dptr = dbtretkey.data; | |
157 | retkey.dsize = dbtretkey.size; | |
e9ce8d39 A |
158 | return (retkey); |
159 | } | |
9385eb3d | 160 | |
e9ce8d39 A |
161 | /* |
162 | * Returns: | |
163 | * 0 on success | |
164 | * <0 failure | |
165 | */ | |
166 | extern int | |
167 | dbm_delete(db, key) | |
168 | DBM *db; | |
169 | datum key; | |
170 | { | |
171 | int status; | |
9385eb3d | 172 | DBT dbtkey; |
e9ce8d39 | 173 | |
9385eb3d A |
174 | dbtkey.data = key.dptr; |
175 | dbtkey.size = key.dsize; | |
176 | status = (db->del)(db, &dbtkey, 0); | |
e9ce8d39 A |
177 | if (status) |
178 | return (-1); | |
179 | else | |
180 | return (0); | |
181 | } | |
182 | ||
183 | /* | |
184 | * Returns: | |
185 | * 0 on success | |
186 | * <0 failure | |
187 | * 1 if DBM_INSERT and entry exists | |
188 | */ | |
189 | extern int | |
9385eb3d | 190 | dbm_store(db, key, data, flags) |
e9ce8d39 | 191 | DBM *db; |
9385eb3d | 192 | datum key, data; |
e9ce8d39 A |
193 | int flags; |
194 | { | |
9385eb3d A |
195 | DBT dbtkey, dbtdata; |
196 | ||
197 | dbtkey.data = key.dptr; | |
198 | dbtkey.size = key.dsize; | |
199 | dbtdata.data = data.dptr; | |
200 | dbtdata.size = data.dsize; | |
201 | return ((db->put)(db, &dbtkey, &dbtdata, | |
e9ce8d39 A |
202 | (flags == DBM_INSERT) ? R_NOOVERWRITE : 0)); |
203 | } | |
204 | ||
205 | extern int | |
206 | dbm_error(db) | |
207 | DBM *db; | |
208 | { | |
209 | HTAB *hp; | |
210 | ||
211 | hp = (HTAB *)db->internal; | |
212 | return (hp->error); | |
213 | } | |
214 | ||
215 | extern int | |
216 | dbm_clearerr(db) | |
217 | DBM *db; | |
218 | { | |
219 | HTAB *hp; | |
220 | ||
221 | hp = (HTAB *)db->internal; | |
222 | hp->error = 0; | |
223 | return (0); | |
224 | } | |
225 | ||
226 | extern int | |
227 | dbm_dirfno(db) | |
228 | DBM *db; | |
229 | { | |
230 | return(((HTAB *)db->internal)->fp); | |
231 | } |