schema_init.c 94.2 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
#define	OpenLDAPaciMatch			octetStringMatch
Pierangelo Masarati's avatar
Pierangelo Masarati committed
54

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

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

72
73
74
75
76
#ifdef SLAP_AUTHZ_SYNTAX
/* FIXME: temporary */
#define authzMatch				octetStringMatch
#endif /* SLAP_AUTHZ_SYNTAX */

77
78
79
80
81
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;

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

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

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

102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
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;
118
	unsigned char *p = (unsigned char *)in->bv_val;
119
120
121
122
123
124
125
126
127
128
 
	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

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

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

	*matchp = match;
	return LDAP_SUCCESS;
}

149
150
151
152
153
154
155
156
157
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
158
	struct berval *asserted = (struct berval *) assertedValue;
159
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
160
	ber_len_t av_len = asserted->bv_len;
161

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

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

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

171
void
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
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;
}

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

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

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

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

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

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

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

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

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}
275

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
389
390
391
			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;
392
393
394
		}
	}

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

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

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

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

424
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
425
426
		/* count number of indices to generate */
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
427
428
429
430
431
			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
432
433
434
435
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
436
437
			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
438
439
440
441
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
442
443
444
445
446
			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
447
448
449
450
451
452
453
454
455
456
			}
		}
	}

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

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

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

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

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

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

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

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

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

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

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
497
498
				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
499
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
500
501
502
503
504
505
			}

		}
	}

	if( nkeys > 0 ) {
506
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
		*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
524
525
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
526
527
528
{
	SubstringsAssertion *sa;
	char pre;
Howard Chu's avatar
Howard Chu committed
529
	ber_len_t nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
530
531
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
532
533
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
534
535
536
537
538
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

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

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

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

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

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

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

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

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

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

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

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

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

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

			value = &sa->sa_any[i];

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

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

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

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

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

	if( nkeys > 0 ) {
672
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
		*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
697
698
699
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
700
701
702
703
	 * example: '0101111101'B
	 */
	
	if( in->bv_val[0] != '\'' ||
704
705
		in->bv_val[in->bv_len - 2] != '\'' ||
		in->bv_val[in->bv_len - 1] != 'B' )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
706
707
708
709
	{
		return LDAP_INVALID_SYNTAX;
	}

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

	return LDAP_SUCCESS;
}

719
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
/*
 * 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
859
860
861
862
863
864
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
865
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
866

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

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

872
873
	/* if there's a "#", try bitStringValidate()... */
	uid.bv_val = strrchr( dn.bv_val, '#' );
874
	if ( !BER_BVISNULL( &uid ) ) {
875
876
877
878
879
880
881
882
883
		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
884
885
886
887
888
889
890
891
892
		}
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

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


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

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

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

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

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

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

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

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

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

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

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

			got1 = uidval.bv_len < sizeof("'0'B"); 
958
			for( i = 1; i < uidval.bv_len - 2; i++ ) {
959
960
961
962
963
964
965
966
				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;
967
						break;
968
969
970
				}
			}

971
972
			out->bv_val[out->bv_len++] = '\'';
			out->bv_val[out->bv_len++] = 'B';
973
974
975
976
977
978
979
980
981
			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
982
983
984
985
986
987
static int
uniqueMemberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
988
989
	struct berval *normalized,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
990
991
992
993
{
	struct berval out;
	int rc;

994
995
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

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

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

1003
		uid.bv_val = strrchr( out.bv_val, '#' );
1004
		if ( !BER_BVISNULL( &uid ) ) {
1005
1006
1007
1008
1009
1010
1011
1012
			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 {
1013
				BER_BVZERO( &uid );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1014
1015
1016
			}
		}

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

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

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

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

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

			/* 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
1049
		slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1050
1051
1052
1053
1054
	}

	return LDAP_SUCCESS;
}

1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
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;
1066
	struct berval assertedDN = *asserted;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1067
1068
1069
	struct berval assertedUID = BER_BVNULL;
	struct berval valueDN = BER_BVNULL;
	struct berval valueUID = BER_BVNULL;
1070
	int approx = ((flags & SLAP_MR_EQUALITY_APPROX) == SLAP_MR_EQUALITY_APPROX);
1071

1072
	if ( !BER_BVISEMPTY( asserted ) ) {
1073
1074
1075
1076
1077
		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 );
1078

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

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

1088
	if ( !BER_BVISEMPTY( value ) ) {
1089
1090
		valueDN = *value;

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;

	if ( !BER_BVISEMPTY( asserted ) ) {
		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( &