schema_init.c 85 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-2004 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
44
45
46
47
48
#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)
49

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
62
63
64
65
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
66
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
67
68
69
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
70

Kurt Zeilenga's avatar
Kurt Zeilenga committed
71
72
73
74
75
76
77
static int
blobValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_SUCCESS;
78
}
79

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
80
81
#define berValidate blobValidate

82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
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;
98
	unsigned char *p = (unsigned char *)in->bv_val;
99
100
101
102
103
104
105
106
107
108
 
	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

109
110
111
static int
octetStringMatch(
	int *matchp,
112
	slap_mask_t flags,
113
114
115
116
117
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
118
119
	struct berval *asserted = (struct berval *) assertedValue;
	int match = value->bv_len - asserted->bv_len;
120
121

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
122
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
123
124
125
126
127
128
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

129
130
131
132
133
134
135
136
137
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
138
	struct berval *asserted = (struct berval *) assertedValue;
139
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
140
	ber_len_t av_len = asserted->bv_len;
141

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
142
	int match = memcmp( value->bv_val, asserted->bv_val,
143
		(v_len < av_len ? v_len : av_len) );
144
145
146

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

147
148
149
150
	*matchp = match;
	return LDAP_SUCCESS;
}

151
/* Index generation function */
152
int octetStringIndexer(
153
154
	slap_mask_t use,
	slap_mask_t flags,
155
156
157
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
158
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
159
160
	BerVarray *keysp,
	void *ctx )
161
162
163
{
	int i;
	size_t slen, mlen;
164
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
165
166
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
167
	struct berval digest;
168
	digest.bv_val = (char *)HASHdigest;
169
	digest.bv_len = sizeof(HASHdigest);
170

171
	for( i=0; values[i].bv_val != NULL; i++ ) {
172
173
174
		/* just count them */
	}

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

178
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
179

180
181
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
182

183
	for( i=0; values[i].bv_val != NULL; i++ ) {
184
		HASH_Init( &HASHcontext );
185
		if( prefix != NULL && prefix->bv_len > 0 ) {
186
			HASH_Update( &HASHcontext,
187
188
				(unsigned char *)prefix->bv_val,
				prefix->bv_len );
189
		}
190
		HASH_Update( &HASHcontext,
191
			(unsigned char *)syntax->ssyn_oid, slen );
192
		HASH_Update( &HASHcontext,
193
			(unsigned char *)mr->smr_oid, mlen );
194
		HASH_Update( &HASHcontext,
195
			(unsigned char *)values[i].bv_val, values[i].bv_len );
196
		HASH_Final( HASHdigest, &HASHcontext );
197

Howard Chu's avatar
Howard Chu committed
198
		ber_dupbv_x( &keys[i], &digest, ctx );
199
200
	}

201
	keys[i].bv_val = NULL;
202
	keys[i].bv_len = 0;
203
204
205
206
207
208
209

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
210
int octetStringFilter(
211
212
	slap_mask_t use,
	slap_mask_t flags,
213
214
215
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
216
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
217
218
	BerVarray *keysp,
	void *ctx )
219
220
{
	size_t slen, mlen;
221
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
222
223
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
224
	struct berval *value = (struct berval *) assertedValue;
225
	struct berval digest;
226
	digest.bv_val = (char *)HASHdigest;
227
	digest.bv_len = sizeof(HASHdigest);
228

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

232
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
233

234
	HASH_Init( &HASHcontext );
235
	if( prefix != NULL && prefix->bv_len > 0 ) {
236
		HASH_Update( &HASHcontext,
237
			(unsigned char *)prefix->bv_val, prefix->bv_len );
238
	}
239
	HASH_Update( &HASHcontext,
240
		(unsigned char *)syntax->ssyn_oid, slen );
241
	HASH_Update( &HASHcontext,
242
		(unsigned char *)mr->smr_oid, mlen );
243
	HASH_Update( &HASHcontext,
244
		(unsigned char *)value->bv_val, value->bv_len );
245
	HASH_Final( HASHdigest, &HASHcontext );
246

Howard Chu's avatar
Howard Chu committed
247
	ber_dupbv_x( keys, &digest, ctx );
248
	keys[1].bv_val = NULL;
249
	keys[1].bv_len = 0;
250
251
252
253
254

	*keysp = keys;

	return LDAP_SUCCESS;
}
255

256
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
257
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
258
259
	int *matchp,
	slap_mask_t flags,
260
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
261
262
263
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
264
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
265
266
267
268
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
269
	ber_len_t inlen = 0;
270

Kurt Zeilenga's avatar
Kurt Zeilenga committed
271
272
273
	/* Add up asserted input length */
	if( sub->sa_initial.bv_val ) {
		inlen += sub->sa_initial.bv_len;
274
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
275
276
277
278
279
280
281
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i].bv_val != NULL; i++) {
			inlen += sub->sa_any[i].bv_len;
		}
	}
	if( sub->sa_final.bv_val ) {
		inlen += sub->sa_final.bv_len;
282
283
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
284
285
286
287
	if( sub->sa_initial.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
288
289
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
290
291
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
292

Kurt Zeilenga's avatar
Kurt Zeilenga committed
293
294
295
		if( match != 0 ) {
			goto done;
		}
296

Kurt Zeilenga's avatar
Kurt Zeilenga committed
297
298
299
300
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
301

Kurt Zeilenga's avatar
Kurt Zeilenga committed
302
303
304
305
306
	if( sub->sa_final.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
307

Kurt Zeilenga's avatar
Kurt Zeilenga committed
308
309
310
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
311

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
316
317
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
318
319
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
320
321
322
323
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i].bv_val; i++) {
			ber_len_t idx;
			char *p;
324

Kurt Zeilenga's avatar
Kurt Zeilenga committed
325
326
327
328
329
330
retry:
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}
331

Kurt Zeilenga's avatar
Kurt Zeilenga committed
332
333
334
			if( sub->sa_any[i].bv_len == 0 ) {
				continue;
			}
335

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
338
339
340
			if( p == NULL ) {
				match = 1;
				goto done;
341
342
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
343
			idx = p - left.bv_val;
344

Kurt Zeilenga's avatar
Kurt Zeilenga committed
345
346
347
348
			if( idx >= left.bv_len ) {
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
349

Kurt Zeilenga's avatar
Kurt Zeilenga committed
350
351
			left.bv_val = p;
			left.bv_len -= idx;
352

Kurt Zeilenga's avatar
Kurt Zeilenga committed
353
354
355
356
357
			if( sub->sa_any[i].bv_len > left.bv_len ) {
				/* not enough left */
				match = 1;
				goto done;
			}
358

Kurt Zeilenga's avatar
Kurt Zeilenga committed
359
360
361
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
362

Kurt Zeilenga's avatar
Kurt Zeilenga committed
363
364
365
366
367
			if( match != 0 ) {
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
368

Kurt Zeilenga's avatar
Kurt Zeilenga committed
369
370
371
			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;
372
373
374
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
375
376
done:
	*matchp = match;
377
378
379
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
380
381
/* Substrings Index generation function */
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
382
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
383
384
385
386
387
388
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
389
390
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
391
392
393
394
395
{
	ber_len_t i, j, nkeys;
	size_t slen, mlen;
	BerVarray keys;

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
396
397
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
398
	struct berval digest;
399
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
400
401
402
403
404
405
406
	digest.bv_len = sizeof(HASHdigest);

	nkeys=0;

	for( i=0; values[i].bv_val != NULL; i++ ) {
		/* count number of indices to generate */
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
407
408
409
410
411
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_IF_MAXLEN ) {
				nkeys += SLAP_INDEX_SUBSTR_IF_MAXLEN -
					(SLAP_INDEX_SUBSTR_IF_MINLEN - 1);
			} else if( values[i].bv_len >= SLAP_INDEX_SUBSTR_IF_MINLEN ) {
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_IF_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
412
413
414
415
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
416
417
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_ANY_LEN ) {
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_ANY_LEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
418
419
420
421
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
422
423
424
425
426
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_IF_MAXLEN ) {
				nkeys += SLAP_INDEX_SUBSTR_IF_MAXLEN -
					( SLAP_INDEX_SUBSTR_IF_MINLEN - 1);
			} else if( values[i].bv_len >= SLAP_INDEX_SUBSTR_IF_MINLEN ) {
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_IF_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
427
428
429
430
431
432
433
434
435
436
			}
		}
	}

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

437
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
438
439
440
441
442
443
444
445
446

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

	nkeys=0;
	for( i=0; values[i].bv_val != NULL; i++ ) {
		ber_len_t j,max;

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
447
			( values[i].bv_len >= SLAP_INDEX_SUBSTR_ANY_LEN ) )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
448
449
		{
			char pre = SLAP_INDEX_SUBSTR_PREFIX;
450
			max = values[i].bv_len - (SLAP_INDEX_SUBSTR_ANY_LEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
451
452
453
454
455

			for( j=0; j<max; j++ ) {
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
456
						(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
457
458
459
				}

				HASH_Update( &HASHcontext,
460
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
461
				HASH_Update( &HASHcontext,
462
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
463
				HASH_Update( &HASHcontext,
464
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
465
				HASH_Update( &HASHcontext,
466
					(unsigned char *)&values[i].bv_val[j],
467
					SLAP_INDEX_SUBSTR_ANY_LEN );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
468
469
				HASH_Final( HASHdigest, &HASHcontext );

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
475
		/* skip if too short */ 
		if( values[i].bv_len < SLAP_INDEX_SUBSTR_IF_MINLEN ) continue;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
476

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

		for( j=SLAP_INDEX_SUBSTR_IF_MINLEN; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
481
482
483
484
485
486
487
			char pre;

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
				pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
488
						(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
489
490
				}
				HASH_Update( &HASHcontext,
491
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
492
				HASH_Update( &HASHcontext,
493
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
494
				HASH_Update( &HASHcontext,
495
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
496
				HASH_Update( &HASHcontext,
497
					(unsigned char *)values[i].bv_val, j );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
498
499
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
500
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
501
502
503
504
505
506
507
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
508
						(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
509
510
				}
				HASH_Update( &HASHcontext,
511
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
512
				HASH_Update( &HASHcontext,
513
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
514
				HASH_Update( &HASHcontext,
515
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
516
				HASH_Update( &HASHcontext,
517
					(unsigned char *)&values[i].bv_val[values[i].bv_len-j], j );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
518
519
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
520
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
			}

		}
	}

	if( nkeys > 0 ) {
		keys[nkeys].bv_val = NULL;
		*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
545
546
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
547
548
549
550
551
552
{
	SubstringsAssertion *sa;
	char pre;
	ber_len_t nkeys = 0;
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
553
554
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
555
556
557
558
559
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

560
561
562
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
		sa->sa_initial.bv_val != NULL &&
		sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_IF_MINLEN )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
563
564
565
566
567
568
569
	{
		nkeys++;
	}

	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
		ber_len_t i;
		for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
570
571
			if( sa->sa_any[i].bv_len >= SLAP_INDEX_SUBSTR_ANY_LEN ) {
				/* don't bother accounting with stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
572
				nkeys += sa->sa_any[i].bv_len -
573
					( SLAP_INDEX_SUBSTR_ANY_LEN - 1 );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
574
575
576
577
			}
		}
	}

578
579
580
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
		sa->sa_final.bv_val != NULL &&
		sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_IF_MINLEN )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
581
582
583
584
585
586
587
588
589
	{
		nkeys++;
	}

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

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

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

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

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

606
607
		klen = SLAP_INDEX_SUBSTR_IF_MAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_IF_MAXLEN : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
608
609
610
611

		HASH_Init( &HASHcontext );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			HASH_Update( &HASHcontext,
612
				(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
613
614
		}
		HASH_Update( &HASHcontext,
615
			(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
616
		HASH_Update( &HASHcontext,
617
			(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
618
		HASH_Update( &HASHcontext,
619
			(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
620
		HASH_Update( &HASHcontext,
621
			(unsigned char *)value->bv_val, klen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
622
623
		HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
624
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
625
626
627
628
629
	}

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

		for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
633
			if( sa->sa_any[i].bv_len < SLAP_INDEX_SUBSTR_ANY_LEN ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
634
635
636
637
638
639
				continue;
			}

			value = &sa->sa_any[i];

			for(j=0;
640
641
				j <= value->bv_len - SLAP_INDEX_SUBSTR_ANY_LEN;
				j += SLAP_INDEX_SUBSTR_ANY_STEP )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
642
643
644
645
			{
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
646
						(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
647
648
				}
				HASH_Update( &HASHcontext,
649
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
650
				HASH_Update( &HASHcontext,
651
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
652
				HASH_Update( &HASHcontext,
653
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
654
				HASH_Update( &HASHcontext,
655
					(unsigned char *)&value->bv_val[j], klen ); 
Kurt Zeilenga's avatar
Kurt Zeilenga committed
656
657
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
658
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
659
660
661
662
			}
		}
	}

663
664
665
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
		sa->sa_final.bv_val != NULL &&
		sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_IF_MINLEN )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
666
667
668
669
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

670
671
		klen = SLAP_INDEX_SUBSTR_IF_MAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_IF_MAXLEN : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
672
673
674
675

		HASH_Init( &HASHcontext );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			HASH_Update( &HASHcontext,
676
				(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
677
678
		}
		HASH_Update( &HASHcontext,
679
			(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
680
		HASH_Update( &HASHcontext,
681
			(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
682
		HASH_Update( &HASHcontext,
683
			(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
684
		HASH_Update( &HASHcontext,
685
			(unsigned char *)&value->bv_val[value->bv_len-klen], klen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
686
687
		HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
688
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
	}

	if( nkeys > 0 ) {
		keys[nkeys].bv_val = NULL;
		*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
717
718
719
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
	 * example: '0101111101'B
	 */
	
	if( in->bv_val[0] != '\'' ||
		in->bv_val[in->bv_len-2] != '\'' ||
		in->bv_val[in->bv_len-1] != 'B' )
	{
		return LDAP_INVALID_SYNTAX;
	}

	for( i=in->bv_len-3; i>0; i-- ) {
		if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
			return LDAP_INVALID_SYNTAX;
		}
	}

	return LDAP_SUCCESS;
}

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
876
877
878
/*
 * 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
879
880
881
882
883
884
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
885
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
886
887
888
889
890
891

	if( in->bv_len == 0 ) return LDAP_SUCCESS;

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

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

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
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 );

	if( val->bv_len == 0 ) {
		ber_dupbv_x( out, val, ctx );

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

	} else {
933
934
935
		int		rc;
		struct berval	dnval = *val;
		struct berval	uidval = BER_BVNULL;
936

937
938
939
940
		uidval.bv_val = strrchr( val->bv_val, '#' );
		if ( uidval.bv_val ) {
			uidval.bv_val++;
			uidval.bv_len = val->bv_len - ( uidval.bv_val - val->bv_val );
941

942
			rc = bitStringValidate( NULL, &uidval );
943

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

949
950
951
			} else {
				uidval.bv_val = NULL;
			}
952
953
954
		}

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

		if( uidval.bv_val ) {
963
964
965
			int	i, c, got1;
			char	*tmp;

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

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

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

1014
1015
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

Pierangelo Masarati's avatar
Pierangelo Masarati committed
1016
1017
	ber_dupbv_x( &out, val, ctx );
	if ( BER_BVISEMPTY( &out ) ) {
1018
1019
1020
		*normalized = out;

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1021
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1022

1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
		uid.bv_val = strrchr( out.bv_val, '#' );
		if ( uid.bv_val ) {
			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 {
				uid.bv_val = NULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1034
1035
1036
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1037
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1038
1039

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

1044
1045
1046
1047
		if( uid.bv_val ) {
			char	*tmp;

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

			normalized->bv_val = tmp;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068

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

	return LDAP_SUCCESS;
}

1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
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;
1086
	struct berval assertedDN = *asserted;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1087
1088
1089
	struct berval assertedUID = BER_BVNULL;
	struct berval valueDN = BER_BVNULL;
	struct berval valueUID = BER_BVNULL;
1090

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

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

1101
1102
1103
			} else {
				BER_BVZERO( &assertedUID );
			}
1104
1105
1106
		}
	}

1107
	if ( !BER_BVISEMPTY( value ) ) {
1108
1109
		valueDN = *value;

1110
1111
1112
1113
1114
		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 );
1115

1116
1117
			if ( bitStringValidate( NULL, &valueUID ) == LDAP_SUCCESS ) {
				valueDN.bv_len -= valueUID.bv_len + 1;
1118

1119
1120
1121
			} else {
				BER_BVZERO( &valueUID );
			}
1122
1123
1124
1125
		}
	}

	if( valueUID.bv_len && assertedUID.bv_len ) {
1126
1127
1128
1129
1130
1131
		match = valueUID.bv_len - assertedUID.bv_len;
		if ( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1142
1143
1144
1145
1146
1147
/*
 * 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.
 */
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
static int
booleanValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */

	if( in->bv_len == 4 ) {
1158
		if( bvmatch( in, &slap_true_bv ) ) {
1159
1160
1161
			return LDAP_SUCCESS;
		}
	} else if( in->bv_len == 5 ) {
1162
		if( bvmatch( in, &slap_false_bv ) ) {
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
			return LDAP_SUCCESS;
		}
	}

	return LDAP_INVALID_SYNTAX;
}

static int
booleanMatch(
	int *matchp,
1173
	slap_mask_t flags,
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	/* simplistic matching allowed by rigid validation */
	struct berval *asserted = (struct berval *) assertedValue;
	*matchp = value->bv_len != asserted->bv_len;
	return LDAP_SUCCESS;
}

1185
1186
1187
1188
1189
/*-------------------------------------------------------------------
LDAP/X.500 string syntax / matching rules have a few oddities.  This
comment attempts to detail how slapd(8) treats them.

Summary:
1190
  StringSyntax		X.500	LDAP	Matching/Comments
1191
1192
  DirectoryString	CHOICE	UTF8	i/e + ignore insignificant spaces
  PrintableString	subset	subset	i/e + ignore insignificant spaces
1193
  PrintableString	subset	subset	i/e + ignore insignificant spaces
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
1194
  NumericString		subset	subset	ignore all spaces
1195
1196
1197
  IA5String			ASCII	ASCII	i/e + ignore insignificant spaces
  TeletexString		T.61	T.61	i/e + ignore insignificant spaces

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
1198
  TelephoneNumber	subset	subset	i + ignore all spaces and "-"
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208

  See draft-ietf-ldapbis-strpro for details (once published).


Directory String -
  In X.500(93), a directory string can be either a PrintableString,
  a bmpString, or a UniversalString (e.g., UCS (a subset of Unicode)).
  In later versions, more CHOICEs were added.  In all cases the string
  must be non-empty.

1209
  In LDAPv3, a directory string is a UTF-8 encoded UCS string.
1210
  A directory string cannot be zero length.
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256

  For matching, there are both case ignore and exact rules.  Both
  also require that "insignificant" spaces be ignored.
	spaces before the first non-space are ignored;
	spaces after the last non-space are ignored;
	spaces after a space are ignored.
  Note: by these rules (and as clarified in X.520), a string of only
  spaces is to be treated as if held one space, not empty (which
  would be a syntax error).

NumericString
  In ASN.1, numeric string is just a string of digits and spaces
  and could be empty.  However, in X.500, all attribute values of
  numeric string carry a non-empty constraint.  For example: