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 %ld, rw %d, rc %d\n",
73 Debug( LDAP_DEBUG_TRACE,
74 "bdb_cache_entry_db_relock: entry %ld, 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 %ld, rw %d, rc %d\n",
110 ei->bei_id, rw, rc );
112 Debug( LDAP_DEBUG_TRACE,
113 "bdb_cache_entry_db_lock: entry %ld, 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 length-ordered 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 = e1->bei_nrdn.bv_len - e2->bei_nrdn.bv_len;
178 if (rc == 0) rc = strncmp( e1->bei_nrdn.bv_val, e2->bei_nrdn.bv_val,
179 e1->bei_nrdn.bv_len );
184 bdb_id_cmp( const void *v_e1, const void *v_e2 )
186 const EntryInfo *e1 = v_e1, *e2 = v_e2;
187 return e1->bei_id - e2->bei_id;
190 /* Create an entryinfo in the cache. Caller must release the locks later.
193 bdb_entryinfo_add_internal(
194 struct bdb_info *bdb,
200 Cache *cache = &bdb->bi_cache;
201 DB_ENV *env = bdb->bi_dbenv;
202 EntryInfo *ei2 = NULL;
210 ldap_pvt_thread_rdwr_wlock( &bdb->bi_cache.c_rwlock );
211 bdb_cache_entryinfo_lock( ei->bei_parent );
213 /* if parent was previously considered a leaf node,
214 * it was on the LRU list. Now it's going to have
215 * kids, take it off the LRU list.
217 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
218 if ( ei->bei_parent->bei_id && !ei->bei_parent->bei_kids ) {
219 LRU_DELETE( cache, ei->bei_parent );
223 cache->c_cursize += incr;
225 /* See if we're above the cache size limit */
226 if ( cache->c_cursize > cache->c_maxsize ) {
227 EntryInfo *elru, *elprev;
230 /* Look for an unused entry to remove */
231 for (elru = cache->c_lrutail; elru; elru = elprev, i++ ) {
232 elprev = elru->bei_lruprev;
234 /* Too many probes, not enough idle, give up */
237 /* If we can successfully writelock it, then
238 * the object is idle.
240 if ( bdb_cache_entry_db_lock( env, locker, elru, 1, 1,
242 /* Need to lock parent to delete child */
243 if ( ldap_pvt_thread_mutex_trylock(
244 &elru->bei_parent->bei_kids_mutex )) {
245 bdb_cache_entry_db_unlock( env, &lock );
248 bdb_cache_delete_internal( cache, elru );
249 bdb_cache_entryinfo_unlock( elru->bei_parent );
250 elru->bei_e->e_private = NULL;
251 bdb_entry_return( elru->bei_e );
252 bdb_cache_entry_db_unlock( env, &lock );
254 bdb_cache_entryinfo_destroy( elru );
256 /* re-use this one */
257 ch_free(elru->bei_nrdn.bv_val);
258 elru->bei_nrdn.bv_val = NULL;
260 elru->bei_kids = NULL;
261 elru->bei_lrunext = NULL;
262 elru->bei_lruprev = NULL;
265 ch_free(elru->bei_rdn.bv_val);
266 elru->bei_rdn.bv_val = NULL;
267 elru->bei_modrdns = 0;
271 if (cache->c_cursize < cache->c_maxsize)
277 ei2 = bdb_cache_entryinfo_new();
279 ei2->bei_id = ei->bei_id;
280 ei2->bei_parent = ei->bei_parent;
282 ei2->bei_rdn = ei->bei_rdn;
285 /* Add to cache ID tree */
286 if (avl_insert( &cache->c_idtree, ei2, bdb_id_cmp, avl_dup_error )) {
288 eix = avl_find( cache->c_idtree, ei2, bdb_id_cmp );
289 bdb_cache_entryinfo_destroy( ei2 );
292 cache->c_cursize -= incr;
294 /* It got freed above because its value was
297 ei->bei_rdn.bv_val = NULL;
300 LRU_ADD( cache, ei2 );
301 ber_dupbv( &ei2->bei_nrdn, &ei->bei_nrdn );
305 avl_insert( &ei->bei_parent->bei_kids, ei2, bdb_rdn_cmp,
309 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
315 /* Find the EntryInfo for the requested DN. If the DN cannot be found, return
316 * the info for its closest ancestor. *res should be NULL to process a
317 * complete DN starting from the tree root. Otherwise *res must be the
318 * immediate parent of the requested DN, and only the RDN will be searched.
319 * The EntryInfo is locked upon return and must be unlocked by the caller.
331 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
332 EntryInfo ei, *eip, *ei2;
336 /* this function is always called with normalized DN */
338 /* we're doing a onelevel search for an RDN */
339 ei.bei_nrdn.bv_val = ndn->bv_val;
340 ei.bei_nrdn.bv_len = dn_rdnlen( be, ndn );
343 /* we're searching a full DN from the root */
344 ptr = ndn->bv_val + ndn->bv_len - be->be_nsuffix[0].bv_len;
345 ei.bei_nrdn.bv_val = ptr;
346 ei.bei_nrdn.bv_len = be->be_nsuffix[0].bv_len;
347 eip = &bdb->bi_cache.c_dntree;
350 for ( bdb_cache_entryinfo_lock( eip ); eip; ) {
352 ei2 = (EntryInfo *)avl_find( eip->bei_kids, &ei, bdb_rdn_cmp );
354 int len = ei.bei_nrdn.bv_len;
356 ei.bei_nrdn.bv_len = ndn->bv_len - (ei.bei_nrdn.bv_val - ndn->bv_val);
357 bdb_cache_entryinfo_unlock( eip );
359 rc = bdb_dn2id( be, txn, &ei.bei_nrdn, &ei, ctx );
361 bdb_cache_entryinfo_lock( eip );
366 /* DN exists but needs to be added to cache */
367 ei.bei_nrdn.bv_len = len;
368 rc = bdb_entryinfo_add_internal( bdb, &ei, &ei2,
370 /* add_internal left eip and c_rwlock locked */
371 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
376 } else if ( ei2->bei_state & CACHE_ENTRY_DELETED ) {
377 /* In the midst of deleting? Give it a chance to
380 bdb_cache_entryinfo_unlock( eip );
381 ldap_pvt_thread_yield();
382 bdb_cache_entryinfo_lock( eip );
386 bdb_cache_entryinfo_unlock( eip );
387 bdb_cache_entryinfo_lock( ei2 );
391 /* Advance to next lower RDN */
392 for (ptr = ei.bei_nrdn.bv_val - 2; ptr > ndn->bv_val
393 && !DN_SEPARATOR(*ptr); ptr--);
394 if ( ptr >= ndn->bv_val ) {
395 if (DN_SEPARATOR(*ptr)) ptr++;
396 ei.bei_nrdn.bv_len = ei.bei_nrdn.bv_val - ptr - 1;
397 ei.bei_nrdn.bv_val = ptr;
399 if ( ptr < ndn->bv_val ) {
409 /* Walk up the tree from a child node, looking for an ID that's already
410 * been linked into the cache.
413 bdb_cache_find_parent(
421 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
422 EntryInfo ei, eip, *ei2 = NULL, *ein = NULL, *eir = NULL;
430 rc = bdb_dn2id_parent( be, txn, &ei, &eip.bei_id, ctx );
433 /* Save the previous node, if any */
436 /* Create a new node for the current ID */
437 ein = bdb_cache_entryinfo_new();
438 ein->bei_id = ei.bei_id;
439 ein->bei_kids = ei.bei_kids;
440 ein->bei_nrdn = ei.bei_nrdn;
441 ein->bei_rdn = ei.bei_rdn;
443 /* This node is not fully connected yet */
444 ein->bei_state = CACHE_ENTRY_NOT_LINKED;
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 );
456 bdb_cache_entryinfo_lock( ein );
457 avl_insert( &ein->bei_kids, (caddr_t)ei2,
458 bdb_rdn_cmp, avl_dup_error );
459 bdb_cache_entryinfo_unlock( ein );
463 /* If this is the first time, save this node
464 * to be returned later.
466 if ( eir == NULL ) eir = ein;
468 /* If there was a previous node, link it to this one */
469 if ( ei2 ) ei2->bei_parent = ein;
472 ei2 = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
473 (caddr_t) &eip, bdb_id_cmp );
475 ei2 = &bdb->bi_cache.c_dntree;
479 ein->bei_parent = ei2;
480 bdb_cache_entryinfo_lock( ei2 );
481 avl_insert( &ei2->bei_kids, (caddr_t)ein, bdb_rdn_cmp,
483 bdb_cache_entryinfo_unlock( ei2 );
485 bdb_cache_entryinfo_lock( eir );
487 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
489 /* Found a link. Reset all the state info */
490 for (ein = eir; ein != ei2; ein=ein->bei_parent)
491 ein->bei_state &= ~CACHE_ENTRY_NOT_LINKED;
495 ei.bei_id = eip.bei_id;
496 avl_insert( &ei.bei_kids, (caddr_t)ein, bdb_rdn_cmp,
504 * cache_find_id - find an entry in the cache, given id.
505 * The entry is locked for Read upon return. Call with islocked TRUE if
506 * the supplied *eip was already locked.
521 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
528 /* If we weren't given any info, see if we have it already cached */
530 ldap_pvt_thread_rdwr_rlock( &bdb->bi_cache.c_rwlock );
531 *eip = (EntryInfo *) avl_find( bdb->bi_cache.c_idtree,
532 (caddr_t) &ei, bdb_id_cmp );
534 bdb_cache_entryinfo_lock( *eip );
537 ldap_pvt_thread_rdwr_runlock( &bdb->bi_cache.c_rwlock );
540 /* See if the ID exists in the database; add it to the cache if so */
543 rc = bdb_id2entry( be, tid, id, &ep );
545 rc = bdb_cache_find_ndn( be, tid,
546 &ep->e_nname, eip, locker, ctx );
550 bdb_entry_return( ep );
555 rc = bdb_cache_find_parent(be, tid, id, eip, ctx );
556 if ( rc == 0 && *eip )
561 /* Ok, we found the info, do we have the entry? */
562 if ( *eip && rc == 0 ) {
563 if ( (*eip)->bei_state & CACHE_ENTRY_DELETED ) {
565 } else if (!(*eip)->bei_e ) {
567 rc = bdb_id2entry( be, tid, id, &ep );
570 bdb_cache_entry_db_lock( bdb->bi_dbenv, locker,
572 ep->e_private = *eip;
577 bdb_cache_entry_db_relock( bdb->bi_dbenv, locker,
582 rc = bdb_fix_dn( (*eip)->bei_e, 1 );
584 bdb_cache_entry_db_lock( bdb->bi_dbenv,
585 locker, *eip, 1, 0, lock );
586 rc = bdb_fix_dn( (*eip)->bei_e, 2 );
587 bdb_cache_entry_db_relock( bdb->bi_dbenv,
588 locker, *eip, 0, 0, lock );
590 bdb_cache_entry_db_lock( bdb->bi_dbenv,
591 locker, *eip, 0, 0, lock );
594 bdb_cache_entry_db_lock( bdb->bi_dbenv, locker,
599 if ( rc == 0 && (*eip)->bei_kids == NULL ) {
601 ldap_pvt_thread_mutex_lock( &bdb->bi_cache.lru_mutex );
602 LRU_DELETE( &bdb->bi_cache, *eip );
603 LRU_ADD( &bdb->bi_cache, *eip );
604 ldap_pvt_thread_mutex_unlock( &bdb->bi_cache.lru_mutex );
608 bdb_cache_entryinfo_unlock( *eip );
622 if ( BEI(e)->bei_kids ) {
625 if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
628 rc = bdb_dn2id_children( op, txn, e );
629 if ( rc == DB_NOTFOUND ) {
630 BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS;
635 /* Update the cache after a successful database Add. */
638 struct bdb_info *bdb,
646 struct berval rdn = e->e_name;
653 if ( nrdn->bv_len != e->e_nname.bv_len ) {
654 char *ptr = strchr( rdn.bv_val, ',' );
655 rdn.bv_len = ptr - rdn.bv_val;
657 ber_dupbv( &ei.bei_rdn, &rdn );
659 rc = bdb_entryinfo_add_internal( bdb, &ei, &new, locker );
662 new->bei_state = CACHE_ENTRY_NO_KIDS;
663 eip->bei_state &= ~CACHE_ENTRY_NO_KIDS;
664 bdb_cache_entryinfo_unlock( eip );
665 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_cache.c_rwlock );
678 EntryInfo *ei = BEI(e);
680 /* Get write lock on data */
681 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
683 /* If we've done repeated mods on a cached entry, then e_attrs
684 * is no longer contiguous with the entry, and must be freed.
686 if ( (void *)e->e_attrs != (void *)(e+1) ) {
687 attrs_free( e->e_attrs );
689 e->e_attrs = newAttrs;
695 * Change the rdn in the entryinfo. Also move to a new parent if needed.
708 EntryInfo *ei = BEI(e), *pei;
712 /* Get write lock on data */
713 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
715 /* If we've done repeated mods on a cached entry, then e_attrs
716 * is no longer contiguous with the entry, and must be freed.
718 if ( (void *)e->e_attrs != (void *)(e+1) ) {
719 attrs_free( e->e_attrs );
721 e->e_attrs = new->e_attrs;
723 ch_free(e->e_name.bv_val);
725 if( e->e_nname.bv_val < e->e_bv.bv_val || e->e_nname.bv_val >
726 e->e_bv.bv_val + e->e_bv.bv_len ) {
727 ch_free(e->e_name.bv_val);
728 ch_free(e->e_nname.bv_val);
731 e->e_name = new->e_name;
732 e->e_nname = new->e_nname;
734 /* Lock the parent's kids AVL tree */
735 pei = ei->bei_parent;
736 bdb_cache_entryinfo_lock( pei );
737 avl_delete( &pei->bei_kids, (caddr_t) ei, bdb_rdn_cmp );
738 free( ei->bei_nrdn.bv_val );
739 ber_dupbv( &ei->bei_nrdn, nrdn );
741 free( ei->bei_rdn.bv_val );
744 if ( nrdn->bv_len != e->e_nname.bv_len ) {
745 char *ptr = strchr(rdn.bv_val, ',');
746 rdn.bv_len = ptr - rdn.bv_val;
748 ber_dupbv( &ei->bei_rdn, &rdn );
752 ein = ei->bei_parent;
754 ei->bei_parent = ein;
755 bdb_cache_entryinfo_unlock( pei );
756 bdb_cache_entryinfo_lock( ein );
759 { int max = ei->bei_modrdns;
760 /* Record the generation number of this change */
761 for ( pei = ein; pei->bei_parent; pei = pei->bei_parent ) {
762 if ( pei->bei_modrdns > max )
763 max = pei->bei_modrdns;
765 ei->bei_modrdns = max + 1;
768 avl_insert( &ein->bei_kids, ei, bdb_rdn_cmp, avl_dup_error );
769 bdb_cache_entryinfo_unlock( ein );
773 * cache_delete - delete the entry e from the cache.
775 * returns: 0 e was deleted ok
776 * 1 e was not in the cache
777 * -1 something bad happened
788 EntryInfo *ei = BEI(e);
791 assert( e->e_private );
793 /* Set this early, warn off any queriers */
794 ei->bei_state |= CACHE_ENTRY_DELETED;
796 /* Get write lock on the data */
797 bdb_cache_entry_db_relock( env, locker, ei, 1, 0, lock );
799 /* set cache write lock */
800 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
802 /* Lock the parent's kids tree */
803 bdb_cache_entryinfo_lock( ei->bei_parent );
806 LDAP_LOG( CACHE, ENTRY,
807 "bdb_cache_delete: delete %ld.\n", e->e_id, 0, 0 );
809 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_delete( %ld )\n",
814 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
815 rc = bdb_cache_delete_internal( cache, e->e_private );
817 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
819 /* free cache write lock */
820 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
821 bdb_cache_entryinfo_unlock( ei->bei_parent );
826 bdb_cache_delete_cleanup(
830 bdb_cache_entryinfo_destroy( e->e_private );
832 bdb_entry_return( e );
836 bdb_cache_delete_internal(
841 int rc = 0; /* return code */
844 if ( avl_delete( &e->bei_parent->bei_kids, (caddr_t) e, bdb_rdn_cmp ) == NULL )
849 /* If parent has no more kids, put in on LRU list */
850 if ( e->bei_parent->bei_kids == NULL ) {
851 LRU_ADD( cache, e->bei_parent );
856 if ( avl_delete( &cache->c_idtree, (caddr_t) e, bdb_id_cmp ) == NULL )
866 LRU_DELETE( cache, e );
870 * flag entry to be freed later by a call to cache_return_entry()
872 e->bei_state |= CACHE_ENTRY_DELETED;
878 bdb_entryinfo_release( void *data )
880 EntryInfo *ei = (EntryInfo *)data;
881 if ( ei->bei_kids ) {
882 avl_free( ei->bei_kids, NULL );
885 ei->bei_e->e_private = NULL;
886 bdb_entry_return( ei->bei_e );
888 bdb_cache_entryinfo_destroy( ei );
892 bdb_cache_release_all( Cache *cache )
894 /* set cache write lock */
895 ldap_pvt_thread_rdwr_wlock( &cache->c_rwlock );
897 ldap_pvt_thread_mutex_lock( &cache->lru_mutex );
900 LDAP_LOG( CACHE, ENTRY, "bdb_cache_release_all: enter\n", 0, 0, 0 );
902 Debug( LDAP_DEBUG_TRACE, "====> bdb_cache_release_all\n", 0, 0, 0 );
905 avl_free( cache->c_dntree.bei_kids, NULL );
906 avl_free( cache->c_idtree, bdb_entryinfo_release );
907 cache->c_lruhead = NULL;
908 cache->c_lrutail = NULL;
911 ldap_pvt_thread_mutex_unlock( &cache->lru_mutex );
912 /* free cache write lock */
913 ldap_pvt_thread_rdwr_wunlock( &cache->c_rwlock );
918 bdb_lru_print( Cache *cache )
922 fprintf( stderr, "LRU queue (head to tail):\n" );
923 for ( e = cache->c_lruhead; e != NULL; e = e->bei_lrunext ) {
924 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
925 e->bei_nrdn.bv_val, e->bei_id );
927 fprintf( stderr, "LRU queue (tail to head):\n" );
928 for ( e = cache->c_lrutail; e != NULL; e = e->bei_lruprev ) {
929 fprintf( stderr, "\trdn \"%20s\" id %ld\n",
930 e->bei_nrdn.bv_val, e->bei_id );
935 #ifdef BDB_REUSE_LOCKERS
937 bdb_locker_id_free( void *key, void *data )
940 int lockid = (int) data;
944 rc = XLOCK_ID_FREE( env, lockid );
945 if ( rc == EINVAL ) {
948 LDAP_LOG( BACK_BDB, ERR,
949 "bdb_locker_id_free: %d err %s(%d)\n",
950 lockid, db_strerror(rc), rc );
952 Debug( LDAP_DEBUG_ANY,
953 "bdb_locker_id_free: %d err %s(%d)\n",
954 lockid, db_strerror(rc), rc );
956 memset( &lr, 0, sizeof(lr) );
958 /* release all locks held by this locker. */
959 lr.op = DB_LOCK_PUT_ALL;
960 env->lock_vec( env, lockid, 0, &lr, 1, NULL );
961 XLOCK_ID_FREE( env, lockid );
966 bdb_locker_id( Operation *op, DB_ENV *env, int *locker )
972 if ( !env || !locker ) return -1;
974 /* If no op was provided, try to find the ctx anyway... */
976 ctx = op->o_threadctx;
978 ctx = ldap_pvt_thread_pool_context();
981 /* Shouldn't happen unless we're single-threaded */
987 if ( ldap_pvt_thread_pool_getkey( ctx, env, &data, NULL ) ) {
988 for ( i=0, rc=1; rc != 0 && i<4; i++ ) {
989 rc = XLOCK_ID( env, &lockid );
990 if (rc) ldap_pvt_thread_yield();
995 data = (void *)lockid;
996 if ( ( rc = ldap_pvt_thread_pool_setkey( ctx, env,
997 data, bdb_locker_id_free ) ) ) {
998 XLOCK_ID_FREE( env, lockid );
1000 LDAP_LOG( BACK_BDB, ERR, "bdb_locker_id: err %s(%d)\n",
1001 db_strerror(rc), rc, 0 );
1003 Debug( LDAP_DEBUG_ANY, "bdb_locker_id: err %s(%d)\n",
1004 db_strerror(rc), rc, 0 );