1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
/*
* Copyright (c) 2002 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
RCSID("$Id: ndbm_wrap.c,v 1.1.8.1 2003/08/29 17:00:34 lha Exp $");
#endif
#include "ndbm_wrap.h"
#if defined(HAVE_DB4_DB_H)
#include <db4/db.h>
#elif defined(HAVE_DB3_DB_H)
#include <db3/db.h>
#else
#include <db.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <fcntl.h>
#define DBT2DATUM(DBT, DATUM) do { (DATUM)->dptr = (DBT)->data; (DATUM)->dsize = (DBT)->size; } while(0)
#define DATUM2DBT(DATUM, DBT) do { (DBT)->data = (DATUM)->dptr; (DBT)->size = (DATUM)->dsize; } while(0)
#define RETURN(X) return ((X) == 0) ? 0 : -1
#ifdef HAVE_DB3
static DBC *cursor;
#endif
#define D(X) ((DB*)(X))
void
dbm_close (DBM *db)
{
#ifdef HAVE_DB3
D(db)->close(D(db), 0);
cursor = NULL;
#else
D(db)->close(D(db));
#endif
}
int
dbm_delete (DBM *db, datum dkey)
{
DBT key;
DATUM2DBT(&dkey, &key);
#ifdef HAVE_DB3
RETURN(D(db)->del(D(db), NULL, &key, 0));
#else
RETURN(D(db)->del(D(db), &key, 0));
#endif
}
datum
dbm_fetch (DBM *db, datum dkey)
{
datum dvalue;
DBT key, value;
DATUM2DBT(&dkey, &key);
if(D(db)->get(D(db),
#ifdef HAVE_DB3
NULL,
#endif
&key, &value, 0) != 0)
dvalue.dptr = NULL;
else
DBT2DATUM(&value, &dvalue);
return dvalue;
}
static datum
dbm_get (DB *db, int flags)
{
DBT key, value;
datum datum;
#ifdef HAVE_DB3
if(cursor == NULL)
db->cursor(db, NULL, &cursor, 0);
if(cursor->c_get(cursor, &key, &value, flags) != 0)
datum.dptr = NULL;
else
DBT2DATUM(&value, &datum);
#else
db->seq(db, &key, &value, flags);
#endif
return datum;
}
#ifndef DB_FIRST
#define DB_FIRST R_FIRST
#define DB_NEXT R_NEXT
#define DB_NOOVERWRITE R_NOOVERWRITE
#define DB_KEYEXIST 1
#endif
datum
dbm_firstkey (DBM *db)
{
return dbm_get(D(db), DB_FIRST);
}
datum
dbm_nextkey (DBM *db)
{
return dbm_get(D(db), DB_NEXT);
}
DBM*
dbm_open (const char *file, int flags, mode_t mode)
{
DB *db;
int myflags = 0;
char *fn = malloc(strlen(file) + 4);
if(fn == NULL)
return NULL;
strcpy(fn, file);
strcat(fn, ".db");
#ifdef HAVE_DB3
if (flags & O_CREAT)
myflags |= DB_CREATE;
if (flags & O_EXCL)
myflags |= DB_EXCL;
if (flags & O_RDONLY)
myflags |= DB_RDONLY;
if (flags & O_TRUNC)
myflags |= DB_TRUNCATE;
if(db_create(&db, NULL, 0) != 0) {
free(fn);
return NULL;
}
#if (DB_VERSION_MAJOR > 3) && (DB_VERSION_MINOR > 0)
if(db->open(db, NULL, fn, NULL, DB_BTREE, myflags, mode) != 0) {
#else
if(db->open(db, fn, NULL, DB_BTREE, myflags, mode) != 0) {
#endif
free(fn);
db->close(db, 0);
return NULL;
}
#else
db = dbopen(fn, flags, mode, DB_BTREE, NULL);
#endif
free(fn);
return (DBM*)db;
}
int
dbm_store (DBM *db, datum dkey, datum dvalue, int flags)
{
int ret;
DBT key, value;
int myflags = 0;
if((flags & DBM_REPLACE) == 0)
myflags |= DB_NOOVERWRITE;
DATUM2DBT(&dkey, &key);
DATUM2DBT(&dvalue, &value);
ret = D(db)->put(D(db),
#ifdef HAVE_DB3
NULL,
#endif
&key, &value, myflags);
if(ret == DB_KEYEXIST)
return 1;
RETURN(ret);
}
int
dbm_error (DBM *db)
{
return 0;
}
int
dbm_clearerr (DBM *db)
{
return 0;
}
|
