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>
26 /** @defgroup internal MDB Internals
29 /** @defgroup idls ID List Management
32 #define CMP(x,y) ( (x) < (y) ? -1 : (x) > (y) )
34 #if 0 /* superseded by append/sort */
35 static unsigned mdb_midl_search( MDB_IDL ids, MDB_ID id )
38 * binary search of id in ids
39 * if found, returns position of id
40 * if not found, returns first position greater than id
48 unsigned pivot = n >> 1;
49 cursor = base + pivot + 1;
50 val = CMP( ids[cursor], id );
55 } else if ( val > 0 ) {
70 int mdb_midl_insert( MDB_IDL ids, MDB_ID id )
74 x = mdb_midl_search( ids, id );
82 if ( x <= ids[0] && ids[x] == id ) {
88 if ( ++ids[0] >= MDB_IDL_DB_MAX ) {
95 for (i=ids[0]; i>x; i--)
104 MDB_IDL mdb_midl_alloc(int num)
106 MDB_IDL ids = malloc((num+2) * sizeof(MDB_ID));
114 void mdb_midl_free(MDB_IDL ids)
120 int mdb_midl_shrink( MDB_IDL *idp )
123 if (*(--ids) > MDB_IDL_UM_MAX &&
124 (ids = realloc(ids, (MDB_IDL_UM_MAX+1) * sizeof(MDB_ID))))
126 *ids++ = MDB_IDL_UM_MAX;
133 static int mdb_midl_grow( MDB_IDL *idp, int num )
135 MDB_IDL idn = *idp-1;
137 idn = realloc(idn, (*idn + num + 2) * sizeof(MDB_ID));
145 int mdb_midl_need( MDB_IDL *idp, unsigned num )
150 num = (num + num/4 + (256 + 2)) & -256;
151 if (!(ids = realloc(ids-1, num * sizeof(MDB_ID))))
159 int mdb_midl_append( MDB_IDL *idp, MDB_ID id )
163 if (ids[0] >= ids[-1]) {
164 if (mdb_midl_grow(idp, MDB_IDL_UM_MAX))
173 int mdb_midl_append_list( MDB_IDL *idp, MDB_IDL app )
177 if (ids[0] + app[0] >= ids[-1]) {
178 if (mdb_midl_grow(idp, app[0]))
182 memcpy(&ids[ids[0]+1], &app[1], app[0] * sizeof(MDB_ID));
187 int mdb_midl_append_range( MDB_IDL *idp, MDB_ID id, unsigned n )
189 MDB_ID *ids = *idp, len = ids[0];
191 if (len + n > ids[-1]) {
192 if (mdb_midl_grow(idp, n | MDB_IDL_UM_MAX))
203 /* Quicksort + Insertion sort for small arrays */
206 #define SWAP(a,b) { itmp=(a); (a)=(b); (b)=itmp; }
209 mdb_midl_sort( MDB_IDL ids )
211 /* Max possible depth of int-indexed tree * 2 items/level */
212 int istack[sizeof(int)*CHAR_BIT * 2];
213 int i,j,k,l,ir,jstack;
220 if (ir - l < SMALL) { /* Insertion sort */
221 for (j=l+1;j<=ir;j++) {
223 for (i=j-1;i>=1;i--) {
224 if (ids[i] >= a) break;
229 if (jstack == 0) break;
230 ir = istack[jstack--];
231 l = istack[jstack--];
233 k = (l + ir) >> 1; /* Choose median of left, center, right */
234 SWAP(ids[k], ids[l+1]);
235 if (ids[l] < ids[ir]) {
236 SWAP(ids[l], ids[ir]);
238 if (ids[l+1] < ids[ir]) {
239 SWAP(ids[l+1], ids[ir]);
241 if (ids[l] < ids[l+1]) {
242 SWAP(ids[l], ids[l+1]);
248 do i++; while(ids[i] > a);
249 do j--; while(ids[j] < a);
258 istack[jstack-1] = i;
261 istack[jstack] = j-1;
262 istack[jstack-1] = l;
269 unsigned mdb_mid2l_search( MDB_ID2L ids, MDB_ID id )
272 * binary search of id in ids
273 * if found, returns position of id
274 * if not found, returns first position greater than id
279 unsigned n = (unsigned)ids[0].mid;
282 unsigned pivot = n >> 1;
283 cursor = base + pivot + 1;
284 val = CMP( id, ids[cursor].mid );
289 } else if ( val > 0 ) {
304 int mdb_mid2l_insert( MDB_ID2L ids, MDB_ID2 *id )
308 x = mdb_mid2l_search( ids, id->mid );
316 if ( x <= ids[0].mid && ids[x].mid == id->mid ) {
321 if ( ids[0].mid >= MDB_IDL_UM_MAX ) {
328 for (i=(unsigned)ids[0].mid; i>x; i--)
336 int mdb_mid2l_append( MDB_ID2L ids, MDB_ID2 *id )
339 if (ids[0].mid >= MDB_IDL_UM_MAX) {
343 ids[ids[0].mid] = *id;