schema_init.c 43.2 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
26
/* unimplemented validators */
#define bitStringValidate				NULL
#define booleanValidate					NULL

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

/* unimplemented normalizers */
#define bitStringNormalize				NULL
#define booleanNormalize				NULL

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

/* recycled matching routines */
43
44
45
46
47
48
49
50
51
52
53
54
#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
55
#define telephoneNumberSubstringsMatch	caseIgnoreIA5SubstringsMatch
56
57
#define generalizedTimeMatch			numericStringMatch
#define generalizedTimeOrderingMatch	numericStringMatch
58
59

/* unimplemented matching routines */
60
61
62
63
64
65
66
67
68
69
#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
70
71

/* unimplied indexer/filter routines */
72
73
#define caseIgnoreIA5SubstringsIndexer	NULL
#define caseIgnoreIA5SubstringsFilter	NULL
74
75

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

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

90

91
92
93
static int
octetStringMatch(
	int *matchp,
94
	unsigned flags,
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
	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(
114
	unsigned flags,
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
164
165
166
	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(
167
	unsigned flags,
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
205
206
207
	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;
}
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
256
257
258
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(
259
	int *matchp,
260
	unsigned flags,
261
262
263
264
265
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
266
	int match;
267
268
	struct berval *asserted = (struct berval *) assertedValue;
	
269
270
271
	match = value->bv_len - asserted->bv_len;

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

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

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

295
static int
296
blobValidate(
297
298
299
300
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
301
	return LDAP_SUCCESS;
302
303
304
305
306
307
308
309
310
311
312
}

static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
	unsigned char *u = in->bv_val;

313
314
	if( !in->bv_len ) return LDAP_INVALID_SYNTAX;

315
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
316
317
318
319
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );

		/* should not be zero */
320
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
321
322
323

		/* make sure len corresponds with the offset
			to the next character */
324
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
325
326
	}

327
	if( count != 0 ) return LDAP_INVALID_SYNTAX;
328

329
	return LDAP_SUCCESS;
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
}

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

350
	if( *p == '\0' ) {
351
		ch_free( newval );
352
		return LDAP_INVALID_SYNTAX;
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
	}

	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 );
382
	assert( p >= q );
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403

	/* 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;
404
	*normalized = newval;
405

406
	return LDAP_SUCCESS;
407
408
}

409
410
411
412
413
414
415
416
417
static int
oidValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

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

418
	if( OID_LEADCHAR(val->bv_val[0]) ) {
419
420
		int dot = 0;
		for(i=1; i < val->bv_len; i++) {
421
			if( OID_SEPARATOR( val->bv_val[i] ) ) {
422
				if( dot++ ) return 1;
423
			} else if ( OID_CHAR( val->bv_val[i] ) ) {
424
425
				dot = 0;
			} else {
426
				return LDAP_INVALID_SYNTAX;
427
428
429
			}
		}

430
		return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
431

432
	} else if( DESC_LEADCHAR(val->bv_val[0]) ) {
433
		for(i=1; i < val->bv_len; i++) {
434
			if( !DESC_CHAR(val->bv_val[i] ) ) {
435
				return LDAP_INVALID_SYNTAX;
436
437
438
			}
		}

439
		return LDAP_SUCCESS;
440
441
	}
	
442
	return LDAP_INVALID_SYNTAX;
443
444
}

445
446
447
448
449
450
451
static int
integerValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

452
453
	if( !val->bv_len ) return LDAP_INVALID_SYNTAX;

454
	for(i=0; i < val->bv_len; i++) {
455
		if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
456
457
	}

458
	return LDAP_SUCCESS;
459
460
461
462
463
464
465
466
467
}

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

468
469
	if( !val->bv_len ) return LDAP_INVALID_SYNTAX;

470
	for(i=0; i < val->bv_len; i++) {
471
		if( !isprint(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
472
473
	}

474
	return LDAP_SUCCESS;
475
476
}

477
static int
478
479
480
481
482
483
IA5StringValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

484
485
	if( !val->bv_len ) return LDAP_INVALID_SYNTAX;

486
	for(i=0; i < val->bv_len; i++) {
487
		if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
488
489
	}

490
	return LDAP_SUCCESS;
491
492
493
494
495
496
497
498
}

static int
IA5StringConvert(
	Syntax *syntax,
	struct berval *in,
	struct berval **out )
{
499
500
	ldap_unicode_t *u;
	ber_len_t i, len = in->bv_len;
501
502
	struct berval *bv = ch_malloc( sizeof(struct berval) );

503
	bv->bv_len = len * sizeof( ldap_unicode_t );
504
	bv->bv_val = (char *) u = ch_malloc( bv->bv_len + sizeof(ldap_unicode_t) );
505
506

	for(i=0; i < len; i++ ) {
507
508
509
510
		/*
		 * IA5StringValidate should have been called to ensure
		 * input is limited to IA5.
		 */
511
		u[i] = in->bv_val[i];
512
	}
513
	u[i] = 0;
514
515

	*out = bv;
516
	return LDAP_SUCCESS;
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
}

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 */
533
	while ( ASCII_SPACE( *p ) ) {
534
		p++;
535
536
	}

537
	if( *p == '\0' ) {
538
		ch_free( newval );
539
		return LDAP_INVALID_SYNTAX;
540
541
542
543
544
545
	}

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

	while ( *p ) {
546
		if ( ASCII_SPACE( *p ) ) {
547
548
549
			*q++ = *p++;

			/* Ignore the extra whitespace */
550
			while ( ASCII_SPACE( *p ) ) {
551
				p++;
552
553
554
555
556
557
558
559
560
561
562
			}
		} else {
			*q++ = *p++;
		}
	}

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

	/* cannot start with a space */
563
	assert( !ASCII_SPACE(*newval->bv_val) );
564
565
566
567
568
569
570

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

571
	if ( ASCII_SPACE( q[-1] ) ) {
572
573
574
575
		--q;
	}

	/* cannot end with a space */
576
	assert( !ASCII_SPACE( q[-1] ) );
577
578
579
580
581

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

	newval->bv_len = q - newval->bv_val;
582
	*normalized = newval;
583

584
	return LDAP_SUCCESS;
585
586
587
588
}

static int
caseExactIA5Match(
589
	int *matchp,
590
	unsigned flags,
591
592
593
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
594
	void *assertedValue )
595
{
596
597
598
599
600
601
602
603
604
	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;
605
	return LDAP_SUCCESS;
606
607
}

608
609
610
static int
caseExactIA5SubstringsMatch(
	int *matchp,
611
	unsigned flags,
612
613
614
615
616
617
618
619
620
621
622
	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;

623
	/* Add up asserted input length */
624
625
626
627
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
628
629
		for(i=0; sub->sa_any[i] != NULL; i++) {
			inlen += sub->sa_any[i]->bv_len;
630
631
632
633
634
635
636
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
637
638
639
640
641
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

642
643
644
645
646
647
648
649
650
		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;
651
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
652
	}
653

Kurt Zeilenga's avatar
Kurt Zeilenga committed
654
	if( sub->sa_final ) {
655
656
657
658
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
659
660
661
662
663
664
665
666
667
668

		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;
669
		inlen -= sub->sa_final->bv_len;
670
671
672
	}

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

retry:
Kurt Zeilenga's avatar
Kurt Zeilenga committed
678
679
680
681
682
683
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
			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
717
718
				left.bv_val++;
				left.bv_len--;
719
720
721
722
723
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
724
			inlen -= sub->sa_any[i]->bv_len;
725
		}
726
727
728
729
730
731
732
	}

done:
	*matchp = match;
	return LDAP_SUCCESS;
}

733
734
/* Index generation function */
int caseExactIA5Indexer(
735
	unsigned flags,
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
	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(
788
	unsigned flags,
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
829
830
	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;
}

831
832
static int
caseIgnoreIA5Match(
833
	int *matchp,
834
	unsigned flags,
835
836
837
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
838
	void *assertedValue )
839
{
840
841
842
843
844
845
846
847
848
	int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;

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

	*matchp = match;
849
	return LDAP_SUCCESS;
850
851
}

852
853
854
855
856
857
858
859
860
861
862
863
864
865
static char *strcasechr( const char *str, int c )
{
	char *lower = strchr( str, TOLOWER(c) );
	char *upper = strchr( str, TOUPPER(c) );

	if( lower && upper ) {
		return lower < upper ? lower : upper;
	} else if ( lower ) {
		return lower;
	} else {
		return upper;
	}
}

866
867
868
static int
caseIgnoreIA5SubstringsMatch(
	int *matchp,
869
	unsigned flags,
870
871
872
873
874
875
876
877
878
879
880
	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;

881
	/* Add up asserted input length */
882
883
884
885
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
886
		for(i=0; sub->sa_any[i] != NULL; i++) {
887
			inlen += sub->sa_any[i]->bv_len;
888
889
890
891
892
893
894
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
895
896
897
898
899
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

900
901
902
903
904
905
906
907
908
		match = strncasecmp( 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;
909
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
910
	}
911

Kurt Zeilenga's avatar
Kurt Zeilenga committed
912
	if( sub->sa_final ) {
913
914
915
916
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
917
918
919
920
921
922
923
924
925
926

		match = strncasecmp( 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;
927
		inlen -= sub->sa_final->bv_len;
928
929
930
	}

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

retry:
Kurt Zeilenga's avatar
Kurt Zeilenga committed
936
937
938
939
940
941
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

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
			if( sub->sa_any[i]->bv_len == 0 ) {
				continue;
			}

			p = strcasechr( 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 = strncasecmp( 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
975
976
977
				left.bv_val++;
				left.bv_len--;

978
979
980
981
982
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
983
			inlen -= sub->sa_any[i]->bv_len;
984
		}
985
986
987
988
989
990
	}

done:
	*matchp = match;
	return LDAP_SUCCESS;
}
991

992
993
/* Index generation function */
int caseIgnoreIA5Indexer(
994
	unsigned flags,
995
996
997
998
999
1000
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *prefix,
	struct berval **values,
	struct berval ***keysp )
{
For faster browsing, not all history is shown. View entire blame