1 /* back-bdb2.h - ldap bdb2 back-end header file */
11 #define DEFAULT_CACHE_SIZE 1000
13 /* since DEFAULT_DB_PAGE_SIZE is 1K, we have 128K,
14 which is suggested by Sleepycat */
15 #define DEFAULT_DBCACHE_SIZE (128 * DEFAULT_DB_PAGE_SIZE)
17 #define DEFAULT_DB_DIRECTORY "/usr/tmp"
18 #define DEFAULT_MODE 0600
23 * there is a single index for each attribute. these prefixes insure
24 * that there is no collision among keys.
26 #define EQ_PREFIX '=' /* prefix for equality keys */
27 #define APPROX_PREFIX '~' /* prefix for approx keys */
28 #define SUB_PREFIX '*' /* prefix for substring keys */
29 #define CONT_PREFIX '\\' /* prefix for continuation keys */
31 #define UNKNOWN_PREFIX '?' /* prefix for unknown keys */
33 #define DEFAULT_BLOCKSIZE 8192
36 * This structure represents an id block on disk and an id list
39 * The fields have the following meanings:
41 * b_nmax maximum number of ids in this block. if this is == ALLIDSBLOCK,
42 * then this block represents all ids.
43 * b_nids current number of ids in use in this block. if this
44 * is == INDBLOCK, then this block is an indirect block
45 * containing a list of other blocks containing actual ids.
46 * the list is terminated by an id of NOID.
47 * b_ids a list of the actual ids themselves
52 #define ID_BLOCK_NMAX_OFFSET 0
53 #define ID_BLOCK_NIDS_OFFSET 1
54 #define ID_BLOCK_IDS_OFFSET 2
56 /* all ID_BLOCK macros operate on a pointer to a ID_BLOCK */
58 #define ID_BLOCK_NMAX(b) ((b)[ID_BLOCK_NMAX_OFFSET])
59 #define ID_BLOCK_NIDS(b) ((b)[ID_BLOCK_NIDS_OFFSET])
60 #define ID_BLOCK_ID(b, n) ((b)[ID_BLOCK_IDS_OFFSET+(n)])
62 #define ID_BLOCK_NOID(b, n) (ID_BLOCK_ID((b),(n)) == NOID)
64 #define ID_BLOCK_ALLIDS_VALUE 0
65 #define ID_BLOCK_ALLIDS(b) (ID_BLOCK_NMAX(b) == ID_BLOCK_ALLIDS_VALUE)
67 #define ID_BLOCK_INDIRECT_VALUE 0
68 #define ID_BLOCK_INDIRECT(b) (ID_BLOCK_NIDS(b) == ID_BLOCK_INDIRECT_VALUE)
70 /* for the in-core cache of entries */
76 Entry *c_lruhead; /* lru - add accessed entries here */
77 Entry *c_lrutail; /* lru - rem lru entries from here */
78 ldap_pvt_thread_mutex_t c_mutex;
81 /* for the cache of open index files (re-used for txn) */
94 typedef struct dbcache BDB2_TXN_FILES;
97 /* for the cache of attribute information (which are indexed, etc.) */
99 char *ai_type; /* type name (cn, sn, ...) */
100 int ai_indexmask; /* how the attr is indexed */
101 #define INDEX_PRESENCE 0x01
102 #define INDEX_EQUALITY 0x02
103 #define INDEX_APPROX 0x04
104 #define INDEX_SUB 0x08
105 #define INDEX_UNKNOWN 0x10
106 #define INDEX_FROMINIT 0x20
107 int ai_syntaxmask; /* what kind of syntax */
109 #define SYNTAX_CIS 0x01
110 #define SYNTAX_CES 0x02
111 #define SYNTAX_BIN 0x04
116 #define MAXDBCACHE 10
118 /* this could be made an option */
119 #ifndef SLAPD_NEXTID_CHUNK
120 #define SLAPD_NEXTID_CHUNK 32
126 typedef struct _bdb2_txn_head {
128 /* counter and timer to control checkpoints */
132 /* a list of all DB files in use */
133 BDB2_TXN_FILES *dbFiles;
135 /* for performance reasons we have pointers to fixed descriptors */
136 BDB2_TXN_FILES *dbFileHandle[4];
137 #define BDB2_DB_DN_FILE 0
138 #define BDB2_DB_DN2ID_FILE 1
139 #define BDB2_DB_ID2ENTRY_FILE 2
140 #define BDB2_DB_ID2CHILDREN_FILE 3
141 #define BDB2_DB_OC_IDX_FILE 4
143 /* is the default attribute index set to non-none */
145 #define BDB2_WITH_DEF_IDX 1
150 /* end of TP stuff */
154 #if SLAPD_NEXTID_CHUNK > 1
157 char *li_nextid_file;
158 ldap_pvt_thread_mutex_t li_root_mutex;
159 ldap_pvt_thread_mutex_t li_add_mutex;
160 ldap_pvt_thread_mutex_t li_nextid_mutex;
163 struct cache li_cache;
167 struct dbcache li_dbcache[MAXDBCACHE];
168 ldap_pvt_thread_mutex_t li_dbcache_mutex;
169 ldap_pvt_thread_cond_t li_dbcache_cv;
171 /* Berkeley DB2 Environment */
174 BDB2_TXN_HEAD li_txn_head;
179 extern int bdb2i_with_dbenv;
181 #include "proto-back-bdb2.h"
185 #endif /* _back_bdb2_h_ */