schema_init.c 80.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
28
#include <ac/string.h>
#include <ac/socket.h>

#include "slap.h"
#include "ldap_pvt.h"
Pierangelo Masarati's avatar
Pierangelo Masarati committed
29
#include "lber_pvt.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
46
47
48
49
50
#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)
51

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

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

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

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
82
83
#define berValidate blobValidate

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

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

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

	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

149
150
151
152
	*matchp = match;
	return LDAP_SUCCESS;
}

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

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

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

180
	keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
181

182
183
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
184

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

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}

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

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

234
	keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
235

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

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

	*keysp = keys;

	return LDAP_SUCCESS;
}
257

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
345
			idx = p - left.bv_val;
346

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

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

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

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

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

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

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

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

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
398
399
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
400
	struct berval digest;
401
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
402
403
404
405
406
407
408
409
410
411
412
413
414
	digest.bv_len = sizeof(HASHdigest);

	nkeys=0;

	for( i=0; values[i].bv_val != NULL; i++ ) {
		/* count number of indices to generate */
		if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
			continue;
		}

		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
415
					(SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
416
			} else {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
417
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
418
419
420
421
422
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
423
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MAXLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
424
425
426
427
428
429
430
431
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
					( SLAP_INDEX_SUBSTR_MINLEN - 1);
			} else {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
432
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_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
453
454
455
456
457

	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( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;

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

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

				HASH_Update( &HASHcontext,
468
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
469
				HASH_Update( &HASHcontext,
470
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
471
				HASH_Update( &HASHcontext,
472
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
473
				HASH_Update( &HASHcontext,
474
					(unsigned char *)&values[i].bv_val[j],
Kurt Zeilenga's avatar
Kurt Zeilenga committed
475
476
477
					SLAP_INDEX_SUBSTR_MAXLEN );
				HASH_Final( HASHdigest, &HASHcontext );

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
483
484
485
486
487
488
489
490
491
492
			}
		}

		max = SLAP_INDEX_SUBSTR_MAXLEN < values[i].bv_len
			? SLAP_INDEX_SUBSTR_MAXLEN : values[i].bv_len;

		for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
			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,
493
						(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
494
495
				}
				HASH_Update( &HASHcontext,
496
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
497
				HASH_Update( &HASHcontext,
498
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
499
				HASH_Update( &HASHcontext,
500
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
501
				HASH_Update( &HASHcontext,
502
					(unsigned char *)values[i].bv_val, j );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
503
504
				HASH_Final( HASHdigest, &HASHcontext );

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
509
510
511
512
			}

			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,
513
						(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
514
515
				}
				HASH_Update( &HASHcontext,
516
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
517
				HASH_Update( &HASHcontext,
518
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
519
				HASH_Update( &HASHcontext,
520
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
521
				HASH_Update( &HASHcontext,
522
					(unsigned char *)&values[i].bv_val[values[i].bv_len-j], j );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
523
524
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
525
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
			}

		}

	}

	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
551
552
	BerVarray *keysp,
	void *ctx)
Kurt Zeilenga's avatar
Kurt Zeilenga committed
553
554
555
556
557
558
{
	SubstringsAssertion *sa;
	char pre;
	ber_len_t nkeys = 0;
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
559
560
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
	struct berval *value;
	struct berval digest;

	sa = (SubstringsAssertion *) assertedValue;

	if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL
		&& sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		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++ ) {
			if( sa->sa_any[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
				/* don't bother accounting for stepping */
				nkeys += sa->sa_any[i].bv_len -
					( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
			}
		}
	}

	if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
		sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		nkeys++;
	}

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

594
	digest.bv_val = (char *)HASHdigest;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
595
596
597
598
599
	digest.bv_len = sizeof(HASHdigest);

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

600
	keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
601
602
603
604
605
606
607
608
609
610
611
612
613
614
	nkeys = 0;

	if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL &&
		sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = &sa->sa_initial;

		klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;

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

Howard Chu's avatar
Howard Chu committed
627
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
	}

	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
		ber_len_t i, j;
		pre = SLAP_INDEX_SUBSTR_PREFIX;
		klen = SLAP_INDEX_SUBSTR_MAXLEN;

		for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
			if( sa->sa_any[i].bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
				continue;
			}

			value = &sa->sa_any[i];

			for(j=0;
				j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
				j += SLAP_INDEX_SUBSTR_STEP )
			{
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
649
						(unsigned char *)prefix->bv_val, prefix->bv_len );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
650
651
				}
				HASH_Update( &HASHcontext,
652
					(unsigned char *)&pre, sizeof( pre ) );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
653
				HASH_Update( &HASHcontext,
654
					(unsigned char *)syntax->ssyn_oid, slen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
655
				HASH_Update( &HASHcontext,
656
					(unsigned char *)mr->smr_oid, mlen );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
657
				HASH_Update( &HASHcontext,
658
					(unsigned char *)&value->bv_val[j], klen ); 
Kurt Zeilenga's avatar
Kurt Zeilenga committed
659
660
				HASH_Final( HASHdigest, &HASHcontext );

Howard Chu's avatar
Howard Chu committed
661
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
			}
		}
	}

	if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
		sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = &sa->sa_final;

		klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;

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

Howard Chu's avatar
Howard Chu committed
690
		ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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
717
718
	}

	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
719
720
721
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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
	 * 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;
}

static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
	struct berval dn;

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

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

	if( dn.bv_val[dn.bv_len-1] == 'B'
		&& dn.bv_val[dn.bv_len-2] == '\'' )
	{
		/* assume presence of optional UID */
		ber_len_t i;

		for(i=dn.bv_len-3; i>1; i--) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
761
			if( dn.bv_val[i] != '0' && dn.bv_val[i] != '1' ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
				break;
			}
		}
		if( dn.bv_val[i] != '\'' || dn.bv_val[i-1] != '#' ) {
			ber_memfree( dn.bv_val );
			return LDAP_INVALID_SYNTAX;
		}

		/* trim the UID to allow use of dnValidate */
		dn.bv_val[i-1] = '\0';
		dn.bv_len = i-1;
	}

	rc = dnValidate( NULL, &dn );

	ber_memfree( dn.bv_val );
	return rc;
}

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
int
nameUIDPretty(
	Syntax *syntax,
	struct berval *val,
	struct berval *out,
	void *ctx )
{
	assert( val );
	assert( out );


#ifdef NEW_LOGGING
	LDAP_LOG( OPERATION, ARGS, ">>> nameUIDPretty: <%s>\n", val->bv_val, 0, 0 );
#else
	Debug( LDAP_DEBUG_TRACE, ">>> nameUIDPretty: <%s>\n", val->bv_val, 0, 0 );
#endif

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

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

	} else {
		int rc;
		struct berval dnval = *val;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
807
		struct berval uidval = BER_BVNULL;
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825

		if( val->bv_val[val->bv_len-1] == 'B'
			&& val->bv_val[val->bv_len-2] == '\'' )
		{
			uidval.bv_val=strrchr( val->bv_val, '#' );
			if( uidval.bv_val ) {
				dnval.bv_len = uidval.bv_val - dnval.bv_val;
				uidval.bv_len = val->bv_len - dnval.bv_len;

				uidval.bv_len--;
				uidval.bv_val++;
			}
		}

		rc = dnPretty( syntax, &dnval, out, ctx );
		if( rc != LDAP_SUCCESS ) return rc;

		if( uidval.bv_val ) {
826
			char *tmp = slap_sl_realloc( out->bv_val, out->bv_len + uidval.bv_len + 2, ctx );
827
828
829
830
831
			int i, c, got1;
			if( tmp == NULL ) {
				ber_memfree_x( out->bv_val, ctx );
				return LDAP_OTHER;
			}
832
			out->bv_val = tmp;
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
			out->bv_val[out->bv_len++] = '#';

			got1 = uidval.bv_len < sizeof("'0'B"); 
			for(i=0; i<uidval.bv_len; i++) {
				c = uidval.bv_val[i];
				switch(c) {
					case '0':
						if( got1 ) out->bv_val[out->bv_len++] = c;
						break;
					case '1':
						got1 = 1;
					default:
						out->bv_val[out->bv_len++] = c;
				}
			}

			out->bv_val[out->bv_len] = '\0';
		}
	}

#ifdef NEW_LOGGING
	LDAP_LOG( OPERATION, ARGS, "<<< nameUIDPretty: <%s>\n", out->bv_val, 0, 0 );
#else
	Debug( LDAP_DEBUG_TRACE, "<<< nameUIDPretty: <%s>\n", out->bv_val, 0, 0 );
#endif

	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
862
863
864
865
866
867
static int
uniqueMemberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
868
869
	struct berval *normalized,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
870
871
872
873
{
	struct berval out;
	int rc;

874
875
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ));

Kurt Zeilenga's avatar
Kurt Zeilenga committed
876
877
	ber_dupbv( &out, val );
	if( out.bv_len != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
878
		struct berval uid = BER_BVNULL;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897

		if( out.bv_val[out.bv_len-1] == 'B'
			&& out.bv_val[out.bv_len-2] == '\'' )
		{
			/* assume presence of optional UID */
			uid.bv_val = strrchr( out.bv_val, '#' );

			if( uid.bv_val == NULL ) {
				free( out.bv_val );
				return LDAP_INVALID_SYNTAX;
			}

			uid.bv_len = out.bv_len - (uid.bv_val - out.bv_val);
			out.bv_len -= uid.bv_len--;

			/* temporarily trim the UID */
			*(uid.bv_val++) = '\0';
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
898
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926

		if( rc != LDAP_SUCCESS ) {
			free( out.bv_val );
			return LDAP_INVALID_SYNTAX;
		}

		if( uid.bv_len ) {
			normalized->bv_val = ch_realloc( normalized->bv_val,
				normalized->bv_len + uid.bv_len + sizeof("#") );

			/* 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';
		}

		free( out.bv_val );
	}

	return LDAP_SUCCESS;
}

927
928
929
930
931
932
933
934
935
936
937
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;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
938
939
940
941
	struct berval assertedDN = BER_BVNULL;
	struct berval assertedUID = BER_BVNULL;
	struct berval valueDN = BER_BVNULL;
	struct berval valueUID = BER_BVNULL;
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997

	if( asserted->bv_len != 0 ) {
		assertedDN = *asserted;

		if( assertedDN.bv_val[assertedDN.bv_len-1] == 'B'
			&& assertedDN.bv_val[assertedDN.bv_len-2] == '\'' )
		{
			/* assume presence of optional UID */
			assertedUID.bv_val = strrchr( assertedDN.bv_val, '#' );

			if( assertedUID.bv_val == NULL ) {
				return LDAP_INVALID_SYNTAX;
			}

			assertedUID.bv_len = assertedDN.bv_len -
				(assertedUID.bv_val - assertedDN.bv_val);
			assertedDN.bv_len -= assertedUID.bv_len--;

			/* trim the separator */
			assertedUID.bv_val++;
		}
	}

	if( value->bv_len != 0 ) {
		valueDN = *value;

		if( valueDN.bv_val[valueDN.bv_len-1] == 'B'
			&& valueDN.bv_val[valueDN.bv_len-2] == '\'' )
		{
			/* assume presence of optional UID */
			valueUID.bv_val = strrchr( valueDN.bv_val, '#' );

			if( valueUID.bv_val == NULL ) {
				return LDAP_INVALID_SYNTAX;
			}

			valueUID.bv_len = valueDN.bv_len -
				(assertedUID.bv_val - assertedDN.bv_val);
			valueDN.bv_len -= valueUID.bv_len--;

			/* trim the separator */
			valueUID.bv_val++;
		}
	}

	if( valueUID.bv_len && assertedUID.bv_len ) {
		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
998
999
1000
1001
1002
1003
/*
 * 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.
 */
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
static int
booleanValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */

	if( in->bv_len == 4 ) {
1014
		if( bvmatch( in, &slap_true_bv ) ) {
1015
1016
1017
			return LDAP_SUCCESS;
		}
	} else if( in->bv_len == 5 ) {
1018
		if( bvmatch( in, &slap_false_bv ) ) {
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
			return LDAP_SUCCESS;
		}
	}

	return LDAP_INVALID_SYNTAX;
}

static int
booleanMatch(
	int *matchp,
1029
	slap_mask_t flags,
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
	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;
}

1041
1042
1043
1044
1045
/*-------------------------------------------------------------------
LDAP/X.500 string syntax / matching rules have a few oddities.  This
comment attempts to detail how slapd(8) treats them.

Summary:
1046
  StringSyntax		X.500	LDAP	Matching/Comments
1047
1048
  DirectoryString	CHOICE	UTF8	i/e + ignore insignificant spaces
  PrintableString	subset	subset	i/e + ignore insignificant spaces
1049
  PrintableString	subset	subset	i/e + ignore insignificant spaces
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
1050
  NumericString		subset	subset	ignore all spaces
1051
1052
1053
  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
1054
  TelephoneNumber	subset	subset	i + ignore all spaces and "-"
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064

  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.

1065
  In LDAPv3, a directory string is a UTF-8 encoded UCS string.
1066
  A directory string cannot be zero length.
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112

  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.

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

1113
1114
1115
1116
1117
1118
1119
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
1120
	unsigned char *u = (unsigned char *)in->bv_val;
1121

1122
1123
1124
1125
	if( in->bv_len == 0 && syntax == slap_schema.si_syn_directoryString ) {
		/* directory strings cannot be empty */
		return LDAP_INVALID_SYNTAX;
	}
1126

1127
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
1128
		/* get the length indicated by the first byte */
1129
		len = LDAP_UTF8_CHARLEN2( u, len );
1130

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1131
1132
1133
		/* very basic checks */
		switch( len ) {
			case 6:
1134
				if( (u[5] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1135
1136
1137
					return LDAP_INVALID_SYNTAX;
				}
			case 5:
1138
				if( (u[4] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1139
1140
1141
					return LDAP_INVALID_SYNTAX;
				}
			case 4:
1142
				if( (u[3] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1143
1144
1145
					return LDAP_INVALID_SYNTAX;
				}
			case 3:
1146
				if( (u[2] & 0xC0 )!= 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1147
1148
1149
					return LDAP_INVALID_SYNTAX;
				}
			case 2:
1150
				if( (u[1] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1151
1152
1153
					return LDAP_INVALID_SYNTAX;
				}
			case 1:
1154
				/* CHARLEN already validated it */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1155
1156
1157
1158
				break;
			default:
				return LDAP_INVALID_SYNTAX;
		}
1159
1160
1161

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

1165
1166
1167
	if( count != 0 ) {
		return LDAP_INVALID_SYNTAX;
	}
1168

1169
	return LDAP_SUCCESS;
1170
1171
}

1172
1173
1174
1175
1176
1177
static int
UTF8StringNormalize(
	slap_mask_t use,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
1178
1179
	struct berval *normalized,
	void *ctx )
1180
1181
1182
1183
1184
{
	struct berval tmp, nvalue;
	int flags;
	int i, wasspace;

1185
1186
	assert( SLAP_MR_IS_VALUE_OF_SYNTAX( use ));

1187
1188
1189
1190
1191
1192
1193
1194
1195
	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;
	}

1196
	flags = SLAP_MR_ASSOCIATED( mr, slap_schema.si_mr_caseExactMatch )
1197
		? LDAP_UTF8_NOCASEFOLD : LDAP_UTF8_CASEFOLD;
1198
	flags |= ( ( use & SLAP_MR_EQUALITY_APPROX ) == SLAP_MR_EQUALITY_APPROX )
1199
1200
		? LDAP_UTF8_APPROX : 0;

Howard Chu's avatar
Howard Chu committed
1201
	val = UTF8bvnormalize( val, &tmp, flags, ctx );
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
	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;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1227
1228
		}
		nvalue.bv_val[nvalue.bv_len] = '\0';
1229

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1230
1231
1232
1233
1234
1235
	} else {
		/* string of all spaces is treated as one space */
		nvalue.bv_val[0] = ' ';
		nvalue.bv_val[1] = '\0';
		nvalue.bv_len = 1;
	}
1236

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1237
	*normalized = nvalue;
1238
1239
1240
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1241
#if defined(SLAPD_APPROX_INITIALS)
1242
1243
#	define SLAPD_APPROX_DELIMITER "._ "
#	define SLAPD_APPROX_WORDLEN 2
1244
#else
1245
1246
#	define SLAPD_APPROX_DELIMITER " "
#	define SLAPD_APPROX_WORDLEN 1
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1247
#endif
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257

static int
approxMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1258
1259
1260
	struct berval *nval, *assertv;
	char *val, **values, **words, *c;
	int i, count, len, nextchunk=0, nextavail=0;
1261

1262
	/* Yes, this is necessary */
1263
	nval = UTF8bvnormalize( value, NULL, LDAP_UTF8_APPROX, NULL );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1264
	if( nval == NULL ) {
1265
1266
1267
1268
1269
		*matchp = 1;
		return LDAP_SUCCESS;
	}

	/* Yes, this is necessary */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1270
	assertv = UTF8bvnormalize( ((struct berval *)assertedValue),
1271
		NULL, LDAP_UTF8_APPROX, NULL );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1272
1273
1274
	if( assertv == NULL ) {
		ber_bvfree( nval );
		*matchp = 1;
1275
1276
1277
		return LDAP_SUCCESS;
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1278
1279
1280
1281
1282
1283
	/* Isolate how many words there are */
	for ( c = nval->bv_val, count = 1; *c; c++ ) {
		c = strpbrk( c, SLAPD_APPROX_DELIMITER );
		if ( c == NULL ) break;
		*c = '\0';
		count++;