1 /* schema_init.c - init builtin schema */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2007 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
26 #include <ac/string.h>
27 #include <ac/socket.h>
30 #include "../../libraries/liblber/lber-int.h" /* get ber_ptrlen() */
32 #include "ldap_utf8.h"
35 #include "lutil_hash.h"
36 #define HASH_BYTES LUTIL_HASH_BYTES
37 #define HASH_CONTEXT lutil_HASH_CTX
38 #define HASH_Init(c) lutil_HASHInit(c)
39 #define HASH_Update(c,buf,len) lutil_HASHUpdate(c,buf,len)
40 #define HASH_Final(d,c) lutil_HASHFinal(d,c)
42 /* approx matching rules */
43 #define directoryStringApproxMatchOID "1.3.6.1.4.1.4203.666.4.4"
44 #define directoryStringApproxMatch approxMatch
45 #define directoryStringApproxIndexer approxIndexer
46 #define directoryStringApproxFilter approxFilter
47 #define IA5StringApproxMatchOID "1.3.6.1.4.1.4203.666.4.5"
48 #define IA5StringApproxMatch approxMatch
49 #define IA5StringApproxIndexer approxIndexer
50 #define IA5StringApproxFilter approxFilter
52 /* Change Sequence Number (CSN) - much of this will change */
53 #define csnMatch octetStringMatch
54 #define csnOrderingMatch octetStringOrderingMatch
55 #define csnIndexer generalizedTimeIndexer
56 #define csnFilter generalizedTimeFilter
58 #define authzMatch octetStringMatch
60 unsigned int index_substr_if_minlen = SLAP_INDEX_SUBSTR_IF_MINLEN_DEFAULT;
61 unsigned int index_substr_if_maxlen = SLAP_INDEX_SUBSTR_IF_MAXLEN_DEFAULT;
62 unsigned int index_substr_any_len = SLAP_INDEX_SUBSTR_ANY_LEN_DEFAULT;
63 unsigned int index_substr_any_step = SLAP_INDEX_SUBSTR_ANY_STEP_DEFAULT;
65 ldap_pvt_thread_mutex_t ad_undef_mutex;
66 ldap_pvt_thread_mutex_t oc_undef_mutex;
69 generalizedTimeValidate(
78 /* no value allowed */
79 return LDAP_INVALID_SYNTAX;
87 /* any value allowed */
91 #define berValidate blobValidate
98 if ( in->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
99 if ( in->bv_val[0] != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
104 /* X.509 related stuff */
112 #define SLAP_X509_OPTION (LBER_CLASS_CONTEXT|LBER_CONSTRUCTED)
115 SLAP_X509_OPT_C_VERSION = SLAP_X509_OPTION + 0,
116 SLAP_X509_OPT_C_ISSUERUNIQUEID = SLAP_X509_OPTION + 1,
117 SLAP_X509_OPT_C_SUBJECTUNIQUEID = SLAP_X509_OPTION + 2,
118 SLAP_X509_OPT_C_EXTENSIONS = SLAP_X509_OPTION + 3
122 SLAP_X509_OPT_CL_CRLEXTENSIONS = SLAP_X509_OPTION + 0
125 /* X.509 certificate validation */
126 static int certificateValidate( Syntax *syntax, struct berval *in )
128 BerElementBuffer berbuf;
129 BerElement *ber = (BerElement *)&berbuf;
132 ber_int_t version = SLAP_X509_V1;
134 ber_init2( ber, in, LBER_USE_DER );
135 tag = ber_skip_tag( ber, &len ); /* Signed wrapper */
136 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
137 tag = ber_skip_tag( ber, &len ); /* Sequence */
138 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
139 tag = ber_peek_tag( ber, &len );
140 /* Optional version */
141 if ( tag == SLAP_X509_OPT_C_VERSION ) {
142 tag = ber_skip_tag( ber, &len );
143 tag = ber_get_int( ber, &version );
144 if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
146 /* NOTE: don't try to parse Serial, because it might be longer
147 * than sizeof(ber_int_t); deferred to certificateExactNormalize() */
148 tag = ber_skip_tag( ber, &len ); /* Serial */
149 if ( tag != LBER_INTEGER ) return LDAP_INVALID_SYNTAX;
150 ber_skip_data( ber, len );
151 tag = ber_skip_tag( ber, &len ); /* Signature Algorithm */
152 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
153 ber_skip_data( ber, len );
154 tag = ber_skip_tag( ber, &len ); /* Issuer DN */
155 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
156 ber_skip_data( ber, len );
157 tag = ber_skip_tag( ber, &len ); /* Validity */
158 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
159 ber_skip_data( ber, len );
160 tag = ber_skip_tag( ber, &len ); /* Subject DN */
161 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
162 ber_skip_data( ber, len );
163 tag = ber_skip_tag( ber, &len ); /* Subject PublicKeyInfo */
164 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
165 ber_skip_data( ber, len );
166 tag = ber_skip_tag( ber, &len );
167 if ( tag == SLAP_X509_OPT_C_ISSUERUNIQUEID ) { /* issuerUniqueID */
168 if ( version < SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
169 ber_skip_data( ber, len );
170 tag = ber_skip_tag( ber, &len );
172 if ( tag == SLAP_X509_OPT_C_SUBJECTUNIQUEID ) { /* subjectUniqueID */
173 if ( version < SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
174 ber_skip_data( ber, len );
175 tag = ber_skip_tag( ber, &len );
177 if ( tag == SLAP_X509_OPT_C_EXTENSIONS ) { /* Extensions */
178 if ( version < SLAP_X509_V3 ) return LDAP_INVALID_SYNTAX;
179 tag = ber_skip_tag( ber, &len );
180 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
181 ber_skip_data( ber, len );
182 tag = ber_skip_tag( ber, &len );
184 /* signatureAlgorithm */
185 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
186 ber_skip_data( ber, len );
187 tag = ber_skip_tag( ber, &len );
189 if ( tag != LBER_BITSTRING ) return LDAP_INVALID_SYNTAX;
190 ber_skip_data( ber, len );
191 tag = ber_skip_tag( ber, &len );
192 /* Must be at end now */
193 if ( len || tag != LBER_DEFAULT ) return LDAP_INVALID_SYNTAX;
197 /* X.509 certificate list validation */
198 static int certificateListValidate( Syntax *syntax, struct berval *in )
200 BerElementBuffer berbuf;
201 BerElement *ber = (BerElement *)&berbuf;
204 ber_int_t version = SLAP_X509_V1;
206 ber_init2( ber, in, LBER_USE_DER );
207 tag = ber_skip_tag( ber, &len ); /* Signed wrapper */
208 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
209 tag = ber_skip_tag( ber, &len ); /* Sequence */
210 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
211 tag = ber_peek_tag( ber, &len );
212 /* Optional version */
213 if ( tag == LBER_INTEGER ) {
214 tag = ber_get_int( ber, &version );
215 assert( tag == LBER_INTEGER );
216 if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
218 tag = ber_skip_tag( ber, &len ); /* Signature Algorithm */
219 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
220 ber_skip_data( ber, len );
221 tag = ber_skip_tag( ber, &len ); /* Issuer DN */
222 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
223 ber_skip_data( ber, len );
224 tag = ber_skip_tag( ber, &len ); /* thisUpdate */
225 /* Time is a CHOICE { UTCTime, GeneralizedTime } */
226 if ( tag != 0x17U && tag != 0x18U ) return LDAP_INVALID_SYNTAX;
227 ber_skip_data( ber, len );
228 /* Optional nextUpdate */
229 tag = ber_skip_tag( ber, &len );
230 if ( tag == 0x17U || tag == 0x18U ) {
231 ber_skip_data( ber, len );
232 tag = ber_skip_tag( ber, &len );
234 /* revokedCertificates - Sequence of Sequence, Optional */
235 if ( tag == LBER_SEQUENCE ) {
237 if ( ber_peek_tag( ber, &seqlen ) == LBER_SEQUENCE ) {
238 /* Should NOT be empty */
239 ber_skip_data( ber, len );
240 tag = ber_skip_tag( ber, &len );
243 /* Optional Extensions */
244 if ( tag == SLAP_X509_OPT_CL_CRLEXTENSIONS ) { /* ? */
245 if ( version != SLAP_X509_V2 ) return LDAP_INVALID_SYNTAX;
246 tag = ber_skip_tag( ber, &len );
247 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
248 ber_skip_data( ber, len );
249 tag = ber_skip_tag( ber, &len );
251 /* signatureAlgorithm */
252 if ( tag != LBER_SEQUENCE ) return LDAP_INVALID_SYNTAX;
253 ber_skip_data( ber, len );
254 tag = ber_skip_tag( ber, &len );
256 if ( tag != LBER_BITSTRING ) return LDAP_INVALID_SYNTAX;
257 ber_skip_data( ber, len );
258 tag = ber_skip_tag( ber, &len );
259 /* Must be at end now */
260 if ( len || tag != LBER_DEFAULT ) return LDAP_INVALID_SYNTAX;
270 struct berval *value,
271 void *assertedValue )
273 struct berval *asserted = (struct berval *) assertedValue;
274 int match = value->bv_len - asserted->bv_len;
277 match = memcmp( value->bv_val, asserted->bv_val, value->bv_len );
285 octetStringOrderingMatch(
290 struct berval *value,
291 void *assertedValue )
293 struct berval *asserted = (struct berval *) assertedValue;
294 ber_len_t v_len = value->bv_len;
295 ber_len_t av_len = asserted->bv_len;
297 int match = memcmp( value->bv_val, asserted->bv_val,
298 (v_len < av_len ? v_len : av_len) );
300 if( match == 0 ) match = v_len - av_len;
308 HASH_CONTEXT *HASHcontext,
309 struct berval *prefix,
314 HASH_Init(HASHcontext);
315 if(prefix && prefix->bv_len > 0) {
316 HASH_Update(HASHcontext,
317 (unsigned char *)prefix->bv_val, prefix->bv_len);
319 if(pre) HASH_Update(HASHcontext, (unsigned char*)&pre, sizeof(pre));
320 HASH_Update(HASHcontext, (unsigned char*)syntax->ssyn_oid, syntax->ssyn_oidlen);
321 HASH_Update(HASHcontext, (unsigned char*)mr->smr_oid, mr->smr_oidlen);
327 HASH_CONTEXT *HASHcontext,
328 unsigned char *HASHdigest,
329 unsigned char *value,
332 HASH_CONTEXT ctx = *HASHcontext;
333 HASH_Update( &ctx, value, len );
334 HASH_Final( HASHdigest, &ctx );
337 /* Index generation function */
338 int octetStringIndexer(
343 struct berval *prefix,
351 HASH_CONTEXT HASHcontext;
352 unsigned char HASHdigest[HASH_BYTES];
353 struct berval digest;
354 digest.bv_val = (char *)HASHdigest;
355 digest.bv_len = sizeof(HASHdigest);
357 for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
358 /* just count them */
361 /* we should have at least one value at this point */
364 keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
366 slen = syntax->ssyn_oidlen;
367 mlen = mr->smr_oidlen;
369 hashPreset( &HASHcontext, prefix, 0, syntax, mr);
370 for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
371 hashIter( &HASHcontext, HASHdigest,
372 (unsigned char *)values[i].bv_val, values[i].bv_len );
373 ber_dupbv_x( &keys[i], &digest, ctx );
376 BER_BVZERO( &keys[i] );
383 /* Index generation function */
384 int octetStringFilter(
389 struct berval *prefix,
390 void * assertedValue,
396 HASH_CONTEXT HASHcontext;
397 unsigned char HASHdigest[HASH_BYTES];
398 struct berval *value = (struct berval *) assertedValue;
399 struct berval digest;
400 digest.bv_val = (char *)HASHdigest;
401 digest.bv_len = sizeof(HASHdigest);
403 slen = syntax->ssyn_oidlen;
404 mlen = mr->smr_oidlen;
406 keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
408 hashPreset( &HASHcontext, prefix, 0, syntax, mr );
409 hashIter( &HASHcontext, HASHdigest,
410 (unsigned char *)value->bv_val, value->bv_len );
412 ber_dupbv_x( keys, &digest, ctx );
413 BER_BVZERO( &keys[1] );
421 octetStringSubstringsMatch(
426 struct berval *value,
427 void *assertedValue )
430 SubstringsAssertion *sub = assertedValue;
431 struct berval left = *value;
435 /* Add up asserted input length */
436 if ( !BER_BVISNULL( &sub->sa_initial ) ) {
437 inlen += sub->sa_initial.bv_len;
440 for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
441 inlen += sub->sa_any[i].bv_len;
444 if ( !BER_BVISNULL( &sub->sa_final ) ) {
445 inlen += sub->sa_final.bv_len;
448 if ( !BER_BVISNULL( &sub->sa_initial ) ) {
449 if ( inlen > left.bv_len ) {
454 match = memcmp( sub->sa_initial.bv_val, left.bv_val,
455 sub->sa_initial.bv_len );
461 left.bv_val += sub->sa_initial.bv_len;
462 left.bv_len -= sub->sa_initial.bv_len;
463 inlen -= sub->sa_initial.bv_len;
466 if ( !BER_BVISNULL( &sub->sa_final ) ) {
467 if ( inlen > left.bv_len ) {
472 match = memcmp( sub->sa_final.bv_val,
473 &left.bv_val[left.bv_len - sub->sa_final.bv_len],
474 sub->sa_final.bv_len );
480 left.bv_len -= sub->sa_final.bv_len;
481 inlen -= sub->sa_final.bv_len;
485 for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
490 if ( inlen > left.bv_len ) {
491 /* not enough length */
496 if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
500 p = memchr( left.bv_val, *sub->sa_any[i].bv_val, left.bv_len );
507 idx = p - left.bv_val;
509 if ( idx >= left.bv_len ) {
510 /* this shouldn't happen */
517 if ( sub->sa_any[i].bv_len > left.bv_len ) {
518 /* not enough left */
523 match = memcmp( left.bv_val,
524 sub->sa_any[i].bv_val,
525 sub->sa_any[i].bv_len );
533 left.bv_val += sub->sa_any[i].bv_len;
534 left.bv_len -= sub->sa_any[i].bv_len;
535 inlen -= sub->sa_any[i].bv_len;
544 /* Substrings Index generation function */
546 octetStringSubstringsIndexer(
551 struct berval *prefix,
560 HASH_CONTEXT HCany, HCini, HCfin;
561 unsigned char HASHdigest[HASH_BYTES];
562 struct berval digest;
563 digest.bv_val = (char *)HASHdigest;
564 digest.bv_len = sizeof(HASHdigest);
568 for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
569 /* count number of indices to generate */
570 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
571 if( values[i].bv_len >= index_substr_if_maxlen ) {
572 nkeys += index_substr_if_maxlen -
573 (index_substr_if_minlen - 1);
574 } else if( values[i].bv_len >= index_substr_if_minlen ) {
575 nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
579 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
580 if( values[i].bv_len >= index_substr_any_len ) {
581 nkeys += values[i].bv_len - (index_substr_any_len - 1);
585 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
586 if( values[i].bv_len >= index_substr_if_maxlen ) {
587 nkeys += index_substr_if_maxlen -
588 (index_substr_if_minlen - 1);
589 } else if( values[i].bv_len >= index_substr_if_minlen ) {
590 nkeys += values[i].bv_len - (index_substr_if_minlen - 1);
596 /* no keys to generate */
601 keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
603 slen = syntax->ssyn_oidlen;
604 mlen = mr->smr_oidlen;
606 if ( flags & SLAP_INDEX_SUBSTR_ANY )
607 hashPreset( &HCany, prefix, SLAP_INDEX_SUBSTR_PREFIX, syntax, mr );
608 if( flags & SLAP_INDEX_SUBSTR_INITIAL )
609 hashPreset( &HCini, prefix, SLAP_INDEX_SUBSTR_INITIAL_PREFIX, syntax, mr );
610 if( flags & SLAP_INDEX_SUBSTR_FINAL )
611 hashPreset( &HCfin, prefix, SLAP_INDEX_SUBSTR_FINAL_PREFIX, syntax, mr );
614 for ( i = 0; !BER_BVISNULL( &values[i] ); i++ ) {
617 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
618 ( values[i].bv_len >= index_substr_any_len ) )
620 max = values[i].bv_len - (index_substr_any_len - 1);
622 for( j=0; j<max; j++ ) {
623 hashIter( &HCany, HASHdigest,
624 (unsigned char *)&values[i].bv_val[j],
625 index_substr_any_len );
626 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
630 /* skip if too short */
631 if( values[i].bv_len < index_substr_if_minlen ) continue;
633 max = index_substr_if_maxlen < values[i].bv_len
634 ? index_substr_if_maxlen : values[i].bv_len;
636 for( j=index_substr_if_minlen; j<=max; j++ ) {
638 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
639 hashIter( &HCini, HASHdigest,
640 (unsigned char *)values[i].bv_val, j );
641 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
644 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
645 hashIter( &HCfin, HASHdigest,
646 (unsigned char *)&values[i].bv_val[values[i].bv_len-j], j );
647 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
654 BER_BVZERO( &keys[nkeys] );
665 octetStringSubstringsFilter (
670 struct berval *prefix,
671 void * assertedValue,
675 SubstringsAssertion *sa;
678 size_t slen, mlen, klen;
680 HASH_CONTEXT HASHcontext;
681 unsigned char HASHdigest[HASH_BYTES];
682 struct berval *value;
683 struct berval digest;
685 sa = (SubstringsAssertion *) assertedValue;
687 if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
688 !BER_BVISNULL( &sa->sa_initial ) &&
689 sa->sa_initial.bv_len >= index_substr_if_minlen )
692 if ( sa->sa_initial.bv_len > index_substr_if_maxlen &&
693 ( flags & SLAP_INDEX_SUBSTR_ANY ))
695 nkeys += 1 + (sa->sa_initial.bv_len - index_substr_if_maxlen) / index_substr_any_step;
699 if ( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
701 for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
702 if( sa->sa_any[i].bv_len >= index_substr_any_len ) {
703 /* don't bother accounting with stepping */
704 nkeys += sa->sa_any[i].bv_len -
705 ( index_substr_any_len - 1 );
710 if( flags & SLAP_INDEX_SUBSTR_FINAL &&
711 !BER_BVISNULL( &sa->sa_final ) &&
712 sa->sa_final.bv_len >= index_substr_if_minlen )
715 if ( sa->sa_final.bv_len > index_substr_if_maxlen &&
716 ( flags & SLAP_INDEX_SUBSTR_ANY ))
718 nkeys += 1 + (sa->sa_final.bv_len - index_substr_if_maxlen) / index_substr_any_step;
727 digest.bv_val = (char *)HASHdigest;
728 digest.bv_len = sizeof(HASHdigest);
730 slen = syntax->ssyn_oidlen;
731 mlen = mr->smr_oidlen;
733 keys = slap_sl_malloc( sizeof( struct berval ) * (nkeys+1), ctx );
736 if( flags & SLAP_INDEX_SUBSTR_INITIAL &&
737 !BER_BVISNULL( &sa->sa_initial ) &&
738 sa->sa_initial.bv_len >= index_substr_if_minlen )
740 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
741 value = &sa->sa_initial;
743 klen = index_substr_if_maxlen < value->bv_len
744 ? index_substr_if_maxlen : value->bv_len;
746 hashPreset( &HASHcontext, prefix, pre, syntax, mr );
747 hashIter( &HASHcontext, HASHdigest,
748 (unsigned char *)value->bv_val, klen );
749 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
751 /* If initial is too long and we have subany indexed, use it
752 * to match the excess...
754 if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
757 pre = SLAP_INDEX_SUBSTR_PREFIX;
758 hashPreset( &HASHcontext, prefix, pre, syntax, mr);
759 for ( j=index_substr_if_maxlen-1; j <= value->bv_len - index_substr_any_len; j+=index_substr_any_step )
761 hashIter( &HASHcontext, HASHdigest,
762 (unsigned char *)&value->bv_val[j], index_substr_any_len );
763 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
768 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
770 pre = SLAP_INDEX_SUBSTR_PREFIX;
771 klen = index_substr_any_len;
773 for( i=0; !BER_BVISNULL( &sa->sa_any[i] ); i++ ) {
774 if( sa->sa_any[i].bv_len < index_substr_any_len ) {
778 value = &sa->sa_any[i];
780 hashPreset( &HASHcontext, prefix, pre, syntax, mr);
782 j <= value->bv_len - index_substr_any_len;
783 j += index_substr_any_step )
785 hashIter( &HASHcontext, HASHdigest,
786 (unsigned char *)&value->bv_val[j], klen );
787 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
792 if( flags & SLAP_INDEX_SUBSTR_FINAL &&
793 !BER_BVISNULL( &sa->sa_final ) &&
794 sa->sa_final.bv_len >= index_substr_if_minlen )
796 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
797 value = &sa->sa_final;
799 klen = index_substr_if_maxlen < value->bv_len
800 ? index_substr_if_maxlen : value->bv_len;
802 hashPreset( &HASHcontext, prefix, pre, syntax, mr );
803 hashIter( &HASHcontext, HASHdigest,
804 (unsigned char *)&value->bv_val[value->bv_len-klen], klen );
805 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
807 /* If final is too long and we have subany indexed, use it
808 * to match the excess...
810 if (value->bv_len > index_substr_if_maxlen && (flags & SLAP_INDEX_SUBSTR_ANY))
813 pre = SLAP_INDEX_SUBSTR_PREFIX;
814 hashPreset( &HASHcontext, prefix, pre, syntax, mr);
815 for ( j=0; j <= value->bv_len - index_substr_if_maxlen; j+=index_substr_any_step )
817 hashIter( &HASHcontext, HASHdigest,
818 (unsigned char *)&value->bv_val[j], index_substr_any_len );
819 ber_dupbv_x( &keys[nkeys++], &digest, ctx );
825 BER_BVZERO( &keys[nkeys] );
842 /* very unforgiving validation, requires no normalization
843 * before simplistic matching
845 if( in->bv_len < 3 ) {
846 return LDAP_INVALID_SYNTAX;
849 /* RFC 4517 Section 3.3.2 Bit String:
850 * BitString = SQUOTE *binary-digit SQUOTE "B"
851 * binary-digit = "0" / "1"
853 * where SQUOTE [RFC4512] is
854 * SQUOTE = %x27 ; single quote ("'")
856 * Example: '0101111101'B
859 if( in->bv_val[0] != '\'' ||
860 in->bv_val[in->bv_len - 2] != '\'' ||
861 in->bv_val[in->bv_len - 1] != 'B' )
863 return LDAP_INVALID_SYNTAX;
866 for( i = in->bv_len - 3; i > 0; i-- ) {
867 if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
868 return LDAP_INVALID_SYNTAX;
876 * Syntaxes from RFC 4517
881 A value of the Bit String syntax is a sequence of binary digits. The
882 LDAP-specific encoding of a value of this syntax is defined by the
885 BitString = SQUOTE *binary-digit SQUOTE "B"
887 binary-digit = "0" / "1"
889 The <SQUOTE> rule is defined in [MODELS].
894 The LDAP definition for the Bit String syntax is:
896 ( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )
898 This syntax corresponds to the BIT STRING ASN.1 type from [ASN.1].
902 3.3.21. Name and Optional UID
904 A value of the Name and Optional UID syntax is the distinguished name
905 [MODELS] of an entity optionally accompanied by a unique identifier
906 that serves to differentiate the entity from others with an identical
909 The LDAP-specific encoding of a value of this syntax is defined by
912 NameAndOptionalUID = distinguishedName [ SHARP BitString ]
914 The <BitString> rule is defined in Section 3.3.2. The
915 <distinguishedName> rule is defined in [LDAPDN]. The <SHARP> rule is
918 Note that although the '#' character may occur in the string
919 representation of a distinguished name, no additional escaping of
920 this character is performed when a <distinguishedName> is encoded in
921 a <NameAndOptionalUID>.
924 1.3.6.1.4.1.1466.0=#04024869,O=Test,C=GB#'0101'B
926 The LDAP definition for the Name and Optional UID syntax is:
928 ( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )
930 This syntax corresponds to the NameAndOptionalUID ASN.1 type from
937 1.4. Common ABNF Productions
940 SHARP = %x23 ; octothorpe (or sharp sign) ("#")
942 SQUOTE = %x27 ; single quote ("'")
946 * Note: normalization strips any leading "0"s, unless the
947 * bit string is exactly "'0'B", so the normalized example,
948 * in slapd, would result in
950 * 1.3.6.1.4.1.1466.0=#04024869,o=test,c=gb#'101'B
952 * RFC 4514 clarifies that SHARP, i.e. "#", doesn't have to
953 * be escaped except when at the beginning of a value, the
954 * definition of Name and Optional UID appears to be flawed,
955 * because there is no clear means to determine whether the
956 * UID part is present or not.
960 * cn=Someone,dc=example,dc=com#'1'B
962 * could be either a NameAndOptionalUID with trailing UID, i.e.
964 * DN = "cn=Someone,dc=example,dc=com"
967 * or a NameAndOptionalUID with no trailing UID, and the AVA
968 * in the last RDN made of
971 * attributeValue = com#'1'B
973 * in fact "com#'1'B" is a valid IA5 string.
975 * As a consequence, current slapd code assumes that the
976 * presence of portions of a BitString at the end of the string
977 * representation of a NameAndOptionalUID means a BitString
978 * is expected, and cause an error otherwise. This is quite
979 * arbitrary, and might change in the future.
989 struct berval dn, uid;
991 if( BER_BVISEMPTY( in ) ) return LDAP_SUCCESS;
993 ber_dupbv( &dn, in );
994 if( !dn.bv_val ) return LDAP_OTHER;
996 /* if there's a "#", try bitStringValidate()... */
997 uid.bv_val = strrchr( dn.bv_val, '#' );
998 if ( !BER_BVISNULL( &uid ) ) {
1000 uid.bv_len = dn.bv_len - ( uid.bv_val - dn.bv_val );
1002 rc = bitStringValidate( NULL, &uid );
1003 if ( rc == LDAP_SUCCESS ) {
1004 /* in case of success, trim the UID,
1005 * otherwise treat it as part of the DN */
1006 dn.bv_len -= uid.bv_len + 1;
1007 uid.bv_val[-1] = '\0';
1011 rc = dnValidate( NULL, &dn );
1013 ber_memfree( dn.bv_val );
1024 assert( val != NULL );
1025 assert( out != NULL );
1028 Debug( LDAP_DEBUG_TRACE, ">>> nameUIDPretty: <%s>\n", val->bv_val, 0, 0 );
1030 if( BER_BVISEMPTY( val ) ) {
1031 ber_dupbv_x( out, val, ctx );
1033 } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
1034 return LDAP_INVALID_SYNTAX;
1038 struct berval dnval = *val;
1039 struct berval uidval = BER_BVNULL;
1041 uidval.bv_val = strrchr( val->bv_val, '#' );
1042 if ( !BER_BVISNULL( &uidval ) ) {
1044 uidval.bv_len = val->bv_len - ( uidval.bv_val - val->bv_val );
1046 rc = bitStringValidate( NULL, &uidval );
1048 if ( rc == LDAP_SUCCESS ) {
1049 ber_dupbv_x( &dnval, val, ctx );
1050 dnval.bv_len -= uidval.bv_len + 1;
1051 dnval.bv_val[dnval.bv_len] = '\0';
1054 BER_BVZERO( &uidval );
1058 rc = dnPretty( syntax, &dnval, out, ctx );
1059 if ( dnval.bv_val != val->bv_val ) {
1060 slap_sl_free( dnval.bv_val, ctx );
1062 if( rc != LDAP_SUCCESS ) {
1066 if( !BER_BVISNULL( &uidval ) ) {
1070 tmp = slap_sl_realloc( out->bv_val, out->bv_len
1071 + STRLENOF( "#" ) + uidval.bv_len + 1,
1074 ber_memfree_x( out->bv_val, ctx );
1078 out->bv_val[out->bv_len++] = '#';
1079 out->bv_val[out->bv_len++] = '\'';
1081 got1 = uidval.bv_len < sizeof("'0'B");
1082 for( i = 1; i < uidval.bv_len - 2; i++ ) {
1083 c = uidval.bv_val[i];
1086 if( got1 ) out->bv_val[out->bv_len++] = c;
1090 out->bv_val[out->bv_len++] = c;
1095 out->bv_val[out->bv_len++] = '\'';
1096 out->bv_val[out->bv_len++] = 'B';
1097 out->bv_val[out->bv_len] = '\0';
1101 Debug( LDAP_DEBUG_TRACE, "<<< nameUIDPretty: <%s>\n", out->bv_val, 0, 0 );
1103 return LDAP_SUCCESS;
1107 uniqueMemberNormalize(
1112 struct berval *normalized,
1118 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
1120 ber_dupbv_x( &out, val, ctx );
1121 if ( BER_BVISEMPTY( &out ) ) {
1125 struct berval uid = BER_BVNULL;
1127 uid.bv_val = strrchr( out.bv_val, '#' );
1128 if ( !BER_BVISNULL( &uid ) ) {
1130 uid.bv_len = out.bv_len - ( uid.bv_val - out.bv_val );
1132 rc = bitStringValidate( NULL, &uid );
1133 if ( rc == LDAP_SUCCESS ) {
1134 uid.bv_val[-1] = '\0';
1135 out.bv_len -= uid.bv_len + 1;
1141 rc = dnNormalize( 0, NULL, NULL, &out, normalized, ctx );
1143 if( rc != LDAP_SUCCESS ) {
1144 slap_sl_free( out.bv_val, ctx );
1145 return LDAP_INVALID_SYNTAX;
1148 if( !BER_BVISNULL( &uid ) ) {
1151 tmp = ch_realloc( normalized->bv_val,
1152 normalized->bv_len + uid.bv_len
1153 + STRLENOF("#") + 1 );
1154 if ( tmp == NULL ) {
1155 ber_memfree_x( normalized->bv_val, ctx );
1159 normalized->bv_val = tmp;
1161 /* insert the separator */
1162 normalized->bv_val[normalized->bv_len++] = '#';
1164 /* append the UID */
1165 AC_MEMCPY( &normalized->bv_val[normalized->bv_len],
1166 uid.bv_val, uid.bv_len );
1167 normalized->bv_len += uid.bv_len;
1170 normalized->bv_val[normalized->bv_len] = '\0';
1173 slap_sl_free( out.bv_val, ctx );
1176 return LDAP_SUCCESS;
1185 struct berval *value,
1186 void *assertedValue )
1189 struct berval *asserted = (struct berval *) assertedValue;
1190 struct berval assertedDN = *asserted;
1191 struct berval assertedUID = BER_BVNULL;
1192 struct berval valueDN = *value;
1193 struct berval valueUID = BER_BVNULL;
1194 int approx = ((flags & SLAP_MR_EQUALITY_APPROX) == SLAP_MR_EQUALITY_APPROX);
1196 if ( !BER_BVISEMPTY( asserted ) ) {
1197 assertedUID.bv_val = strrchr( assertedDN.bv_val, '#' );
1198 if ( !BER_BVISNULL( &assertedUID ) ) {
1199 assertedUID.bv_val++;
1200 assertedUID.bv_len = assertedDN.bv_len
1201 - ( assertedUID.bv_val - assertedDN.bv_val );
1203 if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
1204 assertedDN.bv_len -= assertedUID.bv_len + 1;
1207 BER_BVZERO( &assertedUID );
1212 if ( !BER_BVISEMPTY( value ) ) {
1214 valueUID.bv_val = strrchr( valueDN.bv_val, '#' );
1215 if ( !BER_BVISNULL( &valueUID ) ) {
1217 valueUID.bv_len = valueDN.bv_len
1218 - ( valueUID.bv_val - valueDN.bv_val );
1220 if ( bitStringValidate( NULL, &valueUID ) == LDAP_SUCCESS ) {
1221 valueDN.bv_len -= valueUID.bv_len + 1;
1224 BER_BVZERO( &valueUID );
1229 if( valueUID.bv_len && assertedUID.bv_len ) {
1230 match = valueUID.bv_len - assertedUID.bv_len;
1233 return LDAP_SUCCESS;
1236 match = memcmp( valueUID.bv_val, assertedUID.bv_val, valueUID.bv_len );
1239 return LDAP_SUCCESS;
1242 } else if ( !approx && valueUID.bv_len ) {
1245 return LDAP_SUCCESS;
1247 } else if ( !approx && assertedUID.bv_len ) {
1250 return LDAP_SUCCESS;
1253 return dnMatch( matchp, flags, syntax, mr, &valueDN, &assertedDN );
1257 uniqueMemberIndexer(
1262 struct berval *prefix,
1270 for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
1271 /* just count them */
1275 dnvalues = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
1277 for( i=0; !BER_BVISNULL( &values[i] ); i++ ) {
1278 struct berval assertedDN = values[i];
1279 struct berval assertedUID = BER_BVNULL;
1281 if ( !BER_BVISEMPTY( &assertedDN ) ) {
1282 assertedUID.bv_val = strrchr( assertedDN.bv_val, '#' );
1283 if ( !BER_BVISNULL( &assertedUID ) ) {
1284 assertedUID.bv_val++;
1285 assertedUID.bv_len = assertedDN.bv_len
1286 - ( assertedUID.bv_val - assertedDN.bv_val );
1288 if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
1289 assertedDN.bv_len -= assertedUID.bv_len + 1;
1292 BER_BVZERO( &assertedUID );
1297 dnvalues[i] = assertedDN;
1299 BER_BVZERO( &dnvalues[i] );
1301 rc = octetStringIndexer( use, flags, syntax, mr, prefix,
1302 dnvalues, keysp, ctx );
1304 slap_sl_free( dnvalues, ctx );
1314 struct berval *prefix,
1315 void * assertedValue,
1319 struct berval *asserted = (struct berval *) assertedValue;
1320 struct berval assertedDN = *asserted;
1321 struct berval assertedUID = BER_BVNULL;
1323 if ( !BER_BVISEMPTY( asserted ) ) {
1324 assertedUID.bv_val = strrchr( assertedDN.bv_val, '#' );
1325 if ( !BER_BVISNULL( &assertedUID ) ) {
1326 assertedUID.bv_val++;
1327 assertedUID.bv_len = assertedDN.bv_len
1328 - ( assertedUID.bv_val - assertedDN.bv_val );
1330 if ( bitStringValidate( NULL, &assertedUID ) == LDAP_SUCCESS ) {
1331 assertedDN.bv_len -= assertedUID.bv_len + 1;
1334 BER_BVZERO( &assertedUID );
1339 return octetStringFilter( use, flags, syntax, mr, prefix,
1340 &assertedDN, keysp, ctx );
1345 * Handling boolean syntax and matching is quite rigid.
1346 * A more flexible approach would be to allow a variety
1347 * of strings to be normalized and prettied into TRUE
1355 /* very unforgiving validation, requires no normalization
1356 * before simplistic matching
1359 if( in->bv_len == 4 ) {
1360 if( bvmatch( in, &slap_true_bv ) ) {
1361 return LDAP_SUCCESS;
1363 } else if( in->bv_len == 5 ) {
1364 if( bvmatch( in, &slap_false_bv ) ) {
1365 return LDAP_SUCCESS;
1369 return LDAP_INVALID_SYNTAX;
1378 struct berval *value,
1379 void *assertedValue )
1381 /* simplistic matching allowed by rigid validation */
1382 struct berval *asserted = (struct berval *) assertedValue;
1383 *matchp = value->bv_len != asserted->bv_len;
1384 return LDAP_SUCCESS;
1387 /*-------------------------------------------------------------------
1388 LDAP/X.500 string syntax / matching rules have a few oddities. This
1389 comment attempts to detail how slapd(8) treats them.
1392 StringSyntax X.500 LDAP Matching/Comments
1393 DirectoryString CHOICE UTF8 i/e + ignore insignificant spaces
1394 PrintableString subset subset i/e + ignore insignificant spaces
1395 PrintableString subset subset i/e + ignore insignificant spaces
1396 NumericString subset subset ignore all spaces
1397 IA5String ASCII ASCII i/e + ignore insignificant spaces
1398 TeletexString T.61 T.61 i/e + ignore insignificant spaces
1400 TelephoneNumber subset subset i + ignore all spaces and "-"
1402 See RFC 4518 for details.
1406 In X.500(93), a directory string can be either a PrintableString,
1407 a bmpString, or a UniversalString (e.g., UCS (a subset of Unicode)).
1408 In later versions, more CHOICEs were added. In all cases the string
1411 In LDAPv3, a directory string is a UTF-8 encoded UCS string.
1412 A directory string cannot be zero length.
1414 For matching, there are both case ignore and exact rules. Both
1415 also require that "insignificant" spaces be ignored.
1416 spaces before the first non-space are ignored;
1417 spaces after the last non-space are ignored;
1418 spaces after a space are ignored.
1419 Note: by these rules (and as clarified in X.520), a string of only
1420 spaces is to be treated as if held one space, not empty (which
1421 would be a syntax error).
1424 In ASN.1, numeric string is just a string of digits and spaces
1425 and could be empty. However, in X.500, all attribute values of
1426 numeric string carry a non-empty constraint. For example:
1428 internationalISDNNumber ATTRIBUTE ::= {
1429 WITH SYNTAX InternationalISDNNumber
1430 EQUALITY MATCHING RULE numericStringMatch
1431 SUBSTRINGS MATCHING RULE numericStringSubstringsMatch
1432 ID id-at-internationalISDNNumber }
1433 InternationalISDNNumber ::=
1434 NumericString (SIZE(1..ub-international-isdn-number))
1436 Unforunately, some assertion values are don't carry the same
1437 constraint (but its unclear how such an assertion could ever
1438 be true). In LDAP, there is one syntax (numericString) not two
1439 (numericString with constraint, numericString without constraint).
1440 This should be treated as numericString with non-empty constraint.
1441 Note that while someone may have no ISDN number, there are no ISDN
1442 numbers which are zero length.
1444 In matching, spaces are ignored.
1447 In ASN.1, Printable string is just a string of printable characters
1448 and can be empty. In X.500, semantics much like NumericString (see
1449 serialNumber for a like example) excepting uses insignificant space
1450 handling instead of ignore all spaces. They must be non-empty.
1453 Basically same as PrintableString. There are no examples in X.500,
1454 but same logic applies. Empty strings are allowed.
1456 -------------------------------------------------------------------*/
1465 unsigned char *u = (unsigned char *)in->bv_val;
1467 if( BER_BVISEMPTY( in ) && syntax == slap_schema.si_syn_directoryString ) {
1468 /* directory strings cannot be empty */
1469 return LDAP_INVALID_SYNTAX;
1472 for( count = in->bv_len; count > 0; count -= len, u += len ) {
1473 /* get the length indicated by the first byte */
1474 len = LDAP_UTF8_CHARLEN2( u, len );
1476 /* very basic checks */
1479 if( (u[5] & 0xC0) != 0x80 ) {
1480 return LDAP_INVALID_SYNTAX;
1483 if( (u[4] & 0xC0) != 0x80 ) {
1484 return LDAP_INVALID_SYNTAX;
1487 if( (u[3] & 0xC0) != 0x80 ) {
1488 return LDAP_INVALID_SYNTAX;
1491 if( (u[2] & 0xC0 )!= 0x80 ) {
1492 return LDAP_INVALID_SYNTAX;
1495 if( (u[1] & 0xC0) != 0x80 ) {
1496 return LDAP_INVALID_SYNTAX;
1499 /* CHARLEN already validated it */
1502 return LDAP_INVALID_SYNTAX;
1505 /* make sure len corresponds with the offset
1506 to the next character */
1507 if( LDAP_UTF8_OFFSET( (char *)u ) != len ) return LDAP_INVALID_SYNTAX;
1511 return LDAP_INVALID_SYNTAX;
1514 return LDAP_SUCCESS;
1518 UTF8StringNormalize(
1523 struct berval *normalized,
1526 struct berval tmp, nvalue;
1530 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( use ) != 0 );
1532 if( BER_BVISNULL( val ) ) {
1533 /* assume we're dealing with a syntax (e.g., UTF8String)
1534 * which allows empty strings
1536 BER_BVZERO( normalized );
1537 return LDAP_SUCCESS;
1540 flags = SLAP_MR_ASSOCIATED( mr, slap_schema.si_mr_caseExactMatch )
1541 ? LDAP_UTF8_NOCASEFOLD : LDAP_UTF8_CASEFOLD;
1542 flags |= ( ( use & SLAP_MR_EQUALITY_APPROX ) == SLAP_MR_EQUALITY_APPROX )
1543 ? LDAP_UTF8_APPROX : 0;
1545 val = UTF8bvnormalize( val, &tmp, flags, ctx );
1550 /* collapse spaces (in place) */
1552 nvalue.bv_val = tmp.bv_val;
1554 /* trim leading spaces? */
1555 wasspace = !((( use & SLAP_MR_SUBSTR_ANY ) == SLAP_MR_SUBSTR_ANY ) ||
1556 (( use & SLAP_MR_SUBSTR_FINAL ) == SLAP_MR_SUBSTR_FINAL ));
1558 for( i = 0; i < tmp.bv_len; i++) {
1559 if ( ASCII_SPACE( tmp.bv_val[i] )) {
1560 if( wasspace++ == 0 ) {
1561 /* trim repeated spaces */
1562 nvalue.bv_val[nvalue.bv_len++] = tmp.bv_val[i];
1566 nvalue.bv_val[nvalue.bv_len++] = tmp.bv_val[i];
1570 if( !BER_BVISEMPTY( &nvalue ) ) {
1571 /* trim trailing space? */
1573 (( use & SLAP_MR_SUBSTR_INITIAL ) != SLAP_MR_SUBSTR_INITIAL ) &&
1574 ( use & SLAP_MR_SUBSTR_ANY ) != SLAP_MR_SUBSTR_ANY ))
1578 nvalue.bv_val[nvalue.bv_len] = '\0';
1581 /* string of all spaces is treated as one space */
1582 nvalue.bv_val[0] = ' ';
1583 nvalue.bv_val[1] = '\0';
1587 *normalized = nvalue;
1588 return LDAP_SUCCESS;
1592 directoryStringSubstringsMatch(
1597 struct berval *value,
1598 void *assertedValue )
1601 SubstringsAssertion *sub = assertedValue;
1602 struct berval left = *value;
1606 if ( !BER_BVISNULL( &sub->sa_initial ) ) {
1607 if ( sub->sa_initial.bv_len > left.bv_len ) {
1608 /* not enough left */
1613 match = memcmp( sub->sa_initial.bv_val, left.bv_val,
1614 sub->sa_initial.bv_len );
1620 left.bv_val += sub->sa_initial.bv_len;
1621 left.bv_len -= sub->sa_initial.bv_len;
1623 priorspace = ASCII_SPACE(
1624 sub->sa_initial.bv_val[sub->sa_initial.bv_len] );
1627 if ( sub->sa_any ) {
1628 for ( i = 0; !BER_BVISNULL( &sub->sa_any[i] ); i++ ) {
1632 if( priorspace && !BER_BVISEMPTY( &sub->sa_any[i] )
1633 && ASCII_SPACE( sub->sa_any[i].bv_val[0] ))
1635 /* allow next space to match */
1642 if ( BER_BVISEMPTY( &sub->sa_any[i] ) ) {
1646 if ( sub->sa_any[i].bv_len > left.bv_len ) {
1647 /* not enough left */
1652 p = memchr( left.bv_val, *sub->sa_any[i].bv_val, left.bv_len );
1659 idx = p - left.bv_val;
1661 if ( idx >= left.bv_len ) {
1662 /* this shouldn't happen */
1669 if ( sub->sa_any[i].bv_len > left.bv_len ) {
1670 /* not enough left */
1675 match = memcmp( left.bv_val,
1676 sub->sa_any[i].bv_val,
1677 sub->sa_any[i].bv_len );
1685 left.bv_val += sub->sa_any[i].bv_len;
1686 left.bv_len -= sub->sa_any[i].bv_len;
1688 priorspace = ASCII_SPACE(
1689 sub->sa_any[i].bv_val[sub->sa_any[i].bv_len] );
1693 if ( !BER_BVISNULL( &sub->sa_final ) ) {
1694 if( priorspace && !BER_BVISEMPTY( &sub->sa_final )
1695 && ASCII_SPACE( sub->sa_final.bv_val[0] ))
1697 /* allow next space to match */
1702 if ( sub->sa_final.bv_len > left.bv_len ) {
1703 /* not enough left */
1708 match = memcmp( sub->sa_final.bv_val,
1709 &left.bv_val[left.bv_len - sub->sa_final.bv_len],
1710 sub->sa_final.bv_len );
1719 return LDAP_SUCCESS;
1722 #if defined(SLAPD_APPROX_INITIALS)
1723 # define SLAPD_APPROX_DELIMITER "._ "
1724 # define SLAPD_APPROX_WORDLEN 2
1726 # define SLAPD_APPROX_DELIMITER " "
1727 # define SLAPD_APPROX_WORDLEN 1
1736 struct berval *value,
1737 void *assertedValue )
1739 struct berval *nval, *assertv;
1740 char *val, **values, **words, *c;
1741 int i, count, len, nextchunk=0, nextavail=0;
1743 /* Yes, this is necessary */
1744 nval = UTF8bvnormalize( value, NULL, LDAP_UTF8_APPROX, NULL );
1745 if( nval == NULL ) {
1747 return LDAP_SUCCESS;
1750 /* Yes, this is necessary */
1751 assertv = UTF8bvnormalize( ((struct berval *)assertedValue),
1752 NULL, LDAP_UTF8_APPROX, NULL );
1753 if( assertv == NULL ) {
1756 return LDAP_SUCCESS;
1759 /* Isolate how many words there are */
1760 for ( c = nval->bv_val, count = 1; *c; c++ ) {
1761 c = strpbrk( c, SLAPD_APPROX_DELIMITER );
1762 if ( c == NULL ) break;
1767 /* Get a phonetic copy of each word */
1768 words = (char **)ch_malloc( count * sizeof(char *) );
1769 values = (char **)ch_malloc( count * sizeof(char *) );
1770 for ( c = nval->bv_val, i = 0; i < count; i++, c += strlen(c) + 1 ) {
1772 values[i] = phonetic(c);
1775 /* Work through the asserted value's words, to see if at least some
1776 of the words are there, in the same order. */
1778 while ( (ber_len_t) nextchunk < assertv->bv_len ) {
1779 len = strcspn( assertv->bv_val + nextchunk, SLAPD_APPROX_DELIMITER);
1784 #if defined(SLAPD_APPROX_INITIALS)
1785 else if( len == 1 ) {
1786 /* Single letter words need to at least match one word's initial */
1787 for( i=nextavail; i<count; i++ )
1788 if( !strncasecmp( assertv->bv_val + nextchunk, words[i], 1 )) {
1795 /* Isolate the next word in the asserted value and phonetic it */
1796 assertv->bv_val[nextchunk+len] = '\0';
1797 val = phonetic( assertv->bv_val + nextchunk );
1799 /* See if this phonetic chunk is in the remaining words of *value */
1800 for( i=nextavail; i<count; i++ ){
1801 if( !strcmp( val, values[i] ) ){
1809 /* This chunk in the asserted value was NOT within the *value. */
1815 /* Go on to the next word in the asserted value */
1819 /* If some of the words were seen, call it a match */
1820 if( nextavail > 0 ) {
1827 /* Cleanup allocs */
1828 ber_bvfree( assertv );
1829 for( i=0; i<count; i++ ) {
1830 ch_free( values[i] );
1836 return LDAP_SUCCESS;
1845 struct berval *prefix,
1851 int i,j, len, wordcount, keycount=0;
1852 struct berval *newkeys;
1853 BerVarray keys=NULL;
1855 for( j = 0; !BER_BVISNULL( &values[j] ); j++ ) {
1856 struct berval val = BER_BVNULL;
1857 /* Yes, this is necessary */
1858 UTF8bvnormalize( &values[j], &val, LDAP_UTF8_APPROX, NULL );
1859 assert( !BER_BVISNULL( &val ) );
1861 /* Isolate how many words there are. There will be a key for each */
1862 for( wordcount = 0, c = val.bv_val; *c; c++) {
1863 len = strcspn(c, SLAPD_APPROX_DELIMITER);
1864 if( len >= SLAPD_APPROX_WORDLEN ) wordcount++;
1866 if (*c == '\0') break;
1870 /* Allocate/increase storage to account for new keys */
1871 newkeys = (struct berval *)ch_malloc( (keycount + wordcount + 1)
1872 * sizeof(struct berval) );
1873 AC_MEMCPY( newkeys, keys, keycount * sizeof(struct berval) );
1874 if( keys ) ch_free( keys );
1877 /* Get a phonetic copy of each word */
1878 for( c = val.bv_val, i = 0; i < wordcount; c += len + 1 ) {
1880 if( len < SLAPD_APPROX_WORDLEN ) continue;
1881 ber_str2bv( phonetic( c ), 0, 0, &keys[keycount] );
1886 ber_memfree( val.bv_val );
1888 BER_BVZERO( &keys[keycount] );
1891 return LDAP_SUCCESS;
1900 struct berval *prefix,
1901 void * assertedValue,
1910 /* Yes, this is necessary */
1911 val = UTF8bvnormalize( ((struct berval *)assertedValue),
1912 NULL, LDAP_UTF8_APPROX, NULL );
1913 if( val == NULL || BER_BVISNULL( val ) ) {
1914 keys = (struct berval *)ch_malloc( sizeof(struct berval) );
1915 BER_BVZERO( &keys[0] );
1918 return LDAP_SUCCESS;
1921 /* Isolate how many words there are. There will be a key for each */
1922 for( count = 0,c = val->bv_val; *c; c++) {
1923 len = strcspn(c, SLAPD_APPROX_DELIMITER);
1924 if( len >= SLAPD_APPROX_WORDLEN ) count++;
1926 if (*c == '\0') break;
1930 /* Allocate storage for new keys */
1931 keys = (struct berval *)ch_malloc( (count + 1) * sizeof(struct berval) );
1933 /* Get a phonetic copy of each word */
1934 for( c = val->bv_val, i = 0; i < count; c += len + 1 ) {
1936 if( len < SLAPD_APPROX_WORDLEN ) continue;
1937 ber_str2bv( phonetic( c ), 0, 0, &keys[i] );
1943 BER_BVZERO( &keys[count] );
1946 return LDAP_SUCCESS;
1949 /* Remove all spaces and '-' characters */
1951 telephoneNumberNormalize(
1956 struct berval *normalized,
1961 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
1963 /* validator should have refused an empty string */
1964 assert( !BER_BVISEMPTY( val ) );
1966 q = normalized->bv_val = slap_sl_malloc( val->bv_len + 1, ctx );
1968 for( p = val->bv_val; *p; p++ ) {
1969 if ( ! ( ASCII_SPACE( *p ) || *p == '-' )) {
1975 normalized->bv_len = q - normalized->bv_val;
1977 if( BER_BVISEMPTY( normalized ) ) {
1978 slap_sl_free( normalized->bv_val, ctx );
1979 BER_BVZERO( normalized );
1980 return LDAP_INVALID_SYNTAX;
1983 return LDAP_SUCCESS;
1991 struct berval val = *in;
1993 if( BER_BVISEMPTY( &val ) ) {
1994 /* disallow empty strings */
1995 return LDAP_INVALID_SYNTAX;
1998 while( OID_LEADCHAR( val.bv_val[0] ) ) {
1999 if ( val.bv_len == 1 ) {
2000 return LDAP_SUCCESS;
2003 if ( val.bv_val[0] == '0' && !OID_SEPARATOR( val.bv_val[1] )) {
2010 while ( OID_LEADCHAR( val.bv_val[0] )) {
2014 if ( val.bv_len == 0 ) {
2015 return LDAP_SUCCESS;
2019 if( !OID_SEPARATOR( val.bv_val[0] )) {
2027 return LDAP_INVALID_SYNTAX;
2036 struct berval val = *in;
2038 if ( BER_BVISEMPTY( &val ) ) return LDAP_INVALID_SYNTAX;
2040 if ( val.bv_val[0] == '-' ) {
2044 if( BER_BVISEMPTY( &val ) ) { /* bare "-" */
2045 return LDAP_INVALID_SYNTAX;
2048 if( val.bv_val[0] == '0' ) { /* "-0" */
2049 return LDAP_INVALID_SYNTAX;
2052 } else if ( val.bv_val[0] == '0' ) {
2053 if( val.bv_len > 1 ) { /* "0<more>" */
2054 return LDAP_INVALID_SYNTAX;
2057 return LDAP_SUCCESS;
2060 for( i=0; i < val.bv_len; i++ ) {
2061 if( !ASCII_DIGIT(val.bv_val[i]) ) {
2062 return LDAP_INVALID_SYNTAX;
2066 return LDAP_SUCCESS;
2075 struct berval *value,
2076 void *assertedValue )
2078 struct berval *asserted = (struct berval *) assertedValue;
2079 int vsign = 1, asign = 1; /* default sign = '+' */
2084 if( v.bv_val[0] == '-' ) {
2090 if( BER_BVISEMPTY( &v ) ) vsign = 0;
2093 if( a.bv_val[0] == '-' ) {
2099 if( BER_BVISEMPTY( &a ) ) vsign = 0;
2101 match = vsign - asign;
2103 match = ( v.bv_len != a.bv_len
2104 ? ( v.bv_len < a.bv_len ? -1 : 1 )
2105 : memcmp( v.bv_val, a.bv_val, v.bv_len ));
2106 if( vsign < 0 ) match = -match;
2110 return LDAP_SUCCESS;
2114 countryStringValidate(
2116 struct berval *val )
2118 if( val->bv_len != 2 ) return LDAP_INVALID_SYNTAX;
2120 if( !SLAP_PRINTABLE(val->bv_val[0]) ) {
2121 return LDAP_INVALID_SYNTAX;
2123 if( !SLAP_PRINTABLE(val->bv_val[1]) ) {
2124 return LDAP_INVALID_SYNTAX;
2127 return LDAP_SUCCESS;
2131 printableStringValidate(
2133 struct berval *val )
2137 if( BER_BVISEMPTY( val ) ) return LDAP_INVALID_SYNTAX;
2139 for(i=0; i < val->bv_len; i++) {
2140 if( !SLAP_PRINTABLE(val->bv_val[i]) ) {
2141 return LDAP_INVALID_SYNTAX;
2145 return LDAP_SUCCESS;
2149 printablesStringValidate(
2151 struct berval *val )
2155 if( BER_BVISEMPTY( val ) ) return LDAP_INVALID_SYNTAX;
2157 for(i=0,len=0; i < val->bv_len; i++) {
2158 int c = val->bv_val[i];
2162 return LDAP_INVALID_SYNTAX;
2166 } else if ( SLAP_PRINTABLE(c) ) {
2169 return LDAP_INVALID_SYNTAX;
2174 return LDAP_INVALID_SYNTAX;
2177 return LDAP_SUCCESS;
2183 struct berval *val )
2187 for(i=0; i < val->bv_len; i++) {
2188 if( !LDAP_ASCII(val->bv_val[i]) ) {
2189 return LDAP_INVALID_SYNTAX;
2193 return LDAP_SUCCESS;
2202 struct berval *normalized,
2206 int casefold = !SLAP_MR_ASSOCIATED( mr,
2207 slap_schema.si_mr_caseExactIA5Match );
2209 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( use ) != 0 );
2213 /* Ignore initial whitespace */
2214 while ( ASCII_SPACE( *p ) ) p++;
2216 normalized->bv_len = val->bv_len - ( p - val->bv_val );
2217 normalized->bv_val = slap_sl_malloc( normalized->bv_len + 1, ctx );
2218 AC_MEMCPY( normalized->bv_val, p, normalized->bv_len );
2219 normalized->bv_val[normalized->bv_len] = '\0';
2221 p = q = normalized->bv_val;
2224 if ( ASCII_SPACE( *p ) ) {
2227 /* Ignore the extra whitespace */
2228 while ( ASCII_SPACE( *p ) ) {
2232 } else if ( casefold ) {
2233 /* Most IA5 rules require casefolding */
2234 *q++ = TOLOWER(*p); p++;
2241 assert( normalized->bv_val <= p );
2245 * If the string ended in space, backup the pointer one
2246 * position. One is enough because the above loop collapsed
2247 * all whitespace to a single space.
2249 if ( q > normalized->bv_val && ASCII_SPACE( q[-1] ) ) --q;
2251 /* null terminate */
2254 normalized->bv_len = q - normalized->bv_val;
2256 return LDAP_SUCCESS;
2265 if( in->bv_len != 36 ) {
2266 return LDAP_INVALID_SYNTAX;
2269 for( i=0; i<36; i++ ) {
2275 if( in->bv_val[i] != '-' ) {
2276 return LDAP_INVALID_SYNTAX;
2280 if( !ASCII_HEX( in->bv_val[i]) ) {
2281 return LDAP_INVALID_SYNTAX;
2286 return LDAP_SUCCESS;
2297 int rc=LDAP_INVALID_SYNTAX;
2299 assert( in != NULL );
2300 assert( out != NULL );
2302 if( in->bv_len != 36 ) return LDAP_INVALID_SYNTAX;
2305 out->bv_val = slap_sl_malloc( out->bv_len + 1, ctx );
2307 for( i=0; i<36; i++ ) {
2313 if( in->bv_val[i] != '-' ) {
2316 out->bv_val[i] = '-';
2320 if( !ASCII_HEX( in->bv_val[i]) ) {
2323 out->bv_val[i] = TOLOWER( in->bv_val[i] );
2328 out->bv_val[ out->bv_len ] = '\0';
2332 slap_sl_free( out->bv_val, ctx );
2345 struct berval *normalized,
2348 unsigned char octet = '\0';
2351 normalized->bv_len = 16;
2352 normalized->bv_val = slap_sl_malloc( normalized->bv_len + 1, ctx );
2354 for( i=0, j=0; i<36; i++ ) {
2355 unsigned char nibble;
2356 if( val->bv_val[i] == '-' ) {
2359 } else if( ASCII_DIGIT( val->bv_val[i] ) ) {
2360 nibble = val->bv_val[i] - '0';
2362 } else if( ASCII_HEXLOWER( val->bv_val[i] ) ) {
2363 nibble = val->bv_val[i] - ('a'-10);
2365 } else if( ASCII_HEXUPPER( val->bv_val[i] ) ) {
2366 nibble = val->bv_val[i] - ('A'-10);
2369 slap_sl_free( normalized->bv_val, ctx );
2370 return LDAP_INVALID_SYNTAX;
2375 normalized->bv_val[j>>1] = octet;
2377 octet = nibble << 4;
2382 normalized->bv_val[normalized->bv_len] = 0;
2383 return LDAP_SUCCESS;
2389 numericStringValidate(
2395 if( BER_BVISEMPTY( in ) ) return LDAP_INVALID_SYNTAX;
2397 for(i=0; i < in->bv_len; i++) {
2398 if( !SLAP_NUMERIC(in->bv_val[i]) ) {
2399 return LDAP_INVALID_SYNTAX;
2403 return LDAP_SUCCESS;
2407 numericStringNormalize(
2412 struct berval *normalized,
2415 /* removal all spaces */
2418 assert( !BER_BVISEMPTY( val ) );
2420 normalized->bv_val = slap_sl_malloc( val->bv_len + 1, ctx );
2423 q = normalized->bv_val;
2426 if ( ASCII_SPACE( *p ) ) {
2427 /* Ignore whitespace */
2434 /* we should have copied no more than is in val */
2435 assert( (q - normalized->bv_val) <= (p - val->bv_val) );
2437 /* null terminate */
2440 normalized->bv_len = q - normalized->bv_val;
2442 if( BER_BVISEMPTY( normalized ) ) {
2443 normalized->bv_val = slap_sl_realloc( normalized->bv_val, 2, ctx );
2444 normalized->bv_val[0] = ' ';
2445 normalized->bv_val[1] = '\0';
2446 normalized->bv_len = 1;
2449 return LDAP_SUCCESS;
2453 * Integer conversion macros that will use the largest available
2456 #if defined(HAVE_STRTOLL) && defined(HAVE_LONG_LONG)
2457 # define SLAP_STRTOL(n,e,b) strtoll(n,e,b)
2458 # define SLAP_LONG long long
2460 # define SLAP_STRTOL(n,e,b) strtol(n,e,b)
2461 # define SLAP_LONG long
2462 #endif /* HAVE_STRTOLL ... */
2470 struct berval *value,
2471 void *assertedValue )
2473 SLAP_LONG lValue, lAssertedValue;
2476 /* safe to assume integers are NUL terminated? */
2477 lValue = SLAP_STRTOL(value->bv_val, NULL, 10);
2478 if( errno == ERANGE )
2480 return LDAP_CONSTRAINT_VIOLATION;
2483 lAssertedValue = SLAP_STRTOL(((struct berval *)assertedValue)->bv_val,
2485 if( errno == ERANGE )
2487 return LDAP_CONSTRAINT_VIOLATION;
2490 *matchp = ((lValue & lAssertedValue) == lAssertedValue) ? 0 : 1;
2491 return LDAP_SUCCESS;
2500 struct berval *value,
2501 void *assertedValue )
2503 SLAP_LONG lValue, lAssertedValue;
2506 /* safe to assume integers are NUL terminated? */
2507 lValue = SLAP_STRTOL(value->bv_val, NULL, 10);
2508 if( errno == ERANGE )
2510 return LDAP_CONSTRAINT_VIOLATION;
2513 lAssertedValue = SLAP_STRTOL( ((struct berval *)assertedValue)->bv_val,
2515 if( errno == ERANGE )
2517 return LDAP_CONSTRAINT_VIOLATION;
2520 *matchp = ((lValue & lAssertedValue) != 0) ? 0 : -1;
2521 return LDAP_SUCCESS;
2525 serialNumberAndIssuerCheck(
2534 if( in->bv_len < 3 ) return LDAP_INVALID_SYNTAX;
2536 if( in->bv_val[0] != '{' && in->bv_val[in->bv_len-1] != '}' ) {
2537 /* Parse old format */
2538 is->bv_val = ber_bvchr( in, '$' );
2539 if( BER_BVISNULL( is ) ) return LDAP_INVALID_SYNTAX;
2541 sn->bv_val = in->bv_val;
2542 sn->bv_len = is->bv_val - in->bv_val;
2545 is->bv_len = in->bv_len - (sn->bv_len + 1);
2547 /* eat leading zeros */
2548 for( n=0; n < (sn->bv_len-1); n++ ) {
2549 if( sn->bv_val[n] != '0' ) break;
2554 for( n=0; n < sn->bv_len; n++ ) {
2555 if( !ASCII_DIGIT(sn->bv_val[n]) ) return LDAP_INVALID_SYNTAX;
2559 /* Parse GSER format */
2560 int havesn=0,haveissuer=0;
2561 struct berval x = *in;
2566 /* eat leading spaces */
2567 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2571 if ( x.bv_len < STRLENOF("serialNumber 0,issuer \"\"")) {
2572 return LDAP_INVALID_SYNTAX;
2575 /* should be at issuer or serialNumber NamedValue */
2576 if( strncasecmp( x.bv_val, "issuer", STRLENOF("issuer")) == 0 ) {
2578 x.bv_val += STRLENOF("issuer");
2579 x.bv_len -= STRLENOF("issuer");
2581 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2582 x.bv_val++; x.bv_len--;
2584 /* eat leading spaces */
2585 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2589 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
2590 x.bv_val++; x.bv_len--;
2592 is->bv_val = x.bv_val;
2595 for( ; is->bv_len < x.bv_len; ) {
2596 if ( is->bv_val[is->bv_len] != '"' ) {
2600 if ( is->bv_val[is->bv_len+1] == '"' ) {
2607 x.bv_val += is->bv_len+1;
2608 x.bv_len -= is->bv_len+1;
2610 if ( x.bv_len < STRLENOF(",serialNumber 0")) {
2611 return LDAP_INVALID_SYNTAX;
2616 } else if( strncasecmp( x.bv_val, "serialNumber",
2617 STRLENOF("serialNumber")) == 0 )
2619 /* parse serialNumber */
2621 x.bv_val += STRLENOF("serialNumber");
2622 x.bv_len -= STRLENOF("serialNumber");
2624 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2625 x.bv_val++; x.bv_len--;
2627 /* eat leading spaces */
2628 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2632 sn->bv_val = x.bv_val;
2635 if( sn->bv_val[0] == '-' ) {
2640 if ( sn->bv_val[0] == '0' && ( sn->bv_val[1] == 'x' ||
2641 sn->bv_val[1] == 'X' )) {
2643 for( ; sn->bv_len < x.bv_len; sn->bv_len++ ) {
2644 if ( !ASCII_HEX( sn->bv_val[sn->bv_len] )) break;
2646 } else if ( sn->bv_val[0] == '\'' ) {
2647 for( ; sn->bv_len < x.bv_len; sn->bv_len++ ) {
2648 if ( !ASCII_HEX( sn->bv_val[sn->bv_len] )) break;
2650 if ( sn->bv_val[sn->bv_len] == '\'' &&
2651 sn->bv_val[sn->bv_len+1] == 'H' )
2654 return LDAP_INVALID_SYNTAX;
2657 for( ; sn->bv_len < x.bv_len; sn->bv_len++ ) {
2658 if ( !ASCII_DIGIT( sn->bv_val[sn->bv_len] )) break;
2662 if (!( sn->bv_len > neg )) return LDAP_INVALID_SYNTAX;
2663 if (( sn->bv_len > 1+neg ) && ( sn->bv_val[neg] == '0' )) {
2664 return LDAP_INVALID_SYNTAX;
2667 x.bv_val += sn->bv_len; x.bv_len -= sn->bv_len;
2669 if ( x.bv_len < STRLENOF( ",issuer \"\"" )) {
2670 return LDAP_INVALID_SYNTAX;
2675 } else return LDAP_INVALID_SYNTAX;
2677 if( x.bv_val[0] != ',' ) return LDAP_INVALID_SYNTAX;
2678 x.bv_val++; x.bv_len--;
2681 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2685 /* should be at remaining NamedValue */
2686 if( !haveissuer && (strncasecmp( x.bv_val, "issuer",
2687 STRLENOF("issuer" )) == 0 ))
2690 x.bv_val += STRLENOF("issuer");
2691 x.bv_len -= STRLENOF("issuer");
2693 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2694 x.bv_val++; x.bv_len--;
2696 /* eat leading spaces */
2697 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2701 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
2702 x.bv_val++; x.bv_len--;
2704 is->bv_val = x.bv_val;
2707 for( ; is->bv_len < x.bv_len; ) {
2708 if ( is->bv_val[is->bv_len] != '"' ) {
2712 if ( is->bv_val[is->bv_len+1] == '"' ) {
2719 x.bv_val += is->bv_len+1;
2720 x.bv_len -= is->bv_len+1;
2722 } else if( !havesn && (strncasecmp( x.bv_val, "serialNumber",
2723 STRLENOF("serialNumber")) == 0 ))
2725 /* parse serialNumber */
2727 x.bv_val += STRLENOF("serialNumber");
2728 x.bv_len -= STRLENOF("serialNumber");
2730 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2731 x.bv_val++; x.bv_len--;
2733 /* eat leading spaces */
2734 for( ; (x.bv_val[0] == ' ') && x.bv_len ; x.bv_val++, x.bv_len--) {
2738 sn->bv_val = x.bv_val;
2741 if( sn->bv_val[0] == '-' ) {
2746 if ( sn->bv_val[0] == '0' && ( sn->bv_val[1] == 'x' ||
2747 sn->bv_val[1] == 'X' )) {
2749 for( ; sn->bv_len < x.bv_len; sn->bv_len++ ) {
2750 if ( !ASCII_HEX( sn->bv_val[sn->bv_len] )) break;
2752 } else if ( sn->bv_val[0] == '\'' ) {
2753 for( ; sn->bv_len < x.bv_len; sn->bv_len++ ) {
2754 if ( !ASCII_HEX( sn->bv_val[sn->bv_len] )) break;
2756 if ( sn->bv_val[sn->bv_len] == '\'' &&
2757 sn->bv_val[sn->bv_len+1] == 'H' )
2760 return LDAP_INVALID_SYNTAX;
2763 for( ; sn->bv_len < x.bv_len; sn->bv_len++ ) {
2764 if ( !ASCII_DIGIT( sn->bv_val[sn->bv_len] )) break;
2768 if (!( sn->bv_len > neg )) return LDAP_INVALID_SYNTAX;
2769 if (( sn->bv_len > 1+neg ) && ( sn->bv_val[neg] == '0' )) {
2770 return LDAP_INVALID_SYNTAX;
2773 x.bv_val += sn->bv_len;
2774 x.bv_len -= sn->bv_len;
2776 } else return LDAP_INVALID_SYNTAX;
2778 /* eat trailing spaces */
2779 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2783 /* should have no characters left... */
2784 if( x.bv_len ) return LDAP_INVALID_SYNTAX;
2786 ber_dupbv_x( &ni, is, ctx );
2789 /* need to handle double dquotes here */
2795 serialNumberAndIssuerValidate(
2800 struct berval sn, i;
2802 Debug( LDAP_DEBUG_TRACE, ">>> serialNumberAndIssuerValidate: <%s>\n",
2805 rc = serialNumberAndIssuerCheck( in, &sn, &i, NULL );
2809 /* validate DN -- doesn't handle double dquote */
2810 rc = dnValidate( NULL, &i );
2812 rc = LDAP_INVALID_SYNTAX;
2814 if( in->bv_val[0] == '{' && in->bv_val[in->bv_len-1] == '}' ) {
2815 slap_sl_free( i.bv_val, NULL );
2818 Debug( LDAP_DEBUG_TRACE, "<<< serialNumberAndIssuerValidate: OKAY\n",
2824 serialNumberAndIssuerPretty(
2831 struct berval sn, i, ni;
2833 assert( in != NULL );
2834 assert( out != NULL );
2836 Debug( LDAP_DEBUG_TRACE, ">>> serialNumberAndIssuerPretty: <%s>\n",
2839 rc = serialNumberAndIssuerCheck( in, &sn, &i, ctx );
2843 rc = dnPretty( syntax, &i, &ni, ctx );
2845 if( in->bv_val[0] == '{' && in->bv_val[in->bv_len-1] == '}' ) {
2846 slap_sl_free( i.bv_val, ctx );
2849 if( rc ) return LDAP_INVALID_SYNTAX;
2851 /* make room from sn + "$" */
2852 out->bv_len = STRLENOF("{ serialNumber , issuer \"\" }")
2853 + sn.bv_len + ni.bv_len;
2854 out->bv_val = slap_sl_malloc( out->bv_len + 1, ctx );
2856 if( out->bv_val == NULL ) {
2858 slap_sl_free( ni.bv_val, ctx );
2863 AC_MEMCPY( &out->bv_val[n], "{ serialNumber ",
2864 STRLENOF("{ serialNumber "));
2865 n = STRLENOF("{ serialNumber ");
2867 AC_MEMCPY( &out->bv_val[n], sn.bv_val, sn.bv_len );
2870 AC_MEMCPY( &out->bv_val[n], ", issuer \"", STRLENOF(", issuer \""));
2871 n += STRLENOF(", issuer \"");
2873 AC_MEMCPY( &out->bv_val[n], ni.bv_val, ni.bv_len );
2876 AC_MEMCPY( &out->bv_val[n], "\" }", STRLENOF("\" }"));
2877 n += STRLENOF("\" }");
2879 out->bv_val[n] = '\0';
2881 assert( n == out->bv_len );
2883 Debug( LDAP_DEBUG_TRACE, "<<< serialNumberAndIssuerPretty: <%s>\n",
2884 out->bv_val, 0, 0 );
2886 slap_sl_free( ni.bv_val, ctx );
2888 return LDAP_SUCCESS;
2892 * This routine is called by certificateExactNormalize when
2893 * certificateExactNormalize receives a search string instead of
2894 * a certificate. This routine checks if the search value is valid
2895 * and then returns the normalized value
2898 serialNumberAndIssuerNormalize(
2906 struct berval sn, sn2, i, ni;
2907 char sbuf[64], *stmp = sbuf;
2912 assert( in != NULL );
2913 assert( out != NULL );
2915 Debug( LDAP_DEBUG_TRACE, ">>> serialNumberAndIssuerNormalize: <%s>\n",
2918 rc = serialNumberAndIssuerCheck( in, &sn, &i, ctx );
2922 rc = dnNormalize( usage, syntax, mr, &i, &ni, ctx );
2924 if( in->bv_val[0] == '{' && in->bv_val[in->bv_len-1] == '}' ) {
2925 slap_sl_free( i.bv_val, ctx );
2928 if( rc ) return LDAP_INVALID_SYNTAX;
2930 /* Convert sn to canonical hex */
2931 if ( sn.bv_len > sizeof( sbuf )) {
2932 stmp = slap_sl_malloc( sn.bv_len, ctx );
2935 sn2.bv_len = sn.bv_len;
2936 if ( lutil_str2bin( &sn, &sn2 )) {
2937 rc = LDAP_INVALID_SYNTAX;
2941 /* make room for sn + "$" */
2942 out->bv_len = STRLENOF( "{ serialNumber , issuer \"\" }" )
2943 + ( sn2.bv_len * 2 + 3 ) + ni.bv_len;
2944 out->bv_val = slap_sl_malloc( out->bv_len + 1, ctx );
2946 if( out->bv_val == NULL ) {
2948 slap_sl_free( ni.bv_val, ctx );
2954 AC_MEMCPY( &out->bv_val[n], "{ serialNumber ",
2955 STRLENOF( "{ serialNumber " ));
2956 n = STRLENOF( "{ serialNumber " );
2958 AC_MEMCPY( &out->bv_val[n], sn.bv_val, sn.bv_len );
2961 unsigned char *v = sn2.bv_val;
2962 out->bv_val[n++] = '\'';
2963 for ( j = 0; j < sn2.bv_len; j++ ) {
2964 sprintf( &out->bv_val[n], "%02x", v[j] );
2967 out->bv_val[n++] = '\'';
2968 out->bv_val[n++] = 'H';
2971 AC_MEMCPY( &out->bv_val[n], ", issuer \"", STRLENOF( ", issuer \"" ));
2972 n += STRLENOF( ", issuer \"" );
2974 AC_MEMCPY( &out->bv_val[n], ni.bv_val, ni.bv_len );
2977 AC_MEMCPY( &out->bv_val[n], "\" }", STRLENOF( "\" }" ));
2978 n += STRLENOF( "\" }" );
2980 out->bv_val[n] = '\0';
2982 assert( n == out->bv_len );
2984 Debug( LDAP_DEBUG_TRACE, "<<< serialNumberAndIssuerNormalize: <%s>\n",
2985 out->bv_val, 0, 0 );
2989 slap_sl_free( stmp, ctx );
2990 slap_sl_free( ni.bv_val, ctx );
2996 certificateExactNormalize(
3001 struct berval *normalized,
3004 BerElementBuffer berbuf;
3005 BerElement *ber = (BerElement *)&berbuf;
3009 char serialbuf[64], *serial = serialbuf;
3010 ber_len_t seriallen;
3011 struct berval issuer_dn = BER_BVNULL, bvdn;
3013 int rc = LDAP_INVALID_SYNTAX;
3015 if( BER_BVISEMPTY( val ) ) goto done;
3017 if( SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX(usage) ) {
3018 return serialNumberAndIssuerNormalize(0,NULL,NULL,val,normalized,ctx);
3021 assert( SLAP_MR_IS_VALUE_OF_ATTRIBUTE_SYNTAX(usage) != 0 );
3023 ber_init2( ber, val, LBER_USE_DER );
3024 tag = ber_skip_tag( ber, &len ); /* Signed Sequence */
3025 tag = ber_skip_tag( ber, &len ); /* Sequence */
3026 tag = ber_peek_tag( ber, &len ); /* Optional version? */
3027 if ( tag == SLAP_X509_OPT_C_VERSION ) {
3028 tag = ber_skip_tag( ber, &len );
3029 tag = ber_get_int( ber, &i ); /* version */
3032 /* NOTE: move the test here from certificateValidate,
3033 * so that we can validate certs with serial longer
3034 * than sizeof(ber_int_t) */
3035 tag = ber_peek_tag( ber, &len ); /* serial */
3037 /* Use hex format. '123456789abcdef'H
3043 tag = ber_skip_tag( ber, &len );
3044 ptr = (unsigned char *)ber->ber_ptr;
3045 ber_skip_data( ber, len );
3047 /* Check for minimal encodings */
3049 if ( ptr[0] & 0x80 ) {
3050 if (( ptr[0] == 0xff ) && ( ptr[1] & 0x80 ))
3051 return LDAP_INVALID_SYNTAX;
3052 } else if ( ptr[0] == 0 ) {
3053 if (!( ptr[1] & 0x80 ))
3054 return LDAP_INVALID_SYNTAX;
3058 seriallen = len * 2 + 4; /* quotes, H, NUL */
3059 if ( seriallen > sizeof( serialbuf ))
3060 serial = slap_sl_malloc( seriallen, ctx );
3063 for ( i = 0; i<len; i++ ) {
3064 sprintf( sptr, "%02x", ptr[i] );
3071 tag = ber_skip_tag( ber, &len ); /* SignatureAlg */
3072 ber_skip_data( ber, len );
3073 tag = ber_peek_tag( ber, &len ); /* IssuerDN */
3074 len = ber_ptrlen( ber );
3075 bvdn.bv_val = val->bv_val + len;
3076 bvdn.bv_len = val->bv_len - len;
3078 rc = dnX509normalize( &bvdn, &issuer_dn );
3079 if( rc != LDAP_SUCCESS ) goto done;
3081 normalized->bv_len = STRLENOF( "{ serialNumber , issuer \"\" }" )
3082 + seriallen + issuer_dn.bv_len;
3083 normalized->bv_val = ch_malloc(normalized->bv_len+1);
3085 p = (unsigned char *)normalized->bv_val;
3087 AC_MEMCPY(p, "{ serialNumber ", STRLENOF( "{ serialNumber " ));
3088 p += STRLENOF( "{ serialNumber " );
3090 AC_MEMCPY(p, serial, seriallen);
3093 AC_MEMCPY(p, ", issuer \"", STRLENOF( ", issuer \"" ));
3094 p += STRLENOF( ", issuer \"" );
3096 AC_MEMCPY(p, issuer_dn.bv_val, issuer_dn.bv_len);
3097 p += issuer_dn.bv_len;
3099 AC_MEMCPY(p, "\" }", STRLENOF( "\" }" ));
3100 p += STRLENOF( "\" }" );
3104 Debug( LDAP_DEBUG_TRACE, "certificateExactNormalize: %s\n",
3105 normalized->bv_val, NULL, NULL );
3110 if ( issuer_dn.bv_val ) ber_memfree( issuer_dn.bv_val );
3111 if ( serial != serialbuf ) ber_memfree_x( serial, ctx );
3123 assert( in != NULL );
3124 assert( !BER_BVISNULL( in ) );
3126 for ( i = 0; i < in->bv_len; i++ ) {
3127 if ( !ASCII_HEX( in->bv_val[ i ] ) ) {
3128 return LDAP_INVALID_SYNTAX;
3132 return LDAP_SUCCESS;
3135 /* Normalize a SID as used inside a CSN:
3136 * three-digit numeric string */
3143 struct berval *normalized,
3148 assert( val != NULL );
3149 assert( normalized != NULL );
3151 ber_dupbv_x( normalized, val, ctx );
3153 for ( i = 0; i < normalized->bv_len; i++ ) {
3154 if ( !ASCII_HEX( normalized->bv_val[ i ] ) ) {
3155 ber_memfree_x( normalized->bv_val, ctx );
3156 BER_BVZERO( normalized );
3157 return LDAP_INVALID_SYNTAX;
3160 normalized->bv_val[ i ] = TOLOWER( normalized->bv_val[ i ] );
3163 return LDAP_SUCCESS;
3171 assert( in != NULL );
3172 assert( !BER_BVISNULL( in ) );
3174 if ( in->bv_len != 3 ) {
3175 return LDAP_INVALID_SYNTAX;
3178 return hexValidate( NULL, in );
3181 /* Normalize a SID as used inside a CSN:
3182 * three-digit numeric string */
3189 struct berval *normalized,
3192 if ( val->bv_len != 3 ) {
3193 return LDAP_INVALID_SYNTAX;
3196 return hexNormalize( 0, NULL, NULL, val, normalized, ctx );
3206 return sidNormalize( SLAP_MR_VALUE_OF_SYNTAX, NULL, NULL, val, out, ctx );
3209 /* Normalize a SID as used inside a CSN, either as-is
3210 * (assertion value) or extracted from the CSN
3211 * (attribute value) */
3218 struct berval *normalized,
3226 if ( BER_BVISEMPTY( val ) ) {
3227 return LDAP_INVALID_SYNTAX;
3230 if ( SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX(usage) ) {
3231 return sidNormalize( 0, NULL, NULL, val, normalized, ctx );
3234 assert( SLAP_MR_IS_VALUE_OF_ATTRIBUTE_SYNTAX(usage) != 0 );
3236 ptr = ber_bvchr( val, '#' );
3237 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3238 return LDAP_INVALID_SYNTAX;
3241 bv.bv_val = ptr + 1;
3242 bv.bv_len = val->bv_len - ( ptr + 1 - val->bv_val );
3244 ptr = ber_bvchr( &bv, '#' );
3245 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3246 return LDAP_INVALID_SYNTAX;
3249 bv.bv_val = ptr + 1;
3250 bv.bv_len = val->bv_len - ( ptr + 1 - val->bv_val );
3252 ptr = ber_bvchr( &bv, '#' );
3253 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3254 return LDAP_INVALID_SYNTAX;
3257 bv.bv_len = ptr - bv.bv_val;
3259 if ( bv.bv_len == 2 ) {
3260 /* OpenLDAP 2.3 SID */
3262 buf[ 1 ] = bv.bv_val[ 0 ];
3263 buf[ 2 ] = bv.bv_val[ 1 ];
3270 return sidNormalize( 0, NULL, NULL, &bv, normalized, ctx );
3282 assert( in != NULL );
3283 assert( !BER_BVISNULL( in ) );
3285 if ( BER_BVISEMPTY( in ) ) {
3286 return LDAP_INVALID_SYNTAX;
3291 ptr = ber_bvchr( &bv, '#' );
3292 if ( ptr == NULL || ptr - bv.bv_val == bv.bv_len ) {
3293 return LDAP_INVALID_SYNTAX;
3296 bv.bv_len = ptr - bv.bv_val;
3297 if ( bv.bv_len != STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ" ) &&
3298 bv.bv_len != STRLENOF( "YYYYmmddHHMMSSZ" ) )
3300 return LDAP_INVALID_SYNTAX;
3303 rc = generalizedTimeValidate( NULL, &bv );
3304 if ( rc != LDAP_SUCCESS ) {
3308 bv.bv_val = ptr + 1;
3309 bv.bv_len = in->bv_len - ( bv.bv_val - in->bv_val );
3311 ptr = ber_bvchr( &bv, '#' );
3312 if ( ptr == NULL || ptr - in->bv_val == in->bv_len ) {
3313 return LDAP_INVALID_SYNTAX;
3316 bv.bv_len = ptr - bv.bv_val;
3317 if ( bv.bv_len != 6 ) {
3318 return LDAP_INVALID_SYNTAX;
3321 rc = hexValidate( NULL, &bv );
3322 if ( rc != LDAP_SUCCESS ) {
3326 bv.bv_val = ptr + 1;
3327 bv.bv_len = in->bv_len - ( bv.bv_val - in->bv_val );
3329 ptr = ber_bvchr( &bv, '#' );
3330 if ( ptr == NULL || ptr - in->bv_val == in->bv_len ) {
3331 return LDAP_INVALID_SYNTAX;
3334 bv.bv_len = ptr - bv.bv_val;
3335 if ( bv.bv_len == 2 ) {
3336 /* tolerate old 2-digit replica-id */
3337 rc = hexValidate( NULL, &bv );
3340 rc = sidValidate( NULL, &bv );
3342 if ( rc != LDAP_SUCCESS ) {
3346 bv.bv_val = ptr + 1;
3347 bv.bv_len = in->bv_len - ( bv.bv_val - in->bv_val );
3349 if ( bv.bv_len != 6 ) {
3350 return LDAP_INVALID_SYNTAX;
3353 return hexValidate( NULL, &bv );
3356 /* Normalize a CSN in OpenLDAP 2.3 format */
3363 struct berval *normalized,
3366 struct berval gt, cnt, sid, mod;
3370 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
3371 assert( !BER_BVISEMPTY( val ) );
3375 ptr = ber_bvchr( >, '#' );
3376 if ( ptr == NULL || ptr - gt.bv_val == gt.bv_len ) {
3377 return LDAP_INVALID_SYNTAX;
3380 gt.bv_len = ptr - gt.bv_val;
3381 assert( gt.bv_len == STRLENOF( "YYYYmmddHHMMSSZ" ) );
3383 cnt.bv_val = ptr + 1;
3384 cnt.bv_len = val->bv_len - ( cnt.bv_val - val->bv_val );
3386 ptr = ber_bvchr( &cnt, '#' );
3387 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3388 return LDAP_INVALID_SYNTAX;
3391 cnt.bv_len = ptr - cnt.bv_val;
3392 assert( cnt.bv_len == STRLENOF( "000000" ) );
3394 sid.bv_val = ptr + 1;
3395 sid.bv_len = val->bv_len - ( sid.bv_val - val->bv_val );
3397 ptr = ber_bvchr( &sid, '#' );
3398 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3399 return LDAP_INVALID_SYNTAX;
3402 sid.bv_len = ptr - sid.bv_val;
3403 assert( sid.bv_len == STRLENOF( "00" ) );
3405 mod.bv_val = ptr + 1;
3406 mod.bv_len = val->bv_len - ( mod.bv_val - val->bv_val );
3407 assert( mod.bv_len == STRLENOF( "000000" ) );
3409 normalized->bv_len = STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ#SSSSSS#SID#ssssss" );
3410 normalized->bv_val = ber_memalloc_x( normalized->bv_len + 1, ctx );
3412 ptr = normalized->bv_val;
3413 ptr = lutil_strncopy( ptr, gt.bv_val, gt.bv_len - 1 );
3414 ptr = lutil_strcopy( ptr, ".000000Z#" );
3415 ptr = lutil_strncopy( ptr, cnt.bv_val, cnt.bv_len );
3418 for ( i = 0; i < sid.bv_len; i++ ) {
3419 *ptr++ = TOLOWER( sid.bv_val[ i ] );
3422 for ( i = 0; i < mod.bv_len; i++ ) {
3423 *ptr++ = TOLOWER( mod.bv_val[ i ] );
3427 assert( ptr - normalized->bv_val == normalized->bv_len );
3429 return LDAP_SUCCESS;
3432 /* Normalize a CSN */
3439 struct berval *normalized,
3442 struct berval cnt, sid, mod;
3446 assert( val != NULL );
3447 assert( normalized != NULL );
3449 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
3451 if ( BER_BVISEMPTY( val ) ) {
3452 return LDAP_INVALID_SYNTAX;
3455 if ( val->bv_len == STRLENOF( "YYYYmmddHHMMSSZ#SSSSSS#ID#ssssss" ) ) {
3456 /* Openldap <= 2.3 */
3458 return csnNormalize23( usage, syntax, mr, val, normalized, ctx );
3461 assert( val->bv_len == STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ#SSSSSS#SID#ssssss" ) );
3463 ptr = ber_bvchr( val, '#' );
3464 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3465 return LDAP_INVALID_SYNTAX;
3468 assert( ptr - val->bv_val == STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ" ) );
3470 cnt.bv_val = ptr + 1;
3471 cnt.bv_len = val->bv_len - ( cnt.bv_val - val->bv_val );
3473 ptr = ber_bvchr( &cnt, '#' );
3474 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3475 return LDAP_INVALID_SYNTAX;
3478 assert( ptr - cnt.bv_val == STRLENOF( "000000" ) );
3480 sid.bv_val = ptr + 1;
3481 sid.bv_len = val->bv_len - ( sid.bv_val - val->bv_val );
3483 ptr = ber_bvchr( &sid, '#' );
3484 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3485 return LDAP_INVALID_SYNTAX;
3488 sid.bv_len = ptr - sid.bv_val;
3489 assert( sid.bv_len == STRLENOF( "000" ) );
3491 mod.bv_val = ptr + 1;
3492 mod.bv_len = val->bv_len - ( mod.bv_val - val->bv_val );
3494 assert( mod.bv_len == STRLENOF( "000000" ) );
3496 ber_dupbv_x( normalized, val, ctx );
3498 for ( i = STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ#SSSSSS#" );
3499 i < normalized->bv_len; i++ )
3501 /* assume it's already validated that's all hex digits */
3502 normalized->bv_val[ i ] = TOLOWER( normalized->bv_val[ i ] );
3505 return LDAP_SUCCESS;
3515 return csnNormalize( SLAP_MR_VALUE_OF_SYNTAX, NULL, NULL, val, out, ctx );
3518 #ifndef SUPPORT_OBSOLETE_UTC_SYNTAX
3519 /* slight optimization - does not need the start parameter */
3520 #define check_time_syntax(v, start, p, f) (check_time_syntax)(v, p, f)
3525 check_time_syntax (struct berval *val,
3528 struct berval *fraction)
3531 * start=0 GeneralizedTime YYYYmmddHH[MM[SS]][(./,)d...](Z|(+/-)HH[MM])
3532 * start=1 UTCTime YYmmddHHMM[SS][Z|(+/-)HHMM]
3533 * GeneralizedTime supports leap seconds, UTCTime does not.
3535 static const int ceiling[9] = { 100, 100, 12, 31, 24, 60, 60, 24, 60 };
3536 static const int mdays[2][12] = {
3537 /* non-leap years */
3538 { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 },
3540 { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }
3543 int part, c, c1, c2, tzoffset, leapyear = 0;
3546 e = p + val->bv_len;
3548 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
3549 parts[0] = 20; /* century - any multiple of 4 from 04 to 96 */
3551 for (part = start; part < 7 && p < e; part++) {
3553 if (!ASCII_DIGIT(c1)) {
3558 return LDAP_INVALID_SYNTAX;
3561 if (!ASCII_DIGIT(c)) {
3562 return LDAP_INVALID_SYNTAX;
3564 c += c1 * 10 - '0' * 11;
3565 if ((part | 1) == 3) {
3568 return LDAP_INVALID_SYNTAX;
3571 if (c >= ceiling[part]) {
3572 if (! (c == 60 && part == 6 && start == 0))
3573 return LDAP_INVALID_SYNTAX;
3577 if (part < 5 + start) {
3578 return LDAP_INVALID_SYNTAX;
3580 for (; part < 9; part++) {
3584 /* leapyear check for the Gregorian calendar (year>1581) */
3585 if (parts[parts[1] == 0 ? 0 : 1] % 4 == 0) {
3589 if (parts[3] >= mdays[leapyear][parts[2]]) {
3590 return LDAP_INVALID_SYNTAX;
3594 fraction->bv_val = p;
3595 fraction->bv_len = 0;
3596 if (p < e && (*p == '.' || *p == ',')) {
3598 while (++p < e && ASCII_DIGIT(*p)) {
3601 if (p - fraction->bv_val == 1) {
3602 return LDAP_INVALID_SYNTAX;
3604 for (end_num = p; end_num[-1] == '0'; --end_num) {
3607 c = end_num - fraction->bv_val;
3608 if (c != 1) fraction->bv_len = c;
3614 return start == 0 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
3620 return LDAP_INVALID_SYNTAX;
3626 for (part = 7; part < 9 && p < e; part++) {
3628 if (!ASCII_DIGIT(c1)) {
3633 return LDAP_INVALID_SYNTAX;
3636 if (!ASCII_DIGIT(c2)) {
3637 return LDAP_INVALID_SYNTAX;
3639 parts[part] = c1 * 10 + c2 - '0' * 11;
3640 if (parts[part] >= ceiling[part]) {
3641 return LDAP_INVALID_SYNTAX;
3644 if (part < 8 + start) {
3645 return LDAP_INVALID_SYNTAX;
3648 if (tzoffset == '-') {
3649 /* negative offset to UTC, ie west of Greenwich */
3650 parts[4] += parts[7];
3651 parts[5] += parts[8];
3652 /* offset is just hhmm, no seconds */
3653 for (part = 6; --part >= 0; ) {
3657 c = mdays[leapyear][parts[2]];
3659 if (parts[part] >= c) {
3661 return LDAP_INVALID_SYNTAX;
3666 } else if (part != 5) {
3671 /* positive offset to UTC, ie east of Greenwich */
3672 parts[4] -= parts[7];
3673 parts[5] -= parts[8];
3674 for (part = 6; --part >= 0; ) {
3675 if (parts[part] < 0) {
3677 return LDAP_INVALID_SYNTAX;
3682 /* make first arg to % non-negative */
3683 c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
3688 } else if (part != 5) {
3695 return p != e ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
3698 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
3705 struct berval *normalized )
3709 rc = check_time_syntax(val, 1, parts, NULL);
3710 if (rc != LDAP_SUCCESS) {
3714 normalized->bv_val = ch_malloc( 14 );
3715 if ( normalized->bv_val == NULL ) {
3716 return LBER_ERROR_MEMORY;
3719 sprintf( normalized->bv_val, "%02d%02d%02d%02d%02d%02dZ",
3720 parts[1], parts[2] + 1, parts[3] + 1,
3721 parts[4], parts[5], parts[6] );
3722 normalized->bv_len = 13;
3724 return LDAP_SUCCESS;
3734 return check_time_syntax(in, 1, parts, NULL);
3737 #endif /* SUPPORT_OBSOLETE_UTC_SYNTAX */
3740 generalizedTimeValidate(
3745 struct berval fraction;
3746 return check_time_syntax(in, 0, parts, &fraction);
3750 generalizedTimeNormalize(
3755 struct berval *normalized,
3760 struct berval fraction;
3762 rc = check_time_syntax(val, 0, parts, &fraction);
3763 if (rc != LDAP_SUCCESS) {
3767 len = STRLENOF("YYYYmmddHHMMSSZ") + fraction.bv_len;
3768 normalized->bv_val = slap_sl_malloc( len + 1, ctx );
3769 if ( BER_BVISNULL( normalized ) ) {
3770 return LBER_ERROR_MEMORY;
3773 sprintf( normalized->bv_val, "%02d%02d%02d%02d%02d%02d%02d",
3774 parts[0], parts[1], parts[2] + 1, parts[3] + 1,
3775 parts[4], parts[5], parts[6] );
3776 if ( !BER_BVISEMPTY( &fraction ) ) {
3777 memcpy( normalized->bv_val + STRLENOF("YYYYmmddHHMMSSZ")-1,
3778 fraction.bv_val, fraction.bv_len );
3779 normalized->bv_val[STRLENOF("YYYYmmddHHMMSSZ")-1] = '.';
3781 strcpy( normalized->bv_val + len-1, "Z" );
3782 normalized->bv_len = len;
3784 return LDAP_SUCCESS;
3788 generalizedTimeOrderingMatch(
3793 struct berval *value,
3794 void *assertedValue )
3796 struct berval *asserted = (struct berval *) assertedValue;
3797 ber_len_t v_len = value->bv_len;
3798 ber_len_t av_len = asserted->bv_len;
3800 /* ignore trailing 'Z' when comparing */
3801 int match = memcmp( value->bv_val, asserted->bv_val,
3802 (v_len < av_len ? v_len : av_len) - 1 );
3803 if ( match == 0 ) match = v_len - av_len;
3806 return LDAP_SUCCESS;
3809 /* Index generation function */
3810 int generalizedTimeIndexer(
3815 struct berval *prefix,
3823 BerValue bvtmp; /* 40 bit index */
3825 struct lutil_timet tt;
3827 bvtmp.bv_len = sizeof(tmp);
3829 for( i=0; values[i].bv_val != NULL; i++ ) {
3830 /* just count them */
3833 /* we should have at least one value at this point */
3836 keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
3838 /* GeneralizedTime YYYYmmddHH[MM[SS]][(./,)d...](Z|(+/-)HH[MM]) */
3839 for( i=0, j=0; values[i].bv_val != NULL; i++ ) {
3840 assert(values[i].bv_val != NULL && values[i].bv_len >= 10);
3841 /* Use 40 bits of time for key */
3842 if ( lutil_parsetime( values[i].bv_val, &tm ) == 0 ) {
3843 lutil_tm2time( &tm, &tt );
3844 tmp[0] = tt.tt_gsec & 0xff;
3845 tmp[4] = tt.tt_sec & 0xff;
3847 tmp[3] = tt.tt_sec & 0xff;
3849 tmp[2] = tt.tt_sec & 0xff;
3851 tmp[1] = tt.tt_sec & 0xff;
3853 ber_dupbv_x(&keys[j++], &bvtmp, ctx );
3857 keys[j].bv_val = NULL;
3862 return LDAP_SUCCESS;
3865 /* Index generation function */
3866 int generalizedTimeFilter(
3871 struct berval *prefix,
3872 void * assertedValue,
3878 BerValue bvtmp; /* 40 bit index */
3879 BerValue *value = (BerValue *) assertedValue;
3881 struct lutil_timet tt;
3883 bvtmp.bv_len = sizeof(tmp);
3885 /* GeneralizedTime YYYYmmddHH[MM[SS]][(./,)d...](Z|(+/-)HH[MM]) */
3886 /* Use 40 bits of time for key */
3887 if ( value->bv_val && value->bv_len >= 10 &&
3888 lutil_parsetime( value->bv_val, &tm ) == 0 ) {
3890 lutil_tm2time( &tm, &tt );
3891 tmp[0] = tt.tt_gsec & 0xff;
3892 tmp[4] = tt.tt_sec & 0xff;
3894 tmp[3] = tt.tt_sec & 0xff;
3896 tmp[2] = tt.tt_sec & 0xff;
3898 tmp[1] = tt.tt_sec & 0xff;
3900 keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
3901 ber_dupbv_x(keys, &bvtmp, ctx );
3902 keys[1].bv_val = NULL;
3910 return LDAP_SUCCESS;
3914 deliveryMethodValidate(
3916 struct berval *val )
3919 #define LENOF(s) (sizeof(s)-1)
3920 struct berval tmp = *val;
3922 * DeliveryMethod = pdm *( WSP DOLLAR WSP DeliveryMethod )
3923 * pdm = "any" / "mhs" / "physical" / "telex" / "teletex" /
3924 * "g3fax" / "g4fax" / "ia5" / "videotex" / "telephone"
3927 if( tmp.bv_len < 3 ) return LDAP_INVALID_SYNTAX;
3929 switch( tmp.bv_val[0] ) {
3932 if(( tmp.bv_len >= LENOF("any") ) &&
3933 ( strncasecmp(tmp.bv_val, "any", LENOF("any")) == 0 ))
3935 tmp.bv_len -= LENOF("any");
3936 tmp.bv_val += LENOF("any");
3939 return LDAP_INVALID_SYNTAX;
3943 if(( tmp.bv_len >= LENOF("mhs") ) &&
3944 ( strncasecmp(tmp.bv_val, "mhs", LENOF("mhs")) == 0 ))
3946 tmp.bv_len -= LENOF("mhs");
3947 tmp.bv_val += LENOF("mhs");
3950 return LDAP_INVALID_SYNTAX;
3954 if(( tmp.bv_len >= LENOF("physical") ) &&
3955 ( strncasecmp(tmp.bv_val, "physical", LENOF("physical")) == 0 ))
3957 tmp.bv_len -= LENOF("physical");
3958 tmp.bv_val += LENOF("physical");
3961 return LDAP_INVALID_SYNTAX;
3964 case 'T': /* telex or teletex or telephone */
3965 if(( tmp.bv_len >= LENOF("telex") ) &&
3966 ( strncasecmp(tmp.bv_val, "telex", LENOF("telex")) == 0 ))
3968 tmp.bv_len -= LENOF("telex");
3969 tmp.bv_val += LENOF("telex");
3972 if(( tmp.bv_len >= LENOF("teletex") ) &&
3973 ( strncasecmp(tmp.bv_val, "teletex", LENOF("teletex")) == 0 ))
3975 tmp.bv_len -= LENOF("teletex");
3976 tmp.bv_val += LENOF("teletex");
3979 if(( tmp.bv_len >= LENOF("telephone") ) &&
3980 ( strncasecmp(tmp.bv_val, "telephone", LENOF("telephone")) == 0 ))
3982 tmp.bv_len -= LENOF("telephone");
3983 tmp.bv_val += LENOF("telephone");
3986 return LDAP_INVALID_SYNTAX;
3989 case 'G': /* g3fax or g4fax */
3990 if(( tmp.bv_len >= LENOF("g3fax") ) && (
3991 ( strncasecmp(tmp.bv_val, "g3fax", LENOF("g3fax")) == 0 ) ||
3992 ( strncasecmp(tmp.bv_val, "g4fax", LENOF("g4fax")) == 0 )))
3994 tmp.bv_len -= LENOF("g3fax");
3995 tmp.bv_val += LENOF("g3fax");
3998 return LDAP_INVALID_SYNTAX;
4002 if(( tmp.bv_len >= LENOF("ia5") ) &&
4003 ( strncasecmp(tmp.bv_val, "ia5", LENOF("ia5")) == 0 ))
4005 tmp.bv_len -= LENOF("ia5");
4006 tmp.bv_val += LENOF("ia5");
4009 return LDAP_INVALID_SYNTAX;
4013 if(( tmp.bv_len >= LENOF("videotex") ) &&
4014 ( strncasecmp(tmp.bv_val, "videotex", LENOF("videotex")) == 0 ))
4016 tmp.bv_len -= LENOF("videotex");
4017 tmp.bv_val += LENOF("videotex");
4020 return LDAP_INVALID_SYNTAX;
4023 return LDAP_INVALID_SYNTAX;
4026 if( BER_BVISEMPTY( &tmp ) ) return LDAP_SUCCESS;
4028 while( !BER_BVISEMPTY( &tmp ) && ( tmp.bv_val[0] == ' ' ) ) {
4032 if( !BER_BVISEMPTY( &tmp ) && ( tmp.bv_val[0] == '$' ) ) {
4036 return LDAP_INVALID_SYNTAX;
4038 while( !BER_BVISEMPTY( &tmp ) && ( tmp.bv_val[0] == ' ' ) ) {
4047 nisNetgroupTripleValidate(
4049 struct berval *val )
4054 if ( BER_BVISEMPTY( val ) ) {
4055 return LDAP_INVALID_SYNTAX;
4058 p = (char *)val->bv_val;
4059 e = p + val->bv_len;
4061 if ( *p != '(' /*')'*/ ) {
4062 return LDAP_INVALID_SYNTAX;
4065 for ( p++; ( p < e ) && ( *p != /*'('*/ ')' ); p++ ) {
4069 return LDAP_INVALID_SYNTAX;
4072 } else if ( !AD_CHAR( *p ) ) {
4073 return LDAP_INVALID_SYNTAX;
4077 if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
4078 return LDAP_INVALID_SYNTAX;
4084 return LDAP_INVALID_SYNTAX;
4087 return LDAP_SUCCESS;
4091 bootParameterValidate(
4093 struct berval *val )
4097 if ( BER_BVISEMPTY( val ) ) {
4098 return LDAP_INVALID_SYNTAX;
4101 p = (char *)val->bv_val;
4102 e = p + val->bv_len;
4105 for (; ( p < e ) && ( *p != '=' ); p++ ) {
4106 if ( !AD_CHAR( *p ) ) {
4107 return LDAP_INVALID_SYNTAX;
4112 return LDAP_INVALID_SYNTAX;
4116 for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
4117 if ( !AD_CHAR( *p ) ) {
4118 return LDAP_INVALID_SYNTAX;
4123 return LDAP_INVALID_SYNTAX;
4127 for ( p++; p < e; p++ ) {
4128 if ( !SLAP_PRINTABLE( *p ) ) {
4129 return LDAP_INVALID_SYNTAX;
4133 return LDAP_SUCCESS;
4137 firstComponentNormalize(
4142 struct berval *normalized,
4149 if( SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX( usage )) {
4150 ber_dupbv_x( normalized, val, ctx );
4151 return LDAP_SUCCESS;
4154 if( val->bv_len < 3 ) return LDAP_INVALID_SYNTAX;
4156 if( val->bv_val[0] != '(' /*')'*/ &&
4157 val->bv_val[0] != '{' /*'}'*/ )
4159 return LDAP_INVALID_SYNTAX;
4162 /* trim leading white space */
4164 len < val->bv_len && ASCII_SPACE(val->bv_val[len]);
4170 /* grab next word */
4171 comp.bv_val = &val->bv_val[len];
4172 len = val->bv_len - len;
4173 for( comp.bv_len = 0;
4174 !ASCII_SPACE(comp.bv_val[comp.bv_len]) && comp.bv_len < len;
4180 if( mr == slap_schema.si_mr_objectIdentifierFirstComponentMatch ) {
4181 rc = numericoidValidate( NULL, &comp );
4182 } else if( mr == slap_schema.si_mr_integerFirstComponentMatch ) {
4183 rc = integerValidate( NULL, &comp );
4185 rc = LDAP_INVALID_SYNTAX;
4189 if( rc == LDAP_SUCCESS ) {
4190 ber_dupbv_x( normalized, &comp, ctx );
4196 static char *country_gen_syn[] = {
4197 "1.3.6.1.4.1.1466.115.121.1.15",
4198 "1.3.6.1.4.1.1466.115.121.1.26",
4199 "1.3.6.1.4.1.1466.115.121.1.44",
4203 #define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
4204 #define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
4206 static slap_syntax_defs_rec syntax_defs[] = {
4207 {"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' "
4208 X_BINARY X_NOT_H_R ")",
4209 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
4210 {"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
4211 0, NULL, NULL, NULL},
4212 {"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
4213 0, NULL, NULL, NULL},
4214 {"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' "
4216 SLAP_SYNTAX_BLOB, NULL, blobValidate, NULL},
4217 {"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' "
4219 SLAP_SYNTAX_BER, NULL, berValidate, NULL},
4220 {"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
4221 0, NULL, bitStringValidate, NULL },
4222 {"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
4223 0, NULL, booleanValidate, NULL},
4224 {"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
4225 X_BINARY X_NOT_H_R ")",
4226 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER,
4227 NULL, certificateValidate, NULL},
4228 {"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
4229 X_BINARY X_NOT_H_R ")",
4230 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER,
4231 NULL, certificateListValidate, NULL},
4232 {"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
4233 X_BINARY X_NOT_H_R ")",
4234 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER,
4235 NULL, sequenceValidate, NULL},
4236 #if 0 /* need to go __after__ printableString */
4237 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
4238 0, "1.3.6.1.4.1.1466.115.121.1.44",
4239 countryStringValidate, NULL},
4241 {"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
4242 0, NULL, dnValidate, dnPretty},
4243 {"( 1.2.36.79672281.1.5.0 DESC 'RDN' )",
4244 0, NULL, rdnValidate, rdnPretty},
4245 #ifdef LDAP_COMP_MATCH
4246 {"( 1.2.36.79672281.1.5.3 DESC 'allComponents' )",
4247 0, NULL, allComponentsValidate, NULL},
4248 {"( 1.2.36.79672281.1.5.2 DESC 'componentFilterMatch assertion') ",
4249 0, NULL, componentFilterValidate, NULL},
4251 {"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
4252 0, NULL, NULL, NULL},
4253 {"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
4254 0, NULL, deliveryMethodValidate, NULL},
4255 {"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
4256 0, NULL, UTF8StringValidate, NULL},
4257 {"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
4258 0, NULL, NULL, NULL},
4259 {"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
4260 0, NULL, NULL, NULL},
4261 {"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
4262 0, NULL, NULL, NULL},
4263 {"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
4264 0, NULL, NULL, NULL},
4265 {"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
4266 0, NULL, NULL, NULL},
4267 {"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
4268 0, NULL, printablesStringValidate, NULL},
4269 {"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
4270 SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
4271 {"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
4272 0, NULL, generalizedTimeValidate, NULL},
4273 {"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
4274 0, NULL, NULL, NULL},
4275 {"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
4276 0, NULL, IA5StringValidate, NULL},
4277 {"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
4278 0, NULL, integerValidate, NULL},
4279 {"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
4280 SLAP_SYNTAX_BLOB, NULL, blobValidate, NULL},
4281 {"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
4282 0, NULL, NULL, NULL},
4283 {"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
4284 0, NULL, NULL, NULL},
4285 {"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
4286 0, NULL, NULL, NULL},
4287 {"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
4288 0, NULL, NULL, NULL},
4289 {"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
4290 0, NULL, NULL, NULL},
4291 {"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
4292 0, NULL, nameUIDValidate, nameUIDPretty },
4293 {"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
4294 0, NULL, NULL, NULL},
4295 {"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
4296 0, NULL, numericStringValidate, NULL},
4297 {"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
4298 0, NULL, NULL, NULL},
4299 {"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
4300 0, NULL, numericoidValidate, NULL},
4301 {"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
4302 0, NULL, IA5StringValidate, NULL},
4303 {"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
4304 0, NULL, blobValidate, NULL},
4305 {"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
4306 0, NULL, UTF8StringValidate, NULL},
4307 {"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
4308 0, NULL, NULL, NULL},
4309 {"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
4310 0, NULL, NULL, NULL},
4311 {"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
4312 0, NULL, printableStringValidate, NULL},
4313 /* moved here because now depends on Directory String, IA5 String
4314 * and Printable String */
4315 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
4316 0, country_gen_syn, countryStringValidate, NULL},
4317 {"( 1.3.6.1.4.1.1466.115.121.1.45 DESC 'SubtreeSpecification' )",
4318 #define subtreeSpecificationValidate UTF8StringValidate /* FIXME */
4319 0, NULL, subtreeSpecificationValidate, NULL},
4320 {"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
4321 X_BINARY X_NOT_H_R ")",
4322 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, berValidate, NULL},
4323 {"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
4324 0, NULL, printableStringValidate, NULL},
4325 {"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
4326 0, NULL, NULL, NULL},
4327 {"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
4328 0, NULL, printablesStringValidate, NULL},
4329 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
4330 {"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
4331 0, NULL, utcTimeValidate, NULL},
4333 {"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
4334 0, NULL, NULL, NULL},
4335 {"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
4336 0, NULL, NULL, NULL},
4337 {"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
4338 0, NULL, NULL, NULL},
4339 {"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
4340 0, NULL, NULL, NULL},
4341 {"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
4342 0, NULL, NULL, NULL},
4344 /* RFC 2307 NIS Syntaxes */
4345 {"( 1.3.6.1.1.1.0.0 DESC 'RFC2307 NIS Netgroup Triple' )",
4346 0, NULL, nisNetgroupTripleValidate, NULL},
4347 {"( 1.3.6.1.1.1.0.1 DESC 'RFC2307 Boot Parameter' )",
4348 0, NULL, bootParameterValidate, NULL},
4350 /* draft-zeilenga-ldap-x509 */
4351 {"( 1.3.6.1.1.15.1 DESC 'Certificate Exact Assertion' )",
4352 SLAP_SYNTAX_HIDE, NULL,
4353 serialNumberAndIssuerValidate,
4354 serialNumberAndIssuerPretty},
4355 {"( 1.3.6.1.1.15.2 DESC 'Certificate Assertion' )",
4356 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4357 {"( 1.3.6.1.1.15.3 DESC 'Certificate Pair Exact Assertion' )",
4358 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4359 {"( 1.3.6.1.1.15.4 DESC 'Certificate Pair Assertion' )",
4360 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4361 {"( 1.3.6.1.1.15.5 DESC 'Certificate List Exact Assertion' )",
4362 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4363 {"( 1.3.6.1.1.15.6 DESC 'Certificate List Assertion' )",
4364 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4365 {"( 1.3.6.1.1.15.7 DESC 'Algorithm Identifier' )",
4366 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4368 #ifdef SLAPD_AUTHPASSWD
4369 /* needs updating */
4370 {"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
4371 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4374 {"( 1.3.6.1.1.16.1 DESC 'UUID' )",
4375 0, NULL, UUIDValidate, UUIDPretty},
4377 {"( 1.3.6.1.4.1.4203.666.11.2.1 DESC 'CSN' )",
4378 SLAP_SYNTAX_HIDE, NULL, csnValidate, csnPretty },
4380 {"( 1.3.6.1.4.1.4203.666.11.2.4 DESC 'CSN SID' )",
4381 SLAP_SYNTAX_HIDE, NULL, sidValidate, sidPretty },
4383 /* OpenLDAP Void Syntax */
4384 {"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' )" ,
4385 SLAP_SYNTAX_HIDE, NULL, inValidate, NULL},
4387 /* FIXME: OID is unused, but not registered yet */
4388 {"( 1.3.6.1.4.1.4203.666.2.7 DESC 'OpenLDAP authz' )",
4389 SLAP_SYNTAX_HIDE, NULL, authzValidate, authzPretty},
4391 {NULL, 0, NULL, NULL, NULL}
4394 char *csnSIDMatchSyntaxes[] = {
4395 "1.3.6.1.4.1.4203.666.11.2.1" /* csn */,
4398 char *certificateExactMatchSyntaxes[] = {
4399 "1.3.6.1.4.1.1466.115.121.1.8" /* certificate */,
4402 #ifdef LDAP_COMP_MATCH
4403 char *componentFilterMatchSyntaxes[] = {
4404 "1.3.6.1.4.1.1466.115.121.1.8" /* certificate */,
4408 char *directoryStringSyntaxes[] = {
4409 "1.3.6.1.4.1.1466.115.121.1.44" /* printableString */,
4412 char *integerFirstComponentMatchSyntaxes[] = {
4413 "1.3.6.1.4.1.1466.115.121.1.27" /* INTEGER */,
4414 "1.3.6.1.4.1.1466.115.121.1.17" /* dITStructureRuleDescription */,
4417 char *objectIdentifierFirstComponentMatchSyntaxes[] = {
4418 "1.3.6.1.4.1.1466.115.121.1.38" /* OID */,
4419 "1.3.6.1.4.1.1466.115.121.1.3" /* attributeTypeDescription */,
4420 "1.3.6.1.4.1.1466.115.121.1.16" /* dITContentRuleDescription */,
4421 "1.3.6.1.4.1.1466.115.121.1.54" /* ldapSyntaxDescription */,
4422 "1.3.6.1.4.1.1466.115.121.1.30" /* matchingRuleDescription */,
4423 "1.3.6.1.4.1.1466.115.121.1.31" /* matchingRuleUseDescription */,
4424 "1.3.6.1.4.1.1466.115.121.1.35" /* nameFormDescription */,
4425 "1.3.6.1.4.1.1466.115.121.1.37" /* objectClassDescription */,
4430 * Other matching rules in X.520 that we do not use (yet):
4432 * 2.5.13.25 uTCTimeMatch
4433 * 2.5.13.26 uTCTimeOrderingMatch
4434 * 2.5.13.31* directoryStringFirstComponentMatch
4435 * 2.5.13.32* wordMatch
4436 * 2.5.13.33* keywordMatch
4437 * 2.5.13.36+ certificatePairExactMatch
4438 * 2.5.13.37+ certificatePairMatch
4439 * 2.5.13.38+ certificateListExactMatch
4440 * 2.5.13.39+ certificateListMatch
4441 * 2.5.13.40+ algorithmIdentifierMatch
4442 * 2.5.13.41* storedPrefixMatch
4443 * 2.5.13.42 attributeCertificateMatch
4444 * 2.5.13.43 readerAndKeyIDMatch
4445 * 2.5.13.44 attributeIntegrityMatch
4447 * (*) described in RFC 3698 (LDAP: Additional Matching Rules)
4448 * (+) described in draft-zeilenga-ldap-x509
4450 static slap_mrule_defs_rec mrule_defs[] = {
4452 * EQUALITY matching rules must be listed after associated APPROX
4453 * matching rules. So, we list all APPROX matching rules first.
4455 {"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
4456 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4457 SLAP_MR_HIDE | SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT, NULL,
4458 NULL, NULL, directoryStringApproxMatch,
4459 directoryStringApproxIndexer, directoryStringApproxFilter,
4462 {"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
4463 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4464 SLAP_MR_HIDE | SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT, NULL,
4465 NULL, NULL, IA5StringApproxMatch,
4466 IA5StringApproxIndexer, IA5StringApproxFilter,
4470 * Other matching rules
4473 {"( 2.5.13.0 NAME 'objectIdentifierMatch' "
4474 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4475 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4476 NULL, NULL, octetStringMatch,
4477 octetStringIndexer, octetStringFilter,
4480 {"( 2.5.13.1 NAME 'distinguishedNameMatch' "
4481 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4482 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4483 NULL, dnNormalize, dnMatch,
4484 octetStringIndexer, octetStringFilter,
4487 {"( 1.3.6.1.4.1.4203.666.4.9 NAME 'dnSubtreeMatch' "
4488 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4489 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4490 NULL, dnNormalize, dnRelativeMatch,
4494 {"( 1.3.6.1.4.1.4203.666.4.8 NAME 'dnOneLevelMatch' "
4495 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4496 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4497 NULL, dnNormalize, dnRelativeMatch,
4501 {"( 1.3.6.1.4.1.4203.666.4.10 NAME 'dnSubordinateMatch' "
4502 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4503 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4504 NULL, dnNormalize, dnRelativeMatch,
4508 {"( 1.3.6.1.4.1.4203.666.4.11 NAME 'dnSuperiorMatch' "
4509 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4510 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4511 NULL, dnNormalize, dnRelativeMatch,
4515 {"( 1.2.36.79672281.1.13.3 NAME 'rdnMatch' "
4516 "SYNTAX 1.2.36.79672281.1.5.0 )",
4517 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4518 NULL, rdnNormalize, rdnMatch,
4519 octetStringIndexer, octetStringFilter,
4522 #ifdef LDAP_COMP_MATCH
4523 {"( 1.2.36.79672281.1.13.2 NAME 'componentFilterMatch' "
4524 "SYNTAX 1.2.36.79672281.1.5.2 )",
4525 SLAP_MR_EXT|SLAP_MR_COMPONENT, componentFilterMatchSyntaxes,
4526 NULL, NULL , componentFilterMatch,
4527 octetStringIndexer, octetStringFilter,
4530 {"( 1.2.36.79672281.1.13.6 NAME 'allComponentsMatch' "
4531 "SYNTAX 1.2.36.79672281.1.5.3 )",
4532 SLAP_MR_EQUALITY|SLAP_MR_EXT|SLAP_MR_COMPONENT, NULL,
4533 NULL, NULL , allComponentsMatch,
4534 octetStringIndexer, octetStringFilter,
4537 {"( 1.2.36.79672281.1.13.7 NAME 'directoryComponentsMatch' "
4538 "SYNTAX 1.2.36.79672281.1.5.3 )",
4539 SLAP_MR_EQUALITY|SLAP_MR_EXT|SLAP_MR_COMPONENT, NULL,
4540 NULL, NULL , directoryComponentsMatch,
4541 octetStringIndexer, octetStringFilter,
4545 {"( 2.5.13.2 NAME 'caseIgnoreMatch' "
4546 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4547 SLAP_MR_EQUALITY | SLAP_MR_EXT, directoryStringSyntaxes,
4548 NULL, UTF8StringNormalize, octetStringMatch,
4549 octetStringIndexer, octetStringFilter,
4550 directoryStringApproxMatchOID },
4552 {"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
4553 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4554 SLAP_MR_ORDERING, directoryStringSyntaxes,
4555 NULL, UTF8StringNormalize, octetStringOrderingMatch,
4557 "caseIgnoreMatch" },
4559 {"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
4560 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4561 SLAP_MR_SUBSTR, directoryStringSyntaxes,
4562 NULL, UTF8StringNormalize, directoryStringSubstringsMatch,
4563 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4564 "caseIgnoreMatch" },
4566 {"( 2.5.13.5 NAME 'caseExactMatch' "
4567 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4568 SLAP_MR_EQUALITY | SLAP_MR_EXT, directoryStringSyntaxes,
4569 NULL, UTF8StringNormalize, octetStringMatch,
4570 octetStringIndexer, octetStringFilter,
4571 directoryStringApproxMatchOID },
4573 {"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
4574 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4575 SLAP_MR_ORDERING, directoryStringSyntaxes,
4576 NULL, UTF8StringNormalize, octetStringOrderingMatch,
4580 {"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
4581 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4582 SLAP_MR_SUBSTR, directoryStringSyntaxes,
4583 NULL, UTF8StringNormalize, directoryStringSubstringsMatch,
4584 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4587 {"( 2.5.13.8 NAME 'numericStringMatch' "
4588 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
4589 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4590 NULL, numericStringNormalize, octetStringMatch,
4591 octetStringIndexer, octetStringFilter,
4594 {"( 2.5.13.9 NAME 'numericStringOrderingMatch' "
4595 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
4596 SLAP_MR_ORDERING, NULL,
4597 NULL, numericStringNormalize, octetStringOrderingMatch,
4599 "numericStringMatch" },
4601 {"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
4602 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4603 SLAP_MR_SUBSTR, NULL,
4604 NULL, numericStringNormalize, octetStringSubstringsMatch,
4605 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4606 "numericStringMatch" },
4608 {"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
4609 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
4610 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4611 NULL, NULL, NULL, NULL, NULL, NULL },
4613 {"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
4614 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4615 SLAP_MR_SUBSTR, NULL,
4616 NULL, NULL, NULL, NULL, NULL,
4617 "caseIgnoreListMatch" },
4619 {"( 2.5.13.13 NAME 'booleanMatch' "
4620 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
4621 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4622 NULL, NULL, booleanMatch,
4623 octetStringIndexer, octetStringFilter,
4626 {"( 2.5.13.14 NAME 'integerMatch' "
4627 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4628 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4629 NULL, NULL, integerMatch,
4630 octetStringIndexer, octetStringFilter,
4633 {"( 2.5.13.15 NAME 'integerOrderingMatch' "
4634 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4635 SLAP_MR_ORDERING, NULL,
4636 NULL, NULL, integerMatch,
4640 {"( 2.5.13.16 NAME 'bitStringMatch' "
4641 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
4642 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4643 NULL, NULL, octetStringMatch,
4644 octetStringIndexer, octetStringFilter,
4647 {"( 2.5.13.17 NAME 'octetStringMatch' "
4648 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4649 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4650 NULL, NULL, octetStringMatch,
4651 octetStringIndexer, octetStringFilter,
4654 {"( 2.5.13.18 NAME 'octetStringOrderingMatch' "
4655 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4656 SLAP_MR_ORDERING, NULL,
4657 NULL, NULL, octetStringOrderingMatch,
4659 "octetStringMatch" },
4661 {"( 2.5.13.19 NAME 'octetStringSubstringsMatch' "
4662 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4663 SLAP_MR_SUBSTR, NULL,
4664 NULL, NULL, octetStringSubstringsMatch,
4665 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4666 "octetStringMatch" },
4668 {"( 2.5.13.20 NAME 'telephoneNumberMatch' "
4669 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
4670 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4672 telephoneNumberNormalize, octetStringMatch,
4673 octetStringIndexer, octetStringFilter,
4676 {"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
4677 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4678 SLAP_MR_SUBSTR, NULL,
4679 NULL, telephoneNumberNormalize, octetStringSubstringsMatch,
4680 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4681 "telephoneNumberMatch" },
4683 {"( 2.5.13.22 NAME 'presentationAddressMatch' "
4684 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
4685 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4686 NULL, NULL, NULL, NULL, NULL, NULL },
4688 {"( 2.5.13.23 NAME 'uniqueMemberMatch' "
4689 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
4690 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4691 NULL, uniqueMemberNormalize, uniqueMemberMatch,
4692 uniqueMemberIndexer, uniqueMemberFilter,
4695 {"( 2.5.13.24 NAME 'protocolInformationMatch' "
4696 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
4697 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4698 NULL, NULL, NULL, NULL, NULL, NULL },
4700 {"( 2.5.13.27 NAME 'generalizedTimeMatch' "
4701 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4702 SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_ORDERED_INDEX, NULL,
4703 NULL, generalizedTimeNormalize, octetStringMatch,
4704 generalizedTimeIndexer, generalizedTimeFilter,
4707 {"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
4708 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4709 SLAP_MR_ORDERING | SLAP_MR_ORDERED_INDEX, NULL,
4710 NULL, generalizedTimeNormalize, generalizedTimeOrderingMatch,
4712 "generalizedTimeMatch" },
4714 {"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
4715 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4716 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4717 integerFirstComponentMatchSyntaxes,
4718 NULL, firstComponentNormalize, integerMatch,
4719 octetStringIndexer, octetStringFilter,
4722 {"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
4723 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4724 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4725 objectIdentifierFirstComponentMatchSyntaxes,
4726 NULL, firstComponentNormalize, octetStringMatch,
4727 octetStringIndexer, octetStringFilter,
4730 {"( 2.5.13.34 NAME 'certificateExactMatch' "
4731 "SYNTAX 1.3.6.1.1.15.1 )",
4732 SLAP_MR_EQUALITY | SLAP_MR_EXT, certificateExactMatchSyntaxes,
4733 NULL, certificateExactNormalize, octetStringMatch,
4734 octetStringIndexer, octetStringFilter,
4737 {"( 2.5.13.35 NAME 'certificateMatch' "
4738 "SYNTAX 1.3.6.1.1.15.2 )",
4739 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4740 NULL, NULL, NULL, NULL, NULL,
4743 {"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
4744 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4745 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4746 NULL, IA5StringNormalize, octetStringMatch,
4747 octetStringIndexer, octetStringFilter,
4748 IA5StringApproxMatchOID },
4750 {"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
4751 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4752 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4753 NULL, IA5StringNormalize, octetStringMatch,
4754 octetStringIndexer, octetStringFilter,
4755 IA5StringApproxMatchOID },
4757 {"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
4758 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4759 SLAP_MR_SUBSTR, NULL,
4760 NULL, IA5StringNormalize, directoryStringSubstringsMatch,
4761 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4762 "caseIgnoreIA5Match" },
4764 {"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
4765 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4766 SLAP_MR_SUBSTR, NULL,
4767 NULL, IA5StringNormalize, directoryStringSubstringsMatch,
4768 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4769 "caseExactIA5Match" },
4771 #ifdef SLAPD_AUTHPASSWD
4772 /* needs updating */
4773 {"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
4774 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4775 SLAP_MR_HIDE | SLAP_MR_EQUALITY, NULL,
4776 NULL, NULL, authPasswordMatch,
4781 {"( 1.2.840.113556.1.4.803 NAME 'integerBitAndMatch' "
4782 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4784 NULL, NULL, integerBitAndMatch,
4788 {"( 1.2.840.113556.1.4.804 NAME 'integerBitOrMatch' "
4789 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4791 NULL, NULL, integerBitOrMatch,
4795 {"( 1.3.6.1.1.16.2 NAME 'UUIDMatch' "
4796 "SYNTAX 1.3.6.1.1.16.1 )",
4797 SLAP_MR_EQUALITY | SLAP_MR_MUTATION_NORMALIZER, NULL,
4798 NULL, UUIDNormalize, octetStringMatch,
4799 octetStringIndexer, octetStringFilter,
4802 {"( 1.3.6.1.1.16.3 NAME 'UUIDOrderingMatch' "
4803 "SYNTAX 1.3.6.1.1.16.1 )",
4804 SLAP_MR_ORDERING | SLAP_MR_MUTATION_NORMALIZER, NULL,
4805 NULL, UUIDNormalize, octetStringOrderingMatch,
4806 octetStringIndexer, octetStringFilter,
4809 {"( 1.3.6.1.4.1.4203.666.11.2.2 NAME 'CSNMatch' "
4810 "SYNTAX 1.3.6.1.4.1.4203.666.11.2.1 )",
4811 SLAP_MR_HIDE | SLAP_MR_EQUALITY | SLAP_MR_ORDERED_INDEX, NULL,
4812 NULL, csnNormalize, csnMatch,
4813 csnIndexer, csnFilter,
4816 {"( 1.3.6.1.4.1.4203.666.11.2.3 NAME 'CSNOrderingMatch' "
4817 "SYNTAX 1.3.6.1.4.1.4203.666.11.2.1 )",
4818 SLAP_MR_HIDE | SLAP_MR_ORDERING | SLAP_MR_ORDERED_INDEX, NULL,
4819 NULL, NULL, csnOrderingMatch,
4823 {"( 1.3.6.1.4.1.4203.666.11.2.5 NAME 'CSNSIDMatch' "
4824 "SYNTAX 1.3.6.1.4.1.4203.666.11.2.4 )",
4825 SLAP_MR_HIDE | SLAP_MR_EQUALITY | SLAP_MR_EXT, csnSIDMatchSyntaxes,
4826 NULL, csnSidNormalize, octetStringMatch,
4827 octetStringIndexer, octetStringFilter,
4830 /* FIXME: OID is unused, but not registered yet */
4831 {"( 1.3.6.1.4.1.4203.666.4.12 NAME 'authzMatch' "
4832 "SYNTAX 1.3.6.1.4.1.4203.666.2.7 )",
4833 SLAP_MR_HIDE | SLAP_MR_EQUALITY, NULL,
4834 NULL, authzNormalize, authzMatch,
4838 {NULL, SLAP_MR_NONE, NULL,
4839 NULL, NULL, NULL, NULL, NULL,
4844 slap_schema_init( void )
4849 /* we should only be called once (from main) */
4850 assert( schema_init_done == 0 );
4852 for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
4853 res = register_syntax( &syntax_defs[i] );
4856 fprintf( stderr, "slap_schema_init: Error registering syntax %s\n",
4857 syntax_defs[i].sd_desc );
4862 for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
4863 if( mrule_defs[i].mrd_usage == SLAP_MR_NONE &&
4864 mrule_defs[i].mrd_compat_syntaxes == NULL )
4867 "slap_schema_init: Ignoring unusable matching rule %s\n",
4868 mrule_defs[i].mrd_desc );
4872 res = register_matching_rule( &mrule_defs[i] );
4876 "slap_schema_init: Error registering matching rule %s\n",
4877 mrule_defs[i].mrd_desc );
4882 res = slap_schema_load();
4883 schema_init_done = 1;
4888 schema_destroy( void )
4897 if( schema_init_done ) {
4898 ldap_pvt_thread_mutex_destroy( &ad_undef_mutex );
4899 ldap_pvt_thread_mutex_destroy( &oc_undef_mutex );