1 /* back-bdb.h - bdb back-end header file */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2007 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 DN_BASE_PREFIX SLAP_INDEX_EQUALITY_PREFIX
30 #define DN_ONE_PREFIX '%'
31 #define DN_SUBTREE_PREFIX '@'
33 #define DBTzero(t) (memset((t), 0, sizeof(DBT)))
34 #define DBT2bv(t,bv) ((bv)->bv_val = (t)->data, \
35 (bv)->bv_len = (t)->size)
36 #define bv2DBT(bv,t) ((t)->data = (bv)->bv_val, \
37 (t)->size = (bv)->bv_len )
39 #define BDB_TXN_RETRIES 16
41 #define BDB_MAX_ADD_LOOP 30
43 #define BDB_SUFFIX ".bdb"
44 #define BDB_ID2ENTRY 0
48 /* The bdb on-disk entry format is pretty space-inefficient. Average
49 * sized user entries are 3-4K each. You need at least two entries to
50 * fit into a single database page, more is better. 64K is BDB's
51 * upper bound. Smaller pages are better for concurrency.
53 #ifndef BDB_ID2ENTRY_PAGESIZE
54 #define BDB_ID2ENTRY_PAGESIZE 16384
58 #define BDB_PAGESIZE 4096 /* BDB's original default */
61 #define DEFAULT_CACHE_SIZE 1000
63 /* The default search IDL stack cache depth */
64 #define DEFAULT_SEARCH_STACK_DEPTH 16
66 /* The minimum we can function with */
67 #define MINIMUM_SEARCH_STACK_DEPTH 8
69 typedef struct bdb_idl_cache_entry_s {
73 struct bdb_idl_cache_entry_s* idl_lru_prev;
74 struct bdb_idl_cache_entry_s* idl_lru_next;
75 } bdb_idl_cache_entry_t;
77 /* BDB backend specific entry info */
78 typedef struct bdb_entry_info {
79 struct bdb_entry_info *bei_parent;
82 /* we use the bei_id as a lockobj, but we need to make the size != 4
83 * to avoid conflicting with BDB's internal locks. So add a byte here
84 * that is always zero.
89 #define CACHE_ENTRY_DELETED 1
90 #define CACHE_ENTRY_NO_KIDS 2
91 #define CACHE_ENTRY_NOT_LINKED 4
92 #define CACHE_ENTRY_NO_GRANDKIDS 8
93 #define CACHE_ENTRY_LOADING 0x10
94 #define CACHE_ENTRY_WALKING 0x20
95 #define CACHE_ENTRY_ONELEVEL 0x40
98 * remaining fields require backend cache lock to access
100 struct berval bei_nrdn;
102 struct berval bei_rdn;
103 int bei_modrdns; /* track renames */
104 int bei_ckids; /* number of kids cached */
105 int bei_dkids; /* number of kids on-disk, plus 1 */
109 #ifdef SLAP_ZONE_ALLOC
110 struct bdb_info *bei_bdb;
113 ldap_pvt_thread_mutex_t bei_kids_mutex;
115 struct bdb_entry_info *bei_lrunext; /* for cache lru list */
116 struct bdb_entry_info *bei_lruprev;
119 #define BEI(e) ((EntryInfo *) ((e)->e_private))
121 /* for the in-core cache of entries */
122 typedef struct bdb_cache {
126 int c_eiused; /* EntryInfo's in use */
127 int c_leaves; /* EntryInfo leaf nodes */
129 EntryInfo *c_eifree; /* free list */
131 EntryInfo *c_lruhead; /* lru - add accessed entries here */
132 EntryInfo *c_lrutail; /* lru - rem lru entries from here */
133 ldap_pvt_thread_rdwr_t c_rwlock;
134 ldap_pvt_thread_mutex_t lru_head_mutex;
135 ldap_pvt_thread_mutex_t lru_tail_mutex;
136 u_int32_t c_locker; /* used by lru cleaner */
137 #ifdef SLAP_ZONE_ALLOC
142 #define CACHE_READ_LOCK 0
143 #define CACHE_WRITE_LOCK 1
145 #define BDB_INDICES 128
158 /* DB_ENV parameters */
159 /* The DB_ENV can be tuned via DB_CONFIG */
161 u_int32_t bi_dbenv_xflags; /* extra flags */
165 struct bdb_db_info **bi_databases;
166 ldap_pvt_thread_mutex_t bi_database_mutex;
167 int bi_db_opflags; /* db-specific flags */
169 slap_mask_t bi_defaultmask;
171 struct bdb_attrinfo **bi_attrs;
173 void *bi_search_stack;
174 int bi_search_stack_depth;
178 u_int32_t bi_txn_cp_min;
179 u_int32_t bi_txn_cp_kbyte;
180 struct re_s *bi_txn_cp_task;
181 struct re_s *bi_index_task;
187 ldap_pvt_thread_mutex_t bi_lastid_mutex;
188 int bi_idl_cache_max_size;
189 int bi_idl_cache_size;
190 Avlnode *bi_idl_tree;
191 bdb_idl_cache_entry_t *bi_idl_lru_head;
192 bdb_idl_cache_entry_t *bi_idl_lru_tail;
193 ldap_pvt_thread_rdwr_t bi_idl_tree_rwlock;
194 ldap_pvt_thread_mutex_t bi_idl_tree_lrulock;
195 alock_info_t bi_alock_info;
196 char *bi_db_config_path;
197 BerVarray bi_db_config;
199 #define BDB_IS_OPEN 0x01
200 #define BDB_HAS_CONFIG 0x02
201 #define BDB_UPD_CONFIG 0x04
202 #define BDB_DEL_INDEX 0x08
203 #define BDB_RE_OPEN 0x10
205 int bi_modrdns; /* number of modrdns completed */
206 ldap_pvt_thread_mutex_t bi_modrdns_mutex;
210 #define bi_id2entry bi_databases[BDB_ID2ENTRY]
211 #define bi_dn2id bi_databases[BDB_DN2ID]
213 struct bdb_lock_info {
214 struct bdb_lock_info *bli_next;
223 u_int32_t boi_locker;
225 struct bdb_lock_info *boi_locks; /* used when no txn */
228 #define DB_OPEN(db, file, name, type, flags, mode) \
229 ((db)->open)(db, file, name, type, flags, mode)
231 #if DB_VERSION_MAJOR < 4
232 #define LOCK_DETECT(env,f,t,a) lock_detect(env, f, t, a)
233 #define LOCK_GET(env,i,f,o,m,l) lock_get(env, i, f, o, m, l)
234 #define LOCK_PUT(env,l) lock_put(env, l)
235 #define TXN_CHECKPOINT(env,k,m,f) txn_checkpoint(env, k, m, f)
236 #define TXN_BEGIN(env,p,t,f) txn_begin((env), p, t, f)
237 #define TXN_PREPARE(txn,gid) txn_prepare((txn), (gid))
238 #define TXN_COMMIT(txn,f) txn_commit((txn), (f))
239 #define TXN_ABORT(txn) txn_abort((txn))
240 #define TXN_ID(txn) txn_id(txn)
241 #define XLOCK_ID(env, locker) lock_id(env, locker)
242 #define XLOCK_ID_FREE(env, locker) lock_id_free(env, locker)
244 #define LOCK_DETECT(env,f,t,a) (env)->lock_detect(env, f, t, a)
245 #define LOCK_GET(env,i,f,o,m,l) (env)->lock_get(env, i, f, o, m, l)
246 #define LOCK_PUT(env,l) (env)->lock_put(env, l)
247 #define TXN_CHECKPOINT(env,k,m,f) (env)->txn_checkpoint(env, k, m, f)
248 #define TXN_BEGIN(env,p,t,f) (env)->txn_begin((env), p, t, f)
249 #define TXN_PREPARE(txn,g) (txn)->prepare((txn), (g))
250 #define TXN_COMMIT(txn,f) (txn)->commit((txn), (f))
251 #define TXN_ABORT(txn) (txn)->abort((txn))
252 #define TXN_ID(txn) (txn)->id(txn)
253 #define XLOCK_ID(env, locker) (env)->lock_id(env, locker)
254 #define XLOCK_ID_FREE(env, locker) (env)->lock_id_free(env, locker)
256 /* BDB 4.1.17 adds txn arg to db->open */
257 #if DB_VERSION_FULL >= 0x04010011
259 #define DB_OPEN(db, file, name, type, flags, mode) \
260 ((db)->open)(db, NULL, file, name, type, flags, mode)
265 #define BDB_REUSE_LOCKERS
267 #define BDB_CSN_COMMIT 0
268 #define BDB_CSN_ABORT 1
269 #define BDB_CSN_RETRY 2
271 /* Copy an ID "src" to pointer "dst" in big-endian byte order */
272 #define BDB_ID2DISK( src, dst ) \
273 do { int i0; ID tmp; unsigned char *_p; \
274 tmp = (src); _p = (unsigned char *)(dst); \
275 for ( i0=sizeof(ID)-1; i0>=0; i0-- ) { \
276 _p[i0] = tmp & 0xff; tmp >>= 8; \
280 /* Copy a pointer "src" to a pointer "dst" from big-endian to native order */
281 #define BDB_DISK2ID( src, dst ) \
282 do { int i0; ID tmp = 0; unsigned char *_p; \
283 _p = (unsigned char *)(src); \
284 for ( i0=0; i0<sizeof(ID); i0++ ) { \
285 tmp <<= 8; tmp |= *_p++; \
291 /* for the cache of attribute information (which are indexed, etc.) */
292 typedef struct bdb_attrinfo {
293 AttributeDescription *ai_desc; /* attribute description cn;lang-en */
294 slap_mask_t ai_indexmask; /* how the attr is indexed */
295 slap_mask_t ai_newmask; /* new settings to replace old mask */
296 #ifdef LDAP_COMP_MATCH
297 ComponentReference* ai_cr; /*component indexing*/
301 /* These flags must not clash with SLAP_INDEX flags or ops in slap.h! */
302 #define BDB_INDEX_DELETING 0x8000U /* index is being modified */
303 #define BDB_INDEX_UPDATE_OP 0x03 /* performing an index update */
305 /* For slapindex to record which attrs in an entry belong to which
308 typedef struct AttrList {
309 struct AttrList *next;
313 typedef struct IndexRec {
318 #include "proto-bdb.h"
320 #endif /* _BACK_BDB_H_ */