1 /* tools.c - tools for slap tools */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2011 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;
30 static ID nid, previd = NOID;
31 static char ehbuf[16];
33 typedef struct dn_id {
38 #define HOLE_SIZE 4096
39 static dn_id hbuf[HOLE_SIZE], *holes = hbuf;
40 static unsigned nhmax = HOLE_SIZE;
41 static unsigned nholes;
43 static int index_nattrs;
45 static struct berval *tool_base;
46 static int tool_scope;
47 static Filter *tool_filter;
48 static Entry *tool_next_entry;
50 #ifdef BDB_TOOL_IDL_CACHING
51 #define bdb_tool_idl_cmp BDB_SYMBOL(tool_idl_cmp)
52 #define bdb_tool_idl_flush_one BDB_SYMBOL(tool_idl_flush_one)
53 #define bdb_tool_idl_flush BDB_SYMBOL(tool_idl_flush)
55 static int bdb_tool_idl_flush( BackendDB *be );
59 typedef struct bdb_tool_idl_cache_entry {
60 struct bdb_tool_idl_cache_entry *next;
62 } bdb_tool_idl_cache_entry;
64 typedef struct bdb_tool_idl_cache {
66 bdb_tool_idl_cache_entry *head, *tail;
71 static bdb_tool_idl_cache_entry *bdb_tool_idl_free_list;
72 #endif /* BDB_TOOL_IDL_CACHING */
74 static ID bdb_tool_ix_id;
75 static Operation *bdb_tool_ix_op;
76 static int *bdb_tool_index_threads, bdb_tool_index_tcount;
77 static void *bdb_tool_index_rec;
78 static struct bdb_info *bdb_tool_info;
79 static ldap_pvt_thread_mutex_t bdb_tool_index_mutex;
80 static ldap_pvt_thread_cond_t bdb_tool_index_cond_main;
81 static ldap_pvt_thread_cond_t bdb_tool_index_cond_work;
83 #if DB_VERSION_FULL >= 0x04060000
86 /* Seems to slow things down too much in BDB 4.5 */
91 static ldap_pvt_thread_mutex_t bdb_tool_trickle_mutex;
92 static ldap_pvt_thread_cond_t bdb_tool_trickle_cond;
93 static ldap_pvt_thread_cond_t bdb_tool_trickle_cond_end;
95 static void * bdb_tool_trickle_task( void *ctx, void *ptr );
96 static int bdb_tool_trickle_active;
99 static void * bdb_tool_index_task( void *ctx, void *ptr );
102 bdb_tool_entry_get_int( BackendDB *be, ID id, Entry **ep );
104 static int bdb_tool_threads;
106 int bdb_tool_entry_open(
107 BackendDB *be, int mode )
109 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
111 /* initialize key and data thangs */
114 key.flags = DB_DBT_USERMEM;
116 key.size = key.ulen = sizeof( nid );
117 data.flags = DB_DBT_USERMEM;
119 if (cursor == NULL) {
120 int rc = bdb->bi_id2entry->bdi_db->cursor(
121 bdb->bi_id2entry->bdi_db, bdb->bi_cache.c_txn, &cursor,
122 bdb->bi_db_opflags );
128 /* Set up for threaded slapindex */
129 if (( slapMode & (SLAP_TOOL_QUICK|SLAP_TOOL_READONLY)) == SLAP_TOOL_QUICK ) {
130 if ( !bdb_tool_info ) {
132 ldap_pvt_thread_mutex_init( &bdb_tool_trickle_mutex );
133 ldap_pvt_thread_cond_init( &bdb_tool_trickle_cond );
134 ldap_pvt_thread_cond_init( &bdb_tool_trickle_cond_end );
135 ldap_pvt_thread_pool_submit( &connection_pool, bdb_tool_trickle_task, bdb->bi_dbenv );
138 ldap_pvt_thread_mutex_init( &bdb_tool_index_mutex );
139 ldap_pvt_thread_cond_init( &bdb_tool_index_cond_main );
140 ldap_pvt_thread_cond_init( &bdb_tool_index_cond_work );
141 if ( bdb->bi_nattrs ) {
143 bdb_tool_threads = slap_tool_thread_max - 1;
144 if ( bdb_tool_threads > 1 ) {
145 bdb_tool_index_threads = ch_malloc( bdb_tool_threads * sizeof( int ));
146 bdb_tool_index_rec = ch_malloc( bdb->bi_nattrs * sizeof( IndexRec ));
147 bdb_tool_index_tcount = bdb_tool_threads - 1;
148 for (i=1; i<bdb_tool_threads; i++) {
149 int *ptr = ch_malloc( sizeof( int ));
151 ldap_pvt_thread_pool_submit( &connection_pool,
152 bdb_tool_index_task, ptr );
163 int bdb_tool_entry_close(
166 if ( bdb_tool_info ) {
169 ldap_pvt_thread_mutex_lock( &bdb_tool_trickle_mutex );
171 /* trickle thread may not have started yet */
172 while ( !bdb_tool_trickle_active )
173 ldap_pvt_thread_cond_wait( &bdb_tool_trickle_cond_end,
174 &bdb_tool_trickle_mutex );
176 ldap_pvt_thread_cond_signal( &bdb_tool_trickle_cond );
177 while ( bdb_tool_trickle_active )
178 ldap_pvt_thread_cond_wait( &bdb_tool_trickle_cond_end,
179 &bdb_tool_trickle_mutex );
180 ldap_pvt_thread_mutex_unlock( &bdb_tool_trickle_mutex );
182 if ( bdb_tool_threads > 1 ) {
183 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
185 /* There might still be some threads starting */
186 while ( bdb_tool_index_tcount > 0 ) {
187 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
188 &bdb_tool_index_mutex );
191 bdb_tool_index_tcount = bdb_tool_threads - 1;
192 ldap_pvt_thread_cond_broadcast( &bdb_tool_index_cond_work );
194 /* Make sure all threads are stopped */
195 while ( bdb_tool_index_tcount > 0 ) {
196 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
197 &bdb_tool_index_mutex );
199 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
201 bdb_tool_info = NULL;
203 ch_free( bdb_tool_index_threads );
204 ch_free( bdb_tool_index_rec );
205 bdb_tool_index_tcount = bdb_tool_threads - 1;
210 ch_free( eh.bv.bv_val );
215 cursor->c_close( cursor );
219 #ifdef BDB_TOOL_IDL_CACHING
220 bdb_tool_idl_flush( be );
225 fprintf( stderr, "Error, entries missing!\n");
226 for (i=0; i<nholes; i++) {
227 fprintf(stderr, " entry %ld: %s\n",
228 holes[i].id, holes[i].dn.bv_val);
237 bdb_tool_entry_first_x(
247 return bdb_tool_entry_next( be );
250 ID bdb_tool_entry_next(
255 struct bdb_info *bdb;
257 assert( be != NULL );
258 assert( slapMode & SLAP_TOOL_MODE );
260 bdb = (struct bdb_info *) be->be_private;
261 assert( bdb != NULL );
265 data.ulen = data.dlen = sizeof( ehbuf );
267 data.flags |= DB_DBT_PARTIAL;
268 rc = cursor->c_get( cursor, &key, &data, DB_NEXT );
271 /* If we're doing linear indexing and there are more attrs to
272 * index, and we're at the end of the database, start over.
274 if ( index_nattrs && rc == DB_NOTFOUND ) {
275 /* optional - do a checkpoint here? */
276 bdb_attr_info_free( bdb->bi_attrs[0] );
277 bdb->bi_attrs[0] = bdb->bi_attrs[index_nattrs];
279 rc = cursor->c_get( cursor, &key, &data, DB_FIRST );
288 BDB_DISK2ID( key.data, &id );
291 if ( tool_filter || tool_base ) {
292 static Operation op = {0};
293 static Opheader ohdr = {0};
297 op.o_tmpmemctx = NULL;
298 op.o_tmpmfuncs = &ch_mfuncs;
300 if ( tool_next_entry ) {
301 bdb_entry_release( &op, tool_next_entry, 0 );
302 tool_next_entry = NULL;
305 rc = bdb_tool_entry_get_int( be, id, &tool_next_entry );
306 if ( rc == LDAP_NO_SUCH_OBJECT ) {
310 assert( tool_next_entry != NULL );
313 /* TODO: needed until BDB_HIER is handled accordingly
314 * in bdb_tool_entry_get_int() */
315 if ( tool_base && !dnIsSuffixScope( &tool_next_entry->e_nname, tool_base, tool_scope ) )
317 bdb_entry_release( &op, tool_next_entry, 0 );
318 tool_next_entry = NULL;
323 if ( tool_filter && test_filter( NULL, tool_next_entry, tool_filter ) != LDAP_COMPARE_TRUE )
325 bdb_entry_release( &op, tool_next_entry, 0 );
326 tool_next_entry = NULL;
334 ID bdb_tool_dn2id_get(
341 EntryInfo *ei = NULL;
344 if ( BER_BVISEMPTY(dn) )
349 op.o_tmpmemctx = NULL;
350 op.o_tmpmfuncs = &ch_mfuncs;
352 rc = bdb_cache_find_ndn( &op, 0, dn, &ei );
353 if ( ei ) bdb_cache_entryinfo_unlock( ei );
354 if ( rc == DB_NOTFOUND )
361 bdb_tool_entry_get_int( BackendDB *be, ID id, Entry **ep )
367 assert( be != NULL );
368 assert( slapMode & SLAP_TOOL_MODE );
370 if ( ( tool_filter || tool_base ) && id == previd && tool_next_entry != NULL ) {
371 *ep = tool_next_entry;
372 tool_next_entry = NULL;
376 if ( id != previd ) {
377 data.ulen = data.dlen = sizeof( ehbuf );
379 data.flags |= DB_DBT_PARTIAL;
381 BDB_ID2DISK( id, &nid );
382 rc = cursor->c_get( cursor, &key, &data, DB_SET );
391 eh.bv.bv_val = ehbuf;
392 eh.bv.bv_len = data.size;
393 rc = entry_header( &eh );
394 eoff = eh.data - eh.bv.bv_val;
402 data.flags &= ~DB_DBT_PARTIAL;
404 rc = cursor->c_get( cursor, &key, &data, DB_CURRENT );
405 if ( rc != DB_BUFFER_SMALL ) {
410 /* Allocate a block and retrieve the data */
411 eh.bv.bv_len = eh.nvals * sizeof( struct berval ) + data.size;
412 eh.bv.bv_val = ch_realloc( eh.bv.bv_val, eh.bv.bv_len );
413 eh.data = eh.bv.bv_val + eh.nvals * sizeof( struct berval );
415 data.ulen = data.size;
417 /* Skip past already parsed nattr/nvals */
420 rc = cursor->c_get( cursor, &key, &data, DB_CURRENT );
427 /* TODO: handle BDB_HIER accordingly */
428 if ( tool_base != NULL ) {
430 entry_decode_dn( &eh, NULL, &ndn );
432 if ( !dnIsSuffixScope( &ndn, tool_base, tool_scope ) ) {
433 return LDAP_NO_SUCH_OBJECT;
438 #ifdef SLAP_ZONE_ALLOC
439 /* FIXME: will add ctx later */
440 rc = entry_decode( &eh, &e, NULL );
442 rc = entry_decode( &eh, &e );
445 if( rc == LDAP_SUCCESS ) {
448 if ( slapMode & SLAP_TOOL_READONLY ) {
449 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
450 EntryInfo *ei = NULL;
456 op.o_tmpmemctx = NULL;
457 op.o_tmpmfuncs = &ch_mfuncs;
459 rc = bdb_cache_find_parent( &op, bdb->bi_cache.c_txn, id, &ei );
460 if ( rc == LDAP_SUCCESS ) {
461 bdb_cache_entryinfo_unlock( ei );
480 bdb_tool_entry_get( BackendDB *be, ID id )
484 (void)bdb_tool_entry_get_int( be, id, &e );
488 static int bdb_tool_next_id(
495 struct berval dn = e->e_name;
496 struct berval ndn = e->e_nname;
497 struct berval pdn, npdn;
498 EntryInfo *ei = NULL, eidummy;
501 if (ndn.bv_len == 0) {
506 rc = bdb_cache_find_ndn( op, tid, &ndn, &ei );
507 if ( ei ) bdb_cache_entryinfo_unlock( ei );
508 if ( rc == DB_NOTFOUND ) {
509 if ( !be_issuffix( op->o_bd, &ndn ) ) {
511 dnParent( &dn, &pdn );
512 dnParent( &ndn, &npdn );
515 rc = bdb_tool_next_id( op, tid, e, text, 1 );
521 /* If parent didn't exist, it was created just now
522 * and its ID is now in e->e_id. Make sure the current
523 * entry gets added under the new parent ID.
525 if ( eid != e->e_id ) {
526 eidummy.bei_id = e->e_id;
530 rc = bdb_next_id( op->o_bd, &e->e_id );
532 snprintf( text->bv_val, text->bv_len,
533 "next_id failed: %s (%d)",
534 db_strerror(rc), rc );
535 Debug( LDAP_DEBUG_ANY,
536 "=> bdb_tool_next_id: %s\n", text->bv_val, 0, 0 );
539 rc = bdb_dn2id_add( op, tid, ei, e );
541 snprintf( text->bv_val, text->bv_len,
542 "dn2id_add failed: %s (%d)",
543 db_strerror(rc), rc );
544 Debug( LDAP_DEBUG_ANY,
545 "=> bdb_tool_next_id: %s\n", text->bv_val, 0, 0 );
547 if ( nholes == nhmax - 1 ) {
548 if ( holes == hbuf ) {
549 holes = ch_malloc( nhmax * sizeof(dn_id) * 2 );
550 AC_MEMCPY( holes, hbuf, sizeof(hbuf) );
552 holes = ch_realloc( holes, nhmax * sizeof(dn_id) * 2 );
556 ber_dupbv( &holes[nholes].dn, &ndn );
557 holes[nholes++].id = e->e_id;
559 } else if ( !hole ) {
562 e->e_id = ei->bei_id;
564 for ( i=0; i<nholes; i++) {
565 if ( holes[i].id == e->e_id ) {
566 free(holes[i].dn.bv_val);
567 for (j=i;j<nholes;j++) holes[j] = holes[j+1];
571 } else if ( holes[i].id > e->e_id ) {
585 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
587 if ( !bdb->bi_nattrs )
590 if ( bdb_tool_threads > 1 ) {
595 ir = bdb_tool_index_rec;
596 memset(ir, 0, bdb->bi_nattrs * sizeof( IndexRec ));
598 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
599 rc = bdb_index_recset( bdb, a, a->a_desc->ad_type,
600 &a->a_desc->ad_tags, ir );
604 bdb_tool_ix_id = e->e_id;
606 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
607 /* Wait for all threads to be ready */
608 while ( bdb_tool_index_tcount > 0 ) {
609 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
610 &bdb_tool_index_mutex );
612 for ( i=1; i<bdb_tool_threads; i++ )
613 bdb_tool_index_threads[i] = LDAP_BUSY;
614 bdb_tool_index_tcount = bdb_tool_threads - 1;
615 ldap_pvt_thread_cond_broadcast( &bdb_tool_index_cond_work );
616 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
617 rc = bdb_index_recrun( op, bdb, ir, e->e_id, 0 );
620 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
621 for ( i=1; i<bdb_tool_threads; i++ ) {
622 if ( bdb_tool_index_threads[i] == LDAP_BUSY ) {
623 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
624 &bdb_tool_index_mutex );
628 if ( bdb_tool_index_threads[i] ) {
629 rc = bdb_tool_index_threads[i];
633 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
636 return bdb_index_entry_add( op, txn, e );
640 ID bdb_tool_entry_put(
643 struct berval *text )
646 struct bdb_info *bdb;
651 assert( be != NULL );
652 assert( slapMode & SLAP_TOOL_MODE );
654 assert( text != NULL );
655 assert( text->bv_val != NULL );
656 assert( text->bv_val[0] == '\0' ); /* overconservative? */
658 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_tool_entry_put)
659 "( %ld, \"%s\" )\n", (long) e->e_id, e->e_dn, 0 );
661 bdb = (struct bdb_info *) be->be_private;
663 if (! (slapMode & SLAP_TOOL_QUICK)) {
664 rc = TXN_BEGIN( bdb->bi_dbenv, NULL, &tid,
665 bdb->bi_db_opflags );
667 snprintf( text->bv_val, text->bv_len,
668 "txn_begin failed: %s (%d)",
669 db_strerror(rc), rc );
670 Debug( LDAP_DEBUG_ANY,
671 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
672 text->bv_val, 0, 0 );
679 op.o_tmpmemctx = NULL;
680 op.o_tmpmfuncs = &ch_mfuncs;
682 /* add dn2id indices */
683 rc = bdb_tool_next_id( &op, tid, e, text, 0 );
689 if (( slapMode & SLAP_TOOL_QUICK ) && (( e->e_id & 0xfff ) == 0xfff )) {
690 ldap_pvt_thread_cond_signal( &bdb_tool_trickle_cond );
694 if ( !bdb->bi_linear_index )
695 rc = bdb_tool_index_add( &op, tid, e );
697 snprintf( text->bv_val, text->bv_len,
698 "index_entry_add failed: %s (%d)",
699 rc == LDAP_OTHER ? "Internal error" :
700 db_strerror(rc), rc );
701 Debug( LDAP_DEBUG_ANY,
702 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
703 text->bv_val, 0, 0 );
708 rc = bdb_id2entry_add( be, tid, e );
710 snprintf( text->bv_val, text->bv_len,
711 "id2entry_add failed: %s (%d)",
712 db_strerror(rc), rc );
713 Debug( LDAP_DEBUG_ANY,
714 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
715 text->bv_val, 0, 0 );
721 if ( !( slapMode & SLAP_TOOL_QUICK )) {
722 rc = TXN_COMMIT( tid, 0 );
724 snprintf( text->bv_val, text->bv_len,
725 "txn_commit failed: %s (%d)",
726 db_strerror(rc), rc );
727 Debug( LDAP_DEBUG_ANY,
728 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
729 text->bv_val, 0, 0 );
735 if ( !( slapMode & SLAP_TOOL_QUICK )) {
737 snprintf( text->bv_val, text->bv_len,
738 "txn_aborted! %s (%d)",
739 rc == LDAP_OTHER ? "Internal error" :
740 db_strerror(rc), rc );
741 Debug( LDAP_DEBUG_ANY,
742 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
743 text->bv_val, 0, 0 );
751 int bdb_tool_entry_reindex(
754 AttributeDescription **adv )
756 struct bdb_info *bi = (struct bdb_info *) be->be_private;
763 Debug( LDAP_DEBUG_ARGS,
764 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) "( %ld )\n",
766 assert( tool_base == NULL );
767 assert( tool_filter == NULL );
769 /* No indexes configured, nothing to do. Could return an
770 * error here to shortcut things.
776 /* Check for explicit list of attrs to index */
780 if ( bi->bi_attrs[0]->ai_desc != adv[0] ) {
782 for ( n = 0; adv[n]; n++ ) ;
785 for ( i = 0; i < n; i++ ) {
786 AttributeDescription *ad = adv[i];
787 for ( j = i-1; j>=0; j--) {
788 if ( SLAP_PTRCMP( adv[j], ad ) <= 0 ) break;
795 for ( i = 0; adv[i]; i++ ) {
796 if ( bi->bi_attrs[i]->ai_desc != adv[i] ) {
797 for ( j = i+1; j < bi->bi_nattrs; j++ ) {
798 if ( bi->bi_attrs[j]->ai_desc == adv[i] ) {
799 AttrInfo *ai = bi->bi_attrs[i];
800 bi->bi_attrs[i] = bi->bi_attrs[j];
801 bi->bi_attrs[j] = ai;
805 if ( j == bi->bi_nattrs ) {
806 Debug( LDAP_DEBUG_ANY,
807 LDAP_XSTRING(bdb_tool_entry_reindex)
808 ": no index configured for %s\n",
809 adv[i]->ad_cname.bv_val, 0, 0 );
817 /* Get the first attribute to index */
818 if (bi->bi_linear_index && !index_nattrs) {
819 index_nattrs = bi->bi_nattrs - 1;
823 e = bdb_tool_entry_get( be, id );
826 Debug( LDAP_DEBUG_ANY,
827 LDAP_XSTRING(bdb_tool_entry_reindex)
828 ": could not locate id=%ld\n",
833 if (! (slapMode & SLAP_TOOL_QUICK)) {
834 rc = TXN_BEGIN( bi->bi_dbenv, NULL, &tid, bi->bi_db_opflags );
836 Debug( LDAP_DEBUG_ANY,
837 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) ": "
838 "txn_begin failed: %s (%d)\n",
839 db_strerror(rc), rc, 0 );
845 * just (re)add them for now
846 * assume that some other routine (not yet implemented)
847 * will zap index databases
851 Debug( LDAP_DEBUG_TRACE,
852 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) "( %ld, \"%s\" )\n",
853 (long) id, e->e_dn, 0 );
857 op.o_tmpmemctx = NULL;
858 op.o_tmpmfuncs = &ch_mfuncs;
860 rc = bdb_tool_index_add( &op, tid, e );
864 if (! (slapMode & SLAP_TOOL_QUICK)) {
865 rc = TXN_COMMIT( tid, 0 );
867 Debug( LDAP_DEBUG_ANY,
868 "=> " LDAP_XSTRING(bdb_tool_entry_reindex)
869 ": txn_commit failed: %s (%d)\n",
870 db_strerror(rc), rc, 0 );
876 if (! (slapMode & SLAP_TOOL_QUICK)) {
878 Debug( LDAP_DEBUG_ANY,
879 "=> " LDAP_XSTRING(bdb_tool_entry_reindex)
880 ": txn_aborted! %s (%d)\n",
881 db_strerror(rc), rc, 0 );
885 bdb_entry_release( &op, e, 0 );
890 ID bdb_tool_entry_modify(
893 struct berval *text )
896 struct bdb_info *bdb;
901 assert( be != NULL );
902 assert( slapMode & SLAP_TOOL_MODE );
904 assert( text != NULL );
905 assert( text->bv_val != NULL );
906 assert( text->bv_val[0] == '\0' ); /* overconservative? */
908 assert ( e->e_id != NOID );
910 Debug( LDAP_DEBUG_TRACE,
911 "=> " LDAP_XSTRING(bdb_tool_entry_modify) "( %ld, \"%s\" )\n",
912 (long) e->e_id, e->e_dn, 0 );
914 bdb = (struct bdb_info *) be->be_private;
916 if (! (slapMode & SLAP_TOOL_QUICK)) {
918 cursor->c_close( cursor );
921 rc = TXN_BEGIN( bdb->bi_dbenv, NULL, &tid,
922 bdb->bi_db_opflags );
924 snprintf( text->bv_val, text->bv_len,
925 "txn_begin failed: %s (%d)",
926 db_strerror(rc), rc );
927 Debug( LDAP_DEBUG_ANY,
928 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
929 text->bv_val, 0, 0 );
936 op.o_tmpmemctx = NULL;
937 op.o_tmpmfuncs = &ch_mfuncs;
940 rc = bdb_id2entry_update( be, tid, e );
942 snprintf( text->bv_val, text->bv_len,
943 "id2entry_add failed: %s (%d)",
944 db_strerror(rc), rc );
945 Debug( LDAP_DEBUG_ANY,
946 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
947 text->bv_val, 0, 0 );
953 if (! (slapMode & SLAP_TOOL_QUICK)) {
954 rc = TXN_COMMIT( tid, 0 );
956 snprintf( text->bv_val, text->bv_len,
957 "txn_commit failed: %s (%d)",
958 db_strerror(rc), rc );
959 Debug( LDAP_DEBUG_ANY,
960 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": "
961 "%s\n", text->bv_val, 0, 0 );
967 if (! (slapMode & SLAP_TOOL_QUICK)) {
969 snprintf( text->bv_val, text->bv_len,
970 "txn_aborted! %s (%d)",
971 db_strerror(rc), rc );
972 Debug( LDAP_DEBUG_ANY,
973 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
974 text->bv_val, 0, 0 );
982 #ifdef BDB_TOOL_IDL_CACHING
984 bdb_tool_idl_cmp( const void *v1, const void *v2 )
986 const bdb_tool_idl_cache *c1 = v1, *c2 = v2;
989 if (( rc = c1->kstr.bv_len - c2->kstr.bv_len )) return rc;
990 return memcmp( c1->kstr.bv_val, c2->kstr.bv_val, c1->kstr.bv_len );
994 bdb_tool_idl_flush_one( void *v1, void *arg )
996 bdb_tool_idl_cache *ic = v1;
998 struct bdb_info *bdb = bdb_tool_info;
999 bdb_tool_idl_cache_entry *ice;
1005 /* Freshly allocated, ignore it */
1006 if ( !ic->head && ic->count <= BDB_IDL_DB_SIZE ) {
1010 rc = db->cursor( db, NULL, &curs, 0 );
1017 bv2DBT( &ic->kstr, &key );
1019 data.size = data.ulen = sizeof( ID );
1020 data.flags = DB_DBT_USERMEM;
1023 rc = curs->c_get( curs, &key, &data, DB_SET );
1024 /* If key already exists and we're writing a range... */
1025 if ( rc == 0 && ic->count > BDB_IDL_DB_SIZE ) {
1026 /* If it's not currently a range, must delete old info */
1029 while ( curs->c_get( curs, &key, &data, DB_NEXT_DUP ) == 0 )
1030 curs->c_del( curs, 0 );
1033 /* Store range marker */
1034 curs->c_put( curs, &key, &data, DB_KEYFIRST );
1038 rc = curs->c_get( curs, &key, &data, DB_NEXT_DUP );
1041 rc = curs->c_get( curs, &key, &data, DB_NEXT_DUP );
1044 curs->c_del( curs, 0 );
1046 BDB_ID2DISK( ic->last, &nid );
1047 curs->c_put( curs, &key, &data, DB_KEYLAST );
1049 } else if ( rc && rc != DB_NOTFOUND ) {
1051 } else if ( ic->count > BDB_IDL_DB_SIZE ) {
1052 /* range, didn't exist before */
1054 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
1056 BDB_ID2DISK( ic->first, &nid );
1057 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
1059 BDB_ID2DISK( ic->last, &nid );
1060 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
1069 /* Just a normal write */
1071 for ( ice = ic->head, n=0; ice; ice = ice->next, n++ ) {
1076 end = ic->count & (IDBLOCK-1);
1080 for ( i=0; i<end; i++ ) {
1081 if ( !ice->ids[i] ) continue;
1082 BDB_ID2DISK( ice->ids[i], &nid );
1083 rc = curs->c_put( curs, &key, &data, DB_NODUPDATA );
1085 if ( rc == DB_KEYEXIST ) {
1099 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1100 ic->tail->next = bdb_tool_idl_free_list;
1101 bdb_tool_idl_free_list = ic->head;
1102 bdb->bi_idl_cache_size -= n;
1103 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1106 if ( ic != db->app_private ) {
1109 ic->head = ic->tail = NULL;
1111 curs->c_close( curs );
1116 bdb_tool_idl_flush_db( DB *db, bdb_tool_idl_cache *ic )
1118 Avlnode *root = db->app_private;
1121 db->app_private = ic;
1122 rc = avl_apply( root, bdb_tool_idl_flush_one, db, -1, AVL_INORDER );
1123 avl_free( root, NULL );
1124 db->app_private = NULL;
1131 bdb_tool_idl_flush( BackendDB *be )
1133 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
1138 for ( i=BDB_NDB; i < bdb->bi_ndatabases; i++ ) {
1139 db = bdb->bi_databases[i]->bdi_db;
1140 if ( !db->app_private ) continue;
1141 rc = bdb_tool_idl_flush_db( db, NULL );
1146 bdb->bi_idl_cache_size = 0;
1151 int bdb_tool_idl_add(
1158 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
1159 bdb_tool_idl_cache *ic, itmp;
1160 bdb_tool_idl_cache_entry *ice;
1163 if ( !bdb->bi_idl_cache_max_size )
1164 return bdb_idl_insert_key( be, db, txn, key, id );
1166 DBT2bv( key, &itmp.kstr );
1168 ic = avl_find( (Avlnode *)db->app_private, &itmp, bdb_tool_idl_cmp );
1170 /* No entry yet, create one */
1177 ic = ch_malloc( sizeof( bdb_tool_idl_cache ) + itmp.kstr.bv_len );
1178 ic->kstr.bv_len = itmp.kstr.bv_len;
1179 ic->kstr.bv_val = (char *)(ic+1);
1180 AC_MEMCPY( ic->kstr.bv_val, itmp.kstr.bv_val, ic->kstr.bv_len );
1181 ic->head = ic->tail = NULL;
1184 avl_insert( (Avlnode **)&db->app_private, ic, bdb_tool_idl_cmp,
1187 /* load existing key count here */
1188 rc = db->cursor( db, NULL, &curs, 0 );
1189 if ( rc ) return rc;
1191 data.ulen = sizeof( ID );
1192 data.flags = DB_DBT_USERMEM;
1194 rc = curs->c_get( curs, key, &data, DB_SET );
1197 ic->count = BDB_IDL_DB_SIZE+1;
1201 curs->c_count( curs, &count, 0 );
1203 BDB_DISK2ID( &nid, &ic->first );
1206 curs->c_close( curs );
1208 /* are we a range already? */
1209 if ( ic->count > BDB_IDL_DB_SIZE ) {
1212 /* Are we at the limit, and converting to a range? */
1213 } else if ( ic->count == BDB_IDL_DB_SIZE ) {
1215 for ( ice = ic->head, n=0; ice; ice = ice->next, n++ )
1218 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1219 ic->tail->next = bdb_tool_idl_free_list;
1220 bdb_tool_idl_free_list = ic->head;
1221 bdb->bi_idl_cache_size -= n;
1222 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1224 ic->head = ic->tail = NULL;
1229 /* No free block, create that too */
1230 if ( !ic->tail || ( ic->count & (IDBLOCK-1)) == 0) {
1232 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1233 if ( bdb->bi_idl_cache_size >= bdb->bi_idl_cache_max_size ) {
1234 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1235 rc = bdb_tool_idl_flush_db( db, ic );
1238 avl_insert( (Avlnode **)&db->app_private, ic, bdb_tool_idl_cmp,
1240 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1242 bdb->bi_idl_cache_size++;
1243 if ( bdb_tool_idl_free_list ) {
1244 ice = bdb_tool_idl_free_list;
1245 bdb_tool_idl_free_list = ice->next;
1247 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1249 ice = ch_malloc( sizeof( bdb_tool_idl_cache_entry ));
1251 memset( ice, 0, sizeof( *ice ));
1255 ic->tail->next = ice;
1262 ice->ids[ ic->count & (IDBLOCK-1) ] = id;
1271 bdb_tool_trickle_task( void *ctx, void *ptr )
1276 ldap_pvt_thread_mutex_lock( &bdb_tool_trickle_mutex );
1277 bdb_tool_trickle_active = 1;
1278 ldap_pvt_thread_cond_signal( &bdb_tool_trickle_cond_end );
1280 ldap_pvt_thread_cond_wait( &bdb_tool_trickle_cond,
1281 &bdb_tool_trickle_mutex );
1282 if ( slapd_shutdown )
1284 env->memp_trickle( env, 30, &wrote );
1286 bdb_tool_trickle_active = 0;
1287 ldap_pvt_thread_cond_signal( &bdb_tool_trickle_cond_end );
1288 ldap_pvt_thread_mutex_unlock( &bdb_tool_trickle_mutex );
1295 bdb_tool_index_task( void *ctx, void *ptr )
1297 int base = *(int *)ptr;
1301 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
1302 bdb_tool_index_tcount--;
1303 if ( !bdb_tool_index_tcount )
1304 ldap_pvt_thread_cond_signal( &bdb_tool_index_cond_main );
1305 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_work,
1306 &bdb_tool_index_mutex );
1307 if ( slapd_shutdown ) {
1308 bdb_tool_index_tcount--;
1309 if ( !bdb_tool_index_tcount )
1310 ldap_pvt_thread_cond_signal( &bdb_tool_index_cond_main );
1311 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
1314 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
1316 bdb_tool_index_threads[base] = bdb_index_recrun( bdb_tool_ix_op,
1317 bdb_tool_info, bdb_tool_index_rec, bdb_tool_ix_id, base );