1 /* cache.c - routines to maintain an in-core cache of entries */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/string.h>
14 #include <ac/socket.h>
20 static int bdb_cache_delete_internal(Cache *cache, EntryInfo *e);
22 static void bdb_lru_print(Cache *cache);
26 bdb_cache_entryinfo_new( )
30 ei = ch_calloc(1, sizeof(struct bdb_entry_info));
31 ldap_pvt_thread_mutex_init( &ei->bei_kids_mutex );
36 /* Atomically release and reacquire a lock */
38 bdb_cache_entry_db_relock(
53 if ( !lock ) return 0;
56 lockobj.size = sizeof(ei->bei_parent) + sizeof(ei->bei_id);
58 list[0].op = DB_LOCK_PUT;
60 list[1].op = DB_LOCK_GET;
62 list[1].mode = rw ? DB_LOCK_WRITE : DB_LOCK_READ;
63 list[1].obj = &lockobj;
64 rc = env->lock_vec(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
69 LDAP_LOG( CACHE, DETAIL1,
70 "bdb_cache_entry_db_relock: entry %ld, rw %d, rc %d\n",
73 Debug( LDAP_DEBUG_TRACE,
74 "bdb_cache_entry_db_relock: entry %ld, rw %d, rc %d\n",
84 bdb_cache_entry_db_lock
85 ( DB_ENV *env, u_int32_t locker, EntryInfo *ei, int rw, int tryOnly, DB_LOCK *lock )
94 if ( !lock ) return 0;
97 db_rw = DB_LOCK_WRITE;
102 lockobj.size = sizeof(ei->bei_parent) + sizeof(ei->bei_id);
104 rc = LOCK_GET(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
105 &lockobj, db_rw, lock);
108 LDAP_LOG( CACHE, DETAIL1,
109 "bdb_cache_entry_db_lock: entry %ld, rw %d, rc %d\n",
110 ei->bei_id, rw, rc );
112 Debug( LDAP_DEBUG_TRACE,
113 "bdb_cache_entry_db_lock: entry %ld, rw %d, rc %d\n",
114 ei->bei_id, rw, rc );
118 #endif /* NO_THREADS */
122 bdb_cache_entry_db_unlock
123 ( DB_ENV *env, DB_LOCK *lock )
130 rc = LOCK_PUT ( env, lock );
136 bdb_cache_entryinfo_destroy( EntryInfo *e )
138 ldap_pvt_thread_mutex_destroy( &e->bei_kids_mutex );
139 free( e->bei_nrdn.bv_val );
141 free( e->bei_rdn.bv_val );
147 #define LRU_DELETE( cache, ei ) do { \
148 if ( (ei)->bei_lruprev != NULL ) { \
149 (ei)->bei_lruprev->bei_lrunext = (ei)->bei_lrunext; \
151 (cache)->c_lruhead = (ei)->bei_lrunext; \
153 if ( (ei)->bei_lrunext != NULL ) { \
154 (ei)->bei_lrunext->bei_lruprev = (ei)->bei_lruprev; \
156 (cache)->c_lrutail = (ei)->bei_lruprev; \
160 #define LRU_ADD( cache, ei ) do { \
161 (ei)->bei_lrunext = (cache)->c_lruhead; \
162 if ( (ei)->bei_lrunext != NULL ) { \
163 (ei)->bei_lrunext->bei_lruprev = (ei); \
165 (cache)->c_lruhead = (ei); \
166 (ei)->bei_lruprev = NULL; \
167 if ( (cache)->c_lrutail == NULL ) { \
168 (cache)->c_lrutail = (ei); \
172 /* Do a length-ordered sort on normalized RDNs */
174 bdb_rdn_cmp( const void *v_e1, const void *v_e2 )
176 const EntryInfo *e1 = v_e1, *e2 = v_e2;
177 int rc = e1->bei_nrdn.bv_len - e2->bei_nrdn.bv_len;
178 if (rc == 0) rc = strncmp( e1->bei_nrdn.bv_val, e2->bei_nrdn.bv_val,
179 e1->bei_nrdn.bv_len );
184 bdb_id_cmp( const void *v_e1, const void *v_e2 )
186 const EntryInfo *e1 = v_e1, *e2 = v_e2;
187 return e1->bei_id - e2->bei_id;
190 /* Create an entryinfo in the cache. Caller must release the locks later.
193 bdb_entryinfo_add_internal(
194 struct bdb_info *bdb,
199 EntryInfo *ei2 = NULL;
203 ei2 = bdb_cache_entryinfo_new();
205 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
206 bdb_cache_entryinfo_lock( ei->bei_parent );
208 ei2->bei_id = ei->bei_id;
209 ei2->bei_parent = ei->bei_parent;
211 ei2->bei_rdn = ei->bei_rdn;
214 /* Add to cache ID tree */
215 if (avl_insert( &bdb->bi_cache.c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
217 eix = avl_find( bdb->bi_cache.c_idtree, ei2, bdb_id_cmp );
218 bdb_cache_entryinfo_destroy( ei2 );
221 /* It got freed above because its value was
224 ei->bei_rdn.bv_val = NULL;
227 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
228 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
231 ei->bei_parent->bei_ckids++;
239 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
240 * the info for its closest ancestor. *res should be NULL to process a
241 * complete DN starting from the tree root. Otherwise *res must be the
242 * immediate parent of the requested DN, and only the RDN will be searched.
243 * The EntryInfo is locked upon return and must be unlocked by the caller.
253 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
254 EntryInfo ei, *eip, *ei2;
258 /* this function is always called with normalized DN */
260 /* we're doing a onelevel search for an RDN */
261 ei.bei_nrdn.bv_val = ndn->bv_val;
262 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
265 /* we're searching a full DN from the root */
266 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
267 ei.bei_nrdn.bv_val = ptr;
268 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
269 eip = &bdb->bi_cache.c_dntree;
272 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
274 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
276 int len = ei.bei_nrdn.bv_len;
278 ei.bei_nrdn.bv_len = ndn->bv_len - (ei.bei_nrdn.bv_val - ndn->bv_val);
279 bdb_cache_entryinfo_unlock( eip );
281 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
283 bdb_cache_entryinfo_lock( eip );
288 /* DN exists but needs to be added to cache */
289 ei.bei_nrdn.bv_len = len;
290 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2 );
291 /* add_internal left eip and c_rwlock locked */
292 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
297 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
298 /* In the midst of deleting? Give it a chance to
301 bdb_cache_entryinfo_unlock( eip );
302 ldap_pvt_thread_yield();
303 bdb_cache_entryinfo_lock( eip );
307 bdb_cache_entryinfo_unlock( eip );
308 bdb_cache_entryinfo_lock( ei2 );
312 /* Advance to next lower RDN */
313 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
314 && !DN_SEPARATOR(*ptr); ptr--);
315 if ( ptr >= ndn->bv_val ) {
316 if (DN_SEPARATOR(*ptr)) ptr++;
317 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
318 ei.bei_nrdn.bv_val = ptr;
320 if ( ptr < ndn->bv_val ) {
330 /* Walk up the tree from a child node, looking for an ID that's already
331 * been linked into the cache.
334 hdb_cache_find_parent(
341 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
342 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
343 char ndn[SLAP_LDAPDN_MAXLEN];
352 rc = hdb_dn2id_parent( op, txn, &ei, &eip.bei_id );
355 /* Save the previous node, if any */
358 /* Create a new node for the current ID */
359 ein = bdb_cache_entryinfo_new();
360 ein->bei_id = ei.bei_id;
361 ein->bei_kids = ei.bei_kids;
362 ein->bei_nrdn = ei.bei_nrdn;
363 ein->bei_rdn = ei.bei_rdn;
365 /* This node is not fully connected yet */
366 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
368 /* Insert this node into the ID tree */
369 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
370 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
371 bdb_id_cmp, avl_dup_error ) ) {
373 /* Someone else created this node just before us.
374 * Free our new copy and use the existing one.
376 bdb_cache_entryinfo_destroy( ein );
377 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
378 (caddr_t) &ei, bdb_id_cmp );
380 /* Link in any kids we've already processed */
382 bdb_cache_entryinfo_lock( ein );
383 avl_insert( &ein->bei_kids, (caddr_t)ei2,
384 bdb_rdn_cmp, avl_dup_error );
385 bdb_cache_entryinfo_unlock( ein );
393 /* If this is the first time, save this node
394 * to be returned later.
396 if ( eir == NULL ) eir = ein;
398 /* If there was a previous node, link it to this one */
399 if ( ei2 ) ei2->bei_parent = ein;
401 /* Look for this node's parent */
403 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
404 (caddr_t) &eip, bdb_id_cmp );
406 ei2 = &bdb->bi_cache.c_dntree;
408 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
410 /* Got the parent, link in and we're done. */
412 bdb_cache_entryinfo_lock( ei2 );
413 ein->bei_parent = ei2;
414 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
416 bdb_cache_entryinfo_unlock( ei2 );
417 bdb_cache_entryinfo_lock( eir );
419 /* Reset all the state info */
420 for (ein = eir; ein != ei2; ein=ein->bei_parent)
421 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
426 ei.bei_id = eip.bei_id;
427 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
433 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
437 struct bdb_info *bdb,
444 /* See if we already have this one */
445 bdb_cache_entryinfo_lock( ei->bei_parent );
446 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
447 bdb_cache_entryinfo_unlock( ei->bei_parent );
450 /* Not found, add it */
453 /* bei_rdn was not malloc'd before, do it now */
454 ber_dupbv( &bv, &ei->bei_rdn );
457 rc = bdb_entryinfo_add_internal( bdb, ei, res );
458 bdb_cache_entryinfo_unlock( ei->bei_parent );
459 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
461 /* Found, return it */
469 /* caller must have lru_mutex locked. mutex
470 * will be unlocked on return.
474 struct bdb_info *bdb,
481 /* See if we're above the cache size limit */
482 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
483 EntryInfo *elru, *elprev;
486 /* Look for an unused entry to remove */
487 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
488 elprev = elru->bei_lruprev;
490 /* Too many probes, not enough idle, give up */
493 /* If we can successfully writelock it, then
494 * the object is idle.
496 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, elru, 1, 1,
498 /* If there's no entry, or this node is in
499 * the process of linking into the cache,
502 if ( !elru->bei_e || (elru->bei_state & CACHE_ENTRY_NOT_LINKED) ) {
503 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &lock );
506 LRU_DELETE( &bdb->bi_cache, elru );
507 elru->bei_e->e_private = NULL;
508 bdb_entry_return( elru->bei_e );
510 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &lock );
511 --bdb->bi_cache.c_cursize;
512 if (bdb->bi_cache.c_cursize < bdb->bi_cache.c_maxsize)
517 LRU_ADD( &bdb->bi_cache, ei );
518 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
522 * cache_find_id - find an entry in the cache, given id.
523 * The entry is locked for Read upon return. Call with islocked TRUE if
524 * the supplied *eip was already locked.
538 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
546 /* If we weren't given any info, see if we have it already cached */
548 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
549 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
550 (caddr_t) &ei, bdb_id_cmp );
552 /* If the lock attempt fails, the info is in use */
553 if ( ldap_pvt_thread_mutex_trylock(
554 &(*eip)->bei_kids_mutex )) {
555 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
556 /* If this node is being deleted, treat
557 * as if the delete has already finished
559 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
562 /* otherwise, wait for the info to free up */
563 ldap_pvt_thread_yield();
566 /* If this info isn't hooked up to its parent yet,
567 * unlock and wait for it to be fully initialized
569 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
570 bdb_cache_entryinfo_unlock( *eip );
571 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
572 ldap_pvt_thread_yield();
577 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
580 /* See if the ID exists in the database; add it to the cache if so */
583 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
585 rc = bdb_cache_find_ndn( op, tid,
590 bdb_entry_return( ep );
595 rc = hdb_cache_find_parent(op, tid, id, eip );
596 if ( rc == 0 && *eip )
601 /* Ok, we found the info, do we have the entry? */
602 if ( *eip && rc == 0 ) {
603 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
606 bdb_cache_entry_db_lock( bdb->bi_dbenv, locker,
608 if ( !(*eip)->bei_e ) {
610 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
613 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
615 /* Make sure no other modifier beat us to it */
616 if ( (*eip)->bei_e ) {
617 bdb_entry_return( ep );
620 ep->e_private = *eip;
626 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
630 /* If we had the entry already, this item
631 * is on the LRU list.
635 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
637 bdb_cache_entry_db_relock( bdb->bi_dbenv,
638 locker, *eip, 1, 0, lock );
639 /* check again in case other modifier did it already */
640 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
641 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
642 bdb_cache_entry_db_relock( bdb->bi_dbenv,
643 locker, *eip, 0, 0, lock );
651 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
652 /* if entry is old, remove from old spot on LRU list */
654 LRU_DELETE( &bdb->bi_cache, *eip );
656 /* if entry is new, bump cache size */
657 bdb->bi_cache.c_cursize++;
659 /* lru_mutex is unlocked for us */
660 bdb_cache_lru_add( bdb, locker, *eip );
664 bdb_cache_entryinfo_unlock( *eip );
678 if ( BEI(e)->bei_kids ) {
681 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
684 rc = bdb_dn2id_children( op, txn, e );
685 if ( rc == DB_NOTFOUND ) {
686 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS;
691 /* Update the cache after a successful database Add. */
694 struct bdb_info *bdb,
702 struct berval rdn = e->e_name;
709 if ( nrdn->bv_len != e->e_nname.bv_len ) {
710 char *ptr = strchr( rdn.bv_val, ',' );
711 rdn.bv_len = ptr - rdn.bv_val;
713 ber_dupbv( &ei.bei_rdn, &rdn );
714 if ( eip->bei_dkids ) eip->bei_dkids++;
716 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
719 new->bei_state = CACHE_ENTRY_NO_KIDS;
720 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
723 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
724 ++bdb->bi_cache.c_cursize;
725 /* lru_mutex is unlocked for us */
726 bdb_cache_lru_add( bdb, locker, new );
728 bdb_cache_entryinfo_unlock( eip );
729 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
742 EntryInfo *ei = BEI(e);
744 /* Get write lock on data */
745 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
747 /* If we've done repeated mods on a cached entry, then e_attrs
748 * is no longer contiguous with the entry, and must be freed.
750 if ( (void *)e->e_attrs != (void *)(e+1) ) {
751 attrs_free( e->e_attrs );
753 e->e_attrs = newAttrs;
759 * Change the rdn in the entryinfo. Also move to a new parent if needed.
772 EntryInfo *ei = BEI(e), *pei;
776 /* Get write lock on data */
777 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
779 /* If we've done repeated mods on a cached entry, then e_attrs
780 * is no longer contiguous with the entry, and must be freed.
782 if ( (void *)e->e_attrs != (void *)(e+1) ) {
783 attrs_free( e->e_attrs );
785 e->e_attrs = new->e_attrs;
786 if( e->e_nname.bv_val < e->e_bv.bv_val || e->e_nname.bv_val >
787 e->e_bv.bv_val + e->e_bv.bv_len ) {
788 ch_free(e->e_name.bv_val);
789 ch_free(e->e_nname.bv_val);
791 e->e_name = new->e_name;
792 e->e_nname = new->e_nname;
794 /* Lock the parent's kids AVL tree */
795 pei = ei->bei_parent;
796 bdb_cache_entryinfo_lock( pei );
797 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
798 free( ei->bei_nrdn.bv_val );
799 ber_dupbv( &ei->bei_nrdn, nrdn );
801 free( ei->bei_rdn.bv_val );
804 if ( nrdn->bv_len != e->e_nname.bv_len ) {
805 char *ptr = strchr(rdn.bv_val, ',');
806 rdn.bv_len = ptr - rdn.bv_val;
808 ber_dupbv( &ei->bei_rdn, &rdn );
812 ein = ei->bei_parent;
814 ei->bei_parent = ein;
815 bdb_cache_entryinfo_unlock( pei );
816 bdb_cache_entryinfo_lock( ein );
819 { int max = ei->bei_modrdns;
820 /* Record the generation number of this change */
821 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
822 if ( pei->bei_modrdns > max )
823 max = pei->bei_modrdns;
825 ei->bei_modrdns = max + 1;
828 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
829 bdb_cache_entryinfo_unlock( ein );
833 * cache_delete - delete the entry e from the cache.
835 * returns: 0 e was deleted ok
836 * 1 e was not in the cache
837 * -1 something bad happened
848 EntryInfo *ei = BEI(e);
851 assert( e->e_private );
853 /* Set this early, warn off any queriers */
854 ei->bei_state |= CACHE_ENTRY_DELETED;
856 /* Lock the entry's info */
857 bdb_cache_entryinfo_lock( ei );
859 /* Get write lock on the data */
860 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
862 /* set cache write lock */
863 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
865 /* Lock the parent's kids tree */
866 bdb_cache_entryinfo_lock( ei->bei_parent );
869 LDAP_LOG( CACHE, ENTRY,
870 "bdb_cache_delete: delete %ld.\n", e->e_id, 0, 0 );
872 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
877 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
878 rc = bdb_cache_delete_internal( cache, e->e_private );
880 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
882 /* free cache write lock */
883 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
884 bdb_cache_entryinfo_unlock( ei->bei_parent );
886 /* Leave entry info locked */
892 bdb_cache_delete_cleanup(
896 bdb_cache_entryinfo_unlock( BEI(e) );
897 bdb_cache_entryinfo_destroy( e->e_private );
899 bdb_entry_return( e );
903 bdb_cache_delete_internal(
908 int rc = 0; /* return code */
911 e->bei_parent->bei_ckids--;
912 if ( e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
915 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp ) == NULL )
921 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL )
931 LRU_DELETE( cache, e );
935 * flag entry to be freed later by a call to cache_return_entry()
937 e->bei_state |= CACHE_ENTRY_DELETED;
943 bdb_entryinfo_release( void *data )
945 EntryInfo *ei = (EntryInfo *)data;
946 if ( ei->bei_kids ) {
947 avl_free( ei->bei_kids, NULL );
950 ei->bei_e->e_private = NULL;
951 bdb_entry_return( ei->bei_e );
953 bdb_cache_entryinfo_destroy( ei );
957 bdb_cache_release_all( Cache *cache )
959 /* set cache write lock */
960 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
962 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
965 LDAP_LOG( CACHE, ENTRY, "bdb_cache_release_all: enter\n", 0, 0, 0 );
967 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
970 avl_free( cache->c_dntree.bei_kids, NULL );
971 avl_free( cache->c_idtree, bdb_entryinfo_release );
972 cache->c_lruhead = NULL;
973 cache->c_lrutail = NULL;
976 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
977 /* free cache write lock */
978 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
983 bdb_lru_print( Cache *cache )
987 fprintf( stderr, "LRU queue (head to tail):\n" );
988 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
989 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
990 e->bei_nrdn.bv_val, e->bei_id );
992 fprintf( stderr, "LRU queue (tail to head):\n" );
993 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
994 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
995 e->bei_nrdn.bv_val, e->bei_id );
1000 #ifdef BDB_REUSE_LOCKERS
1002 bdb_locker_id_free( void *key, void *data )
1005 int lockid = (int) data;
1009 rc = XLOCK_ID_FREE( env, lockid );
1010 if ( rc == EINVAL ) {
1013 LDAP_LOG( BACK_BDB, ERR,
1014 "bdb_locker_id_free: %d err %s(%d)\n",
1015 lockid, db_strerror(rc), rc );
1017 Debug( LDAP_DEBUG_ANY,
1018 "bdb_locker_id_free: %d err %s(%d)\n",
1019 lockid, db_strerror(rc), rc );
1021 memset( &lr, 0, sizeof(lr) );
1023 /* release all locks held by this locker. */
1024 lr.op = DB_LOCK_PUT_ALL;
1025 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1026 XLOCK_ID_FREE( env, lockid );
1031 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
1037 if ( !env || !locker ) return -1;
1039 /* If no op was provided, try to find the ctx anyway... */
1041 ctx = op->o_threadctx;
1043 ctx = ldap_pvt_thread_pool_context();
1046 /* Shouldn't happen unless we're single-threaded */
1052 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1053 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1054 rc = XLOCK_ID( env, &lockid );
1055 if (rc) ldap_pvt_thread_yield();
1060 data = (void *)lockid;
1061 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1062 data, bdb_locker_id_free ) ) ) {
1063 XLOCK_ID_FREE( env, lockid );
1065 LDAP_LOG( BACK_BDB, ERR, "bdb_locker_id: err %s(%d)\n",
1066 db_strerror(rc), rc, 0 );
1068 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1069 db_strerror(rc), rc, 0 );