1 /* cache.c - routines to maintain an in-core cache of entries */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/string.h>
14 #include <ac/socket.h>
20 static int bdb_cache_delete_internal(Cache *cache, EntryInfo *e);
22 static void bdb_lru_print(Cache *cache);
26 bdb_cache_entryinfo_new( )
30 ei = ch_calloc(1, sizeof(struct bdb_entry_info));
31 ldap_pvt_thread_mutex_init( &ei->bei_kids_mutex );
36 /* Atomically release and reacquire a lock */
38 bdb_cache_entry_db_relock(
53 if ( !lock ) return 0;
56 lockobj.size = sizeof(ei->bei_parent) + sizeof(ei->bei_id);
58 list[0].op = DB_LOCK_PUT;
60 list[1].op = DB_LOCK_GET;
62 list[1].mode = rw ? DB_LOCK_WRITE : DB_LOCK_READ;
63 list[1].obj = &lockobj;
64 rc = env->lock_vec(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
69 LDAP_LOG( CACHE, DETAIL1,
70 "bdb_cache_entry_db_relock: entry %d, rw %d, rc %d\n",
73 Debug( LDAP_DEBUG_TRACE,
74 "bdb_cache_entry_db_relock: entry %d, rw %d, rc %d\n",
84 bdb_cache_entry_db_lock
85 ( DB_ENV *env, u_int32_t locker, EntryInfo *ei, int rw, int tryOnly, DB_LOCK *lock )
94 if ( !lock ) return 0;
97 db_rw = DB_LOCK_WRITE;
102 lockobj.size = sizeof(ei->bei_parent) + sizeof(ei->bei_id);
104 rc = LOCK_GET(env, locker, tryOnly ? DB_LOCK_NOWAIT : 0,
105 &lockobj, db_rw, lock);
108 LDAP_LOG( CACHE, DETAIL1,
109 "bdb_cache_entry_db_lock: entry %d, rw %d, rc %d\n",
110 ei->bei_id, rw, rc );
112 Debug( LDAP_DEBUG_TRACE,
113 "bdb_cache_entry_db_lock: entry %d, rw %d, rc %d\n",
114 ei->bei_id, rw, rc );
118 #endif /* NO_THREADS */
122 bdb_cache_entry_db_unlock
123 ( DB_ENV *env, DB_LOCK *lock )
130 rc = LOCK_PUT ( env, lock );
136 bdb_cache_entryinfo_destroy( EntryInfo *e )
138 ldap_pvt_thread_mutex_destroy( &e->bei_kids_mutex );
139 free( e->bei_nrdn.bv_val );
141 free( e->bei_rdn.bv_val );
147 #define LRU_DELETE( cache, ei ) do { \
148 if ( (ei)->bei_lruprev != NULL ) { \
149 (ei)->bei_lruprev->bei_lrunext = (ei)->bei_lrunext; \
151 (cache)->c_lruhead = (ei)->bei_lrunext; \
153 if ( (ei)->bei_lrunext != NULL ) { \
154 (ei)->bei_lrunext->bei_lruprev = (ei)->bei_lruprev; \
156 (cache)->c_lrutail = (ei)->bei_lruprev; \
160 #define LRU_ADD( cache, ei ) do { \
161 (ei)->bei_lrunext = (cache)->c_lruhead; \
162 if ( (ei)->bei_lrunext != NULL ) { \
163 (ei)->bei_lrunext->bei_lruprev = (ei); \
165 (cache)->c_lruhead = (ei); \
166 (ei)->bei_lruprev = NULL; \
167 if ( (cache)->c_lrutail == NULL ) { \
168 (cache)->c_lrutail = (ei); \
172 /* Do a lexical sort on normalized RDNs */
174 bdb_rdn_cmp( const void *v_e1, const void *v_e2 )
176 const EntryInfo *e1 = v_e1, *e2 = v_e2;
177 int rc = strncmp( e1->bei_nrdn.bv_val, e2->bei_nrdn.bv_val, e1->bei_nrdn.bv_len );
178 if (rc == 0) rc = e1->bei_nrdn.bv_len - e2->bei_nrdn.bv_len;
183 bdb_id_cmp( const void *v_e1, const void *v_e2 )
185 const EntryInfo *e1 = v_e1, *e2 = v_e2;
186 return e1->bei_id - e2->bei_id;
189 /* Create an entryinfo in the cache. Caller must release the locks later.
192 bdb_entryinfo_add_internal(
193 struct bdb_info *bdb,
199 Cache *cache = &bdb->bi_cache;
200 DB_ENV *env = bdb->bi_dbenv;
201 EntryInfo *ei2 = NULL;
209 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
210 bdb_cache_entryinfo_lock( ei->bei_parent );
212 /* if parent was previously considered a leaf node,
213 * it was on the LRU list. Now it's going to have
214 * kids, take it off the LRU list.
216 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
217 if ( ei->bei_parent->bei_id && !ei->bei_parent->bei_kids ) {
218 LRU_DELETE( cache, ei->bei_parent );
222 cache->c_cursize += incr;
224 /* See if we're above the cache size limit */
225 if ( cache->c_cursize > cache->c_maxsize ) {
226 EntryInfo *elru, *elprev;
229 /* Look for an unused entry to remove */
230 for (elru = cache->c_lrutail; elru; elru = elprev, i++ ) {
231 elprev = elru->bei_lruprev;
233 /* Too many probes, not enough idle, give up */
236 /* If we can successfully writelock it, then
237 * the object is idle.
239 if ( bdb_cache_entry_db_lock( env, locker, elru, 1, 1,
241 /* Need to lock parent to delete child */
242 if ( ldap_pvt_thread_mutex_trylock(
243 &elru->bei_parent->bei_kids_mutex )) {
244 bdb_cache_entry_db_unlock( env, &lock );
247 bdb_cache_delete_internal( cache, elru );
248 bdb_cache_entryinfo_unlock( elru->bei_parent );
249 elru->bei_e->e_private = NULL;
250 bdb_entry_return( elru->bei_e );
251 bdb_cache_entry_db_unlock( env, &lock );
253 bdb_cache_entryinfo_destroy( elru );
255 /* re-use this one */
256 ch_free(elru->bei_nrdn.bv_val);
257 elru->bei_nrdn.bv_val = NULL;
259 elru->bei_kids = NULL;
260 elru->bei_lrunext = NULL;
261 elru->bei_lruprev = NULL;
264 elru->bei_modrdns = 0;
268 if (cache->c_cursize < cache->c_maxsize)
274 ei2 = bdb_cache_entryinfo_new();
276 ei2->bei_id = ei->bei_id;
277 ei2->bei_parent = ei->bei_parent;
279 ei2->bei_rdn = ei->bei_rdn;
282 /* Add to cache ID tree */
283 if (avl_insert( &cache->c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
285 eix = avl_find( cache->c_idtree, ei2, bdb_id_cmp );
286 bdb_cache_entryinfo_destroy( ei2 );
289 cache->c_cursize -= incr;
291 if ( ei->bei_rdn.bv_val )
292 ber_memfree_x( ei->bei_rdn.bv_val, NULL );
295 LRU_ADD( cache, ei2 );
296 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
300 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
304 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
310 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
311 * the info for its closest ancestor. *res should be NULL to process a
312 * complete DN starting from the tree root. Otherwise *res must be the
313 * immediate parent of the requested DN, and only the RDN will be searched.
314 * The EntryInfo is locked upon return and must be unlocked by the caller.
326 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
327 EntryInfo ei, *eip, *ei2;
331 /* this function is always called with normalized DN */
333 /* we're doing a onelevel search for an RDN */
334 ei.bei_nrdn.bv_val = ndn->bv_val;
335 ei.bei_nrdn.bv_len = dn_rdnlen( be, ndn );
338 /* we're searching a full DN from the root */
339 ptr = ndn->bv_val + ndn->bv_len - be->be_nsuffix[0].bv_len;
340 ei.bei_nrdn.bv_val = ptr;
341 ei.bei_nrdn.bv_len = be->be_nsuffix[0].bv_len;
342 eip = &bdb->bi_cache.c_dntree;
345 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
347 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
349 int len = ei.bei_nrdn.bv_len;
351 ei.bei_nrdn.bv_len = ndn->bv_len - (ei.bei_nrdn.bv_val - ndn->bv_val);
352 bdb_cache_entryinfo_unlock( eip );
354 rc = bdb_dn2id( be, txn, &ei.bei_nrdn, &ei, ctx );
356 bdb_cache_entryinfo_lock( eip );
361 /* DN exists but needs to be added to cache */
362 ei.bei_nrdn.bv_len = len;
363 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2,
365 /* add_internal left eip and c_rwlock locked */
366 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
371 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
372 /* In the midst of deleting? Give it a chance to
375 bdb_cache_entryinfo_unlock( eip );
376 ldap_pvt_thread_yield();
377 bdb_cache_entryinfo_lock( eip );
381 bdb_cache_entryinfo_unlock( eip );
382 bdb_cache_entryinfo_lock( ei2 );
386 /* Advance to next lower RDN */
387 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
388 && !DN_SEPARATOR(*ptr); ptr--);
389 if ( ptr >= ndn->bv_val ) {
390 if (DN_SEPARATOR(*ptr)) ptr++;
391 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
392 ei.bei_nrdn.bv_val = ptr;
394 if ( ptr < ndn->bv_val ) {
404 /* Walk up the tree from a child node, looking for an ID that's already
405 * been linked into the cache.
408 bdb_cache_find_parent(
416 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
417 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
425 rc = bdb_dn2id_parent( be, txn, &ei, &eip.bei_id, ctx );
428 /* Save the previous node, if any */
431 /* Create a new node for the current ID */
432 ein = bdb_cache_entryinfo_new();
433 ein->bei_id = ei.bei_id;
434 ein->bei_kids = ei.bei_kids;
435 ein->bei_nrdn = ei.bei_nrdn;
436 ein->bei_rdn = ei.bei_rdn;
438 /* This node is not fully connected yet */
439 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
441 /* If this is the first time, save this node
442 * to be returned later.
444 if ( eir == NULL ) eir = ein;
446 /* Insert this node into the ID tree */
447 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
448 if ( avl_insert( &bdb->bi_cache.c_idtree, (caddr_t)ein,
449 bdb_id_cmp, avl_dup_error ) ) {
451 /* Hm, can this really happen? */
452 bdb_cache_entryinfo_destroy( ein );
453 ein = (EntryInfo *)avl_find( bdb->bi_cache.c_idtree,
454 (caddr_t) &ei, bdb_id_cmp );
455 bdb_cache_entryinfo_lock( ein );
456 avl_insert( &ein->bei_kids, (caddr_t)ei2, bdb_rdn_cmp,
458 bdb_cache_entryinfo_unlock( ein );
461 /* If there was a previous node, link it to this one */
462 if ( ei2 ) ei2->bei_parent = ein;
465 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
466 (caddr_t) &eip, bdb_id_cmp );
468 ei2 = &bdb->bi_cache.c_dntree;
472 ein->bei_parent = ei2;
473 bdb_cache_entryinfo_lock( ei2 );
474 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
476 bdb_cache_entryinfo_unlock( ei2 );
478 bdb_cache_entryinfo_lock( eir );
480 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
482 /* Found a link. Reset all the state info */
483 for (ein = eir; ein != ei2; ein=ein->bei_parent)
484 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
488 ei.bei_id = eip.bei_id;
489 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
497 * cache_find_id - find an entry in the cache, given id.
498 * The entry is locked for Read upon return. Call with islocked TRUE if
499 * the supplied *eip was already locked.
514 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
521 /* If we weren't given any info, see if we have it already cached */
523 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
524 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
525 (caddr_t) &ei, bdb_id_cmp );
527 bdb_cache_entryinfo_lock( *eip );
530 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
533 /* See if the ID exists in the database; add it to the cache if so */
536 rc = bdb_id2entry( be, tid, id, &ep );
538 rc = bdb_cache_find_ndn( be, tid,
539 &ep->e_nname, eip, locker, ctx );
543 bdb_entry_return( ep );
548 rc = bdb_cache_find_parent(be, tid, id, eip, ctx );
549 if ( rc == 0 && *eip )
554 /* Ok, we found the info, do we have the entry? */
555 if ( *eip && rc == 0 ) {
556 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
558 } else if (!(*eip)->bei_e ) {
560 rc = bdb_id2entry( be, tid, id, &ep );
563 bdb_cache_entry_db_lock( bdb->bi_dbenv, locker,
565 ep->e_private = *eip;
570 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
575 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
577 bdb_cache_entry_db_lock( bdb->bi_dbenv,
578 locker, *eip, 1, 0, lock );
579 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
580 bdb_cache_entry_db_relock( bdb->bi_dbenv,
581 locker, *eip, 0, 0, lock );
583 bdb_cache_entry_db_lock( bdb->bi_dbenv,
584 locker, *eip, 0, 0, lock );
587 bdb_cache_entry_db_lock( bdb->bi_dbenv, locker,
592 if ( rc == 0 && (*eip)->bei_kids == NULL ) {
594 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
595 LRU_DELETE( &bdb->bi_cache, *eip );
596 LRU_ADD( &bdb->bi_cache, *eip );
597 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
601 bdb_cache_entryinfo_unlock( *eip );
615 if ( BEI(e)->bei_kids ) {
618 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
621 rc = bdb_dn2id_children( op, txn, e );
622 if ( rc == DB_NOTFOUND ) {
623 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS;
628 /* Update the cache after a successful database Add. */
631 struct bdb_info *bdb,
639 struct berval rdn = e->e_name;
646 if ( nrdn->bv_len != e->e_nname.bv_len ) {
647 char *ptr = strchr( rdn.bv_val, ',' );
648 rdn.bv_len = ptr - rdn.bv_val;
650 ber_dupbv( &ei.bei_rdn, &rdn );
652 rc = bdb_entryinfo_add_internal( bdb, &ei, &new, locker );
655 new->bei_state = CACHE_ENTRY_NO_KIDS;
656 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
657 bdb_cache_entryinfo_unlock( eip );
658 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
671 EntryInfo *ei = BEI(e);
673 /* Get write lock on data */
674 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
676 /* If we've done repeated mods on a cached entry, then e_attrs
677 * is no longer contiguous with the entry, and must be freed.
679 if ( (void *)e->e_attrs != (void *)(e+1) ) {
680 attrs_free( e->e_attrs );
682 e->e_attrs = newAttrs;
688 * Change the rdn in the entryinfo. Also move to a new parent if needed.
701 EntryInfo *ei = BEI(e), *pei;
705 /* Get write lock on data */
706 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
708 /* If we've done repeated mods on a cached entry, then e_attrs
709 * is no longer contiguous with the entry, and must be freed.
711 if ( (void *)e->e_attrs != (void *)(e+1) ) {
712 attrs_free( e->e_attrs );
714 e->e_attrs = new->e_attrs;
716 ch_free(e->e_name.bv_val);
718 if( e->e_nname.bv_val < e->e_bv.bv_val || e->e_nname.bv_val >
719 e->e_bv.bv_val + e->e_bv.bv_len ) {
720 ch_free(e->e_name.bv_val);
721 ch_free(e->e_nname.bv_val);
724 e->e_name = new->e_name;
725 e->e_nname = new->e_nname;
727 /* Lock the parent's kids AVL tree */
728 pei = ei->bei_parent;
729 bdb_cache_entryinfo_lock( pei );
730 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
731 free( ei->bei_nrdn.bv_val );
732 ber_dupbv( &ei->bei_nrdn, nrdn );
734 free( ei->bei_rdn.bv_val );
737 if ( nrdn->bv_len != e->e_nname.bv_len ) {
738 char *ptr = strchr(rdn.bv_val, ',');
739 rdn.bv_len = ptr - rdn.bv_val;
741 ber_dupbv( &ei->bei_rdn, &rdn );
745 ein = ei->bei_parent;
747 ei->bei_parent = ein;
748 bdb_cache_entryinfo_unlock( pei );
749 bdb_cache_entryinfo_lock( ein );
752 { int max = ei->bei_modrdns;
753 /* Record the generation number of this change */
754 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
755 if ( pei->bei_modrdns > max )
756 max = pei->bei_modrdns;
758 ei->bei_modrdns = max + 1;
761 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
762 bdb_cache_entryinfo_unlock( ein );
766 * cache_delete - delete the entry e from the cache.
768 * returns: 0 e was deleted ok
769 * 1 e was not in the cache
770 * -1 something bad happened
781 EntryInfo *ei = BEI(e);
784 assert( e->e_private );
786 /* Set this early, warn off any queriers */
787 ei->bei_state |= CACHE_ENTRY_DELETED;
789 /* Get write lock on the data */
790 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
792 /* set cache write lock */
793 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
795 /* Lock the parent's kids tree */
796 bdb_cache_entryinfo_lock( ei->bei_parent );
799 LDAP_LOG( CACHE, ENTRY,
800 "bdb_cache_delete: delete %ld.\n", e->e_id, 0, 0 );
802 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
807 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
808 rc = bdb_cache_delete_internal( cache, e->e_private );
810 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
812 /* free cache write lock */
813 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
814 bdb_cache_entryinfo_unlock( ei->bei_parent );
815 bdb_cache_entryinfo_destroy( ei );
821 bdb_cache_delete_internal(
826 int rc = 0; /* return code */
829 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp ) == NULL )
834 /* If parent has no more kids, put in on LRU list */
835 if ( e->bei_parent->bei_kids == NULL ) {
836 LRU_ADD( cache, e->bei_parent );
841 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL )
851 LRU_DELETE( cache, e );
855 * flag entry to be freed later by a call to cache_return_entry()
857 e->bei_state |= CACHE_ENTRY_DELETED;
863 bdb_entryinfo_release( void *data )
865 EntryInfo *ei = (EntryInfo *)data;
866 if ( ei->bei_kids ) {
867 avl_free( ei->bei_kids, NULL );
870 ei->bei_e->e_private = NULL;
871 bdb_entry_return( ei->bei_e );
873 bdb_cache_entryinfo_destroy( ei );
877 bdb_cache_release_all( Cache *cache )
879 /* set cache write lock */
880 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
882 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
885 LDAP_LOG( CACHE, ENTRY, "bdb_cache_release_all: enter\n", 0, 0, 0 );
887 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
890 avl_free( cache->c_dntree.bei_kids, NULL );
891 avl_free( cache->c_idtree, bdb_entryinfo_release );
892 cache->c_lruhead = NULL;
893 cache->c_lrutail = NULL;
896 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
897 /* free cache write lock */
898 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
903 bdb_lru_print( Cache *cache )
907 fprintf( stderr, "LRU queue (head to tail):\n" );
908 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
909 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
910 e->bei_nrdn.bv_val, e->bei_id );
912 fprintf( stderr, "LRU queue (tail to head):\n" );
913 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
914 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
915 e->bei_nrdn.bv_val, e->bei_id );
920 #ifdef BDB_REUSE_LOCKERS
922 bdb_locker_id_free( void *key, void *data )
925 int lockid = (int) data;
927 XLOCK_ID_FREE( env, lockid );
931 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
937 if ( !env || !locker ) return -1;
939 /* If no op was provided, try to find the ctx anyway... */
941 ctx = op->o_threadctx;
943 ctx = ldap_pvt_thread_pool_context();
946 /* Shouldn't happen unless we're single-threaded */
952 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
953 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
954 rc = XLOCK_ID( env, &lockid );
955 if (rc) ldap_pvt_thread_yield();
960 data = (void *)lockid;
961 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
962 data, bdb_locker_id_free ) ) ) {
963 XLOCK_ID_FREE( env, lockid );
965 LDAP_LOG( BACK_BDB, ERR, "bdb_locker_id: err %s(%d)\n",
966 db_strerror(rc), rc, 0 );
968 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
969 db_strerror(rc), rc, 0 );