2 * This file contains a set of abstractions that allow Citadel to plug into any
3 * record manager or database system for its data store.
22 * This array holds one gdbm handle for each Citadel database.
24 GDBM_FILE gdbms[MAXCDB];
27 * We also keep these around, for sequential searches... (one per
28 * session. Maybe there's a better way?)
35 * Reclaim unused space in the databases. We need to do each one of
36 * these discretely, rather than in a loop.
38 void defrag_databases() {
40 /* defrag the message base */
41 begin_critical_section(S_MSGMAIN);
42 gdbm_reorganize(gdbms[CDB_MSGMAIN]);
43 end_critical_section(S_MSGMAIN);
45 /* defrag the user file and mailboxes */
46 begin_critical_section(S_USERSUPP);
47 gdbm_reorganize(gdbms[CDB_USERSUPP]);
48 gdbm_reorganize(gdbms[CDB_MAILBOXES]);
49 end_critical_section(S_USERSUPP);
51 /* defrag the room files and message lists */
52 begin_critical_section(S_QUICKROOM);
53 gdbm_reorganize(gdbms[CDB_QUICKROOM]);
54 gdbm_reorganize(gdbms[CDB_MSGLISTS]);
55 end_critical_section(S_QUICKROOM);
57 /* defrag the floor table */
58 begin_critical_section(S_FLOORTAB);
59 gdbm_reorganize(gdbms[CDB_FLOORTAB]);
60 end_critical_section(S_FLOORTAB);
65 * Open the various gdbm databases we'll be using. Any database which
66 * does not exist should be created.
68 void open_databases() {
71 gdbms[CDB_MSGMAIN] = gdbm_open("msgmain.gdbm", 8192,
72 GDBM_WRCREAT, 0600, NULL);
73 if (gdbms[CDB_MSGMAIN] == NULL) {
74 lprintf(2, "Cannot open msgmain: %s\n",
75 gdbm_strerror(gdbm_errno));
78 gdbms[CDB_USERSUPP] = gdbm_open("usersupp.gdbm", 0,
79 GDBM_WRCREAT, 0600, NULL);
80 if (gdbms[CDB_USERSUPP] == NULL) {
81 lprintf(2, "Cannot open usersupp: %s\n",
82 gdbm_strerror(gdbm_errno));
85 gdbms[CDB_QUICKROOM] = gdbm_open("quickroom.gdbm", 0,
86 GDBM_WRCREAT, 0600, NULL);
87 if (gdbms[CDB_QUICKROOM] == NULL) {
88 lprintf(2, "Cannot open quickroom: %s\n",
89 gdbm_strerror(gdbm_errno));
92 gdbms[CDB_FLOORTAB] = gdbm_open("floortab.gdbm", 0,
93 GDBM_WRCREAT, 0600, NULL);
94 if (gdbms[CDB_FLOORTAB] == NULL) {
95 lprintf(2, "Cannot open floortab: %s\n",
96 gdbm_strerror(gdbm_errno));
99 gdbms[CDB_MSGLISTS] = gdbm_open("msglists.gdbm", 0,
100 GDBM_WRCREAT, 0600, NULL);
101 if (gdbms[CDB_MSGLISTS] == NULL) {
102 lprintf(2, "Cannot open msglists: %s\n",
103 gdbm_strerror(gdbm_errno));
106 gdbms[CDB_MAILBOXES] = gdbm_open("mailboxes.gdbm", 0,
107 GDBM_WRCREAT, 0600, NULL);
108 if (gdbms[CDB_MAILBOXES] == NULL) {
109 lprintf(2, "Cannot open mailboxes: %s\n",
110 gdbm_strerror(gdbm_errno));
113 for (a=0; a<MAXKEYS; ++a) {
115 dtkey[a].dptr = NULL;
123 * Close all of the gdbm database files we've opened. This can be done
124 * in a loop, since it's just a bunch of closes.
126 void close_databases() {
130 for (a=0; a<MAXCDB; ++a) {
131 lprintf(7, "Closing database %d\n", a);
132 gdbm_close(gdbms[a]);
135 for (a=0; a<MAXKEYS; ++a) {
136 if (dtkey[a].dptr != NULL) {
145 * Store a piece of data. Returns 0 if the operation was successful. If a
146 * datum already exists it should be overwritten.
148 int cdb_store(int cdb,
149 char *key, int keylen,
150 char *data, int datalen) {
156 ddata.dsize = datalen;
159 if ( gdbm_store(gdbms[cdb], dkey, ddata, GDBM_REPLACE) < 0 ) {
160 lprintf(2, "gdbm error: %s\n", gdbm_strerror(gdbm_errno));
169 * Delete a piece of data. Returns 0 if the operation was successful.
171 int cdb_delete(int cdb, char *key, int keylen) {
178 return(gdbm_delete(gdbms[cdb], dkey));
186 * Fetch a piece of data. If not found, returns NULL. Otherwise, it returns
187 * a struct cdbdata which it is the caller's responsibility to free later on
188 * using the cdb_free() routine.
190 struct cdbdata *cdb_fetch(int cdb, char *key, int keylen) {
192 struct cdbdata *tempcdb;
198 dret = gdbm_fetch(gdbms[cdb], dkey);
199 if (dret.dptr == NULL) {
203 tempcdb = (struct cdbdata *) malloc(sizeof(struct cdbdata));
204 if (tempcdb == NULL) {
205 lprintf(2, "Cannot allocate memory!\n");
208 tempcdb->len = dret.dsize;
209 tempcdb->ptr = dret.dptr;
215 * Free a cdbdata item (ok, this is really no big deal, but we might need to do
216 * more complex stuff with other database managers in the future).
218 void cdb_free(struct cdbdata *cdb) {
225 * Prepare for a sequential search of an entire database. (In the gdbm model,
226 * we do this by keeping an array dtkey[] of "the next" key for each session
227 * that is open. There is guaranteed to be no more than one traversal in
228 * progress per session at any given time.)
230 void cdb_rewind(int cdb) {
232 if (dtkey[CC->cs_pid].dptr != NULL) {
233 free(dtkey[CC->cs_pid].dptr);
236 dtkey[CC->cs_pid] = gdbm_firstkey(gdbms[cdb]);
241 * Fetch the next item in a sequential search. Returns a pointer to a
242 * cdbdata structure, or NULL if we've hit the end.
244 struct cdbdata *cdb_next_item(int cdb) {
246 struct cdbdata *cdbret;
249 if (dtkey[CC->cs_pid].dptr == NULL) { /* end of file */
253 dret = gdbm_fetch(gdbms[cdb], dtkey[CC->cs_pid]);
254 if (dret.dptr == NULL) { /* bad read */
255 free(dtkey[CC->cs_pid].dptr);
259 cdbret = (struct cdbdata *) malloc(sizeof(struct cdbdata));
260 cdbret->len = dret.dsize;
261 cdbret->ptr = dret.dptr;
263 dtkey[CC->cs_pid] = gdbm_nextkey(gdbms[cdb], dtkey[CC->cs_pid]);