1 /* idl.c - ldap id list handling routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2005 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
20 #include <ac/string.h>
25 #define IDL_MAX(x,y) ( x > y ? x : y )
26 #define IDL_MIN(x,y) ( x < y ? x : y )
28 #define IDL_CMP(x,y) ( x < y ? -1 : ( x > y ? 1 : 0 ) )
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; \
34 bdb->bi_idl_lru_head = e->idl_lru_next; \
36 if ( e->idl_lru_next != NULL ) { \
37 e->idl_lru_next->idl_lru_prev = e->idl_lru_prev; \
39 bdb->bi_idl_lru_tail = e->idl_lru_prev; \
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); \
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); \
56 bdb_idl_entry_cmp( const void *v_idl1, const void *v_idl2 )
58 const bdb_idl_cache_entry_t *idl1 = v_idl1, *idl2 = v_idl2;
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 ) );
67 static void idl_check( ID *ids )
69 if( BDB_IDL_IS_RANGE( ids ) ) {
70 assert( BDB_IDL_RANGE_FIRST(ids) <= BDB_IDL_RANGE_LAST(ids) );
73 for( i=1; i < ids[0]; i++ ) {
74 assert( ids[i+1] > ids[i] );
80 static void idl_dump( ID *ids )
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 ) );
90 Debug( LDAP_DEBUG_ANY, "IDL: size %ld", (long) ids[0], 0, 0 );
92 for( i=1; i<=ids[0]; i++ ) {
94 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
96 Debug( LDAP_DEBUG_ANY, " %02lx", (long) ids[i], 0, 0 );
99 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
104 #endif /* IDL_DEBUG > 1 */
105 #endif /* IDL_DEBUG > 0 */
107 unsigned bdb_idl_search( ID *ids, ID id )
109 #define IDL_BINARY_SEARCH 1
110 #ifdef IDL_BINARY_SEARCH
112 * binary search of id in ids
113 * if found, returns position of id
114 * if not found, returns first postion greater than id
127 cursor = base + pivot;
128 val = IDL_CMP( id, ids[cursor + 1] );
133 } else if ( val > 0 ) {
149 /* (reverse) linear search */
156 for( i=ids[0]; i; i-- ) {
166 int bdb_idl_insert( ID *ids, ID id )
171 Debug( LDAP_DEBUG_ANY, "insert: %04lx at %d\n", (long) id, x, 0 );
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))
181 if (id < BDB_IDL_FIRST(ids))
183 else if (id > BDB_IDL_LAST(ids))
188 x = bdb_idl_search( ids, id );
196 if ( x <= ids[0] && ids[x] == id ) {
201 if ( ++ids[0] >= BDB_IDL_DB_MAX ) {
204 ids[2] = ids[ids[0]-1];
205 } else if ( ids[ids[0]-1] < id ) {
208 ids[2] = ids[ids[0]-1];
214 AC_MEMCPY( &ids[x+1], &ids[x], (ids[0]-x) * sizeof(ID) );
228 static int idl_delete( ID *ids, ID id )
230 unsigned x = bdb_idl_search( ids, id );
233 Debug( LDAP_DEBUG_ANY, "delete: %04lx at %d\n", (long) id, x, 0 );
246 if( x > ids[0] || ids[x] != id ) {
250 } else if ( --ids[0] == 0 ) {
256 AC_MEMCPY( &ids[x], &ids[x+1], (1+ids[0]-x) * sizeof(ID) );
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] );
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.
288 struct bdb_info *bdb,
293 bdb_idl_cache_entry_t idl_tmp;
294 bdb_idl_cache_entry_t *matched_idl_entry;
296 DBT2bv( key, &idl_tmp.kstr );
298 ldap_pvt_thread_rdwr_rlock( &bdb->bi_idl_tree_rwlock );
299 matched_idl_entry = avl_find( bdb->bi_idl_tree, &idl_tmp,
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 )
314 ldap_pvt_thread_rdwr_runlock( &bdb->bi_idl_tree_rwlock );
316 return LDAP_NO_SUCH_OBJECT;
321 struct bdb_info *bdb,
327 bdb_idl_cache_entry_t idl_tmp;
328 bdb_idl_cache_entry_t *ee;
330 DBT2bv( key, &idl_tmp.kstr );
332 ee = (bdb_idl_cache_entry_t *) ch_malloc(
333 sizeof( bdb_idl_cache_entry_t ) );
335 if ( rc == DB_NOTFOUND) {
338 ee->idl = (ID*) ch_malloc( BDB_IDL_SIZEOF ( ids ) );
339 BDB_IDL_CPY( ee->idl, ids );
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 ))
348 ch_free( ee->kstr.bv_val );
351 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_idl_tree_rwlock );
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 ) {
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",
366 IDL_LRU_DELETE( bdb, ee );
368 --bdb->bi_idl_cache_size;
369 ch_free( ee->kstr.bv_val );
375 ldap_pvt_thread_mutex_unlock( &bdb->bi_idl_tree_lrulock );
376 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_idl_tree_rwlock );
381 struct bdb_info *bdb,
385 bdb_idl_cache_entry_t *matched_idl_entry, idl_tmp;
386 DBT2bv( key, &idl_tmp.kstr );
388 ldap_pvt_thread_rdwr_wlock( &bdb->bi_idl_tree_rwlock );
389 matched_idl_entry = avl_find( bdb->bi_idl_tree, &idl_tmp,
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",
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 );
407 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_idl_tree_rwlock );
420 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
422 DBT data, key2, *kptr;
428 int flags = bdb->bi_db_opflags | DB_MULTIPLE;
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.
439 * configure now requires Berkeley DB 4.1.
441 #if DB_VERSION_FULL < 0x04010000
442 # define BDB_ENOUGH 5
444 /* We sometimes test with tiny IDLs, and BDB always wants buffers
445 * that are at least one page in size.
447 # if BDB_IDL_DB_SIZE < 4096
448 # define BDB_ENOUGH 2048
450 # define BDB_ENOUGH 1
453 ID buf[BDB_IDL_DB_SIZE*BDB_ENOUGH];
457 Debug( LDAP_DEBUG_ARGS,
458 "bdb_idl_fetch_key: %s\n",
459 bdb_show_key( key, keybuf ), 0, 0 );
461 assert( ids != NULL );
463 if ( saved_cursor && *saved_cursor ) {
465 } else if ( get_flag == LDAP_FILTER_GE ) {
466 opflag = DB_SET_RANGE;
467 } else if ( get_flag == LDAP_FILTER_LE ) {
473 /* only non-range lookups can use the IDL cache */
474 if ( bdb->bi_idl_cache_size && opflag == DB_SET ) {
475 rc = bdb_idl_cache_get( bdb, db, key, ids );
476 if ( rc != LDAP_NO_SUCH_OBJECT ) return rc;
482 data.ulen = sizeof(buf);
483 data.flags = DB_DBT_USERMEM;
485 if ( tid ) flags |= DB_RMW;
487 /* If we're not reusing an existing cursor, get a new one */
488 if( opflag != DB_NEXT ) {
489 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
491 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
492 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
496 cursor = *saved_cursor;
499 /* If this is a LE lookup, save original key so we can determine
500 * when to stop. If this is a GE lookup, save the key since it
501 * will be overwritten.
503 if ( get_flag == LDAP_FILTER_LE || get_flag == LDAP_FILTER_GE ) {
505 key2.flags = DB_DBT_USERMEM;
506 key2.ulen = sizeof(keybuf);
508 key2.size = key->size;
509 AC_MEMCPY( keybuf, key->data, key->size );
515 rc = cursor->c_get( cursor, kptr, &data, flags | opflag );
517 /* skip presence key on range inequality lookups */
518 while (rc == 0 && kptr->size != len) {
519 rc = cursor->c_get( cursor, kptr, &data, flags | DB_NEXT_NODUP );
521 /* If we're doing a LE compare and the new key is greater than
522 * our search key, we're done
524 if (rc == 0 && get_flag == LDAP_FILTER_LE && memcmp( kptr->data,
525 key->data, key->size ) > 0 ) {
533 DB_MULTIPLE_INIT( ptr, &data );
535 DB_MULTIPLE_NEXT(ptr, &data, j, len);
541 rc = cursor->c_get( cursor, key, &data, flags | DB_NEXT_DUP );
543 if ( rc == DB_NOTFOUND ) rc = 0;
545 /* On disk, a range is denoted by 0 in the first element */
547 if (ids[0] != BDB_IDL_RANGE_SIZE) {
548 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
549 "range size mismatch: expected %d, got %ld\n",
550 BDB_IDL_RANGE_SIZE, ids[0], 0 );
551 cursor->c_close( cursor );
554 BDB_IDL_RANGE( ids, ids[2], ids[3] );
556 data.size = BDB_IDL_SIZEOF(ids);
559 if ( saved_cursor && rc == 0 ) {
560 if ( !*saved_cursor )
561 *saved_cursor = cursor;
565 rc2 = cursor->c_close( cursor );
567 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
568 "close failed: %s (%d)\n", db_strerror(rc2), rc2, 0 );
572 if( rc == DB_NOTFOUND ) {
575 } else if( rc != 0 ) {
576 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
577 "get failed: %s (%d)\n",
578 db_strerror(rc), rc, 0 );
581 } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
582 /* size not multiple of ID size */
583 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
584 "odd size: expected %ld multiple, got %ld\n",
585 (long) sizeof( ID ), (long) data.size, 0 );
588 } else if ( data.size != BDB_IDL_SIZEOF(ids) ) {
590 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
591 "get size mismatch: expected %ld, got %ld\n",
592 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
596 if ( bdb->bi_idl_cache_max_size ) {
597 bdb_idl_cache_put( bdb, db, key, ids, rc );
612 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
616 ID lo, hi, tmp, nlo, nhi, nid;
621 Debug( LDAP_DEBUG_ARGS,
622 "bdb_idl_insert_key: %lx %s\n",
623 (long) id, bdb_show_key( key, buf ), 0 );
626 assert( id != NOID );
628 if ( bdb->bi_idl_cache_size ) {
629 bdb_idl_cache_del( bdb, db, key );
633 data.size = sizeof( ID );
634 data.ulen = data.size;
635 data.flags = DB_DBT_USERMEM;
637 BDB_ID2DISK( id, &nid );
639 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
641 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
642 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
646 /* Fetch the first data item for this key, to see if it
647 * exists and if it's a range.
649 rc = cursor->c_get( cursor, key, &data, DB_SET | DB_RMW );
653 /* not a range, count the number of items */
655 rc = cursor->c_count( cursor, &count, 0 );
660 if ( count >= BDB_IDL_DB_MAX ) {
661 /* No room, convert to a range */
665 key2.dlen = key2.ulen;
666 key2.flags |= DB_DBT_PARTIAL;
668 BDB_DISK2ID( &nlo, &lo );
671 rc = cursor->c_get( cursor, &key2, &data, DB_NEXT_NODUP );
672 if ( rc != 0 && rc != DB_NOTFOUND ) {
673 err = "c_get next_nodup";
676 if ( rc == DB_NOTFOUND ) {
677 rc = cursor->c_get( cursor, key, &data, DB_LAST );
683 rc = cursor->c_get( cursor, key, &data, DB_PREV );
689 BDB_DISK2ID( &nhi, &hi );
690 /* Update hi/lo if needed, then delete all the items
695 rc = cursor->c_del( cursor, 0 );
700 rc = cursor->c_put( cursor, key, &data, DB_KEYLAST );
706 /* Don't fetch anything, just position cursor */
707 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
708 data.dlen = data.ulen = 0;
709 rc = cursor->c_get( cursor, key, &data, DB_SET | DB_RMW );
715 rc = cursor->c_del( cursor, 0 );
720 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
726 /* Delete all the records between lo and hi */
727 for ( i=2; i<count; i++ ) {
728 rc = cursor->c_get( cursor, &key2, &data, DB_NEXT_DUP | DB_RMW );
730 err = "c_get next_dup";
733 rc = cursor->c_del( cursor, 0 );
739 /* Store the range marker */
740 data.size = data.ulen = sizeof(ID);
741 data.flags = DB_DBT_USERMEM;
743 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
749 /* There's room, just store it */
753 /* It's a range, see if we need to rewrite
758 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
763 BDB_DISK2ID( &nlo, &lo );
766 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
771 BDB_DISK2ID( &nhi, &hi );
773 if ( id < lo || id > hi ) {
774 /* Delete the current lo/hi */
775 rc = cursor->c_del( cursor, 0 );
781 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
788 } else if ( rc == DB_NOTFOUND ) {
789 put1: data.data = &nid;
790 rc = cursor->c_put( cursor, key, &data, DB_NODUPDATA );
791 /* Don't worry if it's already there */
792 if ( rc != 0 && rc != DB_KEYEXIST ) {
797 /* initial c_get failed, nothing was done */
799 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
800 "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
801 cursor->c_close( cursor );
804 rc = cursor->c_close( cursor );
806 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
807 "c_close failed: %s (%d)\n",
808 db_strerror(rc), rc, 0 );
821 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
825 ID lo, hi, tmp, nid, nlo, nhi;
830 Debug( LDAP_DEBUG_ARGS,
831 "bdb_idl_delete_key: %lx %s\n",
832 (long) id, bdb_show_key( key, buf ), 0 );
834 assert( id != NOID );
836 if ( bdb->bi_idl_cache_max_size ) {
837 bdb_idl_cache_del( bdb, db, key );
840 BDB_ID2DISK( id, &nid );
844 data.size = sizeof( id );
845 data.ulen = data.size;
846 data.flags = DB_DBT_USERMEM;
848 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
850 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
851 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
854 /* Fetch the first data item for this key, to see if it
855 * exists and if it's a range.
857 rc = cursor->c_get( cursor, key, &data, DB_SET | DB_RMW );
861 /* Not a range, just delete it */
863 /* position to correct item */
865 rc = cursor->c_get( cursor, key, &data,
866 DB_GET_BOTH | DB_RMW );
872 rc = cursor->c_del( cursor, 0 );
878 /* It's a range, see if we need to rewrite
882 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
887 BDB_DISK2ID( &nlo, &lo );
889 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
894 BDB_DISK2ID( &nhi, &hi );
895 if ( id == lo || id == hi ) {
899 } else if ( id == hi ) {
904 /* The range has collapsed... */
905 rc = db->del( db, tid, key, 0 );
912 /* reposition on lo slot */
914 cursor->c_get( cursor, key, &data, DB_PREV );
916 rc = cursor->c_del( cursor, 0 );
923 BDB_ID2DISK( id, &nid );
925 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
934 /* initial c_get failed, nothing was done */
936 if ( rc != DB_NOTFOUND ) {
937 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
938 "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
940 cursor->c_close( cursor );
943 rc = cursor->c_close( cursor );
945 Debug( LDAP_DEBUG_ANY,
946 "=> bdb_idl_delete_key: c_close failed: %s (%d)\n",
947 db_strerror(rc), rc, 0 );
955 * idl_intersection - return a = a intersection b
958 bdb_idl_intersection(
964 ID cursora = 0, cursorb = 0, cursorc;
967 if ( BDB_IDL_IS_ZERO( a ) || BDB_IDL_IS_ZERO( b ) ) {
972 idmin = IDL_MAX( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
973 idmax = IDL_MIN( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
974 if ( idmin > idmax ) {
977 } else if ( idmin == idmax ) {
983 if ( BDB_IDL_IS_RANGE( a ) ) {
984 if ( BDB_IDL_IS_RANGE(b) ) {
985 /* If both are ranges, just shrink the boundaries */
990 /* Else swap so that b is the range, a is a list */
998 /* If a range completely covers the list, the result is
999 * just the list. If idmin to idmax is contiguous, just
1000 * turn it into a range.
1002 if ( BDB_IDL_IS_RANGE( b )
1003 && BDB_IDL_FIRST( b ) <= BDB_IDL_FIRST( a )
1004 && BDB_IDL_LAST( b ) >= BDB_IDL_LAST( a ) ) {
1005 if (idmax - idmin + 1 == a[0])
1014 /* Fine, do the intersection one element at a time.
1015 * First advance to idmin in both IDLs.
1017 cursora = cursorb = idmin;
1018 ida = bdb_idl_first( a, &cursora );
1019 idb = bdb_idl_first( b, &cursorb );
1022 while( ida <= idmax || idb <= idmax ) {
1025 ida = bdb_idl_next( a, &cursora );
1026 idb = bdb_idl_next( b, &cursorb );
1027 } else if ( ida < idb ) {
1028 ida = bdb_idl_next( a, &cursora );
1030 idb = bdb_idl_next( b, &cursorb );
1036 BDB_IDL_CPY( b, a );
1043 * idl_union - return a = a union b
1051 ID cursora = 0, cursorb = 0, cursorc;
1053 if ( BDB_IDL_IS_ZERO( b ) ) {
1057 if ( BDB_IDL_IS_ZERO( a ) ) {
1058 BDB_IDL_CPY( a, b );
1062 if ( BDB_IDL_IS_RANGE( a ) || BDB_IDL_IS_RANGE(b) ) {
1063 over: ida = IDL_MIN( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
1064 idb = IDL_MAX( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
1071 ida = bdb_idl_first( a, &cursora );
1072 idb = bdb_idl_first( b, &cursorb );
1076 /* The distinct elements of a are cat'd to b */
1077 while( ida != NOID || idb != NOID ) {
1079 if( ++cursorc > BDB_IDL_UM_MAX ) {
1083 ida = bdb_idl_next( a, &cursora );
1087 ida = bdb_idl_next( a, &cursora );
1088 idb = bdb_idl_next( b, &cursorb );
1092 /* b is copied back to a in sorted order */
1097 while (cursorb <= b[0] || cursorc <= a[0]) {
1102 if (cursorb <= b[0] && b[cursorb] < idb)
1103 a[cursora++] = b[cursorb++];
1116 * bdb_idl_notin - return a intersection ~b (or a minus b)
1125 ID cursora = 0, cursorb = 0;
1127 if( BDB_IDL_IS_ZERO( a ) ||
1128 BDB_IDL_IS_ZERO( b ) ||
1129 BDB_IDL_IS_RANGE( b ) )
1131 BDB_IDL_CPY( ids, a );
1135 if( BDB_IDL_IS_RANGE( a ) ) {
1136 BDB_IDL_CPY( ids, a );
1140 ida = bdb_idl_first( a, &cursora ),
1141 idb = bdb_idl_first( b, &cursorb );
1145 while( ida != NOID ) {
1146 if ( idb == NOID ) {
1147 /* we could shortcut this */
1148 ids[++ids[0]] = ida;
1149 ida = bdb_idl_next( a, &cursora );
1151 } else if ( ida < idb ) {
1152 ids[++ids[0]] = ida;
1153 ida = bdb_idl_next( a, &cursora );
1155 } else if ( ida > idb ) {
1156 idb = bdb_idl_next( b, &cursorb );
1159 ida = bdb_idl_next( a, &cursora );
1160 idb = bdb_idl_next( b, &cursorb );
1168 ID bdb_idl_first( ID *ids, ID *cursor )
1172 if ( ids[0] == 0 ) {
1177 if ( BDB_IDL_IS_RANGE( ids ) ) {
1178 if( *cursor < ids[1] ) {
1187 pos = bdb_idl_search( ids, *cursor );
1189 if( pos > ids[0] ) {
1197 ID bdb_idl_next( ID *ids, ID *cursor )
1199 if ( BDB_IDL_IS_RANGE( ids ) ) {
1200 if( ids[2] < ++(*cursor) ) {
1206 if ( ++(*cursor) <= ids[0] ) {
1207 return ids[*cursor];