1 /* id2entry.c - routines to deal with the id2entry database */
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>.
20 #include <ac/string.h>
24 static int bdb_id2entry_put(
30 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
31 DB *db = bdb->bi_id2entry->bdi_db;
37 struct berval odn, ondn;
39 /* We only store rdns, and they go in the dn2id database. */
41 odn = e->e_name; ondn = e->e_nname;
43 e->e_name = slap_empty_bv;
44 e->e_nname = slap_empty_bv;
48 /* Store ID in BigEndian format */
50 key.size = sizeof(ID);
51 BDB_ID2DISK( e->e_id, &nid );
53 rc = entry_encode( e, &bv );
55 e->e_name = odn; e->e_nname = ondn;
57 if( rc != LDAP_SUCCESS ) {
64 rc = db->put( db, tid, &key, &data, flag );
71 * This routine adds (or updates) an entry on disk.
72 * The cache should be already be updated.
81 return bdb_id2entry_put(be, tid, e, DB_NOOVERWRITE);
84 int bdb_id2entry_update(
89 return bdb_id2entry_put(be, tid, e, 0);
98 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
99 DB *db = bdb->bi_id2entry->bdi_db;
109 key.size = sizeof(ID);
110 BDB_ID2DISK( id, &nid );
113 data.flags = DB_DBT_MALLOC;
116 rc = db->get( db, tid, &key, &data, bdb->bi_db_opflags );
122 DBT2bv( &data, &bv );
124 #ifdef SLAP_ZONE_ALLOC
125 rc = entry_decode(&bv, e, bdb->bi_cache.c_zctx);
127 rc = entry_decode(&bv, e);
133 /* only free on error. On success, the entry was
136 #ifndef SLAP_ZONE_ALLOC
140 #ifdef SLAP_ZONE_ALLOC
147 int bdb_id2entry_delete(
152 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
153 DB *db = bdb->bi_id2entry->bdi_db;
160 key.size = sizeof(ID);
161 BDB_ID2DISK( e->e_id, &nid );
163 /* delete from database */
164 rc = db->del( db, tid, &key, 0 );
169 #ifdef SLAP_ZONE_ALLOC
170 int bdb_entry_return(
171 struct bdb_info *bdb,
176 int bdb_entry_return(
181 #ifdef SLAP_ZONE_ALLOC
182 if (!slap_zn_validate(bdb->bi_cache.c_zctx, e, zseq)) {
186 /* Our entries are allocated in two blocks; the data comes from
187 * the db itself and the Entry structure and associated pointers
188 * are allocated in entry_decode. The db data pointer is saved
189 * in e_bv. Since the Entry structure is allocated as a single
190 * block, e_attrs is always a fixed offset from e. The exception
191 * is when an entry has been modified, in which case we also need
195 #ifdef LDAP_COMP_MATCH
196 comp_tree_free( e->e_attrs );
198 if( !e->e_bv.bv_val ) { /* Entry added by do_add */
202 if( (void *) e->e_attrs != (void *) (e+1)) {
203 attrs_free( e->e_attrs );
206 /* See if the DNs were changed by modrdn */
207 if( e->e_nname.bv_val < e->e_bv.bv_val || e->e_nname.bv_val >
208 e->e_bv.bv_val + e->e_bv.bv_len ) {
209 ch_free(e->e_name.bv_val);
210 ch_free(e->e_nname.bv_val);
211 e->e_name.bv_val = NULL;
212 e->e_nname.bv_val = NULL;
214 #ifndef SLAP_ZONE_ALLOC
216 /* In tool mode the e_bv buffer is realloc'd, leave it alone */
217 if( !(slapMode & SLAP_TOOL_MODE) ) {
218 free( e->e_bv.bv_val );
221 free( e->e_bv.bv_val );
222 #endif /* BDB_HIER */
223 #endif /* !SLAP_ZONE_ALLOC */
225 #ifdef SLAP_ZONE_ALLOC
226 slap_zn_free( e, bdb->bi_cache.c_zctx );
234 int bdb_entry_release(
239 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
240 struct bdb_op_info *boi = NULL;
242 /* slapMode : SLAP_SERVER_MODE, SLAP_TOOL_MODE,
243 SLAP_TRUNCATE_MODE, SLAP_UNDEFINED_MODE */
245 if ( slapMode == SLAP_SERVER_MODE ) {
246 /* If not in our cache, just free it */
247 if ( !e->e_private ) {
248 #ifdef SLAP_ZONE_ALLOC
249 return bdb_entry_return( bdb, e, -1 );
251 return bdb_entry_return( e );
254 /* free entry and reader or writer lock */
256 boi = (struct bdb_op_info *)op->o_private;
258 /* lock is freed with txn */
259 if ( !boi || boi->boi_txn ) {
260 bdb_unlocked_cache_return_entry_rw( &bdb->bi_cache, e, rw );
262 struct bdb_lock_info *bli, *prev;
263 for ( prev=(struct bdb_lock_info *)&boi->boi_locks,
264 bli = boi->boi_locks; bli; prev=bli, bli=bli->bli_next ) {
265 if ( bli->bli_id == e->e_id ) {
266 bdb_cache_return_entry_rw( bdb->bi_dbenv, &bdb->bi_cache,
267 e, rw, &bli->bli_lock );
268 prev->bli_next = bli->bli_next;
269 op->o_tmpfree( bli, op->o_tmpmemctx );
273 if ( !boi->boi_locks ) {
274 op->o_tmpfree( boi, op->o_tmpmemctx );
275 op->o_private = NULL;
279 #ifdef SLAP_ZONE_ALLOC
281 if (e->e_private != NULL) {
282 BEI(e)->bei_e = NULL;
283 zseq = BEI(e)->bei_zseq;
286 if (e->e_private != NULL)
287 BEI(e)->bei_e = NULL;
290 #ifdef SLAP_ZONE_ALLOC
291 bdb_entry_return ( bdb, e, zseq );
293 bdb_entry_return ( e );
300 /* return LDAP_SUCCESS IFF we can retrieve the specified entry.
306 AttributeDescription *at,
310 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
311 struct bdb_op_info *boi = NULL;
316 const char *at_name = at ? at->ad_cname.bv_val : "(null)";
318 u_int32_t locker = 0;
320 int free_lock_id = 0;
322 Debug( LDAP_DEBUG_ARGS,
323 "=> bdb_entry_get: ndn: \"%s\"\n", ndn->bv_val, 0, 0 );
324 Debug( LDAP_DEBUG_ARGS,
325 "=> bdb_entry_get: oc: \"%s\", at: \"%s\"\n",
326 oc ? oc->soc_cname.bv_val : "(null)", at_name, 0);
328 if( op ) boi = (struct bdb_op_info *) op->o_private;
329 if( boi != NULL && op->o_bd->be_private == boi->boi_bdb->be_private ) {
331 locker = boi->boi_locker;
335 locker = TXN_ID ( txn );
336 } else if ( !locker ) {
337 rc = LOCK_ID ( bdb->bi_dbenv, &locker );
348 /* can we find entry */
349 rc = bdb_dn2entry( op, txn, ndn, &ei, 0, locker, &lock );
354 case DB_LOCK_DEADLOCK:
355 case DB_LOCK_NOTGRANTED:
356 /* the txn must abort and retry */
361 ldap_pvt_thread_yield();
364 if ( boi ) boi->boi_err = rc;
365 if ( free_lock_id ) {
366 LOCK_ID_FREE( bdb->bi_dbenv, locker );
368 return (rc != LDAP_BUSY) ? LDAP_OTHER : LDAP_BUSY;
370 if (ei) e = ei->bei_e;
372 Debug( LDAP_DEBUG_ACL,
373 "=> bdb_entry_get: cannot find entry: \"%s\"\n",
375 if ( free_lock_id ) {
376 LOCK_ID_FREE( bdb->bi_dbenv, locker );
378 return LDAP_NO_SUCH_OBJECT;
381 Debug( LDAP_DEBUG_ACL,
382 "=> bdb_entry_get: found entry: \"%s\"\n",
385 /* find attribute values */
386 if( is_entry_alias( e ) ) {
387 Debug( LDAP_DEBUG_ACL,
388 "<= bdb_entry_get: entry is an alias\n", 0, 0, 0 );
389 rc = LDAP_ALIAS_PROBLEM;
393 if( is_entry_referral( e ) ) {
394 Debug( LDAP_DEBUG_ACL,
395 "<= bdb_entry_get: entry is a referral\n", 0, 0, 0 );
400 if ( oc && !is_entry_objectclass( e, oc, 0 )) {
401 Debug( LDAP_DEBUG_ACL,
402 "<= bdb_entry_get: failed to find objectClass %s\n",
403 oc->soc_cname, 0, 0 );
404 rc = LDAP_NO_SUCH_ATTRIBUTE;
409 if( rc != LDAP_SUCCESS ) {
411 bdb_cache_return_entry_rw(bdb->bi_dbenv, &bdb->bi_cache, e, rw, &lock);
414 if ( slapMode == SLAP_SERVER_MODE ) {
416 /* big drag. we need a place to store a read lock so we can
417 * release it later?? If we're in a txn, nothing is needed
418 * here because the locks will go away with the txn.
422 boi = op->o_tmpcalloc(1,sizeof(struct bdb_op_info),op->o_tmpmemctx);
423 boi->boi_bdb = op->o_bd;
426 if ( !boi->boi_txn ) {
427 struct bdb_lock_info *bli;
428 bli = op->o_tmpalloc( sizeof(struct bdb_lock_info),
430 bli->bli_next = boi->boi_locks;
431 bli->bli_id = e->e_id;
432 bli->bli_lock = lock;
433 boi->boi_locks = bli;
437 *ent = entry_dup( e );
438 bdb_cache_return_entry_rw(bdb->bi_dbenv, &bdb->bi_cache, e, rw, &lock);
442 if ( free_lock_id ) {
443 LOCK_ID_FREE( bdb->bi_dbenv, locker );
446 Debug( LDAP_DEBUG_TRACE,
447 "bdb_entry_get: rc=%d\n",