schema_init.c 110 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-2006 The OpenLDAP Foundation.
Kurt Zeilenga's avatar
Kurt Zeilenga committed
6
7
8
9
10
11
12
13
14
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted only as authorized by the OpenLDAP
 * Public License.
 *
 * A copy of this license is available in the file LICENSE in the
 * top-level directory of the distribution or, alternatively, at
 * <http://www.OpenLDAP.org/license.html>.
15
16
17
18
19
 */

#include "portable.h"

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

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

#include "slap.h"
30

31
32
#include "ldap_utf8.h"

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

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

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

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

70
71
72
/* FIXME: temporary */
#define authzMatch				octetStringMatch

73
74
75
76
77
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;

78
79
80
ldap_pvt_thread_mutex_t	ad_undef_mutex;
ldap_pvt_thread_mutex_t	oc_undef_mutex;

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

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

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

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

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

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

	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

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

Howard Chu's avatar
Howard Chu committed
170
171
static void
hashPreset(
172
173
174
175
	HASH_CONTEXT *HASHcontext,
	struct berval *prefix,
	char pre,
	Syntax *syntax,
Howard Chu's avatar
Howard Chu committed
176
	MatchingRule *mr)
177
178
179
180
181
182
183
184
185
186
187
188
{
	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);
	return;
}

Howard Chu's avatar
Howard Chu committed
189
190
191
192
193
194
195
196
197
198
199
200
static void
hashIter(
	HASH_CONTEXT *HASHcontext,
	unsigned char *HASHdigest,
	unsigned char *value,
	int len)
{
	HASH_CONTEXT ctx = *HASHcontext;
	HASH_Update( &ctx, value, len );
	HASH_Final( HASHdigest, &ctx );
}

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

221
	for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
222
223
224
		/* just count them */
	}

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

228
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
229

230
231
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
232

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

240
	BER_BVZERO( &keys[i] );
241
242
243
244
245
246
247

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

267
268
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
269

270
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
271

Howard Chu's avatar
Howard Chu committed
272
273
274
	hashPreset( &HASHcontext, prefix, 0, syntax, mr );
	hashIter( &HASHcontext, HASHdigest,
		(unsigned char *)value->bv_val, value->bv_len );
275

Howard Chu's avatar
Howard Chu committed
276
	ber_dupbv_x( keys, &digest, ctx );
277
	BER_BVZERO( &keys[1] );
278
279
280
281
282

	*keysp = keys;

	return LDAP_SUCCESS;
}
283

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

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

312
313
	if ( !BER_BVISNULL( &sub->sa_initial ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
314
315
			match = 1;
			goto done;
316
317
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
318
319
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
320

321
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
322
323
			goto done;
		}
324

Kurt Zeilenga's avatar
Kurt Zeilenga committed
325
326
327
328
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
329

330
331
	if ( !BER_BVISNULL( &sub->sa_final ) ) {
		if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
332
333
334
			match = 1;
			goto done;
		}
335

Kurt Zeilenga's avatar
Kurt Zeilenga committed
336
337
338
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
339

340
		if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
341
			goto done;
342
343
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
344
345
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
346
347
	}

348
349
	if ( sub->sa_any ) {
		for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
350
351
			ber_len_t idx;
			char *p;
352

Kurt Zeilenga's avatar
Kurt Zeilenga committed
353
retry:
354
			if ( inlen > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
355
356
357
358
				/* not enough length */
				match = 1;
				goto done;
			}
359

360
			if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
361
362
				continue;
			}
363

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
366
367
368
			if( p == NULL ) {
				match = 1;
				goto done;
369
370
			}

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

373
			if ( idx >= left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
374
375
376
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
377

Kurt Zeilenga's avatar
Kurt Zeilenga committed
378
379
			left.bv_val = p;
			left.bv_len -= idx;
380

381
			if ( sub->sa_any[i].bv_len > left.bv_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
382
383
384
385
				/* not enough left */
				match = 1;
				goto done;
			}
386

Kurt Zeilenga's avatar
Kurt Zeilenga committed
387
388
389
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
390

391
			if ( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
392
393
394
395
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
396

Kurt Zeilenga's avatar
Kurt Zeilenga committed
397
398
399
			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;
400
401
402
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
403
404
done:
	*matchp = match;
405
406
407
	return LDAP_SUCCESS;
}

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

Howard Chu's avatar
Howard Chu committed
424
	HASH_CONTEXT HCany, HCini, HCfin;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
425
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
426
	struct berval digest;
427
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
428
429
	digest.bv_len = sizeof(HASHdigest);

430
	nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
431

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

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
444
445
			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
446
447
448
449
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
450
451
452
453
454
			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
455
456
457
458
459
460
461
462
463
464
			}
		}
	}

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

465
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
466
467
468
469

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

Howard Chu's avatar
Howard Chu committed
470
471
472
473
474
475
476
	if ( flags & SLAP_INDEX_SUBSTR_ANY )
		hashPreset( &HCany, prefix, SLAP_INDEX_SUBSTR_PREFIX, syntax, mr );
	if( flags & SLAP_INDEX_SUBSTR_INITIAL )
		hashPreset( &HCini, prefix, SLAP_INDEX_SUBSTR_INITIAL_PREFIX, syntax, mr );
	if( flags & SLAP_INDEX_SUBSTR_FINAL )
		hashPreset( &HCfin, prefix, SLAP_INDEX_SUBSTR_FINAL_PREFIX, syntax, mr );

477
478
	nkeys = 0;
	for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
479
480
481
		ber_len_t j,max;

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
482
			( values[i].bv_len >= index_substr_any_len ) )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
483
		{
484
			max = values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
485
486

			for( j=0; j<max; j++ ) {
Howard Chu's avatar
Howard Chu committed
487
488
489
				hashIter( &HCany, HASHdigest,
					(unsigned char *)&values[i].bv_val[j],
					index_substr_any_len );
Howard Chu's avatar
Howard Chu committed
490
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
491
492
493
			}
		}

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

497
498
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
499

500
		for( j=index_substr_if_minlen; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
501
502

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
Howard Chu's avatar
Howard Chu committed
503
504
				hashIter( &HCini, HASHdigest,
					(unsigned char *)values[i].bv_val, j );
Howard Chu's avatar
Howard Chu committed
505
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
506
507
508
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
Howard Chu's avatar
Howard Chu committed
509
510
				hashIter( &HCfin, HASHdigest,
					(unsigned char *)&values[i].bv_val[values[i].bv_len-j], j );
Howard Chu's avatar
Howard Chu committed
511
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
512
513
514
515
516
517
			}

		}
	}

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

	sa = (SubstringsAssertion *) assertedValue;

551
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
552
		!BER_BVISNULL( &sa->sa_initial ) &&
553
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
554
555
	{
		nkeys++;
556
		if ( sa->sa_initial.bv_len > index_substr_if_maxlen &&
557
558
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
559
			nkeys += 1 + (sa->sa_initial.bv_len - index_substr_if_maxlen) / index_substr_any_step;
560
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
561
562
	}

563
	if ( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
564
		ber_len_t i;
565
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
566
			if( sa->sa_any[i].bv_len >= index_substr_any_len ) {
567
				/* don't bother accounting with stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
568
				nkeys += sa->sa_any[i].bv_len -
569
					( index_substr_any_len - 1 );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
570
571
572
573
			}
		}
	}

574
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
575
		!BER_BVISNULL( &sa->sa_final ) &&
576
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
577
578
	{
		nkeys++;
579
		if ( sa->sa_final.bv_len > index_substr_if_maxlen &&
580
581
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
582
			nkeys += 1 + (sa->sa_final.bv_len - index_substr_if_maxlen) / index_substr_any_step;
583
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
584
585
586
587
588
589
590
	}

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

591
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
592
593
594
595
596
	digest.bv_len = sizeof(HASHdigest);

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

597
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
598
599
	nkeys = 0;

600
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
601
		!BER_BVISNULL( &sa->sa_initial ) &&
602
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
603
604
605
606
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

607
608
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
609

Howard Chu's avatar
Howard Chu committed
610
611
612
		hashPreset( &HASHcontext, prefix, pre, syntax, mr );
		hashIter( &HASHcontext, HASHdigest,
			(unsigned char *)value->bv_val, klen );
Howard Chu's avatar
Howard Chu committed
613
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
614
615
616
617

		/* If initial is too long and we have subany indexed, use it
		 * to match the excess...
		 */
618
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
619
620
621
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
Howard Chu's avatar
Howard Chu committed
622
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
623
			for ( j=index_substr_if_maxlen-1; j <= value->bv_len - index_substr_any_len; j+=index_substr_any_step )
624
			{
Howard Chu's avatar
Howard Chu committed
625
626
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], index_substr_any_len );
627
628
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_ANY && sa->sa_any != NULL ) {
		ber_len_t i, j;
		pre = SLAP_INDEX_SUBSTR_PREFIX;
635
		klen = index_substr_any_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
636

637
		for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
638
			if( sa->sa_any[i].bv_len < index_substr_any_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
639
640
641
642
643
				continue;
			}

			value = &sa->sa_any[i];

Howard Chu's avatar
Howard Chu committed
644
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
645
			for(j=0;
646
647
				j <= value->bv_len - index_substr_any_len;
				j += index_substr_any_step )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
648
			{
Howard Chu's avatar
Howard Chu committed
649
650
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], klen ); 
Howard Chu's avatar
Howard Chu committed
651
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
652
653
654
655
			}
		}
	}

656
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
657
		!BER_BVISNULL( &sa->sa_final ) &&
658
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
659
660
661
662
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

663
664
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
665

Howard Chu's avatar
Howard Chu committed
666
667
668
		hashPreset( &HASHcontext, prefix, pre, syntax, mr );
		hashIter( &HASHcontext, HASHdigest,
			(unsigned char *)&value->bv_val[value->bv_len-klen], klen );
Howard Chu's avatar
Howard Chu committed
669
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
670
671
672
673

		/* If final is too long and we have subany indexed, use it
		 * to match the excess...
		 */
674
		if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
675
676
677
		{
			ber_len_t j;
			pre = SLAP_INDEX_SUBSTR_PREFIX;
Howard Chu's avatar
Howard Chu committed
678
			hashPreset( &HASHcontext, prefix, pre, syntax, mr);
679
			for ( j=0; j <= value->bv_len - index_substr_if_maxlen; j+=index_substr_any_step )
680
			{
Howard Chu's avatar
Howard Chu committed
681
682
				hashIter( &HASHcontext, HASHdigest,
					(unsigned char *)&value->bv_val[j], index_substr_any_len );
683
684
685
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
			}
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
686
687
688
	}

	if( nkeys > 0 ) {
689
		BER_BVZERO( &keys[nkeys] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
		*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
714
715
716
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
717
718
719
720
	 * example: '0101111101'B
	 */
	
	if( in->bv_val[0] != '\'' ||
721
722
		in->bv_val[in->bv_len - 2] != '\'' ||
		in->bv_val[in->bv_len - 1] != 'B' )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
723
724
725
726
	{
		return LDAP_INVALID_SYNTAX;
	}

727
	for( i = in->bv_len - 3; i > 0; i-- ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
728
729
730
731
732
733
734
735
		if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
			return LDAP_INVALID_SYNTAX;
		}
	}

	return LDAP_SUCCESS;
}

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
862
863
864
865
866
867
868
869
870
871
872
873
874
875
/*
 * 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
876
877
878
879
880
881
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
882
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
883

884
	if( BER_BVISEMPTY( in ) ) return LDAP_SUCCESS;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
885
886
887
888

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

889
890
	/* if there's a "#", try bitStringValidate()... */
	uid.bv_val = strrchr( dn.bv_val, '#' );
891
	if ( !BER_BVISNULL( &uid ) ) {
892
893
894
895
896
897
898
899
900
		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
901
902
903
904
905
906
907
908
909
		}
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

910
911
912
913
914
915
916
int
nameUIDPretty(
	Syntax *syntax,
	struct berval *val,
	struct berval *out,
	void *ctx )
{
917
918
	assert( val != NULL );
	assert( out != NULL );
919
920
921
922


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

923
	if( BER_BVISEMPTY( val ) ) {
924
925
926
927
928
929
		ber_dupbv_x( out, val, ctx );

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

	} else {
930
931
932
		int		rc;
		struct berval	dnval = *val;
		struct berval	uidval = BER_BVNULL;
933

934
		uidval.bv_val = strrchr( val->bv_val, '#' );
935
		if ( !BER_BVISNULL( &uidval ) ) {
936
937
			uidval.bv_val++;
			uidval.bv_len = val->bv_len - ( uidval.bv_val - val->bv_val );
938

939
			rc = bitStringValidate( NULL, &uidval );
940

941
942
943
944
			if ( rc == LDAP_SUCCESS ) {
				ber_dupbv_x( &dnval, val, ctx );
				dnval.bv_len -= uidval.bv_len + 1;
				dnval.bv_val[dnval.bv_len] = '\0';
945

946
			} else {
947
				BER_BVZERO( &uidval );
948
			}
949
950
951
		}

		rc = dnPretty( syntax, &dnval, out, ctx );
952
953
954
955
956
957
		if ( dnval.bv_val != val->bv_val ) {
			slap_sl_free( dnval.bv_val, ctx );
		}
		if( rc != LDAP_SUCCESS ) {
			return rc;
		}
958

959
		if( !BER_BVISNULL( &uidval ) ) {
960
961
962
			int	i, c, got1;
			char	*tmp;

963
964
			tmp = slap_sl_realloc( out->bv_val, out->bv_len 
				+ STRLENOF( "#" ) + uidval.bv_len + 1,
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
965
				ctx );
966
967
968
969
			if( tmp == NULL ) {
				ber_memfree_x( out->bv_val, ctx );
				return LDAP_OTHER;
			}
970
			out->bv_val = tmp;
971
			out->bv_val[out->bv_len++] = '#';
972
			out->bv_val[out->bv_len++] = '\'';
973
974

			got1 = uidval.bv_len < sizeof("'0'B"); 
975
			for( i = 1; i < uidval.bv_len - 2; i++ ) {
976
977
978
979
980
981
982
983
				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;
984
						break;
985
986
987
				}
			}

988
989
			out->bv_val[out->bv_len++] = '\'';
			out->bv_val[out->bv_len++] = 'B';
990
991
992
993
994
995
996
997
998
			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
999
1000
1001
1002
1003
1004
static int
uniqueMemberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
1005
1006
	struct berval *normalized,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1007
1008
1009
1010
{
	struct berval out;
	int rc;

1011
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
1012

Pierangelo Masarati's avatar
Pierangelo Masarati committed
1013
1014
	ber_dupbv_x( &out, val, ctx );
	if ( BER_BVISEMPTY( &out ) ) {
1015
1016
1017
		*normalized = out;

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1018
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1019

1020
		uid.bv_val = strrchr( out.bv_val, '#' );
1021
		if ( !BER_BVISNULL( &uid ) ) {
1022
1023
1024
1025
1026
1027
1028
1029
			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 {
1030
				BER_BVZERO( &uid );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1031
1032
1033
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1034
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1035
1036

		if( rc != LDAP_SUCCESS ) {
Pierangelo Masarati's avatar
Pierangelo Masarati committed
1037
			slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1038
1039
1040
			return LDAP_INVALID_SYNTAX;
		}

1041
		if( !BER_BVISNULL( &uid ) ) {
1042
1043
1044
			char	*tmp;

			tmp = ch_realloc( normalized->bv_val,
1045
1046
				normalized->bv_len + uid.bv_len
				+ STRLENOF("#") + 1 );
1047
1048
1049
1050
1051
1052
			if ( tmp == NULL ) {
				ber_memfree_x( normalized->bv_val, ctx );
				return LDAP_OTHER;
			}

			normalized->bv_val = tmp;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065

			/* 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
1066
		slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1067
1068
1069
1070
1071
	}

	return LDAP_SUCCESS;
}

1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
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;
1083
	struct berval assertedDN = *asserted;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1084
	struct berval assertedUID = BER_BVNULL;
Howard Chu's avatar
Howard Chu committed
1085
	struct berval valueDN = *value;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1086
	struct berval valueUID = BER_BVNULL;
1087
	int approx = ((flags & SLAP_MR_EQUALITY_APPROX) == SLAP_MR_EQUALITY_APPROX);
1088

1089
	if ( !BER_BVISEMPTY( asserted ) ) {
1090
1091
1092
1093
1094
		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 );
1095

1096
1097
			if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
				assertedDN.bv_len -= assertedUID.bv_len + 1;
1098

1099
1100
1101
			} else {
				BER_BVZERO( &assertedUID );
			}
1102
1103
1104
		}
	}

1105
	if ( !BER_BVISEMPTY( value ) ) {
1106

1107
1108
1109
1110
1111
		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 );
1112

1113
1114
			if ( bitStringValidate( NULL, &valueUID ) == LDAP_SUCCESS ) {
				valueDN.bv_len -= valueUID.bv_len + 1;
1115

1116
1117
1118
			} else {
				BER_BVZERO( &valueUID );
			}
1119
1120
1121
1122
		}
	}

	if( valueUID.bv_len && assertedUID.bv_len ) {
1123
1124
1125
1126
1127
1128
		match = valueUID.bv_len - assertedUID.bv_len;
		if ( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}

1129
1130
1131
1132
1133
		match = memcmp( valueUID.bv_val, assertedUID.bv_val, valueUID.bv_len );
		if( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143

	} 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;
1144
1145
1146
1147
1148
	}

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

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