1 /* back-bdb.h - bdb back-end header file */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2004 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
26 #define BDB_SUBENTRIES 1
28 #define DN_BASE_PREFIX SLAP_INDEX_EQUALITY_PREFIX
29 #define DN_ONE_PREFIX '%'
30 #define DN_SUBTREE_PREFIX '@'
32 #define DBTzero(t) (memset((t), 0, sizeof(DBT)))
33 #define DBT2bv(t,bv) ((bv)->bv_val = (t)->data, \
34 (bv)->bv_len = (t)->size)
35 #define bv2DBT(bv,t) ((t)->data = (bv)->bv_val, \
36 (t)->size = (bv)->bv_len )
38 #define BDB_TXN_RETRIES 16
40 #define BDB_MAX_ADD_LOOP 30
45 #define BDB_TMP_SUBDIR "tmp"
46 #define BDB_LG_SUBDIR "log"
47 #define BDB_DATA_SUBDIR "data"
50 #define BDB_SUFFIX ".bdb"
51 #define BDB_ID2ENTRY 0
55 /* The bdb on-disk entry format is pretty space-inefficient. Average
56 * sized user entries are 3-4K each. You need at least two entries to
57 * fit into a single database page, more is better. 64K is BDB's
58 * upper bound. Smaller pages are better for concurrency.
60 #ifndef BDB_ID2ENTRY_PAGESIZE
61 #define BDB_ID2ENTRY_PAGESIZE 16384
65 #define BDB_PAGESIZE 4096 /* BDB's original default */
68 #define DEFAULT_CACHE_SIZE 1000
70 /* The default search IDL stack cache depth */
71 #define DEFAULT_SEARCH_STACK_DEPTH 16
73 /* The minimum we can function with */
74 #define MINIMUM_SEARCH_STACK_DEPTH 8
76 typedef struct bdb_idl_cache_entry_s {
78 ldap_pvt_thread_rdwr_t idl_entry_rwlock;
81 struct bdb_idl_cache_entry_s* idl_lru_prev;
82 struct bdb_idl_cache_entry_s* idl_lru_next;
83 } bdb_idl_cache_entry_t;
85 /* BDB backend specific entry info */
86 typedef struct bdb_entry_info {
87 struct bdb_entry_info *bei_parent;
90 /* we use the bei_id as a lockobj, but we need to make the size != 4
91 * to avoid conflicting with BDB's internal locks. So add a byte here
92 * that is always zero.
97 #define CACHE_ENTRY_DELETED 1
98 #define CACHE_ENTRY_NO_KIDS 2
99 #define CACHE_ENTRY_NOT_LINKED 4
100 #define CACHE_ENTRY_NO_GRANDKIDS 8
101 #define CACHE_ENTRY_LOADING 0x10
104 * remaining fields require backend cache lock to access
106 struct berval bei_nrdn;
108 struct berval bei_rdn;
109 int bei_modrdns; /* track renames */
110 int bei_ckids; /* number of kids cached */
111 int bei_dkids; /* number of kids on-disk, plus 1 */
115 ldap_pvt_thread_mutex_t bei_kids_mutex;
117 struct bdb_entry_info *bei_lrunext; /* for cache lru list */
118 struct bdb_entry_info *bei_lruprev;
121 #define BEI(e) ((EntryInfo *) ((e)->e_private))
123 /* for the in-core cache of entries */
124 typedef struct bdb_cache {
128 EntryInfo *c_eifree; /* free list */
130 EntryInfo *c_lruhead; /* lru - add accessed entries here */
131 EntryInfo *c_lrutail; /* lru - rem lru entries from here */
132 ldap_pvt_thread_rdwr_t c_rwlock;
133 ldap_pvt_thread_mutex_t lru_mutex;
134 u_int32_t c_locker; /* used by lru cleaner */
137 #define CACHE_READ_LOCK 0
138 #define CACHE_WRITE_LOCK 1
140 #define BDB_INDICES 128
150 /* DB_ENV parameters */
151 /* The DB_ENV can be tuned via DB_CONFIG */
153 u_int32_t bi_dbenv_xflags; /* extra flags */
157 struct bdb_db_info **bi_databases;
158 ldap_pvt_thread_mutex_t bi_database_mutex;
159 int bi_db_opflags; /* db-specific flags */
161 slap_mask_t bi_defaultmask;
164 void *bi_search_stack;
165 int bi_search_stack_depth;
169 u_int32_t bi_txn_cp_min;
170 u_int32_t bi_txn_cp_kbyte;
176 ldap_pvt_thread_mutex_t bi_lastid_mutex;
177 LDAP_LIST_HEAD(pl, slap_op) bi_psearch_list;
178 ldap_pvt_thread_rdwr_t bi_pslist_rwlock;
179 LDAP_LIST_HEAD(se, slap_session_entry) bi_session_list;
180 int bi_idl_cache_max_size;
181 int bi_idl_cache_size;
182 Avlnode *bi_idl_tree;
183 bdb_idl_cache_entry_t *bi_idl_lru_head;
184 bdb_idl_cache_entry_t *bi_idl_lru_tail;
185 ldap_pvt_thread_rdwr_t bi_idl_tree_rwlock;
186 ldap_pvt_thread_mutex_t bi_idl_tree_lrulock;
189 #define bi_id2entry bi_databases[BDB_ID2ENTRY]
190 #define bi_dn2id bi_databases[BDB_DN2ID]
195 DB_LOCK boi_lock; /* used when no txn */
197 u_int32_t boi_locker;
201 #define DB_OPEN(db, file, name, type, flags, mode) \
202 (db)->open(db, file, name, type, flags, mode)
204 #if DB_VERSION_MAJOR < 4
205 #define LOCK_DETECT(env,f,t,a) lock_detect(env, f, t, a)
206 #define LOCK_GET(env,i,f,o,m,l) lock_get(env, i, f, o, m, l)
207 #define LOCK_PUT(env,l) lock_put(env, l)
208 #define TXN_CHECKPOINT(env,k,m,f) txn_checkpoint(env, k, m, f)
209 #define TXN_BEGIN(env,p,t,f) txn_begin((env), p, t, f)
210 #define TXN_PREPARE(txn,gid) txn_prepare((txn), (gid))
211 #define TXN_COMMIT(txn,f) txn_commit((txn), (f))
212 #define TXN_ABORT(txn) txn_abort((txn))
213 #define TXN_ID(txn) txn_id(txn)
214 #define XLOCK_ID(env, locker) lock_id(env, locker)
215 #define XLOCK_ID_FREE(env, locker) lock_id_free(env, locker)
217 #define LOCK_DETECT(env,f,t,a) (env)->lock_detect(env, f, t, a)
218 #define LOCK_GET(env,i,f,o,m,l) (env)->lock_get(env, i, f, o, m, l)
219 #define LOCK_PUT(env,l) (env)->lock_put(env, l)
220 #define TXN_CHECKPOINT(env,k,m,f) (env)->txn_checkpoint(env, k, m, f)
221 #define TXN_BEGIN(env,p,t,f) (env)->txn_begin((env), p, t, f)
222 #define TXN_PREPARE(txn,g) (txn)->prepare((txn), (g))
223 #define TXN_COMMIT(txn,f) (txn)->commit((txn), (f))
224 #define TXN_ABORT(txn) (txn)->abort((txn))
225 #define TXN_ID(txn) (txn)->id(txn)
226 #define XLOCK_ID(env, locker) (env)->lock_id(env, locker)
227 #define XLOCK_ID_FREE(env, locker) (env)->lock_id_free(env, locker)
229 /* BDB 4.1.17 adds txn arg to db->open */
230 #if DB_VERSION_MINOR > 1 || DB_VERSION_PATCH >= 17
232 #define DB_OPEN(db, file, name, type, flags, mode) \
233 (db)->open(db, NULL, file, name, type, (flags)|DB_AUTO_COMMIT, mode)
238 #define BDB_REUSE_LOCKERS
240 #define BDB_CSN_COMMIT 0
241 #define BDB_CSN_ABORT 1
242 #define BDB_CSN_RETRY 2
246 #include "proto-bdb.h"
248 #endif /* _BACK_BDB_H_ */