schema_init.c 93.6 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

Pierangelo Masarati's avatar
Pierangelo Masarati committed
53
54
#define	OpenLDAPaciMatch			NULL

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

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
95
96
#define berValidate blobValidate

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

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

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

	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

162
163
164
165
	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

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

217
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
218

219
220
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
221

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

228
	BER_BVZERO( &keys[i] );
229
230
231
232
233
234
235

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

255
256
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
257

258
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
259

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}
270

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
358
			idx = p - left.bv_val;
359

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

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

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

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

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

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

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

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

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

417
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
418

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

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

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

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

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

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

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

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

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

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

477
478
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
479

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

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

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

		}
	}

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

	sa = (SubstringsAssertion *) assertedValue;

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

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

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

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

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

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

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

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

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

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

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

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

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

			value = &sa->sa_any[i];

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

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

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

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

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

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

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

	return LDAP_SUCCESS;
}

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

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

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

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

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

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


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

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

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

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

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

917
			rc = bitStringValidate( NULL, &uidval );
918

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

924
			} else {
925
				BER_BVZERO( &uidval );
926
			}
927
928
929
		}

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

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

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

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

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

989
990
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

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

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
996
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
997

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

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

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

1019
		if( !BER_BVISNULL( &uid ) ) {
1020
1021
1022
			char	*tmp;

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

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

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

	return LDAP_SUCCESS;
}

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

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

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

1077
1078
1079
			} else {
				BER_BVZERO( &assertedUID );
			}
1080
1081
1082
		}
	}

1083
	if ( !BER_BVISEMPTY( value ) ) {
1084
1085
		valueDN = *value;

1086
1087
1088
1089
1090
		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 );
1091

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

1095
1096
1097
			} else {
				BER_BVZERO( &valueUID );
			}
1098
1099
1100
1101
		}
	}

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

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

	} 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;
1123
1124
1125
1126
1127
	}

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

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
1214
1215
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
1216
1217
1218
1219
1220
1221
/*
 * 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.
 */