2 * Copyright (c) 2002 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * 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.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 #include "ndbm_wrap.h"
37 #if defined(HAVE_DBHEADER)
39 #elif defined(HAVE_DB5_DB_H)
41 #elif defined(HAVE_DB4_DB_H)
43 #elif defined(HAVE_DB3_DB_H)
54 /* XXX undefine open so this works on Solaris with large file support */
57 #define DBT2DATUM(DBT, DATUM) do { (DATUM)->dptr = (DBT)->data; (DATUM)->dsize = (DBT)->size; } while(0)
58 #define DATUM2DBT(DATUM, DBT) do { (DBT)->data = (DATUM)->dptr; (DBT)->size = (DATUM)->dsize; } while(0)
59 #define RETURN(X) return ((X) == 0) ? 0 : -1
65 #define D(X) ((DB*)(X))
67 ROKEN_LIB_FUNCTION
void ROKEN_LIB_CALL
71 D(db
)->close(D(db
), 0);
78 ROKEN_LIB_FUNCTION
int ROKEN_LIB_CALL
79 dbm_delete (DBM
*db
, datum dkey
)
82 DATUM2DBT(&dkey
, &key
);
84 RETURN(D(db
)->del(D(db
), NULL
, &key
, 0));
86 RETURN(D(db
)->del(D(db
), &key
, 0));
91 dbm_fetch (DBM
*db
, datum dkey
)
95 DATUM2DBT(&dkey
, &key
);
100 &key
, &value
, 0) != 0) {
105 DBT2DATUM(&value
, &dvalue
);
111 dbm_get (DB
*db
, int flags
)
117 db
->cursor(db
, NULL
, &cursor
, 0);
118 if(cursor
->c_get(cursor
, &key
, &value
, flags
) != 0) {
122 DBT2DATUM(&value
, &datum
);
124 db
->seq(db
, &key
, &value
, flags
);
130 #define DB_FIRST R_FIRST
131 #define DB_NEXT R_NEXT
132 #define DB_NOOVERWRITE R_NOOVERWRITE
133 #define DB_KEYEXIST 1
136 ROKEN_LIB_FUNCTION datum ROKEN_LIB_CALL
137 dbm_firstkey (DBM
*db
)
139 return dbm_get(D(db
), DB_FIRST
);
142 ROKEN_LIB_FUNCTION datum ROKEN_LIB_CALL
143 dbm_nextkey (DBM
*db
)
145 return dbm_get(D(db
), DB_NEXT
);
148 ROKEN_LIB_FUNCTION DBM
* ROKEN_LIB_CALL
149 dbm_open (const char *file
, int flags
, mode_t mode
)
153 char *fn
= malloc(strlen(file
) + 4);
160 myflags
|= DB_CREATE
;
165 if (flags
& O_RDONLY
)
166 myflags
|= DB_RDONLY
;
169 myflags
|= DB_TRUNCATE
;
170 if(db_create(&db
, NULL
, 0) != 0) {
175 #if (DB_VERSION_MAJOR > 3) && (DB_VERSION_MINOR > 0)
176 if(db
->open(db
, NULL
, fn
, NULL
, DB_BTREE
, myflags
, mode
) != 0) {
178 if(db
->open(db
, fn
, NULL
, DB_BTREE
, myflags
, mode
) != 0) {
185 db
= dbopen(fn
, flags
, mode
, DB_BTREE
, NULL
);
191 ROKEN_LIB_FUNCTION
int ROKEN_LIB_CALL
192 dbm_store (DBM
*db
, datum dkey
, datum dvalue
, int flags
)
197 if((flags
& DBM_REPLACE
) == 0)
198 myflags
|= DB_NOOVERWRITE
;
199 DATUM2DBT(&dkey
, &key
);
200 DATUM2DBT(&dvalue
, &value
);
201 ret
= D(db
)->put(D(db
),
205 &key
, &value
, myflags
);
206 if(ret
== DB_KEYEXIST
)
211 ROKEN_LIB_FUNCTION
int ROKEN_LIB_CALL
217 ROKEN_LIB_FUNCTION
int ROKEN_LIB_CALL
218 dbm_clearerr (DBM
*db
)