#include "portable.h"
#include <stdio.h>
#include <ac/string.h>
#include <ac/socket.h>
#include "slap.h"
#include "back-ldbm.h"
static ID_BLOCK* idl_dup( ID_BLOCK *idl );
static void cont_alloc( Datum *cont, Datum *key )
{
ldbm_datum_init( *cont );
cont->dsize = 1 + sizeof(ID) + key->dsize;
cont->dptr = ch_malloc( cont->dsize );
* (unsigned char *) cont->dptr = SLAP_INDEX_CONT_PREFIX;
AC_MEMCPY( &((unsigned char *)cont->dptr)[1 + sizeof(ID)],
key->dptr, key->dsize );
}
static void cont_id( Datum *cont, ID id )
{
unsigned int i;
for( i=1; i <= sizeof(id); i++) {
((unsigned char *)cont->dptr)[i] = (unsigned char)(id & 0xFF);
id >>= 8;
}
}
static void cont_free( Datum *cont )
{
ch_free( cont->dptr );
}
#ifdef LDBM_DEBUG_IDL
static void idl_check(ID_BLOCK *idl)
{
int i, max;
ID_BLOCK last;
if( ID_BLOCK_ALLIDS(idl) )
{
return;
}
#ifndef USE_INDIRECT_NIDS
if( ID_BLOCK_INDIRECT(idl) )
{
for ( max = 0; !ID_BLOCK_NOID(idl, max); max++ ) ;
} else
#endif
{
max = ID_BLOCK_NIDS(idl);
}
if ( max <= 1 )
{
return;
}
for( last = ID_BLOCK_ID(idl, 0), i = 1;
i < max;
last = ID_BLOCK_ID(idl, i), i++ )
{
assert (last < ID_BLOCK_ID(idl, i) );
}
}
#endif
ID_BLOCK *
idl_alloc( unsigned int nids )
{
ID_BLOCK *new;
new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
ID_BLOCK_NMAX(new) = nids;
ID_BLOCK_NIDS(new) = 0;
return( new );
}
ID_BLOCK *
idl_allids( Backend *be )
{
ID_BLOCK *idl;
ID id;
idl = idl_alloc( 0 );
ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
if ( next_id_get( be, &id ) ) {
return NULL;
}
ID_BLOCK_NIDS(idl) = id;
return( idl );
}
void
idl_free( ID_BLOCK *idl )
{
if ( idl == NULL ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, INFO, "idl_free: called with NULL pointer\n" , 0,0,0);
#else
Debug( LDAP_DEBUG_TRACE,
"idl_free: called with NULL pointer\n",
0, 0, 0 );
#endif
return;
}
free( (char *) idl );
}
static ID_BLOCK *
idl_fetch_one(
Backend *be,
DBCache *db,
Datum key
)
{
Datum data;
ID_BLOCK *idl;
data = ldbm_cache_fetch( db, key );
if( data.dptr == NULL ) {
return NULL;
}
idl = (ID_BLOCK *) data.dptr;
if ( ID_BLOCK_ALLIDS(idl) ) {
idl = idl_allids( be );
} else {
idl = idl_dup((ID_BLOCK *) data.dptr);
}
ldbm_datum_free( db->dbc_db, data );
return idl;
}
ID_BLOCK *
idl_fetch(
Backend *be,
DBCache *db,
Datum key
)
{
Datum data;
ID_BLOCK *idl;
ID_BLOCK **tmp;
unsigned i, nids, nblocks;
idl = idl_fetch_one( be, db, key );
if ( idl == NULL ) {
return NULL;
}
if ( ID_BLOCK_ALLIDS(idl) ) {
return( idl );
}
if ( ! ID_BLOCK_INDIRECT( idl ) ) {
return( idl );
}
#ifndef USE_INDIRECT_NIDS
for ( nblocks = 0; !ID_BLOCK_NOID(idl, nblocks); nblocks++ )
;
#else
nblocks = ID_BLOCK_NIDS(idl);
#endif
tmp = (ID_BLOCK **) ch_malloc( nblocks * sizeof(ID_BLOCK *) );
cont_alloc( &data, &key );
nids = 0;
for ( i = 0; i < nblocks; i++ ) {
cont_id( &data, ID_BLOCK_ID(idl, i) );
if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, INFO,
"idl_fetch: idl_fetch_one returned NULL\n", 0,0,0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_fetch: one returned NULL\n", 0, 0, 0 );
#endif
continue;
}
nids += ID_BLOCK_NIDS(tmp[i]);
}
cont_free( &data );
idl_free( idl );
idl = idl_alloc( nids );
ID_BLOCK_NIDS(idl) = nids;
nids = 0;
for ( i = 0; i < nblocks; i++ ) {
if ( tmp[i] == NULL ) {
continue;
}
AC_MEMCPY(
(char *) &ID_BLOCK_ID(idl, nids),
(char *) &ID_BLOCK_ID(tmp[i], 0),
ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
nids += ID_BLOCK_NIDS(tmp[i]);
idl_free( tmp[i] );
}
free( (char *) tmp );
assert( ID_BLOCK_NIDS(idl) == nids );
#ifdef LDBM_DEBUG_IDL
idl_check(idl);
#endif
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, ENTRY,
"idl_fetch: %ld ids (%ld max)\n",
ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
#else
Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
#endif
return( idl );
}
static int
idl_store(
Backend *be,
DBCache *db,
Datum key,
ID_BLOCK *idl
)
{
int rc, flags;
Datum data;
#ifdef LDBM_DEBUG_IDL
idl_check(idl);
#endif
ldbm_datum_init( data );
data.dptr = (char *) idl;
data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
flags = LDBM_REPLACE;
rc = ldbm_cache_store( db, key, data, flags );
return( rc );
}
static unsigned int
idl_find(
ID_BLOCK *b,
ID id
)
{
int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
for (;lo<=hi;)
{
nr = ( lo + hi ) / 2;
if (ID_BLOCK_ID(b, nr) == id)
break;
if (ID_BLOCK_ID(b, nr) > id)
hi = nr - 1;
else
lo = nr + 1;
}
return nr;
}
static void
idl_split_block(
ID_BLOCK *b,
ID id,
ID_BLOCK **right,
ID_BLOCK **left
)
{
unsigned int nr, nl;
nr = idl_find(b, id);
if ( ID_BLOCK_ID(b,nr) < id )
nr++;
nl = ID_BLOCK_NIDS(b) - nr;
*right = idl_alloc( nr == 0 ? 1 : nr );
*left = idl_alloc( nl + (nr == 0 ? 0 : 1));
if ( nr == 0 ) {
ID_BLOCK_NIDS(*right) = 1;
ID_BLOCK_ID(*right, 0) = id;
} else {
AC_MEMCPY(
(char *) &ID_BLOCK_ID(*right, 0),
(char *) &ID_BLOCK_ID(b, 0),
nr * sizeof(ID) );
ID_BLOCK_NIDS(*right) = nr;
ID_BLOCK_ID(*left, 0) = id;
}
AC_MEMCPY(
(char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
(char *) &ID_BLOCK_ID(b, nr),
nl * sizeof(ID) );
ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
#ifdef LDBM_DEBUG_IDL
idl_check(*right);
idl_check(*left);
#endif
}
static int
idl_change_first(
Backend *be,
DBCache *db,
Datum hkey,
ID_BLOCK *h,
int pos,
Datum bkey,
ID_BLOCK *b
)
{
int rc;
if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, INFO,
"idl_change_first: ldbm_cache_delete returned %d\n", rc, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_change_first: ldbm_cache_delete returned %d\n",
rc, 0, 0 );
#endif
return( rc );
}
cont_id( &bkey, ID_BLOCK_ID(b, 0) );
if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, INFO,
"idl_change_first: idl_store returned %d\n", rc, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_change_first: idl_store returned %d\n", rc, 0, 0 );
#endif
return( rc );
}
ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, INFO,
"idl_change_first: idl_store returned %s\n", rc, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_change_first: idl_store returned %d\n", rc, 0, 0 );
#endif
return( rc );
}
return( 0 );
}
int
idl_insert_key(
Backend *be,
DBCache *db,
Datum key,
ID id
)
{
int i, j, first, rc = 0;
ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
Datum k2;
if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
idl = idl_alloc( 1 );
ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
rc = idl_store( be, db, key, idl );
idl_free( idl );
return( rc );
}
if ( ID_BLOCK_ALLIDS( idl ) ) {
idl_free( idl );
return 0;
}
if ( ! ID_BLOCK_INDIRECT( idl ) ) {
switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
case 0:
case 1:
rc = idl_store( be, db, key, idl );
break;
case 2:
rc = 0;
break;
case 3:
if ( db->dbc_maxindirect < 2 ) {
idl_free( idl );
idl = idl_allids( be );
rc = idl_store( be, db, key, idl );
break;
}
idl_split_block( idl, id, &tmp, &tmp2 );
idl_free( idl );
#ifndef USE_INDIRECT_NIDS
idl = idl_alloc( 3 );
ID_BLOCK_NMAX(idl) = 3;
ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
ID_BLOCK_ID(idl, 2) = NOID;
#else
idl = idl_alloc( 2 );
ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
ID_BLOCK_NIDS(idl) = 2;
ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
#endif
rc = idl_store( be, db, key, idl );
cont_alloc( &k2, &key );
cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
rc = idl_store( be, db, k2, tmp );
cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
rc = idl_store( be, db, k2, tmp2 );
cont_free( &k2 );
idl_free( tmp );
idl_free( tmp2 );
break;
}
idl_free( idl );
return( rc );
}
#ifndef USE_INDIRECT_NIDS
for ( i = 0; !ID_BLOCK_NOID(idl, i) && id >= ID_BLOCK_ID(idl, i); i++ )
;
#else
i = idl_find(idl, id);
if (ID_BLOCK_ID(idl, i) <= id)
i++;
#endif
if ( i != 0 ) {
i--;
first = 0;
} else {
first = 1;
}
cont_alloc( &k2, &key );
cont_id( &k2, ID_BLOCK_ID(idl, i) );
if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, ERR,
"idl_insert_key: nonexistent continuation block\n", 0, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
0, 0, 0 );
#endif
cont_free( &k2 );
idl_free( idl );
return( -1 );
}
switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
case 0:
if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, ERR,
"ids_insert_key: idl_store returned %d\n", rc, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
#endif
}
break;
case 1:
rc = idl_change_first( be, db, key, idl, i, k2, tmp );
break;
case 2:
rc = 0;
break;
case 3:
#ifndef USE_INDIRECT_NIDS
if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
#else
if ( !first && (unsigned long)(i + 1) < ID_BLOCK_NIDS(idl) ) {
#endif
Datum k3;
cont_alloc( &k3, &key );
cont_id( &k3, ID_BLOCK_ID(idl, i + 1) );
if ( (tmp2 = idl_fetch_one( be, db, k3 )) == NULL ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, ERR,
"idl_insert_key: idl_fetch_one returned NULL\n", 0, 0, 0);
#else
Debug( LDAP_DEBUG_ANY,
"idl_insert_key: idl_fetch_one returned NULL\n",
0, 0, 0 );
#endif
cont_free( &k3 );
goto split;
}
if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
--ID_BLOCK_NIDS(tmp);
rc = idl_insert( &tmp, id, db->dbc_maxids );
if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, ERR,
"idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
#endif
}
id = id2;
}
switch ( (rc = idl_insert( &tmp2, id,
db->dbc_maxids )) ) {
case 1:
rc = idl_change_first( be, db, key, idl,
i + 1, k3, tmp2 );
case 2:
case 0:
if ( rc == 2 ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, INFO,
"idl_insert_key: id %ld is already in next block\n",
id, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_insert_key: id %ld already in next block\n",
id, 0, 0 );
#endif
}
idl_free( tmp );
idl_free( tmp2 );
cont_free( &k3 );
cont_free( &k2 );
idl_free( idl );
return( 0 );
case 3:
break;
}
idl_free( tmp2 );
cont_free( &k3 );
}
split:
rc = 0;
#ifndef USE_INDIRECT_NIDS
for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
;
#else
j = ID_BLOCK_NIDS(idl);
#endif
if ( j + 1 > db->dbc_maxindirect ) {
#ifndef USE_INDIRECT_NIDS
for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
#else
for ( j = 0; (unsigned long) j < ID_BLOCK_NIDS(idl); j++ ) {
#endif
cont_id( &k2, ID_BLOCK_ID(idl, j) );
rc = ldbm_cache_delete( db, k2 );
}
idl_free( idl );
idl = idl_allids( be );
rc = idl_store( be, db, key, idl );
cont_free( &k2 );
idl_free( idl );
idl_free( tmp );
return( rc );
}
idl_split_block( tmp, id, &tmp2, &tmp3 );
idl_free( tmp );
tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
#ifndef USE_INDIRECT_NIDS
ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
#else
ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
#endif
AC_MEMCPY(
(char *) &ID_BLOCK_ID(tmp, 0),
(char *) &ID_BLOCK_ID(idl, 0),
i * sizeof(ID) );
ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
#ifndef USE_INDIRECT_NIDS
AC_MEMCPY(
(char *) &ID_BLOCK_ID(tmp, i + 2),
(char *) &ID_BLOCK_ID(idl, i + 1),
(ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
#else
AC_MEMCPY(
(char *) &ID_BLOCK_ID(tmp, i + 2),
(char *) &ID_BLOCK_ID(idl, i + 1),
(ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
ID_BLOCK_NIDS(tmp) = ID_BLOCK_NIDS(idl) + 1;
#endif
rc = idl_store( be, db, key, tmp );
cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
rc = idl_store( be, db, k2, tmp2 );
cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
rc = idl_store( be, db, k2, tmp3 );
idl_free( tmp2 );
idl_free( tmp3 );
break;
}
cont_free( &k2 );
idl_free( tmp );
idl_free( idl );
return( rc );
}
int
idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
{
unsigned int i;
if ( ID_BLOCK_ALLIDS( *idl ) ) {
return( 2 );
}
i = idl_find(*idl, id);
if ( ID_BLOCK_ID(*idl, i) == id ) {
return( 2 );
}
if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
i++;
if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
return( 3 );
}
ID_BLOCK_NMAX(*idl) *= 2;
if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
ID_BLOCK_NMAX(*idl) = maxids;
}
*idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
(ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
}
AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
(ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
ID_BLOCK_ID(*idl, i) = id;
ID_BLOCK_NIDS(*idl)++;
(void) memset(
(char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
'\0',
(ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
#ifdef LDBM_DEBUG_IDL
idl_check(*idl);
#endif
return( i == 0 ? 1 : 0 );
}
int
idl_delete_key (
Backend *be,
DBCache *db,
Datum key,
ID id
)
{
Datum data;
ID_BLOCK *idl;
unsigned i;
int j, nids;
if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
{
return -1;
}
if ( ID_BLOCK_ALLIDS( idl ) ) {
idl_free( idl );
return 0;
}
if ( ! ID_BLOCK_INDIRECT( idl ) ) {
i = idl_find(idl, id);
if ( ID_BLOCK_ID(idl, i) == id ) {
if( --ID_BLOCK_NIDS(idl) == 0 ) {
ldbm_cache_delete( db, key );
} else {
AC_MEMCPY(
&ID_BLOCK_ID(idl, i),
&ID_BLOCK_ID(idl, i+1),
(ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
idl_store( be, db, key, idl );
}
idl_free( idl );
return 0;
}
idl_free( idl );
return -1;
}
cont_alloc( &data, &key );
#ifndef USE_INDIRECT_NIDS
for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
;
for ( j = 0; j<nids; j++ )
#else
nids = ID_BLOCK_NIDS(idl);
for ( j = idl_find(idl, id); j >= 0; j = -1)
#endif
{
ID_BLOCK *tmp;
cont_id( &data, ID_BLOCK_ID(idl, j) );
if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
#ifdef NEW_LOGGING
LDAP_LOG( INDEX, INFO,
"idl_delete_key: idl_fetch_one returned NULL\n", 0, 0, 0 );
#else
Debug( LDAP_DEBUG_ANY,
"idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
#endif
continue;
}
i = idl_find(tmp, id);
if ( ID_BLOCK_ID(tmp, i) == id )
{
AC_MEMCPY(
&ID_BLOCK_ID(tmp, i),
&ID_BLOCK_ID(tmp, i+1),
(ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
ID_BLOCK_NIDS(tmp)--;
if ( ID_BLOCK_NIDS(tmp) ) {
idl_store ( be, db, data, tmp );
} else {
ldbm_cache_delete( db, data );
AC_MEMCPY(
&ID_BLOCK_ID(idl, j),
&ID_BLOCK_ID(idl, j+1),
(nids-(j+1)) * sizeof(ID));
ID_BLOCK_ID(idl, nids-1) = NOID;
nids--;
#ifdef USE_INDIRECT_NIDS
ID_BLOCK_NIDS(idl)--;
#endif
if ( ! nids )
ldbm_cache_delete( db, key );
else
idl_store( be, db, key, idl );
}
idl_free( tmp );
cont_free( &data );
idl_free( idl );
return 0;
}
idl_free( tmp );
}
cont_free( &data );
idl_free( idl );
return -1;
}
static ID_BLOCK *
idl_dup( ID_BLOCK *idl )
{
ID_BLOCK *new;
if ( idl == NULL ) {
return( NULL );
}
new = idl_alloc( ID_BLOCK_NMAXN(idl) );
AC_MEMCPY(
(char *) new,
(char *) idl,
(ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
#ifdef LDBM_DEBUG_IDL
idl_check(new);
#endif
return( new );
}
static ID_BLOCK *
idl_min( ID_BLOCK *a, ID_BLOCK *b )
{
return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
}
ID_BLOCK *
idl_intersection(
Backend *be,
ID_BLOCK *a,
ID_BLOCK *b
)
{
unsigned int ai, bi, ni;
ID_BLOCK *n;
if ( a == NULL || b == NULL ) {
return( NULL );
}
if ( ID_BLOCK_ALLIDS( a ) ) {
return( idl_dup( b ) );
}
if ( ID_BLOCK_ALLIDS( b ) ) {
return( idl_dup( a ) );
}
if ( ID_BLOCK_NIDS(a) == 0 || ID_BLOCK_NIDS(b) == 0 ) {
return( NULL );
}
n = idl_dup( idl_min( a, b ) );
#ifdef LDBM_DEBUG_IDL
idl_check(a);
idl_check(b);
#endif
for ( ni = 0, ai = 0, bi = 0; ; ) {
if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
ai++;
bi++;
if ( ai >= ID_BLOCK_NIDS(a) || bi >= ID_BLOCK_NIDS(b) )
break;
} else if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
ai++;
if ( ai >= ID_BLOCK_NIDS(a) )
break;
} else {
bi++;
if ( bi >= ID_BLOCK_NIDS(b) )
break;
}
}
if ( ni == 0 ) {
idl_free( n );
return( NULL );
}
ID_BLOCK_NIDS(n) = ni;
#ifdef LDBM_DEBUG_IDL
idl_check(n);
#endif
return( n );
}
ID_BLOCK *
idl_union(
Backend *be,
ID_BLOCK *a,
ID_BLOCK *b
)
{
unsigned int ai, bi, ni;
ID_BLOCK *n;
if ( a == NULL ) {
return( idl_dup( b ) );
}
if ( b == NULL ) {
return( idl_dup( a ) );
}
if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
return( idl_allids( be ) );
}
#ifdef LDBM_DEBUG_IDL
idl_check(a);
idl_check(b);
#endif
if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
n = a;
a = b;
b = n;
}
n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
for ( ni = 0, ai = 0, bi = 0;
ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
)
{
if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
} else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
} else {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
ai++, bi++;
}
}
for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
}
for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
}
ID_BLOCK_NIDS(n) = ni;
#ifdef LDBM_DEBUG_IDL
idl_check(n);
#endif
return( n );
}
ID_BLOCK *
idl_notin(
Backend *be,
ID_BLOCK *a,
ID_BLOCK *b
)
{
unsigned int ni, ai, bi;
ID_BLOCK *n;
if ( a == NULL ) {
return( NULL );
}
if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
return( idl_dup( a ) );
}
if ( ID_BLOCK_ALLIDS( a ) ) {
n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
ni = 0;
for ( ai = 1, bi = 0;
ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
ai++ )
{
if ( ID_BLOCK_ID(b, bi) == ai ) {
bi++;
} else {
ID_BLOCK_ID(n, ni++) = ai;
}
}
for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
ID_BLOCK_ID(n, ni++) = ai;
}
if ( ni == ID_BLOCK_NMAXN(n) ) {
idl_free( n );
return( idl_allids( be ) );
} else {
ID_BLOCK_NIDS(n) = ni;
return( n );
}
}
n = idl_dup( a );
ni = 0;
for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
for ( ;
bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
bi++ )
{
;
}
if ( bi == ID_BLOCK_NIDS(b) ) {
break;
}
if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
}
}
for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
}
ID_BLOCK_NIDS(n) = ni;
#ifdef LDBM_DEBUG_IDL
idl_check(n);
#endif
return( n );
}
ID
idl_firstid( ID_BLOCK *idl, ID *cursor )
{
*cursor = 1;
if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
return( NOID );
}
if ( ID_BLOCK_ALLIDS( idl ) ) {
return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
}
return( ID_BLOCK_ID(idl, 0) );
}
ID
idl_nextid( ID_BLOCK *idl, ID *cursor )
{
if ( ID_BLOCK_ALLIDS( idl ) ) {
if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
return *cursor;
} else {
return NOID;
}
}
if ( *cursor < ID_BLOCK_NIDS(idl) ) {
return( ID_BLOCK_ID(idl, (*cursor)++) );
}
return( NOID );
}