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

#include "portable.h"

#include <stdio.h>

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

#include "slap.h"
#include "ldap_pvt.h"
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
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
#include "lutil_md5.h"

static int
octetStringMatch(
	int *matchp,
	unsigned use,
	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(
	unsigned use,
	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(
	unsigned use,
	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;
}
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
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(
188
	int *matchp,
189
190
191
192
193
194
	unsigned use,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
195
	int match;
196
197
	struct berval *asserted = (struct berval *) assertedValue;
	
198
199
200
	match = value->bv_len - asserted->bv_len;

	if( match == 0 ) {
201
#ifdef USE_DN_NORMALIZE
202
		match = strcmp( value->bv_val, asserted->bv_val );
203
#else
204
		match = strcasecmp( value->bv_val, asserted->bv_val );
205
#endif
206
207
208
209
210
211
212
	}

	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;
213
214
}
	
215
216
217
218
219
220
221
222
223
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_OTHER;
}

224
static int
225
blobValidate(
226
227
228
229
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
230
	return LDAP_SUCCESS;
231
232
}

233
234
#define berValidate blobValidate

235
236
237
238
239
240
241
242
243
static int
UTF8StringValidate(
	Syntax *syntax,
	struct berval *in )
{
	ber_len_t count;
	int len;
	unsigned char *u = in->bv_val;

244
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
245
246
247
248
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );

		/* should not be zero */
249
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
250
251
252

		/* make sure len corresponds with the offset
			to the next character */
253
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
254
255
	}

256
	if( count != 0 ) return LDAP_INVALID_SYNTAX;
257

258
	return LDAP_SUCCESS;
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
}

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

279
	if( *p == '\0' ) {
280
		ch_free( newval );
281
		return LDAP_INVALID_SYNTAX;
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
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
	}

	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 );
	assert( p <= q );

	/* 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;
333
	*normalized = newval;
334

335
	return LDAP_SUCCESS;
336
337
}

338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
static int
oidValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

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

	if( isdigit(val->bv_val[0]) ) {
		int dot = 0;
		for(i=1; i < val->bv_len; i++) {
			if( val->bv_val[i] == '.' ) {
				if( dot++ ) return 1;
			} else if ( isdigit(val->bv_val[i]) ) {
				dot = 0;
			} else {
355
				return LDAP_INVALID_SYNTAX;
356
357
358
			}
		}

359
		return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
360
361
362
363

	} else if( isalpha(val->bv_val[0]) ) {
		for(i=1; i < val->bv_len; i++) {
			if( !isalpha(val->bv_val[i] ) ) {
364
				return LDAP_INVALID_SYNTAX;
365
366
367
			}
		}

368
		return LDAP_SUCCESS;
369
370
	}
	
371
	return LDAP_INVALID_SYNTAX;
372
373
}

374
375
376
377
378
379
380
381
static int
integerValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

	for(i=0; i < val->bv_len; i++) {
382
		if( !isdigit(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
383
384
	}

385
	return LDAP_SUCCESS;
386
387
388
389
390
391
392
393
394
395
}

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

	for(i=0; i < val->bv_len; i++) {
396
		if( !isprint(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
397
398
	}

399
	return LDAP_SUCCESS;
400
401
}

402
static int
403
404
405
406
407
408
409
IA5StringValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

	for(i=0; i < val->bv_len; i++) {
410
		if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
411
412
	}

413
	return LDAP_SUCCESS;
414
415
416
417
418
419
420
421
}

static int
IA5StringConvert(
	Syntax *syntax,
	struct berval *in,
	struct berval **out )
{
422
423
	ldap_unicode_t *u;
	ber_len_t i, len = in->bv_len;
424
425
	struct berval *bv = ch_malloc( sizeof(struct berval) );

426
427
428
429
	bv->bv_len = len * sizeof( ldap_unicode_t );
	bv->bv_val = (char *) u = ch_malloc( bv->bv_len + sizeof( ldap_unicode_t ) );;

	for(i=0; i < len; i++ ) {
430
431
432
433
		/*
		 * IA5StringValidate should have been called to ensure
		 * input is limited to IA5.
		 */
434
		u[i] = in->bv_val[i];
435
	}
436
	u[i] = 0;
437
438

	*out = bv;
439
	return LDAP_SUCCESS;
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
}

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 */
456
457
	while ( isspace( *p ) ) {
		p++;
458
459
	}

460
	if( *p != '\0' ) {
461
		ch_free( newval );
462
		return LDAP_INVALID_SYNTAX;
463
464
465
466
467
468
469
470
471
472
	}

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

	while ( *p ) {
		if ( isspace( *p ) ) {
			*q++ = *p++;

			/* Ignore the extra whitespace */
473
474
			while ( isspace( *p ) ) {
				p++;
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
			}
		} else {
			*q++ = *p++;
		}
	}

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

	/* cannot start with a space */
	assert( !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 ( isspace( q[-1] ) ) {
		--q;
	}

	/* cannot end with a space */
	assert( !isspace( q[-1] ) );

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

	newval->bv_len = q - newval->bv_val;
505
	*normalized = newval;
506

507
	return LDAP_SUCCESS;
508
509
510
511
}

static int
caseExactIA5Match(
512
	int *match,
513
	unsigned use,
514
515
516
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
517
	void *assertedValue )
518
{
519
	*match = strcmp( value->bv_val,
520
		((struct berval *) assertedValue)->bv_val );
521
	return LDAP_SUCCESS;
522
523
}

524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
static int
caseExactIA5SubstringsMatch(
	int *matchp,
	unsigned use,
	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;

539
	/* Add up asserted input length */
540
541
542
543
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
544
545
		for(i=0; sub->sa_any[i] != NULL; i++) {
			inlen += sub->sa_any[i]->bv_len;
546
547
548
549
550
551
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

552
	if( inlen > left.bv_len ) {
553
554
555
556
557
558
559
560
561
562
563
564
565
566
		match = 1;
		goto done;
	}

	if( sub->sa_initial ) {
		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;
567
		inlen -= sub->sa_initial->bv_len;
568
569
570
571
572

		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
573
574
575
576
577
578
579
580
581
582
583
584
	}

	if( sub->sa_final ) {
		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;
585
586
587
588
589
590
		inlen -= sub->sa_final->bv_len;

		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
591
592
593
	}

	if( sub->sa_any ) {
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
		for(i=0; sub->sa_any[i]; i++) {
			ber_len_t idx;
			char *p;

retry:
			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 ) {
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
637
638
639
640
641
642
643
			inlen -= sub->sa_any[i]->bv_len;

			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}
644
		}
645
646
647
648
649
650
651
	}

done:
	*matchp = match;
	return LDAP_SUCCESS;
}

652
653
static int
caseIgnoreIA5Match(
654
	int *match,
655
	unsigned use,
656
657
658
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
659
	void *assertedValue )
660
{
661
	*match = strcasecmp( value->bv_val,
662
		((struct berval *) assertedValue)->bv_val );
663
	return LDAP_SUCCESS;
664
665
}

666
667
668
669
670
671
672
673
674
675
676
677
678
679
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;
	}
}

680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
static int
caseIgnoreIA5SubstringsMatch(
	int *matchp,
	unsigned use,
	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;

695
	/* Add up asserted input length */
696
697
698
699
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
700
		for(i=0; sub->sa_any[i] != NULL; i++) {
701
			inlen += sub->sa_any[i]->bv_len;
702
703
704
705
706
707
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

708
	if( inlen > left.bv_len ) {
709
710
711
712
713
714
715
716
717
718
719
720
721
722
		match = 1;
		goto done;
	}

	if( sub->sa_initial ) {
		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;
723
724
725
726
727
728
		inlen -= sub->sa_initial->bv_len;

		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
729
730
731
732
733
734
735
736
737
738
739
740
	}

	if( sub->sa_final ) {
		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;
741
742
743
744
745
746
		inlen -= sub->sa_final->bv_len;

		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
747
748
749
	}

	if( sub->sa_any ) {
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
788
789
790
791
792
		for(i=0; sub->sa_any[i]; i++) {
			ber_len_t idx;
			char *p;

retry:
			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 ) {
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
793
794
795
796
797
798
799
			inlen -= sub->sa_any[i]->bv_len;

			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}
800
		}
801
802
803
804
805
806
	}

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

808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
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
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
/* Index generation function */
int caseIgnoreIA5Indexer(
	unsigned use,
	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] );
		ldap_pvt_str2upper( value->bv_val );

		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 caseIgnoreIA5Filter(
	unsigned use,
	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 );
	ldap_pvt_str2upper( value->bv_val );

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

912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
static int
NumericStringNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
	/* similiar to IA5StringNormalize except removes all spaces */
	struct berval *newval;
	char *p, *q;

	newval = ch_malloc( sizeof( struct berval ) );

	p = val->bv_val;

	/* Ignore initial whitespace */
927
928
	while ( isspace( *p ) ) {
		p++;
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
	}

	if( *p != '\0' ) {
		ch_free( newval );
		return LDAP_INVALID_SYNTAX;
	}

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

	while ( *p ) {
		if ( isspace( *p ) ) {
			/* Ignore whitespace */
			p++;
		} else {
			*q++ = *p++;
		}
	}

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

	/* cannot start with a space */
	assert( !isspace(*newval->bv_val) );

	/* cannot end with a space */
	assert( !isspace( q[-1] ) );

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

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

	return LDAP_SUCCESS;
}

967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
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
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
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
static int
check_time_syntax (struct berval *val,
	int start,
	int *parts)
{
	static int ceiling[9] = { 99, 99, 11, 30, 23, 59, 59, 12, 59 };
	static int mdays[12] = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
	char *p, *e;
	int part, c, neg = 0;

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

	p = (char *)val->bv_val;
	e = p + val->bv_len;

	/* Ignore initial whitespace */
	while ( ( p < e ) && isspace( *p ) ) {
		p++;
	}

	if (e - p < 13 - (2 * start))
		return LDAP_INVALID_SYNTAX;

	for (part = 0; part < 9; part++)
		parts[part] = 0;

	for (part = start; part < 7; part++) {
		c = *p;
		if ((part == 6)
			&& (c == 'Z'
				|| c == '+'
				|| c == '-'))
		{
			part++;
			break;
		}
		p++;
		c -= '0';
		if (p == e)
			return LDAP_INVALID_SYNTAX;
		if (c < 0 || c > 9)
			return LDAP_INVALID_SYNTAX;
		parts[part] = c;

		c = *p++ - '0';
		if (p == e)
			return LDAP_INVALID_SYNTAX;
		if (c < 0 || c > 9)
			return LDAP_INVALID_SYNTAX;
		parts[part] *= 10;
		parts[part] += c;

		if (part == 2 || part == 3)
			parts[part]--;
		if (parts[part] < 0)
			return LDAP_INVALID_SYNTAX;
		if (parts[part] > ceiling[part])
			return LDAP_INVALID_SYNTAX;
	}
	if (parts[2] == 1) {
		if (parts[3] > mdays[parts[2]])
			return LDAP_INVALID_SYNTAX;
		if (parts[1] & 0x03) {
			/* FIXME:  This is an incomplete leap-year
			 * check that fails in 2100, 2200, 2300,
			 * 2500, 2600, 2700, ...
			 */
			if (parts[3] > mdays[parts[2]] - 1)
				return LDAP_INVALID_SYNTAX;
		}
	}
	c = *p++;
	if (c == 'Z') {
		/* all done */
	} else if (c != '+' && c != '-') {
		return LDAP_INVALID_SYNTAX;
	} else {
		if (c == '-')
			neg = 1;
		if (p > e - 4)
			return LDAP_INVALID_SYNTAX;
		for (part = 7; part < 9; part++) {
			c = *p++ - '0';
			if (c < 0 || c > 9)
				return LDAP_INVALID_SYNTAX;
			parts[part] = c;

			c = *p++ - '0';
			if (c < 0 || c > 9)
				return LDAP_INVALID_SYNTAX;
			parts[part] *= 10;
			parts[part] += c;
			if (parts[part] < 0 || parts[part] > ceiling[part])
				return LDAP_INVALID_SYNTAX;
		}
	}

	/* Ignore trailing whitespace */
	while ( ( p < e ) && isspace( *p ) ) {
		p++;
	}
	if (p != e)
		return LDAP_INVALID_SYNTAX;

	if (neg == 0) {
		parts[4] += parts[7];
		parts[5] += parts[8];
		for (part = 7; --part > 0; ) {
			if (part != 3)
				c = ceiling[part];
			else {
				/* FIXME:  This is an incomplete leap-year
				 * check that fails in 2100, 2200, 2300,
				 * 2500, 2600, 2700, ...
				 */
				c = mdays[parts[2]];
				if (parts[2] == 1)
					c--;
			}
			if (parts[part] > c) {
				parts[part] -= c + 1;
				parts[part - 1]++;
			}
		}
	} else {
		parts[4] -= parts[7];
		parts[5] -= parts[8];
		for (part = 7; --part > 0; ) {
			if (part != 3)
				c = ceiling[part];
			else {
				/* FIXME:  This is an incomplete leap-year
				 * check that fails in 2100, 2200, 2300,
				 * 2500, 2600, 2700, ...
				 */
				c = mdays[(parts[2] - 1) % 12];
				if (parts[2] == 2)
					c--;
			}
			if (parts[part] < 0) {
				parts[part] += c + 1;
				parts[part - 1]--;
			}
		}
	}

	return LDAP_SUCCESS;
}

static int
utcTimeNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
	struct berval *out;
	int parts[9], rc;

	rc = check_time_syntax(val, 1, parts);
	if (rc != LDAP_SUCCESS) {
		return rc;
	}

	*normalized = NULL;
	out = ch_malloc( sizeof(struct berval) );
	if( out == NULL )
		return LBER_ERROR_MEMORY;

	out->bv_val = ch_malloc( 14 );
	if ( out->bv_val == NULL ) {
		ch_free( out );
		return LBER_ERROR_MEMORY;
	}

	sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ldZ",
				parts[1], parts[2] + 1, parts[3] + 1,
				parts[4], parts[5], parts[6] );
	out->bv_len = 13;
	*normalized = out;

	return LDAP_SUCCESS;
}

static int
utcTimeValidate(
	Syntax *syntax,
	struct berval *in )
{
	int parts[9];

	return check_time_syntax(in, 1, parts);
}

static int
generalizedTimeNormalize(
	Syntax *syntax,
	struct berval *val,
	struct berval **normalized )
{
	struct berval *out;
	int parts[9], rc;

	rc = check_time_syntax(val, 0, parts);
	if (rc != LDAP_SUCCESS) {
		return rc;
	}

	*normalized = NULL;
	out = ch_malloc( sizeof(struct berval) );
	if( out == NULL )
		return LBER_ERROR_MEMORY;

	out->bv_val = ch_malloc( 16 );
	if ( out->bv_val == NULL ) {
		ch_free( out );
		return LBER_ERROR_MEMORY;
	}

	sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ld%02ldZ",
				parts[0], parts[1], parts[2] + 1, parts[3] + 1,
				parts[4], parts[5], parts[6] );
	out->bv_len = 15;
	*normalized = out;

	return LDAP_SUCCESS;
}

static int
generalizedTimeValidate(
	Syntax *syntax,
	struct berval *in )
{
	int parts[9];

	return check_time_syntax(in, 0, parts);
}

1205
1206
struct syntax_defs_rec {
	char *sd_desc;
1207
	int sd_flags;
1208
	slap_syntax_validate_func *sd_validate;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1209
1210
1211
	slap_syntax_transform_func *sd_normalize;
	slap_syntax_transform_func *sd_pretty;
#ifdef SLAPD_BINARY_CONVERSION
1212
1213
	slap_syntax_transform_func *sd_ber2str;
	slap_syntax_transform_func *sd_str2ber;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1214
#endif
1215
1216
};

1217
#define X_HIDE "X-HIDE 'TRUE' "
1218
1219
#define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
#define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
1220

1221
struct syntax_defs_rec syntax_defs[] = {
1222
1223
1224
1225
	{"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' " X_BINARY X_NOT_H_R ")",
		SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
	{"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
		0, NULL, NULL, NULL},
1226
	{"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
1227
		0, NULL, NULL, NULL},
1228
1229
1230
1231
	{"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' " X_NOT_H_R ")",
		SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
	{"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' " X_BINARY X_NOT_H_R ")",
		SLAP_SYNTAX_BER, berValidate, NULL, NULL},
1232
	{"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
1233
		0, NULL, NULL, NULL},
1234
	{"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
1235
		0, NULL, NULL, NULL},
1236
1237
1238
1239
1240
1241
	{"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
		X_BINARY X_NOT_H_R ")",
		SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
	{"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
		X_BINARY X_NOT_H_R ")",
		SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1242
1243
	{"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
		X_BINARY X_NOT_H_R ")",
1244
		SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
1245
1246
	{"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
		0, NULL, NULL, NULL},
1247
1248
	{"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
		0, dnValidate, dnNormalize, NULL},
1249
	{"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
1250
		0, NULL, NULL, NULL},
1251
	{"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
1252
		0, NULL, NULL, NULL},
1253
	{"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1254
		0, UTF8StringValidate, UTF8StringNormalize, NULL},
1255
	{"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
1256
		0, NULL, NULL, NULL},
1257
	{"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
1258
		0, NULL, NULL, NULL},
1259
	{"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
1260
		0, NULL, NULL, NULL},
1261
	{"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
1262
		0, NULL, NULL, NULL},
1263
	{"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
1264
		0, NULL, NULL, NULL},
1265
	{"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
1266
		0, blobValidate, NULL, NULL},
1267
1268
	{"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
		SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
1269
	{"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
1270
		0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
1271
	{"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
1272
		0, NULL, NULL, NULL},
1273
	{"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1274
		0, IA5StringValidate, IA5StringNormalize, NULL},
1275
	{"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
1276
		0, integerValidate, NULL, NULL},
1277
1278
	{"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
		SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
1279
	{"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
1280
		0, NULL, NULL, NULL},
1281
	{"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
1282
		0, NULL, NULL, NULL},
1283
	{"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
1284
		0, NULL, NULL, NULL},
1285
	{"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
1286
		0, NULL, NULL, NULL},
1287
	{"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
1288
		0, NULL, NULL, NULL},
1289
	{"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
1290
		0, NULL, NULL, NULL},
1291
	{"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
1292
		0, NULL, NULL, NULL},
1293
	{"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
1294
		0, IA5StringValidate, NumericStringNormalize, NULL},
1295
	{"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
1296
		0, NULL, NULL, NULL},
1297
	{"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
1298
		0, oidValidate, NULL, NULL},
1299
	{"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
1300
		0, NULL, NULL, NULL},
1301
	{"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1302
		0, blobValidate, NULL, NULL},
1303
	{"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
1304
		0, blobValidate, NULL, NULL},
1305
	{"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
1306
		0, NULL, NULL, NULL},
1307
	{"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
1308
		0, NULL, NULL, NULL},
1309
	{"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
1310
		0, printableStringValidate, NULL, NULL},
1311
1312
1313
	{"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
		X_BINARY X_NOT_H_R ")",
		SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
1314
	{"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
1315
		0, blobValidate, NULL, NULL},
1316
1317
1318
1319
1320
	{"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
		0, NULL, NULL, NULL},
	{"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
		0, NULL, NULL, NULL},
	{"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
1321
		0, utcTimeValidate, utcTimeNormalize, NULL},
1322
	{"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
1323
		0, NULL, NULL, NULL},
1324
	{"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
1325
		0, NULL, NULL, NULL},
1326
	{"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
1327
		0, NULL, NULL, NULL},
1328
	{"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
1329
		0, NULL, NULL, NULL},
1330
	{"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
1331
		0, NULL, NULL, NULL},
1332

1333
	/* OpenLDAP Experimental Syntaxes */
1334
	{"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
1335
		0, IA5StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */, NULL, NULL},
1336
1337
1338
1339
	{"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
		0, NULL, NULL, NULL},
	{"( 1.3.6.1.4.1.4203.666.2.3 DESC 'OpenLDAP void' " X_HIDE ")" ,
		SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
1340
#if 0 /* not needed */
1341
1342
	{"( 1.3.6.1.4.1.4203.666.2.4 DESC 'OpenLDAP DN' " X_HIDE ")" ,
		SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
1343
#endif
1344

1345
	{NULL, 0, NULL, NULL, NULL}
1346
1347
1348
};

struct mrule_defs_rec {
1349
	char *						mrd_desc;
1350
	unsigned					mrd_usage;
1351
1352
1353
1354
1355
	slap_mr_convert_func *		mrd_convert;
	slap_mr_normalize_func *	mrd_normalize;
	slap_mr_match_func *		mrd_match;
	slap_mr_indexer_func *		mrd_indexer;
	slap_mr_filter_func *		mrd_filter;
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
};

/*
 * Other matching rules in X.520 that we do not use:
 *
 * 2.5.13.9		numericStringOrderingMatch
 * 2.5.13.13	booleanMatch
 * 2.5.13.15	integerOrderingMatch
 * 2.5.13.18	octetStringOrderingMatch
 * 2.5.13.19	octetStringSubstringsMatch
 * 2.5.13.25	uTCTimeMatch
 * 2.5.13.26	uTCTimeOrderingMatch
 * 2.5.13.31	directoryStringFirstComponentMatch
 * 2.5.13.32	wordMatch
 * 2.5.13.33	keywordMatch
 * 2.5.13.34	certificateExactMatch
 * 2.5.13.35	certificateMatch
 * 2.5.13.36	certificatePairExactMatch
 * 2.5.13.37	certificatePairMatch
 * 2.5.13.38	certificateListExactMatch
 * 2.5.13.39	certificateListMatch
 * 2.5.13.40	algorithmIdentifierMatch
 * 2.5.13.41	storedPrefixMatch
 * 2.5.13.42	attributeCertificateMatch
 * 2.5.13.43	readerAndKeyIDMatch
 * 2.5.13.44	attributeIntegrityMatch
 */

1384

1385
1386
/* recycled matching functions */
#define caseIgnoreMatch caseIgnoreIA5Match
1387
1388
#define caseIgnoreOrderingMatch caseIgnoreMatch
#define caseIgnoreSubstringsMatch caseIgnoreIA5SubstringsMatch
1389
#define caseExactMatch caseExactIA5Match
1390
1391
#define caseExactOrderingMatch caseExactMatch
#define caseExactSubstringsMatch caseExactIA5SubstringsMatch
1392
1393
1394
1395

/* unimplemented matching functions */
#define objectIdentifierMatch NULL
#define caseIgnoreListMatch NULL
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1396
#define caseIgnoreListSubstringsMatch NULL
1397
1398
1399
1400
1401
1402
1403
1404
#define integerMatch NULL
#define bitStringMatch NULL
#define octetStringMatch NULL
#define telephoneNumberMatch NULL
#define telephoneNumberSubstringsMatch NULL
#define presentationAddressMatch NULL
#define uniqueMemberMatch NULL
#define protocolInformationMatch NULL
1405
1406
#define generalizedTimeMatch caseExactIA5Match
#define generalizedTimeOrderingMatch caseExactIA5Match
1407
1408
1409
#define integerFirstComponentMatch NULL
#define objectIdentifierFirstComponentMatch NULL

1410
1411
1412
#define OpenLDAPaciMatch NULL
#define authPasswordMatch NULL

1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
/* unimplied indexer/filter routines */
#define dnIndexer NULL
#define dnFilter NULL

#define caseIgnoreIndexer		caseIgnoreIA5Indexer
#define caseIgnoreFilter		caseIgnoreIA5Filter
#define caseExactIndexer		caseExactIA5Indexer
#define caseExactFilter			caseExactIA5Filter
#define caseExactIA5Indexer		caseIgnoreIA5Indexer
#define caseExactIA5Filter		caseIgnoreIA5Filter

1424
1425
1426
struct mrule_defs_rec mrule_defs[] = {
	{"( 2.5.13.0 NAME 'objectIdentifierMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
1427
		SLAP_MR_EQUALITY | SLAP_MR_EXT,
1428
1429
		NULL, NULL, objectIdentifierMatch,
		caseIgnoreIA5Indexer, caseIgnoreIA5Filter},
1430
1431
1432

	{"( 2.5.13.1 NAME 'distinguishedNameMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
1433
		SLAP_MR_EQUALITY | SLAP_MR_EXT,
1434
		NULL, NULL, dnMatch, dnIndexer, dnFilter},
1435
1436
1437

	{"( 2.5.13.2 NAME 'caseIgnoreMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
1438
		SLAP_MR_EQUALITY | SLAP_MR_EXT,
1439
		NULL, NULL, caseIgnoreMatch, caseIgnoreIndexer, caseIgnoreFilter},
1440
1441
1442

	{"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
1443
		SLAP_MR_ORDERING,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1444
		NULL, NULL, caseIgnoreOrderingMatch, NULL, NULL},
1445
1446
1447

	{"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
1448
		SLAP_MR_SUBSTR | SLAP_MR_EXT,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1449
		NULL, NULL, caseIgnoreSubstringsMatch, NULL, NULL},
1450
1451
1452
1453

	/* Next three are not in the RFC's, but are needed for compatibility */
	{"( 2.5.13.5 NAME 'caseExactMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
1454
		SLAP_MR_EQUALITY | SLAP_MR_EXT,
1455
		NULL, NULL, caseExactMatch, caseExactIndexer, caseExactFilter},
1456
1457
1458

	{"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
1459
		SLAP_MR_ORDERING,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1460
		NULL, NULL, caseExactOrderingMatch, NULL, NULL},
1461
1462
1463

	{"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
1464
		SLAP_MR_SUBSTR | SLAP_MR_EXT,
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1465
		NULL, NULL, caseExactSubstringsMatch, NULL, NULL},
1466
1467
1468

	{"( 2.5.13.8 NAME 'numericStringMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
1469
		SLAP_MR_EQUALITY | SLAP_MR_EXT,
1470
		NULL, NULL, caseIgnoreIA5Match, NULL, NULL},
1471
1472
1473

	{"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
1474
		SLAP_MR_SUBSTR | SLAP_MR_EXT,
1475
		NULL, NULL, caseIgnoreIA5SubstringsMatch, NULL, NULL},
1476
1477
1478

	{"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
1479
		SLAP_MR_EQUALITY | SLAP_MR_EXT,
1480
		NULL, NULL, caseIgnoreListMatch, NULL, NULL},
1481

Kurt Zeilenga's avatar
Kurt Zeilenga committed
1482
1483
1484
1485
1486
	{"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
		SLAP_MR_SUBSTR | SLAP_MR_EXT,
		NULL, NULL, caseIgnoreListSubstringsMatch, NULL, NULL},

1487
1488
	{"( 2.5.13.14 NAME 'integerMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
1489
		SLAP_MR_NONE | SLAP_MR_EXT,
1490
		NULL, NULL, integerMatch, NULL, NULL},
1491
1492
1493

	{"( 2.5.13.16 NAME 'bitStringMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
1494
		SLAP_MR_NONE | SLAP_MR_EXT,
1495
		NULL, NULL, bitStringMatch, NULL, NULL},
1496
1497
1498

	{"( 2.5.13.17 NAME 'octetStringMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
1499
		SLAP_MR_EQUALITY | SLAP_MR_EXT,
1500
		NULL, NULL, octetStringMatch, octetStringIndexer, octetStringFilter},
1501
1502
1503

	{"( 2.5.13.20 NAME 'telephoneNumberMatch' "
		"SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
1504
		SLAP_MR_EQUALITY | SLAP_MR_EXT,