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);
35 static void bdb_lru_print(Cache *cache);
38 static int bdb_txn_get( Operation *op, DB_ENV *env, DB_TXN **txn, int reset );
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;
234 /* Add to cache ID tree */
235 if (avl_insert( &bdb->bi_cache.c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
237 eix = avl_find( bdb->bi_cache.c_idtree, ei2, bdb_id_cmp );
238 bdb_cache_entryinfo_destroy( ei2 );
241 /* It got freed above because its value was
244 ei->bei_rdn.bv_val = NULL;
247 bdb->bi_cache.c_eiused++;
248 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
249 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
252 ei->bei_parent->bei_ckids++;
260 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
261 * the info for its closest ancestor. *res should be NULL to process a
262 * complete DN starting from the tree root. Otherwise *res must be the
263 * immediate parent of the requested DN, and only the RDN will be searched.
264 * The EntryInfo is locked upon return and must be unlocked by the caller.
273 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
274 EntryInfo ei, *eip, *ei2;
278 /* this function is always called with normalized DN */
280 /* we're doing a onelevel search for an RDN */
281 ei.bei_nrdn.bv_val = ndn->bv_val;
282 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
285 /* we're searching a full DN from the root */
286 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
287 ei.bei_nrdn.bv_val = ptr;
288 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
289 /* Skip to next rdn if suffix is empty */
290 if ( ei.bei_nrdn.bv_len == 0 ) {
291 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
292 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
293 if ( ptr >= ndn->bv_val ) {
294 if (DN_SEPARATOR(*ptr)) ptr++;
295 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr;
296 ei.bei_nrdn.bv_val = ptr;
299 eip = &bdb->bi_cache.c_dntree;
302 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
304 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
306 int len = ei.bei_nrdn.bv_len;
308 ei.bei_nrdn.bv_len = ndn->bv_len -
309 (ei.bei_nrdn.bv_val - ndn->bv_val);
310 bdb_cache_entryinfo_unlock( eip );
312 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
314 bdb_cache_entryinfo_lock( eip );
319 /* DN exists but needs to be added to cache */
320 ei.bei_nrdn.bv_len = len;
321 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2 );
322 /* add_internal left eip and c_rwlock locked */
323 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
328 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
329 /* In the midst of deleting? Give it a chance to
332 bdb_cache_entryinfo_unlock( eip );
333 ldap_pvt_thread_yield();
334 bdb_cache_entryinfo_lock( eip );
338 bdb_cache_entryinfo_unlock( eip );
339 bdb_cache_entryinfo_lock( ei2 );
343 /* Advance to next lower RDN */
344 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
345 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
346 if ( ptr >= ndn->bv_val ) {
347 if (DN_SEPARATOR(*ptr)) ptr++;
348 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
349 ei.bei_nrdn.bv_val = ptr;
351 if ( ptr < ndn->bv_val ) {
361 /* Walk up the tree from a child node, looking for an ID that's already
362 * been linked into the cache.
365 hdb_cache_find_parent(
371 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
372 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
373 char ndn[SLAP_LDAPDN_MAXLEN];
383 rc = hdb_dn2id_parent( op, txn, &ei, &eip.bei_id );
386 /* Save the previous node, if any */
389 /* Create a new node for the current ID */
390 ein = bdb_cache_entryinfo_new( &bdb->bi_cache );
391 ein->bei_id = ei.bei_id;
392 ein->bei_kids = ei.bei_kids;
393 ein->bei_nrdn = ei.bei_nrdn;
394 ein->bei_rdn = ei.bei_rdn;
395 ein->bei_ckids = ei.bei_ckids;
398 /* This node is not fully connected yet */
399 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
401 /* Insert this node into the ID tree */
402 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
403 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
404 bdb_id_cmp, avl_dup_error ) ) {
406 /* Someone else created this node just before us.
407 * Free our new copy and use the existing one.
409 bdb_cache_entryinfo_destroy( ein );
410 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
411 (caddr_t) &ei, bdb_id_cmp );
413 /* Link in any kids we've already processed */
415 bdb_cache_entryinfo_lock( ein );
416 avl_insert( &ein->bei_kids, (caddr_t)ei2,
417 bdb_rdn_cmp, avl_dup_error );
419 bdb_cache_entryinfo_unlock( ein );
427 /* If this is the first time, save this node
428 * to be returned later.
430 if ( eir == NULL ) eir = ein;
432 /* If there was a previous node, link it to this one */
433 if ( ei2 ) ei2->bei_parent = ein;
435 /* Look for this node's parent */
437 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
438 (caddr_t) &eip, bdb_id_cmp );
440 ei2 = &bdb->bi_cache.c_dntree;
442 bdb->bi_cache.c_eiused++;
443 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
445 /* Got the parent, link in and we're done. */
447 bdb_cache_entryinfo_lock( ei2 );
448 ein->bei_parent = ei2;
449 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
452 bdb_cache_entryinfo_unlock( ei2 );
453 bdb_cache_entryinfo_lock( eir );
455 /* Reset all the state info */
456 for (ein = eir; ein != ei2; ein=ein->bei_parent)
457 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
462 ei.bei_id = eip.bei_id;
464 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
470 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
474 struct bdb_info *bdb,
481 /* See if we already have this one */
482 bdb_cache_entryinfo_lock( ei->bei_parent );
483 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
484 bdb_cache_entryinfo_unlock( ei->bei_parent );
487 /* Not found, add it */
490 /* bei_rdn was not malloc'd before, do it now */
491 ber_dupbv( &bv, &ei->bei_rdn );
494 rc = bdb_entryinfo_add_internal( bdb, ei, res );
495 bdb_cache_entryinfo_unlock( ei->bei_parent );
496 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
498 /* Found, return it */
506 /* caller must have lru_mutex locked. mutex
507 * will be unlocked on return.
511 struct bdb_info *bdb,
515 DB_LOCK lock, *lockp;
523 /* See if we're above the cache size limit */
524 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
525 EntryInfo *elru, *elprev;
528 /* Look for an unused entry to remove */
529 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
530 elprev = elru->bei_lruprev;
532 /* Too many probes, not enough idle, give up */
535 /* If we can successfully writelock it, then
536 * the object is idle.
538 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, bdb->bi_cache.c_locker, elru, 1, 1,
542 /* If there's no entry, or this node is in
543 * the process of linking into the cache,
544 * or this node is being deleted, skip it.
546 if ( !elru->bei_e || (elru->bei_state &
547 ( CACHE_ENTRY_NOT_LINKED | CACHE_ENTRY_DELETED ))) {
548 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
551 LRU_DELETE( &bdb->bi_cache, elru );
552 elru->bei_e->e_private = NULL;
553 bdb_entry_return( elru->bei_e );
555 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
556 --bdb->bi_cache.c_cursize;
557 if (bdb->bi_cache.c_cursize <= bdb->bi_cache.c_maxsize)
559 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
560 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
565 LRU_ADD( &bdb->bi_cache, ei );
566 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
571 struct bdb_info *bdb,
574 EntryInfo ei = { 0 },
579 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
580 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
581 (caddr_t) &ei, bdb_id_cmp );
582 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
587 * cache_find_id - find an entry in the cache, given id.
588 * The entry is locked for Read upon return. Call with islocked TRUE if
589 * the supplied *eip was already locked.
602 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
604 int rc = 0, load = 0;
605 EntryInfo ei = { 0 };
609 /* If we weren't given any info, see if we have it already cached */
611 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
612 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
613 (caddr_t) &ei, bdb_id_cmp );
615 /* If the lock attempt fails, the info is in use */
616 if ( ldap_pvt_thread_mutex_trylock(
617 &(*eip)->bei_kids_mutex )) {
618 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
619 /* If this node is being deleted, treat
620 * as if the delete has already finished
622 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
625 /* otherwise, wait for the info to free up */
626 ldap_pvt_thread_yield();
629 /* If this info isn't hooked up to its parent yet,
630 * unlock and wait for it to be fully initialized
632 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
633 bdb_cache_entryinfo_unlock( *eip );
634 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
635 ldap_pvt_thread_yield();
640 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
643 /* See if the ID exists in the database; add it to the cache if so */
646 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
648 rc = bdb_cache_find_ndn( op, tid,
650 if ( *eip ) islocked = 1;
652 bdb_entry_return( ep );
657 rc = hdb_cache_find_parent(op, tid, id, eip );
658 if ( rc == 0 && *eip ) islocked = 1;
662 /* Ok, we found the info, do we have the entry? */
663 if ( *eip && rc == 0 ) {
664 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
667 /* Make sure only one thread tries to load the entry */
668 load1: if ( !(*eip)->bei_e && !((*eip)->bei_state & CACHE_ENTRY_LOADING)) {
670 (*eip)->bei_state |= CACHE_ENTRY_LOADING;
673 bdb_cache_entryinfo_unlock( *eip );
676 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, *eip, 0, 0, lock );
677 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
679 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
680 } else if ( rc == 0 ) {
683 u_int32_t locker2 = locker;
685 /* We don't wrap entire read operations in txn's, but
686 * we need our cache entry lock and any DB page locks
687 * to be associated, in order for deadlock detection
688 * to work properly. So if we need to read from the DB,
689 * we use a long-lived per-thread txn for this step.
692 rc = bdb_txn_get( op, bdb->bi_dbenv, <id, 0 );
694 locker2 = TXN_ID( ltid );
698 /* Give up original read lock, obtain write lock with
699 * (possibly) new locker ID.
702 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker2,
705 if ( rc == 0 && !ep) {
706 rc = bdb_id2entry( op->o_bd, ltid, id, &ep );
709 ep->e_private = *eip;
716 (*eip)->bei_state ^= CACHE_ENTRY_LOADING;
718 /* If we succeeded, downgrade back to a readlock. */
719 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
722 /* Otherwise, release the lock. */
723 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
725 if ( locker2 != locker ) {
726 /* If we're using the per-thread txn, release all
727 * of its page locks now.
730 list.op = DB_LOCK_PUT_ALL;
732 bdb->bi_dbenv->lock_vec( bdb->bi_dbenv, locker2,
734 /* If this txn was deadlocked, we must abort it
735 * and invalidate this per-thread txn.
737 if ( rc == DB_LOCK_DEADLOCK ) {
738 bdb_txn_get( op, bdb->bi_dbenv, <id, 1 );
741 } else if ( !(*eip)->bei_e ) {
742 /* Some other thread is trying to load the entry,
743 * give it a chance to finish.
745 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
746 ldap_pvt_thread_yield();
747 bdb_cache_entryinfo_lock( *eip );
752 /* Check for subtree renames
754 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
756 bdb_cache_entry_db_relock( bdb->bi_dbenv,
757 locker, *eip, 1, 0, lock );
758 /* check again in case other modifier did it already */
759 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
760 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
761 bdb_cache_entry_db_relock( bdb->bi_dbenv,
762 locker, *eip, 0, 0, lock );
771 bdb_cache_entryinfo_unlock( *eip );
774 bdb_entry_return( ep );
779 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
780 bdb->bi_cache.c_cursize++;
781 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
784 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
786 /* If the LRU list has only one entry and this is it, it
787 * doesn't need to be added again.
789 if ( bdb->bi_cache.c_lruhead == bdb->bi_cache.c_lrutail &&
790 bdb->bi_cache.c_lruhead == *eip ) {
791 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
794 /* if entry is on LRU list, remove from old spot */
795 if ( (*eip)->bei_lrunext || (*eip)->bei_lruprev ) {
796 LRU_DELETE( &bdb->bi_cache, *eip );
798 /* lru_mutex is unlocked for us */
799 bdb_cache_lru_add( bdb, locker, *eip );
814 if ( BEI(e)->bei_kids ) {
817 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
820 rc = bdb_dn2id_children( op, txn, e );
821 if ( rc == DB_NOTFOUND ) {
822 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
827 /* Update the cache after a successful database Add. */
830 struct bdb_info *bdb,
837 struct berval rdn = e->e_name;
846 /* Lock this entry so that bdb_add can run to completion.
847 * It can only fail if BDB has run out of lock resources.
849 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, &ei, 1, 0, &lock );
851 bdb_cache_entryinfo_unlock( eip );
856 if ( nrdn->bv_len != e->e_nname.bv_len ) {
857 char *ptr = strchr( rdn.bv_val, ',' );
858 rdn.bv_len = ptr - rdn.bv_val;
860 ber_dupbv( &ei.bei_rdn, &rdn );
861 if ( eip->bei_dkids ) eip->bei_dkids++;
864 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
865 /* bdb_csn_commit can cause this when adding the database root entry */
867 new->bei_e->e_private = NULL;
868 bdb_entry_return( new->bei_e );
872 new->bei_state = CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
873 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
874 if (eip->bei_parent) {
875 eip->bei_parent->bei_state &= ~CACHE_ENTRY_NO_GRANDKIDS;
877 bdb_cache_entryinfo_unlock( eip );
879 ++bdb->bi_cache.c_cursize;
880 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
883 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
885 /* lru_mutex is unlocked for us */
886 bdb_cache_lru_add( bdb, locker, new );
899 EntryInfo *ei = BEI(e);
901 /* Get write lock on data */
902 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
904 /* If we've done repeated mods on a cached entry, then e_attrs
905 * is no longer contiguous with the entry, and must be freed.
908 if ( (void *)e->e_attrs != (void *)(e+1) ) {
909 attrs_free( e->e_attrs );
911 e->e_attrs = newAttrs;
917 * Change the rdn in the entryinfo. Also move to a new parent if needed.
929 EntryInfo *ei = BEI(e), *pei;
933 /* Get write lock on data */
934 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
937 /* If we've done repeated mods on a cached entry, then e_attrs
938 * is no longer contiguous with the entry, and must be freed.
940 if ( (void *)e->e_attrs != (void *)(e+1) ) {
941 attrs_free( e->e_attrs );
943 e->e_attrs = new->e_attrs;
944 if( e->e_nname.bv_val < e->e_bv.bv_val ||
945 e->e_nname.bv_val > e->e_bv.bv_val + e->e_bv.bv_len )
947 ch_free(e->e_name.bv_val);
948 ch_free(e->e_nname.bv_val);
950 e->e_name = new->e_name;
951 e->e_nname = new->e_nname;
953 /* Lock the parent's kids AVL tree */
954 pei = ei->bei_parent;
955 bdb_cache_entryinfo_lock( pei );
956 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
957 free( ei->bei_nrdn.bv_val );
958 ber_dupbv( &ei->bei_nrdn, nrdn );
960 free( ei->bei_rdn.bv_val );
963 if ( nrdn->bv_len != e->e_nname.bv_len ) {
964 char *ptr = strchr(rdn.bv_val, ',');
965 rdn.bv_len = ptr - rdn.bv_val;
967 ber_dupbv( &ei->bei_rdn, &rdn );
971 ein = ei->bei_parent;
973 ei->bei_parent = ein;
974 bdb_cache_entryinfo_unlock( pei );
975 bdb_cache_entryinfo_lock( ein );
979 int max = ei->bei_modrdns;
980 /* Record the generation number of this change */
981 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
982 if ( pei->bei_modrdns > max ) max = pei->bei_modrdns;
984 ei->bei_modrdns = max + 1;
987 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
988 bdb_cache_entryinfo_unlock( ein );
992 * cache_delete - delete the entry e from the cache.
994 * returns: 0 e was deleted ok
995 * 1 e was not in the cache
996 * -1 something bad happened
1006 EntryInfo *ei = BEI(e);
1009 assert( e->e_private );
1011 /* Set this early, warn off any queriers */
1012 ei->bei_state |= CACHE_ENTRY_DELETED;
1014 /* Lock the entry's info */
1015 bdb_cache_entryinfo_lock( ei );
1017 /* Get write lock on the data */
1018 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
1020 /* couldn't lock, undo and give up */
1021 ei->bei_state ^= CACHE_ENTRY_DELETED;
1022 bdb_cache_entryinfo_unlock( ei );
1026 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
1030 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1031 rc = bdb_cache_delete_internal( cache, e->e_private, 1 );
1032 /* free lru mutex */
1033 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1035 /* Leave entry info locked */
1041 bdb_cache_delete_cleanup(
1046 ei->bei_e->e_private = NULL;
1047 bdb_entry_return( ei->bei_e );
1051 free( ei->bei_nrdn.bv_val );
1052 ei->bei_nrdn.bv_val = NULL;
1054 free( ei->bei_rdn.bv_val );
1055 ei->bei_rdn.bv_val = NULL;
1056 ei->bei_modrdns = 0;
1060 ei->bei_parent = NULL;
1061 ei->bei_kids = NULL;
1062 ei->bei_lruprev = NULL;
1064 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1065 ei->bei_lrunext = cache->c_eifree;
1066 cache->c_eifree = ei;
1067 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1068 bdb_cache_entryinfo_unlock( ei );
1072 bdb_cache_delete_internal(
1077 int rc = 0; /* return code */
1079 /* set cache write lock */
1080 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1082 /* Lock the parent's kids tree */
1083 bdb_cache_entryinfo_lock( e->bei_parent );
1086 e->bei_parent->bei_ckids--;
1087 if ( decr && e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
1090 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp )
1097 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL ) {
1108 LRU_DELETE( cache, e );
1109 if ( e->bei_e ) cache->c_cursize--;
1111 /* free cache write lock */
1112 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1113 bdb_cache_entryinfo_unlock( e->bei_parent );
1119 bdb_entryinfo_release( void *data )
1121 EntryInfo *ei = (EntryInfo *)data;
1122 if ( ei->bei_kids ) {
1123 avl_free( ei->bei_kids, NULL );
1126 ei->bei_e->e_private = NULL;
1127 bdb_entry_return( ei->bei_e );
1129 bdb_cache_entryinfo_destroy( ei );
1133 bdb_cache_release_all( Cache *cache )
1135 /* set cache write lock */
1136 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1138 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1140 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1142 avl_free( cache->c_dntree.bei_kids, NULL );
1143 avl_free( cache->c_idtree, bdb_entryinfo_release );
1144 for (;cache->c_eifree;cache->c_eifree = cache->c_lruhead) {
1145 cache->c_lruhead = cache->c_eifree->bei_lrunext;
1146 bdb_cache_entryinfo_destroy(cache->c_eifree);
1148 cache->c_lruhead = NULL;
1149 cache->c_lrutail = NULL;
1151 /* free lru mutex */
1152 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1153 /* free cache write lock */
1154 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1159 bdb_lru_print( Cache *cache )
1163 fprintf( stderr, "LRU queue (head to tail):\n" );
1164 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
1165 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1166 e->bei_nrdn.bv_val, e->bei_id );
1168 fprintf( stderr, "LRU queue (tail to head):\n" );
1169 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
1170 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1171 e->bei_nrdn.bv_val, e->bei_id );
1177 bdb_txn_free( void *key, void *data )
1183 /* Obtain a long-lived transaction for the current thread.
1184 * If reset == 1, remove the current transaction. */
1186 bdb_txn_get( Operation *op, DB_ENV *env, DB_TXN **txn, int reset )
1189 void *ctx, *data = NULL;
1191 /* If no op was provided, try to find the ctx anyway... */
1193 ctx = op->o_threadctx;
1195 ctx = ldap_pvt_thread_pool_context();
1198 /* Shouldn't happen unless we're single-threaded */
1206 return ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1, NULL, NULL );
1209 if ( ldap_pvt_thread_pool_getkey( ctx, ((char *)env)+1, &data, NULL ) ||
1211 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1212 rc = TXN_BEGIN( env, NULL, txn, 0 );
1213 if (rc) ldap_pvt_thread_yield();
1218 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1,
1219 *txn, bdb_txn_free ) ) ) {
1221 Debug( LDAP_DEBUG_ANY, "bdb_txn_get: err %s(%d)\n",
1222 db_strerror(rc), rc, 0 );
1232 #ifdef BDB_REUSE_LOCKERS
1234 bdb_locker_id_free( void *key, void *data )
1237 int lockid = (int) data;
1240 rc = XLOCK_ID_FREE( env, lockid );
1241 if ( rc == EINVAL ) {
1243 Debug( LDAP_DEBUG_ANY,
1244 "bdb_locker_id_free: %d err %s(%d)\n",
1245 lockid, db_strerror(rc), rc );
1246 /* release all locks held by this locker. */
1247 lr.op = DB_LOCK_PUT_ALL;
1249 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1250 XLOCK_ID_FREE( env, lockid );
1255 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
1261 if ( !env || !locker ) return -1;
1263 /* If no op was provided, try to find the ctx anyway... */
1265 ctx = op->o_threadctx;
1267 ctx = ldap_pvt_thread_pool_context();
1270 /* Shouldn't happen unless we're single-threaded */
1276 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1277 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1278 rc = XLOCK_ID( env, &lockid );
1279 if (rc) ldap_pvt_thread_yield();
1284 data = (void *)lockid;
1285 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1286 data, bdb_locker_id_free ) ) ) {
1287 XLOCK_ID_FREE( env, lockid );
1288 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1289 db_strerror(rc), rc, 0 );
1302 bdb_cache_delete_entry(
1303 struct bdb_info *bdb,
1308 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
1309 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, bdb->bi_cache.c_locker, ei, 1, 1, lock ) == 0 )
1311 if ( ei->bei_e && !(ei->bei_state & CACHE_ENTRY_NOT_LINKED )) {
1312 LRU_DELETE( &bdb->bi_cache, ei );
1313 ei->bei_e->e_private = NULL;
1314 bdb_entry_return( ei->bei_e );
1316 --bdb->bi_cache.c_cursize;
1318 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
1320 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );