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 RCSID("$Id: ndbm_wrap.c,v 1.1.8.1 2003/08/29 17:00:34 lha Exp $");
39 #include "ndbm_wrap.h"
40 #if defined(HAVE_DB4_DB_H)
42 #elif defined(HAVE_DB3_DB_H)
54 #define DBT2DATUM(DBT, DATUM) do { (DATUM)->dptr = (DBT)->data; (DATUM)->dsize = (DBT)->size; } while(0)
55 #define DATUM2DBT(DATUM, DBT) do { (DBT)->data = (DATUM)->dptr; (DBT)->size = (DATUM)->dsize; } while(0)
56 #define RETURN(X) return ((X) == 0) ? 0 : -1
62 #define D(X) ((DB*)(X))
68 D(db
)->close(D(db
), 0);
76 dbm_delete (DBM
*db
, datum dkey
)
79 DATUM2DBT(&dkey
, &key
);
81 RETURN(D(db
)->del(D(db
), NULL
, &key
, 0));
83 RETURN(D(db
)->del(D(db
), &key
, 0));
88 dbm_fetch (DBM
*db
, datum dkey
)
92 DATUM2DBT(&dkey
, &key
);
97 &key
, &value
, 0) != 0)
100 DBT2DATUM(&value
, &dvalue
);
106 dbm_get (DB
*db
, int flags
)
112 db
->cursor(db
, NULL
, &cursor
, 0);
113 if(cursor
->c_get(cursor
, &key
, &value
, flags
) != 0)
116 DBT2DATUM(&value
, &datum
);
118 db
->seq(db
, &key
, &value
, flags
);
124 #define DB_FIRST R_FIRST
125 #define DB_NEXT R_NEXT
126 #define DB_NOOVERWRITE R_NOOVERWRITE
127 #define DB_KEYEXIST 1
131 dbm_firstkey (DBM
*db
)
133 return dbm_get(D(db
), DB_FIRST
);
137 dbm_nextkey (DBM
*db
)
139 return dbm_get(D(db
), DB_NEXT
);
143 dbm_open (const char *file
, int flags
, mode_t mode
)
147 char *fn
= malloc(strlen(file
) + 4);
154 myflags
|= DB_CREATE
;
159 if (flags
& O_RDONLY
)
160 myflags
|= DB_RDONLY
;
163 myflags
|= DB_TRUNCATE
;
164 if(db_create(&db
, NULL
, 0) != 0) {
169 #if (DB_VERSION_MAJOR > 3) && (DB_VERSION_MINOR > 0)
170 if(db
->open(db
, NULL
, fn
, NULL
, DB_BTREE
, myflags
, mode
) != 0) {
172 if(db
->open(db
, fn
, NULL
, DB_BTREE
, myflags
, mode
) != 0) {
179 db
= dbopen(fn
, flags
, mode
, DB_BTREE
, NULL
);
186 dbm_store (DBM
*db
, datum dkey
, datum dvalue
, int flags
)
191 if((flags
& DBM_REPLACE
) == 0)
192 myflags
|= DB_NOOVERWRITE
;
193 DATUM2DBT(&dkey
, &key
);
194 DATUM2DBT(&dvalue
, &value
);
195 ret
= D(db
)->put(D(db
),
199 &key
, &value
, myflags
);
200 if(ret
== DB_KEYEXIST
)
212 dbm_clearerr (DBM
*db
)