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>
22 #include "lutil_md5.h"
23 /* We should replace MD5 with a faster hash */
24 #define HASH_BYTES LUTIL_MD5_BYTES
25 #define HASH_CONTEXT lutil_MD5_CTX
26 #define HASH_Init(c) lutil_MD5Init(c)
27 #define HASH_Update(c,buf,len) lutil_MD5Update(c,buf,len)
28 #define HASH_Final(d,c) lutil_MD5Final(d,c)
30 #include "lutil_hash.h"
31 /* We should replace MD5 with a faster hash */
32 #define HASH_BYTES LUTIL_HASH_BYTES
33 #define HASH_CONTEXT lutil_HASH_CTX
34 #define HASH_Init(c) lutil_HASHInit(c)
35 #define HASH_Update(c,buf,len) lutil_HASHUpdate(c,buf,len)
36 #define HASH_Final(d,c) lutil_HASHFinal(d,c)
39 /* recycled validatation routines */
40 #define berValidate blobValidate
42 /* unimplemented pretters */
44 #define integerPretty NULL
46 /* recycled matching routines */
47 #define bitStringMatch octetStringMatch
48 #define integerMatch caseIgnoreIA5Match
49 #define numericStringMatch caseIgnoreIA5Match
50 #define objectIdentifierMatch caseIgnoreIA5Match
51 #define telephoneNumberMatch caseIgnoreIA5Match
52 #define telephoneNumberSubstringsMatch caseIgnoreIA5SubstringsMatch
53 #define generalizedTimeMatch caseIgnoreIA5Match
54 #define generalizedTimeOrderingMatch caseIgnoreIA5Match
55 #define uniqueMemberMatch dnMatch
57 /* approx matching rules */
58 #define directoryStringApproxMatchOID "1.3.6.1.4.1.4203.666.4.4"
59 #define directoryStringApproxMatch approxMatch
60 #define directoryStringApproxIndexer approxIndexer
61 #define directoryStringApproxFilter approxFilter
62 #define IA5StringApproxMatchOID "1.3.6.1.4.1.4203.666.4.5"
63 #define IA5StringApproxMatch approxMatch
64 #define IA5StringApproxIndexer approxIndexer
65 #define IA5StringApproxFilter approxFilter
67 /* orderring matching rules */
68 #define caseIgnoreOrderingMatch caseIgnoreMatch
69 #define caseExactOrderingMatch caseExactMatch
71 /* unimplemented matching routines */
72 #define caseIgnoreListMatch NULL
73 #define caseIgnoreListSubstringsMatch NULL
74 #define protocolInformationMatch NULL
75 #define integerFirstComponentMatch NULL
77 #define OpenLDAPaciMatch NULL
78 #define authPasswordMatch NULL
80 /* recycled indexing/filtering routines */
81 #define dnIndexer caseIgnoreIndexer
82 #define dnFilter caseIgnoreFilter
83 #define integerIndexer caseIgnoreIA5Indexer
84 #define integerFilter caseIgnoreIA5Filter
86 #define telephoneNumberIndexer caseIgnoreIA5Indexer
87 #define telephoneNumberFilter caseIgnoreIA5Filter
88 #define telephoneNumberSubstringsIndexer caseIgnoreIA5SubstringsIndexer
89 #define telephoneNumberSubstringsFilter caseIgnoreIA5SubstringsFilter
91 static char *strcasechr( const char *str, int c )
93 char *lower = strchr( str, TOLOWER(c) );
94 char *upper = strchr( str, TOUPPER(c) );
96 if( lower && upper ) {
97 return lower < upper ? lower : upper;
111 struct berval *value,
112 void *assertedValue )
114 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
117 match = memcmp( value->bv_val,
118 ((struct berval *) assertedValue)->bv_val,
126 /* Index generation function */
127 int octetStringIndexer(
132 struct berval *prefix,
133 struct berval **values,
134 struct berval ***keysp )
138 struct berval **keys;
139 HASH_CONTEXT HASHcontext;
140 unsigned char HASHdigest[HASH_BYTES];
141 struct berval digest;
142 digest.bv_val = HASHdigest;
143 digest.bv_len = sizeof(HASHdigest);
145 /* we should have at least one value at this point */
146 assert( values != NULL && values[0] != NULL );
148 for( i=0; values[i] != NULL; i++ ) {
149 /* just count them */
152 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
154 slen = strlen( syntax->ssyn_oid );
155 mlen = strlen( mr->smr_oid );
157 for( i=0; values[i] != NULL; i++ ) {
158 HASH_Init( &HASHcontext );
159 if( prefix != NULL && prefix->bv_len > 0 ) {
160 HASH_Update( &HASHcontext,
161 prefix->bv_val, prefix->bv_len );
163 HASH_Update( &HASHcontext,
164 syntax->ssyn_oid, slen );
165 HASH_Update( &HASHcontext,
167 HASH_Update( &HASHcontext,
168 values[i]->bv_val, values[i]->bv_len );
169 HASH_Final( HASHdigest, &HASHcontext );
171 keys[i] = ber_bvdup( &digest );
181 /* Index generation function */
182 int octetStringFilter(
187 struct berval *prefix,
189 struct berval ***keysp )
192 struct berval **keys;
193 HASH_CONTEXT HASHcontext;
194 unsigned char HASHdigest[HASH_BYTES];
195 struct berval *value = (struct berval *) assertValue;
196 struct berval digest;
197 digest.bv_val = HASHdigest;
198 digest.bv_len = sizeof(HASHdigest);
200 slen = strlen( syntax->ssyn_oid );
201 mlen = strlen( mr->smr_oid );
203 keys = ch_malloc( sizeof( struct berval * ) * 2 );
205 HASH_Init( &HASHcontext );
206 if( prefix != NULL && prefix->bv_len > 0 ) {
207 HASH_Update( &HASHcontext,
208 prefix->bv_val, prefix->bv_len );
210 HASH_Update( &HASHcontext,
211 syntax->ssyn_oid, slen );
212 HASH_Update( &HASHcontext,
214 HASH_Update( &HASHcontext,
215 value->bv_val, value->bv_len );
216 HASH_Final( HASHdigest, &HASHcontext );
218 keys[0] = ber_bvdup( &digest );
234 if( in->bv_len == 0 ) return LDAP_SUCCESS;
236 dn = get_validated_dn( in->bv_val, 0, 0 );
238 rc = ( dn == NULL ) ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
250 struct berval **normalized )
254 if ( val->bv_len == 0 ) {
255 out = ber_bvdup( val );
258 #ifdef USE_DN_NORMALIZE
259 dn = get_validated_dn( val->bv_val, 1, 1 );
261 dn = get_validated_dn( val->bv_val, 0, 0 );
264 return LDAP_INVALID_SYNTAX;
267 out = (struct berval *)ch_malloc(sizeof(struct berval));
269 out->bv_len = strlen( dn );
282 struct berval *value,
283 void *assertedValue )
286 struct berval *asserted = (struct berval *) assertedValue;
288 match = value->bv_len - asserted->bv_len;
291 #ifdef USE_DN_NORMALIZE
292 match = strcmp( value->bv_val, asserted->bv_val );
294 match = strcasecmp( value->bv_val, asserted->bv_val );
299 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
300 "dnMatch: %d\n %s\n %s\n", match,
301 value->bv_val, asserted->bv_val ));
303 Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
304 match, value->bv_val, asserted->bv_val );
320 if( in->bv_len == 0 ) return LDAP_SUCCESS;
322 dn = ber_bvdup( in );
324 if( dn->bv_val[dn->bv_len-1] == '\'' ) {
325 /* assume presence of optional UID */
328 for(i=dn->bv_len-2; i>2; i--) {
329 if( dn->bv_val[i] != '0' && dn->bv_val[i] != '1' ) {
333 if( dn->bv_val[i] != '\'' ) {
334 return LDAP_INVALID_SYNTAX;
336 if( dn->bv_val[i-1] != 'B' ) {
337 return LDAP_INVALID_SYNTAX;
339 if( dn->bv_val[i-2] != '#' ) {
340 return LDAP_INVALID_SYNTAX;
343 /* trim the UID to allow use of dn_validate */
344 dn->bv_val[i-2] = '\0';
347 rc = dn_validate( dn->bv_val ) == NULL
348 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
358 struct berval **normalized )
360 struct berval *out = ber_bvdup( val );
362 if( out->bv_len != 0 ) {
366 ber_len_t uidlen = 0;
368 if( out->bv_val[out->bv_len-1] == '\'' ) {
369 /* assume presence of optional UID */
370 uid = strrchr( out->bv_val, '#' );
374 return LDAP_INVALID_SYNTAX;
377 uidlen = out->bv_len - (out->bv_val - uid);
378 /* temporarily trim the UID */
382 #ifdef USE_DN_NORMALIZE
383 dn = dn_normalize( out->bv_val );
385 dn = dn_validate( out->bv_val );
390 return LDAP_INVALID_SYNTAX;
396 /* restore the separator */
399 SAFEMEMCPY( &dn[dnlen], uid, uidlen );
403 out->bv_len = dnlen + uidlen;
415 /* any value allowed */
424 /* any value allowed */
435 /* very unforgiving validation, requires no normalization
436 * before simplistic matching
438 if( in->bv_len < 3 ) {
439 return LDAP_INVALID_SYNTAX;
442 if( in->bv_val[0] != 'B' ||
443 in->bv_val[1] != '\'' ||
444 in->bv_val[in->bv_len-1] != '\'' )
446 return LDAP_INVALID_SYNTAX;
449 for( i=in->bv_len-2; i>1; i-- ) {
450 if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
451 return LDAP_INVALID_SYNTAX;
459 * Handling boolean syntax and matching is quite rigid.
460 * A more flexible approach would be to allow a variety
461 * of strings to be normalized and prettied into TRUE
469 /* very unforgiving validation, requires no normalization
470 * before simplistic matching
473 if( in->bv_len == 4 ) {
474 if( !memcmp( in->bv_val, "TRUE", 4 ) ) {
477 } else if( in->bv_len == 5 ) {
478 if( !memcmp( in->bv_val, "FALSE", 5 ) ) {
483 return LDAP_INVALID_SYNTAX;
492 struct berval *value,
493 void *assertedValue )
495 /* simplistic matching allowed by rigid validation */
496 struct berval *asserted = (struct berval *) assertedValue;
497 *matchp = value->bv_len != asserted->bv_len;
508 unsigned char *u = in->bv_val;
510 if( !in->bv_len ) return LDAP_INVALID_SYNTAX;
512 for( count = in->bv_len; count > 0; count-=len, u+=len ) {
513 /* get the length indicated by the first byte */
514 len = LDAP_UTF8_CHARLEN( u );
516 /* should not be zero */
517 if( len == 0 ) return LDAP_INVALID_SYNTAX;
519 /* make sure len corresponds with the offset
520 to the next character */
521 if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
524 if( count != 0 ) return LDAP_INVALID_SYNTAX;
533 struct berval **normalized )
535 struct berval *newval;
538 newval = ch_malloc( sizeof( struct berval ) );
542 /* Ignore initial whitespace */
543 while ( ldap_utf8_isspace( p ) ) {
549 return LDAP_INVALID_SYNTAX;
552 newval->bv_val = ch_strdup( p );
553 p = q = newval->bv_val;
559 if ( ldap_utf8_isspace( p ) ) {
560 len = LDAP_UTF8_COPY(q,p);
565 /* Ignore the extra whitespace */
566 while ( ldap_utf8_isspace( p ) ) {
570 len = LDAP_UTF8_COPY(q,p);
577 assert( *newval->bv_val );
578 assert( newval->bv_val < p );
581 /* cannot start with a space */
582 assert( !ldap_utf8_isspace(newval->bv_val) );
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.
594 /* cannot end with a space */
595 assert( !ldap_utf8_isspace( LDAP_UTF8_PREV(q) ) );
600 newval->bv_len = q - newval->bv_val;
601 *normalized = newval;
607 /* Returns Unicode cannonically normalized copy of a substring assertion
608 * Skipping attribute description */
609 SubstringsAssertion *
610 UTF8SubstringsassertionNormalize(
611 SubstringsAssertion *sa,
614 SubstringsAssertion *nsa;
617 nsa = (SubstringsAssertion *)ch_calloc( 1, sizeof(SubstringsAssertion) );
622 if( sa->sa_initial != NULL ) {
623 nsa->sa_initial = ber_bvstr( UTF8normalize( sa->sa_initial->bv_val, casefold ) );
624 if( nsa->sa_initial == NULL ) {
629 if( sa->sa_any != NULL ) {
630 for( i=0; sa->sa_any[i] != NULL; i++ ) {
633 nsa->sa_any = (struct berval **)ch_malloc( (i + 1) * sizeof(struct berval *) );
634 for( i=0; sa->sa_any[i] != NULL; i++ ) {
635 nsa->sa_any[i] = ber_bvstr( UTF8normalize( sa->sa_any[i]->bv_val, casefold ) );
636 if( nsa->sa_any[i] == NULL ) {
640 nsa->sa_any[i] = NULL;
643 if( sa->sa_final != NULL ) {
644 nsa->sa_final = ber_bvstr( UTF8normalize( sa->sa_final->bv_val, casefold ) );
645 if( nsa->sa_final == NULL ) {
653 ch_free( nsa->sa_final );
654 ber_bvecfree( nsa->sa_any );
655 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 )
964 *matchp = UTF8normcmp( value->bv_val,
965 ((struct berval *) assertedValue)->bv_val,
968 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
971 match = strncmp( value->bv_val,
972 ((struct berval *) assertedValue)->bv_val,
982 caseExactSubstringsMatch(
987 struct berval *value,
988 void *assertedValue )
991 SubstringsAssertion *sub;
1000 nav = UTF8normalize( value->bv_val, UTF8_NOCASEFOLD );
1006 left.bv_len = strlen( nav );
1007 sub = UTF8SubstringsassertionNormalize( assertedValue, UTF8_NOCASEFOLD );
1010 sub = assertedValue;
1017 /* Add up asserted input length */
1018 if( sub->sa_initial ) {
1019 inlen += sub->sa_initial->bv_len;
1022 for(i=0; sub->sa_any[i] != NULL; i++) {
1023 inlen += sub->sa_any[i]->bv_len;
1026 if( sub->sa_final ) {
1027 inlen += sub->sa_final->bv_len;
1030 if( sub->sa_initial ) {
1031 if( inlen > left.bv_len ) {
1036 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
1037 sub->sa_initial->bv_len );
1043 left.bv_val += sub->sa_initial->bv_len;
1044 left.bv_len -= sub->sa_initial->bv_len;
1045 inlen -= sub->sa_initial->bv_len;
1048 if( sub->sa_final ) {
1049 if( inlen > left.bv_len ) {
1054 match = strncmp( sub->sa_final->bv_val,
1055 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
1056 sub->sa_final->bv_len );
1062 left.bv_len -= sub->sa_final->bv_len;
1063 inlen -= sub->sa_final->bv_len;
1067 for(i=0; sub->sa_any[i]; i++) {
1072 if( inlen > left.bv_len ) {
1073 /* not enough length */
1078 if( sub->sa_any[i]->bv_len == 0 ) {
1082 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
1089 idx = p - left.bv_val;
1090 assert( idx < left.bv_len );
1092 if( idx >= left.bv_len ) {
1093 /* this shouldn't happen */
1100 if( sub->sa_any[i]->bv_len > left.bv_len ) {
1101 /* not enough left */
1106 match = strncmp( left.bv_val,
1107 sub->sa_any[i]->bv_val,
1108 sub->sa_any[i]->bv_len );
1116 left.bv_val += sub->sa_any[i]->bv_len;
1117 left.bv_len -= sub->sa_any[i]->bv_len;
1118 inlen -= sub->sa_any[i]->bv_len;
1126 ch_free( sub->sa_final );
1127 ber_bvecfree( sub->sa_any );
1128 ch_free( sub->sa_initial );
1133 return LDAP_SUCCESS;
1136 /* Index generation function */
1137 int caseExactIndexer(
1142 struct berval *prefix,
1143 struct berval **values,
1144 struct berval ***keysp )
1148 struct berval **keys;
1149 HASH_CONTEXT HASHcontext;
1150 unsigned char HASHdigest[HASH_BYTES];
1151 struct berval digest;
1152 digest.bv_val = HASHdigest;
1153 digest.bv_len = sizeof(HASHdigest);
1155 /* we should have at least one value at this point */
1156 assert( values != NULL && values[0] != NULL );
1158 for( i=0; values[i] != NULL; i++ ) {
1159 /* just count them */
1162 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
1164 slen = strlen( syntax->ssyn_oid );
1165 mlen = strlen( mr->smr_oid );
1167 for( i=0; values[i] != NULL; i++ ) {
1168 struct berval *value;
1170 value = ber_bvstr( UTF8normalize( values[i]->bv_val, UTF8_NOCASEFOLD ) );
1175 HASH_Init( &HASHcontext );
1176 if( prefix != NULL && prefix->bv_len > 0 ) {
1177 HASH_Update( &HASHcontext,
1178 prefix->bv_val, prefix->bv_len );
1180 HASH_Update( &HASHcontext,
1181 syntax->ssyn_oid, slen );
1182 HASH_Update( &HASHcontext,
1183 mr->smr_oid, mlen );
1184 HASH_Update( &HASHcontext,
1185 value->bv_val, value->bv_len );
1186 HASH_Final( HASHdigest, &HASHcontext );
1189 ber_bvfree( value );
1192 keys[i] = ber_bvdup( &digest );
1197 return LDAP_SUCCESS;
1200 /* Index generation function */
1201 int caseExactFilter(
1206 struct berval *prefix,
1208 struct berval ***keysp )
1211 struct berval **keys;
1212 HASH_CONTEXT HASHcontext;
1213 unsigned char HASHdigest[HASH_BYTES];
1214 struct berval *value;
1215 struct berval digest;
1216 digest.bv_val = HASHdigest;
1217 digest.bv_len = sizeof(HASHdigest);
1219 slen = strlen( syntax->ssyn_oid );
1220 mlen = strlen( mr->smr_oid );
1223 value = ber_bvstr( UTF8normalize( ((struct berval *) assertValue)->bv_val,
1224 UTF8_NOCASEFOLD ) );
1225 /* This usually happens if filter contains bad UTF8 */
1226 if( value == NULL ) {
1227 keys = ch_malloc( sizeof( struct berval * ) );
1229 return LDAP_SUCCESS;
1232 value = (struct berval *) assertValue;
1235 keys = ch_malloc( sizeof( struct berval * ) * 2 );
1237 HASH_Init( &HASHcontext );
1238 if( prefix != NULL && prefix->bv_len > 0 ) {
1239 HASH_Update( &HASHcontext,
1240 prefix->bv_val, prefix->bv_len );
1242 HASH_Update( &HASHcontext,
1243 syntax->ssyn_oid, slen );
1244 HASH_Update( &HASHcontext,
1245 mr->smr_oid, mlen );
1246 HASH_Update( &HASHcontext,
1247 value->bv_val, value->bv_len );
1248 HASH_Final( HASHdigest, &HASHcontext );
1250 keys[0] = ber_bvdup( &digest );
1254 ber_bvfree( value );
1258 return LDAP_SUCCESS;
1261 /* Substrings Index generation function */
1262 int caseExactSubstringsIndexer(
1267 struct berval *prefix,
1268 struct berval **values,
1269 struct berval ***keysp )
1273 struct berval **keys;
1275 struct berval **nvalues;
1278 HASH_CONTEXT HASHcontext;
1279 unsigned char HASHdigest[HASH_BYTES];
1280 struct berval digest;
1281 digest.bv_val = HASHdigest;
1282 digest.bv_len = sizeof(HASHdigest);
1284 /* we should have at least one value at this point */
1285 assert( values != NULL && values[0] != NULL );
1290 /* create normalized copy of values */
1291 for( i=0; values[i] != NULL; i++ ) {
1294 nvalues = ch_malloc( sizeof( struct berval * ) * (i+1) );
1295 for( i=0; values[i] != NULL; i++ ) {
1296 nvalues[i] = ber_bvstr( UTF8normalize( values[i]->bv_val, UTF8_NOCASEFOLD ) );
1302 for( i=0; values[i] != NULL; i++ ) {
1303 /* count number of indices to generate */
1304 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
1308 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1309 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1310 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1311 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1313 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1317 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
1318 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1319 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1323 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1324 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1325 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1326 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1328 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1334 /* no keys to generate */
1336 return LDAP_SUCCESS;
1339 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1341 slen = strlen( syntax->ssyn_oid );
1342 mlen = strlen( mr->smr_oid );
1345 for( i=0; values[i] != NULL; i++ ) {
1347 struct berval *value;
1349 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
1353 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
1354 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
1356 char pre = SLAP_INDEX_SUBSTR_PREFIX;
1357 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
1359 for( j=0; j<max; j++ ) {
1360 HASH_Init( &HASHcontext );
1361 if( prefix != NULL && prefix->bv_len > 0 ) {
1362 HASH_Update( &HASHcontext,
1363 prefix->bv_val, prefix->bv_len );
1366 HASH_Update( &HASHcontext,
1367 &pre, sizeof( pre ) );
1368 HASH_Update( &HASHcontext,
1369 syntax->ssyn_oid, slen );
1370 HASH_Update( &HASHcontext,
1371 mr->smr_oid, mlen );
1372 HASH_Update( &HASHcontext,
1374 SLAP_INDEX_SUBSTR_MAXLEN );
1375 HASH_Final( HASHdigest, &HASHcontext );
1377 keys[nkeys++] = ber_bvdup( &digest );
1381 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1382 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1384 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
1387 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1388 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1389 HASH_Init( &HASHcontext );
1390 if( prefix != NULL && prefix->bv_len > 0 ) {
1391 HASH_Update( &HASHcontext,
1392 prefix->bv_val, prefix->bv_len );
1394 HASH_Update( &HASHcontext,
1395 &pre, sizeof( pre ) );
1396 HASH_Update( &HASHcontext,
1397 syntax->ssyn_oid, slen );
1398 HASH_Update( &HASHcontext,
1399 mr->smr_oid, mlen );
1400 HASH_Update( &HASHcontext,
1402 HASH_Final( HASHdigest, &HASHcontext );
1404 keys[nkeys++] = ber_bvdup( &digest );
1407 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1408 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1409 HASH_Init( &HASHcontext );
1410 if( prefix != NULL && prefix->bv_len > 0 ) {
1411 HASH_Update( &HASHcontext,
1412 prefix->bv_val, prefix->bv_len );
1414 HASH_Update( &HASHcontext,
1415 &pre, sizeof( pre ) );
1416 HASH_Update( &HASHcontext,
1417 syntax->ssyn_oid, slen );
1418 HASH_Update( &HASHcontext,
1419 mr->smr_oid, mlen );
1420 HASH_Update( &HASHcontext,
1421 &value->bv_val[value->bv_len-j], j );
1422 HASH_Final( HASHdigest, &HASHcontext );
1424 keys[nkeys++] = ber_bvdup( &digest );
1440 ber_bvecfree( nvalues );
1443 return LDAP_SUCCESS;
1446 int caseExactSubstringsFilter(
1451 struct berval *prefix,
1453 struct berval ***keysp )
1455 SubstringsAssertion *sa;
1457 ber_len_t nkeys = 0;
1458 size_t slen, mlen, klen;
1459 struct berval **keys;
1460 HASH_CONTEXT HASHcontext;
1461 unsigned char HASHdigest[HASH_BYTES];
1462 struct berval *value;
1463 struct berval digest;
1466 sa = UTF8SubstringsassertionNormalize( assertValue, UTF8_NOCASEFOLD );
1472 return LDAP_SUCCESS;
1475 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1476 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1481 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1483 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1484 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1485 /* don't bother accounting for stepping */
1486 nkeys += sa->sa_any[i]->bv_len -
1487 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1492 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1493 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1500 return LDAP_SUCCESS;
1503 digest.bv_val = HASHdigest;
1504 digest.bv_len = sizeof(HASHdigest);
1506 slen = strlen( syntax->ssyn_oid );
1507 mlen = strlen( mr->smr_oid );
1509 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1512 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1513 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1515 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1516 value = sa->sa_initial;
1518 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1519 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1521 HASH_Init( &HASHcontext );
1522 if( prefix != NULL && prefix->bv_len > 0 ) {
1523 HASH_Update( &HASHcontext,
1524 prefix->bv_val, prefix->bv_len );
1526 HASH_Update( &HASHcontext,
1527 &pre, sizeof( pre ) );
1528 HASH_Update( &HASHcontext,
1529 syntax->ssyn_oid, slen );
1530 HASH_Update( &HASHcontext,
1531 mr->smr_oid, mlen );
1532 HASH_Update( &HASHcontext,
1533 value->bv_val, klen );
1534 HASH_Final( HASHdigest, &HASHcontext );
1536 keys[nkeys++] = ber_bvdup( &digest );
1539 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1541 pre = SLAP_INDEX_SUBSTR_PREFIX;
1542 klen = SLAP_INDEX_SUBSTR_MAXLEN;
1544 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1545 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
1549 value = sa->sa_any[i];
1552 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
1553 j += SLAP_INDEX_SUBSTR_STEP )
1555 HASH_Init( &HASHcontext );
1556 if( prefix != NULL && prefix->bv_len > 0 ) {
1557 HASH_Update( &HASHcontext,
1558 prefix->bv_val, prefix->bv_len );
1560 HASH_Update( &HASHcontext,
1561 &pre, sizeof( pre ) );
1562 HASH_Update( &HASHcontext,
1563 syntax->ssyn_oid, slen );
1564 HASH_Update( &HASHcontext,
1565 mr->smr_oid, mlen );
1566 HASH_Update( &HASHcontext,
1567 &value->bv_val[j], klen );
1568 HASH_Final( HASHdigest, &HASHcontext );
1570 keys[nkeys++] = ber_bvdup( &digest );
1576 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1577 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1579 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1580 value = sa->sa_final;
1582 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1583 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1585 HASH_Init( &HASHcontext );
1586 if( prefix != NULL && prefix->bv_len > 0 ) {
1587 HASH_Update( &HASHcontext,
1588 prefix->bv_val, prefix->bv_len );
1590 HASH_Update( &HASHcontext,
1591 &pre, sizeof( pre ) );
1592 HASH_Update( &HASHcontext,
1593 syntax->ssyn_oid, slen );
1594 HASH_Update( &HASHcontext,
1595 mr->smr_oid, mlen );
1596 HASH_Update( &HASHcontext,
1597 &value->bv_val[value->bv_len-klen], klen );
1598 HASH_Final( HASHdigest, &HASHcontext );
1600 keys[nkeys++] = ber_bvdup( &digest );
1611 ch_free( sa->sa_final );
1612 ber_bvecfree( sa->sa_any );
1613 ch_free( sa->sa_initial );
1617 return LDAP_SUCCESS;
1626 struct berval *value,
1627 void *assertedValue )
1630 *matchp = UTF8normcmp( value->bv_val,
1631 ((struct berval *) assertedValue)->bv_val,
1634 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
1637 match = strncasecmp( value->bv_val,
1638 ((struct berval *) assertedValue)->bv_val,
1644 return LDAP_SUCCESS;
1648 caseIgnoreSubstringsMatch(
1653 struct berval *value,
1654 void *assertedValue )
1657 SubstringsAssertion *sub;
1666 nav = UTF8normalize( value->bv_val, UTF8_CASEFOLD );
1672 left.bv_len = strlen( nav );
1673 sub = UTF8SubstringsassertionNormalize( assertedValue, UTF8_CASEFOLD );
1676 sub = assertedValue;
1683 /* Add up asserted input length */
1684 if( sub->sa_initial ) {
1685 inlen += sub->sa_initial->bv_len;
1688 for(i=0; sub->sa_any[i] != NULL; i++) {
1689 inlen += sub->sa_any[i]->bv_len;
1692 if( sub->sa_final ) {
1693 inlen += sub->sa_final->bv_len;
1696 if( sub->sa_initial ) {
1697 if( inlen > left.bv_len ) {
1703 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
1704 sub->sa_initial->bv_len );
1706 match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
1707 sub->sa_initial->bv_len );
1714 left.bv_val += sub->sa_initial->bv_len;
1715 left.bv_len -= sub->sa_initial->bv_len;
1716 inlen -= sub->sa_initial->bv_len;
1719 if( sub->sa_final ) {
1720 if( inlen > left.bv_len ) {
1726 match = strncmp( sub->sa_final->bv_val,
1727 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
1728 sub->sa_final->bv_len );
1730 match = strncasecmp( sub->sa_final->bv_val,
1731 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
1732 sub->sa_final->bv_len );
1739 left.bv_len -= sub->sa_final->bv_len;
1740 inlen -= sub->sa_final->bv_len;
1744 for(i=0; sub->sa_any[i]; i++) {
1749 if( inlen > left.bv_len ) {
1750 /* not enough length */
1755 if( sub->sa_any[i]->bv_len == 0 ) {
1760 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
1762 p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
1770 idx = p - left.bv_val;
1771 assert( idx < left.bv_len );
1773 if( idx >= left.bv_len ) {
1774 /* this shouldn't happen */
1781 if( sub->sa_any[i]->bv_len > left.bv_len ) {
1782 /* not enough left */
1788 match = strncmp( left.bv_val,
1789 sub->sa_any[i]->bv_val,
1790 sub->sa_any[i]->bv_len );
1792 match = strncasecmp( left.bv_val,
1793 sub->sa_any[i]->bv_val,
1794 sub->sa_any[i]->bv_len );
1804 left.bv_val += sub->sa_any[i]->bv_len;
1805 left.bv_len -= sub->sa_any[i]->bv_len;
1806 inlen -= sub->sa_any[i]->bv_len;
1814 ch_free( sub->sa_final );
1815 ber_bvecfree( sub->sa_any );
1816 ch_free( sub->sa_initial );
1821 return LDAP_SUCCESS;
1824 /* Index generation function */
1825 int caseIgnoreIndexer(
1830 struct berval *prefix,
1831 struct berval **values,
1832 struct berval ***keysp )
1836 struct berval **keys;
1837 HASH_CONTEXT HASHcontext;
1838 unsigned char HASHdigest[HASH_BYTES];
1839 struct berval digest;
1840 digest.bv_val = HASHdigest;
1841 digest.bv_len = sizeof(HASHdigest);
1843 /* we should have at least one value at this point */
1844 assert( values != NULL && values[0] != NULL );
1846 for( i=0; values[i] != NULL; i++ ) {
1847 /* just count them */
1850 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
1852 slen = strlen( syntax->ssyn_oid );
1853 mlen = strlen( mr->smr_oid );
1855 for( i=0; values[i] != NULL; i++ ) {
1856 struct berval *value;
1858 value = ber_bvstr( UTF8normalize( values[i]->bv_val, UTF8_CASEFOLD ) );
1860 value = ber_bvdup( values[i] );
1861 ldap_pvt_str2upper( value->bv_val );
1863 HASH_Init( &HASHcontext );
1864 if( prefix != NULL && prefix->bv_len > 0 ) {
1865 HASH_Update( &HASHcontext,
1866 prefix->bv_val, prefix->bv_len );
1868 HASH_Update( &HASHcontext,
1869 syntax->ssyn_oid, slen );
1870 HASH_Update( &HASHcontext,
1871 mr->smr_oid, mlen );
1872 HASH_Update( &HASHcontext,
1873 value->bv_val, value->bv_len );
1874 HASH_Final( HASHdigest, &HASHcontext );
1876 ber_bvfree( value );
1878 keys[i] = ber_bvdup( &digest );
1883 return LDAP_SUCCESS;
1886 /* Index generation function */
1887 int caseIgnoreFilter(
1892 struct berval *prefix,
1894 struct berval ***keysp )
1897 struct berval **keys;
1898 HASH_CONTEXT HASHcontext;
1899 unsigned char HASHdigest[HASH_BYTES];
1900 struct berval *value;
1901 struct berval digest;
1902 digest.bv_val = HASHdigest;
1903 digest.bv_len = sizeof(HASHdigest);
1905 slen = strlen( syntax->ssyn_oid );
1906 mlen = strlen( mr->smr_oid );
1909 value = ber_bvstr( UTF8normalize( ((struct berval *) assertValue)->bv_val,
1911 /* This usually happens if filter contains bad UTF8 */
1912 if( value == NULL ) {
1913 keys = ch_malloc( sizeof( struct berval * ) );
1915 return LDAP_SUCCESS;
1918 value = ber_bvdup( (struct berval *) assertValue );
1919 ldap_pvt_str2upper( value->bv_val );
1922 keys = ch_malloc( sizeof( struct berval * ) * 2 );
1924 HASH_Init( &HASHcontext );
1925 if( prefix != NULL && prefix->bv_len > 0 ) {
1926 HASH_Update( &HASHcontext,
1927 prefix->bv_val, prefix->bv_len );
1929 HASH_Update( &HASHcontext,
1930 syntax->ssyn_oid, slen );
1931 HASH_Update( &HASHcontext,
1932 mr->smr_oid, mlen );
1933 HASH_Update( &HASHcontext,
1934 value->bv_val, value->bv_len );
1935 HASH_Final( HASHdigest, &HASHcontext );
1937 keys[0] = ber_bvdup( &digest );
1940 ber_bvfree( value );
1944 return LDAP_SUCCESS;
1947 /* Substrings Index generation function */
1948 int caseIgnoreSubstringsIndexer(
1953 struct berval *prefix,
1954 struct berval **values,
1955 struct berval ***keysp )
1959 struct berval **keys;
1961 struct berval **nvalues;
1964 HASH_CONTEXT HASHcontext;
1965 unsigned char HASHdigest[HASH_BYTES];
1966 struct berval digest;
1967 digest.bv_val = HASHdigest;
1968 digest.bv_len = sizeof(HASHdigest);
1970 /* we should have at least one value at this point */
1971 assert( values != NULL && values[0] != NULL );
1976 /* create normalized copy of values */
1977 for( i=0; values[i] != NULL; i++ ) {
1980 nvalues = ch_malloc( sizeof( struct berval * ) * (i+1) );
1981 for( i=0; values[i] != NULL; i++ ) {
1982 nvalues[i] = ber_bvstr( UTF8normalize( values[i]->bv_val, UTF8_CASEFOLD ) );
1988 for( i=0; values[i] != NULL; i++ ) {
1989 /* count number of indices to generate */
1990 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
1994 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1995 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1996 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1997 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1999 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2003 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2004 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2005 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2009 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2010 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2011 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2012 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2014 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2020 /* no keys to generate */
2022 return LDAP_SUCCESS;
2025 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2027 slen = strlen( syntax->ssyn_oid );
2028 mlen = strlen( mr->smr_oid );
2031 for( i=0; values[i] != NULL; i++ ) {
2033 struct berval *value;
2035 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2040 value = ber_bvdup( values[i] );
2041 ldap_pvt_str2upper( value->bv_val );
2044 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2045 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2047 char pre = SLAP_INDEX_SUBSTR_PREFIX;
2048 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2050 for( j=0; j<max; j++ ) {
2051 HASH_Init( &HASHcontext );
2052 if( prefix != NULL && prefix->bv_len > 0 ) {
2053 HASH_Update( &HASHcontext,
2054 prefix->bv_val, prefix->bv_len );
2057 HASH_Update( &HASHcontext,
2058 &pre, sizeof( pre ) );
2059 HASH_Update( &HASHcontext,
2060 syntax->ssyn_oid, slen );
2061 HASH_Update( &HASHcontext,
2062 mr->smr_oid, mlen );
2063 HASH_Update( &HASHcontext,
2065 SLAP_INDEX_SUBSTR_MAXLEN );
2066 HASH_Final( HASHdigest, &HASHcontext );
2068 keys[nkeys++] = ber_bvdup( &digest );
2072 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2073 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2075 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2078 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2079 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2080 HASH_Init( &HASHcontext );
2081 if( prefix != NULL && prefix->bv_len > 0 ) {
2082 HASH_Update( &HASHcontext,
2083 prefix->bv_val, prefix->bv_len );
2085 HASH_Update( &HASHcontext,
2086 &pre, sizeof( pre ) );
2087 HASH_Update( &HASHcontext,
2088 syntax->ssyn_oid, slen );
2089 HASH_Update( &HASHcontext,
2090 mr->smr_oid, mlen );
2091 HASH_Update( &HASHcontext,
2093 HASH_Final( HASHdigest, &HASHcontext );
2095 keys[nkeys++] = ber_bvdup( &digest );
2098 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2099 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2100 HASH_Init( &HASHcontext );
2101 if( prefix != NULL && prefix->bv_len > 0 ) {
2102 HASH_Update( &HASHcontext,
2103 prefix->bv_val, prefix->bv_len );
2105 HASH_Update( &HASHcontext,
2106 &pre, sizeof( pre ) );
2107 HASH_Update( &HASHcontext,
2108 syntax->ssyn_oid, slen );
2109 HASH_Update( &HASHcontext,
2110 mr->smr_oid, mlen );
2111 HASH_Update( &HASHcontext,
2112 &value->bv_val[value->bv_len-j], j );
2113 HASH_Final( HASHdigest, &HASHcontext );
2115 keys[nkeys++] = ber_bvdup( &digest );
2120 ber_bvfree( value );
2133 ber_bvecfree( nvalues );
2135 return LDAP_SUCCESS;
2138 int caseIgnoreSubstringsFilter(
2143 struct berval *prefix,
2145 struct berval ***keysp )
2147 SubstringsAssertion *sa;
2149 ber_len_t nkeys = 0;
2150 size_t slen, mlen, klen;
2151 struct berval **keys;
2152 HASH_CONTEXT HASHcontext;
2153 unsigned char HASHdigest[HASH_BYTES];
2154 struct berval *value;
2155 struct berval digest;
2158 sa = UTF8SubstringsassertionNormalize( assertValue, UTF8_CASEFOLD );
2164 return LDAP_SUCCESS;
2167 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
2168 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2173 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
2175 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2176 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2177 /* don't bother accounting for stepping */
2178 nkeys += sa->sa_any[i]->bv_len -
2179 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2184 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
2185 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2192 return LDAP_SUCCESS;
2195 digest.bv_val = HASHdigest;
2196 digest.bv_len = sizeof(HASHdigest);
2198 slen = strlen( syntax->ssyn_oid );
2199 mlen = strlen( mr->smr_oid );
2201 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2204 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
2205 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2207 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2209 value = sa->sa_initial;
2211 value = ber_bvdup( sa->sa_initial );
2212 ldap_pvt_str2upper( value->bv_val );
2215 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2216 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2218 HASH_Init( &HASHcontext );
2219 if( prefix != NULL && prefix->bv_len > 0 ) {
2220 HASH_Update( &HASHcontext,
2221 prefix->bv_val, prefix->bv_len );
2223 HASH_Update( &HASHcontext,
2224 &pre, sizeof( pre ) );
2225 HASH_Update( &HASHcontext,
2226 syntax->ssyn_oid, slen );
2227 HASH_Update( &HASHcontext,
2228 mr->smr_oid, mlen );
2229 HASH_Update( &HASHcontext,
2230 value->bv_val, klen );
2231 HASH_Final( HASHdigest, &HASHcontext );
2234 ber_bvfree( value );
2236 keys[nkeys++] = ber_bvdup( &digest );
2239 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
2241 pre = SLAP_INDEX_SUBSTR_PREFIX;
2242 klen = SLAP_INDEX_SUBSTR_MAXLEN;
2244 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2245 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
2250 value = sa->sa_any[i];
2252 value = ber_bvdup( sa->sa_any[i] );
2253 ldap_pvt_str2upper( value->bv_val );
2257 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
2258 j += SLAP_INDEX_SUBSTR_STEP )
2260 HASH_Init( &HASHcontext );
2261 if( prefix != NULL && prefix->bv_len > 0 ) {
2262 HASH_Update( &HASHcontext,
2263 prefix->bv_val, prefix->bv_len );
2265 HASH_Update( &HASHcontext,
2266 &pre, sizeof( pre ) );
2267 HASH_Update( &HASHcontext,
2268 syntax->ssyn_oid, slen );
2269 HASH_Update( &HASHcontext,
2270 mr->smr_oid, mlen );
2271 HASH_Update( &HASHcontext,
2272 &value->bv_val[j], klen );
2273 HASH_Final( HASHdigest, &HASHcontext );
2275 keys[nkeys++] = ber_bvdup( &digest );
2279 ber_bvfree( value );
2284 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
2285 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2287 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2289 value = sa->sa_final;
2291 value = ber_bvdup( sa->sa_final );
2292 ldap_pvt_str2upper( value->bv_val );
2295 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2296 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2298 HASH_Init( &HASHcontext );
2299 if( prefix != NULL && prefix->bv_len > 0 ) {
2300 HASH_Update( &HASHcontext,
2301 prefix->bv_val, prefix->bv_len );
2303 HASH_Update( &HASHcontext,
2304 &pre, sizeof( pre ) );
2305 HASH_Update( &HASHcontext,
2306 syntax->ssyn_oid, slen );
2307 HASH_Update( &HASHcontext,
2308 mr->smr_oid, mlen );
2309 HASH_Update( &HASHcontext,
2310 &value->bv_val[value->bv_len-klen], klen );
2311 HASH_Final( HASHdigest, &HASHcontext );
2314 ber_bvfree( value );
2316 keys[nkeys++] = ber_bvdup( &digest );
2327 ch_free( sa->sa_final );
2328 ber_bvecfree( sa->sa_any );
2329 ch_free( sa->sa_initial );
2333 return LDAP_SUCCESS;
2339 struct berval *val )
2343 if( val->bv_len == 0 ) {
2344 /* disallow empty strings */
2345 return LDAP_INVALID_SYNTAX;
2348 if( OID_LEADCHAR(val->bv_val[0]) ) {
2350 for(i=1; i < val->bv_len; i++) {
2351 if( OID_SEPARATOR( val->bv_val[i] ) ) {
2352 if( dot++ ) return 1;
2353 } else if ( OID_CHAR( val->bv_val[i] ) ) {
2356 return LDAP_INVALID_SYNTAX;
2360 return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
2362 } else if( DESC_LEADCHAR(val->bv_val[0]) ) {
2363 for(i=1; i < val->bv_len; i++) {
2364 if( !DESC_CHAR(val->bv_val[i] ) ) {
2365 return LDAP_INVALID_SYNTAX;
2369 return LDAP_SUCCESS;
2372 return LDAP_INVALID_SYNTAX;
2378 struct berval *val )
2382 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2384 if( val->bv_val[0] == '+' || val->bv_val[0] == '-' ) {
2385 if( val->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
2386 } else if( !ASCII_DIGIT(val->bv_val[0]) ) {
2387 return LDAP_INVALID_SYNTAX;
2390 for(i=1; i < val->bv_len; i++) {
2391 if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
2394 return LDAP_SUCCESS;
2401 struct berval **normalized )
2404 struct berval *newval;
2410 negative = ( *p == '-' );
2411 if( *p == '-' || *p == '+' ) p++;
2413 /* Ignore leading zeros */
2414 while ( *p == '0' ) p++;
2416 newval = (struct berval *) ch_malloc( sizeof(struct berval) );
2419 newval->bv_val = ch_strdup("0");
2424 newval->bv_val = ch_malloc( val->bv_len + 1 );
2428 newval->bv_val[newval->bv_len++] = '-';
2431 for( ; *p != '\0'; p++ ) {
2432 newval->bv_val[newval->bv_len++] = *p;
2436 *normalized = newval;
2437 return LDAP_SUCCESS;
2441 countryStringValidate(
2443 struct berval *val )
2445 if( val->bv_len != 2 ) return LDAP_INVALID_SYNTAX;
2447 if( !SLAP_PRINTABLE(val->bv_val[0]) ) {
2448 return LDAP_INVALID_SYNTAX;
2450 if( !SLAP_PRINTABLE(val->bv_val[1]) ) {
2451 return LDAP_INVALID_SYNTAX;
2454 return LDAP_SUCCESS;
2458 printableStringValidate(
2460 struct berval *val )
2464 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2466 for(i=0; i < val->bv_len; i++) {
2467 if( !SLAP_PRINTABLE(val->bv_val[i]) ) {
2468 return LDAP_INVALID_SYNTAX;
2472 return LDAP_SUCCESS;
2476 printablesStringValidate(
2478 struct berval *val )
2482 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2484 for(i=0; i < val->bv_len; i++) {
2485 if( !SLAP_PRINTABLES(val->bv_val[i]) ) {
2486 return LDAP_INVALID_SYNTAX;
2490 return LDAP_SUCCESS;
2496 struct berval *val )
2500 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
2502 for(i=0; i < val->bv_len; i++) {
2503 if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
2506 return LDAP_SUCCESS;
2513 struct berval **normalized )
2515 struct berval *newval;
2518 newval = ch_malloc( sizeof( struct berval ) );
2522 /* Ignore initial whitespace */
2523 while ( ASCII_SPACE( *p ) ) {
2529 return LDAP_INVALID_SYNTAX;
2532 newval->bv_val = ch_strdup( p );
2533 p = q = newval->bv_val;
2536 if ( ASCII_SPACE( *p ) ) {
2539 /* Ignore the extra whitespace */
2540 while ( ASCII_SPACE( *p ) ) {
2548 assert( *newval->bv_val );
2549 assert( newval->bv_val < p );
2552 /* cannot start with a space */
2553 assert( !ASCII_SPACE(*newval->bv_val) );
2556 * If the string ended in space, backup the pointer one
2557 * position. One is enough because the above loop collapsed
2558 * all whitespace to a single space.
2561 if ( ASCII_SPACE( q[-1] ) ) {
2565 /* cannot end with a space */
2566 assert( !ASCII_SPACE( q[-1] ) );
2568 /* null terminate */
2571 newval->bv_len = q - newval->bv_val;
2572 *normalized = newval;
2574 return LDAP_SUCCESS;
2583 struct berval *value,
2584 void *assertedValue )
2586 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
2589 match = strncmp( value->bv_val,
2590 ((struct berval *) assertedValue)->bv_val,
2595 return LDAP_SUCCESS;
2599 caseExactIA5SubstringsMatch(
2604 struct berval *value,
2605 void *assertedValue )
2608 SubstringsAssertion *sub = assertedValue;
2609 struct berval left = *value;
2613 /* Add up asserted input length */
2614 if( sub->sa_initial ) {
2615 inlen += sub->sa_initial->bv_len;
2618 for(i=0; sub->sa_any[i] != NULL; i++) {
2619 inlen += sub->sa_any[i]->bv_len;
2622 if( sub->sa_final ) {
2623 inlen += sub->sa_final->bv_len;
2626 if( sub->sa_initial ) {
2627 if( inlen > left.bv_len ) {
2632 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
2633 sub->sa_initial->bv_len );
2639 left.bv_val += sub->sa_initial->bv_len;
2640 left.bv_len -= sub->sa_initial->bv_len;
2641 inlen -= sub->sa_initial->bv_len;
2644 if( sub->sa_final ) {
2645 if( inlen > left.bv_len ) {
2650 match = strncmp( sub->sa_final->bv_val,
2651 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
2652 sub->sa_final->bv_len );
2658 left.bv_len -= sub->sa_final->bv_len;
2659 inlen -= sub->sa_final->bv_len;
2663 for(i=0; sub->sa_any[i]; i++) {
2668 if( inlen > left.bv_len ) {
2669 /* not enough length */
2674 if( sub->sa_any[i]->bv_len == 0 ) {
2678 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
2685 idx = p - left.bv_val;
2686 assert( idx < left.bv_len );
2688 if( idx >= left.bv_len ) {
2689 /* this shouldn't happen */
2696 if( sub->sa_any[i]->bv_len > left.bv_len ) {
2697 /* not enough left */
2702 match = strncmp( left.bv_val,
2703 sub->sa_any[i]->bv_val,
2704 sub->sa_any[i]->bv_len );
2712 left.bv_val += sub->sa_any[i]->bv_len;
2713 left.bv_len -= sub->sa_any[i]->bv_len;
2714 inlen -= sub->sa_any[i]->bv_len;
2720 return LDAP_SUCCESS;
2723 /* Index generation function */
2724 int caseExactIA5Indexer(
2729 struct berval *prefix,
2730 struct berval **values,
2731 struct berval ***keysp )
2735 struct berval **keys;
2736 HASH_CONTEXT HASHcontext;
2737 unsigned char HASHdigest[HASH_BYTES];
2738 struct berval digest;
2739 digest.bv_val = HASHdigest;
2740 digest.bv_len = sizeof(HASHdigest);
2742 /* we should have at least one value at this point */
2743 assert( values != NULL && values[0] != NULL );
2745 for( i=0; values[i] != NULL; i++ ) {
2746 /* just count them */
2749 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
2751 slen = strlen( syntax->ssyn_oid );
2752 mlen = strlen( mr->smr_oid );
2754 for( i=0; values[i] != NULL; i++ ) {
2755 struct berval *value = values[i];
2757 HASH_Init( &HASHcontext );
2758 if( prefix != NULL && prefix->bv_len > 0 ) {
2759 HASH_Update( &HASHcontext,
2760 prefix->bv_val, prefix->bv_len );
2762 HASH_Update( &HASHcontext,
2763 syntax->ssyn_oid, slen );
2764 HASH_Update( &HASHcontext,
2765 mr->smr_oid, mlen );
2766 HASH_Update( &HASHcontext,
2767 value->bv_val, value->bv_len );
2768 HASH_Final( HASHdigest, &HASHcontext );
2770 keys[i] = ber_bvdup( &digest );
2775 return LDAP_SUCCESS;
2778 /* Index generation function */
2779 int caseExactIA5Filter(
2784 struct berval *prefix,
2786 struct berval ***keysp )
2789 struct berval **keys;
2790 HASH_CONTEXT HASHcontext;
2791 unsigned char HASHdigest[HASH_BYTES];
2792 struct berval *value;
2793 struct berval digest;
2794 digest.bv_val = HASHdigest;
2795 digest.bv_len = sizeof(HASHdigest);
2797 slen = strlen( syntax->ssyn_oid );
2798 mlen = strlen( mr->smr_oid );
2800 value = (struct berval *) assertValue;
2802 keys = ch_malloc( sizeof( struct berval * ) * 2 );
2804 HASH_Init( &HASHcontext );
2805 if( prefix != NULL && prefix->bv_len > 0 ) {
2806 HASH_Update( &HASHcontext,
2807 prefix->bv_val, prefix->bv_len );
2809 HASH_Update( &HASHcontext,
2810 syntax->ssyn_oid, slen );
2811 HASH_Update( &HASHcontext,
2812 mr->smr_oid, mlen );
2813 HASH_Update( &HASHcontext,
2814 value->bv_val, value->bv_len );
2815 HASH_Final( HASHdigest, &HASHcontext );
2817 keys[0] = ber_bvdup( &digest );
2821 return LDAP_SUCCESS;
2824 /* Substrings Index generation function */
2825 int caseExactIA5SubstringsIndexer(
2830 struct berval *prefix,
2831 struct berval **values,
2832 struct berval ***keysp )
2836 struct berval **keys;
2837 HASH_CONTEXT HASHcontext;
2838 unsigned char HASHdigest[HASH_BYTES];
2839 struct berval digest;
2840 digest.bv_val = HASHdigest;
2841 digest.bv_len = sizeof(HASHdigest);
2843 /* we should have at least one value at this point */
2844 assert( values != NULL && values[0] != NULL );
2847 for( i=0; values[i] != NULL; i++ ) {
2848 /* count number of indices to generate */
2849 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2853 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2854 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2855 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2856 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2858 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2862 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2863 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2864 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2868 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2869 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2870 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2871 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2873 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2879 /* no keys to generate */
2881 return LDAP_SUCCESS;
2884 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2886 slen = strlen( syntax->ssyn_oid );
2887 mlen = strlen( mr->smr_oid );
2890 for( i=0; values[i] != NULL; i++ ) {
2892 struct berval *value;
2895 if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2897 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2898 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2900 char pre = SLAP_INDEX_SUBSTR_PREFIX;
2901 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2903 for( j=0; j<max; j++ ) {
2904 HASH_Init( &HASHcontext );
2905 if( prefix != NULL && prefix->bv_len > 0 ) {
2906 HASH_Update( &HASHcontext,
2907 prefix->bv_val, prefix->bv_len );
2910 HASH_Update( &HASHcontext,
2911 &pre, sizeof( pre ) );
2912 HASH_Update( &HASHcontext,
2913 syntax->ssyn_oid, slen );
2914 HASH_Update( &HASHcontext,
2915 mr->smr_oid, mlen );
2916 HASH_Update( &HASHcontext,
2918 SLAP_INDEX_SUBSTR_MAXLEN );
2919 HASH_Final( HASHdigest, &HASHcontext );
2921 keys[nkeys++] = ber_bvdup( &digest );
2925 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2926 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2928 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2931 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2932 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2933 HASH_Init( &HASHcontext );
2934 if( prefix != NULL && prefix->bv_len > 0 ) {
2935 HASH_Update( &HASHcontext,
2936 prefix->bv_val, prefix->bv_len );
2938 HASH_Update( &HASHcontext,
2939 &pre, sizeof( pre ) );
2940 HASH_Update( &HASHcontext,
2941 syntax->ssyn_oid, slen );
2942 HASH_Update( &HASHcontext,
2943 mr->smr_oid, mlen );
2944 HASH_Update( &HASHcontext,
2946 HASH_Final( HASHdigest, &HASHcontext );
2948 keys[nkeys++] = ber_bvdup( &digest );
2951 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2952 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2953 HASH_Init( &HASHcontext );
2954 if( prefix != NULL && prefix->bv_len > 0 ) {
2955 HASH_Update( &HASHcontext,
2956 prefix->bv_val, prefix->bv_len );
2958 HASH_Update( &HASHcontext,
2959 &pre, sizeof( pre ) );
2960 HASH_Update( &HASHcontext,
2961 syntax->ssyn_oid, slen );
2962 HASH_Update( &HASHcontext,
2963 mr->smr_oid, mlen );
2964 HASH_Update( &HASHcontext,
2965 &value->bv_val[value->bv_len-j], j );
2966 HASH_Final( HASHdigest, &HASHcontext );
2968 keys[nkeys++] = ber_bvdup( &digest );
2982 return LDAP_SUCCESS;
2985 int caseExactIA5SubstringsFilter(
2990 struct berval *prefix,
2992 struct berval ***keysp )
2994 SubstringsAssertion *sa = assertValue;
2996 ber_len_t nkeys = 0;
2997 size_t slen, mlen, klen;
2998 struct berval **keys;
2999 HASH_CONTEXT HASHcontext;
3000 unsigned char HASHdigest[HASH_BYTES];
3001 struct berval *value;
3002 struct berval digest;
3004 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
3005 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3010 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
3012 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3013 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3014 /* don't bother accounting for stepping */
3015 nkeys += sa->sa_any[i]->bv_len -
3016 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
3021 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
3022 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3029 return LDAP_SUCCESS;
3032 digest.bv_val = HASHdigest;
3033 digest.bv_len = sizeof(HASHdigest);
3035 slen = strlen( syntax->ssyn_oid );
3036 mlen = strlen( mr->smr_oid );
3038 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
3041 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
3042 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3044 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3045 value = sa->sa_initial;
3047 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3048 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3050 HASH_Init( &HASHcontext );
3051 if( prefix != NULL && prefix->bv_len > 0 ) {
3052 HASH_Update( &HASHcontext,
3053 prefix->bv_val, prefix->bv_len );
3055 HASH_Update( &HASHcontext,
3056 &pre, sizeof( pre ) );
3057 HASH_Update( &HASHcontext,
3058 syntax->ssyn_oid, slen );
3059 HASH_Update( &HASHcontext,
3060 mr->smr_oid, mlen );
3061 HASH_Update( &HASHcontext,
3062 value->bv_val, klen );
3063 HASH_Final( HASHdigest, &HASHcontext );
3065 keys[nkeys++] = ber_bvdup( &digest );
3068 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
3070 pre = SLAP_INDEX_SUBSTR_PREFIX;
3071 klen = SLAP_INDEX_SUBSTR_MAXLEN;
3073 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3074 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
3078 value = sa->sa_any[i];
3081 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
3082 j += SLAP_INDEX_SUBSTR_STEP )
3084 HASH_Init( &HASHcontext );
3085 if( prefix != NULL && prefix->bv_len > 0 ) {
3086 HASH_Update( &HASHcontext,
3087 prefix->bv_val, prefix->bv_len );
3089 HASH_Update( &HASHcontext,
3090 &pre, sizeof( pre ) );
3091 HASH_Update( &HASHcontext,
3092 syntax->ssyn_oid, slen );
3093 HASH_Update( &HASHcontext,
3094 mr->smr_oid, mlen );
3095 HASH_Update( &HASHcontext,
3096 &value->bv_val[j], klen );
3097 HASH_Final( HASHdigest, &HASHcontext );
3099 keys[nkeys++] = ber_bvdup( &digest );
3104 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
3105 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3107 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3108 value = sa->sa_final;
3110 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3111 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3113 HASH_Init( &HASHcontext );
3114 if( prefix != NULL && prefix->bv_len > 0 ) {
3115 HASH_Update( &HASHcontext,
3116 prefix->bv_val, prefix->bv_len );
3118 HASH_Update( &HASHcontext,
3119 &pre, sizeof( pre ) );
3120 HASH_Update( &HASHcontext,
3121 syntax->ssyn_oid, slen );
3122 HASH_Update( &HASHcontext,
3123 mr->smr_oid, mlen );
3124 HASH_Update( &HASHcontext,
3125 &value->bv_val[value->bv_len-klen], klen );
3126 HASH_Final( HASHdigest, &HASHcontext );
3128 keys[nkeys++] = ber_bvdup( &digest );
3139 return LDAP_SUCCESS;
3148 struct berval *value,
3149 void *assertedValue )
3151 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
3153 if( match == 0 && value->bv_len ) {
3154 match = strncasecmp( value->bv_val,
3155 ((struct berval *) assertedValue)->bv_val,
3160 return LDAP_SUCCESS;
3164 caseIgnoreIA5SubstringsMatch(
3169 struct berval *value,
3170 void *assertedValue )
3173 SubstringsAssertion *sub = assertedValue;
3174 struct berval left = *value;
3178 /* Add up asserted input length */
3179 if( sub->sa_initial ) {
3180 inlen += sub->sa_initial->bv_len;
3183 for(i=0; sub->sa_any[i] != NULL; i++) {
3184 inlen += sub->sa_any[i]->bv_len;
3187 if( sub->sa_final ) {
3188 inlen += sub->sa_final->bv_len;
3191 if( sub->sa_initial ) {
3192 if( inlen > left.bv_len ) {
3197 match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
3198 sub->sa_initial->bv_len );
3204 left.bv_val += sub->sa_initial->bv_len;
3205 left.bv_len -= sub->sa_initial->bv_len;
3206 inlen -= sub->sa_initial->bv_len;
3209 if( sub->sa_final ) {
3210 if( inlen > left.bv_len ) {
3215 match = strncasecmp( sub->sa_final->bv_val,
3216 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
3217 sub->sa_final->bv_len );
3223 left.bv_len -= sub->sa_final->bv_len;
3224 inlen -= sub->sa_final->bv_len;
3228 for(i=0; sub->sa_any[i]; i++) {
3233 if( inlen > left.bv_len ) {
3234 /* not enough length */
3239 if( sub->sa_any[i]->bv_len == 0 ) {
3243 p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
3250 idx = p - left.bv_val;
3251 assert( idx < left.bv_len );
3253 if( idx >= left.bv_len ) {
3254 /* this shouldn't happen */
3261 if( sub->sa_any[i]->bv_len > left.bv_len ) {
3262 /* not enough left */
3267 match = strncasecmp( left.bv_val,
3268 sub->sa_any[i]->bv_val,
3269 sub->sa_any[i]->bv_len );
3278 left.bv_val += sub->sa_any[i]->bv_len;
3279 left.bv_len -= sub->sa_any[i]->bv_len;
3280 inlen -= sub->sa_any[i]->bv_len;
3286 return LDAP_SUCCESS;
3289 /* Index generation function */
3290 int caseIgnoreIA5Indexer(
3295 struct berval *prefix,
3296 struct berval **values,
3297 struct berval ***keysp )
3301 struct berval **keys;
3302 HASH_CONTEXT HASHcontext;
3303 unsigned char HASHdigest[HASH_BYTES];
3304 struct berval digest;
3305 digest.bv_val = HASHdigest;
3306 digest.bv_len = sizeof(HASHdigest);
3308 /* we should have at least one value at this point */
3309 assert( values != NULL && values[0] != NULL );
3311 for( i=0; values[i] != NULL; i++ ) {
3312 /* just count them */
3315 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
3317 slen = strlen( syntax->ssyn_oid );
3318 mlen = strlen( mr->smr_oid );
3320 for( i=0; values[i] != NULL; i++ ) {
3321 struct berval *value = ber_bvdup( values[i] );
3322 ldap_pvt_str2upper( value->bv_val );
3324 HASH_Init( &HASHcontext );
3325 if( prefix != NULL && prefix->bv_len > 0 ) {
3326 HASH_Update( &HASHcontext,
3327 prefix->bv_val, prefix->bv_len );
3329 HASH_Update( &HASHcontext,
3330 syntax->ssyn_oid, slen );
3331 HASH_Update( &HASHcontext,
3332 mr->smr_oid, mlen );
3333 HASH_Update( &HASHcontext,
3334 value->bv_val, value->bv_len );
3335 HASH_Final( HASHdigest, &HASHcontext );
3337 ber_bvfree( value );
3339 keys[i] = ber_bvdup( &digest );
3344 return LDAP_SUCCESS;
3347 /* Index generation function */
3348 int caseIgnoreIA5Filter(
3353 struct berval *prefix,
3355 struct berval ***keysp )
3358 struct berval **keys;
3359 HASH_CONTEXT HASHcontext;
3360 unsigned char HASHdigest[HASH_BYTES];
3361 struct berval *value;
3362 struct berval digest;
3363 digest.bv_val = HASHdigest;
3364 digest.bv_len = sizeof(HASHdigest);
3366 slen = strlen( syntax->ssyn_oid );
3367 mlen = strlen( mr->smr_oid );
3369 value = ber_bvdup( (struct berval *) assertValue );
3370 ldap_pvt_str2upper( value->bv_val );
3372 keys = ch_malloc( sizeof( struct berval * ) * 2 );
3374 HASH_Init( &HASHcontext );
3375 if( prefix != NULL && prefix->bv_len > 0 ) {
3376 HASH_Update( &HASHcontext,
3377 prefix->bv_val, prefix->bv_len );
3379 HASH_Update( &HASHcontext,
3380 syntax->ssyn_oid, slen );
3381 HASH_Update( &HASHcontext,
3382 mr->smr_oid, mlen );
3383 HASH_Update( &HASHcontext,
3384 value->bv_val, value->bv_len );
3385 HASH_Final( HASHdigest, &HASHcontext );
3387 keys[0] = ber_bvdup( &digest );
3390 ber_bvfree( value );
3394 return LDAP_SUCCESS;
3397 /* Substrings Index generation function */
3398 int caseIgnoreIA5SubstringsIndexer(
3403 struct berval *prefix,
3404 struct berval **values,
3405 struct berval ***keysp )
3409 struct berval **keys;
3410 HASH_CONTEXT HASHcontext;
3411 unsigned char HASHdigest[HASH_BYTES];
3412 struct berval digest;
3413 digest.bv_val = HASHdigest;
3414 digest.bv_len = sizeof(HASHdigest);
3416 /* we should have at least one value at this point */
3417 assert( values != NULL && values[0] != NULL );
3420 for( i=0; values[i] != NULL; i++ ) {
3421 /* count number of indices to generate */
3422 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
3426 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
3427 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3428 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
3429 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
3431 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
3435 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
3436 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3437 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
3441 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
3442 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3443 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
3444 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
3446 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
3452 /* no keys to generate */
3454 return LDAP_SUCCESS;
3457 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
3459 slen = strlen( syntax->ssyn_oid );
3460 mlen = strlen( mr->smr_oid );
3463 for( i=0; values[i] != NULL; i++ ) {
3465 struct berval *value;
3467 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
3469 value = ber_bvdup( values[i] );
3470 ldap_pvt_str2upper( value->bv_val );
3472 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
3473 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
3475 char pre = SLAP_INDEX_SUBSTR_PREFIX;
3476 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
3478 for( j=0; j<max; j++ ) {
3479 HASH_Init( &HASHcontext );
3480 if( prefix != NULL && prefix->bv_len > 0 ) {
3481 HASH_Update( &HASHcontext,
3482 prefix->bv_val, prefix->bv_len );
3485 HASH_Update( &HASHcontext,
3486 &pre, sizeof( pre ) );
3487 HASH_Update( &HASHcontext,
3488 syntax->ssyn_oid, slen );
3489 HASH_Update( &HASHcontext,
3490 mr->smr_oid, mlen );
3491 HASH_Update( &HASHcontext,
3493 SLAP_INDEX_SUBSTR_MAXLEN );
3494 HASH_Final( HASHdigest, &HASHcontext );
3496 keys[nkeys++] = ber_bvdup( &digest );
3500 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3501 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3503 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
3506 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
3507 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3508 HASH_Init( &HASHcontext );
3509 if( prefix != NULL && prefix->bv_len > 0 ) {
3510 HASH_Update( &HASHcontext,
3511 prefix->bv_val, prefix->bv_len );
3513 HASH_Update( &HASHcontext,
3514 &pre, sizeof( pre ) );
3515 HASH_Update( &HASHcontext,
3516 syntax->ssyn_oid, slen );
3517 HASH_Update( &HASHcontext,
3518 mr->smr_oid, mlen );
3519 HASH_Update( &HASHcontext,
3521 HASH_Final( HASHdigest, &HASHcontext );
3523 keys[nkeys++] = ber_bvdup( &digest );
3526 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
3527 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3528 HASH_Init( &HASHcontext );
3529 if( prefix != NULL && prefix->bv_len > 0 ) {
3530 HASH_Update( &HASHcontext,
3531 prefix->bv_val, prefix->bv_len );
3533 HASH_Update( &HASHcontext,
3534 &pre, sizeof( pre ) );
3535 HASH_Update( &HASHcontext,
3536 syntax->ssyn_oid, slen );
3537 HASH_Update( &HASHcontext,
3538 mr->smr_oid, mlen );
3539 HASH_Update( &HASHcontext,
3540 &value->bv_val[value->bv_len-j], j );
3541 HASH_Final( HASHdigest, &HASHcontext );
3543 keys[nkeys++] = ber_bvdup( &digest );
3548 ber_bvfree( value );
3559 return LDAP_SUCCESS;
3562 int caseIgnoreIA5SubstringsFilter(
3567 struct berval *prefix,
3569 struct berval ***keysp )
3571 SubstringsAssertion *sa = assertValue;
3573 ber_len_t nkeys = 0;
3574 size_t slen, mlen, klen;
3575 struct berval **keys;
3576 HASH_CONTEXT HASHcontext;
3577 unsigned char HASHdigest[HASH_BYTES];
3578 struct berval *value;
3579 struct berval digest;
3581 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
3582 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3587 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3589 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3590 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
3591 /* don't bother accounting for stepping */
3592 nkeys += sa->sa_any[i]->bv_len -
3593 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
3598 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
3599 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3606 return LDAP_SUCCESS;
3609 digest.bv_val = HASHdigest;
3610 digest.bv_len = sizeof(HASHdigest);
3612 slen = strlen( syntax->ssyn_oid );
3613 mlen = strlen( mr->smr_oid );
3615 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
3618 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
3619 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3621 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3622 value = ber_bvdup( sa->sa_initial );
3623 ldap_pvt_str2upper( value->bv_val );
3625 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3626 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3628 HASH_Init( &HASHcontext );
3629 if( prefix != NULL && prefix->bv_len > 0 ) {
3630 HASH_Update( &HASHcontext,
3631 prefix->bv_val, prefix->bv_len );
3633 HASH_Update( &HASHcontext,
3634 &pre, sizeof( pre ) );
3635 HASH_Update( &HASHcontext,
3636 syntax->ssyn_oid, slen );
3637 HASH_Update( &HASHcontext,
3638 mr->smr_oid, mlen );
3639 HASH_Update( &HASHcontext,
3640 value->bv_val, klen );
3641 HASH_Final( HASHdigest, &HASHcontext );
3643 ber_bvfree( value );
3644 keys[nkeys++] = ber_bvdup( &digest );
3647 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3649 pre = SLAP_INDEX_SUBSTR_PREFIX;
3650 klen = SLAP_INDEX_SUBSTR_MAXLEN;
3652 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3653 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
3657 value = ber_bvdup( sa->sa_any[i] );
3658 ldap_pvt_str2upper( value->bv_val );
3661 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
3662 j += SLAP_INDEX_SUBSTR_STEP )
3664 HASH_Init( &HASHcontext );
3665 if( prefix != NULL && prefix->bv_len > 0 ) {
3666 HASH_Update( &HASHcontext,
3667 prefix->bv_val, prefix->bv_len );
3669 HASH_Update( &HASHcontext,
3670 &pre, sizeof( pre ) );
3671 HASH_Update( &HASHcontext,
3672 syntax->ssyn_oid, slen );
3673 HASH_Update( &HASHcontext,
3674 mr->smr_oid, mlen );
3675 HASH_Update( &HASHcontext,
3676 &value->bv_val[j], klen );
3677 HASH_Final( HASHdigest, &HASHcontext );
3679 keys[nkeys++] = ber_bvdup( &digest );
3682 ber_bvfree( value );
3686 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
3687 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3689 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3690 value = ber_bvdup( sa->sa_final );
3691 ldap_pvt_str2upper( value->bv_val );
3693 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3694 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3696 HASH_Init( &HASHcontext );
3697 if( prefix != NULL && prefix->bv_len > 0 ) {
3698 HASH_Update( &HASHcontext,
3699 prefix->bv_val, prefix->bv_len );
3701 HASH_Update( &HASHcontext,
3702 &pre, sizeof( pre ) );
3703 HASH_Update( &HASHcontext,
3704 syntax->ssyn_oid, slen );
3705 HASH_Update( &HASHcontext,
3706 mr->smr_oid, mlen );
3707 HASH_Update( &HASHcontext,
3708 &value->bv_val[value->bv_len-klen], klen );
3709 HASH_Final( HASHdigest, &HASHcontext );
3711 ber_bvfree( value );
3712 keys[nkeys++] = ber_bvdup( &digest );
3723 return LDAP_SUCCESS;
3727 numericStringValidate(
3733 for(i=0; i < in->bv_len; i++) {
3734 if( !SLAP_NUMERIC(in->bv_val[i]) ) {
3735 return LDAP_INVALID_SYNTAX;
3739 return LDAP_SUCCESS;
3743 numericStringNormalize(
3746 struct berval **normalized )
3748 /* removal all spaces */
3749 struct berval *newval;
3752 newval = ch_malloc( sizeof( struct berval ) );
3753 newval->bv_val = ch_malloc( val->bv_len + 1 );
3759 if ( ASCII_SPACE( *p ) ) {
3760 /* Ignore whitespace */
3767 assert( newval->bv_val <= p );
3770 /* null terminate */
3773 newval->bv_len = q - newval->bv_val;
3774 *normalized = newval;
3776 return LDAP_SUCCESS;
3780 objectIdentifierFirstComponentMatch(
3785 struct berval *value,
3786 void *assertedValue )
3788 int rc = LDAP_SUCCESS;
3790 struct berval *asserted = (struct berval *) assertedValue;
3794 if( value->bv_len == 0 || value->bv_val[0] != '(' /*')'*/ ) {
3795 return LDAP_INVALID_SYNTAX;
3798 /* trim leading white space */
3799 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
3803 /* grab next word */
3804 oid.bv_val = &value->bv_val[i];
3805 oid.bv_len = value->bv_len - i;
3806 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
3811 /* insert attributeTypes, objectclass check here */
3812 if( OID_LEADCHAR(asserted->bv_val[0]) ) {
3813 rc = objectIdentifierMatch( &match, flags, syntax, mr, &oid, asserted );
3816 char *stored = ch_malloc( oid.bv_len + 1 );
3817 AC_MEMCPY( stored, oid.bv_val, oid.bv_len );
3818 stored[oid.bv_len] = '\0';
3820 if ( !strcmp( syntax->ssyn_oid, SLAP_SYNTAX_MATCHINGRULES_OID ) ) {
3821 MatchingRule *asserted_mr = mr_find( asserted->bv_val );
3822 MatchingRule *stored_mr = mr_find( stored );
3824 if( asserted_mr == NULL ) {
3825 rc = SLAPD_COMPARE_UNDEFINED;
3827 match = asserted_mr != stored_mr;
3830 } else if ( !strcmp( syntax->ssyn_oid,
3831 SLAP_SYNTAX_ATTRIBUTETYPES_OID ) )
3833 AttributeType *asserted_at = at_find( asserted->bv_val );
3834 AttributeType *stored_at = at_find( stored );
3836 if( asserted_at == NULL ) {
3837 rc = SLAPD_COMPARE_UNDEFINED;
3839 match = asserted_at != stored_at;
3842 } else if ( !strcmp( syntax->ssyn_oid,
3843 SLAP_SYNTAX_OBJECTCLASSES_OID ) )
3845 ObjectClass *asserted_oc = oc_find( asserted->bv_val );
3846 ObjectClass *stored_oc = oc_find( stored );
3848 if( asserted_oc == NULL ) {
3849 rc = SLAPD_COMPARE_UNDEFINED;
3851 match = asserted_oc != stored_oc;
3859 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
3860 "objectIdentifierFirstComponentMatch: %d\n %s\n %s\n",
3861 match, value->bv_val, asserted->bv_val ));
3863 Debug( LDAP_DEBUG_ARGS, "objectIdentifierFirstComponentMatch "
3864 "%d\n\t\"%s\"\n\t\"%s\"\n",
3865 match, value->bv_val, asserted->bv_val );
3869 if( rc == LDAP_SUCCESS ) *matchp = match;
3874 check_time_syntax (struct berval *val,
3878 static int ceiling[9] = { 99, 99, 11, 30, 23, 59, 59, 12, 59 };
3879 static int mdays[2][12] = {
3880 /* non-leap years */
3881 { 30, 27, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 },
3883 { 30, 28, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 }
3886 int part, c, tzoffset, leapyear = 0 ;
3888 if( val->bv_len == 0 ) {
3889 return LDAP_INVALID_SYNTAX;
3892 p = (char *)val->bv_val;
3893 e = p + val->bv_len;
3895 /* Ignore initial whitespace */
3896 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3900 if (e - p < 13 - (2 * start)) {
3901 return LDAP_INVALID_SYNTAX;
3904 for (part = 0; part < 9; part++) {
3908 for (part = start; part < 7; part++) {
3910 if ((part == 6) && (c == 'Z' || c == '+' || c == '-')) {
3917 return LDAP_INVALID_SYNTAX;
3919 if (c < 0 || c > 9) {
3920 return LDAP_INVALID_SYNTAX;
3926 return LDAP_INVALID_SYNTAX;
3928 if (c < 0 || c > 9) {
3929 return LDAP_INVALID_SYNTAX;
3934 if (part == 2 || part == 3) {
3937 if (parts[part] < 0) {
3938 return LDAP_INVALID_SYNTAX;
3940 if (parts[part] > ceiling[part]) {
3941 return LDAP_INVALID_SYNTAX;
3945 /* leapyear check for the Gregorian calendar (year>1581) */
3946 if (((parts[1] % 4 == 0) && (parts[1] != 0)) ||
3947 ((parts[0] % 4 == 0) && (parts[1] == 0)))
3952 if (parts[3] > mdays[leapyear][parts[2]]) {
3953 return LDAP_INVALID_SYNTAX;
3958 tzoffset = 0; /* UTC */
3959 } else if (c != '+' && c != '-') {
3960 return LDAP_INVALID_SYNTAX;
3964 } else /* c == '+' */ {
3969 return LDAP_INVALID_SYNTAX;
3972 for (part = 7; part < 9; part++) {
3974 if (c < 0 || c > 9) {
3975 return LDAP_INVALID_SYNTAX;
3980 if (c < 0 || c > 9) {
3981 return LDAP_INVALID_SYNTAX;
3985 if (parts[part] < 0 || parts[part] > ceiling[part]) {
3986 return LDAP_INVALID_SYNTAX;
3991 /* Ignore trailing whitespace */
3992 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3996 return LDAP_INVALID_SYNTAX;
3999 switch ( tzoffset ) {
4000 case -1: /* negativ offset to UTC, ie west of Greenwich */
4001 parts[4] += parts[7];
4002 parts[5] += parts[8];
4003 for (part = 6; --part > 0; ) { /* offset is just hhmm, no seconds */
4007 c = mdays[leapyear][parts[2]];
4009 if (parts[part] > c) {
4010 parts[part] -= c + 1;
4015 case 1: /* positive offset to UTC, ie east of Greenwich */
4016 parts[4] -= parts[7];
4017 parts[5] -= parts[8];
4018 for (part = 6; --part > 0; ) {
4022 /* first arg to % needs to be non negativ */
4023 c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
4025 if (parts[part] < 0) {
4026 parts[part] += c + 1;
4031 case 0: /* already UTC */
4035 return LDAP_SUCCESS;
4042 struct berval **normalized )
4047 rc = check_time_syntax(val, 1, parts);
4048 if (rc != LDAP_SUCCESS) {
4053 out = ch_malloc( sizeof(struct berval) );
4055 return LBER_ERROR_MEMORY;
4058 out->bv_val = ch_malloc( 14 );
4059 if ( out->bv_val == NULL ) {
4061 return LBER_ERROR_MEMORY;
4064 sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ldZ",
4065 parts[1], parts[2] + 1, parts[3] + 1,
4066 parts[4], parts[5], parts[6] );
4070 return LDAP_SUCCESS;
4080 return check_time_syntax(in, 1, parts);
4084 generalizedTimeValidate(
4090 return check_time_syntax(in, 0, parts);
4094 generalizedTimeNormalize(
4097 struct berval **normalized )
4102 rc = check_time_syntax(val, 0, parts);
4103 if (rc != LDAP_SUCCESS) {
4108 out = ch_malloc( sizeof(struct berval) );
4110 return LBER_ERROR_MEMORY;
4113 out->bv_val = ch_malloc( 16 );
4114 if ( out->bv_val == NULL ) {
4116 return LBER_ERROR_MEMORY;
4119 sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ld%02ldZ",
4120 parts[0], parts[1], parts[2] + 1, parts[3] + 1,
4121 parts[4], parts[5], parts[6] );
4125 return LDAP_SUCCESS;
4129 nisNetgroupTripleValidate(
4131 struct berval *val )
4136 if ( val->bv_len == 0 ) {
4137 return LDAP_INVALID_SYNTAX;
4140 p = (char *)val->bv_val;
4141 e = p + val->bv_len;
4144 /* syntax does not allow leading white space */
4145 /* Ignore initial whitespace */
4146 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
4151 if ( *p != '(' /*')'*/ ) {
4152 return LDAP_INVALID_SYNTAX;
4155 for ( p++; ( p < e ) && ( *p != ')' ); p++ ) {
4159 return LDAP_INVALID_SYNTAX;
4162 } else if ( !ATTR_CHAR( *p ) ) {
4163 return LDAP_INVALID_SYNTAX;
4167 if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
4168 return LDAP_INVALID_SYNTAX;
4174 /* syntax does not allow trailing white space */
4175 /* Ignore trailing whitespace */
4176 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
4182 return LDAP_INVALID_SYNTAX;
4185 return LDAP_SUCCESS;
4189 bootParameterValidate(
4191 struct berval *val )
4195 if ( val->bv_len == 0 ) {
4196 return LDAP_INVALID_SYNTAX;
4199 p = (char *)val->bv_val;
4200 e = p + val->bv_len;
4203 for (; ( p < e ) && ( *p != '=' ); p++ ) {
4204 if ( !ATTR_CHAR( *p ) ) {
4205 return LDAP_INVALID_SYNTAX;
4210 return LDAP_INVALID_SYNTAX;
4214 for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
4215 if ( !ATTR_CHAR( *p ) ) {
4216 return LDAP_INVALID_SYNTAX;
4221 return LDAP_INVALID_SYNTAX;
4225 for ( p++; p < e; p++ ) {
4226 if ( !ATTR_CHAR( *p ) ) {
4227 return LDAP_INVALID_SYNTAX;
4231 return LDAP_SUCCESS;
4234 struct syntax_defs_rec {
4237 slap_syntax_validate_func *sd_validate;
4238 slap_syntax_transform_func *sd_normalize;
4239 slap_syntax_transform_func *sd_pretty;
4240 #ifdef SLAPD_BINARY_CONVERSION
4241 slap_syntax_transform_func *sd_ber2str;
4242 slap_syntax_transform_func *sd_str2ber;
4246 #define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
4247 #define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
4249 struct syntax_defs_rec syntax_defs[] = {
4250 {"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' " X_BINARY X_NOT_H_R ")",
4251 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
4252 {"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
4253 0, NULL, NULL, NULL},
4254 {"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
4255 0, NULL, NULL, NULL},
4256 {"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' " X_NOT_H_R ")",
4257 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
4258 {"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' " X_NOT_H_R ")",
4259 SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4260 {"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
4261 0, bitStringValidate, NULL, NULL },
4262 {"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
4263 0, booleanValidate, NULL, NULL},
4264 {"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
4265 X_BINARY X_NOT_H_R ")",
4266 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4267 {"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
4268 X_BINARY X_NOT_H_R ")",
4269 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4270 {"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
4271 X_BINARY X_NOT_H_R ")",
4272 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4273 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
4274 0, countryStringValidate, IA5StringNormalize, NULL},
4275 {"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
4276 0, dnValidate, dnNormalize, dnPretty},
4277 {"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
4278 0, NULL, NULL, NULL},
4279 {"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
4280 0, NULL, NULL, NULL},
4281 {"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
4282 0, UTF8StringValidate, UTF8StringNormalize, NULL},
4283 {"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
4284 0, NULL, NULL, NULL},
4285 {"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
4286 0, NULL, NULL, NULL},
4287 {"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
4288 0, NULL, NULL, NULL},
4289 {"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
4290 0, NULL, NULL, NULL},
4291 {"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
4292 0, NULL, NULL, NULL},
4293 {"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
4294 0, printablesStringValidate, IA5StringNormalize, NULL},
4295 {"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
4296 SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
4297 {"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
4298 0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
4299 {"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
4300 0, NULL, NULL, NULL},
4301 {"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
4302 0, IA5StringValidate, IA5StringNormalize, NULL},
4303 {"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
4304 0, integerValidate, integerNormalize, integerPretty},
4305 {"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
4306 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
4307 {"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
4308 0, NULL, NULL, NULL},
4309 {"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
4310 0, NULL, NULL, NULL},
4311 {"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
4312 0, NULL, NULL, NULL},
4313 {"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
4314 0, NULL, NULL, NULL},
4315 {"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
4316 0, NULL, NULL, NULL},
4317 {"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
4318 0, nameUIDValidate, nameUIDNormalize, NULL},
4319 {"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
4320 0, NULL, NULL, NULL},
4321 {"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
4322 0, numericStringValidate, numericStringNormalize, NULL},
4323 {"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
4324 0, NULL, NULL, NULL},
4325 {"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
4326 0, oidValidate, NULL, NULL},
4327 {"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
4328 0, IA5StringValidate, IA5StringNormalize, NULL},
4329 {"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
4330 0, blobValidate, NULL, NULL},
4331 {"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
4332 0, UTF8StringValidate, UTF8StringNormalize, NULL},
4333 {"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
4334 0, NULL, NULL, NULL},
4335 {"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
4336 0, NULL, NULL, NULL},
4337 {"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
4338 0, printableStringValidate, IA5StringNormalize, NULL},
4339 {"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
4340 X_BINARY X_NOT_H_R ")",
4341 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
4342 {"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
4343 0, printableStringValidate, IA5StringNormalize, NULL},
4344 {"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
4345 0, NULL, NULL, NULL},
4346 {"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
4347 0, printableStringValidate, IA5StringNormalize, NULL},
4348 {"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
4349 0, utcTimeValidate, utcTimeNormalize, NULL},
4350 {"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
4351 0, NULL, NULL, NULL},
4352 {"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
4353 0, NULL, NULL, NULL},
4354 {"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
4355 0, NULL, NULL, NULL},
4356 {"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
4357 0, NULL, NULL, NULL},
4358 {"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
4359 0, NULL, NULL, NULL},
4361 /* RFC 2307 NIS Syntaxes */
4362 {"( 1.3.6.1.1.1.0.0 DESC 'RFC2307 NIS Netgroup Triple' )",
4363 0, nisNetgroupTripleValidate, NULL, NULL},
4364 {"( 1.3.6.1.1.1.0.1 DESC 'RFC2307 Boot Parameter' )",
4365 0, bootParameterValidate, NULL, NULL},
4367 /* OpenLDAP Experimental Syntaxes */
4368 {"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
4369 0, UTF8StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */,
4371 {"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
4372 0, NULL, NULL, NULL},
4374 /* OpenLDAP Void Syntax */
4375 {"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' )" ,
4376 SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
4377 {NULL, 0, NULL, NULL, NULL}
4380 struct mrule_defs_rec {
4382 slap_mask_t mrd_usage;
4383 slap_mr_convert_func * mrd_convert;
4384 slap_mr_normalize_func * mrd_normalize;
4385 slap_mr_match_func * mrd_match;
4386 slap_mr_indexer_func * mrd_indexer;
4387 slap_mr_filter_func * mrd_filter;
4389 char * mrd_associated;
4393 * Other matching rules in X.520 that we do not use (yet):
4395 * 2.5.13.9 numericStringOrderingMatch
4396 * 2.5.13.15 integerOrderingMatch
4397 * 2.5.13.18 octetStringOrderingMatch
4398 * 2.5.13.19 octetStringSubstringsMatch
4399 * 2.5.13.25 uTCTimeMatch
4400 * 2.5.13.26 uTCTimeOrderingMatch
4401 * 2.5.13.31 directoryStringFirstComponentMatch
4402 * 2.5.13.32 wordMatch
4403 * 2.5.13.33 keywordMatch
4404 * 2.5.13.34 certificateExactMatch
4405 * 2.5.13.35 certificateMatch
4406 * 2.5.13.36 certificatePairExactMatch
4407 * 2.5.13.37 certificatePairMatch
4408 * 2.5.13.38 certificateListExactMatch
4409 * 2.5.13.39 certificateListMatch
4410 * 2.5.13.40 algorithmIdentifierMatch
4411 * 2.5.13.41 storedPrefixMatch
4412 * 2.5.13.42 attributeCertificateMatch
4413 * 2.5.13.43 readerAndKeyIDMatch
4414 * 2.5.13.44 attributeIntegrityMatch
4417 struct mrule_defs_rec mrule_defs[] = {
4419 * EQUALITY matching rules must be listed after associated APPROX
4420 * matching rules. So, we list all APPROX matching rules first.
4422 {"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
4423 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4424 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
4426 directoryStringApproxMatch,
4427 directoryStringApproxIndexer,
4428 directoryStringApproxFilter,
4431 {"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
4432 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4433 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
4435 IA5StringApproxMatch,
4436 IA5StringApproxIndexer,
4437 IA5StringApproxFilter,
4441 * Other matching rules
4444 {"( 2.5.13.0 NAME 'objectIdentifierMatch' "
4445 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4446 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4448 objectIdentifierMatch, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
4451 {"( 2.5.13.1 NAME 'distinguishedNameMatch' "
4452 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
4453 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4455 dnMatch, dnIndexer, dnFilter,
4458 {"( 2.5.13.2 NAME 'caseIgnoreMatch' "
4459 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4460 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4462 caseIgnoreMatch, caseIgnoreIndexer, caseIgnoreFilter,
4463 directoryStringApproxMatchOID },
4465 {"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
4466 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4469 caseIgnoreOrderingMatch, NULL, NULL,
4472 {"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
4473 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4474 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4476 caseIgnoreSubstringsMatch,
4477 caseIgnoreSubstringsIndexer,
4478 caseIgnoreSubstringsFilter,
4481 {"( 2.5.13.5 NAME 'caseExactMatch' "
4482 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4483 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4485 caseExactMatch, caseExactIndexer, caseExactFilter,
4486 directoryStringApproxMatchOID },
4488 {"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
4489 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
4492 caseExactOrderingMatch, NULL, NULL,
4495 {"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
4496 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4497 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4499 caseExactSubstringsMatch,
4500 caseExactSubstringsIndexer,
4501 caseExactSubstringsFilter,
4504 {"( 2.5.13.8 NAME 'numericStringMatch' "
4505 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
4506 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4509 caseIgnoreIA5Indexer,
4510 caseIgnoreIA5Filter,
4513 {"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
4514 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4515 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4517 caseIgnoreIA5SubstringsMatch,
4518 caseIgnoreIA5SubstringsIndexer,
4519 caseIgnoreIA5SubstringsFilter,
4522 {"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
4523 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
4524 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4526 caseIgnoreListMatch, NULL, NULL,
4529 {"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
4530 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4531 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4533 caseIgnoreListSubstringsMatch, NULL, NULL,
4536 {"( 2.5.13.13 NAME 'booleanMatch' "
4537 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
4538 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4540 booleanMatch, NULL, NULL,
4543 {"( 2.5.13.14 NAME 'integerMatch' "
4544 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4545 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4547 integerMatch, integerIndexer, integerFilter,
4550 {"( 2.5.13.16 NAME 'bitStringMatch' "
4551 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
4552 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4554 bitStringMatch, NULL, NULL,
4557 {"( 2.5.13.17 NAME 'octetStringMatch' "
4558 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4559 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4561 octetStringMatch, octetStringIndexer, octetStringFilter,
4564 {"( 2.5.13.20 NAME 'telephoneNumberMatch' "
4565 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
4566 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4568 telephoneNumberMatch,
4569 telephoneNumberIndexer,
4570 telephoneNumberFilter,
4573 {"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
4574 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
4575 SLAP_MR_SUBSTR | SLAP_MR_EXT,
4577 telephoneNumberSubstringsMatch,
4578 telephoneNumberSubstringsIndexer,
4579 telephoneNumberSubstringsFilter,
4582 {"( 2.5.13.22 NAME 'presentationAddressMatch' "
4583 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
4584 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4589 {"( 2.5.13.23 NAME 'uniqueMemberMatch' "
4590 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
4591 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4593 uniqueMemberMatch, NULL, NULL,
4596 {"( 2.5.13.24 NAME 'protocolInformationMatch' "
4597 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
4598 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4600 protocolInformationMatch, NULL, NULL,
4603 {"( 2.5.13.27 NAME 'generalizedTimeMatch' "
4604 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4605 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4607 generalizedTimeMatch, NULL, NULL,
4610 {"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
4611 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
4614 generalizedTimeOrderingMatch, NULL, NULL,
4617 {"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
4618 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4619 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4621 integerFirstComponentMatch, NULL, NULL,
4624 {"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
4625 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4626 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4628 objectIdentifierFirstComponentMatch, NULL, NULL,
4631 {"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
4632 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4633 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4635 caseExactIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
4636 IA5StringApproxMatchOID },
4638 {"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
4639 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4640 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4642 caseIgnoreIA5Match, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
4643 IA5StringApproxMatchOID },
4645 {"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
4646 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4649 caseIgnoreIA5SubstringsMatch,
4650 caseIgnoreIA5SubstringsIndexer,
4651 caseIgnoreIA5SubstringsFilter,
4654 {"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
4655 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4658 caseExactIA5SubstringsMatch,
4659 caseExactIA5SubstringsIndexer,
4660 caseExactIA5SubstringsFilter,
4663 {"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
4664 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4667 authPasswordMatch, NULL, NULL,
4670 {"( 1.3.6.1.4.1.4203.666.4.2 NAME 'OpenLDAPaciMatch' "
4671 "SYNTAX 1.3.6.1.4.1.4203.666.2.1 )",
4674 OpenLDAPaciMatch, NULL, NULL,
4677 {NULL, SLAP_MR_NONE, NULL, NULL, NULL, NULL}
4686 /* we should only be called once (from main) */
4687 assert( schema_init_done == 0 );
4689 for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
4690 res = register_syntax( syntax_defs[i].sd_desc,
4691 syntax_defs[i].sd_flags,
4692 syntax_defs[i].sd_validate,
4693 syntax_defs[i].sd_normalize,
4694 syntax_defs[i].sd_pretty
4695 #ifdef SLAPD_BINARY_CONVERSION
4697 syntax_defs[i].sd_ber2str,
4698 syntax_defs[i].sd_str2ber
4703 fprintf( stderr, "schema_init: Error registering syntax %s\n",
4704 syntax_defs[i].sd_desc );
4709 for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
4710 if( mrule_defs[i].mrd_usage == SLAP_MR_NONE ) {
4712 "schema_init: Ingoring unusable matching rule %s\n",
4713 mrule_defs[i].mrd_desc );
4717 res = register_matching_rule(
4718 mrule_defs[i].mrd_desc,
4719 mrule_defs[i].mrd_usage,
4720 mrule_defs[i].mrd_convert,
4721 mrule_defs[i].mrd_normalize,
4722 mrule_defs[i].mrd_match,
4723 mrule_defs[i].mrd_indexer,
4724 mrule_defs[i].mrd_filter,
4725 mrule_defs[i].mrd_associated );
4729 "schema_init: Error registering matching rule %s\n",
4730 mrule_defs[i].mrd_desc );
4734 schema_init_done = 1;
4735 return LDAP_SUCCESS;