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;
233 #ifdef SLAP_ZONE_ALLOC
237 /* Add to cache ID tree */
238 if (avl_insert( &bdb->bi_cache.c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
240 eix = avl_find( bdb->bi_cache.c_idtree, ei2, bdb_id_cmp );
241 bdb_cache_entryinfo_destroy( ei2 );
244 /* It got freed above because its value was
247 ei->bei_rdn.bv_val = NULL;
250 bdb->bi_cache.c_eiused++;
251 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
252 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
255 ei->bei_parent->bei_ckids++;
263 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
264 * the info for its closest ancestor. *res should be NULL to process a
265 * complete DN starting from the tree root. Otherwise *res must be the
266 * immediate parent of the requested DN, and only the RDN will be searched.
267 * The EntryInfo is locked upon return and must be unlocked by the caller.
276 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
277 EntryInfo ei, *eip, *ei2;
281 /* this function is always called with normalized DN */
283 /* we're doing a onelevel search for an RDN */
284 ei.bei_nrdn.bv_val = ndn->bv_val;
285 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
288 /* we're searching a full DN from the root */
289 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
290 ei.bei_nrdn.bv_val = ptr;
291 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
292 /* Skip to next rdn if suffix is empty */
293 if ( ei.bei_nrdn.bv_len == 0 ) {
294 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
295 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
296 if ( ptr >= ndn->bv_val ) {
297 if (DN_SEPARATOR(*ptr)) ptr++;
298 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr;
299 ei.bei_nrdn.bv_val = ptr;
302 eip = &bdb->bi_cache.c_dntree;
305 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
307 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
309 int len = ei.bei_nrdn.bv_len;
311 ei.bei_nrdn.bv_len = ndn->bv_len -
312 (ei.bei_nrdn.bv_val - ndn->bv_val);
313 bdb_cache_entryinfo_unlock( eip );
315 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
317 bdb_cache_entryinfo_lock( eip );
322 /* DN exists but needs to be added to cache */
323 ei.bei_nrdn.bv_len = len;
324 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2 );
325 /* add_internal left eip and c_rwlock locked */
326 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
331 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
332 /* In the midst of deleting? Give it a chance to
335 bdb_cache_entryinfo_unlock( eip );
336 ldap_pvt_thread_yield();
337 bdb_cache_entryinfo_lock( eip );
341 bdb_cache_entryinfo_unlock( eip );
342 bdb_cache_entryinfo_lock( ei2 );
346 /* Advance to next lower RDN */
347 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
348 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
349 if ( ptr >= ndn->bv_val ) {
350 if (DN_SEPARATOR(*ptr)) ptr++;
351 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
352 ei.bei_nrdn.bv_val = ptr;
354 if ( ptr < ndn->bv_val ) {
364 /* Walk up the tree from a child node, looking for an ID that's already
365 * been linked into the cache.
368 hdb_cache_find_parent(
374 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
375 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
376 char ndn[SLAP_LDAPDN_MAXLEN];
386 rc = hdb_dn2id_parent( op, txn, &ei, &eip.bei_id );
389 /* Save the previous node, if any */
392 /* Create a new node for the current ID */
393 ein = bdb_cache_entryinfo_new( &bdb->bi_cache );
394 ein->bei_id = ei.bei_id;
395 ein->bei_kids = ei.bei_kids;
396 ein->bei_nrdn = ei.bei_nrdn;
397 ein->bei_rdn = ei.bei_rdn;
398 ein->bei_ckids = ei.bei_ckids;
399 #ifdef SLAP_ZONE_ALLOC
404 /* This node is not fully connected yet */
405 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
407 /* Insert this node into the ID tree */
408 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
409 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
410 bdb_id_cmp, avl_dup_error ) ) {
412 /* Someone else created this node just before us.
413 * Free our new copy and use the existing one.
415 bdb_cache_entryinfo_destroy( ein );
416 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
417 (caddr_t) &ei, bdb_id_cmp );
419 /* Link in any kids we've already processed */
421 bdb_cache_entryinfo_lock( ein );
422 avl_insert( &ein->bei_kids, (caddr_t)ei2,
423 bdb_rdn_cmp, avl_dup_error );
425 bdb_cache_entryinfo_unlock( ein );
433 /* If this is the first time, save this node
434 * to be returned later.
436 if ( eir == NULL ) eir = ein;
438 /* If there was a previous node, link it to this one */
439 if ( ei2 ) ei2->bei_parent = ein;
441 /* Look for this node's parent */
443 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
444 (caddr_t) &eip, bdb_id_cmp );
446 ei2 = &bdb->bi_cache.c_dntree;
448 bdb->bi_cache.c_eiused++;
449 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
451 /* Got the parent, link in and we're done. */
453 bdb_cache_entryinfo_lock( ei2 );
454 ein->bei_parent = ei2;
455 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
458 bdb_cache_entryinfo_unlock( ei2 );
459 bdb_cache_entryinfo_lock( eir );
461 /* Reset all the state info */
462 for (ein = eir; ein != ei2; ein=ein->bei_parent)
463 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
468 ei.bei_id = eip.bei_id;
470 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
476 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
480 struct bdb_info *bdb,
487 /* See if we already have this one */
488 bdb_cache_entryinfo_lock( ei->bei_parent );
489 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
490 bdb_cache_entryinfo_unlock( ei->bei_parent );
493 /* Not found, add it */
496 /* bei_rdn was not malloc'd before, do it now */
497 ber_dupbv( &bv, &ei->bei_rdn );
500 rc = bdb_entryinfo_add_internal( bdb, ei, res );
501 bdb_cache_entryinfo_unlock( ei->bei_parent );
502 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
504 /* Found, return it */
512 /* caller must have lru_mutex locked. mutex
513 * will be unlocked on return.
517 struct bdb_info *bdb,
521 DB_LOCK lock, *lockp;
529 /* See if we're above the cache size limit */
530 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
531 EntryInfo *elru, *elprev;
534 /* Look for an unused entry to remove */
535 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
536 elprev = elru->bei_lruprev;
538 /* Too many probes, not enough idle, give up */
542 /* If we can successfully writelock it, then
543 * the object is idle.
545 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv,
546 bdb->bi_cache.c_locker, elru, 1, 1, lockp ) == 0 ) {
549 /* If there's no entry, or this node is in
550 * the process of linking into the cache,
551 * or this node is being deleted, skip it.
553 if ( !elru->bei_e || (elru->bei_state &
554 ( CACHE_ENTRY_NOT_LINKED | CACHE_ENTRY_DELETED ))) {
555 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
558 LRU_DELETE( &bdb->bi_cache, elru );
559 elru->bei_e->e_private = NULL;
560 #ifdef SLAP_ZONE_ALLOC
561 bdb_entry_return( bdb, elru->bei_e, elru->bei_zseq );
563 bdb_entry_return( elru->bei_e );
566 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
567 --bdb->bi_cache.c_cursize;
568 if (bdb->bi_cache.c_cursize <= bdb->bi_cache.c_maxsize)
570 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
571 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
576 LRU_ADD( &bdb->bi_cache, ei );
577 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
582 struct bdb_info *bdb,
585 EntryInfo ei = { 0 },
590 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
591 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
592 (caddr_t) &ei, bdb_id_cmp );
593 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
598 * cache_find_id - find an entry in the cache, given id.
599 * The entry is locked for Read upon return. Call with islocked TRUE if
600 * the supplied *eip was already locked.
613 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
615 int rc = 0, load = 0;
616 EntryInfo ei = { 0 };
620 #ifdef SLAP_ZONE_ALLOC
621 slap_zh_rlock(bdb->bi_cache.c_zctx);
623 /* If we weren't given any info, see if we have it already cached */
625 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
626 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
627 (caddr_t) &ei, bdb_id_cmp );
629 /* If the lock attempt fails, the info is in use */
630 if ( ldap_pvt_thread_mutex_trylock(
631 &(*eip)->bei_kids_mutex )) {
632 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
633 /* If this node is being deleted, treat
634 * as if the delete has already finished
636 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
639 /* otherwise, wait for the info to free up */
640 ldap_pvt_thread_yield();
643 /* If this info isn't hooked up to its parent yet,
644 * unlock and wait for it to be fully initialized
646 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
647 bdb_cache_entryinfo_unlock( *eip );
648 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
649 ldap_pvt_thread_yield();
654 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
657 /* See if the ID exists in the database; add it to the cache if so */
660 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
662 rc = bdb_cache_find_ndn( op, tid,
664 if ( *eip ) islocked = 1;
666 #ifdef SLAP_ZONE_ALLOC
667 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
669 bdb_entry_return( ep );
675 rc = hdb_cache_find_parent(op, tid, id, eip );
676 if ( rc == 0 && *eip ) islocked = 1;
680 /* Ok, we found the info, do we have the entry? */
681 if ( *eip && rc == 0 ) {
682 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
685 /* Make sure only one thread tries to load the entry */
687 #ifdef SLAP_ZONE_ALLOC
688 if ((*eip)->bei_e && !slap_zn_validate(
689 bdb->bi_cache.c_zctx, (*eip)->bei_e, (*eip)->bei_zseq)) {
690 (*eip)->bei_e = NULL;
691 (*eip)->bei_zseq = 0;
694 if ( !(*eip)->bei_e && !((*eip)->bei_state & CACHE_ENTRY_LOADING)) {
696 (*eip)->bei_state |= CACHE_ENTRY_LOADING;
699 bdb_cache_entryinfo_unlock( *eip );
702 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, *eip, 0, 0, lock );
703 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
705 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
706 } else if ( rc == 0 ) {
709 u_int32_t locker2 = locker;
711 /* We don't wrap entire read operations in txn's, but
712 * we need our cache entry lock and any DB page locks
713 * to be associated, in order for deadlock detection
714 * to work properly. So if we need to read from the DB,
715 * we use a long-lived per-thread txn for this step.
718 rc = bdb_txn_get( op, bdb->bi_dbenv, <id, 0 );
720 locker2 = TXN_ID( ltid );
724 /* Give up original read lock, obtain write lock with
725 * (possibly) new locker ID.
728 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker2,
731 if ( rc == 0 && !ep) {
732 rc = bdb_id2entry( op->o_bd, ltid, id, &ep );
735 ep->e_private = *eip;
740 #ifdef SLAP_ZONE_ALLOC
741 (*eip)->bei_zseq = *((ber_len_t *)ep - 2);
745 (*eip)->bei_state ^= CACHE_ENTRY_LOADING;
747 /* If we succeeded, downgrade back to a readlock. */
748 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
751 /* Otherwise, release the lock. */
752 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
754 if ( locker2 != locker ) {
755 /* If we're using the per-thread txn, release all
756 * of its page locks now.
759 list.op = DB_LOCK_PUT_ALL;
761 bdb->bi_dbenv->lock_vec( bdb->bi_dbenv, locker2,
763 /* If this txn was deadlocked, we must abort it
764 * and invalidate this per-thread txn.
766 if ( rc == DB_LOCK_DEADLOCK ) {
767 bdb_txn_get( op, bdb->bi_dbenv, <id, 1 );
770 } else if ( !(*eip)->bei_e ) {
771 /* Some other thread is trying to load the entry,
772 * give it a chance to finish.
774 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
775 ldap_pvt_thread_yield();
776 bdb_cache_entryinfo_lock( *eip );
781 /* Check for subtree renames
783 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
785 bdb_cache_entry_db_relock( bdb->bi_dbenv,
786 locker, *eip, 1, 0, lock );
787 /* check again in case other modifier did it already */
788 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
789 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
790 bdb_cache_entry_db_relock( bdb->bi_dbenv,
791 locker, *eip, 0, 0, lock );
800 bdb_cache_entryinfo_unlock( *eip );
803 #ifdef SLAP_ZONE_ALLOC
804 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
806 bdb_entry_return( ep );
812 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
813 bdb->bi_cache.c_cursize++;
814 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
817 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
819 /* If the LRU list has only one entry and this is it, it
820 * doesn't need to be added again.
822 if ( bdb->bi_cache.c_lruhead == bdb->bi_cache.c_lrutail &&
823 bdb->bi_cache.c_lruhead == *eip ) {
824 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
827 /* if entry is on LRU list, remove from old spot */
828 if ( (*eip)->bei_lrunext || (*eip)->bei_lruprev ) {
829 LRU_DELETE( &bdb->bi_cache, *eip );
831 /* lru_mutex is unlocked for us */
832 bdb_cache_lru_add( bdb, locker, *eip );
836 #ifdef SLAP_ZONE_ALLOC
837 if (rc == 0 && (*eip)->bei_e) {
838 slap_zn_rlock(bdb->bi_cache.c_zctx, (*eip)->bei_e);
840 slap_zh_runlock(bdb->bi_cache.c_zctx);
853 if ( BEI(e)->bei_kids ) {
856 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
859 rc = bdb_dn2id_children( op, txn, e );
860 if ( rc == DB_NOTFOUND ) {
861 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
866 /* Update the cache after a successful database Add. */
869 struct bdb_info *bdb,
876 struct berval rdn = e->e_name;
885 /* Lock this entry so that bdb_add can run to completion.
886 * It can only fail if BDB has run out of lock resources.
888 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, &ei, 1, 0, &lock );
890 bdb_cache_entryinfo_unlock( eip );
895 if ( nrdn->bv_len != e->e_nname.bv_len ) {
896 char *ptr = strchr( rdn.bv_val, ',' );
897 rdn.bv_len = ptr - rdn.bv_val;
899 ber_dupbv( &ei.bei_rdn, &rdn );
900 if ( eip->bei_dkids ) eip->bei_dkids++;
903 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
904 /* bdb_csn_commit can cause this when adding the database root entry */
906 new->bei_e->e_private = NULL;
907 #ifdef SLAP_ZONE_ALLOC
908 bdb_entry_return( bdb, new->bei_e, new->bei_zseq );
910 bdb_entry_return( new->bei_e );
915 new->bei_state = CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
916 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
917 if (eip->bei_parent) {
918 eip->bei_parent->bei_state &= ~CACHE_ENTRY_NO_GRANDKIDS;
920 bdb_cache_entryinfo_unlock( eip );
923 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
924 ++bdb->bi_cache.c_cursize;
925 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
927 /* lru_mutex is unlocked for us */
928 bdb_cache_lru_add( bdb, locker, new );
941 EntryInfo *ei = BEI(e);
943 /* Get write lock on data */
944 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
946 /* If we've done repeated mods on a cached entry, then e_attrs
947 * is no longer contiguous with the entry, and must be freed.
950 if ( (void *)e->e_attrs != (void *)(e+1) ) {
951 attrs_free( e->e_attrs );
953 e->e_attrs = newAttrs;
959 * Change the rdn in the entryinfo. Also move to a new parent if needed.
971 EntryInfo *ei = BEI(e), *pei;
975 /* Get write lock on data */
976 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
979 /* If we've done repeated mods on a cached entry, then e_attrs
980 * is no longer contiguous with the entry, and must be freed.
982 if ( (void *)e->e_attrs != (void *)(e+1) ) {
983 attrs_free( e->e_attrs );
985 e->e_attrs = new->e_attrs;
986 if( e->e_nname.bv_val < e->e_bv.bv_val ||
987 e->e_nname.bv_val > e->e_bv.bv_val + e->e_bv.bv_len )
989 ch_free(e->e_name.bv_val);
990 ch_free(e->e_nname.bv_val);
992 e->e_name = new->e_name;
993 e->e_nname = new->e_nname;
995 /* Lock the parent's kids AVL tree */
996 pei = ei->bei_parent;
997 bdb_cache_entryinfo_lock( pei );
998 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
999 free( ei->bei_nrdn.bv_val );
1000 ber_dupbv( &ei->bei_nrdn, nrdn );
1002 free( ei->bei_rdn.bv_val );
1005 if ( nrdn->bv_len != e->e_nname.bv_len ) {
1006 char *ptr = strchr(rdn.bv_val, ',');
1007 rdn.bv_len = ptr - rdn.bv_val;
1009 ber_dupbv( &ei->bei_rdn, &rdn );
1013 ein = ei->bei_parent;
1015 ei->bei_parent = ein;
1016 bdb_cache_entryinfo_unlock( pei );
1017 bdb_cache_entryinfo_lock( ein );
1021 int max = ei->bei_modrdns;
1022 /* Record the generation number of this change */
1023 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
1024 if ( pei->bei_modrdns > max ) max = pei->bei_modrdns;
1026 ei->bei_modrdns = max + 1;
1029 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
1030 bdb_cache_entryinfo_unlock( ein );
1034 * cache_delete - delete the entry e from the cache.
1036 * returns: 0 e was deleted ok
1037 * 1 e was not in the cache
1038 * -1 something bad happened
1048 EntryInfo *ei = BEI(e);
1051 assert( e->e_private );
1053 /* Set this early, warn off any queriers */
1054 ei->bei_state |= CACHE_ENTRY_DELETED;
1056 /* Lock the entry's info */
1057 bdb_cache_entryinfo_lock( ei );
1059 /* Get write lock on the data */
1060 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
1062 /* couldn't lock, undo and give up */
1063 ei->bei_state ^= CACHE_ENTRY_DELETED;
1064 bdb_cache_entryinfo_unlock( ei );
1068 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
1072 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1073 rc = bdb_cache_delete_internal( cache, e->e_private, 1 );
1074 /* free lru mutex */
1075 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1077 /* Leave entry info locked */
1083 bdb_cache_delete_cleanup(
1088 ei->bei_e->e_private = NULL;
1089 #ifdef SLAP_ZONE_ALLOC
1090 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1092 bdb_entry_return( ei->bei_e );
1097 free( ei->bei_nrdn.bv_val );
1098 ei->bei_nrdn.bv_val = NULL;
1100 free( ei->bei_rdn.bv_val );
1101 ei->bei_rdn.bv_val = NULL;
1102 ei->bei_modrdns = 0;
1106 ei->bei_parent = NULL;
1107 ei->bei_kids = NULL;
1108 ei->bei_lruprev = NULL;
1110 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1111 ei->bei_lrunext = cache->c_eifree;
1112 cache->c_eifree = ei;
1113 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1114 bdb_cache_entryinfo_unlock( ei );
1118 bdb_cache_delete_internal(
1123 int rc = 0; /* return code */
1125 /* set cache write lock */
1126 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1128 /* Lock the parent's kids tree */
1129 bdb_cache_entryinfo_lock( e->bei_parent );
1132 e->bei_parent->bei_ckids--;
1133 if ( decr && e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
1136 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp )
1143 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL ) {
1154 LRU_DELETE( cache, e );
1155 if ( e->bei_e ) cache->c_cursize--;
1157 /* free cache write lock */
1158 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1159 bdb_cache_entryinfo_unlock( e->bei_parent );
1165 bdb_entryinfo_release( void *data )
1167 EntryInfo *ei = (EntryInfo *)data;
1168 if ( ei->bei_kids ) {
1169 avl_free( ei->bei_kids, NULL );
1172 ei->bei_e->e_private = NULL;
1173 #ifdef SLAP_ZONE_ALLOC
1174 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1176 bdb_entry_return( ei->bei_e );
1179 bdb_cache_entryinfo_destroy( ei );
1183 bdb_cache_release_all( Cache *cache )
1185 /* set cache write lock */
1186 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1188 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1190 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1192 avl_free( cache->c_dntree.bei_kids, NULL );
1193 avl_free( cache->c_idtree, bdb_entryinfo_release );
1194 for (;cache->c_eifree;cache->c_eifree = cache->c_lruhead) {
1195 cache->c_lruhead = cache->c_eifree->bei_lrunext;
1196 bdb_cache_entryinfo_destroy(cache->c_eifree);
1198 cache->c_lruhead = NULL;
1199 cache->c_lrutail = NULL;
1201 /* free lru mutex */
1202 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1203 /* free cache write lock */
1204 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1209 bdb_lru_print( Cache *cache )
1213 fprintf( stderr, "LRU queue (head to tail):\n" );
1214 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
1215 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1216 e->bei_nrdn.bv_val, e->bei_id );
1218 fprintf( stderr, "LRU queue (tail to head):\n" );
1219 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
1220 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1221 e->bei_nrdn.bv_val, e->bei_id );
1227 bdb_txn_free( void *key, void *data )
1233 /* Obtain a long-lived transaction for the current thread.
1234 * If reset == 1, remove the current transaction. */
1236 bdb_txn_get( Operation *op, DB_ENV *env, DB_TXN **txn, int reset )
1239 void *ctx, *data = NULL;
1241 /* If no op was provided, try to find the ctx anyway... */
1243 ctx = op->o_threadctx;
1245 ctx = ldap_pvt_thread_pool_context();
1248 /* Shouldn't happen unless we're single-threaded */
1256 return ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1, NULL, NULL );
1259 if ( ldap_pvt_thread_pool_getkey( ctx, ((char *)env)+1, &data, NULL ) ||
1261 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1262 rc = TXN_BEGIN( env, NULL, txn, 0 );
1263 if (rc) ldap_pvt_thread_yield();
1268 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1,
1269 *txn, bdb_txn_free ) ) ) {
1271 Debug( LDAP_DEBUG_ANY, "bdb_txn_get: err %s(%d)\n",
1272 db_strerror(rc), rc, 0 );
1282 #ifdef BDB_REUSE_LOCKERS
1284 bdb_locker_id_free( void *key, void *data )
1287 int lockid = (int) data;
1290 rc = XLOCK_ID_FREE( env, lockid );
1291 if ( rc == EINVAL ) {
1293 Debug( LDAP_DEBUG_ANY,
1294 "bdb_locker_id_free: %d err %s(%d)\n",
1295 lockid, db_strerror(rc), rc );
1296 /* release all locks held by this locker. */
1297 lr.op = DB_LOCK_PUT_ALL;
1299 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1300 XLOCK_ID_FREE( env, lockid );
1305 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
1311 if ( !env || !locker ) return -1;
1313 /* If no op was provided, try to find the ctx anyway... */
1315 ctx = op->o_threadctx;
1317 ctx = ldap_pvt_thread_pool_context();
1320 /* Shouldn't happen unless we're single-threaded */
1326 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1327 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1328 rc = XLOCK_ID( env, &lockid );
1329 if (rc) ldap_pvt_thread_yield();
1334 data = (void *)lockid;
1335 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1336 data, bdb_locker_id_free ) ) ) {
1337 XLOCK_ID_FREE( env, lockid );
1338 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1339 db_strerror(rc), rc, 0 );
1352 bdb_cache_delete_entry(
1353 struct bdb_info *bdb,
1358 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
1359 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, bdb->bi_cache.c_locker, ei, 1, 1, lock ) == 0 )
1361 if ( ei->bei_e && !(ei->bei_state & CACHE_ENTRY_NOT_LINKED )) {
1362 LRU_DELETE( &bdb->bi_cache, ei );
1363 ei->bei_e->e_private = NULL;
1364 #ifdef SLAP_ZONE_ALLOC
1365 bdb_entry_return( bdb, ei->bei_e, ei->bei_zseq );
1367 bdb_entry_return( ei->bei_e );
1370 --bdb->bi_cache.c_cursize;
1372 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
1374 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );