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;
384 rc = hdb_dn2id_parent( op, txn, &ei, &eip.bei_id );
387 /* Save the previous node, if any */
390 /* Create a new node for the current ID */
391 ein = bdb_cache_entryinfo_new( &bdb->bi_cache );
392 ein->bei_id = ei.bei_id;
393 ein->bei_kids = ei.bei_kids;
394 ein->bei_nrdn = ei.bei_nrdn;
395 ein->bei_rdn = ei.bei_rdn;
396 ein->bei_ckids = ei.bei_ckids;
397 #ifdef SLAP_ZONE_ALLOC
402 /* This node is not fully connected yet */
403 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
405 /* Insert this node into the ID tree */
406 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
407 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
408 bdb_id_cmp, avl_dup_error ) ) {
410 /* Someone else created this node just before us.
411 * Free our new copy and use the existing one.
413 bdb_cache_entryinfo_destroy( ein );
414 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
415 (caddr_t) &ei, bdb_id_cmp );
417 /* Link in any kids we've already processed */
419 bdb_cache_entryinfo_lock( ein );
420 avl_insert( &ein->bei_kids, (caddr_t)ei2,
421 bdb_rdn_cmp, avl_dup_error );
423 bdb_cache_entryinfo_unlock( ein );
431 /* If this is the first time, save this node
432 * to be returned later.
434 if ( eir == NULL ) eir = ein;
436 /* If there was a previous node, link it to this one */
437 if ( ei2 ) ei2->bei_parent = ein;
439 /* Look for this node's parent */
441 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
442 (caddr_t) &eip, bdb_id_cmp );
444 ei2 = &bdb->bi_cache.c_dntree;
446 bdb->bi_cache.c_eiused++;
447 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
449 /* Got the parent, link in and we're done. */
451 bdb_cache_entryinfo_lock( ei2 );
452 ein->bei_parent = ei2;
453 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
456 bdb_cache_entryinfo_unlock( ei2 );
457 bdb_cache_entryinfo_lock( eir );
459 /* Reset all the state info */
460 for (ein = eir; ein != ei2; ein=ein->bei_parent)
461 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
466 ei.bei_id = eip.bei_id;
468 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
474 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
478 struct bdb_info *bdb,
485 /* See if we already have this one */
486 bdb_cache_entryinfo_lock( ei->bei_parent );
487 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
488 bdb_cache_entryinfo_unlock( ei->bei_parent );
491 /* Not found, add it */
494 /* bei_rdn was not malloc'd before, do it now */
495 ber_dupbv( &bv, &ei->bei_rdn );
498 rc = bdb_entryinfo_add_internal( bdb, ei, res );
499 bdb_cache_entryinfo_unlock( ei->bei_parent );
500 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
502 /* Found, return it */
510 /* caller must have lru_mutex locked. mutex
511 * will be unlocked on return.
515 struct bdb_info *bdb,
519 DB_LOCK lock, *lockp;
527 /* See if we're above the cache size limit */
528 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
529 EntryInfo *elru, *elprev;
532 /* Look for an unused entry to remove */
533 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
534 elprev = elru->bei_lruprev;
536 /* Too many probes, not enough idle, give up */
540 /* If we can successfully writelock it, then
541 * the object is idle.
543 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv,
544 bdb->bi_cache.c_locker, elru, 1, 1, lockp ) == 0 ) {
547 /* If there's no entry, or this node is in
548 * the process of linking into the cache,
549 * or this node is being deleted, skip it.
551 if ( !elru->bei_e || (elru->bei_state &
552 ( CACHE_ENTRY_NOT_LINKED | CACHE_ENTRY_DELETED ))) {
553 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
556 LRU_DELETE( &bdb->bi_cache, elru );
557 elru->bei_e->e_private = NULL;
558 #ifdef SLAP_ZONE_ALLOC
559 bdb_entry_return( bdb, elru->bei_e, elru->bei_zseq );
561 bdb_entry_return( elru->bei_e );
564 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
565 --bdb->bi_cache.c_cursize;
566 if (bdb->bi_cache.c_cursize <= bdb->bi_cache.c_maxsize)
568 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
569 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
574 LRU_ADD( &bdb->bi_cache, ei );
575 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
580 struct bdb_info *bdb,
583 EntryInfo ei = { 0 },
588 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
589 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
590 (caddr_t) &ei, bdb_id_cmp );
591 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
596 * cache_find_id - find an entry in the cache, given id.
597 * The entry is locked for Read upon return. Call with islocked TRUE if
598 * the supplied *eip was already locked.
611 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
613 int rc = 0, load = 0;
614 EntryInfo ei = { 0 };
618 #ifdef SLAP_ZONE_ALLOC
619 slap_zh_rlock(bdb->bi_cache.c_zctx);
621 /* If we weren't given any info, see if we have it already cached */
623 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
624 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
625 (caddr_t) &ei, bdb_id_cmp );
627 /* If the lock attempt fails, the info is in use */
628 if ( ldap_pvt_thread_mutex_trylock(
629 &(*eip)->bei_kids_mutex )) {
630 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
631 /* If this node is being deleted, treat
632 * as if the delete has already finished
634 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
637 /* otherwise, wait for the info to free up */
638 ldap_pvt_thread_yield();
641 /* If this info isn't hooked up to its parent yet,
642 * unlock and wait for it to be fully initialized
644 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
645 bdb_cache_entryinfo_unlock( *eip );
646 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
647 ldap_pvt_thread_yield();
652 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
655 /* See if the ID exists in the database; add it to the cache if so */
658 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
660 rc = bdb_cache_find_ndn( op, tid,
662 if ( *eip ) islocked = 1;
664 #ifdef SLAP_ZONE_ALLOC
665 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
667 bdb_entry_return( ep );
673 rc = hdb_cache_find_parent(op, tid, id, eip );
674 if ( rc == 0 && *eip ) islocked = 1;
678 /* Ok, we found the info, do we have the entry? */
679 if ( *eip && rc == 0 ) {
680 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
683 /* Make sure only one thread tries to load the entry */
685 #ifdef SLAP_ZONE_ALLOC
686 if ((*eip)->bei_e && !slap_zn_validate(
687 bdb->bi_cache.c_zctx, (*eip)->bei_e, (*eip)->bei_zseq)) {
688 (*eip)->bei_e = NULL;
689 (*eip)->bei_zseq = 0;
692 if ( !(*eip)->bei_e && !((*eip)->bei_state & CACHE_ENTRY_LOADING)) {
694 (*eip)->bei_state |= CACHE_ENTRY_LOADING;
697 bdb_cache_entryinfo_unlock( *eip );
700 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, *eip, 0, 0, lock );
701 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
703 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
704 } else if ( rc == 0 ) {
707 u_int32_t locker2 = locker;
709 /* We don't wrap entire read operations in txn's, but
710 * we need our cache entry lock and any DB page locks
711 * to be associated, in order for deadlock detection
712 * to work properly. So if we need to read from the DB,
713 * we use a long-lived per-thread txn for this step.
716 rc = bdb_txn_get( op, bdb->bi_dbenv, <id, 0 );
718 locker2 = TXN_ID( ltid );
722 /* Give up original read lock, obtain write lock with
723 * (possibly) new locker ID.
726 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker2,
729 if ( rc == 0 && !ep) {
730 rc = bdb_id2entry( op->o_bd, ltid, id, &ep );
733 ep->e_private = *eip;
738 #ifdef SLAP_ZONE_ALLOC
739 (*eip)->bei_zseq = *((ber_len_t *)ep - 2);
743 (*eip)->bei_state ^= CACHE_ENTRY_LOADING;
745 /* If we succeeded, downgrade back to a readlock. */
746 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
749 /* Otherwise, release the lock. */
750 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
752 if ( locker2 != locker ) {
753 /* If we're using the per-thread txn, release all
754 * of its page locks now.
757 list.op = DB_LOCK_PUT_ALL;
759 bdb->bi_dbenv->lock_vec( bdb->bi_dbenv, locker2,
761 /* If this txn was deadlocked, we must abort it
762 * and invalidate this per-thread txn.
764 if ( rc == DB_LOCK_DEADLOCK ) {
765 bdb_txn_get( op, bdb->bi_dbenv, <id, 1 );
768 } else if ( !(*eip)->bei_e ) {
769 /* Some other thread is trying to load the entry,
770 * give it a chance to finish.
772 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
773 ldap_pvt_thread_yield();
774 bdb_cache_entryinfo_lock( *eip );
779 /* Check for subtree renames
781 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
783 bdb_cache_entry_db_relock( bdb->bi_dbenv,
784 locker, *eip, 1, 0, lock );
785 /* check again in case other modifier did it already */
786 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
787 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
788 bdb_cache_entry_db_relock( bdb->bi_dbenv,
789 locker, *eip, 0, 0, lock );
798 bdb_cache_entryinfo_unlock( *eip );
801 #ifdef SLAP_ZONE_ALLOC
802 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
804 bdb_entry_return( ep );
810 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
811 bdb->bi_cache.c_cursize++;
812 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
815 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
817 /* If the LRU list has only one entry and this is it, it
818 * doesn't need to be added again.
820 if ( bdb->bi_cache.c_lruhead == bdb->bi_cache.c_lrutail &&
821 bdb->bi_cache.c_lruhead == *eip ) {
822 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
825 /* if entry is on LRU list, remove from old spot */
826 if ( (*eip)->bei_lrunext || (*eip)->bei_lruprev ) {
827 LRU_DELETE( &bdb->bi_cache, *eip );
829 /* lru_mutex is unlocked for us */
830 bdb_cache_lru_add( bdb, locker, *eip );
834 #ifdef SLAP_ZONE_ALLOC
835 if (rc == 0 && (*eip)->bei_e) {
836 slap_zn_rlock(bdb->bi_cache.c_zctx, (*eip)->bei_e);
838 slap_zh_runlock(bdb->bi_cache.c_zctx);
851 if ( BEI(e)->bei_kids ) {
854 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
857 rc = bdb_dn2id_children( op, txn, e );
858 if ( rc == DB_NOTFOUND ) {
859 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
864 /* Update the cache after a successful database Add. */
867 struct bdb_info *bdb,
874 struct berval rdn = e->e_name;
883 /* Lock this entry so that bdb_add can run to completion.
884 * It can only fail if BDB has run out of lock resources.
886 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, &ei, 1, 0, &lock );
888 bdb_cache_entryinfo_unlock( eip );
893 if ( nrdn->bv_len != e->e_nname.bv_len ) {
894 char *ptr = strchr( rdn.bv_val, ',' );
895 rdn.bv_len = ptr - rdn.bv_val;
897 ber_dupbv( &ei.bei_rdn, &rdn );
898 if ( eip->bei_dkids ) eip->bei_dkids++;
901 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
902 /* bdb_csn_commit can cause this when adding the database root entry */
904 new->bei_e->e_private = NULL;
905 #ifdef SLAP_ZONE_ALLOC
906 bdb_entry_return( bdb, new->bei_e, new->bei_zseq );
908 bdb_entry_return( new->bei_e );
913 new->bei_state = CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
914 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
915 if (eip->bei_parent) {
916 eip->bei_parent->bei_state &= ~CACHE_ENTRY_NO_GRANDKIDS;
918 bdb_cache_entryinfo_unlock( eip );
920 ++bdb->bi_cache.c_cursize;
921 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
924 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
926 /* lru_mutex is unlocked for us */
927 bdb_cache_lru_add( bdb, locker, new );
940 EntryInfo *ei = BEI(e);
942 /* Get write lock on data */
943 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
945 /* If we've done repeated mods on a cached entry, then e_attrs
946 * is no longer contiguous with the entry, and must be freed.
949 if ( (void *)e->e_attrs != (void *)(e+1) ) {
950 attrs_free( e->e_attrs );
952 e->e_attrs = newAttrs;
958 * Change the rdn in the entryinfo. Also move to a new parent if needed.
970 EntryInfo *ei = BEI(e), *pei;
974 /* Get write lock on data */
975 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
978 /* If we've done repeated mods on a cached entry, then e_attrs
979 * is no longer contiguous with the entry, and must be freed.
981 if ( (void *)e->e_attrs != (void *)(e+1) ) {
982 attrs_free( e->e_attrs );
984 e->e_attrs = new->e_attrs;
985 if( e->e_nname.bv_val < e->e_bv.bv_val ||
986 e->e_nname.bv_val > e->e_bv.bv_val + e->e_bv.bv_len )
988 ch_free(e->e_name.bv_val);
989 ch_free(e->e_nname.bv_val);
991 e->e_name = new->e_name;
992 e->e_nname = new->e_nname;
994 /* Lock the parent's kids AVL tree */
995 pei = ei->bei_parent;
996 bdb_cache_entryinfo_lock( pei );
997 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
998 free( ei->bei_nrdn.bv_val );
999 ber_dupbv( &ei->bei_nrdn, nrdn );
1001 free( ei->bei_rdn.bv_val );
1004 if ( nrdn->bv_len != e->e_nname.bv_len ) {
1005 char *ptr = strchr(rdn.bv_val, ',');
1006 rdn.bv_len = ptr - rdn.bv_val;
1008 ber_dupbv( &ei->bei_rdn, &rdn );
1012 ein = ei->bei_parent;
1014 ei->bei_parent = ein;
1015 bdb_cache_entryinfo_unlock( pei );
1016 bdb_cache_entryinfo_lock( ein );
1020 int max = ei->bei_modrdns;
1021 /* Record the generation number of this change */
1022 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
1023 if ( pei->bei_modrdns > max ) max = pei->bei_modrdns;
1025 ei->bei_modrdns = max + 1;
1028 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
1029 bdb_cache_entryinfo_unlock( ein );
1033 * cache_delete - delete the entry e from the cache.
1035 * returns: 0 e was deleted ok
1036 * 1 e was not in the cache
1037 * -1 something bad happened
1047 EntryInfo *ei = BEI(e);
1050 assert( e->e_private );
1052 /* Set this early, warn off any queriers */
1053 ei->bei_state |= CACHE_ENTRY_DELETED;
1055 /* Lock the entry's info */
1056 bdb_cache_entryinfo_lock( ei );
1058 /* Get write lock on the data */
1059 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
1061 /* couldn't lock, undo and give up */
1062 ei->bei_state ^= CACHE_ENTRY_DELETED;
1063 bdb_cache_entryinfo_unlock( ei );
1067 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
1071 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1072 rc = bdb_cache_delete_internal( cache, e->e_private, 1 );
1073 /* free lru mutex */
1074 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1076 /* Leave entry info locked */
1082 bdb_cache_delete_cleanup(
1087 ei->bei_e->e_private = NULL;
1088 #ifdef SLAP_ZONE_ALLOC
1089 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1091 bdb_entry_return( ei->bei_e );
1096 free( ei->bei_nrdn.bv_val );
1097 ei->bei_nrdn.bv_val = NULL;
1099 free( ei->bei_rdn.bv_val );
1100 ei->bei_rdn.bv_val = NULL;
1101 ei->bei_modrdns = 0;
1105 ei->bei_parent = NULL;
1106 ei->bei_kids = NULL;
1107 ei->bei_lruprev = NULL;
1109 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1110 ei->bei_lrunext = cache->c_eifree;
1111 cache->c_eifree = ei;
1112 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1113 bdb_cache_entryinfo_unlock( ei );
1117 bdb_cache_delete_internal(
1122 int rc = 0; /* return code */
1124 /* set cache write lock */
1125 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1127 /* Lock the parent's kids tree */
1128 bdb_cache_entryinfo_lock( e->bei_parent );
1131 e->bei_parent->bei_ckids--;
1132 if ( decr && e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
1135 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp )
1142 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL ) {
1153 LRU_DELETE( cache, e );
1154 if ( e->bei_e ) cache->c_cursize--;
1156 /* free cache write lock */
1157 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1158 bdb_cache_entryinfo_unlock( e->bei_parent );
1164 bdb_entryinfo_release( void *data )
1166 EntryInfo *ei = (EntryInfo *)data;
1167 if ( ei->bei_kids ) {
1168 avl_free( ei->bei_kids, NULL );
1171 ei->bei_e->e_private = NULL;
1172 #ifdef SLAP_ZONE_ALLOC
1173 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1175 bdb_entry_return( ei->bei_e );
1178 bdb_cache_entryinfo_destroy( ei );
1182 bdb_cache_release_all( Cache *cache )
1184 /* set cache write lock */
1185 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1187 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1189 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1191 avl_free( cache->c_dntree.bei_kids, NULL );
1192 avl_free( cache->c_idtree, bdb_entryinfo_release );
1193 for (;cache->c_eifree;cache->c_eifree = cache->c_lruhead) {
1194 cache->c_lruhead = cache->c_eifree->bei_lrunext;
1195 bdb_cache_entryinfo_destroy(cache->c_eifree);
1197 cache->c_lruhead = NULL;
1198 cache->c_lrutail = NULL;
1200 /* free lru mutex */
1201 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1202 /* free cache write lock */
1203 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1208 bdb_lru_print( Cache *cache )
1212 fprintf( stderr, "LRU queue (head to tail):\n" );
1213 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
1214 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1215 e->bei_nrdn.bv_val, e->bei_id );
1217 fprintf( stderr, "LRU queue (tail to head):\n" );
1218 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
1219 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1220 e->bei_nrdn.bv_val, e->bei_id );
1226 bdb_txn_free( void *key, void *data )
1232 /* Obtain a long-lived transaction for the current thread.
1233 * If reset == 1, remove the current transaction. */
1235 bdb_txn_get( Operation *op, DB_ENV *env, DB_TXN **txn, int reset )
1238 void *ctx, *data = NULL;
1240 /* If no op was provided, try to find the ctx anyway... */
1242 ctx = op->o_threadctx;
1244 ctx = ldap_pvt_thread_pool_context();
1247 /* Shouldn't happen unless we're single-threaded */
1255 return ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1, NULL, NULL );
1258 if ( ldap_pvt_thread_pool_getkey( ctx, ((char *)env)+1, &data, NULL ) ||
1260 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1261 rc = TXN_BEGIN( env, NULL, txn, 0 );
1262 if (rc) ldap_pvt_thread_yield();
1267 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1,
1268 *txn, bdb_txn_free ) ) ) {
1270 Debug( LDAP_DEBUG_ANY, "bdb_txn_get: err %s(%d)\n",
1271 db_strerror(rc), rc, 0 );
1281 #ifdef BDB_REUSE_LOCKERS
1283 bdb_locker_id_free( void *key, void *data )
1286 int lockid = (int) data;
1289 rc = XLOCK_ID_FREE( env, lockid );
1290 if ( rc == EINVAL ) {
1292 Debug( LDAP_DEBUG_ANY,
1293 "bdb_locker_id_free: %d err %s(%d)\n",
1294 lockid, db_strerror(rc), rc );
1295 /* release all locks held by this locker. */
1296 lr.op = DB_LOCK_PUT_ALL;
1298 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1299 XLOCK_ID_FREE( env, lockid );
1304 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
1310 if ( !env || !locker ) return -1;
1312 /* If no op was provided, try to find the ctx anyway... */
1314 ctx = op->o_threadctx;
1316 ctx = ldap_pvt_thread_pool_context();
1319 /* Shouldn't happen unless we're single-threaded */
1325 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1326 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1327 rc = XLOCK_ID( env, &lockid );
1328 if (rc) ldap_pvt_thread_yield();
1333 data = (void *)lockid;
1334 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1335 data, bdb_locker_id_free ) ) ) {
1336 XLOCK_ID_FREE( env, lockid );
1337 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1338 db_strerror(rc), rc, 0 );
1351 bdb_cache_delete_entry(
1352 struct bdb_info *bdb,
1357 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
1358 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, bdb->bi_cache.c_locker, ei, 1, 1, lock ) == 0 )
1360 if ( ei->bei_e && !(ei->bei_state & CACHE_ENTRY_NOT_LINKED )) {
1361 LRU_DELETE( &bdb->bi_cache, ei );
1362 ei->bei_e->e_private = NULL;
1363 #ifdef SLAP_ZONE_ALLOC
1364 bdb_entry_return( bdb, ei->bei_e, ei->bei_zseq );
1366 bdb_entry_return( ei->bei_e );
1369 --bdb->bi_cache.c_cursize;
1371 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
1373 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );