git.sur5r.net Git - openldap/blob - servers/slapd/back-ldbm/idl.c

   1 /* idl.c - ldap id list handling routines */
   2
   3 #include "portable.h"
   4
   5 #include <stdio.h>
   6
   7 #include <ac/string.h>
   8 #include <ac/socket.h>
   9
  10 #include "ldap_defaults.h"
  11 #include "slap.h"
  12 #include "back-ldbm.h"
  13
  14 static ID_BLOCK* idl_dup( ID_BLOCK *idl );
  15
  16 /* Allocate an ID_BLOCK with room for nids ids */
  17 ID_BLOCK *
  18 idl_alloc( unsigned int nids )
  19 {
  20         ID_BLOCK        *new;
  21
  22         /* nmax + nids + space for the ids */
  23         new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
  24         ID_BLOCK_NMAX(new) = nids;
  25         ID_BLOCK_NIDS(new) = 0;
  26
  27         return( new );
  28 }
  29
  30
  31 /* Allocate an empty ALLIDS ID_BLOCK */
  32 ID_BLOCK        *
  33 idl_allids( Backend *be )
  34 {
  35         ID_BLOCK        *idl;
  36
  37         idl = idl_alloc( 0 );
  38         ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
  39         ID_BLOCK_NIDS(idl) = next_id_get( be );
  40
  41         return( idl );
  42 }
  43
  44
  45 /* Free an ID_BLOCK */
  46 void
  47 idl_free( ID_BLOCK *idl )
  48 {
  49         if ( idl == NULL ) {
  50                 Debug( LDAP_DEBUG_TRACE,
  51                         "idl_free: called with NULL pointer\n",
  52                         0, 0, 0 );
  53                 return;
  54         }
  55
  56         free( (char *) idl );
  57 }
  58
  59
  60 /* Fetch an single ID_BLOCK from the cache */
  61 static ID_BLOCK *
  62 idl_fetch_one(
  63     Backend             *be,
  64     DBCache     *db,
  65     Datum               key
  66 )
  67 {
  68         Datum   data;
  69         ID_BLOCK        *idl;
  70
  71         ldbm_datum_init( data );
  72
  73         /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
  74
  75         data = ldbm_cache_fetch( db, key );
  76
  77         if( data.dptr == NULL ) {
  78                 return NULL;
  79         }
  80
  81         idl = idl_dup( (ID_BLOCK *) data.dptr);
  82         ldbm_datum_free( db->dbc_db, data );
  83
  84         return( idl );
  85 }
  86
  87
  88 /* Fetch a set of ID_BLOCKs from the cache
  89  *      if not INDIRECT
  90  *              if block return is an ALLIDS block,
  91  *                      return an new ALLIDS block
  92  *              otherwise
  93  *                      return block
  94  *      construct super block from all blocks referenced by INDIRECT block
  95  *      return super block
  96  */
  97 ID_BLOCK *
  98 idl_fetch(
  99     Backend             *be,
 100     DBCache     *db,
 101     Datum               key
 102 )
 103 {
 104         Datum   data;
 105         ID_BLOCK        *idl;
 106         ID_BLOCK        **tmp;
 107         char    *kstr;
 108         int     i, nids;
 109
 110         idl = idl_fetch_one( be, db, key );
 111
 112         if ( idl == NULL ) {
 113                 return NULL;
 114         }
 115
 116         if ( ID_BLOCK_ALLIDS(idl) ) {
 117                 /* all ids block */
 118                 /* make sure we have the current value of highest id */
 119                 idl_free( idl );
 120                 idl = idl_allids( be );
 121
 122                 return( idl );
 123         }
 124
 125         if ( ! ID_BLOCK_INDIRECT( idl ) ) {
 126                 /* regular block */
 127                 return( idl );
 128         }
 129
 130         /*
 131          * this is an indirect block which points to other blocks.
 132          * we need to read in all the blocks it points to and construct
 133          * a big id list containing all the ids, which we will return.
 134          */
 135
 136         /* count the number of blocks & allocate space for pointers to them */
 137         for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
 138                 ;       /* NULL */
 139         tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
 140
 141         /* read in all the blocks */
 142         kstr = (char *) ch_malloc( key.dsize + 20 );
 143         nids = 0;
 144         for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
 145                 ldbm_datum_init( data );
 146
 147                 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, i) );
 148                 data.dptr = kstr;
 149                 data.dsize = strlen( kstr ) + 1;
 150
 151                 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
 152                         Debug( LDAP_DEBUG_ANY,
 153                             "idl_fetch of (%s) returns NULL\n", data.dptr, 0, 0 );
 154                         continue;
 155                 }
 156
 157                 nids += ID_BLOCK_NIDS(tmp[i]);
 158         }
 159         tmp[i] = NULL;
 160         free( kstr );
 161         idl_free( idl );
 162
 163         /* allocate space for the big block */
 164         idl = idl_alloc( nids );
 165         ID_BLOCK_NIDS(idl) = nids;
 166         nids = 0;
 167
 168         /* copy in all the ids from the component blocks */
 169         for ( i = 0; tmp[i] != NULL; i++ ) {
 170                 if ( tmp[i] == NULL ) {
 171                         continue;
 172                 }
 173
 174                 SAFEMEMCPY(
 175                         (char *) &ID_BLOCK_ID(idl, nids),
 176                         (char *) &ID_BLOCK_ID(tmp[i], 0),
 177                         ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
 178                 nids += ID_BLOCK_NIDS(tmp[i]);
 179
 180                 idl_free( tmp[i] );
 181         }
 182         free( (char *) tmp );
 183
 184         Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
 185                ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl), 0 );
 186         return( idl );
 187 }
 188
 189
 190 /* store a single block */
 191 static int
 192 idl_store(
 193     Backend             *be,
 194     DBCache     *db,
 195     Datum               key,
 196     ID_BLOCK            *idl
 197 )
 198 {
 199         int     rc, flags;
 200         Datum   data;
 201         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
 202
 203         ldbm_datum_init( data );
 204
 205         /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
 206
 207         data.dptr = (char *) idl;
 208         data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAX(idl)) * sizeof(ID);
 209
 210 #ifdef LDBM_DEBUG
 211         Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
 212                 rc, 0, 0, 0, 0 );
 213 #endif
 214
 215         flags = LDBM_REPLACE;
 216         if( li->li_dbcachewsync ) flags |= LDBM_SYNC;
 217         rc = ldbm_cache_store( db, key, data, flags );
 218
 219         /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
 220         return( rc );
 221 }
 222
 223
 224 /* split the block at id
 225  *      locate ID greater than or equal to id.
 226  */
 227 static void
 228 idl_split_block(
 229     ID_BLOCK    *b,
 230     ID          id,
 231     ID_BLOCK    **right,
 232     ID_BLOCK    **left
 233 )
 234 {
 235         unsigned int    nr, nl;
 236
 237         /* find where to split the block *//* XXX linear search XXX */
 238         for ( nr = 0; nr < ID_BLOCK_NIDS(b) && id > ID_BLOCK_ID(b, nr); nr++ )
 239                 ;       /* NULL */
 240
 241         nl = ID_BLOCK_NIDS(b) - nr;
 242
 243         *right = idl_alloc( nr == 0 ? 1 : nr );
 244         *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
 245
 246         /*
 247          * everything before the id being inserted in the first block
 248          * unless there is nothing, in which case the id being inserted
 249          * goes there.
 250          */
 251         if ( nr == 0 ) {
 252                 ID_BLOCK_NIDS(*right) = 1;
 253                 ID_BLOCK_ID(*right, 0) = id;
 254         } else {
 255                 SAFEMEMCPY(
 256                         (char *) &ID_BLOCK_ID(*right, 0),
 257                         (char *) &ID_BLOCK_ID(b, 0),
 258                         nr * sizeof(ID) );
 259                 ID_BLOCK_NIDS(*right) = nr;
 260                 ID_BLOCK_ID(*left, 0) = id;
 261         }
 262
 263         /* the id being inserted & everything after in the second block */
 264         SAFEMEMCPY(
 265                 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
 266             (char *) &ID_BLOCK_ID(b, nr),
 267                 nl * sizeof(ID) );
 268         ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
 269 }
 270
 271
 272 /*
 273  * idl_change_first - called when an indirect block's first key has
 274  * changed, meaning it needs to be stored under a new key, and the
 275  * header block pointing to it needs updating.
 276  */
 277 static int
 278 idl_change_first(
 279     Backend             *be,
 280     DBCache     *db,
 281     Datum               hkey,           /* header block key     */
 282     ID_BLOCK            *h,             /* header block         */
 283     int                 pos,            /* pos in h to update   */
 284     Datum               bkey,           /* data block key       */
 285     ID_BLOCK            *b              /* data block           */
 286 )
 287 {
 288         int     rc;
 289
 290         /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
 291
 292         /* delete old key block */
 293         if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
 294                 Debug( LDAP_DEBUG_ANY,
 295                     "ldbm_delete of (%s) returns %d\n", bkey.dptr, rc,
 296                     0 );
 297                 return( rc );
 298         }
 299
 300         /* write block with new key */
 301         sprintf( bkey.dptr, "%c%s%ld", CONT_PREFIX, hkey.dptr, ID_BLOCK_ID(b, 0) );
 302         bkey.dsize = strlen( bkey.dptr ) + 1;
 303         if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
 304                 Debug( LDAP_DEBUG_ANY,
 305                     "idl_store of (%s) returns %d\n", bkey.dptr, rc, 0 );
 306                 return( rc );
 307         }
 308
 309         /* update + write indirect header block */
 310         ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
 311         if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
 312                 Debug( LDAP_DEBUG_ANY,
 313                     "idl_store of (%s) returns %d\n", hkey.dptr, rc, 0 );
 314                 return( rc );
 315         }
 316
 317         return( 0 );
 318 }
 319
 320
 321 int
 322 idl_insert_key(
 323     Backend             *be,
 324     DBCache     *db,
 325     Datum               key,
 326     ID                  id
 327 )
 328 {
 329         int     i, j, first, rc;
 330         ID_BLOCK        *idl, *tmp, *tmp2, *tmp3;
 331         char    *kstr;
 332         Datum   k2;
 333
 334         ldbm_datum_init( k2 );
 335
 336         if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
 337 #ifdef LDBM_DEBUG
 338                 Statslog( LDAP_DEBUG_STATS, "=> idl_insert_key(): no key yet\n",
 339                         0, 0, 0, 0, 0 );
 340 #endif
 341
 342                 idl = idl_alloc( 1 );
 343                 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
 344                 rc = idl_store( be, db, key, idl );
 345
 346                 idl_free( idl );
 347                 return( rc );
 348         }
 349
 350         if ( ID_BLOCK_ALLIDS( idl ) ) {
 351                 /* ALLIDS */
 352                 idl_free( idl );
 353                 return 0;
 354         }
 355
 356         if ( ! ID_BLOCK_INDIRECT( idl ) ) {
 357                 /* regular block */
 358                 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
 359                 case 0:         /* id inserted - store the updated block */
 360                 case 1:
 361                         rc = idl_store( be, db, key, idl );
 362                         break;
 363
 364                 case 2:         /* id already there - nothing to do */
 365                         rc = 0;
 366                         break;
 367
 368                 case 3:         /* id not inserted - block must be split */
 369                         /* check threshold for marking this an all-id block */
 370                         if ( db->dbc_maxindirect < 2 ) {
 371                                 idl_free( idl );
 372                                 idl = idl_allids( be );
 373                                 rc = idl_store( be, db, key, idl );
 374                                 break;
 375                         }
 376
 377                         idl_split_block( idl, id, &tmp, &tmp2 );
 378                         idl_free( idl );
 379
 380                         /* create the header indirect block */
 381                         idl = idl_alloc( 3 );
 382                         ID_BLOCK_NMAX(idl) = 3;
 383                         ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
 384                         ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
 385                         ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
 386                         ID_BLOCK_ID(idl, 2) = NOID;
 387
 388                         /* store it */
 389                         rc = idl_store( be, db, key, idl );
 390
 391                         /* store the first id block */
 392                         kstr = (char *) ch_malloc( key.dsize + 20 );
 393                         sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
 394                             ID_BLOCK_ID(tmp, 0) );
 395                         k2.dptr = kstr;
 396                         k2.dsize = strlen( kstr ) + 1;
 397                         rc = idl_store( be, db, k2, tmp );
 398
 399                         /* store the second id block */
 400                         sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
 401                             ID_BLOCK_ID(tmp2, 0) );
 402                         k2.dptr = kstr;
 403                         k2.dsize = strlen( kstr ) + 1;
 404                         rc = idl_store( be, db, k2, tmp2 );
 405
 406                         free( kstr );
 407                         idl_free( tmp );
 408                         idl_free( tmp2 );
 409                         break;
 410                 }
 411
 412                 idl_free( idl );
 413                 return( rc );
 414         }
 415
 416         /*
 417          * this is an indirect block which points to other blocks.
 418          * we need to read in the block into which the id should be
 419          * inserted, then insert the id and store the block.  we might
 420          * have to split the block if it is full, which means we also
 421          * need to write a new "header" block.
 422          */
 423
 424         /* select the block to try inserting into *//* XXX linear search XXX */
 425         for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
 426                 ;       /* NULL */
 427         if ( i != 0 ) {
 428                 i--;
 429                 first = 0;
 430         } else {
 431                 first = 1;
 432         }
 433
 434         /* get the block */
 435         kstr = (char *) ch_malloc( key.dsize + 20 );
 436         sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, i) );
 437         k2.dptr = kstr;
 438         k2.dsize = strlen( kstr ) + 1;
 439         if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
 440                 Debug( LDAP_DEBUG_ANY, "nonexistent continuation block (%s)\n",
 441                     k2.dptr, 0, 0 );
 442                 free( kstr );
 443                 idl_free( idl );
 444                 return( -1 );
 445         }
 446
 447         /* insert the id */
 448         switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
 449         case 0:         /* id inserted ok */
 450                 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
 451                         Debug( LDAP_DEBUG_ANY,
 452                             "idl_store of (%s) returns %d\n", k2.dptr, rc, 0 );
 453                 }
 454                 break;
 455
 456         case 1:         /* id inserted - first id in block has changed */
 457                 /*
 458                  * key for this block has changed, so we have to
 459                  * write the block under the new key, delete the
 460                  * old key block + update and write the indirect
 461                  * header block.
 462                  */
 463
 464                 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
 465                 break;
 466
 467         case 2:         /* id not inserted - already there */
 468                 break;
 469
 470         case 3:         /* id not inserted - block is full */
 471                 /*
 472                  * first, see if it will fit in the next block,
 473                  * without splitting, unless we're trying to insert
 474                  * into the beginning of the first block.
 475                  */
 476
 477                 /* is there a next block? */
 478                 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
 479                         /* read it in */
 480                         sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
 481                             ID_BLOCK_ID(idl, i + 1) );
 482                         k2.dptr = kstr;
 483                         k2.dsize = strlen( kstr ) + 1;
 484                         if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
 485                                 Debug( LDAP_DEBUG_ANY,
 486                                     "idl_fetch_one (%s) returns NULL\n",
 487                                     k2.dptr, 0, 0 );
 488                                 break;
 489                         }
 490
 491                         switch ( (rc = idl_insert( &tmp2, id,
 492                             db->dbc_maxids )) ) {
 493                         case 1:         /* id inserted first in block */
 494                                 rc = idl_change_first( be, db, key, idl,
 495                                     i + 1, k2, tmp2 );
 496                                 /* FALL */
 497
 498                         case 2:         /* id already there - how? */
 499                         case 0:         /* id inserted */
 500                                 if ( rc == 2 ) {
 501                                         Debug( LDAP_DEBUG_ANY,
 502                                             "id %ld already in next block\n",
 503                                             id, 0, 0 );
 504                                 }
 505                                 free( kstr );
 506                                 idl_free( tmp );
 507                                 idl_free( tmp2 );
 508                                 idl_free( idl );
 509                                 return( 0 );
 510
 511                         case 3:         /* split the original block */
 512                                 break;
 513                         }
 514                         idl_free( tmp2 );
 515                 }
 516
 517                 /*
 518                  * must split the block, write both new blocks + update
 519                  * and write the indirect header block.
 520                  */
 521
 522                 /* count how many indirect blocks *//* XXX linear count XXX */
 523                 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
 524                         ;       /* NULL */
 525
 526                 /* check it against all-id thresholed */
 527                 if ( j + 1 > db->dbc_maxindirect ) {
 528                         /*
 529                          * we've passed the all-id threshold, meaning
 530                          * that this set of blocks should be replaced
 531                          * by a single "all-id" block.  our job: delete
 532                          * all the indirect blocks, and replace the header
 533                          * block by an all-id block.
 534                          */
 535
 536                         /* delete all indirect blocks */
 537                         for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
 538                                 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
 539                                     ID_BLOCK_ID(idl, j) );
 540                                 k2.dptr = kstr;
 541                                 k2.dsize = strlen( kstr ) + 1;
 542
 543                                 rc = ldbm_cache_delete( db, k2 );
 544                         }
 545
 546                         /* store allid block in place of header block */
 547                         idl_free( idl );
 548                         idl = idl_allids( be );
 549                         rc = idl_store( be, db, key, idl );
 550
 551                         free( kstr );
 552                         idl_free( idl );
 553                         idl_free( tmp );
 554                         return( rc );
 555                 }
 556
 557                 idl_split_block( tmp, id, &tmp2, &tmp3 );
 558                 idl_free( tmp );
 559
 560                 /* create a new updated indirect header block */
 561                 tmp = idl_alloc( ID_BLOCK_NMAX(idl) + 1 );
 562                 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
 563                 /* everything up to the split block */
 564                 SAFEMEMCPY(
 565                         (char *) &ID_BLOCK_ID(tmp, 0),
 566                         (char *) &ID_BLOCK_ID(idl, 0),
 567                     i * sizeof(ID) );
 568                 /* the two new blocks */
 569                 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
 570                 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
 571                 /* everything after the split block */
 572                 SAFEMEMCPY(
 573                         (char *) &ID_BLOCK_ID(tmp, i + 2),
 574                         (char *) &ID_BLOCK_ID(idl, i + 1),
 575                         (ID_BLOCK_NMAX(idl) - i - 1) * sizeof(ID) );
 576
 577                 /* store the header block */
 578                 rc = idl_store( be, db, key, tmp );
 579
 580                 /* store the first id block */
 581                 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
 582                     ID_BLOCK_ID(tmp2, 0) );
 583                 k2.dptr = kstr;
 584                 k2.dsize = strlen( kstr ) + 1;
 585                 rc = idl_store( be, db, k2, tmp2 );
 586
 587                 /* store the second id block */
 588                 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
 589                     ID_BLOCK_ID(tmp3, 0) );
 590                 k2.dptr = kstr;
 591                 k2.dsize = strlen( kstr ) + 1;
 592                 rc = idl_store( be, db, k2, tmp3 );
 593
 594                 idl_free( tmp2 );
 595                 idl_free( tmp3 );
 596                 break;
 597         }
 598
 599         free( kstr );
 600         idl_free( tmp );
 601         idl_free( idl );
 602         return( rc );
 603 }
 604
 605
 606 /*
 607  * idl_insert - insert an id into an id list.
 608  *
 609  *      returns
 610  *              0       id inserted
 611  *              1       id inserted, first id in block has changed
 612  *              2       id not inserted, already there
 613  *              3       id not inserted, block must be split
 614  */
 615 int
 616 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
 617 {
 618         unsigned int    i, j;
 619
 620         if ( ID_BLOCK_ALLIDS( *idl ) ) {
 621                 return( 2 );    /* already there */
 622         }
 623
 624         /* is it already there? *//* XXX linear search XXX */
 625         for ( i = 0; i < ID_BLOCK_NIDS(*idl) && id > ID_BLOCK_ID(*idl, i); i++ ) {
 626                 ;       /* NULL */
 627         }
 628         if ( i < ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) == id ) {
 629                 return( 2 );    /* already there */
 630         }
 631
 632         /* do we need to make room for it? */
 633         if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAX(*idl) ) {
 634                 /* make room or indicate block needs splitting */
 635                 if ( ID_BLOCK_NMAX(*idl) >= maxids ) {
 636                         return( 3 );    /* block needs splitting */
 637                 }
 638
 639                 ID_BLOCK_NMAX(*idl) *= 2;
 640                 if ( ID_BLOCK_NMAX(*idl) > maxids ) {
 641                         ID_BLOCK_NMAX(*idl) = maxids;
 642                 }
 643                 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
 644                     (ID_BLOCK_NMAX(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
 645         }
 646
 647         /* make a slot for the new id *//* XXX bubble move XXX */
 648         for ( j = ID_BLOCK_NIDS(*idl); j != i; j-- ) {
 649                 ID_BLOCK_ID(*idl, j) = ID_BLOCK_ID(*idl, j-1);
 650         }
 651         ID_BLOCK_ID(*idl, i) = id;
 652         ID_BLOCK_NIDS(*idl)++;
 653         (void) memset(
 654                 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
 655                 '\0',
 656             (ID_BLOCK_NMAX(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
 657
 658         return( i == 0 ? 1 : 0 );       /* inserted - first id changed or not */
 659 }
 660
 661
 662 int
 663 idl_delete_key (
 664         Backend         *be,
 665         DBCache  *db,
 666         Datum           key,
 667         ID              id
 668 )
 669 {
 670         Datum  data;
 671         ID_BLOCK *idl, *tmp;
 672         unsigned i;
 673         int j, nids;
 674         char    *kstr;
 675
 676         if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
 677         {
 678                 /* It wasn't found.  Hmm... */
 679                 return -1;
 680         }
 681
 682         if ( ID_BLOCK_ALLIDS( idl ) ) {
 683                 idl_free( idl );
 684                 return 0;
 685         }
 686
 687         if ( ! ID_BLOCK_INDIRECT( idl ) ) {
 688                 for ( i=0; i < ID_BLOCK_NIDS(idl); i++ ) {
 689                         if ( ID_BLOCK_ID(idl, i) == id ) {
 690                                 if( --ID_BLOCK_NIDS(idl) == 0 ) {
 691                                         ldbm_cache_delete( db, key );
 692
 693                                 } else {
 694                                         SAFEMEMCPY (
 695                                                 &ID_BLOCK_ID(idl, i),
 696                                                 &ID_BLOCK_ID(idl, i+1),
 697                                                 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
 698
 699                                         ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
 700
 701                                         idl_store( be, db, key, idl );
 702                                 }
 703
 704                                 idl_free( idl );
 705                                 return 0;
 706                         }
 707                         /*  We didn't find the ID.  Hmmm... */
 708                 }
 709                 idl_free( idl );
 710                 return -1;
 711         }
 712
 713         /* We have to go through an indirect block and find the ID
 714            in the list of IDL's
 715            */
 716         for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
 717                 ;       /* NULL */
 718         kstr = (char *) ch_malloc( key.dsize + 20 );
 719
 720         for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
 721         {
 722                 ldbm_datum_init( data );
 723                 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, j) );
 724                 data.dptr = kstr;
 725                 data.dsize = strlen( kstr ) + 1;
 726
 727                 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
 728                         Debug( LDAP_DEBUG_ANY,
 729                             "idl_fetch of (%s) returns NULL\n", data.dptr, 0, 0 );
 730                         continue;
 731                 }
 732                 /*
 733                    Now try to find the ID in tmp
 734                 */
 735                 for ( i=0; i < ID_BLOCK_NIDS(tmp); i++ )
 736                 {
 737                         if ( ID_BLOCK_ID(tmp, i) == id )
 738                         {
 739                                 SAFEMEMCPY(
 740                                         &ID_BLOCK_ID(tmp, i),
 741                                         &ID_BLOCK_ID(tmp, i+1),
 742                                         (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
 743                                 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
 744                                 ID_BLOCK_NIDS(tmp)--;
 745
 746                                 if ( ID_BLOCK_NIDS(tmp) ) {
 747                                         idl_store ( be, db, data, tmp );
 748
 749                                 } else {
 750                                         ldbm_cache_delete( db, data );
 751                                         SAFEMEMCPY(
 752                                                 &ID_BLOCK_ID(idl, j),
 753                                                 &ID_BLOCK_ID(idl, j+1),
 754                                                 (nids-(j+1)) * sizeof(ID));
 755                                         ID_BLOCK_ID(idl, nids-1) = NOID;
 756                                         nids--;
 757                                         if ( ! nids )
 758                                                 ldbm_cache_delete( db, key );
 759                                         else
 760                                                 idl_store( be, db, key, idl );
 761                                 }
 762                                 idl_free( tmp );
 763                                 free( kstr );
 764                                 idl_free( idl );
 765                                 return 0;
 766                         }
 767                 }
 768                 idl_free( tmp );
 769         }
 770         free( kstr );
 771         idl_free( idl );
 772         return -1;
 773 }
 774
 775
 776 /* return a duplicate of a single ID_BLOCK */
 777 static ID_BLOCK *
 778 idl_dup( ID_BLOCK *idl )
 779 {
 780         ID_BLOCK        *new;
 781
 782         if ( idl == NULL ) {
 783                 return( NULL );
 784         }
 785
 786         new = idl_alloc( ID_BLOCK_NMAX(idl) );
 787
 788         SAFEMEMCPY(
 789                 (char *) new,
 790                 (char *) idl,
 791                 (ID_BLOCK_NMAX(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
 792
 793         return( new );
 794 }
 795
 796
 797 /* return the smaller ID_BLOCK */
 798 static ID_BLOCK *
 799 idl_min( ID_BLOCK *a, ID_BLOCK *b )
 800 {
 801         return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
 802 }
 803
 804
 805 /*
 806  * idl_intersection - return a intersection b
 807  */
 808 ID_BLOCK *
 809 idl_intersection(
 810     Backend     *be,
 811     ID_BLOCK    *a,
 812     ID_BLOCK    *b
 813 )
 814 {
 815         unsigned int    ai, bi, ni;
 816         ID_BLOCK                *n;
 817
 818         if ( a == NULL || b == NULL ) {
 819                 return( NULL );
 820         }
 821         if ( ID_BLOCK_ALLIDS( a ) ) {
 822                 return( idl_dup( b ) );
 823         }
 824         if ( ID_BLOCK_ALLIDS( b ) ) {
 825                 return( idl_dup( a ) );
 826         }
 827
 828         n = idl_dup( idl_min( a, b ) );
 829
 830         for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
 831                 for ( ;
 832                         bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
 833                         bi++ )
 834                 {
 835                         ;       /* NULL */
 836                 }
 837
 838                 if ( bi == ID_BLOCK_NIDS(b) ) {
 839                         break;
 840                 }
 841
 842                 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
 843                         ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
 844                 }
 845         }
 846
 847         if ( ni == 0 ) {
 848                 idl_free( n );
 849                 return( NULL );
 850         }
 851         ID_BLOCK_NIDS(n) = ni;
 852
 853         return( n );
 854 }
 855
 856
 857 /*
 858  * idl_union - return a union b
 859  */
 860 ID_BLOCK *
 861 idl_union(
 862     Backend     *be,
 863     ID_BLOCK    *a,
 864     ID_BLOCK    *b
 865 )
 866 {
 867         unsigned int    ai, bi, ni;
 868         ID_BLOCK                *n;
 869
 870         if ( a == NULL ) {
 871                 return( idl_dup( b ) );
 872         }
 873         if ( b == NULL ) {
 874                 return( idl_dup( a ) );
 875         }
 876         if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
 877                 return( idl_allids( be ) );
 878         }
 879
 880         if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
 881                 n = a;
 882                 a = b;
 883                 b = n;
 884         }
 885
 886         n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
 887
 888         for ( ni = 0, ai = 0, bi = 0;
 889                 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
 890                 )
 891         {
 892                 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
 893                         ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
 894
 895                 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
 896                         ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
 897
 898                 } else {
 899                         ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
 900                         ai++, bi++;
 901                 }
 902         }
 903
 904         for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
 905                 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
 906         }
 907         for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
 908                 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
 909         }
 910         ID_BLOCK_NIDS(n) = ni;
 911
 912         return( n );
 913 }
 914
 915
 916 /*
 917  * idl_notin - return a intersection ~b (or a minus b)
 918  */
 919 ID_BLOCK *
 920 idl_notin(
 921     Backend     *be,
 922     ID_BLOCK    *a,
 923     ID_BLOCK    *b
 924 )
 925 {
 926         unsigned int    ni, ai, bi;
 927         ID_BLOCK                *n;
 928
 929         if ( a == NULL ) {
 930                 return( NULL );
 931         }
 932         if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
 933                 return( idl_dup( a ) );
 934         }
 935
 936         if ( ID_BLOCK_ALLIDS( a ) ) {
 937                 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
 938                 ni = 0;
 939
 940                 for ( ai = 1, bi = 0;
 941                         ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n) && bi < ID_BLOCK_NMAX(b);
 942                         ai++ )
 943                 {
 944                         if ( ID_BLOCK_ID(b, bi) == ai ) {
 945                                 bi++;
 946                         } else {
 947                                 ID_BLOCK_ID(n, ni++) = ai;
 948                         }
 949                 }
 950
 951                 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n); ai++ ) {
 952                         ID_BLOCK_ID(n, ni++) = ai;
 953                 }
 954
 955                 if ( ni == ID_BLOCK_NMAX(n) ) {
 956                         idl_free( n );
 957                         return( idl_allids( be ) );
 958                 } else {
 959                         ID_BLOCK_NIDS(n) = ni;
 960                         return( n );
 961                 }
 962         }
 963
 964         n = idl_dup( a );
 965
 966         ni = 0;
 967         for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
 968                 for ( ;
 969                         bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
 970                     bi++ )
 971                 {
 972                         ;       /* NULL */
 973                 }
 974
 975                 if ( bi == ID_BLOCK_NIDS(b) ) {
 976                         break;
 977                 }
 978
 979                 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
 980                         ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
 981                 }
 982         }
 983
 984         for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
 985                 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
 986         }
 987         ID_BLOCK_NIDS(n) = ni;
 988
 989         return( n );
 990 }
 991
 992 /*      return the first ID in the block
 993  *      if ALLIDS block
 994  *              NIDS > 1 return 1
 995  *              otherwise return NOID
 996  *      otherwise return first ID
 997  */
 998 ID
 999 idl_firstid( ID_BLOCK *idl )
1000 {
1001         if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1002                 return( NOID );
1003         }
1004
1005         if ( ID_BLOCK_ALLIDS( idl ) ) {
1006                 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1007         }
1008
1009         return( ID_BLOCK_ID(idl, 0) );
1010 }
1011
1012 /*      return next ID after id
1013  *      if ALLIDS block, increment id.
1014  *              if id < NIDS return id
1015  *              otherwise NOID.
1016  *      otherwise SEARCH for next id (ugh!)
1017  */
1018 ID
1019 idl_nextid( ID_BLOCK *idl, ID id )
1020 {
1021         unsigned int    i;
1022
1023         if ( ID_BLOCK_ALLIDS( idl ) ) {
1024                 return( ++id < ID_BLOCK_NIDS(idl) ? id : NOID );
1025         }
1026
1027         for ( i = 0; i < ID_BLOCK_NIDS(idl) && ID_BLOCK_ID(idl, i) <= id; i++ ) {
1028                 ;       /* NULL */
1029         }
1030
1031         if ( i >= ID_BLOCK_NIDS(idl) ) {
1032                 return( NOID );
1033         } else {
1034                 return( ID_BLOCK_ID(idl, i) );
1035         }
1036 }