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( INDEX, INFO, "IDL: range (%ld - %ld)\n",
40 (long) BDB_IDL_RANGE_FIRST( ids ),
41 (long) BDB_IDL_RANGE_LAST( ids ), 0 );
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( INDEX, INFO, "IDL: size %ld", (long) ids[0], 0, 0 );
54 Debug( LDAP_DEBUG_ANY, "IDL: size %ld", (long) ids[0], 0, 0 );
57 for( i=1; i<=ids[0]; i++ ) {
59 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
62 LDAP_LOG( INDEX, INFO, "%02lx",(long)ids[i], 0, 0 );
64 Debug( LDAP_DEBUG_ANY, " %02lx", (long) ids[i], 0, 0 );
68 Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
73 #endif /* IDL_DEBUG > 1 */
74 #endif /* IDL_DEBUG > 0 */
76 unsigned bdb_idl_search( ID *ids, ID id )
78 #define IDL_BINARY_SEARCH 1
79 #ifdef IDL_BINARY_SEARCH
81 * binary search of id in ids
82 * if found, returns position of id
83 * if not found, returns first postion greater than id
96 cursor = base + pivot;
97 val = IDL_CMP( id, ids[cursor + 1] );
102 } else if ( val > 0 ) {
118 /* (reverse) linear search */
125 for( i=ids[0]; i; i-- ) {
135 int bdb_idl_insert( ID *ids, ID id )
137 unsigned x = bdb_idl_search( ids, id );
141 LDAP_LOG( INDEX, DETAIL1, "insert: %04lx at %d\n", (long) id, x, 0 );
143 Debug( LDAP_DEBUG_ANY, "insert: %04lx at %d\n", (long) id, x, 0 );
157 if ( x <= ids[0] && ids[x] == id ) {
162 if ( ++ids[0] >= BDB_IDL_DB_MAX ) {
165 ids[2] = ids[ids[0]-1];
166 } else if ( ids[ids[0]-1] < id ) {
169 ids[2] = ids[ids[0]-1];
175 AC_MEMCPY( &ids[x+1], &ids[x], (ids[0]-x) * sizeof(ID) );
188 static int idl_delete( ID *ids, ID id )
190 unsigned x = bdb_idl_search( ids, id );
194 LDAP_LOG( INDEX, DETAIL1, "delete: %04lx at %d\n", (long) id, x, 0 );
196 Debug( LDAP_DEBUG_ANY, "delete: %04lx at %d\n", (long) id, x, 0 );
210 if( x > ids[0] || ids[x] != id ) {
214 } else if ( --ids[0] == 0 ) {
220 AC_MEMCPY( &ids[x], &ids[x+1], (1+ids[0]-x) * sizeof(ID) );
240 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
244 assert( ids != NULL );
251 ID buf[BDB_PAGESIZE*4];
256 int flags = bdb->bi_db_opflags | DB_MULTIPLE;
258 data.ulen = sizeof(buf);
259 data.flags = DB_DBT_USERMEM;
264 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
267 LDAP_LOG( INDEX, ERR,
268 "bdb_idl_fetch_key: cursor failed: %s (%d)\n",
269 db_strerror(rc), rc, 0 );
271 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
272 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
276 rc = cursor->c_get( cursor, key, &data, flags | DB_SET );
282 DB_MULTIPLE_INIT( ptr, &data );
284 DB_MULTIPLE_NEXT(ptr, &data, j, len);
287 AC_MEMCPY( i, j, sizeof(ID) );
290 rc = cursor->c_get( cursor, key, &data, flags | DB_NEXT_DUP );
292 if ( rc == DB_NOTFOUND ) rc = 0;
294 /* On disk, a range is denoted by 0 in the first element */
296 if (ids[0] != BDB_IDL_RANGE_SIZE) {
298 LDAP_LOG( INDEX, ERR,
299 "=> bdb_idl_fetch_key: range size mismatch: "
300 "expected %ld, got %ld\n",
301 BDB_IDL_RANGE_SIZE, ids[0], 0 );
303 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
304 "range size mismatch: expected %d, got %ld\n",
305 BDB_IDL_RANGE_SIZE, ids[0], 0 );
307 cursor->c_close( cursor );
310 BDB_IDL_RANGE( ids, ids[2], ids[3] );
312 data.size = BDB_IDL_SIZEOF(ids);
314 rc2 = cursor->c_close( cursor );
317 LDAP_LOG( INDEX, ERR,
318 "bdb_idl_fetch_key: close failed: %s (%d)\n",
319 db_strerror(rc2), rc2, 0 );
321 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
322 "close failed: %s (%d)\n", db_strerror(rc2), rc2, 0 );
329 data.ulen = BDB_IDL_UM_SIZEOF;
330 data.flags = DB_DBT_USERMEM;
332 rc = db->get( db, tid, key, &data, bdb->bi_db_opflags );
335 if( rc == DB_NOTFOUND ) {
338 } else if( rc != 0 ) {
340 LDAP_LOG( INDEX, ERR,
341 "bdb_idl_fetch_key: get failed: %s (%d)\n",
342 db_strerror(rc), rc, 0 );
344 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
345 "get failed: %s (%d)\n",
346 db_strerror(rc), rc, 0 );
350 } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
351 /* size not multiple of ID size */
353 LDAP_LOG( INDEX, ERR,
354 "bdb_idl_fetch_key: odd size: expected %ld multiple, got %ld\n",
355 (long) sizeof( ID ), (long) data.size, 0 );
357 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
358 "odd size: expected %ld multiple, got %ld\n",
359 (long) sizeof( ID ), (long) data.size, 0 );
363 } else if ( data.size != BDB_IDL_SIZEOF(ids) ) {
366 LDAP_LOG( INDEX, ERR,
367 "bdb_idl_fetch_key: get size mismatch: expected %ld, got %ld\n",
368 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
370 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
371 "get size mismatch: expected %ld, got %ld\n",
372 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
388 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
391 #ifndef BDB_IDL_MULTI
392 ID ids[BDB_IDL_DB_SIZE];
396 /* for printable keys only */
398 LDAP_LOG( INDEX, ARGS, "bdb_idl_insert_key: %s %ld\n",
399 (char *)key->data, (long) id, 0 );
401 Debug( LDAP_DEBUG_ARGS,
402 "=> bdb_idl_insert_key: %s %ld\n",
403 (char *)key->data, (long) id, 0 );
407 assert( id != NOID );
416 data.size = sizeof( ID );
417 data.ulen = data.size;
418 data.flags = DB_DBT_USERMEM;
420 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
423 LDAP_LOG( INDEX, ERR,
424 "bdb_idl_insert_key: cursor failed: %s (%d)\n",
425 db_strerror(rc), rc, 0 );
427 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
428 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
433 /* Fetch the first data item for this key, to see if it
434 * exists and if it's a range.
436 rc = cursor->c_get( cursor, key, &data, DB_SET | DB_RMW );
440 /* not a range, count the number of items */
442 rc = cursor->c_count( cursor, &count, 0 );
447 if ( count >= BDB_IDL_DB_SIZE ) {
448 /* No room, convert to a range */
451 key2.dlen = key2.ulen;
452 key2.flags |= DB_DBT_PARTIAL;
456 rc = cursor->c_get( cursor, &key2, &data, DB_NEXT_NODUP );
457 if ( rc != 0 && rc != DB_NOTFOUND ) {
458 err = "c_get next_nodup";
461 if ( rc == DB_NOTFOUND ) {
462 rc = cursor->c_get( cursor, key, &data, DB_LAST );
468 rc = cursor->c_get( cursor, key, &data, DB_PREV );
478 rc = db->del( db, tid, key, 0 );
485 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
491 rc = cursor->c_put( cursor, key, &data, DB_KEYLAST );
497 rc = cursor->c_put( cursor, key, &data, DB_KEYLAST );
503 /* There's room, just store it */
507 /* It's a range, see if we need to rewrite
512 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
519 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
525 if ( id < lo || id > hi ) {
526 /* Delete the current lo/hi */
527 rc = cursor->c_del( cursor, 0 );
533 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
540 } else if ( rc == DB_NOTFOUND ) {
541 put1: data.data = &id;
542 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
543 /* Don't worry if it's already there */
544 if ( rc != 0 && rc != DB_KEYEXIST ) {
549 /* initial c_get failed, nothing was done */
552 LDAP_LOG( INDEX, ERR,
553 "bdb_idl_insert_key: %s failed: %s (%d)\n",
554 err, db_strerror(rc), rc );
556 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
557 "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
559 cursor->c_close( cursor );
562 rc = cursor->c_close( cursor );
564 #else /* !BDB_IDL_MULTI */
566 data.ulen = sizeof ids;
567 data.flags = DB_DBT_USERMEM;
569 /* fetch the key for read/modify/write */
570 rc = db->get( db, tid, key, &data, DB_RMW | bdb->bi_db_opflags );
572 if( rc == DB_NOTFOUND ) {
575 data.size = 2 * sizeof( ID );
577 } else if ( rc != 0 ) {
579 LDAP_LOG( INDEX, ERR, "bdb_idl_insert_key: get failed: %s (%d)\n",
580 db_strerror(rc), rc, 0 );
582 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
583 "get failed: %s (%d)\n",
584 db_strerror(rc), rc, 0 );
588 } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
589 /* size not multiple of ID size */
591 LDAP_LOG( INDEX, ERR,
592 "bdb_idl_insert_key: odd size: expected %ld multiple, got %ld\n",
593 (long) sizeof( ID ), (long) data.size, 0 );
595 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
596 "odd size: expected %ld multiple, got %ld\n",
597 (long) sizeof( ID ), (long) data.size, 0 );
601 } else if ( data.size != BDB_IDL_SIZEOF(ids) ) {
604 LDAP_LOG( INDEX, ERR,
605 "bdb_idl_insert_key: odd size: expected %ld multiple, got %ld\n",
606 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
608 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
609 "get size mismatch: expected %ld, got %ld\n",
610 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
614 } else if ( BDB_IDL_IS_RANGE(ids) ) {
617 } else if ( ids[2] > id ) {
624 rc = bdb_idl_insert( ids, id );
628 LDAP_LOG( INDEX, DETAIL1, "bdb_idl_insert_key: dup\n", 0, 0, 0 );
630 Debug( LDAP_DEBUG_TRACE, "=> bdb_idl_insert_key: dup\n",
637 LDAP_LOG( INDEX, ERR,
638 "bdb_idl_insert_key: insert failed: (%d)\n", rc, 0, 0 );
640 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
641 "bdb_idl_insert failed (%d)\n",
648 data.size = BDB_IDL_SIZEOF( ids );
652 rc = db->put( db, tid, key, &data, 0 );
654 if( rc == DB_KEYEXIST ) rc = 0;
658 LDAP_LOG( INDEX, ERR,
659 "bdb_idl_insert_key: put failed: %s (%d)\n",
660 db_strerror(rc), rc, 0 );
662 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
663 "put failed: %s (%d)\n",
664 db_strerror(rc), rc, 0 );
678 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
681 #ifndef BDB_IDL_MULTI
682 ID ids[BDB_IDL_DB_SIZE];
686 /* for printable keys only */
688 LDAP_LOG( INDEX, ARGS, "bdb_idl_delete_key: %s %ld\n",
689 (char *)key->data, (long) id, 0 );
691 Debug( LDAP_DEBUG_ARGS,
692 "=> bdb_idl_delete_key: %s %ld\n",
693 (char *)key->data, (long) id, 0 );
697 assert( id != NOID );
707 data.size = sizeof( id );
708 data.ulen = data.size;
709 data.flags = DB_DBT_USERMEM;
711 rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
714 LDAP_LOG( INDEX, ERR,
715 "bdb_idl_delete_key: cursor failed: %s (%d)\n",
716 db_strerror(rc), rc, 0 );
718 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
719 "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
723 /* Fetch the first data item for this key, to see if it
724 * exists and if it's a range.
726 rc = cursor->c_get( cursor, key, &data, DB_SET | DB_RMW );
730 /* Not a range, just delete it */
732 /* position to correct item */
734 rc = cursor->c_get( cursor, key, &data,
735 DB_GET_BOTH | DB_RMW );
738 rc = cursor->c_del( cursor, 0 );
745 /* It's a range, see if we need to rewrite
750 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
757 rc = cursor->c_get( cursor, key, &data, DB_NEXT_DUP );
763 if ( id == lo || id == hi ) {
767 } else if ( id == hi ) {
772 /* The range has collapsed... */
773 rc = db->del( db, tid, key, 0 );
779 rc = cursor->c_del( cursor, 0 );
787 rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
796 /* initial c_get failed, nothing was done */
799 LDAP_LOG( INDEX, ERR,
800 "bdb_idl_delete_key: %s failed: %s (%d)\n",
801 err, db_strerror(rc), rc );
803 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
804 "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
806 cursor->c_close( cursor );
809 rc = cursor->c_close( cursor );
813 data.ulen = sizeof( ids );
814 data.flags = DB_DBT_USERMEM;
816 /* fetch the key for read/modify/write */
817 rc = db->get( db, tid, key, &data, DB_RMW | bdb->bi_db_opflags );
821 LDAP_LOG( INDEX, ERR, "bdb_idl_delete_key: get failed: %s (%d)\n",
822 db_strerror(rc), rc, 0 );
824 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
825 "get failed: %s (%d)\n",
826 db_strerror(rc), rc, 0 );
830 } else if ( data.size == 0 || data.size % sizeof( ID ) ) {
831 /* size not multiple of ID size */
833 LDAP_LOG( INDEX, ERR,
834 "bdb_idl_delete_key: odd size: expected: %ld multiple, got %ld\n",
835 (long) sizeof( ID ), (long) data.size, 0 );
837 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
838 "odd size: expected %ld multiple, got %ld\n",
839 (long) sizeof( ID ), (long) data.size, 0 );
843 } else if ( BDB_IDL_IS_RANGE(ids) ) {
846 } else if ( data.size != (1 + ids[0]) * sizeof( ID ) ) {
849 LDAP_LOG( INDEX, ERR,
850 "bdb_idl_delete_key: get size mismatch: expected: %ld, got %ld\n",
851 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
853 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
854 "get size mismatch: expected %ld, got %ld\n",
855 (long) ((1 + ids[0]) * sizeof( ID )), (long) data.size, 0 );
860 rc = idl_delete( ids, id );
864 LDAP_LOG( INDEX, ERR,
865 "bdb_idl_delete_key: delete failed: (%d)\n", rc, 0, 0 );
867 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
868 "idl_delete failed (%d)\n",
876 rc = db->del( db, tid, key, 0 );
879 LDAP_LOG( INDEX, ERR,
880 "bdb_idl_delete_key: delete failed: %s (%d)\n",
881 db_strerror(rc), rc, 0 );
883 Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
884 "delete failed: %s (%d)\n",
885 db_strerror(rc), rc, 0 );
891 data.size = (ids[0]+1) * sizeof( ID );
895 rc = db->put( db, tid, key, &data, 0 );
897 #endif /* BDB_IDL_MULTI */
901 LDAP_LOG( INDEX, ERR, "bdb_idl_delete_key: put failed: %s (%d)\n",
902 db_strerror(rc), rc, 0 );
904 Debug( LDAP_DEBUG_ANY,
905 "=> bdb_idl_delete_key: put failed: %s (%d)\n",
906 db_strerror(rc), rc, 0 );
915 * idl_intersection - return a = a intersection b
918 bdb_idl_intersection(
924 ID cursora = 0, cursorb = 0, cursorc;
927 if ( BDB_IDL_IS_ZERO( a ) || BDB_IDL_IS_ZERO( b ) ) {
932 idmin = IDL_MAX( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
933 idmax = IDL_MIN( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
934 if ( idmin > idmax ) {
937 } else if ( idmin == idmax ) {
943 if ( BDB_IDL_IS_RANGE( a ) && BDB_IDL_IS_RANGE(b) ) {
949 if ( BDB_IDL_IS_RANGE( a ) ) {
956 if ( BDB_IDL_IS_RANGE( b ) && BDB_IDL_FIRST( b ) <= idmin &&
957 BDB_IDL_LAST( b ) >= idmax) {
958 if (idmax - idmin + 1 == a[0])
967 ida = bdb_idl_first( a, &cursora );
968 idb = bdb_idl_first( b, &cursorb );
972 ida = bdb_idl_next( a, &cursora );
974 idb = bdb_idl_next( b, &cursorb );
976 while( ida <= idmax || idb <= idmax ) {
979 ida = bdb_idl_next( a, &cursora );
980 idb = bdb_idl_next( b, &cursorb );
981 } else if ( ida < idb ) {
982 ida = bdb_idl_next( a, &cursora );
984 idb = bdb_idl_next( b, &cursorb );
997 * idl_union - return a = a union b
1005 ID cursora = 0, cursorb = 0, cursorc;
1007 if ( BDB_IDL_IS_ZERO( b ) ) {
1011 if ( BDB_IDL_IS_ZERO( a ) ) {
1012 BDB_IDL_CPY( a, b );
1016 if ( BDB_IDL_IS_RANGE( a ) || BDB_IDL_IS_RANGE(b) ) {
1017 over: ida = IDL_MIN( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
1018 idb = IDL_MAX( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
1025 ida = bdb_idl_first( a, &cursora );
1026 idb = bdb_idl_first( b, &cursorb );
1030 /* The distinct elements of a are cat'd to b */
1031 while( ida != NOID || idb != NOID ) {
1033 if( ++cursorc > BDB_IDL_UM_MAX ) {
1037 ida = bdb_idl_next( a, &cursora );
1041 ida = bdb_idl_next( a, &cursora );
1042 idb = bdb_idl_next( b, &cursorb );
1046 /* b is copied back to a in sorted order */
1051 while (cursorb <= b[0] || cursorc <= a[0]) {
1056 if (b[cursorb] < idb)
1057 a[cursora++] = b[cursorb++];
1070 * bdb_idl_notin - return a intersection ~b (or a minus b)
1079 ID cursora = 0, cursorb = 0;
1081 if( BDB_IDL_IS_ZERO( a ) ||
1082 BDB_IDL_IS_ZERO( b ) ||
1083 BDB_IDL_IS_RANGE( b ) )
1085 BDB_IDL_CPY( ids, a );
1089 if( BDB_IDL_IS_RANGE( a ) ) {
1090 BDB_IDL_CPY( ids, a );
1094 ida = bdb_idl_first( a, &cursora ),
1095 idb = bdb_idl_first( b, &cursorb );
1099 while( ida != NOID ) {
1100 if ( idb == NOID ) {
1101 /* we could shortcut this */
1102 ids[++ids[0]] = ida;
1103 ida = bdb_idl_next( a, &cursora );
1105 } else if ( ida < idb ) {
1106 ids[++ids[0]] = ida;
1107 ida = bdb_idl_next( a, &cursora );
1109 } else if ( ida > idb ) {
1110 idb = bdb_idl_next( b, &cursorb );
1113 ida = bdb_idl_next( a, &cursora );
1114 idb = bdb_idl_next( b, &cursorb );
1122 ID bdb_idl_first( ID *ids, ID *cursor )
1126 if ( ids[0] == 0 ) {
1131 if ( BDB_IDL_IS_RANGE( ids ) ) {
1132 if( *cursor < ids[1] ) {
1141 pos = bdb_idl_search( ids, *cursor );
1143 if( pos > ids[0] ) {
1151 ID bdb_idl_next( ID *ids, ID *cursor )
1153 if ( BDB_IDL_IS_RANGE( ids ) ) {
1154 if( ids[2] < ++(*cursor) ) {
1160 if ( ++(*cursor) <= ids[0] ) {
1161 return ids[*cursor];