schema_init.c 93.5 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
#include <limits.h>
21
22

#include <ac/ctype.h>
23
#include <ac/errno.h>
24
25
26
27
#include <ac/string.h>
#include <ac/socket.h>

#include "slap.h"
28

29
30
#include "ldap_utf8.h"

31
32
33
34
35
36
37
38
39
40
41
42
#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

43
#include "lutil.h"
44
45
46
47
48
49
#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)
50

Pierangelo Masarati's avatar
Pierangelo Masarati committed
51
52
#define	OpenLDAPaciMatch			NULL

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
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
75
76
77
78
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
79
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
80
81
82
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
83

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
93
94
#define berValidate blobValidate

95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
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;
111
	unsigned char *p = (unsigned char *)in->bv_val;
112
113
114
115
116
117
118
119
120
121
 
	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

122
123
124
static int
octetStringMatch(
	int *matchp,
125
	slap_mask_t flags,
126
127
128
129
130
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
131
132
	struct berval *asserted = (struct berval *) assertedValue;
	int match = value->bv_len - asserted->bv_len;
133
134

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
135
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
136
137
138
139
140
141
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

142
143
144
145
146
147
148
149
150
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
151
	struct berval *asserted = (struct berval *) assertedValue;
152
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
153
	ber_len_t av_len = asserted->bv_len;
154

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
155
	int match = memcmp( value->bv_val, asserted->bv_val,
156
		(v_len < av_len ? v_len : av_len) );
157
158
159

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

160
161
162
163
	*matchp = match;
	return LDAP_SUCCESS;
}

164
void
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
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;
}

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

208
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
209
210
211
		/* just count them */
	}

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

215
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
216

217
218
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
219

220
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
221
222
		hashDigestify( &HASHcontext, HASHdigest, prefix, 0,
			syntax, mr, (unsigned char *)values[i].bv_val, values[i].bv_len );
Howard Chu's avatar
Howard Chu committed
223
		ber_dupbv_x( &keys[i], &digest, ctx );
224
225
	}

226
	BER_BVZERO( &keys[i] );
227
228
229
230
231
232
233

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

253
254
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
255

256
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
257

258
259
	hashDigestify( &HASHcontext, HASHdigest, prefix, 0,
		syntax, mr, (unsigned char *)value->bv_val, value->bv_len );
260

Howard Chu's avatar
Howard Chu committed
261
	ber_dupbv_x( keys, &digest, ctx );
262
	BER_BVZERO( &keys[1] );
263
264
265
266
267

	*keysp = keys;

	return LDAP_SUCCESS;
}
268

269
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
270
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
271
272
	int *matchp,
	slap_mask_t flags,
273
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
274
275
276
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
277
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
278
279
280
281
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
282
	ber_len_t inlen = 0;
283

Kurt Zeilenga's avatar
Kurt Zeilenga committed
284
	/* Add up asserted input length */
285
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
286
		inlen += sub->sa_initial.bv_len;
287
	}
288
289
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
290
291
292
			inlen += sub->sa_any[i].bv_len;
		}
	}
293
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
294
		inlen += sub->sa_final.bv_len;
295
296
	}

297
298
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
299
300
			match = 1;
			goto done;
301
302
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
303
304
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
305

306
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
307
308
			goto done;
		}
309

Kurt Zeilenga's avatar
Kurt Zeilenga committed
310
311
312
313
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
314

315
316
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
317
318
319
			match = 1;
			goto done;
		}
320

Kurt Zeilenga's avatar
Kurt Zeilenga committed
321
322
323
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
324

325
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
326
			goto done;
327
328
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
329
330
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
331
332
	}

333
334
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
335
336
			ber_len_t idx;
			char *p;
337

Kurt Zeilenga's avatar
Kurt Zeilenga committed
338
retry:
339
			if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
340
341
342
343
				/* not enough length */
				match = 1;
				goto done;
			}
344

345
			if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
346
347
				continue;
			}
348

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
351
352
353
			if( p == NULL ) {
				match = 1;
				goto done;
354
355
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
356
			idx = p - left.bv_val;
357

358
			if ( idx >= left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
359
360
361
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
362

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

366
			if ( sub->sa_any[i].bv_len > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
367
368
369
370
				/* not enough left */
				match = 1;
				goto done;
			}
371

Kurt Zeilenga's avatar
Kurt Zeilenga committed
372
373
374
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
375

376
			if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
377
378
379
380
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
381

Kurt Zeilenga's avatar
Kurt Zeilenga committed
382
383
384
			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;
385
386
387
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
388
389
done:
	*matchp = match;
390
391
392
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
393
394
/* Substrings Index generation function */
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
395
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
396
397
398
399
400
401
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
402
403
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
404
{
405
	ber_len_t i, j, len, nkeys;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
406
407
408
	size_t slen, mlen;
	BerVarray keys;

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
409
410
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
411
	struct berval digest;
412
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
413
414
	digest.bv_len = sizeof(HASHdigest);

415
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
416

417
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
418
419
		/* count number of indices to generate */
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
420
421
422
423
424
			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
425
426
427
428
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
429
430
			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
431
432
433
434
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
435
436
437
438
439
			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
440
441
442
443
444
445
446
447
448
449
			}
		}
	}

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

450
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
451
452
453
454

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

455
456
	nkeys = 0;
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
457
458
459
		ber_len_t j,max;

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
460
			( values[i].bv_len >= index_substr_any_len ) )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
461
462
		{
			char pre = SLAP_INDEX_SUBSTR_PREFIX;
463
			max = values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
464
465

			for( j=0; j<max; j++ ) {
466
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
467
					syntax, mr, (unsigned char *)&values[i].bv_val[j], index_substr_any_len);
Howard Chu's avatar
Howard Chu committed
468
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
469
470
471
			}
		}

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

475
476
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
477

478
		for( j=index_substr_if_minlen; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
479
480
481
482
			char pre;

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
				pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
483
484
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
					syntax, mr, (unsigned char *)values[i].bv_val, j );
Howard Chu's avatar
Howard Chu committed
485
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
486
487
488
489
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
490
491
				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
492
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
493
494
495
496
497
498
			}

		}
	}

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

	sa = (SubstringsAssertion *) assertedValue;

532
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
533
		!BER_BVISNULL( &sa->sa_initial ) &&
534
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
535
536
	{
		nkeys++;
537
		if ( sa->sa_initial.bv_len > index_substr_if_maxlen &&
538
539
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
540
			nkeys += 1 + (sa->sa_initial.bv_len - index_substr_if_maxlen) / index_substr_any_step;
541
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
542
543
	}

544
	if ( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
545
		ber_len_t i;
546
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
547
			if( sa->sa_any[i].bv_len >= index_substr_any_len ) {
548
				/* don't bother accounting with stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
549
				nkeys += sa->sa_any[i].bv_len -
550
					( index_substr_any_len - 1 );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
551
552
553
554
			}
		}
	}

555
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
556
		!BER_BVISNULL( &sa->sa_final ) &&
557
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
558
559
	{
		nkeys++;
560
		if ( sa->sa_final.bv_len > index_substr_if_maxlen &&
561
562
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
563
			nkeys += 1 + (sa->sa_final.bv_len - index_substr_if_maxlen) / index_substr_any_step;
564
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
565
566
567
568
569
570
571
	}

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

572
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
573
574
575
576
577
	digest.bv_len = sizeof(HASHdigest);

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

578
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
579
580
	nkeys = 0;

581
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
582
		!BER_BVISNULL( &sa->sa_initial ) &&
583
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
584
585
586
587
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

588
589
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
590

591
592
		hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
			syntax, mr, (unsigned char *)value->bv_val, klen );
Howard Chu's avatar
Howard Chu committed
593
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
594
595
596
597

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

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

616
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
617
			if( sa->sa_any[i].bv_len < index_substr_any_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
618
619
620
621
622
623
				continue;
			}

			value = &sa->sa_any[i];

			for(j=0;
624
625
				j <= value->bv_len - index_substr_any_len;
				j += index_substr_any_step )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
626
			{
627
628
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
					syntax, mr, (unsigned char *)&value->bv_val[j], klen ); 
Howard Chu's avatar
Howard Chu committed
629
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
630
631
632
633
			}
		}
	}

634
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
635
		!BER_BVISNULL( &sa->sa_final ) &&
636
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
637
638
639
640
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

641
642
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
643

644
645
		hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
			syntax, mr, (unsigned char *)&value->bv_val[value->bv_len-klen], klen );
Howard Chu's avatar
Howard Chu committed
646
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
647
648
649
650

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

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

703
	for( i = in->bv_len - 3; i > 0; i-- ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
704
705
706
707
708
709
710
711
		if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
			return LDAP_INVALID_SYNTAX;
		}
	}

	return LDAP_SUCCESS;
}

712
713
714
715
716
717
718
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
/*
 * 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
852
853
854
855
856
857
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
858
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
859

860
	if( BER_BVISEMPTY( in ) ) return LDAP_SUCCESS;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
861
862
863
864

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

865
866
	/* if there's a "#", try bitStringValidate()... */
	uid.bv_val = strrchr( dn.bv_val, '#' );
867
	if ( !BER_BVISNULL( &uid ) ) {
868
869
870
871
872
873
874
875
876
		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
877
878
879
880
881
882
883
884
885
		}
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

886
887
888
889
890
891
892
893
894
895
896
897
898
int
nameUIDPretty(
	Syntax *syntax,
	struct berval *val,
	struct berval *out,
	void *ctx )
{
	assert( val );
	assert( out );


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

899
	if( BER_BVISEMPTY( val ) ) {
900
901
902
903
904
905
		ber_dupbv_x( out, val, ctx );

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

	} else {
906
907
908
		int		rc;
		struct berval	dnval = *val;
		struct berval	uidval = BER_BVNULL;
909

910
		uidval.bv_val = strrchr( val->bv_val, '#' );
911
		if ( !BER_BVISNULL( &uidval ) ) {
912
913
			uidval.bv_val++;
			uidval.bv_len = val->bv_len - ( uidval.bv_val - val->bv_val );
914

915
			rc = bitStringValidate( NULL, &uidval );
916

917
918
919
920
			if ( rc == LDAP_SUCCESS ) {
				ber_dupbv_x( &dnval, val, ctx );
				dnval.bv_len -= uidval.bv_len + 1;
				dnval.bv_val[dnval.bv_len] = '\0';
921

922
			} else {
923
				BER_BVZERO( &uidval );
924
			}
925
926
927
		}

		rc = dnPretty( syntax, &dnval, out, ctx );
928
929
930
931
932
933
		if ( dnval.bv_val != val->bv_val ) {
			slap_sl_free( dnval.bv_val, ctx );
		}
		if( rc != LDAP_SUCCESS ) {
			return rc;
		}
934

935
		if( !BER_BVISNULL( &uidval ) ) {
936
937
938
			int	i, c, got1;
			char	*tmp;

939
940
			tmp = slap_sl_realloc( out->bv_val, out->bv_len 
				+ STRLENOF( "#" ) + uidval.bv_len + 1,
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
941
				ctx );
942
943
944
945
			if( tmp == NULL ) {
				ber_memfree_x( out->bv_val, ctx );
				return LDAP_OTHER;
			}
946
			out->bv_val = tmp;
947
			out->bv_val[out->bv_len++] = '#';
948
			out->bv_val[out->bv_len++] = '\'';
949
950

			got1 = uidval.bv_len < sizeof("'0'B"); 
951
			for( i = 1; i < uidval.bv_len - 2; i++ ) {
952
953
954
955
956
957
958
959
				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;
960
						break;
961
962
963
				}
			}

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

987
988
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

Pierangelo Masarati's avatar
Pierangelo Masarati committed
989
990
	ber_dupbv_x( &out, val, ctx );
	if ( BER_BVISEMPTY( &out ) ) {
991
992
993
		*normalized = out;

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
994
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
995

996
		uid.bv_val = strrchr( out.bv_val, '#' );
997
		if ( !BER_BVISNULL( &uid ) ) {
998
999
1000
1001
1002
1003
1004
1005
			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 {
1006
				BER_BVZERO( &uid );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1007
1008
1009
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1010
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1011
1012

		if( rc != LDAP_SUCCESS ) {
Pierangelo Masarati's avatar
Pierangelo Masarati committed
1013
			slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1014
1015
1016
			return LDAP_INVALID_SYNTAX;
		}

1017
		if( !BER_BVISNULL( &uid ) ) {
1018
1019
1020
			char	*tmp;

			tmp = ch_realloc( normalized->bv_val,
1021
1022
				normalized->bv_len + uid.bv_len
				+ STRLENOF("#") + 1 );
1023
1024
1025
1026
1027
1028
			if ( tmp == NULL ) {
				ber_memfree_x( normalized->bv_val, ctx );
				return LDAP_OTHER;
			}

			normalized->bv_val = tmp;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041

			/* 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
1042
		slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1043
1044
1045
1046
1047
	}

	return LDAP_SUCCESS;
}

1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
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;
1059
	struct berval assertedDN = *asserted;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1060
1061
1062
	struct berval assertedUID = BER_BVNULL;
	struct berval valueDN = BER_BVNULL;
	struct berval valueUID = BER_BVNULL;
1063
	int approx = ((flags & SLAP_MR_EQUALITY_APPROX) == SLAP_MR_EQUALITY_APPROX);
1064

1065
	if ( !BER_BVISEMPTY( asserted ) ) {
1066
1067
1068
1069
1070
		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 );
1071

1072
1073
			if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
				assertedDN.bv_len -= assertedUID.bv_len + 1;
1074

1075
1076
1077
			} else {
				BER_BVZERO( &assertedUID );
			}
1078
1079
1080
		}
	}

1081
	if ( !BER_BVISEMPTY( value ) ) {
1082
1083
		valueDN = *value;

1084
1085
1086
1087
1088
		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 );
1089

1090
1091
			if ( bitStringValidate( NULL, &valueUID ) == LDAP_SUCCESS ) {
				valueDN.bv_len -= valueUID.bv_len + 1;
1092

1093
1094
1095
			} else {
				BER_BVZERO( &valueUID );
			}
1096
1097
1098
1099
		}
	}

	if( valueUID.bv_len && assertedUID.bv_len ) {
1100
1101
1102
1103
1104
1105
		match = valueUID.bv_len - assertedUID.bv_len;
		if ( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}

1106
1107
1108
1109
1110
		match = memcmp( valueUID.bv_val, assertedUID.bv_val, valueUID.bv_len );
		if( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120

	} 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;
1121
1122
1123
1124
1125
	}

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

1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
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( &assertedUID );
			}
		}
	}

	return octetStringFilter( use, flags, syntax, mr, prefix,
		&assertedDN, keysp, ctx );
}


Kurt Zeilenga's avatar
Kurt Zeilenga committed
1214
1215
1216
1217
1218
1219
/*
 * Handling boolean syntax and matching is quite rigid.
 * A more flexible approach would be to allow a variety
 * of strings to be normalized and prettied into TRUE
 * and FALSE.
 */
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
static int
booleanValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */

	if( in->bv_len == 4 ) {
1230
		if( bvmatch( in, &slap_true_bv ) ) {