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

   1 /* idl.c - ldap id list handling routines */
   2 /* $OpenLDAP$ */
   3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   4  *
   5  * Copyright 2000-2004 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
  22 #include "back-bdb.h"
  23 #include "idl.h"
  24
  25 #define IDL_MAX(x,y)    ( x > y ? x : y )
  26 #define IDL_MIN(x,y)    ( x < y ? x : y )
  27
  28 #define IDL_CMP(x,y)    ( x < y ? -1 : ( x > y ? 1 : 0 ) )
  29
  30 #define IDL_LRU_DELETE( bdb, e ) do {                                   \
  31         if ( e->idl_lru_prev != NULL ) {                                \
  32                 e->idl_lru_prev->idl_lru_next = e->idl_lru_next;        \
  33         } else {                                                        \
  34                 bdb->bi_idl_lru_head = e->idl_lru_next;                 \
  35         }                                                               \
  36         if ( e->idl_lru_next != NULL ) {                                \
  37                 e->idl_lru_next->idl_lru_prev = e->idl_lru_prev;        \
  38         } else {                                                        \
  39                 bdb->bi_idl_lru_tail = e->idl_lru_prev;                 \
  40         }                                                               \
  41 } while ( 0 )
  42
  43 #define IDL_LRU_ADD( bdb, e ) do {                                      \
  44         e->idl_lru_next = bdb->bi_idl_lru_head;                         \
  45         if ( e->idl_lru_next != NULL ) {                                \
  46                 e->idl_lru_next->idl_lru_prev = (e);                    \
  47         }                                                               \
  48         (bdb)->bi_idl_lru_head = (e);                                   \
  49         e->idl_lru_prev = NULL;                                         \
  50         if ( (bdb)->bi_idl_lru_tail == NULL ) {                         \
  51                 (bdb)->bi_idl_lru_tail = (e);                           \
  52         }                                                               \
  53 } while ( 0 )
  54
  55 static int
  56 bdb_idl_entry_cmp( const void *v_idl1, const void *v_idl2 )
  57 {
  58         const bdb_idl_cache_entry_t *idl1 = v_idl1, *idl2 = v_idl2;
  59         int rc;
  60
  61         if ((rc = SLAP_PTRCMP( idl1->db, idl2->db ))) return rc;
  62         if ((rc = idl1->kstr.bv_len - idl2->kstr.bv_len )) return rc;
  63         return ( memcmp ( idl1->kstr.bv_val, idl2->kstr.bv_val , idl1->kstr.bv_len ) );
  64 }
  65
  66 #if IDL_DEBUG > 0
  67 static void idl_check( ID *ids )
  68 {
  69         if( BDB_IDL_IS_RANGE( ids ) ) {
  70                 assert( BDB_IDL_RANGE_FIRST(ids) <= BDB_IDL_RANGE_LAST(ids) );
  71         } else {
  72                 ID i;
  73                 for( i=1; i < ids[0]; i++ ) {
  74                         assert( ids[i+1] > ids[i] );
  75                 }
  76         }
  77 }
  78
  79 #if IDL_DEBUG > 1
  80 static void idl_dump( ID *ids )
  81 {
  82         if( BDB_IDL_IS_RANGE( ids ) ) {
  83                 Debug( LDAP_DEBUG_ANY,
  84                         "IDL: range ( %ld - %ld )\n",
  85                         (long) BDB_IDL_RANGE_FIRST( ids ),
  86                         (long) BDB_IDL_RANGE_LAST( ids ) );
  87
  88         } else {
  89                 ID i;
  90                 Debug( LDAP_DEBUG_ANY, "IDL: size %ld", (long) ids[0], 0, 0 );
  91
  92                 for( i=1; i<=ids[0]; i++ ) {
  93                         if( i % 16 == 1 ) {
  94                                 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
  95                         }
  96                         Debug( LDAP_DEBUG_ANY, "  %02lx", (long) ids[i], 0, 0 );
  97                 }
  98
  99                 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
 100         }
 101
 102         idl_check( ids );
 103 }
 104 #endif /* IDL_DEBUG > 1 */
 105 #endif /* IDL_DEBUG > 0 */
 106
 107 unsigned bdb_idl_search( ID *ids, ID id )
 108 {
 109 #define IDL_BINARY_SEARCH 1
 110 #ifdef IDL_BINARY_SEARCH
 111         /*
 112          * binary search of id in ids
 113          * if found, returns position of id
 114          * if not found, returns first postion greater than id
 115          */
 116         unsigned base = 0;
 117         unsigned cursor = 0;
 118         int val = 0;
 119         unsigned n = ids[0];
 120
 121 #if IDL_DEBUG > 0
 122         idl_check( ids );
 123 #endif
 124
 125         while( 0 < n ) {
 126                 int pivot = n >> 1;
 127                 cursor = base + pivot;
 128                 val = IDL_CMP( id, ids[cursor + 1] );
 129
 130                 if( val < 0 ) {
 131                         n = pivot;
 132
 133                 } else if ( val > 0 ) {
 134                         base = cursor + 1;
 135                         n -= pivot + 1;
 136
 137                 } else {
 138                         return cursor + 1;
 139                 }
 140         }
 141
 142         if( val > 0 ) {
 143                 return cursor + 2;
 144         } else {
 145                 return cursor + 1;
 146         }
 147
 148 #else
 149         /* (reverse) linear search */
 150         int i;
 151
 152 #if IDL_DEBUG > 0
 153         idl_check( ids );
 154 #endif
 155
 156         for( i=ids[0]; i; i-- ) {
 157                 if( id > ids[i] ) {
 158                         break;
 159                 }
 160         }
 161
 162         return i+1;
 163 #endif
 164 }
 165
 166 int bdb_idl_insert( ID *ids, ID id )
 167 {
 168         unsigned x;
 169
 170 #if IDL_DEBUG > 1
 171         Debug( LDAP_DEBUG_ANY, "insert: %04lx at %d\n", (long) id, x, 0 );
 172         idl_dump( ids );
 173 #elif IDL_DEBUG > 0
 174         idl_check( ids );
 175 #endif
 176
 177         if (BDB_IDL_IS_RANGE( ids )) {
 178                 /* if already in range, treat as a dup */
 179                 if (id >= BDB_IDL_FIRST(ids) && id <= BDB_IDL_LAST(ids))
 180                         return -1;
 181                 if (id < BDB_IDL_FIRST(ids))
 182                         ids[1] = id;
 183                 else if (id > BDB_IDL_LAST(ids))
 184                         ids[2] = id;
 185                 return 0;
 186         }
 187
 188         x = bdb_idl_search( ids, id );
 189         assert( x > 0 );
 190
 191         if( x < 1 ) {
 192                 /* internal error */
 193                 return -2;
 194         }
 195
 196         if ( x <= ids[0] && ids[x] == id ) {
 197                 /* duplicate */
 198                 return -1;
 199         }
 200
 201         if ( ++ids[0] >= BDB_IDL_DB_MAX ) {
 202                 if( id < ids[1] ) {
 203                         ids[1] = id;
 204                         ids[2] = ids[ids[0]-1];
 205                 } else if ( ids[ids[0]-1] < id ) {
 206                         ids[2] = id;
 207                 } else {
 208                         ids[2] = ids[ids[0]-1];
 209                 }
 210                 ids[0] = NOID;
 211
 212         } else {
 213                 /* insert id */
 214                 AC_MEMCPY( &ids[x+1], &ids[x], (ids[0]-x) * sizeof(ID) );
 215                 ids[x] = id;
 216         }
 217
 218 #if IDL_DEBUG > 1
 219         idl_dump( ids );
 220 #elif IDL_DEBUG > 0
 221         idl_check( ids );
 222 #endif
 223
 224         return 0;
 225 }
 226
 227 #if 0   /* unused */
 228 static int idl_delete( ID *ids, ID id )
 229 {
 230         unsigned x = bdb_idl_search( ids, id );
 231
 232 #if IDL_DEBUG > 1
 233         Debug( LDAP_DEBUG_ANY, "delete: %04lx at %d\n", (long) id, x, 0 );
 234         idl_dump( ids );
 235 #elif IDL_DEBUG > 0
 236         idl_check( ids );
 237 #endif
 238
 239         assert( x > 0 );
 240
 241         if( x <= 0 ) {
 242                 /* internal error */
 243                 return -2;
 244         }
 245
 246         if( x > ids[0] || ids[x] != id ) {
 247                 /* not found */
 248                 return -1;
 249
 250         } else if ( --ids[0] == 0 ) {
 251                 if( x != 1 ) {
 252                         return -3;
 253                 }
 254
 255         } else {
 256                 AC_MEMCPY( &ids[x], &ids[x+1], (1+ids[0]-x) * sizeof(ID) );
 257         }
 258
 259 #if IDL_DEBUG > 1
 260         idl_dump( ids );
 261 #elif IDL_DEBUG > 0
 262         idl_check( ids );
 263 #endif
 264
 265         return 0;
 266 }
 267 #endif  /* unused */
 268
 269 static char *
 270 bdb_show_key(
 271         DBT             *key,
 272         char            *buf )
 273 {
 274         if ( key->size == sizeof( ID ) ) {
 275                 unsigned char *c = key->data;
 276                 sprintf( buf, "[%02x%02x%02x%02x]", c[0], c[1], c[2], c[3] );
 277                 return buf;
 278         } else {
 279                 return key->data;
 280         }
 281 }
 282
 283 /* Find a db/key pair in the IDL cache. If ids is non-NULL,
 284  * copy the cached IDL into it, otherwise just return the status.
 285  */
 286 int
 287 bdb_idl_cache_get(
 288         struct bdb_info *bdb,
 289         DB                      *db,
 290         DBT                     *key,
 291         ID                      *ids )
 292 {
 293         bdb_idl_cache_entry_t idl_tmp;
 294         bdb_idl_cache_entry_t *matched_idl_entry;
 295
 296         DBT2bv( key, &idl_tmp.kstr );
 297         idl_tmp.db = db;
 298         ldap_pvt_thread_rdwr_rlock( &bdb->bi_idl_tree_rwlock );
 299         matched_idl_entry = avl_find( bdb->bi_idl_tree, &idl_tmp,
 300                                       bdb_idl_entry_cmp );
 301         if ( matched_idl_entry != NULL ) {
 302                 if ( matched_idl_entry->idl && ids )
 303                         BDB_IDL_CPY( ids, matched_idl_entry->idl );
 304                 ldap_pvt_thread_rdwr_runlock( &bdb->bi_idl_tree_rwlock );
 305                 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
 306                 IDL_LRU_DELETE( bdb, matched_idl_entry );
 307                 IDL_LRU_ADD( bdb, matched_idl_entry );
 308                 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
 309                 if ( matched_idl_entry->idl )
 310                         return LDAP_SUCCESS;
 311                 else
 312                         return DB_NOTFOUND;
 313         }
 314         ldap_pvt_thread_rdwr_runlock( &bdb->bi_idl_tree_rwlock );
 315
 316         return LDAP_NO_SUCH_OBJECT;
 317 }
 318
 319 void
 320 bdb_idl_cache_put(
 321         struct bdb_info *bdb,
 322         DB                      *db,
 323         DBT                     *key,
 324         ID                      *ids,
 325         int                     rc )
 326 {
 327         bdb_idl_cache_entry_t idl_tmp;
 328         bdb_idl_cache_entry_t *ee;
 329
 330         DBT2bv( key, &idl_tmp.kstr );
 331
 332         ee = (bdb_idl_cache_entry_t *) ch_malloc(
 333                 sizeof( bdb_idl_cache_entry_t ) );
 334         ee->db = db;
 335         if ( rc == DB_NOTFOUND) {
 336                 ee->idl = NULL;
 337         } else {
 338                 ee->idl = (ID*) ch_malloc( BDB_IDL_SIZEOF ( ids ) );
 339                 BDB_IDL_CPY( ee->idl, ids );
 340         }
 341         ee->idl_lru_prev = NULL;
 342         ee->idl_lru_next = NULL;
 343         ber_dupbv( &ee->kstr, &idl_tmp.kstr );
 344         ldap_pvt_thread_rdwr_wlock( &bdb->bi_idl_tree_rwlock );
 345         if ( avl_insert( &bdb->bi_idl_tree, (caddr_t) ee,
 346                 bdb_idl_entry_cmp, avl_dup_error ))
 347         {
 348                 ch_free( ee->kstr.bv_val );
 349                 ch_free( ee->idl );
 350                 ch_free( ee );
 351                 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_idl_tree_rwlock );
 352                 return;
 353         }
 354         ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
 355         IDL_LRU_ADD( bdb, ee );
 356         if ( ++bdb->bi_idl_cache_size > bdb->bi_idl_cache_max_size ) {
 357                 int i = 0;
 358                 while ( bdb->bi_idl_lru_tail != NULL && i < 10 ) {
 359                         ee = bdb->bi_idl_lru_tail;
 360                         if ( avl_delete( &bdb->bi_idl_tree, (caddr_t) ee,
 361                                     bdb_idl_entry_cmp ) == NULL ) {
 362                                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_cache_put: "
 363                                         "AVL delete failed\n",
 364                                         0, 0, 0 );
 365                         }
 366                         IDL_LRU_DELETE( bdb, ee );
 367                         i++;
 368                         --bdb->bi_idl_cache_size;
 369                         ch_free( ee->kstr.bv_val );
 370                         ch_free( ee->idl );
 371                         ch_free( ee );
 372                 }
 373         }
 374
 375         ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
 376         ldap_pvt_thread_rdwr_wunlock( &bdb->bi_idl_tree_rwlock );
 377 }
 378
 379 void
 380 bdb_idl_cache_del(
 381         struct bdb_info *bdb,
 382         DB                      *db,
 383         DBT                     *key )
 384 {
 385         bdb_idl_cache_entry_t *matched_idl_entry, idl_tmp;
 386         DBT2bv( key, &idl_tmp.kstr );
 387         idl_tmp.db = db;
 388         ldap_pvt_thread_rdwr_wlock( &bdb->bi_idl_tree_rwlock );
 389         matched_idl_entry = avl_find( bdb->bi_idl_tree, &idl_tmp,
 390                                       bdb_idl_entry_cmp );
 391         if ( matched_idl_entry != NULL ) {
 392                 if ( avl_delete( &bdb->bi_idl_tree, (caddr_t) matched_idl_entry,
 393                                     bdb_idl_entry_cmp ) == NULL ) {
 394                         Debug( LDAP_DEBUG_ANY, "=> bdb_idl_cache_del: "
 395                                 "AVL delete failed\n",
 396                                 0, 0, 0 );
 397                 }
 398                 --bdb->bi_idl_cache_size;
 399                 ldap_pvt_thread_mutex_lock( &bdb->bi_idl_tree_lrulock );
 400                 IDL_LRU_DELETE( bdb, matched_idl_entry );
 401                 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
 402                 free( matched_idl_entry->kstr.bv_val );
 403                 if ( matched_idl_entry->idl )
 404                         free( matched_idl_entry->idl );
 405                 free( matched_idl_entry );
 406         }
 407         ldap_pvt_thread_rdwr_wunlock( &bdb->bi_idl_tree_rwlock );
 408 }
 409
 410 int
 411 bdb_idl_fetch_key(
 412         BackendDB       *be,
 413         DB                      *db,
 414         DB_TXN          *tid,
 415         DBT                     *key,
 416         ID                      *ids,
 417         DBC                     **saved_cursor,
 418         int                     get_flag )
 419 {
 420         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 421         int rc;
 422         DBT data, key2, *kptr;
 423         DBC *cursor;
 424         ID *i;
 425         void *ptr;
 426         size_t len;
 427         int rc2;
 428         int flags = bdb->bi_db_opflags | DB_MULTIPLE;
 429         int opflag;
 430
 431         /* If using BerkeleyDB 4.0, the buf must be large enough to
 432          * grab the entire IDL in one get(), otherwise BDB will leak
 433          * resources on subsequent get's.  We can safely call get()
 434          * twice - once for the data, and once to get the DB_NOTFOUND
 435          * result meaning there's no more data. See ITS#2040 for details.
 436          * This bug is fixed in BDB 4.1 so a smaller buffer will work if
 437          * stack space is too limited.
 438          *
 439          * configure now requires Berkeley DB 4.1.
 440          */
 441 #if DB_VERSION_FULL < 0x04010000
 442 #       define BDB_ENOUGH 5
 443 #else
 444 #       define BDB_ENOUGH 1
 445 #endif
 446         ID buf[BDB_IDL_DB_SIZE*BDB_ENOUGH];
 447
 448         char keybuf[16];
 449
 450         Debug( LDAP_DEBUG_ARGS,
 451                 "bdb_idl_fetch_key: %s\n",
 452                 bdb_show_key( key, keybuf ), 0, 0 );
 453
 454         assert( ids != NULL );
 455
 456         if ( saved_cursor && *saved_cursor ) {
 457                 opflag = DB_NEXT;
 458         } else if ( get_flag == LDAP_FILTER_GE ) {
 459                 opflag = DB_SET_RANGE;
 460         } else if ( get_flag == LDAP_FILTER_LE ) {
 461                 opflag = DB_FIRST;
 462         } else {
 463                 opflag = DB_SET;
 464         }
 465
 466         /* only non-range lookups can use the IDL cache */
 467         if ( bdb->bi_idl_cache_size && opflag == DB_SET ) {
 468                 rc = bdb_idl_cache_get( bdb, db, key, ids );
 469                 if ( rc != LDAP_NO_SUCH_OBJECT ) return rc;
 470         }
 471
 472         DBTzero( &data );
 473
 474         data.data = buf;
 475         data.ulen = sizeof(buf);
 476         data.flags = DB_DBT_USERMEM;
 477
 478         if ( tid ) flags |= DB_RMW;
 479
 480         /* If we're not reusing an existing cursor, get a new one */
 481         if( opflag != DB_NEXT )
 482                 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
 483         else
 484                 cursor = *saved_cursor;
 485         if( rc != 0 ) {
 486                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
 487                         "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
 488                 return rc;
 489         }
 490
 491         /* If this is a LE lookup, save original key so we can determine
 492          * when to stop
 493          */
 494         if ( get_flag == LDAP_FILTER_LE ) {
 495                 DBTzero( &key2 );
 496                 key2.flags = DB_DBT_USERMEM;
 497                 key2.ulen = sizeof(keybuf);
 498                 key2.data = keybuf;
 499                 AC_MEMCPY( keybuf, key->data, key->size );
 500                 kptr = &key2;
 501         } else {
 502                 kptr = key;
 503         }
 504         len = key->size;
 505         rc = cursor->c_get( cursor, kptr, &data, flags | opflag );
 506
 507         /* skip presence key on range inequality lookups */
 508         while (rc == 0 && kptr->size != len) {
 509                 rc = cursor->c_get( cursor, kptr, &data, flags | DB_NEXT_NODUP );
 510         }
 511         /* If we're doing a LE compare and the new key is greater than
 512          * our search key, we're done
 513          */
 514         if (rc == 0 && get_flag == LDAP_FILTER_LE && memcmp( kptr->data,
 515                 key->data, key->size ) > 0 ) {
 516                 rc = DB_NOTFOUND;
 517         }
 518         if (rc == 0) {
 519                 i = ids;
 520                 while (rc == 0) {
 521                         u_int8_t *j;
 522
 523                         DB_MULTIPLE_INIT( ptr, &data );
 524                         while (ptr) {
 525                                 DB_MULTIPLE_NEXT(ptr, &data, j, len);
 526                                 if (j) {
 527                                         ++i;
 528                                         AC_MEMCPY( i, j, sizeof(ID) );
 529                                 }
 530                         }
 531                         rc = cursor->c_get( cursor, key, &data, flags | DB_NEXT_DUP );
 532                 }
 533                 if ( rc == DB_NOTFOUND ) rc = 0;
 534                 ids[0] = i - ids;
 535                 /* On disk, a range is denoted by 0 in the first element */
 536                 if (ids[1] == 0) {
 537                         if (ids[0] != BDB_IDL_RANGE_SIZE) {
 538                                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
 539                                         "range size mismatch: expected %d, got %ld\n",
 540                                         BDB_IDL_RANGE_SIZE, ids[0], 0 );
 541                                 cursor->c_close( cursor );
 542                                 return -1;
 543                         }
 544                         BDB_IDL_RANGE( ids, ids[2], ids[3] );
 545                 }
 546                 data.size = BDB_IDL_SIZEOF(ids);
 547         }
 548
 549         if ( saved_cursor && rc == 0 ) {
 550                 if ( !*saved_cursor )
 551                         *saved_cursor = cursor;
 552                 rc2 = 0;
 553         }
 554         else
 555                 rc2 = cursor->c_close( cursor );
 556         if (rc2) {
 557                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
 558                         "close failed: %s (%d)\n", db_strerror(rc2), rc2, 0 );
 559                 return rc2;
 560         }
 561
 562         if( rc == DB_NOTFOUND ) {
 563                 return rc;
 564
 565         } else if( rc != 0 ) {
 566                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
 567                         "get failed: %s (%d)\n",
 568                         db_strerror(rc), rc, 0 );
 569                 return rc;
 570
 571         } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
 572                 /* size not multiple of ID size */
 573                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
 574                         "odd size: expected %ld multiple, got %ld\n",
 575                         (long) sizeof( ID ), (long) data.size, 0 );
 576                 return -1;
 577
 578         } else if ( data.size != BDB_IDL_SIZEOF(ids) ) {
 579                 /* size mismatch */
 580                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
 581                         "get size mismatch: expected %ld, got %ld\n",
 582                         (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
 583                 return -1;
 584         }
 585
 586         if ( bdb->bi_idl_cache_max_size ) {
 587                 bdb_idl_cache_put( bdb, db, key, ids, rc );
 588         }
 589
 590         return rc;
 591 }
 592
 593
 594 int
 595 bdb_idl_insert_key(
 596         BackendDB       *be,
 597         DB                      *db,
 598         DB_TXN          *tid,
 599         DBT                     *key,
 600         ID                      id )
 601 {
 602         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 603         int     rc;
 604         DBT data;
 605         DBC *cursor;
 606         ID lo, hi, tmp;
 607         char *err;
 608
 609         {
 610                 char buf[16];
 611                 Debug( LDAP_DEBUG_ARGS,
 612                         "bdb_idl_insert_key: %lx %s\n",
 613                         (long) id, bdb_show_key( key, buf ), 0 );
 614         }
 615
 616         assert( id != NOID );
 617
 618         if ( bdb->bi_idl_cache_size ) {
 619                 bdb_idl_cache_del( bdb, db, key );
 620         }
 621
 622         DBTzero( &data );
 623         data.size = sizeof( ID );
 624         data.ulen = data.size;
 625         data.flags = DB_DBT_USERMEM;
 626
 627         rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
 628         if ( rc != 0 ) {
 629                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
 630                         "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
 631                 return rc;
 632         }
 633         data.data = &tmp;
 634         /* Fetch the first data item for this key, to see if it
 635          * exists and if it's a range.
 636          */
 637         rc = cursor->c_get( cursor, key, &data, DB_SET | DB_RMW );
 638         err = "c_get";
 639         if ( rc == 0 ) {
 640                 if ( tmp != 0 ) {
 641                         /* not a range, count the number of items */
 642                         db_recno_t count;
 643                         rc = cursor->c_count( cursor, &count, 0 );
 644                         if ( rc != 0 ) {
 645                                 err = "c_count";
 646                                 goto fail;
 647                         }
 648                         if ( count >= BDB_IDL_DB_MAX ) {
 649                         /* No room, convert to a range */
 650                                 DBT key2 = *key;
 651
 652                                 key2.dlen = key2.ulen;
 653                                 key2.flags |= DB_DBT_PARTIAL;
 654
 655                                 lo = tmp;
 656                                 data.data = &hi;
 657                                 rc = cursor->c_get( cursor, &key2, &data, DB_NEXT_NODUP );
 658                                 if ( rc != 0 && rc != DB_NOTFOUND ) {
 659                                         err = "c_get next_nodup";
 660                                         goto fail;
 661                                 }
 662                                 if ( rc == DB_NOTFOUND ) {
 663                                         rc = cursor->c_get( cursor, key, &data, DB_LAST );
 664                                         if ( rc != 0 ) {
 665                                                 err = "c_get last";
 666                                                 goto fail;
 667                                         }
 668                                 } else {
 669                                         rc = cursor->c_get( cursor, key, &data, DB_PREV );
 670                                         if ( rc != 0 ) {
 671                                                 err = "c_get prev";
 672                                                 goto fail;
 673                                         }
 674                                 }
 675                                 if ( id < lo )
 676                                         lo = id;
 677                                 else if ( id > hi )
 678                                         hi = id;
 679                                 rc = db->del( db, tid, key, 0 );
 680                                 if ( rc != 0 ) {
 681                                         err = "del";
 682                                         goto fail;
 683                                 }
 684                                 data.data = &id;
 685                                 id = 0;
 686                                 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
 687                                 if ( rc != 0 ) {
 688                                         err = "c_put 0";
 689                                         goto fail;
 690                                 }
 691                                 id = lo;
 692                                 rc = cursor->c_put( cursor, key, &data, DB_KEYLAST );
 693                                 if ( rc != 0 ) {
 694                                         err = "c_put lo";
 695                                         goto fail;
 696                                 }
 697                                 id = hi;
 698                                 rc = cursor->c_put( cursor, key, &data, DB_KEYLAST );
 699                                 if ( rc != 0 ) {
 700                                         err = "c_put hi";
 701                                         goto fail;
 702                                 }
 703                         } else {
 704                         /* There's room, just store it */
 705                                 goto put1;
 706                         }
 707                 } else {
 708                         /* It's a range, see if we need to rewrite
 709                          * the boundaries
 710                          */
 711                         hi = id;
 712                         data.data = &lo;
 713                         rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
 714                         if ( rc != 0 ) {
 715                                 err = "c_get lo";
 716                                 goto fail;
 717                         }
 718                         if ( id > lo ) {
 719                                 data.data = &hi;
 720                                 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
 721                                 if ( rc != 0 ) {
 722                                         err = "c_get hi";
 723                                         goto fail;
 724                                 }
 725                         }
 726                         if ( id < lo || id > hi ) {
 727                                 /* Delete the current lo/hi */
 728                                 rc = cursor->c_del( cursor, 0 );
 729                                 if ( rc != 0 ) {
 730                                         err = "c_del";
 731                                         goto fail;
 732                                 }
 733                                 data.data = &id;
 734                                 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
 735                                 if ( rc != 0 ) {
 736                                         err = "c_put lo/hi";
 737                                         goto fail;
 738                                 }
 739                         }
 740                 }
 741         } else if ( rc == DB_NOTFOUND ) {
 742 put1:           data.data = &id;
 743                 rc = cursor->c_put( cursor, key, &data, DB_NODUPDATA );
 744                 /* Don't worry if it's already there */
 745                 if ( rc != 0 && rc != DB_KEYEXIST ) {
 746                         err = "c_put id";
 747                         goto fail;
 748                 }
 749         } else {
 750                 /* initial c_get failed, nothing was done */
 751 fail:
 752                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
 753                         "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
 754                 cursor->c_close( cursor );
 755                 return rc;
 756         }
 757         rc = cursor->c_close( cursor );
 758         if( rc != 0 ) {
 759                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
 760                         "c_close failed: %s (%d)\n",
 761                         db_strerror(rc), rc, 0 );
 762         }
 763         return rc;
 764 }
 765
 766 int
 767 bdb_idl_delete_key(
 768         BackendDB       *be,
 769         DB                      *db,
 770         DB_TXN          *tid,
 771         DBT                     *key,
 772         ID                      id )
 773 {
 774         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 775         int     rc;
 776         DBT data;
 777         DBC *cursor;
 778         ID lo, hi, tmp;
 779         char *err;
 780
 781         {
 782                 char buf[16];
 783                 Debug( LDAP_DEBUG_ARGS,
 784                         "bdb_idl_delete_key: %lx %s\n",
 785                         (long) id, bdb_show_key( key, buf ), 0 );
 786         }
 787         assert( id != NOID );
 788
 789         if ( bdb->bi_idl_cache_max_size ) {
 790                 bdb_idl_cache_del( bdb, db, key );
 791         }
 792
 793         DBTzero( &data );
 794         data.data = &tmp;
 795         data.size = sizeof( id );
 796         data.ulen = data.size;
 797         data.flags = DB_DBT_USERMEM;
 798
 799         rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
 800         if ( rc != 0 ) {
 801                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
 802                         "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
 803                 return rc;
 804         }
 805         /* Fetch the first data item for this key, to see if it
 806          * exists and if it's a range.
 807          */
 808         rc = cursor->c_get( cursor, key, &data, DB_SET | DB_RMW );
 809         err = "c_get";
 810         if ( rc == 0 ) {
 811                 if ( tmp != 0 ) {
 812                         /* Not a range, just delete it */
 813                         if (tmp != id) {
 814                                 /* position to correct item */
 815                                 tmp = id;
 816                                 rc = cursor->c_get( cursor, key, &data,
 817                                         DB_GET_BOTH | DB_RMW  );
 818                                 if ( rc != 0 ) {
 819                                         err = "c_get id";
 820                                         goto fail;
 821                                 }
 822                         }
 823                         rc = cursor->c_del( cursor, 0 );
 824                         if ( rc != 0 ) {
 825                                 err = "c_del id";
 826                                 goto fail;
 827                         }
 828                 } else {
 829                         /* It's a range, see if we need to rewrite
 830                          * the boundaries
 831                          */
 832                         data.data = &lo;
 833                         rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
 834                         if ( rc != 0 ) {
 835                                 err = "c_get lo";
 836                                 goto fail;
 837                         }
 838                         data.data = &hi;
 839                         rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
 840                         if ( rc != 0 ) {
 841                                 err = "c_get hi";
 842                                 goto fail;
 843                         }
 844                         if ( id == lo || id == hi ) {
 845                                 if ( id == lo ) {
 846                                         id++;
 847                                         lo = id;
 848                                 } else if ( id == hi ) {
 849                                         id--;
 850                                         hi = id;
 851                                 }
 852                                 if ( lo >= hi ) {
 853                                 /* The range has collapsed... */
 854                                         rc = db->del( db, tid, key, 0 );
 855                                         if ( rc != 0 ) {
 856                                                 err = "del";
 857                                                 goto fail;
 858                                         }
 859                                 } else {
 860                                         if ( id == lo ) {
 861                                                 /* reposition on lo slot */
 862                                                 data.data = &lo;
 863                                                 cursor->c_get( cursor, key, &data, DB_PREV );
 864                                                 lo = id;
 865                                         }
 866                                         rc = cursor->c_del( cursor, 0 );
 867                                         if ( rc != 0 ) {
 868                                                 err = "c_del";
 869                                                 goto fail;
 870                                         }
 871                                 }
 872                                 if ( lo <= hi ) {
 873                                         data.data = &id;
 874                                         rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
 875                                         if ( rc != 0 ) {
 876                                                 err = "c_put lo/hi";
 877                                                 goto fail;
 878                                         }
 879                                 }
 880                         }
 881                 }
 882         } else {
 883                 /* initial c_get failed, nothing was done */
 884 fail:
 885                 if ( rc != DB_NOTFOUND ) {
 886                 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
 887                         "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
 888                 }
 889                 cursor->c_close( cursor );
 890                 return rc;
 891         }
 892         rc = cursor->c_close( cursor );
 893         if( rc != 0 ) {
 894                 Debug( LDAP_DEBUG_ANY,
 895                         "=> bdb_idl_delete_key: c_close failed: %s (%d)\n",
 896                         db_strerror(rc), rc, 0 );
 897         }
 898
 899         return rc;
 900 }
 901
 902
 903 /*
 904  * idl_intersection - return a = a intersection b
 905  */
 906 int
 907 bdb_idl_intersection(
 908         ID *a,
 909         ID *b )
 910 {
 911         ID ida, idb;
 912         ID idmax, idmin;
 913         ID cursora = 0, cursorb = 0, cursorc;
 914         int swap = 0;
 915
 916         if ( BDB_IDL_IS_ZERO( a ) || BDB_IDL_IS_ZERO( b ) ) {
 917                 a[0] = 0;
 918                 return 0;
 919         }
 920
 921         idmin = IDL_MAX( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
 922         idmax = IDL_MIN( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
 923         if ( idmin > idmax ) {
 924                 a[0] = 0;
 925                 return 0;
 926         } else if ( idmin == idmax ) {
 927                 a[0] = 1;
 928                 a[1] = idmin;
 929                 return 0;
 930         }
 931
 932         if ( BDB_IDL_IS_RANGE( a ) ) {
 933                 if ( BDB_IDL_IS_RANGE(b) ) {
 934                 /* If both are ranges, just shrink the boundaries */
 935                         a[1] = idmin;
 936                         a[2] = idmax;
 937                         return 0;
 938                 } else {
 939                 /* Else swap so that b is the range, a is a list */
 940                         ID *tmp = a;
 941                         a = b;
 942                         b = tmp;
 943                         swap = 1;
 944                 }
 945         }
 946
 947         /* If a range completely covers the list, the result is
 948          * just the list. If idmin to idmax is contiguous, just
 949          * turn it into a range.
 950          */
 951         if ( BDB_IDL_IS_RANGE( b )
 952                 && BDB_IDL_FIRST( b ) <= BDB_IDL_FIRST( a )
 953                 && BDB_IDL_LAST( b ) >= BDB_IDL_LAST( a ) ) {
 954                 if (idmax - idmin + 1 == a[0])
 955                 {
 956                         a[0] = NOID;
 957                         a[1] = idmin;
 958                         a[2] = idmax;
 959                 }
 960                 goto done;
 961         }
 962
 963         /* Fine, do the intersection one element at a time.
 964          * First advance to idmin in both IDLs.
 965          */
 966         cursora = cursorb = idmin;
 967         ida = bdb_idl_first( a, &cursora );
 968         idb = bdb_idl_first( b, &cursorb );
 969         cursorc = 0;
 970
 971         while( ida <= idmax || idb <= idmax ) {
 972                 if( ida == idb ) {
 973                         a[++cursorc] = ida;
 974                         ida = bdb_idl_next( a, &cursora );
 975                         idb = bdb_idl_next( b, &cursorb );
 976                 } else if ( ida < idb ) {
 977                         ida = bdb_idl_next( a, &cursora );
 978                 } else {
 979                         idb = bdb_idl_next( b, &cursorb );
 980                 }
 981         }
 982         a[0] = cursorc;
 983 done:
 984         if (swap)
 985                 BDB_IDL_CPY( b, a );
 986
 987         return 0;
 988 }
 989
 990
 991 /*
 992  * idl_union - return a = a union b
 993  */
 994 int
 995 bdb_idl_union(
 996         ID      *a,
 997         ID      *b )
 998 {
 999         ID ida, idb;
1000         ID cursora = 0, cursorb = 0, cursorc;
1001
1002         if ( BDB_IDL_IS_ZERO( b ) ) {
1003                 return 0;
1004         }
1005
1006         if ( BDB_IDL_IS_ZERO( a ) ) {
1007                 BDB_IDL_CPY( a, b );
1008                 return 0;
1009         }
1010
1011         if ( BDB_IDL_IS_RANGE( a ) || BDB_IDL_IS_RANGE(b) ) {
1012 over:           ida = IDL_MIN( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
1013                 idb = IDL_MAX( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
1014                 a[0] = NOID;
1015                 a[1] = ida;
1016                 a[2] = idb;
1017                 return 0;
1018         }
1019
1020         ida = bdb_idl_first( a, &cursora );
1021         idb = bdb_idl_first( b, &cursorb );
1022
1023         cursorc = b[0];
1024
1025         /* The distinct elements of a are cat'd to b */
1026         while( ida != NOID || idb != NOID ) {
1027                 if ( ida < idb ) {
1028                         if( ++cursorc > BDB_IDL_UM_MAX ) {
1029                                 goto over;
1030                         }
1031                         b[cursorc] = ida;
1032                         ida = bdb_idl_next( a, &cursora );
1033
1034                 } else {
1035                         if ( ida == idb )
1036                                 ida = bdb_idl_next( a, &cursora );
1037                         idb = bdb_idl_next( b, &cursorb );
1038                 }
1039         }
1040
1041         /* b is copied back to a in sorted order */
1042         a[0] = cursorc;
1043         cursora = 1;
1044         cursorb = 1;
1045         cursorc = b[0]+1;
1046         while (cursorb <= b[0] || cursorc <= a[0]) {
1047                 if (cursorc > a[0])
1048                         idb = NOID;
1049                 else
1050                         idb = b[cursorc];
1051                 if (cursorb <= b[0] && b[cursorb] < idb)
1052                         a[cursora++] = b[cursorb++];
1053                 else {
1054                         a[cursora++] = idb;
1055                         cursorc++;
1056                 }
1057         }
1058
1059         return 0;
1060 }
1061
1062
1063 #if 0
1064 /*
1065  * bdb_idl_notin - return a intersection ~b (or a minus b)
1066  */
1067 int
1068 bdb_idl_notin(
1069         ID      *a,
1070         ID      *b,
1071         ID *ids )
1072 {
1073         ID ida, idb;
1074         ID cursora = 0, cursorb = 0;
1075
1076         if( BDB_IDL_IS_ZERO( a ) ||
1077                 BDB_IDL_IS_ZERO( b ) ||
1078                 BDB_IDL_IS_RANGE( b ) )
1079         {
1080                 BDB_IDL_CPY( ids, a );
1081                 return 0;
1082         }
1083
1084         if( BDB_IDL_IS_RANGE( a ) ) {
1085                 BDB_IDL_CPY( ids, a );
1086                 return 0;
1087         }
1088
1089         ida = bdb_idl_first( a, &cursora ),
1090         idb = bdb_idl_first( b, &cursorb );
1091
1092         ids[0] = 0;
1093
1094         while( ida != NOID ) {
1095                 if ( idb == NOID ) {
1096                         /* we could shortcut this */
1097                         ids[++ids[0]] = ida;
1098                         ida = bdb_idl_next( a, &cursora );
1099
1100                 } else if ( ida < idb ) {
1101                         ids[++ids[0]] = ida;
1102                         ida = bdb_idl_next( a, &cursora );
1103
1104                 } else if ( ida > idb ) {
1105                         idb = bdb_idl_next( b, &cursorb );
1106
1107                 } else {
1108                         ida = bdb_idl_next( a, &cursora );
1109                         idb = bdb_idl_next( b, &cursorb );
1110                 }
1111         }
1112
1113         return 0;
1114 }
1115 #endif
1116
1117 ID bdb_idl_first( ID *ids, ID *cursor )
1118 {
1119         ID pos;
1120
1121         if ( ids[0] == 0 ) {
1122                 *cursor = NOID;
1123                 return NOID;
1124         }
1125
1126         if ( BDB_IDL_IS_RANGE( ids ) ) {
1127                 if( *cursor < ids[1] ) {
1128                         *cursor = ids[1];
1129                 }
1130                 return *cursor;
1131         }
1132
1133         if ( *cursor == 0 )
1134                 pos = 1;
1135         else
1136                 pos = bdb_idl_search( ids, *cursor );
1137
1138         if( pos > ids[0] ) {
1139                 return NOID;
1140         }
1141
1142         *cursor = pos;
1143         return ids[pos];
1144 }
1145
1146 ID bdb_idl_next( ID *ids, ID *cursor )
1147 {
1148         if ( BDB_IDL_IS_RANGE( ids ) ) {
1149                 if( ids[2] < ++(*cursor) ) {
1150                         return NOID;
1151                 }
1152                 return *cursor;
1153         }
1154
1155         if ( ++(*cursor) <= ids[0] ) {
1156                 return ids[*cursor];
1157         }
1158
1159         return NOID;
1160 }
1161