schema_init.c 55.8 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
#include "lutil_md5.h"

20
/* recycled validatation routines */
21
#define berValidate						blobValidate
22

23
24
25
/* unimplemented validators */
#define bitStringValidate				NULL

26
/* recycled normalization routines */
27
28
29
#define faxNumberNormalize				numericStringNormalize
#define phoneNumberNormalize			numericStringNormalize
#define telexNumberNormalize			numericStringNormalize
30
31
32
33
34
35
36
37
#define integerNormalize				numericStringNormalize

/* unimplemented normalizers */
#define bitStringNormalize				NULL

/* unimplemented pretters */
#define dnPretty						NULL
#define integerPretty					NULL
38
39

/* recycled matching routines */
40
41
42
43
44
45
46
47
48
49
50
51
#define caseIgnoreMatch					caseIgnoreIA5Match
#define caseIgnoreOrderingMatch			caseIgnoreMatch
#define caseIgnoreSubstringsMatch		caseIgnoreIA5SubstringsMatch

#define caseExactMatch					caseExactIA5Match
#define caseExactOrderingMatch			caseExactMatch
#define caseExactSubstringsMatch		caseExactIA5SubstringsMatch

#define numericStringMatch				caseIgnoreMatch
#define objectIdentifierMatch			numericStringMatch
#define integerMatch					numericStringMatch
#define telephoneNumberMatch			numericStringMatch
52
#define telephoneNumberSubstringsMatch	caseIgnoreIA5SubstringsMatch
53
54
#define generalizedTimeMatch			numericStringMatch
#define generalizedTimeOrderingMatch	numericStringMatch
55

56
57
58
59
60
61
/* 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

62
/* unimplemented matching routines */
63
64
65
66
67
68
69
70
71
72
#define caseIgnoreListMatch				NULL
#define caseIgnoreListSubstringsMatch	NULL
#define bitStringMatch					NULL
#define presentationAddressMatch		NULL
#define uniqueMemberMatch				NULL
#define protocolInformationMatch		NULL
#define integerFirstComponentMatch		NULL

#define OpenLDAPaciMatch				NULL
#define authPasswordMatch				NULL
73
74

/* recycled indexing/filtering routines */
75
76
77
78
#define caseIgnoreIndexer				caseIgnoreIA5Indexer
#define caseIgnoreFilter				caseIgnoreIA5Filter
#define caseExactIndexer				caseExactIA5Indexer
#define caseExactFilter					caseExactIA5Filter
79
80
#define dnIndexer						caseIgnoreIndexer
#define dnFilter						caseIgnoreFilter
81
82
83
84
85

#define caseIgnoreSubstringsIndexer		caseIgnoreIA5SubstringsIndexer
#define caseIgnoreSubstringsFilter		caseIgnoreIA5SubstringsFilter
#define caseExactSubstringsIndexer		caseExactIA5SubstringsIndexer
#define caseExactSubstringsFilter		caseExactIA5SubstringsFilter
86

87

88
89
90
static int
octetStringMatch(
	int *matchp,
91
	unsigned flags,
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
	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(
111
	unsigned flags,
112
113
114
115
116
117
118
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
	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(
164
	unsigned flags,
165
166
167
168
169
170
171
172
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
	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;
}
205

206
207
208
209
210
211
212
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
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(
256
	int *matchp,
257
	unsigned flags,
258
259
260
261
262
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
263
	int match;
264
265
	struct berval *asserted = (struct berval *) assertedValue;
	
266
267
268
	match = value->bv_len - asserted->bv_len;

	if( match == 0 ) {
269
#ifdef USE_DN_NORMALIZE
270
		match = strcmp( value->bv_val, asserted->bv_val );
271
#else
272
		match = strcasecmp( value->bv_val, asserted->bv_val );
273
#endif
274
275
276
277
278
279
280
	}

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

283
284
285
286
287
288
289
290
291
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_OTHER;
}

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

301
302
303
304
305
306
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
340
341
342
343
/*
 * 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,
	unsigned flags,
	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;
}

344
345
346
347
348
349
350
351
352
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
	unsigned char *u = in->bv_val;

353
354
	if( !in->bv_len ) return LDAP_INVALID_SYNTAX;

355
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
356
357
358
359
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );

		/* should not be zero */
360
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
361
362
363

		/* make sure len corresponds with the offset
			to the next character */
364
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
365
366
	}

367
	if( count != 0 ) return LDAP_INVALID_SYNTAX;
368

369
	return LDAP_SUCCESS;
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
}

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

	newval = ch_malloc( sizeof( struct berval ) );

	p = val->bv_val;

	/* Ignore initial whitespace */
	while ( ldap_utf8_isspace( p ) ) {
		LDAP_UTF8_INCR( p );
	}

390
	if( *p == '\0' ) {
391
		ch_free( newval );
392
		return LDAP_INVALID_SYNTAX;
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
	}

	newval->bv_val = ch_strdup( p );
	p = q = newval->bv_val;
	s = NULL;

	while ( *p ) {
		int len;

		if ( ldap_utf8_isspace( p ) ) {
			len = LDAP_UTF8_COPY(q,p);
			s=q;
			p+=len;
			q+=len;

			/* Ignore the extra whitespace */
			while ( ldap_utf8_isspace( p ) ) {
				LDAP_UTF8_INCR( p );
			}
		} else {
			len = LDAP_UTF8_COPY(q,p);
			s=NULL;
			p+=len;
			q+=len;
		}
	}

	assert( *newval->bv_val );
	assert( newval->bv_val < p );
422
	assert( p >= q );
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443

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

	/* cannot end with a space */
	assert( !ldap_utf8_isspace( LDAP_UTF8_PREV(q) ) );

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

	newval->bv_len = q - newval->bv_val;
444
	*normalized = newval;
445

446
	return LDAP_SUCCESS;
447
448
}

449
450
451
452
453
454
455
456
457
static int
oidValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

	if( val->bv_len == 0 ) return 0;

458
	if( OID_LEADCHAR(val->bv_val[0]) ) {
459
460
		int dot = 0;
		for(i=1; i < val->bv_len; i++) {
461
			if( OID_SEPARATOR( val->bv_val[i] ) ) {
462
				if( dot++ ) return 1;
463
			} else if ( OID_CHAR( val->bv_val[i] ) ) {
464
465
				dot = 0;
			} else {
466
				return LDAP_INVALID_SYNTAX;
467
468
469
			}
		}

470
		return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
471

472
	} else if( DESC_LEADCHAR(val->bv_val[0]) ) {
473
		for(i=1; i < val->bv_len; i++) {
474
			if( !DESC_CHAR(val->bv_val[i] ) ) {
475
				return LDAP_INVALID_SYNTAX;
476
477
478
			}
		}

479
		return LDAP_SUCCESS;
480
481
	}
	
482
	return LDAP_INVALID_SYNTAX;
483
484
}

485
486
487
488
489
490
491
static int
integerValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

492
493
	if( !val->bv_len ) return LDAP_INVALID_SYNTAX;

494
	for(i=0; i < val->bv_len; i++) {
495
		if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
496
497
	}

498
	return LDAP_SUCCESS;
499
500
501
502
503
504
505
506
507
}

static int
printableStringValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

508
509
	if( !val->bv_len ) return LDAP_INVALID_SYNTAX;

510
	for(i=0; i < val->bv_len; i++) {
511
		if( !isprint(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
512
513
	}

514
	return LDAP_SUCCESS;
515
516
}

517
static int
518
519
520
521
522
523
IA5StringValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

524
525
	if( !val->bv_len ) return LDAP_INVALID_SYNTAX;

526
	for(i=0; i < val->bv_len; i++) {
527
		if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
528
529
	}

530
	return LDAP_SUCCESS;
531
532
533
534
535
536
537
538
}

static int
IA5StringConvert(
	Syntax *syntax,
	struct berval *in,
	struct berval **out )
{
539
540
	ldap_unicode_t *u;
	ber_len_t i, len = in->bv_len;
541
542
	struct berval *bv = ch_malloc( sizeof(struct berval) );

543
	bv->bv_len = len * sizeof( ldap_unicode_t );
544
545
	u = (ldap_unicode_t *) ch_malloc( bv->bv_len + sizeof(ldap_unicode_t) );
	bv->bv_val = (char *) u;
546
547

	for(i=0; i < len; i++ ) {
548
549
550
551
		/*
		 * IA5StringValidate should have been called to ensure
		 * input is limited to IA5.
		 */
552
		u[i] = in->bv_val[i];
553
	}
554
	u[i] = 0;
555
556

	*out = bv;
557
	return LDAP_SUCCESS;
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
}

static int
IA5StringNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
	struct berval *newval;
	char *p, *q;

	newval = ch_malloc( sizeof( struct berval ) );

	p = val->bv_val;

	/* Ignore initial whitespace */
574
	while ( ASCII_SPACE( *p ) ) {
575
		p++;
576
577
	}

578
	if( *p == '\0' ) {
579
		ch_free( newval );
580
		return LDAP_INVALID_SYNTAX;
581
582
583
584
585
586
	}

	newval->bv_val = ch_strdup( p );
	p = q = newval->bv_val;

	while ( *p ) {
587
		if ( ASCII_SPACE( *p ) ) {
588
589
590
			*q++ = *p++;

			/* Ignore the extra whitespace */
591
			while ( ASCII_SPACE( *p ) ) {
592
				p++;
593
594
595
596
597
598
599
600
601
602
603
			}
		} else {
			*q++ = *p++;
		}
	}

	assert( *newval->bv_val );
	assert( newval->bv_val < p );
	assert( p <= q );

	/* cannot start with a space */
604
	assert( !ASCII_SPACE(*newval->bv_val) );
605
606
607
608
609
610
611

	/*
	 * 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.
	 */

612
	if ( ASCII_SPACE( q[-1] ) ) {
613
614
615
616
		--q;
	}

	/* cannot end with a space */
617
	assert( !ASCII_SPACE( q[-1] ) );
618
619
620
621
622

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

	newval->bv_len = q - newval->bv_val;
623
	*normalized = newval;
624

625
	return LDAP_SUCCESS;
626
627
628
629
}

static int
caseExactIA5Match(
630
	int *matchp,
631
	unsigned flags,
632
633
634
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
635
	void *assertedValue )
636
{
637
638
639
640
641
642
643
644
645
	int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;

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

	*matchp = match;
646
	return LDAP_SUCCESS;
647
648
}

649
650
651
static int
caseExactIA5SubstringsMatch(
	int *matchp,
652
	unsigned flags,
653
654
655
656
657
658
659
660
661
662
663
	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;

664
	/* Add up asserted input length */
665
666
667
668
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
669
670
		for(i=0; sub->sa_any[i] != NULL; i++) {
			inlen += sub->sa_any[i]->bv_len;
671
672
673
674
675
676
677
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
678
679
680
681
682
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

683
684
685
686
687
688
689
690
691
		match = strncmp( sub->sa_initial->bv_val, left.bv_val,
			sub->sa_initial->bv_len );

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

		left.bv_val += sub->sa_initial->bv_len;
		left.bv_len -= sub->sa_initial->bv_len;
692
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
693
	}
694

Kurt Zeilenga's avatar
Kurt Zeilenga committed
695
	if( sub->sa_final ) {
696
697
698
699
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
700
701
702
703
704
705
706
707
708
709

		match = strncmp( sub->sa_final->bv_val,
			&left.bv_val[left.bv_len - sub->sa_final->bv_len],
			sub->sa_final->bv_len );

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

		left.bv_len -= sub->sa_final->bv_len;
710
		inlen -= sub->sa_final->bv_len;
711
712
713
	}

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

retry:
Kurt Zeilenga's avatar
Kurt Zeilenga committed
719
720
721
722
723
724
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
			if( sub->sa_any[i]->bv_len == 0 ) {
				continue;
			}

			p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );

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

			match = strncmp( left.bv_val,
				sub->sa_any[i]->bv_val,
				sub->sa_any[i]->bv_len );

			if( match != 0 ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
758
759
				left.bv_val++;
				left.bv_len--;
760
761
762
763
764
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
765
			inlen -= sub->sa_any[i]->bv_len;
766
		}
767
768
769
770
771
772
773
	}

done:
	*matchp = match;
	return LDAP_SUCCESS;
}

774
775
/* Index generation function */
int caseExactIA5Indexer(
776
	unsigned flags,
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
824
825
826
827
828
	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 */
int caseExactIA5Filter(
829
	unsigned flags,
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
	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;
}
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
913
914
915
916
917
918
919
920
921
922
923
924
925
/* Substrings Index generation function */
int caseExactIA5SubstringsIndexer(
	unsigned flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
	int i, nkeys, types;
	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);

	types = 0;
	if( flags & SLAP_MR_SUBSTR_INITIAL ) types++;
	if( flags & SLAP_MR_SUBSTR_FINAL ) types++;
	/* no SUBSTR_ANY indexing */

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

		if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
			nkeys += SLAP_INDEX_SUBSTR_MAXLEN - ( SLAP_INDEX_SUBSTR_MINLEN - 1);
		} else {
			nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
		}
	}
	assert( i > 0 );

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

	nkeys *= types; /* We need to generate keys for each type */
	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;

926
927
		value = values[i];

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
		if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;

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

		for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
			char pre;

			if( flags & SLAP_MR_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_MR_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 );
			}

		}
	}

	keys[nkeys] = NULL;
	*keysp = keys;
	return LDAP_SUCCESS;
}
983

984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
int caseExactIA5SubstringsFilter(
	unsigned flags,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	void * assertValue,
	struct berval ***keysp )
{
	SubstringsAssertion *sa = assertValue;
	char pre;
	int 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;
For faster browsing, not all history is shown. View entire blame