1 /* cache.c - routines to maintain an in-core cache of entries */
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>.
22 #include <ac/string.h>
23 #include <ac/socket.h>
30 #define bdb_cache_lru_add hdb_cache_lru_add
33 static int bdb_cache_delete_internal(Cache *cache, EntryInfo *e, int decr);
35 static void bdb_lru_print(Cache *cache);
38 static int bdb_txn_get( Operation *op, DB_ENV *env, DB_TXN **txn, int reset );
41 #if DB_VERSION_FULL == 0x04020034
42 #define READ_TXN_FLAG ReadFlag
43 static int ReadFlag = DB_TXN_NOT_DURABLE;
45 #define READ_TXN_FLAG 0
49 bdb_cache_entryinfo_new( Cache *cache )
53 if ( cache->c_eifree ) {
54 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
55 if ( cache->c_eifree ) {
57 cache->c_eifree = ei->bei_lrunext;
59 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
62 ei->bei_lrunext = NULL;
65 ei = ch_calloc(1, sizeof(struct bdb_entry_info));
66 ldap_pvt_thread_mutex_init( &ei->bei_kids_mutex );
72 /* Atomically release and reacquire a lock */
74 bdb_cache_entry_db_relock(
89 if ( !lock ) return 0;
91 lockobj.data = &ei->bei_id;
92 lockobj.size = sizeof(ei->bei_id) + 1;
94 list[0].op = DB_LOCK_PUT;
96 list[1].op = DB_LOCK_GET;
98 list[1].mode = rw ? DB_LOCK_WRITE : DB_LOCK_READ;
99 list[1].obj = &lockobj;
100 rc = env->lock_vec(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
103 if (rc && !tryOnly) {
104 Debug( LDAP_DEBUG_TRACE,
105 "bdb_cache_entry_db_relock: entry %ld, rw %d, rc %d\n",
106 ei->bei_id, rw, rc );
108 *lock = list[1].lock;
115 bdb_cache_entry_db_lock( DB_ENV *env, u_int32_t locker, EntryInfo *ei,
116 int rw, int tryOnly, DB_LOCK *lock )
125 if ( !lock ) return 0;
128 db_rw = DB_LOCK_WRITE;
130 db_rw = DB_LOCK_READ;
132 lockobj.data = &ei->bei_id;
133 lockobj.size = sizeof(ei->bei_id) + 1;
135 rc = LOCK_GET(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
136 &lockobj, db_rw, lock);
137 if (rc && !tryOnly) {
138 Debug( LDAP_DEBUG_TRACE,
139 "bdb_cache_entry_db_lock: entry %ld, rw %d, rc %d\n",
140 ei->bei_id, rw, rc );
143 #endif /* NO_THREADS */
147 bdb_cache_entry_db_unlock ( DB_ENV *env, DB_LOCK *lock )
154 if ( !lock ) return 0;
156 rc = LOCK_PUT ( env, lock );
162 bdb_cache_entryinfo_destroy( EntryInfo *e )
164 ldap_pvt_thread_mutex_destroy( &e->bei_kids_mutex );
165 free( e->bei_nrdn.bv_val );
167 free( e->bei_rdn.bv_val );
173 #define LRU_DELETE( cache, ei ) do { \
174 if ( (ei)->bei_lruprev != NULL ) { \
175 (ei)->bei_lruprev->bei_lrunext = (ei)->bei_lrunext; \
177 (cache)->c_lruhead = (ei)->bei_lrunext; \
179 if ( (ei)->bei_lrunext != NULL ) { \
180 (ei)->bei_lrunext->bei_lruprev = (ei)->bei_lruprev; \
182 (cache)->c_lrutail = (ei)->bei_lruprev; \
184 (ei)->bei_lrunext = (ei)->bei_lruprev = NULL; \
187 #define LRU_ADD( cache, ei ) do { \
188 (ei)->bei_lrunext = (cache)->c_lruhead; \
189 if ( (ei)->bei_lrunext != NULL ) { \
190 (ei)->bei_lrunext->bei_lruprev = (ei); \
192 (cache)->c_lruhead = (ei); \
193 (ei)->bei_lruprev = NULL; \
194 if ( (cache)->c_lrutail == NULL ) { \
195 (cache)->c_lrutail = (ei); \
199 /* Do a length-ordered sort on normalized RDNs */
201 bdb_rdn_cmp( const void *v_e1, const void *v_e2 )
203 const EntryInfo *e1 = v_e1, *e2 = v_e2;
204 int rc = e1->bei_nrdn.bv_len - e2->bei_nrdn.bv_len;
206 rc = strncmp( e1->bei_nrdn.bv_val, e2->bei_nrdn.bv_val,
207 e1->bei_nrdn.bv_len );
213 bdb_id_cmp( const void *v_e1, const void *v_e2 )
215 const EntryInfo *e1 = v_e1, *e2 = v_e2;
216 return e1->bei_id - e2->bei_id;
219 /* Create an entryinfo in the cache. Caller must release the locks later.
222 bdb_entryinfo_add_internal(
223 struct bdb_info *bdb,
227 EntryInfo *ei2 = NULL;
231 ei2 = bdb_cache_entryinfo_new( &bdb->bi_cache );
233 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
234 bdb_cache_entryinfo_lock( ei->bei_parent );
236 ei2->bei_id = ei->bei_id;
237 ei2->bei_parent = ei->bei_parent;
239 ei2->bei_rdn = ei->bei_rdn;
241 #ifdef SLAP_ZONE_ALLOC
245 /* Add to cache ID tree */
246 if (avl_insert( &bdb->bi_cache.c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
248 eix = avl_find( bdb->bi_cache.c_idtree, ei2, bdb_id_cmp );
249 bdb_cache_entryinfo_destroy( ei2 );
252 /* It got freed above because its value was
255 ei->bei_rdn.bv_val = NULL;
258 bdb->bi_cache.c_eiused++;
259 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
260 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
263 ei->bei_parent->bei_ckids++;
271 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
272 * the info for its closest ancestor. *res should be NULL to process a
273 * complete DN starting from the tree root. Otherwise *res must be the
274 * immediate parent of the requested DN, and only the RDN will be searched.
275 * The EntryInfo is locked upon return and must be unlocked by the caller.
284 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
285 EntryInfo ei, *eip, *ei2;
289 /* this function is always called with normalized DN */
291 /* we're doing a onelevel search for an RDN */
292 ei.bei_nrdn.bv_val = ndn->bv_val;
293 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
296 /* we're searching a full DN from the root */
297 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
298 ei.bei_nrdn.bv_val = ptr;
299 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
300 /* Skip to next rdn if suffix is empty */
301 if ( ei.bei_nrdn.bv_len == 0 ) {
302 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
303 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
304 if ( ptr >= ndn->bv_val ) {
305 if (DN_SEPARATOR(*ptr)) ptr++;
306 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr;
307 ei.bei_nrdn.bv_val = ptr;
310 eip = &bdb->bi_cache.c_dntree;
313 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
315 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
317 int len = ei.bei_nrdn.bv_len;
319 ei.bei_nrdn.bv_len = ndn->bv_len -
320 (ei.bei_nrdn.bv_val - ndn->bv_val);
321 bdb_cache_entryinfo_unlock( eip );
323 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
325 bdb_cache_entryinfo_lock( eip );
330 /* DN exists but needs to be added to cache */
331 ei.bei_nrdn.bv_len = len;
332 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2 );
333 /* add_internal left eip and c_rwlock locked */
334 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
339 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
340 /* In the midst of deleting? Give it a chance to
343 bdb_cache_entryinfo_unlock( eip );
344 ldap_pvt_thread_yield();
345 bdb_cache_entryinfo_lock( eip );
349 bdb_cache_entryinfo_unlock( eip );
350 bdb_cache_entryinfo_lock( ei2 );
354 /* Advance to next lower RDN */
355 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
356 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
357 if ( ptr >= ndn->bv_val ) {
358 if (DN_SEPARATOR(*ptr)) ptr++;
359 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
360 ei.bei_nrdn.bv_val = ptr;
362 if ( ptr < ndn->bv_val ) {
372 /* Walk up the tree from a child node, looking for an ID that's already
373 * been linked into the cache.
376 hdb_cache_find_parent(
382 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
383 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
392 rc = hdb_dn2id_parent( op, txn, &ei, &eip.bei_id );
395 /* Save the previous node, if any */
398 /* Create a new node for the current ID */
399 ein = bdb_cache_entryinfo_new( &bdb->bi_cache );
400 ein->bei_id = ei.bei_id;
401 ein->bei_kids = ei.bei_kids;
402 ein->bei_nrdn = ei.bei_nrdn;
403 ein->bei_rdn = ei.bei_rdn;
404 ein->bei_ckids = ei.bei_ckids;
405 #ifdef SLAP_ZONE_ALLOC
410 /* This node is not fully connected yet */
411 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
413 /* Insert this node into the ID tree */
414 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
415 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
416 bdb_id_cmp, avl_dup_error ) ) {
418 /* Someone else created this node just before us.
419 * Free our new copy and use the existing one.
421 bdb_cache_entryinfo_destroy( ein );
422 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
423 (caddr_t) &ei, bdb_id_cmp );
425 /* Link in any kids we've already processed */
427 bdb_cache_entryinfo_lock( ein );
428 avl_insert( &ein->bei_kids, (caddr_t)ei2,
429 bdb_rdn_cmp, avl_dup_error );
431 bdb_cache_entryinfo_unlock( ein );
439 /* If this is the first time, save this node
440 * to be returned later.
442 if ( eir == NULL ) eir = ein;
444 /* If there was a previous node, link it to this one */
445 if ( ei2 ) ei2->bei_parent = ein;
447 /* Look for this node's parent */
449 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
450 (caddr_t) &eip, bdb_id_cmp );
452 ei2 = &bdb->bi_cache.c_dntree;
454 bdb->bi_cache.c_eiused++;
455 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
457 /* Got the parent, link in and we're done. */
459 bdb_cache_entryinfo_lock( ei2 );
460 ein->bei_parent = ei2;
461 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
464 bdb_cache_entryinfo_unlock( ei2 );
465 bdb_cache_entryinfo_lock( eir );
467 /* Reset all the state info */
468 for (ein = eir; ein != ei2; ein=ein->bei_parent)
469 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
474 ei.bei_id = eip.bei_id;
476 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
482 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
486 struct bdb_info *bdb,
493 /* See if we already have this one */
494 bdb_cache_entryinfo_lock( ei->bei_parent );
495 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
496 bdb_cache_entryinfo_unlock( ei->bei_parent );
499 /* Not found, add it */
502 /* bei_rdn was not malloc'd before, do it now */
503 ber_dupbv( &bv, &ei->bei_rdn );
506 rc = bdb_entryinfo_add_internal( bdb, ei, res );
507 bdb_cache_entryinfo_unlock( ei->bei_parent );
508 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
510 /* Found, return it */
518 /* caller must have lru_mutex locked. mutex
519 * will be unlocked on return.
523 struct bdb_info *bdb,
527 DB_LOCK lock, *lockp;
535 /* See if we're above the cache size limit */
536 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
537 EntryInfo *elru, *elprev;
540 /* Look for an unused entry to remove */
541 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
542 elprev = elru->bei_lruprev;
544 /* Too many probes, not enough idle, give up */
548 /* If we can successfully writelock it, then
549 * the object is idle.
551 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv,
552 bdb->bi_cache.c_locker, elru, 1, 1, lockp ) == 0 ) {
555 /* If there's no entry, or this node is in
556 * the process of linking into the cache,
557 * or this node is being deleted, skip it.
559 if ( !elru->bei_e || (elru->bei_state &
560 ( CACHE_ENTRY_NOT_LINKED | CACHE_ENTRY_DELETED ))) {
561 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
564 LRU_DELETE( &bdb->bi_cache, elru );
565 elru->bei_e->e_private = NULL;
566 #ifdef SLAP_ZONE_ALLOC
567 bdb_entry_return( bdb, elru->bei_e, elru->bei_zseq );
569 bdb_entry_return( elru->bei_e );
572 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
573 --bdb->bi_cache.c_cursize;
574 if (bdb->bi_cache.c_cursize <= bdb->bi_cache.c_maxsize)
576 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
577 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
582 LRU_ADD( &bdb->bi_cache, ei );
583 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
588 struct bdb_info *bdb,
591 EntryInfo ei = { 0 },
596 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
597 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
598 (caddr_t) &ei, bdb_id_cmp );
599 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
604 * cache_find_id - find an entry in the cache, given id.
605 * The entry is locked for Read upon return. Call with islocked TRUE if
606 * the supplied *eip was already locked.
619 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
621 int rc = 0, load = 0;
622 EntryInfo ei = { 0 };
626 #ifdef SLAP_ZONE_ALLOC
627 slap_zh_rlock(bdb->bi_cache.c_zctx);
629 /* If we weren't given any info, see if we have it already cached */
631 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
632 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
633 (caddr_t) &ei, bdb_id_cmp );
635 /* If the lock attempt fails, the info is in use */
636 if ( ldap_pvt_thread_mutex_trylock(
637 &(*eip)->bei_kids_mutex )) {
638 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
639 /* If this node is being deleted, treat
640 * as if the delete has already finished
642 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
645 /* otherwise, wait for the info to free up */
646 ldap_pvt_thread_yield();
649 /* If this info isn't hooked up to its parent yet,
650 * unlock and wait for it to be fully initialized
652 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
653 bdb_cache_entryinfo_unlock( *eip );
654 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
655 ldap_pvt_thread_yield();
660 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
663 /* See if the ID exists in the database; add it to the cache if so */
666 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
668 rc = bdb_cache_find_ndn( op, tid,
670 if ( *eip ) islocked = 1;
672 #ifdef SLAP_ZONE_ALLOC
673 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
675 bdb_entry_return( ep );
681 rc = hdb_cache_find_parent(op, tid, id, eip );
682 if ( rc == 0 && *eip ) islocked = 1;
686 /* Ok, we found the info, do we have the entry? */
687 if ( *eip && rc == 0 ) {
688 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
691 /* Make sure only one thread tries to load the entry */
693 #ifdef SLAP_ZONE_ALLOC
694 if ((*eip)->bei_e && !slap_zn_validate(
695 bdb->bi_cache.c_zctx, (*eip)->bei_e, (*eip)->bei_zseq)) {
696 (*eip)->bei_e = NULL;
697 (*eip)->bei_zseq = 0;
700 if ( !(*eip)->bei_e && !((*eip)->bei_state & CACHE_ENTRY_LOADING)) {
702 (*eip)->bei_state |= CACHE_ENTRY_LOADING;
705 bdb_cache_entryinfo_unlock( *eip );
708 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, *eip, 0, 0, lock );
709 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
711 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
712 } else if ( rc == 0 ) {
715 u_int32_t locker2 = locker;
717 /* We don't wrap entire read operations in txn's, but
718 * we need our cache entry lock and any DB page locks
719 * to be associated, in order for deadlock detection
720 * to work properly. So if we need to read from the DB,
721 * we use a long-lived per-thread txn for this step.
724 rc = bdb_txn_get( op, bdb->bi_dbenv, <id, 0 );
726 locker2 = TXN_ID( ltid );
730 /* Give up original read lock, obtain write lock with
731 * (possibly) new locker ID.
734 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker2,
737 if ( rc == 0 && !ep) {
738 rc = bdb_id2entry( op->o_bd, ltid, id, &ep );
741 ep->e_private = *eip;
746 #ifdef SLAP_ZONE_ALLOC
747 (*eip)->bei_zseq = *((ber_len_t *)ep - 2);
751 (*eip)->bei_state ^= CACHE_ENTRY_LOADING;
753 /* If we succeeded, downgrade back to a readlock. */
754 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
757 /* Otherwise, release the lock. */
758 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
760 if ( locker2 != locker ) {
761 /* If we're using the per-thread txn, release all
762 * of its page locks now.
765 list.op = DB_LOCK_PUT_ALL;
767 bdb->bi_dbenv->lock_vec( bdb->bi_dbenv, locker2,
769 /* If this txn was deadlocked, we must abort it
770 * and invalidate this per-thread txn.
772 if ( rc == DB_LOCK_DEADLOCK ) {
773 bdb_txn_get( op, bdb->bi_dbenv, <id, 1 );
776 } else if ( !(*eip)->bei_e ) {
777 /* Some other thread is trying to load the entry,
778 * give it a chance to finish.
780 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
781 ldap_pvt_thread_yield();
782 bdb_cache_entryinfo_lock( *eip );
787 /* Check for subtree renames
789 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
791 bdb_cache_entry_db_relock( bdb->bi_dbenv,
792 locker, *eip, 1, 0, lock );
793 /* check again in case other modifier did it already */
794 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
795 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
796 bdb_cache_entry_db_relock( bdb->bi_dbenv,
797 locker, *eip, 0, 0, lock );
806 bdb_cache_entryinfo_unlock( *eip );
809 #ifdef SLAP_ZONE_ALLOC
810 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
812 bdb_entry_return( ep );
818 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
819 bdb->bi_cache.c_cursize++;
820 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
823 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
825 /* If the LRU list has only one entry and this is it, it
826 * doesn't need to be added again.
828 if ( bdb->bi_cache.c_lruhead == bdb->bi_cache.c_lrutail &&
829 bdb->bi_cache.c_lruhead == *eip ) {
830 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
833 /* if entry is on LRU list, remove from old spot */
834 if ( (*eip)->bei_lrunext || (*eip)->bei_lruprev ) {
835 LRU_DELETE( &bdb->bi_cache, *eip );
837 /* lru_mutex is unlocked for us */
838 bdb_cache_lru_add( bdb, locker, *eip );
842 #ifdef SLAP_ZONE_ALLOC
843 if (rc == 0 && (*eip)->bei_e) {
844 slap_zn_rlock(bdb->bi_cache.c_zctx, (*eip)->bei_e);
846 slap_zh_runlock(bdb->bi_cache.c_zctx);
859 if ( BEI(e)->bei_kids ) {
862 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
865 rc = bdb_dn2id_children( op, txn, e );
866 if ( rc == DB_NOTFOUND ) {
867 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
872 /* Update the cache after a successful database Add. */
875 struct bdb_info *bdb,
882 struct berval rdn = e->e_name;
891 /* Lock this entry so that bdb_add can run to completion.
892 * It can only fail if BDB has run out of lock resources.
894 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, &ei, 1, 0, &lock );
896 bdb_cache_entryinfo_unlock( eip );
901 if ( nrdn->bv_len != e->e_nname.bv_len ) {
902 char *ptr = strchr( rdn.bv_val, ',' );
903 rdn.bv_len = ptr - rdn.bv_val;
905 ber_dupbv( &ei.bei_rdn, &rdn );
906 if ( eip->bei_dkids ) eip->bei_dkids++;
909 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
910 /* bdb_csn_commit can cause this when adding the database root entry */
912 new->bei_e->e_private = NULL;
913 #ifdef SLAP_ZONE_ALLOC
914 bdb_entry_return( bdb, new->bei_e, new->bei_zseq );
916 bdb_entry_return( new->bei_e );
921 new->bei_state = CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
922 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
923 if (eip->bei_parent) {
924 eip->bei_parent->bei_state &= ~CACHE_ENTRY_NO_GRANDKIDS;
926 bdb_cache_entryinfo_unlock( eip );
928 ++bdb->bi_cache.c_cursize;
929 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
932 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
934 /* lru_mutex is unlocked for us */
935 bdb_cache_lru_add( bdb, locker, new );
948 EntryInfo *ei = BEI(e);
950 /* Get write lock on data */
951 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
953 /* If we've done repeated mods on a cached entry, then e_attrs
954 * is no longer contiguous with the entry, and must be freed.
957 if ( (void *)e->e_attrs != (void *)(e+1) ) {
958 attrs_free( e->e_attrs );
960 e->e_attrs = newAttrs;
966 * Change the rdn in the entryinfo. Also move to a new parent if needed.
978 EntryInfo *ei = BEI(e), *pei;
982 /* Get write lock on data */
983 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
986 /* If we've done repeated mods on a cached entry, then e_attrs
987 * is no longer contiguous with the entry, and must be freed.
989 if ( (void *)e->e_attrs != (void *)(e+1) ) {
990 attrs_free( e->e_attrs );
992 e->e_attrs = new->e_attrs;
993 if( e->e_nname.bv_val < e->e_bv.bv_val ||
994 e->e_nname.bv_val > e->e_bv.bv_val + e->e_bv.bv_len )
996 ch_free(e->e_name.bv_val);
997 ch_free(e->e_nname.bv_val);
999 e->e_name = new->e_name;
1000 e->e_nname = new->e_nname;
1002 /* Lock the parent's kids AVL tree */
1003 pei = ei->bei_parent;
1004 bdb_cache_entryinfo_lock( pei );
1005 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
1006 free( ei->bei_nrdn.bv_val );
1007 ber_dupbv( &ei->bei_nrdn, nrdn );
1009 free( ei->bei_rdn.bv_val );
1012 if ( nrdn->bv_len != e->e_nname.bv_len ) {
1013 char *ptr = strchr(rdn.bv_val, ',');
1014 rdn.bv_len = ptr - rdn.bv_val;
1016 ber_dupbv( &ei->bei_rdn, &rdn );
1020 ein = ei->bei_parent;
1022 ei->bei_parent = ein;
1023 bdb_cache_entryinfo_unlock( pei );
1024 bdb_cache_entryinfo_lock( ein );
1028 int max = ei->bei_modrdns;
1029 /* Record the generation number of this change */
1030 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
1031 if ( pei->bei_modrdns > max ) max = pei->bei_modrdns;
1033 ei->bei_modrdns = max + 1;
1036 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
1037 bdb_cache_entryinfo_unlock( ein );
1041 * cache_delete - delete the entry e from the cache.
1043 * returns: 0 e was deleted ok
1044 * 1 e was not in the cache
1045 * -1 something bad happened
1055 EntryInfo *ei = BEI(e);
1058 assert( e->e_private );
1060 /* Set this early, warn off any queriers */
1061 ei->bei_state |= CACHE_ENTRY_DELETED;
1063 /* Lock the entry's info */
1064 bdb_cache_entryinfo_lock( ei );
1066 /* Get write lock on the data */
1067 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
1069 /* couldn't lock, undo and give up */
1070 ei->bei_state ^= CACHE_ENTRY_DELETED;
1071 bdb_cache_entryinfo_unlock( ei );
1075 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
1079 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1080 rc = bdb_cache_delete_internal( cache, e->e_private, 1 );
1081 /* free lru mutex */
1082 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1084 /* Leave entry info locked */
1090 bdb_cache_delete_cleanup(
1095 ei->bei_e->e_private = NULL;
1096 #ifdef SLAP_ZONE_ALLOC
1097 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1099 bdb_entry_return( ei->bei_e );
1104 free( ei->bei_nrdn.bv_val );
1105 ei->bei_nrdn.bv_val = NULL;
1107 free( ei->bei_rdn.bv_val );
1108 ei->bei_rdn.bv_val = NULL;
1109 ei->bei_modrdns = 0;
1113 ei->bei_parent = NULL;
1114 ei->bei_kids = NULL;
1115 ei->bei_lruprev = NULL;
1117 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1118 ei->bei_lrunext = cache->c_eifree;
1119 cache->c_eifree = ei;
1120 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1121 bdb_cache_entryinfo_unlock( ei );
1125 bdb_cache_delete_internal(
1130 int rc = 0; /* return code */
1132 /* set cache write lock */
1133 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1135 /* Lock the parent's kids tree */
1136 bdb_cache_entryinfo_lock( e->bei_parent );
1139 e->bei_parent->bei_ckids--;
1140 if ( decr && e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
1143 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp )
1150 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL ) {
1161 LRU_DELETE( cache, e );
1162 if ( e->bei_e ) cache->c_cursize--;
1164 /* free cache write lock */
1165 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1166 bdb_cache_entryinfo_unlock( e->bei_parent );
1172 bdb_entryinfo_release( void *data )
1174 EntryInfo *ei = (EntryInfo *)data;
1175 if ( ei->bei_kids ) {
1176 avl_free( ei->bei_kids, NULL );
1179 ei->bei_e->e_private = NULL;
1180 #ifdef SLAP_ZONE_ALLOC
1181 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1183 bdb_entry_return( ei->bei_e );
1186 bdb_cache_entryinfo_destroy( ei );
1190 bdb_cache_release_all( Cache *cache )
1192 /* set cache write lock */
1193 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1195 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1197 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1199 avl_free( cache->c_dntree.bei_kids, NULL );
1200 avl_free( cache->c_idtree, bdb_entryinfo_release );
1201 for (;cache->c_eifree;cache->c_eifree = cache->c_lruhead) {
1202 cache->c_lruhead = cache->c_eifree->bei_lrunext;
1203 bdb_cache_entryinfo_destroy(cache->c_eifree);
1205 cache->c_lruhead = NULL;
1206 cache->c_lrutail = NULL;
1208 /* free lru mutex */
1209 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1210 /* free cache write lock */
1211 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1216 bdb_lru_print( Cache *cache )
1220 fprintf( stderr, "LRU queue (head to tail):\n" );
1221 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
1222 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1223 e->bei_nrdn.bv_val, e->bei_id );
1225 fprintf( stderr, "LRU queue (tail to head):\n" );
1226 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
1227 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1228 e->bei_nrdn.bv_val, e->bei_id );
1234 bdb_txn_free( void *key, void *data )
1240 /* Obtain a long-lived transaction for the current thread.
1241 * If reset == 1, remove the current transaction. */
1243 bdb_txn_get( Operation *op, DB_ENV *env, DB_TXN **txn, int reset )
1246 void *ctx, *data = NULL;
1248 if ( slapMode & SLAP_TOOL_MODE ) {
1253 /* If no op was provided, try to find the ctx anyway... */
1255 ctx = op->o_threadctx;
1257 ctx = ldap_pvt_thread_pool_context();
1260 /* Shouldn't happen unless we're single-threaded */
1268 return ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1, NULL, NULL );
1271 if ( ldap_pvt_thread_pool_getkey( ctx, ((char *)env)+1, &data, NULL ) ||
1273 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1274 rc = TXN_BEGIN( env, NULL, txn, READ_TXN_FLAG );
1275 #if DB_VERSION_FULL == 0x04020034
1276 if ( rc == EINVAL && READ_TXN_FLAG ) {
1278 Debug( LDAP_DEBUG_ANY,
1279 "bdb_txn_get: BerkeleyDB 4.2.52 library needs TXN patch!\n",
1285 if (rc) ldap_pvt_thread_yield();
1290 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1,
1291 *txn, bdb_txn_free ) ) ) {
1293 Debug( LDAP_DEBUG_ANY, "bdb_txn_get: err %s(%d)\n",
1294 db_strerror(rc), rc, 0 );
1304 #ifdef BDB_REUSE_LOCKERS
1306 bdb_locker_id_free( void *key, void *data )
1309 int lockid = (int) data;
1312 rc = XLOCK_ID_FREE( env, lockid );
1313 if ( rc == EINVAL ) {
1315 Debug( LDAP_DEBUG_ANY,
1316 "bdb_locker_id_free: %d err %s(%d)\n",
1317 lockid, db_strerror(rc), rc );
1318 /* release all locks held by this locker. */
1319 lr.op = DB_LOCK_PUT_ALL;
1321 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1322 XLOCK_ID_FREE( env, lockid );
1327 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
1333 if ( !env || !locker ) return -1;
1335 /* If no op was provided, try to find the ctx anyway... */
1337 ctx = op->o_threadctx;
1339 ctx = ldap_pvt_thread_pool_context();
1342 /* Shouldn't happen unless we're single-threaded */
1348 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1349 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1350 rc = XLOCK_ID( env, &lockid );
1351 if (rc) ldap_pvt_thread_yield();
1356 data = (void *)lockid;
1357 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1358 data, bdb_locker_id_free ) ) ) {
1359 XLOCK_ID_FREE( env, lockid );
1360 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1361 db_strerror(rc), rc, 0 );
1374 bdb_cache_delete_entry(
1375 struct bdb_info *bdb,
1380 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
1381 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, bdb->bi_cache.c_locker, ei, 1, 1, lock ) == 0 )
1383 if ( ei->bei_e && !(ei->bei_state & CACHE_ENTRY_NOT_LINKED )) {
1384 LRU_DELETE( &bdb->bi_cache, ei );
1385 ei->bei_e->e_private = NULL;
1386 #ifdef SLAP_ZONE_ALLOC
1387 bdb_entry_return( bdb, ei->bei_e, ei->bei_zseq );
1389 bdb_entry_return( ei->bei_e );
1392 --bdb->bi_cache.c_cursize;
1394 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
1396 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );