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 #if DB_VERSION_FULL == 0x04020034
42 #define READ_TXN_FLAG ReadFlag
43 static int ReadFlag = DB_TXN_NOT_DURABLE;
45 #define READ_TXN_FLAG 0
49 bdb_cache_entryinfo_new( Cache *cache )
53 if ( cache->c_eifree ) {
54 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
55 if ( cache->c_eifree ) {
57 cache->c_eifree = ei->bei_lrunext;
59 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
62 ei->bei_lrunext = NULL;
65 ei = ch_calloc(1, sizeof(struct bdb_entry_info));
66 ldap_pvt_thread_mutex_init( &ei->bei_kids_mutex );
72 /* Atomically release and reacquire a lock */
74 bdb_cache_entry_db_relock(
89 if ( !lock ) return 0;
91 lockobj.data = &ei->bei_id;
92 lockobj.size = sizeof(ei->bei_id) + 1;
94 list[0].op = DB_LOCK_PUT;
96 list[1].op = DB_LOCK_GET;
98 list[1].mode = rw ? DB_LOCK_WRITE : DB_LOCK_READ;
99 list[1].obj = &lockobj;
100 rc = env->lock_vec(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
103 if (rc && !tryOnly) {
104 Debug( LDAP_DEBUG_TRACE,
105 "bdb_cache_entry_db_relock: entry %ld, rw %d, rc %d\n",
106 ei->bei_id, rw, rc );
108 *lock = list[1].lock;
115 bdb_cache_entry_db_lock( DB_ENV *env, u_int32_t locker, EntryInfo *ei,
116 int rw, int tryOnly, DB_LOCK *lock )
125 if ( !lock ) return 0;
128 db_rw = DB_LOCK_WRITE;
130 db_rw = DB_LOCK_READ;
132 lockobj.data = &ei->bei_id;
133 lockobj.size = sizeof(ei->bei_id) + 1;
135 rc = LOCK_GET(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
136 &lockobj, db_rw, lock);
137 if (rc && !tryOnly) {
138 Debug( LDAP_DEBUG_TRACE,
139 "bdb_cache_entry_db_lock: entry %ld, rw %d, rc %d\n",
140 ei->bei_id, rw, rc );
143 #endif /* NO_THREADS */
147 bdb_cache_entry_db_unlock ( DB_ENV *env, DB_LOCK *lock )
154 if ( !lock ) return 0;
156 rc = LOCK_PUT ( env, lock );
162 bdb_cache_entryinfo_destroy( EntryInfo *e )
164 ldap_pvt_thread_mutex_destroy( &e->bei_kids_mutex );
165 free( e->bei_nrdn.bv_val );
167 free( e->bei_rdn.bv_val );
173 #define LRU_DELETE( cache, ei ) do { \
174 if ( (ei)->bei_lruprev != NULL ) { \
175 (ei)->bei_lruprev->bei_lrunext = (ei)->bei_lrunext; \
177 (cache)->c_lruhead = (ei)->bei_lrunext; \
179 if ( (ei)->bei_lrunext != NULL ) { \
180 (ei)->bei_lrunext->bei_lruprev = (ei)->bei_lruprev; \
182 (cache)->c_lrutail = (ei)->bei_lruprev; \
184 (ei)->bei_lrunext = (ei)->bei_lruprev = NULL; \
187 #define LRU_ADD( cache, ei ) do { \
188 (ei)->bei_lrunext = (cache)->c_lruhead; \
189 if ( (ei)->bei_lrunext != NULL ) { \
190 (ei)->bei_lrunext->bei_lruprev = (ei); \
192 (cache)->c_lruhead = (ei); \
193 (ei)->bei_lruprev = NULL; \
194 if ( (cache)->c_lrutail == NULL ) { \
195 (cache)->c_lrutail = (ei); \
199 /* Do a length-ordered sort on normalized RDNs */
201 bdb_rdn_cmp( const void *v_e1, const void *v_e2 )
203 const EntryInfo *e1 = v_e1, *e2 = v_e2;
204 int rc = e1->bei_nrdn.bv_len - e2->bei_nrdn.bv_len;
206 rc = strncmp( e1->bei_nrdn.bv_val, e2->bei_nrdn.bv_val,
207 e1->bei_nrdn.bv_len );
213 bdb_id_cmp( const void *v_e1, const void *v_e2 )
215 const EntryInfo *e1 = v_e1, *e2 = v_e2;
216 return e1->bei_id - e2->bei_id;
219 /* Create an entryinfo in the cache. Caller must release the locks later.
222 bdb_entryinfo_add_internal(
223 struct bdb_info *bdb,
227 EntryInfo *ei2 = NULL;
231 ei2 = bdb_cache_entryinfo_new( &bdb->bi_cache );
233 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
234 bdb_cache_entryinfo_lock( ei->bei_parent );
236 ei2->bei_id = ei->bei_id;
237 ei2->bei_parent = ei->bei_parent;
239 ei2->bei_rdn = ei->bei_rdn;
241 #ifdef SLAP_ZONE_ALLOC
245 /* Add to cache ID tree */
246 if (avl_insert( &bdb->bi_cache.c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
248 eix = avl_find( bdb->bi_cache.c_idtree, ei2, bdb_id_cmp );
249 bdb_cache_entryinfo_destroy( ei2 );
252 /* It got freed above because its value was
255 ei->bei_rdn.bv_val = NULL;
258 bdb->bi_cache.c_eiused++;
259 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
261 /* This is a new leaf node. But if parent had no kids, then it was
262 * a leaf and we would be decrementing that. So, only increment if
263 * the parent already has kids.
265 if ( ei->bei_parent->bei_kids || !ei->bei_parent->bei_id )
266 bdb->bi_cache.c_leaves++;
267 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
270 ei->bei_parent->bei_ckids++;
278 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
279 * the info for its closest ancestor. *res should be NULL to process a
280 * complete DN starting from the tree root. Otherwise *res must be the
281 * immediate parent of the requested DN, and only the RDN will be searched.
282 * The EntryInfo is locked upon return and must be unlocked by the caller.
291 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
292 EntryInfo ei, *eip, *ei2;
296 /* this function is always called with normalized DN */
298 /* we're doing a onelevel search for an RDN */
299 ei.bei_nrdn.bv_val = ndn->bv_val;
300 ei.bei_nrdn.bv_len = dn_rdnlen( op->o_bd, ndn );
303 /* we're searching a full DN from the root */
304 ptr = ndn->bv_val + ndn->bv_len - op->o_bd->be_nsuffix[0].bv_len;
305 ei.bei_nrdn.bv_val = ptr;
306 ei.bei_nrdn.bv_len = op->o_bd->be_nsuffix[0].bv_len;
307 /* Skip to next rdn if suffix is empty */
308 if ( ei.bei_nrdn.bv_len == 0 ) {
309 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
310 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
311 if ( ptr >= ndn->bv_val ) {
312 if (DN_SEPARATOR(*ptr)) ptr++;
313 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr;
314 ei.bei_nrdn.bv_val = ptr;
317 eip = &bdb->bi_cache.c_dntree;
320 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
322 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
324 int len = ei.bei_nrdn.bv_len;
326 if ( BER_BVISEMPTY( ndn )) {
331 ei.bei_nrdn.bv_len = ndn->bv_len -
332 (ei.bei_nrdn.bv_val - ndn->bv_val);
333 bdb_cache_entryinfo_unlock( eip );
335 rc = bdb_dn2id( op, txn, &ei.bei_nrdn, &ei );
337 bdb_cache_entryinfo_lock( eip );
342 /* DN exists but needs to be added to cache */
343 ei.bei_nrdn.bv_len = len;
344 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2 );
345 /* add_internal left eip and c_rwlock locked */
346 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
351 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
352 /* In the midst of deleting? Give it a chance to
355 bdb_cache_entryinfo_unlock( eip );
356 ldap_pvt_thread_yield();
357 bdb_cache_entryinfo_lock( eip );
361 bdb_cache_entryinfo_unlock( eip );
362 bdb_cache_entryinfo_lock( ei2 );
366 /* Advance to next lower RDN */
367 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
368 && !DN_SEPARATOR(*ptr); ptr--) /* empty */;
369 if ( ptr >= ndn->bv_val ) {
370 if (DN_SEPARATOR(*ptr)) ptr++;
371 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
372 ei.bei_nrdn.bv_val = ptr;
374 if ( ptr < ndn->bv_val ) {
384 /* Walk up the tree from a child node, looking for an ID that's already
385 * been linked into the cache.
388 hdb_cache_find_parent(
395 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
396 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
405 rc = hdb_dn2id_parent( op, txn, locker, &ei, &eip.bei_id );
408 /* Save the previous node, if any */
411 /* Create a new node for the current ID */
412 ein = bdb_cache_entryinfo_new( &bdb->bi_cache );
413 ein->bei_id = ei.bei_id;
414 ein->bei_kids = ei.bei_kids;
415 ein->bei_nrdn = ei.bei_nrdn;
416 ein->bei_rdn = ei.bei_rdn;
417 ein->bei_ckids = ei.bei_ckids;
418 #ifdef SLAP_ZONE_ALLOC
423 /* This node is not fully connected yet */
424 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
426 /* Insert this node into the ID tree */
427 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
428 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
429 bdb_id_cmp, avl_dup_error ) ) {
431 /* Someone else created this node just before us.
432 * Free our new copy and use the existing one.
434 bdb_cache_entryinfo_destroy( ein );
435 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
436 (caddr_t) &ei, bdb_id_cmp );
438 /* Link in any kids we've already processed */
440 bdb_cache_entryinfo_lock( ein );
441 avl_insert( &ein->bei_kids, (caddr_t)ei2,
442 bdb_rdn_cmp, avl_dup_error );
444 bdb_cache_entryinfo_unlock( ein );
450 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
451 LRU_ADD( &bdb->bi_cache, ein );
452 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
456 /* If this is the first time, save this node
457 * to be returned later.
459 if ( eir == NULL ) eir = ein;
461 /* If there was a previous node, link it to this one */
462 if ( ei2 ) ei2->bei_parent = ein;
464 /* Look for this node's parent */
466 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
467 (caddr_t) &eip, bdb_id_cmp );
469 ei2 = &bdb->bi_cache.c_dntree;
471 bdb->bi_cache.c_eiused++;
472 if ( ei2 && ( ei2->bei_kids || !ei2->bei_id ))
473 bdb->bi_cache.c_leaves++;
474 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
476 /* Got the parent, link in and we're done. */
478 bdb_cache_entryinfo_lock( ei2 );
479 ein->bei_parent = ei2;
480 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
483 bdb_cache_entryinfo_unlock( ei2 );
484 bdb_cache_entryinfo_lock( eir );
486 /* Reset all the state info */
487 for (ein = eir; ein != ei2; ein=ein->bei_parent)
488 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
493 ei.bei_id = eip.bei_id;
495 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
501 /* Used by hdb_dn2idl when loading the EntryInfo for all the children
505 struct bdb_info *bdb,
512 /* See if we already have this one */
513 bdb_cache_entryinfo_lock( ei->bei_parent );
514 ei2 = (EntryInfo *)avl_find( ei->bei_parent->bei_kids, ei, bdb_rdn_cmp );
515 bdb_cache_entryinfo_unlock( ei->bei_parent );
518 /* Not found, add it */
521 /* bei_rdn was not malloc'd before, do it now */
522 ber_dupbv( &bv, &ei->bei_rdn );
525 rc = bdb_entryinfo_add_internal( bdb, ei, res );
526 bdb_cache_entryinfo_unlock( ei->bei_parent );
527 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
529 /* Found, return it */
537 /* caller must have lru_mutex locked. mutex
538 * will be unlocked on return.
542 struct bdb_info *bdb,
546 DB_LOCK lock, *lockp;
554 /* See if we're above the cache size limit */
555 if ( bdb->bi_cache.c_cursize > bdb->bi_cache.c_maxsize ) {
556 EntryInfo *elru, *elprev;
559 /* Look for an unused entry to remove */
560 for (elru = bdb->bi_cache.c_lrutail; elru; elru = elprev, i++ ) {
561 elprev = elru->bei_lruprev;
563 /* Too many probes, not enough idle, give up */
567 /* If we can successfully writelock it, then
568 * the object is idle.
570 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv,
571 bdb->bi_cache.c_locker, elru, 1, 1, lockp ) == 0 ) {
573 int stop = 0, decr = 0;
575 /* If this node is in the process of linking into the cache,
576 * or this node is being deleted, skip it.
578 if ( elru->bei_state &
579 ( CACHE_ENTRY_NOT_LINKED | CACHE_ENTRY_DELETED )) {
580 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
583 /* Free entry for this node if it's present */
585 elru->bei_e->e_private = NULL;
586 #ifdef SLAP_ZONE_ALLOC
587 bdb_entry_return( bdb, elru->bei_e, elru->bei_zseq );
589 bdb_entry_return( elru->bei_e );
594 /* ITS#4010 if we're in slapcat, and this node is a leaf
597 * FIXME: we need to do this for slapd as well, (which is
598 * why we compute bi_cache.c_leaves now) but at the moment
599 * we can't because it causes unresolvable deadlocks.
601 if ( slapMode & SLAP_TOOL_READONLY ) {
602 if ( !elru->bei_kids ) {
603 /* This does LRU_DELETE for us */
604 bdb_cache_delete_internal( &bdb->bi_cache, elru, 0 );
605 bdb_cache_delete_cleanup( &bdb->bi_cache, elru );
607 /* Leave node on LRU list for a future pass */
609 LRU_DELETE( &bdb->bi_cache, elru );
611 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lockp );
613 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
615 --bdb->bi_cache.c_cursize;
616 if (bdb->bi_cache.c_cursize <= bdb->bi_cache.c_maxsize)
618 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
623 LRU_ADD( &bdb->bi_cache, ei );
624 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
629 struct bdb_info *bdb,
632 EntryInfo ei = { 0 },
637 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
638 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
639 (caddr_t) &ei, bdb_id_cmp );
640 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
645 * cache_find_id - find an entry in the cache, given id.
646 * The entry is locked for Read upon return. Call with islocked TRUE if
647 * the supplied *eip was already locked.
660 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
662 int rc = 0, load = 0;
663 EntryInfo ei = { 0 };
667 #ifdef SLAP_ZONE_ALLOC
668 slap_zh_rlock(bdb->bi_cache.c_zctx);
670 /* If we weren't given any info, see if we have it already cached */
672 again: ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
673 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
674 (caddr_t) &ei, bdb_id_cmp );
676 /* If the lock attempt fails, the info is in use */
677 if ( ldap_pvt_thread_mutex_trylock(
678 &(*eip)->bei_kids_mutex )) {
679 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
680 /* If this node is being deleted, treat
681 * as if the delete has already finished
683 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
686 /* otherwise, wait for the info to free up */
687 ldap_pvt_thread_yield();
690 /* If this info isn't hooked up to its parent yet,
691 * unlock and wait for it to be fully initialized
693 if ( (*eip)->bei_state & CACHE_ENTRY_NOT_LINKED ) {
694 bdb_cache_entryinfo_unlock( *eip );
695 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
696 ldap_pvt_thread_yield();
701 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
704 /* See if the ID exists in the database; add it to the cache if so */
707 rc = bdb_id2entry( op->o_bd, tid, id, &ep );
709 rc = bdb_cache_find_ndn( op, tid,
711 if ( *eip ) islocked = 1;
713 #ifdef SLAP_ZONE_ALLOC
714 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
716 bdb_entry_return( ep );
722 rc = hdb_cache_find_parent(op, tid, locker, id, eip );
723 if ( rc == 0 && *eip ) islocked = 1;
727 /* Ok, we found the info, do we have the entry? */
728 if ( *eip && rc == 0 ) {
729 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
732 /* Make sure only one thread tries to load the entry */
734 #ifdef SLAP_ZONE_ALLOC
735 if ((*eip)->bei_e && !slap_zn_validate(
736 bdb->bi_cache.c_zctx, (*eip)->bei_e, (*eip)->bei_zseq)) {
737 (*eip)->bei_e = NULL;
738 (*eip)->bei_zseq = 0;
741 if ( !(*eip)->bei_e && !((*eip)->bei_state & CACHE_ENTRY_LOADING)) {
743 (*eip)->bei_state |= CACHE_ENTRY_LOADING;
746 bdb_cache_entryinfo_unlock( *eip );
749 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, *eip, 0, 0, lock );
750 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
752 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
753 } else if ( rc == 0 ) {
756 u_int32_t locker2 = locker;
758 /* We don't wrap entire read operations in txn's, but
759 * we need our cache entry lock and any DB page locks
760 * to be associated, in order for deadlock detection
761 * to work properly. So if we need to read from the DB,
762 * we use a long-lived per-thread txn for this step.
765 rc = bdb_txn_get( op, bdb->bi_dbenv, <id, 0 );
767 locker2 = TXN_ID( ltid );
771 /* Give up original read lock, obtain write lock with
772 * (possibly) new locker ID.
775 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker2,
778 if ( rc == 0 && !ep) {
779 rc = bdb_id2entry( op->o_bd, ltid, id, &ep );
782 ep->e_private = *eip;
787 #ifdef SLAP_ZONE_ALLOC
788 (*eip)->bei_zseq = *((ber_len_t *)ep - 2);
792 (*eip)->bei_state ^= CACHE_ENTRY_LOADING;
794 /* If we succeeded, downgrade back to a readlock. */
795 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
798 /* Otherwise, release the lock. */
799 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
801 if ( locker2 != locker ) {
802 /* If we're using the per-thread txn, release all
803 * of its page locks now.
806 list.op = DB_LOCK_PUT_ALL;
808 bdb->bi_dbenv->lock_vec( bdb->bi_dbenv, locker2,
810 /* If this txn was deadlocked, we must abort it
811 * and invalidate this per-thread txn.
813 if ( rc == DB_LOCK_DEADLOCK ) {
814 bdb_txn_get( op, bdb->bi_dbenv, <id, 1 );
817 } else if ( !(*eip)->bei_e ) {
818 /* Some other thread is trying to load the entry,
819 * give it a chance to finish.
821 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
822 ldap_pvt_thread_yield();
823 bdb_cache_entryinfo_lock( *eip );
828 /* Check for subtree renames
830 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
832 bdb_cache_entry_db_relock( bdb->bi_dbenv,
833 locker, *eip, 1, 0, lock );
834 /* check again in case other modifier did it already */
835 if ( bdb_fix_dn( (*eip)->bei_e, 1 ) )
836 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
837 bdb_cache_entry_db_relock( bdb->bi_dbenv,
838 locker, *eip, 0, 0, lock );
847 bdb_cache_entryinfo_unlock( *eip );
850 #ifdef SLAP_ZONE_ALLOC
851 bdb_entry_return( bdb, ep, (*eip)->bei_zseq );
853 bdb_entry_return( ep );
859 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
860 bdb->bi_cache.c_cursize++;
861 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
864 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
866 /* If the LRU list has only one entry and this is it, it
867 * doesn't need to be added again.
869 if ( bdb->bi_cache.c_lruhead == bdb->bi_cache.c_lrutail &&
870 bdb->bi_cache.c_lruhead == *eip ) {
871 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
874 /* if entry is on LRU list, remove from old spot */
875 if ( (*eip)->bei_lrunext || (*eip)->bei_lruprev ) {
876 LRU_DELETE( &bdb->bi_cache, *eip );
878 /* lru_mutex is unlocked for us */
879 bdb_cache_lru_add( bdb, locker, *eip );
883 #ifdef SLAP_ZONE_ALLOC
884 if (rc == 0 && (*eip)->bei_e) {
885 slap_zn_rlock(bdb->bi_cache.c_zctx, (*eip)->bei_e);
887 slap_zh_runlock(bdb->bi_cache.c_zctx);
900 if ( BEI(e)->bei_kids ) {
903 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
906 rc = bdb_dn2id_children( op, txn, e );
907 if ( rc == DB_NOTFOUND ) {
908 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
913 /* Update the cache after a successful database Add. */
916 struct bdb_info *bdb,
926 struct berval rdn = e->e_name;
934 /* Lock this entry so that bdb_add can run to completion.
935 * It can only fail if BDB has run out of lock resources.
937 rc = bdb_cache_entry_db_lock( bdb->bi_dbenv, locker, &ei, 1, 0, &lock );
939 bdb_cache_entryinfo_unlock( eip );
944 if ( nrdn->bv_len != e->e_nname.bv_len ) {
945 char *ptr = strchr( rdn.bv_val, ',' );
946 rdn.bv_len = ptr - rdn.bv_val;
948 ber_dupbv( &ei.bei_rdn, &rdn );
949 if ( eip->bei_dkids ) eip->bei_dkids++;
952 rc = bdb_entryinfo_add_internal( bdb, &ei, &new );
953 /* bdb_csn_commit can cause this when adding the database root entry */
955 new->bei_e->e_private = NULL;
956 #ifdef SLAP_ZONE_ALLOC
957 bdb_entry_return( bdb, new->bei_e, new->bei_zseq );
959 bdb_entry_return( new->bei_e );
964 new->bei_state = CACHE_ENTRY_NO_KIDS | CACHE_ENTRY_NO_GRANDKIDS;
965 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
966 if (eip->bei_parent) {
967 eip->bei_parent->bei_state &= ~CACHE_ENTRY_NO_GRANDKIDS;
969 bdb_cache_entryinfo_unlock( eip );
971 ++bdb->bi_cache.c_cursize;
972 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
975 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
977 /* lru_mutex is unlocked for us */
978 bdb_cache_lru_add( bdb, locker, new );
991 EntryInfo *ei = BEI(e);
993 /* Get write lock on data */
994 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
996 /* If we've done repeated mods on a cached entry, then e_attrs
997 * is no longer contiguous with the entry, and must be freed.
1000 if ( (void *)e->e_attrs != (void *)(e+1) ) {
1001 attrs_free( e->e_attrs );
1003 e->e_attrs = newAttrs;
1009 * Change the rdn in the entryinfo. Also move to a new parent if needed.
1013 struct bdb_info *bdb,
1015 struct berval *nrdn,
1021 EntryInfo *ei = BEI(e), *pei;
1027 /* Get write lock on data */
1028 rc = bdb_cache_entry_db_relock( bdb->bi_dbenv, locker, ei, 1, 0, lock );
1029 if ( rc ) return rc;
1031 /* If we've done repeated mods on a cached entry, then e_attrs
1032 * is no longer contiguous with the entry, and must be freed.
1034 if ( (void *)e->e_attrs != (void *)(e+1) ) {
1035 attrs_free( e->e_attrs );
1037 e->e_attrs = new->e_attrs;
1038 if( e->e_nname.bv_val < e->e_bv.bv_val ||
1039 e->e_nname.bv_val > e->e_bv.bv_val + e->e_bv.bv_len )
1041 ch_free(e->e_name.bv_val);
1042 ch_free(e->e_nname.bv_val);
1044 e->e_name = new->e_name;
1045 e->e_nname = new->e_nname;
1047 /* Lock the parent's kids AVL tree */
1048 pei = ei->bei_parent;
1049 bdb_cache_entryinfo_lock( pei );
1050 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
1051 free( ei->bei_nrdn.bv_val );
1052 ber_dupbv( &ei->bei_nrdn, nrdn );
1054 free( ei->bei_rdn.bv_val );
1057 if ( nrdn->bv_len != e->e_nname.bv_len ) {
1058 char *ptr = strchr(rdn.bv_val, ',');
1059 rdn.bv_len = ptr - rdn.bv_val;
1061 ber_dupbv( &ei->bei_rdn, &rdn );
1065 ein = ei->bei_parent;
1067 ei->bei_parent = ein;
1068 bdb_cache_entryinfo_unlock( pei );
1069 bdb_cache_entryinfo_lock( ein );
1073 /* Record the generation number of this change */
1074 ldap_pvt_thread_mutex_lock( &bdb->bi_modrdns_mutex );
1076 ei->bei_modrdns = bdb->bi_modrdns;
1077 ldap_pvt_thread_mutex_unlock( &bdb->bi_modrdns_mutex );
1080 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
1081 bdb_cache_entryinfo_unlock( ein );
1085 * cache_delete - delete the entry e from the cache.
1087 * returns: 0 e was deleted ok
1088 * 1 e was not in the cache
1089 * -1 something bad happened
1099 EntryInfo *ei = BEI(e);
1102 assert( e->e_private != NULL );
1104 /* Set this early, warn off any queriers */
1105 ei->bei_state |= CACHE_ENTRY_DELETED;
1107 /* Lock the entry's info */
1108 bdb_cache_entryinfo_lock( ei );
1110 /* Get write lock on the data */
1111 rc = bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
1113 /* couldn't lock, undo and give up */
1114 ei->bei_state ^= CACHE_ENTRY_DELETED;
1115 bdb_cache_entryinfo_unlock( ei );
1119 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
1123 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1125 /* set cache write lock */
1126 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1128 rc = bdb_cache_delete_internal( cache, e->e_private, 1 );
1130 /* free cache write lock */
1131 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1133 /* free lru mutex */
1134 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1136 /* Leave entry info locked */
1142 bdb_cache_delete_cleanup(
1147 ei->bei_e->e_private = NULL;
1148 #ifdef SLAP_ZONE_ALLOC
1149 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1151 bdb_entry_return( ei->bei_e );
1156 free( ei->bei_nrdn.bv_val );
1157 ei->bei_nrdn.bv_val = NULL;
1159 free( ei->bei_rdn.bv_val );
1160 ei->bei_rdn.bv_val = NULL;
1161 ei->bei_modrdns = 0;
1165 ei->bei_parent = NULL;
1166 ei->bei_kids = NULL;
1167 ei->bei_lruprev = NULL;
1169 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1170 ei->bei_lrunext = cache->c_eifree;
1171 cache->c_eifree = ei;
1172 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1173 bdb_cache_entryinfo_unlock( ei );
1177 bdb_cache_delete_internal(
1182 int rc = 0; /* return code */
1184 /* Lock the parent's kids tree */
1185 bdb_cache_entryinfo_lock( e->bei_parent );
1188 e->bei_parent->bei_ckids--;
1189 if ( decr && e->bei_parent->bei_dkids ) e->bei_parent->bei_dkids--;
1192 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp )
1197 if ( e->bei_parent->bei_kids )
1201 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL ) {
1209 LRU_DELETE( cache, e );
1210 if ( e->bei_e ) cache->c_cursize--;
1213 bdb_cache_entryinfo_unlock( e->bei_parent );
1219 bdb_entryinfo_release( void *data )
1221 EntryInfo *ei = (EntryInfo *)data;
1222 if ( ei->bei_kids ) {
1223 avl_free( ei->bei_kids, NULL );
1226 ei->bei_e->e_private = NULL;
1227 #ifdef SLAP_ZONE_ALLOC
1228 bdb_entry_return( ei->bei_bdb, ei->bei_e, ei->bei_zseq );
1230 bdb_entry_return( ei->bei_e );
1233 bdb_cache_entryinfo_destroy( ei );
1237 bdb_cache_release_all( Cache *cache )
1239 /* set cache write lock */
1240 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
1242 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
1244 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
1246 avl_free( cache->c_dntree.bei_kids, NULL );
1247 avl_free( cache->c_idtree, bdb_entryinfo_release );
1248 for (;cache->c_eifree;cache->c_eifree = cache->c_lruhead) {
1249 cache->c_lruhead = cache->c_eifree->bei_lrunext;
1250 bdb_cache_entryinfo_destroy(cache->c_eifree);
1252 cache->c_cursize = 0;
1253 cache->c_eiused = 0;
1254 cache->c_leaves = 0;
1255 cache->c_idtree = NULL;
1256 cache->c_lruhead = NULL;
1257 cache->c_lrutail = NULL;
1258 cache->c_dntree.bei_kids = NULL;
1260 /* free lru mutex */
1261 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
1262 /* free cache write lock */
1263 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
1268 bdb_lru_print( Cache *cache )
1272 fprintf( stderr, "LRU queue (head to tail):\n" );
1273 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
1274 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1275 e->bei_nrdn.bv_val, e->bei_id );
1277 fprintf( stderr, "LRU queue (tail to head):\n" );
1278 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
1279 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
1280 e->bei_nrdn.bv_val, e->bei_id );
1286 bdb_txn_free( void *key, void *data )
1292 /* Obtain a long-lived transaction for the current thread.
1293 * If reset == 1, remove the current transaction. */
1295 bdb_txn_get( Operation *op, DB_ENV *env, DB_TXN **txn, int reset )
1298 void *ctx, *data = NULL;
1300 if ( slapMode & SLAP_TOOL_MODE ) {
1305 /* If no op was provided, try to find the ctx anyway... */
1307 ctx = op->o_threadctx;
1309 ctx = ldap_pvt_thread_pool_context();
1312 /* Shouldn't happen unless we're single-threaded */
1320 return ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1, NULL, NULL );
1323 if ( ldap_pvt_thread_pool_getkey( ctx, ((char *)env)+1, &data, NULL ) ||
1325 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1326 rc = TXN_BEGIN( env, NULL, txn, READ_TXN_FLAG );
1327 #if DB_VERSION_FULL == 0x04020034
1328 if ( rc == EINVAL && READ_TXN_FLAG ) {
1330 Debug( LDAP_DEBUG_ANY,
1331 "bdb_txn_get: BerkeleyDB 4.2.52 library needs TXN patch!\n",
1337 if (rc) ldap_pvt_thread_yield();
1342 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, ((char *)env)+1,
1343 *txn, bdb_txn_free ) ) ) {
1345 Debug( LDAP_DEBUG_ANY, "bdb_txn_get: err %s(%d)\n",
1346 db_strerror(rc), rc, 0 );
1356 #ifdef BDB_REUSE_LOCKERS
1358 bdb_locker_id_free( void *key, void *data )
1361 u_int32_t lockid = (long)data;
1364 rc = XLOCK_ID_FREE( env, lockid );
1365 if ( rc == EINVAL ) {
1367 Debug( LDAP_DEBUG_ANY,
1368 "bdb_locker_id_free: %lu err %s(%d)\n",
1369 (unsigned long) lockid, db_strerror(rc), rc );
1370 /* release all locks held by this locker. */
1371 lr.op = DB_LOCK_PUT_ALL;
1373 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
1374 XLOCK_ID_FREE( env, lockid );
1379 bdb_locker_id( Operation *op, DB_ENV *env, u_int32_t *locker )
1386 if ( !env || !locker ) return -1;
1388 /* If no op was provided, try to find the ctx anyway... */
1390 ctx = op->o_threadctx;
1392 ctx = ldap_pvt_thread_pool_context();
1395 /* Shouldn't happen unless we're single-threaded */
1401 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
1402 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
1403 rc = XLOCK_ID( env, &lockid );
1404 if (rc) ldap_pvt_thread_yield();
1409 data = (void *)((long)lockid);
1410 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
1411 data, bdb_locker_id_free ) ) ) {
1412 XLOCK_ID_FREE( env, lockid );
1413 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1414 db_strerror(rc), rc, 0 );
1419 lockid = (long)data;
1424 #endif /* BDB_REUSE_LOCKERS */
1427 bdb_cache_delete_entry(
1428 struct bdb_info *bdb,
1433 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
1434 if ( bdb_cache_entry_db_lock( bdb->bi_dbenv, bdb->bi_cache.c_locker, ei, 1, 1, lock ) == 0 )
1436 if ( ei->bei_e && !(ei->bei_state & CACHE_ENTRY_NOT_LINKED )) {
1437 LRU_DELETE( &bdb->bi_cache, ei );
1438 ei->bei_e->e_private = NULL;
1439 #ifdef SLAP_ZONE_ALLOC
1440 bdb_entry_return( bdb, ei->bei_e, ei->bei_zseq );
1442 bdb_entry_return( ei->bei_e );
1445 --bdb->bi_cache.c_cursize;
1447 bdb_cache_entry_db_unlock( bdb->bi_dbenv, lock );
1449 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );