schema_init.c 93.8 KB
Newer Older
1
2
/* schema_init.c - init builtin schema */
/* $OpenLDAP$ */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
3
4
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
 *
Kurt Zeilenga's avatar
Kurt Zeilenga committed
5
 * Copyright 1998-2005 The OpenLDAP Foundation.
Kurt Zeilenga's avatar
Kurt Zeilenga committed
6
7
8
9
10
11
12
13
14
 * 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>.
15
16
17
18
19
 */

#include "portable.h"

#include <stdio.h>
Kurt Zeilenga's avatar
Kurt Zeilenga committed
20
#ifdef HAVE_LIMITS_H
Kurt Zeilenga's avatar
Kurt Zeilenga committed
21
#include <limits.h>
Kurt Zeilenga's avatar
Kurt Zeilenga committed
22
#endif
23
24

#include <ac/ctype.h>
25
#include <ac/errno.h>
26
27
28
29
#include <ac/string.h>
#include <ac/socket.h>

#include "slap.h"
30

31
32
#include "ldap_utf8.h"

33
34
35
36
37
38
39
40
41
42
43
44
#ifdef HAVE_TLS
#include <openssl/x509.h>
#include <openssl/err.h>
#include <openssl/rsa.h>
#include <openssl/crypto.h>
#include <openssl/pem.h>
#include <openssl/bio.h>
#include <openssl/asn1.h>
#include <openssl/x509v3.h>
#include <openssl/ssl.h>
#endif

45
#include "lutil.h"
46
47
48
49
50
51
#include "lutil_hash.h"
#define HASH_BYTES				LUTIL_HASH_BYTES
#define HASH_CONTEXT			lutil_HASH_CTX
#define HASH_Init(c)			lutil_HASHInit(c)
#define HASH_Update(c,buf,len)	lutil_HASHUpdate(c,buf,len)
#define HASH_Final(d,c)			lutil_HASHFinal(d,c)
52

53
54
/* approx matching rules */
#define directoryStringApproxMatchOID	"1.3.6.1.4.1.4203.666.4.4"
55
#define directoryStringApproxMatch		approxMatch
Gary Williams's avatar
Gary Williams committed
56
#define directoryStringApproxIndexer	approxIndexer
57
#define directoryStringApproxFilter		approxFilter
58
#define IA5StringApproxMatchOID			"1.3.6.1.4.1.4203.666.4.5"
Gary Williams's avatar
Gary Williams committed
59
#define IA5StringApproxMatch			approxMatch
60
#define IA5StringApproxIndexer			approxIndexer
Gary Williams's avatar
Gary Williams committed
61
#define IA5StringApproxFilter			approxFilter
62

Howard Chu's avatar
Howard Chu committed
63
64
65
66
67
68
69
/* Change Sequence Number (CSN) - much of this will change */
#define csnValidate				blobValidate
#define csnMatch				octetStringMatch
#define csnOrderingMatch		octetStringOrderingMatch
#define csnIndexer				generalizedTimeIndexer
#define csnFilter				generalizedTimeFilter

70
71
72
73
74
#ifdef SLAP_AUTHZ_SYNTAX
/* FIXME: temporary */
#define authzMatch				octetStringMatch
#endif /* SLAP_AUTHZ_SYNTAX */

75
76
77
78
79
unsigned int index_substr_if_minlen = SLAP_INDEX_SUBSTR_IF_MINLEN_DEFAULT;
unsigned int index_substr_if_maxlen = SLAP_INDEX_SUBSTR_IF_MAXLEN_DEFAULT;
unsigned int index_substr_any_len = SLAP_INDEX_SUBSTR_ANY_LEN_DEFAULT;
unsigned int index_substr_any_step = SLAP_INDEX_SUBSTR_ANY_STEP_DEFAULT;

80
81
82
ldap_pvt_thread_mutex_t	ad_undef_mutex;
ldap_pvt_thread_mutex_t	oc_undef_mutex;

Kurt Zeilenga's avatar
Kurt Zeilenga committed
83
84
85
86
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
87
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
88
89
90
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
91

Kurt Zeilenga's avatar
Kurt Zeilenga committed
92
93
94
95
96
97
98
static int
blobValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_SUCCESS;
99
}
100

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
101
102
#define berValidate blobValidate

103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
static int
sequenceValidate(
	Syntax *syntax,
	struct berval *in )
{
	if ( in->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
	if ( in->bv_val[0] != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;

	return LDAP_SUCCESS;
}


#ifdef HAVE_TLS
static int certificateValidate( Syntax *syntax, struct berval *in )
{
	X509 *xcert=NULL;
119
	unsigned char *p = (unsigned char *)in->bv_val;
120
121
122
123
124
125
126
127
128
129
 
	xcert = d2i_X509(NULL, &p, in->bv_len);
	if ( !xcert ) return LDAP_INVALID_SYNTAX;
	X509_free(xcert);
	return LDAP_SUCCESS;
}
#else
#define certificateValidate sequenceValidate
#endif

130
int
131
132
octetStringMatch(
	int *matchp,
133
	slap_mask_t flags,
134
135
136
137
138
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
139
140
	struct berval *asserted = (struct berval *) assertedValue;
	int match = value->bv_len - asserted->bv_len;
141
142

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
143
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
144
145
146
147
148
149
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

150
151
152
153
154
155
156
157
158
static int
octetStringOrderingMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
159
	struct berval *asserted = (struct berval *) assertedValue;
160
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
161
	ber_len_t av_len = asserted->bv_len;
162

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
163
	int match = memcmp( value->bv_val, asserted->bv_val,
164
		(v_len < av_len ? v_len : av_len) );
165
166
167

	if( match == 0 ) match = v_len - av_len;

168
169
170
171
	*matchp = match;
	return LDAP_SUCCESS;
}

172
void
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
hashDigestify(
	HASH_CONTEXT *HASHcontext,
	unsigned char *HASHdigest,
	struct berval *prefix,
	char pre,
	Syntax *syntax,
	MatchingRule *mr,
	unsigned char *value,
	int value_len)
{
	HASH_Init(HASHcontext);
	if(prefix && prefix->bv_len > 0) {
		HASH_Update(HASHcontext,
			(unsigned char *)prefix->bv_val, prefix->bv_len);
	}
	if(pre) HASH_Update(HASHcontext, (unsigned char*)&pre, sizeof(pre));
	HASH_Update(HASHcontext, (unsigned char*)syntax->ssyn_oid, syntax->ssyn_oidlen);
	HASH_Update(HASHcontext, (unsigned char*)mr->smr_oid, mr->smr_oidlen);
	HASH_Update(HASHcontext, value, value_len);
	HASH_Final(HASHdigest, HASHcontext);
	return;
}

196
/* Index generation function */
197
int octetStringIndexer(
198
199
	slap_mask_t use,
	slap_mask_t flags,
200
201
202
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
203
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
204
205
	BerVarray *keysp,
	void *ctx )
206
207
208
{
	int i;
	size_t slen, mlen;
209
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
210
211
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
212
	struct berval digest;
213
	digest.bv_val = (char *)HASHdigest;
214
	digest.bv_len = sizeof(HASHdigest);
215

216
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
217
218
219
		/* just count them */
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
220
221
222
	/* we should have at least one value at this point */
	assert( i > 0 );

223
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
224

225
226
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
227

228
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
229
230
		hashDigestify( &HASHcontext, HASHdigest, prefix, 0,
			syntax, mr, (unsigned char *)values[i].bv_val, values[i].bv_len );
Howard Chu's avatar
Howard Chu committed
231
		ber_dupbv_x( &keys[i], &digest, ctx );
232
233
	}

234
	BER_BVZERO( &keys[i] );
235
236
237
238
239
240
241

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
242
int octetStringFilter(
243
244
	slap_mask_t use,
	slap_mask_t flags,
245
246
247
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
248
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
249
250
	BerVarray *keysp,
	void *ctx )
251
252
{
	size_t slen, mlen;
253
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
254
255
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
256
	struct berval *value = (struct berval *) assertedValue;
257
	struct berval digest;
258
	digest.bv_val = (char *)HASHdigest;
259
	digest.bv_len = sizeof(HASHdigest);
260

261
262
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
263

264
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
265

266
267
	hashDigestify( &HASHcontext, HASHdigest, prefix, 0,
		syntax, mr, (unsigned char *)value->bv_val, value->bv_len );
268

Howard Chu's avatar
Howard Chu committed
269
	ber_dupbv_x( keys, &digest, ctx );
270
	BER_BVZERO( &keys[1] );
271
272
273
274
275

	*keysp = keys;

	return LDAP_SUCCESS;
}
276

277
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
278
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
279
280
	int *matchp,
	slap_mask_t flags,
281
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
282
283
284
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
285
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
286
287
288
289
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
290
	ber_len_t inlen = 0;
291

Kurt Zeilenga's avatar
Kurt Zeilenga committed
292
	/* Add up asserted input length */
293
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
294
		inlen += sub->sa_initial.bv_len;
295
	}
296
297
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
298
299
300
			inlen += sub->sa_any[i].bv_len;
		}
	}
301
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
302
		inlen += sub->sa_final.bv_len;
303
304
	}

305
306
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
307
308
			match = 1;
			goto done;
309
310
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
311
312
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
313

314
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
315
316
			goto done;
		}
317

Kurt Zeilenga's avatar
Kurt Zeilenga committed
318
319
320
321
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
322

323
324
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
325
326
327
			match = 1;
			goto done;
		}
328

Kurt Zeilenga's avatar
Kurt Zeilenga committed
329
330
331
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
332

333
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
334
			goto done;
335
336
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
337
338
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
339
340
	}

341
342
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
343
344
			ber_len_t idx;
			char *p;
345

Kurt Zeilenga's avatar
Kurt Zeilenga committed
346
retry:
347
			if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
348
349
350
351
				/* not enough length */
				match = 1;
				goto done;
			}
352

353
			if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
354
355
				continue;
			}
356

Kurt Zeilenga's avatar
Kurt Zeilenga committed
357
			p = memchr( left.bv_val, *sub->sa_any[i].bv_val, left.bv_len );
358

Kurt Zeilenga's avatar
Kurt Zeilenga committed
359
360
361
			if( p == NULL ) {
				match = 1;
				goto done;
362
363
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
364
			idx = p - left.bv_val;
365

366
			if ( idx >= left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
367
368
369
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
370

Kurt Zeilenga's avatar
Kurt Zeilenga committed
371
372
			left.bv_val = p;
			left.bv_len -= idx;
373

374
			if ( sub->sa_any[i].bv_len > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
375
376
377
378
				/* not enough left */
				match = 1;
				goto done;
			}
379

Kurt Zeilenga's avatar
Kurt Zeilenga committed
380
381
382
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
383

384
			if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
385
386
387
388
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
389

Kurt Zeilenga's avatar
Kurt Zeilenga committed
390
391
392
			left.bv_val += sub->sa_any[i].bv_len;
			left.bv_len -= sub->sa_any[i].bv_len;
			inlen -= sub->sa_any[i].bv_len;
393
394
395
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
396
397
done:
	*matchp = match;
398
399
400
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
401
402
/* Substrings Index generation function */
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
403
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
404
405
406
407
408
409
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
410
411
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
412
{
Howard Chu's avatar
Howard Chu committed
413
	ber_len_t i, nkeys;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
414
415
416
	size_t slen, mlen;
	BerVarray keys;

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
417
418
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
419
	struct berval digest;
420
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
421
422
	digest.bv_len = sizeof(HASHdigest);

423
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
424

425
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
426
427
		/* count number of indices to generate */
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
428
429
430
431
432
			if( values[i].bv_len >= index_substr_if_maxlen ) {
				nkeys += index_substr_if_maxlen -
					(index_substr_if_minlen - 1);
			} else if( values[i].bv_len >= index_substr_if_minlen ) {
				nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
433
434
435
436
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
437
438
			if( values[i].bv_len >= index_substr_any_len ) {
				nkeys += values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
439
440
441
442
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
443
444
445
446
447
			if( values[i].bv_len >= index_substr_if_maxlen ) {
				nkeys += index_substr_if_maxlen -
					(index_substr_if_minlen - 1);
			} else if( values[i].bv_len >= index_substr_if_minlen ) {
				nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
448
449
450
451
452
453
454
455
456
457
			}
		}
	}

	if( nkeys == 0 ) {
		/* no keys to generate */
		*keysp = NULL;
		return LDAP_SUCCESS;
	}

458
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
459
460
461
462

	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;

463
464
	nkeys = 0;
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
465
466
467
		ber_len_t j,max;

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
468
			( values[i].bv_len >= index_substr_any_len ) )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
469
470
		{
			char pre = SLAP_INDEX_SUBSTR_PREFIX;
471
			max = values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
472
473

			for( j=0; j<max; j++ ) {
474
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
475
					syntax, mr, (unsigned char *)&values[i].bv_val[j], index_substr_any_len);
Howard Chu's avatar
Howard Chu committed
476
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
477
478
479
			}
		}

480
		/* skip if too short */ 
481
		if( values[i].bv_len < index_substr_if_minlen ) continue;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
482

483
484
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
485

486
		for( j=index_substr_if_minlen; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
487
488
489
490
			char pre;

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
				pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
491
492
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
					syntax, mr, (unsigned char *)values[i].bv_val, j );
Howard Chu's avatar
Howard Chu committed
493
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
494
495
496
497
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
498
499
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
					syntax, mr, (unsigned char *)&values[i].bv_val[values[i].bv_len-j], j );
Howard Chu's avatar
Howard Chu committed
500
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
501
502
503
504
505
506
			}

		}
	}

	if( nkeys > 0 ) {
507
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}

	return LDAP_SUCCESS;
}

static int
octetStringSubstringsFilter (
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
525
526
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
527
528
529
{
	SubstringsAssertion *sa;
	char pre;
Howard Chu's avatar
Howard Chu committed
530
	ber_len_t nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
531
532
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
533
534
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
535
536
537
538
539
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

540
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
541
		!BER_BVISNULL( &sa->sa_initial ) &&
542
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
543
544
	{
		nkeys++;
545
		if ( sa->sa_initial.bv_len > index_substr_if_maxlen &&
546
547
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
548
			nkeys += 1 + (sa->sa_initial.bv_len - index_substr_if_maxlen) / index_substr_any_step;
549
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
550
551
	}

552
	if ( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
553
		ber_len_t i;
554
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
555
			if( sa->sa_any[i].bv_len >= index_substr_any_len ) {
556
				/* don't bother accounting with stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
557
				nkeys += sa->sa_any[i].bv_len -
558
					( index_substr_any_len - 1 );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
559
560
561
562
			}
		}
	}

563
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
564
		!BER_BVISNULL( &sa->sa_final ) &&
565
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
566
567
	{
		nkeys++;
568
		if ( sa->sa_final.bv_len > index_substr_if_maxlen &&
569
570
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
571
			nkeys += 1 + (sa->sa_final.bv_len - index_substr_if_maxlen) / index_substr_any_step;
572
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
573
574
575
576
577
578
579
	}

	if( nkeys == 0 ) {
		*keysp = NULL;
		return LDAP_SUCCESS;
	}

580
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
581
582
583
584
585
	digest.bv_len = sizeof(HASHdigest);

	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;

586
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
587
588
	nkeys = 0;

589
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
590
		!BER_BVISNULL( &sa->sa_initial ) &&
591
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
592
593
594
595
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

596
597
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
598

599
600
		hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
			syntax, mr, (unsigned char *)value->bv_val, klen );
Howard Chu's avatar
Howard Chu committed
601
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
602
603
604
605

		/* If initial is too long and we have subany indexed, use it
		 * to match the excess...
		 */
606
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
607
608
609
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
610
			for ( j=index_substr_if_maxlen-1; j <= value->bv_len - index_substr_any_len; j+=index_substr_any_step )
611
612
			{
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
613
					syntax, mr, (unsigned char *)&value->bv_val[j], index_substr_any_len );
614
615
616
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
			}
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
617
618
619
620
621
	}

	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
		ber_len_t i, j;
		pre = SLAP_INDEX_SUBSTR_PREFIX;
622
		klen = index_substr_any_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
623

624
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
625
			if( sa->sa_any[i].bv_len < index_substr_any_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
626
627
628
629
630
631
				continue;
			}

			value = &sa->sa_any[i];

			for(j=0;
632
633
				j <= value->bv_len - index_substr_any_len;
				j += index_substr_any_step )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
634
			{
635
636
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
					syntax, mr, (unsigned char *)&value->bv_val[j], klen ); 
Howard Chu's avatar
Howard Chu committed
637
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
638
639
640
641
			}
		}
	}

642
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
643
		!BER_BVISNULL( &sa->sa_final ) &&
644
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
645
646
647
648
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

649
650
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
651

652
653
		hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
			syntax, mr, (unsigned char *)&value->bv_val[value->bv_len-klen], klen );
Howard Chu's avatar
Howard Chu committed
654
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
655
656
657
658

		/* If final is too long and we have subany indexed, use it
		 * to match the excess...
		 */
659
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
660
661
662
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
663
			for ( j=0; j <= value->bv_len - index_substr_if_maxlen; j+=index_substr_any_step )
664
665
			{
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
666
					syntax, mr, (unsigned char *)&value->bv_val[j], index_substr_any_len );
667
668
669
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
			}
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
670
671
672
	}

	if( nkeys > 0 ) {
673
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}

	return LDAP_SUCCESS;
}

static int
bitStringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t i;

	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */
	if( in->bv_len < 3 ) {
		return LDAP_INVALID_SYNTAX;
	}

	/*
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
698
699
700
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
701
702
703
704
	 * example: '0101111101'B
	 */
	
	if( in->bv_val[0] != '\'' ||
705
706
		in->bv_val[in->bv_len - 2] != '\'' ||
		in->bv_val[in->bv_len - 1] != 'B' )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
707
708
709
710
	{
		return LDAP_INVALID_SYNTAX;
	}

711
	for( i = in->bv_len - 3; i > 0; i-- ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
712
713
714
715
716
717
718
719
		if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
			return LDAP_INVALID_SYNTAX;
		}
	}

	return LDAP_SUCCESS;
}

720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
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
/*
 * Syntax is [RFC2252]:
 *

6.3. Bit String

   ( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )

   Values in this syntax are encoded according to the following BNF:

      bitstring = "'" *binary-digit "'B"

      binary-digit = "0" / "1"

   ... 

6.21. Name And Optional UID

   ( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )

   Values in this syntax are encoded according to the following BNF:

      NameAndOptionalUID = DistinguishedName [ "#" bitstring ]

   Although the '#' character may occur in a string representation of a
   distinguished name, no additional special quoting is done.  This
   syntax has been added subsequent to RFC 1778.

   Example:

      1.3.6.1.4.1.1466.0=#04024869,O=Test,C=GB#'0101'B

 *
 * draft-ietf-ldapbis-syntaxes-xx.txt says:
 *

3.3.2.  Bit String

   A value of the Bit String syntax is a sequence of binary digits.  The
   LDAP-specific encoding of a value of this syntax is defined by the
   following ABNF:

      BitString    = SQUOTE *binary-digit SQUOTE "B"

      binary-digit = "0" / "1"

   The <SQUOTE> rule is defined in [MODELS].

      Example:
         '0101111101'B

   The LDAP definition for the Bit String syntax is:

      ( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )

   This syntax corresponds to the BIT STRING ASN.1 type from [ASN.1].

   ...

3.3.21.  Name and Optional UID

   A value of the Name and Optional UID syntax is the distinguished name
   [MODELS] of an entity optionally accompanied by a unique identifier
   that serves to differentiate the entity from others with an identical
   distinguished name.

   The LDAP-specific encoding of a value of this syntax is defined by
   the following ABNF:

       NameAndOptionalUID = distinguishedName [ SHARP BitString ]

   The <BitString> rule is defined in Section 3.3.2.  The
   <distinguishedName> rule is defined in [LDAPDN].  The <SHARP> rule is
   defined in [MODELS].

   Note that although the '#' character may occur in the string
   representation of a distinguished name, no additional escaping of
   this character is performed when a <distinguishedName> is encoded in
   a <NameAndOptionalUID>.

      Example:
         1.3.6.1.4.1.1466.0=#04024869,O=Test,C=GB#'0101'B

   The LDAP definition for the Name and Optional UID syntax is:

      ( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )

   This syntax corresponds to the NameAndOptionalUID ASN.1 type from
   [X.520].

 *
 * draft-ietf-ldapbis-models-xx.txt [MODELS] says:
 *

1.4. Common ABNF Productions

  ...
      SHARP   = %x23 ; octothorpe (or sharp sign) ("#")
  ...
      SQUOTE  = %x27 ; single quote ("'")
  ...
      
 *
 * Note: normalization strips any leading "0"s, unless the
 * bit string is exactly "'0'B", so the normalized example,
 * in slapd, would result in
 * 
 * 1.3.6.1.4.1.1466.0=#04024869,o=test,c=gb#'101'B
 * 
 * Since draft-ietf-ldapbis-dn-xx.txt clarifies that SHARP,
 * i.e. "#", doesn't have to be escaped except when at the
 * beginning of a value, the definition of Name and Optional
 * UID appears to be flawed, because there is no clear means
 * to determine whether the UID part is present or not.
 *
 * Example:
 *
 * 	cn=Someone,dc=example,dc=com#'1'B
 *
 * could be either a NameAndOptionalUID with trailing UID, i.e.
 *
 * 	DN = "cn=Someone,dc=example,dc=com"
 * 	UID = "'1'B"
 * 
 * or a NameAndOptionalUID with no trailing UID, and the AVA
 * in the last RDN made of
 *
 * 	attributeType = dc 
 * 	attributeValue = com#'1'B
 *
 * in fact "com#'1'B" is a valid IA5 string.
 *
 * As a consequence, current slapd code assumes that the
 * presence of portions of a BitString at the end of the string 
 * representation of a NameAndOptionalUID means a BitString
 * is expected, and cause an error otherwise.  This is quite
 * arbitrary, and might change in the future.
 */


Kurt Zeilenga's avatar
Kurt Zeilenga committed
860
861
862
863
864
865
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
866
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
867

868
	if( BER_BVISEMPTY( in ) ) return LDAP_SUCCESS;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
869
870
871
872

	ber_dupbv( &dn, in );
	if( !dn.bv_val ) return LDAP_OTHER;

873
874
	/* if there's a "#", try bitStringValidate()... */
	uid.bv_val = strrchr( dn.bv_val, '#' );
875
	if ( !BER_BVISNULL( &uid ) ) {
876
877
878
879
880
881
882
883
884
		uid.bv_val++;
		uid.bv_len = dn.bv_len - ( uid.bv_val - dn.bv_val );

		rc = bitStringValidate( NULL, &uid );
		if ( rc == LDAP_SUCCESS ) {
			/* in case of success, trim the UID,
			 * otherwise treat it as part of the DN */
			dn.bv_len -= uid.bv_len + 1;
			uid.bv_val[-1] = '\0';
Kurt Zeilenga's avatar
Kurt Zeilenga committed
885
886
887
888
889
890
891
892
893
		}
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

894
895
896
897
898
899
900
int
nameUIDPretty(
	Syntax *syntax,
	struct berval *val,
	struct berval *out,
	void *ctx )
{
901
902
	assert( val != NULL );
	assert( out != NULL );
903
904
905
906


	Debug( LDAP_DEBUG_TRACE, ">>> nameUIDPretty: <%s>\n", val->bv_val, 0, 0 );

907
	if( BER_BVISEMPTY( val ) ) {
908
909
910
911
912
913
		ber_dupbv_x( out, val, ctx );

	} else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
		return LDAP_INVALID_SYNTAX;

	} else {
914
915
916
		int		rc;
		struct berval	dnval = *val;
		struct berval	uidval = BER_BVNULL;
917

918
		uidval.bv_val = strrchr( val->bv_val, '#' );
919
		if ( !BER_BVISNULL( &uidval ) ) {
920
921
			uidval.bv_val++;
			uidval.bv_len = val->bv_len - ( uidval.bv_val - val->bv_val );
922

923
			rc = bitStringValidate( NULL, &uidval );
924

925
926
927
928
			if ( rc == LDAP_SUCCESS ) {
				ber_dupbv_x( &dnval, val, ctx );
				dnval.bv_len -= uidval.bv_len + 1;
				dnval.bv_val[dnval.bv_len] = '\0';
929

930
			} else {
931
				BER_BVZERO( &uidval );
932
			}
933
934
935
		}

		rc = dnPretty( syntax, &dnval, out, ctx );
936
937
938
939
940
941
		if ( dnval.bv_val != val->bv_val ) {
			slap_sl_free( dnval.bv_val, ctx );
		}
		if( rc != LDAP_SUCCESS ) {
			return rc;
		}
942

943
		if( !BER_BVISNULL( &uidval ) ) {
944
945
946
			int	i, c, got1;
			char	*tmp;

947
948
			tmp = slap_sl_realloc( out->bv_val, out->bv_len 
				+ STRLENOF( "#" ) + uidval.bv_len + 1,
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
949
				ctx );
950
951
952
953
			if( tmp == NULL ) {
				ber_memfree_x( out->bv_val, ctx );
				return LDAP_OTHER;
			}
954
			out->bv_val = tmp;
955
			out->bv_val[out->bv_len++] = '#';
956
			out->bv_val[out->bv_len++] = '\'';
957
958

			got1 = uidval.bv_len < sizeof("'0'B"); 
959
			for( i = 1; i < uidval.bv_len - 2; i++ ) {
960
961
962
963
964
965
966
967
				c = uidval.bv_val[i];
				switch(c) {
					case '0':
						if( got1 ) out->bv_val[out->bv_len++] = c;
						break;
					case '1':
						got1 = 1;
						out->bv_val[out->bv_len++] = c;
968
						break;
969
970
971
				}
			}

972
973
			out->bv_val[out->bv_len++] = '\'';
			out->bv_val[out->bv_len++] = 'B';
974
975
976
977
978
979
980
981
982
			out->bv_val[out->bv_len] = '\0';
		}
	}

	Debug( LDAP_DEBUG_TRACE, "<<< nameUIDPretty: <%s>\n", out->bv_val, 0, 0 );

	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
983
984
985
986
987
988
static int
uniqueMemberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
989
990
	struct berval *normalized,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
991
992
993
994
{
	struct berval out;
	int rc;

995
996
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

Pierangelo Masarati's avatar
Pierangelo Masarati committed
997
998
	ber_dupbv_x( &out, val, ctx );
	if ( BER_BVISEMPTY( &out ) ) {
999
1000
1001
		*normalized = out;

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1002
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1003

1004
		uid.bv_val = strrchr( out.bv_val, '#' );
1005
		if ( !BER_BVISNULL( &uid ) ) {
1006
1007
1008
1009
1010
1011
1012
1013
			uid.bv_val++;
			uid.bv_len = out.bv_len - ( uid.bv_val - out.bv_val );

			rc = bitStringValidate( NULL, &uid );
			if ( rc == LDAP_SUCCESS ) {
				uid.bv_val[-1] = '\0';
				out.bv_len -= uid.bv_len + 1;
			} else {
1014
				BER_BVZERO( &uid );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1015
1016
1017
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1018
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1019
1020

		if( rc != LDAP_SUCCESS ) {
Pierangelo Masarati's avatar
Pierangelo Masarati committed
1021
			slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1022
1023
1024
			return LDAP_INVALID_SYNTAX;
		}

1025
		if( !BER_BVISNULL( &uid ) ) {
1026
1027
1028
			char	*tmp;

			tmp = ch_realloc( normalized->bv_val,
1029
1030
				normalized->bv_len + uid.bv_len
				+ STRLENOF("#") + 1 );
1031
1032
1033
1034
1035
1036
			if ( tmp == NULL ) {
				ber_memfree_x( normalized->bv_val, ctx );
				return LDAP_OTHER;
			}

			normalized->bv_val = tmp;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049

			/* insert the separator */
			normalized->bv_val[normalized->bv_len++] = '#';

			/* append the UID */
			AC_MEMCPY( &normalized->bv_val[normalized->bv_len],
				uid.bv_val, uid.bv_len );
			normalized->bv_len += uid.bv_len;

			/* terminate */
			normalized->bv_val[normalized->bv_len] = '\0';
		}

Pierangelo Masarati's avatar
Pierangelo Masarati committed
1050
		slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1051
1052
1053
1054
1055
	}

	return LDAP_SUCCESS;
}

1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
static int
uniqueMemberMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	int match;
	struct berval *asserted = (struct berval *) assertedValue;
1067
	struct berval assertedDN = *asserted;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1068
	struct berval assertedUID = BER_BVNULL;
Howard Chu's avatar
Howard Chu committed
1069
	struct berval valueDN = *value;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1070
	struct berval valueUID = BER_BVNULL;
1071
	int approx = ((flags & SLAP_MR_EQUALITY_APPROX) == SLAP_MR_EQUALITY_APPROX);
1072

1073
	if ( !BER_BVISEMPTY( asserted ) ) {
1074
1075
1076
1077
1078
		assertedUID.bv_val = strrchr( assertedDN.bv_val, '#' );
		if ( !BER_BVISNULL( &assertedUID ) ) {
			assertedUID.bv_val++;
			assertedUID.bv_len = assertedDN.bv_len
				- ( assertedUID.bv_val - assertedDN.bv_val );
1079

1080
1081
			if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
				assertedDN.bv_len -= assertedUID.bv_len + 1;
1082

1083
1084
1085
			} else {
				BER_BVZERO( &assertedUID );
			}
1086
1087
1088
		}
	}

1089
	if ( !BER_BVISEMPTY( value ) ) {
1090

1091
1092
1093
1094
1095
		valueUID.bv_val = strrchr( valueDN.bv_val, '#' );
		if ( !BER_BVISNULL( &valueUID ) ) {
			valueUID.bv_val++;
			valueUID.bv_len = valueDN.bv_len
				- ( valueUID.bv_val - valueDN.bv_val );
1096

1097
1098
			if ( bitStringValidate( NULL, &valueUID ) == LDAP_SUCCESS ) {
				valueDN.bv_len -= valueUID.bv_len + 1;
1099

1100
1101
1102
			} else {
				BER_BVZERO( &valueUID );
			}
1103
1104
1105
1106
		}
	}

	if( valueUID.bv_len && assertedUID.bv_len ) {
1107
1108
1109
1110
1111
1112
		match = valueUID.bv_len - assertedUID.bv_len;
		if ( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}

1113
1114
1115
1116
1117
		match = memcmp( valueUID.bv_val, assertedUID.bv_val, valueUID.bv_len );
		if( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127

	} else if ( !approx && valueUID.bv_len ) {
		match = -1;
		*matchp = match;
		return LDAP_SUCCESS;

	} else if ( !approx && assertedUID.bv_len ) {
		match = 1;
		*matchp = match;
		return LDAP_SUCCESS;
1128
1129
1130
1131
1132
	}

	return dnMatch( matchp, flags, syntax, mr, &valueDN, &assertedDN );
}

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
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
static int 
uniqueMemberIndexer(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
	BerVarray *keysp,
	void *ctx )
{
	BerVarray dnvalues;
	int rc;
	int i;
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
		/* just count them */                 
	}
	assert( i > 0 );

	dnvalues = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );

	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
		struct berval assertedDN = values[i];
		struct berval assertedUID = BER_BVNULL;

		if ( !BER_BVISEMPTY( &assertedDN ) ) {
			assertedUID.bv_val = strrchr( assertedDN.bv_val, '#' );
			if ( !BER_BVISNULL( &assertedUID ) ) {
				assertedUID.bv_val++;
				assertedUID.bv_len = assertedDN.bv_len
					- ( assertedUID.bv_val - assertedDN.bv_val );
	
				if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
					assertedDN.bv_len -= assertedUID.bv_len + 1;

				} else {
					BER_BVZERO( &assertedUID );
				}
			}
		}

		dnvalues[i] = assertedDN;
	}
	BER_BVZERO( &dnvalues[i] );

	rc = octetStringIndexer( use, flags, syntax, mr, prefix,
		dnvalues, keysp, ctx );

	slap_sl_free( dnvalues, ctx );
	return rc;
}

static int 
uniqueMemberFilter(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertedValue,
	BerVarray *keysp,
	void *ctx )
{
	struct berval *asserted = (struct berval *) assertedValue;
	struct berval assertedDN = *asserted;
	struct berval assertedUID = BER_BVNULL;