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
|
/*
* mydbm.h: database interface definitions and prototypes.
*
* Copyright (C) 1994, 1995, Graeme W. Wilford. (Wilf.)
*
* You may distribute under the terms of the GNU General Public
* License as specified in the file COPYING that comes with this
* distribution.
*
* Header file to make programming independent of db type used
*
* Currently satisfies:
*
* *hash based*
* GNU dbm: (gdbm & ndbm)
* Berkeley db: (ndbm)
* `native': (ndbm)
*
* *binary tree based*
* Berkeley db: (BTREE)
*
* Tue Apr 26 12:56:44 BST 1994 Wilf. (G.Wilford@ee.surrey.ac.uk)
*/
#ifndef MYDBM_H
#define MYDBM_H
#if defined(GDBM) && !defined(NDBM) && !defined(BTREE)
#include <gdbm.h>
#ifndef HAVE_GDBM_EXISTS
extern __inline__ int gdbm_exists(GDBM_FILE dbf, datum key);
#endif /* !HAVE_GDBM_EXISTS */
#define BLK_SIZE 0 /* to invoke normal fs block size */
#define DB_EXT ".db"
#define MYDBM_FILE GDBM_FILE
#define MYDBM_CTRWOPEN(file) gdbm_open(file, BLK_SIZE,\
GDBM_NEWDB|GDBM_FAST, DBMODE, 0)
#define MYDBM_CRWOPEN(file) gdbm_open(file, BLK_SIZE,\
GDBM_WRCREAT|GDBM_FAST, DBMODE, 0)
#define MYDBM_RWOPEN(file) gdbm_open(file, BLK_SIZE,\
GDBM_WRITER|GDBM_FAST, DBMODE, 0)
#define MYDBM_RDOPEN(file) gdbm_open(file, BLK_SIZE,\
GDBM_READER, DBMODE, 0)
#define MYDBM_INSERT(dbf, key, cont) gdbm_store(dbf, key, cont, GDBM_INSERT)
#define MYDBM_REPLACE(dbf, key, cont) gdbm_store(dbf, key, cont, GDBM_REPLACE)
#define MYDBM_EXISTS(dbf, key) gdbm_exists(dbf, key)
#define MYDBM_DELETE(dbf, key) gdbm_delete(dbf, key)
#define MYDBM_FETCH(dbf, key) gdbm_fetch(dbf, key)
#define MYDBM_CLOSE(dbf) gdbm_close(dbf)
#define MYDBM_FIRSTKEY(dbf) gdbm_firstkey(dbf)
#define MYDBM_NEXTKEY(dbf, key) gdbm_nextkey(dbf, key)
#define MYDBM_REORG(dbf) gdbm_reorganize(dbf)
#define MYDBM_FREE(x) free(x)
#elif defined(NDBM) && !defined(GDBM) && !defined(BTREE)
#include <ndbm.h>
#if HAVE_FCNTL_H
# include <fcntl.h>
#endif
/* Berkeley db routines emulate ndbm but don't add .dir & .pag, just .db! */
#ifdef _DB_H_ /* has Berkeley db.h been included? */
# define BERKELEY_DB
#endif /* _DB_H_ */
extern __inline__ datum copy_datum (datum dat);
extern DBM *ndbm_flopen(char *file, int flags, int mode);
extern int ndbm_flclose(DBM *dbf);
#define DB_EXT ""
#define MYDBM_FILE DBM*
#define MYDBM_CTRWOPEN(file) ndbm_flopen(file, O_TRUNC|O_CREAT|O_RDWR, DBMODE)
#define MYDBM_CRWOPEN(file) ndbm_flopen(file, O_CREAT|O_RDWR, DBMODE)
#define MYDBM_RWOPEN(file) ndbm_flopen(file, O_RDWR, DBMODE)
#define MYDBM_RDOPEN(file) ndbm_flopen(file, O_RDONLY, DBMODE)
#define MYDBM_INSERT(dbf, key, cont) dbm_store(dbf, key, cont, DBM_INSERT)
#define MYDBM_REPLACE(dbf, key, cont) dbm_store(dbf, key, cont, DBM_REPLACE)
#define MYDBM_EXISTS(dbf, key) (dbm_fetch(dbf, key).dptr != NULL)
#define MYDBM_DELETE(dbf, key) dbm_delete(dbf, key)
#define MYDBM_FETCH(dbf, key) copy_datum(dbm_fetch(dbf, key))
#define MYDBM_CLOSE(dbf) ndbm_flclose(dbf)
#define MYDBM_FIRSTKEY(dbf) copy_datum(dbm_firstkey(dbf))
#define MYDBM_NEXTKEY(dbf, key) copy_datum(dbm_nextkey(dbf))
#define MYDBM_REORG(dbf) /* nothing - not implemented */
#define MYDBM_FREE(x) free (x)
#elif defined(BTREE) && !defined(NDBM) && !defined(GDBM)
#include <sys/types.h>
#include <fcntl.h>
#if ( BTREE == 1 )
# ifdef DB_ON_LIBC
# include <db.h>
# else
# include <db/db.h>
# endif
#elif ( BTREE == 2 )
# include <db2/db_185.h>
#else
# error "no libdb available"
#endif
#ifdef HAVE_LIMITS_H
# include <limits.h>
#endif
typedef struct {
char *dptr;
int dsize;
} datum;
extern __inline__ datum copy_datum (datum dat);
extern DB *btree_flopen(char *filename, int flags, int mode);
extern __inline__ int btree_close(DB *dbf);
extern __inline__ int btree_exists(DB *dbf, datum key);
extern __inline__ datum btree_fetch(DB *dbf, datum key);
extern int btree_insert(DB *dbf, datum key, datum cont);
extern __inline__ datum btree_firstkey(DB *dbf);
extern __inline__ datum btree_nextkey(DB *dbf);
extern __inline__ int btree_replace(DB *dbf, datum key, datum content);
extern __inline__ int btree_nextkeydata(DB *dbf, datum *key, datum *cont);
#define DB_EXT ".bt"
#define MYDBM_FILE DB*
#define MYDBM_CTRWOPEN(file) btree_flopen(file, O_TRUNC|O_CREAT|O_RDWR, DBMODE)
#define MYDBM_CRWOPEN(file) btree_flopen(file, O_CREAT|O_RDWR, DBMODE)
#define MYDBM_RWOPEN(file) btree_flopen(file, O_RDWR, DBMODE)
#define MYDBM_RDOPEN(file) btree_flopen(file, O_RDONLY, DBMODE)
#define MYDBM_INSERT(dbf, key, cont) btree_insert(dbf, key, cont)
#define MYDBM_REPLACE(dbf, key, cont) btree_replace(dbf, key, cont)
#define MYDBM_EXISTS(dbf, key) btree_exists(dbf, key)
#define MYDBM_DELETE(dbf, key) ((dbf->del)(dbf, (DBT *) &key, 0) \
? -1 : 0)
#define MYDBM_FETCH(dbf, key) btree_fetch(dbf, key)
#define MYDBM_CLOSE(dbf) btree_close(dbf)
#define MYDBM_FIRSTKEY(dbf) btree_firstkey(dbf)
#define MYDBM_NEXTKEY(dbf, key) btree_nextkey(dbf)
#define MYDBM_REORG(dbf) /* nothing - not implemented */
#define MYDBM_FREE(x) free(x)
#else /* not GDBM or NDBM or BTREE */
#error Define either GDBM, NDBM or BTREE before including mydbm.h
#endif /* not GDBM or NDBM or BTREE */
extern char *database;
extern MYDBM_FILE dbf;
/* db_ver.c */
extern void dbver_wr(MYDBM_FILE dbf);
extern int dbver_rd(MYDBM_FILE dbf);
#endif /* MYDBM_H */
|
