schema_init.c 94.4 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;

82
83
84
ldap_pvt_thread_mutex_t	ad_undef_mutex;
ldap_pvt_thread_mutex_t	oc_undef_mutex;

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

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
103
104
#define berValidate blobValidate

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

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

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

	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

170
171
172
173
	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

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

225
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
226

227
228
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
229

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

236
	BER_BVZERO( &keys[i] );
237
238
239
240
241
242
243

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

263
264
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
265

266
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
267

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}
278

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
366
			idx = p - left.bv_val;
367

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

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

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
392
393
394
			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;
395
396
397
		}
	}

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

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

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

425
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
426

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

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
439
440
			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
441
442
443
444
			}
		}

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

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

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

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

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

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

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

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

485
486
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
487

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

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

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

		}
	}

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

	sa = (SubstringsAssertion *) assertedValue;

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

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

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

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

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

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

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

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

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

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

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

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

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

			value = &sa->sa_any[i];

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

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

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

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

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

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

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

	return LDAP_SUCCESS;
}

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

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

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

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

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

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


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

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

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

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

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

925
			rc = bitStringValidate( NULL, &uidval );
926

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

932
			} else {
933
				BER_BVZERO( &uidval );
934
			}
935
936
937
		}

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

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

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

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

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

997
998
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

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

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1004
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1005

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

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

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

1027
		if( !BER_BVISNULL( &uid ) ) {
1028
1029
1030
			char	*tmp;

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

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

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

	return LDAP_SUCCESS;
}

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

1075
	if ( !BER_BVISEMPTY( asserted ) ) {
1076
1077
1078
1079
1080
		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 );
1081

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

1085
1086
1087
			} else {
				BER_BVZERO( &assertedUID );
			}
1088
1089
1090
		}
	}

1091
	if ( !BER_BVISEMPTY( value ) ) {
1092
1093
		valueDN = *value;

1094
1095
1096
1097
1098
		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 );
1099

1100
1101
			if ( bitStringValidate( NULL, &valueUID ) == LDAP_SUCCESS ) {
				valueDN.bv_len -= valueUID.bv_len + 1;
1102

1103
1104
1105
			} else {
				BER_BVZERO( &valueUID );
			}
1106
1107
1108
1109
		}
	}

	if( valueUID.bv_len && assertedUID.bv_len ) {
1110
1111
1112
1113
1114
1115
		match = valueUID.bv_len - assertedUID.bv_len;
		if ( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}

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

	} 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;
1131
1132
1133
1134
1135
	}

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

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
1221
1222
1223
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(