schema_init.c 73.9 KB
Newer Older
1
2
3
/* schema_init.c - init builtin schema */
/* $OpenLDAP$ */
/*
Kurt Zeilenga's avatar
Kurt Zeilenga committed
4
 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5
6
7
8
9
10
 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
 */

#include "portable.h"

#include <stdio.h>
Kurt Zeilenga's avatar
Kurt Zeilenga committed
11
#include <limits.h>
12
13

#include <ac/ctype.h>
14
#include <ac/errno.h>
15
16
17
18
19
#include <ac/string.h>
#include <ac/socket.h>

#include "slap.h"
#include "ldap_pvt.h"
Pierangelo Masarati's avatar
Pierangelo Masarati committed
20
#include "lber_pvt.h"
21

22
23
#include "ldap_utf8.h"

24
25
26
27
28
29
#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)
30

Kurt Zeilenga's avatar
Kurt Zeilenga committed
31
32
#define SLAP_NVALUES 1

Kurt Zeilenga's avatar
Kurt Zeilenga committed
33
34
35
36
37
38
/* not yet implemented */
#define objectIdentifierNormalize NULL
#define integerOrderingMatch NULL
#define uniqueMemberMatch NULL
#define integerFirstComponentNormalize NULL
#define objectIdentifierFirstComponentNormalize NULL
39

Pierangelo Masarati's avatar
Pierangelo Masarati committed
40
41
#define	OpenLDAPaciMatch			NULL

42
/* approx matching rules */
43
44
45
46
#ifdef SLAP_NVALUES
#define directoryStringApproxMatchOID	NULL
#define IA5StringApproxMatchOID			NULL
#else
47
#define directoryStringApproxMatchOID	"1.3.6.1.4.1.4203.666.4.4"
Gary Williams's avatar
Gary Williams committed
48
49
50
#define directoryStringApproxMatch	approxMatch
#define directoryStringApproxIndexer	approxIndexer
#define directoryStringApproxFilter	approxFilter
51
#define IA5StringApproxMatchOID			"1.3.6.1.4.1.4203.666.4.5"
Gary Williams's avatar
Gary Williams committed
52
#define IA5StringApproxMatch			approxMatch
53
#define IA5StringApproxIndexer			approxIndexer
Gary Williams's avatar
Gary Williams committed
54
#define IA5StringApproxFilter			approxFilter
55
#endif
56

Kurt Zeilenga's avatar
Kurt Zeilenga committed
57
58
59
60
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
61
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
62
63
64
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
65

Kurt Zeilenga's avatar
Kurt Zeilenga committed
66
67
68
69
70
71
72
static int
blobValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_SUCCESS;
73
}
74

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
75
76
#define berValidate blobValidate

77
78
79
static int
octetStringMatch(
	int *matchp,
80
	slap_mask_t flags,
81
82
83
84
85
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
86
87
	struct berval *asserted = (struct berval *) assertedValue;
	int match = value->bv_len - asserted->bv_len;
88
89

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
90
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
91
92
93
94
95
96
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

97
98
99
100
101
102
103
104
105
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
106
	struct berval *asserted = (struct berval *) assertedValue;
107
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
108
	ber_len_t av_len = asserted->bv_len;
109

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
110
	int match = memcmp( value->bv_val, asserted->bv_val,
111
		(v_len < av_len ? v_len : av_len) );
112
113
114

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

115
116
117
118
	*matchp = match;
	return LDAP_SUCCESS;
}

119
/* Index generation function */
120
int octetStringIndexer(
121
122
	slap_mask_t use,
	slap_mask_t flags,
123
124
125
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
126
127
	BerVarray values,
	BerVarray *keysp )
128
129
130
{
	int i;
	size_t slen, mlen;
131
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
132
133
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
134
	struct berval digest;
135
136
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
137

138
	for( i=0; values[i].bv_val != NULL; i++ ) {
139
140
141
		/* just count them */
	}

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

145
	keys = ch_malloc( sizeof( struct berval ) * (i+1) );
146

147
148
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
149

150
	for( i=0; values[i].bv_val != NULL; i++ ) {
151
		HASH_Init( &HASHcontext );
152
		if( prefix != NULL && prefix->bv_len > 0 ) {
153
			HASH_Update( &HASHcontext,
154
155
				prefix->bv_val, prefix->bv_len );
		}
156
		HASH_Update( &HASHcontext,
157
			syntax->ssyn_oid, slen );
158
		HASH_Update( &HASHcontext,
159
			mr->smr_oid, mlen );
160
		HASH_Update( &HASHcontext,
161
			values[i].bv_val, values[i].bv_len );
162
		HASH_Final( HASHdigest, &HASHcontext );
163

164
		ber_dupbv( &keys[i], &digest );
165
166
	}

167
	keys[i].bv_val = NULL;
168
	keys[i].bv_len = 0;
169
170
171
172
173
174
175

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
176
int octetStringFilter(
177
178
	slap_mask_t use,
	slap_mask_t flags,
179
180
181
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
182
	void * assertedValue,
183
	BerVarray *keysp )
184
185
{
	size_t slen, mlen;
186
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
187
188
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
189
	struct berval *value = (struct berval *) assertedValue;
190
	struct berval digest;
191
192
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
193

194
195
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
196

197
	keys = ch_malloc( sizeof( struct berval ) * 2 );
198

199
	HASH_Init( &HASHcontext );
200
	if( prefix != NULL && prefix->bv_len > 0 ) {
201
		HASH_Update( &HASHcontext,
202
203
			prefix->bv_val, prefix->bv_len );
	}
204
	HASH_Update( &HASHcontext,
205
		syntax->ssyn_oid, slen );
206
	HASH_Update( &HASHcontext,
207
		mr->smr_oid, mlen );
208
	HASH_Update( &HASHcontext,
209
		value->bv_val, value->bv_len );
210
	HASH_Final( HASHdigest, &HASHcontext );
211

212
213
	ber_dupbv( keys, &digest );
	keys[1].bv_val = NULL;
214
	keys[1].bv_len = 0;
215
216
217
218
219

	*keysp = keys;

	return LDAP_SUCCESS;
}
220

221
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
222
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
223
224
	int *matchp,
	slap_mask_t flags,
225
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
226
227
228
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
229
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
230
231
232
233
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
234
	ber_len_t inlen = 0;
235

Kurt Zeilenga's avatar
Kurt Zeilenga committed
236
237
238
	/* Add up asserted input length */
	if( sub->sa_initial.bv_val ) {
		inlen += sub->sa_initial.bv_len;
239
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
240
241
242
243
244
245
246
	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;
247
248
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
249
250
251
252
	if( sub->sa_initial.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
253
254
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
255
256
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
257

Kurt Zeilenga's avatar
Kurt Zeilenga committed
258
259
260
		if( match != 0 ) {
			goto done;
		}
261

Kurt Zeilenga's avatar
Kurt Zeilenga committed
262
263
264
265
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
266

Kurt Zeilenga's avatar
Kurt Zeilenga committed
267
268
269
270
271
	if( sub->sa_final.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
272

Kurt Zeilenga's avatar
Kurt Zeilenga committed
273
274
275
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
276

Kurt Zeilenga's avatar
Kurt Zeilenga committed
277
278
		if( match != 0 ) {
			goto done;
279
280
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
281
282
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
283
284
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
285
286
287
288
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i].bv_val; i++) {
			ber_len_t idx;
			char *p;
289

Kurt Zeilenga's avatar
Kurt Zeilenga committed
290
291
292
293
294
295
retry:
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}
296

Kurt Zeilenga's avatar
Kurt Zeilenga committed
297
298
299
			if( sub->sa_any[i].bv_len == 0 ) {
				continue;
			}
300

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
303
304
305
			if( p == NULL ) {
				match = 1;
				goto done;
306
307
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
308
			idx = p - left.bv_val;
309

Kurt Zeilenga's avatar
Kurt Zeilenga committed
310
311
312
313
			if( idx >= left.bv_len ) {
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
314

Kurt Zeilenga's avatar
Kurt Zeilenga committed
315
316
			left.bv_val = p;
			left.bv_len -= idx;
317

Kurt Zeilenga's avatar
Kurt Zeilenga committed
318
319
320
321
322
			if( sub->sa_any[i].bv_len > left.bv_len ) {
				/* not enough left */
				match = 1;
				goto done;
			}
323

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
328
329
330
331
332
			if( match != 0 ) {
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
333

Kurt Zeilenga's avatar
Kurt Zeilenga committed
334
335
336
			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;
337
338
339
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
340
341
done:
	*matchp = match;
342
343
344
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
345
346
/* Substrings Index generation function */
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
347
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
348
349
350
351
352
353
354
355
356
357
358
359
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
	BerVarray *keysp )
{
	ber_len_t i, j, nkeys;
	size_t slen, mlen;
	BerVarray keys;

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
360
361
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
	struct berval digest;
	digest.bv_val = HASHdigest;
	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
377
					(SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
378
			} else {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
379
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
380
381
382
383
384
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
385
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MAXLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
386
387
388
389
390
391
392
393
			}
		}

		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
394
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
			}
		}
	}

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

	keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );

	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
420
			max = values[i].bv_len - (SLAP_INDEX_SUBSTR_MAXLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520

			for( j=0; j<max; j++ ) {
				HASH_Init( &HASHcontext );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					HASH_Update( &HASHcontext,
						prefix->bv_val, prefix->bv_len );
				}

				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					&values[i].bv_val[j],
					SLAP_INDEX_SUBSTR_MAXLEN );
				HASH_Final( HASHdigest, &HASHcontext );

				ber_dupbv( &keys[nkeys++], &digest );
			}
		}

		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,
						prefix->bv_val, prefix->bv_len );
				}
				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					values[i].bv_val, j );
				HASH_Final( HASHdigest, &HASHcontext );

				ber_dupbv( &keys[nkeys++], &digest );
			}

			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,
						prefix->bv_val, prefix->bv_len );
				}
				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					&values[i].bv_val[values[i].bv_len-j], j );
				HASH_Final( HASHdigest, &HASHcontext );

				ber_dupbv( &keys[nkeys++], &digest );
			}

		}

	}

	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,
	BerVarray *keysp )
{
	SubstringsAssertion *sa;
	char pre;
	unsigned casefold;
	ber_len_t nkeys = 0;
	size_t slen, mlen, klen;
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
521
522
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
523
524
525
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
551
552
553
554
555
556
557
558
559
560
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
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
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
	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;
	}

	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);

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

	keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );
	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,
				prefix->bv_val, prefix->bv_len );
		}
		HASH_Update( &HASHcontext,
			&pre, sizeof( pre ) );
		HASH_Update( &HASHcontext,
			syntax->ssyn_oid, slen );
		HASH_Update( &HASHcontext,
			mr->smr_oid, mlen );
		HASH_Update( &HASHcontext,
			value->bv_val, klen );
		HASH_Final( HASHdigest, &HASHcontext );

		ber_dupbv( &keys[nkeys++], &digest );
	}

	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,
						prefix->bv_val, prefix->bv_len );
				}
				HASH_Update( &HASHcontext,
					&pre, sizeof( pre ) );
				HASH_Update( &HASHcontext,
					syntax->ssyn_oid, slen );
				HASH_Update( &HASHcontext,
					mr->smr_oid, mlen );
				HASH_Update( &HASHcontext,
					&value->bv_val[j], klen ); 
				HASH_Final( HASHdigest, &HASHcontext );

				ber_dupbv( &keys[nkeys++], &digest );
			}
		}
	}

	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,
				prefix->bv_val, prefix->bv_len );
		}
		HASH_Update( &HASHcontext,
			&pre, sizeof( pre ) );
		HASH_Update( &HASHcontext,
			syntax->ssyn_oid, slen );
		HASH_Update( &HASHcontext,
			mr->smr_oid, mlen );
		HASH_Update( &HASHcontext,
			&value->bv_val[value->bv_len-klen], klen );
		HASH_Final( HASHdigest, &HASHcontext );

		ber_dupbv( &keys[nkeys++], &digest );
	}

	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
681
682
683
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
684
685
686
687
688
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
717
718
719
720
721
722
	 * 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
723
			if( dn.bv_val[i] != '0' && dn.bv_val[i] != '1' ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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
				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;
}

static int
uniqueMemberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
	struct berval *normalized )
{
	struct berval out;
	int rc;

	ber_dupbv( &out, val );
	if( out.bv_len != 0 ) {
		struct berval uid = { 0, NULL };

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

		rc = dnNormalize2( NULL, &out, normalized );

		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;
}

/*
 * 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.
 */
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
static int
booleanValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */

	if( in->bv_len == 4 ) {
		if( !memcmp( in->bv_val, "TRUE", 4 ) ) {
			return LDAP_SUCCESS;
		}
	} else if( in->bv_len == 5 ) {
		if( !memcmp( in->bv_val, "FALSE", 5 ) ) {
			return LDAP_SUCCESS;
		}
	}

	return LDAP_INVALID_SYNTAX;
}

static int
booleanMatch(
	int *matchp,
836
	slap_mask_t flags,
837
838
839
840
841
842
843
844
845
846
847
	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;
}

848
849
850
851
852
/*-------------------------------------------------------------------
LDAP/X.500 string syntax / matching rules have a few oddities.  This
comment attempts to detail how slapd(8) treats them.

Summary:
853
  StringSyntax		X.500	LDAP	Matching/Comments
854
855
  DirectoryString	CHOICE	UTF8	i/e + ignore insignificant spaces
  PrintableString	subset	subset	i/e + ignore insignificant spaces
856
  PrintableString	subset	subset	i/e + ignore insignificant spaces
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
857
  NumericString		subset	subset	ignore all spaces
858
859
860
  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
861
  TelephoneNumber	subset	subset	i + ignore all spaces and "-"
862
863
864
865
866
867
868
869
870
871

  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.

872
  In LDAPv3, a directory string is a UTF-8 encoded UCS string.
873
  A directory string cannot be zero length.
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919

  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.

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

920
921
922
923
924
925
926
927
928
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
	unsigned char *u = in->bv_val;

929
930
931
932
	if( in->bv_len == 0 && syntax == slap_schema.si_syn_directoryString ) {
		/* directory strings cannot be empty */
		return LDAP_INVALID_SYNTAX;
	}
933

934
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
935
		/* get the length indicated by the first byte */
936
		len = LDAP_UTF8_CHARLEN2( u, len );
937

Kurt Zeilenga's avatar
Kurt Zeilenga committed
938
939
940
		/* very basic checks */
		switch( len ) {
			case 6:
941
				if( (u[5] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
942
943
944
					return LDAP_INVALID_SYNTAX;
				}
			case 5:
945
				if( (u[4] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
946
947
948
					return LDAP_INVALID_SYNTAX;
				}
			case 4:
949
				if( (u[3] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
950
951
952
					return LDAP_INVALID_SYNTAX;
				}
			case 3:
953
				if( (u[2] & 0xC0 )!= 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
954
955
956
					return LDAP_INVALID_SYNTAX;
				}
			case 2:
957
				if( (u[1] & 0xC0) != 0x80 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
958
959
960
					return LDAP_INVALID_SYNTAX;
				}
			case 1:
961
				/* CHARLEN already validated it */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
962
963
964
965
				break;
			default:
				return LDAP_INVALID_SYNTAX;
		}
966
967
968

		/* make sure len corresponds with the offset
			to the next character */
969
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
970
971
	}

972
973
974
	if( count != 0 ) {
		return LDAP_INVALID_SYNTAX;
	}
975

976
	return LDAP_SUCCESS;
977
978
}

979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
static int
UTF8StringNormalize(
	slap_mask_t use,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
	struct berval *normalized )
{
	struct berval tmp, nvalue;
	int flags;
	int i, wasspace;

	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;
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1000
	flags = (mr == slap_schema.si_mr_caseExactMatch)
1001
		? LDAP_UTF8_NOCASEFOLD : LDAP_UTF8_CASEFOLD;
1002
	flags |= ( ( use & SLAP_MR_EQUALITY_APPROX ) == SLAP_MR_EQUALITY_APPROX )
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
		? LDAP_UTF8_APPROX : 0;

	val = UTF8bvnormalize( val, &tmp, flags );
	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
1031
1032
		}
		nvalue.bv_val[nvalue.bv_len] = '\0';
1033

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1034
1035
1036
1037
1038
1039
	} else {
		/* string of all spaces is treated as one space */
		nvalue.bv_val[0] = ' ';
		nvalue.bv_val[1] = '\0';
		nvalue.bv_len = 1;
	}
1040

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1041
	*normalized = nvalue;
1042
1043
1044
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1045
1046
1047
1048
1049
1050
#ifndef SLAP_NVALUES

#ifndef SLAPD_APPROX_OLDSINGLESTRING
#if defined(SLAPD_APPROX_INITIALS)
#define SLAPD_APPROX_DELIMITER "._ "
#define SLAPD_APPROX_WORDLEN 2
1051
#else
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1052
1053
1054
#define SLAPD_APPROX_DELIMITER " "
#define SLAPD_APPROX_WORDLEN 1
#endif
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064

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
1065
1066
1067
	struct berval *nval, *assertv;
	char *val, **values, **words, *c;
	int i, count, len, nextchunk=0, nextavail=0;
1068

1069
	/* Yes, this is necessary */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1070
1071
	nval = UTF8bvnormalize( value, NULL, LDAP_UTF8_APPROX );
	if( nval == NULL ) {
1072
1073
1074
1075
1076
		*matchp = 1;
		return LDAP_SUCCESS;
	}

	/* Yes, this is necessary */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1077
1078
1079
1080
1081
	assertv = UTF8bvnormalize( ((struct berval *)assertedValue),
		NULL, LDAP_UTF8_APPROX );
	if( assertv == NULL ) {
		ber_bvfree( nval );
		*matchp = 1;
1082
1083
1084
		return LDAP_SUCCESS;
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1085
1086
1087
1088
1089
1090
	/* 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++;
1091
1092
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1093
1094
1095
1096
1097
1098
	/* Get a phonetic copy of each word */
	words = (char **)ch_malloc( count * sizeof(char *) );
	values = (char **)ch_malloc( count * sizeof(char *) );
	for ( c = nval->bv_val, i = 0;  i < count; i++, c += strlen(c) + 1 ) {
		words[i] = c;
		values[i] = phonetic(c);
1099
	}
1100

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1101
1102
1103
1104
1105
1106
1107
	/* Work through the asserted value's words, to see if at least some
	   of the words are there, in the same order. */
	len = 0;
	while ( (ber_len_t) nextchunk < assertv->bv_len ) {
		len = strcspn( assertv->bv_val + nextchunk, SLAPD_APPROX_DELIMITER);
		if( len == 0 ) {
			nextchunk++;
1108
			continue;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1109
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1110
1111
1112
1113
1114
1115
1116
1117
#if defined(SLAPD_APPROX_INITIALS)
		else if( len == 1 ) {
			/* Single letter words need to at least match one word's initial */
			for( i=nextavail; i<count; i++ )
				if( !strncasecmp( assertv->bv_val + nextchunk, words[i], 1 )) {
					nextavail=i+1;
					break;
				}
1118
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1119
1120
1121
1122
1123
#endif
		else {
			/* Isolate the next word in the asserted value and phonetic it */
			assertv->bv_val[nextchunk+len] = '\0';
			val = phonetic( assertv->bv_val + nextchunk );
1124

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1125
1126
1127
1128
1129
1130
			/* See if this phonetic chunk is in the remaining words of *value */
			for( i=nextavail; i<count; i++ ){
				if( !strcmp( val, values[i] ) ){
					nextavail = i+1;
					break;
				}
1131
			}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1132
			ch_free( val );
1133
		}
1134

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1135
1136
1137
1138
		/* This chunk in the asserted value was NOT within the *value. */
		if( i >= count ) {
			nextavail=-1;
			break;
1139
1140
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1141
1142
		/* Go on to the next word in the asserted value */
		nextchunk += len+1;
1143
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1144

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1145
1146
1147
1148
1149
1150
1151
	/* If some of the words were seen, call it a match */
	if( nextavail > 0 ) {
		*matchp = 0;
	}
	else {
		*matchp = 1;
	}
1152

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1153
1154
1155
1156
1157
1158
1159
1160
	/* Cleanup allocs */
	ber_bvfree( assertv );
	for( i=0; i<count; i++ ) {
		ch_free( values[i] );
	}
	ch_free( values );
	ch_free( words );
	ber_bvfree( nval );
1161

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1162
1163
	return LDAP_SUCCESS;
}
1164

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
static int 
approxIndexer(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
	BerVarray *keysp )
{
	char *c;
	int i,j, len, wordcount, keycount=0;
	struct berval *newkeys;
	BerVarray keys=NULL;
1179

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1180
1181
1182
1183
1184
	for( j=0; values[j].bv_val != NULL; j++ ) {
		struct berval val = { 0, NULL };
		/* Yes, this is necessary */
		UTF8bvnormalize( &values[j], &val, LDAP_UTF8_APPROX );
		assert( val.bv_val != NULL );
1185

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1186
1187
1188
1189
1190
1191
1192
1193
		/* Isolate how many words there are. There will be a key for each */
		for( wordcount = 0, c = val.bv_val; *c; c++) {
			len = strcspn(c, SLAPD_APPROX_DELIMITER);
			if( len >= SLAPD_APPROX_WORDLEN ) wordcount++;
			c+= len;
			if (*c == '\0') break;
			*c = '\0';
		}
1194

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1195
1196
1197
1198
1199
1200
		/* Allocate/increase storage to account for new keys */
		newkeys = (struct berval *)ch_malloc( (keycount + wordcount + 1) 
			* sizeof(struct berval) );
		AC_MEMCPY( newkeys, keys, keycount * sizeof(struct berval) );
		if( keys ) ch_free( keys );
		keys = newkeys;
1201

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1202
1203
1204
1205
1206
1207
1208
		/* Get a phonetic copy of each word */
		for( c = val.bv_val, i = 0; i < wordcount; c += len + 1 ) {
			len = strlen( c );
			if( len < SLAPD_APPROX_WORDLEN ) continue;
			ber_str2bv( phonetic( c ), 0, 0, &keys[keycount] );
			keycount++;
			i++;
1209
		}
1210

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1211
		ber_memfree( val.bv_val );
1212
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1213
1214
	keys[keycount].bv_val = NULL;
	*keysp = keys;
1215

1216
1217
	return LDAP_SUCCESS;
}
1218

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1219
1220
static int 
approxFilter(
1221
	slap_mask_t use,
1222
	slap_mask_t flags,
1223
1224
1225
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
1226
	void * assertedValue,
1227
	BerVarray *keysp )
1228
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1229
1230
1231
	char *c;
	int i, count, len;
	struct berval *val;
1232
	BerVarray keys;
1233

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1234
1235
1236
1237
1238
1239
1240
1241
1242
	/* Yes, this is necessary */
	val = UTF8bvnormalize( ((struct berval *)assertedValue),
		NULL, LDAP_UTF8_APPROX );
	if( val == NULL || val->bv_val == NULL ) {
		keys = (struct berval *)ch_malloc( sizeof(struct berval) );
		keys[0].bv_val = NULL;
		*keysp = keys;
		ber_bvfree( val );
		return LDAP_SUCCESS;
1243
	}
1244

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1245
1246
1247
1248
1249
1250
1251
	/* Isolate how many words there are. There will be a key for each */
	for( count = 0,c = val->bv_val; *c; c++) {
		len = strcspn(c, SLAPD_APPROX_DELIMITER);
		if( len >= SLAPD_APPROX_WORDLEN ) count++;
		c+= len;
		if (*c == '\0') break;
		*c = '\0';
1252
1253
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1254
1255
	/* Allocate storage for new keys */
	keys = (struct berval *)ch_malloc( (count + 1) * sizeof(struct berval) );
1256

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1257
1258
1259
1260
1261
1262
	/* Get a phonetic copy of each word */
	for( c = val->bv_val, i = 0; i < count; c += len + 1 ) {
		len = strlen(c);
		if( len < SLAPD_APPROX_WORDLEN ) continue;
		ber_str2bv( phonetic( c ), 0, 0, &keys[i] );
		i++;
1263
1264
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1265
	ber_bvfree( val );
1266

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1267
1268
	keys[count].bv_val = NULL;
	*keysp = keys;
1269

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1270
1271
	return LDAP_SUCCESS;
}
1272

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1273
1274
#else
/* No other form of Approximate Matching is defined */
1275

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
static int
approxMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	char *vapprox, *avapprox;
	char *s, *t;
1287

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1288
1289
1290
1291
1292
1293
	/* Yes, this is necessary */
	s = UTF8normalize( value, UTF8_NOCASEFOLD );
	if( s == NULL ) {
		*matchp = 1;
		return LDAP_SUCCESS;
	}
1294

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1295
1296
1297
1298
1299
1300
1301
	/* Yes, this is necessary */
	t = UTF8normalize( ((struct berval *)assertedValue),
			   UTF8_NOCASEFOLD );
	if( t == NULL ) {
		free( s );
		*matchp = -1;
		return LDAP_SUCCESS;
1302
1303
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
	vapprox = phonetic( strip8bitChars( s ) );
	avapprox = phonetic( strip8bitChars( t ) );

	free( s );
	free( t );

	*matchp = strcmp( vapprox, avapprox );

	ch_free( vapprox );
	ch_free( avapprox );

	return LDAP_SUCCESS;
}

static int 
approxIndexer(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
	BerVarray *keysp )
{
	int i;
	BerVarray *keys;
	char *s;
1331

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1332
1333
1334
	for( i=0; values[i].bv_val != NULL; i++ ) {
		/* empty - just count them */
	}
1335

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1339
	keys = (struct berval *)ch_malloc( sizeof( struct berval ) * (i+1) );
1340

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1341
1342
1343
1344
	/* Copy each value and run it through phonetic() */
	for( i=0; values[i].bv_val != NULL; i++ ) {
		/* Yes, this is necessary */
		s = UTF8normalize( &values[i], UTF8_NOCASEFOLD );
1345

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1346
1347
1348
		/* strip 8-bit chars and run through phonetic() */
		ber_str2bv( phonetic( strip8bitChars( s ) ), 0, 0, &keys[i] );
		free( s );
1349
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1350
	keys[i].bv_val = NULL;
1351

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1352
1353
1354
	*keysp = keys;
	return LDAP_SUCCESS;
}
1355

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
static int 
approxFilter(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertedValue,
	BerVarray *keysp )
{
	BerVarray keys;
	char *s;
1368

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1369
	keys = (struct berval *)ch_malloc( sizeof( struct berval * ) * 2 );
1370

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1371
1372
1373
1374
1375
	/* Yes, this is necessary */
	s = UTF8normalize( ((struct berval *)assertedValue),
			     UTF8_NOCASEFOLD );
	if( s == NULL ) {
		keys[0] = NULL;
1376
	} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1377
1378
1379
1380
		/* strip 8-bit chars and run through phonetic() */
		keys[0] = ber_bvstr( phonetic( strip8bitChars( s ) ) );
		free( s );
		keys[1] = NULL;
1381
	}
1382

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1383
	*keysp = keys;
1384
1385
	return LDAP_SUCCESS;
}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1386
1387
#endif
#endif /* !SLAP_NVALUES */
1388

1389
1390
/* Remove all spaces and '-' characters */
static int
1391
1392
1393
1394
1395
1396
telephoneNumberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
	struct berval *normalized )
1397
1398
1399
{
	char *p, *q;