/* $OpenLDAP$ */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
- * Copyright 2000-2013 The OpenLDAP Foundation.
+ * Copyright 2000-2015 The OpenLDAP Foundation.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
#include <limits.h>
#include <string.h>
#include <stdlib.h>
+#include <errno.h>
#include <sys/types.h>
-#include <assert.h>
#include "midl.h"
-/** @defgroup internal MDB Internals
+/** @defgroup internal LMDB Internals
* @{
*/
/** @defgroup idls ID List Management
*/
#define CMP(x,y) ( (x) < (y) ? -1 : (x) > (y) )
-#if 0 /* superseded by append/sort */
-static unsigned mdb_midl_search( MDB_IDL ids, MDB_ID id )
+unsigned mdb_midl_search( MDB_IDL ids, MDB_ID id )
{
/*
* binary search of id in ids
return cursor;
}
}
-
+
if( val > 0 ) {
++cursor;
}
return cursor;
}
+#if 0 /* superseded by append/sort */
int mdb_midl_insert( MDB_IDL ids, MDB_ID id )
{
unsigned x, i;
- if (MDB_IDL_IS_RANGE( ids )) {
- /* if already in range, treat as a dup */
- if (id >= MDB_IDL_RANGE_FIRST(ids) && id <= MDB_IDL_RANGE_LAST(ids))
- return -1;
- if (id < MDB_IDL_RANGE_FIRST(ids))
- ids[1] = id;
- else if (id > MDB_IDL_RANGE_LAST(ids))
- ids[2] = id;
- return 0;
- }
-
x = mdb_midl_search( ids, id );
assert( x > 0 );
}
if ( ++ids[0] >= MDB_IDL_DB_MAX ) {
- if( id < ids[1] ) {
- ids[1] = id;
- ids[2] = ids[ids[0]-1];
- } else if ( ids[ids[0]-1] < id ) {
- ids[2] = id;
- } else {
- ids[2] = ids[ids[0]-1];
- }
- ids[0] = MDB_NOID;
-
+ /* no room */
+ --ids[0];
+ return -2;
+
} else {
/* insert id */
for (i=ids[0]; i>x; i--)
}
#endif
-MDB_IDL mdb_midl_alloc(void)
+MDB_IDL mdb_midl_alloc(int num)
{
- MDB_IDL ids = malloc((MDB_IDL_UM_MAX+1) * sizeof(MDB_ID));
- *ids++ = MDB_IDL_UM_MAX;
+ MDB_IDL ids = malloc((num+2) * sizeof(MDB_ID));
+ if (ids) {
+ *ids++ = num;
+ *ids = 0;
+ }
return ids;
}
void mdb_midl_free(MDB_IDL ids)
{
- free(ids-1);
+ if (ids)
+ free(ids-1);
}
-int mdb_midl_shrink( MDB_IDL *idp )
+void mdb_midl_shrink( MDB_IDL *idp )
{
MDB_IDL ids = *idp;
- if (*(--ids) > MDB_IDL_UM_MAX) {
- ids = realloc(ids, (MDB_IDL_UM_MAX+1) * sizeof(MDB_ID));
+ if (*(--ids) > MDB_IDL_UM_MAX &&
+ (ids = realloc(ids, (MDB_IDL_UM_MAX+2) * sizeof(MDB_ID))))
+ {
*ids++ = MDB_IDL_UM_MAX;
*idp = ids;
- return 1;
+ }
+}
+
+static int mdb_midl_grow( MDB_IDL *idp, int num )
+{
+ MDB_IDL idn = *idp-1;
+ /* grow it */
+ idn = realloc(idn, (*idn + num + 2) * sizeof(MDB_ID));
+ if (!idn)
+ return ENOMEM;
+ *idn++ += num;
+ *idp = idn;
+ return 0;
+}
+
+int mdb_midl_need( MDB_IDL *idp, unsigned num )
+{
+ MDB_IDL ids = *idp;
+ num += ids[0];
+ if (num > ids[-1]) {
+ num = (num + num/4 + (256 + 2)) & -256;
+ if (!(ids = realloc(ids-1, num * sizeof(MDB_ID))))
+ return ENOMEM;
+ *ids++ = num - 2;
+ *idp = ids;
}
return 0;
}
MDB_IDL ids = *idp;
/* Too big? */
if (ids[0] >= ids[-1]) {
- MDB_IDL idn = ids-1;
- /* grow it */
- idn = realloc(idn, (*idn + MDB_IDL_UM_MAX + 1) * sizeof(MDB_ID));
- if (!idn)
- return -1;
- *idn++ += MDB_IDL_UM_MAX;
- ids = idn;
- *idp = ids;
+ if (mdb_midl_grow(idp, MDB_IDL_UM_MAX))
+ return ENOMEM;
+ ids = *idp;
}
ids[0]++;
ids[ids[0]] = id;
MDB_IDL ids = *idp;
/* Too big? */
if (ids[0] + app[0] >= ids[-1]) {
- MDB_IDL idn = ids-1;
- /* grow it */
- idn = realloc(idn, (*idn + app[-1]) * sizeof(MDB_ID));
- if (!idn)
- return -1;
- *idn++ += app[-1];
- ids = idn;
- *idp = ids;
+ if (mdb_midl_grow(idp, app[0]))
+ return ENOMEM;
+ ids = *idp;
}
memcpy(&ids[ids[0]+1], &app[1], app[0] * sizeof(MDB_ID));
ids[0] += app[0];
return 0;
}
+int mdb_midl_append_range( MDB_IDL *idp, MDB_ID id, unsigned n )
+{
+ MDB_ID *ids = *idp, len = ids[0];
+ /* Too big? */
+ if (len + n > ids[-1]) {
+ if (mdb_midl_grow(idp, n | MDB_IDL_UM_MAX))
+ return ENOMEM;
+ ids = *idp;
+ }
+ ids[0] = len + n;
+ ids += len;
+ while (n)
+ ids[n--] = id++;
+ return 0;
+}
+
+void mdb_midl_xmerge( MDB_IDL idl, MDB_IDL merge )
+{
+ MDB_ID old_id, merge_id, i = merge[0], j = idl[0], k = i+j, total = k;
+ idl[0] = (MDB_ID)-1; /* delimiter for idl scan below */
+ old_id = idl[j];
+ while (i) {
+ merge_id = merge[i--];
+ for (; old_id < merge_id; old_id = idl[--j])
+ idl[k--] = old_id;
+ idl[k--] = merge_id;
+ }
+ idl[0] = total;
+}
+
/* Quicksort + Insertion sort for small arrays */
#define SMALL 8
-#define SWAP(a,b) { itmp=(a); (a)=(b); (b)=itmp; }
+#define MIDL_SWAP(a,b) { itmp=(a); (a)=(b); (b)=itmp; }
void
mdb_midl_sort( MDB_IDL ids )
l = istack[jstack--];
} else {
k = (l + ir) >> 1; /* Choose median of left, center, right */
- SWAP(ids[k], ids[l+1]);
+ MIDL_SWAP(ids[k], ids[l+1]);
if (ids[l] < ids[ir]) {
- SWAP(ids[l], ids[ir]);
+ MIDL_SWAP(ids[l], ids[ir]);
}
if (ids[l+1] < ids[ir]) {
- SWAP(ids[l+1], ids[ir]);
+ MIDL_SWAP(ids[l+1], ids[ir]);
}
if (ids[l] < ids[l+1]) {
- SWAP(ids[l], ids[l+1]);
+ MIDL_SWAP(ids[l], ids[l+1]);
}
i = l+1;
j = ir;
do i++; while(ids[i] > a);
do j--; while(ids[j] < a);
if (j < i) break;
- SWAP(ids[i],ids[j]);
+ MIDL_SWAP(ids[i],ids[j]);
}
ids[l+1] = ids[j];
ids[j] = a;
unsigned x, i;
x = mdb_mid2l_search( ids, id->mid );
- assert( x > 0 );
if( x < 1 ) {
/* internal error */
projects / openldap / blobdiff