mirror of
https://git.openldap.org/openldap/openldap.git
synced 2026-01-01 12:39:35 -05:00
117 lines
2 KiB
C
117 lines
2 KiB
C
/* idl.c - ldap id list handling routines */
|
|
/* $OpenLDAP$ */
|
|
/*
|
|
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <ac/string.h>
|
|
#include <ac/socket.h>
|
|
|
|
#include "back-bdb.h"
|
|
|
|
#define BDB_IDL_SIZE (1<<16)
|
|
#define BDB_IDL_MAX (BDB_IDL_SIZE-16)
|
|
#define BDB_IDL_ALLOC (BDB_IDL_MAX * sizeof(ID))
|
|
|
|
#define BDB_IS_ALLIDS(ids) ((ids)[0] == NOID)
|
|
|
|
static int idl_search( ID *ids, ID id )
|
|
{
|
|
/* we should replace this a binary search as ids is sorted */
|
|
int i;
|
|
int n = (int) ids[0];
|
|
|
|
for( i = 1; i <= n; i++ ) {
|
|
if( id <= ids[i] ) {
|
|
return i;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int idl_insert( ID *ids, ID id )
|
|
{
|
|
int x = idl_search( ids, id );
|
|
|
|
if( ids[x] == id ) {
|
|
/* duplicate */
|
|
return -1;
|
|
}
|
|
|
|
if( x == 0 ) {
|
|
/* append the id */
|
|
ids[0]++;
|
|
ids[ids[0]] = id;
|
|
|
|
} else if ( ids[0]+1 >= BDB_IDL_MAX ) {
|
|
ids[0] = NOID;
|
|
|
|
} else {
|
|
/* insert id */
|
|
AC_MEMCPY( &ids[x+1], &ids[x], (1+ids[0]-x) * sizeof(ID) );
|
|
ids[0]++;
|
|
ids[x] = id;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
bdb_idl_insert_key(
|
|
BackendDB *be,
|
|
DB *db,
|
|
DB_TXN *tid,
|
|
DBT *key,
|
|
ID id )
|
|
{
|
|
int rc;
|
|
ID ids[BDB_IDL_SIZE];
|
|
DBT data;
|
|
|
|
assert( id != NOID );
|
|
|
|
data.data = ids;
|
|
data.ulen = sizeof( ids );
|
|
data.flags = DB_DBT_USERMEM;
|
|
|
|
/* fetch the key and grab a write lock */
|
|
rc = db->get( db, tid, key, &data, DB_RMW );
|
|
|
|
if( rc == DB_NOTFOUND ) {
|
|
ids[0] = 1;
|
|
ids[1] = id;
|
|
data.size = 2 * sizeof( ID );
|
|
|
|
} else if ( rc != 0 ) {
|
|
return rc;
|
|
|
|
} else if ( data.size == 0 || data.size % sizeof( ID ) ) {
|
|
/* size not multiple of ID size */
|
|
return -1;
|
|
|
|
} else if ( BDB_IS_ALLIDS(ids) ) {
|
|
return 0;
|
|
|
|
} else if ( data.size != (1 + ids[0]) * sizeof( ID ) ) {
|
|
/* size mismatch */
|
|
return -1;
|
|
|
|
} else {
|
|
rc = idl_insert( ids, id );
|
|
|
|
if( rc != 0 ) return rc;
|
|
|
|
data.size = (ids[0]+1) * sizeof( ID );
|
|
}
|
|
|
|
/* store the key */
|
|
rc = db->put( db, tid, key, &data, 0 );
|
|
|
|
return rc;
|
|
}
|