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

62
63
64
65
66
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
67
68
69
70
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
71
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
72
73
74
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
75

Kurt Zeilenga's avatar
Kurt Zeilenga committed
76
77
78
79
80
81
82
static int
blobValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_SUCCESS;
83
}
84

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
85
86
#define berValidate blobValidate

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

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

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
127
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
128
129
130
131
132
133
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

134
135
136
137
138
139
140
141
142
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
143
	struct berval *asserted = (struct berval *) assertedValue;
144
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
145
	ber_len_t av_len = asserted->bv_len;
146

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
147
	int match = memcmp( value->bv_val, asserted->bv_val,
148
		(v_len < av_len ? v_len : av_len) );
149
150
151

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

152
153
154
155
	*matchp = match;
	return LDAP_SUCCESS;
}

156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
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;
}

179
/* Index generation function */
180
int octetStringIndexer(
181
182
	slap_mask_t use,
	slap_mask_t flags,
183
184
185
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
186
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
187
188
	BerVarray *keysp,
	void *ctx )
189
190
191
{
	int i;
	size_t slen, mlen;
192
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
193
194
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
195
	struct berval digest;
196
	digest.bv_val = (char *)HASHdigest;
197
	digest.bv_len = sizeof(HASHdigest);
198

199
	for( i=0; values[i].bv_val != NULL; i++ ) {
200
201
202
		/* just count them */
	}

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

206
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
207

208
209
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
210

211
	for( i=0; values[i].bv_val != NULL; i++ ) {
212
213
		hashDigestify( &HASHcontext, HASHdigest, prefix, 0,
			syntax, mr, (unsigned char *)values[i].bv_val, values[i].bv_len );
Howard Chu's avatar
Howard Chu committed
214
		ber_dupbv_x( &keys[i], &digest, ctx );
215
216
	}

217
	keys[i].bv_val = NULL;
218
	keys[i].bv_len = 0;
219
220
221
222
223
224
225

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

245
246
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
247

248
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
249

250
251
	hashDigestify( &HASHcontext, HASHdigest, prefix, 0,
		syntax, mr, (unsigned char *)value->bv_val, value->bv_len );
252

Howard Chu's avatar
Howard Chu committed
253
	ber_dupbv_x( keys, &digest, ctx );
254
	keys[1].bv_val = NULL;
255
	keys[1].bv_len = 0;
256
257
258
259
260

	*keysp = keys;

	return LDAP_SUCCESS;
}
261

262
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
263
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
264
265
	int *matchp,
	slap_mask_t flags,
266
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
267
268
269
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
270
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
271
272
273
274
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
275
	ber_len_t inlen = 0;
276

Kurt Zeilenga's avatar
Kurt Zeilenga committed
277
278
279
	/* Add up asserted input length */
	if( sub->sa_initial.bv_val ) {
		inlen += sub->sa_initial.bv_len;
280
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
281
282
283
284
285
286
287
	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;
288
289
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
290
291
292
293
	if( sub->sa_initial.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
294
295
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
296
297
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
298

Kurt Zeilenga's avatar
Kurt Zeilenga committed
299
300
301
		if( match != 0 ) {
			goto done;
		}
302

Kurt Zeilenga's avatar
Kurt Zeilenga committed
303
304
305
306
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
307

Kurt Zeilenga's avatar
Kurt Zeilenga committed
308
309
310
311
312
	if( sub->sa_final.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
313

Kurt Zeilenga's avatar
Kurt Zeilenga committed
314
315
316
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
317

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
322
323
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
324
325
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
326
327
328
329
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i].bv_val; i++) {
			ber_len_t idx;
			char *p;
330

Kurt Zeilenga's avatar
Kurt Zeilenga committed
331
332
333
334
335
336
retry:
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}
337

Kurt Zeilenga's avatar
Kurt Zeilenga committed
338
339
340
			if( sub->sa_any[i].bv_len == 0 ) {
				continue;
			}
341

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
344
345
346
			if( p == NULL ) {
				match = 1;
				goto done;
347
348
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
349
			idx = p - left.bv_val;
350

Kurt Zeilenga's avatar
Kurt Zeilenga committed
351
352
353
354
			if( idx >= left.bv_len ) {
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
355

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
359
360
361
362
363
			if( sub->sa_any[i].bv_len > left.bv_len ) {
				/* not enough left */
				match = 1;
				goto done;
			}
364

Kurt Zeilenga's avatar
Kurt Zeilenga committed
365
366
367
			match = memcmp( left.bv_val,
				sub->sa_any[i].bv_val,
				sub->sa_any[i].bv_len );
368

Kurt Zeilenga's avatar
Kurt Zeilenga committed
369
370
371
372
373
			if( match != 0 ) {
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
374

Kurt Zeilenga's avatar
Kurt Zeilenga committed
375
376
377
			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;
378
379
380
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
381
382
done:
	*matchp = match;
383
384
385
	return LDAP_SUCCESS;
}

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
402
403
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
404
	struct berval digest;
405
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
406
407
408
409
410
411
412
	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 ) {
413
414
415
416
417
			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
418
419
420
421
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
422
423
			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
424
425
426
427
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
428
429
430
431
432
			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
433
434
435
436
437
438
439
440
441
442
			}
		}
	}

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

443
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
444
445
446
447
448
449
450
451
452

	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 ) &&
453
			( values[i].bv_len >= index_substr_any_len ) )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
454
455
		{
			char pre = SLAP_INDEX_SUBSTR_PREFIX;
456
			max = values[i].bv_len - (index_substr_any_len - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
457
458

			for( j=0; j<max; j++ ) {
459
460
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
					syntax, mr, (unsigned char *)&values[i].bv_val[j], index_substr_any_len);
Howard Chu's avatar
Howard Chu committed
461
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
462
463
464
			}
		}

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

468
469
		max = index_substr_if_maxlen < values[i].bv_len
			? index_substr_if_maxlen : values[i].bv_len;
470

471
		for( j=index_substr_if_minlen; j<=max; j++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
472
473
474
475
			char pre;

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

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
483
484
				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
485
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
			}

		}
	}

	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
510
511
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
512
513
514
{
	SubstringsAssertion *sa;
	char pre;
515
	ber_len_t len, max, nkeys = 0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
516
517
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
518
519
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
520
521
522
523
524
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

525
526
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
		sa->sa_initial.bv_val != NULL &&
527
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
528
529
	{
		nkeys++;
530
531
532
533
534
		if ( sa->sa_initial.bv_len > index_substr_if_maxlen &&
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
			nkeys += (sa->sa_initial.bv_len - index_substr_if_maxlen) / index_substr_any_step;
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
535
536
537
538
539
	}

	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++ ) {
540
			if( sa->sa_any[i].bv_len >= index_substr_any_len ) {
541
				/* don't bother accounting with stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
542
				nkeys += sa->sa_any[i].bv_len -
543
					( index_substr_any_len - 1 );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
544
545
546
547
			}
		}
	}

548
549
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
		sa->sa_final.bv_val != NULL &&
550
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
551
552
	{
		nkeys++;
553
554
555
556
557
		if ( sa->sa_final.bv_len > index_substr_if_maxlen &&
			( flags & SLAP_INDEX_SUBSTR_ANY ))
		{
			nkeys += (sa->sa_final.bv_len - index_substr_if_maxlen) / index_substr_any_step;
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
558
559
560
561
562
563
564
	}

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

565
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
566
567
568
569
570
	digest.bv_len = sizeof(HASHdigest);

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

571
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
572
573
	nkeys = 0;

574
575
	if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
		sa->sa_initial.bv_val != NULL &&
576
		sa->sa_initial.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
577
578
579
580
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

581
582
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
583

584
585
		hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
			syntax, mr, (unsigned char *)value->bv_val, klen );
Howard Chu's avatar
Howard Chu committed
586
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601

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

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

		for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
610
			if( sa->sa_any[i].bv_len < index_substr_any_len ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
611
612
613
614
615
616
				continue;
			}

			value = &sa->sa_any[i];

			for(j=0;
617
618
				j <= value->bv_len - index_substr_any_len;
				j += index_substr_any_step )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
619
			{
620
621
				hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
					syntax, mr, (unsigned char *)&value->bv_val[j], klen ); 
Howard Chu's avatar
Howard Chu committed
622
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
623
624
625
626
			}
		}
	}

627
628
	if( flags & SLAP_INDEX_SUBSTR_FINAL &&
		sa->sa_final.bv_val != NULL &&
629
		sa->sa_final.bv_len >= index_substr_if_minlen )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
630
631
632
633
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

634
635
		klen = index_substr_if_maxlen < value->bv_len
			? index_substr_if_maxlen : value->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
636

637
638
		hashDigestify( &HASHcontext, HASHdigest, prefix, pre,
			syntax, mr, (unsigned char *)&value->bv_val[value->bv_len-klen], klen );
Howard Chu's avatar
Howard Chu committed
639
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654

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

	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
683
684
685
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
	 * 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;
}

705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
/*
 * 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
845
846
847
848
849
850
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
851
	struct berval dn, uid;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
852
853
854
855
856
857

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

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

858
859
860
861
862
863
864
865
866
867
868
869
	/* 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
870
871
872
873
874
875
876
877
878
		}
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

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


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

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

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

	} else {
899
900
901
		int		rc;
		struct berval	dnval = *val;
		struct berval	uidval = BER_BVNULL;
902

903
904
905
906
		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 );
907

908
			rc = bitStringValidate( NULL, &uidval );
909

910
911
912
913
			if ( rc == LDAP_SUCCESS ) {
				ber_dupbv_x( &dnval, val, ctx );
				dnval.bv_len -= uidval.bv_len + 1;
				dnval.bv_val[dnval.bv_len] = '\0';
914

915
916
917
			} else {
				uidval.bv_val = NULL;
			}
918
919
920
		}

		rc = dnPretty( syntax, &dnval, out, ctx );
921
922
923
924
925
926
		if ( dnval.bv_val != val->bv_val ) {
			slap_sl_free( dnval.bv_val, ctx );
		}
		if( rc != LDAP_SUCCESS ) {
			return rc;
		}
927
928

		if( uidval.bv_val ) {
929
930
931
			int	i, c, got1;
			char	*tmp;

932
933
			tmp = slap_sl_realloc( out->bv_val, out->bv_len 
				+ STRLENOF( "#" ) + uidval.bv_len + 1,
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
934
				ctx );
935
936
937
938
			if( tmp == NULL ) {
				ber_memfree_x( out->bv_val, ctx );
				return LDAP_OTHER;
			}
939
			out->bv_val = tmp;
940
			out->bv_val[out->bv_len++] = '#';
941
			out->bv_val[out->bv_len++] = '\'';
942
943

			got1 = uidval.bv_len < sizeof("'0'B"); 
944
			for( i = 1; i < uidval.bv_len - 2; i++ ) {
945
946
947
948
949
950
951
952
				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;
953
						break;
954
955
956
				}
			}

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

980
981
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

Pierangelo Masarati's avatar
Pierangelo Masarati committed
982
983
	ber_dupbv_x( &out, val, ctx );
	if ( BER_BVISEMPTY( &out ) ) {
984
985
986
		*normalized = out;

	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
987
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
988

989
990
991
992
993
994
995
996
997
998
999
		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
1000
1001
1002
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1003
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1004
1005

		if( rc != LDAP_SUCCESS ) {
Pierangelo Masarati's avatar
Pierangelo Masarati committed
1006
			slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1007
1008
1009
			return LDAP_INVALID_SYNTAX;
		}

1010
1011
1012
1013
		if( uid.bv_val ) {
			char	*tmp;

			tmp = ch_realloc( normalized->bv_val,
1014
1015
				normalized->bv_len + uid.bv_len
				+ STRLENOF("#") + 1 );
1016
1017
1018
1019
1020
1021
			if ( tmp == NULL ) {
				ber_memfree_x( normalized->bv_val, ctx );
				return LDAP_OTHER;
			}

			normalized->bv_val = tmp;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034

			/* 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
1035
		slap_sl_free( out.bv_val, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1036
1037
1038
1039
1040
	}

	return LDAP_SUCCESS;
}

1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
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;
1052
	struct berval assertedDN = *asserted;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1053
1054
1055
	struct berval assertedUID = BER_BVNULL;
	struct berval valueDN = BER_BVNULL;
	struct berval valueUID = BER_BVNULL;
1056

1057
	if ( !BER_BVISEMPTY( asserted ) ) {
1058
1059
1060
1061
1062
		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 );
1063

1064
1065
			if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
				assertedDN.bv_len -= assertedUID.bv_len + 1;
1066

1067
1068
1069
			} else {
				BER_BVZERO( &assertedUID );
			}
1070
1071
1072
		}
	}

1073
	if ( !BER_BVISEMPTY( value ) ) {
1074
1075
		valueDN = *value;

1076
1077
1078
1079
1080
		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 );
1081

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

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

	if( valueUID.bv_len && assertedUID.bv_len ) {
1092
1093
1094
1095
1096
1097
		match = valueUID.bv_len - assertedUID.bv_len;
		if ( match ) {
			*matchp = match;
			return LDAP_SUCCESS;
		}

1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
		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
1108
1109
1110
1111
1112
1113
/*
 * 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.
 */
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
static int
booleanValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */

	if( in->bv_len == 4 ) {
1124
		if( bvmatch( in, &slap_true_bv ) ) {
1125
1126
1127
			return LDAP_SUCCESS;
		}
	} else if( in->bv_len == 5 ) {
1128
		if( bvmatch( in, &slap_false_bv ) ) {
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
			return LDAP_SUCCESS;
		}
	}

	return LDAP_INVALID_SYNTAX;
}

static int
booleanMatch(
	int *matchp,
1139
	slap_mask_t flags,
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
	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;
}

1151
1152
1153
1154
1155
/*-------------------------------------------------------------------
LDAP/X.500 string syntax / matching rules have a few oddities.  This
comment attempts to detail how slapd(8) treats them.

Summary:
1156
  StringSyntax		X.500	LDAP	Matching/Comments
1157
1158
  DirectoryString	CHOICE	UTF8	i/e + ignore insignificant spaces
  PrintableString	subset	subset	i/e + ignore insignificant spaces
1159
  PrintableString	subset	subset	i/e + ignore insignificant spaces
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
1160
  NumericString		subset	subset	ignore all spaces
1161
1162
1163
  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
1164
  TelephoneNumber	subset	subset	i + ignore all spaces and "-"
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174

  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.

1175
  In LDAPv3, a directory string is a UTF-8 encoded UCS string.
1176
  A directory string cannot be zero length.
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222

  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:

	internationalISDNNumber ATTRIBUTE ::= {
		WITH SYNTAX InternationalISDNNumber
		EQUALITY MATCHING RULE numericStringMatch
		SUBSTRINGS MATCHING RULE numericStringSubstringsMatch
		ID id-at-internationalISDNNumber }
	InternationalISDNNumber ::=
	    NumericString (SIZE(1..ub-international-isdn-number))

  Unforunately, some assertion values are don't carry the same
  constraint (but its unclear how such an assertion could ever
  be true). In LDAP, there is one syntax (numericString) not two
  (numericString with constraint, numericString without constraint).
  This should be treated as numericString with non-empty constraint.
  Note that while someone may have no ISDN number, there are no ISDN
  numbers which are zero length.

  In matching, spaces are ignored.

PrintableString
  In ASN.1, Printable string is just a string of printable characters
  and can be empty.  In X.500, semantics much like NumericString (see
  serialNumber for a like example) excepting uses insignificant space
  handling instead of ignore all spaces.  

IA5String
  Basically same as PrintableString.  There are no examples in X.500,
  but same logic applies.  So we require them to be non-empty as
  well.

-------------------------------------------------------------------*/

1223
1224
1225
1226
1227
1228
1229
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
1230
	unsigned char *u = (unsigned char *)in->bv_val;
1231

1232
1233
1234
1235
	if( in->bv_len == 0 && syntax == slap_schema.si_syn_directoryString ) {
		/* directory strings cannot be empty */
		return LDAP_INVALID_SYNTAX;
	}
1236

1237
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
1238
		/* get the length indicated by the first byte */
1239
		len = LDAP_UTF8_CHARLEN2( u, len );
1240

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1241
1242
1243
		/* very basic checks */
		switch( len ) {
			case 6:
1244
				if( (u[5] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1245
1246
1247
					return LDAP_INVALID_SYNTAX;
				}
			case 5:
1248
				if( (u[4] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1249
1250
1251
					return LDAP_INVALID_SYNTAX;
				}
			case 4:
1252
				if( (u[3] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1253
1254
1255
					return LDAP_INVALID_SYNTAX;
				}
			case 3:
1256
				if( (u[2] & 0xC0 )!= 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1257
1258
1259
					return LDAP_INVALID_SYNTAX;
				}
			case 2:
1260
				if( (u[1] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1261
1262
1263
					return LDAP_INVALID_SYNTAX;
				}
			case 1:
1264
				/* CHARLEN already validated it */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1265
1266
1267
1268
				break;
			default:
				return LDAP_INVALID_SYNTAX;
		}
1269
1270
1271

		/* make sure len corresponds with the offset
			to the next character */
1272
		if( LDAP_UTF8_OFFSET( (char *)u ) != len ) return LDAP_INVALID_SYNTAX;
1273
1274
	}

1275
1276
1277
	if( count != 0 ) {
		return LDAP_INVALID_SYNTAX;
	}
1278

1279
	return LDAP_SUCCESS;
1280
1281
}

1282
1283
1284
1285
1286
1287
static int
UTF8StringNormalize(
	slap_mask_t use,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
1288
1289
	struct berval *normalized,
	void *ctx )
1290
1291
1292
1293
1294
{
	struct berval tmp, nvalue;
	int flags;
	int i, wasspace;

1295
1296
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( use ));

1297
1298
1299
1300
1301
1302
1303
1304
1305
	if( val->bv_val == NULL ) {
		/* assume we're dealing with a syntax (e.g., UTF8String)
		 * which allows empty strings
		 */
		normalized->bv_len = 0;
		normalized->bv_val = NULL;
		return LDAP_SUCCESS;
	}

1306
	flags = SLAP_MR_ASSOCIATED( mr, slap_schema.si_mr_caseExactMatch )
1307
		? LDAP_UTF8_NOCASEFOLD : LDAP_UTF8_CASEFOLD;
1308
	flags |= ( ( use & SLAP_MR_EQUALITY_APPROX ) == SLAP_MR_EQUALITY_APPROX )
1309
1310
		? LDAP_UTF8_APPROX : 0;

Howard Chu's avatar
Howard Chu committed
1311
	val = UTF8bvnormalize( val, &tmp, flags, ctx );
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
	if( val == NULL ) {
		return LDAP_OTHER;
	}
	
	/* collapse spaces (in place) */
	nvalue.bv_len = 0;
	nvalue.bv_val = tmp.bv_val;

	wasspace=1; /* trim leading spaces */
	for( i=0; i<tmp.bv_len; i++) {
		if ( ASCII_SPACE( tmp.bv_val[i] )) {
			if( wasspace++ == 0 ) {
				/* trim repeated spaces */
				nvalue.bv_val[nvalue.bv_len++] = tmp.bv_val[i];
			}
		} else {
			wasspace = 0;
			nvalue.bv_val[nvalue.bv_len++] = tmp.bv_val[i];
		}
	}

	if( nvalue.bv_len ) {
		if( wasspace ) {
			/* last character was a space, trim it */
			--nvalue.bv_len;