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

#include "portable.h"

#include <stdio.h>

#include <ac/ctype.h>
#include <ac/string.h>
#include <ac/socket.h>

#include "slap.h"
#include "ldap_pvt.h"
18

19
20
#define UTF8MATCH 1

21
22
#ifdef USE_MD5
#include "lutil_md5.h"
23
24
25
26
27
28
/* We should replace MD5 with a faster hash */
#define HASH_BYTES				LUTIL_MD5_BYTES
#define HASH_CONTEXT			lutil_MD5_CTX
#define HASH_Init(c)			lutil_MD5Init(c)
#define HASH_Update(c,buf,len)	lutil_MD5Update(c,buf,len)
#define HASH_Final(d,c)			lutil_MD5Final(d,c)
29
30
31
32
33
34
35
36
37
#else
#include "lutil_hash.h"
/* We should replace MD5 with a faster hash */
#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)
#endif
38

39
/* recycled validatation routines */
40
#define berValidate						blobValidate
41
42
43
44

/* unimplemented pretters */
#define dnPretty						NULL
#define integerPretty					NULL
45
46

/* recycled matching routines */
47
#define bitStringMatch					octetStringMatch
48
#define integerMatch					caseIgnoreIA5Match
49
50
51
#define numericStringMatch				caseIgnoreIA5Match
#define objectIdentifierMatch			caseIgnoreIA5Match
#define telephoneNumberMatch			caseIgnoreIA5Match
52
#define telephoneNumberSubstringsMatch	caseIgnoreIA5SubstringsMatch
53
54
#define generalizedTimeMatch			caseIgnoreIA5Match
#define generalizedTimeOrderingMatch	caseIgnoreIA5Match
55
#define uniqueMemberMatch				dnMatch
56

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

67
68
69
70
/* orderring matching rules */
#define caseIgnoreOrderingMatch			caseIgnoreMatch
#define caseExactOrderingMatch			caseExactMatch

71
/* unimplemented matching routines */
72
73
74
75
76
77
78
#define caseIgnoreListMatch				NULL
#define caseIgnoreListSubstringsMatch	NULL
#define protocolInformationMatch		NULL
#define integerFirstComponentMatch		NULL

#define OpenLDAPaciMatch				NULL
#define authPasswordMatch				NULL
79
80

/* recycled indexing/filtering routines */
81
82
#define dnIndexer						caseIgnoreIndexer
#define dnFilter						caseIgnoreFilter
83
84
#define integerIndexer					caseIgnoreIA5Indexer
#define integerFilter					caseIgnoreIA5Filter
85

86
87
88
89
90
#define telephoneNumberIndexer			caseIgnoreIA5Indexer
#define telephoneNumberFilter			caseIgnoreIA5Filter
#define telephoneNumberSubstringsIndexer	caseIgnoreIA5SubstringsIndexer
#define telephoneNumberSubstringsFilter		caseIgnoreIA5SubstringsFilter

91
92
93
94
static char *strcasechr( const char *str, int c )
{
	char *lower = strchr( str, TOLOWER(c) );
	char *upper = strchr( str, TOUPPER(c) );
95

96
97
98
99
100
101
102
103
	if( lower && upper ) {
		return lower < upper ? lower : upper;
	} else if ( lower ) {
		return lower;
	} else {
		return upper;
	}
}
104

105
106
107
static int
octetStringMatch(
	int *matchp,
108
	slap_mask_t flags,
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;

	if( match == 0 ) {
		match = memcmp( value->bv_val,
			((struct berval *) assertedValue)->bv_val,
			value->bv_len );
	}

	*matchp = match;
	return LDAP_SUCCESS;
}

/* Index generation function */
int octetStringIndexer(
128
129
	slap_mask_t use,
	slap_mask_t flags,
130
131
132
133
134
135
136
137
138
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
	int i;
	size_t slen, mlen;
	struct berval **keys;
139
	HASH_CONTEXT   HASHcontext;
Gary Williams's avatar
Gary Williams committed
140
	unsigned char	HASHdigest[HASH_BYTES];
141
	struct berval digest;
142
143
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
144

145
146
147
	/* we should have at least one value at this point */
	assert( values != NULL && values[0] != NULL );

148
149
150
151
152
153
154
155
156
157
	for( i=0; values[i] != NULL; i++ ) {
		/* just count them */
	}

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

	slen = strlen( syntax->ssyn_oid );
	mlen = strlen( mr->smr_oid );

	for( i=0; values[i] != NULL; i++ ) {
158
		HASH_Init( &HASHcontext );
159
		if( prefix != NULL && prefix->bv_len > 0 ) {
160
			HASH_Update( &HASHcontext,
161
162
				prefix->bv_val, prefix->bv_len );
		}
163
		HASH_Update( &HASHcontext,
164
			syntax->ssyn_oid, slen );
165
		HASH_Update( &HASHcontext,
166
			mr->smr_oid, mlen );
167
		HASH_Update( &HASHcontext,
168
			values[i]->bv_val, values[i]->bv_len );
169
		HASH_Final( HASHdigest, &HASHcontext );
170
171
172
173
174
175
176
177
178
179
180
181
182

		keys[i] = ber_bvdup( &digest );
	}

	keys[i] = NULL;

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
int octetStringFilter(
183
184
	slap_mask_t use,
	slap_mask_t flags,
185
186
187
188
189
190
191
192
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	size_t slen, mlen;
	struct berval **keys;
193
	HASH_CONTEXT   HASHcontext;
Gary Williams's avatar
Gary Williams committed
194
	unsigned char	HASHdigest[HASH_BYTES];
195
196
	struct berval *value = (struct berval *) assertValue;
	struct berval digest;
197
198
	digest.bv_val = HASHdigest;
	digest.bv_len = sizeof(HASHdigest);
199
200
201
202
203
204

	slen = strlen( syntax->ssyn_oid );
	mlen = strlen( mr->smr_oid );

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

205
	HASH_Init( &HASHcontext );
206
	if( prefix != NULL && prefix->bv_len > 0 ) {
207
		HASH_Update( &HASHcontext,
208
209
			prefix->bv_val, prefix->bv_len );
	}
210
	HASH_Update( &HASHcontext,
211
		syntax->ssyn_oid, slen );
212
	HASH_Update( &HASHcontext,
213
		mr->smr_oid, mlen );
214
	HASH_Update( &HASHcontext,
215
		value->bv_val, value->bv_len );
216
	HASH_Final( HASHdigest, &HASHcontext );
217
218
219
220
221
222
223
224

	keys[0] = ber_bvdup( &digest );
	keys[1] = NULL;

	*keysp = keys;

	return LDAP_SUCCESS;
}
225

226
227
228
229
230
231
232
233
234
235
static int
dnValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
	char *dn;

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

236
	dn = get_validated_dn( in->bv_val, 0, 0 );
237

238
239
240
241
	rc = ( dn == NULL ) ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;

	if ( dn != NULL )
		ch_free( dn );
242
243
244
245

	return rc;
}

246
int
247
248
249
250
251
dnNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
252
	struct berval *out;
253

254
255
256
257
	if ( val->bv_len == 0 ) {
		out = ber_bvdup( val );
	} else {
 		char *dn;
258
#ifdef USE_DN_NORMALIZE
259
		dn = get_validated_dn( val->bv_val, 1, 1 );
260
#else
261
		dn = get_validated_dn( val->bv_val, 0, 0 );
262
263
#endif
		if( dn == NULL ) {
264
265
 			return LDAP_INVALID_SYNTAX;
 		}
266

267
268
269
		out = (struct berval *)ch_malloc(sizeof(struct berval));
 		out->bv_val = dn;
 		out->bv_len = strlen( dn );
270
271
272
273
274
275
276
277
	}

	*normalized = out;
	return LDAP_SUCCESS;
}

static int
dnMatch(
278
	int *matchp,
279
	slap_mask_t flags,
280
281
282
283
284
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
285
	int match;
286
287
	struct berval *asserted = (struct berval *) assertedValue;
	
288
289
290
	match = value->bv_len - asserted->bv_len;

	if( match == 0 ) {
291
#ifdef USE_DN_NORMALIZE
292
		match = strcmp( value->bv_val, asserted->bv_val );
293
#else
294
		match = strcasecmp( value->bv_val, asserted->bv_val );
295
#endif
296
297
	}

298
#ifdef NEW_LOGGING
Gary Williams's avatar
Gary Williams committed
299
300
301
	LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
		   "dnMatch: %d\n    %s\n    %s\n", match,
		   value->bv_val, asserted->bv_val ));
302
#else
303
304
	Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
	    match, value->bv_val, asserted->bv_val );
305
306
#endif

307
308
309

	*matchp = match;
	return LDAP_SUCCESS;
310
}
311

312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
static int
nameUIDValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
	struct berval *dn;

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

	dn = ber_bvdup( in );

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

		for(i=dn->bv_len-2; i>2; i--) {
			if( dn->bv_val[i] != '0' &&	dn->bv_val[i] != '1' ) {
				break;
			}
		}
		if( dn->bv_val[i] != '\'' ) {
			return LDAP_INVALID_SYNTAX;
		}
		if( dn->bv_val[i-1] != 'B' ) {
			return LDAP_INVALID_SYNTAX;
		}
		if( dn->bv_val[i-2] != '#' ) {
			return LDAP_INVALID_SYNTAX;
		}

		/* trim the UID to allow use of dn_validate */
		dn->bv_val[i-2] = '\0';
	}

	rc = dn_validate( dn->bv_val ) == NULL
		? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;

	ber_bvfree( dn );
	return rc;
}

static int
nameUIDNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
	struct berval *out = ber_bvdup( val );

	if( out->bv_len != 0 ) {
		char *dn;
		ber_len_t dnlen;
		char *uid = NULL;
		ber_len_t uidlen = 0;

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

			if( uid == NULL ) {
				ber_bvfree( out );
				return LDAP_INVALID_SYNTAX;
			}

			uidlen = out->bv_len - (out->bv_val - uid);
			/* temporarily trim the UID */
			*uid = '\0';
		}

#ifdef USE_DN_NORMALIZE
		dn = dn_normalize( out->bv_val );
#else
		dn = dn_validate( out->bv_val );
#endif

		if( dn == NULL ) {
			ber_bvfree( out );
			return LDAP_INVALID_SYNTAX;
		}

		dnlen = strlen(dn);

		if( uidlen ) {
			/* restore the separator */
			*uid = '#';
			/* shift the UID */
			SAFEMEMCPY( &dn[dnlen], uid, uidlen );
		}

		out->bv_val = dn;
		out->bv_len = dnlen + uidlen;
	}

	*normalized = out;
	return LDAP_SUCCESS;
}

410
411
412
413
414
415
416
417
418
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_OTHER;
}

419
static int
420
blobValidate(
421
422
423
424
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
425
	return LDAP_SUCCESS;
426
427
}

428
429
430
431
432
433
434
435
436
437
438
439
440
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;
	}
441

442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
	if( in->bv_val[0] != 'B' ||
		in->bv_val[1] != '\'' ||
		in->bv_val[in->bv_len-1] != '\'' )
	{
		return LDAP_INVALID_SYNTAX;
	}

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

	return LDAP_SUCCESS;
}

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
/*
 * 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.
 */
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,
489
	slap_mask_t flags,
490
491
492
493
494
495
496
497
498
499
500
	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;
}

501
#if UTF8MATCH
Kurt Zeilenga's avatar
Kurt Zeilenga committed
502
503
504
505
506
507
508
509
510
/* case insensitive UTF8 strncmp with offset for second string */
static int
UTF8oncasecmp(
	struct berval *right,
	struct berval *left,
	ber_len_t len,
	ber_len_t offset )
{
	ber_len_t r, l;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
511
512
	ber_len_t rlen, llen;
	ber_len_t rslen, lslen;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
513
514
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
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
	ldap_unicode_t ru, lu;
	ldap_unicode_t ruu, luu;

	rslen = len < right->bv_len ? len : right->bv_len;
	lslen = len + offset < left->bv_len ? len : left->bv_len;

	for( r = 0, l = offset;
		r < rslen && l < lslen;
		r+=rlen, l+=llen )
	{
		/*
		 * XXYYZ: we convert to ucs4 even though -llunicode
		 * expects ucs2 in an unsigned long
		 */
		ru = ldap_utf8_to_ucs4( &right->bv_val[r] );
		if( ru == LDAP_UCS4_INVALID ) {
			return 1;
		}

		lu = ldap_utf8_to_ucs4( &left->bv_val[l] );
		if( lu == LDAP_UCS4_INVALID ) {
			return -1;
		}

		ruu = uctoupper( ru );
		luu = uctoupper( lu );

		if( ruu > luu ) {
			return 1;
		} else if( luu > ruu ) {
			return -1;
		}

		rlen = LDAP_UTF8_CHARLEN( &right->bv_val[r] );
		llen = LDAP_UTF8_CHARLEN( &left->bv_val[l] );
	}

	if( r < rslen ) {
		/* less left */
		return -1;
	}

	if( l < lslen ) {
		/* less right */
		return 1;
	}

	return 0;
}

static char *UTF8casechr( const char *str, const char *c )
{
	char *p, *lower, *upper;
	ldap_ucs4_t tch, ch = ldap_utf8_to_ucs4(c);

	tch = uctolower ( ch );
	for( p = (char *) str; *p != '\0'; LDAP_UTF8_INCR(p) ) {
		if( ldap_utf8_to_ucs4( p ) == tch ) {
			break;
		} 
	}
	lower = *p != '\0' ? p : NULL;

	tch = uctoupper ( ch );
	for( p = (char *) str; *p != '\0'; LDAP_UTF8_INCR(p) ) {
		if( ldap_utf8_to_ucs4( p ) == tch ) {
			break;
		} 
	}
	upper = *p != '\0' ? p : NULL;
	
	if( lower && upper ) {
		return lower < upper ? lower : upper;
	} else if ( lower ) {
		return lower;
	} else {
		return upper;
	}
}
592
593
#endif

594
595
596
597
598
599
600
601
602
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
	unsigned char *u = in->bv_val;

603
604
	if( !in->bv_len ) return LDAP_INVALID_SYNTAX;

605
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
606
607
608
609
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );

		/* should not be zero */
610
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
611
612
613

		/* make sure len corresponds with the offset
			to the next character */
614
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
615
616
	}

617
	if( count != 0 ) return LDAP_INVALID_SYNTAX;
618

619
	return LDAP_SUCCESS;
620
621
622
623
624
625
626
627
628
}

static int
UTF8StringNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
	struct berval *newval;
629
	char *p, *q, *s;
630

631
	newval = ch_malloc( sizeof( struct berval ) );
632

633
	p = val->bv_val;
634

635
636
637
	/* Ignore initial whitespace */
	while ( ldap_utf8_isspace( p ) ) {
		LDAP_UTF8_INCR( p );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
638
	}
639

640
641
	if( *p == '\0' ) {
		ch_free( newval );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
642
643
		return LDAP_INVALID_SYNTAX;
	}
644

645
646
647
	newval->bv_val = ch_strdup( p );
	p = q = newval->bv_val;
	s = NULL;
648

649
650
	while ( *p ) {
		int len;
651

652
653
654
655
656
		if ( ldap_utf8_isspace( p ) ) {
			len = LDAP_UTF8_COPY(q,p);
			s=q;
			p+=len;
			q+=len;
657

658
659
660
661
			/* Ignore the extra whitespace */
			while ( ldap_utf8_isspace( p ) ) {
				LDAP_UTF8_INCR( p );
			}
Kurt Zeilenga's avatar
Kurt Zeilenga committed
662
		} else {
663
664
665
666
			len = LDAP_UTF8_COPY(q,p);
			s=NULL;
			p+=len;
			q+=len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
667
		}
668
669
670
671
	}

	assert( *newval->bv_val );
	assert( newval->bv_val < p );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
672
	assert( q <= p );
673

674
675
676
677
678
679
680
681
682
683
684
	/* cannot start with a space */
	assert( !ldap_utf8_isspace(newval->bv_val) );

	/*
	 * If the string ended in space, backup the pointer one
	 * position.  One is enough because the above loop collapsed
	 * all whitespace to a single space.
	 */

	if ( s != NULL ) {
		q = s;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
685
	}
686

687
688
689
690
691
692
693
694
	/* cannot end with a space */
	assert( !ldap_utf8_isspace( LDAP_UTF8_PREV(q) ) );

	/* null terminate */
	*q = '\0';

	newval->bv_len = q - newval->bv_val;
	*normalized = newval;
695

696
	return LDAP_SUCCESS;
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
723
724
725
726
727
728
729
730
731
732
733
#if defined(SLAPD_APPROX_MULTISTRING)

#if defined(SLAPD_APPROX_INITIALS)
#define SLAPD_APPROX_DELIMITER "._ "
#define SLAPD_APPROX_WORDLEN 2
#else
#define SLAPD_APPROX_DELIMITER " "
#define SLAPD_APPROX_WORDLEN 1
#endif

static int
approxMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	char *val, *assertv, **values, **words, *c;
	int i, count, len, nextchunk=0, nextavail=0;


	/* Isolate how many words there are */
	val = ch_strdup( value->bv_val );
	for( c=val,count=1; *c; c++ ) {
		c = strpbrk( c, SLAPD_APPROX_DELIMITER );
		if ( c == NULL ) break;
		*c = '\0';
		count++;
	}

	/* Get a phonetic copy of each word */
	words = (char **)ch_malloc( count * sizeof(char *) );
	values = (char **)ch_malloc( count * sizeof(char *) );
Gary Williams's avatar
Gary Williams committed
734
	for( c=val,i=0;	 i<count;  i++,c+=strlen(c)+1 ) {
735
736
737
738
739
740
741
742
743
744
745
		words[i] = c;
		values[i] = phonetic(c);
	}


	/* Work through the asserted value's words, to see if  at least some
	   of the words are there, in the same order. */
	assertv = ch_strdup( ((struct berval *)assertedValue)->bv_val );
	len = 0;
	while ( nextchunk < ((struct berval *)assertedValue)->bv_len ) {
		len = strcspn( assertv + nextchunk, SLAPD_APPROX_DELIMITER);
746
747
748
749
		if( len == 0 ) {
			nextchunk++;
			continue;
		}
750
#if defined(SLAPD_APPROX_INITIALS)
751
		else if( len == 1 ) {
752
753
			/* Single letter words need to at least match one word's initial */
			for( i=nextavail; i<count; i++ )
754
755
				if( !strncasecmp( assertv+nextchunk, words[i], 1 )) {
					nextavail=i+1;
756
					break;
757
				}
758
759
		}
#endif
760
		else {
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
			/* Isolate the next word in the asserted value and phonetic it */
			assertv[nextchunk+len] = '\0';
			val = phonetic( assertv + nextchunk );

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

		/* This chunk in the asserted value was NOT within the *value. */
		if( i >= count ) {
			nextavail=-1;
			break;
		}

		/* Go on to the next word in the asserted value */
		nextchunk += len+1;
	}

	/* If some of the words were seen, call it a match */
	if( nextavail > 0 ) {
		*matchp = 0;
	}
	else {
		*matchp = 1;
	}

	/* Cleanup allocs */
	ch_free( assertv );
	for( i=0; i<count; i++ ) {
		ch_free( values[i] );
	}
	ch_free( values );
	ch_free( words );
	ch_free( val );

	return LDAP_SUCCESS;
}


int 
approxIndexer(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
	char *val, *c;
	int i,j, len, wordcount, keycount=0;
	struct berval **newkeys, **keys=NULL;


	for( j=0; values[j] != NULL; j++ ) {

		/* Isolate how many words there are. There will be a key for each */
		val = ch_strdup( values[j]->bv_val );
Gary Williams's avatar
Gary Williams committed
824
		for( wordcount=0,c=val;	 *c;  c++) {
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
			len = strcspn(c, SLAPD_APPROX_DELIMITER);
			if( len >= SLAPD_APPROX_WORDLEN ) wordcount++;
			c+= len;
			if (*c == '\0') break;
			*c = '\0';
		}

		/* Allocate/increase storage to account for new keys */
		newkeys = (struct berval **)ch_malloc( (keycount + wordcount + 1) 
		   * sizeof(struct berval *) );
		memcpy( newkeys, keys, keycount * sizeof(struct berval *) );
		if( keys ) ch_free( keys );
		keys = newkeys;

		/* Get a phonetic copy of each word */
Gary Williams's avatar
Gary Williams committed
840
		for( c=val,i=0;	 i<wordcount;  c+=len+1	 ) {
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
			len = strlen( c );
			if( len < SLAPD_APPROX_WORDLEN ) continue;
			keys[keycount] = (struct berval *)ch_malloc( sizeof(struct berval) );
			keys[keycount]->bv_val = phonetic( c );
			keys[keycount]->bv_len = strlen( keys[keycount]->bv_val );
			keycount++;
			i++;
		}

		ch_free( val );
	}
	keys[keycount] = NULL;
	*keysp = keys;

	return LDAP_SUCCESS;
}


int 
approxFilter(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	char *val, *c;
	int i, count, len;
	struct berval **keys;


	/* Isolate how many words there are. There will be a key for each */
	val = ch_strdup( ((struct berval *)assertValue)->bv_val );
	for( count=0,c=val;  *c;  c++) {
		len = strcspn(c, SLAPD_APPROX_DELIMITER);
		if( len >= SLAPD_APPROX_WORDLEN ) count++;
		c+= len;
		if (*c == '\0') break;
		*c = '\0';
	}

	/* Allocate storage for new keys */
	keys = (struct berval **)ch_malloc( (count + 1) * sizeof(struct berval *) );

	/* Get a phonetic copy of each word */
Gary Williams's avatar
Gary Williams committed
888
	for( c=val,i=0;	 i<count; c+=len+1 ) {
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
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
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
		len = strlen(c);
		if( len < SLAPD_APPROX_WORDLEN ) continue;
		keys[i] = (struct berval *)ch_malloc( sizeof(struct berval) );
		keys[i]->bv_val = phonetic( c );
		keys[i]->bv_len = strlen( keys[i]->bv_val );
		i++;
	}

	ch_free( val );

	keys[count] = NULL;
	*keysp = keys;

	return LDAP_SUCCESS;
}


#else
/* No other form of Approximate Matching is defined */

static int
approxMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	char *vapprox, *avapprox;

	vapprox = phonetic( value->bv_val );
	avapprox = phonetic( ((struct berval *)assertedValue)->bv_val);

	*matchp = strcmp( vapprox, avapprox );

	ch_free( vapprox );
	ch_free( avapprox );

	return LDAP_SUCCESS;
}

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


	for( i=0; values[i] != NULL; i++ ) {
		/* just count them */
	}
	assert( i > 0 );

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

	/* Copy each value and run it through phonetic() */
	for( i=0; values[i] != NULL; i++ ) {
		keys[i] = ch_malloc( sizeof( struct berval * ) );
		keys[i]->bv_val = phonetic( values[i]->bv_val );
		keys[i]->bv_len = strlen( keys[i]->bv_val );
	}
	keys[i] = NULL;

	*keysp = keys;
	return LDAP_SUCCESS;
}


int 
approxFilter(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	struct berval **keys;


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

	/* Copy the value and run it through phonetic() */
	keys[0] = ch_malloc( sizeof( struct berval * ) );
	keys[0]->bv_val = phonetic( ((struct berval *)assertValue)->bv_val );
	keys[0]->bv_len = strlen( keys[0]->bv_val );
	keys[1] = NULL;

	*keysp = keys;
	return LDAP_SUCCESS;
}
#endif


992
static int
993
caseExactMatch(
994
	int *matchp,
995
	slap_mask_t flags,
996
997
998
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
999
	void *assertedValue )
1000
{
For faster browsing, not all history is shown. View entire blame