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>.
21 #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 #if 0 /* superseded by append/sort */
34 static unsigned mdb_midl_search( MDB_IDL ids, MDB_ID id )
37 * binary search of id in ids
38 * if found, returns position of id
39 * if not found, returns first position greater than id
47 unsigned pivot = n >> 1;
48 cursor = base + pivot + 1;
49 val = CMP( ids[cursor], id );
54 } else if ( val > 0 ) {
69 int mdb_midl_insert( MDB_IDL ids, MDB_ID id )
73 if (MDB_IDL_IS_RANGE( ids )) {
74 /* if already in range, treat as a dup */
75 if (id >= MDB_IDL_RANGE_FIRST(ids) && id <= MDB_IDL_RANGE_LAST(ids))
77 if (id < MDB_IDL_RANGE_FIRST(ids))
79 else if (id > MDB_IDL_RANGE_LAST(ids))
84 x = mdb_midl_search( ids, id );
92 if ( x <= ids[0] && ids[x] == id ) {
98 if ( ++ids[0] >= MDB_IDL_DB_MAX ) {
101 ids[2] = ids[ids[0]-1];
102 } else if ( ids[ids[0]-1] < id ) {
105 ids[2] = ids[ids[0]-1];
111 for (i=ids[0]; i>x; i--)
120 MDB_IDL mdb_midl_alloc(int num)
122 MDB_IDL ids = malloc((num+2) * sizeof(MDB_ID));
128 void mdb_midl_free(MDB_IDL ids)
134 int mdb_midl_shrink( MDB_IDL *idp )
137 if (*(--ids) > MDB_IDL_UM_MAX) {
138 ids = realloc(ids, (MDB_IDL_UM_MAX+1) * sizeof(MDB_ID));
139 *ids++ = MDB_IDL_UM_MAX;
146 int mdb_midl_grow( MDB_IDL *idp, int num )
148 MDB_IDL idn = *idp-1;
150 idn = realloc(idn, (*idn + num + 2) * 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 /* Quicksort + Insertion sort for small arrays */
189 #define SWAP(a,b) { itmp=(a); (a)=(b); (b)=itmp; }
192 mdb_midl_sort( MDB_IDL ids )
194 /* Max possible depth of int-indexed tree * 2 items/level */
195 int istack[sizeof(int)*CHAR_BIT * 2];
196 int i,j,k,l,ir,jstack;
203 if (ir - l < SMALL) { /* Insertion sort */
204 for (j=l+1;j<=ir;j++) {
206 for (i=j-1;i>=1;i--) {
207 if (ids[i] >= a) break;
212 if (jstack == 0) break;
213 ir = istack[jstack--];
214 l = istack[jstack--];
216 k = (l + ir) >> 1; /* Choose median of left, center, right */
217 SWAP(ids[k], ids[l+1]);
218 if (ids[l] < ids[ir]) {
219 SWAP(ids[l], ids[ir]);
221 if (ids[l+1] < ids[ir]) {
222 SWAP(ids[l+1], ids[ir]);
224 if (ids[l] < ids[l+1]) {
225 SWAP(ids[l], ids[l+1]);
231 do i++; while(ids[i] > a);
232 do j--; while(ids[j] < a);
241 istack[jstack-1] = i;
244 istack[jstack] = j-1;
245 istack[jstack-1] = l;
252 unsigned mdb_mid2l_search( MDB_ID2L ids, MDB_ID id )
255 * binary search of id in ids
256 * if found, returns position of id
257 * if not found, returns first position greater than id
262 unsigned n = (unsigned)ids[0].mid;
265 unsigned pivot = n >> 1;
266 cursor = base + pivot + 1;
267 val = CMP( id, ids[cursor].mid );
272 } else if ( val > 0 ) {
287 int mdb_mid2l_insert( MDB_ID2L ids, MDB_ID2 *id )
291 x = mdb_mid2l_search( ids, id->mid );
299 if ( x <= ids[0].mid && ids[x].mid == id->mid ) {
304 if ( ids[0].mid >= MDB_IDL_UM_MAX ) {
311 for (i=(unsigned)ids[0].mid; i>x; i--)
319 int mdb_mid2l_append( MDB_ID2L ids, MDB_ID2 *id )
322 if (ids[0].mid >= MDB_IDL_UM_MAX) {
326 ids[ids[0].mid] = *id;