git.sur5r.net Git - openldap/blob - servers/slapd/back-bdb/tools.c

   1 /* tools.c - tools for slap tools */
   2 /* $OpenLDAP$ */
   3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   4  *
   5  * Copyright 2000-2006 The OpenLDAP Foundation.
   6  * All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted only as authorized by the OpenLDAP
  10  * Public License.
  11  *
  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>.
  15  */
  16
  17 #include "portable.h"
  18
  19 #include <stdio.h>
  20 #include <ac/string.h>
  21 #include <ac/errno.h>
  22
  23 #define AVL_INTERNAL
  24 #include "back-bdb.h"
  25 #include "idl.h"
  26
  27 static DBC *cursor = NULL;
  28 static DBT key, data;
  29 static EntryHeader eh;
  30 static int eoff;
  31
  32 typedef struct dn_id {
  33         ID id;
  34         struct berval dn;
  35 } dn_id;
  36
  37 #define HOLE_SIZE       4096
  38 static dn_id hbuf[HOLE_SIZE], *holes = hbuf;
  39 static unsigned nhmax = HOLE_SIZE;
  40 static unsigned nholes;
  41
  42 static int index_nattrs;
  43
  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)
  48
  49 static int bdb_tool_idl_flush( BackendDB *be );
  50
  51 #define IDBLOCK 1024
  52
  53 typedef struct bdb_tool_idl_cache_entry {
  54         struct bdb_tool_idl_cache_entry *next;
  55         ID ids[IDBLOCK];
  56 } bdb_tool_idl_cache_entry;
  57
  58 typedef struct bdb_tool_idl_cache {
  59         struct berval kstr;
  60         bdb_tool_idl_cache_entry *head, *tail;
  61         ID first, last;
  62         int count;
  63 } bdb_tool_idl_cache;
  64
  65 static bdb_tool_idl_cache_entry *bdb_tool_idl_free_list;
  66 #endif  /* BDB_TOOL_IDL_CACHING */
  67
  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;
  76
  77 static void * bdb_tool_index_task( void *ctx, void *ptr );
  78
  79 int bdb_tool_entry_open(
  80         BackendDB *be, int mode )
  81 {
  82         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
  83
  84         /* initialize key and data thangs */
  85         DBTzero( &key );
  86         DBTzero( &data );
  87         key.flags = DB_DBT_REALLOC;
  88         data.flags = DB_DBT_USERMEM;
  89
  90         if (cursor == NULL) {
  91                 int rc = bdb->bi_id2entry->bdi_db->cursor(
  92                         bdb->bi_id2entry->bdi_db, NULL, &cursor,
  93                         bdb->bi_db_opflags );
  94                 if( rc != 0 ) {
  95                         return -1;
  96                 }
  97         }
  98
  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 ) {
 103                         int i;
 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 ));
 112                                 *ptr = i;
 113                                 ldap_pvt_thread_pool_submit( &connection_pool,
 114                                         bdb_tool_index_task, ptr );
 115                         }
 116                 }
 117                 bdb_tool_info = bdb;
 118         }
 119
 120         return 0;
 121 }
 122
 123 int bdb_tool_entry_close(
 124         BackendDB *be )
 125 {
 126         if ( bdb_tool_info ) {
 127                 slapd_shutdown = 1;
 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 );
 132         }
 133
 134         if( key.data ) {
 135                 ch_free( key.data );
 136                 key.data = NULL;
 137         }
 138         if( eh.bv.bv_val ) {
 139                 ch_free( eh.bv.bv_val );
 140                 eh.bv.bv_val = NULL;
 141         }
 142
 143         if( cursor ) {
 144                 cursor->c_close( cursor );
 145                 cursor = NULL;
 146         }
 147
 148 #ifdef BDB_TOOL_IDL_CACHING
 149         bdb_tool_idl_flush( be );
 150 #endif
 151
 152         if( nholes ) {
 153                 unsigned i;
 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);
 158                 }
 159                 return -1;
 160         }
 161
 162         return 0;
 163 }
 164
 165 ID bdb_tool_entry_next(
 166         BackendDB *be )
 167 {
 168         int rc;
 169         ID id;
 170         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 171         char buf[16], *dptr;
 172
 173         assert( be != NULL );
 174         assert( slapMode & SLAP_TOOL_MODE );
 175         assert( bdb != NULL );
 176
 177         /* Get the header */
 178         data.ulen = data.dlen = sizeof( buf );
 179         data.data = buf;
 180         data.flags |= DB_DBT_PARTIAL;
 181         rc = cursor->c_get( cursor, &key, &data, DB_NEXT );
 182
 183         if( rc ) {
 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.
 186                  */
 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];
 191                         index_nattrs--;
 192                         rc = cursor->c_get( cursor, &key, &data, DB_FIRST );
 193                         if ( rc ) {
 194                                 return NOID;
 195                         }
 196                 } else {
 197                         return NOID;
 198                 }
 199         }
 200
 201         dptr = eh.bv.bv_val;
 202         eh.bv.bv_val = buf;
 203         eh.bv.bv_len = data.size;
 204         rc = entry_header( &eh );
 205         eoff = eh.data - eh.bv.bv_val;
 206         eh.bv.bv_val = dptr;
 207         if( rc ) {
 208                 return NOID;
 209         }
 210
 211         BDB_DISK2ID( key.data, &id );
 212         return id;
 213 }
 214
 215 ID bdb_tool_dn2id_get(
 216         Backend *be,
 217         struct berval *dn
 218 )
 219 {
 220         Operation op = {0};
 221         Opheader ohdr = {0};
 222         EntryInfo *ei = NULL;
 223         int rc;
 224
 225         if ( BER_BVISEMPTY(dn) )
 226                 return 0;
 227
 228         op.o_hdr = &ohdr;
 229         op.o_bd = be;
 230         op.o_tmpmemctx = NULL;
 231         op.o_tmpmfuncs = &ch_mfuncs;
 232
 233         rc = bdb_cache_find_ndn( &op, NULL, dn, &ei );
 234         if ( ei ) bdb_cache_entryinfo_unlock( ei );
 235         if ( rc == DB_NOTFOUND )
 236                 return NOID;
 237
 238         return ei->bei_id;
 239 }
 240
 241 int bdb_tool_id2entry_get(
 242         Backend *be,
 243         ID id,
 244         Entry **e
 245 )
 246 {
 247         int rc = bdb_id2entry( be, NULL, 0, id, e );
 248
 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,
 256                         &gluebv, NULL );
 257                 *e = dummy;
 258                 rc = LDAP_SUCCESS;
 259         }
 260         return rc;
 261 }
 262
 263 Entry* bdb_tool_entry_get( BackendDB *be, ID id )
 264 {
 265         int rc, off;
 266         Entry *e = NULL;
 267         char *dptr;
 268
 269         assert( be != NULL );
 270         assert( slapMode & SLAP_TOOL_MODE );
 271
 272         /* Get the size */
 273         data.flags ^= DB_DBT_PARTIAL;
 274         data.ulen = 0;
 275     rc = cursor->c_get( cursor, &key, &data, DB_CURRENT );
 276         if ( rc != ENOMEM ) goto leave;
 277
 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 );
 282         data.data = eh.data;
 283         data.ulen = data.size;
 284
 285         /* Skip past already parsed nattr/nvals */
 286         eh.data += eoff;
 287
 288     rc = cursor->c_get( cursor, &key, &data, DB_CURRENT );
 289         if ( rc ) goto leave;
 290
 291 #ifdef SLAP_ZONE_ALLOC
 292         /* FIXME: will add ctx later */
 293         rc = entry_decode( &eh, &e, NULL );
 294 #else
 295         rc = entry_decode( &eh, &e );
 296 #endif
 297
 298         if( rc == LDAP_SUCCESS ) {
 299                 e->e_id = id;
 300 #ifdef BDB_HIER
 301                 if ( slapMode & SLAP_TOOL_READONLY ) {
 302                         EntryInfo *ei = NULL;
 303                         Operation op = {0};
 304                         Opheader ohdr = {0};
 305
 306                         op.o_hdr = &ohdr;
 307                         op.o_bd = be;
 308                         op.o_tmpmemctx = NULL;
 309                         op.o_tmpmfuncs = &ch_mfuncs;
 310
 311                         rc = bdb_cache_find_parent( &op, NULL, cursor->locker, id, &ei );
 312                         if ( rc == LDAP_SUCCESS ) {
 313                                 bdb_cache_entryinfo_unlock( ei );
 314                                 e->e_private = ei;
 315                                 ei->bei_e = e;
 316                                 bdb_fix_dn( e, 0 );
 317                                 ei->bei_e = NULL;
 318                                 e->e_private = NULL;
 319                         }
 320                 }
 321 #endif
 322         }
 323 leave:
 324         return e;
 325 }
 326
 327 static int bdb_tool_next_id(
 328         Operation *op,
 329         DB_TXN *tid,
 330         Entry *e,
 331         struct berval *text,
 332         int hole )
 333 {
 334         struct berval dn = e->e_name;
 335         struct berval ndn = e->e_nname;
 336         struct berval pdn, npdn;
 337         EntryInfo *ei = NULL, eidummy;
 338         int rc;
 339
 340         if (ndn.bv_len == 0) {
 341                 e->e_id = 0;
 342                 return 0;
 343         }
 344
 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 ) ) {
 349                         ID eid = e->e_id;
 350                         dnParent( &dn, &pdn );
 351                         dnParent( &ndn, &npdn );
 352                         e->e_name = pdn;
 353                         e->e_nname = npdn;
 354                         rc = bdb_tool_next_id( op, tid, e, text, 1 );
 355                         e->e_name = dn;
 356                         e->e_nname = ndn;
 357                         if ( rc ) {
 358                                 return rc;
 359                         }
 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.
 363                          */
 364                         if ( eid != e->e_id ) {
 365                                 eidummy.bei_id = e->e_id;
 366                                 ei = &eidummy;
 367                         }
 368                 }
 369                 rc = bdb_next_id( op->o_bd, tid, &e->e_id );
 370                 if ( rc ) {
 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 );
 376                         return rc;
 377                 }
 378                 rc = bdb_dn2id_add( op, tid, ei, e );
 379                 if ( rc ) {
 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 );
 385                 } else if ( hole ) {
 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) );
 390                                 } else {
 391                                         holes = ch_realloc( holes, nhmax * sizeof(dn_id) * 2 );
 392                                 }
 393                                 nhmax *= 2;
 394                         }
 395                         ber_dupbv( &holes[nholes].dn, &ndn );
 396                         holes[nholes++].id = e->e_id;
 397                 }
 398         } else if ( !hole ) {
 399                 unsigned i;
 400
 401                 e->e_id = ei->bei_id;
 402
 403                 for ( i=0; i<nholes; i++) {
 404                         if ( holes[i].id == e->e_id ) {
 405                                 int j;
 406                                 free(holes[i].dn.bv_val);
 407                                 for (j=i;j<nholes;j++) holes[j] = holes[j+1];
 408                                 holes[j].id = 0;
 409                                 nholes--;
 410                                 break;
 411                         } else if ( holes[i].id > e->e_id ) {
 412                                 break;
 413                         }
 414                 }
 415         }
 416         return rc;
 417 }
 418
 419 static int
 420 bdb_tool_index_add(
 421         Operation *op,
 422         DB_TXN *txn,
 423         Entry *e )
 424 {
 425         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 426
 427         if ( slapMode & SLAP_TOOL_QUICK ) {
 428                 IndexRec *ir;
 429                 int i, rc;
 430                 Attribute *a;
 431
 432                 ir = bdb_tool_index_rec;
 433                 memset(ir, 0, bdb->bi_nattrs * sizeof( IndexRec ));
 434
 435                 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
 436                         rc = bdb_index_recset( bdb, a, a->a_desc->ad_type,
 437                                 &a->a_desc->ad_tags, ir );
 438                         if ( rc )
 439                                 return rc;
 440                 }
 441                 bdb_tool_ix_id = e->e_id;
 442                 bdb_tool_ix_op = op;
 443                 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
 444                 /* Wait for all threads to be ready */
 445                 while ( bdb_tool_index_tcount ) {
 446                         ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
 447                                 &bdb_tool_index_mutex );
 448                 }
 449                 for ( i=1; i<slap_tool_thread_max; i++ )
 450                         bdb_tool_index_threads[i] = LDAP_BUSY;
 451                 bdb_tool_index_tcount = slap_tool_thread_max - 1;
 452                 ldap_pvt_thread_cond_broadcast( &bdb_tool_index_cond_work );
 453                 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
 454                 rc = bdb_index_recrun( op, bdb, ir, e->e_id, 0 );
 455                 if ( rc )
 456                         return rc;
 457                 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
 458                 for ( i=1; i<slap_tool_thread_max; i++ ) {
 459                         if ( bdb_tool_index_threads[i] == LDAP_BUSY ) {
 460                                 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_main,
 461                                         &bdb_tool_index_mutex );
 462                                 i--;
 463                                 continue;
 464                         }
 465                         if ( bdb_tool_index_threads[i] ) {
 466                                 rc = bdb_tool_index_threads[i];
 467                                 break;
 468                         }
 469                 }
 470                 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
 471                 return rc;
 472         } else {
 473                 return bdb_index_entry_add( op, txn, e );
 474         }
 475 }
 476
 477 ID bdb_tool_entry_put(
 478         BackendDB *be,
 479         Entry *e,
 480         struct berval *text )
 481 {
 482         int rc;
 483         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 484         DB_TXN *tid = NULL;
 485         Operation op = {0};
 486         Opheader ohdr = {0};
 487
 488         assert( be != NULL );
 489         assert( slapMode & SLAP_TOOL_MODE );
 490
 491         assert( text != NULL );
 492         assert( text->bv_val != NULL );
 493         assert( text->bv_val[0] == '\0' );      /* overconservative? */
 494
 495         Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_tool_entry_put)
 496                 "( %ld, \"%s\" )\n", (long) e->e_id, e->e_dn, 0 );
 497
 498         if (! (slapMode & SLAP_TOOL_QUICK)) {
 499         rc = TXN_BEGIN( bdb->bi_dbenv, NULL, &tid,
 500                 bdb->bi_db_opflags );
 501         if( rc != 0 ) {
 502                 snprintf( text->bv_val, text->bv_len,
 503                         "txn_begin failed: %s (%d)",
 504                         db_strerror(rc), rc );
 505                 Debug( LDAP_DEBUG_ANY,
 506                         "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
 507                          text->bv_val, 0, 0 );
 508                 return NOID;
 509         }
 510         }
 511
 512         op.o_hdr = &ohdr;
 513         op.o_bd = be;
 514         op.o_tmpmemctx = NULL;
 515         op.o_tmpmfuncs = &ch_mfuncs;
 516
 517         /* add dn2id indices */
 518         rc = bdb_tool_next_id( &op, tid, e, text, 0 );
 519         if( rc != 0 ) {
 520                 goto done;
 521         }
 522
 523         if ( !bdb->bi_linear_index )
 524                 rc = bdb_tool_index_add( &op, tid, e );
 525         if( rc != 0 ) {
 526                 snprintf( text->bv_val, text->bv_len,
 527                                 "index_entry_add failed: %s (%d)",
 528                                 db_strerror(rc), rc );
 529                 Debug( LDAP_DEBUG_ANY,
 530                         "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
 531                         text->bv_val, 0, 0 );
 532                 goto done;
 533         }
 534
 535         /* id2entry index */
 536         rc = bdb_id2entry_add( be, tid, e );
 537         if( rc != 0 ) {
 538                 snprintf( text->bv_val, text->bv_len,
 539                                 "id2entry_add failed: %s (%d)",
 540                                 db_strerror(rc), rc );
 541                 Debug( LDAP_DEBUG_ANY,
 542                         "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
 543                         text->bv_val, 0, 0 );
 544                 goto done;
 545         }
 546
 547 done:
 548         if( rc == 0 ) {
 549                 if ( !( slapMode & SLAP_TOOL_QUICK )) {
 550                 rc = TXN_COMMIT( tid, 0 );
 551                 if( rc != 0 ) {
 552                         snprintf( text->bv_val, text->bv_len,
 553                                         "txn_commit failed: %s (%d)",
 554                                         db_strerror(rc), rc );
 555                         Debug( LDAP_DEBUG_ANY,
 556                                 "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
 557                                 text->bv_val, 0, 0 );
 558                         e->e_id = NOID;
 559                 }
 560                 }
 561
 562         } else {
 563                 if ( !( slapMode & SLAP_TOOL_QUICK )) {
 564                 TXN_ABORT( tid );
 565                 snprintf( text->bv_val, text->bv_len,
 566                         "txn_aborted! %s (%d)",
 567                         db_strerror(rc), rc );
 568                 Debug( LDAP_DEBUG_ANY,
 569                         "=> " LDAP_XSTRING(bdb_tool_entry_put) ": %s\n",
 570                         text->bv_val, 0, 0 );
 571                 }
 572                 e->e_id = NOID;
 573         }
 574
 575         return e->e_id;
 576 }
 577
 578 int bdb_tool_entry_reindex(
 579         BackendDB *be,
 580         ID id )
 581 {
 582         struct bdb_info *bi = (struct bdb_info *) be->be_private;
 583         int rc;
 584         Entry *e;
 585         DB_TXN *tid = NULL;
 586         Operation op = {0};
 587         Opheader ohdr = {0};
 588
 589         Debug( LDAP_DEBUG_ARGS,
 590                 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) "( %ld )\n",
 591                 (long) id, 0, 0 );
 592
 593         /* No indexes configured, nothing to do. Could return an
 594          * error here to shortcut things.
 595          */
 596         if (!bi->bi_attrs) {
 597                 return 0;
 598         }
 599
 600         /* Get the first attribute to index */
 601         if (bi->bi_linear_index && !index_nattrs) {
 602                 index_nattrs = bi->bi_nattrs - 1;
 603                 bi->bi_nattrs = 1;
 604         }
 605
 606         e = bdb_tool_entry_get( be, id );
 607
 608         if( e == NULL ) {
 609                 Debug( LDAP_DEBUG_ANY,
 610                         LDAP_XSTRING(bdb_tool_entry_reindex)
 611                         ": could not locate id=%ld\n",
 612                         (long) id, 0, 0 );
 613                 return -1;
 614         }
 615
 616         if (! (slapMode & SLAP_TOOL_QUICK)) {
 617         rc = TXN_BEGIN( bi->bi_dbenv, NULL, &tid, bi->bi_db_opflags );
 618         if( rc != 0 ) {
 619                 Debug( LDAP_DEBUG_ANY,
 620                         "=> " LDAP_XSTRING(bdb_tool_entry_reindex) ": "
 621                         "txn_begin failed: %s (%d)\n",
 622                         db_strerror(rc), rc, 0 );
 623                 goto done;
 624         }
 625         }
 626
 627         /*
 628          * just (re)add them for now
 629          * assume that some other routine (not yet implemented)
 630          * will zap index databases
 631          *
 632          */
 633
 634         Debug( LDAP_DEBUG_TRACE,
 635                 "=> " LDAP_XSTRING(bdb_tool_entry_reindex) "( %ld, \"%s\" )\n",
 636                 (long) id, e->e_dn, 0 );
 637
 638         op.o_hdr = &ohdr;
 639         op.o_bd = be;
 640         op.o_tmpmemctx = NULL;
 641         op.o_tmpmfuncs = &ch_mfuncs;
 642
 643         rc = bdb_tool_index_add( &op, tid, e );
 644
 645 done:
 646         if( rc == 0 ) {
 647                 if (! (slapMode & SLAP_TOOL_QUICK)) {
 648                 rc = TXN_COMMIT( tid, 0 );
 649                 if( rc != 0 ) {
 650                         Debug( LDAP_DEBUG_ANY,
 651                                 "=> " LDAP_XSTRING(bdb_tool_entry_reindex)
 652                                 ": txn_commit failed: %s (%d)\n",
 653                                 db_strerror(rc), rc, 0 );
 654                         e->e_id = NOID;
 655                 }
 656                 }
 657
 658         } else {
 659                 if (! (slapMode & SLAP_TOOL_QUICK)) {
 660                 TXN_ABORT( tid );
 661                 Debug( LDAP_DEBUG_ANY,
 662                         "=> " LDAP_XSTRING(bdb_tool_entry_reindex)
 663                         ": txn_aborted! %s (%d)\n",
 664                         db_strerror(rc), rc, 0 );
 665                 }
 666                 e->e_id = NOID;
 667         }
 668         bdb_entry_release( &op, e, 0 );
 669
 670         return rc;
 671 }
 672
 673 ID bdb_tool_entry_modify(
 674         BackendDB *be,
 675         Entry *e,
 676         struct berval *text )
 677 {
 678         int rc;
 679         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 680         DB_TXN *tid = NULL;
 681         Operation op = {0};
 682         Opheader ohdr = {0};
 683
 684         assert( be != NULL );
 685         assert( slapMode & SLAP_TOOL_MODE );
 686
 687         assert( text != NULL );
 688         assert( text->bv_val != NULL );
 689         assert( text->bv_val[0] == '\0' );      /* overconservative? */
 690
 691         assert ( e->e_id != NOID );
 692
 693         Debug( LDAP_DEBUG_TRACE,
 694                 "=> " LDAP_XSTRING(bdb_tool_entry_modify) "( %ld, \"%s\" )\n",
 695                 (long) e->e_id, e->e_dn, 0 );
 696
 697         if (! (slapMode & SLAP_TOOL_QUICK)) {
 698         rc = TXN_BEGIN( bdb->bi_dbenv, NULL, &tid,
 699                 bdb->bi_db_opflags );
 700         if( rc != 0 ) {
 701                 snprintf( text->bv_val, text->bv_len,
 702                         "txn_begin failed: %s (%d)",
 703                         db_strerror(rc), rc );
 704                 Debug( LDAP_DEBUG_ANY,
 705                         "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
 706                          text->bv_val, 0, 0 );
 707                 return NOID;
 708         }
 709         }
 710
 711         op.o_hdr = &ohdr;
 712         op.o_bd = be;
 713         op.o_tmpmemctx = NULL;
 714         op.o_tmpmfuncs = &ch_mfuncs;
 715
 716         /* id2entry index */
 717         rc = bdb_id2entry_update( be, tid, e );
 718         if( rc != 0 ) {
 719                 snprintf( text->bv_val, text->bv_len,
 720                                 "id2entry_add failed: %s (%d)",
 721                                 db_strerror(rc), rc );
 722                 Debug( LDAP_DEBUG_ANY,
 723                         "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
 724                         text->bv_val, 0, 0 );
 725                 goto done;
 726         }
 727
 728 done:
 729         if( rc == 0 ) {
 730                 if (! (slapMode & SLAP_TOOL_QUICK)) {
 731                 rc = TXN_COMMIT( tid, 0 );
 732                 if( rc != 0 ) {
 733                         snprintf( text->bv_val, text->bv_len,
 734                                         "txn_commit failed: %s (%d)",
 735                                         db_strerror(rc), rc );
 736                         Debug( LDAP_DEBUG_ANY,
 737                                 "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": "
 738                                 "%s\n", text->bv_val, 0, 0 );
 739                         e->e_id = NOID;
 740                 }
 741                 }
 742
 743         } else {
 744                 if (! (slapMode & SLAP_TOOL_QUICK)) {
 745                 TXN_ABORT( tid );
 746                 snprintf( text->bv_val, text->bv_len,
 747                         "txn_aborted! %s (%d)",
 748                         db_strerror(rc), rc );
 749                 Debug( LDAP_DEBUG_ANY,
 750                         "=> " LDAP_XSTRING(bdb_tool_entry_modify) ": %s\n",
 751                         text->bv_val, 0, 0 );
 752                 }
 753                 e->e_id = NOID;
 754         }
 755
 756         return e->e_id;
 757 }
 758
 759 #ifdef BDB_TOOL_IDL_CACHING
 760 static int
 761 bdb_tool_idl_cmp( const void *v1, const void *v2 )
 762 {
 763         const bdb_tool_idl_cache *c1 = v1, *c2 = v2;
 764         int rc;
 765
 766         if (( rc = c1->kstr.bv_len - c2->kstr.bv_len )) return rc;
 767         return memcmp( c1->kstr.bv_val, c2->kstr.bv_val, c1->kstr.bv_len );
 768 }
 769
 770 static int
 771 bdb_tool_idl_flush_one( void *v1, void *arg )
 772 {
 773         bdb_tool_idl_cache *ic = v1;
 774         DB *db = arg;
 775         struct bdb_info *bdb = bdb_tool_info;
 776         bdb_tool_idl_cache_entry *ice;
 777         DBC *curs;
 778         DBT key, data;
 779         int i, rc;
 780         ID id, nid;
 781
 782         /* Freshly allocated, ignore it */
 783         if ( !ic->head && ic->count <= BDB_IDL_DB_SIZE ) {
 784                 return 0;
 785         }
 786
 787         rc = db->cursor( db, NULL, &curs, 0 );
 788         if ( rc )
 789                 return -1;
 790
 791         DBTzero( &key );
 792         DBTzero( &data );
 793
 794         bv2DBT( &ic->kstr, &key );
 795
 796         data.size = data.ulen = sizeof( ID );
 797         data.flags = DB_DBT_USERMEM;
 798         data.data = &nid;
 799
 800         rc = curs->c_get( curs, &key, &data, DB_SET );
 801         /* If key already exists and we're writing a range... */
 802         if ( rc == 0 && ic->count > BDB_IDL_DB_SIZE ) {
 803                 /* If it's not currently a range, must delete old info */
 804                 if ( nid ) {
 805                         /* Skip lo */
 806                         while ( curs->c_get( curs, &key, &data, DB_NEXT_DUP ) == 0 )
 807                                 curs->c_del( curs, 0 );
 808
 809                         nid = 0;
 810                         /* Store range marker */
 811                         curs->c_put( curs, &key, &data, DB_KEYFIRST );
 812                 } else {
 813
 814                         /* Skip lo */
 815                         rc = curs->c_get( curs, &key, &data, DB_NEXT_DUP );
 816
 817                         /* Get hi */
 818                         rc = curs->c_get( curs, &key, &data, DB_NEXT_DUP );
 819
 820                         /* Delete hi */
 821                         curs->c_del( curs, 0 );
 822                 }
 823                 BDB_ID2DISK( ic->last, &nid );
 824                 curs->c_put( curs, &key, &data, DB_KEYLAST );
 825                 rc = 0;
 826         } else if ( rc && rc != DB_NOTFOUND ) {
 827                 rc = -1;
 828         } else if ( ic->count > BDB_IDL_DB_SIZE ) {
 829                 /* range, didn't exist before */
 830                 nid = 0;
 831                 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
 832                 if ( rc == 0 ) {
 833                         BDB_ID2DISK( ic->first, &nid );
 834                         rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
 835                         if ( rc == 0 ) {
 836                                 BDB_ID2DISK( ic->last, &nid );
 837                                 rc = curs->c_put( curs, &key, &data, DB_KEYLAST );
 838                         }
 839                 }
 840                 if ( rc ) {
 841                         rc = -1;
 842                 }
 843         } else {
 844                 int n;
 845
 846                 /* Just a normal write */
 847                 rc = 0;
 848                 for ( ice = ic->head, n=0; ice; ice = ice->next, n++ ) {
 849                         int end;
 850                         if ( ice->next ) {
 851                                 end = IDBLOCK;
 852                         } else {
 853                                 end = ic->count & (IDBLOCK-1);
 854                                 if ( !end )
 855                                         end = IDBLOCK;
 856                         }
 857                         for ( i=0; i<end; i++ ) {
 858                                 if ( !ice->ids[i] ) continue;
 859                                 BDB_ID2DISK( ice->ids[i], &nid );
 860                                 rc = curs->c_put( curs, &key, &data, DB_NODUPDATA );
 861                                 if ( rc ) {
 862                                         if ( rc == DB_KEYEXIST ) {
 863                                                 rc = 0;
 864                                                 continue;
 865                                         }
 866                                         rc = -1;
 867                                         break;
 868                                 }
 869                         }
 870                         if ( rc ) {
 871                                 rc = -1;
 872                                 break;
 873                         }
 874                 }
 875                 if ( ic->head ) {
 876                         ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
 877                         ic->tail->next = bdb_tool_idl_free_list;
 878                         bdb_tool_idl_free_list = ic->head;
 879                         bdb->bi_idl_cache_size -= n;
 880                         ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
 881                 }
 882         }
 883         if ( ic != db->app_private ) {
 884                 ch_free( ic );
 885         } else {
 886                 ic->head = ic->tail = NULL;
 887         }
 888         curs->c_close( curs );
 889         return rc;
 890 }
 891
 892 static int
 893 bdb_tool_idl_flush_db( DB *db, bdb_tool_idl_cache *ic )
 894 {
 895         Avlnode *root = db->app_private;
 896         int rc;
 897
 898         db->app_private = ic;
 899         rc = avl_apply( root, bdb_tool_idl_flush_one, db, -1, AVL_INORDER );
 900         avl_free( root, NULL );
 901         db->app_private = NULL;
 902         if ( rc != -1 )
 903                 rc = 0;
 904         return rc;
 905 }
 906
 907 static int
 908 bdb_tool_idl_flush( BackendDB *be )
 909 {
 910         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 911         DB *db;
 912         Avlnode *root;
 913         int i, rc = 0;
 914
 915         for ( i=BDB_NDB; i < bdb->bi_ndatabases; i++ ) {
 916                 db = bdb->bi_databases[i]->bdi_db;
 917                 if ( !db->app_private ) continue;
 918                 rc = bdb_tool_idl_flush_db( db, NULL );
 919                 if ( rc )
 920                         break;
 921         }
 922         if ( !rc ) {
 923                 bdb->bi_idl_cache_size = 0;
 924         }
 925         return rc;
 926 }
 927
 928 int bdb_tool_idl_add(
 929         BackendDB *be,
 930         DB *db,
 931         DB_TXN *txn,
 932         DBT *key,
 933         ID id )
 934 {
 935         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 936         bdb_tool_idl_cache *ic, itmp;
 937         bdb_tool_idl_cache_entry *ice;
 938         int rc;
 939
 940         if ( !bdb->bi_idl_cache_max_size )
 941                 return bdb_idl_insert_key( be, db, txn, key, id );
 942
 943         DBT2bv( key, &itmp.kstr );
 944
 945         ic = avl_find( (Avlnode *)db->app_private, &itmp, bdb_tool_idl_cmp );
 946
 947         /* No entry yet, create one */
 948         if ( !ic ) {
 949                 DBC *curs;
 950                 DBT data;
 951                 ID nid;
 952                 int rc;
 953
 954                 ic = ch_malloc( sizeof( bdb_tool_idl_cache ) + itmp.kstr.bv_len );
 955                 ic->kstr.bv_len = itmp.kstr.bv_len;
 956                 ic->kstr.bv_val = (char *)(ic+1);
 957                 AC_MEMCPY( ic->kstr.bv_val, itmp.kstr.bv_val, ic->kstr.bv_len );
 958                 ic->head = ic->tail = NULL;
 959                 ic->last = 0;
 960                 ic->count = 0;
 961                 avl_insert( (Avlnode **)&db->app_private, ic, bdb_tool_idl_cmp,
 962                         avl_dup_error );
 963
 964                 /* load existing key count here */
 965                 rc = db->cursor( db, NULL, &curs, 0 );
 966                 if ( rc ) return rc;
 967
 968                 data.ulen = sizeof( ID );
 969                 data.flags = DB_DBT_USERMEM;
 970                 data.data = &nid;
 971                 rc = curs->c_get( curs, key, &data, DB_SET );
 972                 if ( rc == 0 ) {
 973                         if ( nid == 0 ) {
 974                                 ic->count = BDB_IDL_DB_SIZE+1;
 975                         } else {
 976                                 db_recno_t count;
 977
 978                                 curs->c_count( curs, &count, 0 );
 979                                 ic->count = count;
 980                                 BDB_DISK2ID( &nid, &ic->first );
 981                         }
 982                 }
 983                 curs->c_close( curs );
 984         }
 985         /* are we a range already? */
 986         if ( ic->count > BDB_IDL_DB_SIZE ) {
 987                 ic->last = id;
 988                 return 0;
 989         /* Are we at the limit, and converting to a range? */
 990         } else if ( ic->count == BDB_IDL_DB_SIZE ) {
 991                 int n;
 992                 for ( ice = ic->head, n=0; ice; ice = ice->next, n++ )
 993                         /* counting */ ;
 994                 if ( n ) {
 995                         ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
 996                         ic->tail->next = bdb_tool_idl_free_list;
 997                         bdb_tool_idl_free_list = ic->head;
 998                         bdb->bi_idl_cache_size -= n;
 999                         ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1000                 }
1001                 ic->head = ic->tail = NULL;
1002                 ic->last = id;
1003                 ic->count++;
1004                 return 0;
1005         }
1006         /* No free block, create that too */
1007         if ( !ic->tail || ( ic->count & (IDBLOCK-1)) == 0) {
1008                 ice = NULL;
1009                 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1010                 if ( bdb->bi_idl_cache_size >= bdb->bi_idl_cache_max_size ) {
1011                         ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1012                         rc = bdb_tool_idl_flush_db( db, ic );
1013                         if ( rc )
1014                                 return rc;
1015                         avl_insert( (Avlnode **)&db->app_private, ic, bdb_tool_idl_cmp,
1016                                 avl_dup_error );
1017                         ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
1018                 }
1019                 bdb->bi_idl_cache_size++;
1020                 if ( bdb_tool_idl_free_list ) {
1021                         ice = bdb_tool_idl_free_list;
1022                         bdb_tool_idl_free_list = ice->next;
1023                 }
1024                 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
1025                 if ( !ice ) {
1026                         ice = ch_malloc( sizeof( bdb_tool_idl_cache_entry ));
1027                 }
1028                 memset( ice, 0, sizeof( *ice ));
1029                 if ( !ic->head ) {
1030                         ic->head = ice;
1031                 } else {
1032                         ic->tail->next = ice;
1033                 }
1034                 ic->tail = ice;
1035                 if ( !ic->count )
1036                         ic->first = id;
1037         }
1038         ice = ic->tail;
1039         ice->ids[ ic->count & (IDBLOCK-1) ] = id;
1040         ic->count++;
1041
1042         return 0;
1043 }
1044 #endif
1045
1046 static void *
1047 bdb_tool_index_task( void *ctx, void *ptr )
1048 {
1049         int base = *(int *)ptr;
1050
1051         free( ptr );
1052         while ( 1 ) {
1053                 ldap_pvt_thread_mutex_lock( &bdb_tool_index_mutex );
1054                 bdb_tool_index_tcount--;
1055                 if ( !bdb_tool_index_tcount )
1056                         ldap_pvt_thread_cond_signal( &bdb_tool_index_cond_main );
1057                 ldap_pvt_thread_cond_wait( &bdb_tool_index_cond_work,
1058                         &bdb_tool_index_mutex );
1059                 ldap_pvt_thread_mutex_unlock( &bdb_tool_index_mutex );
1060                 if ( slapd_shutdown )
1061                         break;
1062
1063                 bdb_tool_index_threads[base] = bdb_index_recrun( bdb_tool_ix_op,
1064                         bdb_tool_info, bdb_tool_index_rec, bdb_tool_ix_id, base );
1065         }
1066
1067         return NULL;
1068 }