1 /* back-bdb.h - bdb back-end header file */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2005 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>.
27 #define DB_VERSION_FULL ((DB_VERSION_MAJOR << 24) | (DB_VERSION_MINOR << 16) | DB_VERSION_PATCH)
29 #define BDB_SUBENTRIES 1
31 #define DN_BASE_PREFIX SLAP_INDEX_EQUALITY_PREFIX
32 #define DN_ONE_PREFIX '%'
33 #define DN_SUBTREE_PREFIX '@'
35 #define DBTzero(t) (memset((t), 0, sizeof(DBT)))
36 #define DBT2bv(t,bv) ((bv)->bv_val = (t)->data, \
37 (bv)->bv_len = (t)->size)
38 #define bv2DBT(bv,t) ((t)->data = (bv)->bv_val, \
39 (t)->size = (bv)->bv_len )
41 #define BDB_TXN_RETRIES 16
43 #define BDB_MAX_ADD_LOOP 30
45 #define BDB_SUFFIX ".bdb"
46 #define BDB_ID2ENTRY 0
50 /* The bdb on-disk entry format is pretty space-inefficient. Average
51 * sized user entries are 3-4K each. You need at least two entries to
52 * fit into a single database page, more is better. 64K is BDB's
53 * upper bound. Smaller pages are better for concurrency.
55 #ifndef BDB_ID2ENTRY_PAGESIZE
56 #define BDB_ID2ENTRY_PAGESIZE 16384
60 #define BDB_PAGESIZE 4096 /* BDB's original default */
63 #define DEFAULT_CACHE_SIZE 1000
65 /* The default search IDL stack cache depth */
66 #define DEFAULT_SEARCH_STACK_DEPTH 16
68 /* The minimum we can function with */
69 #define MINIMUM_SEARCH_STACK_DEPTH 8
71 typedef struct bdb_idl_cache_entry_s {
73 ldap_pvt_thread_rdwr_t idl_entry_rwlock;
76 struct bdb_idl_cache_entry_s* idl_lru_prev;
77 struct bdb_idl_cache_entry_s* idl_lru_next;
78 } bdb_idl_cache_entry_t;
80 /* BDB backend specific entry info */
81 typedef struct bdb_entry_info {
82 struct bdb_entry_info *bei_parent;
85 /* we use the bei_id as a lockobj, but we need to make the size != 4
86 * to avoid conflicting with BDB's internal locks. So add a byte here
87 * that is always zero.
92 #define CACHE_ENTRY_DELETED 1
93 #define CACHE_ENTRY_NO_KIDS 2
94 #define CACHE_ENTRY_NOT_LINKED 4
95 #define CACHE_ENTRY_NO_GRANDKIDS 8
96 #define CACHE_ENTRY_LOADING 0x10
99 * remaining fields require backend cache lock to access
101 struct berval bei_nrdn;
103 struct berval bei_rdn;
104 int bei_modrdns; /* track renames */
105 int bei_ckids; /* number of kids cached */
106 int bei_dkids; /* number of kids on-disk, plus 1 */
110 #ifdef SLAP_ZONE_ALLOC
111 struct bdb_info *bei_bdb;
114 ldap_pvt_thread_mutex_t bei_kids_mutex;
116 struct bdb_entry_info *bei_lrunext; /* for cache lru list */
117 struct bdb_entry_info *bei_lruprev;
120 #define BEI(e) ((EntryInfo *) ((e)->e_private))
122 /* for the in-core cache of entries */
123 typedef struct bdb_cache {
126 int c_eiused; /* EntryInfo's in use */
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 */
135 #ifdef SLAP_ZONE_ALLOC
140 #define CACHE_READ_LOCK 0
141 #define CACHE_WRITE_LOCK 1
143 #define BDB_INDICES 128
153 /* DB_ENV parameters */
154 /* The DB_ENV can be tuned via DB_CONFIG */
156 u_int32_t bi_dbenv_xflags; /* extra flags */
160 struct bdb_db_info **bi_databases;
161 ldap_pvt_thread_mutex_t bi_database_mutex;
162 int bi_db_opflags; /* db-specific flags */
164 slap_mask_t bi_defaultmask;
167 void *bi_search_stack;
168 int bi_search_stack_depth;
172 u_int32_t bi_txn_cp_min;
173 u_int32_t bi_txn_cp_kbyte;
174 void *bi_txn_cp_task;
180 ldap_pvt_thread_mutex_t bi_lastid_mutex;
181 int bi_idl_cache_max_size;
182 int bi_idl_cache_size;
183 Avlnode *bi_idl_tree;
184 bdb_idl_cache_entry_t *bi_idl_lru_head;
185 bdb_idl_cache_entry_t *bi_idl_lru_tail;
186 ldap_pvt_thread_rdwr_t bi_idl_tree_rwlock;
187 ldap_pvt_thread_mutex_t bi_idl_tree_lrulock;
188 alock_info_t bi_alock_info;
189 char *bi_db_config_path;
190 BerVarray bi_db_config;
192 #define BDB_IS_OPEN 0x01
193 #define BDB_HAS_CONFIG 0x02
194 #define BDB_UPD_CONFIG 0x04
195 #define BDB_DEL_INDEX 0x08
196 #define BDB_RE_OPEN 0x10
199 #define bi_id2entry bi_databases[BDB_ID2ENTRY]
200 #define bi_dn2id bi_databases[BDB_DN2ID]
202 struct bdb_lock_info {
203 struct bdb_lock_info *bli_next;
212 u_int32_t boi_locker;
214 struct bdb_lock_info *boi_locks; /* used when no txn */
217 #define DB_OPEN(db, file, name, type, flags, mode) \
218 (db)->open(db, file, name, type, flags, mode)
220 #if DB_VERSION_MAJOR < 4
221 #define LOCK_DETECT(env,f,t,a) lock_detect(env, f, t, a)
222 #define LOCK_GET(env,i,f,o,m,l) lock_get(env, i, f, o, m, l)
223 #define LOCK_PUT(env,l) lock_put(env, l)
224 #define TXN_CHECKPOINT(env,k,m,f) txn_checkpoint(env, k, m, f)
225 #define TXN_BEGIN(env,p,t,f) txn_begin((env), p, t, f)
226 #define TXN_PREPARE(txn,gid) txn_prepare((txn), (gid))
227 #define TXN_COMMIT(txn,f) txn_commit((txn), (f))
228 #define TXN_ABORT(txn) txn_abort((txn))
229 #define TXN_ID(txn) txn_id(txn)
230 #define XLOCK_ID(env, locker) lock_id(env, locker)
231 #define XLOCK_ID_FREE(env, locker) lock_id_free(env, locker)
233 #define LOCK_DETECT(env,f,t,a) (env)->lock_detect(env, f, t, a)
234 #define LOCK_GET(env,i,f,o,m,l) (env)->lock_get(env, i, f, o, m, l)
235 #define LOCK_PUT(env,l) (env)->lock_put(env, l)
236 #define TXN_CHECKPOINT(env,k,m,f) (env)->txn_checkpoint(env, k, m, f)
237 #define TXN_BEGIN(env,p,t,f) (env)->txn_begin((env), p, t, f)
238 #define TXN_PREPARE(txn,g) (txn)->prepare((txn), (g))
239 #define TXN_COMMIT(txn,f) (txn)->commit((txn), (f))
240 #define TXN_ABORT(txn) (txn)->abort((txn))
241 #define TXN_ID(txn) (txn)->id(txn)
242 #define XLOCK_ID(env, locker) (env)->lock_id(env, locker)
243 #define XLOCK_ID_FREE(env, locker) (env)->lock_id_free(env, locker)
245 /* BDB 4.1.17 adds txn arg to db->open */
246 #if DB_VERSION_FULL >= 0x04010011
248 #define DB_OPEN(db, file, name, type, flags, mode) \
249 (db)->open(db, NULL, file, name, type, flags, mode)
254 #define BDB_REUSE_LOCKERS
256 #define BDB_CSN_COMMIT 0
257 #define BDB_CSN_ABORT 1
258 #define BDB_CSN_RETRY 2
260 /* Copy an ID "src" to pointer "dst" in big-endian byte order */
261 #define BDB_ID2DISK( src, dst ) \
262 do { int i0; ID tmp; unsigned char *_p; \
263 tmp = (src); _p = (char *)(dst); \
264 for ( i0=sizeof(ID)-1; i0>=0; i0-- ) { \
265 _p[i0] = tmp & 0xff; tmp >>= 8; \
269 /* Copy a pointer "src" to a pointer "dst" from big-endian to native order */
270 #define BDB_DISK2ID( src, dst ) \
271 do { int i0; ID tmp = 0; unsigned char *_p; \
272 _p = (unsigned char *)(src); \
273 for ( i0=0; i0<sizeof(ID); i0++ ) { \
274 tmp <<= 8; tmp |= *_p++; \
280 /* for the cache of attribute information (which are indexed, etc.) */
281 typedef struct bdb_attrinfo {
282 AttributeDescription *ai_desc; /* attribute description cn;lang-en */
283 slap_mask_t ai_indexmask; /* how the attr is indexed */
284 slap_mask_t ai_newmask; /* new settings to replace old mask */
285 #ifdef LDAP_COMP_MATCH
286 ComponentReference* ai_cr; /*component indexing*/
290 /* These flags must not clash with SLAP_INDEX flags or ops in slap.h! */
291 #define BDB_INDEX_DELETING 0x8000U /* index is being modified */
292 #define BDB_INDEX_UPDATE_OP 0x03 /* performing an index update */
294 #include "proto-bdb.h"
296 #endif /* _BACK_BDB_H_ */