1 /* schema_init.c - init builtin schema */
4 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/string.h>
14 #include <ac/socket.h>
19 #include "ldap_utf8.h"
21 #include "lutil_hash.h"
22 /* We should replace MD5 with a faster hash */
23 #define HASH_BYTES LUTIL_HASH_BYTES
24 #define HASH_CONTEXT lutil_HASH_CTX
25 #define HASH_Init(c) lutil_HASHInit(c)
26 #define HASH_Update(c,buf,len) lutil_HASHUpdate(c,buf,len)
27 #define HASH_Final(d,c) lutil_HASHFinal(d,c)
29 /* recycled validatation routines */
30 #define berValidate blobValidate
32 /* unimplemented pretters */
34 #define integerPretty NULL
36 /* recycled matching routines */
37 #define bitStringMatch octetStringMatch
38 #define integerMatch caseIgnoreIA5Match
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
47 /* approx matching rules */
48 #define directoryStringApproxMatchOID "1.3.6.1.4.1.4203.666.4.4"
49 #define directoryStringApproxMatch approxMatch
50 #define directoryStringApproxIndexer approxIndexer
51 #define directoryStringApproxFilter approxFilter
52 #define IA5StringApproxMatchOID "1.3.6.1.4.1.4203.666.4.5"
53 #define IA5StringApproxMatch approxMatch
54 #define IA5StringApproxIndexer approxIndexer
55 #define IA5StringApproxFilter approxFilter
57 /* orderring matching rules */
58 #define caseIgnoreOrderingMatch caseIgnoreMatch
59 #define caseExactOrderingMatch caseExactMatch
61 /* unimplemented matching routines */
62 #define caseIgnoreListMatch NULL
63 #define caseIgnoreListSubstringsMatch NULL
64 #define protocolInformationMatch NULL
65 #define integerFirstComponentMatch NULL
67 #define OpenLDAPaciMatch NULL
68 #define authPasswordMatch NULL
70 /* recycled indexing/filtering routines */
71 #define dnIndexer caseIgnoreIndexer
72 #define dnFilter caseIgnoreFilter
73 #define integerIndexer caseIgnoreIA5Indexer
74 #define integerFilter caseIgnoreIA5Filter
76 #define telephoneNumberIndexer caseIgnoreIA5Indexer
77 #define telephoneNumberFilter caseIgnoreIA5Filter
78 #define telephoneNumberSubstringsIndexer caseIgnoreIA5SubstringsIndexer
79 #define telephoneNumberSubstringsFilter caseIgnoreIA5SubstringsFilter
81 static char *strcasechr( const char *str, int c )
83 char *lower = strchr( str, TOLOWER(c) );
84 char *upper = strchr( str, TOUPPER(c) );
86 if( lower && upper ) {
87 return lower < upper ? lower : upper;
101 struct berval *value,
102 void *assertedValue )
104 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
107 match = memcmp( value->bv_val,
108 ((struct berval *) assertedValue)->bv_val,
116 /* Index generation function */
117 int octetStringIndexer(
122 struct berval *prefix,
123 struct berval **values,
124 struct berval ***keysp )
128 struct berval **keys;
129 HASH_CONTEXT HASHcontext;
130 unsigned char HASHdigest[HASH_BYTES];
131 struct berval digest;
132 digest.bv_val = HASHdigest;
133 digest.bv_len = sizeof(HASHdigest);
135 /* we should have at least one value at this point */
136 assert( values != NULL && values[0] != NULL );
138 for( i=0; values[i] != NULL; i++ ) {
139 /* just count them */
142 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
144 slen = strlen( syntax->ssyn_oid );
145 mlen = strlen( mr->smr_oid );
147 for( i=0; values[i] != NULL; i++ ) {
148 HASH_Init( &HASHcontext );
149 if( prefix != NULL && prefix->bv_len > 0 ) {
150 HASH_Update( &HASHcontext,
151 prefix->bv_val, prefix->bv_len );
153 HASH_Update( &HASHcontext,
154 syntax->ssyn_oid, slen );
155 HASH_Update( &HASHcontext,
157 HASH_Update( &HASHcontext,
158 values[i]->bv_val, values[i]->bv_len );
159 HASH_Final( HASHdigest, &HASHcontext );
161 keys[i] = ber_bvdup( &digest );
171 /* Index generation function */
172 int octetStringFilter(
177 struct berval *prefix,
179 struct berval ***keysp )
182 struct berval **keys;
183 HASH_CONTEXT HASHcontext;
184 unsigned char HASHdigest[HASH_BYTES];
185 struct berval *value = (struct berval *) assertValue;
186 struct berval digest;
187 digest.bv_val = HASHdigest;
188 digest.bv_len = sizeof(HASHdigest);
190 slen = strlen( syntax->ssyn_oid );
191 mlen = strlen( mr->smr_oid );
193 keys = ch_malloc( sizeof( struct berval * ) * 2 );
195 HASH_Init( &HASHcontext );
196 if( prefix != NULL && prefix->bv_len > 0 ) {
197 HASH_Update( &HASHcontext,
198 prefix->bv_val, prefix->bv_len );
200 HASH_Update( &HASHcontext,
201 syntax->ssyn_oid, slen );
202 HASH_Update( &HASHcontext,
204 HASH_Update( &HASHcontext,
205 value->bv_val, value->bv_len );
206 HASH_Final( HASHdigest, &HASHcontext );
208 keys[0] = ber_bvdup( &digest );
224 if( in->bv_len == 0 ) return LDAP_SUCCESS;
226 dn = ch_strdup( in->bv_val );
229 return LDAP_INVALID_SYNTAX;
231 } else if ( strlen( in->bv_val ) != in->bv_len ) {
232 rc = LDAP_INVALID_SYNTAX;
234 } else if ( dn_validate( dn ) == NULL ) {
235 rc = LDAP_INVALID_SYNTAX;
249 struct berval **normalized )
253 if ( val->bv_len != 0 ) {
255 #ifdef USE_DN_NORMALIZE
256 out = ber_bvstr( UTF8normalize( val->bv_val, UTF8_CASEFOLD ) );
258 out = ber_bvdup( val );
259 ldap_pvt_str2upper( out->bv_val );
261 dn = dn_validate( out->bv_val );
265 return LDAP_INVALID_SYNTAX;
269 out->bv_len = strlen( dn );
271 out = ber_bvdup( val );
284 struct berval *value,
285 void *assertedValue )
288 struct berval *asserted = (struct berval *) assertedValue;
290 match = value->bv_len - asserted->bv_len;
293 #ifdef USE_DN_NORMALIZE
294 match = strcmp( value->bv_val, asserted->bv_val );
296 match = strcasecmp( value->bv_val, asserted->bv_val );
301 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
302 "dnMatch: %d\n %s\n %s\n", match,
303 value->bv_val, asserted->bv_val ));
305 Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
306 match, value->bv_val, asserted->bv_val );
322 if( in->bv_len == 0 ) return LDAP_SUCCESS;
324 dn = ber_bvdup( in );
326 if( dn->bv_val[dn->bv_len-1] == '\'' ) {
327 /* assume presence of optional UID */
330 for(i=dn->bv_len-2; i>2; i--) {
331 if( dn->bv_val[i] != '0' && dn->bv_val[i] != '1' ) {
335 if( dn->bv_val[i] != '\'' ) {
336 return LDAP_INVALID_SYNTAX;
338 if( dn->bv_val[i-1] != 'B' ) {
339 return LDAP_INVALID_SYNTAX;
341 if( dn->bv_val[i-2] != '#' ) {
342 return LDAP_INVALID_SYNTAX;
345 /* trim the UID to allow use of dn_validate */
346 dn->bv_val[i-2] = '\0';
349 rc = dn_validate( dn->bv_val ) == NULL
350 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
360 struct berval **normalized )
362 struct berval *out = ber_bvdup( val );
364 if( out->bv_len != 0 ) {
368 ber_len_t uidlen = 0;
370 if( out->bv_val[out->bv_len-1] == '\'' ) {
371 /* assume presence of optional UID */
372 uid = strrchr( out->bv_val, '#' );
376 return LDAP_INVALID_SYNTAX;
379 uidlen = out->bv_len - (out->bv_val - uid);
380 /* temporarily trim the UID */
384 #ifdef USE_DN_NORMALIZE
385 dn = dn_normalize( out->bv_val );
387 dn = dn_validate( out->bv_val );
392 return LDAP_INVALID_SYNTAX;
398 /* restore the separator */
401 SAFEMEMCPY( &dn[dnlen], uid, uidlen );
405 out->bv_len = dnlen + uidlen;
417 /* any value allowed */
426 /* any value allowed */
437 /* very unforgiving validation, requires no normalization
438 * before simplistic matching
440 if( in->bv_len < 3 ) {
441 return LDAP_INVALID_SYNTAX;
444 if( in->bv_val[0] != 'B' ||
445 in->bv_val[1] != '\'' ||
446 in->bv_val[in->bv_len-1] != '\'' )
448 return LDAP_INVALID_SYNTAX;
451 for( i=in->bv_len-2; i>1; i-- ) {
452 if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
453 return LDAP_INVALID_SYNTAX;
461 * Handling boolean syntax and matching is quite rigid.
462 * A more flexible approach would be to allow a variety
463 * of strings to be normalized and prettied into TRUE
471 /* very unforgiving validation, requires no normalization
472 * before simplistic matching
475 if( in->bv_len == 4 ) {
476 if( !memcmp( in->bv_val, "TRUE", 4 ) ) {
479 } else if( in->bv_len == 5 ) {
480 if( !memcmp( in->bv_val, "FALSE", 5 ) ) {
485 return LDAP_INVALID_SYNTAX;
494 struct berval *value,
495 void *assertedValue )
497 /* simplistic matching allowed by rigid validation */
498 struct berval *asserted = (struct berval *) assertedValue;
499 *matchp = value->bv_len != asserted->bv_len;
510 unsigned char *u = in->bv_val;
512 if( !in->bv_len ) return LDAP_INVALID_SYNTAX;
514 for( count = in->bv_len; count > 0; count-=len, u+=len ) {
515 /* get the length indicated by the first byte */
516 len = LDAP_UTF8_CHARLEN( u );
518 /* should not be zero */
519 if( len == 0 ) return LDAP_INVALID_SYNTAX;
521 /* make sure len corresponds with the offset
522 to the next character */
523 if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
526 if( count != 0 ) return LDAP_INVALID_SYNTAX;
535 struct berval **normalized )
537 struct berval *newval;
540 newval = ch_malloc( sizeof( struct berval ) );
544 /* Ignore initial whitespace */
545 while ( ldap_utf8_isspace( p ) ) {
551 return LDAP_INVALID_SYNTAX;
554 newval->bv_val = ch_strdup( p );
555 p = q = newval->bv_val;
561 if ( ldap_utf8_isspace( p ) ) {
562 len = LDAP_UTF8_COPY(q,p);
567 /* Ignore the extra whitespace */
568 while ( ldap_utf8_isspace( p ) ) {
572 len = LDAP_UTF8_COPY(q,p);
579 assert( *newval->bv_val );
580 assert( newval->bv_val < p );
583 /* cannot start with a space */
584 assert( !ldap_utf8_isspace(newval->bv_val) );
587 * If the string ended in space, backup the pointer one
588 * position. One is enough because the above loop collapsed
589 * all whitespace to a single space.
596 /* cannot end with a space */
597 assert( !ldap_utf8_isspace( LDAP_UTF8_PREV(q) ) );
602 newval->bv_len = q - newval->bv_val;
603 *normalized = newval;
608 /* Returns Unicode cannonically normalized copy of a substring assertion
609 * Skipping attribute description */
610 SubstringsAssertion *
611 UTF8SubstringsassertionNormalize(
612 SubstringsAssertion *sa,
615 SubstringsAssertion *nsa;
618 nsa = (SubstringsAssertion *)ch_calloc( 1, sizeof(SubstringsAssertion) );
623 if( sa->sa_initial != NULL ) {
624 nsa->sa_initial = ber_bvstr( UTF8normalize( sa->sa_initial->bv_val, casefold ) );
625 if( nsa->sa_initial == NULL ) {
630 if( sa->sa_any != NULL ) {
631 for( i=0; sa->sa_any[i] != NULL; i++ ) {
634 nsa->sa_any = (struct berval **)ch_malloc( (i + 1) * sizeof(struct berval *) );
635 for( i=0; sa->sa_any[i] != NULL; i++ ) {
636 nsa->sa_any[i] = ber_bvstr( UTF8normalize( sa->sa_any[i]->bv_val, casefold ) );
637 if( nsa->sa_any[i] == NULL ) {
641 nsa->sa_any[i] = NULL;
644 if( sa->sa_final != NULL ) {
645 nsa->sa_final = ber_bvstr( UTF8normalize( sa->sa_final->bv_val, casefold ) );
646 if( nsa->sa_final == NULL ) {
654 ch_free( nsa->sa_final );
655 ber_bvecfree( nsa->sa_any );
656 ch_free( nsa->sa_initial );
661 #if defined(SLAPD_APPROX_MULTISTRING)
663 #if defined(SLAPD_APPROX_INITIALS)
664 #define SLAPD_APPROX_DELIMITER "._ "
665 #define SLAPD_APPROX_WORDLEN 2
667 #define SLAPD_APPROX_DELIMITER " "
668 #define SLAPD_APPROX_WORDLEN 1
677 struct berval *value,
678 void *assertedValue )
680 char *val, *assertv, **values, **words, *c;
681 int i, count, len, nextchunk=0, nextavail=0;
684 /* Isolate how many words there are */
685 val = ch_strdup( value->bv_val );
686 for( c=val,count=1; *c; c++ ) {
687 c = strpbrk( c, SLAPD_APPROX_DELIMITER );
688 if ( c == NULL ) break;
693 /* Get a phonetic copy of each word */
694 words = (char **)ch_malloc( count * sizeof(char *) );
695 values = (char **)ch_malloc( count * sizeof(char *) );
696 for( c=val,i=0; i<count; i++,c+=strlen(c)+1 ) {
698 values[i] = phonetic(c);
702 /* Work through the asserted value's words, to see if at least some
703 of the words are there, in the same order. */
704 assertv = ch_strdup( ((struct berval *)assertedValue)->bv_val );
706 while ( nextchunk < ((struct berval *)assertedValue)->bv_len ) {
707 len = strcspn( assertv + nextchunk, SLAPD_APPROX_DELIMITER);
712 #if defined(SLAPD_APPROX_INITIALS)
713 else if( len == 1 ) {
714 /* Single letter words need to at least match one word's initial */
715 for( i=nextavail; i<count; i++ )
716 if( !strncasecmp( assertv+nextchunk, words[i], 1 )) {
723 /* Isolate the next word in the asserted value and phonetic it */
724 assertv[nextchunk+len] = '\0';
725 val = phonetic( assertv + nextchunk );
727 /* See if this phonetic chunk is in the remaining words of *value */
728 for( i=nextavail; i<count; i++ ){
729 if( !strcmp( val, values[i] ) ){
736 /* This chunk in the asserted value was NOT within the *value. */
742 /* Go on to the next word in the asserted value */
746 /* If some of the words were seen, call it a match */
747 if( nextavail > 0 ) {
756 for( i=0; i<count; i++ ) {
757 ch_free( values[i] );
773 struct berval *prefix,
774 struct berval **values,
775 struct berval ***keysp )
778 int i,j, len, wordcount, keycount=0;
779 struct berval **newkeys, **keys=NULL;
782 for( j=0; values[j] != NULL; j++ ) {
784 /* Isolate how many words there are. There will be a key for each */
785 val = ch_strdup( values[j]->bv_val );
786 for( wordcount=0,c=val; *c; c++) {
787 len = strcspn(c, SLAPD_APPROX_DELIMITER);
788 if( len >= SLAPD_APPROX_WORDLEN ) wordcount++;
790 if (*c == '\0') break;
794 /* Allocate/increase storage to account for new keys */
795 newkeys = (struct berval **)ch_malloc( (keycount + wordcount + 1)
796 * sizeof(struct berval *) );
797 memcpy( newkeys, keys, keycount * sizeof(struct berval *) );
798 if( keys ) ch_free( keys );
801 /* Get a phonetic copy of each word */
802 for( c=val,i=0; i<wordcount; c+=len+1 ) {
804 if( len < SLAPD_APPROX_WORDLEN ) continue;
805 keys[keycount] = (struct berval *)ch_malloc( sizeof(struct berval) );
806 keys[keycount]->bv_val = phonetic( c );
807 keys[keycount]->bv_len = strlen( keys[keycount]->bv_val );
814 keys[keycount] = NULL;
827 struct berval *prefix,
829 struct berval ***keysp )
833 struct berval **keys;
836 /* Isolate how many words there are. There will be a key for each */
837 val = ch_strdup( ((struct berval *)assertValue)->bv_val );
838 for( count=0,c=val; *c; c++) {
839 len = strcspn(c, SLAPD_APPROX_DELIMITER);
840 if( len >= SLAPD_APPROX_WORDLEN ) count++;
842 if (*c == '\0') break;
846 /* Allocate storage for new keys */
847 keys = (struct berval **)ch_malloc( (count + 1) * sizeof(struct berval *) );
849 /* Get a phonetic copy of each word */
850 for( c=val,i=0; i<count; c+=len+1 ) {
852 if( len < SLAPD_APPROX_WORDLEN ) continue;
853 keys[i] = (struct berval *)ch_malloc( sizeof(struct berval) );
854 keys[i]->bv_val = phonetic( c );
855 keys[i]->bv_len = strlen( keys[i]->bv_val );
869 /* No other form of Approximate Matching is defined */
877 struct berval *value,
878 void *assertedValue )
880 char *vapprox, *avapprox;
882 vapprox = phonetic( value->bv_val );
883 avapprox = phonetic( ((struct berval *)assertedValue)->bv_val);
885 *matchp = strcmp( vapprox, avapprox );
899 struct berval *prefix,
900 struct berval **values,
901 struct berval ***keysp )
904 struct berval **keys;
907 for( i=0; values[i] != NULL; i++ ) {
908 /* just count them */
912 keys = (struct berval **)ch_malloc( sizeof( struct berval * ) * (i+1) );
914 /* Copy each value and run it through phonetic() */
915 for( i=0; values[i] != NULL; i++ ) {
916 keys[i] = ch_malloc( sizeof( struct berval * ) );
917 keys[i]->bv_val = phonetic( values[i]->bv_val );
918 keys[i]->bv_len = strlen( keys[i]->bv_val );
933 struct berval *prefix,
935 struct berval ***keysp )
937 struct berval **keys;
940 keys = (struct berval **)ch_malloc( sizeof( struct berval * ) * 2 );
942 /* Copy the value and run it through phonetic() */
943 keys[0] = ch_malloc( sizeof( struct berval * ) );
944 keys[0]->bv_val = phonetic( ((struct berval *)assertValue)->bv_val );
945 keys[0]->bv_len = strlen( keys[0]->bv_val );
960 struct berval *value,
961 void *assertedValue )
963 *matchp = UTF8normcmp( value->bv_val,
964 ((struct berval *) assertedValue)->bv_val,
970 caseExactSubstringsMatch(
975 struct berval *value,
976 void *assertedValue )
979 SubstringsAssertion *sub;
985 nav = UTF8normalize( value->bv_val, UTF8_NOCASEFOLD );
991 left.bv_len = strlen( nav );
993 sub = UTF8SubstringsassertionNormalize( assertedValue, UTF8_NOCASEFOLD );
999 /* Add up asserted input length */
1000 if( sub->sa_initial ) {
1001 inlen += sub->sa_initial->bv_len;
1004 for(i=0; sub->sa_any[i] != NULL; i++) {
1005 inlen += sub->sa_any[i]->bv_len;
1008 if( sub->sa_final ) {
1009 inlen += sub->sa_final->bv_len;
1012 if( sub->sa_initial ) {
1013 if( inlen > left.bv_len ) {
1018 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
1019 sub->sa_initial->bv_len );
1025 left.bv_val += sub->sa_initial->bv_len;
1026 left.bv_len -= sub->sa_initial->bv_len;
1027 inlen -= sub->sa_initial->bv_len;
1030 if( sub->sa_final ) {
1031 if( inlen > left.bv_len ) {
1036 match = strncmp( sub->sa_final->bv_val,
1037 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
1038 sub->sa_final->bv_len );
1044 left.bv_len -= sub->sa_final->bv_len;
1045 inlen -= sub->sa_final->bv_len;
1049 for(i=0; sub->sa_any[i]; i++) {
1054 if( inlen > left.bv_len ) {
1055 /* not enough length */
1060 if( sub->sa_any[i]->bv_len == 0 ) {
1064 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
1071 idx = p - left.bv_val;
1072 assert( idx < left.bv_len );
1074 if( idx >= left.bv_len ) {
1075 /* this shouldn't happen */
1082 if( sub->sa_any[i]->bv_len > left.bv_len ) {
1083 /* not enough left */
1088 match = strncmp( left.bv_val,
1089 sub->sa_any[i]->bv_val,
1090 sub->sa_any[i]->bv_len );
1098 left.bv_val += sub->sa_any[i]->bv_len;
1099 left.bv_len -= sub->sa_any[i]->bv_len;
1100 inlen -= sub->sa_any[i]->bv_len;
1107 ch_free( sub->sa_final );
1108 ber_bvecfree( sub->sa_any );
1109 ch_free( sub->sa_initial );
1113 return LDAP_SUCCESS;
1116 /* Index generation function */
1117 int caseExactIndexer(
1122 struct berval *prefix,
1123 struct berval **values,
1124 struct berval ***keysp )
1128 struct berval **keys;
1129 HASH_CONTEXT HASHcontext;
1130 unsigned char HASHdigest[HASH_BYTES];
1131 struct berval digest;
1132 digest.bv_val = HASHdigest;
1133 digest.bv_len = sizeof(HASHdigest);
1135 /* we should have at least one value at this point */
1136 assert( values != NULL && values[0] != NULL );
1138 for( i=0; values[i] != NULL; i++ ) {
1139 /* just count them */
1142 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
1144 slen = strlen( syntax->ssyn_oid );
1145 mlen = strlen( mr->smr_oid );
1147 for( i=0; values[i] != NULL; i++ ) {
1148 struct berval *value;
1149 value = ber_bvstr( UTF8normalize( values[i]->bv_val,
1150 UTF8_NOCASEFOLD ) );
1152 HASH_Init( &HASHcontext );
1153 if( prefix != NULL && prefix->bv_len > 0 ) {
1154 HASH_Update( &HASHcontext,
1155 prefix->bv_val, prefix->bv_len );
1157 HASH_Update( &HASHcontext,
1158 syntax->ssyn_oid, slen );
1159 HASH_Update( &HASHcontext,
1160 mr->smr_oid, mlen );
1161 HASH_Update( &HASHcontext,
1162 value->bv_val, value->bv_len );
1163 HASH_Final( HASHdigest, &HASHcontext );
1165 ber_bvfree( value );
1167 keys[i] = ber_bvdup( &digest );
1172 return LDAP_SUCCESS;
1175 /* Index generation function */
1176 int caseExactFilter(
1181 struct berval *prefix,
1183 struct berval ***keysp )
1186 struct berval **keys;
1187 HASH_CONTEXT HASHcontext;
1188 unsigned char HASHdigest[HASH_BYTES];
1189 struct berval *value;
1190 struct berval digest;
1191 digest.bv_val = HASHdigest;
1192 digest.bv_len = sizeof(HASHdigest);
1194 slen = strlen( syntax->ssyn_oid );
1195 mlen = strlen( mr->smr_oid );
1197 value = ber_bvstr( UTF8normalize( ((struct berval *) assertValue)->bv_val,
1198 UTF8_NOCASEFOLD ) );
1199 /* This usually happens if filter contains bad UTF8 */
1200 if( value == NULL ) {
1201 keys = ch_malloc( sizeof( struct berval * ) );
1203 return LDAP_SUCCESS;
1206 keys = ch_malloc( sizeof( struct berval * ) * 2 );
1208 HASH_Init( &HASHcontext );
1209 if( prefix != NULL && prefix->bv_len > 0 ) {
1210 HASH_Update( &HASHcontext,
1211 prefix->bv_val, prefix->bv_len );
1213 HASH_Update( &HASHcontext,
1214 syntax->ssyn_oid, slen );
1215 HASH_Update( &HASHcontext,
1216 mr->smr_oid, mlen );
1217 HASH_Update( &HASHcontext,
1218 value->bv_val, value->bv_len );
1219 HASH_Final( HASHdigest, &HASHcontext );
1221 keys[0] = ber_bvdup( &digest );
1225 ber_bvfree( value );
1229 return LDAP_SUCCESS;
1232 /* Substrings Index generation function */
1233 int caseExactSubstringsIndexer(
1238 struct berval *prefix,
1239 struct berval **values,
1240 struct berval ***keysp )
1244 struct berval **keys;
1245 struct berval **nvalues;
1247 HASH_CONTEXT HASHcontext;
1248 unsigned char HASHdigest[HASH_BYTES];
1249 struct berval digest;
1250 digest.bv_val = HASHdigest;
1251 digest.bv_len = sizeof(HASHdigest);
1253 /* we should have at least one value at this point */
1254 assert( values != NULL && values[0] != NULL );
1258 /* create normalized copy of values */
1259 for( i=0; values[i] != NULL; i++ ) {
1262 nvalues = ch_malloc( sizeof( struct berval * ) * (i+1) );
1263 for( i=0; values[i] != NULL; i++ ) {
1264 nvalues[i] = ber_bvstr( UTF8normalize( values[i]->bv_val,
1265 UTF8_NOCASEFOLD ) );
1270 for( i=0; values[i] != NULL; i++ ) {
1271 /* count number of indices to generate */
1272 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
1276 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1277 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1278 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1279 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1281 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1285 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
1286 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1287 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1291 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1292 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1293 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1294 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1296 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1302 /* no keys to generate */
1304 return LDAP_SUCCESS;
1307 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1309 slen = strlen( syntax->ssyn_oid );
1310 mlen = strlen( mr->smr_oid );
1313 for( i=0; values[i] != NULL; i++ ) {
1315 struct berval *value;
1317 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
1321 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
1322 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
1324 char pre = SLAP_INDEX_SUBSTR_PREFIX;
1325 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
1327 for( j=0; j<max; j++ ) {
1328 HASH_Init( &HASHcontext );
1329 if( prefix != NULL && prefix->bv_len > 0 ) {
1330 HASH_Update( &HASHcontext,
1331 prefix->bv_val, prefix->bv_len );
1334 HASH_Update( &HASHcontext,
1335 &pre, sizeof( pre ) );
1336 HASH_Update( &HASHcontext,
1337 syntax->ssyn_oid, slen );
1338 HASH_Update( &HASHcontext,
1339 mr->smr_oid, mlen );
1340 HASH_Update( &HASHcontext,
1342 SLAP_INDEX_SUBSTR_MAXLEN );
1343 HASH_Final( HASHdigest, &HASHcontext );
1345 keys[nkeys++] = ber_bvdup( &digest );
1349 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1350 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1352 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
1355 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1356 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1357 HASH_Init( &HASHcontext );
1358 if( prefix != NULL && prefix->bv_len > 0 ) {
1359 HASH_Update( &HASHcontext,
1360 prefix->bv_val, prefix->bv_len );
1362 HASH_Update( &HASHcontext,
1363 &pre, sizeof( pre ) );
1364 HASH_Update( &HASHcontext,
1365 syntax->ssyn_oid, slen );
1366 HASH_Update( &HASHcontext,
1367 mr->smr_oid, mlen );
1368 HASH_Update( &HASHcontext,
1370 HASH_Final( HASHdigest, &HASHcontext );
1372 keys[nkeys++] = ber_bvdup( &digest );
1375 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1376 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1377 HASH_Init( &HASHcontext );
1378 if( prefix != NULL && prefix->bv_len > 0 ) {
1379 HASH_Update( &HASHcontext,
1380 prefix->bv_val, prefix->bv_len );
1382 HASH_Update( &HASHcontext,
1383 &pre, sizeof( pre ) );
1384 HASH_Update( &HASHcontext,
1385 syntax->ssyn_oid, slen );
1386 HASH_Update( &HASHcontext,
1387 mr->smr_oid, mlen );
1388 HASH_Update( &HASHcontext,
1389 &value->bv_val[value->bv_len-j], j );
1390 HASH_Final( HASHdigest, &HASHcontext );
1392 keys[nkeys++] = ber_bvdup( &digest );
1407 ber_bvecfree( nvalues );
1409 return LDAP_SUCCESS;
1412 int caseExactSubstringsFilter(
1417 struct berval *prefix,
1419 struct berval ***keysp )
1421 SubstringsAssertion *sa;
1423 ber_len_t nkeys = 0;
1424 size_t slen, mlen, klen;
1425 struct berval **keys;
1426 HASH_CONTEXT HASHcontext;
1427 unsigned char HASHdigest[HASH_BYTES];
1428 struct berval *value;
1429 struct berval digest;
1431 sa = UTF8SubstringsassertionNormalize( assertValue, UTF8_NOCASEFOLD );
1434 return LDAP_SUCCESS;
1437 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1438 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1443 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1445 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1446 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1447 /* don't bother accounting for stepping */
1448 nkeys += sa->sa_any[i]->bv_len -
1449 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1454 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1455 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1462 return LDAP_SUCCESS;
1465 digest.bv_val = HASHdigest;
1466 digest.bv_len = sizeof(HASHdigest);
1468 slen = strlen( syntax->ssyn_oid );
1469 mlen = strlen( mr->smr_oid );
1471 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1474 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1475 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1477 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1478 value = sa->sa_initial;
1480 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1481 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1483 HASH_Init( &HASHcontext );
1484 if( prefix != NULL && prefix->bv_len > 0 ) {
1485 HASH_Update( &HASHcontext,
1486 prefix->bv_val, prefix->bv_len );
1488 HASH_Update( &HASHcontext,
1489 &pre, sizeof( pre ) );
1490 HASH_Update( &HASHcontext,
1491 syntax->ssyn_oid, slen );
1492 HASH_Update( &HASHcontext,
1493 mr->smr_oid, mlen );
1494 HASH_Update( &HASHcontext,
1495 value->bv_val, klen );
1496 HASH_Final( HASHdigest, &HASHcontext );
1498 keys[nkeys++] = ber_bvdup( &digest );
1501 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1503 pre = SLAP_INDEX_SUBSTR_PREFIX;
1504 klen = SLAP_INDEX_SUBSTR_MAXLEN;
1506 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1507 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
1511 value = sa->sa_any[i];
1514 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
1515 j += SLAP_INDEX_SUBSTR_STEP )
1517 HASH_Init( &HASHcontext );
1518 if( prefix != NULL && prefix->bv_len > 0 ) {
1519 HASH_Update( &HASHcontext,
1520 prefix->bv_val, prefix->bv_len );
1522 HASH_Update( &HASHcontext,
1523 &pre, sizeof( pre ) );
1524 HASH_Update( &HASHcontext,
1525 syntax->ssyn_oid, slen );
1526 HASH_Update( &HASHcontext,
1527 mr->smr_oid, mlen );
1528 HASH_Update( &HASHcontext,
1529 &value->bv_val[j], klen );
1530 HASH_Final( HASHdigest, &HASHcontext );
1532 keys[nkeys++] = ber_bvdup( &digest );
1538 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1539 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1541 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1542 value = sa->sa_final;
1544 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1545 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1547 HASH_Init( &HASHcontext );
1548 if( prefix != NULL && prefix->bv_len > 0 ) {
1549 HASH_Update( &HASHcontext,
1550 prefix->bv_val, prefix->bv_len );
1552 HASH_Update( &HASHcontext,
1553 &pre, sizeof( pre ) );
1554 HASH_Update( &HASHcontext,
1555 syntax->ssyn_oid, slen );
1556 HASH_Update( &HASHcontext,
1557 mr->smr_oid, mlen );
1558 HASH_Update( &HASHcontext,
1559 &value->bv_val[value->bv_len-klen], klen );
1560 HASH_Final( HASHdigest, &HASHcontext );
1562 keys[nkeys++] = ber_bvdup( &digest );
1572 ch_free( sa->sa_final );
1573 ber_bvecfree( sa->sa_any );
1574 ch_free( sa->sa_initial );
1577 return LDAP_SUCCESS;
1586 struct berval *value,
1587 void *assertedValue )
1589 *matchp = UTF8normcmp( value->bv_val,
1590 ((struct berval *) assertedValue)->bv_val,
1592 return LDAP_SUCCESS;
1596 caseIgnoreSubstringsMatch(
1601 struct berval *value,
1602 void *assertedValue )
1605 SubstringsAssertion *sub;
1611 nav = UTF8normalize( value->bv_val, UTF8_CASEFOLD );
1617 left.bv_len = strlen( nav );
1619 sub = UTF8SubstringsassertionNormalize( assertedValue, UTF8_CASEFOLD );
1625 /* Add up asserted input length */
1626 if( sub->sa_initial ) {
1627 inlen += sub->sa_initial->bv_len;
1630 for(i=0; sub->sa_any[i] != NULL; i++) {
1631 inlen += sub->sa_any[i]->bv_len;
1634 if( sub->sa_final ) {
1635 inlen += sub->sa_final->bv_len;
1638 if( sub->sa_initial ) {
1639 if( inlen > left.bv_len ) {
1644 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
1645 sub->sa_initial->bv_len );
1651 left.bv_val += sub->sa_initial->bv_len;
1652 left.bv_len -= sub->sa_initial->bv_len;
1653 inlen -= sub->sa_initial->bv_len;
1656 if( sub->sa_final ) {
1657 if( inlen > left.bv_len ) {
1662 match = strncmp( sub->sa_final->bv_val,
1663 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
1664 sub->sa_final->bv_len );
1670 left.bv_len -= sub->sa_final->bv_len;
1671 inlen -= sub->sa_final->bv_len;
1675 for(i=0; sub->sa_any[i]; i++) {
1680 if( inlen > left.bv_len ) {
1681 /* not enough length */
1686 if( sub->sa_any[i]->bv_len == 0 ) {
1690 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
1697 idx = p - left.bv_val;
1698 assert( idx < left.bv_len );
1700 if( idx >= left.bv_len ) {
1701 /* this shouldn't happen */
1708 if( sub->sa_any[i]->bv_len > left.bv_len ) {
1709 /* not enough left */
1714 match = strncmp( left.bv_val,
1715 sub->sa_any[i]->bv_val,
1716 sub->sa_any[i]->bv_len );
1725 left.bv_val += sub->sa_any[i]->bv_len;
1726 left.bv_len -= sub->sa_any[i]->bv_len;
1727 inlen -= sub->sa_any[i]->bv_len;
1734 ch_free( sub->sa_final );
1735 ber_bvecfree( sub->sa_any );
1736 ch_free( sub->sa_initial );
1740 return LDAP_SUCCESS;
1743 /* Index generation function */
1744 int caseIgnoreIndexer(
1749 struct berval *prefix,
1750 struct berval **values,
1751 struct berval ***keysp )
1755 struct berval **keys;
1756 HASH_CONTEXT HASHcontext;
1757 unsigned char HASHdigest[HASH_BYTES];
1758 struct berval digest;
1759 digest.bv_val = HASHdigest;
1760 digest.bv_len = sizeof(HASHdigest);
1762 /* we should have at least one value at this point */
1763 assert( values != NULL && values[0] != NULL );
1765 for( i=0; values[i] != NULL; i++ ) {
1766 /* just count them */
1769 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
1771 slen = strlen( syntax->ssyn_oid );
1772 mlen = strlen( mr->smr_oid );
1774 for( i=0; values[i] != NULL; i++ ) {
1775 struct berval *value;
1776 value = ber_bvstr( UTF8normalize( values[i]->bv_val, UTF8_CASEFOLD ) );
1777 HASH_Init( &HASHcontext );
1778 if( prefix != NULL && prefix->bv_len > 0 ) {
1779 HASH_Update( &HASHcontext,
1780 prefix->bv_val, prefix->bv_len );
1782 HASH_Update( &HASHcontext,
1783 syntax->ssyn_oid, slen );
1784 HASH_Update( &HASHcontext,
1785 mr->smr_oid, mlen );
1786 HASH_Update( &HASHcontext,
1787 value->bv_val, value->bv_len );
1788 HASH_Final( HASHdigest, &HASHcontext );
1790 ber_bvfree( value );
1792 keys[i] = ber_bvdup( &digest );
1797 return LDAP_SUCCESS;
1800 /* Index generation function */
1801 int caseIgnoreFilter(
1806 struct berval *prefix,
1808 struct berval ***keysp )
1811 struct berval **keys;
1812 HASH_CONTEXT HASHcontext;
1813 unsigned char HASHdigest[HASH_BYTES];
1814 struct berval *value;
1815 struct berval digest;
1816 digest.bv_val = HASHdigest;
1817 digest.bv_len = sizeof(HASHdigest);
1819 slen = strlen( syntax->ssyn_oid );
1820 mlen = strlen( mr->smr_oid );
1822 value = ber_bvstr( UTF8normalize( ((struct berval *) assertValue)->bv_val,
1824 /* This usually happens if filter contains bad UTF8 */
1825 if( value == NULL ) {
1826 keys = ch_malloc( sizeof( struct berval * ) );
1828 return LDAP_SUCCESS;
1831 keys = ch_malloc( sizeof( struct berval * ) * 2 );
1833 HASH_Init( &HASHcontext );
1834 if( prefix != NULL && prefix->bv_len > 0 ) {
1835 HASH_Update( &HASHcontext,
1836 prefix->bv_val, prefix->bv_len );
1838 HASH_Update( &HASHcontext,
1839 syntax->ssyn_oid, slen );
1840 HASH_Update( &HASHcontext,
1841 mr->smr_oid, mlen );
1842 HASH_Update( &HASHcontext,
1843 value->bv_val, value->bv_len );
1844 HASH_Final( HASHdigest, &HASHcontext );
1846 keys[0] = ber_bvdup( &digest );
1849 ber_bvfree( value );
1853 return LDAP_SUCCESS;
1856 /* Substrings Index generation function */
1857 int caseIgnoreSubstringsIndexer(
1862 struct berval *prefix,
1863 struct berval **values,
1864 struct berval ***keysp )
1868 struct berval **keys;
1869 struct berval **nvalues;
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 /* we should have at least one value at this point */
1878 assert( values != NULL && values[0] != NULL );
1882 /* create normalized copy of values */
1883 for( i=0; values[i] != NULL; i++ ) {
1886 nvalues = ch_malloc( sizeof( struct berval * ) * (i+1) );
1887 for( i=0; values[i] != NULL; i++ ) {
1888 nvalues[i] = ber_bvstr( UTF8normalize( values[i]->bv_val,
1894 for( i=0; values[i] != NULL; i++ ) {
1895 /* count number of indices to generate */
1896 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
1900 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1901 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1902 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1903 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1905 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1909 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
1910 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1911 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1915 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1916 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1917 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1918 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1920 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1926 /* no keys to generate */
1928 return LDAP_SUCCESS;
1931 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1933 slen = strlen( syntax->ssyn_oid );
1934 mlen = strlen( mr->smr_oid );
1937 for( i=0; values[i] != NULL; i++ ) {
1939 struct berval *value;
1941 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
1945 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
1946 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
1948 char pre = SLAP_INDEX_SUBSTR_PREFIX;
1949 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
1951 for( j=0; j<max; j++ ) {
1952 HASH_Init( &HASHcontext );
1953 if( prefix != NULL && prefix->bv_len > 0 ) {
1954 HASH_Update( &HASHcontext,
1955 prefix->bv_val, prefix->bv_len );
1958 HASH_Update( &HASHcontext,
1959 &pre, sizeof( pre ) );
1960 HASH_Update( &HASHcontext,
1961 syntax->ssyn_oid, slen );
1962 HASH_Update( &HASHcontext,
1963 mr->smr_oid, mlen );
1964 HASH_Update( &HASHcontext,
1966 SLAP_INDEX_SUBSTR_MAXLEN );
1967 HASH_Final( HASHdigest, &HASHcontext );
1969 keys[nkeys++] = ber_bvdup( &digest );
1973 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1974 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1976 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
1979 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1980 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1981 HASH_Init( &HASHcontext );
1982 if( prefix != NULL && prefix->bv_len > 0 ) {
1983 HASH_Update( &HASHcontext,
1984 prefix->bv_val, prefix->bv_len );
1986 HASH_Update( &HASHcontext,
1987 &pre, sizeof( pre ) );
1988 HASH_Update( &HASHcontext,
1989 syntax->ssyn_oid, slen );
1990 HASH_Update( &HASHcontext,
1991 mr->smr_oid, mlen );
1992 HASH_Update( &HASHcontext,
1994 HASH_Final( HASHdigest, &HASHcontext );
1996 keys[nkeys++] = ber_bvdup( &digest );
1999 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2000 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2001 HASH_Init( &HASHcontext );
2002 if( prefix != NULL && prefix->bv_len > 0 ) {
2003 HASH_Update( &HASHcontext,
2004 prefix->bv_val, prefix->bv_len );
2006 HASH_Update( &HASHcontext,
2007 &pre, sizeof( pre ) );
2008 HASH_Update( &HASHcontext,
2009 syntax->ssyn_oid, slen );
2010 HASH_Update( &HASHcontext,
2011 mr->smr_oid, mlen );
2012 HASH_Update( &HASHcontext,
2013 &value->bv_val[value->bv_len-j], j );
2014 HASH_Final( HASHdigest, &HASHcontext );
2016 keys[nkeys++] = ber_bvdup( &digest );
2030 ber_bvecfree( nvalues );
2031 return LDAP_SUCCESS;
2034 int caseIgnoreSubstringsFilter(
2039 struct berval *prefix,
2041 struct berval ***keysp )
2043 SubstringsAssertion *sa;
2045 ber_len_t nkeys = 0;
2046 size_t slen, mlen, klen;
2047 struct berval **keys;
2048 HASH_CONTEXT HASHcontext;
2049 unsigned char HASHdigest[HASH_BYTES];
2050 struct berval *value;
2051 struct berval digest;
2053 sa = UTF8SubstringsassertionNormalize( assertValue, UTF8_CASEFOLD );
2056 return LDAP_SUCCESS;
2059 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
2060 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2065 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
2067 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2068 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2069 /* don't bother accounting for stepping */
2070 nkeys += sa->sa_any[i]->bv_len -
2071 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2076 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
2077 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2084 return LDAP_SUCCESS;
2087 digest.bv_val = HASHdigest;
2088 digest.bv_len = sizeof(HASHdigest);
2090 slen = strlen( syntax->ssyn_oid );
2091 mlen = strlen( mr->smr_oid );
2093 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2096 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
2097 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2099 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2100 value = sa->sa_initial;
2102 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2103 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2105 HASH_Init( &HASHcontext );
2106 if( prefix != NULL && prefix->bv_len > 0 ) {
2107 HASH_Update( &HASHcontext,
2108 prefix->bv_val, prefix->bv_len );
2110 HASH_Update( &HASHcontext,
2111 &pre, sizeof( pre ) );
2112 HASH_Update( &HASHcontext,
2113 syntax->ssyn_oid, slen );
2114 HASH_Update( &HASHcontext,
2115 mr->smr_oid, mlen );
2116 HASH_Update( &HASHcontext,
2117 value->bv_val, klen );
2118 HASH_Final( HASHdigest, &HASHcontext );
2120 keys[nkeys++] = ber_bvdup( &digest );
2123 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
2125 pre = SLAP_INDEX_SUBSTR_PREFIX;
2126 klen = SLAP_INDEX_SUBSTR_MAXLEN;
2128 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2129 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
2133 value = sa->sa_any[i];
2136 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
2137 j += SLAP_INDEX_SUBSTR_STEP )
2139 HASH_Init( &HASHcontext );
2140 if( prefix != NULL && prefix->bv_len > 0 ) {
2141 HASH_Update( &HASHcontext,
2142 prefix->bv_val, prefix->bv_len );
2144 HASH_Update( &HASHcontext,
2145 &pre, sizeof( pre ) );
2146 HASH_Update( &HASHcontext,
2147 syntax->ssyn_oid, slen );
2148 HASH_Update( &HASHcontext,
2149 mr->smr_oid, mlen );
2150 HASH_Update( &HASHcontext,
2151 &value->bv_val[j], klen );
2152 HASH_Final( HASHdigest, &HASHcontext );
2154 keys[nkeys++] = ber_bvdup( &digest );
2159 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
2160 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2162 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2163 value = sa->sa_final;
2165 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2166 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2168 HASH_Init( &HASHcontext );
2169 if( prefix != NULL && prefix->bv_len > 0 ) {
2170 HASH_Update( &HASHcontext,
2171 prefix->bv_val, prefix->bv_len );
2173 HASH_Update( &HASHcontext,
2174 &pre, sizeof( pre ) );
2175 HASH_Update( &HASHcontext,
2176 syntax->ssyn_oid, slen );
2177 HASH_Update( &HASHcontext,
2178 mr->smr_oid, mlen );
2179 HASH_Update( &HASHcontext,
2180 &value->bv_val[value->bv_len-klen], klen );
2181 HASH_Final( HASHdigest, &HASHcontext );
2183 keys[nkeys++] = ber_bvdup( &digest );
2193 ch_free( sa->sa_final );
2194 ber_bvecfree( sa->sa_any );
2195 ch_free( sa->sa_initial );
2198 return LDAP_SUCCESS;
2204 struct berval *val )
2208 if( val->bv_len == 0 ) {
2209 /* disallow empty strings */
2210 return LDAP_INVALID_SYNTAX;
2213 if( OID_LEADCHAR(val->bv_val[0]) ) {
2215 for(i=1; i < val->bv_len; i++) {
2216 if( OID_SEPARATOR( val->bv_val[i] ) ) {
2217 if( dot++ ) return 1;
2218 } else if ( OID_CHAR( val->bv_val[i] ) ) {
2221 return LDAP_INVALID_SYNTAX;
2225 return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
2227 } else if( DESC_LEADCHAR(val->bv_val[0]) ) {
2228 for(i=1; i < val->bv_len; i++) {
2229 if( !DESC_CHAR(val->bv_val[i] ) ) {
2230 return LDAP_INVALID_SYNTAX;
2234 return LDAP_SUCCESS;
2237 return LDAP_INVALID_SYNTAX;
2243 struct berval *val )
2247 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2249 if( val->bv_val[0] == '+' || val->bv_val[0] == '-' ) {
2250 if( val->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
2251 } else if( !ASCII_DIGIT(val->bv_val[0]) ) {
2252 return LDAP_INVALID_SYNTAX;
2255 for(i=1; i < val->bv_len; i++) {
2256 if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
2259 return LDAP_SUCCESS;
2266 struct berval **normalized )
2269 struct berval *newval;
2275 negative = ( *p == '-' );
2276 if( *p == '-' || *p == '+' ) p++;
2278 /* Ignore leading zeros */
2279 while ( *p == '0' ) p++;
2281 newval = (struct berval *) ch_malloc( sizeof(struct berval) );
2284 newval->bv_val = ch_strdup("0");
2289 newval->bv_val = ch_malloc( val->bv_len + 1 );
2293 newval->bv_val[newval->bv_len++] = '-';
2296 for( ; *p != '\0'; p++ ) {
2297 newval->bv_val[newval->bv_len++] = *p;
2301 *normalized = newval;
2302 return LDAP_SUCCESS;
2306 countryStringValidate(
2308 struct berval *val )
2310 if( val->bv_len != 2 ) return LDAP_INVALID_SYNTAX;
2312 if( !SLAP_PRINTABLE(val->bv_val[0]) ) {
2313 return LDAP_INVALID_SYNTAX;
2315 if( !SLAP_PRINTABLE(val->bv_val[1]) ) {
2316 return LDAP_INVALID_SYNTAX;
2319 return LDAP_SUCCESS;
2323 printableStringValidate(
2325 struct berval *val )
2329 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2331 for(i=0; i < val->bv_len; i++) {
2332 if( !SLAP_PRINTABLE(val->bv_val[i]) ) {
2333 return LDAP_INVALID_SYNTAX;
2337 return LDAP_SUCCESS;
2341 printablesStringValidate(
2343 struct berval *val )
2347 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2349 for(i=0; i < val->bv_len; i++) {
2350 if( !SLAP_PRINTABLES(val->bv_val[i]) ) {
2351 return LDAP_INVALID_SYNTAX;
2355 return LDAP_SUCCESS;
2361 struct berval *val )
2365 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2367 for(i=0; i < val->bv_len; i++) {
2368 if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
2371 return LDAP_SUCCESS;
2378 struct berval **normalized )
2380 struct berval *newval;
2383 newval = ch_malloc( sizeof( struct berval ) );
2387 /* Ignore initial whitespace */
2388 while ( ASCII_SPACE( *p ) ) {
2394 return LDAP_INVALID_SYNTAX;
2397 newval->bv_val = ch_strdup( p );
2398 p = q = newval->bv_val;
2401 if ( ASCII_SPACE( *p ) ) {
2404 /* Ignore the extra whitespace */
2405 while ( ASCII_SPACE( *p ) ) {
2413 assert( *newval->bv_val );
2414 assert( newval->bv_val < p );
2417 /* cannot start with a space */
2418 assert( !ASCII_SPACE(*newval->bv_val) );
2421 * If the string ended in space, backup the pointer one
2422 * position. One is enough because the above loop collapsed
2423 * all whitespace to a single space.
2426 if ( ASCII_SPACE( q[-1] ) ) {
2430 /* cannot end with a space */
2431 assert( !ASCII_SPACE( q[-1] ) );
2433 /* null terminate */
2436 newval->bv_len = q - newval->bv_val;
2437 *normalized = newval;
2439 return LDAP_SUCCESS;
2448 struct berval *value,
2449 void *assertedValue )
2451 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
2454 match = strncmp( value->bv_val,
2455 ((struct berval *) assertedValue)->bv_val,
2460 return LDAP_SUCCESS;
2464 caseExactIA5SubstringsMatch(
2469 struct berval *value,
2470 void *assertedValue )
2473 SubstringsAssertion *sub = assertedValue;
2474 struct berval left = *value;
2478 /* Add up asserted input length */
2479 if( sub->sa_initial ) {
2480 inlen += sub->sa_initial->bv_len;
2483 for(i=0; sub->sa_any[i] != NULL; i++) {
2484 inlen += sub->sa_any[i]->bv_len;
2487 if( sub->sa_final ) {
2488 inlen += sub->sa_final->bv_len;
2491 if( sub->sa_initial ) {
2492 if( inlen > left.bv_len ) {
2497 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
2498 sub->sa_initial->bv_len );
2504 left.bv_val += sub->sa_initial->bv_len;
2505 left.bv_len -= sub->sa_initial->bv_len;
2506 inlen -= sub->sa_initial->bv_len;
2509 if( sub->sa_final ) {
2510 if( inlen > left.bv_len ) {
2515 match = strncmp( sub->sa_final->bv_val,
2516 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
2517 sub->sa_final->bv_len );
2523 left.bv_len -= sub->sa_final->bv_len;
2524 inlen -= sub->sa_final->bv_len;
2528 for(i=0; sub->sa_any[i]; i++) {
2533 if( inlen > left.bv_len ) {
2534 /* not enough length */
2539 if( sub->sa_any[i]->bv_len == 0 ) {
2543 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
2550 idx = p - left.bv_val;
2551 assert( idx < left.bv_len );
2553 if( idx >= left.bv_len ) {
2554 /* this shouldn't happen */
2561 if( sub->sa_any[i]->bv_len > left.bv_len ) {
2562 /* not enough left */
2567 match = strncmp( left.bv_val,
2568 sub->sa_any[i]->bv_val,
2569 sub->sa_any[i]->bv_len );
2577 left.bv_val += sub->sa_any[i]->bv_len;
2578 left.bv_len -= sub->sa_any[i]->bv_len;
2579 inlen -= sub->sa_any[i]->bv_len;
2585 return LDAP_SUCCESS;
2588 /* Index generation function */
2589 int caseExactIA5Indexer(
2594 struct berval *prefix,
2595 struct berval **values,
2596 struct berval ***keysp )
2600 struct berval **keys;
2601 HASH_CONTEXT HASHcontext;
2602 unsigned char HASHdigest[HASH_BYTES];
2603 struct berval digest;
2604 digest.bv_val = HASHdigest;
2605 digest.bv_len = sizeof(HASHdigest);
2607 /* we should have at least one value at this point */
2608 assert( values != NULL && values[0] != NULL );
2610 for( i=0; values[i] != NULL; i++ ) {
2611 /* just count them */
2614 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
2616 slen = strlen( syntax->ssyn_oid );
2617 mlen = strlen( mr->smr_oid );
2619 for( i=0; values[i] != NULL; i++ ) {
2620 struct berval *value = values[i];
2622 HASH_Init( &HASHcontext );
2623 if( prefix != NULL && prefix->bv_len > 0 ) {
2624 HASH_Update( &HASHcontext,
2625 prefix->bv_val, prefix->bv_len );
2627 HASH_Update( &HASHcontext,
2628 syntax->ssyn_oid, slen );
2629 HASH_Update( &HASHcontext,
2630 mr->smr_oid, mlen );
2631 HASH_Update( &HASHcontext,
2632 value->bv_val, value->bv_len );
2633 HASH_Final( HASHdigest, &HASHcontext );
2635 keys[i] = ber_bvdup( &digest );
2640 return LDAP_SUCCESS;
2643 /* Index generation function */
2644 int caseExactIA5Filter(
2649 struct berval *prefix,
2651 struct berval ***keysp )
2654 struct berval **keys;
2655 HASH_CONTEXT HASHcontext;
2656 unsigned char HASHdigest[HASH_BYTES];
2657 struct berval *value;
2658 struct berval digest;
2659 digest.bv_val = HASHdigest;
2660 digest.bv_len = sizeof(HASHdigest);
2662 slen = strlen( syntax->ssyn_oid );
2663 mlen = strlen( mr->smr_oid );
2665 value = (struct berval *) assertValue;
2667 keys = ch_malloc( sizeof( struct berval * ) * 2 );
2669 HASH_Init( &HASHcontext );
2670 if( prefix != NULL && prefix->bv_len > 0 ) {
2671 HASH_Update( &HASHcontext,
2672 prefix->bv_val, prefix->bv_len );
2674 HASH_Update( &HASHcontext,
2675 syntax->ssyn_oid, slen );
2676 HASH_Update( &HASHcontext,
2677 mr->smr_oid, mlen );
2678 HASH_Update( &HASHcontext,
2679 value->bv_val, value->bv_len );
2680 HASH_Final( HASHdigest, &HASHcontext );
2682 keys[0] = ber_bvdup( &digest );
2686 return LDAP_SUCCESS;
2689 /* Substrings Index generation function */
2690 int caseExactIA5SubstringsIndexer(
2695 struct berval *prefix,
2696 struct berval **values,
2697 struct berval ***keysp )
2701 struct berval **keys;
2702 HASH_CONTEXT HASHcontext;
2703 unsigned char HASHdigest[HASH_BYTES];
2704 struct berval digest;
2705 digest.bv_val = HASHdigest;
2706 digest.bv_len = sizeof(HASHdigest);
2708 /* we should have at least one value at this point */
2709 assert( values != NULL && values[0] != NULL );
2712 for( i=0; values[i] != NULL; i++ ) {
2713 /* count number of indices to generate */
2714 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2718 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2719 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2720 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2721 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2723 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2727 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2728 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2729 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2733 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2734 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2735 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2736 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2738 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2744 /* no keys to generate */
2746 return LDAP_SUCCESS;
2749 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2751 slen = strlen( syntax->ssyn_oid );
2752 mlen = strlen( mr->smr_oid );
2755 for( i=0; values[i] != NULL; i++ ) {
2757 struct berval *value;
2760 if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2762 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2763 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2765 char pre = SLAP_INDEX_SUBSTR_PREFIX;
2766 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2768 for( j=0; j<max; j++ ) {
2769 HASH_Init( &HASHcontext );
2770 if( prefix != NULL && prefix->bv_len > 0 ) {
2771 HASH_Update( &HASHcontext,
2772 prefix->bv_val, prefix->bv_len );
2775 HASH_Update( &HASHcontext,
2776 &pre, sizeof( pre ) );
2777 HASH_Update( &HASHcontext,
2778 syntax->ssyn_oid, slen );
2779 HASH_Update( &HASHcontext,
2780 mr->smr_oid, mlen );
2781 HASH_Update( &HASHcontext,
2783 SLAP_INDEX_SUBSTR_MAXLEN );
2784 HASH_Final( HASHdigest, &HASHcontext );
2786 keys[nkeys++] = ber_bvdup( &digest );
2790 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2791 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2793 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2796 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2797 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2798 HASH_Init( &HASHcontext );
2799 if( prefix != NULL && prefix->bv_len > 0 ) {
2800 HASH_Update( &HASHcontext,
2801 prefix->bv_val, prefix->bv_len );
2803 HASH_Update( &HASHcontext,
2804 &pre, sizeof( pre ) );
2805 HASH_Update( &HASHcontext,
2806 syntax->ssyn_oid, slen );
2807 HASH_Update( &HASHcontext,
2808 mr->smr_oid, mlen );
2809 HASH_Update( &HASHcontext,
2811 HASH_Final( HASHdigest, &HASHcontext );
2813 keys[nkeys++] = ber_bvdup( &digest );
2816 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2817 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2818 HASH_Init( &HASHcontext );
2819 if( prefix != NULL && prefix->bv_len > 0 ) {
2820 HASH_Update( &HASHcontext,
2821 prefix->bv_val, prefix->bv_len );
2823 HASH_Update( &HASHcontext,
2824 &pre, sizeof( pre ) );
2825 HASH_Update( &HASHcontext,
2826 syntax->ssyn_oid, slen );
2827 HASH_Update( &HASHcontext,
2828 mr->smr_oid, mlen );
2829 HASH_Update( &HASHcontext,
2830 &value->bv_val[value->bv_len-j], j );
2831 HASH_Final( HASHdigest, &HASHcontext );
2833 keys[nkeys++] = ber_bvdup( &digest );
2847 return LDAP_SUCCESS;
2850 int caseExactIA5SubstringsFilter(
2855 struct berval *prefix,
2857 struct berval ***keysp )
2859 SubstringsAssertion *sa = assertValue;
2861 ber_len_t nkeys = 0;
2862 size_t slen, mlen, klen;
2863 struct berval **keys;
2864 HASH_CONTEXT HASHcontext;
2865 unsigned char HASHdigest[HASH_BYTES];
2866 struct berval *value;
2867 struct berval digest;
2869 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
2870 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2875 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2877 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2878 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2879 /* don't bother accounting for stepping */
2880 nkeys += sa->sa_any[i]->bv_len -
2881 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2886 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
2887 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2894 return LDAP_SUCCESS;
2897 digest.bv_val = HASHdigest;
2898 digest.bv_len = sizeof(HASHdigest);
2900 slen = strlen( syntax->ssyn_oid );
2901 mlen = strlen( mr->smr_oid );
2903 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2906 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
2907 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2909 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2910 value = sa->sa_initial;
2912 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2913 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2915 HASH_Init( &HASHcontext );
2916 if( prefix != NULL && prefix->bv_len > 0 ) {
2917 HASH_Update( &HASHcontext,
2918 prefix->bv_val, prefix->bv_len );
2920 HASH_Update( &HASHcontext,
2921 &pre, sizeof( pre ) );
2922 HASH_Update( &HASHcontext,
2923 syntax->ssyn_oid, slen );
2924 HASH_Update( &HASHcontext,
2925 mr->smr_oid, mlen );
2926 HASH_Update( &HASHcontext,
2927 value->bv_val, klen );
2928 HASH_Final( HASHdigest, &HASHcontext );
2930 keys[nkeys++] = ber_bvdup( &digest );
2933 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2935 pre = SLAP_INDEX_SUBSTR_PREFIX;
2936 klen = SLAP_INDEX_SUBSTR_MAXLEN;
2938 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2939 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
2943 value = sa->sa_any[i];
2946 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
2947 j += SLAP_INDEX_SUBSTR_STEP )
2949 HASH_Init( &HASHcontext );
2950 if( prefix != NULL && prefix->bv_len > 0 ) {
2951 HASH_Update( &HASHcontext,
2952 prefix->bv_val, prefix->bv_len );
2954 HASH_Update( &HASHcontext,
2955 &pre, sizeof( pre ) );
2956 HASH_Update( &HASHcontext,
2957 syntax->ssyn_oid, slen );
2958 HASH_Update( &HASHcontext,
2959 mr->smr_oid, mlen );
2960 HASH_Update( &HASHcontext,
2961 &value->bv_val[j], klen );
2962 HASH_Final( HASHdigest, &HASHcontext );
2964 keys[nkeys++] = ber_bvdup( &digest );
2969 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
2970 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2972 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2973 value = sa->sa_final;
2975 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2976 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2978 HASH_Init( &HASHcontext );
2979 if( prefix != NULL && prefix->bv_len > 0 ) {
2980 HASH_Update( &HASHcontext,
2981 prefix->bv_val, prefix->bv_len );
2983 HASH_Update( &HASHcontext,
2984 &pre, sizeof( pre ) );
2985 HASH_Update( &HASHcontext,
2986 syntax->ssyn_oid, slen );
2987 HASH_Update( &HASHcontext,
2988 mr->smr_oid, mlen );
2989 HASH_Update( &HASHcontext,
2990 &value->bv_val[value->bv_len-klen], klen );
2991 HASH_Final( HASHdigest, &HASHcontext );
2993 keys[nkeys++] = ber_bvdup( &digest );
3004 return LDAP_SUCCESS;
3013 struct berval *value,
3014 void *assertedValue )
3016 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
3018 if( match == 0 && value->bv_len ) {
3019 match = strncasecmp( value->bv_val,
3020 ((struct berval *) assertedValue)->bv_val,
3025 return LDAP_SUCCESS;
3029 caseIgnoreIA5SubstringsMatch(
3034 struct berval *value,
3035 void *assertedValue )
3038 SubstringsAssertion *sub = assertedValue;
3039 struct berval left = *value;
3043 /* Add up asserted input length */
3044 if( sub->sa_initial ) {
3045 inlen += sub->sa_initial->bv_len;
3048 for(i=0; sub->sa_any[i] != NULL; i++) {
3049 inlen += sub->sa_any[i]->bv_len;
3052 if( sub->sa_final ) {
3053 inlen += sub->sa_final->bv_len;
3056 if( sub->sa_initial ) {
3057 if( inlen > left.bv_len ) {
3062 match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
3063 sub->sa_initial->bv_len );
3069 left.bv_val += sub->sa_initial->bv_len;
3070 left.bv_len -= sub->sa_initial->bv_len;
3071 inlen -= sub->sa_initial->bv_len;
3074 if( sub->sa_final ) {
3075 if( inlen > left.bv_len ) {
3080 match = strncasecmp( sub->sa_final->bv_val,
3081 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
3082 sub->sa_final->bv_len );
3088 left.bv_len -= sub->sa_final->bv_len;
3089 inlen -= sub->sa_final->bv_len;
3093 for(i=0; sub->sa_any[i]; i++) {
3098 if( inlen > left.bv_len ) {
3099 /* not enough length */
3104 if( sub->sa_any[i]->bv_len == 0 ) {
3108 p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
3115 idx = p - left.bv_val;
3116 assert( idx < left.bv_len );
3118 if( idx >= left.bv_len ) {
3119 /* this shouldn't happen */
3126 if( sub->sa_any[i]->bv_len > left.bv_len ) {
3127 /* not enough left */
3132 match = strncasecmp( left.bv_val,
3133 sub->sa_any[i]->bv_val,
3134 sub->sa_any[i]->bv_len );
3143 left.bv_val += sub->sa_any[i]->bv_len;
3144 left.bv_len -= sub->sa_any[i]->bv_len;
3145 inlen -= sub->sa_any[i]->bv_len;
3151 return LDAP_SUCCESS;
3154 /* Index generation function */
3155 int caseIgnoreIA5Indexer(
3160 struct berval *prefix,
3161 struct berval **values,
3162 struct berval ***keysp )
3166 struct berval **keys;
3167 HASH_CONTEXT HASHcontext;
3168 unsigned char HASHdigest[HASH_BYTES];
3169 struct berval digest;
3170 digest.bv_val = HASHdigest;
3171 digest.bv_len = sizeof(HASHdigest);
3173 /* we should have at least one value at this point */
3174 assert( values != NULL && values[0] != NULL );
3176 for( i=0; values[i] != NULL; i++ ) {
3177 /* just count them */
3180 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
3182 slen = strlen( syntax->ssyn_oid );
3183 mlen = strlen( mr->smr_oid );
3185 for( i=0; values[i] != NULL; i++ ) {
3186 struct berval *value = ber_bvdup( values[i] );
3187 ldap_pvt_str2upper( value->bv_val );
3189 HASH_Init( &HASHcontext );
3190 if( prefix != NULL && prefix->bv_len > 0 ) {
3191 HASH_Update( &HASHcontext,
3192 prefix->bv_val, prefix->bv_len );
3194 HASH_Update( &HASHcontext,
3195 syntax->ssyn_oid, slen );
3196 HASH_Update( &HASHcontext,
3197 mr->smr_oid, mlen );
3198 HASH_Update( &HASHcontext,
3199 value->bv_val, value->bv_len );
3200 HASH_Final( HASHdigest, &HASHcontext );
3202 ber_bvfree( value );
3204 keys[i] = ber_bvdup( &digest );
3209 return LDAP_SUCCESS;
3212 /* Index generation function */
3213 int caseIgnoreIA5Filter(
3218 struct berval *prefix,
3220 struct berval ***keysp )
3223 struct berval **keys;
3224 HASH_CONTEXT HASHcontext;
3225 unsigned char HASHdigest[HASH_BYTES];
3226 struct berval *value;
3227 struct berval digest;
3228 digest.bv_val = HASHdigest;
3229 digest.bv_len = sizeof(HASHdigest);
3231 slen = strlen( syntax->ssyn_oid );
3232 mlen = strlen( mr->smr_oid );
3234 value = ber_bvdup( (struct berval *) assertValue );
3235 ldap_pvt_str2upper( value->bv_val );
3237 keys = ch_malloc( sizeof( struct berval * ) * 2 );
3239 HASH_Init( &HASHcontext );
3240 if( prefix != NULL && prefix->bv_len > 0 ) {
3241 HASH_Update( &HASHcontext,
3242 prefix->bv_val, prefix->bv_len );
3244 HASH_Update( &HASHcontext,
3245 syntax->ssyn_oid, slen );
3246 HASH_Update( &HASHcontext,
3247 mr->smr_oid, mlen );
3248 HASH_Update( &HASHcontext,
3249 value->bv_val, value->bv_len );
3250 HASH_Final( HASHdigest, &HASHcontext );
3252 keys[0] = ber_bvdup( &digest );
3255 ber_bvfree( value );
3259 return LDAP_SUCCESS;
3262 /* Substrings Index generation function */
3263 int caseIgnoreIA5SubstringsIndexer(
3268 struct berval *prefix,
3269 struct berval **values,
3270 struct berval ***keysp )
3274 struct berval **keys;
3275 HASH_CONTEXT HASHcontext;
3276 unsigned char HASHdigest[HASH_BYTES];
3277 struct berval digest;
3278 digest.bv_val = HASHdigest;
3279 digest.bv_len = sizeof(HASHdigest);
3281 /* we should have at least one value at this point */
3282 assert( values != NULL && values[0] != NULL );
3285 for( i=0; values[i] != NULL; i++ ) {
3286 /* count number of indices to generate */
3287 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
3291 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
3292 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3293 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
3294 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
3296 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
3300 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
3301 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3302 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
3306 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
3307 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3308 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
3309 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
3311 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
3317 /* no keys to generate */
3319 return LDAP_SUCCESS;
3322 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
3324 slen = strlen( syntax->ssyn_oid );
3325 mlen = strlen( mr->smr_oid );
3328 for( i=0; values[i] != NULL; i++ ) {
3330 struct berval *value;
3332 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
3334 value = ber_bvdup( values[i] );
3335 ldap_pvt_str2upper( value->bv_val );
3337 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
3338 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
3340 char pre = SLAP_INDEX_SUBSTR_PREFIX;
3341 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
3343 for( j=0; j<max; j++ ) {
3344 HASH_Init( &HASHcontext );
3345 if( prefix != NULL && prefix->bv_len > 0 ) {
3346 HASH_Update( &HASHcontext,
3347 prefix->bv_val, prefix->bv_len );
3350 HASH_Update( &HASHcontext,
3351 &pre, sizeof( pre ) );
3352 HASH_Update( &HASHcontext,
3353 syntax->ssyn_oid, slen );
3354 HASH_Update( &HASHcontext,
3355 mr->smr_oid, mlen );
3356 HASH_Update( &HASHcontext,
3358 SLAP_INDEX_SUBSTR_MAXLEN );
3359 HASH_Final( HASHdigest, &HASHcontext );
3361 keys[nkeys++] = ber_bvdup( &digest );
3365 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3366 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3368 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
3371 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
3372 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3373 HASH_Init( &HASHcontext );
3374 if( prefix != NULL && prefix->bv_len > 0 ) {
3375 HASH_Update( &HASHcontext,
3376 prefix->bv_val, prefix->bv_len );
3378 HASH_Update( &HASHcontext,
3379 &pre, sizeof( pre ) );
3380 HASH_Update( &HASHcontext,
3381 syntax->ssyn_oid, slen );
3382 HASH_Update( &HASHcontext,
3383 mr->smr_oid, mlen );
3384 HASH_Update( &HASHcontext,
3386 HASH_Final( HASHdigest, &HASHcontext );
3388 keys[nkeys++] = ber_bvdup( &digest );
3391 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
3392 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3393 HASH_Init( &HASHcontext );
3394 if( prefix != NULL && prefix->bv_len > 0 ) {
3395 HASH_Update( &HASHcontext,
3396 prefix->bv_val, prefix->bv_len );
3398 HASH_Update( &HASHcontext,
3399 &pre, sizeof( pre ) );
3400 HASH_Update( &HASHcontext,
3401 syntax->ssyn_oid, slen );
3402 HASH_Update( &HASHcontext,
3403 mr->smr_oid, mlen );
3404 HASH_Update( &HASHcontext,
3405 &value->bv_val[value->bv_len-j], j );
3406 HASH_Final( HASHdigest, &HASHcontext );
3408 keys[nkeys++] = ber_bvdup( &digest );
3413 ber_bvfree( value );
3424 return LDAP_SUCCESS;
3427 int caseIgnoreIA5SubstringsFilter(
3432 struct berval *prefix,
3434 struct berval ***keysp )
3436 SubstringsAssertion *sa = assertValue;
3438 ber_len_t nkeys = 0;
3439 size_t slen, mlen, klen;
3440 struct berval **keys;
3441 HASH_CONTEXT HASHcontext;
3442 unsigned char HASHdigest[HASH_BYTES];
3443 struct berval *value;
3444 struct berval digest;
3446 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
3447 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3452 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3454 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3455 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3456 /* don't bother accounting for stepping */
3457 nkeys += sa->sa_any[i]->bv_len -
3458 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
3463 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
3464 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3471 return LDAP_SUCCESS;
3474 digest.bv_val = HASHdigest;
3475 digest.bv_len = sizeof(HASHdigest);
3477 slen = strlen( syntax->ssyn_oid );
3478 mlen = strlen( mr->smr_oid );
3480 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
3483 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
3484 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3486 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3487 value = ber_bvdup( sa->sa_initial );
3488 ldap_pvt_str2upper( value->bv_val );
3490 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3491 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3493 HASH_Init( &HASHcontext );
3494 if( prefix != NULL && prefix->bv_len > 0 ) {
3495 HASH_Update( &HASHcontext,
3496 prefix->bv_val, prefix->bv_len );
3498 HASH_Update( &HASHcontext,
3499 &pre, sizeof( pre ) );
3500 HASH_Update( &HASHcontext,
3501 syntax->ssyn_oid, slen );
3502 HASH_Update( &HASHcontext,
3503 mr->smr_oid, mlen );
3504 HASH_Update( &HASHcontext,
3505 value->bv_val, klen );
3506 HASH_Final( HASHdigest, &HASHcontext );
3508 ber_bvfree( value );
3509 keys[nkeys++] = ber_bvdup( &digest );
3512 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3514 pre = SLAP_INDEX_SUBSTR_PREFIX;
3515 klen = SLAP_INDEX_SUBSTR_MAXLEN;
3517 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3518 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
3522 value = ber_bvdup( sa->sa_any[i] );
3523 ldap_pvt_str2upper( value->bv_val );
3526 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
3527 j += SLAP_INDEX_SUBSTR_STEP )
3529 HASH_Init( &HASHcontext );
3530 if( prefix != NULL && prefix->bv_len > 0 ) {
3531 HASH_Update( &HASHcontext,
3532 prefix->bv_val, prefix->bv_len );
3534 HASH_Update( &HASHcontext,
3535 &pre, sizeof( pre ) );
3536 HASH_Update( &HASHcontext,
3537 syntax->ssyn_oid, slen );
3538 HASH_Update( &HASHcontext,
3539 mr->smr_oid, mlen );
3540 HASH_Update( &HASHcontext,
3541 &value->bv_val[j], klen );
3542 HASH_Final( HASHdigest, &HASHcontext );
3544 keys[nkeys++] = ber_bvdup( &digest );
3547 ber_bvfree( value );
3551 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
3552 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3554 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3555 value = ber_bvdup( sa->sa_final );
3556 ldap_pvt_str2upper( value->bv_val );
3558 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3559 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3561 HASH_Init( &HASHcontext );
3562 if( prefix != NULL && prefix->bv_len > 0 ) {
3563 HASH_Update( &HASHcontext,
3564 prefix->bv_val, prefix->bv_len );
3566 HASH_Update( &HASHcontext,
3567 &pre, sizeof( pre ) );
3568 HASH_Update( &HASHcontext,
3569 syntax->ssyn_oid, slen );
3570 HASH_Update( &HASHcontext,
3571 mr->smr_oid, mlen );
3572 HASH_Update( &HASHcontext,
3573 &value->bv_val[value->bv_len-klen], klen );
3574 HASH_Final( HASHdigest, &HASHcontext );
3576 ber_bvfree( value );
3577 keys[nkeys++] = ber_bvdup( &digest );
3588 return LDAP_SUCCESS;
3592 numericStringValidate(
3598 for(i=0; i < in->bv_len; i++) {
3599 if( !SLAP_NUMERIC(in->bv_val[i]) ) {
3600 return LDAP_INVALID_SYNTAX;
3604 return LDAP_SUCCESS;
3608 numericStringNormalize(
3611 struct berval **normalized )
3613 /* removal all spaces */
3614 struct berval *newval;
3617 newval = ch_malloc( sizeof( struct berval ) );
3618 newval->bv_val = ch_malloc( val->bv_len + 1 );
3624 if ( ASCII_SPACE( *p ) ) {
3625 /* Ignore whitespace */
3632 assert( newval->bv_val <= p );
3635 /* null terminate */
3638 newval->bv_len = q - newval->bv_val;
3639 *normalized = newval;
3641 return LDAP_SUCCESS;
3645 objectIdentifierFirstComponentMatch(
3650 struct berval *value,
3651 void *assertedValue )
3653 int rc = LDAP_SUCCESS;
3655 struct berval *asserted = (struct berval *) assertedValue;
3659 if( value->bv_len == 0 || value->bv_val[0] != '(' /*')'*/ ) {
3660 return LDAP_INVALID_SYNTAX;
3663 /* trim leading white space */
3664 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
3668 /* grab next word */
3669 oid.bv_val = &value->bv_val[i];
3670 oid.bv_len = value->bv_len - i;
3671 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
3676 /* insert attributeTypes, objectclass check here */
3677 if( OID_LEADCHAR(asserted->bv_val[0]) ) {
3678 rc = objectIdentifierMatch( &match, flags, syntax, mr, &oid, asserted );
3681 char *stored = ch_malloc( oid.bv_len + 1 );
3682 AC_MEMCPY( stored, oid.bv_val, oid.bv_len );
3683 stored[oid.bv_len] = '\0';
3685 if ( !strcmp( syntax->ssyn_oid, SLAP_SYNTAX_MATCHINGRULES_OID ) ) {
3686 MatchingRule *asserted_mr = mr_find( asserted->bv_val );
3687 MatchingRule *stored_mr = mr_find( stored );
3689 if( asserted_mr == NULL ) {
3690 rc = SLAPD_COMPARE_UNDEFINED;
3692 match = asserted_mr != stored_mr;
3695 } else if ( !strcmp( syntax->ssyn_oid,
3696 SLAP_SYNTAX_ATTRIBUTETYPES_OID ) )
3698 AttributeType *asserted_at = at_find( asserted->bv_val );
3699 AttributeType *stored_at = at_find( stored );
3701 if( asserted_at == NULL ) {
3702 rc = SLAPD_COMPARE_UNDEFINED;
3704 match = asserted_at != stored_at;
3707 } else if ( !strcmp( syntax->ssyn_oid,
3708 SLAP_SYNTAX_OBJECTCLASSES_OID ) )
3710 ObjectClass *asserted_oc = oc_find( asserted->bv_val );
3711 ObjectClass *stored_oc = oc_find( stored );
3713 if( asserted_oc == NULL ) {
3714 rc = SLAPD_COMPARE_UNDEFINED;
3716 match = asserted_oc != stored_oc;
3724 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3725 "objectIdentifierFirstComponentMatch: %d\n %s\n %s\n",
3726 match, value->bv_val, asserted->bv_val ));
3728 Debug( LDAP_DEBUG_ARGS, "objectIdentifierFirstComponentMatch "
3729 "%d\n\t\"%s\"\n\t\"%s\"\n",
3730 match, value->bv_val, asserted->bv_val );
3734 if( rc == LDAP_SUCCESS ) *matchp = match;
3739 check_time_syntax (struct berval *val,
3743 static int ceiling[9] = { 99, 99, 11, 30, 23, 59, 59, 12, 59 };
3744 static int mdays[2][12] = {
3745 /* non-leap years */
3746 { 30, 27, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 },
3748 { 30, 28, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 }
3751 int part, c, tzoffset, leapyear = 0 ;
3753 if( val->bv_len == 0 ) {
3754 return LDAP_INVALID_SYNTAX;
3757 p = (char *)val->bv_val;
3758 e = p + val->bv_len;
3760 /* Ignore initial whitespace */
3761 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3765 if (e - p < 13 - (2 * start)) {
3766 return LDAP_INVALID_SYNTAX;
3769 for (part = 0; part < 9; part++) {
3773 for (part = start; part < 7; part++) {
3775 if ((part == 6) && (c == 'Z' || c == '+' || c == '-')) {
3782 return LDAP_INVALID_SYNTAX;
3784 if (c < 0 || c > 9) {
3785 return LDAP_INVALID_SYNTAX;
3791 return LDAP_INVALID_SYNTAX;
3793 if (c < 0 || c > 9) {
3794 return LDAP_INVALID_SYNTAX;
3799 if (part == 2 || part == 3) {
3802 if (parts[part] < 0) {
3803 return LDAP_INVALID_SYNTAX;
3805 if (parts[part] > ceiling[part]) {
3806 return LDAP_INVALID_SYNTAX;
3810 /* leapyear check for the Gregorian calendar (year>1581) */
3811 if (((parts[1] % 4 == 0) && (parts[1] != 0)) ||
3812 ((parts[0] % 4 == 0) && (parts[1] == 0)))
3817 if (parts[3] > mdays[leapyear][parts[2]]) {
3818 return LDAP_INVALID_SYNTAX;
3823 tzoffset = 0; /* UTC */
3824 } else if (c != '+' && c != '-') {
3825 return LDAP_INVALID_SYNTAX;
3829 } else /* c == '+' */ {
3834 return LDAP_INVALID_SYNTAX;
3837 for (part = 7; part < 9; part++) {
3839 if (c < 0 || c > 9) {
3840 return LDAP_INVALID_SYNTAX;
3845 if (c < 0 || c > 9) {
3846 return LDAP_INVALID_SYNTAX;
3850 if (parts[part] < 0 || parts[part] > ceiling[part]) {
3851 return LDAP_INVALID_SYNTAX;
3856 /* Ignore trailing whitespace */
3857 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3861 return LDAP_INVALID_SYNTAX;
3864 switch ( tzoffset ) {
3865 case -1: /* negativ offset to UTC, ie west of Greenwich */
3866 parts[4] += parts[7];
3867 parts[5] += parts[8];
3868 for (part = 6; --part > 0; ) { /* offset is just hhmm, no seconds */
3872 c = mdays[leapyear][parts[2]];
3874 if (parts[part] > c) {
3875 parts[part] -= c + 1;
3880 case 1: /* positive offset to UTC, ie east of Greenwich */
3881 parts[4] -= parts[7];
3882 parts[5] -= parts[8];
3883 for (part = 6; --part > 0; ) {
3887 /* first arg to % needs to be non negativ */
3888 c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
3890 if (parts[part] < 0) {
3891 parts[part] += c + 1;
3896 case 0: /* already UTC */
3900 return LDAP_SUCCESS;
3907 struct berval **normalized )
3912 rc = check_time_syntax(val, 1, parts);
3913 if (rc != LDAP_SUCCESS) {
3918 out = ch_malloc( sizeof(struct berval) );
3920 return LBER_ERROR_MEMORY;
3923 out->bv_val = ch_malloc( 14 );
3924 if ( out->bv_val == NULL ) {
3926 return LBER_ERROR_MEMORY;
3929 sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ldZ",
3930 parts[1], parts[2] + 1, parts[3] + 1,
3931 parts[4], parts[5], parts[6] );
3935 return LDAP_SUCCESS;
3945 return check_time_syntax(in, 1, parts);
3949 generalizedTimeValidate(
3955 return check_time_syntax(in, 0, parts);
3959 generalizedTimeNormalize(
3962 struct berval **normalized )
3967 rc = check_time_syntax(val, 0, parts);
3968 if (rc != LDAP_SUCCESS) {
3973 out = ch_malloc( sizeof(struct berval) );
3975 return LBER_ERROR_MEMORY;
3978 out->bv_val = ch_malloc( 16 );
3979 if ( out->bv_val == NULL ) {
3981 return LBER_ERROR_MEMORY;
3984 sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ld%02ldZ",
3985 parts[0], parts[1], parts[2] + 1, parts[3] + 1,
3986 parts[4], parts[5], parts[6] );
3990 return LDAP_SUCCESS;
3994 nisNetgroupTripleValidate(
3996 struct berval *val )
4001 if ( val->bv_len == 0 ) {
4002 return LDAP_INVALID_SYNTAX;
4005 p = (char *)val->bv_val;
4006 e = p + val->bv_len;
4008 if ( *p != '(' /*')'*/ ) {
4009 return LDAP_INVALID_SYNTAX;
4012 for ( p++; ( p < e ) && ( *p != ')' ); p++ ) {
4016 return LDAP_INVALID_SYNTAX;
4019 } else if ( !ATTR_CHAR( *p ) ) {
4020 return LDAP_INVALID_SYNTAX;
4024 if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
4025 return LDAP_INVALID_SYNTAX;
4031 return LDAP_INVALID_SYNTAX;
4034 return LDAP_SUCCESS;
4038 bootParameterValidate(
4040 struct berval *val )
4044 if ( val->bv_len == 0 ) {
4045 return LDAP_INVALID_SYNTAX;
4048 p = (char *)val->bv_val;
4049 e = p + val->bv_len;
4052 for (; ( p < e ) && ( *p != '=' ); p++ ) {
4053 if ( !ATTR_CHAR( *p ) ) {
4054 return LDAP_INVALID_SYNTAX;
4059 return LDAP_INVALID_SYNTAX;
4063 for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
4064 if ( !ATTR_CHAR( *p ) ) {
4065 return LDAP_INVALID_SYNTAX;
4070 return LDAP_INVALID_SYNTAX;
4074 for ( p++; p < e; p++ ) {
4075 if ( !ATTR_CHAR( *p ) ) {
4076 return LDAP_INVALID_SYNTAX;
4080 return LDAP_SUCCESS;
4083 struct syntax_defs_rec {
4086 slap_syntax_validate_func *sd_validate;
4087 slap_syntax_transform_func *sd_normalize;
4088 slap_syntax_transform_func *sd_pretty;
4089 #ifdef SLAPD_BINARY_CONVERSION
4090 slap_syntax_transform_func *sd_ber2str;
4091 slap_syntax_transform_func *sd_str2ber;
4095 #define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
4096 #define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
4098 struct syntax_defs_rec syntax_defs[] = {
4099 {"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' " X_BINARY X_NOT_H_R ")",
4100 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
4101 {"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
4102 0, NULL, NULL, NULL},
4103 {"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
4104 0, NULL, NULL, NULL},
4105 {"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' " X_NOT_H_R ")",
4106 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
4107 {"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' " X_NOT_H_R ")",
4108 SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4109 {"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
4110 0, bitStringValidate, NULL, NULL },
4111 {"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
4112 0, booleanValidate, NULL, NULL},
4113 {"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
4114 X_BINARY X_NOT_H_R ")",
4115 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4116 {"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
4117 X_BINARY X_NOT_H_R ")",
4118 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4119 {"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
4120 X_BINARY X_NOT_H_R ")",
4121 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4122 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
4123 0, countryStringValidate, IA5StringNormalize, NULL},
4124 {"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
4125 0, dnValidate, dnNormalize, dnPretty},
4126 {"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
4127 0, NULL, NULL, NULL},
4128 {"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
4129 0, NULL, NULL, NULL},
4130 {"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
4131 0, UTF8StringValidate, UTF8StringNormalize, NULL},
4132 {"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
4133 0, NULL, NULL, NULL},
4134 {"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
4135 0, NULL, NULL, NULL},
4136 {"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
4137 0, NULL, NULL, NULL},
4138 {"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
4139 0, NULL, NULL, NULL},
4140 {"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
4141 0, NULL, NULL, NULL},
4142 {"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
4143 0, printablesStringValidate, IA5StringNormalize, NULL},
4144 {"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
4145 SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
4146 {"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
4147 0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
4148 {"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
4149 0, NULL, NULL, NULL},
4150 {"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
4151 0, IA5StringValidate, IA5StringNormalize, NULL},
4152 {"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
4153 0, integerValidate, integerNormalize, integerPretty},
4154 {"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
4155 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
4156 {"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
4157 0, NULL, NULL, NULL},
4158 {"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
4159 0, NULL, NULL, NULL},
4160 {"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
4161 0, NULL, NULL, NULL},
4162 {"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
4163 0, NULL, NULL, NULL},
4164 {"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
4165 0, NULL, NULL, NULL},
4166 {"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
4167 0, nameUIDValidate, nameUIDNormalize, NULL},
4168 {"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
4169 0, NULL, NULL, NULL},
4170 {"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
4171 0, numericStringValidate, numericStringNormalize, NULL},
4172 {"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
4173 0, NULL, NULL, NULL},
4174 {"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
4175 0, oidValidate, NULL, NULL},
4176 {"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
4177 0, IA5StringValidate, IA5StringNormalize, NULL},
4178 {"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
4179 0, blobValidate, NULL, NULL},
4180 {"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
4181 0, UTF8StringValidate, UTF8StringNormalize, NULL},
4182 {"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
4183 0, NULL, NULL, NULL},
4184 {"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
4185 0, NULL, NULL, NULL},
4186 {"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
4187 0, printableStringValidate, IA5StringNormalize, NULL},
4188 {"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
4189 X_BINARY X_NOT_H_R ")",
4190 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4191 {"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
4192 0, printableStringValidate, IA5StringNormalize, NULL},
4193 {"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
4194 0, NULL, NULL, NULL},
4195 {"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
4196 0, printableStringValidate, IA5StringNormalize, NULL},
4197 {"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
4198 0, utcTimeValidate, utcTimeNormalize, NULL},
4199 {"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
4200 0, NULL, NULL, NULL},
4201 {"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
4202 0, NULL, NULL, NULL},
4203 {"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
4204 0, NULL, NULL, NULL},
4205 {"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
4206 0, NULL, NULL, NULL},
4207 {"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
4208 0, NULL, NULL, NULL},
4210 /* RFC 2307 NIS Syntaxes */
4211 {"( 1.3.6.1.1.1.0.0 DESC 'RFC2307 NIS Netgroup Triple' )",
4212 0, nisNetgroupTripleValidate, NULL, NULL},
4213 {"( 1.3.6.1.1.1.0.1 DESC 'RFC2307 Boot Parameter' )",
4214 0, bootParameterValidate, NULL, NULL},
4216 /* OpenLDAP Experimental Syntaxes */
4217 {"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
4218 0, UTF8StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */,
4220 {"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
4221 0, NULL, NULL, NULL},
4223 /* OpenLDAP Void Syntax */
4224 {"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' )" ,
4225 SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
4226 {NULL, 0, NULL, NULL, NULL}
4229 struct mrule_defs_rec {
4231 slap_mask_t mrd_usage;
4232 slap_mr_convert_func * mrd_convert;
4233 slap_mr_normalize_func * mrd_normalize;
4234 slap_mr_match_func * mrd_match;
4235 slap_mr_indexer_func * mrd_indexer;
4236 slap_mr_filter_func * mrd_filter;
4238 char * mrd_associated;
4242 * Other matching rules in X.520 that we do not use (yet):
4244 * 2.5.13.9 numericStringOrderingMatch
4245 * 2.5.13.15 integerOrderingMatch
4246 * 2.5.13.18 octetStringOrderingMatch
4247 * 2.5.13.19 octetStringSubstringsMatch
4248 * 2.5.13.25 uTCTimeMatch
4249 * 2.5.13.26 uTCTimeOrderingMatch
4250 * 2.5.13.31 directoryStringFirstComponentMatch
4251 * 2.5.13.32 wordMatch
4252 * 2.5.13.33 keywordMatch
4253 * 2.5.13.34 certificateExactMatch
4254 * 2.5.13.35 certificateMatch
4255 * 2.5.13.36 certificatePairExactMatch
4256 * 2.5.13.37 certificatePairMatch
4257 * 2.5.13.38 certificateListExactMatch
4258 * 2.5.13.39 certificateListMatch
4259 * 2.5.13.40 algorithmIdentifierMatch
4260 * 2.5.13.41 storedPrefixMatch
4261 * 2.5.13.42 attributeCertificateMatch
4262 * 2.5.13.43 readerAndKeyIDMatch
4263 * 2.5.13.44 attributeIntegrityMatch
4266 struct mrule_defs_rec mrule_defs[] = {
4268 * EQUALITY matching rules must be listed after associated APPROX
4269 * matching rules. So, we list all APPROX matching rules first.
4271 {"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
4272 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4273 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
4275 directoryStringApproxMatch,
4276 directoryStringApproxIndexer,
4277 directoryStringApproxFilter,
4280 {"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
4281 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4282 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
4284 IA5StringApproxMatch,
4285 IA5StringApproxIndexer,
4286 IA5StringApproxFilter,
4290 * Other matching rules
4293 {"( 2.5.13.0 NAME 'objectIdentifierMatch' "
4294 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4295 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4297 objectIdentifierMatch, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
4300 {"( 2.5.13.1 NAME 'distinguishedNameMatch' "
4301 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4302 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4304 dnMatch, dnIndexer, dnFilter,
4307 {"( 2.5.13.2 NAME 'caseIgnoreMatch' "
4308 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4309 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4311 caseIgnoreMatch, caseIgnoreIndexer, caseIgnoreFilter,
4312 directoryStringApproxMatchOID },
4314 {"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
4315 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4318 caseIgnoreOrderingMatch, NULL, NULL,
4321 {"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
4322 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4323 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4325 caseIgnoreSubstringsMatch,
4326 caseIgnoreSubstringsIndexer,
4327 caseIgnoreSubstringsFilter,
4330 {"( 2.5.13.5 NAME 'caseExactMatch' "
4331 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4332 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4334 caseExactMatch, caseExactIndexer, caseExactFilter,
4335 directoryStringApproxMatchOID },
4337 {"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
4338 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4341 caseExactOrderingMatch, NULL, NULL,
4344 {"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
4345 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4346 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4348 caseExactSubstringsMatch,
4349 caseExactSubstringsIndexer,
4350 caseExactSubstringsFilter,
4353 {"( 2.5.13.8 NAME 'numericStringMatch' "
4354 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
4355 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4358 caseIgnoreIA5Indexer,
4359 caseIgnoreIA5Filter,
4362 {"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
4363 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4364 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4366 caseIgnoreIA5SubstringsMatch,
4367 caseIgnoreIA5SubstringsIndexer,
4368 caseIgnoreIA5SubstringsFilter,
4371 {"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
4372 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
4373 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4375 caseIgnoreListMatch, NULL, NULL,
4378 {"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
4379 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4380 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4382 caseIgnoreListSubstringsMatch, NULL, NULL,
4385 {"( 2.5.13.13 NAME 'booleanMatch' "
4386 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
4387 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4389 booleanMatch, NULL, NULL,
4392 {"( 2.5.13.14 NAME 'integerMatch' "
4393 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4394 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4396 integerMatch, integerIndexer, integerFilter,
4399 {"( 2.5.13.16 NAME 'bitStringMatch' "
4400 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
4401 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4403 bitStringMatch, NULL, NULL,
4406 {"( 2.5.13.17 NAME 'octetStringMatch' "
4407 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4408 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4410 octetStringMatch, octetStringIndexer, octetStringFilter,
4413 {"( 2.5.13.20 NAME 'telephoneNumberMatch' "
4414 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
4415 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4417 telephoneNumberMatch,
4418 telephoneNumberIndexer,
4419 telephoneNumberFilter,
4422 {"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
4423 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4424 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4426 telephoneNumberSubstringsMatch,
4427 telephoneNumberSubstringsIndexer,
4428 telephoneNumberSubstringsFilter,
4431 {"( 2.5.13.22 NAME 'presentationAddressMatch' "
4432 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
4433 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4438 {"( 2.5.13.23 NAME 'uniqueMemberMatch' "
4439 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
4440 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4442 uniqueMemberMatch, NULL, NULL,
4445 {"( 2.5.13.24 NAME 'protocolInformationMatch' "
4446 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
4447 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4449 protocolInformationMatch, NULL, NULL,
4452 {"( 2.5.13.27 NAME 'generalizedTimeMatch' "
4453 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4454 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4456 generalizedTimeMatch, NULL, NULL,
4459 {"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
4460 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4463 generalizedTimeOrderingMatch, NULL, NULL,
4466 {"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
4467 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4468 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4470 integerFirstComponentMatch, NULL, NULL,
4473 {"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
4474 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4475 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4477 objectIdentifierFirstComponentMatch, NULL, NULL,
4480 {"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
4481 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4482 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4484 caseExactIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
4485 IA5StringApproxMatchOID },
4487 {"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
4488 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4489 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4491 caseIgnoreIA5Match, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
4492 IA5StringApproxMatchOID },
4494 {"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
4495 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4498 caseIgnoreIA5SubstringsMatch,
4499 caseIgnoreIA5SubstringsIndexer,
4500 caseIgnoreIA5SubstringsFilter,
4503 {"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
4504 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4507 caseExactIA5SubstringsMatch,
4508 caseExactIA5SubstringsIndexer,
4509 caseExactIA5SubstringsFilter,
4512 {"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
4513 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4516 authPasswordMatch, NULL, NULL,
4519 {"( 1.3.6.1.4.1.4203.666.4.2 NAME 'OpenLDAPaciMatch' "
4520 "SYNTAX 1.3.6.1.4.1.4203.666.2.1 )",
4523 OpenLDAPaciMatch, NULL, NULL,
4526 {NULL, SLAP_MR_NONE, NULL, NULL, NULL, NULL}
4535 /* we should only be called once (from main) */
4536 assert( schema_init_done == 0 );
4538 for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
4539 res = register_syntax( syntax_defs[i].sd_desc,
4540 syntax_defs[i].sd_flags,
4541 syntax_defs[i].sd_validate,
4542 syntax_defs[i].sd_normalize,
4543 syntax_defs[i].sd_pretty
4544 #ifdef SLAPD_BINARY_CONVERSION
4546 syntax_defs[i].sd_ber2str,
4547 syntax_defs[i].sd_str2ber
4552 fprintf( stderr, "schema_init: Error registering syntax %s\n",
4553 syntax_defs[i].sd_desc );
4558 for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
4559 if( mrule_defs[i].mrd_usage == SLAP_MR_NONE ) {
4561 "schema_init: Ingoring unusable matching rule %s\n",
4562 mrule_defs[i].mrd_desc );
4566 res = register_matching_rule(
4567 mrule_defs[i].mrd_desc,
4568 mrule_defs[i].mrd_usage,
4569 mrule_defs[i].mrd_convert,
4570 mrule_defs[i].mrd_normalize,
4571 mrule_defs[i].mrd_match,
4572 mrule_defs[i].mrd_indexer,
4573 mrule_defs[i].mrd_filter,
4574 mrule_defs[i].mrd_associated );
4578 "schema_init: Error registering matching rule %s\n",
4579 mrule_defs[i].mrd_desc );
4583 schema_init_done = 1;
4584 return LDAP_SUCCESS;