1 /* schema_init.c - init builtin schema */
4 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
15 #include <ac/string.h>
16 #include <ac/socket.h>
22 #include "ldap_utf8.h"
24 #include "lutil_hash.h"
25 #define HASH_BYTES LUTIL_HASH_BYTES
26 #define HASH_CONTEXT lutil_HASH_CTX
27 #define HASH_Init(c) lutil_HASHInit(c)
28 #define HASH_Update(c,buf,len) lutil_HASHUpdate(c,buf,len)
29 #define HASH_Final(d,c) lutil_HASHFinal(d,c)
31 /* recycled validatation routines */
32 #define berValidate blobValidate
34 /* unimplemented pretters */
35 #define integerPretty NULL
37 /* recycled matching routines */
38 #define bitStringMatch octetStringMatch
39 #define numericStringMatch caseIgnoreIA5Match
40 #define objectIdentifierMatch caseIgnoreIA5Match
41 #define telephoneNumberMatch caseIgnoreIA5Match
42 #define telephoneNumberSubstringsMatch caseIgnoreIA5SubstringsMatch
43 #define generalizedTimeMatch caseIgnoreIA5Match
44 #define generalizedTimeOrderingMatch caseIgnoreIA5Match
45 #define uniqueMemberMatch dnMatch
46 #define integerFirstComponentMatch integerMatch
48 /* approx matching rules */
49 #define directoryStringApproxMatchOID "1.3.6.1.4.1.4203.666.4.4"
50 #define directoryStringApproxMatch approxMatch
51 #define directoryStringApproxIndexer approxIndexer
52 #define directoryStringApproxFilter approxFilter
53 #define IA5StringApproxMatchOID "1.3.6.1.4.1.4203.666.4.5"
54 #define IA5StringApproxMatch approxMatch
55 #define IA5StringApproxIndexer approxIndexer
56 #define IA5StringApproxFilter approxFilter
58 /* ordering matching rules */
59 #define caseIgnoreOrderingMatch caseIgnoreMatch
60 #define caseExactOrderingMatch caseExactMatch
61 #define integerOrderingMatch integerMatch
63 /* unimplemented matching routines */
64 #define caseIgnoreListMatch NULL
65 #define caseIgnoreListSubstringsMatch NULL
66 #define protocolInformationMatch NULL
68 #ifdef SLAPD_ACI_ENABLED
69 #define OpenLDAPaciMatch NULL
71 #ifdef SLAPD_AUTHPASSWD
72 #define authPasswordMatch NULL
75 /* recycled indexing/filtering routines */
76 #define dnIndexer caseExactIgnoreIndexer
77 #define dnFilter caseExactIgnoreFilter
78 #define bitStringFilter octetStringFilter
79 #define bitStringIndexer octetStringIndexer
81 #define telephoneNumberIndexer caseIgnoreIA5Indexer
82 #define telephoneNumberFilter caseIgnoreIA5Filter
83 #define telephoneNumberSubstringsIndexer caseIgnoreIA5SubstringsIndexer
84 #define telephoneNumberSubstringsFilter caseIgnoreIA5SubstringsFilter
86 static MatchingRule *caseExactMatchingRule;
87 static MatchingRule *caseExactSubstringsMatchingRule;
88 static MatchingRule *integerFirstComponentMatchingRule;
90 static const struct MatchingRulePtr {
94 /* must match OIDs below */
95 { "2.5.13.5", &caseExactMatchingRule },
96 { "2.5.13.7", &caseExactSubstringsMatchingRule },
97 { "2.5.13.29", &integerFirstComponentMatchingRule }
101 static char *bvcasechr( struct berval *bv, int c, ber_len_t *len )
104 int lower = TOLOWER( c );
105 int upper = TOUPPER( c );
107 if( c == 0 ) return NULL;
109 for( i=0; i < bv->bv_len; i++ ) {
110 if( upper == bv->bv_val[i] || lower == bv->bv_val[i] ) {
112 return &bv->bv_val[i];
125 struct berval *value,
126 void *assertedValue )
128 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
131 match = memcmp( value->bv_val,
132 ((struct berval *) assertedValue)->bv_val,
140 /* Index generation function */
141 static int octetStringIndexer(
146 struct berval *prefix,
153 HASH_CONTEXT HASHcontext;
154 unsigned char HASHdigest[HASH_BYTES];
155 struct berval digest;
156 digest.bv_val = HASHdigest;
157 digest.bv_len = sizeof(HASHdigest);
159 for( i=0; values[i].bv_val != NULL; i++ ) {
160 /* just count them */
163 /* we should have at least one value at this point */
166 keys = ch_malloc( sizeof( struct berval ) * (i+1) );
168 slen = syntax->ssyn_oidlen;
169 mlen = mr->smr_oidlen;
171 for( i=0; values[i].bv_val != NULL; i++ ) {
172 HASH_Init( &HASHcontext );
173 if( prefix != NULL && prefix->bv_len > 0 ) {
174 HASH_Update( &HASHcontext,
175 prefix->bv_val, prefix->bv_len );
177 HASH_Update( &HASHcontext,
178 syntax->ssyn_oid, slen );
179 HASH_Update( &HASHcontext,
181 HASH_Update( &HASHcontext,
182 values[i].bv_val, values[i].bv_len );
183 HASH_Final( HASHdigest, &HASHcontext );
185 ber_dupbv( &keys[i], &digest );
188 keys[i].bv_val = NULL;
195 /* Index generation function */
196 static int octetStringFilter(
201 struct berval *prefix,
207 HASH_CONTEXT HASHcontext;
208 unsigned char HASHdigest[HASH_BYTES];
209 struct berval *value = (struct berval *) assertValue;
210 struct berval digest;
211 digest.bv_val = HASHdigest;
212 digest.bv_len = sizeof(HASHdigest);
214 slen = syntax->ssyn_oidlen;
215 mlen = mr->smr_oidlen;
217 keys = ch_malloc( sizeof( struct berval ) * 2 );
219 HASH_Init( &HASHcontext );
220 if( prefix != NULL && prefix->bv_len > 0 ) {
221 HASH_Update( &HASHcontext,
222 prefix->bv_val, prefix->bv_len );
224 HASH_Update( &HASHcontext,
225 syntax->ssyn_oid, slen );
226 HASH_Update( &HASHcontext,
228 HASH_Update( &HASHcontext,
229 value->bv_val, value->bv_len );
230 HASH_Final( HASHdigest, &HASHcontext );
232 ber_dupbv( keys, &digest );
233 keys[1].bv_val = NULL;
248 if( in->bv_len == 0 ) return LDAP_SUCCESS;
250 ber_dupbv( &dn, in );
251 if( !dn.bv_val ) return LDAP_OTHER;
253 if( dn.bv_val[dn.bv_len-1] == 'B'
254 && dn.bv_val[dn.bv_len-2] == '\'' )
256 /* assume presence of optional UID */
259 for(i=dn.bv_len-3; i>1; i--) {
260 if( dn.bv_val[i] != '0' && dn.bv_val[i] != '1' ) {
264 if( dn.bv_val[i] != '\'' ||
265 dn.bv_val[i-1] != '#' ) {
266 ber_memfree( dn.bv_val );
267 return LDAP_INVALID_SYNTAX;
270 /* trim the UID to allow use of dnValidate */
271 dn.bv_val[i-1] = '\0';
275 rc = dnValidate( NULL, &dn );
285 struct berval *normalized )
290 ber_dupbv( &out, val );
291 if( out.bv_len != 0 ) {
294 ber_len_t uidlen = 0;
296 if( out.bv_val[out.bv_len-1] == '\'' ) {
297 /* assume presence of optional UID */
298 uid = strrchr( out.bv_val, '#' );
302 return LDAP_INVALID_SYNTAX;
305 uidlen = out.bv_len - (uid - out.bv_val);
306 /* temporarily trim the UID */
308 out.bv_len -= uidlen;
311 #ifdef USE_DN_NORMALIZE
312 rc = dnNormalize2( NULL, &out, normalized );
314 rc = dnPretty2( NULL, &out, normalized );
317 if( rc != LDAP_SUCCESS ) {
319 return LDAP_INVALID_SYNTAX;
322 dnlen = normalized->bv_len;
326 b2.bv_val = ch_malloc(dnlen + uidlen + 1);
327 AC_MEMCPY( b2.bv_val, normalized->bv_val, dnlen );
329 /* restore the separator */
332 AC_MEMCPY( normalized->bv_val+dnlen, uid, uidlen );
333 b2.bv_len = dnlen + uidlen;
334 normalized->bv_val[dnlen+uidlen] = '\0';
335 free(normalized->bv_val);
349 /* any value allowed */
358 /* any value allowed */
369 /* very unforgiving validation, requires no normalization
370 * before simplistic matching
372 if( in->bv_len < 3 ) {
373 return LDAP_INVALID_SYNTAX;
377 * rfc 2252 section 6.3 Bit String
378 * bitstring = "'" *binary-digit "'"
379 * binary-digit = "0" / "1"
380 * example: '0101111101'B
383 if( in->bv_val[0] != '\'' ||
384 in->bv_val[in->bv_len-2] != '\'' ||
385 in->bv_val[in->bv_len-1] != 'B' )
387 return LDAP_INVALID_SYNTAX;
390 for( i=in->bv_len-3; i>0; i-- ) {
391 if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
392 return LDAP_INVALID_SYNTAX;
403 struct berval *normalized )
406 * A normalized bitString is has no extaneous (leading) zero bits.
407 * That is, '00010'B is normalized to '10'B
408 * However, as a special case, '0'B requires no normalization.
412 /* start at the first bit */
415 /* Find the first non-zero bit */
416 while ( *p == '0' ) p++;
419 /* no non-zero bits */
420 ber_str2bv( "\'0\'B", sizeof("\'0\'B") - 1, 1, normalized );
424 normalized->bv_val = ch_malloc( val->bv_len + 1 );
426 normalized->bv_val[0] = '\'';
427 normalized->bv_len = 1;
429 for( ; *p != '\0'; p++ ) {
430 normalized->bv_val[normalized->bv_len++] = *p;
433 normalized->bv_val[normalized->bv_len] = '\0';
440 * Handling boolean syntax and matching is quite rigid.
441 * A more flexible approach would be to allow a variety
442 * of strings to be normalized and prettied into TRUE
450 /* very unforgiving validation, requires no normalization
451 * before simplistic matching
454 if( in->bv_len == 4 ) {
455 if( !memcmp( in->bv_val, "TRUE", 4 ) ) {
458 } else if( in->bv_len == 5 ) {
459 if( !memcmp( in->bv_val, "FALSE", 5 ) ) {
464 return LDAP_INVALID_SYNTAX;
473 struct berval *value,
474 void *assertedValue )
476 /* simplistic matching allowed by rigid validation */
477 struct berval *asserted = (struct berval *) assertedValue;
478 *matchp = value->bv_len != asserted->bv_len;
489 unsigned char *u = in->bv_val;
491 if( !in->bv_len ) return LDAP_INVALID_SYNTAX;
493 for( count = in->bv_len; count > 0; count-=len, u+=len ) {
494 /* get the length indicated by the first byte */
495 len = LDAP_UTF8_CHARLEN2( u, len );
497 /* very basic checks */
500 if( (u[5] & 0xC0) != 0x80 ) {
501 return LDAP_INVALID_SYNTAX;
504 if( (u[4] & 0xC0) != 0x80 ) {
505 return LDAP_INVALID_SYNTAX;
508 if( (u[3] & 0xC0) != 0x80 ) {
509 return LDAP_INVALID_SYNTAX;
512 if( (u[2] & 0xC0 )!= 0x80 ) {
513 return LDAP_INVALID_SYNTAX;
516 if( (u[1] & 0xC0) != 0x80 ) {
517 return LDAP_INVALID_SYNTAX;
520 /* CHARLEN already validated it */
523 return LDAP_INVALID_SYNTAX;
526 /* make sure len corresponds with the offset
527 to the next character */
528 if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
531 if( count != 0 ) return LDAP_INVALID_SYNTAX;
540 struct berval *normalized )
547 /* Ignore initial whitespace */
548 /* All space is ASCII. All ASCII is 1 byte */
549 for ( ; p < val->bv_val + val->bv_len && ASCII_SPACE( p[ 0 ] ); p++ );
551 ber_mem2bv( p, val->bv_len - (p - val->bv_val), 1, normalized );
552 e = normalized->bv_val + val->bv_len - (p - val->bv_val);
554 assert( normalized->bv_len );
555 assert( normalized->bv_val );
557 p = q = normalized->bv_val;
562 if ( ASCII_SPACE( *p ) ) {
567 /* Ignore the extra whitespace */
568 while ( ASCII_SPACE( *p ) ) {
572 len = LDAP_UTF8_COPY(q,p);
578 assert( normalized->bv_val < p );
579 assert( q+len <= p );
581 /* cannot start with a space */
582 assert( !ASCII_SPACE(normalized->bv_val[0]) );
585 * If the string ended in space, backup the pointer one
586 * position. One is enough because the above loop collapsed
587 * all whitespace to a single space.
595 /* cannot end with a space */
596 assert( !ASCII_SPACE( *q ) );
603 normalized->bv_len = q - normalized->bv_val;
608 /* Returns Unicode canonically normalized copy of a substring assertion
609 * Skipping attribute description */
610 static SubstringsAssertion *
611 UTF8SubstringsassertionNormalize(
612 SubstringsAssertion *sa,
615 SubstringsAssertion *nsa;
618 nsa = (SubstringsAssertion *)ch_calloc( 1, sizeof(SubstringsAssertion) );
623 if( sa->sa_initial.bv_val != NULL ) {
624 UTF8bvnormalize( &sa->sa_initial, &nsa->sa_initial, casefold );
625 if( nsa->sa_initial.bv_val == NULL ) {
630 if( sa->sa_any != NULL ) {
631 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
634 nsa->sa_any = (struct berval *)ch_malloc( (i + 1) * sizeof(struct berval) );
635 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
636 UTF8bvnormalize( &sa->sa_any[i], &nsa->sa_any[i],
638 if( nsa->sa_any[i].bv_val == NULL ) {
642 nsa->sa_any[i].bv_val = NULL;
645 if( sa->sa_final.bv_val != NULL ) {
646 UTF8bvnormalize( &sa->sa_final, &nsa->sa_final, casefold );
647 if( nsa->sa_final.bv_val == NULL ) {
655 if ( nsa->sa_final.bv_val ) free( nsa->sa_final.bv_val );
656 if ( nsa->sa_any )ber_bvarray_free( nsa->sa_any );
657 if ( nsa->sa_initial.bv_val ) free( nsa->sa_initial.bv_val );
662 #ifndef SLAPD_APPROX_OLDSINGLESTRING
664 #if defined(SLAPD_APPROX_INITIALS)
665 #define SLAPD_APPROX_DELIMITER "._ "
666 #define SLAPD_APPROX_WORDLEN 2
668 #define SLAPD_APPROX_DELIMITER " "
669 #define SLAPD_APPROX_WORDLEN 1
678 struct berval *value,
679 void *assertedValue )
681 struct berval *nval, *assertv;
682 char *val, **values, **words, *c;
683 int i, count, len, nextchunk=0, nextavail=0;
685 /* Yes, this is necessary */
686 nval = UTF8bvnormalize( value, NULL, LDAP_UTF8_APPROX );
692 /* Yes, this is necessary */
693 assertv = UTF8bvnormalize( ((struct berval *)assertedValue), NULL, LDAP_UTF8_APPROX );
694 if( assertv == NULL ) {
700 /* Isolate how many words there are */
701 for ( c = nval->bv_val, count = 1; *c; c++ ) {
702 c = strpbrk( c, SLAPD_APPROX_DELIMITER );
703 if ( c == NULL ) break;
708 /* Get a phonetic copy of each word */
709 words = (char **)ch_malloc( count * sizeof(char *) );
710 values = (char **)ch_malloc( count * sizeof(char *) );
711 for ( c = nval->bv_val, i = 0; i < count; i++, c += strlen(c) + 1 ) {
713 values[i] = phonetic(c);
716 /* Work through the asserted value's words, to see if at least some
717 of the words are there, in the same order. */
719 while ( (ber_len_t) nextchunk < assertv->bv_len ) {
720 len = strcspn( assertv->bv_val + nextchunk, SLAPD_APPROX_DELIMITER);
725 #if defined(SLAPD_APPROX_INITIALS)
726 else if( len == 1 ) {
727 /* Single letter words need to at least match one word's initial */
728 for( i=nextavail; i<count; i++ )
729 if( !strncasecmp( assertv->bv_val + nextchunk, words[i], 1 )) {
736 /* Isolate the next word in the asserted value and phonetic it */
737 assertv->bv_val[nextchunk+len] = '\0';
738 val = phonetic( assertv->bv_val + nextchunk );
740 /* See if this phonetic chunk is in the remaining words of *value */
741 for( i=nextavail; i<count; i++ ){
742 if( !strcmp( val, values[i] ) ){
750 /* This chunk in the asserted value was NOT within the *value. */
756 /* Go on to the next word in the asserted value */
760 /* If some of the words were seen, call it a match */
761 if( nextavail > 0 ) {
769 ber_bvfree( assertv );
770 for( i=0; i<count; i++ ) {
771 ch_free( values[i] );
786 struct berval *prefix,
791 int i,j, len, wordcount, keycount=0;
792 struct berval *newkeys;
795 for( j=0; values[j].bv_val != NULL; j++ ) {
796 struct berval val = { 0, NULL };
797 /* Yes, this is necessary */
798 UTF8bvnormalize( &values[j], &val, LDAP_UTF8_APPROX );
799 assert( val.bv_val != NULL );
801 /* Isolate how many words there are. There will be a key for each */
802 for( wordcount = 0, c = val.bv_val; *c; c++) {
803 len = strcspn(c, SLAPD_APPROX_DELIMITER);
804 if( len >= SLAPD_APPROX_WORDLEN ) wordcount++;
806 if (*c == '\0') break;
810 /* Allocate/increase storage to account for new keys */
811 newkeys = (struct berval *)ch_malloc( (keycount + wordcount + 1)
812 * sizeof(struct berval) );
813 AC_MEMCPY( newkeys, keys, keycount * sizeof(struct berval) );
814 if( keys ) ch_free( keys );
817 /* Get a phonetic copy of each word */
818 for( c = val.bv_val, i = 0; i < wordcount; c += len + 1 ) {
820 if( len < SLAPD_APPROX_WORDLEN ) continue;
821 ber_str2bv( phonetic( c ), 0, 0, &keys[keycount] );
826 ber_memfree( val.bv_val );
828 keys[keycount].bv_val = NULL;
840 struct berval *prefix,
849 /* Yes, this is necessary */
850 val = UTF8bvnormalize( ((struct berval *)assertValue), NULL, LDAP_UTF8_APPROX );
851 if( val == NULL || val->bv_val == NULL ) {
852 keys = (struct berval *)ch_malloc( sizeof(struct berval) );
853 keys[0].bv_val = NULL;
859 /* Isolate how many words there are. There will be a key for each */
860 for( count = 0,c = val->bv_val; *c; c++) {
861 len = strcspn(c, SLAPD_APPROX_DELIMITER);
862 if( len >= SLAPD_APPROX_WORDLEN ) count++;
864 if (*c == '\0') break;
868 /* Allocate storage for new keys */
869 keys = (struct berval *)ch_malloc( (count + 1) * sizeof(struct berval) );
871 /* Get a phonetic copy of each word */
872 for( c = val->bv_val, i = 0; i < count; c += len + 1 ) {
874 if( len < SLAPD_APPROX_WORDLEN ) continue;
875 ber_str2bv( phonetic( c ), 0, 0, &keys[i] );
881 keys[count].bv_val = NULL;
889 /* No other form of Approximate Matching is defined */
897 struct berval *value,
898 void *assertedValue )
900 char *vapprox, *avapprox;
903 /* Yes, this is necessary */
904 s = UTF8normalize( value, UTF8_NOCASEFOLD );
910 /* Yes, this is necessary */
911 t = UTF8normalize( ((struct berval *)assertedValue),
919 vapprox = phonetic( strip8bitChars( s ) );
920 avapprox = phonetic( strip8bitChars( t ) );
925 *matchp = strcmp( vapprox, avapprox );
939 struct berval *prefix,
947 for( i=0; values[i].bv_val != NULL; i++ ) {
948 /* empty - just count them */
951 /* we should have at least one value at this point */
954 keys = (struct berval *)ch_malloc( sizeof( struct berval ) * (i+1) );
956 /* Copy each value and run it through phonetic() */
957 for( i=0; values[i].bv_val != NULL; i++ ) {
958 /* Yes, this is necessary */
959 s = UTF8normalize( &values[i], UTF8_NOCASEFOLD );
961 /* strip 8-bit chars and run through phonetic() */
962 ber_str2bv( phonetic( strip8bitChars( s ) ), 0, 0, &keys[i] );
965 keys[i].bv_val = NULL;
978 struct berval *prefix,
985 keys = (struct berval *)ch_malloc( sizeof( struct berval * ) * 2 );
987 /* Yes, this is necessary */
988 s = UTF8normalize( ((struct berval *)assertValue),
993 /* strip 8-bit chars and run through phonetic() */
994 keys[0] = ber_bvstr( phonetic( strip8bitChars( s ) ) );
1000 return LDAP_SUCCESS;
1011 struct berval *value,
1012 void *assertedValue )
1014 *matchp = UTF8bvnormcmp( value,
1015 (struct berval *) assertedValue,
1016 LDAP_UTF8_NOCASEFOLD );
1017 return LDAP_SUCCESS;
1021 caseExactIgnoreSubstringsMatch(
1026 struct berval *value,
1027 void *assertedValue )
1030 SubstringsAssertion *sub = NULL;
1031 struct berval left = { 0, NULL };
1037 casefold = ( mr != caseExactSubstringsMatchingRule )
1038 ? LDAP_UTF8_CASEFOLD : LDAP_UTF8_NOCASEFOLD;
1040 if ( UTF8bvnormalize( value, &left, casefold ) == NULL ) {
1046 sub = UTF8SubstringsassertionNormalize( assertedValue, casefold );
1052 /* Add up asserted input length */
1053 if( sub->sa_initial.bv_val ) {
1054 inlen += sub->sa_initial.bv_len;
1057 for(i=0; sub->sa_any[i].bv_val != NULL; i++) {
1058 inlen += sub->sa_any[i].bv_len;
1061 if( sub->sa_final.bv_val ) {
1062 inlen += sub->sa_final.bv_len;
1065 if( sub->sa_initial.bv_val ) {
1066 if( inlen > left.bv_len ) {
1071 match = memcmp( sub->sa_initial.bv_val, left.bv_val,
1072 sub->sa_initial.bv_len );
1078 left.bv_val += sub->sa_initial.bv_len;
1079 left.bv_len -= sub->sa_initial.bv_len;
1080 inlen -= sub->sa_initial.bv_len;
1083 if( sub->sa_final.bv_val ) {
1084 if( inlen > left.bv_len ) {
1089 match = memcmp( sub->sa_final.bv_val,
1090 &left.bv_val[left.bv_len - sub->sa_final.bv_len],
1091 sub->sa_final.bv_len );
1097 left.bv_len -= sub->sa_final.bv_len;
1098 inlen -= sub->sa_final.bv_len;
1102 for(i=0; sub->sa_any[i].bv_val; i++) {
1107 if( inlen > left.bv_len ) {
1108 /* not enough length */
1113 if( sub->sa_any[i].bv_len == 0 ) {
1117 p = ber_bvchr( &left, *sub->sa_any[i].bv_val );
1123 idx = p - left.bv_val;
1125 if( idx >= left.bv_len ) {
1126 /* this shouldn't happen */
1128 if ( sub->sa_final.bv_val )
1129 ch_free( sub->sa_final.bv_val );
1131 ber_bvarray_free( sub->sa_any );
1132 if ( sub->sa_initial.bv_val )
1133 ch_free( sub->sa_initial.bv_val );
1141 if( sub->sa_any[i].bv_len > left.bv_len ) {
1142 /* not enough left */
1147 match = memcmp( left.bv_val,
1148 sub->sa_any[i].bv_val,
1149 sub->sa_any[i].bv_len );
1157 left.bv_val += sub->sa_any[i].bv_len;
1158 left.bv_len -= sub->sa_any[i].bv_len;
1159 inlen -= sub->sa_any[i].bv_len;
1166 if ( sub->sa_final.bv_val ) free( sub->sa_final.bv_val );
1167 if ( sub->sa_any ) ber_bvarray_free( sub->sa_any );
1168 if ( sub->sa_initial.bv_val ) free( sub->sa_initial.bv_val );
1172 return LDAP_SUCCESS;
1175 /* Index generation function */
1176 static int caseExactIgnoreIndexer(
1181 struct berval *prefix,
1189 HASH_CONTEXT HASHcontext;
1190 unsigned char HASHdigest[HASH_BYTES];
1191 struct berval digest;
1192 digest.bv_val = HASHdigest;
1193 digest.bv_len = sizeof(HASHdigest);
1195 for( i=0; values[i].bv_val != NULL; i++ ) {
1196 /* empty - just count them */
1199 /* we should have at least one value at this point */
1202 keys = ch_malloc( sizeof( struct berval ) * (i+1) );
1204 slen = syntax->ssyn_oidlen;
1205 mlen = mr->smr_oidlen;
1207 casefold = ( mr != caseExactMatchingRule )
1208 ? LDAP_UTF8_CASEFOLD : LDAP_UTF8_NOCASEFOLD;
1210 for( i=0; values[i].bv_val != NULL; i++ ) {
1211 struct berval value;
1212 UTF8bvnormalize( &values[i], &value, casefold );
1214 HASH_Init( &HASHcontext );
1215 if( prefix != NULL && prefix->bv_len > 0 ) {
1216 HASH_Update( &HASHcontext,
1217 prefix->bv_val, prefix->bv_len );
1219 HASH_Update( &HASHcontext,
1220 syntax->ssyn_oid, slen );
1221 HASH_Update( &HASHcontext,
1222 mr->smr_oid, mlen );
1223 HASH_Update( &HASHcontext,
1224 value.bv_val, value.bv_len );
1225 HASH_Final( HASHdigest, &HASHcontext );
1227 free( value.bv_val );
1229 ber_dupbv( &keys[i], &digest );
1232 keys[i].bv_val = NULL;
1234 return LDAP_SUCCESS;
1237 /* Index generation function */
1238 static int caseExactIgnoreFilter(
1243 struct berval *prefix,
1250 HASH_CONTEXT HASHcontext;
1251 unsigned char HASHdigest[HASH_BYTES];
1252 struct berval value = { 0, NULL };
1253 struct berval digest;
1255 digest.bv_val = HASHdigest;
1256 digest.bv_len = sizeof(HASHdigest);
1258 slen = syntax->ssyn_oidlen;
1259 mlen = mr->smr_oidlen;
1261 casefold = ( mr != caseExactMatchingRule )
1262 ? LDAP_UTF8_CASEFOLD : LDAP_UTF8_NOCASEFOLD;
1264 UTF8bvnormalize( (struct berval *) assertValue, &value, casefold );
1265 /* This usually happens if filter contains bad UTF8 */
1266 if( value.bv_val == NULL ) {
1267 keys = ch_malloc( sizeof( struct berval ) );
1268 keys[0].bv_val = NULL;
1269 return LDAP_SUCCESS;
1272 keys = ch_malloc( sizeof( struct berval ) * 2 );
1274 HASH_Init( &HASHcontext );
1275 if( prefix != NULL && prefix->bv_len > 0 ) {
1276 HASH_Update( &HASHcontext,
1277 prefix->bv_val, prefix->bv_len );
1279 HASH_Update( &HASHcontext,
1280 syntax->ssyn_oid, slen );
1281 HASH_Update( &HASHcontext,
1282 mr->smr_oid, mlen );
1283 HASH_Update( &HASHcontext,
1284 value.bv_val, value.bv_len );
1285 HASH_Final( HASHdigest, &HASHcontext );
1287 ber_dupbv( keys, &digest );
1288 keys[1].bv_val = NULL;
1290 free( value.bv_val );
1293 return LDAP_SUCCESS;
1296 /* Substrings Index generation function */
1297 static int caseExactIgnoreSubstringsIndexer(
1302 struct berval *prefix,
1312 HASH_CONTEXT HASHcontext;
1313 unsigned char HASHdigest[HASH_BYTES];
1314 struct berval digest;
1315 digest.bv_val = HASHdigest;
1316 digest.bv_len = sizeof(HASHdigest);
1320 for( i=0; values[i].bv_val != NULL; i++ ) {
1321 /* empty - just count them */
1324 /* we should have at least one value at this point */
1327 casefold = ( mr != caseExactSubstringsMatchingRule )
1328 ? LDAP_UTF8_CASEFOLD : LDAP_UTF8_NOCASEFOLD;
1330 nvalues = ch_malloc( sizeof( struct berval ) * (i+1) );
1331 for( i=0; values[i].bv_val != NULL; i++ ) {
1332 UTF8bvnormalize( &values[i], &nvalues[i], casefold );
1334 nvalues[i].bv_val = NULL;
1337 for( i=0; values[i].bv_val != NULL; i++ ) {
1338 /* count number of indices to generate */
1339 if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
1343 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1344 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1345 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1346 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1348 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1352 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
1353 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1354 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1358 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1359 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1360 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1361 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1363 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1369 /* no keys to generate */
1371 ber_bvarray_free( nvalues );
1372 return LDAP_SUCCESS;
1375 keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );
1377 slen = syntax->ssyn_oidlen;
1378 mlen = mr->smr_oidlen;
1381 for( i=0; values[i].bv_val != NULL; i++ ) {
1384 if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
1386 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
1387 ( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
1389 char pre = SLAP_INDEX_SUBSTR_PREFIX;
1390 max = values[i].bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
1392 for( j=0; j<max; j++ ) {
1393 HASH_Init( &HASHcontext );
1394 if( prefix != NULL && prefix->bv_len > 0 ) {
1395 HASH_Update( &HASHcontext,
1396 prefix->bv_val, prefix->bv_len );
1399 HASH_Update( &HASHcontext,
1400 &pre, sizeof( pre ) );
1401 HASH_Update( &HASHcontext,
1402 syntax->ssyn_oid, slen );
1403 HASH_Update( &HASHcontext,
1404 mr->smr_oid, mlen );
1405 HASH_Update( &HASHcontext,
1406 &values[i].bv_val[j],
1407 SLAP_INDEX_SUBSTR_MAXLEN );
1408 HASH_Final( HASHdigest, &HASHcontext );
1410 ber_dupbv( &keys[nkeys++], &digest );
1414 max = SLAP_INDEX_SUBSTR_MAXLEN < values[i].bv_len
1415 ? SLAP_INDEX_SUBSTR_MAXLEN : values[i].bv_len;
1417 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
1420 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1421 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1422 HASH_Init( &HASHcontext );
1423 if( prefix != NULL && prefix->bv_len > 0 ) {
1424 HASH_Update( &HASHcontext,
1425 prefix->bv_val, prefix->bv_len );
1427 HASH_Update( &HASHcontext,
1428 &pre, sizeof( pre ) );
1429 HASH_Update( &HASHcontext,
1430 syntax->ssyn_oid, slen );
1431 HASH_Update( &HASHcontext,
1432 mr->smr_oid, mlen );
1433 HASH_Update( &HASHcontext,
1434 values[i].bv_val, j );
1435 HASH_Final( HASHdigest, &HASHcontext );
1437 ber_dupbv( &keys[nkeys++], &digest );
1440 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1441 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1442 HASH_Init( &HASHcontext );
1443 if( prefix != NULL && prefix->bv_len > 0 ) {
1444 HASH_Update( &HASHcontext,
1445 prefix->bv_val, prefix->bv_len );
1447 HASH_Update( &HASHcontext,
1448 &pre, sizeof( pre ) );
1449 HASH_Update( &HASHcontext,
1450 syntax->ssyn_oid, slen );
1451 HASH_Update( &HASHcontext,
1452 mr->smr_oid, mlen );
1453 HASH_Update( &HASHcontext,
1454 &values[i].bv_val[values[i].bv_len-j], j );
1455 HASH_Final( HASHdigest, &HASHcontext );
1457 ber_dupbv( &keys[nkeys++], &digest );
1465 keys[nkeys].bv_val = NULL;
1472 ber_bvarray_free( nvalues );
1474 return LDAP_SUCCESS;
1477 static int caseExactIgnoreSubstringsFilter(
1482 struct berval *prefix,
1486 SubstringsAssertion *sa;
1489 ber_len_t nkeys = 0;
1490 size_t slen, mlen, klen;
1492 HASH_CONTEXT HASHcontext;
1493 unsigned char HASHdigest[HASH_BYTES];
1494 struct berval *value;
1495 struct berval digest;
1497 casefold = ( mr != caseExactSubstringsMatchingRule )
1498 ? LDAP_UTF8_CASEFOLD : LDAP_UTF8_NOCASEFOLD;
1500 sa = UTF8SubstringsassertionNormalize( assertValue, casefold );
1503 return LDAP_SUCCESS;
1506 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL &&
1507 sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1512 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1514 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
1515 if( sa->sa_any[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1516 /* don't bother accounting for stepping */
1517 nkeys += sa->sa_any[i].bv_len -
1518 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1523 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
1524 sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1530 if ( sa->sa_final.bv_val ) free( sa->sa_final.bv_val );
1531 if ( sa->sa_any ) ber_bvarray_free( sa->sa_any );
1532 if ( sa->sa_initial.bv_val ) free( sa->sa_initial.bv_val );
1535 return LDAP_SUCCESS;
1538 digest.bv_val = HASHdigest;
1539 digest.bv_len = sizeof(HASHdigest);
1541 slen = syntax->ssyn_oidlen;
1542 mlen = mr->smr_oidlen;
1544 keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );
1547 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL &&
1548 sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1550 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1551 value = &sa->sa_initial;
1553 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1554 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1556 HASH_Init( &HASHcontext );
1557 if( prefix != NULL && prefix->bv_len > 0 ) {
1558 HASH_Update( &HASHcontext,
1559 prefix->bv_val, prefix->bv_len );
1561 HASH_Update( &HASHcontext,
1562 &pre, sizeof( pre ) );
1563 HASH_Update( &HASHcontext,
1564 syntax->ssyn_oid, slen );
1565 HASH_Update( &HASHcontext,
1566 mr->smr_oid, mlen );
1567 HASH_Update( &HASHcontext,
1568 value->bv_val, klen );
1569 HASH_Final( HASHdigest, &HASHcontext );
1571 ber_dupbv( &keys[nkeys++], &digest );
1574 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1576 pre = SLAP_INDEX_SUBSTR_PREFIX;
1577 klen = SLAP_INDEX_SUBSTR_MAXLEN;
1579 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
1580 if( sa->sa_any[i].bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
1584 value = &sa->sa_any[i];
1587 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
1588 j += SLAP_INDEX_SUBSTR_STEP )
1590 HASH_Init( &HASHcontext );
1591 if( prefix != NULL && prefix->bv_len > 0 ) {
1592 HASH_Update( &HASHcontext,
1593 prefix->bv_val, prefix->bv_len );
1595 HASH_Update( &HASHcontext,
1596 &pre, sizeof( pre ) );
1597 HASH_Update( &HASHcontext,
1598 syntax->ssyn_oid, slen );
1599 HASH_Update( &HASHcontext,
1600 mr->smr_oid, mlen );
1601 HASH_Update( &HASHcontext,
1602 &value->bv_val[j], klen );
1603 HASH_Final( HASHdigest, &HASHcontext );
1605 ber_dupbv( &keys[nkeys++], &digest );
1611 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
1612 sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1614 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1615 value = &sa->sa_final;
1617 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1618 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1620 HASH_Init( &HASHcontext );
1621 if( prefix != NULL && prefix->bv_len > 0 ) {
1622 HASH_Update( &HASHcontext,
1623 prefix->bv_val, prefix->bv_len );
1625 HASH_Update( &HASHcontext,
1626 &pre, sizeof( pre ) );
1627 HASH_Update( &HASHcontext,
1628 syntax->ssyn_oid, slen );
1629 HASH_Update( &HASHcontext,
1630 mr->smr_oid, mlen );
1631 HASH_Update( &HASHcontext,
1632 &value->bv_val[value->bv_len-klen], klen );
1633 HASH_Final( HASHdigest, &HASHcontext );
1635 ber_dupbv( &keys[nkeys++], &digest );
1639 keys[nkeys].bv_val = NULL;
1645 if ( sa->sa_final.bv_val ) free( sa->sa_final.bv_val );
1646 if ( sa->sa_any ) ber_bvarray_free( sa->sa_any );
1647 if ( sa->sa_initial.bv_val ) free( sa->sa_initial.bv_val );
1650 return LDAP_SUCCESS;
1659 struct berval *value,
1660 void *assertedValue )
1662 *matchp = UTF8bvnormcmp( value,
1663 (struct berval *) assertedValue,
1664 LDAP_UTF8_CASEFOLD );
1665 return LDAP_SUCCESS;
1668 /* Remove all spaces and '-' characters */
1670 telephoneNumberNormalize(
1673 struct berval *normalized )
1677 q = normalized->bv_val = ch_malloc( val->bv_len + 1 );
1679 for( p = val->bv_val; *p; p++ )
1680 if ( ! ( ASCII_SPACE( *p ) || *p == '-' ))
1684 normalized->bv_len = q - normalized->bv_val;
1686 return LDAP_SUCCESS;
1692 struct berval *val )
1696 if( val->bv_len == 0 ) {
1697 /* disallow empty strings */
1698 return LDAP_INVALID_SYNTAX;
1701 if( OID_LEADCHAR(val->bv_val[0]) ) {
1703 for(i=1; i < val->bv_len; i++) {
1704 if( OID_SEPARATOR( val->bv_val[i] ) ) {
1705 if( dot++ ) return 1;
1706 } else if ( OID_CHAR( val->bv_val[i] ) ) {
1709 return LDAP_INVALID_SYNTAX;
1713 return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
1715 } else if( DESC_LEADCHAR(val->bv_val[0]) ) {
1716 for(i=1; i < val->bv_len; i++) {
1717 if( !DESC_CHAR(val->bv_val[i] ) ) {
1718 return LDAP_INVALID_SYNTAX;
1722 return LDAP_SUCCESS;
1725 return LDAP_INVALID_SYNTAX;
1734 struct berval *value,
1735 void *assertedValue )
1738 int vsign = 1, avsign = 1; /* default sign = '+' */
1739 struct berval *asserted;
1740 ber_len_t vlen, avlen;
1743 /* Skip leading space/sign/zeroes, and get the sign of the *value number */
1745 vlen = value->bv_len;
1746 if( mr == integerFirstComponentMatchingRule ) {
1747 char *tmp = memchr( v, '$', vlen );
1750 while( vlen && ASCII_SPACE( v[vlen-1] ))
1753 for( ; vlen && ( *v < '1' || '9' < *v ); v++, vlen-- ) /* ANSI 2.2.1 */
1759 /* Do the same with the *assertedValue number */
1760 asserted = (struct berval *) assertedValue;
1761 av = asserted->bv_val;
1762 avlen = asserted->bv_len;
1763 for( ; avlen && ( *av < '1' || '9' < *av ); av++, avlen-- )
1769 match = vsign - avsign;
1771 match = (vlen != avlen
1772 ? ( vlen < avlen ? -1 : 1 )
1773 : memcmp( v, av, vlen ));
1779 return LDAP_SUCCESS;
1785 struct berval *val )
1789 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
1791 if(( val->bv_val[0] == '+' ) || ( val->bv_val[0] == '-' )) {
1792 if( val->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
1793 } else if( !ASCII_DIGIT(val->bv_val[0]) ) {
1794 return LDAP_INVALID_SYNTAX;
1797 for( i=1; i < val->bv_len; i++ ) {
1798 if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
1801 return LDAP_SUCCESS;
1808 struct berval *normalized )
1818 /* Ignore leading spaces */
1819 while ( len && ( *p == ' ' )) {
1826 negative = ( *p == '-' );
1827 if(( *p == '-' ) || ( *p == '+' )) {
1833 /* Ignore leading zeros */
1834 while ( len && ( *p == '0' )) {
1839 /* If there are no non-zero digits left, the number is zero, otherwise
1840 allocate space for the number and copy it into the buffer */
1842 normalized->bv_val = ch_strdup("0");
1843 normalized->bv_len = 1;
1846 normalized->bv_len = len+negative;
1847 normalized->bv_val = ch_malloc( normalized->bv_len + 1 );
1849 normalized->bv_val[0] = '-';
1851 AC_MEMCPY( normalized->bv_val + negative, p, len );
1852 normalized->bv_val[len+negative] = '\0';
1855 return LDAP_SUCCESS;
1858 /* Index generation function */
1859 static int integerIndexer(
1864 struct berval *prefix,
1871 HASH_CONTEXT HASHcontext;
1872 unsigned char HASHdigest[HASH_BYTES];
1873 struct berval digest;
1874 digest.bv_val = HASHdigest;
1875 digest.bv_len = sizeof(HASHdigest);
1877 for( i=0; values[i].bv_val != NULL; i++ ) {
1878 /* empty - just count them */
1881 /* we should have at least one value at this point */
1884 keys = ch_malloc( sizeof( struct berval ) * (i+1) );
1886 slen = syntax->ssyn_oidlen;
1887 mlen = mr->smr_oidlen;
1889 for( i=0; values[i].bv_val != NULL; i++ ) {
1891 integerNormalize( syntax, &values[i], &norm );
1893 HASH_Init( &HASHcontext );
1894 if( prefix != NULL && prefix->bv_len > 0 ) {
1895 HASH_Update( &HASHcontext,
1896 prefix->bv_val, prefix->bv_len );
1898 HASH_Update( &HASHcontext,
1899 syntax->ssyn_oid, slen );
1900 HASH_Update( &HASHcontext,
1901 mr->smr_oid, mlen );
1902 HASH_Update( &HASHcontext,
1903 norm.bv_val, norm.bv_len );
1904 HASH_Final( HASHdigest, &HASHcontext );
1906 ber_dupbv( &keys[i], &digest );
1907 ch_free( norm.bv_val );
1910 keys[i].bv_val = NULL;
1912 return LDAP_SUCCESS;
1915 /* Index generation function */
1916 static int integerFilter(
1921 struct berval *prefix,
1927 HASH_CONTEXT HASHcontext;
1928 unsigned char HASHdigest[HASH_BYTES];
1930 struct berval digest;
1931 digest.bv_val = HASHdigest;
1932 digest.bv_len = sizeof(HASHdigest);
1934 slen = syntax->ssyn_oidlen;
1935 mlen = mr->smr_oidlen;
1937 integerNormalize( syntax, assertValue, &norm );
1939 keys = ch_malloc( sizeof( struct berval ) * 2 );
1941 HASH_Init( &HASHcontext );
1942 if( prefix != NULL && prefix->bv_len > 0 ) {
1943 HASH_Update( &HASHcontext,
1944 prefix->bv_val, prefix->bv_len );
1946 HASH_Update( &HASHcontext,
1947 syntax->ssyn_oid, slen );
1948 HASH_Update( &HASHcontext,
1949 mr->smr_oid, mlen );
1950 HASH_Update( &HASHcontext,
1951 norm.bv_val, norm.bv_len );
1952 HASH_Final( HASHdigest, &HASHcontext );
1954 ber_dupbv( &keys[0], &digest );
1955 keys[1].bv_val = NULL;
1956 ch_free( norm.bv_val );
1959 return LDAP_SUCCESS;
1964 countryStringValidate(
1966 struct berval *val )
1968 if( val->bv_len != 2 ) return LDAP_INVALID_SYNTAX;
1970 if( !SLAP_PRINTABLE(val->bv_val[0]) ) {
1971 return LDAP_INVALID_SYNTAX;
1973 if( !SLAP_PRINTABLE(val->bv_val[1]) ) {
1974 return LDAP_INVALID_SYNTAX;
1977 return LDAP_SUCCESS;
1981 printableStringValidate(
1983 struct berval *val )
1987 for(i=0; i < val->bv_len; i++) {
1988 if( !SLAP_PRINTABLE(val->bv_val[i]) ) {
1989 return LDAP_INVALID_SYNTAX;
1993 return LDAP_SUCCESS;
1997 printablesStringValidate(
1999 struct berval *val )
2003 for(i=0; i < val->bv_len; i++) {
2004 if( !SLAP_PRINTABLES(val->bv_val[i]) ) {
2005 return LDAP_INVALID_SYNTAX;
2009 return LDAP_SUCCESS;
2015 struct berval *val )
2019 for(i=0; i < val->bv_len; i++) {
2020 if( !LDAP_ASCII(val->bv_val[i]) ) {
2021 return LDAP_INVALID_SYNTAX;
2025 return LDAP_SUCCESS;
2032 struct berval *normalized )
2038 /* Ignore initial whitespace */
2039 while ( ASCII_SPACE( *p ) ) {
2043 normalized->bv_val = ch_strdup( p );
2044 p = q = normalized->bv_val;
2047 if ( ASCII_SPACE( *p ) ) {
2050 /* Ignore the extra whitespace */
2051 while ( ASCII_SPACE( *p ) ) {
2059 assert( normalized->bv_val <= p );
2063 * If the string ended in space, backup the pointer one
2064 * position. One is enough because the above loop collapsed
2065 * all whitespace to a single space.
2068 if ( ASCII_SPACE( q[-1] ) ) {
2072 /* null terminate */
2075 normalized->bv_len = q - normalized->bv_val;
2077 return LDAP_SUCCESS;
2086 struct berval *value,
2087 void *assertedValue )
2089 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
2092 match = strncmp( value->bv_val,
2093 ((struct berval *) assertedValue)->bv_val,
2098 return LDAP_SUCCESS;
2102 caseExactIA5SubstringsMatch(
2107 struct berval *value,
2108 void *assertedValue )
2111 SubstringsAssertion *sub = assertedValue;
2112 struct berval left = *value;
2116 /* Add up asserted input length */
2117 if( sub->sa_initial.bv_val ) {
2118 inlen += sub->sa_initial.bv_len;
2121 for(i=0; sub->sa_any[i].bv_val != NULL; i++) {
2122 inlen += sub->sa_any[i].bv_len;
2125 if( sub->sa_final.bv_val ) {
2126 inlen += sub->sa_final.bv_len;
2129 if( sub->sa_initial.bv_val ) {
2130 if( inlen > left.bv_len ) {
2135 match = strncmp( sub->sa_initial.bv_val, left.bv_val,
2136 sub->sa_initial.bv_len );
2142 left.bv_val += sub->sa_initial.bv_len;
2143 left.bv_len -= sub->sa_initial.bv_len;
2144 inlen -= sub->sa_initial.bv_len;
2147 if( sub->sa_final.bv_val ) {
2148 if( inlen > left.bv_len ) {
2153 match = strncmp( sub->sa_final.bv_val,
2154 &left.bv_val[left.bv_len - sub->sa_final.bv_len],
2155 sub->sa_final.bv_len );
2161 left.bv_len -= sub->sa_final.bv_len;
2162 inlen -= sub->sa_final.bv_len;
2166 for(i=0; sub->sa_any[i].bv_val; i++) {
2171 if( inlen > left.bv_len ) {
2172 /* not enough length */
2177 if( sub->sa_any[i].bv_len == 0 ) {
2181 p = strchr( left.bv_val, *sub->sa_any[i].bv_val );
2188 idx = p - left.bv_val;
2190 if( idx >= left.bv_len ) {
2191 /* this shouldn't happen */
2198 if( sub->sa_any[i].bv_len > left.bv_len ) {
2199 /* not enough left */
2204 match = strncmp( left.bv_val,
2205 sub->sa_any[i].bv_val,
2206 sub->sa_any[i].bv_len );
2214 left.bv_val += sub->sa_any[i].bv_len;
2215 left.bv_len -= sub->sa_any[i].bv_len;
2216 inlen -= sub->sa_any[i].bv_len;
2222 return LDAP_SUCCESS;
2225 /* Index generation function */
2226 static int caseExactIA5Indexer(
2231 struct berval *prefix,
2238 HASH_CONTEXT HASHcontext;
2239 unsigned char HASHdigest[HASH_BYTES];
2240 struct berval digest;
2241 digest.bv_val = HASHdigest;
2242 digest.bv_len = sizeof(HASHdigest);
2244 for( i=0; values[i].bv_val != NULL; i++ ) {
2245 /* empty - just count them */
2248 /* we should have at least one value at this point */
2251 keys = ch_malloc( sizeof( struct berval ) * (i+1) );
2253 slen = syntax->ssyn_oidlen;
2254 mlen = mr->smr_oidlen;
2256 for( i=0; values[i].bv_val != NULL; i++ ) {
2257 struct berval *value = &values[i];
2259 HASH_Init( &HASHcontext );
2260 if( prefix != NULL && prefix->bv_len > 0 ) {
2261 HASH_Update( &HASHcontext,
2262 prefix->bv_val, prefix->bv_len );
2264 HASH_Update( &HASHcontext,
2265 syntax->ssyn_oid, slen );
2266 HASH_Update( &HASHcontext,
2267 mr->smr_oid, mlen );
2268 HASH_Update( &HASHcontext,
2269 value->bv_val, value->bv_len );
2270 HASH_Final( HASHdigest, &HASHcontext );
2272 ber_dupbv( &keys[i], &digest );
2275 keys[i].bv_val = NULL;
2277 return LDAP_SUCCESS;
2280 /* Index generation function */
2281 static int caseExactIA5Filter(
2286 struct berval *prefix,
2292 HASH_CONTEXT HASHcontext;
2293 unsigned char HASHdigest[HASH_BYTES];
2294 struct berval *value;
2295 struct berval digest;
2296 digest.bv_val = HASHdigest;
2297 digest.bv_len = sizeof(HASHdigest);
2299 slen = syntax->ssyn_oidlen;
2300 mlen = mr->smr_oidlen;
2302 value = (struct berval *) assertValue;
2304 keys = ch_malloc( sizeof( struct berval ) * 2 );
2306 HASH_Init( &HASHcontext );
2307 if( prefix != NULL && prefix->bv_len > 0 ) {
2308 HASH_Update( &HASHcontext,
2309 prefix->bv_val, prefix->bv_len );
2311 HASH_Update( &HASHcontext,
2312 syntax->ssyn_oid, slen );
2313 HASH_Update( &HASHcontext,
2314 mr->smr_oid, mlen );
2315 HASH_Update( &HASHcontext,
2316 value->bv_val, value->bv_len );
2317 HASH_Final( HASHdigest, &HASHcontext );
2319 ber_dupbv( &keys[0], &digest );
2320 keys[1].bv_val = NULL;
2323 return LDAP_SUCCESS;
2326 /* Substrings Index generation function */
2327 static int caseExactIA5SubstringsIndexer(
2332 struct berval *prefix,
2339 HASH_CONTEXT HASHcontext;
2340 unsigned char HASHdigest[HASH_BYTES];
2341 struct berval digest;
2342 digest.bv_val = HASHdigest;
2343 digest.bv_len = sizeof(HASHdigest);
2345 /* we should have at least one value at this point */
2346 assert( values != NULL && values[0].bv_val != NULL );
2349 for( i=0; values[i].bv_val != NULL; i++ ) {
2350 /* count number of indices to generate */
2351 if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2355 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2356 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2357 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2358 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2360 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2364 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2365 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2366 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2370 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2371 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2372 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2373 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2375 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2381 /* no keys to generate */
2383 return LDAP_SUCCESS;
2386 keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );
2388 slen = syntax->ssyn_oidlen;
2389 mlen = mr->smr_oidlen;
2392 for( i=0; values[i].bv_val != NULL; i++ ) {
2394 struct berval *value;
2397 if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2399 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2400 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2402 char pre = SLAP_INDEX_SUBSTR_PREFIX;
2403 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2405 for( j=0; j<max; j++ ) {
2406 HASH_Init( &HASHcontext );
2407 if( prefix != NULL && prefix->bv_len > 0 ) {
2408 HASH_Update( &HASHcontext,
2409 prefix->bv_val, prefix->bv_len );
2412 HASH_Update( &HASHcontext,
2413 &pre, sizeof( pre ) );
2414 HASH_Update( &HASHcontext,
2415 syntax->ssyn_oid, slen );
2416 HASH_Update( &HASHcontext,
2417 mr->smr_oid, mlen );
2418 HASH_Update( &HASHcontext,
2420 SLAP_INDEX_SUBSTR_MAXLEN );
2421 HASH_Final( HASHdigest, &HASHcontext );
2423 ber_dupbv( &keys[nkeys++], &digest );
2427 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2428 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2430 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2433 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2434 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2435 HASH_Init( &HASHcontext );
2436 if( prefix != NULL && prefix->bv_len > 0 ) {
2437 HASH_Update( &HASHcontext,
2438 prefix->bv_val, prefix->bv_len );
2440 HASH_Update( &HASHcontext,
2441 &pre, sizeof( pre ) );
2442 HASH_Update( &HASHcontext,
2443 syntax->ssyn_oid, slen );
2444 HASH_Update( &HASHcontext,
2445 mr->smr_oid, mlen );
2446 HASH_Update( &HASHcontext,
2448 HASH_Final( HASHdigest, &HASHcontext );
2450 ber_dupbv( &keys[nkeys++], &digest );
2453 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2454 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2455 HASH_Init( &HASHcontext );
2456 if( prefix != NULL && prefix->bv_len > 0 ) {
2457 HASH_Update( &HASHcontext,
2458 prefix->bv_val, prefix->bv_len );
2460 HASH_Update( &HASHcontext,
2461 &pre, sizeof( pre ) );
2462 HASH_Update( &HASHcontext,
2463 syntax->ssyn_oid, slen );
2464 HASH_Update( &HASHcontext,
2465 mr->smr_oid, mlen );
2466 HASH_Update( &HASHcontext,
2467 &value->bv_val[value->bv_len-j], j );
2468 HASH_Final( HASHdigest, &HASHcontext );
2470 ber_dupbv( &keys[nkeys++], &digest );
2477 keys[nkeys].bv_val = NULL;
2484 return LDAP_SUCCESS;
2487 static int caseExactIA5SubstringsFilter(
2492 struct berval *prefix,
2496 SubstringsAssertion *sa = assertValue;
2498 ber_len_t nkeys = 0;
2499 size_t slen, mlen, klen;
2501 HASH_CONTEXT HASHcontext;
2502 unsigned char HASHdigest[HASH_BYTES];
2503 struct berval *value;
2504 struct berval digest;
2506 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL &&
2507 sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2512 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2514 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
2515 if( sa->sa_any[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2516 /* don't bother accounting for stepping */
2517 nkeys += sa->sa_any[i].bv_len -
2518 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2523 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
2524 sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2531 return LDAP_SUCCESS;
2534 digest.bv_val = HASHdigest;
2535 digest.bv_len = sizeof(HASHdigest);
2537 slen = syntax->ssyn_oidlen;
2538 mlen = mr->smr_oidlen;
2540 keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );
2543 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial.bv_val != NULL &&
2544 sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2546 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2547 value = &sa->sa_initial;
2549 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2550 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2552 HASH_Init( &HASHcontext );
2553 if( prefix != NULL && prefix->bv_len > 0 ) {
2554 HASH_Update( &HASHcontext,
2555 prefix->bv_val, prefix->bv_len );
2557 HASH_Update( &HASHcontext,
2558 &pre, sizeof( pre ) );
2559 HASH_Update( &HASHcontext,
2560 syntax->ssyn_oid, slen );
2561 HASH_Update( &HASHcontext,
2562 mr->smr_oid, mlen );
2563 HASH_Update( &HASHcontext,
2564 value->bv_val, klen );
2565 HASH_Final( HASHdigest, &HASHcontext );
2567 ber_dupbv( &keys[nkeys++], &digest );
2570 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2572 pre = SLAP_INDEX_SUBSTR_PREFIX;
2573 klen = SLAP_INDEX_SUBSTR_MAXLEN;
2575 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
2576 if( sa->sa_any[i].bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
2580 value = &sa->sa_any[i];
2583 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
2584 j += SLAP_INDEX_SUBSTR_STEP )
2586 HASH_Init( &HASHcontext );
2587 if( prefix != NULL && prefix->bv_len > 0 ) {
2588 HASH_Update( &HASHcontext,
2589 prefix->bv_val, prefix->bv_len );
2591 HASH_Update( &HASHcontext,
2592 &pre, sizeof( pre ) );
2593 HASH_Update( &HASHcontext,
2594 syntax->ssyn_oid, slen );
2595 HASH_Update( &HASHcontext,
2596 mr->smr_oid, mlen );
2597 HASH_Update( &HASHcontext,
2598 &value->bv_val[j], klen );
2599 HASH_Final( HASHdigest, &HASHcontext );
2601 ber_dupbv( &keys[nkeys++], &digest );
2606 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final.bv_val != NULL &&
2607 sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2609 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2610 value = &sa->sa_final;
2612 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2613 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2615 HASH_Init( &HASHcontext );
2616 if( prefix != NULL && prefix->bv_len > 0 ) {
2617 HASH_Update( &HASHcontext,
2618 prefix->bv_val, prefix->bv_len );
2620 HASH_Update( &HASHcontext,
2621 &pre, sizeof( pre ) );
2622 HASH_Update( &HASHcontext,
2623 syntax->ssyn_oid, slen );
2624 HASH_Update( &HASHcontext,
2625 mr->smr_oid, mlen );
2626 HASH_Update( &HASHcontext,
2627 &value->bv_val[value->bv_len-klen], klen );
2628 HASH_Final( HASHdigest, &HASHcontext );
2630 ber_dupbv( &keys[nkeys++], &digest );
2634 keys[nkeys].bv_val = NULL;
2641 return LDAP_SUCCESS;
2650 struct berval *value,
2651 void *assertedValue )
2653 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
2655 if( match == 0 && value->bv_len ) {
2656 match = strncasecmp( value->bv_val,
2657 ((struct berval *) assertedValue)->bv_val,
2662 return LDAP_SUCCESS;
2666 caseIgnoreIA5SubstringsMatch(
2671 struct berval *value,
2672 void *assertedValue )
2675 SubstringsAssertion *sub = assertedValue;
2676 struct berval left = *value;
2680 /* Add up asserted input length */
2681 if( sub->sa_initial.bv_val ) {
2682 inlen += sub->sa_initial.bv_len;
2685 for(i=0; sub->sa_any[i].bv_val != NULL; i++) {
2686 inlen += sub->sa_any[i].bv_len;
2689 if( sub->sa_final.bv_val ) {
2690 inlen += sub->sa_final.bv_len;
2693 if( sub->sa_initial.bv_val ) {
2694 if( inlen > left.bv_len ) {
2699 match = strncasecmp( sub->sa_initial.bv_val, left.bv_val,
2700 sub->sa_initial.bv_len );
2706 left.bv_val += sub->sa_initial.bv_len;
2707 left.bv_len -= sub->sa_initial.bv_len;
2708 inlen -= sub->sa_initial.bv_len;
2711 if( sub->sa_final.bv_val ) {
2712 if( inlen > left.bv_len ) {
2717 match = strncasecmp( sub->sa_final.bv_val,
2718 &left.bv_val[left.bv_len - sub->sa_final.bv_len],
2719 sub->sa_final.bv_len );
2725 left.bv_len -= sub->sa_final.bv_len;
2726 inlen -= sub->sa_final.bv_len;
2730 for(i=0; sub->sa_any[i].bv_val; i++) {
2735 if( inlen > left.bv_len ) {
2736 /* not enough length */
2741 if( sub->sa_any[i].bv_len == 0 ) {
2745 p = bvcasechr( &left, *sub->sa_any[i].bv_val, &idx );
2752 assert( idx < left.bv_len );
2753 if( idx >= left.bv_len ) {
2754 /* this shouldn't happen */
2761 if( sub->sa_any[i].bv_len > left.bv_len ) {
2762 /* not enough left */
2767 match = strncasecmp( left.bv_val,
2768 sub->sa_any[i].bv_val,
2769 sub->sa_any[i].bv_len );
2778 left.bv_val += sub->sa_any[i].bv_len;
2779 left.bv_len -= sub->sa_any[i].bv_len;
2780 inlen -= sub->sa_any[i].bv_len;
2786 return LDAP_SUCCESS;
2789 /* Index generation function */
2790 static int caseIgnoreIA5Indexer(
2795 struct berval *prefix,
2802 HASH_CONTEXT HASHcontext;
2803 unsigned char HASHdigest[HASH_BYTES];
2804 struct berval digest;
2805 digest.bv_val = HASHdigest;
2806 digest.bv_len = sizeof(HASHdigest);
2808 /* we should have at least one value at this point */
2809 assert( values != NULL && values[0].bv_val != NULL );
2811 for( i=0; values[i].bv_val != NULL; i++ ) {
2812 /* just count them */
2815 keys = ch_malloc( sizeof( struct berval ) * (i+1) );
2817 slen = syntax->ssyn_oidlen;
2818 mlen = mr->smr_oidlen;
2820 for( i=0; values[i].bv_val != NULL; i++ ) {
2821 struct berval value;
2822 ber_dupbv( &value, &values[i] );
2823 ldap_pvt_str2lower( value.bv_val );
2825 HASH_Init( &HASHcontext );
2826 if( prefix != NULL && prefix->bv_len > 0 ) {
2827 HASH_Update( &HASHcontext,
2828 prefix->bv_val, prefix->bv_len );
2830 HASH_Update( &HASHcontext,
2831 syntax->ssyn_oid, slen );
2832 HASH_Update( &HASHcontext,
2833 mr->smr_oid, mlen );
2834 HASH_Update( &HASHcontext,
2835 value.bv_val, value.bv_len );
2836 HASH_Final( HASHdigest, &HASHcontext );
2838 free( value.bv_val );
2840 ber_dupbv( &keys[i], &digest );
2843 keys[i].bv_val = NULL;
2845 return LDAP_SUCCESS;
2848 /* Index generation function */
2849 static int caseIgnoreIA5Filter(
2854 struct berval *prefix,
2860 HASH_CONTEXT HASHcontext;
2861 unsigned char HASHdigest[HASH_BYTES];
2862 struct berval value;
2863 struct berval digest;
2864 digest.bv_val = HASHdigest;
2865 digest.bv_len = sizeof(HASHdigest);
2867 slen = syntax->ssyn_oidlen;
2868 mlen = mr->smr_oidlen;
2870 ber_dupbv( &value, (struct berval *) assertValue );
2871 ldap_pvt_str2lower( value.bv_val );
2873 keys = ch_malloc( sizeof( struct berval ) * 2 );
2875 HASH_Init( &HASHcontext );
2876 if( prefix != NULL && prefix->bv_len > 0 ) {
2877 HASH_Update( &HASHcontext,
2878 prefix->bv_val, prefix->bv_len );
2880 HASH_Update( &HASHcontext,
2881 syntax->ssyn_oid, slen );
2882 HASH_Update( &HASHcontext,
2883 mr->smr_oid, mlen );
2884 HASH_Update( &HASHcontext,
2885 value.bv_val, value.bv_len );
2886 HASH_Final( HASHdigest, &HASHcontext );
2888 ber_dupbv( &keys[0], &digest );
2889 keys[1].bv_val = NULL;
2891 free( value.bv_val );
2895 return LDAP_SUCCESS;
2898 /* Substrings Index generation function */
2899 static int caseIgnoreIA5SubstringsIndexer(
2904 struct berval *prefix,
2911 HASH_CONTEXT HASHcontext;
2912 unsigned char HASHdigest[HASH_BYTES];
2913 struct berval digest;
2914 digest.bv_val = HASHdigest;
2915 digest.bv_len = sizeof(HASHdigest);
2917 /* we should have at least one value at this point */
2918 assert( values != NULL && values[0].bv_val != NULL );
2921 for( i=0; values[i].bv_val != NULL; i++ ) {
2922 /* count number of indices to generate */
2923 if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2927 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2928 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2929 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2930 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2932 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2936 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2937 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2938 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2942 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2943 if( values[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2944 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2945 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2947 nkeys += values[i].bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2953 /* no keys to generate */
2955 return LDAP_SUCCESS;
2958 keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );
2960 slen = syntax->ssyn_oidlen;
2961 mlen = mr->smr_oidlen;
2964 for( i=0; values[i].bv_val != NULL; i++ ) {
2966 struct berval value;
2968 if( values[i].bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2970 ber_dupbv( &value, &values[i] );
2971 ldap_pvt_str2lower( value.bv_val );
2973 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2974 ( value.bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2976 char pre = SLAP_INDEX_SUBSTR_PREFIX;
2977 max = value.bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2979 for( j=0; j<max; j++ ) {
2980 HASH_Init( &HASHcontext );
2981 if( prefix != NULL && prefix->bv_len > 0 ) {
2982 HASH_Update( &HASHcontext,
2983 prefix->bv_val, prefix->bv_len );
2986 HASH_Update( &HASHcontext,
2987 &pre, sizeof( pre ) );
2988 HASH_Update( &HASHcontext,
2989 syntax->ssyn_oid, slen );
2990 HASH_Update( &HASHcontext,
2991 mr->smr_oid, mlen );
2992 HASH_Update( &HASHcontext,
2994 SLAP_INDEX_SUBSTR_MAXLEN );
2995 HASH_Final( HASHdigest, &HASHcontext );
2997 ber_dupbv( &keys[nkeys++], &digest );
3001 max = SLAP_INDEX_SUBSTR_MAXLEN < value.bv_len
3002 ? SLAP_INDEX_SUBSTR_MAXLEN : value.bv_len;
3004 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
3007 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
3008 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3009 HASH_Init( &HASHcontext );
3010 if( prefix != NULL && prefix->bv_len > 0 ) {
3011 HASH_Update( &HASHcontext,
3012 prefix->bv_val, prefix->bv_len );
3014 HASH_Update( &HASHcontext,
3015 &pre, sizeof( pre ) );
3016 HASH_Update( &HASHcontext,
3017 syntax->ssyn_oid, slen );
3018 HASH_Update( &HASHcontext,
3019 mr->smr_oid, mlen );
3020 HASH_Update( &HASHcontext,
3022 HASH_Final( HASHdigest, &HASHcontext );
3024 ber_dupbv( &keys[nkeys++], &digest );
3027 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
3028 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3029 HASH_Init( &HASHcontext );
3030 if( prefix != NULL && prefix->bv_len > 0 ) {
3031 HASH_Update( &HASHcontext,
3032 prefix->bv_val, prefix->bv_len );
3034 HASH_Update( &HASHcontext,
3035 &pre, sizeof( pre ) );
3036 HASH_Update( &HASHcontext,
3037 syntax->ssyn_oid, slen );
3038 HASH_Update( &HASHcontext,
3039 mr->smr_oid, mlen );
3040 HASH_Update( &HASHcontext,
3041 &value.bv_val[value.bv_len-j], j );
3042 HASH_Final( HASHdigest, &HASHcontext );
3044 ber_dupbv( &keys[nkeys++], &digest );
3049 free( value.bv_val );
3053 keys[nkeys].bv_val = NULL;
3060 return LDAP_SUCCESS;
3063 static int caseIgnoreIA5SubstringsFilter(
3068 struct berval *prefix,
3072 SubstringsAssertion *sa = assertValue;
3074 ber_len_t nkeys = 0;
3075 size_t slen, mlen, klen;
3077 HASH_CONTEXT HASHcontext;
3078 unsigned char HASHdigest[HASH_BYTES];
3079 struct berval value;
3080 struct berval digest;
3082 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial.bv_val != NULL &&
3083 sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3088 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3090 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
3091 if( sa->sa_any[i].bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3092 /* don't bother accounting for stepping */
3093 nkeys += sa->sa_any[i].bv_len -
3094 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
3099 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final.bv_val != NULL &&
3100 sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3107 return LDAP_SUCCESS;
3110 digest.bv_val = HASHdigest;
3111 digest.bv_len = sizeof(HASHdigest);
3113 slen = syntax->ssyn_oidlen;
3114 mlen = mr->smr_oidlen;
3116 keys = ch_malloc( sizeof( struct berval ) * (nkeys+1) );
3119 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial.bv_val != NULL &&
3120 sa->sa_initial.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3122 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3123 ber_dupbv( &value, &sa->sa_initial );
3124 ldap_pvt_str2lower( value.bv_val );
3126 klen = SLAP_INDEX_SUBSTR_MAXLEN < value.bv_len
3127 ? SLAP_INDEX_SUBSTR_MAXLEN : value.bv_len;
3129 HASH_Init( &HASHcontext );
3130 if( prefix != NULL && prefix->bv_len > 0 ) {
3131 HASH_Update( &HASHcontext,
3132 prefix->bv_val, prefix->bv_len );
3134 HASH_Update( &HASHcontext,
3135 &pre, sizeof( pre ) );
3136 HASH_Update( &HASHcontext,
3137 syntax->ssyn_oid, slen );
3138 HASH_Update( &HASHcontext,
3139 mr->smr_oid, mlen );
3140 HASH_Update( &HASHcontext,
3141 value.bv_val, klen );
3142 HASH_Final( HASHdigest, &HASHcontext );
3144 free( value.bv_val );
3145 ber_dupbv( &keys[nkeys++], &digest );
3148 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3150 pre = SLAP_INDEX_SUBSTR_PREFIX;
3151 klen = SLAP_INDEX_SUBSTR_MAXLEN;
3153 for( i=0; sa->sa_any[i].bv_val != NULL; i++ ) {
3154 if( sa->sa_any[i].bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
3158 ber_dupbv( &value, &sa->sa_any[i] );
3159 ldap_pvt_str2lower( value.bv_val );
3162 j <= value.bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
3163 j += SLAP_INDEX_SUBSTR_STEP )
3165 HASH_Init( &HASHcontext );
3166 if( prefix != NULL && prefix->bv_len > 0 ) {
3167 HASH_Update( &HASHcontext,
3168 prefix->bv_val, prefix->bv_len );
3170 HASH_Update( &HASHcontext,
3171 &pre, sizeof( pre ) );
3172 HASH_Update( &HASHcontext,
3173 syntax->ssyn_oid, slen );
3174 HASH_Update( &HASHcontext,
3175 mr->smr_oid, mlen );
3176 HASH_Update( &HASHcontext,
3177 &value.bv_val[j], klen );
3178 HASH_Final( HASHdigest, &HASHcontext );
3180 ber_dupbv( &keys[nkeys++], &digest );
3183 free( value.bv_val );
3187 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final.bv_val != NULL &&
3188 sa->sa_final.bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3190 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3191 ber_dupbv( &value, &sa->sa_final );
3192 ldap_pvt_str2lower( value.bv_val );
3194 klen = SLAP_INDEX_SUBSTR_MAXLEN < value.bv_len
3195 ? SLAP_INDEX_SUBSTR_MAXLEN : value.bv_len;
3197 HASH_Init( &HASHcontext );
3198 if( prefix != NULL && prefix->bv_len > 0 ) {
3199 HASH_Update( &HASHcontext,
3200 prefix->bv_val, prefix->bv_len );
3202 HASH_Update( &HASHcontext,
3203 &pre, sizeof( pre ) );
3204 HASH_Update( &HASHcontext,
3205 syntax->ssyn_oid, slen );
3206 HASH_Update( &HASHcontext,
3207 mr->smr_oid, mlen );
3208 HASH_Update( &HASHcontext,
3209 &value.bv_val[value.bv_len-klen], klen );
3210 HASH_Final( HASHdigest, &HASHcontext );
3212 free( value.bv_val );
3213 ber_dupbv( &keys[nkeys++], &digest );
3217 keys[nkeys].bv_val = NULL;
3224 return LDAP_SUCCESS;
3228 numericStringValidate(
3234 for(i=0; i < in->bv_len; i++) {
3235 if( !SLAP_NUMERIC(in->bv_val[i]) ) {
3236 return LDAP_INVALID_SYNTAX;
3240 return LDAP_SUCCESS;
3244 numericStringNormalize(
3247 struct berval *normalized )
3249 /* removal all spaces */
3252 normalized->bv_val = ch_malloc( val->bv_len + 1 );
3255 q = normalized->bv_val;
3258 if ( ASCII_SPACE( *p ) ) {
3259 /* Ignore whitespace */
3266 /* we should have copied no more then is in val */
3267 assert( (q - normalized->bv_val) <= (p - val->bv_val) );
3269 /* null terminate */
3272 normalized->bv_len = q - normalized->bv_val;
3274 return LDAP_SUCCESS;
3278 objectIdentifierFirstComponentMatch(
3283 struct berval *value,
3284 void *assertedValue )
3286 int rc = LDAP_SUCCESS;
3288 struct berval *asserted = (struct berval *) assertedValue;
3292 if( value->bv_len == 0 || value->bv_val[0] != '(' /*')'*/ ) {
3293 return LDAP_INVALID_SYNTAX;
3296 /* trim leading white space */
3297 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
3301 /* grab next word */
3302 oid.bv_val = &value->bv_val[i];
3303 oid.bv_len = value->bv_len - i;
3304 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
3309 /* insert attributeTypes, objectclass check here */
3310 if( OID_LEADCHAR(asserted->bv_val[0]) ) {
3311 rc = objectIdentifierMatch( &match, flags, syntax, mr, &oid, asserted );
3314 if ( !strcmp( syntax->ssyn_oid, SLAP_SYNTAX_MATCHINGRULES_OID ) ) {
3315 MatchingRule *asserted_mr = mr_bvfind( asserted );
3316 MatchingRule *stored_mr = mr_bvfind( &oid );
3318 if( asserted_mr == NULL ) {
3319 rc = SLAPD_COMPARE_UNDEFINED;
3321 match = asserted_mr != stored_mr;
3324 } else if ( !strcmp( syntax->ssyn_oid,
3325 SLAP_SYNTAX_ATTRIBUTETYPES_OID ) )
3327 AttributeType *asserted_at = at_bvfind( asserted );
3328 AttributeType *stored_at = at_bvfind( &oid );
3330 if( asserted_at == NULL ) {
3331 rc = SLAPD_COMPARE_UNDEFINED;
3333 match = asserted_at != stored_at;
3336 } else if ( !strcmp( syntax->ssyn_oid,
3337 SLAP_SYNTAX_OBJECTCLASSES_OID ) )
3339 ObjectClass *asserted_oc = oc_bvfind( asserted );
3340 ObjectClass *stored_oc = oc_bvfind( &oid );
3342 if( asserted_oc == NULL ) {
3343 rc = SLAPD_COMPARE_UNDEFINED;
3345 match = asserted_oc != stored_oc;
3351 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3352 "objectIdentifierFirstComponentMatch: %d\n %s\n %s\n",
3353 match, value->bv_val, asserted->bv_val ));
3355 Debug( LDAP_DEBUG_ARGS, "objectIdentifierFirstComponentMatch "
3356 "%d\n\t\"%s\"\n\t\"%s\"\n",
3357 match, value->bv_val, asserted->bv_val );
3361 if( rc == LDAP_SUCCESS ) *matchp = match;
3371 struct berval *value,
3372 void *assertedValue )
3374 long lValue, lAssertedValue;
3376 /* safe to assume integers are NUL terminated? */
3377 lValue = strtoul(value->bv_val, NULL, 10);
3378 if(( lValue == LONG_MIN || lValue == LONG_MAX) && errno == ERANGE )
3379 return LDAP_CONSTRAINT_VIOLATION;
3381 lAssertedValue = strtol(((struct berval *)assertedValue)->bv_val, NULL, 10);
3382 if(( lAssertedValue == LONG_MIN || lAssertedValue == LONG_MAX) && errno == ERANGE )
3383 return LDAP_CONSTRAINT_VIOLATION;
3385 *matchp = (lValue & lAssertedValue);
3386 return LDAP_SUCCESS;
3395 struct berval *value,
3396 void *assertedValue )
3398 long lValue, lAssertedValue;
3400 /* safe to assume integers are NUL terminated? */
3401 lValue = strtoul(value->bv_val, NULL, 10);
3402 if(( lValue == LONG_MIN || lValue == LONG_MAX) && errno == ERANGE )
3403 return LDAP_CONSTRAINT_VIOLATION;
3405 lAssertedValue = strtol(((struct berval *)assertedValue)->bv_val, NULL, 10);
3406 if(( lAssertedValue == LONG_MIN || lAssertedValue == LONG_MAX) && errno == ERANGE )
3407 return LDAP_CONSTRAINT_VIOLATION;
3409 *matchp = (lValue | lAssertedValue);
3410 return LDAP_SUCCESS;
3414 #include <openssl/x509.h>
3415 #include <openssl/err.h>
3416 char digit[] = "0123456789";
3419 * Next function returns a string representation of a ASN1_INTEGER.
3420 * It works for unlimited lengths.
3423 static struct berval *
3424 asn1_integer2str(ASN1_INTEGER *a)
3429 /* We work backwards, make it fill from the end of buf */
3430 p = buf + sizeof(buf) - 1;
3433 if ( a == NULL || a->length == 0 ) {
3441 /* We want to preserve the original */
3442 copy = ch_malloc(n*sizeof(unsigned int));
3443 for (i = 0; i<n; i++) {
3444 copy[i] = a->data[i];
3448 * base indicates the index of the most significant
3449 * byte that might be nonzero. When it goes off the
3450 * end, we now there is nothing left to do.
3456 for (i = base; i<n; i++ ) {
3457 copy[i] += carry*256;
3458 carry = copy[i] % 10;
3463 * Way too large, we need to leave
3464 * room for sign if negative
3469 *--p = digit[carry];
3470 if (copy[base] == 0)
3476 if ( a->type == V_ASN1_NEG_INTEGER ) {
3480 return ber_bvstrdup(p);
3483 /* Get a DN in RFC2253 format from a X509_NAME internal struct */
3484 static struct berval *
3485 dn_openssl2ldap(X509_NAME *name)
3487 char issuer_dn[1024];
3490 bio = BIO_new(BIO_s_mem());
3493 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3494 "dn_openssl2ldap: error creating BIO_s_mem: %s\n",
3495 ERR_error_string(ERR_get_error(),NULL)));
3497 Debug( LDAP_DEBUG_ARGS, "dn_openssl2ldap: "
3498 "error creating BIO: %s\n",
3499 ERR_error_string(ERR_get_error(),NULL), NULL, NULL );
3503 X509_NAME_print_ex(bio, name, 0, XN_FLAG_RFC2253);
3505 BIO_gets(bio, issuer_dn, 1024);
3508 return ber_bvstrdup(issuer_dn);
3512 * Given a certificate in DER format, extract the corresponding
3513 * assertion value for certificateExactMatch
3516 certificateExactConvert(
3518 struct berval * out )
3521 unsigned char *p = in->bv_val;
3522 struct berval *serial;
3523 struct berval *issuer_dn;
3524 struct berval *bv_tmp;
3526 xcert = d2i_X509(NULL, &p, in->bv_len);
3529 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3530 "certificateExactConvert: error parsing cert: %s\n",
3531 ERR_error_string(ERR_get_error(),NULL)));
3533 Debug( LDAP_DEBUG_ARGS, "certificateExactConvert: "
3534 "error parsing cert: %s\n",
3535 ERR_error_string(ERR_get_error(),NULL), NULL, NULL );
3537 return LDAP_INVALID_SYNTAX;
3540 serial = asn1_integer2str(xcert->cert_info->serialNumber);
3543 return LDAP_INVALID_SYNTAX;
3545 issuer_dn = dn_openssl2ldap(X509_get_issuer_name(xcert));
3549 return LDAP_INVALID_SYNTAX;
3551 /* Actually, dn_openssl2ldap returns in a normalized format, but
3552 it is different from our normalized format */
3554 if ( dnNormalize(NULL, bv_tmp, &issuer_dn) != LDAP_SUCCESS ) {
3558 return LDAP_INVALID_SYNTAX;
3564 out->bv_len = serial->bv_len + issuer_dn->bv_len + sizeof(" $ ");
3565 out->bv_val = ch_malloc(out->bv_len);
3567 AC_MEMCPY(p, serial->bv_val, serial->bv_len);
3568 p += serial->bv_len;
3569 AC_MEMCPY(p, " $ ", sizeof(" $ ")-1);
3571 AC_MEMCPY(p, issuer_dn->bv_val, issuer_dn->bv_len);
3572 p += issuer_dn->bv_len;
3576 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3577 "certificateExactConvert: \n %s\n",
3580 Debug( LDAP_DEBUG_ARGS, "certificateExactConvert "
3582 out->bv_val, NULL, NULL );
3586 ber_bvfree(issuer_dn);
3588 return LDAP_SUCCESS;
3592 serial_and_issuer_parse(
3593 struct berval *assertion,
3594 struct berval **serial,
3595 struct berval **issuer_dn
3603 begin = assertion->bv_val;
3604 end = assertion->bv_val+assertion->bv_len-1;
3605 for (p=begin; p<=end && *p != '$'; p++)
3608 return LDAP_INVALID_SYNTAX;
3610 /* p now points at the $ sign, now use begin and end to delimit the
3612 while (ASCII_SPACE(*begin))
3615 while (ASCII_SPACE(*end))
3618 bv.bv_len = end-begin+1;
3620 *serial = ber_dupbv(NULL, &bv);
3622 /* now extract the issuer, remember p was at the dollar sign */
3624 end = assertion->bv_val+assertion->bv_len-1;
3625 while (ASCII_SPACE(*begin))
3627 /* should we trim spaces at the end too? is it safe always? */
3629 bv.bv_len = end-begin+1;
3631 dnNormalize( NULL, &bv, issuer_dn );
3633 return LDAP_SUCCESS;
3637 certificateExactMatch(
3642 struct berval *value,
3643 void *assertedValue )
3646 unsigned char *p = value->bv_val;
3647 struct berval *serial;
3648 struct berval *issuer_dn;
3649 struct berval *asserted_serial;
3650 struct berval *asserted_issuer_dn;
3653 xcert = d2i_X509(NULL, &p, value->bv_len);
3656 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3657 "certificateExactMatch: error parsing cert: %s\n",
3658 ERR_error_string(ERR_get_error(),NULL)));
3660 Debug( LDAP_DEBUG_ARGS, "certificateExactMatch: "
3661 "error parsing cert: %s\n",
3662 ERR_error_string(ERR_get_error(),NULL), NULL, NULL );
3664 return LDAP_INVALID_SYNTAX;
3667 serial = asn1_integer2str(xcert->cert_info->serialNumber);
3668 issuer_dn = dn_openssl2ldap(X509_get_issuer_name(xcert));
3672 serial_and_issuer_parse(assertedValue,
3674 &asserted_issuer_dn);
3679 slap_schema.si_syn_integer,
3680 slap_schema.si_mr_integerMatch,
3683 if ( ret == LDAP_SUCCESS ) {
3684 if ( *matchp == 0 ) {
3685 /* We need to normalize everything for dnMatch */
3689 slap_schema.si_syn_distinguishedName,
3690 slap_schema.si_mr_distinguishedNameMatch,
3692 asserted_issuer_dn);
3697 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3698 "certificateExactMatch: %d\n %s $ %s\n %s $ %s\n",
3699 *matchp, serial->bv_val, issuer_dn->bv_val,
3700 asserted_serial->bv_val, asserted_issuer_dn->bv_val));
3702 Debug( LDAP_DEBUG_ARGS, "certificateExactMatch "
3703 "%d\n\t\"%s $ %s\"\n",
3704 *matchp, serial->bv_val, issuer_dn->bv_val );
3705 Debug( LDAP_DEBUG_ARGS, "\t\"%s $ %s\"\n",
3706 asserted_serial->bv_val, asserted_issuer_dn->bv_val,
3711 ber_bvfree(issuer_dn);
3712 ber_bvfree(asserted_serial);
3713 ber_bvfree(asserted_issuer_dn);
3719 * Index generation function
3720 * We just index the serials, in most scenarios the issuer DN is one of
3721 * a very small set of values.
3723 static int certificateExactIndexer(
3728 struct berval *prefix,
3736 struct berval * serial;
3738 /* we should have at least one value at this point */
3739 assert( values != NULL && values[0].bv_val != NULL );
3741 for( i=0; values[i].bv_val != NULL; i++ ) {
3742 /* empty -- just count them */
3745 keys = ch_malloc( sizeof( struct berval ) * (i+1) );
3747 for( i=0; values[i].bv_val != NULL; i++ ) {
3748 p = values[i].bv_val;
3749 xcert = d2i_X509(NULL, &p, values[i].bv_len);
3752 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3753 "certificateExactIndexer: error parsing cert: %s\n",
3754 ERR_error_string(ERR_get_error(),NULL)));
3756 Debug( LDAP_DEBUG_ARGS, "certificateExactIndexer: "
3757 "error parsing cert: %s\n",
3758 ERR_error_string(ERR_get_error(),NULL),
3761 /* Do we leak keys on error? */
3762 return LDAP_INVALID_SYNTAX;
3765 serial = asn1_integer2str(xcert->cert_info->serialNumber);
3767 integerNormalize( slap_schema.si_syn_integer,
3772 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3773 "certificateExactIndexer: returning: %s\n",
3776 Debug( LDAP_DEBUG_ARGS, "certificateExactIndexer: "
3783 keys[i].bv_val = NULL;
3785 return LDAP_SUCCESS;
3788 /* Index generation function */
3789 /* We think this is always called with a value in matching rule syntax */
3790 static int certificateExactFilter(
3795 struct berval *prefix,
3800 struct berval *asserted_serial;
3801 struct berval *asserted_issuer_dn;
3803 serial_and_issuer_parse(assertValue,
3805 &asserted_issuer_dn);
3807 keys = ch_malloc( sizeof( struct berval ) * 2 );
3808 integerNormalize( syntax, asserted_serial, &keys[0] );
3809 keys[1].bv_val = NULL;
3812 ber_bvfree(asserted_serial);
3813 ber_bvfree(asserted_issuer_dn);
3814 return LDAP_SUCCESS;
3819 check_time_syntax (struct berval *val,
3823 static int ceiling[9] = { 99, 99, 11, 30, 23, 59, 59, 12, 59 };
3824 static int mdays[2][12] = {
3825 /* non-leap years */
3826 { 30, 27, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 },
3828 { 30, 28, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 }
3831 int part, c, tzoffset, leapyear = 0 ;
3833 if( val->bv_len == 0 ) {
3834 return LDAP_INVALID_SYNTAX;
3837 p = (char *)val->bv_val;
3838 e = p + val->bv_len;
3840 /* Ignore initial whitespace */
3841 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3845 if (e - p < 13 - (2 * start)) {
3846 return LDAP_INVALID_SYNTAX;
3849 for (part = 0; part < 9; part++) {
3853 for (part = start; part < 7; part++) {
3855 if ((part == 6) && (c == 'Z' || c == '+' || c == '-')) {
3862 return LDAP_INVALID_SYNTAX;
3864 if (c < 0 || c > 9) {
3865 return LDAP_INVALID_SYNTAX;
3871 return LDAP_INVALID_SYNTAX;
3873 if (c < 0 || c > 9) {
3874 return LDAP_INVALID_SYNTAX;
3879 if (part == 2 || part == 3) {
3882 if (parts[part] < 0) {
3883 return LDAP_INVALID_SYNTAX;
3885 if (parts[part] > ceiling[part]) {
3886 return LDAP_INVALID_SYNTAX;
3890 /* leapyear check for the Gregorian calendar (year>1581) */
3891 if (((parts[1] % 4 == 0) && (parts[1] != 0)) ||
3892 ((parts[0] % 4 == 0) && (parts[1] == 0)))
3897 if (parts[3] > mdays[leapyear][parts[2]]) {
3898 return LDAP_INVALID_SYNTAX;
3903 tzoffset = 0; /* UTC */
3904 } else if (c != '+' && c != '-') {
3905 return LDAP_INVALID_SYNTAX;
3909 } else /* c == '+' */ {
3914 return LDAP_INVALID_SYNTAX;
3917 for (part = 7; part < 9; part++) {
3919 if (c < 0 || c > 9) {
3920 return LDAP_INVALID_SYNTAX;
3925 if (c < 0 || c > 9) {
3926 return LDAP_INVALID_SYNTAX;
3930 if (parts[part] < 0 || parts[part] > ceiling[part]) {
3931 return LDAP_INVALID_SYNTAX;
3936 /* Ignore trailing whitespace */
3937 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3941 return LDAP_INVALID_SYNTAX;
3944 switch ( tzoffset ) {
3945 case -1: /* negativ offset to UTC, ie west of Greenwich */
3946 parts[4] += parts[7];
3947 parts[5] += parts[8];
3948 for (part = 6; --part > 0; ) { /* offset is just hhmm, no seconds */
3952 c = mdays[leapyear][parts[2]];
3954 if (parts[part] > c) {
3955 parts[part] -= c + 1;
3960 case 1: /* positive offset to UTC, ie east of Greenwich */
3961 parts[4] -= parts[7];
3962 parts[5] -= parts[8];
3963 for (part = 6; --part > 0; ) {
3967 /* first arg to % needs to be non negativ */
3968 c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
3970 if (parts[part] < 0) {
3971 parts[part] += c + 1;
3976 case 0: /* already UTC */
3980 return LDAP_SUCCESS;
3983 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
3988 struct berval *normalized )
3992 rc = check_time_syntax(val, 1, parts);
3993 if (rc != LDAP_SUCCESS) {
3997 normalized->bv_val = ch_malloc( 14 );
3998 if ( normalized->bv_val == NULL ) {
3999 return LBER_ERROR_MEMORY;
4002 sprintf( normalized->bv_val, "%02d%02d%02d%02d%02d%02dZ",
4003 parts[1], parts[2] + 1, parts[3] + 1,
4004 parts[4], parts[5], parts[6] );
4005 normalized->bv_len = 13;
4007 return LDAP_SUCCESS;
4011 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
4019 return check_time_syntax(in, 1, parts);
4024 generalizedTimeValidate(
4030 return check_time_syntax(in, 0, parts);
4034 generalizedTimeNormalize(
4037 struct berval *normalized )
4041 rc = check_time_syntax(val, 0, parts);
4042 if (rc != LDAP_SUCCESS) {
4046 normalized->bv_val = ch_malloc( 16 );
4047 if ( normalized->bv_val == NULL ) {
4048 return LBER_ERROR_MEMORY;
4051 sprintf( normalized->bv_val, "%02d%02d%02d%02d%02d%02d%02dZ",
4052 parts[0], parts[1], parts[2] + 1, parts[3] + 1,
4053 parts[4], parts[5], parts[6] );
4054 normalized->bv_len = 15;
4056 return LDAP_SUCCESS;
4060 nisNetgroupTripleValidate(
4062 struct berval *val )
4067 if ( val->bv_len == 0 ) {
4068 return LDAP_INVALID_SYNTAX;
4071 p = (char *)val->bv_val;
4072 e = p + val->bv_len;
4074 if ( *p != '(' /*')'*/ ) {
4075 return LDAP_INVALID_SYNTAX;
4078 for ( p++; ( p < e ) && ( *p != /*'('*/ ')' ); p++ ) {
4082 return LDAP_INVALID_SYNTAX;
4085 } else if ( !ATTR_CHAR( *p ) ) {
4086 return LDAP_INVALID_SYNTAX;
4090 if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
4091 return LDAP_INVALID_SYNTAX;
4097 return LDAP_INVALID_SYNTAX;
4100 return LDAP_SUCCESS;
4104 bootParameterValidate(
4106 struct berval *val )
4110 if ( val->bv_len == 0 ) {
4111 return LDAP_INVALID_SYNTAX;
4114 p = (char *)val->bv_val;
4115 e = p + val->bv_len;
4118 for (; ( p < e ) && ( *p != '=' ); p++ ) {
4119 if ( !ATTR_CHAR( *p ) ) {
4120 return LDAP_INVALID_SYNTAX;
4125 return LDAP_INVALID_SYNTAX;
4129 for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
4130 if ( !ATTR_CHAR( *p ) ) {
4131 return LDAP_INVALID_SYNTAX;
4136 return LDAP_INVALID_SYNTAX;
4140 for ( p++; p < e; p++ ) {
4141 if ( !ATTR_CHAR( *p ) ) {
4142 return LDAP_INVALID_SYNTAX;
4146 return LDAP_SUCCESS;
4149 static struct syntax_defs_rec {
4151 #define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
4152 #define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
4154 slap_syntax_validate_func *sd_validate;
4155 slap_syntax_transform_func *sd_normalize;
4156 slap_syntax_transform_func *sd_pretty;
4157 #ifdef SLAPD_BINARY_CONVERSION
4158 slap_syntax_transform_func *sd_ber2str;
4159 slap_syntax_transform_func *sd_str2ber;
4162 {"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' "
4163 X_BINARY X_NOT_H_R ")",
4164 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
4165 {"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
4166 0, NULL, NULL, NULL},
4167 {"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
4168 0, NULL, NULL, NULL},
4169 {"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' "
4171 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
4172 {"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' "
4174 SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4175 {"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
4176 0, bitStringValidate, bitStringNormalize, NULL },
4177 {"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
4178 0, booleanValidate, NULL, NULL},
4179 {"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
4180 X_BINARY X_NOT_H_R ")",
4181 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4182 {"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
4183 X_BINARY X_NOT_H_R ")",
4184 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4185 {"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
4186 X_BINARY X_NOT_H_R ")",
4187 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4188 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
4189 0, countryStringValidate, IA5StringNormalize, NULL},
4190 {"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
4191 0, dnValidate, dnNormalize2, dnPretty2},
4192 {"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
4193 0, NULL, NULL, NULL},
4194 {"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
4195 0, NULL, NULL, NULL},
4196 {"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
4197 0, UTF8StringValidate, UTF8StringNormalize, NULL},
4198 {"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
4199 0, NULL, NULL, NULL},
4200 {"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
4201 0, NULL, NULL, NULL},
4202 {"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
4203 0, NULL, NULL, NULL},
4204 {"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
4205 0, NULL, NULL, NULL},
4206 {"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
4207 0, NULL, NULL, NULL},
4208 {"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
4209 0, printablesStringValidate, telephoneNumberNormalize, NULL},
4210 {"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
4211 SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
4212 {"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
4213 0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
4214 {"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
4215 0, NULL, NULL, NULL},
4216 {"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
4217 0, IA5StringValidate, IA5StringNormalize, NULL},
4218 {"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
4219 0, integerValidate, integerNormalize, NULL},
4220 {"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
4221 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
4222 {"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
4223 0, NULL, NULL, NULL},
4224 {"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
4225 0, NULL, NULL, NULL},
4226 {"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
4227 0, NULL, NULL, NULL},
4228 {"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
4229 0, NULL, NULL, NULL},
4230 {"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
4231 0, NULL, NULL, NULL},
4232 {"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
4233 0, nameUIDValidate, nameUIDNormalize, NULL},
4234 {"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
4235 0, NULL, NULL, NULL},
4236 {"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
4237 0, numericStringValidate, numericStringNormalize, NULL},
4238 {"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
4239 0, NULL, NULL, NULL},
4240 {"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
4241 0, oidValidate, NULL, NULL},
4242 {"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
4243 0, IA5StringValidate, IA5StringNormalize, NULL},
4244 {"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
4245 0, blobValidate, NULL, NULL},
4246 {"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
4247 0, UTF8StringValidate, UTF8StringNormalize, NULL},
4248 {"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
4249 0, NULL, NULL, NULL},
4250 {"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
4251 0, NULL, NULL, NULL},
4252 {"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
4253 0, printableStringValidate, IA5StringNormalize, NULL},
4254 {"( 1.3.6.1.4.1.1466.115.121.1.45 DESC 'SubtreeSpecification' "
4255 X_BINARY X_NOT_H_R ")",
4256 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
4257 {"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
4258 X_BINARY X_NOT_H_R ")",
4259 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4260 {"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
4261 0, printableStringValidate, telephoneNumberNormalize, NULL},
4262 {"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
4263 0, NULL, NULL, NULL},
4264 {"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
4265 0, printablesStringValidate, IA5StringNormalize, NULL},
4266 #ifdef SUPPORT_OBSOLETE_UTC_SYNTAX
4267 {"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
4268 0, utcTimeValidate, utcTimeNormalize, NULL},
4270 {"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
4271 0, NULL, NULL, NULL},
4272 {"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
4273 0, NULL, NULL, NULL},
4274 {"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
4275 0, NULL, NULL, NULL},
4276 {"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
4277 0, NULL, NULL, NULL},
4278 {"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
4279 0, NULL, NULL, NULL},
4281 /* RFC 2307 NIS Syntaxes */
4282 {"( 1.3.6.1.1.1.0.0 DESC 'RFC2307 NIS Netgroup Triple' )",
4283 0, nisNetgroupTripleValidate, NULL, NULL},
4284 {"( 1.3.6.1.1.1.0.1 DESC 'RFC2307 Boot Parameter' )",
4285 0, bootParameterValidate, NULL, NULL},
4289 /* These OIDs are not published yet, but will be in the next
4290 * I-D for PKIX LDAPv3 schema as have been advanced by David
4291 * Chadwick in private mail.
4293 {"( 1.2.826.0.1.3344810.7.1 DESC 'Serial Number and Issuer' )",
4294 0, NULL, NULL, NULL},
4297 /* OpenLDAP Experimental Syntaxes */
4298 #ifdef SLAPD_ACI_ENABLED
4299 {"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
4301 UTF8StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */,
4305 #ifdef SLAPD_AUTHPASSWD
4306 /* needs updating */
4307 {"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
4308 SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
4311 /* OpenLDAP Void Syntax */
4312 {"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' )" ,
4313 SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
4314 {NULL, 0, NULL, NULL, NULL}
4318 * Other matching rules in X.520 that we do not use (yet):
4320 * 2.5.13.9 numericStringOrderingMatch
4321 * 2.5.13.18 octetStringOrderingMatch
4322 * 2.5.13.19 octetStringSubstringsMatch
4323 * 2.5.13.25 uTCTimeMatch
4324 * 2.5.13.26 uTCTimeOrderingMatch
4325 * 2.5.13.31 directoryStringFirstComponentMatch
4326 * 2.5.13.32 wordMatch
4327 * 2.5.13.33 keywordMatch
4328 * 2.5.13.35 certificateMatch
4329 * 2.5.13.36 certificatePairExactMatch
4330 * 2.5.13.37 certificatePairMatch
4331 * 2.5.13.38 certificateListExactMatch
4332 * 2.5.13.39 certificateListMatch
4333 * 2.5.13.40 algorithmIdentifierMatch
4334 * 2.5.13.41 storedPrefixMatch
4335 * 2.5.13.42 attributeCertificateMatch
4336 * 2.5.13.43 readerAndKeyIDMatch
4337 * 2.5.13.44 attributeIntegrityMatch
4339 static struct mrule_defs_rec {
4341 slap_mask_t mrd_usage;
4342 slap_mr_convert_func * mrd_convert;
4343 slap_mr_normalize_func * mrd_normalize;
4344 slap_mr_match_func * mrd_match;
4345 slap_mr_indexer_func * mrd_indexer;
4346 slap_mr_filter_func * mrd_filter;
4348 char * mrd_associated;
4351 * EQUALITY matching rules must be listed after associated APPROX
4352 * matching rules. So, we list all APPROX matching rules first.
4354 {"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
4355 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4356 SLAP_MR_HIDE | SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
4358 directoryStringApproxMatch,
4359 directoryStringApproxIndexer,
4360 directoryStringApproxFilter,
4363 {"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
4364 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4365 SLAP_MR_HIDE | SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
4367 IA5StringApproxMatch,
4368 IA5StringApproxIndexer,
4369 IA5StringApproxFilter,
4373 * Other matching rules
4376 {"( 2.5.13.0 NAME 'objectIdentifierMatch' "
4377 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4378 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4380 objectIdentifierMatch, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
4383 {"( 2.5.13.1 NAME 'distinguishedNameMatch' "
4384 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4385 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4387 dnMatch, dnIndexer, dnFilter,
4390 {"( 2.5.13.2 NAME 'caseIgnoreMatch' "
4391 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4392 SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
4394 caseIgnoreMatch, caseExactIgnoreIndexer, caseExactIgnoreFilter,
4395 directoryStringApproxMatchOID },
4397 {"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
4398 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4401 caseIgnoreOrderingMatch, NULL, NULL,
4404 {"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
4405 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4406 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4408 caseExactIgnoreSubstringsMatch,
4409 caseExactIgnoreSubstringsIndexer,
4410 caseExactIgnoreSubstringsFilter,
4413 {"( 2.5.13.5 NAME 'caseExactMatch' "
4414 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4415 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4417 caseExactMatch, caseExactIgnoreIndexer, caseExactIgnoreFilter,
4418 directoryStringApproxMatchOID },
4420 {"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
4421 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4424 caseExactOrderingMatch, NULL, NULL,
4427 {"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
4428 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4429 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4431 caseExactIgnoreSubstringsMatch,
4432 caseExactIgnoreSubstringsIndexer,
4433 caseExactIgnoreSubstringsFilter,
4436 {"( 2.5.13.8 NAME 'numericStringMatch' "
4437 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
4438 SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
4441 caseIgnoreIA5Indexer,
4442 caseIgnoreIA5Filter,
4445 {"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
4446 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4447 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4449 caseIgnoreIA5SubstringsMatch,
4450 caseIgnoreIA5SubstringsIndexer,
4451 caseIgnoreIA5SubstringsFilter,
4454 {"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
4455 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
4456 SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
4458 caseIgnoreListMatch, NULL, NULL,
4461 {"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
4462 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4463 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4465 caseIgnoreListSubstringsMatch, NULL, NULL,
4468 {"( 2.5.13.13 NAME 'booleanMatch' "
4469 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
4470 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4472 booleanMatch, NULL, NULL,
4475 {"( 2.5.13.14 NAME 'integerMatch' "
4476 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4477 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4479 integerMatch, integerIndexer, integerFilter,
4482 {"( 2.5.13.15 NAME 'integerOrderingMatch' "
4483 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4486 integerOrderingMatch, NULL, NULL,
4489 {"( 2.5.13.16 NAME 'bitStringMatch' "
4490 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
4491 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4493 bitStringMatch, bitStringIndexer, bitStringFilter,
4496 {"( 2.5.13.17 NAME 'octetStringMatch' "
4497 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4498 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4500 octetStringMatch, octetStringIndexer, octetStringFilter,
4503 {"( 2.5.13.20 NAME 'telephoneNumberMatch' "
4504 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
4505 SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
4507 telephoneNumberMatch,
4508 telephoneNumberIndexer,
4509 telephoneNumberFilter,
4512 {"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
4513 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4514 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4516 telephoneNumberSubstringsMatch,
4517 telephoneNumberSubstringsIndexer,
4518 telephoneNumberSubstringsFilter,
4521 {"( 2.5.13.22 NAME 'presentationAddressMatch' "
4522 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
4523 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4528 {"( 2.5.13.23 NAME 'uniqueMemberMatch' "
4529 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
4530 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4532 uniqueMemberMatch, NULL, NULL,
4535 {"( 2.5.13.24 NAME 'protocolInformationMatch' "
4536 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
4537 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4539 protocolInformationMatch, NULL, NULL,
4542 {"( 2.5.13.27 NAME 'generalizedTimeMatch' "
4543 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4544 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4546 generalizedTimeMatch, NULL, NULL,
4549 {"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
4550 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4553 generalizedTimeOrderingMatch, NULL, NULL,
4556 {"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
4557 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4558 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4560 integerFirstComponentMatch, NULL, NULL,
4563 {"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
4564 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4565 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4567 objectIdentifierFirstComponentMatch, NULL, NULL,
4571 {"( 2.5.13.34 NAME 'certificateExactMatch' "
4572 "SYNTAX 1.2.826.0.1.3344810.7.1 )",
4573 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4574 certificateExactConvert, NULL,
4575 certificateExactMatch,
4576 certificateExactIndexer, certificateExactFilter,
4580 {"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
4581 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4582 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4584 caseExactIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
4585 IA5StringApproxMatchOID },
4587 {"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
4588 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4589 SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
4591 caseIgnoreIA5Match, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
4592 IA5StringApproxMatchOID },
4594 {"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
4595 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4598 caseIgnoreIA5SubstringsMatch,
4599 caseIgnoreIA5SubstringsIndexer,
4600 caseIgnoreIA5SubstringsFilter,
4603 {"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
4604 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4607 caseExactIA5SubstringsMatch,
4608 caseExactIA5SubstringsIndexer,
4609 caseExactIA5SubstringsFilter,
4612 #ifdef SLAPD_AUTHPASSWD
4613 /* needs updating */
4614 {"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
4615 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4618 authPasswordMatch, NULL, NULL,
4622 #ifdef SLAPD_ACI_ENABLED
4623 {"( 1.3.6.1.4.1.4203.666.4.2 NAME 'OpenLDAPaciMatch' "
4624 "SYNTAX 1.3.6.1.4.1.4203.666.2.1 )",
4627 OpenLDAPaciMatch, NULL, NULL,
4631 {"( 1.2.840.113556.1.4.803 NAME 'integerBitAndMatch' "
4632 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4635 integerBitAndMatch, NULL, NULL,
4638 {"( 1.2.840.113556.1.4.804 NAME 'integerBitOrMatch' "
4639 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4642 integerBitOrMatch, NULL, NULL,
4645 {NULL, SLAP_MR_NONE, NULL, NULL, NULL, NULL}
4649 slap_schema_init( void )
4654 /* we should only be called once (from main) */
4655 assert( schema_init_done == 0 );
4657 for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
4658 res = register_syntax( syntax_defs[i].sd_desc,
4659 syntax_defs[i].sd_flags,
4660 syntax_defs[i].sd_validate,
4661 syntax_defs[i].sd_normalize,
4662 syntax_defs[i].sd_pretty
4663 #ifdef SLAPD_BINARY_CONVERSION
4665 syntax_defs[i].sd_ber2str,
4666 syntax_defs[i].sd_str2ber
4671 fprintf( stderr, "slap_schema_init: Error registering syntax %s\n",
4672 syntax_defs[i].sd_desc );
4677 for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
4678 if( mrule_defs[i].mrd_usage == SLAP_MR_NONE ) {
4680 "slap_schema_init: Ingoring unusable matching rule %s\n",
4681 mrule_defs[i].mrd_desc );
4685 res = register_matching_rule(
4686 mrule_defs[i].mrd_desc,
4687 mrule_defs[i].mrd_usage,
4688 mrule_defs[i].mrd_convert,
4689 mrule_defs[i].mrd_normalize,
4690 mrule_defs[i].mrd_match,
4691 mrule_defs[i].mrd_indexer,
4692 mrule_defs[i].mrd_filter,
4693 mrule_defs[i].mrd_associated );
4697 "slap_schema_init: Error registering matching rule %s\n",
4698 mrule_defs[i].mrd_desc );
4703 for ( i=0; i < (int)(sizeof(mr_ptr)/sizeof(mr_ptr[0])); i++ )
4704 *mr_ptr[i].mr = mr_find( mr_ptr[i].oid );
4706 res = slap_schema_load();
4707 schema_init_done = 1;
4712 schema_destroy( void )
4718 for ( i=0; i < (int)(sizeof(mr_ptr)/sizeof(mr_ptr[0])); i++ )
4719 *mr_ptr[i].mr = NULL;