1 /* tools.c - tools for slap tools */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2007 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>.
20 #include <ac/string.h>
27 static DBC *cursor = NULL;
29 static EntryHeader eh;
32 typedef struct dn_id {
37 #define HOLE_SIZE 4096
38 static dn_id hbuf[HOLE_SIZE], *holes = hbuf;
39 static unsigned nhmax = HOLE_SIZE;
40 static unsigned nholes;
42 static int index_nattrs;
44 #ifdef BDB_TOOL_IDL_CACHING
45 #define bdb_tool_idl_cmp BDB_SYMBOL(tool_idl_cmp)
46 #define bdb_tool_idl_flush_one BDB_SYMBOL(tool_idl_flush_one)
47 #define bdb_tool_idl_flush BDB_SYMBOL(tool_idl_flush)
49 static int bdb_tool_idl_flush( BackendDB *be );
53 typedef struct bdb_tool_idl_cache_entry {
54 struct bdb_tool_idl_cache_entry *next;
56 } bdb_tool_idl_cache_entry;
58 typedef struct bdb_tool_idl_cache {
60 bdb_tool_idl_cache_entry *head, *tail;
65 static bdb_tool_idl_cache_entry *bdb_tool_idl_free_list;
66 #endif /* BDB_TOOL_IDL_CACHING */
68 static ID bdb_tool_ix_id;
69 static Operation *bdb_tool_ix_op;
70 static int *bdb_tool_index_threads, bdb_tool_index_tcount;
71 static void *bdb_tool_index_rec;
72 static struct bdb_info *bdb_tool_info;
73 static ldap_pvt_thread_mutex_t bdb_tool_index_mutex;
74 static ldap_pvt_thread_cond_t bdb_tool_index_cond_main;
75 static ldap_pvt_thread_cond_t bdb_tool_index_cond_work;
77 static void * bdb_tool_index_task( void *ctx, void *ptr );
79 int bdb_tool_entry_open(
80 BackendDB *be, int mode )
82 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
84 /* initialize key and data thangs */
87 key.flags = DB_DBT_REALLOC;
88 data.flags = DB_DBT_USERMEM;
91 int rc = bdb->bi_id2entry->bdi_db->cursor(
92 bdb->bi_id2entry->bdi_db, NULL, &cursor,
99 /* Set up for threaded slapindex */
100 if (( slapMode & (SLAP_TOOL_QUICK|SLAP_TOOL_READONLY)) == SLAP_TOOL_QUICK
101 && bdb->bi_nattrs ) {
102 if ( !bdb_tool_info ) {
104 ldap_pvt_thread_mutex_init( &bdb_tool_index_mutex );
105 ldap_pvt_thread_cond_init( &bdb_tool_index_cond_main );
106 ldap_pvt_thread_cond_init( &bdb_tool_index_cond_work );
107 bdb_tool_index_threads = ch_malloc( slap_tool_thread_max * sizeof( int ));
108 bdb_tool_index_rec = ch_malloc( bdb->bi_nattrs * sizeof( IndexRec ));
109 bdb_tool_index_tcount = slap_tool_thread_max - 1;
110 for (i=1; i<slap_tool_thread_max; i++) {
111 int *ptr = ch_malloc( sizeof( int ));
113 ldap_pvt_thread_pool_submit( &connection_pool,
114 bdb_tool_index_task, ptr );
123 int bdb_tool_entry_close(
126 if ( bdb_tool_info ) {
128 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
129 bdb_tool_index_tcount = slap_tool_thread_max - 1;
130 ldap_pvt_thread_cond_broadcast( &bdb_tool_index_cond_work );
131 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
139 ch_free( eh.bv.bv_val );
144 cursor->c_close( cursor );
148 #ifdef BDB_TOOL_IDL_CACHING
149 bdb_tool_idl_flush( be );
154 fprintf( stderr, "Error, entries missing!\n");
155 for (i=0; i<nholes; i++) {
156 fprintf(stderr, " entry %ld: %s\n",
157 holes[i].id, holes[i].dn.bv_val);
165 ID bdb_tool_entry_next(
170 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
173 assert( be != NULL );
174 assert( slapMode & SLAP_TOOL_MODE );
175 assert( bdb != NULL );
178 data.ulen = data.dlen = sizeof( buf );
180 data.flags |= DB_DBT_PARTIAL;
181 rc = cursor->c_get( cursor, &key, &data, DB_NEXT );
184 /* If we're doing linear indexing and there are more attrs to
185 * index, and we're at the end of the database, start over.
187 if ( index_nattrs && rc == DB_NOTFOUND ) {
188 /* optional - do a checkpoint here? */
189 bdb_attr_info_free( bdb->bi_attrs[0] );
190 bdb->bi_attrs[0] = bdb->bi_attrs[index_nattrs];
192 rc = cursor->c_get( cursor, &key, &data, DB_FIRST );
203 eh.bv.bv_len = data.size;
204 rc = entry_header( &eh );
205 eoff = eh.data - eh.bv.bv_val;
211 BDB_DISK2ID( key.data, &id );
215 ID bdb_tool_dn2id_get(
222 EntryInfo *ei = NULL;
225 if ( BER_BVISEMPTY(dn) )
230 op.o_tmpmemctx = NULL;
231 op.o_tmpmfuncs = &ch_mfuncs;
233 rc = bdb_cache_find_ndn( &op, NULL, dn, &ei );
234 if ( ei ) bdb_cache_entryinfo_unlock( ei );
235 if ( rc == DB_NOTFOUND )
241 int bdb_tool_id2entry_get(
247 int rc = bdb_id2entry( be, NULL, 0, id, e );
249 if ( rc == DB_NOTFOUND && id == 0 ) {
250 Entry *dummy = ch_calloc( 1, sizeof(Entry) );
251 struct berval gluebv = BER_BVC("glue");
252 dummy->e_name.bv_val = ch_strdup( "" );
253 dummy->e_nname.bv_val = ch_strdup( "" );
254 attr_merge_one( dummy, slap_schema.si_ad_objectClass, &gluebv, NULL );
255 attr_merge_one( dummy, slap_schema.si_ad_structuralObjectClass,
263 Entry* bdb_tool_entry_get( BackendDB *be, ID id )
269 assert( be != NULL );
270 assert( slapMode & SLAP_TOOL_MODE );
273 data.flags ^= DB_DBT_PARTIAL;
275 rc = cursor->c_get( cursor, &key, &data, DB_CURRENT );
276 if ( rc != DB_BUFFER_SMALL ) goto leave;
278 /* Allocate a block and retrieve the data */
279 eh.bv.bv_len = eh.nvals * sizeof( struct berval ) + data.size;
280 eh.bv.bv_val = ch_realloc( eh.bv.bv_val, eh.bv.bv_len );
281 eh.data = eh.bv.bv_val + eh.nvals * sizeof( struct berval );
283 data.ulen = data.size;
285 /* Skip past already parsed nattr/nvals */
288 rc = cursor->c_get( cursor, &key, &data, DB_CURRENT );
289 if ( rc ) goto leave;
291 #ifdef SLAP_ZONE_ALLOC
292 /* FIXME: will add ctx later */
293 rc = entry_decode( &eh, &e, NULL );
295 rc = entry_decode( &eh, &e );
298 if( rc == LDAP_SUCCESS ) {
301 if ( slapMode & SLAP_TOOL_READONLY ) {
302 EntryInfo *ei = NULL;
308 op.o_tmpmemctx = NULL;
309 op.o_tmpmfuncs = &ch_mfuncs;
311 rc = bdb_cache_find_parent( &op, NULL, cursor->locker, id, &ei );
312 if ( rc == LDAP_SUCCESS ) {
313 bdb_cache_entryinfo_unlock( ei );
327 static int bdb_tool_next_id(
334 struct berval dn = e->e_name;
335 struct berval ndn = e->e_nname;
336 struct berval pdn, npdn;
337 EntryInfo *ei = NULL, eidummy;
340 if (ndn.bv_len == 0) {
345 rc = bdb_cache_find_ndn( op, tid, &ndn, &ei );
346 if ( ei ) bdb_cache_entryinfo_unlock( ei );
347 if ( rc == DB_NOTFOUND ) {
348 if ( !be_issuffix( op->o_bd, &ndn ) ) {
350 dnParent( &dn, &pdn );
351 dnParent( &ndn, &npdn );
354 rc = bdb_tool_next_id( op, tid, e, text, 1 );
360 /* If parent didn't exist, it was created just now
361 * and its ID is now in e->e_id. Make sure the current
362 * entry gets added under the new parent ID.
364 if ( eid != e->e_id ) {
365 eidummy.bei_id = e->e_id;
369 rc = bdb_next_id( op->o_bd, tid, &e->e_id );
371 snprintf( text->bv_val, text->bv_len,
372 "next_id failed: %s (%d)",
373 db_strerror(rc), rc );
374 Debug( LDAP_DEBUG_ANY,
375 "=> bdb_tool_next_id: %s\n", text->bv_val, 0, 0 );
378 rc = bdb_dn2id_add( op, tid, ei, e );
380 snprintf( text->bv_val, text->bv_len,
381 "dn2id_add failed: %s (%d)",
382 db_strerror(rc), rc );
383 Debug( LDAP_DEBUG_ANY,
384 "=> bdb_tool_next_id: %s\n", text->bv_val, 0, 0 );
386 if ( nholes == nhmax - 1 ) {
387 if ( holes == hbuf ) {
388 holes = ch_malloc( nhmax * sizeof(dn_id) * 2 );
389 AC_MEMCPY( holes, hbuf, sizeof(hbuf) );
391 holes = ch_realloc( holes, nhmax * sizeof(dn_id) * 2 );
395 ber_dupbv( &holes[nholes].dn, &ndn );
396 holes[nholes++].id = e->e_id;
398 } else if ( !hole ) {
401 e->e_id = ei->bei_id;
403 for ( i=0; i<nholes; i++) {
404 if ( holes[i].id == e->e_id ) {
406 free(holes[i].dn.bv_val);
407 for (j=i;j<nholes;j++) holes[j] = holes[j+1];
411 } else if ( holes[i].id > e->e_id ) {
425 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
427 if ( !bdb->bi_nattrs )
430 if ( slapMode & SLAP_TOOL_QUICK ) {
435 ir = bdb_tool_index_rec;
436 memset(ir, 0, bdb->bi_nattrs * sizeof( IndexRec ));
438 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
439 rc = bdb_index_recset( bdb, a, a->a_desc->ad_type,
440 &a->a_desc->ad_tags, ir );
444 bdb_tool_ix_id = e->e_id;
446 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
447 /* Wait for all threads to be ready */
448 while ( bdb_tool_index_tcount ) {
449 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
450 &bdb_tool_index_mutex );
452 for ( i=1; i<slap_tool_thread_max; i++ )
453 bdb_tool_index_threads[i] = LDAP_BUSY;
454 bdb_tool_index_tcount = slap_tool_thread_max - 1;
455 ldap_pvt_thread_cond_broadcast( &bdb_tool_index_cond_work );
456 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
457 rc = bdb_index_recrun( op, bdb, ir, e->e_id, 0 );
460 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
461 for ( i=1; i<slap_tool_thread_max; i++ ) {
462 if ( bdb_tool_index_threads[i] == LDAP_BUSY ) {
463 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
464 &bdb_tool_index_mutex );
468 if ( bdb_tool_index_threads[i] ) {
469 rc = bdb_tool_index_threads[i];
473 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
476 return bdb_index_entry_add( op, txn, e );
480 ID bdb_tool_entry_put(
483 struct berval *text )
486 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
491 assert( be != NULL );
492 assert( slapMode & SLAP_TOOL_MODE );
494 assert( text != NULL );
495 assert( text->bv_val != NULL );
496 assert( text->bv_val[0] == '\0' ); /* overconservative? */
498 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_tool_entry_put)
499 "( %ld, \"%s\" )\n", (long) e->e_id, e->e_dn, 0 );
501 if (! (slapMode & SLAP_TOOL_QUICK)) {
502 rc = TXN_BEGIN( bdb->bi_dbenv, NULL, &tid,
503 bdb->bi_db_opflags );
505 snprintf( text->bv_val, text->bv_len,
506 "txn_begin failed: %s (%d)",
507 db_strerror(rc), rc );
508 Debug( LDAP_DEBUG_ANY,
509 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
510 text->bv_val, 0, 0 );
517 op.o_tmpmemctx = NULL;
518 op.o_tmpmfuncs = &ch_mfuncs;
520 /* add dn2id indices */
521 rc = bdb_tool_next_id( &op, tid, e, text, 0 );
526 if ( !bdb->bi_linear_index )
527 rc = bdb_tool_index_add( &op, tid, e );
529 snprintf( text->bv_val, text->bv_len,
530 "index_entry_add failed: %s (%d)",
531 db_strerror(rc), rc );
532 Debug( LDAP_DEBUG_ANY,
533 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
534 text->bv_val, 0, 0 );
539 rc = bdb_id2entry_add( be, tid, e );
541 snprintf( text->bv_val, text->bv_len,
542 "id2entry_add failed: %s (%d)",
543 db_strerror(rc), rc );
544 Debug( LDAP_DEBUG_ANY,
545 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
546 text->bv_val, 0, 0 );
552 if ( !( slapMode & SLAP_TOOL_QUICK )) {
553 rc = TXN_COMMIT( tid, 0 );
555 snprintf( text->bv_val, text->bv_len,
556 "txn_commit failed: %s (%d)",
557 db_strerror(rc), rc );
558 Debug( LDAP_DEBUG_ANY,
559 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
560 text->bv_val, 0, 0 );
566 if ( !( slapMode & SLAP_TOOL_QUICK )) {
568 snprintf( text->bv_val, text->bv_len,
569 "txn_aborted! %s (%d)",
570 db_strerror(rc), rc );
571 Debug( LDAP_DEBUG_ANY,
572 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
573 text->bv_val, 0, 0 );
581 int bdb_tool_entry_reindex(
585 struct bdb_info *bi = (struct bdb_info *) be->be_private;
592 Debug( LDAP_DEBUG_ARGS,
593 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) "( %ld )\n",
596 /* No indexes configured, nothing to do. Could return an
597 * error here to shortcut things.
603 /* Get the first attribute to index */
604 if (bi->bi_linear_index && !index_nattrs) {
605 index_nattrs = bi->bi_nattrs - 1;
609 e = bdb_tool_entry_get( be, id );
612 Debug( LDAP_DEBUG_ANY,
613 LDAP_XSTRING(bdb_tool_entry_reindex)
614 ": could not locate id=%ld\n",
619 if (! (slapMode & SLAP_TOOL_QUICK)) {
620 rc = TXN_BEGIN( bi->bi_dbenv, NULL, &tid, bi->bi_db_opflags );
622 Debug( LDAP_DEBUG_ANY,
623 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) ": "
624 "txn_begin failed: %s (%d)\n",
625 db_strerror(rc), rc, 0 );
631 * just (re)add them for now
632 * assume that some other routine (not yet implemented)
633 * will zap index databases
637 Debug( LDAP_DEBUG_TRACE,
638 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) "( %ld, \"%s\" )\n",
639 (long) id, e->e_dn, 0 );
643 op.o_tmpmemctx = NULL;
644 op.o_tmpmfuncs = &ch_mfuncs;
646 rc = bdb_tool_index_add( &op, tid, e );
650 if (! (slapMode & SLAP_TOOL_QUICK)) {
651 rc = TXN_COMMIT( tid, 0 );
653 Debug( LDAP_DEBUG_ANY,
654 "=> " LDAP_XSTRING(bdb_tool_entry_reindex)
655 ": txn_commit failed: %s (%d)\n",
656 db_strerror(rc), rc, 0 );
662 if (! (slapMode & SLAP_TOOL_QUICK)) {
664 Debug( LDAP_DEBUG_ANY,
665 "=> " LDAP_XSTRING(bdb_tool_entry_reindex)
666 ": txn_aborted! %s (%d)\n",
667 db_strerror(rc), rc, 0 );
671 bdb_entry_release( &op, e, 0 );
676 ID bdb_tool_entry_modify(
679 struct berval *text )
682 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
687 assert( be != NULL );
688 assert( slapMode & SLAP_TOOL_MODE );
690 assert( text != NULL );
691 assert( text->bv_val != NULL );
692 assert( text->bv_val[0] == '\0' ); /* overconservative? */
694 assert ( e->e_id != NOID );
696 Debug( LDAP_DEBUG_TRACE,
697 "=> " LDAP_XSTRING(bdb_tool_entry_modify) "( %ld, \"%s\" )\n",
698 (long) e->e_id, e->e_dn, 0 );
700 if (! (slapMode & SLAP_TOOL_QUICK)) {
701 rc = TXN_BEGIN( bdb->bi_dbenv, NULL, &tid,
702 bdb->bi_db_opflags );
704 snprintf( text->bv_val, text->bv_len,
705 "txn_begin failed: %s (%d)",
706 db_strerror(rc), rc );
707 Debug( LDAP_DEBUG_ANY,
708 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
709 text->bv_val, 0, 0 );
716 op.o_tmpmemctx = NULL;
717 op.o_tmpmfuncs = &ch_mfuncs;
720 rc = bdb_id2entry_update( be, tid, e );
722 snprintf( text->bv_val, text->bv_len,
723 "id2entry_add failed: %s (%d)",
724 db_strerror(rc), rc );
725 Debug( LDAP_DEBUG_ANY,
726 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
727 text->bv_val, 0, 0 );
733 if (! (slapMode & SLAP_TOOL_QUICK)) {
734 rc = TXN_COMMIT( tid, 0 );
736 snprintf( text->bv_val, text->bv_len,
737 "txn_commit failed: %s (%d)",
738 db_strerror(rc), rc );
739 Debug( LDAP_DEBUG_ANY,
740 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": "
741 "%s\n", text->bv_val, 0, 0 );
747 if (! (slapMode & SLAP_TOOL_QUICK)) {
749 snprintf( text->bv_val, text->bv_len,
750 "txn_aborted! %s (%d)",
751 db_strerror(rc), rc );
752 Debug( LDAP_DEBUG_ANY,
753 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
754 text->bv_val, 0, 0 );
762 #ifdef BDB_TOOL_IDL_CACHING
764 bdb_tool_idl_cmp( const void *v1, const void *v2 )
766 const bdb_tool_idl_cache *c1 = v1, *c2 = v2;
769 if (( rc = c1->kstr.bv_len - c2->kstr.bv_len )) return rc;
770 return memcmp( c1->kstr.bv_val, c2->kstr.bv_val, c1->kstr.bv_len );
774 bdb_tool_idl_flush_one( void *v1, void *arg )
776 bdb_tool_idl_cache *ic = v1;
778 struct bdb_info *bdb = bdb_tool_info;
779 bdb_tool_idl_cache_entry *ice;
785 /* Freshly allocated, ignore it */
786 if ( !ic->head && ic->count <= BDB_IDL_DB_SIZE ) {
790 rc = db->cursor( db, NULL, &curs, 0 );
797 bv2DBT( &ic->kstr, &key );
799 data.size = data.ulen = sizeof( ID );
800 data.flags = DB_DBT_USERMEM;
803 rc = curs->c_get( curs, &key, &data, DB_SET );
804 /* If key already exists and we're writing a range... */
805 if ( rc == 0 && ic->count > BDB_IDL_DB_SIZE ) {
806 /* If it's not currently a range, must delete old info */
809 while ( curs->c_get( curs, &key, &data, DB_NEXT_DUP ) == 0 )
810 curs->c_del( curs, 0 );
813 /* Store range marker */
814 curs->c_put( curs, &key, &data, DB_KEYFIRST );
818 rc = curs->c_get( curs, &key, &data, DB_NEXT_DUP );
821 rc = curs->c_get( curs, &key, &data, DB_NEXT_DUP );
824 curs->c_del( curs, 0 );
826 BDB_ID2DISK( ic->last, &nid );
827 curs->c_put( curs, &key, &data, DB_KEYLAST );
829 } else if ( rc && rc != DB_NOTFOUND ) {
831 } else if ( ic->count > BDB_IDL_DB_SIZE ) {
832 /* range, didn't exist before */
834 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
836 BDB_ID2DISK( ic->first, &nid );
837 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
839 BDB_ID2DISK( ic->last, &nid );
840 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
849 /* Just a normal write */
851 for ( ice = ic->head, n=0; ice; ice = ice->next, n++ ) {
856 end = ic->count & (IDBLOCK-1);
860 for ( i=0; i<end; i++ ) {
861 if ( !ice->ids[i] ) continue;
862 BDB_ID2DISK( ice->ids[i], &nid );
863 rc = curs->c_put( curs, &key, &data, DB_NODUPDATA );
865 if ( rc == DB_KEYEXIST ) {
879 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
880 ic->tail->next = bdb_tool_idl_free_list;
881 bdb_tool_idl_free_list = ic->head;
882 bdb->bi_idl_cache_size -= n;
883 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
886 if ( ic != db->app_private ) {
889 ic->head = ic->tail = NULL;
891 curs->c_close( curs );
896 bdb_tool_idl_flush_db( DB *db, bdb_tool_idl_cache *ic )
898 Avlnode *root = db->app_private;
901 db->app_private = ic;
902 rc = avl_apply( root, bdb_tool_idl_flush_one, db, -1, AVL_INORDER );
903 avl_free( root, NULL );
904 db->app_private = NULL;
911 bdb_tool_idl_flush( BackendDB *be )
913 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
918 for ( i=BDB_NDB; i < bdb->bi_ndatabases; i++ ) {
919 db = bdb->bi_databases[i]->bdi_db;
920 if ( !db->app_private ) continue;
921 rc = bdb_tool_idl_flush_db( db, NULL );
926 bdb->bi_idl_cache_size = 0;
931 int bdb_tool_idl_add(
938 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
939 bdb_tool_idl_cache *ic, itmp;
940 bdb_tool_idl_cache_entry *ice;
943 if ( !bdb->bi_idl_cache_max_size )
944 return bdb_idl_insert_key( be, db, txn, key, id );
946 DBT2bv( key, &itmp.kstr );
948 ic = avl_find( (Avlnode *)db->app_private, &itmp, bdb_tool_idl_cmp );
950 /* No entry yet, create one */
957 ic = ch_malloc( sizeof( bdb_tool_idl_cache ) + itmp.kstr.bv_len );
958 ic->kstr.bv_len = itmp.kstr.bv_len;
959 ic->kstr.bv_val = (char *)(ic+1);
960 AC_MEMCPY( ic->kstr.bv_val, itmp.kstr.bv_val, ic->kstr.bv_len );
961 ic->head = ic->tail = NULL;
964 avl_insert( (Avlnode **)&db->app_private, ic, bdb_tool_idl_cmp,
967 /* load existing key count here */
968 rc = db->cursor( db, NULL, &curs, 0 );
971 data.ulen = sizeof( ID );
972 data.flags = DB_DBT_USERMEM;
974 rc = curs->c_get( curs, key, &data, DB_SET );
977 ic->count = BDB_IDL_DB_SIZE+1;
981 curs->c_count( curs, &count, 0 );
983 BDB_DISK2ID( &nid, &ic->first );
986 curs->c_close( curs );
988 /* are we a range already? */
989 if ( ic->count > BDB_IDL_DB_SIZE ) {
992 /* Are we at the limit, and converting to a range? */
993 } else if ( ic->count == BDB_IDL_DB_SIZE ) {
995 for ( ice = ic->head, n=0; ice; ice = ice->next, n++ )
998 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
999 ic->tail->next = bdb_tool_idl_free_list;
1000 bdb_tool_idl_free_list = ic->head;
1001 bdb->bi_idl_cache_size -= n;
1002 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1004 ic->head = ic->tail = NULL;
1009 /* No free block, create that too */
1010 if ( !ic->tail || ( ic->count & (IDBLOCK-1)) == 0) {
1012 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1013 if ( bdb->bi_idl_cache_size >= bdb->bi_idl_cache_max_size ) {
1014 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1015 rc = bdb_tool_idl_flush_db( db, ic );
1018 avl_insert( (Avlnode **)&db->app_private, ic, bdb_tool_idl_cmp,
1020 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1022 bdb->bi_idl_cache_size++;
1023 if ( bdb_tool_idl_free_list ) {
1024 ice = bdb_tool_idl_free_list;
1025 bdb_tool_idl_free_list = ice->next;
1027 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1029 ice = ch_malloc( sizeof( bdb_tool_idl_cache_entry ));
1031 memset( ice, 0, sizeof( *ice ));
1035 ic->tail->next = ice;
1042 ice->ids[ ic->count & (IDBLOCK-1) ] = id;
1050 bdb_tool_index_task( void *ctx, void *ptr )
1052 int base = *(int *)ptr;
1056 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
1057 bdb_tool_index_tcount--;
1058 if ( !bdb_tool_index_tcount )
1059 ldap_pvt_thread_cond_signal( &bdb_tool_index_cond_main );
1060 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_work,
1061 &bdb_tool_index_mutex );
1062 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
1063 if ( slapd_shutdown )
1066 bdb_tool_index_threads[base] = bdb_index_recrun( bdb_tool_ix_op,
1067 bdb_tool_info, bdb_tool_index_rec, bdb_tool_ix_id, base );