idl.c 25.1 KB
Newer Older
Howard Chu's avatar
Howard Chu committed
1
2
3
4
/* idl.c - ldap id list handling routines */
/* $OpenLDAP$ */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
 *
Quanah Gibson-Mount's avatar
Quanah Gibson-Mount committed
5
 * Copyright 2000-2020 The OpenLDAP Foundation.
Howard Chu's avatar
Howard Chu committed
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted only as authorized by the OpenLDAP
 * Public License.
 *
 * A copy of this license is available in the file LICENSE in the
 * top-level directory of the distribution or, alternatively, at
 * <http://www.OpenLDAP.org/license.html>.
 */

#include "portable.h"

#include <stdio.h>
#include <ac/string.h>

#include "back-mdb.h"
#include "idl.h"

25
26
27
#define IDL_MAX(x,y)	( (x) > (y) ? (x) : (y) )
#define IDL_MIN(x,y)	( (x) < (y) ? (x) : (y) )
#define IDL_CMP(x,y)	( (x) < (y) ? -1 : (x) > (y) )
Howard Chu's avatar
Howard Chu committed
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79

#if IDL_DEBUG > 0
static void idl_check( ID *ids )
{
	if( MDB_IDL_IS_RANGE( ids ) ) {
		assert( MDB_IDL_RANGE_FIRST(ids) <= MDB_IDL_RANGE_LAST(ids) );
	} else {
		ID i;
		for( i=1; i < ids[0]; i++ ) {
			assert( ids[i+1] > ids[i] );
		}
	}
}

#if IDL_DEBUG > 1
static void idl_dump( ID *ids )
{
	if( MDB_IDL_IS_RANGE( ids ) ) {
		Debug( LDAP_DEBUG_ANY,
			"IDL: range ( %ld - %ld )\n",
			(long) MDB_IDL_RANGE_FIRST( ids ),
			(long) MDB_IDL_RANGE_LAST( ids ) );

	} else {
		ID i;
		Debug( LDAP_DEBUG_ANY, "IDL: size %ld", (long) ids[0], 0, 0 );

		for( i=1; i<=ids[0]; i++ ) {
			if( i % 16 == 1 ) {
				Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
			}
			Debug( LDAP_DEBUG_ANY, "  %02lx", (long) ids[i], 0, 0 );
		}

		Debug( LDAP_DEBUG_ANY, "\n", 0, 0, 0 );
	}

	idl_check( ids );
}
#endif /* IDL_DEBUG > 1 */
#endif /* IDL_DEBUG > 0 */

unsigned mdb_idl_search( ID *ids, ID id )
{
#define IDL_BINARY_SEARCH 1
#ifdef IDL_BINARY_SEARCH
	/*
	 * binary search of id in ids
	 * if found, returns position of id
	 * if not found, returns first postion greater than id
	 */
	unsigned base = 0;
80
	unsigned cursor = 1;
Howard Chu's avatar
Howard Chu committed
81
82
83
84
85
86
87
88
	int val = 0;
	unsigned n = ids[0];

#if IDL_DEBUG > 0
	idl_check( ids );
#endif

	while( 0 < n ) {
89
90
91
		unsigned pivot = n >> 1;
		cursor = base + pivot + 1;
		val = IDL_CMP( id, ids[cursor] );
Howard Chu's avatar
Howard Chu committed
92
93
94
95
96

		if( val < 0 ) {
			n = pivot;

		} else if ( val > 0 ) {
97
			base = cursor;
Howard Chu's avatar
Howard Chu committed
98
99
100
			n -= pivot + 1;

		} else {
101
			return cursor;
Howard Chu's avatar
Howard Chu committed
102
103
104
105
		}
	}
	
	if( val > 0 ) {
106
		++cursor;
Howard Chu's avatar
Howard Chu committed
107
	}
108
	return cursor;
Howard Chu's avatar
Howard Chu committed
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

#else
	/* (reverse) linear search */
	int i;

#if IDL_DEBUG > 0
	idl_check( ids );
#endif

	for( i=ids[0]; i; i-- ) {
		if( id > ids[i] ) {
			break;
		}
	}

	return i+1;
#endif
}

int mdb_idl_insert( ID *ids, ID id )
{
	unsigned x;

#if IDL_DEBUG > 1
	Debug( LDAP_DEBUG_ANY, "insert: %04lx at %d\n", (long) id, x, 0 );
	idl_dump( ids );
#elif IDL_DEBUG > 0
	idl_check( ids );
#endif

	if (MDB_IDL_IS_RANGE( ids )) {
		/* if already in range, treat as a dup */
141
		if (id >= MDB_IDL_RANGE_FIRST(ids) && id <= MDB_IDL_RANGE_LAST(ids))
Howard Chu's avatar
Howard Chu committed
142
			return -1;
143
		if (id < MDB_IDL_RANGE_FIRST(ids))
Howard Chu's avatar
Howard Chu committed
144
			ids[1] = id;
145
		else if (id > MDB_IDL_RANGE_LAST(ids))
Howard Chu's avatar
Howard Chu committed
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
			ids[2] = id;
		return 0;
	}

	x = mdb_idl_search( ids, id );
	assert( x > 0 );

	if( x < 1 ) {
		/* internal error */
		return -2;
	}

	if ( x <= ids[0] && ids[x] == id ) {
		/* duplicate */
		return -1;
	}

	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] = NOID;
	
	} else {
		/* insert id */
		AC_MEMCPY( &ids[x+1], &ids[x], (ids[0]-x) * sizeof(ID) );
		ids[x] = id;
	}

#if IDL_DEBUG > 1
	idl_dump( ids );
#elif IDL_DEBUG > 0
	idl_check( ids );
#endif

	return 0;
}

static int mdb_idl_delete( ID *ids, ID id )
{
	unsigned x;

#if IDL_DEBUG > 1
	Debug( LDAP_DEBUG_ANY, "delete: %04lx at %d\n", (long) id, x, 0 );
	idl_dump( ids );
#elif IDL_DEBUG > 0
	idl_check( ids );
#endif

	if (MDB_IDL_IS_RANGE( ids )) {
		/* If deleting a range boundary, adjust */
		if ( ids[1] == id )
			ids[1]++;
		else if ( ids[2] == id )
			ids[2]--;
		/* deleting from inside a range is a no-op */

		/* If the range has collapsed, re-adjust */
		if ( ids[1] > ids[2] )
			ids[0] = 0;
		else if ( ids[1] == ids[2] )
			ids[1] = 1;
		return 0;
	}

	x = mdb_idl_search( ids, id );
	assert( x > 0 );

	if( x <= 0 ) {
		/* internal error */
		return -2;
	}

	if( x > ids[0] || ids[x] != id ) {
		/* not found */
		return -1;

	} else if ( --ids[0] == 0 ) {
		if( x != 1 ) {
			return -3;
		}

	} else {
		AC_MEMCPY( &ids[x], &ids[x+1], (1+ids[0]-x) * sizeof(ID) );
	}

#if IDL_DEBUG > 1
	idl_dump( ids );
#elif IDL_DEBUG > 0
	idl_check( ids );
#endif

	return 0;
}

static char *
mdb_show_key(
248
249
250
	char		*buf,
	void		*val,
	size_t		len )
Howard Chu's avatar
Howard Chu committed
251
{
252
253
	if ( len == 4 /* LUTIL_HASH_BYTES */ ) {
		unsigned char *c = val;
Howard Chu's avatar
Howard Chu committed
254
255
256
		sprintf( buf, "[%02x%02x%02x%02x]", c[0], c[1], c[2], c[3] );
		return buf;
	} else {
257
		return val;
Howard Chu's avatar
Howard Chu committed
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
	}
}

int
mdb_idl_fetch_key(
	BackendDB	*be,
	MDB_txn		*txn,
	MDB_dbi		dbi,
	MDB_val		*key,
	ID			*ids,
	MDB_cursor	**saved_cursor,
	int			get_flag )
{
	MDB_val data, key2, *kptr;
	MDB_cursor *cursor;
	ID *i;
	size_t len;
	int rc;
	MDB_cursor_op opflag;

	char keybuf[16];

	Debug( LDAP_DEBUG_ARGS,
		"mdb_idl_fetch_key: %s\n", 
282
		mdb_show_key( keybuf, key->mv_data, key->mv_size ), 0, 0 );
Howard Chu's avatar
Howard Chu committed
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392

	assert( ids != NULL );

	if ( saved_cursor && *saved_cursor ) {
		opflag = MDB_NEXT;
	} else if ( get_flag == LDAP_FILTER_GE ) {
		opflag = MDB_SET_RANGE;
	} else if ( get_flag == LDAP_FILTER_LE ) {
		opflag = MDB_FIRST;
	} else {
		opflag = MDB_SET;
	}

	/* If we're not reusing an existing cursor, get a new one */
	if( opflag != MDB_NEXT ) {
		rc = mdb_cursor_open( txn, dbi, &cursor );
		if( rc != 0 ) {
			Debug( LDAP_DEBUG_ANY, "=> mdb_idl_fetch_key: "
				"cursor failed: %s (%d)\n", mdb_strerror(rc), rc, 0 );
			return rc;
		}
	} else {
		cursor = *saved_cursor;
	}
	
	/* If this is a LE lookup, save original key so we can determine
	 * when to stop. If this is a GE lookup, save the key since it
	 * will be overwritten.
	 */
	if ( get_flag == LDAP_FILTER_LE || get_flag == LDAP_FILTER_GE ) {
		key2.mv_data = keybuf;
		key2.mv_size = key->mv_size;
		AC_MEMCPY( keybuf, key->mv_data, key->mv_size );
		kptr = &key2;
	} else {
		kptr = key;
	}
	len = key->mv_size;
	rc = mdb_cursor_get( cursor, kptr, &data, opflag );

	/* skip presence key on range inequality lookups */
	while (rc == 0 && kptr->mv_size != len) {
		rc = mdb_cursor_get( cursor, kptr, &data, MDB_NEXT_NODUP );
	}
	/* If we're doing a LE compare and the new key is greater than
	 * our search key, we're done
	 */
	if (rc == 0 && get_flag == LDAP_FILTER_LE && memcmp( kptr->mv_data,
		key->mv_data, key->mv_size ) > 0 ) {
		rc = MDB_NOTFOUND;
	}
	if (rc == 0) {
		i = ids+1;
		rc = mdb_cursor_get( cursor, key, &data, MDB_GET_MULTIPLE );
		while (rc == 0) {
			memcpy( i, data.mv_data, data.mv_size );
			i += data.mv_size / sizeof(ID);
			rc = mdb_cursor_get( cursor, key, &data, MDB_NEXT_MULTIPLE );
		}
		if ( rc == MDB_NOTFOUND ) rc = 0;
		ids[0] = i - &ids[1];
		/* On disk, a range is denoted by 0 in the first element */
		if (ids[1] == 0) {
			if (ids[0] != MDB_IDL_RANGE_SIZE) {
				Debug( LDAP_DEBUG_ANY, "=> mdb_idl_fetch_key: "
					"range size mismatch: expected %d, got %ld\n",
					MDB_IDL_RANGE_SIZE, ids[0], 0 );
				mdb_cursor_close( cursor );
				return -1;
			}
			MDB_IDL_RANGE( ids, ids[2], ids[3] );
		}
		data.mv_size = MDB_IDL_SIZEOF(ids);
	}

	if ( saved_cursor && rc == 0 ) {
		if ( !*saved_cursor )
			*saved_cursor = cursor;
	}
	else
		mdb_cursor_close( cursor );

	if( rc == MDB_NOTFOUND ) {
		return rc;

	} else if( rc != 0 ) {
		Debug( LDAP_DEBUG_ANY, "=> mdb_idl_fetch_key: "
			"get failed: %s (%d)\n",
			mdb_strerror(rc), rc, 0 );
		return rc;

	} else if ( data.mv_size == 0 || data.mv_size % sizeof( ID ) ) {
		/* size not multiple of ID size */
		Debug( LDAP_DEBUG_ANY, "=> mdb_idl_fetch_key: "
			"odd size: expected %ld multiple, got %ld\n",
			(long) sizeof( ID ), (long) data.mv_size, 0 );
		return -1;

	} else if ( data.mv_size != MDB_IDL_SIZEOF(ids) ) {
		/* size mismatch */
		Debug( LDAP_DEBUG_ANY, "=> mdb_idl_fetch_key: "
			"get size mismatch: expected %ld, got %ld\n",
			(long) ((1 + ids[0]) * sizeof( ID )), (long) data.mv_size, 0 );
		return -1;
	}

	return rc;
}

int
Howard Chu's avatar
Howard Chu committed
393
mdb_idl_insert_keys(
Howard Chu's avatar
Howard Chu committed
394
	BackendDB	*be,
Howard Chu's avatar
Howard Chu committed
395
	MDB_cursor	*cursor,
396
	struct berval *keys,
Howard Chu's avatar
Howard Chu committed
397
398
	ID			id )
{
Howard Chu's avatar
Howard Chu committed
399
	struct mdb_info *mdb = be->be_private;
400
	MDB_val key, data;
Howard Chu's avatar
Howard Chu committed
401
402
	ID lo, hi, *i;
	char *err;
403
	int	rc = 0, k;
Howard Chu's avatar
Howard Chu committed
404
	unsigned int flag = MDB_NODUPDATA;
Howard Chu's avatar
Howard Chu committed
405
406
407
#ifndef	MISALIGNED_OK
	int kbuf[2];
#endif
Howard Chu's avatar
Howard Chu committed
408
409
410
411

	{
		char buf[16];
		Debug( LDAP_DEBUG_ARGS,
Howard Chu's avatar
Howard Chu committed
412
			"mdb_idl_insert_keys: %lx %s\n", 
413
			(long) id, mdb_show_key( buf, keys->bv_val, keys->bv_len ), 0 );
Howard Chu's avatar
Howard Chu committed
414
415
416
417
	}

	assert( id != NOID );

Howard Chu's avatar
Howard Chu committed
418
#ifndef MISALIGNED_OK
419
	if (keys[0].bv_len & ALIGNER)
Howard Chu's avatar
Howard Chu committed
420
421
		kbuf[1] = 0;
#endif
422
	for ( k=0; keys[k].bv_val; k++ ) {
Howard Chu's avatar
Howard Chu committed
423
424
425
	/* Fetch the first data item for this key, to see if it
	 * exists and if it's a range.
	 */
Howard Chu's avatar
Howard Chu committed
426
#ifndef MISALIGNED_OK
427
	if (keys[k].bv_len & ALIGNER) {
Howard Chu's avatar
Howard Chu committed
428
429
430
431
432
433
434
435
436
		key.mv_size = sizeof(kbuf);
		key.mv_data = kbuf;
		memcpy(key.mv_data, keys[k].bv_val, keys[k].bv_len);
	} else
#endif
	{
		key.mv_size = keys[k].bv_len;
		key.mv_data = keys[k].bv_val;
	}
437
	rc = mdb_cursor_get( cursor, &key, &data, MDB_SET );
Howard Chu's avatar
Howard Chu committed
438
439
440
441
442
443
	err = "c_get";
	if ( rc == 0 ) {
		i = data.mv_data;
		memcpy(&lo, data.mv_data, sizeof(ID));
		if ( lo != 0 ) {
			/* not a range, count the number of items */
444
			size_t count;
Howard Chu's avatar
Howard Chu committed
445
446
447
448
449
450
451
452
			rc = mdb_cursor_count( cursor, &count );
			if ( rc != 0 ) {
				err = "c_count";
				goto fail;
			}
			if ( count >= MDB_IDL_DB_MAX ) {
			/* No room, convert to a range */
				lo = *i;
453
				rc = mdb_cursor_get( cursor, &key, &data, MDB_LAST_DUP );
Howard Chu's avatar
Howard Chu committed
454
				if ( rc != 0 && rc != MDB_NOTFOUND ) {
Howard Chu's avatar
Howard Chu committed
455
					err = "c_get last_dup";
Howard Chu's avatar
Howard Chu committed
456
457
458
459
460
461
462
463
464
465
466
					goto fail;
				}
				i = data.mv_data;
				hi = *i;
				/* Update hi/lo if needed */
				if ( id < lo ) {
					lo = id;
				} else if ( id > hi ) {
					hi = id;
				}
				/* delete the old key */
Howard Chu's avatar
Howard Chu committed
467
				rc = mdb_cursor_del( cursor, MDB_NODUPDATA );
Howard Chu's avatar
Howard Chu committed
468
				if ( rc != 0 ) {
Howard Chu's avatar
Howard Chu committed
469
					err = "c_del dups";
Howard Chu's avatar
Howard Chu committed
470
471
472
473
474
475
					goto fail;
				}
				/* Store the range */
				data.mv_size = sizeof(ID);
				data.mv_data = &id;
				id = 0;
476
				rc = mdb_cursor_put( cursor, &key, &data, 0 );
Howard Chu's avatar
Howard Chu committed
477
				if ( rc != 0 ) {
Howard Chu's avatar
Howard Chu committed
478
					err = "c_put range";
Howard Chu's avatar
Howard Chu committed
479
480
481
					goto fail;
				}
				id = lo;
482
				rc = mdb_cursor_put( cursor, &key, &data, 0 );
Howard Chu's avatar
Howard Chu committed
483
				if ( rc != 0 ) {
Howard Chu's avatar
Howard Chu committed
484
					err = "c_put lo";
Howard Chu's avatar
Howard Chu committed
485
486
487
					goto fail;
				}
				id = hi;
488
				rc = mdb_cursor_put( cursor, &key, &data, 0 );
Howard Chu's avatar
Howard Chu committed
489
				if ( rc != 0 ) {
Howard Chu's avatar
Howard Chu committed
490
					err = "c_put hi";
Howard Chu's avatar
Howard Chu committed
491
492
493
494
					goto fail;
				}
			} else {
			/* There's room, just store it */
Howard Chu's avatar
Howard Chu committed
495
496
				if (id == mdb->mi_nextid)
					flag |= MDB_APPENDDUP;
Howard Chu's avatar
Howard Chu committed
497
498
499
500
501
502
503
504
505
				goto put1;
			}
		} else {
			/* It's a range, see if we need to rewrite
			 * the boundaries
			 */
			lo = i[1];
			hi = i[2];
			if ( id < lo || id > hi ) {
Howard Chu's avatar
Howard Chu committed
506
				/* position on lo */
507
				rc = mdb_cursor_get( cursor, &key, &data, MDB_NEXT_DUP );
508
509
510
511
				if ( rc != 0 ) {
					err = "c_get lo";
					goto fail;
				}
Howard Chu's avatar
Howard Chu committed
512
513
				if ( id > hi ) {
					/* position on hi */
514
					rc = mdb_cursor_get( cursor, &key, &data, MDB_NEXT_DUP );
515
516
517
518
					if ( rc != 0 ) {
						err = "c_get hi";
						goto fail;
					}
Howard Chu's avatar
Howard Chu committed
519
				}
Howard Chu's avatar
Howard Chu committed
520
				data.mv_size = sizeof(ID);
Howard Chu's avatar
Howard Chu committed
521
522
				data.mv_data = &id;
				/* Replace the current lo/hi */
523
				rc = mdb_cursor_put( cursor, &key, &data, MDB_CURRENT );
Howard Chu's avatar
Howard Chu committed
524
				if ( rc != 0 ) {
Howard Chu's avatar
Howard Chu committed
525
					err = "c_put lo/hi";
Howard Chu's avatar
Howard Chu committed
526
527
528
529
530
					goto fail;
				}
			}
		}
	} else if ( rc == MDB_NOTFOUND ) {
Howard Chu's avatar
Howard Chu committed
531
		flag &= ~MDB_APPENDDUP;
Howard Chu's avatar
Howard Chu committed
532
533
put1:	data.mv_data = &id;
		data.mv_size = sizeof(ID);
Howard Chu's avatar
Howard Chu committed
534
		rc = mdb_cursor_put( cursor, &key, &data, flag );
Howard Chu's avatar
Howard Chu committed
535
		/* Don't worry if it's already there */
Howard Chu's avatar
Howard Chu committed
536
537
538
		if ( rc == MDB_KEYEXIST )
			rc = 0;
		if ( rc ) {
Howard Chu's avatar
Howard Chu committed
539
			err = "c_put id";
Howard Chu's avatar
Howard Chu committed
540
541
542
543
544
			goto fail;
		}
	} else {
		/* initial c_get failed, nothing was done */
fail:
Howard Chu's avatar
Howard Chu committed
545
		Debug( LDAP_DEBUG_ANY, "=> mdb_idl_insert_keys: "
Howard Chu's avatar
Howard Chu committed
546
			"%s failed: %s (%d)\n", err, mdb_strerror(rc), rc );
Howard Chu's avatar
Howard Chu committed
547
		break;
Howard Chu's avatar
Howard Chu committed
548
	}
Howard Chu's avatar
Howard Chu committed
549
	}
Howard Chu's avatar
Howard Chu committed
550
551
552
553
	return rc;
}

int
Howard Chu's avatar
Howard Chu committed
554
mdb_idl_delete_keys(
Howard Chu's avatar
Howard Chu committed
555
	BackendDB	*be,
Howard Chu's avatar
Howard Chu committed
556
	MDB_cursor	*cursor,
557
	struct berval *keys,
Howard Chu's avatar
Howard Chu committed
558
559
	ID			id )
{
560
	int	rc = 0, k;
561
	MDB_val key, data;
Howard Chu's avatar
Howard Chu committed
562
563
	ID lo, hi, tmp, *i;
	char *err;
Howard Chu's avatar
Howard Chu committed
564
565
566
#ifndef	MISALIGNED_OK
	int kbuf[2];
#endif
Howard Chu's avatar
Howard Chu committed
567
568
569
570

	{
		char buf[16];
		Debug( LDAP_DEBUG_ARGS,
Howard Chu's avatar
Howard Chu committed
571
			"mdb_idl_delete_keys: %lx %s\n", 
572
			(long) id, mdb_show_key( buf, keys->bv_val, keys->bv_len ), 0 );
Howard Chu's avatar
Howard Chu committed
573
574
575
	}
	assert( id != NOID );

Howard Chu's avatar
Howard Chu committed
576
#ifndef MISALIGNED_OK
577
	if (keys[0].bv_len & ALIGNER)
Howard Chu's avatar
Howard Chu committed
578
579
		kbuf[1] = 0;
#endif
580
	for ( k=0; keys[k].bv_val; k++) {
Howard Chu's avatar
Howard Chu committed
581
582
583
	/* Fetch the first data item for this key, to see if it
	 * exists and if it's a range.
	 */
Howard Chu's avatar
Howard Chu committed
584
#ifndef MISALIGNED_OK
585
	if (keys[k].bv_len & ALIGNER) {
Howard Chu's avatar
Howard Chu committed
586
587
588
589
590
591
592
593
594
		key.mv_size = sizeof(kbuf);
		key.mv_data = kbuf;
		memcpy(key.mv_data, keys[k].bv_val, keys[k].bv_len);
	} else
#endif
	{
		key.mv_size = keys[k].bv_len;
		key.mv_data = keys[k].bv_val;
	}
595
	rc = mdb_cursor_get( cursor, &key, &data, MDB_SET );
Howard Chu's avatar
Howard Chu committed
596
597
598
599
600
601
602
	err = "c_get";
	if ( rc == 0 ) {
		memcpy( &tmp, data.mv_data, sizeof(ID) );
		i = data.mv_data;
		if ( tmp != 0 ) {
			/* Not a range, just delete it */
			data.mv_data = &id;
603
			rc = mdb_cursor_get( cursor, &key, &data, MDB_GET_BOTH );
Howard Chu's avatar
Howard Chu committed
604
605
606
607
608
			if ( rc != 0 ) {
				err = "c_get id";
				goto fail;
			}
			rc = mdb_cursor_del( cursor, 0 );
Howard Chu's avatar
Howard Chu committed
609
			if ( rc != 0 ) {
Howard Chu's avatar
Howard Chu committed
610
				err = "c_del id";
Howard Chu's avatar
Howard Chu committed
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
				goto fail;
			}
		} else {
			/* It's a range, see if we need to rewrite
			 * the boundaries
			 */
			lo = i[1];
			hi = i[2];
			if ( id == lo || id == hi ) {
				ID lo2 = lo, hi2 = hi;
				if ( id == lo ) {
					lo2++;
				} else if ( id == hi ) {
					hi2--;
				}
				if ( lo2 >= hi2 ) {
				/* The range has collapsed... */
628
629
					/* delete the range marker */
					rc = mdb_cursor_del( cursor, 0 );
Howard Chu's avatar
Howard Chu committed
630
					if ( rc != 0 ) {
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
						err = "c_del dup1";
						goto fail;
					}
					/* skip past deleted marker */
					rc = mdb_cursor_get( cursor, &key, &data, MDB_NEXT_DUP );
					if ( rc != 0 ) {
						err = "c_get dup1";
						goto fail;
					}
					/* delete the requested id */
					if ( id == hi ) {
						/* skip lo */
						rc = mdb_cursor_get( cursor, &key, &data, MDB_NEXT_DUP );
						if ( rc != 0 ) {
							err = "c_get dup2";
							goto fail;
						}
					}
					rc = mdb_cursor_del( cursor, 0 );
					if ( rc != 0 ) {
						err = "c_del dup2";
Howard Chu's avatar
Howard Chu committed
652
653
654
						goto fail;
					}
				} else {
Howard Chu's avatar
Howard Chu committed
655
					/* position on lo */
656
					rc = mdb_cursor_get( cursor, &key, &data, MDB_NEXT_DUP );
Howard Chu's avatar
Howard Chu committed
657
658
					if ( id == lo )
						data.mv_data = &lo2;
Howard Chu's avatar
Howard Chu committed
659
660
					else {
						/* position on hi */
661
						rc = mdb_cursor_get( cursor, &key, &data, MDB_NEXT_DUP );
Howard Chu's avatar
Howard Chu committed
662
						data.mv_data = &hi2;
Howard Chu's avatar
Howard Chu committed
663
664
665
					}
					/* Replace the current lo/hi */
					data.mv_size = sizeof(ID);
666
					rc = mdb_cursor_put( cursor, &key, &data, MDB_CURRENT );
Howard Chu's avatar
Howard Chu committed
667
					if ( rc != 0 ) {
Howard Chu's avatar
Howard Chu committed
668
						err = "c_put lo/hi";
Howard Chu's avatar
Howard Chu committed
669
670
671
672
673
674
675
676
						goto fail;
					}
				}
			}
		}
	} else {
		/* initial c_get failed, nothing was done */
fail:
Howard Chu's avatar
Howard Chu committed
677
678
679
		if ( rc == MDB_NOTFOUND )
			rc = 0;
		if ( rc ) {
Howard Chu's avatar
Howard Chu committed
680
681
			Debug( LDAP_DEBUG_ANY, "=> mdb_idl_delete_key: "
				"%s failed: %s (%d)\n", err, mdb_strerror(rc), rc );
Howard Chu's avatar
Howard Chu committed
682
			break;
Howard Chu's avatar
Howard Chu committed
683
684
		}
	}
Howard Chu's avatar
Howard Chu committed
685
	}
Howard Chu's avatar
Howard Chu committed
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
	return rc;
}


/*
 * idl_intersection - return a = a intersection b
 */
int
mdb_idl_intersection(
	ID *a,
	ID *b )
{
	ID ida, idb;
	ID idmax, idmin;
	ID cursora = 0, cursorb = 0, cursorc;
	int swap = 0;

	if ( MDB_IDL_IS_ZERO( a ) || MDB_IDL_IS_ZERO( b ) ) {
		a[0] = 0;
		return 0;
	}

	idmin = IDL_MAX( MDB_IDL_FIRST(a), MDB_IDL_FIRST(b) );
	idmax = IDL_MIN( MDB_IDL_LAST(a), MDB_IDL_LAST(b) );
	if ( idmin > idmax ) {
		a[0] = 0;
		return 0;
	} else if ( idmin == idmax ) {
		a[0] = 1;
		a[1] = idmin;
		return 0;
	}

	if ( MDB_IDL_IS_RANGE( a ) ) {
		if ( MDB_IDL_IS_RANGE(b) ) {
		/* If both are ranges, just shrink the boundaries */
			a[1] = idmin;
			a[2] = idmax;
			return 0;
		} else {
		/* Else swap so that b is the range, a is a list */
			ID *tmp = a;
			a = b;
			b = tmp;
			swap = 1;
		}
	}

	/* If a range completely covers the list, the result is
735
	 * just the list.
Howard Chu's avatar
Howard Chu committed
736
737
	 */
	if ( MDB_IDL_IS_RANGE( b )
Howard Chu's avatar
Howard Chu committed
738
739
		&& MDB_IDL_RANGE_FIRST( b ) <= MDB_IDL_FIRST( a )
		&& MDB_IDL_RANGE_LAST( b ) >= MDB_IDL_LLAST( a ) ) {
Howard Chu's avatar
Howard Chu committed
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
		goto done;
	}

	/* Fine, do the intersection one element at a time.
	 * First advance to idmin in both IDLs.
	 */
	cursora = cursorb = idmin;
	ida = mdb_idl_first( a, &cursora );
	idb = mdb_idl_first( b, &cursorb );
	cursorc = 0;

	while( ida <= idmax || idb <= idmax ) {
		if( ida == idb ) {
			a[++cursorc] = ida;
			ida = mdb_idl_next( a, &cursora );
			idb = mdb_idl_next( b, &cursorb );
		} else if ( ida < idb ) {
			ida = mdb_idl_next( a, &cursora );
		} else {
			idb = mdb_idl_next( b, &cursorb );
		}
	}
	a[0] = cursorc;
done:
	if (swap)
		MDB_IDL_CPY( b, a );

	return 0;
}


/*
 * idl_union - return a = a union b
 */
int
mdb_idl_union(
	ID	*a,
	ID	*b )
{
	ID ida, idb;
	ID cursora = 0, cursorb = 0, cursorc;

	if ( MDB_IDL_IS_ZERO( b ) ) {
		return 0;
	}

	if ( MDB_IDL_IS_ZERO( a ) ) {
		MDB_IDL_CPY( a, b );
		return 0;
	}

	if ( MDB_IDL_IS_RANGE( a ) || MDB_IDL_IS_RANGE(b) ) {
over:		ida = IDL_MIN( MDB_IDL_FIRST(a), MDB_IDL_FIRST(b) );
		idb = IDL_MAX( MDB_IDL_LAST(a), MDB_IDL_LAST(b) );
		a[0] = NOID;
		a[1] = ida;
		a[2] = idb;
		return 0;
	}

	ida = mdb_idl_first( a, &cursora );
	idb = mdb_idl_first( b, &cursorb );

	cursorc = b[0];

	/* The distinct elements of a are cat'd to b */
	while( ida != NOID || idb != NOID ) {
		if ( ida < idb ) {
			if( ++cursorc > MDB_IDL_UM_MAX ) {
				goto over;
			}
			b[cursorc] = ida;
			ida = mdb_idl_next( a, &cursora );

		} else {
			if ( ida == idb )
				ida = mdb_idl_next( a, &cursora );
			idb = mdb_idl_next( b, &cursorb );
		}
	}

	/* b is copied back to a in sorted order */
	a[0] = cursorc;
	cursora = 1;
	cursorb = 1;
	cursorc = b[0]+1;
	while (cursorb <= b[0] || cursorc <= a[0]) {
		if (cursorc > a[0])
			idb = NOID;
		else
			idb = b[cursorc];
		if (cursorb <= b[0] && b[cursorb] < idb)
			a[cursora++] = b[cursorb++];
		else {
			a[cursora++] = idb;
			cursorc++;
		}
	}

	return 0;
}


#if 0
/*
 * mdb_idl_notin - return a intersection ~b (or a minus b)
 */
int
mdb_idl_notin(
	ID	*a,
	ID	*b,
	ID *ids )
{
	ID ida, idb;
	ID cursora = 0, cursorb = 0;

	if( MDB_IDL_IS_ZERO( a ) ||
		MDB_IDL_IS_ZERO( b ) ||
		MDB_IDL_IS_RANGE( b ) )
	{
		MDB_IDL_CPY( ids, a );
		return 0;
	}

	if( MDB_IDL_IS_RANGE( a ) ) {
		MDB_IDL_CPY( ids, a );
		return 0;
	}

	ida = mdb_idl_first( a, &cursora ),
	idb = mdb_idl_first( b, &cursorb );

	ids[0] = 0;

	while( ida != NOID ) {
		if ( idb == NOID ) {
			/* we could shortcut this */
			ids[++ids[0]] = ida;
			ida = mdb_idl_next( a, &cursora );

		} else if ( ida < idb ) {
			ids[++ids[0]] = ida;
			ida = mdb_idl_next( a, &cursora );

		} else if ( ida > idb ) {
			idb = mdb_idl_next( b, &cursorb );

		} else {
			ida = mdb_idl_next( a, &cursora );
			idb = mdb_idl_next( b, &cursorb );
		}
	}

	return 0;
}
#endif

ID mdb_idl_first( ID *ids, ID *cursor )
{
	ID pos;

	if ( ids[0] == 0 ) {
		*cursor = NOID;
		return NOID;
	}

	if ( MDB_IDL_IS_RANGE( ids ) ) {
		if( *cursor < ids[1] ) {
			*cursor = ids[1];
		}
		return *cursor;
	}

	if ( *cursor == 0 )
		pos = 1;
	else
		pos = mdb_idl_search( ids, *cursor );

	if( pos > ids[0] ) {
		return NOID;
	}

	*cursor = pos;
	return ids[pos];
}

ID mdb_idl_next( ID *ids, ID *cursor )
{
	if ( MDB_IDL_IS_RANGE( ids ) ) {
		if( ids[2] < ++(*cursor) ) {
			return NOID;
		}
		return *cursor;
	}

	if ( ++(*cursor) <= ids[0] ) {
		return ids[*cursor];
	}

	return NOID;
}

/* Add one ID to an unsorted list. We ensure that the first element is the
 * minimum and the last element is the maximum, for fast range compaction.
 *   this means IDLs up to length 3 are always sorted...
 */
int mdb_idl_append_one( ID *ids, ID id )
{
	if (MDB_IDL_IS_RANGE( ids )) {
		/* if already in range, treat as a dup */
950
		if (id >= MDB_IDL_RANGE_FIRST(ids) && id <= MDB_IDL_RANGE_LAST(ids))
Howard Chu's avatar
Howard Chu committed
951
			return -1;
952
		if (id < MDB_IDL_RANGE_FIRST(ids))
Howard Chu's avatar
Howard Chu committed
953
			ids[1] = id;
954
		else if (id > MDB_IDL_RANGE_LAST(ids))
Howard Chu's avatar
Howard Chu committed
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
			ids[2] = id;
		return 0;
	}
	if ( ids[0] ) {
		ID tmp;

		if (id < ids[1]) {
			tmp = ids[1];
			ids[1] = id;
			id = tmp;
		}
		if ( ids[0] > 1 && id < ids[ids[0]] ) {
			tmp = ids[ids[0]];
			ids[ids[0]] = id;
			id = tmp;
		}
	}
	ids[0]++;
	if ( ids[0] >= MDB_IDL_UM_MAX ) {
		ids[0] = NOID;
		ids[2] = id;
	} else {
		ids[ids[0]] = id;
	}
	return 0;
}

/* Append sorted list b to sorted list a. The result is unsorted but
 * a[1] is the min of the result and a[a[0]] is the max.
 */
int mdb_idl_append( ID *a, ID *b )
{
	ID ida, idb, tmp, swap = 0;

	if ( MDB_IDL_IS_ZERO( b ) ) {
		return 0;
	}

	if ( MDB_IDL_IS_ZERO( a ) ) {
		MDB_IDL_CPY( a, b );
		return 0;
	}

	ida = MDB_IDL_LAST( a );
	idb = MDB_IDL_LAST( b );
	if ( MDB_IDL_IS_RANGE( a ) || MDB_IDL_IS_RANGE(b) ||
		a[0] + b[0] >= MDB_IDL_UM_MAX ) {
		a[2] = IDL_MAX( ida, idb );
		a[1] = IDL_MIN( a[1], b[1] );
		a[0] = NOID;
		return 0;
	}

	if ( b[0] > 1 && ida > idb ) {
		swap = idb;
		a[a[0]] = idb;
		b[b[0]] = ida;
	}

	if ( b[1] < a[1] ) {
		tmp = a[1];
		a[1] = b[1];
	} else {
		tmp = b[1];
	}
	a[0]++;
	a[a[0]] = tmp;

	if ( b[0] > 1 ) {
		int i = b[0] - 1;
		AC_MEMCPY(a+a[0]+1, b+2, i * sizeof(ID));
		a[0] += i;
	}
	if ( swap ) {
		b[b[0]] = swap;
	}
	return 0;
}

#if 1

/* Quicksort + Insertion sort for small arrays */

#define SMALL	8
#define	SWAP(a,b)	itmp=(a);(a)=(b);(b)=itmp

void
mdb_idl_sort( ID *ids, ID *tmp )
{
1044
	int *istack = (int *)tmp; /* Private stack, not used by caller */
Howard Chu's avatar
Howard Chu committed
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
	int i,j,k,l,ir,jstack;
	ID a, itmp;

	if ( MDB_IDL_IS_RANGE( ids ))
		return;

	ir = ids[0];
	l = 1;
	jstack = 0;
	for(;;) {
		if (ir - l < SMALL) {	/* Insertion sort */
			for (j=l+1;j<=ir;j++) {
				a = ids[j];
				for (i=j-1;i>=1;i--) {
					if (ids[i] <= a) break;
					ids[i+1] = ids[i];
				}
				ids[i+1] = a;
			}
			if (jstack == 0) break;
			ir = istack[jstack--];
			l = istack[jstack--];
		} else {
			k = (l + ir) >> 1;	/* Choose median of left, center, right */
			SWAP(ids[k], ids[l+1]);
			if (ids[l] > ids[ir]) {
				SWAP(ids[l], ids[ir]);
			}
			if (ids[l+1] > ids[ir]) {
				SWAP(ids[l+1], ids[ir]);
			}
			if (ids[l] > ids[l+1]) {
				SWAP(ids[l], ids[l+1]);
			}
			i = l+1;
			j = ir;
			a = ids[l+1];
			for(;;) {
				do i++; while(ids[i] < a);
				do j--; while(ids[j] > a);
				if (j < i) break;
				SWAP(ids[i],ids[j]);
			}
			ids[l+1] = ids[j];
			ids[j] = a;
			jstack += 2;
Howard Chu's avatar
Howard Chu committed
1091
			if (ir-i+1 >= j-l) {
Howard Chu's avatar
Howard Chu committed
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
				istack[jstack] = ir;
				istack[jstack-1] = i;
				ir = j-1;
			} else {
				istack[jstack] = j-1;
				istack[jstack-1] = l;
				l = i;
			}
		}
	}
}

#else

/* 8 bit Radix sort + insertion sort
 * 
 * based on code from http://www.cubic.org/docs/radix.htm
Emily Backes's avatar
Emily Backes committed
1109
 * with improvements by ebackes@symas.com and hyc@symas.com
Howard Chu's avatar
Howard Chu committed
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
 *
 * This code is O(n) but has a relatively high constant factor. For lists
 * up to ~50 Quicksort is slightly faster; up to ~100 they are even.
 * Much faster than quicksort for lists longer than ~100. Insertion
 * sort is actually superior for lists <50.
 */

#define BUCKETS	(1<<8)
#define SMALL	50

void
mdb_idl_sort( ID *ids, ID *tmp )
{
	int count, soft_limit, phase = 0, size = ids[0];
	ID *idls[2];
	unsigned char *maxv = (unsigned char *)&ids[size];

 	if ( MDB_IDL_IS_RANGE( ids ))
 		return;

	/* Use insertion sort for small lists */
	if ( size <= SMALL ) {
		int i,j;
		ID a;

		for (j=1;j<=size;j++) {
			a = ids[j];
			for (i=j-1;i>=1;i--) {
				if (ids[i] <= a) break;
				ids[i+1] = ids[i];
			}
			ids[i+1] = a;
		}
		return;
	}

	tmp[0] = size;
	idls[0] = ids;
	idls[1] = tmp;

#if BYTE_ORDER == BIG_ENDIAN
    for (soft_limit = 0; !maxv[soft_limit]; soft_limit++);
#else
    for (soft_limit = sizeof(ID)-1; !maxv[soft_limit]; soft_limit--);
#endif

	for (
#if BYTE_ORDER == BIG_ENDIAN
	count = sizeof(ID)-1; count >= soft_limit; --count
#else
	count = 0; count <= soft_limit; ++count
#endif
	) {
		unsigned int num[BUCKETS], * np, n, sum;
		int i;
        ID *sp, *source, *dest;
        unsigned char *bp, *source_start;

		source = idls[phase]+1;
		dest = idls[phase^1]+1;
		source_start =  ((unsigned char *) source) + count;

        np = num;
        for ( i = BUCKETS; i > 0; --i ) *np++ = 0;

		/* count occurences of every byte value */
		bp = source_start;
        for ( i = size; i > 0; --i, bp += sizeof(ID) )
				num[*bp]++;

		/* transform count into index by summing elements and storing
		 * into same array
		 */
        sum = 0;
        np = num;
        for ( i = BUCKETS; i > 0; --i ) {
                n = *np;
                *np++ = sum;
                sum += n;
        }

		/* fill dest with the right values in the right place */
		bp = source_start;
        sp = source;
        for ( i = size; i > 0; --i, bp += sizeof(ID) ) {
                np = num + *bp;
                dest[*np] = *sp++;
                ++(*np);
        }
		phase ^= 1;
	}

	/* copy back from temp if needed */
	if ( phase ) {
		ids++; tmp++;
		for ( count = 0; count < size; ++count ) 
			*ids++ = *tmp++;
	}
}
#endif	/* Quick vs Radix */
Howard Chu's avatar
Howard Chu committed
1210
1211
1212
1213
1214
1215
1216
1217
1218

unsigned mdb_id2l_search( ID2L ids, ID id )
{
	/*
	 * binary search of id in ids
	 * if found, returns position of id
	 * if not found, returns first position greater than id
	 */
	unsigned base = 0;
1219
	unsigned cursor = 1;
Howard Chu's avatar
Howard Chu committed
1220
1221
1222
1223
	int val = 0;
	unsigned n = ids[0].mid;

	while( 0 < n ) {
1224
1225
1226
		unsigned pivot = n >> 1;
		cursor = base + pivot + 1;
		val = IDL_CMP( id, ids[cursor].mid );
Howard Chu's avatar
Howard Chu committed
1227
1228
1229
1230
1231

		if( val < 0 ) {
			n = pivot;

		} else if ( val > 0 ) {
1232
			base = cursor;
Howard Chu's avatar
Howard Chu committed
1233
1234
1235
			n -= pivot + 1;

		} else {
1236
			return cursor;
Howard Chu's avatar
Howard Chu committed
1237
1238
1239
1240
		}
	}

	if( val > 0 ) {
1241
		++cursor;
Howard Chu's avatar
Howard Chu committed
1242
	}
1243
	return cursor;
Howard Chu's avatar
Howard Chu committed
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
}

int mdb_id2l_insert( ID2L ids, ID2 *id )
{
	unsigned x, i;

	x = mdb_id2l_search( ids, id->mid );
	assert( x > 0 );

	if( x < 1 ) {
		/* internal error */
		return -2;
	}

	if ( x <= ids[0].mid && ids[x].mid == id->mid ) {
		/* duplicate */
		return -1;
	}

	if ( ids[0].mid >= MDB_IDL_UM_MAX ) {
		/* too big */
		return -2;

	} else {
		/* insert id */
		ids[0].mid++;
		for (i=ids[0].mid; i>x; i--)
			ids[i] = ids[i-1];
		ids[x] = *id;
	}

	return 0;
}