2 * @brief ldap bdb back-end ID List functions */
4 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
6 * Copyright 2000-2013 The OpenLDAP Foundation.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted only as authorized by the OpenLDAP
13 * A copy of this license is available in the file LICENSE in the
14 * top-level directory of the distribution or, alternatively, at
15 * <http://www.OpenLDAP.org/license.html>.
22 #include <sys/types.h>
25 /** @defgroup internal MDB Internals
28 /** @defgroup idls ID List Management
31 #define CMP(x,y) ( (x) < (y) ? -1 : (x) > (y) )
33 unsigned mdb_midl_search( MDB_IDL ids, MDB_ID id )
36 * binary search of id in ids
37 * if found, returns position of id
38 * if not found, returns first position greater than id
46 unsigned pivot = n >> 1;
47 cursor = base + pivot + 1;
48 val = CMP( ids[cursor], id );
53 } else if ( val > 0 ) {
68 #if 0 /* superseded by append/sort */
69 int mdb_midl_insert( MDB_IDL ids, MDB_ID id )
73 x = mdb_midl_search( ids, id );
81 if ( x <= ids[0] && ids[x] == id ) {
87 if ( ++ids[0] >= MDB_IDL_DB_MAX ) {
94 for (i=ids[0]; i>x; i--)
103 MDB_IDL mdb_midl_alloc(int num)
105 MDB_IDL ids = malloc((num+2) * sizeof(MDB_ID));
113 void mdb_midl_free(MDB_IDL ids)
119 int mdb_midl_shrink( MDB_IDL *idp )
122 if (*(--ids) > MDB_IDL_UM_MAX &&
123 (ids = realloc(ids, (MDB_IDL_UM_MAX+1) * sizeof(MDB_ID))))
125 *ids++ = MDB_IDL_UM_MAX;
132 static int mdb_midl_grow( MDB_IDL *idp, int num )
134 MDB_IDL idn = *idp-1;
136 idn = realloc(idn, (*idn + num + 2) * sizeof(MDB_ID));
144 int mdb_midl_need( MDB_IDL *idp, unsigned num )
149 num = (num + num/4 + (256 + 2)) & -256;
150 if (!(ids = realloc(ids-1, num * sizeof(MDB_ID))))
158 int mdb_midl_append( MDB_IDL *idp, MDB_ID id )
162 if (ids[0] >= ids[-1]) {
163 if (mdb_midl_grow(idp, MDB_IDL_UM_MAX))
172 int mdb_midl_append_list( MDB_IDL *idp, MDB_IDL app )
176 if (ids[0] + app[0] >= ids[-1]) {
177 if (mdb_midl_grow(idp, app[0]))
181 memcpy(&ids[ids[0]+1], &app[1], app[0] * sizeof(MDB_ID));
186 int mdb_midl_append_range( MDB_IDL *idp, MDB_ID id, unsigned n )
188 MDB_ID *ids = *idp, len = ids[0];
190 if (len + n > ids[-1]) {
191 if (mdb_midl_grow(idp, n | MDB_IDL_UM_MAX))
202 /* Quicksort + Insertion sort for small arrays */
205 #define MIDL_SWAP(a,b) { itmp=(a); (a)=(b); (b)=itmp; }
208 mdb_midl_sort( MDB_IDL ids )
210 /* Max possible depth of int-indexed tree * 2 items/level */
211 int istack[sizeof(int)*CHAR_BIT * 2];
212 int i,j,k,l,ir,jstack;
219 if (ir - l < SMALL) { /* Insertion sort */
220 for (j=l+1;j<=ir;j++) {
222 for (i=j-1;i>=1;i--) {
223 if (ids[i] >= a) break;
228 if (jstack == 0) break;
229 ir = istack[jstack--];
230 l = istack[jstack--];
232 k = (l + ir) >> 1; /* Choose median of left, center, right */
233 MIDL_SWAP(ids[k], ids[l+1]);
234 if (ids[l] < ids[ir]) {
235 MIDL_SWAP(ids[l], ids[ir]);
237 if (ids[l+1] < ids[ir]) {
238 MIDL_SWAP(ids[l+1], ids[ir]);
240 if (ids[l] < ids[l+1]) {
241 MIDL_SWAP(ids[l], ids[l+1]);
247 do i++; while(ids[i] > a);
248 do j--; while(ids[j] < a);
250 MIDL_SWAP(ids[i],ids[j]);
257 istack[jstack-1] = i;
260 istack[jstack] = j-1;
261 istack[jstack-1] = l;
268 unsigned mdb_mid2l_search( MDB_ID2L ids, MDB_ID id )
271 * binary search of id in ids
272 * if found, returns position of id
273 * if not found, returns first position greater than id
278 unsigned n = (unsigned)ids[0].mid;
281 unsigned pivot = n >> 1;
282 cursor = base + pivot + 1;
283 val = CMP( id, ids[cursor].mid );
288 } else if ( val > 0 ) {
303 int mdb_mid2l_insert( MDB_ID2L ids, MDB_ID2 *id )
307 x = mdb_mid2l_search( ids, id->mid );
314 if ( x <= ids[0].mid && ids[x].mid == id->mid ) {
319 if ( ids[0].mid >= MDB_IDL_UM_MAX ) {
326 for (i=(unsigned)ids[0].mid; i>x; i--)
334 int mdb_mid2l_append( MDB_ID2L ids, MDB_ID2 *id )
337 if (ids[0].mid >= MDB_IDL_UM_MAX) {
341 ids[ids[0].mid] = *id;