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,
37 AttributeDescription *desc,
38 slap_mask_t *indexmask ));
40 int attr_index_config LDAP_P(( struct ldbminfo *li,
41 const char *fname, int lineno,
42 int argc, char **argv ));
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)
54 void cache_entry_commit LDAP_P(( Entry *e ));
56 ID cache_find_entry_dn2id LDAP_P(( Backend *be, Cache *cache, const char *dn ));
57 ID cache_find_entry_ndn2id LDAP_P(( Backend *be, Cache *cache, const char *ndn ));
58 Entry * cache_find_entry_id LDAP_P(( Cache *cache, ID id, int rw ));
59 int cache_delete_entry LDAP_P(( Cache *cache, Entry *e ));
60 void cache_release_all LDAP_P(( Cache *cache ));
66 DBCache * ldbm_cache_open LDAP_P(( Backend *be,
67 const char *name, const char *suffix, int flags ));
68 void ldbm_cache_close LDAP_P(( Backend *be, DBCache *db ));
69 void ldbm_cache_really_close LDAP_P(( Backend *be, DBCache *db ));
70 void ldbm_cache_flush_all LDAP_P(( Backend *be ));
71 void ldbm_cache_sync LDAP_P(( Backend *be ));
72 Datum ldbm_cache_fetch LDAP_P(( DBCache *db, Datum key ));
73 int ldbm_cache_store LDAP_P(( DBCache *db, Datum key, Datum data, int flags ));
74 int ldbm_cache_delete LDAP_P(( DBCache *db, Datum key ));
75 void *ldbm_cache_sync_daemon LDAP_P(( void *));
81 int dn2id_add LDAP_P(( Backend *be, const char *dn, ID id ));
82 int dn2id LDAP_P(( Backend *be, const char *dn, ID *idp ));
83 int dn2idl LDAP_P(( Backend *be, const char *dn, int prefix, ID_BLOCK **idlp ));
84 int dn2id_delete LDAP_P(( Backend *be, const char *dn, ID id ));
86 Entry * dn2entry_rw LDAP_P(( Backend *be, const char *dn, Entry **matched, int rw ));
87 #define dn2entry_r(be, dn, m) dn2entry_rw((be), (dn), (m), 0)
88 #define dn2entry_w(be, dn, m) dn2entry_rw((be), (dn), (m), 1)
93 int ldbm_back_entry_release_rw LDAP_P(( Backend *be,
94 Connection *conn, Operation *op,
101 ID_BLOCK * filter_candidates LDAP_P(( Backend *be, Filter *f ));
107 int id2children_add LDAP_P(( Backend *be, Entry *p, Entry *e ));
108 int id2children_remove LDAP_P(( Backend *be, Entry *p, Entry *e ));
109 int has_children LDAP_P(( Backend *be, Entry *p ));
115 int id2entry_add LDAP_P(( Backend *be, Entry *e ));
116 int id2entry_delete LDAP_P(( Backend *be, Entry *e ));
118 Entry * id2entry_rw LDAP_P(( Backend *be, ID id, int rw ));
119 #define id2entry_r(be, id) id2entry_rw((be), (id), 0)
120 #define id2entry_w(be, id) id2entry_rw((be), (id), 1)
126 ID_BLOCK * idl_alloc LDAP_P(( unsigned int nids ));
127 ID_BLOCK * idl_allids LDAP_P(( Backend *be ));
128 void idl_free LDAP_P(( ID_BLOCK *idl ));
129 ID_BLOCK * idl_fetch LDAP_P(( Backend *be, DBCache *db, Datum key ));
130 int idl_insert_key LDAP_P(( Backend *be, DBCache *db, Datum key, ID id ));
131 int idl_insert LDAP_P(( ID_BLOCK **idl, ID id, unsigned int maxids ));
132 int idl_delete_key LDAP_P(( Backend *be, DBCache *db, Datum key, ID id ));
133 ID_BLOCK * idl_intersection LDAP_P(( Backend *be, ID_BLOCK *a, ID_BLOCK *b ));
134 ID_BLOCK * idl_union LDAP_P(( Backend *be, ID_BLOCK *a, ID_BLOCK *b ));
135 ID_BLOCK * idl_notin LDAP_P(( Backend *be, ID_BLOCK *a, ID_BLOCK *b ));
136 ID idl_firstid LDAP_P(( ID_BLOCK *idl, ID *cursor ));
137 ID idl_nextid LDAP_P(( ID_BLOCK *idl, ID *cursor ));
145 AttributeDescription *desc,
149 struct berval *prefix ));
152 index_values LDAP_P((
154 AttributeDescription *desc,
155 struct berval **vals,
159 int index_entry LDAP_P(( Backend *be, int r, Entry *e, Attribute *ap ));
160 #define index_entry_add(be,e,ap) index_entry((be),SLAP_INDEX_ADD_OP,(e),(ap))
161 #define index_entry_del(be,e,ap) index_entry((be),SLAP_INDEX_DELETE_OP,(e),(ap))
184 extern int ldbm_back_exop_passwd LDAP_P(( BackendDB *bd,
185 Connection *conn, Operation *op,
187 struct berval *reqdata,
189 struct berval **rspdata,
190 LDAPControl ***rspctrls,
192 struct berval *** refs ));
197 * These prototypes are placed here because they are used by modify and
198 * modify rdn which are implemented in different files.
200 * We need ldbm_internal_modify here because of LDAP modrdn & modify use
201 * it. If we do not add this, there would be a bunch of code replication
202 * here and there and of course the likelihood of bugs increases.
203 * Juan C. Gomez (gomez@engr.sgi.com) 05/18/99
207 /* returns LDAP error code indicating error OR SLAPD_ABANDON */
208 int ldbm_modify_internal LDAP_P((Backend *be,
209 Connection *conn, Operation *op,
210 const char *dn, Modifications *mods, Entry *e,
211 const char **text, char *textbuf, size_t textlen ));
217 int next_id LDAP_P(( Backend *be, ID *idp ));
218 int next_id_get LDAP_P(( Backend *be, ID *idp ));
219 int next_id_write LDAP_P(( Backend *be, ID id ));