/* idl.c - ldap id list handling routines */
/* $OpenLDAP$ */
/*
- * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
+ * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
*/
unsigned base = 0;
unsigned cursor = 0;
- int val;
+ int val = 0;
unsigned n = ids[0];
#if IDL_DEBUG > 0
#endif
}
-static int idl_insert( ID *ids, ID id )
+int bdb_idl_insert( ID *ids, ID id )
{
unsigned x = bdb_idl_search( ids, id );
DBT *key,
ID *ids )
{
+ struct bdb_info *bdb = (struct bdb_info *) be->be_private;
int rc;
DBT data;
assert( ids != NULL );
DBTzero( &data );
+
+#ifdef BDB_IDL_MULTI
+ {
+ DBC *cursor;
+ ID buf[BDB_IDL_UM_SIZE];
+ ID *i, *j;
+ void *ptr;
+ size_t len;
+ int rc2;
+ int flags = bdb->bi_db_opflags | DB_MULTIPLE;
+ data.data = buf;
+ data.ulen = BDB_IDL_UM_SIZEOF;
+ data.flags = DB_DBT_USERMEM;
+
+ if ( tid )
+ flags |= DB_RMW;
+
+ rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
+ if( rc != 0 ) {
+ Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
+ "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
+ return rc;
+ }
+ rc = cursor->c_get( cursor, key, &data, flags | DB_SET );
+ if (rc == 0) {
+ i = ids;
+ while (rc == 0) {
+ DB_MULTIPLE_INIT( ptr, &data );
+ while (ptr) {
+ DB_MULTIPLE_NEXT(ptr, &data, j, len);
+ if (j) {
+ ++i;
+ AC_MEMCPY( i, j, sizeof(ID) );
+ }
+ }
+ rc = cursor->c_get( cursor, key, &data, flags | DB_NEXT_DUP );
+ }
+ if ( rc == DB_NOTFOUND ) rc = 0;
+ ids[0] = i - ids;
+ /* On disk, a range is denoted by 0 in the first element */
+ if (ids[1] == 0) {
+ if (ids[0] != BDB_IDL_RANGE_SIZE) {
+ Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
+ "range size mismatch: expected %ld, got %ld\n",
+ BDB_IDL_RANGE_SIZE, ids[0], 0 );
+ cursor->c_close( cursor );
+ return -1;
+ }
+ BDB_IDL_RANGE( ids, ids[2], ids[3] );
+ }
+ data.size = BDB_IDL_SIZEOF(ids);
+ }
+ rc2 = cursor->c_close( cursor );
+ if (rc2) {
+ Debug( LDAP_DEBUG_ANY, "=> bdb_idl_fetch_key: "
+ "close failed: %s (%d)\n", db_strerror(rc2), rc2, 0 );
+ return rc2;
+ }
+ }
+#else
data.data = ids;
data.ulen = BDB_IDL_UM_SIZEOF;
data.flags = DB_DBT_USERMEM;
-
/* fetch it */
- rc = db->get( db, tid, key, &data, 0 );
+ rc = db->get( db, tid, key, &data, bdb->bi_db_opflags );
+#endif
if( rc == DB_NOTFOUND ) {
return rc;
DBT *key,
ID id )
{
+ struct bdb_info *bdb = (struct bdb_info *) be->be_private;
int rc;
- ID ids[BDB_IDL_DB_SIZE];
DBT data;
+#ifndef BDB_IDL_MULTI
+ ID ids[BDB_IDL_DB_SIZE];
+#endif
/* for printable keys only */
Debug( LDAP_DEBUG_ARGS,
"=> bdb_idl_insert_key: %s %ld\n",
- key->data, (long) id, 0 );
+ (char *)key->data, (long) id, 0 );
assert( id != NOID );
+ DBTzero( &data );
+#ifdef BDB_IDL_MULTI
+ {
+ ID buf[BDB_IDL_DB_MAX];
+ DBC *cursor;
+ ID lo, hi;
+ char *err;
+
+ data.size = sizeof( ID );
+ data.ulen = data.size;
+ data.flags = DB_DBT_USERMEM;
+
+ rc = bdb_idl_fetch_key( be, db, tid, key, buf );
+ if ( rc && rc != DB_NOTFOUND )
+ return rc;
+
+ /* If it never existed, or there's room in the current key,
+ * just store it.
+ */
+ if ( rc == DB_NOTFOUND || ( !BDB_IDL_IS_RANGE(buf) &&
+ BDB_IDL_N(buf) < BDB_IDL_DB_MAX ) ) {
+ data.data = &id;
+ rc = db->put( db, tid, key, &data, DB_NODUPDATA );
+ } else if ( BDB_IDL_IS_RANGE(buf) ) {
+ /* If it's a range and we're outside the boundaries,
+ * rewrite the range boundaries.
+ */
+ if ( id < BDB_IDL_RANGE_FIRST(buf) ||
+ id > BDB_IDL_RANGE_LAST(buf) ) {
+ rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
+ if ( rc != 0 ) {
+ Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
+ "cursor failed: %s (%d)\n", db_strerror(rc), rc, 0 );
+ return rc;
+ }
+ if ( id < BDB_IDL_RANGE_FIRST(buf) ) {
+ data.data = buf+1;
+ } else {
+ data.data = buf+2;
+ }
+ rc = cursor->c_get( cursor, key, &data, DB_GET_BOTH | DB_RMW );
+ if ( rc != 0 ) {
+ err = "c_get";
+fail: Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
+ "%s failed: %s (%d)\n", err, db_strerror(rc), rc );
+ if ( cursor ) cursor->c_close( cursor );
+ return rc;
+ }
+ data.data = &id;
+ /* We should have been able to just overwrite the old
+ * value with the new, but apparently we have to delete
+ * it first.
+ */
+ rc = cursor->c_del( cursor, 0 );
+ if ( rc ) {
+ err = "c_del";
+ goto fail;
+ }
+ rc = cursor->c_put( cursor, key, &data, DB_KEYFIRST );
+ if ( rc ) {
+ err = "c_put";
+ goto fail;
+ }
+ rc = cursor->c_close( cursor );
+ if ( rc ) {
+ cursor = NULL;
+ err = "c_close";
+ goto fail;
+ }
+ }
+ } else { /* convert to a range */
+ lo = BDB_IDL_FIRST(buf);
+ hi = BDB_IDL_LAST(buf);
+
+ if (id < lo)
+ lo = id;
+ else if (id > hi)
+ hi = id;
+
+ cursor = NULL;
+
+ /* Delete all of the old IDL so we can replace with a range */
+ rc = db->del( db, tid, key, 0 );
+ if ( rc ) {
+ err = "del";
+ goto fail;
+ }
+
+ /* Write the range */
+ data.data = &id;
+ id = 0;
+ rc = db->put( db, tid, key, &data, 0 );
+ if ( rc ) {
+ err = "put #1";
+ goto fail;
+ }
+ id = lo;
+ rc = db->put( db, tid, key, &data, 0 );
+ if ( rc ) {
+ err = "put #2";
+ goto fail;
+ }
+ id = hi;
+ rc = db->put( db, tid, key, &data, 0 );
+ if ( rc ) {
+ err = "put #3";
+ goto fail;
+ }
+ }
+ }
+#else
data.data = ids;
data.ulen = sizeof ids;
data.flags = DB_DBT_USERMEM;
/* fetch the key for read/modify/write */
- rc = db->get( db, tid, key, &data, DB_RMW );
+ rc = db->get( db, tid, key, &data, DB_RMW | bdb->bi_db_opflags );
if( rc == DB_NOTFOUND ) {
ids[0] = 1;
}
} else {
- rc = idl_insert( ids, id );
+ rc = bdb_idl_insert( ids, id );
+ if( rc == -1 ) {
+ Debug( LDAP_DEBUG_TRACE, "=> bdb_idl_insert_key: dup\n",
+ 0, 0, 0 );
+ return 0;
+ }
if( rc != 0 ) {
Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
- "idl_insert failed (%d)\n",
+ "bdb_idl_insert failed (%d)\n",
rc, 0, 0 );
+
return rc;
}
/* store the key */
rc = db->put( db, tid, key, &data, 0 );
+#endif
+ if( rc == DB_KEYEXIST ) rc = 0;
if( rc != 0 ) {
Debug( LDAP_DEBUG_ANY, "=> bdb_idl_insert_key: "
DBT *key,
ID id )
{
+ struct bdb_info *bdb = (struct bdb_info *) be->be_private;
int rc;
- ID ids[BDB_IDL_DB_SIZE];
DBT data;
+#ifndef BDB_IDL_MULTI
+ ID ids[BDB_IDL_DB_SIZE];
+#endif
/* for printable keys only */
Debug( LDAP_DEBUG_ARGS,
"=> bdb_idl_delete_key: %s %ld\n",
- key->data, (long) id, 0 );
+ (char *)key->data, (long) id, 0 );
assert( id != NOID );
+ DBTzero( &data );
+#ifdef BDB_IDL_MULTI
+ {
+ DBC *cursor;
+
+ data.data = &id;
+ data.size = sizeof( id );
+ data.ulen = data.size;
+ data.flags = DB_DBT_USERMEM;
+
+ rc = db->cursor( db, tid, &cursor, bdb->bi_db_opflags );
+ rc = cursor->c_get( cursor, key, &data, bdb->bi_db_opflags |
+ DB_GET_BOTH | DB_RMW );
+ if (rc == 0)
+ rc = cursor->c_del( cursor, 0 );
+ rc = cursor->c_close( cursor );
+ }
+#else
data.data = ids;
data.ulen = sizeof( ids );
data.flags = DB_DBT_USERMEM;
/* fetch the key for read/modify/write */
- rc = db->get( db, tid, key, &data, DB_RMW );
+ rc = db->get( db, tid, key, &data, DB_RMW | bdb->bi_db_opflags );
if ( rc != 0 ) {
Debug( LDAP_DEBUG_ANY, "=> bdb_idl_delete_key: "
/* store the key */
rc = db->put( db, tid, key, &data, 0 );
+#endif /* BDB_IDL_MULTI */
+
if( rc != 0 ) {
Debug( LDAP_DEBUG_ANY,
"=> bdb_idl_delete_key: put failed: %s (%d)\n",
/*
- * idl_intersection - return a intersection b
+ * idl_intersection - return a = a intersection b
*/
int
bdb_idl_intersection(
ID *a,
- ID *b,
- ID *ids )
+ ID *b )
{
ID ida, idb;
- ID cursora, cursorb;
+ ID idmax, idmin;
+ ID cursora = 0, cursorb = 0, cursorc;
+ int swap = 0;
if ( BDB_IDL_IS_ZERO( a ) || BDB_IDL_IS_ZERO( b ) ) {
- ids[0] = 0;
+ a[0] = 0;
return 0;
}
- if ( BDB_IDL_IS_RANGE( a ) && BDB_IDL_IS_RANGE(b) ) {
- ids[0] = NOID;
- ids[1] = IDL_MAX( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
- ids[2] = IDL_MIN( BDB_IDL_LAST(a), BDB_IDL_FIRST(b) );
+ idmin = IDL_MAX( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
+ idmax = IDL_MIN( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
+ if ( idmin > idmax ) {
+ a[0] = 0;
+ return 0;
+ } else if ( idmin == idmax ) {
+ a[0] = 1;
+ a[1] = idmin;
+ return 0;
+ }
- if ( ids[1] == ids[2] ) {
- ids[0] = 1;
- } else if( ids[1] > ids[2] ) {
- ids[0] = 0;
- }
+ if ( BDB_IDL_IS_RANGE( a ) && BDB_IDL_IS_RANGE(b) ) {
+ a[1] = idmin;
+ a[2] = idmax;
return 0;
}
- if( BDB_IDL_IS_RANGE( a ) ) {
+ if ( BDB_IDL_IS_RANGE( a ) ) {
ID *tmp = a;
a = b;
b = tmp;
+ swap = 1;
}
- ida = bdb_idl_first( a, &cursora ),
+ if ( BDB_IDL_IS_RANGE( b ) && BDB_IDL_FIRST( b ) <= idmin &&
+ BDB_IDL_LAST( b ) >= idmax) {
+ if (idmax - idmin + 1 == a[0])
+ {
+ a[0] = NOID;
+ a[1] = idmin;
+ a[2] = idmax;
+ }
+ goto done;
+ }
+
+ ida = bdb_idl_first( a, &cursora );
idb = bdb_idl_first( b, &cursorb );
+ cursorc = 0;
- ids[0] = 0;
+ while( ida < idmin )
+ ida = bdb_idl_next( a, &cursora );
+ while( idb < idmin )
+ idb = bdb_idl_next( b, &cursorb );
- while( ida != NOID && idb != NOID ) {
+ while( ida <= idmax || idb <= idmax ) {
if( ida == idb ) {
- ids[++ids[0]] = ida;
+ a[++cursorc] = ida;
ida = bdb_idl_next( a, &cursora );
idb = bdb_idl_next( b, &cursorb );
- if( BDB_IDL_IS_RANGE( b ) && idb < ida ) {
- if( ida > BDB_IDL_LAST( b ) ) {
- idb = NOID;
- } else {
- idb = ida;
- cursorb = ida;
- }
- }
} else if ( ida < idb ) {
ida = bdb_idl_next( a, &cursora );
} else {
idb = bdb_idl_next( b, &cursorb );
}
}
+ a[0] = cursorc;
+done:
+ if (swap)
+ BDB_IDL_CPY( b, a );
return 0;
}
/*
- * idl_union - return a union b
+ * idl_union - return a = a union b
*/
int
bdb_idl_union(
ID *a,
- ID *b,
- ID *ids )
+ ID *b )
{
ID ida, idb;
- ID cursora, cursorb;
+ ID cursora = 0, cursorb = 0, cursorc;
- if ( BDB_IDL_IS_ZERO( a ) ) {
- BDB_IDL_CPY( ids, b );
+ if ( BDB_IDL_IS_ZERO( b ) ) {
return 0;
}
- if ( BDB_IDL_IS_ZERO( b ) ) {
- BDB_IDL_CPY( ids, a );
+ if ( BDB_IDL_IS_ZERO( a ) ) {
+ BDB_IDL_CPY( a, b );
return 0;
}
if ( BDB_IDL_IS_RANGE( a ) || BDB_IDL_IS_RANGE(b) ) {
- ids[0] = NOID;
- ids[1] = IDL_MIN( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
- ids[2] = IDL_MAX( BDB_IDL_LAST(a), BDB_IDL_FIRST(b) );
+over: a[1] = IDL_MIN( BDB_IDL_FIRST(a), BDB_IDL_FIRST(b) );
+ a[2] = IDL_MAX( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
return 0;
}
- ida = bdb_idl_first( a, &cursora ),
+ ida = bdb_idl_first( a, &cursora );
idb = bdb_idl_first( b, &cursorb );
- ids[0] = 0;
-
- while( ida != NOID && idb != NOID ) {
- if( ++ids[0] > BDB_IDL_UM_MAX ) {
- ids[0] = NOID;
- ids[2] = IDL_MAX( BDB_IDL_LAST(a), BDB_IDL_LAST(b) );
- break;
- }
+ cursorc = b[0];
+ /* The distinct elements of a are cat'd to b */
+ while( ida != NOID || idb != NOID ) {
if ( ida < idb ) {
- ids[ids[0]] = ida;
+ if( ++cursorc > BDB_IDL_UM_MAX ) {
+ a[0] = NOID;
+ goto over;
+ }
+ b[cursorc] = ida;
ida = bdb_idl_next( a, &cursora );
- } else if ( ida > idb ) {
- ids[ids[0]] = idb;
- idb = bdb_idl_next( b, &cursorb );
-
} else {
- ids[ids[0]] = ida;
- ida = bdb_idl_next( a, &cursora );
+ if ( ida == idb )
+ ida = bdb_idl_next( a, &cursora );
idb = bdb_idl_next( b, &cursorb );
}
}
+ /* b is copied back to a in sorted order */
+ a[0] = cursorc;
+ cursora = 1;
+ cursorb = 1;
+ cursorc = b[0]+1;
+ while (cursorb <= b[0] || cursorc <= a[0]) {
+ if (cursorc > a[0])
+ idb = NOID;
+ else
+ idb = b[cursorc];
+ if (b[cursorb] < idb)
+ a[cursora++] = b[cursorb++];
+ else {
+ a[cursora++] = idb;
+ cursorc++;
+ }
+ }
+
return 0;
}
+#if 0
/*
* bdb_idl_notin - return a intersection ~b (or a minus b)
*/
ID *ids )
{
ID ida, idb;
- ID cursora, cursorb;
+ ID cursora = 0, cursorb = 0;
if( BDB_IDL_IS_ZERO( a ) ||
BDB_IDL_IS_ZERO( b ) ||
return 0;
}
+#endif
ID bdb_idl_first( ID *ids, ID *cursor )
{
return *cursor;
}
- pos = bdb_idl_search( ids, *cursor );
+ if ( *cursor == 0 )
+ pos = 1;
+ else
+ pos = bdb_idl_search( ids, *cursor );
if( pos > ids[0] ) {
return NOID;
return *cursor;
}
- if ( *cursor < ids[0] ) {
- return ids[(*cursor)++];
+ if ( ++(*cursor) <= ids[0] ) {
+ return ids[*cursor];
}
return NOID;
}
-