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-2004 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>
29 static int bdb_cache_delete_internal(Cache *cache, EntryInfo *e);
31 static void bdb_lru_print(Cache *cache);
35 bdb_cache_entryinfo_new( Cache *cache )
39 if ( cache->c_eifree ) {
40 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
41 if ( cache->c_eifree ) {
43 cache->c_eifree = ei->bei_lrunext;
45 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
48 ei->bei_lrunext = NULL;
51 ei = ch_calloc(1, sizeof(struct bdb_entry_info));
52 ldap_pvt_thread_mutex_init( &ei->bei_kids_mutex );
58 /* Atomically release and reacquire a lock */
60 bdb_cache_entry_db_relock(
75 if ( !lock ) return 0;
78 lockobj.size = sizeof(ei->bei_parent) + sizeof(ei->bei_id);
80 list[0].op = DB_LOCK_PUT;
82 list[1].op = DB_LOCK_GET;
84 list[1].mode = rw ? DB_LOCK_WRITE : DB_LOCK_READ;
85 list[1].obj = &lockobj;
86 rc = env->lock_vec(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
91 LDAP_LOG( CACHE, DETAIL1,
92 "bdb_cache_entry_db_relock: entry %ld, rw %d, rc %d\n",
95 Debug( LDAP_DEBUG_TRACE,
96 "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;
125 lockobj.size = sizeof(ei->bei_parent) + sizeof(ei->bei_id);
127 rc = LOCK_GET(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
128 &lockobj, db_rw, lock);
131 LDAP_LOG( CACHE, DETAIL1,
132 "bdb_cache_entry_db_lock: entry %ld, rw %d, rc %d\n",
133 ei->bei_id, rw, rc );
135 Debug( LDAP_DEBUG_TRACE,
136 "bdb_cache_entry_db_lock: entry %ld, rw %d, rc %d\n",
137 ei->bei_id, rw, rc );
141 #endif /* NO_THREADS */
145 bdb_cache_entry_db_unlock ( DB_ENV *env, DB_LOCK *lock )
152 if ( !lock ) return 0;
154 rc = LOCK_PUT ( env, lock );
160 bdb_cache_entryinfo_destroy( EntryInfo *e )
162 ldap_pvt_thread_mutex_destroy( &e->bei_kids_mutex );
163 free( e->bei_nrdn.bv_val );
165 free( e->bei_rdn.bv_val );
171 #define LRU_DELETE( cache, ei ) do { \
172 if ( (ei)->bei_lruprev != NULL ) { \
173 (ei)->bei_lruprev->bei_lrunext = (ei)->bei_lrunext; \
175 (cache)->c_lruhead = (ei)->bei_lrunext; \
177 if ( (ei)->bei_lrunext != NULL ) { \
178 (ei)->bei_lrunext->bei_lruprev = (ei)->bei_lruprev; \
180 (cache)->c_lrutail = (ei)->bei_lruprev; \
184 #define LRU_ADD( cache, ei ) do { \
185 (ei)->bei_lrunext = (cache)->c_lruhead; \
186 if ( (ei)->bei_lrunext != NULL ) { \
187 (ei)->bei_lrunext->bei_lruprev = (ei); \
189 (cache)->c_lruhead = (ei); \
190 (ei)->bei_lruprev = NULL; \
191 if ( (cache)->c_lrutail == NULL ) { \
192 (cache)->c_lrutail = (ei); \
196 /* Do a length-ordered sort on normalized RDNs */
198 bdb_rdn_cmp( const void *v_e1, const void *v_e2 )
200 const EntryInfo *e1 = v_e1, *e2 = v_e2;
201 int rc = e1->bei_nrdn.bv_len - e2->bei_nrdn.bv_len;
203 rc = strncmp( e1->bei_nrdn.bv_val, e2->bei_nrdn.bv_val,
204 e1->bei_nrdn.bv_len );
210 bdb_id_cmp( const void *v_e1, const void *v_e2 )
212 const EntryInfo *e1 = v_e1, *e2 = v_e2;
213 return e1->bei_id - e2->bei_id;
216 /* Create an entryinfo in the cache. Caller must release the locks later.
219 bdb_entryinfo_add_internal(
220 struct bdb_info *bdb,
224 EntryInfo *ei2 = NULL;
228 ei2 = bdb_cache_entryinfo_new( &bdb->bi_cache );
230 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
231 bdb_cache_entryinfo_lock( ei->bei_parent );
233 ei2->bei_id = ei->bei_id;
234 ei2->bei_parent = ei->bei_parent;
236 ei2->bei_rdn = ei->bei_rdn;
239 /* Add to cache ID tree */
240 if (avl_insert( &bdb->bi_cache.c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
242 eix = avl_find( bdb->bi_cache.c_idtree, ei2, bdb_id_cmp );
243 bdb_cache_entryinfo_destroy( ei2 );
246 /* It got freed above because its value was
249 ei->bei_rdn.bv_val = NULL;
252 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
253 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
256 ei->bei_parent->bei_ckids++;
264 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
265 * the info for its closest ancestor. *res should be NULL to process a
266 * complete DN starting from the tree root. Otherwise *res must be the
267 * immediate parent of the requested DN, and only the RDN will be searched.
268 * The EntryInfo is locked upon return and must be unlocked by the caller.
277 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
278 EntryInfo ei, *eip, *ei2;
282 /* this function is always called with normalized DN */
284 /* we're doing a onelevel search for an RDN */
285 ei.bei_nrdn.bv_val = ndn->bv_val;
286 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
289 /* we're searching a full DN from the root */
290 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
291 ei.bei_nrdn.bv_val = ptr;
292 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
293 eip = &bdb->bi_cache.c_dntree;
296 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
298 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
300 int len = ei.bei_nrdn.bv_len;
302 ei.bei_nrdn.bv_len = ndn->bv_len -
303 (ei.bei_nrdn.bv_val - ndn->bv_val);
304 bdb_cache_entryinfo_unlock( eip );
306 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
308 bdb_cache_entryinfo_lock( eip );
313 /* DN exists but needs to be added to cache */
314 ei.bei_nrdn.bv_len = len;
315 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2 );
316 /* add_internal left eip and c_rwlock locked */
317 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
322 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
323 /* In the midst of deleting? Give it a chance to
326 bdb_cache_entryinfo_unlock( eip );
327 ldap_pvt_thread_yield();
328 bdb_cache_entryinfo_lock( eip );
332 bdb_cache_entryinfo_unlock( eip );
333 bdb_cache_entryinfo_lock( ei2 );
337 /* Advance to next lower RDN */
338 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
339 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
340 if ( ptr >= ndn->bv_val ) {
341 if (DN_SEPARATOR(*ptr)) ptr++;
342 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
343 ei.bei_nrdn.bv_val = ptr;
345 if ( ptr < ndn->bv_val ) {
355 /* Walk up the tree from a child node, looking for an ID that's already
356 * been linked into the cache.
359 hdb_cache_find_parent(
365 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
366 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
367 char ndn[SLAP_LDAPDN_MAXLEN];
376 rc = hdb_dn2id_parent( op, txn, &ei, &eip.bei_id );
379 /* Save the previous node, if any */
382 /* Create a new node for the current ID */
383 ein = bdb_cache_entryinfo_new( &bdb->bi_cache );
384 ein->bei_id = ei.bei_id;
385 ein->bei_kids = ei.bei_kids;
386 ein->bei_nrdn = ei.bei_nrdn;
387 ein->bei_rdn = ei.bei_rdn;
389 /* This node is not fully connected yet */
390 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
392 /* Insert this node into the ID tree */
393 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
394 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
395 bdb_id_cmp, avl_dup_error ) ) {
397 /* Someone else created this node just before us.
398 * Free our new copy and use the existing one.
400 bdb_cache_entryinfo_destroy( ein );
401 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
402 (caddr_t) &ei, bdb_id_cmp );
404 /* Link in any kids we've already processed */
406 bdb_cache_entryinfo_lock( ein );
407 avl_insert( &ein->bei_kids, (caddr_t)ei2,
408 bdb_rdn_cmp, avl_dup_error );
409 bdb_cache_entryinfo_unlock( ein );
417 /* If this is the first time, save this node
418 * to be returned later.
420 if ( eir == NULL ) eir = ein;
422 /* If there was a previous node, link it to this one */
423 if ( ei2 ) ei2->bei_parent = ein;
425 /* Look for this node's parent */
427 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
428 (caddr_t) &eip, bdb_id_cmp );
430 ei2 = &bdb->bi_cache.c_dntree;
432 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
434 /* Got the parent, link in and we're done. */
436 bdb_cache_entryinfo_lock( ei2 );
437 ein->bei_parent = ei2;
438 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
440 bdb_cache_entryinfo_unlock( ei2 );
441 bdb_cache_entryinfo_lock( eir );
443 /* Reset all the state info */
444 for (ein = eir; ein != ei2; ein=ein->bei_parent)
445 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
450 ei.bei_id = eip.bei_id;
451 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
457 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
461 struct bdb_info *bdb,
468 /* See if we already have this one */
469 bdb_cache_entryinfo_lock( ei->bei_parent );
470 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
471 bdb_cache_entryinfo_unlock( ei->bei_parent );
474 /* Not found, add it */
477 /* bei_rdn was not malloc'd before, do it now */
478 ber_dupbv( &bv, &ei->bei_rdn );
481 rc = bdb_entryinfo_add_internal( bdb, ei, res );
482 bdb_cache_entryinfo_unlock( ei->bei_parent );
483 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
485 /* Found, return it */
493 /* caller must have lru_mutex locked. mutex
494 * will be unlocked on return.
498 struct bdb_info *bdb,
502 DB_LOCK lock, *lockp;
510 /* See if we're above the cache size limit */
511 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
512 EntryInfo *elru, *elprev;
515 /* Look for an unused entry to remove */
516 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
517 elprev = elru->bei_lruprev;
519 /* Too many probes, not enough idle, give up */
522 /* If we can successfully writelock it, then
523 * the object is idle.
525 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, elru, 1, 1,
527 /* If there's no entry, or this node is in
528 * the process of linking into the cache,
531 if ( !elru->bei_e || (elru->bei_state & CACHE_ENTRY_NOT_LINKED) ) {
532 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
535 LRU_DELETE( &bdb->bi_cache, elru );
536 elru->bei_e->e_private = NULL;
537 bdb_entry_return( elru->bei_e );
539 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
540 --bdb->bi_cache.c_cursize;
541 if (bdb->bi_cache.c_cursize < bdb->bi_cache.c_maxsize)
546 LRU_ADD( &bdb->bi_cache, ei );
547 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
552 struct bdb_info *bdb,
559 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
560 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
561 (caddr_t) &ei, bdb_id_cmp );
562 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
567 * cache_find_id - find an entry in the cache, given id.
568 * The entry is locked for Read upon return. Call with islocked TRUE if
569 * the supplied *eip was already locked.
582 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
590 /* If we weren't given any info, see if we have it already cached */
592 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
593 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
594 (caddr_t) &ei, bdb_id_cmp );
596 /* If the lock attempt fails, the info is in use */
597 if ( ldap_pvt_thread_mutex_trylock(
598 &(*eip)->bei_kids_mutex )) {
599 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
600 /* If this node is being deleted, treat
601 * as if the delete has already finished
603 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
606 /* otherwise, wait for the info to free up */
607 ldap_pvt_thread_yield();
610 /* If this info isn't hooked up to its parent yet,
611 * unlock and wait for it to be fully initialized
613 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
614 bdb_cache_entryinfo_unlock( *eip );
615 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
616 ldap_pvt_thread_yield();
621 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
624 /* See if the ID exists in the database; add it to the cache if so */
627 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
629 rc = bdb_cache_find_ndn( op, tid,
631 if ( *eip ) islocked = 1;
633 bdb_entry_return( ep );
638 rc = hdb_cache_find_parent(op, tid, id, eip );
639 if ( rc == 0 && *eip ) islocked = 1;
643 /* Ok, we found the info, do we have the entry? */
644 if ( *eip && rc == 0 ) {
645 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
648 bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, *eip, 0, 0, lock );
649 if ( !(*eip)->bei_e ) {
651 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
654 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
656 /* Make sure no other modifier beat us to it */
657 if ( (*eip)->bei_e ) {
658 bdb_entry_return( ep );
661 ep->e_private = *eip;
667 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
671 /* If we had the entry already, this item
672 * is on the LRU list.
676 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
678 bdb_cache_entry_db_relock( bdb->bi_dbenv,
679 locker, *eip, 1, 0, lock );
680 /* check again in case other modifier did it already */
681 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
682 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
683 bdb_cache_entry_db_relock( bdb->bi_dbenv,
684 locker, *eip, 0, 0, lock );
692 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
693 /* if entry is old, remove from old spot on LRU list */
695 LRU_DELETE( &bdb->bi_cache, *eip );
697 /* if entry is new, bump cache size */
698 bdb->bi_cache.c_cursize++;
700 /* lru_mutex is unlocked for us */
701 bdb_cache_lru_add( bdb, locker, *eip );
705 bdb_cache_entryinfo_unlock( *eip );
718 if ( BEI(e)->bei_kids ) {
721 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
724 rc = bdb_dn2id_children( op, txn, e );
725 if ( rc == DB_NOTFOUND ) {
726 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
731 /* Update the cache after a successful database Add. */
734 struct bdb_info *bdb,
741 struct berval rdn = e->e_name;
748 if ( nrdn->bv_len != e->e_nname.bv_len ) {
749 char *ptr = strchr( rdn.bv_val, ',' );
750 rdn.bv_len = ptr - rdn.bv_val;
752 ber_dupbv( &ei.bei_rdn, &rdn );
753 if ( eip->bei_dkids ) eip->bei_dkids++;
756 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
757 /* bdb_csn_commit can cause this when adding the database root entry */
758 if ( new->bei_e ) bdb_entry_return( new->bei_e );
761 new->bei_state = CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
762 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
763 if (eip->bei_parent) {
764 eip->bei_parent->bei_state &= ~CACHE_ENTRY_NO_GRANDKIDS;
768 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
769 ++bdb->bi_cache.c_cursize;
770 /* lru_mutex is unlocked for us */
771 bdb_cache_lru_add( bdb, locker, new );
773 bdb_cache_entryinfo_unlock( eip );
774 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
786 EntryInfo *ei = BEI(e);
788 /* Get write lock on data */
789 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
791 /* If we've done repeated mods on a cached entry, then e_attrs
792 * is no longer contiguous with the entry, and must be freed.
794 if ( (void *)e->e_attrs != (void *)(e+1) ) {
795 attrs_free( e->e_attrs );
797 e->e_attrs = newAttrs;
803 * Change the rdn in the entryinfo. Also move to a new parent if needed.
815 EntryInfo *ei = BEI(e), *pei;
819 /* Get write lock on data */
820 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
822 /* If we've done repeated mods on a cached entry, then e_attrs
823 * is no longer contiguous with the entry, and must be freed.
825 if ( (void *)e->e_attrs != (void *)(e+1) ) {
826 attrs_free( e->e_attrs );
828 e->e_attrs = new->e_attrs;
829 if( e->e_nname.bv_val < e->e_bv.bv_val ||
830 e->e_nname.bv_val > e->e_bv.bv_val + e->e_bv.bv_len )
832 ch_free(e->e_name.bv_val);
833 ch_free(e->e_nname.bv_val);
835 e->e_name = new->e_name;
836 e->e_nname = new->e_nname;
838 /* Lock the parent's kids AVL tree */
839 pei = ei->bei_parent;
840 bdb_cache_entryinfo_lock( pei );
841 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
842 free( ei->bei_nrdn.bv_val );
843 ber_dupbv( &ei->bei_nrdn, nrdn );
845 free( ei->bei_rdn.bv_val );
848 if ( nrdn->bv_len != e->e_nname.bv_len ) {
849 char *ptr = strchr(rdn.bv_val, ',');
850 rdn.bv_len = ptr - rdn.bv_val;
852 ber_dupbv( &ei->bei_rdn, &rdn );
856 ein = ei->bei_parent;
858 ei->bei_parent = ein;
859 bdb_cache_entryinfo_unlock( pei );
860 bdb_cache_entryinfo_lock( ein );
864 int max = ei->bei_modrdns;
865 /* Record the generation number of this change */
866 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
867 if ( pei->bei_modrdns > max ) max = pei->bei_modrdns;
869 ei->bei_modrdns = max + 1;
872 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
873 bdb_cache_entryinfo_unlock( ein );
877 * cache_delete - delete the entry e from the cache.
879 * returns: 0 e was deleted ok
880 * 1 e was not in the cache
881 * -1 something bad happened
891 EntryInfo *ei = BEI(e);
894 assert( e->e_private );
896 /* Set this early, warn off any queriers */
897 ei->bei_state |= CACHE_ENTRY_DELETED;
899 /* Lock the entry's info */
900 bdb_cache_entryinfo_lock( ei );
902 /* Get write lock on the data */
903 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
905 /* set cache write lock */
906 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
908 /* Lock the parent's kids tree */
909 bdb_cache_entryinfo_lock( ei->bei_parent );
912 LDAP_LOG( CACHE, ENTRY,
913 "bdb_cache_delete: delete %ld.\n", e->e_id, 0, 0 );
915 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
920 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
921 rc = bdb_cache_delete_internal( cache, e->e_private );
923 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
925 /* free cache write lock */
926 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
927 bdb_cache_entryinfo_unlock( ei->bei_parent );
929 /* Leave entry info locked */
935 bdb_cache_delete_cleanup(
939 EntryInfo *ei = BEI(e);
943 bdb_entry_return( e );
945 free( ei->bei_nrdn.bv_val );
946 ei->bei_nrdn.bv_val = NULL;
948 free( ei->bei_rdn.bv_val );
949 ei->bei_rdn.bv_val = NULL;
954 ei->bei_parent = NULL;
956 ei->bei_lruprev = NULL;
958 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
959 ei->bei_lrunext = cache->c_eifree;
960 cache->c_eifree = ei;
961 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
962 bdb_cache_entryinfo_unlock( ei );
966 bdb_cache_delete_internal(
970 int rc = 0; /* return code */
973 e->bei_parent->bei_ckids--;
974 if ( e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
977 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp )
984 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL ) {
993 LRU_DELETE( cache, e );
997 * flag entry to be freed later by a call to cache_return_entry()
999 e->bei_state |= CACHE_ENTRY_DELETED;
1005 bdb_entryinfo_release( void *data )
1007 EntryInfo *ei = (EntryInfo *)data;
1008 if ( ei->bei_kids ) {
1009 avl_free( ei->bei_kids, NULL );
1012 ei->bei_e->e_private = NULL;
1013 bdb_entry_return( ei->bei_e );
1015 bdb_cache_entryinfo_destroy( ei );
1019 bdb_cache_release_all( Cache *cache )
1021 /* set cache write lock */
1022 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1024 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1027 LDAP_LOG( CACHE, ENTRY, "bdb_cache_release_all: enter\n", 0, 0, 0 );
1029 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1032 avl_free( cache->c_dntree.bei_kids, NULL );
1033 avl_free( cache->c_idtree, bdb_entryinfo_release );
1034 cache->c_lruhead = NULL;
1035 cache->c_lrutail = NULL;
1037 /* free lru mutex */
1038 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1039 /* free cache write lock */
1040 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1045 bdb_lru_print( Cache *cache )
1049 fprintf( stderr, "LRU queue (head to tail):\n" );
1050 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
1051 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1052 e->bei_nrdn.bv_val, e->bei_id );
1054 fprintf( stderr, "LRU queue (tail to head):\n" );
1055 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
1056 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1057 e->bei_nrdn.bv_val, e->bei_id );
1062 #ifdef BDB_REUSE_LOCKERS
1064 bdb_locker_id_free( void *key, void *data )
1067 int lockid = (int) data;
1070 rc = XLOCK_ID_FREE( env, lockid );
1071 if ( rc == EINVAL ) {
1074 LDAP_LOG( BACK_BDB, ERR,
1075 "bdb_locker_id_free: %d err %s(%d)\n",
1076 lockid, db_strerror(rc), rc );
1078 Debug( LDAP_DEBUG_ANY,
1079 "bdb_locker_id_free: %d err %s(%d)\n",
1080 lockid, db_strerror(rc), rc );
1082 memset( &lr, 0, sizeof(lr) );
1084 /* release all locks held by this locker. */
1085 lr.op = DB_LOCK_PUT_ALL;
1086 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1087 XLOCK_ID_FREE( env, lockid );
1092 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
1098 if ( !env || !locker ) return -1;
1100 /* If no op was provided, try to find the ctx anyway... */
1102 ctx = op->o_threadctx;
1104 ctx = ldap_pvt_thread_pool_context();
1107 /* Shouldn't happen unless we're single-threaded */
1113 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1114 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1115 rc = XLOCK_ID( env, &lockid );
1116 if (rc) ldap_pvt_thread_yield();
1121 data = (void *)lockid;
1122 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1123 data, bdb_locker_id_free ) ) ) {
1124 XLOCK_ID_FREE( env, lockid );
1126 LDAP_LOG( BACK_BDB, ERR, "bdb_locker_id: err %s(%d)\n",
1127 db_strerror(rc), rc, 0 );
1129 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1130 db_strerror(rc), rc, 0 );
1144 bdb_cache_delete_entry(
1145 struct bdb_info *bdb,
1150 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
1151 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, ei, 1, 1, lock ) == 0 )
1153 if ( ei->bei_e && !(ei->bei_state & CACHE_ENTRY_NOT_LINKED )) {
1154 LRU_DELETE( &bdb->bi_cache, ei );
1155 ei->bei_e->e_private = NULL;
1156 bdb_entry_return( ei->bei_e );
1158 --bdb->bi_cache.c_cursize;
1160 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
1162 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );