schema_init.c 89.5 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"
Kurt Zeilenga's avatar
Kurt Zeilenga committed
18
#include "ldap_pvt_uc.h"
19
20
#include "lutil_md5.h"

21
/* recycled validatation routines */
22
#define berValidate						blobValidate
23
#define nameUIDValidate					dnValidate
24

25
26
27
/* unimplemented validators */
#define bitStringValidate				NULL

28
/* recycled normalization routines */
29
30
31
#define faxNumberNormalize				numericStringNormalize
#define phoneNumberNormalize			numericStringNormalize
#define telexNumberNormalize			numericStringNormalize
32
#define integerNormalize				numericStringNormalize
33
#define nameUIDNormalize				dnNormalize
34
35
36
37
38
39
40

/* unimplemented normalizers */
#define bitStringNormalize				NULL

/* unimplemented pretters */
#define dnPretty						NULL
#define integerPretty					NULL
41

42
43
44
/* recyclied pretters */
#define nameUIDPretty					dnPretty

45
/* recycled matching routines */
46
47
48
49
#define numericStringMatch				caseIgnoreMatch
#define objectIdentifierMatch			numericStringMatch
#define integerMatch					numericStringMatch
#define telephoneNumberMatch			numericStringMatch
Kurt Zeilenga's avatar
Kurt Zeilenga committed
50
#define telephoneNumberSubstringsMatch	caseIgnoreSubstringsMatch
51
52
#define generalizedTimeMatch			numericStringMatch
#define generalizedTimeOrderingMatch	numericStringMatch
53
#define uniqueMemberMatch				dnMatch
54

55
56
57
58
59
60
/* approx matching rules */
#define directoryStringApproxMatchOID	"1.3.6.1.4.1.4203.666.4.4"
#define directoryStringApproxMatch		NULL
#define IA5StringApproxMatchOID			"1.3.6.1.4.1.4203.666.4.5"
#define IA5StringApproxMatch			NULL

61
62
63
64
/* orderring matching rules */
#define caseIgnoreOrderingMatch			caseIgnoreMatch
#define caseExactOrderingMatch			caseExactMatch

65
/* unimplemented matching routines */
66
67
68
69
70
71
72
73
74
#define caseIgnoreListMatch				NULL
#define caseIgnoreListSubstringsMatch	NULL
#define bitStringMatch					NULL
#define presentationAddressMatch		NULL
#define protocolInformationMatch		NULL
#define integerFirstComponentMatch		NULL

#define OpenLDAPaciMatch				NULL
#define authPasswordMatch				NULL
75
76

/* recycled indexing/filtering routines */
77
78
#define dnIndexer						caseIgnoreIndexer
#define dnFilter						caseIgnoreFilter
79

80
81
82
83
static char *strcasechr( const char *str, int c )
{
	char *lower = strchr( str, TOLOWER(c) );
	char *upper = strchr( str, TOUPPER(c) );
84

85
86
87
88
89
90
91
92
	if( lower && upper ) {
		return lower < upper ? lower : upper;
	} else if ( lower ) {
		return lower;
	} else {
		return upper;
	}
}
93

94
95
96
static int
octetStringMatch(
	int *matchp,
97
	slap_mask_t flags,
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
	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(
117
118
	slap_mask_t use,
	slap_mask_t flags,
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
	int i;
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[16];
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

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

	assert( i > 0 );

	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++ ) {
		lutil_MD5Init( &MD5context );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			lutil_MD5Update( &MD5context,
				prefix->bv_val, prefix->bv_len );
		}
		lutil_MD5Update( &MD5context,
			syntax->ssyn_oid, slen );
		lutil_MD5Update( &MD5context,
			mr->smr_oid, mlen );
		lutil_MD5Update( &MD5context,
			values[i]->bv_val, values[i]->bv_len );
		lutil_MD5Final( MD5digest, &MD5context );

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

	keys[i] = NULL;

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Index generation function */
int octetStringFilter(
171
172
	slap_mask_t use,
	slap_mask_t flags,
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[LUTIL_MD5_BYTES];
	struct berval *value = (struct berval *) assertValue;
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

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

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

	lutil_MD5Init( &MD5context );
	if( prefix != NULL && prefix->bv_len > 0 ) {
		lutil_MD5Update( &MD5context,
			prefix->bv_val, prefix->bv_len );
	}
	lutil_MD5Update( &MD5context,
		syntax->ssyn_oid, slen );
	lutil_MD5Update( &MD5context,
		mr->smr_oid, mlen );
	lutil_MD5Update( &MD5context,
		value->bv_val, value->bv_len );
	lutil_MD5Final( MD5digest, &MD5context );

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

	*keysp = keys;

	return LDAP_SUCCESS;
}
213

214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
static int
dnValidate(
	Syntax *syntax,
	struct berval *in )
{
	int rc;
	char *dn;

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

	dn = ch_strdup( in->bv_val );

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

	ch_free( dn );
	return rc;
}

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

	if( out->bv_len != 0 ) {
		char *dn;
#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;
		}

		out->bv_val = dn;
		out->bv_len = strlen( dn );
	}

	*normalized = out;
	return LDAP_SUCCESS;
}

static int
dnMatch(
264
	int *matchp,
265
	slap_mask_t flags,
266
267
268
269
270
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
271
	int match;
272
273
	struct berval *asserted = (struct berval *) assertedValue;
	
274
275
276
	match = value->bv_len - asserted->bv_len;

	if( match == 0 ) {
277
#ifdef USE_DN_NORMALIZE
278
		match = strcmp( value->bv_val, asserted->bv_val );
279
#else
280
		match = strcasecmp( value->bv_val, asserted->bv_val );
281
#endif
282
283
284
285
286
287
288
	}

	Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
	    match, value->bv_val, asserted->bv_val );

	*matchp = match;
	return LDAP_SUCCESS;
289
}
290

291
292
293
294
295
296
297
298
299
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_OTHER;
}

300
static int
301
blobValidate(
302
303
304
305
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
306
	return LDAP_SUCCESS;
307
308
}

309
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
/*
 * 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,
340
	slap_mask_t flags,
341
342
343
344
345
346
347
348
349
350
351
	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;
}

352
353
354
355
356
357
358
359
360
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
	unsigned char *u = in->bv_val;

361
362
	if( !in->bv_len ) return LDAP_INVALID_SYNTAX;

363
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
364
365
366
367
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );

		/* should not be zero */
368
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
369
370
371

		/* make sure len corresponds with the offset
			to the next character */
372
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
373
374
	}

375
	if( count != 0 ) return LDAP_INVALID_SYNTAX;
376

377
	return LDAP_SUCCESS;
378
379
}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
380
381
382
383
384
385
386
#define UNICODE2LEN(n)	((n)*sizeof(ldap_unicode_t))
#define LEN2UNICODE(n)	((n)/sizeof(ldap_unicode_t))

#define SLAP_INDEX_SUBSTR_UMINLEN	UNICODE2LEN(SLAP_INDEX_SUBSTR_MINLEN)
#define SLAP_INDEX_SUBSTR_UMAXLEN	UNICODE2LEN(SLAP_INDEX_SUBSTR_MAXLEN)
#define SLAP_INDEX_SUBSTR_USTEP		UNICODE2LEN(SLAP_INDEX_SUBSTR_STEP)

387
388
389
390
391
392
static int
UTF8StringNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
Kurt Zeilenga's avatar
Kurt Zeilenga committed
393
394
395
396
	ber_len_t bcount;
	ber_len_t ucount;
	int len, space;
	char *u;
397
	struct berval *newval;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
398
	ldap_unicode_t *uc;
399

Kurt Zeilenga's avatar
Kurt Zeilenga committed
400
	if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
401

Kurt Zeilenga's avatar
Kurt Zeilenga committed
402
403
404
	u = val->bv_val;
	ucount = 0;
	space = 1;
405

Kurt Zeilenga's avatar
Kurt Zeilenga committed
406
407
408
	for( bcount = val->bv_len; bcount > 0; bcount-=len, u+=len ) {
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );
409

Kurt Zeilenga's avatar
Kurt Zeilenga committed
410
411
		/* should not be zero */
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
412

Kurt Zeilenga's avatar
Kurt Zeilenga committed
413
414
415
416
417
		if( ldap_utf8_isspace( u ) ) {
			if( space ) continue;
		} else {
			space=1;
		}
418

Kurt Zeilenga's avatar
Kurt Zeilenga committed
419
420
		ucount++;
	}
421

Kurt Zeilenga's avatar
Kurt Zeilenga committed
422
423
424
	if( ucount <= 1 ) {
		return LDAP_INVALID_SYNTAX;
	}
425

Kurt Zeilenga's avatar
Kurt Zeilenga committed
426
427
	if( space ) {
		ucount--;
428
429
	}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
430
431
432
	newval = ch_malloc( sizeof( struct berval ) );
	newval->bv_val = ch_malloc( UNICODE2LEN(ucount+1) );
	uc = (ldap_unicode_t *) newval->bv_val;
433

Kurt Zeilenga's avatar
Kurt Zeilenga committed
434
435
436
	u = val->bv_val;
	ucount = 0;
	space = 1;
437

Kurt Zeilenga's avatar
Kurt Zeilenga committed
438
439
440
	for( bcount = val->bv_len; bcount > 0; bcount-=len, u+=len ) {
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );
441

Kurt Zeilenga's avatar
Kurt Zeilenga committed
442
443
		/* should not be zero */
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
444

Kurt Zeilenga's avatar
Kurt Zeilenga committed
445
446
447
448
449
		if( ldap_utf8_isspace( u ) ) {
			if( space ) continue;
		} else {
			space=1;
		}
450

Kurt Zeilenga's avatar
Kurt Zeilenga committed
451
452
		uc[ucount++] = ldap_utf8_to_unicode( u );
	}
453

Kurt Zeilenga's avatar
Kurt Zeilenga committed
454
455
	if( space ) ucount--;
	uc[ucount] = 0;
456

Kurt Zeilenga's avatar
Kurt Zeilenga committed
457
	newval->bv_len = UNICODE2LEN(ucount);
458
	return LDAP_SUCCESS;
459
460
}

461
static int
462
caseExactMatch(
463
	int *matchp,
464
	slap_mask_t flags,
465
466
467
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
468
	void *assertedValue )
469
{
470
471
472
	int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;

	if( match == 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
473
474
475
		match = ucstrncmp( (ldap_unicode_t *) value->bv_val,
			(ldap_unicode_t *) ((struct berval *) assertedValue)->bv_val,
			LEN2UNICODE(value->bv_len) );
476
477
478
	}

	*matchp = match;
479
	return LDAP_SUCCESS;
480
481
}

482
static int
483
caseExactSubstringsMatch(
484
	int *matchp,
485
	slap_mask_t flags,
486
487
488
489
490
491
492
493
494
495
496
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
	ber_len_t inlen=0;

497
	/* Add up asserted input length */
498
499
500
501
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
502
503
		for(i=0; sub->sa_any[i] != NULL; i++) {
			inlen += sub->sa_any[i]->bv_len;
504
505
506
507
508
509
510
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
511
512
513
514
515
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
516
517
518
519
		match = ucstrncmp(
			(ldap_unicode_t *) sub->sa_initial->bv_val,
			(ldap_unicode_t *) left.bv_val,
			LEN2UNICODE(sub->sa_initial->bv_len) );
520
521
522
523
524
525
526

		if( match != 0 ) {
			goto done;
		}

		left.bv_val += sub->sa_initial->bv_len;
		left.bv_len -= sub->sa_initial->bv_len;
527
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
528
	}
529

Kurt Zeilenga's avatar
Kurt Zeilenga committed
530
	if( sub->sa_final ) {
531
532
533
534
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
535

Kurt Zeilenga's avatar
Kurt Zeilenga committed
536
537
538
539
		match = ucstrncmp(
			(ldap_unicode_t *) sub->sa_final->bv_val,
			(ldap_unicode_t *) &left.bv_val[left.bv_len - sub->sa_final->bv_len],
			LEN2UNICODE(sub->sa_final->bv_len) );
540
541
542
543
544
545

		if( match != 0 ) {
			goto done;
		}

		left.bv_len -= sub->sa_final->bv_len;
546
		inlen -= sub->sa_final->bv_len;
547
548
549
	}

	if( sub->sa_any ) {
550
551
552
553
554
		for(i=0; sub->sa_any[i]; i++) {
			ber_len_t idx;
			char *p;

retry:
Kurt Zeilenga's avatar
Kurt Zeilenga committed
555
556
557
558
559
560
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

561
562
563
564
			if( sub->sa_any[i]->bv_len == 0 ) {
				continue;
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
565
566
567
568
569
			p = (char *) ucstrnchr(
				(ldap_unicode_t *) left.bv_val,
				LEN2UNICODE(left.bv_len),
				((ldap_unicode_t *) sub->sa_any[i]->bv_val)[0] );

570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592

			if( p == NULL ) {
				match = 1;
				goto done;
			}

			idx = p - left.bv_val;
			assert( idx < left.bv_len );

			if( idx >= left.bv_len ) {
				/* this shouldn't happen */
				return LDAP_OTHER;
			}

			left.bv_val = p;
			left.bv_len -= idx;

			if( sub->sa_any[i]->bv_len > left.bv_len ) {
				/* not enough left */
				match = 1;
				goto done;
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
593
594
595
596
			match = ucstrncmp(
				(ldap_unicode_t *) left.bv_val,
				(ldap_unicode_t *) sub->sa_any[i]->bv_val,
				LEN2UNICODE(sub->sa_any[i]->bv_len) );
597
598

			if( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
599
600
				left.bv_val += UNICODE2LEN(1);
				left.bv_len -= UNICODE2LEN(1);
601
602
603
604
605
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
606
			inlen -= sub->sa_any[i]->bv_len;
607
		}
608
609
610
611
612
613
614
	}

done:
	*matchp = match;
	return LDAP_SUCCESS;
}

615
/* Index generation function */
616
int caseExactIndexer(
617
618
	slap_mask_t use,
	slap_mask_t flags,
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
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
	int i;
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[16];
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

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

	assert( i > 0 );

	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++ ) {
		struct berval *value = values[i];

		lutil_MD5Init( &MD5context );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			lutil_MD5Update( &MD5context,
				prefix->bv_val, prefix->bv_len );
		}
		lutil_MD5Update( &MD5context,
			syntax->ssyn_oid, slen );
		lutil_MD5Update( &MD5context,
			mr->smr_oid, mlen );
		lutil_MD5Update( &MD5context,
			value->bv_val, value->bv_len );
		lutil_MD5Final( MD5digest, &MD5context );

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

	keys[i] = NULL;
	*keysp = keys;
	return LDAP_SUCCESS;
}

/* Index generation function */
670
int caseExactFilter(
671
672
	slap_mask_t use,
	slap_mask_t flags,
673
674
675
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
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[LUTIL_MD5_BYTES];
	struct berval *value;
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

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

	value = (struct berval *) assertValue;

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

	lutil_MD5Init( &MD5context );
	if( prefix != NULL && prefix->bv_len > 0 ) {
		lutil_MD5Update( &MD5context,
			prefix->bv_val, prefix->bv_len );
	}
	lutil_MD5Update( &MD5context,
		syntax->ssyn_oid, slen );
	lutil_MD5Update( &MD5context,
		mr->smr_oid, mlen );
	lutil_MD5Update( &MD5context,
		value->bv_val, value->bv_len );
	lutil_MD5Final( MD5digest, &MD5context );

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

	*keysp = keys;
	return LDAP_SUCCESS;
}
714

715
/* Substrings Index generation function */
716
int caseExactSubstringsIndexer(
717
718
	slap_mask_t use,
	slap_mask_t flags,
719
720
721
722
723
724
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
725
	ber_len_t i, nkeys;
726
727
728
729
730
731
732
733
734
735
736
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[16];
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

	nkeys=0;
	for( i=0; values[i] != NULL; i++ ) {
		/* count number of indices to generate */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
737
		if( values[i]->bv_len < SLAP_INDEX_SUBSTR_UMINLEN ) {
738
739
740
			continue;
		}

741
		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
742
			if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) {
743
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
Kurt Zeilenga's avatar
Kurt Zeilenga committed
744
					( SLAP_INDEX_SUBSTR_MINLEN - 1 );
745
			} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
746
747
				nkeys += LEN2UNICODE(values[i]->bv_len) -
					( SLAP_INDEX_SUBSTR_MINLEN - 1 );
748
749
750
			}
		}

751
		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
752
753
754
			if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) {
				nkeys += LEN2UNICODE(values[i]->bv_len) -
					( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
755
756
757
			}
		}

758
		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
759
			if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) {
760
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
Kurt Zeilenga's avatar
Kurt Zeilenga committed
761
					( SLAP_INDEX_SUBSTR_MINLEN - 1 );
762
			} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
763
764
				nkeys += LEN2UNICODE(values[i]->bv_len) -
					( SLAP_INDEX_SUBSTR_MINLEN - 1 );
765
			}
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
		}
	}
	assert( i > 0 );

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

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

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

	nkeys=0;
	for( i=0; values[i] != NULL; i++ ) {
783
		ber_len_t j,max;
784
785
		struct berval *value;

786
		value = values[i];
Kurt Zeilenga's avatar
Kurt Zeilenga committed
787
		if( value->bv_len < SLAP_INDEX_SUBSTR_UMINLEN ) continue;
788

789
		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
Kurt Zeilenga's avatar
Kurt Zeilenga committed
790
			( value->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) )
791
792
		{
			char pre = SLAP_INDEX_SUBSTR_PREFIX;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
793
794
			max = value->bv_len -
				( SLAP_INDEX_SUBSTR_UMAXLEN - UNICODE2LEN(1));
795

Kurt Zeilenga's avatar
Kurt Zeilenga committed
796
			for( j=0; j<max; j+=UNICODE2LEN(1) ) {
797
798
799
800
801
802
803
804
805
806
807
808
				lutil_MD5Init( &MD5context );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					lutil_MD5Update( &MD5context,
						prefix->bv_val, prefix->bv_len );
				}
				lutil_MD5Update( &MD5context,
					&pre, sizeof( pre ) );
				lutil_MD5Update( &MD5context,
					syntax->ssyn_oid, slen );
				lutil_MD5Update( &MD5context,
					mr->smr_oid, mlen );
				lutil_MD5Update( &MD5context,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
809
					&value->bv_val[j], SLAP_INDEX_SUBSTR_UMAXLEN );
810
811
812
813
814
815
				lutil_MD5Final( MD5digest, &MD5context );

				keys[nkeys++] = ber_bvdup( &digest );
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
816
817
		max = SLAP_INDEX_SUBSTR_UMAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_UMAXLEN : value->bv_len;
818

Kurt Zeilenga's avatar
Kurt Zeilenga committed
819
		for( j=SLAP_INDEX_SUBSTR_UMINLEN; j<=max; j+=UNICODE2LEN(1) ) {
820
821
			char pre;

822
			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
				pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
				lutil_MD5Init( &MD5context );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					lutil_MD5Update( &MD5context,
						prefix->bv_val, prefix->bv_len );
				}
				lutil_MD5Update( &MD5context,
					&pre, sizeof( pre ) );
				lutil_MD5Update( &MD5context,
					syntax->ssyn_oid, slen );
				lutil_MD5Update( &MD5context,
					mr->smr_oid, mlen );
				lutil_MD5Update( &MD5context,
					value->bv_val, j );
				lutil_MD5Final( MD5digest, &MD5context );

				keys[nkeys++] = ber_bvdup( &digest );
			}

842
			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
				lutil_MD5Init( &MD5context );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					lutil_MD5Update( &MD5context,
						prefix->bv_val, prefix->bv_len );
				}
				lutil_MD5Update( &MD5context,
					&pre, sizeof( pre ) );
				lutil_MD5Update( &MD5context,
					syntax->ssyn_oid, slen );
				lutil_MD5Update( &MD5context,
					mr->smr_oid, mlen );
				lutil_MD5Update( &MD5context,
					&value->bv_val[value->bv_len-j], j );
				lutil_MD5Final( MD5digest, &MD5context );

				keys[nkeys++] = ber_bvdup( &digest );
			}

		}
	}

865
866
867
868
869
870
871
872
	if( nkeys > 0 ) {
		keys[nkeys] = NULL;
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}

873
874
	return LDAP_SUCCESS;
}
875

876
int caseExactSubstringsFilter(
877
878
	slap_mask_t use,
	slap_mask_t flags,
879
880
881
882
883
884
885
886
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	SubstringsAssertion *sa = assertValue;
	char pre;
887
	ber_len_t nkeys = 0;
888
889
890
891
892
893
894
	size_t slen, mlen, klen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[LUTIL_MD5_BYTES];
	struct berval *value;
	struct berval digest;

895
	if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
Kurt Zeilenga's avatar
Kurt Zeilenga committed
896
		sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_UMINLEN )
897
898
899
	{
		nkeys++;
	}
900

901
	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
902
903
		ber_len_t i;
		for( i=0; sa->sa_any[i] != NULL; i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
904
			if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) {
905
				/* don't bother accounting for stepping */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
906
				nkeys += LEN2UNICODE(sa->sa_any[i]->bv_len) -
907
908
909
910
911
					( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
			}
		}
	}

912
	if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
Kurt Zeilenga's avatar
Kurt Zeilenga committed
913
		sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_UMINLEN )
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
	{
		nkeys++;
	}

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

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

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

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

932
	if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
Kurt Zeilenga's avatar
Kurt Zeilenga committed
933
		sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_UMINLEN )
934
935
936
937
	{
		pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
		value = sa->sa_initial;

Kurt Zeilenga's avatar
Kurt Zeilenga committed
938
939
		klen = SLAP_INDEX_SUBSTR_UMAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_UMAXLEN : value->bv_len;
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958

		lutil_MD5Init( &MD5context );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			lutil_MD5Update( &MD5context,
				prefix->bv_val, prefix->bv_len );
		}
		lutil_MD5Update( &MD5context,
			&pre, sizeof( pre ) );
		lutil_MD5Update( &MD5context,
			syntax->ssyn_oid, slen );
		lutil_MD5Update( &MD5context,
			mr->smr_oid, mlen );
		lutil_MD5Update( &MD5context,
			value->bv_val, klen );
		lutil_MD5Final( MD5digest, &MD5context );

		keys[nkeys++] = ber_bvdup( &digest );
	}

959
	if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
960
961
		ber_len_t i, j;
		pre = SLAP_INDEX_SUBSTR_PREFIX;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
962
		klen = SLAP_INDEX_SUBSTR_UMAXLEN;
963
964

		for( i=0; sa->sa_any[i] != NULL; i++ ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
965
			if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_UMAXLEN ) {
966
967
968
969
970
				continue;
			}

			value = sa->sa_any[i];

Kurt Zeilenga's avatar
Kurt Zeilenga committed
971
			for(j=0;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
972
973
				j <= value->bv_len - SLAP_INDEX_SUBSTR_UMAXLEN;
				j += SLAP_INDEX_SUBSTR_USTEP )
Kurt Zeilenga's avatar
Kurt Zeilenga committed
974
			{
975
976
977
978
979
980
981
982
983
984
985
986
				lutil_MD5Init( &MD5context );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					lutil_MD5Update( &MD5context,
						prefix->bv_val, prefix->bv_len );
				}
				lutil_MD5Update( &MD5context,
					&pre, sizeof( pre ) );
				lutil_MD5Update( &MD5context,
					syntax->ssyn_oid, slen );
				lutil_MD5Update( &MD5context,
					mr->smr_oid, mlen );
				lutil_MD5Update( &MD5context,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
987
					&value->bv_val[j], klen );
988
989
990
991
992
993
994
				lutil_MD5Final( MD5digest, &MD5context );

				keys[nkeys++] = ber_bvdup( &digest );
			}
		}
	}

995
	if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
Kurt Zeilenga's avatar
Kurt Zeilenga committed
996
		sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_UMINLEN )
997
998
999
1000
	{
		pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
		value = sa->sa_final;

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1001
1002
		klen = SLAP_INDEX_SUBSTR_UMAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_UMAXLEN : value->bv_len;
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021

		lutil_MD5Init( &MD5context );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			lutil_MD5Update( &MD5context,
				prefix->bv_val, prefix->bv_len );
		}
		lutil_MD5Update( &MD5context,
			&pre, sizeof( pre ) );
		lutil_MD5Update( &MD5context,
			syntax->ssyn_oid, slen );
		lutil_MD5Update( &MD5context,
			mr->smr_oid, mlen );
		lutil_MD5Update( &MD5context,
			&value->bv_val[value->bv_len-klen], klen );
		lutil_MD5Final( MD5digest, &MD5context );

		keys[nkeys++] = ber_bvdup( &digest );
	}

1022
1023
1024
1025
1026
1027
1028
	if( nkeys > 0 ) {
		keys[nkeys] = NULL;
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}
1029
1030
1031
1032

	return LDAP_SUCCESS;
}
	
1033
static int
1034
caseIgnoreMatch(
1035
	int *matchp,
1036
	slap_mask_t flags,
1037
1038
1039
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
1040
	void *assertedValue )
1041
{
1042
1043
1044
	int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;

	if( match == 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1045
1046
1047
1048
		match = ucstrncasecmp(
			(ldap_unicode_t *) value->bv_val,
			(ldap_unicode_t *) ((struct berval *) assertedValue)->bv_val,
			LEN2UNICODE(value->bv_len) );
1049
1050
1051
	}

	*matchp = match;
1052
	return LDAP_SUCCESS;
1053
1054
}

1055
1056
1057
1058
1059
1060
1061
1062
static int
caseIgnoreSubstringsMatch(
	int *matchp,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
1063
{
1064
1065
1066
1067
1068
	int match = 0;
	SubstringsAssertion *sub = assertedValue;
	struct berval left = *value;
	int i;
	ber_len_t inlen=0;
1069

1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
	/* Add up asserted input length */
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i] != NULL; i++) {
			inlen += sub->sa_any[i]->bv_len;
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1089
1090
1091
1092
		match = ucstrncasecmp(
			(ldap_unicode_t *) sub->sa_initial->bv_val,
			(ldap_unicode_t *) left.bv_val,
			LEN2UNICODE(sub->sa_initial->bv_len) );
1093
1094
1095
1096
1097
1098
1099
1100

		if( match != 0 ) {
			goto done;
		}

		left.bv_val += sub->sa_initial->bv_len;
		left.bv_len -= sub->sa_initial->bv_len;
		inlen -= sub->sa_initial->bv_len;
1101
	}
1102
1103
1104
1105
1106
1107
1108

	if( sub->sa_final ) {
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1109
1110
1111
1112
		match = ucstrncasecmp(
			(ldap_unicode_t *) sub->sa_final->bv_val,
			(ldap_unicode_t *) &left.bv_val[left.bv_len - sub->sa_final->bv_len],
			LEN2UNICODE(sub->sa_final->bv_len) );
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137

		if( match != 0 ) {
			goto done;
		}

		left.bv_len -= sub->sa_final->bv_len;
		inlen -= sub->sa_final->bv_len;
	}

	if( sub->sa_any ) {
		for(i=0; sub->sa_any[i]; i++) {
			ber_len_t idx;
			char *p;

retry:
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

			if( sub->sa_any[i]->bv_len == 0 ) {
				continue;
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1138
1139
1140
1141
			p = (char *) ucstrncasechr(
				(ldap_unicode_t *) left.bv_val,
				LEN2UNICODE(left.bv_len),
				((ldap_unicode_t *) sub->sa_any[i]->bv_val)[0] );
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164

			if( p == NULL ) {
				match = 1;
				goto done;
			}

			idx = p - left.bv_val;
			assert( idx < left.bv_len );

			if( idx >= left.bv_len ) {
				/* this shouldn't happen */
				return LDAP_OTHER;
			}

			left.bv_val = p;
			left.bv_len -= idx;

			if( sub->sa_any[i]->bv_len > left.bv_len ) {
				/* not enough left */
				match = 1;
				goto done;
			}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1165
1166
1167
1168
			match = ucstrncasecmp(
				(ldap_unicode_t *) left.bv_val,
				(ldap_unicode_t *) sub->sa_any[i]->bv_val,
				LEN2UNICODE(sub->sa_any[i]->bv_len) );
1169
1170

			if( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1171
1172
				left.bv_val += UNICODE2LEN(1);
				left.bv_len -= UNICODE2LEN(1);
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219

				goto retry;
			}

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

done:
	*matchp = match;
	return LDAP_SUCCESS;
}

/* Index generation function */
int caseIgnoreIndexer(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
	int i;
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[16];
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

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

	assert( i > 0 );

	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++ ) {
		struct berval *value = ber_bvdup( values[i] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1220
1221
		ucstr2upper( (ldap_unicode_t *) value->bv_val,
			LEN2UNICODE(value->bv_len) );
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267

		lutil_MD5Init( &MD5context );
		if( prefix != NULL && prefix->bv_len > 0 ) {
			lutil_MD5Update( &MD5context,
				prefix->bv_val, prefix->bv_len );
		}
		lutil_MD5Update( &MD5context,
			syntax->ssyn_oid, slen );
		lutil_MD5Update( &MD5context,
			mr->smr_oid, mlen );
		lutil_MD5Update( &MD5context,
			value->bv_val, value->bv_len );
		lutil_MD5Final( MD5digest, &MD5context );

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

	keys[i] = NULL;
	*keysp = keys;
	return LDAP_SUCCESS;
}

/* Index generation function */
int caseIgnoreFilter(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[LUTIL_MD5_BYTES];
	struct berval *value;
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

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

	value = ber_bvdup( (struct berval *) assertValue );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1268
1269
	ucstr2upper( (ldap_unicode_t *) value->bv_val,
		LEN2UNICODE(value->bv_len) );
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317

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

	lutil_MD5Init( &MD5context );
	if( prefix != NULL && prefix->bv_len > 0 ) {
		lutil_MD5Update( &MD5context,
			prefix->bv_val, prefix->bv_len );
	}
	lutil_MD5Update( &MD5context,
		syntax->ssyn_oid, slen );
	lutil_MD5Update( &MD5context,
		mr->smr_oid, mlen );
	lutil_MD5Update( &MD5context,
		value->bv_val, value->bv_len );
	lutil_MD5Final( MD5digest, &MD5context );

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

	ber_bvfree( value );

	*keysp = keys;

	return LDAP_SUCCESS;
}

/* Substrings Index generation function */
int caseIgnoreSubstringsIndexer(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
	ber_len_t i, nkeys;
	size_t slen, mlen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[16];
	struct berval digest;
	digest.bv_val = MD5digest;
	digest.bv_len = sizeof(MD5digest);

	nkeys=0;
	for( i=0; values[i] != NULL; i++ ) {
		/* count number of indices to generate */
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1318
		if( values[i]->bv_len < SLAP_INDEX_SUBSTR_UMINLEN ) {
1319
1320
1321
1322
			continue;
		}

		if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1323
			if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) {
1324
1325
1326
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
					( SLAP_INDEX_SUBSTR_MINLEN - 1);
			} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1327
1328
				nkeys += LEN2UNICODE(values[i]->bv_len) -
					( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1329
1330
1331
1332
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_ANY ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1333
1334
1335
			if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) {
				nkeys += LEN2UNICODE(values[i]->bv_len) -
					( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1336
1337
1338
1339
			}
		}

		if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1340
			if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) {
1341
1342
1343
				nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
					( SLAP_INDEX_SUBSTR_MINLEN - 1);
			} else {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1344
1345
				nkeys += LEN2UNICODE(values[i]->bv_len) -
					( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
			}
		}
	}
	assert( i > 0 );

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

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

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

	nkeys=0;
	for( i=0; values[i] != NULL; i++ ) {
		int j,max;
		struct berval *value;

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1367
		if( values[i]->bv_len < SLAP_INDEX_SUBSTR_UMINLEN ) continue;
1368
1369

		value = ber_bvdup( values[i] );
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1370
1371
		ucstr2upper( (ldap_unicode_t *) value->bv_val,
			LEN2UNICODE(value->bv_len) );
1372
1373

		if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1374
			( value->bv_len >= SLAP_INDEX_SUBSTR_UMAXLEN ) )
1375
1376
		{
			char pre = SLAP_INDEX_SUBSTR_PREFIX;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1377
1378
			max = value->bv_len -
				( SLAP_INDEX_SUBSTR_UMAXLEN - UNICODE2LEN(1));
1379

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1380
			for( j=0; j<max; j+=UNICODE2LEN(1) ) {
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
				lutil_MD5Init( &MD5context );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					lutil_MD5Update( &MD5context,
						prefix->bv_val, prefix->bv_len );
				}
				lutil_MD5Update( &MD5context,
					&pre, sizeof( pre ) );
				lutil_MD5Update( &MD5context,
					syntax->ssyn_oid, slen );
				lutil_MD5Update( &MD5context,
					mr->smr_oid, mlen );
				lutil_MD5Update( &MD5context,
					&value->bv_val[j],
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1394
					SLAP_INDEX_SUBSTR_UMAXLEN );
1395
1396
1397
1398
1399
1400
				lutil_MD5Final( MD5digest, &MD5context );

				keys[nkeys++] = ber_bvdup( &digest );
			}
		}

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1401
1402
		max = SLAP_INDEX_SUBSTR_UMAXLEN < value->bv_len
			? SLAP_INDEX_SUBSTR_UMAXLEN : value->bv_len;
1403

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1404
		for( j=SLAP_INDEX_SUBSTR_UMINLEN; j<=max; j+=UNICODE2LEN(1) ) {
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
			char pre;

			if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
				pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
				lutil_MD5Init( &MD5context );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					lutil_MD5Update( &MD5context,
						prefix->bv_val, prefix->bv_len );
				}
				lutil_MD5Update( &MD5context,
					&pre, sizeof( pre ) );
				lutil_MD5Update( &MD5context,
					syntax->ssyn_oid, slen );
				lutil_MD5Update( &MD5context,
					mr->smr_oid, mlen );
				lutil_MD5Update( &MD5context,
					value->bv_val, j );
				lutil_MD5Final( MD5digest, &MD5context );

				keys[nkeys++] = ber_bvdup( &digest );
			}

			if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
				pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
				lutil_MD5Init( &MD5context );
				if( prefix != NULL && prefix->bv_len > 0 ) {
					lutil_MD5Update( &MD5context,
						prefix->bv_val, prefix->bv_len );
				}
				lutil_MD5Update( &MD5context,
					&pre, sizeof( pre ) );
				lutil_MD5Update( &MD5context,
					syntax->ssyn_oid, slen );
				lutil_MD5Update( &MD5context,
					mr->smr_oid, mlen );
				lutil_MD5Update( &MD5context,
					&value->bv_val[value->bv_len-j], j );
				lutil_MD5Final( MD5digest, &MD5context );

				keys[nkeys++] = ber_bvdup( &digest );
			}

		}

		ber_bvfree( value );
	}

	if( nkeys > 0 ) {
		keys[nkeys] = NULL;
		*keysp = keys;
	} else {
		ch_free( keys );
		*keysp = NULL;
	}

	return LDAP_SUCCESS;
}

int caseIgnoreSubstringsFilter(
	slap_mask_t use,
	slap_mask_t flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	SubstringsAssertion *sa = assertValue;
	char pre;
	ber_len_t nkeys = 0;
	size_t slen, mlen, klen;
	struct berval **keys;
	lutil_MD5_CTX   MD5context;
	unsigned char   MD5digest[LUTIL_MD5_BYTES];
	struct berval *value;
	struct berval digest;

	if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1483
		sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_UMINLEN )
1484
1485
1486
1487
1488
1489
1490
	{
		nkeys++;
	}

	if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
		ber_len_t i;
		for