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 serialNumberAndIssuerValidate(
2531 struct berval sn, i;
2533 Debug( LDAP_DEBUG_TRACE, ">>> serialNumberAndIssuerValidate: <%s>\n",
2536 if( in->bv_len < 3 ) return LDAP_INVALID_SYNTAX;
2538 if( in->bv_val[0] != '{' && in->bv_val[in->bv_len-1] != '}' ) {
2539 /* Parse old format */
2540 i.bv_val = ber_bvchr( in, '$' );
2541 if( BER_BVISNULL( &i ) ) return LDAP_INVALID_SYNTAX;
2543 sn.bv_val = in->bv_val;
2544 sn.bv_len = i.bv_val - in->bv_val;
2547 i.bv_len = in->bv_len - (sn.bv_len + 1);
2549 /* eat leading zeros */
2550 for( n=0; n < (sn.bv_len-1); n++ ) {
2551 if( sn.bv_val[n] != '0' ) break;
2556 for( n=0; n < sn.bv_len; n++ ) {
2557 if( !ASCII_DIGIT(sn.bv_val[n]) ) return LDAP_INVALID_SYNTAX;
2561 /* Parse GSER format */
2562 int havesn=0,haveissuer=0;
2563 struct berval x = *in;
2567 /* eat leading spaces */
2568 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2572 if ( x.bv_len < STRLENOF("serialNumber 0,issuer \"\"")) {
2573 return LDAP_INVALID_SYNTAX;
2576 /* should be at issuer or serialNumber NamedValue */
2577 if( strncasecmp( x.bv_val, "issuer", STRLENOF("issuer")) == 0 ) {
2579 x.bv_val += STRLENOF("issuer");
2580 x.bv_len -= STRLENOF("issuer");
2582 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2583 x.bv_val++; x.bv_len--;
2585 /* eat leading spaces */
2586 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2590 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
2591 x.bv_val++; x.bv_len--;
2593 i.bv_val = x.bv_val;
2596 for( ; i.bv_len < x.bv_len; ) {
2597 if ( i.bv_val[i.bv_len] != '"' ) {
2601 if ( i.bv_val[i.bv_len+1] == '"' ) {
2608 x.bv_val += i.bv_len+1;
2609 x.bv_len -= i.bv_len+1;
2611 if ( x.bv_len < STRLENOF(",serialNumber 0")) {
2612 return LDAP_INVALID_SYNTAX;
2617 } else if( strncasecmp( x.bv_val, "serialNumber",
2618 STRLENOF("serialNumber")) == 0 )
2620 /* parse serialNumber */
2622 x.bv_val += STRLENOF("serialNumber");
2623 x.bv_len -= STRLENOF("serialNumber");
2625 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2626 x.bv_val++; x.bv_len--;
2628 /* eat leading spaces */
2629 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2633 sn.bv_val = x.bv_val;
2636 if( sn.bv_val[0] == '-' ) {
2641 for( ; sn.bv_len < x.bv_len; sn.bv_len++ ) {
2642 if ( !ASCII_DIGIT( sn.bv_val[sn.bv_len] )) break;
2645 if (!( sn.bv_len > neg )) return LDAP_INVALID_SYNTAX;
2646 if (( sn.bv_len > 1+neg ) && ( sn.bv_val[neg] == '0' )) {
2647 return LDAP_INVALID_SYNTAX;
2650 x.bv_val += sn.bv_len; x.bv_len -= sn.bv_len;
2652 if ( x.bv_len < STRLENOF( ",issuer \"\"" )) {
2653 return LDAP_INVALID_SYNTAX;
2658 } else return LDAP_INVALID_SYNTAX;
2660 if( x.bv_val[0] != ',' ) return LDAP_INVALID_SYNTAX;
2661 x.bv_val++; x.bv_len--;
2664 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2668 /* should be at remaining NamedValue */
2669 if( !haveissuer && (strncasecmp( x.bv_val, "issuer",
2670 STRLENOF("issuer" )) == 0 ))
2673 x.bv_val += STRLENOF("issuer");
2674 x.bv_len -= STRLENOF("issuer");
2676 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2677 x.bv_val++; x.bv_len--;
2679 /* eat leading spaces */
2680 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2684 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
2685 x.bv_val++; x.bv_len--;
2687 i.bv_val = x.bv_val;
2690 for( ; i.bv_len < x.bv_len; ) {
2691 if ( i.bv_val[i.bv_len] != '"' ) {
2695 if ( i.bv_val[i.bv_len+1] == '"' ) {
2702 x.bv_val += i.bv_len+1;
2703 x.bv_len -= i.bv_len+1;
2705 } else if( !havesn && (strncasecmp( x.bv_val, "serialNumber",
2706 STRLENOF("serialNumber")) == 0 ))
2708 /* parse serialNumber */
2710 x.bv_val += STRLENOF("serialNumber");
2711 x.bv_len -= STRLENOF("serialNumber");
2713 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2714 x.bv_val++; x.bv_len--;
2716 /* eat leading spaces */
2717 for( ; (x.bv_val[0] == ' ') && x.bv_len ; x.bv_val++, x.bv_len--) {
2721 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2722 x.bv_val++; x.bv_len--;
2724 sn.bv_val = x.bv_val;
2727 if( sn.bv_val[0] == '-' ) {
2732 for( ; sn.bv_len < x.bv_len; sn.bv_len++ ) {
2733 if ( !ASCII_DIGIT( sn.bv_val[sn.bv_len] )) break;
2736 if (!( sn.bv_len > neg )) return LDAP_INVALID_SYNTAX;
2737 if (( sn.bv_len > 1+neg ) && ( sn.bv_val[neg] == '0' )) {
2738 return LDAP_INVALID_SYNTAX;
2741 x.bv_val += sn.bv_len;
2742 x.bv_len -= sn.bv_len;
2744 } else return LDAP_INVALID_SYNTAX;
2746 /* eat trailing spaces */
2747 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2751 /* should have no characters left... */
2752 if( x.bv_len ) return LDAP_INVALID_SYNTAX;
2755 /* validate DN -- doesn't handle double dquote */
2756 rc = dnValidate( NULL, &i );
2757 if( rc ) return LDAP_INVALID_SYNTAX;
2759 Debug( LDAP_DEBUG_TRACE, "<<< serialNumberAndIssuerValidate: OKAY\n",
2761 return LDAP_SUCCESS;
2765 serialNumberAndIssuerPretty(
2773 struct berval sn, i, ni;
2775 assert( in != NULL );
2776 assert( out != NULL );
2778 Debug( LDAP_DEBUG_TRACE, ">>> serialNumberAndIssuerPretty: <%s>\n",
2781 if( in->bv_len < 3 ) return LDAP_INVALID_SYNTAX;
2783 if( in->bv_val[0] != '{' && in->bv_val[in->bv_len-1] != '}' ) {
2784 /* Parse old format */
2785 i.bv_val = ber_bvchr( in, '$' );
2786 if( BER_BVISNULL( &i ) ) return LDAP_INVALID_SYNTAX;
2788 sn.bv_val = in->bv_val;
2789 sn.bv_len = i.bv_val - in->bv_val;
2792 i.bv_len = in->bv_len - (sn.bv_len + 1);
2794 /* eat leading zeros */
2795 for( n=0; n < (sn.bv_len-1); n++ ) {
2796 if( sn.bv_val[n] != '0' ) break;
2801 for( n=0; n < sn.bv_len; n++ ) {
2802 if( !ASCII_DIGIT(sn.bv_val[n]) ) return LDAP_INVALID_SYNTAX;
2806 /* Parse GSER format */
2807 int havesn=0,haveissuer=0;
2808 struct berval x = *in;
2812 /* eat leading spaces */
2813 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2817 if ( x.bv_len < STRLENOF("serialNumber 0,issuer \"\"")) {
2818 return LDAP_INVALID_SYNTAX;
2821 /* should be at issuer or serialNumber NamedValue */
2822 if( strncasecmp( x.bv_val, "issuer", STRLENOF("issuer")) == 0 ) {
2824 x.bv_val += STRLENOF("issuer");
2825 x.bv_len -= STRLENOF("issuer");
2827 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2828 x.bv_val++; x.bv_len--;
2830 /* eat leading spaces */
2831 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2835 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
2836 x.bv_val++; x.bv_len--;
2838 i.bv_val = x.bv_val;
2841 for( ; i.bv_len < x.bv_len; ) {
2842 if ( i.bv_val[i.bv_len] != '"' ) {
2846 if ( i.bv_val[i.bv_len+1] == '"' ) {
2853 x.bv_val += i.bv_len+1;
2854 x.bv_len -= i.bv_len+1;
2856 if ( x.bv_len < STRLENOF(",serialNumber 0")) {
2857 return LDAP_INVALID_SYNTAX;
2862 } else if( strncasecmp( x.bv_val, "serialNumber",
2863 STRLENOF("serialNumber")) == 0 )
2865 /* parse serialNumber */
2867 x.bv_val += STRLENOF("serialNumber");
2868 x.bv_len -= STRLENOF("serialNumber");
2870 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2871 x.bv_val++; x.bv_len--;
2873 /* eat leading spaces */
2874 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2878 sn.bv_val = x.bv_val;
2881 if( sn.bv_val[0] == '-' ) {
2886 for( ; sn.bv_len < x.bv_len; sn.bv_len++ ) {
2887 if ( !ASCII_DIGIT( sn.bv_val[sn.bv_len] )) break;
2890 if (!( sn.bv_len > neg )) return LDAP_INVALID_SYNTAX;
2891 if (( sn.bv_len > 1+neg ) && ( sn.bv_val[neg] == '0' )) {
2892 return LDAP_INVALID_SYNTAX;
2895 x.bv_val += sn.bv_len; x.bv_len -= sn.bv_len;
2897 if ( x.bv_len < STRLENOF( ",issuer \"\"" )) {
2898 return LDAP_INVALID_SYNTAX;
2903 } else return LDAP_INVALID_SYNTAX;
2905 if( x.bv_val[0] != ',' ) return LDAP_INVALID_SYNTAX;
2906 x.bv_val++; x.bv_len--;
2909 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2913 /* should be at remaining NamedValue */
2914 if( !haveissuer && (strncasecmp( x.bv_val, "issuer",
2915 STRLENOF("issuer" )) == 0 ))
2918 x.bv_val += STRLENOF("issuer");
2919 x.bv_len -= STRLENOF("issuer");
2921 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2922 x.bv_val++; x.bv_len--;
2924 /* eat leading spaces */
2925 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2929 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
2930 x.bv_val++; x.bv_len--;
2932 i.bv_val = x.bv_val;
2935 for( ; i.bv_len < x.bv_len; ) {
2936 if ( i.bv_val[i.bv_len] != '"' ) {
2940 if ( i.bv_val[i.bv_len+1] == '"' ) {
2947 x.bv_val += i.bv_len+1;
2948 x.bv_len -= i.bv_len+1;
2950 } else if( !havesn && (strncasecmp( x.bv_val, "serialNumber",
2951 STRLENOF("serialNumber")) == 0 ))
2953 /* parse serialNumber */
2955 x.bv_val += STRLENOF("serialNumber");
2956 x.bv_len -= STRLENOF("serialNumber");
2958 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
2959 x.bv_val++; x.bv_len--;
2961 /* eat leading spaces */
2962 for( ; (x.bv_val[0] == ' ') && x.bv_len ; x.bv_val++, x.bv_len--) {
2966 sn.bv_val = x.bv_val;
2969 if( sn.bv_val[0] == '-' ) {
2974 for( ; sn.bv_len < x.bv_len; sn.bv_len++ ) {
2975 if ( !ASCII_DIGIT( sn.bv_val[sn.bv_len] )) break;
2978 if (!( sn.bv_len > neg )) return LDAP_INVALID_SYNTAX;
2979 if (( sn.bv_len > 1+neg ) && ( sn.bv_val[neg] == '0' )) {
2980 return LDAP_INVALID_SYNTAX;
2983 x.bv_val += sn.bv_len;
2984 x.bv_len -= sn.bv_len;
2986 } else return LDAP_INVALID_SYNTAX;
2988 /* eat trailing spaces */
2989 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
2993 /* should have no characters left... */
2994 if( x.bv_len ) return LDAP_INVALID_SYNTAX;
2996 ber_dupbv_x( &ni, &i, ctx );
2999 /* need to handle double dquotes here */
3002 rc = dnPretty( syntax, &i, &ni, ctx );
3004 if( in->bv_val[0] == '{' && in->bv_val[in->bv_len-1] == '}' ) {
3005 slap_sl_free( i.bv_val, ctx );
3008 if( rc ) return LDAP_INVALID_SYNTAX;
3010 /* make room from sn + "$" */
3011 out->bv_len = STRLENOF("{ serialNumber , issuer \"\" }")
3012 + sn.bv_len + ni.bv_len;
3013 out->bv_val = slap_sl_malloc( out->bv_len + 1, ctx );
3015 if( out->bv_val == NULL ) {
3017 slap_sl_free( ni.bv_val, ctx );
3022 AC_MEMCPY( &out->bv_val[n], "{ serialNumber ",
3023 STRLENOF("{ serialNumber "));
3024 n = STRLENOF("{ serialNumber ");
3026 AC_MEMCPY( &out->bv_val[n], sn.bv_val, sn.bv_len );
3029 AC_MEMCPY( &out->bv_val[n], ", issuer \"", STRLENOF(", issuer \""));
3030 n += STRLENOF(", issuer \"");
3032 AC_MEMCPY( &out->bv_val[n], ni.bv_val, ni.bv_len );
3035 AC_MEMCPY( &out->bv_val[n], "\" }", STRLENOF("\" }"));
3036 n += STRLENOF("\" }");
3038 out->bv_val[n] = '\0';
3040 assert( n == out->bv_len );
3042 Debug( LDAP_DEBUG_TRACE, "<<< serialNumberAndIssuerPretty: <%s>\n",
3043 out->bv_val, 0, 0 );
3045 slap_sl_free( ni.bv_val, ctx );
3047 return LDAP_SUCCESS;
3051 * This routine is called by certificateExactNormalize when
3052 * certificateExactNormalize receives a search string instead of
3053 * a certificate. This routine checks if the search value is valid
3054 * and then returns the normalized value
3057 serialNumberAndIssuerNormalize(
3067 struct berval sn, i, ni;
3069 assert( in != NULL );
3070 assert( out != NULL );
3072 Debug( LDAP_DEBUG_TRACE, ">>> serialNumberAndIssuerNormalize: <%s>\n",
3075 if( in->bv_len < 3 ) return LDAP_INVALID_SYNTAX;
3077 if( in->bv_val[0] != '{' && in->bv_val[in->bv_len-1] != '}' ) {
3078 /* Parse old format */
3079 i.bv_val = ber_bvchr( in, '$' );
3080 if( BER_BVISNULL( &i ) ) return LDAP_INVALID_SYNTAX;
3082 sn.bv_val = in->bv_val;
3083 sn.bv_len = i.bv_val - in->bv_val;
3086 i.bv_len = in->bv_len - (sn.bv_len + 1);
3088 /* eat leading zeros */
3089 for( n=0; n < (sn.bv_len-1); n++ ) {
3090 if( sn.bv_val[n] != '0' ) break;
3095 for( n=0; n < sn.bv_len; n++ ) {
3096 if( !ASCII_DIGIT(sn.bv_val[n]) ) return LDAP_INVALID_SYNTAX;
3100 /* Parse GSER format */
3101 int havesn=0,haveissuer=0;
3102 struct berval x = *in;
3106 /* eat leading spaces */
3107 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
3111 if ( x.bv_len < STRLENOF("serialNumber 0,issuer \"\"")) {
3112 return LDAP_INVALID_SYNTAX;
3115 /* should be at issuer or serialNumber NamedValue */
3116 if( strncasecmp( x.bv_val, "issuer", STRLENOF("issuer")) == 0 ) {
3118 x.bv_val += STRLENOF("issuer");
3119 x.bv_len -= STRLENOF("issuer");
3121 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
3122 x.bv_val++; x.bv_len--;
3124 /* eat leading spaces */
3125 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
3129 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
3130 x.bv_val++; x.bv_len--;
3132 i.bv_val = x.bv_val;
3135 for( ; i.bv_len < x.bv_len; ) {
3136 if ( i.bv_val[i.bv_len] != '"' ) {
3140 if ( i.bv_val[i.bv_len+1] == '"' ) {
3147 x.bv_val += i.bv_len+1;
3148 x.bv_len -= i.bv_len+1;
3150 if ( x.bv_len < STRLENOF(",serialNumber 0")) {
3151 return LDAP_INVALID_SYNTAX;
3156 } else if( strncasecmp( x.bv_val, "serialNumber",
3157 STRLENOF("serialNumber")) == 0 )
3159 /* parse serialNumber */
3161 x.bv_val += STRLENOF("serialNumber");
3162 x.bv_len -= STRLENOF("serialNumber");
3164 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
3165 x.bv_val++; x.bv_len--;
3167 /* eat leading spaces */
3168 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
3172 sn.bv_val = x.bv_val;
3175 if( sn.bv_val[0] == '-' ) {
3180 for( ; sn.bv_len < x.bv_len; sn.bv_len++ ) {
3181 if ( !ASCII_DIGIT( sn.bv_val[sn.bv_len] )) break;
3184 if (!( sn.bv_len > neg )) return LDAP_INVALID_SYNTAX;
3185 if (( sn.bv_len > 1+neg ) && ( sn.bv_val[neg] == '0' )) {
3186 return LDAP_INVALID_SYNTAX;
3189 x.bv_val += sn.bv_len; x.bv_len -= sn.bv_len;
3191 if ( x.bv_len < STRLENOF( ",issuer \"\"" )) {
3192 return LDAP_INVALID_SYNTAX;
3197 } else return LDAP_INVALID_SYNTAX;
3199 if( x.bv_val[0] != ',' ) return LDAP_INVALID_SYNTAX;
3200 x.bv_val++; x.bv_len--;
3203 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
3207 /* should be at remaining NamedValue */
3208 if( !haveissuer && (strncasecmp( x.bv_val, "issuer",
3209 STRLENOF("issuer" )) == 0 ))
3212 x.bv_val += STRLENOF("issuer");
3213 x.bv_len -= STRLENOF("issuer");
3215 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
3216 x.bv_val++; x.bv_len--;
3218 /* eat leading spaces */
3219 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
3223 if( x.bv_val[0] != '"' ) return LDAP_INVALID_SYNTAX;
3224 x.bv_val++; x.bv_len--;
3226 i.bv_val = x.bv_val;
3229 for( ; i.bv_len < x.bv_len; ) {
3230 if ( i.bv_val[i.bv_len] != '"' ) {
3234 if ( i.bv_val[i.bv_len+1] == '"' ) {
3241 x.bv_val += i.bv_len+1;
3242 x.bv_len -= i.bv_len+1;
3244 } else if( !havesn && (strncasecmp( x.bv_val, "serialNumber",
3245 STRLENOF("serialNumber")) == 0 ))
3247 /* parse serialNumber */
3249 x.bv_val += STRLENOF("serialNumber");
3250 x.bv_len -= STRLENOF("serialNumber");
3252 if( x.bv_val[0] != ' ' ) return LDAP_INVALID_SYNTAX;
3253 x.bv_val++; x.bv_len--;
3255 /* eat leading spaces */
3256 for( ; (x.bv_val[0] == ' ') && x.bv_len ; x.bv_val++, x.bv_len--) {
3260 sn.bv_val = x.bv_val;
3263 if( sn.bv_val[0] == '-' ) {
3268 for( ; sn.bv_len < x.bv_len; sn.bv_len++ ) {
3269 if ( !ASCII_DIGIT( sn.bv_val[sn.bv_len] )) break;
3272 if (!( sn.bv_len > neg )) return LDAP_INVALID_SYNTAX;
3273 if (( sn.bv_len > 1+neg ) && ( sn.bv_val[neg] == '0' )) {
3274 return LDAP_INVALID_SYNTAX;
3277 x.bv_val += sn.bv_len;
3278 x.bv_len -= sn.bv_len;
3280 } else return LDAP_INVALID_SYNTAX;
3282 /* eat trailing spaces */
3283 for( ; (x.bv_val[0] == ' ') && x.bv_len; x.bv_val++, x.bv_len--) {
3287 /* should have no characters left... */
3288 if( x.bv_len ) return LDAP_INVALID_SYNTAX;
3290 ber_dupbv_x( &ni, &i, ctx );
3293 /* need to handle double dquotes here */
3296 rc = dnNormalize( usage, syntax, mr, &i, &ni, ctx );
3298 if( in->bv_val[0] == '{' && in->bv_val[in->bv_len-1] == '}' ) {
3299 slap_sl_free( i.bv_val, ctx );
3302 if( rc ) return LDAP_INVALID_SYNTAX;
3304 /* make room from sn + "$" */
3305 out->bv_len = STRLENOF( "{ serialNumber , issuer \"\" }" )
3306 + sn.bv_len + ni.bv_len;
3307 out->bv_val = slap_sl_malloc( out->bv_len + 1, ctx );
3309 if( out->bv_val == NULL ) {
3311 slap_sl_free( ni.bv_val, ctx );
3316 AC_MEMCPY( &out->bv_val[n], "{ serialNumber ",
3317 STRLENOF( "{ serialNumber " ));
3318 n = STRLENOF( "{ serialNumber " );
3320 AC_MEMCPY( &out->bv_val[n], sn.bv_val, sn.bv_len );
3323 AC_MEMCPY( &out->bv_val[n], ", issuer \"", STRLENOF( ", issuer \"" ));
3324 n += STRLENOF( ", issuer \"" );
3326 AC_MEMCPY( &out->bv_val[n], ni.bv_val, ni.bv_len );
3329 AC_MEMCPY( &out->bv_val[n], "\" }", STRLENOF( "\" }" ));
3330 n += STRLENOF( "\" }" );
3332 out->bv_val[n] = '\0';
3334 assert( n == out->bv_len );
3336 Debug( LDAP_DEBUG_TRACE, "<<< serialNumberAndIssuerNormalize: <%s>\n",
3337 out->bv_val, 0, 0 );
3339 slap_sl_free( ni.bv_val, ctx );
3341 return LDAP_SUCCESS;
3345 certificateExactNormalize(
3350 struct berval *normalized,
3353 BerElementBuffer berbuf;
3354 BerElement *ber = (BerElement *)&berbuf;
3358 char serialbuf[64], *serial = serialbuf;
3359 ber_len_t seriallen;
3360 struct berval issuer_dn = BER_BVNULL, bvdn;
3362 int rc = LDAP_INVALID_SYNTAX;
3364 if( BER_BVISEMPTY( val ) ) goto done;
3366 if( SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX(usage) ) {
3367 return serialNumberAndIssuerNormalize(0,NULL,NULL,val,normalized,ctx);
3370 assert( SLAP_MR_IS_VALUE_OF_ATTRIBUTE_SYNTAX(usage) != 0 );
3372 ber_init2( ber, val, LBER_USE_DER );
3373 tag = ber_skip_tag( ber, &len ); /* Signed Sequence */
3374 tag = ber_skip_tag( ber, &len ); /* Sequence */
3375 tag = ber_peek_tag( ber, &len ); /* Optional version? */
3376 if ( tag == SLAP_X509_OPT_C_VERSION ) {
3377 tag = ber_skip_tag( ber, &len );
3378 tag = ber_get_int( ber, &i ); /* version */
3381 /* NOTE: move the test here from certificateNormalize,
3382 * so that we can validate certs with serial longer
3383 * than sizeof(ber_int_t) */
3384 tag = ber_peek_tag( ber, &len ); /* serial */
3386 /* Just spit out colon-separated hex octets, like OpenSSL does.
3387 * Don't try to make special cases for multi-precision math
3388 * support here, normalized values need to be canonical and
3389 * consistent from machine to machine.
3391 if ( len > sizeof(ber_int_t) ) {
3395 tag = ber_skip_tag( ber, &len );
3396 ptr = (unsigned char *)ber->ber_ptr;
3397 ber_skip_data( ber, len );
3399 while ( ptr[0] == '\0' && len > 0 ) {
3404 seriallen = len * 3;
3405 if ( seriallen > sizeof( serialbuf ))
3406 serial = slap_sl_malloc( seriallen, ctx );
3408 sprintf( sptr, "%02x", ptr[0] );
3410 for ( i = 1; i<len; i++ ) {
3411 sprintf( sptr, ":%02x", ptr[i] );
3417 tag = ber_get_int( ber, &i ); /* serial */
3418 seriallen = snprintf( serialbuf, sizeof(serialbuf), "%d", i );
3420 tag = ber_skip_tag( ber, &len ); /* SignatureAlg */
3421 ber_skip_data( ber, len );
3422 tag = ber_peek_tag( ber, &len ); /* IssuerDN */
3423 len = ber_ptrlen( ber );
3424 bvdn.bv_val = val->bv_val + len;
3425 bvdn.bv_len = val->bv_len - len;
3427 rc = dnX509normalize( &bvdn, &issuer_dn );
3428 if( rc != LDAP_SUCCESS ) goto done;
3430 normalized->bv_len = STRLENOF( "{ serialNumber , issuer \"\" }" )
3431 + seriallen + issuer_dn.bv_len;
3432 normalized->bv_val = ch_malloc(normalized->bv_len+1);
3434 p = (unsigned char *)normalized->bv_val;
3436 AC_MEMCPY(p, "{ serialNumber ", STRLENOF( "{ serialNumber " ));
3437 p += STRLENOF( "{ serialNumber " );
3439 AC_MEMCPY(p, serial, seriallen);
3442 AC_MEMCPY(p, ", issuer \"", STRLENOF( ", issuer \"" ));
3443 p += STRLENOF( ", issuer \"" );
3445 AC_MEMCPY(p, issuer_dn.bv_val, issuer_dn.bv_len);
3446 p += issuer_dn.bv_len;
3448 AC_MEMCPY(p, "\" }", STRLENOF( "\" }" ));
3449 p += STRLENOF( "\" }" );
3453 Debug( LDAP_DEBUG_TRACE, "certificateExactNormalize: %s\n",
3454 normalized->bv_val, NULL, NULL );
3459 if ( issuer_dn.bv_val ) ber_memfree( issuer_dn.bv_val );
3460 if ( serial != serialbuf ) ber_memfree_x( serial, ctx );
3472 assert( in != NULL );
3473 assert( !BER_BVISNULL( in ) );
3475 for ( i = 0; i < in->bv_len; i++ ) {
3476 if ( !ASCII_HEX( in->bv_val[ i ] ) ) {
3477 return LDAP_INVALID_SYNTAX;
3481 return LDAP_SUCCESS;
3484 /* Normalize a SID as used inside a CSN:
3485 * three-digit numeric string */
3492 struct berval *normalized,
3497 assert( val != NULL );
3498 assert( normalized != NULL );
3500 ber_dupbv_x( normalized, val, ctx );
3502 for ( i = 0; i < normalized->bv_len; i++ ) {
3503 if ( !ASCII_HEX( normalized->bv_val[ i ] ) ) {
3504 ber_memfree_x( normalized->bv_val, ctx );
3505 BER_BVZERO( normalized );
3506 return LDAP_INVALID_SYNTAX;
3509 normalized->bv_val[ i ] = TOLOWER( normalized->bv_val[ i ] );
3512 return LDAP_SUCCESS;
3520 assert( in != NULL );
3521 assert( !BER_BVISNULL( in ) );
3523 if ( in->bv_len != 3 ) {
3524 return LDAP_INVALID_SYNTAX;
3527 return hexValidate( NULL, in );
3530 /* Normalize a SID as used inside a CSN:
3531 * three-digit numeric string */
3538 struct berval *normalized,
3541 if ( val->bv_len != 3 ) {
3542 return LDAP_INVALID_SYNTAX;
3545 return hexNormalize( 0, NULL, NULL, val, normalized, ctx );
3555 return sidNormalize( SLAP_MR_VALUE_OF_SYNTAX, NULL, NULL, val, out, ctx );
3558 /* Normalize a SID as used inside a CSN, either as-is
3559 * (assertion value) or extracted from the CSN
3560 * (attribute value) */
3567 struct berval *normalized,
3575 if ( BER_BVISEMPTY( val ) ) {
3576 return LDAP_INVALID_SYNTAX;
3579 if ( SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX(usage) ) {
3580 return sidNormalize( 0, NULL, NULL, val, normalized, ctx );
3583 assert( SLAP_MR_IS_VALUE_OF_ATTRIBUTE_SYNTAX(usage) != 0 );
3585 ptr = ber_bvchr( val, '#' );
3586 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3587 return LDAP_INVALID_SYNTAX;
3590 bv.bv_val = ptr + 1;
3591 bv.bv_len = val->bv_len - ( ptr + 1 - val->bv_val );
3593 ptr = ber_bvchr( &bv, '#' );
3594 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3595 return LDAP_INVALID_SYNTAX;
3598 bv.bv_val = ptr + 1;
3599 bv.bv_len = val->bv_len - ( ptr + 1 - val->bv_val );
3601 ptr = ber_bvchr( &bv, '#' );
3602 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3603 return LDAP_INVALID_SYNTAX;
3606 bv.bv_len = ptr - bv.bv_val;
3608 if ( bv.bv_len == 2 ) {
3609 /* OpenLDAP 2.3 SID */
3611 buf[ 1 ] = bv.bv_val[ 0 ];
3612 buf[ 2 ] = bv.bv_val[ 1 ];
3619 return sidNormalize( 0, NULL, NULL, &bv, normalized, ctx );
3631 assert( in != NULL );
3632 assert( !BER_BVISNULL( in ) );
3634 if ( BER_BVISEMPTY( in ) ) {
3635 return LDAP_INVALID_SYNTAX;
3640 ptr = ber_bvchr( &bv, '#' );
3641 if ( ptr == NULL || ptr - bv.bv_val == bv.bv_len ) {
3642 return LDAP_INVALID_SYNTAX;
3645 bv.bv_len = ptr - bv.bv_val;
3646 if ( bv.bv_len != STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ" ) &&
3647 bv.bv_len != STRLENOF( "YYYYmmddHHMMSSZ" ) )
3649 return LDAP_INVALID_SYNTAX;
3652 rc = generalizedTimeValidate( NULL, &bv );
3653 if ( rc != LDAP_SUCCESS ) {
3657 bv.bv_val = ptr + 1;
3658 bv.bv_len = in->bv_len - ( bv.bv_val - in->bv_val );
3660 ptr = ber_bvchr( &bv, '#' );
3661 if ( ptr == NULL || ptr - in->bv_val == in->bv_len ) {
3662 return LDAP_INVALID_SYNTAX;
3665 bv.bv_len = ptr - bv.bv_val;
3666 if ( bv.bv_len != 6 ) {
3667 return LDAP_INVALID_SYNTAX;
3670 rc = hexValidate( NULL, &bv );
3671 if ( rc != LDAP_SUCCESS ) {
3675 bv.bv_val = ptr + 1;
3676 bv.bv_len = in->bv_len - ( bv.bv_val - in->bv_val );
3678 ptr = ber_bvchr( &bv, '#' );
3679 if ( ptr == NULL || ptr - in->bv_val == in->bv_len ) {
3680 return LDAP_INVALID_SYNTAX;
3683 bv.bv_len = ptr - bv.bv_val;
3684 if ( bv.bv_len == 2 ) {
3685 /* tolerate old 2-digit replica-id */
3686 rc = hexValidate( NULL, &bv );
3689 rc = sidValidate( NULL, &bv );
3691 if ( rc != LDAP_SUCCESS ) {
3695 bv.bv_val = ptr + 1;
3696 bv.bv_len = in->bv_len - ( bv.bv_val - in->bv_val );
3698 if ( bv.bv_len != 6 ) {
3699 return LDAP_INVALID_SYNTAX;
3702 return hexValidate( NULL, &bv );
3705 /* Normalize a CSN in OpenLDAP 2.3 format */
3712 struct berval *normalized,
3715 struct berval gt, cnt, sid, mod;
3719 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
3720 assert( !BER_BVISEMPTY( val ) );
3724 ptr = ber_bvchr( >, '#' );
3725 if ( ptr == NULL || ptr - gt.bv_val == gt.bv_len ) {
3726 return LDAP_INVALID_SYNTAX;
3729 gt.bv_len = ptr - gt.bv_val;
3730 assert( gt.bv_len == STRLENOF( "YYYYmmddHHMMSSZ" ) );
3732 cnt.bv_val = ptr + 1;
3733 cnt.bv_len = val->bv_len - ( cnt.bv_val - val->bv_val );
3735 ptr = ber_bvchr( &cnt, '#' );
3736 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3737 return LDAP_INVALID_SYNTAX;
3740 cnt.bv_len = ptr - cnt.bv_val;
3741 assert( cnt.bv_len == STRLENOF( "000000" ) );
3743 sid.bv_val = ptr + 1;
3744 sid.bv_len = val->bv_len - ( sid.bv_val - val->bv_val );
3746 ptr = ber_bvchr( &sid, '#' );
3747 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3748 return LDAP_INVALID_SYNTAX;
3751 sid.bv_len = ptr - sid.bv_val;
3752 assert( sid.bv_len == STRLENOF( "00" ) );
3754 mod.bv_val = ptr + 1;
3755 mod.bv_len = val->bv_len - ( mod.bv_val - val->bv_val );
3756 assert( mod.bv_len == STRLENOF( "000000" ) );
3758 normalized->bv_len = STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ#SSSSSS#SID#ssssss" );
3759 normalized->bv_val = ber_memalloc_x( normalized->bv_len + 1, ctx );
3761 ptr = normalized->bv_val;
3762 ptr = lutil_strncopy( ptr, gt.bv_val, gt.bv_len - 1 );
3763 ptr = lutil_strcopy( ptr, ".000000Z#" );
3764 ptr = lutil_strncopy( ptr, cnt.bv_val, cnt.bv_len );
3767 for ( i = 0; i < sid.bv_len; i++ ) {
3768 *ptr++ = TOLOWER( sid.bv_val[ i ] );
3771 for ( i = 0; i < mod.bv_len; i++ ) {
3772 *ptr++ = TOLOWER( mod.bv_val[ i ] );
3776 assert( ptr - normalized->bv_val == normalized->bv_len );
3778 return LDAP_SUCCESS;
3781 /* Normalize a CSN */
3788 struct berval *normalized,
3791 struct berval cnt, sid, mod;
3795 assert( val != NULL );
3796 assert( normalized != NULL );
3798 assert( SLAP_MR_IS_VALUE_OF_SYNTAX( usage ) != 0 );
3800 if ( BER_BVISEMPTY( val ) ) {
3801 return LDAP_INVALID_SYNTAX;
3804 if ( val->bv_len == STRLENOF( "YYYYmmddHHMMSSZ#SSSSSS#ID#ssssss" ) ) {
3805 /* Openldap <= 2.3 */
3807 return csnNormalize23( usage, syntax, mr, val, normalized, ctx );
3810 assert( val->bv_len == STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ#SSSSSS#SID#ssssss" ) );
3812 ptr = ber_bvchr( val, '#' );
3813 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3814 return LDAP_INVALID_SYNTAX;
3817 assert( ptr - val->bv_val == STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ" ) );
3819 cnt.bv_val = ptr + 1;
3820 cnt.bv_len = val->bv_len - ( cnt.bv_val - val->bv_val );
3822 ptr = ber_bvchr( &cnt, '#' );
3823 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3824 return LDAP_INVALID_SYNTAX;
3827 assert( ptr - cnt.bv_val == STRLENOF( "000000" ) );
3829 sid.bv_val = ptr + 1;
3830 sid.bv_len = val->bv_len - ( sid.bv_val - val->bv_val );
3832 ptr = ber_bvchr( &sid, '#' );
3833 if ( ptr == NULL || ptr - val->bv_val == val->bv_len ) {
3834 return LDAP_INVALID_SYNTAX;
3837 sid.bv_len = ptr - sid.bv_val;
3838 assert( sid.bv_len == STRLENOF( "000" ) );
3840 mod.bv_val = ptr + 1;
3841 mod.bv_len = val->bv_len - ( mod.bv_val - val->bv_val );
3843 assert( mod.bv_len == STRLENOF( "000000" ) );
3845 ber_dupbv_x( normalized, val, ctx );
3847 for ( i = STRLENOF( "YYYYmmddHHMMSS.uuuuuuZ#SSSSSS#" );
3848 i < normalized->bv_len; i++ )
3850 /* assume it's already validated that's all hex digits */
3851 normalized->bv_val[ i ] = TOLOWER( normalized->bv_val[ i ] );
3854 return LDAP_SUCCESS;
3864 return csnNormalize( SLAP_MR_VALUE_OF_SYNTAX, NULL, NULL, val, out, ctx );
3867 #ifndef SUPPORT_OBSOLETE_UTC_SYNTAX
3868 /* slight optimization - does not need the start parameter */
3869 #define check_time_syntax(v, start, p, f) (check_time_syntax)(v, p, f)
3874 check_time_syntax (struct berval *val,
3877 struct berval *fraction)
3880 * start=0 GeneralizedTime YYYYmmddHH[MM[SS]][(./,)d...](Z|(+/-)HH[MM])
3881 * start=1 UTCTime YYmmddHHMM[SS][Z|(+/-)HHMM]
3882 * GeneralizedTime supports leap seconds, UTCTime does not.
3884 static const int ceiling[9] = { 100, 100, 12, 31, 24, 60, 60, 24, 60 };
3885 static const int mdays[2][12] = {
3886 /* non-leap years */
3887 { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 },
3889 { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }
3892 int part, c, c1, c2, tzoffset, leapyear = 0;
3895 e = p + val->bv_len;
3897 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
3898 parts[0] = 20; /* century - any multiple of 4 from 04 to 96 */
3900 for (part = start; part < 7 && p < e; part++) {
3902 if (!ASCII_DIGIT(c1)) {
3907 return LDAP_INVALID_SYNTAX;
3910 if (!ASCII_DIGIT(c)) {
3911 return LDAP_INVALID_SYNTAX;
3913 c += c1 * 10 - '0' * 11;
3914 if ((part | 1) == 3) {
3917 return LDAP_INVALID_SYNTAX;
3920 if (c >= ceiling[part]) {
3921 if (! (c == 60 && part == 6 && start == 0))
3922 return LDAP_INVALID_SYNTAX;
3926 if (part < 5 + start) {
3927 return LDAP_INVALID_SYNTAX;
3929 for (; part < 9; part++) {
3933 /* leapyear check for the Gregorian calendar (year>1581) */
3934 if (parts[parts[1] == 0 ? 0 : 1] % 4 == 0) {
3938 if (parts[3] >= mdays[leapyear][parts[2]]) {
3939 return LDAP_INVALID_SYNTAX;
3943 fraction->bv_val = p;
3944 fraction->bv_len = 0;
3945 if (p < e && (*p == '.' || *p == ',')) {
3947 while (++p < e && ASCII_DIGIT(*p)) {
3950 if (p - fraction->bv_val == 1) {
3951 return LDAP_INVALID_SYNTAX;
3953 for (end_num = p; end_num[-1] == '0'; --end_num) {
3956 c = end_num - fraction->bv_val;
3957 if (c != 1) fraction->bv_len = c;
3963 return start == 0 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
3969 return LDAP_INVALID_SYNTAX;
3975 for (part = 7; part < 9 && p < e; part++) {
3977 if (!ASCII_DIGIT(c1)) {
3982 return LDAP_INVALID_SYNTAX;
3985 if (!ASCII_DIGIT(c2)) {
3986 return LDAP_INVALID_SYNTAX;
3988 parts[part] = c1 * 10 + c2 - '0' * 11;
3989 if (parts[part] >= ceiling[part]) {
3990 return LDAP_INVALID_SYNTAX;
3993 if (part < 8 + start) {
3994 return LDAP_INVALID_SYNTAX;
3997 if (tzoffset == '-') {
3998 /* negative offset to UTC, ie west of Greenwich */
3999 parts[4] += parts[7];
4000 parts[5] += parts[8];
4001 /* offset is just hhmm, no seconds */
4002 for (part = 6; --part >= 0; ) {
4006 c = mdays[leapyear][parts[2]];
4008 if (parts[part] >= c) {
4010 return LDAP_INVALID_SYNTAX;
4015 } else if (part != 5) {
4020 /* positive offset to UTC, ie east of Greenwich */
4021 parts[4] -= parts[7];
4022 parts[5] -= parts[8];
4023 for (part = 6; --part >= 0; ) {
4024 if (parts[part] < 0) {
4026 return LDAP_INVALID_SYNTAX;
4031 /* make first arg to % non-negative */
4032 c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
4037 } else if (part != 5) {
4044 return p != e ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
4047 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
4054 struct berval *normalized )
4058 rc = check_time_syntax(val, 1, parts, NULL);
4059 if (rc != LDAP_SUCCESS) {
4063 normalized->bv_val = ch_malloc( 14 );
4064 if ( normalized->bv_val == NULL ) {
4065 return LBER_ERROR_MEMORY;
4068 sprintf( normalized->bv_val, "%02d%02d%02d%02d%02d%02dZ",
4069 parts[1], parts[2] + 1, parts[3] + 1,
4070 parts[4], parts[5], parts[6] );
4071 normalized->bv_len = 13;
4073 return LDAP_SUCCESS;
4083 return check_time_syntax(in, 1, parts, NULL);
4086 #endif /* SUPPORT_OBSOLETE_UTC_SYNTAX */
4089 generalizedTimeValidate(
4094 struct berval fraction;
4095 return check_time_syntax(in, 0, parts, &fraction);
4099 generalizedTimeNormalize(
4104 struct berval *normalized,
4109 struct berval fraction;
4111 rc = check_time_syntax(val, 0, parts, &fraction);
4112 if (rc != LDAP_SUCCESS) {
4116 len = STRLENOF("YYYYmmddHHMMSSZ") + fraction.bv_len;
4117 normalized->bv_val = slap_sl_malloc( len + 1, ctx );
4118 if ( BER_BVISNULL( normalized ) ) {
4119 return LBER_ERROR_MEMORY;
4122 sprintf( normalized->bv_val, "%02d%02d%02d%02d%02d%02d%02d",
4123 parts[0], parts[1], parts[2] + 1, parts[3] + 1,
4124 parts[4], parts[5], parts[6] );
4125 if ( !BER_BVISEMPTY( &fraction ) ) {
4126 memcpy( normalized->bv_val + STRLENOF("YYYYmmddHHMMSSZ")-1,
4127 fraction.bv_val, fraction.bv_len );
4128 normalized->bv_val[STRLENOF("YYYYmmddHHMMSSZ")-1] = '.';
4130 strcpy( normalized->bv_val + len-1, "Z" );
4131 normalized->bv_len = len;
4133 return LDAP_SUCCESS;
4137 generalizedTimeOrderingMatch(
4142 struct berval *value,
4143 void *assertedValue )
4145 struct berval *asserted = (struct berval *) assertedValue;
4146 ber_len_t v_len = value->bv_len;
4147 ber_len_t av_len = asserted->bv_len;
4149 /* ignore trailing 'Z' when comparing */
4150 int match = memcmp( value->bv_val, asserted->bv_val,
4151 (v_len < av_len ? v_len : av_len) - 1 );
4152 if ( match == 0 ) match = v_len - av_len;
4155 return LDAP_SUCCESS;
4158 /* Index generation function */
4159 int generalizedTimeIndexer(
4164 struct berval *prefix,
4172 BerValue bvtmp; /* 40 bit index */
4174 struct lutil_timet tt;
4176 bvtmp.bv_len = sizeof(tmp);
4178 for( i=0; values[i].bv_val != NULL; i++ ) {
4179 /* just count them */
4182 /* we should have at least one value at this point */
4185 keys = slap_sl_malloc( sizeof( struct berval ) * (i+1), ctx );
4187 /* GeneralizedTime YYYYmmddHH[MM[SS]][(./,)d...](Z|(+/-)HH[MM]) */
4188 for( i=0, j=0; values[i].bv_val != NULL; i++ ) {
4189 assert(values[i].bv_val != NULL && values[i].bv_len >= 10);
4190 /* Use 40 bits of time for key */
4191 if ( lutil_parsetime( values[i].bv_val, &tm ) == 0 ) {
4192 lutil_tm2time( &tm, &tt );
4193 tmp[0] = tt.tt_gsec & 0xff;
4194 tmp[4] = tt.tt_sec & 0xff;
4196 tmp[3] = tt.tt_sec & 0xff;
4198 tmp[2] = tt.tt_sec & 0xff;
4200 tmp[1] = tt.tt_sec & 0xff;
4202 ber_dupbv_x(&keys[j++], &bvtmp, ctx );
4206 keys[j].bv_val = NULL;
4211 return LDAP_SUCCESS;
4214 /* Index generation function */
4215 int generalizedTimeFilter(
4220 struct berval *prefix,
4221 void * assertedValue,
4227 BerValue bvtmp; /* 40 bit index */
4228 BerValue *value = (BerValue *) assertedValue;
4230 struct lutil_timet tt;
4232 bvtmp.bv_len = sizeof(tmp);
4234 /* GeneralizedTime YYYYmmddHH[MM[SS]][(./,)d...](Z|(+/-)HH[MM]) */
4235 /* Use 40 bits of time for key */
4236 if ( value->bv_val && value->bv_len >= 10 &&
4237 lutil_parsetime( value->bv_val, &tm ) == 0 ) {
4239 lutil_tm2time( &tm, &tt );
4240 tmp[0] = tt.tt_gsec & 0xff;
4241 tmp[4] = tt.tt_sec & 0xff;
4243 tmp[3] = tt.tt_sec & 0xff;
4245 tmp[2] = tt.tt_sec & 0xff;
4247 tmp[1] = tt.tt_sec & 0xff;
4249 keys = slap_sl_malloc( sizeof( struct berval ) * 2, ctx );
4250 ber_dupbv_x(keys, &bvtmp, ctx );
4251 keys[1].bv_val = NULL;
4259 return LDAP_SUCCESS;
4263 deliveryMethodValidate(
4265 struct berval *val )
4268 #define LENOF(s) (sizeof(s)-1)
4269 struct berval tmp = *val;
4271 * DeliveryMethod = pdm *( WSP DOLLAR WSP DeliveryMethod )
4272 * pdm = "any" / "mhs" / "physical" / "telex" / "teletex" /
4273 * "g3fax" / "g4fax" / "ia5" / "videotex" / "telephone"
4276 if( tmp.bv_len < 3 ) return LDAP_INVALID_SYNTAX;
4278 switch( tmp.bv_val[0] ) {
4281 if(( tmp.bv_len >= LENOF("any") ) &&
4282 ( strncasecmp(tmp.bv_val, "any", LENOF("any")) == 0 ))
4284 tmp.bv_len -= LENOF("any");
4285 tmp.bv_val += LENOF("any");
4288 return LDAP_INVALID_SYNTAX;
4292 if(( tmp.bv_len >= LENOF("mhs") ) &&
4293 ( strncasecmp(tmp.bv_val, "mhs", LENOF("mhs")) == 0 ))
4295 tmp.bv_len -= LENOF("mhs");
4296 tmp.bv_val += LENOF("mhs");
4299 return LDAP_INVALID_SYNTAX;
4303 if(( tmp.bv_len >= LENOF("physical") ) &&
4304 ( strncasecmp(tmp.bv_val, "physical", LENOF("physical")) == 0 ))
4306 tmp.bv_len -= LENOF("physical");
4307 tmp.bv_val += LENOF("physical");
4310 return LDAP_INVALID_SYNTAX;
4313 case 'T': /* telex or teletex or telephone */
4314 if(( tmp.bv_len >= LENOF("telex") ) &&
4315 ( strncasecmp(tmp.bv_val, "telex", LENOF("telex")) == 0 ))
4317 tmp.bv_len -= LENOF("telex");
4318 tmp.bv_val += LENOF("telex");
4321 if(( tmp.bv_len >= LENOF("teletex") ) &&
4322 ( strncasecmp(tmp.bv_val, "teletex", LENOF("teletex")) == 0 ))
4324 tmp.bv_len -= LENOF("teletex");
4325 tmp.bv_val += LENOF("teletex");
4328 if(( tmp.bv_len >= LENOF("telephone") ) &&
4329 ( strncasecmp(tmp.bv_val, "telephone", LENOF("telephone")) == 0 ))
4331 tmp.bv_len -= LENOF("telephone");
4332 tmp.bv_val += LENOF("telephone");
4335 return LDAP_INVALID_SYNTAX;
4338 case 'G': /* g3fax or g4fax */
4339 if(( tmp.bv_len >= LENOF("g3fax") ) && (
4340 ( strncasecmp(tmp.bv_val, "g3fax", LENOF("g3fax")) == 0 ) ||
4341 ( strncasecmp(tmp.bv_val, "g4fax", LENOF("g4fax")) == 0 )))
4343 tmp.bv_len -= LENOF("g3fax");
4344 tmp.bv_val += LENOF("g3fax");
4347 return LDAP_INVALID_SYNTAX;
4351 if(( tmp.bv_len >= LENOF("ia5") ) &&
4352 ( strncasecmp(tmp.bv_val, "ia5", LENOF("ia5")) == 0 ))
4354 tmp.bv_len -= LENOF("ia5");
4355 tmp.bv_val += LENOF("ia5");
4358 return LDAP_INVALID_SYNTAX;
4362 if(( tmp.bv_len >= LENOF("videotex") ) &&
4363 ( strncasecmp(tmp.bv_val, "videotex", LENOF("videotex")) == 0 ))
4365 tmp.bv_len -= LENOF("videotex");
4366 tmp.bv_val += LENOF("videotex");
4369 return LDAP_INVALID_SYNTAX;
4372 return LDAP_INVALID_SYNTAX;
4375 if( BER_BVISEMPTY( &tmp ) ) return LDAP_SUCCESS;
4377 while( !BER_BVISEMPTY( &tmp ) && ( tmp.bv_val[0] == ' ' ) ) {
4381 if( !BER_BVISEMPTY( &tmp ) && ( tmp.bv_val[0] == '$' ) ) {
4385 return LDAP_INVALID_SYNTAX;
4387 while( !BER_BVISEMPTY( &tmp ) && ( tmp.bv_val[0] == ' ' ) ) {
4396 nisNetgroupTripleValidate(
4398 struct berval *val )
4403 if ( BER_BVISEMPTY( val ) ) {
4404 return LDAP_INVALID_SYNTAX;
4407 p = (char *)val->bv_val;
4408 e = p + val->bv_len;
4410 if ( *p != '(' /*')'*/ ) {
4411 return LDAP_INVALID_SYNTAX;
4414 for ( p++; ( p < e ) && ( *p != /*'('*/ ')' ); p++ ) {
4418 return LDAP_INVALID_SYNTAX;
4421 } else if ( !AD_CHAR( *p ) ) {
4422 return LDAP_INVALID_SYNTAX;
4426 if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
4427 return LDAP_INVALID_SYNTAX;
4433 return LDAP_INVALID_SYNTAX;
4436 return LDAP_SUCCESS;
4440 bootParameterValidate(
4442 struct berval *val )
4446 if ( BER_BVISEMPTY( val ) ) {
4447 return LDAP_INVALID_SYNTAX;
4450 p = (char *)val->bv_val;
4451 e = p + val->bv_len;
4454 for (; ( p < e ) && ( *p != '=' ); p++ ) {
4455 if ( !AD_CHAR( *p ) ) {
4456 return LDAP_INVALID_SYNTAX;
4461 return LDAP_INVALID_SYNTAX;
4465 for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
4466 if ( !AD_CHAR( *p ) ) {
4467 return LDAP_INVALID_SYNTAX;
4472 return LDAP_INVALID_SYNTAX;
4476 for ( p++; p < e; p++ ) {
4477 if ( !SLAP_PRINTABLE( *p ) ) {
4478 return LDAP_INVALID_SYNTAX;
4482 return LDAP_SUCCESS;
4486 firstComponentNormalize(
4491 struct berval *normalized,
4498 if( SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX( usage )) {
4499 ber_dupbv_x( normalized, val, ctx );
4500 return LDAP_SUCCESS;
4503 if( val->bv_len < 3 ) return LDAP_INVALID_SYNTAX;
4505 if( val->bv_val[0] != '(' /*')'*/ &&
4506 val->bv_val[0] != '{' /*'}'*/ )
4508 return LDAP_INVALID_SYNTAX;
4511 /* trim leading white space */
4513 len < val->bv_len && ASCII_SPACE(val->bv_val[len]);
4519 /* grab next word */
4520 comp.bv_val = &val->bv_val[len];
4521 len = val->bv_len - len;
4522 for( comp.bv_len = 0;
4523 !ASCII_SPACE(comp.bv_val[comp.bv_len]) && comp.bv_len < len;
4529 if( mr == slap_schema.si_mr_objectIdentifierFirstComponentMatch ) {
4530 rc = numericoidValidate( NULL, &comp );
4531 } else if( mr == slap_schema.si_mr_integerFirstComponentMatch ) {
4532 rc = integerValidate( NULL, &comp );
4534 rc = LDAP_INVALID_SYNTAX;
4538 if( rc == LDAP_SUCCESS ) {
4539 ber_dupbv_x( normalized, &comp, ctx );
4545 static char *country_gen_syn[] = {
4546 "1.3.6.1.4.1.1466.115.121.1.15",
4547 "1.3.6.1.4.1.1466.115.121.1.26",
4548 "1.3.6.1.4.1.1466.115.121.1.44",
4552 #define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
4553 #define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
4555 static slap_syntax_defs_rec syntax_defs[] = {
4556 {"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' "
4557 X_BINARY X_NOT_H_R ")",
4558 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
4559 {"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
4560 0, NULL, NULL, NULL},
4561 {"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
4562 0, NULL, NULL, NULL},
4563 {"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' "
4565 SLAP_SYNTAX_BLOB, NULL, blobValidate, NULL},
4566 {"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' "
4568 SLAP_SYNTAX_BER, NULL, berValidate, NULL},
4569 {"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
4570 0, NULL, bitStringValidate, NULL },
4571 {"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
4572 0, NULL, booleanValidate, NULL},
4573 {"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
4574 X_BINARY X_NOT_H_R ")",
4575 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER,
4576 NULL, certificateValidate, NULL},
4577 {"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
4578 X_BINARY X_NOT_H_R ")",
4579 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER,
4580 NULL, certificateListValidate, NULL},
4581 {"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
4582 X_BINARY X_NOT_H_R ")",
4583 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER,
4584 NULL, sequenceValidate, NULL},
4585 #if 0 /* need to go __after__ printableString */
4586 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
4587 0, "1.3.6.1.4.1.1466.115.121.1.44",
4588 countryStringValidate, NULL},
4590 {"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
4591 0, NULL, dnValidate, dnPretty},
4592 {"( 1.2.36.79672281.1.5.0 DESC 'RDN' )",
4593 0, NULL, rdnValidate, rdnPretty},
4594 #ifdef LDAP_COMP_MATCH
4595 {"( 1.2.36.79672281.1.5.3 DESC 'allComponents' )",
4596 0, NULL, allComponentsValidate, NULL},
4597 {"( 1.2.36.79672281.1.5.2 DESC 'componentFilterMatch assertion') ",
4598 0, NULL, componentFilterValidate, NULL},
4600 {"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
4601 0, NULL, NULL, NULL},
4602 {"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
4603 0, NULL, deliveryMethodValidate, NULL},
4604 {"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
4605 0, NULL, UTF8StringValidate, NULL},
4606 {"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
4607 0, NULL, NULL, NULL},
4608 {"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
4609 0, NULL, NULL, NULL},
4610 {"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
4611 0, NULL, NULL, NULL},
4612 {"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
4613 0, NULL, NULL, NULL},
4614 {"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
4615 0, NULL, NULL, NULL},
4616 {"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
4617 0, NULL, printablesStringValidate, NULL},
4618 {"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
4619 SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
4620 {"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
4621 0, NULL, generalizedTimeValidate, NULL},
4622 {"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
4623 0, NULL, NULL, NULL},
4624 {"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
4625 0, NULL, IA5StringValidate, NULL},
4626 {"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
4627 0, NULL, integerValidate, NULL},
4628 {"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
4629 SLAP_SYNTAX_BLOB, NULL, blobValidate, NULL},
4630 {"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
4631 0, NULL, NULL, NULL},
4632 {"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
4633 0, NULL, NULL, NULL},
4634 {"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
4635 0, NULL, NULL, NULL},
4636 {"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
4637 0, NULL, NULL, NULL},
4638 {"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
4639 0, NULL, NULL, NULL},
4640 {"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
4641 0, NULL, nameUIDValidate, nameUIDPretty },
4642 {"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
4643 0, NULL, NULL, NULL},
4644 {"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
4645 0, NULL, numericStringValidate, NULL},
4646 {"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
4647 0, NULL, NULL, NULL},
4648 {"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
4649 0, NULL, numericoidValidate, NULL},
4650 {"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
4651 0, NULL, IA5StringValidate, NULL},
4652 {"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
4653 0, NULL, blobValidate, NULL},
4654 {"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
4655 0, NULL, UTF8StringValidate, NULL},
4656 {"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
4657 0, NULL, NULL, NULL},
4658 {"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
4659 0, NULL, NULL, NULL},
4660 {"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
4661 0, NULL, printableStringValidate, NULL},
4662 /* moved here because now depends on Directory String, IA5 String
4663 * and Printable String */
4664 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
4665 0, country_gen_syn, countryStringValidate, NULL},
4666 {"( 1.3.6.1.4.1.1466.115.121.1.45 DESC 'SubtreeSpecification' )",
4667 #define subtreeSpecificationValidate UTF8StringValidate /* FIXME */
4668 0, NULL, subtreeSpecificationValidate, NULL},
4669 {"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
4670 X_BINARY X_NOT_H_R ")",
4671 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, berValidate, NULL},
4672 {"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
4673 0, NULL, printableStringValidate, NULL},
4674 {"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
4675 0, NULL, NULL, NULL},
4676 {"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
4677 0, NULL, printablesStringValidate, NULL},
4678 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
4679 {"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
4680 0, NULL, utcTimeValidate, NULL},
4682 {"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
4683 0, NULL, NULL, NULL},
4684 {"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
4685 0, NULL, NULL, NULL},
4686 {"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
4687 0, NULL, NULL, NULL},
4688 {"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
4689 0, NULL, NULL, NULL},
4690 {"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
4691 0, NULL, NULL, NULL},
4693 /* RFC 2307 NIS Syntaxes */
4694 {"( 1.3.6.1.1.1.0.0 DESC 'RFC2307 NIS Netgroup Triple' )",
4695 0, NULL, nisNetgroupTripleValidate, NULL},
4696 {"( 1.3.6.1.1.1.0.1 DESC 'RFC2307 Boot Parameter' )",
4697 0, NULL, bootParameterValidate, NULL},
4699 /* draft-zeilenga-ldap-x509 */
4700 {"( 1.3.6.1.1.15.1 DESC 'Certificate Exact Assertion' )",
4701 SLAP_SYNTAX_HIDE, NULL,
4702 serialNumberAndIssuerValidate,
4703 serialNumberAndIssuerPretty},
4704 {"( 1.3.6.1.1.15.2 DESC 'Certificate Assertion' )",
4705 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4706 {"( 1.3.6.1.1.15.3 DESC 'Certificate Pair Exact Assertion' )",
4707 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4708 {"( 1.3.6.1.1.15.4 DESC 'Certificate Pair Assertion' )",
4709 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4710 {"( 1.3.6.1.1.15.5 DESC 'Certificate List Exact Assertion' )",
4711 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4712 {"( 1.3.6.1.1.15.6 DESC 'Certificate List Assertion' )",
4713 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4714 {"( 1.3.6.1.1.15.7 DESC 'Algorithm Identifier' )",
4715 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4717 #ifdef SLAPD_AUTHPASSWD
4718 /* needs updating */
4719 {"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
4720 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4723 {"( 1.3.6.1.1.16.1 DESC 'UUID' )",
4724 0, NULL, UUIDValidate, UUIDPretty},
4726 {"( 1.3.6.1.4.1.4203.666.11.2.1 DESC 'CSN' )",
4727 SLAP_SYNTAX_HIDE, NULL, csnValidate, csnPretty },
4729 {"( 1.3.6.1.4.1.4203.666.11.2.4 DESC 'CSN SID' )",
4730 SLAP_SYNTAX_HIDE, NULL, sidValidate, sidPretty },
4732 /* OpenLDAP Void Syntax */
4733 {"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' )" ,
4734 SLAP_SYNTAX_HIDE, NULL, inValidate, NULL},
4736 /* FIXME: OID is unused, but not registered yet */
4737 {"( 1.3.6.1.4.1.4203.666.2.7 DESC 'OpenLDAP authz' )",
4738 SLAP_SYNTAX_HIDE, NULL, authzValidate, authzPretty},
4740 {NULL, 0, NULL, NULL, NULL}
4743 char *csnSIDMatchSyntaxes[] = {
4744 "1.3.6.1.4.1.4203.666.11.2.1" /* csn */,
4747 char *certificateExactMatchSyntaxes[] = {
4748 "1.3.6.1.4.1.1466.115.121.1.8" /* certificate */,
4751 #ifdef LDAP_COMP_MATCH
4752 char *componentFilterMatchSyntaxes[] = {
4753 "1.3.6.1.4.1.1466.115.121.1.8" /* certificate */,
4757 char *directoryStringSyntaxes[] = {
4758 "1.3.6.1.4.1.1466.115.121.1.44" /* printableString */,
4761 char *integerFirstComponentMatchSyntaxes[] = {
4762 "1.3.6.1.4.1.1466.115.121.1.27" /* INTEGER */,
4763 "1.3.6.1.4.1.1466.115.121.1.17" /* dITStructureRuleDescription */,
4766 char *objectIdentifierFirstComponentMatchSyntaxes[] = {
4767 "1.3.6.1.4.1.1466.115.121.1.38" /* OID */,
4768 "1.3.6.1.4.1.1466.115.121.1.3" /* attributeTypeDescription */,
4769 "1.3.6.1.4.1.1466.115.121.1.16" /* dITContentRuleDescription */,
4770 "1.3.6.1.4.1.1466.115.121.1.54" /* ldapSyntaxDescription */,
4771 "1.3.6.1.4.1.1466.115.121.1.30" /* matchingRuleDescription */,
4772 "1.3.6.1.4.1.1466.115.121.1.31" /* matchingRuleUseDescription */,
4773 "1.3.6.1.4.1.1466.115.121.1.35" /* nameFormDescription */,
4774 "1.3.6.1.4.1.1466.115.121.1.37" /* objectClassDescription */,
4779 * Other matching rules in X.520 that we do not use (yet):
4781 * 2.5.13.25 uTCTimeMatch
4782 * 2.5.13.26 uTCTimeOrderingMatch
4783 * 2.5.13.31* directoryStringFirstComponentMatch
4784 * 2.5.13.32* wordMatch
4785 * 2.5.13.33* keywordMatch
4786 * 2.5.13.36+ certificatePairExactMatch
4787 * 2.5.13.37+ certificatePairMatch
4788 * 2.5.13.38+ certificateListExactMatch
4789 * 2.5.13.39+ certificateListMatch
4790 * 2.5.13.40+ algorithmIdentifierMatch
4791 * 2.5.13.41* storedPrefixMatch
4792 * 2.5.13.42 attributeCertificateMatch
4793 * 2.5.13.43 readerAndKeyIDMatch
4794 * 2.5.13.44 attributeIntegrityMatch
4796 * (*) described in RFC 3698 (LDAP: Additional Matching Rules)
4797 * (+) described in draft-zeilenga-ldap-x509
4799 static slap_mrule_defs_rec mrule_defs[] = {
4801 * EQUALITY matching rules must be listed after associated APPROX
4802 * matching rules. So, we list all APPROX matching rules first.
4804 {"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
4805 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4806 SLAP_MR_HIDE | SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT, NULL,
4807 NULL, NULL, directoryStringApproxMatch,
4808 directoryStringApproxIndexer, directoryStringApproxFilter,
4811 {"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
4812 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4813 SLAP_MR_HIDE | SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT, NULL,
4814 NULL, NULL, IA5StringApproxMatch,
4815 IA5StringApproxIndexer, IA5StringApproxFilter,
4819 * Other matching rules
4822 {"( 2.5.13.0 NAME 'objectIdentifierMatch' "
4823 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4824 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4825 NULL, NULL, octetStringMatch,
4826 octetStringIndexer, octetStringFilter,
4829 {"( 2.5.13.1 NAME 'distinguishedNameMatch' "
4830 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4831 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4832 NULL, dnNormalize, dnMatch,
4833 octetStringIndexer, octetStringFilter,
4836 {"( 1.3.6.1.4.1.4203.666.4.9 NAME 'dnSubtreeMatch' "
4837 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4838 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4839 NULL, dnNormalize, dnRelativeMatch,
4843 {"( 1.3.6.1.4.1.4203.666.4.8 NAME 'dnOneLevelMatch' "
4844 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4845 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4846 NULL, dnNormalize, dnRelativeMatch,
4850 {"( 1.3.6.1.4.1.4203.666.4.10 NAME 'dnSubordinateMatch' "
4851 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4852 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4853 NULL, dnNormalize, dnRelativeMatch,
4857 {"( 1.3.6.1.4.1.4203.666.4.11 NAME 'dnSuperiorMatch' "
4858 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4859 SLAP_MR_HIDE | SLAP_MR_EXT, NULL,
4860 NULL, dnNormalize, dnRelativeMatch,
4864 {"( 1.2.36.79672281.1.13.3 NAME 'rdnMatch' "
4865 "SYNTAX 1.2.36.79672281.1.5.0 )",
4866 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4867 NULL, rdnNormalize, rdnMatch,
4868 octetStringIndexer, octetStringFilter,
4871 #ifdef LDAP_COMP_MATCH
4872 {"( 1.2.36.79672281.1.13.2 NAME 'componentFilterMatch' "
4873 "SYNTAX 1.2.36.79672281.1.5.2 )",
4874 SLAP_MR_EXT|SLAP_MR_COMPONENT, componentFilterMatchSyntaxes,
4875 NULL, NULL , componentFilterMatch,
4876 octetStringIndexer, octetStringFilter,
4879 {"( 1.2.36.79672281.1.13.6 NAME 'allComponentsMatch' "
4880 "SYNTAX 1.2.36.79672281.1.5.3 )",
4881 SLAP_MR_EQUALITY|SLAP_MR_EXT|SLAP_MR_COMPONENT, NULL,
4882 NULL, NULL , allComponentsMatch,
4883 octetStringIndexer, octetStringFilter,
4886 {"( 1.2.36.79672281.1.13.7 NAME 'directoryComponentsMatch' "
4887 "SYNTAX 1.2.36.79672281.1.5.3 )",
4888 SLAP_MR_EQUALITY|SLAP_MR_EXT|SLAP_MR_COMPONENT, NULL,
4889 NULL, NULL , directoryComponentsMatch,
4890 octetStringIndexer, octetStringFilter,
4894 {"( 2.5.13.2 NAME 'caseIgnoreMatch' "
4895 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4896 SLAP_MR_EQUALITY | SLAP_MR_EXT, directoryStringSyntaxes,
4897 NULL, UTF8StringNormalize, octetStringMatch,
4898 octetStringIndexer, octetStringFilter,
4899 directoryStringApproxMatchOID },
4901 {"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
4902 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4903 SLAP_MR_ORDERING, directoryStringSyntaxes,
4904 NULL, UTF8StringNormalize, octetStringOrderingMatch,
4906 "caseIgnoreMatch" },
4908 {"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
4909 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4910 SLAP_MR_SUBSTR, directoryStringSyntaxes,
4911 NULL, UTF8StringNormalize, directoryStringSubstringsMatch,
4912 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4913 "caseIgnoreMatch" },
4915 {"( 2.5.13.5 NAME 'caseExactMatch' "
4916 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4917 SLAP_MR_EQUALITY | SLAP_MR_EXT, directoryStringSyntaxes,
4918 NULL, UTF8StringNormalize, octetStringMatch,
4919 octetStringIndexer, octetStringFilter,
4920 directoryStringApproxMatchOID },
4922 {"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
4923 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4924 SLAP_MR_ORDERING, directoryStringSyntaxes,
4925 NULL, UTF8StringNormalize, octetStringOrderingMatch,
4929 {"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
4930 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4931 SLAP_MR_SUBSTR, directoryStringSyntaxes,
4932 NULL, UTF8StringNormalize, directoryStringSubstringsMatch,
4933 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4936 {"( 2.5.13.8 NAME 'numericStringMatch' "
4937 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
4938 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4939 NULL, numericStringNormalize, octetStringMatch,
4940 octetStringIndexer, octetStringFilter,
4943 {"( 2.5.13.9 NAME 'numericStringOrderingMatch' "
4944 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
4945 SLAP_MR_ORDERING, NULL,
4946 NULL, numericStringNormalize, octetStringOrderingMatch,
4948 "numericStringMatch" },
4950 {"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
4951 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4952 SLAP_MR_SUBSTR, NULL,
4953 NULL, numericStringNormalize, octetStringSubstringsMatch,
4954 octetStringSubstringsIndexer, octetStringSubstringsFilter,
4955 "numericStringMatch" },
4957 {"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
4958 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
4959 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4960 NULL, NULL, NULL, NULL, NULL, NULL },
4962 {"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
4963 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4964 SLAP_MR_SUBSTR, NULL,
4965 NULL, NULL, NULL, NULL, NULL,
4966 "caseIgnoreListMatch" },
4968 {"( 2.5.13.13 NAME 'booleanMatch' "
4969 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
4970 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4971 NULL, NULL, booleanMatch,
4972 octetStringIndexer, octetStringFilter,
4975 {"( 2.5.13.14 NAME 'integerMatch' "
4976 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4977 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4978 NULL, NULL, integerMatch,
4979 octetStringIndexer, octetStringFilter,
4982 {"( 2.5.13.15 NAME 'integerOrderingMatch' "
4983 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4984 SLAP_MR_ORDERING, NULL,
4985 NULL, NULL, integerMatch,
4989 {"( 2.5.13.16 NAME 'bitStringMatch' "
4990 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
4991 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4992 NULL, NULL, octetStringMatch,
4993 octetStringIndexer, octetStringFilter,
4996 {"( 2.5.13.17 NAME 'octetStringMatch' "
4997 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4998 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
4999 NULL, NULL, octetStringMatch,
5000 octetStringIndexer, octetStringFilter,
5003 {"( 2.5.13.18 NAME 'octetStringOrderingMatch' "
5004 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
5005 SLAP_MR_ORDERING, NULL,
5006 NULL, NULL, octetStringOrderingMatch,
5008 "octetStringMatch" },
5010 {"( 2.5.13.19 NAME 'octetStringSubstringsMatch' "
5011 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
5012 SLAP_MR_SUBSTR, NULL,
5013 NULL, NULL, octetStringSubstringsMatch,
5014 octetStringSubstringsIndexer, octetStringSubstringsFilter,
5015 "octetStringMatch" },
5017 {"( 2.5.13.20 NAME 'telephoneNumberMatch' "
5018 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
5019 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
5021 telephoneNumberNormalize, octetStringMatch,
5022 octetStringIndexer, octetStringFilter,
5025 {"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
5026 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
5027 SLAP_MR_SUBSTR, NULL,
5028 NULL, telephoneNumberNormalize, octetStringSubstringsMatch,
5029 octetStringSubstringsIndexer, octetStringSubstringsFilter,
5030 "telephoneNumberMatch" },
5032 {"( 2.5.13.22 NAME 'presentationAddressMatch' "
5033 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
5034 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
5035 NULL, NULL, NULL, NULL, NULL, NULL },
5037 {"( 2.5.13.23 NAME 'uniqueMemberMatch' "
5038 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
5039 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
5040 NULL, uniqueMemberNormalize, uniqueMemberMatch,
5041 uniqueMemberIndexer, uniqueMemberFilter,
5044 {"( 2.5.13.24 NAME 'protocolInformationMatch' "
5045 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
5046 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
5047 NULL, NULL, NULL, NULL, NULL, NULL },
5049 {"( 2.5.13.27 NAME 'generalizedTimeMatch' "
5050 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
5051 SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_ORDERED_INDEX, NULL,
5052 NULL, generalizedTimeNormalize, octetStringMatch,
5053 generalizedTimeIndexer, generalizedTimeFilter,
5056 {"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
5057 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
5058 SLAP_MR_ORDERING | SLAP_MR_ORDERED_INDEX, NULL,
5059 NULL, generalizedTimeNormalize, generalizedTimeOrderingMatch,
5061 "generalizedTimeMatch" },
5063 {"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
5064 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
5065 SLAP_MR_EQUALITY | SLAP_MR_EXT,
5066 integerFirstComponentMatchSyntaxes,
5067 NULL, firstComponentNormalize, integerMatch,
5068 octetStringIndexer, octetStringFilter,
5071 {"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
5072 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
5073 SLAP_MR_EQUALITY | SLAP_MR_EXT,
5074 objectIdentifierFirstComponentMatchSyntaxes,
5075 NULL, firstComponentNormalize, octetStringMatch,
5076 octetStringIndexer, octetStringFilter,
5079 {"( 2.5.13.34 NAME 'certificateExactMatch' "
5080 "SYNTAX 1.3.6.1.1.15.1 )",
5081 SLAP_MR_EQUALITY | SLAP_MR_EXT, certificateExactMatchSyntaxes,
5082 NULL, certificateExactNormalize, octetStringMatch,
5083 octetStringIndexer, octetStringFilter,
5086 {"( 2.5.13.35 NAME 'certificateMatch' "
5087 "SYNTAX 1.3.6.1.1.15.2 )",
5088 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
5089 NULL, NULL, NULL, NULL, NULL,
5092 {"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
5093 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
5094 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
5095 NULL, IA5StringNormalize, octetStringMatch,
5096 octetStringIndexer, octetStringFilter,
5097 IA5StringApproxMatchOID },
5099 {"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
5100 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
5101 SLAP_MR_EQUALITY | SLAP_MR_EXT, NULL,
5102 NULL, IA5StringNormalize, octetStringMatch,
5103 octetStringIndexer, octetStringFilter,
5104 IA5StringApproxMatchOID },
5106 {"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
5107 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
5108 SLAP_MR_SUBSTR, NULL,
5109 NULL, IA5StringNormalize, directoryStringSubstringsMatch,
5110 octetStringSubstringsIndexer, octetStringSubstringsFilter,
5111 "caseIgnoreIA5Match" },
5113 {"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
5114 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
5115 SLAP_MR_SUBSTR, NULL,
5116 NULL, IA5StringNormalize, directoryStringSubstringsMatch,
5117 octetStringSubstringsIndexer, octetStringSubstringsFilter,
5118 "caseExactIA5Match" },
5120 #ifdef SLAPD_AUTHPASSWD
5121 /* needs updating */
5122 {"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
5123 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
5124 SLAP_MR_HIDE | SLAP_MR_EQUALITY, NULL,
5125 NULL, NULL, authPasswordMatch,
5130 {"( 1.2.840.113556.1.4.803 NAME 'integerBitAndMatch' "
5131 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
5133 NULL, NULL, integerBitAndMatch,
5137 {"( 1.2.840.113556.1.4.804 NAME 'integerBitOrMatch' "
5138 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
5140 NULL, NULL, integerBitOrMatch,
5144 {"( 1.3.6.1.1.16.2 NAME 'UUIDMatch' "
5145 "SYNTAX 1.3.6.1.1.16.1 )",
5146 SLAP_MR_EQUALITY | SLAP_MR_MUTATION_NORMALIZER, NULL,
5147 NULL, UUIDNormalize, octetStringMatch,
5148 octetStringIndexer, octetStringFilter,
5151 {"( 1.3.6.1.1.16.3 NAME 'UUIDOrderingMatch' "
5152 "SYNTAX 1.3.6.1.1.16.1 )",
5153 SLAP_MR_ORDERING | SLAP_MR_MUTATION_NORMALIZER, NULL,
5154 NULL, UUIDNormalize, octetStringOrderingMatch,
5155 octetStringIndexer, octetStringFilter,
5158 {"( 1.3.6.1.4.1.4203.666.11.2.2 NAME 'CSNMatch' "
5159 "SYNTAX 1.3.6.1.4.1.4203.666.11.2.1 )",
5160 SLAP_MR_HIDE | SLAP_MR_EQUALITY | SLAP_MR_ORDERED_INDEX, NULL,
5161 NULL, csnNormalize, csnMatch,
5162 csnIndexer, csnFilter,
5165 {"( 1.3.6.1.4.1.4203.666.11.2.3 NAME 'CSNOrderingMatch' "
5166 "SYNTAX 1.3.6.1.4.1.4203.666.11.2.1 )",
5167 SLAP_MR_HIDE | SLAP_MR_ORDERING | SLAP_MR_ORDERED_INDEX, NULL,
5168 NULL, NULL, csnOrderingMatch,
5172 {"( 1.3.6.1.4.1.4203.666.11.2.5 NAME 'CSNSIDMatch' "
5173 "SYNTAX 1.3.6.1.4.1.4203.666.11.2.4 )",
5174 SLAP_MR_HIDE | SLAP_MR_EQUALITY | SLAP_MR_EXT, csnSIDMatchSyntaxes,
5175 NULL, csnSidNormalize, octetStringMatch,
5176 octetStringIndexer, octetStringFilter,
5179 /* FIXME: OID is unused, but not registered yet */
5180 {"( 1.3.6.1.4.1.4203.666.4.12 NAME 'authzMatch' "
5181 "SYNTAX 1.3.6.1.4.1.4203.666.2.7 )",
5182 SLAP_MR_HIDE | SLAP_MR_EQUALITY, NULL,
5183 NULL, authzNormalize, authzMatch,
5187 {NULL, SLAP_MR_NONE, NULL,
5188 NULL, NULL, NULL, NULL, NULL,
5193 slap_schema_init( void )
5198 /* we should only be called once (from main) */
5199 assert( schema_init_done == 0 );
5201 for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
5202 res = register_syntax( &syntax_defs[i] );
5205 fprintf( stderr, "slap_schema_init: Error registering syntax %s\n",
5206 syntax_defs[i].sd_desc );
5211 for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
5212 if( mrule_defs[i].mrd_usage == SLAP_MR_NONE &&
5213 mrule_defs[i].mrd_compat_syntaxes == NULL )
5216 "slap_schema_init: Ignoring unusable matching rule %s\n",
5217 mrule_defs[i].mrd_desc );
5221 res = register_matching_rule( &mrule_defs[i] );
5225 "slap_schema_init: Error registering matching rule %s\n",
5226 mrule_defs[i].mrd_desc );
5231 res = slap_schema_load();
5232 schema_init_done = 1;
5237 schema_destroy( void )
5246 if( schema_init_done ) {
5247 ldap_pvt_thread_mutex_destroy( &ad_undef_mutex );
5248 ldap_pvt_thread_mutex_destroy( &oc_undef_mutex );