schema_init.c 66.2 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
/* not yet implemented */
32
#define uniqueMemberMatch NULL
33

Pierangelo Masarati's avatar
Pierangelo Masarati committed
34
35
#define	OpenLDAPaciMatch			NULL

36
37
/* approx matching rules */
#define directoryStringApproxMatchOID	"1.3.6.1.4.1.4203.666.4.4"
38
#define directoryStringApproxMatch		approxMatch
Gary Williams's avatar
Gary Williams committed
39
#define directoryStringApproxIndexer	approxIndexer
40
#define directoryStringApproxFilter		approxFilter
41
#define IA5StringApproxMatchOID			"1.3.6.1.4.1.4203.666.4.5"
Gary Williams's avatar
Gary Williams committed
42
#define IA5StringApproxMatch			approxMatch
43
#define IA5StringApproxIndexer			approxIndexer
Gary Williams's avatar
Gary Williams committed
44
#define IA5StringApproxFilter			approxFilter
45

Kurt Zeilenga's avatar
Kurt Zeilenga committed
46
47
48
49
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
50
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
51
52
53
	/* no value allowed */
	return LDAP_INVALID_SYNTAX;
}
54

Kurt Zeilenga's avatar
Kurt Zeilenga committed
55
56
57
58
59
60
61
static int
blobValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_SUCCESS;
62
}
63

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
64
65
#define berValidate blobValidate

66
67
68
static int
octetStringMatch(
	int *matchp,
69
	slap_mask_t flags,
70
71
72
73
74
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
75
76
	struct berval *asserted = (struct berval *) assertedValue;
	int match = value->bv_len - asserted->bv_len;
77
78

	if( match == 0 ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
79
		match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
80
81
82
83
84
85
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

86
87
88
89
90
91
92
93
94
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
95
	struct berval *asserted = (struct berval *) assertedValue;
96
	ber_len_t v_len  = value->bv_len;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
97
	ber_len_t av_len = asserted->bv_len;
98

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
99
	int match = memcmp( value->bv_val, asserted->bv_val,
100
		(v_len < av_len ? v_len : av_len) );
101
102
103

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

104
105
106
107
	*matchp = match;
	return LDAP_SUCCESS;
}

108
/* Index generation function */
109
int octetStringIndexer(
110
111
	slap_mask_t use,
	slap_mask_t flags,
112
113
114
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
115
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
116
117
	BerVarray *keysp,
	void *ctx )
118
119
120
{
	int i;
	size_t slen, mlen;
121
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
122
123
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
124
	struct berval digest;
125
126
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
127

128
	for( i=0; values[i].bv_val != NULL; i++ ) {
129
130
131
		/* just count them */
	}

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

Howard Chu's avatar
Howard Chu committed
135
	keys = sl_malloc( sizeof( struct berval ) * (i+1), ctx );
136

137
138
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
139

140
	for( i=0; values[i].bv_val != NULL; i++ ) {
141
		HASH_Init( &HASHcontext );
142
		if( prefix != NULL && prefix->bv_len > 0 ) {
143
			HASH_Update( &HASHcontext,
144
145
				prefix->bv_val, prefix->bv_len );
		}
146
		HASH_Update( &HASHcontext,
147
			syntax->ssyn_oid, slen );
148
		HASH_Update( &HASHcontext,
149
			mr->smr_oid, mlen );
150
		HASH_Update( &HASHcontext,
151
			values[i].bv_val, values[i].bv_len );
152
		HASH_Final( HASHdigest, &HASHcontext );
153

Howard Chu's avatar
Howard Chu committed
154
		ber_dupbv_x( &keys[i], &digest, ctx );
155
156
	}

157
	keys[i].bv_val = NULL;
158
	keys[i].bv_len = 0;
159
160
161
162
163
164
165

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
166
int octetStringFilter(
167
168
	slap_mask_t use,
	slap_mask_t flags,
169
170
171
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
172
	void * assertedValue,
Howard Chu's avatar
Howard Chu committed
173
174
	BerVarray *keysp,
	void *ctx )
175
176
{
	size_t slen, mlen;
177
	BerVarray keys;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
178
179
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
180
	struct berval *value = (struct berval *) assertedValue;
181
	struct berval digest;
182
183
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
184

185
186
	slen = syntax->ssyn_oidlen;
	mlen = mr->smr_oidlen;
187

Howard Chu's avatar
Howard Chu committed
188
	keys = sl_malloc( sizeof( struct berval ) * 2, ctx );
189

190
	HASH_Init( &HASHcontext );
191
	if( prefix != NULL && prefix->bv_len > 0 ) {
192
		HASH_Update( &HASHcontext,
193
194
			prefix->bv_val, prefix->bv_len );
	}
195
	HASH_Update( &HASHcontext,
196
		syntax->ssyn_oid, slen );
197
	HASH_Update( &HASHcontext,
198
		mr->smr_oid, mlen );
199
	HASH_Update( &HASHcontext,
200
		value->bv_val, value->bv_len );
201
	HASH_Final( HASHdigest, &HASHcontext );
202

Howard Chu's avatar
Howard Chu committed
203
	ber_dupbv_x( keys, &digest, ctx );
204
	keys[1].bv_val = NULL;
205
	keys[1].bv_len = 0;
206
207
208
209
210

	*keysp = keys;

	return LDAP_SUCCESS;
}
211

212
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
213
octetStringSubstringsMatch(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
214
215
	int *matchp,
	slap_mask_t flags,
216
	Syntax *syntax,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
217
218
219
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
220
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
221
222
223
224
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
225
	ber_len_t inlen = 0;
226

Kurt Zeilenga's avatar
Kurt Zeilenga committed
227
228
229
	/* Add up asserted input length */
	if( sub->sa_initial.bv_val ) {
		inlen += sub->sa_initial.bv_len;
230
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
231
232
233
234
235
236
237
	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;
238
239
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
240
241
242
243
	if( sub->sa_initial.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
244
245
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
246
247
		match = memcmp( sub->sa_initial.bv_val, left.bv_val,
			sub->sa_initial.bv_len );
248

Kurt Zeilenga's avatar
Kurt Zeilenga committed
249
250
251
		if( match != 0 ) {
			goto done;
		}
252

Kurt Zeilenga's avatar
Kurt Zeilenga committed
253
254
255
256
		left.bv_val += sub->sa_initial.bv_len;
		left.bv_len -= sub->sa_initial.bv_len;
		inlen -= sub->sa_initial.bv_len;
	}
257

Kurt Zeilenga's avatar
Kurt Zeilenga committed
258
259
260
261
262
	if( sub->sa_final.bv_val ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
263

Kurt Zeilenga's avatar
Kurt Zeilenga committed
264
265
266
		match = memcmp( sub->sa_final.bv_val,
			&left.bv_val[left.bv_len - sub->sa_final.bv_len],
			sub->sa_final.bv_len );
267

Kurt Zeilenga's avatar
Kurt Zeilenga committed
268
269
		if( match != 0 ) {
			goto done;
270
271
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
272
273
		left.bv_len -= sub->sa_final.bv_len;
		inlen -= sub->sa_final.bv_len;
274
275
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
276
277
278
279
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i].bv_val; i++) {
			ber_len_t idx;
			char *p;
280

Kurt Zeilenga's avatar
Kurt Zeilenga committed
281
282
283
284
285
286
retry:
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}
287

Kurt Zeilenga's avatar
Kurt Zeilenga committed
288
289
290
			if( sub->sa_any[i].bv_len == 0 ) {
				continue;
			}
291

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
294
295
296
			if( p == NULL ) {
				match = 1;
				goto done;
297
298
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
299
			idx = p - left.bv_val;
300

Kurt Zeilenga's avatar
Kurt Zeilenga committed
301
302
303
304
			if( idx >= left.bv_len ) {
				/* this shouldn't happen */
				return LDAP_OTHER;
			}
305

Kurt Zeilenga's avatar
Kurt Zeilenga committed
306
307
			left.bv_val = p;
			left.bv_len -= idx;
308

Kurt Zeilenga's avatar
Kurt Zeilenga committed
309
310
311
312
313
			if( sub->sa_any[i].bv_len > left.bv_len ) {
				/* not enough left */
				match = 1;
				goto done;
			}
314

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
319
320
321
322
323
			if( match != 0 ) {
				left.bv_val++;
				left.bv_len--;
				goto retry;
			}
324

Kurt Zeilenga's avatar
Kurt Zeilenga committed
325
326
327
			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;
328
329
330
		}
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
331
332
done:
	*matchp = match;
333
334
335
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
336
337
/* Substrings Index generation function */
static int
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
338
octetStringSubstringsIndexer(
Kurt Zeilenga's avatar
Kurt Zeilenga committed
339
340
341
342
343
344
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
Howard Chu's avatar
Howard Chu committed
345
346
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
347
348
349
350
351
{
	ber_len_t i, j, nkeys;
	size_t slen, mlen;
	BerVarray keys;

Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
352
353
	HASH_CONTEXT HASHcontext;
	unsigned char HASHdigest[HASH_BYTES];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
	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
369
					(SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
370
			} else {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
371
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
372
373
374
375
376
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
			if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
377
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MAXLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
378
379
380
381
382
383
384
385
			}
		}

		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
386
				nkeys += values[i].bv_len - (SLAP_INDEX_SUBSTR_MINLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
387
388
389
390
391
392
393
394
395
396
			}
		}
	}

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

Howard Chu's avatar
Howard Chu committed
397
	keys = sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
398
399
400
401
402
403
404
405
406
407
408
409
410
411

	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
412
			max = values[i].bv_len - (SLAP_INDEX_SUBSTR_MAXLEN - 1);
Kurt Zeilenga's avatar
Kurt Zeilenga committed
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431

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

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

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

Howard Chu's avatar
Howard Chu committed
459
				ber_dupbv_x( &keys[nkeys++], &digest, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
			}

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

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

		}

	}

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

Howard Chu's avatar
Howard Chu committed
554
	keys = sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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
	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 );

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

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

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

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

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

	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
673
674
675
	 * RFC 2252 section 6.3 Bit String
	 *	bitstring = "'" *binary-digit "'B"
	 *	binary-digit = "0" / "1"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
676
677
678
679
680
681
682
683
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
	 * 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
715
			if( dn.bv_val[i] != '0' && dn.bv_val[i] != '1' ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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
				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,
Howard Chu's avatar
Howard Chu committed
741
742
	struct berval *normalized,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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
{
	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';
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
769
		rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
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

		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.
 */
804
805
806
807
808
809
810
811
812
813
static int
booleanValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* very unforgiving validation, requires no normalization
	 * before simplistic matching
	 */

	if( in->bv_len == 4 ) {
814
		if( bvmatch( in, &slap_true_bv ) ) {
815
816
817
			return LDAP_SUCCESS;
		}
	} else if( in->bv_len == 5 ) {
818
		if( bvmatch( in, &slap_false_bv ) ) {
819
820
821
822
823
824
825
826
827
828
			return LDAP_SUCCESS;
		}
	}

	return LDAP_INVALID_SYNTAX;
}

static int
booleanMatch(
	int *matchp,
829
	slap_mask_t flags,
830
831
832
833
834
835
836
837
838
839
840
	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;
}

841
842
843
844
845
/*-------------------------------------------------------------------
LDAP/X.500 string syntax / matching rules have a few oddities.  This
comment attempts to detail how slapd(8) treats them.

Summary:
846
  StringSyntax		X.500	LDAP	Matching/Comments
847
848
  DirectoryString	CHOICE	UTF8	i/e + ignore insignificant spaces
  PrintableString	subset	subset	i/e + ignore insignificant spaces
849
  PrintableString	subset	subset	i/e + ignore insignificant spaces
Kurt Zeilenga's avatar
cleanup    
Kurt Zeilenga committed
850
  NumericString		subset	subset	ignore all spaces
851
852
853
  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
854
  TelephoneNumber	subset	subset	i + ignore all spaces and "-"
855
856
857
858
859
860
861
862
863
864

  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.

865
  In LDAPv3, a directory string is a UTF-8 encoded UCS string.
866
  A directory string cannot be zero length.
867
868
869
870
871
872
873
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

  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.

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

913
914
915
916
917
918
919
920
921
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
	unsigned char *u = in->bv_val;

922
923
924
925
	if( in->bv_len == 0 && syntax == slap_schema.si_syn_directoryString ) {
		/* directory strings cannot be empty */
		return LDAP_INVALID_SYNTAX;
	}
926

927
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
928
		/* get the length indicated by the first byte */
929
		len = LDAP_UTF8_CHARLEN2( u, len );
930

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

		/* make sure len corresponds with the offset
			to the next character */
962
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
963
964
	}

965
966
967
	if( count != 0 ) {
		return LDAP_INVALID_SYNTAX;
	}
968

969
	return LDAP_SUCCESS;
970
971
}

972
973
974
975
976
977
static int
UTF8StringNormalize(
	slap_mask_t use,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
978
979
	struct berval *normalized,
	void *ctx )
980
981
982
983
984
985
986
987
988
989
990
991
992
993
{
	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;
	}

994
	flags = SLAP_MR_ASSOCIATED( mr, slap_schema.si_mr_caseExactMatch )
995
		? LDAP_UTF8_NOCASEFOLD : LDAP_UTF8_CASEFOLD;
996
	flags |= ( ( use & SLAP_MR_EQUALITY_APPROX ) == SLAP_MR_EQUALITY_APPROX )
997
998
		? LDAP_UTF8_APPROX : 0;

Howard Chu's avatar
Howard Chu committed
999
	val = UTF8bvnormalize( val, &tmp, flags, ctx );
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
	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
1025
1026
		}
		nvalue.bv_val[nvalue.bv_len] = '\0';
1027

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1028
1029
1030
1031
1032
1033
	} else {
		/* string of all spaces is treated as one space */
		nvalue.bv_val[0] = ' ';
		nvalue.bv_val[1] = '\0';
		nvalue.bv_len = 1;
	}
1034

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1035
	*normalized = nvalue;
1036
1037
1038
	return LDAP_SUCCESS;
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1039
#if defined(SLAPD_APPROX_INITIALS)
1040
1041
#	define SLAPD_APPROX_DELIMITER "._ "
#	define SLAPD_APPROX_WORDLEN 2
1042
#else
1043
1044
#	define SLAPD_APPROX_DELIMITER " "
#	define SLAPD_APPROX_WORDLEN 1
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1045
#endif
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055

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
1056
1057
1058
	struct berval *nval, *assertv;
	char *val, **values, **words, *c;
	int i, count, len, nextchunk=0, nextavail=0;
1059

1060
	/* Yes, this is necessary */
1061
	nval = UTF8bvnormalize( value, NULL, LDAP_UTF8_APPROX, NULL );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1062
	if( nval == NULL ) {
1063
1064
1065
1066
1067
		*matchp = 1;
		return LDAP_SUCCESS;
	}

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1076
1077
1078
1079
1080
1081
	/* 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++;
1082
1083
	}

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1092
1093
1094
1095
1096
1097
1098
	/* 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++;
1099
			continue;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1100
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1101
1102
1103
1104
1105
1106
1107
1108
#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;
				}
1109
		}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1110
1111
1112
1113
1114
#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 );
1115

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1116
1117
1118
1119
1120
1121
			/* 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;
				}
1122
			}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1123
			ch_free( val );
1124
		}
1125

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1126
1127
1128
1129
		/* This chunk in the asserted value was NOT within the *value. */
		if( i >= count ) {
			nextavail=-1;
			break;
1130
1131
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1132
1133
		/* Go on to the next word in the asserted value */
		nextchunk += len+1;
1134
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1135

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1136
1137
1138
1139
1140
1141
1142
	/* If some of the words were seen, call it a match */
	if( nextavail > 0 ) {
		*matchp = 0;
	}
	else {
		*matchp = 1;
	}
1143

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1144
1145
1146
1147
1148
1149
1150
1151
	/* Cleanup allocs */
	ber_bvfree( assertv );
	for( i=0; i<count; i++ ) {
		ch_free( values[i] );
	}
	ch_free( values );
	ch_free( words );
	ber_bvfree( nval );
1152

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1153
1154
	return LDAP_SUCCESS;
}
1155

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1156
1157
1158
1159
1160
1161
1162
1163
static int 
approxIndexer(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	BerVarray values,
1164
1165
	BerVarray *keysp,
	void *ctx )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1166
1167
1168
1169
1170
{
	char *c;
	int i,j, len, wordcount, keycount=0;
	struct berval *newkeys;
	BerVarray keys=NULL;
1171

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1172
1173
1174
	for( j=0; values[j].bv_val != NULL; j++ ) {
		struct berval val = { 0, NULL };
		/* Yes, this is necessary */
1175
		UTF8bvnormalize( &values[j], &val, LDAP_UTF8_APPROX, NULL );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1176
		assert( val.bv_val != NULL );
1177

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1178
1179
1180
1181
1182
1183
1184
1185
		/* 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';
		}
1186

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1187
1188
1189
1190
1191
1192
		/* 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;
1193

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1194
1195
1196
1197
1198
1199
1200
		/* 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++;
1201
		}
1202

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1203
		ber_memfree( val.bv_val );
1204
	}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1205
1206
	keys[keycount].bv_val = NULL;
	*keysp = keys;
1207

1208
1209
	return LDAP_SUCCESS;
}
1210

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1211
1212
static int 
approxFilter(
1213
	slap_mask_t use,
1214
	slap_mask_t flags,
1215
1216
1217
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
1218
	void * assertedValue,
1219
1220
	BerVarray *keysp,
	void *ctx )
1221
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1222
1223
1224
	char *c;
	int i, count, len;
	struct berval *val;
1225
	BerVarray keys;
1226

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1227
1228
	/* Yes, this is necessary */
	val = UTF8bvnormalize( ((struct berval *)assertedValue),
1229
		NULL, LDAP_UTF8_APPROX, NULL );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1230
1231
1232
1233
1234
1235
	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;
1236
	}
1237

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1238
1239
1240
1241
1242
1243
1244
	/* 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';
1245
1246
	}

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

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1250
1251
1252
1253
1254
1255
	/* 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++;
1256
1257
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1258
	ber_bvfree( val );
1259

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1260
1261
	keys[count].bv_val = NULL;
	*keysp = keys;
1262

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1263
1264
	return LDAP_SUCCESS;
}
1265

1266
1267
/* Remove all spaces and '-' characters */
static int
1268
1269
1270
1271
1272
telephoneNumberNormalize(
	slap_mask_t usage,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *val,
Howard Chu's avatar
Howard Chu committed
1273
1274
	struct berval *normalized,
	void *ctx )
1275
1276
1277
{
	char *p, *q;

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1278
1279
1280
	/* validator should have refused an empty string */
	assert( val->bv_len );