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);
36 static void bdb_lru_print(Cache *cache);
41 bdb_cache_entryinfo_new( Cache *cache )
45 if ( cache->c_eifree ) {
46 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
47 if ( cache->c_eifree ) {
49 cache->c_eifree = ei->bei_lrunext;
51 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
54 ei->bei_lrunext = NULL;
57 ei = ch_calloc(1, sizeof(struct bdb_entry_info));
58 ldap_pvt_thread_mutex_init( &ei->bei_kids_mutex );
64 /* Atomically release and reacquire a lock */
66 bdb_cache_entry_db_relock(
81 if ( !lock ) return 0;
83 lockobj.data = &ei->bei_id;
84 lockobj.size = sizeof(ei->bei_id) + 1;
86 list[0].op = DB_LOCK_PUT;
88 list[1].op = DB_LOCK_GET;
90 list[1].mode = rw ? DB_LOCK_WRITE : DB_LOCK_READ;
91 list[1].obj = &lockobj;
92 rc = env->lock_vec(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
96 Debug( LDAP_DEBUG_TRACE,
97 "bdb_cache_entry_db_relock: entry %ld, rw %d, rc %d\n",
100 *lock = list[1].lock;
107 bdb_cache_entry_db_lock( DB_ENV *env, u_int32_t locker, EntryInfo *ei,
108 int rw, int tryOnly, DB_LOCK *lock )
117 if ( !lock ) return 0;
120 db_rw = DB_LOCK_WRITE;
122 db_rw = DB_LOCK_READ;
124 lockobj.data = &ei->bei_id;
125 lockobj.size = sizeof(ei->bei_id) + 1;
127 rc = LOCK_GET(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
128 &lockobj, db_rw, lock);
129 if (rc && !tryOnly) {
130 Debug( LDAP_DEBUG_TRACE,
131 "bdb_cache_entry_db_lock: entry %ld, rw %d, rc %d\n",
132 ei->bei_id, rw, rc );
135 #endif /* NO_THREADS */
139 bdb_cache_entry_db_unlock ( DB_ENV *env, DB_LOCK *lock )
146 if ( !lock ) return 0;
148 rc = LOCK_PUT ( env, lock );
154 bdb_cache_entryinfo_destroy( EntryInfo *e )
156 ldap_pvt_thread_mutex_destroy( &e->bei_kids_mutex );
157 free( e->bei_nrdn.bv_val );
159 free( e->bei_rdn.bv_val );
165 #define LRU_DELETE( cache, ei ) do { \
166 if ( (ei)->bei_lruprev != NULL ) { \
167 (ei)->bei_lruprev->bei_lrunext = (ei)->bei_lrunext; \
169 (cache)->c_lruhead = (ei)->bei_lrunext; \
171 if ( (ei)->bei_lrunext != NULL ) { \
172 (ei)->bei_lrunext->bei_lruprev = (ei)->bei_lruprev; \
174 (cache)->c_lrutail = (ei)->bei_lruprev; \
176 (ei)->bei_lrunext = (ei)->bei_lruprev = NULL; \
179 #define LRU_ADD( cache, ei ) do { \
180 (ei)->bei_lrunext = (cache)->c_lruhead; \
181 if ( (ei)->bei_lrunext != NULL ) { \
182 (ei)->bei_lrunext->bei_lruprev = (ei); \
184 (cache)->c_lruhead = (ei); \
185 (ei)->bei_lruprev = NULL; \
186 if ( (cache)->c_lrutail == NULL ) { \
187 (cache)->c_lrutail = (ei); \
191 /* Do a length-ordered sort on normalized RDNs */
193 bdb_rdn_cmp( const void *v_e1, const void *v_e2 )
195 const EntryInfo *e1 = v_e1, *e2 = v_e2;
196 int rc = e1->bei_nrdn.bv_len - e2->bei_nrdn.bv_len;
198 rc = strncmp( e1->bei_nrdn.bv_val, e2->bei_nrdn.bv_val,
199 e1->bei_nrdn.bv_len );
205 bdb_id_cmp( const void *v_e1, const void *v_e2 )
207 const EntryInfo *e1 = v_e1, *e2 = v_e2;
208 return e1->bei_id - e2->bei_id;
211 /* Create an entryinfo in the cache. Caller must release the locks later.
214 bdb_entryinfo_add_internal(
215 struct bdb_info *bdb,
219 EntryInfo *ei2 = NULL;
223 ei2 = bdb_cache_entryinfo_new( &bdb->bi_cache );
225 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
226 bdb_cache_entryinfo_lock( ei->bei_parent );
228 ei2->bei_id = ei->bei_id;
229 ei2->bei_parent = ei->bei_parent;
231 ei2->bei_rdn = ei->bei_rdn;
233 #ifdef SLAP_ZONE_ALLOC
237 /* Add to cache ID tree */
238 if (avl_insert( &bdb->bi_cache.c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
240 eix = avl_find( bdb->bi_cache.c_idtree, ei2, bdb_id_cmp );
241 bdb_cache_entryinfo_destroy( ei2 );
244 /* It got freed above because its value was
247 ei->bei_rdn.bv_val = NULL;
250 bdb->bi_cache.c_eiused++;
251 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
253 /* This is a new leaf node. But if parent had no kids, then it was
254 * a leaf and we would be decrementing that. So, only increment if
255 * the parent already has kids.
257 if ( ei->bei_parent->bei_kids || !ei->bei_parent->bei_id )
258 bdb->bi_cache.c_leaves++;
259 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
262 ei->bei_parent->bei_ckids++;
270 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
271 * the info for its closest ancestor. *res should be NULL to process a
272 * complete DN starting from the tree root. Otherwise *res must be the
273 * immediate parent of the requested DN, and only the RDN will be searched.
274 * The EntryInfo is locked upon return and must be unlocked by the caller.
283 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
284 EntryInfo ei, *eip, *ei2;
288 /* this function is always called with normalized DN */
290 /* we're doing a onelevel search for an RDN */
291 ei.bei_nrdn.bv_val = ndn->bv_val;
292 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
295 /* we're searching a full DN from the root */
296 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
297 ei.bei_nrdn.bv_val = ptr;
298 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
299 /* Skip to next rdn if suffix is empty */
300 if ( ei.bei_nrdn.bv_len == 0 ) {
301 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
302 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
303 if ( ptr >= ndn->bv_val ) {
304 if (DN_SEPARATOR(*ptr)) ptr++;
305 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr;
306 ei.bei_nrdn.bv_val = ptr;
309 eip = &bdb->bi_cache.c_dntree;
312 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
314 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
316 int len = ei.bei_nrdn.bv_len;
318 if ( BER_BVISEMPTY( ndn )) {
323 ei.bei_nrdn.bv_len = ndn->bv_len -
324 (ei.bei_nrdn.bv_val - ndn->bv_val);
325 bdb_cache_entryinfo_unlock( eip );
327 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
329 bdb_cache_entryinfo_lock( eip );
334 /* DN exists but needs to be added to cache */
335 ei.bei_nrdn.bv_len = len;
336 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2 );
337 /* add_internal left eip and c_rwlock locked */
338 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
343 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
344 /* In the midst of deleting? Give it a chance to
347 bdb_cache_entryinfo_unlock( eip );
348 ldap_pvt_thread_yield();
349 bdb_cache_entryinfo_lock( eip );
353 bdb_cache_entryinfo_unlock( eip );
354 bdb_cache_entryinfo_lock( ei2 );
358 /* Advance to next lower RDN */
359 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
360 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
361 if ( ptr >= ndn->bv_val ) {
362 if (DN_SEPARATOR(*ptr)) ptr++;
363 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
364 ei.bei_nrdn.bv_val = ptr;
366 if ( ptr < ndn->bv_val ) {
376 /* Walk up the tree from a child node, looking for an ID that's already
377 * been linked into the cache.
380 hdb_cache_find_parent(
387 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
388 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
397 rc = hdb_dn2id_parent( op, txn, locker, &ei, &eip.bei_id );
400 /* Save the previous node, if any */
403 /* Create a new node for the current ID */
404 ein = bdb_cache_entryinfo_new( &bdb->bi_cache );
405 ein->bei_id = ei.bei_id;
406 ein->bei_kids = ei.bei_kids;
407 ein->bei_nrdn = ei.bei_nrdn;
408 ein->bei_rdn = ei.bei_rdn;
409 ein->bei_ckids = ei.bei_ckids;
410 #ifdef SLAP_ZONE_ALLOC
415 /* This node is not fully connected yet */
416 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
418 /* Insert this node into the ID tree */
419 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
420 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
421 bdb_id_cmp, avl_dup_error ) ) {
423 /* Someone else created this node just before us.
424 * Free our new copy and use the existing one.
426 bdb_cache_entryinfo_destroy( ein );
427 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
428 (caddr_t) &ei, bdb_id_cmp );
430 /* Link in any kids we've already processed */
432 bdb_cache_entryinfo_lock( ein );
433 avl_insert( &ein->bei_kids, (caddr_t)ei2,
434 bdb_rdn_cmp, avl_dup_error );
436 bdb_cache_entryinfo_unlock( ein );
442 /* If this is the first time, save this node
443 * to be returned later.
445 if ( eir == NULL ) eir = ein;
447 /* If there was a previous node, link it to this one */
448 if ( ei2 ) ei2->bei_parent = ein;
450 /* Look for this node's parent */
452 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
453 (caddr_t) &eip, bdb_id_cmp );
455 ei2 = &bdb->bi_cache.c_dntree;
457 bdb->bi_cache.c_eiused++;
458 if ( ei2 && ( ei2->bei_kids || !ei2->bei_id ))
459 bdb->bi_cache.c_leaves++;
460 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
463 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
464 LRU_ADD( &bdb->bi_cache, ein );
465 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
469 /* Got the parent, link in and we're done. */
471 bdb_cache_entryinfo_lock( ei2 );
472 ein->bei_parent = ei2;
473 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
476 bdb_cache_entryinfo_unlock( ei2 );
477 bdb_cache_entryinfo_lock( eir );
479 /* Reset all the state info */
480 for (ein = eir; ein != ei2; ein=ein->bei_parent)
481 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
486 ei.bei_id = eip.bei_id;
488 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
494 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
498 struct bdb_info *bdb,
505 /* See if we already have this one */
506 bdb_cache_entryinfo_lock( ei->bei_parent );
507 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
508 bdb_cache_entryinfo_unlock( ei->bei_parent );
511 /* Not found, add it */
514 /* bei_rdn was not malloc'd before, do it now */
515 ber_dupbv( &bv, &ei->bei_rdn );
518 rc = bdb_entryinfo_add_internal( bdb, ei, res );
519 bdb_cache_entryinfo_unlock( ei->bei_parent );
520 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
522 /* Found, return it */
530 /* caller must have lru_mutex locked. mutex
531 * will be unlocked on return.
535 struct bdb_info *bdb,
539 DB_LOCK lock, *lockp;
547 /* See if we're above the cache size limit */
548 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
549 EntryInfo *elru, *elprev;
552 /* Look for an unused entry to remove */
553 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
554 elprev = elru->bei_lruprev;
556 /* Too many probes, not enough idle, give up */
560 /* If we can successfully writelock it, then
561 * the object is idle.
563 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv,
564 bdb->bi_cache.c_locker, elru, 1, 1, lockp ) == 0 ) {
566 int stop = 0, decr = 0;
568 /* If this node is in the process of linking into the cache,
569 * or this node is being deleted, skip it.
571 if ( elru->bei_state &
572 ( CACHE_ENTRY_NOT_LINKED | CACHE_ENTRY_DELETED )) {
573 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
576 /* Free entry for this node if it's present */
578 elru->bei_e->e_private = NULL;
579 #ifdef SLAP_ZONE_ALLOC
580 bdb_entry_return( bdb, elru->bei_e, elru->bei_zseq );
582 bdb_entry_return( elru->bei_e );
587 /* ITS#4010 if we're in slapcat, and this node is a leaf
590 * FIXME: we need to do this for slapd as well, (which is
591 * why we compute bi_cache.c_leaves now) but at the moment
592 * we can't because it causes unresolvable deadlocks.
594 if ( slapMode & SLAP_TOOL_READONLY ) {
595 if ( !elru->bei_kids ) {
596 /* This does LRU_DELETE for us */
597 bdb_cache_delete_internal( &bdb->bi_cache, elru, 0 );
598 bdb_cache_delete_cleanup( &bdb->bi_cache, elru );
600 /* Leave node on LRU list for a future pass */
602 LRU_DELETE( &bdb->bi_cache, elru );
604 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
606 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
608 --bdb->bi_cache.c_cursize;
609 if (bdb->bi_cache.c_cursize <= bdb->bi_cache.c_maxsize)
611 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
616 LRU_ADD( &bdb->bi_cache, ei );
617 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
622 struct bdb_info *bdb,
625 EntryInfo ei = { 0 },
630 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
631 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
632 (caddr_t) &ei, bdb_id_cmp );
633 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
638 * cache_find_id - find an entry in the cache, given id.
639 * The entry is locked for Read upon return. Call with islocked TRUE if
640 * the supplied *eip was already locked.
653 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
655 int rc = 0, load = 0;
656 EntryInfo ei = { 0 };
660 #ifdef SLAP_ZONE_ALLOC
661 slap_zh_rlock(bdb->bi_cache.c_zctx);
663 /* If we weren't given any info, see if we have it already cached */
665 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
666 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
667 (caddr_t) &ei, bdb_id_cmp );
669 /* If the lock attempt fails, the info is in use */
670 if ( ldap_pvt_thread_mutex_trylock(
671 &(*eip)->bei_kids_mutex )) {
672 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
673 /* If this node is being deleted, treat
674 * as if the delete has already finished
676 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
679 /* otherwise, wait for the info to free up */
680 ldap_pvt_thread_yield();
683 /* If this info isn't hooked up to its parent yet,
684 * unlock and wait for it to be fully initialized
686 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
687 bdb_cache_entryinfo_unlock( *eip );
688 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
689 ldap_pvt_thread_yield();
694 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
697 /* See if the ID exists in the database; add it to the cache if so */
700 rc = bdb_id2entry( op->o_bd, tid, locker, id, &ep );
702 rc = bdb_cache_find_ndn( op, tid,
704 if ( *eip ) islocked = 1;
706 #ifdef SLAP_ZONE_ALLOC
707 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
709 bdb_entry_return( ep );
715 rc = hdb_cache_find_parent(op, tid, locker, id, eip );
716 if ( rc == 0 && *eip ) islocked = 1;
720 /* Ok, we found the info, do we have the entry? */
721 if ( *eip && rc == 0 ) {
722 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
725 /* Make sure only one thread tries to load the entry */
727 #ifdef SLAP_ZONE_ALLOC
728 if ((*eip)->bei_e && !slap_zn_validate(
729 bdb->bi_cache.c_zctx, (*eip)->bei_e, (*eip)->bei_zseq)) {
730 (*eip)->bei_e = NULL;
731 (*eip)->bei_zseq = 0;
734 if ( !(*eip)->bei_e && !((*eip)->bei_state & CACHE_ENTRY_LOADING)) {
736 (*eip)->bei_state |= CACHE_ENTRY_LOADING;
739 bdb_cache_entryinfo_unlock( *eip );
742 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, *eip, 0, 0, lock );
743 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
745 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
746 } else if ( rc == 0 ) {
748 /* Give up original read lock, obtain write lock
751 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
754 if ( rc == 0 && !ep) {
755 rc = bdb_id2entry( op->o_bd, tid, locker, id, &ep );
758 ep->e_private = *eip;
763 #ifdef SLAP_ZONE_ALLOC
764 (*eip)->bei_zseq = *((ber_len_t *)ep - 2);
768 (*eip)->bei_state ^= CACHE_ENTRY_LOADING;
770 /* If we succeeded, downgrade back to a readlock. */
771 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
774 /* Otherwise, release the lock. */
775 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
777 } else if ( !(*eip)->bei_e ) {
778 /* Some other thread is trying to load the entry,
779 * give it a chance to finish.
781 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
782 ldap_pvt_thread_yield();
783 bdb_cache_entryinfo_lock( *eip );
788 /* Check for subtree renames
790 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
792 bdb_cache_entry_db_relock( bdb->bi_dbenv,
793 locker, *eip, 1, 0, lock );
794 /* check again in case other modifier did it already */
795 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
796 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
797 bdb_cache_entry_db_relock( bdb->bi_dbenv,
798 locker, *eip, 0, 0, lock );
807 bdb_cache_entryinfo_unlock( *eip );
810 #ifdef SLAP_ZONE_ALLOC
811 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
813 bdb_entry_return( ep );
819 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
820 bdb->bi_cache.c_cursize++;
821 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
824 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
826 /* If the LRU list has only one entry and this is it, it
827 * doesn't need to be added again.
829 if ( bdb->bi_cache.c_lruhead == bdb->bi_cache.c_lrutail &&
830 bdb->bi_cache.c_lruhead == *eip ) {
831 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
834 /* if entry is on LRU list, remove from old spot */
835 if ( (*eip)->bei_lrunext || (*eip)->bei_lruprev ) {
836 LRU_DELETE( &bdb->bi_cache, *eip );
838 /* lru_mutex is unlocked for us */
839 bdb_cache_lru_add( bdb, locker, *eip );
843 #ifdef SLAP_ZONE_ALLOC
844 if (rc == 0 && (*eip)->bei_e) {
845 slap_zn_rlock(bdb->bi_cache.c_zctx, (*eip)->bei_e);
847 slap_zh_runlock(bdb->bi_cache.c_zctx);
860 if ( BEI(e)->bei_kids ) {
863 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
866 rc = bdb_dn2id_children( op, txn, e );
867 if ( rc == DB_NOTFOUND ) {
868 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
873 /* Update the cache after a successful database Add. */
876 struct bdb_info *bdb,
886 struct berval rdn = e->e_name;
894 /* Lock this entry so that bdb_add can run to completion.
895 * It can only fail if BDB has run out of lock resources.
897 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, &ei, 1, 0, &lock );
899 bdb_cache_entryinfo_unlock( eip );
904 if ( nrdn->bv_len != e->e_nname.bv_len ) {
905 char *ptr = ber_bvchr( &rdn, ',' );
906 assert( ptr != NULL );
907 rdn.bv_len = ptr - rdn.bv_val;
909 ber_dupbv( &ei.bei_rdn, &rdn );
910 if ( eip->bei_dkids ) eip->bei_dkids++;
913 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
914 /* bdb_csn_commit can cause this when adding the database root entry */
916 new->bei_e->e_private = NULL;
917 #ifdef SLAP_ZONE_ALLOC
918 bdb_entry_return( bdb, new->bei_e, new->bei_zseq );
920 bdb_entry_return( new->bei_e );
925 new->bei_state = CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
926 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
927 if (eip->bei_parent) {
928 eip->bei_parent->bei_state &= ~CACHE_ENTRY_NO_GRANDKIDS;
930 bdb_cache_entryinfo_unlock( eip );
932 ++bdb->bi_cache.c_cursize;
933 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
936 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
938 /* lru_mutex is unlocked for us */
939 bdb_cache_lru_add( bdb, locker, new );
952 EntryInfo *ei = BEI(e);
954 /* Get write lock on data */
955 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
957 /* If we've done repeated mods on a cached entry, then e_attrs
958 * is no longer contiguous with the entry, and must be freed.
961 if ( (void *)e->e_attrs != (void *)(e+1) ) {
962 attrs_free( e->e_attrs );
964 e->e_attrs = newAttrs;
970 * Change the rdn in the entryinfo. Also move to a new parent if needed.
974 struct bdb_info *bdb,
982 EntryInfo *ei = BEI(e), *pei;
988 /* Get write lock on data */
989 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker, ei, 1, 0, lock );
992 /* If we've done repeated mods on a cached entry, then e_attrs
993 * is no longer contiguous with the entry, and must be freed.
995 if ( (void *)e->e_attrs != (void *)(e+1) ) {
996 attrs_free( e->e_attrs );
998 e->e_attrs = new->e_attrs;
999 if( e->e_nname.bv_val < e->e_bv.bv_val ||
1000 e->e_nname.bv_val > e->e_bv.bv_val + e->e_bv.bv_len )
1002 ch_free(e->e_name.bv_val);
1003 ch_free(e->e_nname.bv_val);
1005 e->e_name = new->e_name;
1006 e->e_nname = new->e_nname;
1008 /* Lock the parent's kids AVL tree */
1009 pei = ei->bei_parent;
1010 bdb_cache_entryinfo_lock( pei );
1011 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
1012 free( ei->bei_nrdn.bv_val );
1013 ber_dupbv( &ei->bei_nrdn, nrdn );
1015 free( ei->bei_rdn.bv_val );
1018 if ( nrdn->bv_len != e->e_nname.bv_len ) {
1019 char *ptr = ber_bvchr(&rdn, ',');
1020 assert( ptr != NULL );
1021 rdn.bv_len = ptr - rdn.bv_val;
1023 ber_dupbv( &ei->bei_rdn, &rdn );
1027 ein = ei->bei_parent;
1029 ei->bei_parent = ein;
1030 bdb_cache_entryinfo_unlock( pei );
1031 bdb_cache_entryinfo_lock( ein );
1035 /* Record the generation number of this change */
1036 ldap_pvt_thread_mutex_lock( &bdb->bi_modrdns_mutex );
1038 ei->bei_modrdns = bdb->bi_modrdns;
1039 ldap_pvt_thread_mutex_unlock( &bdb->bi_modrdns_mutex );
1042 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
1043 bdb_cache_entryinfo_unlock( ein );
1047 * cache_delete - delete the entry e from the cache.
1049 * returns: 0 e was deleted ok
1050 * 1 e was not in the cache
1051 * -1 something bad happened
1061 EntryInfo *ei = BEI(e);
1064 assert( e->e_private != NULL );
1066 /* Set this early, warn off any queriers */
1067 ei->bei_state |= CACHE_ENTRY_DELETED;
1069 /* Lock the entry's info */
1070 bdb_cache_entryinfo_lock( ei );
1072 /* Get write lock on the data */
1073 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
1075 /* couldn't lock, undo and give up */
1076 ei->bei_state ^= CACHE_ENTRY_DELETED;
1077 bdb_cache_entryinfo_unlock( ei );
1081 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
1085 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1087 /* set cache write lock */
1088 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1090 rc = bdb_cache_delete_internal( cache, e->e_private, 1 );
1092 /* free cache write lock */
1093 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1095 /* free lru mutex */
1096 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1098 /* Leave entry info locked */
1104 bdb_cache_delete_cleanup(
1109 ei->bei_e->e_private = NULL;
1110 #ifdef SLAP_ZONE_ALLOC
1111 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1113 bdb_entry_return( ei->bei_e );
1118 free( ei->bei_nrdn.bv_val );
1119 ei->bei_nrdn.bv_val = NULL;
1121 free( ei->bei_rdn.bv_val );
1122 ei->bei_rdn.bv_val = NULL;
1123 ei->bei_modrdns = 0;
1127 ei->bei_parent = NULL;
1128 ei->bei_kids = NULL;
1129 ei->bei_lruprev = NULL;
1131 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1132 ei->bei_lrunext = cache->c_eifree;
1133 cache->c_eifree = ei;
1134 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1135 bdb_cache_entryinfo_unlock( ei );
1139 bdb_cache_delete_internal(
1144 int rc = 0; /* return code */
1146 /* Lock the parent's kids tree */
1147 bdb_cache_entryinfo_lock( e->bei_parent );
1150 e->bei_parent->bei_ckids--;
1151 if ( decr && e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
1154 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp )
1159 if ( e->bei_parent->bei_kids )
1163 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL ) {
1171 LRU_DELETE( cache, e );
1172 if ( e->bei_e ) cache->c_cursize--;
1175 bdb_cache_entryinfo_unlock( e->bei_parent );
1181 bdb_entryinfo_release( void *data )
1183 EntryInfo *ei = (EntryInfo *)data;
1184 if ( ei->bei_kids ) {
1185 avl_free( ei->bei_kids, NULL );
1188 ei->bei_e->e_private = NULL;
1189 #ifdef SLAP_ZONE_ALLOC
1190 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1192 bdb_entry_return( ei->bei_e );
1195 bdb_cache_entryinfo_destroy( ei );
1199 bdb_cache_release_all( Cache *cache )
1201 /* set cache write lock */
1202 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1204 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1206 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1208 avl_free( cache->c_dntree.bei_kids, NULL );
1209 avl_free( cache->c_idtree, bdb_entryinfo_release );
1210 for (;cache->c_eifree;cache->c_eifree = cache->c_lruhead) {
1211 cache->c_lruhead = cache->c_eifree->bei_lrunext;
1212 bdb_cache_entryinfo_destroy(cache->c_eifree);
1214 cache->c_cursize = 0;
1215 cache->c_eiused = 0;
1216 cache->c_leaves = 0;
1217 cache->c_idtree = NULL;
1218 cache->c_lruhead = NULL;
1219 cache->c_lrutail = NULL;
1220 cache->c_dntree.bei_kids = NULL;
1222 /* free lru mutex */
1223 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1224 /* free cache write lock */
1225 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1231 bdb_lru_print( Cache *cache )
1235 fprintf( stderr, "LRU queue (head to tail):\n" );
1236 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
1237 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1238 e->bei_nrdn.bv_val, e->bei_id );
1240 fprintf( stderr, "LRU queue (tail to head):\n" );
1241 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
1242 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1243 e->bei_nrdn.bv_val, e->bei_id );
1249 #ifdef BDB_REUSE_LOCKERS
1251 bdb_locker_id_free( void *key, void *data )
1254 u_int32_t lockid = (long)data;
1257 rc = XLOCK_ID_FREE( env, lockid );
1258 if ( rc == EINVAL ) {
1260 Debug( LDAP_DEBUG_ANY,
1261 "bdb_locker_id_free: %lu err %s(%d)\n",
1262 (unsigned long) lockid, db_strerror(rc), rc );
1263 /* release all locks held by this locker. */
1264 lr.op = DB_LOCK_PUT_ALL;
1266 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1267 XLOCK_ID_FREE( env, lockid );
1272 bdb_locker_id( Operation *op, DB_ENV *env, u_int32_t *locker )
1279 if ( !env || !locker ) return -1;
1281 /* If no op was provided, try to find the ctx anyway... */
1283 ctx = op->o_threadctx;
1285 ctx = ldap_pvt_thread_pool_context();
1288 /* Shouldn't happen unless we're single-threaded */
1294 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1295 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1296 rc = XLOCK_ID( env, &lockid );
1297 if (rc) ldap_pvt_thread_yield();
1302 data = (void *)((long)lockid);
1303 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1304 data, bdb_locker_id_free ) ) ) {
1305 XLOCK_ID_FREE( env, lockid );
1306 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1307 db_strerror(rc), rc, 0 );
1312 lockid = (long)data;
1317 #endif /* BDB_REUSE_LOCKERS */
1320 bdb_cache_delete_entry(
1321 struct bdb_info *bdb,
1326 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
1327 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, bdb->bi_cache.c_locker, ei, 1, 1, lock ) == 0 )
1329 if ( ei->bei_e && !(ei->bei_state & CACHE_ENTRY_NOT_LINKED )) {
1330 LRU_DELETE( &bdb->bi_cache, ei );
1331 ei->bei_e->e_private = NULL;
1332 #ifdef SLAP_ZONE_ALLOC
1333 bdb_entry_return( bdb, ei->bei_e, ei->bei_zseq );
1335 bdb_entry_return( ei->bei_e );
1338 --bdb->bi_cache.c_cursize;
1340 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
1342 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );