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,
200 Cache *cache = &bdb->bi_cache;
201 DB_ENV *env = bdb->bi_dbenv;
202 EntryInfo *ei2 = NULL;
210 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
211 bdb_cache_entryinfo_lock( ei->bei_parent );
213 /* if parent was previously considered a leaf node,
214 * it was on the LRU list. Now it's going to have
215 * kids, take it off the LRU list.
217 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
218 if ( ei->bei_parent->bei_id && !ei->bei_parent->bei_kids ) {
219 LRU_DELETE( cache, ei->bei_parent );
223 cache->c_cursize += incr;
225 /* See if we're above the cache size limit */
226 if ( cache->c_cursize > cache->c_maxsize ) {
227 EntryInfo *elru, *elprev;
230 /* Look for an unused entry to remove */
231 for (elru = cache->c_lrutail; elru; elru = elprev, i++ ) {
232 elprev = elru->bei_lruprev;
234 /* Too many probes, not enough idle, give up */
237 /* If we can successfully writelock it, then
238 * the object is idle.
240 if ( bdb_cache_entry_db_lock( env, locker, elru, 1, 1,
242 /* If there's no entry, or this node is in
243 * the process of linking into the cache,
246 if ( !elru->bei_e || (elru->bei_state & CACHE_ENTRY_NOT_LINKED) ) {
247 bdb_cache_entry_db_unlock( env, &lock );
250 /* Need to lock parent to delete child */
251 if ( ldap_pvt_thread_mutex_trylock(
252 &elru->bei_parent->bei_kids_mutex )) {
253 bdb_cache_entry_db_unlock( env, &lock );
256 bdb_cache_delete_internal( cache, elru );
257 bdb_cache_entryinfo_unlock( elru->bei_parent );
258 elru->bei_e->e_private = NULL;
259 bdb_entry_return( elru->bei_e );
260 bdb_cache_entry_db_unlock( env, &lock );
262 bdb_cache_entryinfo_destroy( elru );
264 /* re-use this one */
265 ch_free(elru->bei_nrdn.bv_val);
266 elru->bei_nrdn.bv_val = NULL;
268 elru->bei_kids = NULL;
269 elru->bei_lrunext = NULL;
270 elru->bei_lruprev = NULL;
273 ch_free(elru->bei_rdn.bv_val);
274 elru->bei_rdn.bv_val = NULL;
275 elru->bei_modrdns = 0;
279 if (cache->c_cursize < cache->c_maxsize)
285 ei2 = bdb_cache_entryinfo_new();
287 ei2->bei_id = ei->bei_id;
288 ei2->bei_parent = ei->bei_parent;
290 ei2->bei_rdn = ei->bei_rdn;
293 /* Add to cache ID tree */
294 if (avl_insert( &cache->c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
296 eix = avl_find( cache->c_idtree, ei2, bdb_id_cmp );
297 bdb_cache_entryinfo_destroy( ei2 );
300 cache->c_cursize -= incr;
302 /* It got freed above because its value was
305 ei->bei_rdn.bv_val = NULL;
308 LRU_ADD( cache, ei2 );
309 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
313 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
317 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
323 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
324 * the info for its closest ancestor. *res should be NULL to process a
325 * complete DN starting from the tree root. Otherwise *res must be the
326 * immediate parent of the requested DN, and only the RDN will be searched.
327 * The EntryInfo is locked upon return and must be unlocked by the caller.
338 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
339 EntryInfo ei, *eip, *ei2;
343 /* this function is always called with normalized DN */
345 /* we're doing a onelevel search for an RDN */
346 ei.bei_nrdn.bv_val = ndn->bv_val;
347 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
350 /* we're searching a full DN from the root */
351 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
352 ei.bei_nrdn.bv_val = ptr;
353 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
354 eip = &bdb->bi_cache.c_dntree;
357 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
359 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
361 int len = ei.bei_nrdn.bv_len;
363 ei.bei_nrdn.bv_len = ndn->bv_len - (ei.bei_nrdn.bv_val - ndn->bv_val);
364 bdb_cache_entryinfo_unlock( eip );
366 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
368 bdb_cache_entryinfo_lock( eip );
373 /* DN exists but needs to be added to cache */
374 ei.bei_nrdn.bv_len = len;
375 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2,
377 /* add_internal left eip and c_rwlock locked */
378 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
383 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
384 /* In the midst of deleting? Give it a chance to
387 bdb_cache_entryinfo_unlock( eip );
388 ldap_pvt_thread_yield();
389 bdb_cache_entryinfo_lock( eip );
393 bdb_cache_entryinfo_unlock( eip );
394 bdb_cache_entryinfo_lock( ei2 );
398 /* Advance to next lower RDN */
399 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
400 && !DN_SEPARATOR(*ptr); ptr--);
401 if ( ptr >= ndn->bv_val ) {
402 if (DN_SEPARATOR(*ptr)) ptr++;
403 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
404 ei.bei_nrdn.bv_val = ptr;
406 if ( ptr < ndn->bv_val ) {
416 /* Walk up the tree from a child node, looking for an ID that's already
417 * been linked into the cache.
420 hdb_cache_find_parent(
427 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
428 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
429 char ndn[SLAP_LDAPDN_MAXLEN];
438 rc = hdb_dn2id_parent( op, txn, &ei, &eip.bei_id );
441 /* Save the previous node, if any */
444 /* Create a new node for the current ID */
445 ein = bdb_cache_entryinfo_new();
446 ein->bei_id = ei.bei_id;
447 ein->bei_kids = ei.bei_kids;
448 ein->bei_nrdn = ei.bei_nrdn;
449 ein->bei_rdn = ei.bei_rdn;
451 /* This node is not fully connected yet */
452 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
454 /* Insert this node into the ID tree */
455 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
456 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
457 bdb_id_cmp, avl_dup_error ) ) {
459 /* Someone else created this node just before us.
460 * Free our new copy and use the existing one.
462 bdb_cache_entryinfo_destroy( ein );
463 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
464 (caddr_t) &ei, bdb_id_cmp );
466 /* Link in any kids we've already processed */
468 bdb_cache_entryinfo_lock( ein );
469 avl_insert( &ein->bei_kids, (caddr_t)ei2,
470 bdb_rdn_cmp, avl_dup_error );
471 bdb_cache_entryinfo_unlock( ein );
479 /* If this is the first time, save this node
480 * to be returned later.
482 if ( eir == NULL ) eir = ein;
484 /* If there was a previous node, link it to this one */
485 if ( ei2 ) ei2->bei_parent = ein;
487 /* Look for this node's parent */
489 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
490 (caddr_t) &eip, bdb_id_cmp );
492 ei2 = &bdb->bi_cache.c_dntree;
494 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
496 /* Got the parent, link in and we're done. */
498 bdb_cache_entryinfo_lock( ei2 );
499 ein->bei_parent = ei2;
500 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
502 bdb_cache_entryinfo_unlock( ei2 );
503 bdb_cache_entryinfo_lock( eir );
505 /* Reset all the state info */
506 for (ein = eir; ein != ei2; ein=ein->bei_parent)
507 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
512 ei.bei_id = eip.bei_id;
513 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
521 * cache_find_id - find an entry in the cache, given id.
522 * The entry is locked for Read upon return. Call with islocked TRUE if
523 * the supplied *eip was already locked.
537 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
544 /* If we weren't given any info, see if we have it already cached */
546 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
547 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
548 (caddr_t) &ei, bdb_id_cmp );
550 /* If the lock attempt fails, the info is in use */
551 if ( ldap_pvt_thread_mutex_trylock(
552 &(*eip)->bei_kids_mutex )) {
553 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
554 /* If this node is being deleted, treat
555 * as if the delete has already finished
557 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
560 /* otherwise, wait for the info to free up */
561 ldap_pvt_thread_yield();
564 /* If this info isn't hooked up to its parent yet,
565 * unlock and wait for it to be fully initialized
567 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
568 bdb_cache_entryinfo_unlock( *eip );
569 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
570 ldap_pvt_thread_yield();
575 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
578 /* See if the ID exists in the database; add it to the cache if so */
581 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
583 rc = bdb_cache_find_ndn( op, tid,
584 &ep->e_nname, eip, locker );
588 bdb_entry_return( ep );
593 rc = hdb_cache_find_parent(op, tid, id, eip );
594 if ( rc == 0 && *eip )
599 /* Ok, we found the info, do we have the entry? */
600 if ( *eip && rc == 0 ) {
601 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
604 bdb_cache_entry_db_lock( bdb->bi_dbenv, locker,
606 if ( !(*eip)->bei_e ) {
608 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
611 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
613 /* Make sure no other modifier beat us to it */
614 if ( (*eip)->bei_e ) {
615 bdb_entry_return( ep );
618 ep->e_private = *eip;
624 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
630 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
632 bdb_cache_entry_db_relock( bdb->bi_dbenv,
633 locker, *eip, 1, 0, lock );
634 /* check again in case other modifier did it already */
635 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
636 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
637 bdb_cache_entry_db_relock( bdb->bi_dbenv,
638 locker, *eip, 0, 0, lock );
644 if ( rc == 0 && (*eip)->bei_kids == NULL ) {
646 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
647 LRU_DELETE( &bdb->bi_cache, *eip );
648 LRU_ADD( &bdb->bi_cache, *eip );
649 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
653 bdb_cache_entryinfo_unlock( *eip );
667 if ( BEI(e)->bei_kids ) {
670 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
673 rc = bdb_dn2id_children( op, txn, e );
674 if ( rc == DB_NOTFOUND ) {
675 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS;
680 /* Update the cache after a successful database Add. */
683 struct bdb_info *bdb,
691 struct berval rdn = e->e_name;
698 if ( nrdn->bv_len != e->e_nname.bv_len ) {
699 char *ptr = strchr( rdn.bv_val, ',' );
700 rdn.bv_len = ptr - rdn.bv_val;
702 ber_dupbv( &ei.bei_rdn, &rdn );
704 rc = bdb_entryinfo_add_internal( bdb, &ei, &new, locker );
707 new->bei_state = CACHE_ENTRY_NO_KIDS;
708 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
709 bdb_cache_entryinfo_unlock( eip );
710 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
723 EntryInfo *ei = BEI(e);
725 /* Get write lock on data */
726 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
728 /* If we've done repeated mods on a cached entry, then e_attrs
729 * is no longer contiguous with the entry, and must be freed.
731 if ( (void *)e->e_attrs != (void *)(e+1) ) {
732 attrs_free( e->e_attrs );
734 e->e_attrs = newAttrs;
740 * Change the rdn in the entryinfo. Also move to a new parent if needed.
753 EntryInfo *ei = BEI(e), *pei;
757 /* Get write lock on data */
758 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
760 /* If we've done repeated mods on a cached entry, then e_attrs
761 * is no longer contiguous with the entry, and must be freed.
763 if ( (void *)e->e_attrs != (void *)(e+1) ) {
764 attrs_free( e->e_attrs );
766 e->e_attrs = new->e_attrs;
767 if( e->e_nname.bv_val < e->e_bv.bv_val || e->e_nname.bv_val >
768 e->e_bv.bv_val + e->e_bv.bv_len ) {
769 ch_free(e->e_name.bv_val);
770 ch_free(e->e_nname.bv_val);
772 e->e_name = new->e_name;
773 e->e_nname = new->e_nname;
775 /* Lock the parent's kids AVL tree */
776 pei = ei->bei_parent;
777 bdb_cache_entryinfo_lock( pei );
778 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
779 free( ei->bei_nrdn.bv_val );
780 ber_dupbv( &ei->bei_nrdn, nrdn );
782 free( ei->bei_rdn.bv_val );
785 if ( nrdn->bv_len != e->e_nname.bv_len ) {
786 char *ptr = strchr(rdn.bv_val, ',');
787 rdn.bv_len = ptr - rdn.bv_val;
789 ber_dupbv( &ei->bei_rdn, &rdn );
793 ein = ei->bei_parent;
795 ei->bei_parent = ein;
796 bdb_cache_entryinfo_unlock( pei );
797 bdb_cache_entryinfo_lock( ein );
800 { int max = ei->bei_modrdns;
801 /* Record the generation number of this change */
802 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
803 if ( pei->bei_modrdns > max )
804 max = pei->bei_modrdns;
806 ei->bei_modrdns = max + 1;
809 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
810 bdb_cache_entryinfo_unlock( ein );
814 * cache_delete - delete the entry e from the cache.
816 * returns: 0 e was deleted ok
817 * 1 e was not in the cache
818 * -1 something bad happened
829 EntryInfo *ei = BEI(e);
832 assert( e->e_private );
834 /* Set this early, warn off any queriers */
835 ei->bei_state |= CACHE_ENTRY_DELETED;
837 /* Lock the entry's info */
838 bdb_cache_entryinfo_lock( ei );
840 /* Get write lock on the data */
841 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
843 /* set cache write lock */
844 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
846 /* Lock the parent's kids tree */
847 bdb_cache_entryinfo_lock( ei->bei_parent );
850 LDAP_LOG( CACHE, ENTRY,
851 "bdb_cache_delete: delete %ld.\n", e->e_id, 0, 0 );
853 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
858 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
859 rc = bdb_cache_delete_internal( cache, e->e_private );
861 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
863 /* free cache write lock */
864 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
865 bdb_cache_entryinfo_unlock( ei->bei_parent );
867 /* Leave entry info locked */
873 bdb_cache_delete_cleanup(
877 bdb_cache_entryinfo_unlock( BEI(e) );
878 bdb_cache_entryinfo_destroy( e->e_private );
880 bdb_entry_return( e );
884 bdb_cache_delete_internal(
889 int rc = 0; /* return code */
892 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp ) == NULL )
897 /* If parent has no more kids, put in on LRU list */
898 if ( e->bei_parent->bei_kids == NULL ) {
899 LRU_ADD( cache, e->bei_parent );
904 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL )
914 LRU_DELETE( cache, e );
918 * flag entry to be freed later by a call to cache_return_entry()
920 e->bei_state |= CACHE_ENTRY_DELETED;
926 bdb_entryinfo_release( void *data )
928 EntryInfo *ei = (EntryInfo *)data;
929 if ( ei->bei_kids ) {
930 avl_free( ei->bei_kids, NULL );
933 ei->bei_e->e_private = NULL;
934 bdb_entry_return( ei->bei_e );
936 bdb_cache_entryinfo_destroy( ei );
940 bdb_cache_release_all( Cache *cache )
942 /* set cache write lock */
943 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
945 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
948 LDAP_LOG( CACHE, ENTRY, "bdb_cache_release_all: enter\n", 0, 0, 0 );
950 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
953 avl_free( cache->c_dntree.bei_kids, NULL );
954 avl_free( cache->c_idtree, bdb_entryinfo_release );
955 cache->c_lruhead = NULL;
956 cache->c_lrutail = NULL;
959 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
960 /* free cache write lock */
961 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
966 bdb_lru_print( Cache *cache )
970 fprintf( stderr, "LRU queue (head to tail):\n" );
971 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
972 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
973 e->bei_nrdn.bv_val, e->bei_id );
975 fprintf( stderr, "LRU queue (tail to head):\n" );
976 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
977 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
978 e->bei_nrdn.bv_val, e->bei_id );
983 #ifdef BDB_REUSE_LOCKERS
985 bdb_locker_id_free( void *key, void *data )
988 int lockid = (int) data;
992 rc = XLOCK_ID_FREE( env, lockid );
993 if ( rc == EINVAL ) {
996 LDAP_LOG( BACK_BDB, ERR,
997 "bdb_locker_id_free: %d err %s(%d)\n",
998 lockid, db_strerror(rc), rc );
1000 Debug( LDAP_DEBUG_ANY,
1001 "bdb_locker_id_free: %d err %s(%d)\n",
1002 lockid, db_strerror(rc), rc );
1004 memset( &lr, 0, sizeof(lr) );
1006 /* release all locks held by this locker. */
1007 lr.op = DB_LOCK_PUT_ALL;
1008 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1009 XLOCK_ID_FREE( env, lockid );
1014 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
1020 if ( !env || !locker ) return -1;
1022 /* If no op was provided, try to find the ctx anyway... */
1024 ctx = op->o_threadctx;
1026 ctx = ldap_pvt_thread_pool_context();
1029 /* Shouldn't happen unless we're single-threaded */
1035 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1036 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1037 rc = XLOCK_ID( env, &lockid );
1038 if (rc) ldap_pvt_thread_yield();
1043 data = (void *)lockid;
1044 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1045 data, bdb_locker_id_free ) ) ) {
1046 XLOCK_ID_FREE( env, lockid );
1048 LDAP_LOG( BACK_BDB, ERR, "bdb_locker_id: err %s(%d)\n",
1049 db_strerror(rc), rc, 0 );
1051 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1052 db_strerror(rc), rc, 0 );