3 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
7 #ifndef _PROTO_BACK_LDBM
8 #define _PROTO_BACK_LDBM
10 #include <ldap_cdefs.h>
19 Entry *deref_internal_r LDAP_P((
27 #define deref_entry_r( be, e, err, matched, text ) \
28 deref_internal_r( be, e, NULL, err, matched, text )
29 #define deref_dn_r( be, dn, err, matched, text ) \
30 deref_internal_r( be, NULL, dn, err, matched, text)
36 void attr_mask LDAP_P(( struct ldbminfo *li,
38 slap_index *indexmask ));
40 int attr_index_config LDAP_P(( struct ldbminfo *li,
41 const char *fname, int lineno,
42 int argc, char **argv, int init ));
43 void attr_index_destroy LDAP_P(( Avlnode *tree ));
49 int cache_add_entry_rw LDAP_P(( Cache *cache, Entry *e, int rw ));
50 int cache_update_entry LDAP_P(( Cache *cache, Entry *e ));
51 void cache_return_entry_rw LDAP_P(( Cache *cache, Entry *e, int rw ));
52 #define cache_return_entry_r(c, e) cache_return_entry_rw((c), (e), 0)
53 #define cache_return_entry_w(c, e) cache_return_entry_rw((c), (e), 1)
55 ID cache_find_entry_dn2id LDAP_P(( Backend *be, Cache *cache, const char *dn ));
56 Entry * cache_find_entry_id LDAP_P(( Cache *cache, ID id, int rw ));
57 int cache_delete_entry LDAP_P(( Cache *cache, Entry *e ));
58 void cache_release_all LDAP_P(( Cache *cache ));
64 DBCache * ldbm_cache_open LDAP_P(( Backend *be,
65 const char *name, const char *suffix, int flags ));
66 void ldbm_cache_close LDAP_P(( Backend *be, DBCache *db ));
67 void ldbm_cache_really_close LDAP_P(( Backend *be, DBCache *db ));
68 void ldbm_cache_flush_all LDAP_P(( Backend *be ));
69 Datum ldbm_cache_fetch LDAP_P(( DBCache *db, Datum key ));
70 int ldbm_cache_store LDAP_P(( DBCache *db, Datum key, Datum data, int flags ));
71 int ldbm_cache_delete LDAP_P(( DBCache *db, Datum key ));
77 int dn2id_add LDAP_P(( Backend *be, const char *dn, ID id ));
78 ID dn2id LDAP_P(( Backend *be, const char *dn ));
79 ID_BLOCK *dn2idl LDAP_P(( Backend *be, const char *dn, int prefix ));
80 int dn2id_delete LDAP_P(( Backend *be, const char *dn, ID id ));
82 Entry * dn2entry_rw LDAP_P(( Backend *be, const char *dn, Entry **matched, int rw ));
83 #define dn2entry_r(be, dn, m) dn2entry_rw((be), (dn), (m), 0)
84 #define dn2entry_w(be, dn, m) dn2entry_rw((be), (dn), (m), 1)
89 int ldbm_back_entry_release_rw LDAP_P(( Backend *be, Entry *e, int rw ));
95 ID_BLOCK * filter_candidates LDAP_P(( Backend *be, Filter *f ));
101 int id2children_add LDAP_P(( Backend *be, Entry *p, Entry *e ));
102 int id2children_remove LDAP_P(( Backend *be, Entry *p, Entry *e ));
103 int has_children LDAP_P(( Backend *be, Entry *p ));
109 int id2entry_add LDAP_P(( Backend *be, Entry *e ));
110 int id2entry_delete LDAP_P(( Backend *be, Entry *e ));
112 Entry * id2entry_rw LDAP_P(( Backend *be, ID id, int rw ));
113 #define id2entry_r(be, id) id2entry_rw((be), (id), 0)
114 #define id2entry_w(be, id) id2entry_rw((be), (id), 1)
120 ID_BLOCK * idl_alloc LDAP_P(( unsigned int nids ));
121 ID_BLOCK * idl_allids LDAP_P(( Backend *be ));
122 void idl_free LDAP_P(( ID_BLOCK *idl ));
123 ID_BLOCK * idl_fetch LDAP_P(( Backend *be, DBCache *db, Datum key ));
124 int idl_insert_key LDAP_P(( Backend *be, DBCache *db, Datum key, ID id ));
125 int idl_insert LDAP_P(( ID_BLOCK **idl, ID id, unsigned int maxids ));
126 int idl_delete_key LDAP_P(( Backend *be, DBCache *db, Datum key, ID id ));
127 ID_BLOCK * idl_intersection LDAP_P(( Backend *be, ID_BLOCK *a, ID_BLOCK *b ));
128 ID_BLOCK * idl_union LDAP_P(( Backend *be, ID_BLOCK *a, ID_BLOCK *b ));
129 ID_BLOCK * idl_notin LDAP_P(( Backend *be, ID_BLOCK *a, ID_BLOCK *b ));
130 ID idl_firstid LDAP_P(( ID_BLOCK *idl, ID *cursor ));
131 ID idl_nextid LDAP_P(( ID_BLOCK *idl, ID *cursor ));
136 #ifdef SLAPD_SCHEMA_NOT_COMPAT
140 AttributeDescription *desc,
144 struct berval **prefix ));
147 index_values LDAP_P((
149 AttributeDescription *desc,
150 struct berval **vals,
155 int index_entry LDAP_P(( Backend *be, int r, Entry *e, Attribute *ap ));
156 #define index_entry_add(be,e,ap) index_entry((be),SLAP_INDEX_ADD_OP,(e),(ap))
157 #define index_entry_del(be,e,ap) index_entry((be),SLAP_INDEX_DELETE_OP,(e),(ap))
159 #ifndef SLAPD_SCHEMA_NOT_COMPAT
160 int index_change_values LDAP_P((
163 struct berval **vals,
167 ID_BLOCK * index_read LDAP_P(( Backend *be,
168 char *desc, int indextype, char *val ));
191 extern int ldbm_back_exop_passwd LDAP_P(( BackendDB *bd,
192 Connection *conn, Operation *op,
194 struct berval *reqdata,
196 struct berval **rspdata,
197 LDAPControl ***rspctrls,
199 struct berval *** refs ));
204 * These prototypes are placed here because they are used by modify and
205 * modify rdn which are implemented in different files.
207 * We need ldbm_internal_modify here because of LDAP modrdn & modify use
208 * it. If we do not add this, there would be a bunch of code replication
209 * here and there and of course the likelihood of bugs increases.
210 * Juan C. Gomez (gomez@engr.sgi.com) 05/18/99
214 /* returns LDAP error code indicating error OR SLAPD_ABANDON */
215 int ldbm_modify_internal LDAP_P((Backend *be,
216 Connection *conn, Operation *op,
217 const char *dn, Modifications *mods, Entry *e,
220 #ifdef HAVE_CYRUS_SASL
224 int ldbm_sasl_authorize LDAP_P((
226 const char *auth_identity,
227 const char *requested_user,
229 const char **errstring ));
230 int ldbm_sasl_getsecret LDAP_P((
232 const char *mechanism,
233 const char *auth_identity,
235 sasl_secret_t **secret ));
236 int ldbm_sasl_putsecret LDAP_P((
238 const char *mechanism,
239 const char *auth_identity,
241 const sasl_secret_t *secret ));
242 #endif /* HAVE_CYRUS_SASL */
248 ID next_id LDAP_P(( Backend *be ));
249 ID next_id_get LDAP_P(( Backend *be ));
250 ID next_id_write LDAP_P(( Backend *be, ID id ));