1 /* cache.c - routines to maintain an in-core cache of entries */
4 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/string.h>
14 #include <ac/socket.h>
20 /* BDB backend specific entry info -- visible only to the cache */
21 typedef struct bdb_entry_info {
22 ldap_pvt_thread_rdwr_t bei_rdwr; /* reader/writer lock */
25 * remaining fields require backend cache lock to access
26 * These items are specific to the BDB backend and should
29 int bei_state; /* for the cache */
30 #define CACHE_ENTRY_UNDEFINED 0
31 #define CACHE_ENTRY_CREATING 1
32 #define CACHE_ENTRY_READY 2
33 #define CACHE_ENTRY_DELETED 3
34 #define CACHE_ENTRY_COMMITTED 4
36 int bei_refcnt; /* # threads ref'ing this entry */
37 Entry *bei_lrunext; /* for cache lru list */
41 #define BEI(e) ((EntryInfo *) ((e)->e_private))
43 static int bdb_cache_delete_entry_internal(Cache *cache, Entry *e);
45 static void bdb_lru_print(Cache *cache);
49 bdb_cache_entry_rdwr_lock(Entry *e, int rw)
52 LDAP_LOG( CACHE, ENTRY,
53 "bdb_cache_entry_rdwr_lock: %s lock on ID %ld\n",
54 rw ? "w" : "r", e->e_id, 0 );
56 Debug( LDAP_DEBUG_ARGS, "entry_rdwr_%slock: ID: %ld\n",
57 rw ? "w" : "r", e->e_id, 0);
61 return ldap_pvt_thread_rdwr_wlock(&BEI(e)->bei_rdwr);
63 return ldap_pvt_thread_rdwr_rlock(&BEI(e)->bei_rdwr);
67 bdb_cache_entry_rdwr_trylock(Entry *e, int rw)
70 LDAP_LOG( CACHE, ENTRY,
71 "bdb_cache_entry_rdwr_trylock: try %s lock on ID: %ld.\n",
72 rw ? "w" : "r", e->e_id, 0 );
74 Debug( LDAP_DEBUG_ARGS, "entry_rdwr_%strylock: ID: %ld\n",
75 rw ? "w" : "r", e->e_id, 0);
79 return ldap_pvt_thread_rdwr_wtrylock(&BEI(e)->bei_rdwr);
81 return ldap_pvt_thread_rdwr_rtrylock(&BEI(e)->bei_rdwr);
85 bdb_cache_entry_rdwr_unlock(Entry *e, int rw)
88 LDAP_LOG( CACHE, ENTRY,
89 "bdb_cache_entry_rdwr_unlock: remove %s lock on ID %ld.\n",
90 rw ? "w" : "r", e->e_id, 0 );
92 Debug( LDAP_DEBUG_ARGS, "entry_rdwr_%sunlock: ID: %ld\n",
93 rw ? "w" : "r", e->e_id, 0);
97 return ldap_pvt_thread_rdwr_wunlock(&BEI(e)->bei_rdwr);
99 return ldap_pvt_thread_rdwr_runlock(&BEI(e)->bei_rdwr);
103 bdb_cache_entry_rdwr_init(Entry *e)
105 return ldap_pvt_thread_rdwr_init( &BEI(e)->bei_rdwr );
109 bdb_cache_entry_rdwr_destroy(Entry *e)
111 return ldap_pvt_thread_rdwr_destroy( &BEI(e)->bei_rdwr );
115 bdb_cache_entry_private_init( Entry *e )
117 assert( e->e_private == NULL );
119 if( e->e_private != NULL ) {
120 /* this should never happen */
124 e->e_private = ch_calloc(1, sizeof(struct bdb_entry_info));
126 if( bdb_cache_entry_rdwr_init( e ) != 0 ) {
136 bdb_cache_entry_db_lock
137 ( DB_ENV *env, u_int32_t locker, Entry *e, int rw, u_int32_t flags, DB_LOCK *lock )
144 db_rw = DB_LOCK_WRITE;
146 db_rw = DB_LOCK_READ;
148 lockobj.data = e->e_nname.bv_val;
149 lockobj.size = e->e_nname.bv_len;
150 rc = LOCK_GET(env, locker, flags | DB_LOCK_NOWAIT,
151 &lockobj, db_rw, lock);
156 bdb_cache_entry_db_unlock
157 ( DB_ENV *env, DB_LOCK *lock )
161 rc = LOCK_PUT ( env, lock );
166 * marks an entry in CREATING state as committed, so it is really returned
167 * to the cache. Otherwise an entry in CREATING state is removed.
168 * Makes e_private be destroyed at the following cache_return_entry_w,
169 * but lets the entry untouched (owned by someone else)
172 bdb_cache_entry_commit( Entry *e )
175 assert( e->e_private );
176 assert( BEI(e)->bei_state == CACHE_ENTRY_CREATING );
177 /* assert( BEI(e)->bei_refcnt == 1 ); */
179 BEI(e)->bei_state = CACHE_ENTRY_COMMITTED;
183 bdb_cache_entry_private_destroy( Entry *e )
185 assert( e->e_private );
187 bdb_cache_entry_rdwr_destroy( e );
189 free( e->e_private );
195 bdb_unlocked_cache_return_entry_rw( Cache *cache, Entry *e, int rw )
199 int refcnt, freeit = 1;
201 /* set cache write lock */
202 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
204 assert( e->e_private );
207 bdb_cache_entry_rdwr_unlock(e, rw);
211 refcnt = --BEI(e)->bei_refcnt;
214 * if the entry is returned when in CREATING state, it is deleted
215 * but not freed because it may belong to someone else (do_add,
218 if ( BEI(e)->bei_state == CACHE_ENTRY_CREATING ) {
220 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
221 bdb_cache_delete_entry_internal( cache, e );
223 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
225 /* now the entry is in DELETED state */
228 if ( BEI(e)->bei_state == CACHE_ENTRY_COMMITTED ) {
229 BEI(e)->bei_state = CACHE_ENTRY_READY;
231 /* free cache write lock */
232 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
235 LDAP_LOG( CACHE, DETAIL1,
236 "bdb_unlocked_cache_return_entry_rw: return (%ld):%s, refcnt=%d\n",
237 id, rw ? "w" : "r", refcnt );
239 Debug( LDAP_DEBUG_TRACE,
240 "====> bdb_unlocked_cache_return_entry_%s( %ld ): created (%d)\n",
241 rw ? "w" : "r", id, refcnt );
245 } else if ( BEI(e)->bei_state == CACHE_ENTRY_DELETED ) {
247 /* free cache write lock */
248 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
251 LDAP_LOG( CACHE, DETAIL1,
252 "bdb_unlocked_cache_return_entry_rw: %ld, delete pending (%d).\n",
255 Debug( LDAP_DEBUG_TRACE,
256 "====> bdb_unlocked_cache_return_entry_%s( %ld ): delete pending (%d)\n",
257 rw ? "w" : "r", id, refcnt );
261 bdb_cache_entry_private_destroy( e );
263 bdb_entry_return( e );
266 /* free cache write lock */
267 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
270 LDAP_LOG( CACHE, DETAIL1,
271 "bdb_unlocked_cache_return_entry_rw: (%ld): deleted (%d)\n",
274 Debug( LDAP_DEBUG_TRACE,
275 "====> bdb_unlocked_cache_return_entry_%s( %ld ): deleted (%d)\n",
276 rw ? "w" : "r", id, refcnt );
281 /* free cache write lock */
282 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
285 LDAP_LOG( CACHE, DETAIL1,
286 "bdb_unlocked_cache_return_entry_rw: ID %ld:%s returned (%d)\n",
287 id, rw ? "w": "r", refcnt );
289 Debug( LDAP_DEBUG_TRACE,
290 "====> bdb_unlocked_cache_return_entry_%s( %ld ): returned (%d)\n",
291 rw ? "w" : "r", id, refcnt);
297 bdb_cache_return_entry_rw
298 ( DB_ENV *env, Cache *cache, Entry *e, int rw, DB_LOCK *lock )
301 int refcnt, freeit = 1;
303 /* set cache write lock */
304 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
306 assert( e->e_private );
308 bdb_cache_entry_db_unlock( env, lock );
310 bdb_cache_entry_rdwr_unlock(e, rw);
314 refcnt = --BEI(e)->bei_refcnt;
317 * if the entry is returned when in CREATING state, it is deleted
318 * but not freed because it may belong to someone else (do_add,
321 if ( BEI(e)->bei_state == CACHE_ENTRY_CREATING ) {
323 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
324 bdb_cache_delete_entry_internal( cache, e );
326 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
328 /* now the entry is in DELETED state */
331 if ( BEI(e)->bei_state == CACHE_ENTRY_COMMITTED ) {
332 BEI(e)->bei_state = CACHE_ENTRY_READY;
334 /* free cache write lock */
335 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
338 LDAP_LOG( CACHE, DETAIL1,
339 "bdb_cache_return_entry_rw: return (%ld):%s, refcnt=%d\n",
340 id, rw ? "w" : "r", refcnt );
342 Debug( LDAP_DEBUG_TRACE,
343 "====> bdb_cache_return_entry_%s( %ld ): created (%d)\n",
344 rw ? "w" : "r", id, refcnt );
348 } else if ( BEI(e)->bei_state == CACHE_ENTRY_DELETED ) {
350 /* free cache write lock */
351 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
354 LDAP_LOG( CACHE, DETAIL1,
355 "bdb_cache_return_entry_rw: %ld, delete pending (%d).\n",
358 Debug( LDAP_DEBUG_TRACE,
359 "====> bdb_cache_return_entry_%s( %ld ): delete pending (%d)\n",
360 rw ? "w" : "r", id, refcnt );
364 bdb_cache_entry_private_destroy( e );
366 bdb_entry_return( e );
369 /* free cache write lock */
370 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
373 LDAP_LOG( CACHE, DETAIL1,
374 "bdb_cache_return_entry_rw: (%ld): deleted (%d)\n",
377 Debug( LDAP_DEBUG_TRACE,
378 "====> bdb_cache_return_entry_%s( %ld ): deleted (%d)\n",
379 rw ? "w" : "r", id, refcnt );
384 /* free cache write lock */
385 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
388 LDAP_LOG( CACHE, DETAIL1,
389 "bdb_cache_return_entry_rw: ID %ld:%s returned (%d)\n",
390 id, rw ? "w": "r", refcnt );
392 Debug( LDAP_DEBUG_TRACE,
393 "====> bdb_cache_return_entry_%s( %ld ): returned (%d)\n",
394 rw ? "w" : "r", id, refcnt);
399 #define LRU_DELETE( cache, e ) do { \
400 if ( BEI(e)->bei_lruprev != NULL ) { \
401 BEI(BEI(e)->bei_lruprev)->bei_lrunext = BEI(e)->bei_lrunext; \
403 (cache)->c_lruhead = BEI(e)->bei_lrunext; \
405 if ( BEI(e)->bei_lrunext != NULL ) { \
406 BEI(BEI(e)->bei_lrunext)->bei_lruprev = BEI(e)->bei_lruprev; \
408 (cache)->c_lrutail = BEI(e)->bei_lruprev; \
412 #define LRU_ADD( cache, e ) do { \
413 BEI(e)->bei_lrunext = (cache)->c_lruhead; \
414 if ( BEI(e)->bei_lrunext != NULL ) { \
415 BEI(BEI(e)->bei_lrunext)->bei_lruprev = (e); \
417 (cache)->c_lruhead = (e); \
418 BEI(e)->bei_lruprev = NULL; \
419 if ( (cache)->c_lrutail == NULL ) { \
420 (cache)->c_lrutail = (e); \
425 * cache_add_entry_rw - create and lock an entry in the cache
426 * returns: 0 entry has been created and locked
427 * 1 entry already existed
428 * -1 something bad happened
429 * other Berkeley DB locking error code
432 bdb_cache_add_entry_rw(
445 LDAP_LOG( CACHE, ENTRY,
446 "bdb_cache_add_entry_rw: add (%s):%s to cache\n",
447 e->e_dn, rw ? "w" : "r", 0 );
449 /* set cache write lock */
450 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
452 assert( e->e_private == NULL );
454 if( bdb_cache_entry_private_init(e) != 0 ) {
455 /* free cache write lock */
456 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
459 LDAP_LOG( CACHE, ERR,
460 "bdb_cache_add_entry_rw: add (%s):%ld private init failed!\n",
461 e->e_dn, e->e_id, 0 );
463 Debug( LDAP_DEBUG_ANY,
464 "====> bdb_cache_add_entry( %ld ): \"%s\": private init failed!\n",
465 e->e_id, e->e_dn, 0 );
472 if ( avl_insert( &cache->c_dntree, (caddr_t) e,
473 (AVL_CMP) entry_dn_cmp, avl_dup_error ) != 0 )
475 /* free cache write lock */
476 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
479 LDAP_LOG( CACHE, DETAIL1,
480 "bdb_cache_add_entry: (%s):%ld already in cache.\n",
481 e->e_dn, e->e_id, 0 );
483 Debug( LDAP_DEBUG_TRACE,
484 "====> bdb_cache_add_entry( %ld ): \"%s\": already in dn cache\n",
485 e->e_id, e->e_dn, 0 );
488 bdb_cache_entry_private_destroy(e);
494 if ( avl_insert( &cache->c_idtree, (caddr_t) e,
495 (AVL_CMP) entry_id_cmp, avl_dup_error ) != 0 )
498 LDAP_LOG( CACHE, DETAIL1,
499 "bdb_cache_add_entry: (%s):%ls already in cache.\n",
500 e->e_dn, e->e_id, 0 );
502 Debug( LDAP_DEBUG_ANY,
503 "====> bdb_cache_add_entry( %ld ): \"%s\": already in id cache\n",
504 e->e_id, e->e_dn, 0 );
507 /* delete from dn tree inserted above */
508 if ( avl_delete( &cache->c_dntree, (caddr_t) e,
509 (AVL_CMP) entry_dn_cmp ) == NULL )
512 LDAP_LOG( CACHE, INFO,
513 "bdb_cache_add_entry: can't delete (%s) from cache.\n",
516 Debug( LDAP_DEBUG_ANY, "====> can't delete from dn cache\n",
521 bdb_cache_entry_private_destroy(e);
523 /* free cache write lock */
524 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
528 rc = bdb_cache_entry_db_lock( env, locker, e, rw, 0, lock );
532 case DB_LOCK_DEADLOCK :
533 case DB_LOCK_NOTGRANTED :
534 /* undo avl changes immediately */
535 if ( avl_delete( &cache->c_idtree, (caddr_t) e,
536 (AVL_CMP) entry_id_cmp ) == NULL ) {
538 LDAP_LOG( CACHE, INFO,
539 "bdb_cache_add_entry: can't delete (%s) from cache.\n",
542 Debug( LDAP_DEBUG_ANY, "====> can't delete from id cache\n", 0, 0, 0 );
545 if ( avl_delete( &cache->c_dntree, (caddr_t) e,
546 (AVL_CMP) entry_dn_cmp ) == NULL ) {
548 LDAP_LOG( CACHE, INFO,
549 "bdb_cache_add_entry: can't delete (%s) from cache.\n",
552 Debug( LDAP_DEBUG_ANY, "====> can't delete from dn cache\n", 0, 0, 0 );
557 bdb_cache_entry_private_destroy(e);
558 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
562 /* put the entry into 'CREATING' state */
563 /* will be marked after when entry is returned */
564 BEI(e)->bei_state = CACHE_ENTRY_CREATING;
565 BEI(e)->bei_refcnt = 1;
568 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
571 if ( ++cache->c_cursize > cache->c_maxsize ) {
573 * find the lru entry not currently in use and delete it.
574 * in case a lot of entries are in use, only look at the
575 * first 10 on the tail of the list.
578 while ( cache->c_lrutail != NULL &&
579 BEI(cache->c_lrutail)->bei_refcnt != 0 &&
582 /* move this in-use entry to the front of the q */
583 ee = cache->c_lrutail;
584 LRU_DELETE( cache, ee );
585 LRU_ADD( cache, ee );
590 * found at least one to delete - try to get back under
591 * the max cache size.
593 while ( cache->c_lrutail != NULL &&
594 BEI(cache->c_lrutail)->bei_refcnt == 0 &&
595 cache->c_cursize > cache->c_maxsize )
597 e = cache->c_lrutail;
599 /* delete from cache and lru q */
600 /* XXX do we need rc ? */
601 rc = bdb_cache_delete_entry_internal( cache, e );
602 bdb_cache_entry_private_destroy( e );
603 bdb_entry_return( e );
608 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
609 /* free cache write lock */
610 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
615 * cache_update_entry - update a LOCKED entry which has been deleted.
616 * returns: 0 entry has been created and locked
617 * 1 entry already existed
618 * -1 something bad happened
621 bdb_cache_update_entry(
629 /* set cache write lock */
630 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
632 assert( e->e_private );
634 if ( avl_insert( &cache->c_dntree, (caddr_t) e,
635 (AVL_CMP) entry_dn_cmp, avl_dup_error ) != 0 )
638 LDAP_LOG( CACHE, DETAIL1,
639 "bdb_cache_update_entry: (%s):%ld already in dn cache\n",
640 e->e_dn, e->e_id, 0 );
642 Debug( LDAP_DEBUG_TRACE,
643 "====> bdb_cache_update_entry( %ld ): \"%s\": already in dn cache\n",
644 e->e_id, e->e_dn, 0 );
647 /* free cache write lock */
648 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
653 if ( avl_insert( &cache->c_idtree, (caddr_t) e,
654 (AVL_CMP) entry_id_cmp, avl_dup_error ) != 0 )
657 LDAP_LOG( CACHE, DETAIL1,
658 "bdb_cache_update_entry: (%s)%ld already in id cache\n",
659 e->e_dn, e->e_id, 0 );
661 Debug( LDAP_DEBUG_ANY,
662 "====> bdb_cache_update_entry( %ld ): \"%s\": already in id cache\n",
663 e->e_id, e->e_dn, 0 );
666 /* delete from dn tree inserted above */
667 if ( avl_delete( &cache->c_dntree, (caddr_t) e,
668 (AVL_CMP) entry_dn_cmp ) == NULL )
671 LDAP_LOG( CACHE, INFO,
672 "bdb_cache_update_entry: can't delete (%s)%ld from dn cache.\n",
673 e->e_dn, e->e_id, 0 );
675 Debug( LDAP_DEBUG_ANY, "====> can't delete from dn cache\n",
680 /* free cache write lock */
681 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
686 /* put the entry into 'CREATING' state */
687 /* will be marked after when entry is returned */
688 BEI(e)->bei_state = CACHE_ENTRY_CREATING;
691 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
694 if ( ++cache->c_cursize > cache->c_maxsize ) {
696 * find the lru entry not currently in use and delete it.
697 * in case a lot of entries are in use, only look at the
698 * first 10 on the tail of the list.
701 while ( cache->c_lrutail != NULL &&
702 BEI(cache->c_lrutail)->bei_refcnt != 0 &&
705 /* move this in-use entry to the front of the q */
706 ee = cache->c_lrutail;
707 LRU_DELETE( cache, ee );
708 LRU_ADD( cache, ee );
713 * found at least one to delete - try to get back under
714 * the max cache size.
716 while ( cache->c_lrutail != NULL &&
717 BEI(cache->c_lrutail)->bei_refcnt == 0 &&
718 cache->c_cursize > cache->c_maxsize )
720 e = cache->c_lrutail;
722 /* delete from cache and lru q */
723 /* XXX do we need rc ? */
724 rc = bdb_cache_delete_entry_internal( cache, e );
725 bdb_cache_entry_private_destroy( e );
726 bdb_entry_return( e );
731 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
732 /* free cache write lock */
733 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
738 bdb_cache_find_entry_ndn2id(
748 /* this function is always called with normalized DN */
752 /* set cache read lock */
753 ldap_pvt_thread_rdwr_rlock( &cache->c_rwlock );
755 if ( (ep = (Entry *) avl_find( cache->c_dntree, (caddr_t) &e,
756 (AVL_CMP) entry_dn_cmp )) != NULL )
762 * ep now points to an unlocked entry
763 * we do not need to lock the entry if we only
764 * check the state, refcnt, LRU, and id.
767 assert( ep->e_private );
771 state = BEI(ep)->bei_state;
774 * entry is deleted or not fully created yet
776 if ( state != CACHE_ENTRY_READY ) {
777 assert(state != CACHE_ENTRY_UNDEFINED);
779 /* free cache read lock */
780 ldap_pvt_thread_rdwr_runlock( &cache->c_rwlock );
783 LDAP_LOG( CACHE, INFO,
784 "bdb_cache_find_entry_dn2id: (%s) %ld not ready: %d\n",
785 ndn->bv_val, id, state );
787 Debug(LDAP_DEBUG_TRACE,
788 "====> bdb_cache_find_entry_dn2id(\"%s\"): %ld (not ready) %d\n",
789 ndn->bv_val, id, state);
793 ldap_pvt_thread_yield();
797 /* free cache read lock */
798 ldap_pvt_thread_rdwr_runlock( &cache->c_rwlock );
801 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
804 LRU_DELETE( cache, ep );
805 LRU_ADD( cache, ep );
808 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
811 LDAP_LOG( CACHE, DETAIL1,
812 "bdb_cache_find_entry_dn2id: (%s): %ld %d tries\n",
813 ndn->bv_val, id, count );
815 Debug(LDAP_DEBUG_TRACE,
816 "====> bdb_cache_find_entry_dn2id(\"%s\"): %ld (%d tries)\n",
817 ndn->bv_val, id, count);
821 /* free cache read lock */
822 ldap_pvt_thread_rdwr_runlock( &cache->c_rwlock );
831 * cache_find_entry_id - find an entry in the cache, given id
835 bdb_cache_find_entry_id(
852 /* set cache read lock */
853 ldap_pvt_thread_rdwr_rlock( &cache->c_rwlock );
855 if ( (ep = (Entry *) avl_find( cache->c_idtree, (caddr_t) &e,
856 (AVL_CMP) entry_id_cmp )) != NULL )
863 assert( ep->e_private );
866 state = BEI(ep)->bei_state;
869 * entry is deleted or not fully created yet
871 if ( state != CACHE_ENTRY_READY ) {
873 assert(state != CACHE_ENTRY_UNDEFINED);
875 /* free cache read lock */
876 ldap_pvt_thread_rdwr_runlock( &cache->c_rwlock );
879 LDAP_LOG( CACHE, INFO,
880 "bdb_cache_find_entry_id: (%ld)->%ld not ready (%d).\n",
884 Debug(LDAP_DEBUG_TRACE,
885 "====> bdb_cache_find_entry_id( %ld ): %ld (not ready) %d\n",
889 ldap_pvt_thread_yield();
893 /* acquire reader lock */
894 rc = bdb_cache_entry_db_lock ( env, locker, ep, rw, 0, lock );
897 if ( bdb_cache_entry_rdwr_trylock(ep, rw) == LDAP_PVT_THREAD_EBUSY ) {
900 if ( rc ) { /* will be changed to retry beyond threshold */
901 /* could not acquire entry lock...
902 * owner cannot free as we have the cache locked.
903 * so, unlock the cache, yield, and try again.
906 /* free cache read lock */
907 ldap_pvt_thread_rdwr_runlock( &cache->c_rwlock );
910 LDAP_LOG( CACHE, INFO,
911 "bdb_cache_find_entry_id: %ld -> %ld (busy) %d.\n",
914 Debug(LDAP_DEBUG_TRACE,
915 "====> bdb_cache_find_entry_id( %ld ): %ld (busy) %d\n",
917 Debug(LDAP_DEBUG_TRACE,
922 ldap_pvt_thread_yield();
926 /* free cache read lock */
927 ldap_pvt_thread_rdwr_runlock( &cache->c_rwlock );
929 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
931 LRU_DELETE( cache, ep );
932 LRU_ADD( cache, ep );
934 BEI(ep)->bei_refcnt++;
937 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
940 LDAP_LOG( CACHE, DETAIL1,
941 "bdb_cache_find_entry_id: %ld -> %s found %d tries.\n",
942 ep_id, ep->e_dn, count );
944 Debug(LDAP_DEBUG_TRACE,
945 "====> bdb_cache_find_entry_id( %ld ) \"%s\" (found) (%d tries)\n",
946 ep_id, ep->e_dn, count);
953 /* free cache read lock */
954 ldap_pvt_thread_rdwr_runlock( &cache->c_rwlock );
960 * cache_delete_entry - delete the entry e from the cache. the caller
961 * should have obtained e (increasing its ref count) via a call to one
962 * of the cache_find_* routines. the caller should *not* call the
963 * cache_return_entry() routine prior to calling cache_delete_entry().
964 * it performs this function.
966 * returns: 0 e was deleted ok
967 * 1 e was not in the cache
968 * -1 something bad happened
971 bdb_cache_delete_entry(
978 /* set cache write lock */
979 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
981 assert( e->e_private );
984 LDAP_LOG( CACHE, ENTRY,
985 "bdb_cache_delete_entry: delete %ld.\n", e->e_id, 0, 0 );
987 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete_entry( %ld )\n",
992 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
993 rc = bdb_cache_delete_entry_internal( cache, e );
995 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
997 /* free cache write lock */
998 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1003 bdb_cache_delete_entry_internal(
1008 int rc = 0; /* return code */
1011 if ( avl_delete( &cache->c_dntree, (caddr_t) e, (AVL_CMP) entry_dn_cmp )
1018 if ( avl_delete( &cache->c_idtree, (caddr_t) e, (AVL_CMP) entry_id_cmp )
1029 LRU_DELETE( cache, e );
1033 * flag entry to be freed later by a call to cache_return_entry()
1035 BEI(e)->bei_state = CACHE_ENTRY_DELETED;
1041 bdb_cache_release_all( Cache *cache )
1046 /* set cache write lock */
1047 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1049 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1052 LDAP_LOG( CACHE, ENTRY, "bdb_cache_release_all: enter\n", 0, 0, 0 );
1054 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1057 while ( (e = cache->c_lrutail) != NULL && BEI(e)->bei_refcnt == 0 ) {
1058 #ifdef LDAP_RDWR_DEBUG
1059 assert(!ldap_pvt_thread_rdwr_active(&BEI(e)->bei_rdwr));
1062 /* delete from cache and lru q */
1063 /* XXX do we need rc ? */
1064 rc = bdb_cache_delete_entry_internal( cache, e );
1065 bdb_cache_entry_private_destroy( e );
1066 bdb_entry_return( e );
1069 if ( cache->c_cursize ) {
1071 LDAP_LOG( CACHE, INFO,
1072 "bdb_cache_release_all: Entry cache could not be emptied.\n", 0, 0, 0 );
1074 Debug( LDAP_DEBUG_TRACE, "Entry-cache could not be emptied\n", 0, 0, 0 );
1079 /* free lru mutex */
1080 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1081 /* free cache write lock */
1082 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1087 bdb_lru_print( Cache *cache )
1091 fprintf( stderr, "LRU queue (head to tail):\n" );
1092 for ( e = cache->c_lruhead; e != NULL; e = BEI(e)->bei_lrunext ) {
1093 fprintf( stderr, "\tdn \"%20s\" id %ld refcnt %d\n",
1094 e->e_dn, e->e_id, BEI(e)->bei_refcnt );
1096 fprintf( stderr, "LRU queue (tail to head):\n" );
1097 for ( e = cache->c_lrutail; e != NULL; e = BEI(e)->bei_lruprev ) {
1098 fprintf( stderr, "\tdn \"%20s\" id %ld refcnt %d\n",
1099 e->e_dn, e->e_id, BEI(e)->bei_refcnt );