schema_init.c 44.3 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

/* unimplemented matching routines */
57
58
59
60
61
62
63
64
65
66
#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
67
68

/* unimplied indexer/filter routines */
69
70
#define caseIgnoreIA5SubstringsIndexer	NULL
#define caseIgnoreIA5SubstringsFilter	NULL
71
72

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

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

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
	bv->bv_val = (char *) u = ch_malloc( bv->bv_len + sizeof(ldap_unicode_t) );
545
546

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

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

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 */
573
	while ( ASCII_SPACE( *p ) ) {
574
		p++;
575
576
	}

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

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

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

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

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

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

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

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

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

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

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

624
	return LDAP_SUCCESS;
625
626
627
628
}

static int
caseExactIA5Match(
629
	int *matchp,
630
	unsigned flags,
631
632
633
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
634
	void *assertedValue )
635
{
636
637
638
639
640
641
642
643
644
	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;
645
	return LDAP_SUCCESS;
646
647
}

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

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

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

682
683
684
685
686
687
688
689
690
		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;
691
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
692
	}
693

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

		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;
709
		inlen -= sub->sa_final->bv_len;
710
711
712
	}

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

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

724
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
			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
757
758
				left.bv_val++;
				left.bv_len--;
759
760
761
762
763
				goto retry;
			}

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

done:
	*matchp = match;
	return LDAP_SUCCESS;
}

773
774
/* Index generation function */
int caseExactIA5Indexer(
775
	unsigned flags,
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
	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(
828
	unsigned flags,
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
	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
static int
caseIgnoreIA5Match(
873
	int *matchp,
874
	unsigned flags,
875
876
877
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
878
	void *assertedValue )
879
{
880
881
882
883
884
885
886
887
888
	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;
889
	return LDAP_SUCCESS;
890
891
}

892
893
894
895
896
897
898
899
900
901
902
903
904
905
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;
	}
}

906
907
908
static int
caseIgnoreIA5SubstringsMatch(
	int *matchp,
909
	unsigned flags,
910
911
912
913
914
915
916
917
918
919
920
	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;

921
	/* Add up asserted input length */
922
923
924
925
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
926
		for(i=0; sub->sa_any[i] != NULL; i++) {
927
			inlen += sub->sa_any[i]->bv_len;
928
929
930
931
932
933
934
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
935
936
937
938
939
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

940
941
942
943
944
945
946
947
948
		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;
949
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
950
	}
951

Kurt Zeilenga's avatar
Kurt Zeilenga committed
952
	if( sub->sa_final ) {
953
954
955
956
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
957
958
959
960
961
962
963
964
965
966

		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;
967
		inlen -= sub->sa_final->bv_len;
968
969
970
	}

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

retry:
Kurt Zeilenga's avatar
Kurt Zeilenga committed
976
977
978
979
980
981
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

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
			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
1015
1016
1017
				left.bv_val++;
				left.bv_len--;

1018
1019
1020
1021
1022
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
1023
			inlen -= sub->sa_any[i]->bv_len;
1024
		}
1025
1026
1027
1028
1029
1030
	}

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

1032
1033
/* Index generation function */
int caseIgnoreIA5Indexer(
1034
	unsigned flags,
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
	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(
1090
	unsigned flags,
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
	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;
}

1136
static int
1137
numericStringNormalize(
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
	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 */
1151
	while ( ASCII_SPACE( *p ) ) {
1152
		p++;
1153
1154
	}

1155
	if( *p == '\0' ) {
1156
1157
1158
1159
1160
1161
1162
1163
		ch_free( newval );
		return LDAP_INVALID_SYNTAX;
	}

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

	while ( *p ) {
1164
		if ( ASCII_SPACE( *p ) ) {
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
			/* Ignore whitespace */
			p++;
		} else {
			*q++ = *p++;
		}
	}

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

	/* cannot start with a space */
1177
	assert( !ASCII_SPACE(*newval->bv_val) );
1178
1179

	/* cannot end with a space */
1180
	assert( !ASCII_SPACE( q[-1] ) );
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190

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

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

	return LDAP_SUCCESS;
}

1191
1192
1193
static int
objectIdentifierFirstComponentMatch(
	int *matchp,
1194
	unsigned flags,
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
	int rc = LDAP_SUCCESS;
	int match;
	struct berval *asserted = (struct berval *) assertedValue;
	ber_len_t i;
	struct berval oid;

	if( value->bv_len == 0 || value->bv_val[0] != '(' /*')'*/ ) {
		return LDAP_INVALID_SYNTAX;
	}

	/* trim leading white space */
1211
	for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
1212
1213
1214
1215
1216
1217
		/* empty */
	}

	/* grab next word */
	oid.bv_val = &value->bv_val[i];
	oid.bv_len = value->bv_len - i;
1218
	for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
1219
1220
1221
1222
1223
		/* empty */
	}
	oid.bv_len = i;

	/* insert attributeTypes, objectclass check here */
1224
	if( OID_LEADCHAR(asserted->bv_val[0]) ) {
1225
		rc = objectIdentifierMatch( &match, flags, syntax, mr, &oid, asserted );
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
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277

	} else {
		char *stored = ch_malloc( oid.bv_len + 1 );
		memcpy( stored, oid.bv_val, oid.bv_len );
		stored[oid.bv_len] = '\0';

		if ( !strcmp( syntax->ssyn_oid, SLAP_SYNTAX_MATCHINGRULES_OID ) ) {
			MatchingRule *asserted_mr = mr_find( asserted->bv_val );
			MatchingRule *stored_mr = mr_find( stored );

			if( asserted_mr == NULL ) {
				rc = SLAPD_COMPARE_UNDEFINED;
			} else {
				match = asserted_mr != stored_mr;
			}

		} else if ( !strcmp( syntax->ssyn_oid,
			SLAP_SYNTAX_ATTRIBUTETYPES_OID ) )
		{
			AttributeType *asserted_at = at_find( asserted->bv_val );
			AttributeType *stored_at = at_find( stored );

			if( asserted_at == NULL ) {
				rc = SLAPD_COMPARE_UNDEFINED;
			} else {
				match = asserted_at != stored_at;
			}

		} else if ( !strcmp( syntax->ssyn_oid,
			SLAP_SYNTAX_OBJECTCLASSES_OID ) )
		{
			ObjectClass *asserted_oc = oc_find( asserted->bv_val );
			ObjectClass *stored_oc = oc_find( stored );

			if( asserted_oc == NULL ) {
				rc = SLAPD_COMPARE_UNDEFINED;
			} else {
				match = asserted_oc != stored_oc;
			}
		}

		ch_free( stored );
	}

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

	if( rc == LDAP_SUCCESS ) *matchp = match;
	return rc;
}

1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
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 */
1295
	while ( ( p < e ) && ASCII_SPACE( *p ) ) {
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
		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 */
1377
	while ( ( p < e ) && ASCII_SPACE( *p ) ) {
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
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
		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);
}

1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
static int
generalizedTimeValidate(
	Syntax *syntax,
	struct berval *in )
{
	int parts[9];

	return check_time_syntax(in, 0, parts);
}

1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
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;
}

1516
1517
struct syntax_defs_rec {
	char *sd_desc;
1518
	int sd_flags;
1519
	slap_syntax_validate_func *sd_validate;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1520
1521
1522
	slap_syntax_transform_func *sd_normalize;
	slap_syntax_transform_func *sd_pretty;
#ifdef SLAPD_BINARY_CONVERSION
1523
1524
	slap_syntax_transform_func *sd_ber2str;
	slap_syntax_transform_func *sd_str2ber;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1525
#endif
1526
1527
};

1528
#define X_HIDE "X-HIDE 'TRUE' "
1529
1530
#define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
#define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
1531

1532
struct syntax_defs_rec syntax_defs[] = {
1533
1534
1535
1536
	{"( 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},
1537
	{"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
1538
		0, NULL, NULL, NULL},
1539
1540
1541
1542
	{"( 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},
1543
	{"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
1544
		0, bitStringValidate, bitStringNormalize, NULL },
1545
	{"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
1546
		0, booleanValidate, NULL, NULL},
1547
1548
1549
1550
1551
1552
	{"( 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
1553
1554
	{"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
		X_BINARY X_NOT_H_R ")",
1555
		SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
1556
1557
	{"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
		0, NULL, NULL, NULL},
1558
	{"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
1559
		0, dnValidate, dnNormalize, dnPretty},
1560
	{"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
1561
		0, NULL, NULL, NULL},
1562
	{"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
1563
		0, NULL, NULL, NULL},
1564
	{"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1565
		0, UTF8StringValidate, UTF8StringNormalize, NULL},
1566
	{"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
1567
		0, NULL, NULL, NULL},
1568
	{"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
1569
		0, NULL, NULL, NULL},
1570
	{"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
1571
		0, NULL, NULL, NULL},
1572
	{"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
1573
		0, NULL, NULL, NULL},
1574
	{"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
1575
		0, NULL, NULL, NULL},
1576
	{"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
1577
		0, IA5StringValidate, faxNumberNormalize, NULL},