1 /* idl.c - ldap id list handling routines */
4 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
16 #define IDL_MAX(x,y) ( x > y ? x : y )
17 #define IDL_MIN(x,y) ( x < y ? x : y )
19 #define IDL_CMP(x,y) ( x < y ? -1 : ( x > y ? 1 : 0 ) )
22 static void idl_check( ID *ids )
24 if( BDB_IDL_IS_RANGE( ids ) ) {
25 assert( BDB_IDL_RANGE_FIRST(ids) <= BDB_IDL_RANGE_LAST(ids) );
28 for( i=1; i < ids[0]; i++ ) {
29 assert( ids[i+1] > ids[i] );
35 static void idl_dump( ID *ids )
37 if( BDB_IDL_IS_RANGE( ids ) ) {
39 LDAP_LOG(( "idl", LDAP_LEVEL_INFO, "IDL: range (%ld - %ld)\n",
40 (long) BDB_IDL_RANGE_FIRST( ids ),
41 (long) BDB_IDL_RANGE_LAST( ids ) ));
43 Debug( LDAP_DEBUG_ANY,
44 "IDL: range ( %ld - %ld )\n",
45 (long) BDB_IDL_RANGE_FIRST( ids ),
46 (long) BDB_IDL_RANGE_LAST( ids ) );
52 LDAP_LOG(( "idl", LDAP_LEVEL_INFO, "IDL: size %ld",
55 Debug( LDAP_DEBUG_ANY, "IDL: size %ld", (long) ids[0], 0, 0 );
58 for( i=1; i<=ids[0]; i++ ) {
60 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
63 LDAP_LOG(( "idl", LDAP_LEVEL_INFO, "%02lx",(long)ids[i] ));
65 Debug( LDAP_DEBUG_ANY, " %02lx", (long) ids[i], 0, 0 );
69 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
74 #endif /* IDL_DEBUG > 1 */
75 #endif /* IDL_DEBUG > 0 */
77 unsigned bdb_idl_search( ID *ids, ID id )
79 #define IDL_BINARY_SEARCH 1
80 #ifdef IDL_BINARY_SEARCH
82 * binary search of id in ids
83 * if found, returns position of id
84 * if not found, returns first postion greater than id
97 cursor = base + pivot;
98 val = IDL_CMP( id, ids[cursor + 1] );
103 } else if ( val > 0 ) {
119 /* (reverse) linear search */
126 for( i=ids[0]; i; i-- ) {
136 int bdb_idl_insert( ID *ids, ID id )
138 unsigned x = bdb_idl_search( ids, id );
142 LDAP_LOG(( "idl", LDAP_LEVEL_DETAIL1, "insert: %04lx at %d\n",
145 Debug( LDAP_DEBUG_ANY, "insert: %04lx at %d\n", (long) id, x, 0 );
159 if ( x <= ids[0] && ids[x] == id ) {
164 if ( ++ids[0] >= BDB_IDL_DB_MAX ) {
167 ids[2] = ids[ids[0]-1];
168 } else if ( ids[ids[0]-1] < id ) {
171 ids[2] = ids[ids[0]-1];
177 AC_MEMCPY( &ids[x+1], &ids[x], (ids[0]-x) * sizeof(ID) );
190 static int idl_delete( ID *ids, ID id )
192 unsigned x = bdb_idl_search( ids, id );
196 LDAP_LOG(( "idl", LDAP_LEVEL_DETAIL1, "delete: %04lx at %d\n",
199 Debug( LDAP_DEBUG_ANY, "delete: %04lx at %d\n", (long) id, x, 0 );
213 if( x > ids[0] || ids[x] != id ) {
217 } else if ( --ids[0] == 0 ) {
223 AC_MEMCPY( &ids[x], &ids[x+1], (1+ids[0]-x) * sizeof(ID) );
243 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
247 assert( ids != NULL );
254 ID buf[BDB_IDL_DB_SIZE];
259 int flags = bdb->bi_db_opflags | DB_MULTIPLE;
261 data.ulen = sizeof(buf);
262 data.flags = DB_DBT_USERMEM;
267 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
270 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_fetch_key: cursor failed: %s (%d)\n", db_strerror(rc), rc ));
272 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
273 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
277 rc = cursor->c_get( cursor, key, &data, flags | DB_SET );
283 DB_MULTIPLE_INIT( ptr, &data );
285 DB_MULTIPLE_NEXT(ptr, &data, j, len);
288 AC_MEMCPY( i, j, sizeof(ID) );
291 rc = cursor->c_get( cursor, key, &data, flags | DB_NEXT_DUP );
293 if ( rc == DB_NOTFOUND ) rc = 0;
295 /* On disk, a range is denoted by 0 in the first element */
297 if (ids[0] != BDB_IDL_RANGE_SIZE) {
299 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "=> bdb_idl_fetch_key: range size mismatch: expected %ld, got %ld\n", BDB_IDL_RANGE_SIZE, ids[0] ));
301 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
302 "range size mismatch: expected %ld, got %ld\n",
303 BDB_IDL_RANGE_SIZE, ids[0], 0 );
305 cursor->c_close( cursor );
308 BDB_IDL_RANGE( ids, ids[2], ids[3] );
310 data.size = BDB_IDL_SIZEOF(ids);
312 rc2 = cursor->c_close( cursor );
315 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_fetch_key: close failed: %s (%d)\n", db_strerror(rc2), rc2 ));
317 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
318 "close failed: %s (%d)\n", db_strerror(rc2), rc2, 0 );
325 data.ulen = BDB_IDL_UM_SIZEOF;
326 data.flags = DB_DBT_USERMEM;
328 rc = db->get( db, tid, key, &data, bdb->bi_db_opflags );
331 if( rc == DB_NOTFOUND ) {
334 } else if( rc != 0 ) {
336 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_fetch_key: get failed: %s (%d)\n", db_strerror(rc), rc ));
338 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
339 "get failed: %s (%d)\n",
340 db_strerror(rc), rc, 0 );
344 } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
345 /* size not multiple of ID size */
347 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_fetch_key: odd size: expected %ld multiple, got %ld\n", (long) sizeof( ID ), (long) data.size ));
349 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
350 "odd size: expected %ld multiple, got %ld\n",
351 (long) sizeof( ID ), (long) data.size, 0 );
355 } else if ( data.size != BDB_IDL_SIZEOF(ids) ) {
358 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_fetch_key: get size mismatch: expected %ld, got %ld\n", (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size ));
360 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
361 "get size mismatch: expected %ld, got %ld\n",
362 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
378 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
381 #ifndef BDB_IDL_MULTI
382 ID ids[BDB_IDL_DB_SIZE];
386 /* for printable keys only */
388 LDAP_LOG(( "idl", LDAP_LEVEL_ARGS, "bdb_idl_insert_key: %s %ld\n", (char *)key->data, (long) id ));
390 Debug( LDAP_DEBUG_ARGS,
391 "=> bdb_idl_insert_key: %s %ld\n",
392 (char *)key->data, (long) id, 0 );
396 assert( id != NOID );
401 ID buf[BDB_IDL_DB_SIZE];
406 data.size = sizeof( ID );
407 data.ulen = data.size;
408 data.flags = DB_DBT_USERMEM;
410 rc = bdb_idl_fetch_key( be, db, tid, key, buf );
411 if ( rc && rc != DB_NOTFOUND )
414 /* If it never existed, or there's room in the current key,
417 if ( rc == DB_NOTFOUND || ( !BDB_IDL_IS_RANGE(buf) &&
418 BDB_IDL_N(buf) < BDB_IDL_DB_MAX ) ) {
420 rc = db->put( db, tid, key, &data, DB_NODUPDATA );
421 } else if ( BDB_IDL_IS_RANGE(buf) ) {
422 /* If it's a range and we're outside the boundaries,
423 * rewrite the range boundaries.
425 if ( id < BDB_IDL_RANGE_FIRST(buf) ||
426 id > BDB_IDL_RANGE_LAST(buf) ) {
427 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
430 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_insert_key: cursor failed: %s (%d)\n", db_strerror(rc), rc ));
432 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
433 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
437 if ( id < BDB_IDL_RANGE_FIRST(buf) ) {
442 rc = cursor->c_get( cursor, key, &data, DB_GET_BOTH | DB_RMW );
447 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_insert_key: %s failed: %s (%d)\n", err, db_strerror(rc), rc ));
449 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
450 "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
452 if ( cursor ) cursor->c_close( cursor );
456 /* We should have been able to just overwrite the old
457 * value with the new, but apparently we have to delete
460 rc = cursor->c_del( cursor, 0 );
465 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
470 rc = cursor->c_close( cursor );
477 } else { /* convert to a range */
478 lo = BDB_IDL_FIRST(buf);
479 hi = BDB_IDL_LAST(buf);
488 /* Delete all of the old IDL so we can replace with a range */
489 rc = db->del( db, tid, key, 0 );
495 /* Write the range */
498 rc = db->put( db, tid, key, &data, 0 );
504 rc = db->put( db, tid, key, &data, 0 );
510 rc = db->put( db, tid, key, &data, 0 );
519 data.ulen = sizeof ids;
520 data.flags = DB_DBT_USERMEM;
522 /* fetch the key for read/modify/write */
523 rc = db->get( db, tid, key, &data, DB_RMW | bdb->bi_db_opflags );
525 if( rc == DB_NOTFOUND ) {
528 data.size = 2 * sizeof( ID );
530 } else if ( rc != 0 ) {
532 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_insert_key: get failed: %s (%d)\n", db_strerror(rc), rc ));
534 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
535 "get failed: %s (%d)\n",
536 db_strerror(rc), rc, 0 );
540 } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
541 /* size not multiple of ID size */
543 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_insert_key: odd size: expected %ld multiple, got %ld\n", (long) sizeof( ID ), (long) data.size ));
545 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
546 "odd size: expected %ld multiple, got %ld\n",
547 (long) sizeof( ID ), (long) data.size, 0 );
551 } else if ( data.size != BDB_IDL_SIZEOF(ids) ) {
554 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_insert_key: odd size: expected %ld multiple, got %ld\n", (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size ));
556 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
557 "get size mismatch: expected %ld, got %ld\n",
558 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
562 } else if ( BDB_IDL_IS_RANGE(ids) ) {
565 } else if ( ids[2] > id ) {
572 rc = bdb_idl_insert( ids, id );
576 LDAP_LOG(( "idl", LDAP_LEVEL_DETAIL1, "bdb_idl_insert_key: dup\n" ));
578 Debug( LDAP_DEBUG_TRACE, "=> bdb_idl_insert_key: dup\n",
585 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_insert_key: insert failed: (%d)\n", rc ));
587 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
588 "bdb_idl_insert failed (%d)\n",
595 data.size = BDB_IDL_SIZEOF( ids );
599 rc = db->put( db, tid, key, &data, 0 );
601 if( rc == DB_KEYEXIST ) rc = 0;
605 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_insert_key: put failed: (%d)\n", db_strerror(rc), rc ));
607 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
608 "put failed: %s (%d)\n",
609 db_strerror(rc), rc, 0 );
623 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
626 #ifndef BDB_IDL_MULTI
627 ID ids[BDB_IDL_DB_SIZE];
631 /* for printable keys only */
633 LDAP_LOG(( "idl", LDAP_LEVEL_ARGS, "bdb_idl_delete_key: %s %ld\n", (char *)key->data, (long) id ));
635 Debug( LDAP_DEBUG_ARGS,
636 "=> bdb_idl_delete_key: %s %ld\n",
637 (char *)key->data, (long) id, 0 );
641 assert( id != NOID );
649 data.size = sizeof( id );
650 data.ulen = data.size;
651 data.flags = DB_DBT_USERMEM;
653 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
654 rc = cursor->c_get( cursor, key, &data, bdb->bi_db_opflags |
655 DB_GET_BOTH | DB_RMW );
657 rc = cursor->c_del( cursor, 0 );
658 rc = cursor->c_close( cursor );
662 data.ulen = sizeof( ids );
663 data.flags = DB_DBT_USERMEM;
665 /* fetch the key for read/modify/write */
666 rc = db->get( db, tid, key, &data, DB_RMW | bdb->bi_db_opflags );
670 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_delete_key: get failed: %s (%d)\n", db_strerror(rc), rc ));
672 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
673 "get failed: %s (%d)\n",
674 db_strerror(rc), rc, 0 );
678 } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
679 /* size not multiple of ID size */
681 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_delete_key: odd size: expected: %ld multiple, got %ld\n", (long) sizeof( ID ), (long) data.size ));
683 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
684 "odd size: expected %ld multiple, got %ld\n",
685 (long) sizeof( ID ), (long) data.size, 0 );
689 } else if ( BDB_IDL_IS_RANGE(ids) ) {
692 } else if ( data.size != (1 + ids[0]) * sizeof( ID ) ) {
695 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_delete_key: get size mismatch: expected: %ld, got %ld\n", (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size ));
697 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
698 "get size mismatch: expected %ld, got %ld\n",
699 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
704 rc = idl_delete( ids, id );
708 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_delete_key: delete failed: (%d)\n", rc ));
710 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
711 "idl_delete failed (%d)\n",
719 rc = db->del( db, tid, key, 0 );
722 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_delete_key: delete failed: %s (%d)\n", db_strerror(rc), rc ));
724 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
725 "delete failed: %s (%d)\n",
726 db_strerror(rc), rc, 0 );
732 data.size = (ids[0]+1) * sizeof( ID );
736 rc = db->put( db, tid, key, &data, 0 );
738 #endif /* BDB_IDL_MULTI */
742 LDAP_LOG(( "idl", LDAP_LEVEL_ERR, "bdb_idl_delete_key: put failed: %s (%d)\n", db_strerror(rc), rc ));
744 Debug( LDAP_DEBUG_ANY,
745 "=> bdb_idl_delete_key: put failed: %s (%d)\n",
746 db_strerror(rc), rc, 0 );
755 * idl_intersection - return a = a intersection b
758 bdb_idl_intersection(
764 ID cursora = 0, cursorb = 0, cursorc;
767 if ( BDB_IDL_IS_ZERO( a ) || BDB_IDL_IS_ZERO( b ) ) {
772 idmin = IDL_MAX( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
773 idmax = IDL_MIN( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
774 if ( idmin > idmax ) {
777 } else if ( idmin == idmax ) {
783 if ( BDB_IDL_IS_RANGE( a ) && BDB_IDL_IS_RANGE(b) ) {
789 if ( BDB_IDL_IS_RANGE( a ) ) {
796 if ( BDB_IDL_IS_RANGE( b ) && BDB_IDL_FIRST( b ) <= idmin &&
797 BDB_IDL_LAST( b ) >= idmax) {
798 if (idmax - idmin + 1 == a[0])
807 ida = bdb_idl_first( a, &cursora );
808 idb = bdb_idl_first( b, &cursorb );
812 ida = bdb_idl_next( a, &cursora );
814 idb = bdb_idl_next( b, &cursorb );
816 while( ida <= idmax || idb <= idmax ) {
819 ida = bdb_idl_next( a, &cursora );
820 idb = bdb_idl_next( b, &cursorb );
821 } else if ( ida < idb ) {
822 ida = bdb_idl_next( a, &cursora );
824 idb = bdb_idl_next( b, &cursorb );
837 * idl_union - return a = a union b
845 ID cursora = 0, cursorb = 0, cursorc;
847 if ( BDB_IDL_IS_ZERO( b ) ) {
851 if ( BDB_IDL_IS_ZERO( a ) ) {
856 if ( BDB_IDL_IS_RANGE( a ) || BDB_IDL_IS_RANGE(b) ) {
857 over: a[1] = IDL_MIN( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
858 a[2] = IDL_MAX( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
862 ida = bdb_idl_first( a, &cursora );
863 idb = bdb_idl_first( b, &cursorb );
867 /* The distinct elements of a are cat'd to b */
868 while( ida != NOID || idb != NOID ) {
870 if( ++cursorc > BDB_IDL_UM_MAX ) {
875 ida = bdb_idl_next( a, &cursora );
879 ida = bdb_idl_next( a, &cursora );
880 idb = bdb_idl_next( b, &cursorb );
884 /* b is copied back to a in sorted order */
889 while (cursorb <= b[0] || cursorc <= a[0]) {
894 if (b[cursorb] < idb)
895 a[cursora++] = b[cursorb++];
908 * bdb_idl_notin - return a intersection ~b (or a minus b)
917 ID cursora = 0, cursorb = 0;
919 if( BDB_IDL_IS_ZERO( a ) ||
920 BDB_IDL_IS_ZERO( b ) ||
921 BDB_IDL_IS_RANGE( b ) )
923 BDB_IDL_CPY( ids, a );
927 if( BDB_IDL_IS_RANGE( a ) ) {
928 BDB_IDL_CPY( ids, a );
932 ida = bdb_idl_first( a, &cursora ),
933 idb = bdb_idl_first( b, &cursorb );
937 while( ida != NOID ) {
939 /* we could shortcut this */
941 ida = bdb_idl_next( a, &cursora );
943 } else if ( ida < idb ) {
945 ida = bdb_idl_next( a, &cursora );
947 } else if ( ida > idb ) {
948 idb = bdb_idl_next( b, &cursorb );
951 ida = bdb_idl_next( a, &cursora );
952 idb = bdb_idl_next( b, &cursorb );
960 ID bdb_idl_first( ID *ids, ID *cursor )
969 if ( BDB_IDL_IS_RANGE( ids ) ) {
970 if( *cursor < ids[1] ) {
979 pos = bdb_idl_search( ids, *cursor );
989 ID bdb_idl_next( ID *ids, ID *cursor )
991 if ( BDB_IDL_IS_RANGE( ids ) ) {
992 if( ids[2] < ++(*cursor) ) {
998 if ( ++(*cursor) <= ids[0] ) {