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

/* recycled normalization routines */
24
25
26
#define faxNumberNormalize				numericStringNormalize
#define phoneNumberNormalize			numericStringNormalize
#define telexNumberNormalize			numericStringNormalize
27
28

/* recycled matching routines */
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#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
#define generalizedTimeMatch			numericStringMatch
#define generalizedTimeOrderingMatch	numericStringMatch
43
44

/* unimplemented matching routines */
45
46
47
48
49
50
51
52
53
54
55
#define caseIgnoreListMatch				NULL
#define caseIgnoreListSubstringsMatch	NULL
#define bitStringMatch					NULL
#define telephoneNumberSubstringsMatch	NULL
#define presentationAddressMatch		NULL
#define uniqueMemberMatch				NULL
#define protocolInformationMatch		NULL
#define integerFirstComponentMatch		NULL

#define OpenLDAPaciMatch				NULL
#define authPasswordMatch				NULL
56
57

/* unimplied indexer/filter routines */
58
59
60
61
#define dnIndexer						NULL
#define dnFilter						NULL
#define caseIgnoreIA5SubstringsIndexer	NULL
#define caseIgnoreIA5SubstringsFilter	NULL
62
63

/* recycled indexing/filtering routines */
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#define caseIgnoreIndexer				caseIgnoreIA5Indexer
#define caseIgnoreFilter				caseIgnoreIA5Filter
#define caseExactIndexer				caseExactIA5Indexer
#define caseExactFilter					caseExactIA5Filter
#define caseExactIA5Indexer				caseIgnoreIA5Indexer
#define caseExactIA5Filter				caseIgnoreIA5Filter

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

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
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
188
189
190
191
192
193
194
195
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;
}
196

197
198
199
200
201
202
203
204
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
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(
247
	int *matchp,
248
249
250
251
252
253
	unsigned use,
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
	void *assertedValue )
{
254
	int match;
255
256
	struct berval *asserted = (struct berval *) assertedValue;
	
257
258
259
	match = value->bv_len - asserted->bv_len;

	if( match == 0 ) {
260
#ifdef USE_DN_NORMALIZE
261
		match = strcmp( value->bv_val, asserted->bv_val );
262
#else
263
		match = strcasecmp( value->bv_val, asserted->bv_val );
264
#endif
265
266
267
268
269
270
271
	}

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

274
275
276
277
278
279
280
281
282
static int
inValidate(
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
	return LDAP_OTHER;
}

283
static int
284
blobValidate(
285
286
287
288
	Syntax *syntax,
	struct berval *in )
{
	/* any value allowed */
289
	return LDAP_SUCCESS;
290
291
292
293
294
295
296
297
298
299
300
}

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

301
	for( count = in->bv_len; count > 0; count-=len, u+=len ) {
302
303
304
305
		/* get the length indicated by the first byte */
		len = LDAP_UTF8_CHARLEN( u );

		/* should not be zero */
306
		if( len == 0 ) return LDAP_INVALID_SYNTAX;
307
308
309

		/* make sure len corresponds with the offset
			to the next character */
310
		if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
311
312
	}

313
	if( count != 0 ) return LDAP_INVALID_SYNTAX;
314

315
	return LDAP_SUCCESS;
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
}

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

336
	if( *p == '\0' ) {
337
		ch_free( newval );
338
		return LDAP_INVALID_SYNTAX;
339
340
341
342
343
344
345
346
347
348
349
350
351
352
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
382
383
384
385
386
387
388
389
	}

	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;
390
	*normalized = newval;
391

392
	return LDAP_SUCCESS;
393
394
}

395
396
397
398
399
400
401
402
403
static int
oidValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

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

404
	if( OID_LEADCHAR(val->bv_val[0]) ) {
405
406
		int dot = 0;
		for(i=1; i < val->bv_len; i++) {
407
			if( OID_SEPARATOR( val->bv_val[i] ) ) {
408
				if( dot++ ) return 1;
409
			} else if ( OID_CHAR( val->bv_val[i] ) ) {
410
411
				dot = 0;
			} else {
412
				return LDAP_INVALID_SYNTAX;
413
414
415
			}
		}

416
		return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
417

418
	} else if( DESC_LEADCHAR(val->bv_val[0]) ) {
419
		for(i=1; i < val->bv_len; i++) {
420
			if( !DESC_CHAR(val->bv_val[i] ) ) {
421
				return LDAP_INVALID_SYNTAX;
422
423
424
			}
		}

425
		return LDAP_SUCCESS;
426
427
	}
	
428
	return LDAP_INVALID_SYNTAX;
429
430
}

431
432
433
434
435
436
437
438
static int
integerValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

	for(i=0; i < val->bv_len; i++) {
439
		if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
440
441
	}

442
	return LDAP_SUCCESS;
443
444
445
446
447
448
449
450
451
452
}

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

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

456
	return LDAP_SUCCESS;
457
458
}

459
static int
460
461
462
463
464
465
466
IA5StringValidate(
	Syntax *syntax,
	struct berval *val )
{
	ber_len_t i;

	for(i=0; i < val->bv_len; i++) {
467
		if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
468
469
	}

470
	return LDAP_SUCCESS;
471
472
473
474
475
476
477
478
}

static int
IA5StringConvert(
	Syntax *syntax,
	struct berval *in,
	struct berval **out )
{
479
480
	ldap_unicode_t *u;
	ber_len_t i, len = in->bv_len;
481
482
	struct berval *bv = ch_malloc( sizeof(struct berval) );

483
	bv->bv_len = len * sizeof( ldap_unicode_t );
484
	bv->bv_val = (char *) u = ch_malloc( bv->bv_len + sizeof(ldap_unicode_t) );
485
486

	for(i=0; i < len; i++ ) {
487
488
489
490
		/*
		 * IA5StringValidate should have been called to ensure
		 * input is limited to IA5.
		 */
491
		u[i] = in->bv_val[i];
492
	}
493
	u[i] = 0;
494
495

	*out = bv;
496
	return LDAP_SUCCESS;
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
}

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 */
513
	while ( ASCII_SPACE( *p ) ) {
514
		p++;
515
516
	}

517
	if( *p != '\0' ) {
518
		ch_free( newval );
519
		return LDAP_INVALID_SYNTAX;
520
521
522
523
524
525
	}

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

	while ( *p ) {
526
		if ( ASCII_SPACE( *p ) ) {
527
528
529
			*q++ = *p++;

			/* Ignore the extra whitespace */
530
			while ( ASCII_SPACE( *p ) ) {
531
				p++;
532
533
534
535
536
537
538
539
540
541
542
			}
		} else {
			*q++ = *p++;
		}
	}

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

	/* cannot start with a space */
543
	assert( !ASCII_SPACE(*newval->bv_val) );
544
545
546
547
548
549
550

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

551
	if ( ASCII_SPACE( q[-1] ) ) {
552
553
554
555
		--q;
	}

	/* cannot end with a space */
556
	assert( !ASCII_SPACE( q[-1] ) );
557
558
559
560
561

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

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

564
	return LDAP_SUCCESS;
565
566
567
568
}

static int
caseExactIA5Match(
569
	int *matchp,
570
	unsigned use,
571
572
573
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
574
	void *assertedValue )
575
{
576
577
578
579
580
581
582
583
584
	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;
585
	return LDAP_SUCCESS;
586
587
}

588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
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;

603
	/* Add up asserted input length */
604
605
606
607
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
608
609
		for(i=0; sub->sa_any[i] != NULL; i++) {
			inlen += sub->sa_any[i]->bv_len;
610
611
612
613
614
615
616
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
617
618
619
620
621
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

622
623
624
625
626
627
628
629
630
		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;
631
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
632
	}
633

Kurt Zeilenga's avatar
Kurt Zeilenga committed
634
	if( sub->sa_final ) {
635
636
637
638
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
639
640
641
642
643
644
645
646
647
648

		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;
649
		inlen -= sub->sa_final->bv_len;
650
651
652
	}

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

retry:
Kurt Zeilenga's avatar
Kurt Zeilenga committed
658
659
660
661
662
663
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
			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
697
698
				left.bv_val++;
				left.bv_len--;
699
700
701
702
703
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
704
			inlen -= sub->sa_any[i]->bv_len;
705
		}
706
707
708
709
710
711
712
	}

done:
	*matchp = match;
	return LDAP_SUCCESS;
}

713
714
static int
caseIgnoreIA5Match(
715
	int *matchp,
716
	unsigned use,
717
718
719
	Syntax *syntax,
	MatchingRule *mr,
	struct berval *value,
720
	void *assertedValue )
721
{
722
723
724
725
726
727
728
729
730
	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;
731
	return LDAP_SUCCESS;
732
733
}

734
735
736
737
738
739
740
741
742
743
744
745
746
747
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;
	}
}

748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
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;

763
	/* Add up asserted input length */
764
765
766
767
	if( sub->sa_initial ) {
		inlen += sub->sa_initial->bv_len;
	}
	if( sub->sa_any ) {
768
		for(i=0; sub->sa_any[i] != NULL; i++) {
769
			inlen += sub->sa_any[i]->bv_len;
770
771
772
773
774
775
776
		}
	}
	if( sub->sa_final ) {
		inlen += sub->sa_final->bv_len;
	}

	if( sub->sa_initial ) {
Kurt Zeilenga's avatar
Kurt Zeilenga committed
777
778
779
780
781
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}

782
783
784
785
786
787
788
789
790
		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;
791
		inlen -= sub->sa_initial->bv_len;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
792
	}
793

Kurt Zeilenga's avatar
Kurt Zeilenga committed
794
	if( sub->sa_final ) {
795
796
797
798
		if( inlen > left.bv_len ) {
			match = 1;
			goto done;
		}
799
800
801
802
803
804
805
806
807
808

		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;
809
		inlen -= sub->sa_final->bv_len;
810
811
812
	}

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

retry:
Kurt Zeilenga's avatar
Kurt Zeilenga committed
818
819
820
821
822
823
			if( inlen > left.bv_len ) {
				/* not enough length */
				match = 1;
				goto done;
			}

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
			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
857
858
859
				left.bv_val++;
				left.bv_len--;

860
861
862
863
864
				goto retry;
			}

			left.bv_val += sub->sa_any[i]->bv_len;
			left.bv_len -= sub->sa_any[i]->bv_len;
865
			inlen -= sub->sa_any[i]->bv_len;
866
		}
867
868
869
870
871
872
	}

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

874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
/* 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;
}

978
static int
979
numericStringNormalize(
980
981
982
983
984
985
986
987
988
989
990
991
992
	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 */
993
	while ( ASCII_SPACE( *p ) ) {
994
		p++;
995
996
997
998
999
1000
1001
1002
1003
1004
1005
	}

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

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

	while ( *p ) {
1006
		if ( ASCII_SPACE( *p ) ) {
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
			/* Ignore whitespace */
			p++;
		} else {
			*q++ = *p++;
		}
	}

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

	/* cannot start with a space */
1019
	assert( !ASCII_SPACE(*newval->bv_val) );
1020
1021

	/* cannot end with a space */
1022
	assert( !ASCII_SPACE( q[-1] ) );
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032

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

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

	return LDAP_SUCCESS;
}

1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
static int
objectIdentifierFirstComponentMatch(
	int *matchp,
	unsigned use,
	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 */
1053
	for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
1054
1055
1056
1057
1058
1059
		/* empty */
	}

	/* grab next word */
	oid.bv_val = &value->bv_val[i];
	oid.bv_len = value->bv_len - i;
1060
	for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
1061
1062
1063
1064
1065
		/* empty */
	}
	oid.bv_len = i;

	/* insert attributeTypes, objectclass check here */
1066
	if( OID_LEADCHAR(asserted->bv_val[0]) ) {
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
		rc = objectIdentifierMatch( &match, use, syntax, mr, &oid, asserted );

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

1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
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 */
1137
	while ( ( p < e ) && ASCII_SPACE( *p ) ) {
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
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
		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 */
1219
	while ( ( p < e ) && ASCII_SPACE( *p ) ) {
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
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
		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);
}

1358
1359
struct syntax_defs_rec {
	char *sd_desc;
1360
	int sd_flags;
1361
	slap_syntax_validate_func *sd_validate;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1362
1363
1364
	slap_syntax_transform_func *sd_normalize;
	slap_syntax_transform_func *sd_pretty;
#ifdef SLAPD_BINARY_CONVERSION
1365
1366
	slap_syntax_transform_func *sd_ber2str;
	slap_syntax_transform_func *sd_str2ber;
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1367
#endif
1368
1369
};

1370
#define X_HIDE "X-HIDE 'TRUE' "
1371
1372
#define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
#define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
1373

1374
struct syntax_defs_rec syntax_defs[] = {
1375
1376
1377
1378
	{"( 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},
1379
	{"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
1380
		0, NULL, NULL, NULL},
1381
1382
1383
1384
	{"( 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},
1385
	{"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
1386
		0, NULL, NULL, NULL},
1387
	{"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
1388
		0, NULL, NULL, NULL},
1389
1390
1391
1392
1393
1394
	{"( 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
1395
1396
	{"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
		X_BINARY X_NOT_H_R ")",
1397
		SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
1398
1399
	{"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
		0, NULL, NULL, NULL},
1400
1401
	{"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
		0, dnValidate, dnNormalize, NULL},
1402
	{"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
1403
		0, NULL, NULL, NULL},
1404
	{"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
1405
		0, NULL, NULL, NULL},
1406
	{"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1407
		0, UTF8StringValidate, UTF8StringNormalize, NULL},
1408
	{"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
1409
		0, NULL, NULL, NULL},
1410
	{"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
1411
		0, NULL, NULL, NULL},
1412
	{"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
1413
		0, NULL, NULL, NULL},
1414
	{"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
1415
		0, NULL, NULL, NULL},
1416
	{"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
1417
		0, NULL, NULL, NULL},
1418
	{"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
1419
		0, IA5StringValidate, faxNumberNormalize, NULL},
1420
1421
	{"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
		SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
1422
	{"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
1423
		0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
1424
	{"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
1425
		0, NULL, NULL, NULL},
1426
	{"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1427
		0, IA5StringValidate, IA5StringNormalize, NULL},
1428
	{"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
1429
		0, integerValidate, NULL, NULL},
1430
1431
	{"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
		SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
1432
	{"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
1433
		0, NULL, NULL, NULL},
1434
	{"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
1435
		0, NULL, NULL, NULL},
1436
	{"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
1437
		0, NULL, NULL, NULL},
1438
	{"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
1439
		0, NULL, NULL, NULL},
1440
	{"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
1441
		0, NULL, NULL, NULL},
1442
	{"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
1443
		0, NULL, NULL, NULL},
1444
	{"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
1445
		0, NULL, NULL, NULL},
1446
	{"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
1447
		0, IA5StringValidate, numericStringNormalize, NULL},
1448
	{"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
1449
		0, NULL, NULL, NULL},
1450
	{"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
1451
		0, oidValidate, NULL, NULL},
1452
	{"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
1453
		0, NULL, NULL, NULL},
1454
	{"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
Kurt Zeilenga's avatar
Kurt Zeilenga committed
1455
		0, blobValidate, NULL, NULL},
1456
	{"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
1457
		0, blobValidate, NULL, NULL},
1458
	{"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
1459
		0, NULL, NULL, NULL},
1460
	{"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
1461
		0, NULL, NULL, NULL},
1462
	{"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
1463
		0, printableStringValidate, NULL, NULL},
1464
1465
1466
	{"( 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},
1467
	{"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
1468
		0, IA5StringValidate, phoneNumberNormalize, NULL},
1469
1470
1471
	{"( 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' )",
1472
		0, IA5StringValidate, telexNumberNormalize, NULL},
1473
	{"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
1474
		0, utcTimeValidate, utcTimeNormalize, NULL},
1475
	{"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
1476
		0, NULL, NULL, NULL},
1477
	{"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
1478
		0, NULL, NULL, NULL},
1479
	{"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
1480
		0, NULL, NULL, NULL},
1481
	{"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
1482
		0, NULL, NULL, NULL},
1483
	{"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
1484
		0, NULL, NULL, NULL},
1485

1486
	/* OpenLDAP Experimental Syntaxes */
1487
	{"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
1488
		0, IA5StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */, NULL, NULL},
1489
1490
1491
1492
	{"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
		0<