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>
18 #include "lutil_md5.h"
20 /* recycled validatation routines */
21 #define berValidate blobValidate
23 /* recycled normalization routines */
24 #define faxNumberNormalize numericStringNormalize
25 #define phoneNumberNormalize numericStringNormalize
26 #define telexNumberNormalize numericStringNormalize
28 /* unimplemented pretters */
30 #define integerPretty NULL
32 /* recycled matching routines */
33 #define bitStringMatch octetStringMatch
34 #define integerMatch caseIgnoreIA5Match
35 #define numericStringMatch caseIgnoreMatch
36 #define objectIdentifierMatch numericStringMatch
37 #define telephoneNumberMatch numericStringMatch
38 #define telephoneNumberSubstringsMatch caseIgnoreIA5SubstringsMatch
39 #define generalizedTimeMatch numericStringMatch
40 #define generalizedTimeOrderingMatch numericStringMatch
41 #define uniqueMemberMatch dnMatch
43 /* approx matching rules */
44 #define directoryStringApproxMatchOID "1.3.6.1.4.1.4203.666.4.4"
45 #define directoryStringApproxMatch NULL
46 #define IA5StringApproxMatchOID "1.3.6.1.4.1.4203.666.4.5"
47 #define IA5StringApproxMatch NULL
49 /* orderring matching rules */
50 #define caseIgnoreOrderingMatch caseIgnoreMatch
51 #define caseExactOrderingMatch caseExactMatch
53 /* unimplemented matching routines */
54 #define caseIgnoreListMatch NULL
55 #define caseIgnoreListSubstringsMatch NULL
56 #define presentationAddressMatch NULL
57 #define protocolInformationMatch NULL
58 #define integerFirstComponentMatch NULL
60 #define OpenLDAPaciMatch NULL
61 #define authPasswordMatch NULL
63 /* recycled indexing/filtering routines */
64 #define dnIndexer caseIgnoreIndexer
65 #define dnFilter caseIgnoreFilter
66 #define integerIndexer caseIgnoreIA5Indexer
67 #define integerFilter caseIgnoreIA5Filter
69 static char *strcasechr( const char *str, int c )
71 char *lower = strchr( str, TOLOWER(c) );
72 char *upper = strchr( str, TOUPPER(c) );
74 if( lower && upper ) {
75 return lower < upper ? lower : upper;
92 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
95 match = memcmp( value->bv_val,
96 ((struct berval *) assertedValue)->bv_val,
104 /* Index generation function */
105 int octetStringIndexer(
110 struct berval *prefix,
111 struct berval **values,
112 struct berval ***keysp )
116 struct berval **keys;
117 lutil_MD5_CTX MD5context;
118 unsigned char MD5digest[16];
119 struct berval digest;
120 digest.bv_val = MD5digest;
121 digest.bv_len = sizeof(MD5digest);
123 for( i=0; values[i] != NULL; i++ ) {
124 /* just count them */
129 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
131 slen = strlen( syntax->ssyn_oid );
132 mlen = strlen( mr->smr_oid );
134 for( i=0; values[i] != NULL; i++ ) {
135 lutil_MD5Init( &MD5context );
136 if( prefix != NULL && prefix->bv_len > 0 ) {
137 lutil_MD5Update( &MD5context,
138 prefix->bv_val, prefix->bv_len );
140 lutil_MD5Update( &MD5context,
141 syntax->ssyn_oid, slen );
142 lutil_MD5Update( &MD5context,
144 lutil_MD5Update( &MD5context,
145 values[i]->bv_val, values[i]->bv_len );
146 lutil_MD5Final( MD5digest, &MD5context );
148 keys[i] = ber_bvdup( &digest );
158 /* Index generation function */
159 int octetStringFilter(
164 struct berval *prefix,
166 struct berval ***keysp )
169 struct berval **keys;
170 lutil_MD5_CTX MD5context;
171 unsigned char MD5digest[LUTIL_MD5_BYTES];
172 struct berval *value = (struct berval *) assertValue;
173 struct berval digest;
174 digest.bv_val = MD5digest;
175 digest.bv_len = sizeof(MD5digest);
177 slen = strlen( syntax->ssyn_oid );
178 mlen = strlen( mr->smr_oid );
180 keys = ch_malloc( sizeof( struct berval * ) * 2 );
182 lutil_MD5Init( &MD5context );
183 if( prefix != NULL && prefix->bv_len > 0 ) {
184 lutil_MD5Update( &MD5context,
185 prefix->bv_val, prefix->bv_len );
187 lutil_MD5Update( &MD5context,
188 syntax->ssyn_oid, slen );
189 lutil_MD5Update( &MD5context,
191 lutil_MD5Update( &MD5context,
192 value->bv_val, value->bv_len );
193 lutil_MD5Final( MD5digest, &MD5context );
195 keys[0] = ber_bvdup( &digest );
211 if( in->bv_len == 0 ) return LDAP_SUCCESS;
213 dn = ch_strdup( in->bv_val );
215 rc = dn_validate( dn ) == NULL
216 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
226 struct berval **normalized )
228 struct berval *out = ber_bvdup( val );
230 if( out->bv_len != 0 ) {
232 #ifdef USE_DN_NORMALIZE
233 dn = dn_normalize( out->bv_val );
235 dn = dn_validate( out->bv_val );
240 return LDAP_INVALID_SYNTAX;
244 out->bv_len = strlen( dn );
257 struct berval *value,
258 void *assertedValue )
261 struct berval *asserted = (struct berval *) assertedValue;
263 match = value->bv_len - asserted->bv_len;
266 #ifdef USE_DN_NORMALIZE
267 match = strcmp( value->bv_val, asserted->bv_val );
269 match = strcasecmp( value->bv_val, asserted->bv_val );
273 Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
274 match, value->bv_val, asserted->bv_val );
288 if( in->bv_len == 0 ) return LDAP_SUCCESS;
290 dn = ber_bvdup( in );
292 if( dn->bv_val[dn->bv_len-1] == '\'' ) {
293 /* assume presence of optional UID */
296 for(i=dn->bv_len-2; i>2; i--) {
297 if( dn->bv_val[i] != '0' && dn->bv_val[i] != '1' ) {
301 if( dn->bv_val[i] != '\'' ) {
302 return LDAP_INVALID_SYNTAX;
304 if( dn->bv_val[i-1] != 'B' ) {
305 return LDAP_INVALID_SYNTAX;
307 if( dn->bv_val[i-2] != '#' ) {
308 return LDAP_INVALID_SYNTAX;
311 /* trim the UID to allow use of dn_validate */
312 dn->bv_val[i-2] = '\0';
315 rc = dn_validate( dn->bv_val ) == NULL
316 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
326 struct berval **normalized )
328 struct berval *out = ber_bvdup( val );
330 if( out->bv_len != 0 ) {
334 ber_len_t uidlen = 0;
336 if( out->bv_val[out->bv_len-1] == '\'' ) {
337 /* assume presence of optional UID */
338 uid = strrchr( out->bv_val, '#' );
342 return LDAP_INVALID_SYNTAX;
345 uidlen = out->bv_len - (out->bv_val - uid);
346 /* temporarily trim the UID */
350 #ifdef USE_DN_NORMALIZE
351 dn = dn_normalize( out->bv_val );
353 dn = dn_validate( out->bv_val );
358 return LDAP_INVALID_SYNTAX;
364 /* restore the separator */
367 SAFEMEMCPY( &dn[dnlen], uid, uidlen );
371 out->bv_len = dnlen + uidlen;
383 /* any value allowed */
392 /* any value allowed */
403 /* very unforgiving validation, requires no normalization
404 * before simplistic matching
406 if( in->bv_len < 3 ) {
407 return LDAP_INVALID_SYNTAX;
409 if( in->bv_val[0] != 'B' ||
410 in->bv_val[1] != '\'' ||
411 in->bv_val[in->bv_len-1] != '\'' )
413 return LDAP_INVALID_SYNTAX;
416 for( i=in->bv_len-2; i>1; i-- ) {
417 if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
418 return LDAP_INVALID_SYNTAX;
426 * Handling boolean syntax and matching is quite rigid.
427 * A more flexible approach would be to allow a variety
428 * of strings to be normalized and prettied into TRUE
436 /* very unforgiving validation, requires no normalization
437 * before simplistic matching
440 if( in->bv_len == 4 ) {
441 if( !memcmp( in->bv_val, "TRUE", 4 ) ) {
444 } else if( in->bv_len == 5 ) {
445 if( !memcmp( in->bv_val, "FALSE", 5 ) ) {
450 return LDAP_INVALID_SYNTAX;
459 struct berval *value,
460 void *assertedValue )
462 /* simplistic matching allowed by rigid validation */
463 struct berval *asserted = (struct berval *) assertedValue;
464 *matchp = value->bv_len != asserted->bv_len;
471 struct berval *right,
472 struct berval *left )
476 ldap_unicode_t ru, lu;
477 ldap_unicode_t ruu, luu;
480 r < right->bv_len && l < left->bv_len;
484 * XXYYZ: we convert to ucs4 even though -llunicode
485 * expects ucs2 in an unsigned long
487 ru = ldap_utf8_to_ucs4( &right->bv_val[r] );
488 if( ru == LDAP_UCS4_INVALID ) {
492 lu = ldap_utf8_to_ucs4( &left->bv_val[l] );
493 if( lu == LDAP_UCS4_INVALID ) {
497 ruu = uctoupper( ru );
498 luu = uctoupper( lu );
502 } else if( luu > ruu ) {
506 rlen = LDAP_UTF8_CHARLEN( &right->bv_val[r] );
507 llen = LDAP_UTF8_CHARLEN( &left->bv_val[l] );
510 if( r < right->bv_len ) {
515 if( l < left->bv_len ) {
531 unsigned char *u = in->bv_val;
533 if( !in->bv_len ) return LDAP_INVALID_SYNTAX;
535 for( count = in->bv_len; count > 0; count-=len, u+=len ) {
536 /* get the length indicated by the first byte */
537 len = LDAP_UTF8_CHARLEN( u );
539 /* should not be zero */
540 if( len == 0 ) return LDAP_INVALID_SYNTAX;
542 /* make sure len corresponds with the offset
543 to the next character */
544 if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
547 if( count != 0 ) return LDAP_INVALID_SYNTAX;
556 struct berval **normalized )
558 struct berval *newval;
561 newval = ch_malloc( sizeof( struct berval ) );
565 /* Ignore initial whitespace */
566 while ( ldap_utf8_isspace( p ) ) {
572 return LDAP_INVALID_SYNTAX;
575 newval->bv_val = ch_strdup( p );
576 p = q = newval->bv_val;
582 if ( ldap_utf8_isspace( p ) ) {
583 len = LDAP_UTF8_COPY(q,p);
588 /* Ignore the extra whitespace */
589 while ( ldap_utf8_isspace( p ) ) {
593 len = LDAP_UTF8_COPY(q,p);
600 assert( *newval->bv_val );
601 assert( newval->bv_val < p );
604 /* cannot start with a space */
605 assert( !ldap_utf8_isspace(newval->bv_val) );
608 * If the string ended in space, backup the pointer one
609 * position. One is enough because the above loop collapsed
610 * all whitespace to a single space.
617 /* cannot end with a space */
618 assert( !ldap_utf8_isspace( LDAP_UTF8_PREV(q) ) );
623 newval->bv_len = q - newval->bv_val;
624 *normalized = newval;
635 struct berval *value,
636 void *assertedValue )
638 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
641 match = strncmp( value->bv_val,
642 ((struct berval *) assertedValue)->bv_val,
651 caseExactSubstringsMatch(
656 struct berval *value,
657 void *assertedValue )
660 SubstringsAssertion *sub = assertedValue;
661 struct berval left = *value;
665 /* Add up asserted input length */
666 if( sub->sa_initial ) {
667 inlen += sub->sa_initial->bv_len;
670 for(i=0; sub->sa_any[i] != NULL; i++) {
671 inlen += sub->sa_any[i]->bv_len;
674 if( sub->sa_final ) {
675 inlen += sub->sa_final->bv_len;
678 if( sub->sa_initial ) {
679 if( inlen > left.bv_len ) {
684 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
685 sub->sa_initial->bv_len );
691 left.bv_val += sub->sa_initial->bv_len;
692 left.bv_len -= sub->sa_initial->bv_len;
693 inlen -= sub->sa_initial->bv_len;
696 if( sub->sa_final ) {
697 if( inlen > left.bv_len ) {
702 match = strncmp( sub->sa_final->bv_val,
703 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
704 sub->sa_final->bv_len );
710 left.bv_len -= sub->sa_final->bv_len;
711 inlen -= sub->sa_final->bv_len;
715 for(i=0; sub->sa_any[i]; i++) {
720 if( inlen > left.bv_len ) {
721 /* not enough length */
726 if( sub->sa_any[i]->bv_len == 0 ) {
730 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
737 idx = p - left.bv_val;
738 assert( idx < left.bv_len );
740 if( idx >= left.bv_len ) {
741 /* this shouldn't happen */
748 if( sub->sa_any[i]->bv_len > left.bv_len ) {
749 /* not enough left */
754 match = strncmp( left.bv_val,
755 sub->sa_any[i]->bv_val,
756 sub->sa_any[i]->bv_len );
764 left.bv_val += sub->sa_any[i]->bv_len;
765 left.bv_len -= sub->sa_any[i]->bv_len;
766 inlen -= sub->sa_any[i]->bv_len;
775 /* Index generation function */
776 int caseExactIndexer(
781 struct berval *prefix,
782 struct berval **values,
783 struct berval ***keysp )
787 struct berval **keys;
788 lutil_MD5_CTX MD5context;
789 unsigned char MD5digest[16];
790 struct berval digest;
791 digest.bv_val = MD5digest;
792 digest.bv_len = sizeof(MD5digest);
794 for( i=0; values[i] != NULL; i++ ) {
795 /* just count them */
800 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
802 slen = strlen( syntax->ssyn_oid );
803 mlen = strlen( mr->smr_oid );
805 for( i=0; values[i] != NULL; i++ ) {
806 struct berval *value = values[i];
808 lutil_MD5Init( &MD5context );
809 if( prefix != NULL && prefix->bv_len > 0 ) {
810 lutil_MD5Update( &MD5context,
811 prefix->bv_val, prefix->bv_len );
813 lutil_MD5Update( &MD5context,
814 syntax->ssyn_oid, slen );
815 lutil_MD5Update( &MD5context,
817 lutil_MD5Update( &MD5context,
818 value->bv_val, value->bv_len );
819 lutil_MD5Final( MD5digest, &MD5context );
821 keys[i] = ber_bvdup( &digest );
829 /* Index generation function */
835 struct berval *prefix,
837 struct berval ***keysp )
840 struct berval **keys;
841 lutil_MD5_CTX MD5context;
842 unsigned char MD5digest[LUTIL_MD5_BYTES];
843 struct berval *value;
844 struct berval digest;
845 digest.bv_val = MD5digest;
846 digest.bv_len = sizeof(MD5digest);
848 slen = strlen( syntax->ssyn_oid );
849 mlen = strlen( mr->smr_oid );
851 value = (struct berval *) assertValue;
853 keys = ch_malloc( sizeof( struct berval * ) * 2 );
855 lutil_MD5Init( &MD5context );
856 if( prefix != NULL && prefix->bv_len > 0 ) {
857 lutil_MD5Update( &MD5context,
858 prefix->bv_val, prefix->bv_len );
860 lutil_MD5Update( &MD5context,
861 syntax->ssyn_oid, slen );
862 lutil_MD5Update( &MD5context,
864 lutil_MD5Update( &MD5context,
865 value->bv_val, value->bv_len );
866 lutil_MD5Final( MD5digest, &MD5context );
868 keys[0] = ber_bvdup( &digest );
875 /* Substrings Index generation function */
876 int caseExactSubstringsIndexer(
881 struct berval *prefix,
882 struct berval **values,
883 struct berval ***keysp )
887 struct berval **keys;
888 lutil_MD5_CTX MD5context;
889 unsigned char MD5digest[16];
890 struct berval digest;
891 digest.bv_val = MD5digest;
892 digest.bv_len = sizeof(MD5digest);
895 for( i=0; values[i] != NULL; i++ ) {
896 /* count number of indices to generate */
897 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
901 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
902 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
903 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
904 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
906 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
910 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
911 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
912 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
916 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
917 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
918 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
919 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
921 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
928 /* no keys to generate */
933 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
935 slen = strlen( syntax->ssyn_oid );
936 mlen = strlen( mr->smr_oid );
939 for( i=0; values[i] != NULL; i++ ) {
941 struct berval *value;
944 if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
946 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
947 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
949 char pre = SLAP_INDEX_SUBSTR_PREFIX;
950 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
952 for( j=0; j<max; j++ ) {
953 lutil_MD5Init( &MD5context );
954 if( prefix != NULL && prefix->bv_len > 0 ) {
955 lutil_MD5Update( &MD5context,
956 prefix->bv_val, prefix->bv_len );
959 lutil_MD5Update( &MD5context,
960 &pre, sizeof( pre ) );
961 lutil_MD5Update( &MD5context,
962 syntax->ssyn_oid, slen );
963 lutil_MD5Update( &MD5context,
965 lutil_MD5Update( &MD5context,
967 SLAP_INDEX_SUBSTR_MAXLEN );
968 lutil_MD5Final( MD5digest, &MD5context );
970 keys[nkeys++] = ber_bvdup( &digest );
974 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
975 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
977 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
980 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
981 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
982 lutil_MD5Init( &MD5context );
983 if( prefix != NULL && prefix->bv_len > 0 ) {
984 lutil_MD5Update( &MD5context,
985 prefix->bv_val, prefix->bv_len );
987 lutil_MD5Update( &MD5context,
988 &pre, sizeof( pre ) );
989 lutil_MD5Update( &MD5context,
990 syntax->ssyn_oid, slen );
991 lutil_MD5Update( &MD5context,
993 lutil_MD5Update( &MD5context,
995 lutil_MD5Final( MD5digest, &MD5context );
997 keys[nkeys++] = ber_bvdup( &digest );
1000 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1001 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1002 lutil_MD5Init( &MD5context );
1003 if( prefix != NULL && prefix->bv_len > 0 ) {
1004 lutil_MD5Update( &MD5context,
1005 prefix->bv_val, prefix->bv_len );
1007 lutil_MD5Update( &MD5context,
1008 &pre, sizeof( pre ) );
1009 lutil_MD5Update( &MD5context,
1010 syntax->ssyn_oid, slen );
1011 lutil_MD5Update( &MD5context,
1012 mr->smr_oid, mlen );
1013 lutil_MD5Update( &MD5context,
1014 &value->bv_val[value->bv_len-j], j );
1015 lutil_MD5Final( MD5digest, &MD5context );
1017 keys[nkeys++] = ber_bvdup( &digest );
1031 return LDAP_SUCCESS;
1034 int caseExactSubstringsFilter(
1039 struct berval *prefix,
1041 struct berval ***keysp )
1043 SubstringsAssertion *sa = assertValue;
1045 ber_len_t nkeys = 0;
1046 size_t slen, mlen, klen;
1047 struct berval **keys;
1048 lutil_MD5_CTX MD5context;
1049 unsigned char MD5digest[LUTIL_MD5_BYTES];
1050 struct berval *value;
1051 struct berval digest;
1053 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1054 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1059 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1061 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1062 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1063 /* don't bother accounting for stepping */
1064 nkeys += sa->sa_any[i]->bv_len -
1065 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1070 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1071 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1078 return LDAP_SUCCESS;
1081 digest.bv_val = MD5digest;
1082 digest.bv_len = sizeof(MD5digest);
1084 slen = strlen( syntax->ssyn_oid );
1085 mlen = strlen( mr->smr_oid );
1087 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1090 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1091 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1093 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1094 value = sa->sa_initial;
1096 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1097 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1099 lutil_MD5Init( &MD5context );
1100 if( prefix != NULL && prefix->bv_len > 0 ) {
1101 lutil_MD5Update( &MD5context,
1102 prefix->bv_val, prefix->bv_len );
1104 lutil_MD5Update( &MD5context,
1105 &pre, sizeof( pre ) );
1106 lutil_MD5Update( &MD5context,
1107 syntax->ssyn_oid, slen );
1108 lutil_MD5Update( &MD5context,
1109 mr->smr_oid, mlen );
1110 lutil_MD5Update( &MD5context,
1111 value->bv_val, klen );
1112 lutil_MD5Final( MD5digest, &MD5context );
1114 keys[nkeys++] = ber_bvdup( &digest );
1117 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1119 pre = SLAP_INDEX_SUBSTR_PREFIX;
1120 klen = SLAP_INDEX_SUBSTR_MAXLEN;
1122 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1123 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
1127 value = sa->sa_any[i];
1130 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
1131 j += SLAP_INDEX_SUBSTR_STEP )
1133 lutil_MD5Init( &MD5context );
1134 if( prefix != NULL && prefix->bv_len > 0 ) {
1135 lutil_MD5Update( &MD5context,
1136 prefix->bv_val, prefix->bv_len );
1138 lutil_MD5Update( &MD5context,
1139 &pre, sizeof( pre ) );
1140 lutil_MD5Update( &MD5context,
1141 syntax->ssyn_oid, slen );
1142 lutil_MD5Update( &MD5context,
1143 mr->smr_oid, mlen );
1144 lutil_MD5Update( &MD5context,
1145 &value->bv_val[j], klen );
1146 lutil_MD5Final( MD5digest, &MD5context );
1148 keys[nkeys++] = ber_bvdup( &digest );
1153 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1154 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1156 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1157 value = sa->sa_final;
1159 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1160 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1162 lutil_MD5Init( &MD5context );
1163 if( prefix != NULL && prefix->bv_len > 0 ) {
1164 lutil_MD5Update( &MD5context,
1165 prefix->bv_val, prefix->bv_len );
1167 lutil_MD5Update( &MD5context,
1168 &pre, sizeof( pre ) );
1169 lutil_MD5Update( &MD5context,
1170 syntax->ssyn_oid, slen );
1171 lutil_MD5Update( &MD5context,
1172 mr->smr_oid, mlen );
1173 lutil_MD5Update( &MD5context,
1174 &value->bv_val[value->bv_len-klen], klen );
1175 lutil_MD5Final( MD5digest, &MD5context );
1177 keys[nkeys++] = ber_bvdup( &digest );
1188 return LDAP_SUCCESS;
1197 struct berval *value,
1198 void *assertedValue )
1201 *matchp = UTF8casecmp( value, (struct berval *) assertedValue );
1203 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
1206 match = strncasecmp( value->bv_val,
1207 ((struct berval *) assertedValue)->bv_val,
1213 return LDAP_SUCCESS;
1217 caseIgnoreSubstringsMatch(
1222 struct berval *value,
1223 void *assertedValue )
1226 SubstringsAssertion *sub = assertedValue;
1227 struct berval left = *value;
1231 /* Add up asserted input length */
1232 if( sub->sa_initial ) {
1233 inlen += sub->sa_initial->bv_len;
1236 for(i=0; sub->sa_any[i] != NULL; i++) {
1237 inlen += sub->sa_any[i]->bv_len;
1240 if( sub->sa_final ) {
1241 inlen += sub->sa_final->bv_len;
1244 if( sub->sa_initial ) {
1245 if( inlen > left.bv_len ) {
1250 match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
1251 sub->sa_initial->bv_len );
1257 left.bv_val += sub->sa_initial->bv_len;
1258 left.bv_len -= sub->sa_initial->bv_len;
1259 inlen -= sub->sa_initial->bv_len;
1262 if( sub->sa_final ) {
1263 if( inlen > left.bv_len ) {
1268 match = strncasecmp( sub->sa_final->bv_val,
1269 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
1270 sub->sa_final->bv_len );
1276 left.bv_len -= sub->sa_final->bv_len;
1277 inlen -= sub->sa_final->bv_len;
1281 for(i=0; sub->sa_any[i]; i++) {
1286 if( inlen > left.bv_len ) {
1287 /* not enough length */
1292 if( sub->sa_any[i]->bv_len == 0 ) {
1296 p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
1303 idx = p - left.bv_val;
1304 assert( idx < left.bv_len );
1306 if( idx >= left.bv_len ) {
1307 /* this shouldn't happen */
1314 if( sub->sa_any[i]->bv_len > left.bv_len ) {
1315 /* not enough left */
1320 match = strncasecmp( left.bv_val,
1321 sub->sa_any[i]->bv_val,
1322 sub->sa_any[i]->bv_len );
1331 left.bv_val += sub->sa_any[i]->bv_len;
1332 left.bv_len -= sub->sa_any[i]->bv_len;
1333 inlen -= sub->sa_any[i]->bv_len;
1339 return LDAP_SUCCESS;
1342 /* Index generation function */
1343 int caseIgnoreIndexer(
1348 struct berval *prefix,
1349 struct berval **values,
1350 struct berval ***keysp )
1354 struct berval **keys;
1355 lutil_MD5_CTX MD5context;
1356 unsigned char MD5digest[16];
1357 struct berval digest;
1358 digest.bv_val = MD5digest;
1359 digest.bv_len = sizeof(MD5digest);
1361 for( i=0; values[i] != NULL; i++ ) {
1362 /* just count them */
1367 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
1369 slen = strlen( syntax->ssyn_oid );
1370 mlen = strlen( mr->smr_oid );
1372 for( i=0; values[i] != NULL; i++ ) {
1373 struct berval *value = ber_bvdup( values[i] );
1374 ldap_pvt_str2upper( value->bv_val );
1376 lutil_MD5Init( &MD5context );
1377 if( prefix != NULL && prefix->bv_len > 0 ) {
1378 lutil_MD5Update( &MD5context,
1379 prefix->bv_val, prefix->bv_len );
1381 lutil_MD5Update( &MD5context,
1382 syntax->ssyn_oid, slen );
1383 lutil_MD5Update( &MD5context,
1384 mr->smr_oid, mlen );
1385 lutil_MD5Update( &MD5context,
1386 value->bv_val, value->bv_len );
1387 lutil_MD5Final( MD5digest, &MD5context );
1389 ber_bvfree( value );
1391 keys[i] = ber_bvdup( &digest );
1396 return LDAP_SUCCESS;
1399 /* Index generation function */
1400 int caseIgnoreFilter(
1405 struct berval *prefix,
1407 struct berval ***keysp )
1410 struct berval **keys;
1411 lutil_MD5_CTX MD5context;
1412 unsigned char MD5digest[LUTIL_MD5_BYTES];
1413 struct berval *value;
1414 struct berval digest;
1415 digest.bv_val = MD5digest;
1416 digest.bv_len = sizeof(MD5digest);
1418 slen = strlen( syntax->ssyn_oid );
1419 mlen = strlen( mr->smr_oid );
1421 value = ber_bvdup( (struct berval *) assertValue );
1422 ldap_pvt_str2upper( value->bv_val );
1424 keys = ch_malloc( sizeof( struct berval * ) * 2 );
1426 lutil_MD5Init( &MD5context );
1427 if( prefix != NULL && prefix->bv_len > 0 ) {
1428 lutil_MD5Update( &MD5context,
1429 prefix->bv_val, prefix->bv_len );
1431 lutil_MD5Update( &MD5context,
1432 syntax->ssyn_oid, slen );
1433 lutil_MD5Update( &MD5context,
1434 mr->smr_oid, mlen );
1435 lutil_MD5Update( &MD5context,
1436 value->bv_val, value->bv_len );
1437 lutil_MD5Final( MD5digest, &MD5context );
1439 keys[0] = ber_bvdup( &digest );
1442 ber_bvfree( value );
1446 return LDAP_SUCCESS;
1449 /* Substrings Index generation function */
1450 int caseIgnoreSubstringsIndexer(
1455 struct berval *prefix,
1456 struct berval **values,
1457 struct berval ***keysp )
1461 struct berval **keys;
1462 lutil_MD5_CTX MD5context;
1463 unsigned char MD5digest[16];
1464 struct berval digest;
1465 digest.bv_val = MD5digest;
1466 digest.bv_len = sizeof(MD5digest);
1469 for( i=0; values[i] != NULL; i++ ) {
1470 /* count number of indices to generate */
1471 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
1475 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1476 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1477 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1478 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1480 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1484 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
1485 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1486 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1490 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1491 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1492 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1493 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1495 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1502 /* no keys to generate */
1504 return LDAP_SUCCESS;
1507 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1509 slen = strlen( syntax->ssyn_oid );
1510 mlen = strlen( mr->smr_oid );
1513 for( i=0; values[i] != NULL; i++ ) {
1515 struct berval *value;
1517 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
1519 value = ber_bvdup( values[i] );
1520 ldap_pvt_str2upper( value->bv_val );
1522 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
1523 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
1525 char pre = SLAP_INDEX_SUBSTR_PREFIX;
1526 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
1528 for( j=0; j<max; j++ ) {
1529 lutil_MD5Init( &MD5context );
1530 if( prefix != NULL && prefix->bv_len > 0 ) {
1531 lutil_MD5Update( &MD5context,
1532 prefix->bv_val, prefix->bv_len );
1535 lutil_MD5Update( &MD5context,
1536 &pre, sizeof( pre ) );
1537 lutil_MD5Update( &MD5context,
1538 syntax->ssyn_oid, slen );
1539 lutil_MD5Update( &MD5context,
1540 mr->smr_oid, mlen );
1541 lutil_MD5Update( &MD5context,
1543 SLAP_INDEX_SUBSTR_MAXLEN );
1544 lutil_MD5Final( MD5digest, &MD5context );
1546 keys[nkeys++] = ber_bvdup( &digest );
1550 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1551 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1553 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
1556 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1557 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1558 lutil_MD5Init( &MD5context );
1559 if( prefix != NULL && prefix->bv_len > 0 ) {
1560 lutil_MD5Update( &MD5context,
1561 prefix->bv_val, prefix->bv_len );
1563 lutil_MD5Update( &MD5context,
1564 &pre, sizeof( pre ) );
1565 lutil_MD5Update( &MD5context,
1566 syntax->ssyn_oid, slen );
1567 lutil_MD5Update( &MD5context,
1568 mr->smr_oid, mlen );
1569 lutil_MD5Update( &MD5context,
1571 lutil_MD5Final( MD5digest, &MD5context );
1573 keys[nkeys++] = ber_bvdup( &digest );
1576 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1577 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1578 lutil_MD5Init( &MD5context );
1579 if( prefix != NULL && prefix->bv_len > 0 ) {
1580 lutil_MD5Update( &MD5context,
1581 prefix->bv_val, prefix->bv_len );
1583 lutil_MD5Update( &MD5context,
1584 &pre, sizeof( pre ) );
1585 lutil_MD5Update( &MD5context,
1586 syntax->ssyn_oid, slen );
1587 lutil_MD5Update( &MD5context,
1588 mr->smr_oid, mlen );
1589 lutil_MD5Update( &MD5context,
1590 &value->bv_val[value->bv_len-j], j );
1591 lutil_MD5Final( MD5digest, &MD5context );
1593 keys[nkeys++] = ber_bvdup( &digest );
1598 ber_bvfree( value );
1609 return LDAP_SUCCESS;
1612 int caseIgnoreSubstringsFilter(
1617 struct berval *prefix,
1619 struct berval ***keysp )
1621 SubstringsAssertion *sa = assertValue;
1623 ber_len_t nkeys = 0;
1624 size_t slen, mlen, klen;
1625 struct berval **keys;
1626 lutil_MD5_CTX MD5context;
1627 unsigned char MD5digest[LUTIL_MD5_BYTES];
1628 struct berval *value;
1629 struct berval digest;
1631 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
1632 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1637 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
1639 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1640 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1641 /* don't bother accounting for stepping */
1642 nkeys += sa->sa_any[i]->bv_len -
1643 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1648 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
1649 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1656 return LDAP_SUCCESS;
1659 digest.bv_val = MD5digest;
1660 digest.bv_len = sizeof(MD5digest);
1662 slen = strlen( syntax->ssyn_oid );
1663 mlen = strlen( mr->smr_oid );
1665 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1668 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
1669 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1671 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1672 value = ber_bvdup( sa->sa_initial );
1673 ldap_pvt_str2upper( value->bv_val );
1675 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1676 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1678 lutil_MD5Init( &MD5context );
1679 if( prefix != NULL && prefix->bv_len > 0 ) {
1680 lutil_MD5Update( &MD5context,
1681 prefix->bv_val, prefix->bv_len );
1683 lutil_MD5Update( &MD5context,
1684 &pre, sizeof( pre ) );
1685 lutil_MD5Update( &MD5context,
1686 syntax->ssyn_oid, slen );
1687 lutil_MD5Update( &MD5context,
1688 mr->smr_oid, mlen );
1689 lutil_MD5Update( &MD5context,
1690 value->bv_val, klen );
1691 lutil_MD5Final( MD5digest, &MD5context );
1693 ber_bvfree( value );
1694 keys[nkeys++] = ber_bvdup( &digest );
1697 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
1699 pre = SLAP_INDEX_SUBSTR_PREFIX;
1700 klen = SLAP_INDEX_SUBSTR_MAXLEN;
1702 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1703 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
1707 value = ber_bvdup( sa->sa_any[i] );
1708 ldap_pvt_str2upper( value->bv_val );
1711 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
1712 j += SLAP_INDEX_SUBSTR_STEP )
1714 lutil_MD5Init( &MD5context );
1715 if( prefix != NULL && prefix->bv_len > 0 ) {
1716 lutil_MD5Update( &MD5context,
1717 prefix->bv_val, prefix->bv_len );
1719 lutil_MD5Update( &MD5context,
1720 &pre, sizeof( pre ) );
1721 lutil_MD5Update( &MD5context,
1722 syntax->ssyn_oid, slen );
1723 lutil_MD5Update( &MD5context,
1724 mr->smr_oid, mlen );
1725 lutil_MD5Update( &MD5context,
1726 &value->bv_val[j], klen );
1727 lutil_MD5Final( MD5digest, &MD5context );
1729 keys[nkeys++] = ber_bvdup( &digest );
1732 ber_bvfree( value );
1736 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
1737 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1739 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1740 value = ber_bvdup( sa->sa_final );
1741 ldap_pvt_str2upper( value->bv_val );
1743 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1744 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1746 lutil_MD5Init( &MD5context );
1747 if( prefix != NULL && prefix->bv_len > 0 ) {
1748 lutil_MD5Update( &MD5context,
1749 prefix->bv_val, prefix->bv_len );
1751 lutil_MD5Update( &MD5context,
1752 &pre, sizeof( pre ) );
1753 lutil_MD5Update( &MD5context,
1754 syntax->ssyn_oid, slen );
1755 lutil_MD5Update( &MD5context,
1756 mr->smr_oid, mlen );
1757 lutil_MD5Update( &MD5context,
1758 &value->bv_val[value->bv_len-klen], klen );
1759 lutil_MD5Final( MD5digest, &MD5context );
1761 ber_bvfree( value );
1762 keys[nkeys++] = ber_bvdup( &digest );
1773 return LDAP_SUCCESS;
1779 struct berval *val )
1783 if( val->bv_len == 0 ) return 0;
1785 if( OID_LEADCHAR(val->bv_val[0]) ) {
1787 for(i=1; i < val->bv_len; i++) {
1788 if( OID_SEPARATOR( val->bv_val[i] ) ) {
1789 if( dot++ ) return 1;
1790 } else if ( OID_CHAR( val->bv_val[i] ) ) {
1793 return LDAP_INVALID_SYNTAX;
1797 return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
1799 } else if( DESC_LEADCHAR(val->bv_val[0]) ) {
1800 for(i=1; i < val->bv_len; i++) {
1801 if( !DESC_CHAR(val->bv_val[i] ) ) {
1802 return LDAP_INVALID_SYNTAX;
1806 return LDAP_SUCCESS;
1809 return LDAP_INVALID_SYNTAX;
1815 struct berval *val )
1819 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
1821 if( val->bv_val[0] == '+' || val->bv_val[0] == '-' ) {
1822 if( val->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
1823 } else if( !ASCII_DIGIT(val->bv_val[0]) ) {
1824 return LDAP_INVALID_SYNTAX;
1827 for(i=1; i < val->bv_len; i++) {
1828 if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
1831 return LDAP_SUCCESS;
1838 struct berval **normalized )
1841 struct berval *newval;
1847 negative = ( *p == '-' );
1848 if( *p == '-' || *p == '+' ) p++;
1850 /* Ignore leading zeros */
1851 while ( *p == '0' ) p++;
1853 newval = (struct berval *) ch_malloc( sizeof(struct berval) );
1856 newval->bv_val = ch_strdup("0");
1861 newval->bv_val = ch_malloc( val->bv_len + 1 );
1865 newval->bv_val[newval->bv_len++] = '-';
1868 for( ; *p != '\0'; p++ ) {
1869 newval->bv_val[newval->bv_len++] = *p;
1873 *normalized = newval;
1874 return LDAP_SUCCESS;
1878 printableStringValidate(
1880 struct berval *val )
1884 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
1886 for(i=0; i < val->bv_len; i++) {
1887 if( !isprint(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
1890 return LDAP_SUCCESS;
1896 struct berval *val )
1900 if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
1902 for(i=0; i < val->bv_len; i++) {
1903 if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
1906 return LDAP_SUCCESS;
1913 struct berval **normalized )
1915 struct berval *newval;
1918 newval = ch_malloc( sizeof( struct berval ) );
1922 /* Ignore initial whitespace */
1923 while ( ASCII_SPACE( *p ) ) {
1929 return LDAP_INVALID_SYNTAX;
1932 newval->bv_val = ch_strdup( p );
1933 p = q = newval->bv_val;
1936 if ( ASCII_SPACE( *p ) ) {
1939 /* Ignore the extra whitespace */
1940 while ( ASCII_SPACE( *p ) ) {
1948 assert( *newval->bv_val );
1949 assert( newval->bv_val < p );
1952 /* cannot start with a space */
1953 assert( !ASCII_SPACE(*newval->bv_val) );
1956 * If the string ended in space, backup the pointer one
1957 * position. One is enough because the above loop collapsed
1958 * all whitespace to a single space.
1961 if ( ASCII_SPACE( q[-1] ) ) {
1965 /* cannot end with a space */
1966 assert( !ASCII_SPACE( q[-1] ) );
1968 /* null terminate */
1971 newval->bv_len = q - newval->bv_val;
1972 *normalized = newval;
1974 return LDAP_SUCCESS;
1983 struct berval *value,
1984 void *assertedValue )
1986 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
1989 match = strncmp( value->bv_val,
1990 ((struct berval *) assertedValue)->bv_val,
1995 return LDAP_SUCCESS;
1999 caseExactIA5SubstringsMatch(
2004 struct berval *value,
2005 void *assertedValue )
2008 SubstringsAssertion *sub = assertedValue;
2009 struct berval left = *value;
2013 /* Add up asserted input length */
2014 if( sub->sa_initial ) {
2015 inlen += sub->sa_initial->bv_len;
2018 for(i=0; sub->sa_any[i] != NULL; i++) {
2019 inlen += sub->sa_any[i]->bv_len;
2022 if( sub->sa_final ) {
2023 inlen += sub->sa_final->bv_len;
2026 if( sub->sa_initial ) {
2027 if( inlen > left.bv_len ) {
2032 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
2033 sub->sa_initial->bv_len );
2039 left.bv_val += sub->sa_initial->bv_len;
2040 left.bv_len -= sub->sa_initial->bv_len;
2041 inlen -= sub->sa_initial->bv_len;
2044 if( sub->sa_final ) {
2045 if( inlen > left.bv_len ) {
2050 match = strncmp( sub->sa_final->bv_val,
2051 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
2052 sub->sa_final->bv_len );
2058 left.bv_len -= sub->sa_final->bv_len;
2059 inlen -= sub->sa_final->bv_len;
2063 for(i=0; sub->sa_any[i]; i++) {
2068 if( inlen > left.bv_len ) {
2069 /* not enough length */
2074 if( sub->sa_any[i]->bv_len == 0 ) {
2078 p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
2085 idx = p - left.bv_val;
2086 assert( idx < left.bv_len );
2088 if( idx >= left.bv_len ) {
2089 /* this shouldn't happen */
2096 if( sub->sa_any[i]->bv_len > left.bv_len ) {
2097 /* not enough left */
2102 match = strncmp( left.bv_val,
2103 sub->sa_any[i]->bv_val,
2104 sub->sa_any[i]->bv_len );
2112 left.bv_val += sub->sa_any[i]->bv_len;
2113 left.bv_len -= sub->sa_any[i]->bv_len;
2114 inlen -= sub->sa_any[i]->bv_len;
2120 return LDAP_SUCCESS;
2123 /* Index generation function */
2124 int caseExactIA5Indexer(
2129 struct berval *prefix,
2130 struct berval **values,
2131 struct berval ***keysp )
2135 struct berval **keys;
2136 lutil_MD5_CTX MD5context;
2137 unsigned char MD5digest[16];
2138 struct berval digest;
2139 digest.bv_val = MD5digest;
2140 digest.bv_len = sizeof(MD5digest);
2142 for( i=0; values[i] != NULL; i++ ) {
2143 /* just count them */
2148 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
2150 slen = strlen( syntax->ssyn_oid );
2151 mlen = strlen( mr->smr_oid );
2153 for( i=0; values[i] != NULL; i++ ) {
2154 struct berval *value = values[i];
2156 lutil_MD5Init( &MD5context );
2157 if( prefix != NULL && prefix->bv_len > 0 ) {
2158 lutil_MD5Update( &MD5context,
2159 prefix->bv_val, prefix->bv_len );
2161 lutil_MD5Update( &MD5context,
2162 syntax->ssyn_oid, slen );
2163 lutil_MD5Update( &MD5context,
2164 mr->smr_oid, mlen );
2165 lutil_MD5Update( &MD5context,
2166 value->bv_val, value->bv_len );
2167 lutil_MD5Final( MD5digest, &MD5context );
2169 keys[i] = ber_bvdup( &digest );
2174 return LDAP_SUCCESS;
2177 /* Index generation function */
2178 int caseExactIA5Filter(
2183 struct berval *prefix,
2185 struct berval ***keysp )
2188 struct berval **keys;
2189 lutil_MD5_CTX MD5context;
2190 unsigned char MD5digest[LUTIL_MD5_BYTES];
2191 struct berval *value;
2192 struct berval digest;
2193 digest.bv_val = MD5digest;
2194 digest.bv_len = sizeof(MD5digest);
2196 slen = strlen( syntax->ssyn_oid );
2197 mlen = strlen( mr->smr_oid );
2199 value = (struct berval *) assertValue;
2201 keys = ch_malloc( sizeof( struct berval * ) * 2 );
2203 lutil_MD5Init( &MD5context );
2204 if( prefix != NULL && prefix->bv_len > 0 ) {
2205 lutil_MD5Update( &MD5context,
2206 prefix->bv_val, prefix->bv_len );
2208 lutil_MD5Update( &MD5context,
2209 syntax->ssyn_oid, slen );
2210 lutil_MD5Update( &MD5context,
2211 mr->smr_oid, mlen );
2212 lutil_MD5Update( &MD5context,
2213 value->bv_val, value->bv_len );
2214 lutil_MD5Final( MD5digest, &MD5context );
2216 keys[0] = ber_bvdup( &digest );
2220 return LDAP_SUCCESS;
2223 /* Substrings Index generation function */
2224 int caseExactIA5SubstringsIndexer(
2229 struct berval *prefix,
2230 struct berval **values,
2231 struct berval ***keysp )
2235 struct berval **keys;
2236 lutil_MD5_CTX MD5context;
2237 unsigned char MD5digest[16];
2238 struct berval digest;
2239 digest.bv_val = MD5digest;
2240 digest.bv_len = sizeof(MD5digest);
2243 for( i=0; values[i] != NULL; i++ ) {
2244 /* count number of indices to generate */
2245 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2249 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2250 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2251 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2252 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2254 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2258 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2259 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2260 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2264 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2265 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2266 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2267 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2269 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2276 /* no keys to generate */
2278 return LDAP_SUCCESS;
2281 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2283 slen = strlen( syntax->ssyn_oid );
2284 mlen = strlen( mr->smr_oid );
2287 for( i=0; values[i] != NULL; i++ ) {
2289 struct berval *value;
2292 if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2294 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2295 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2297 char pre = SLAP_INDEX_SUBSTR_PREFIX;
2298 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2300 for( j=0; j<max; j++ ) {
2301 lutil_MD5Init( &MD5context );
2302 if( prefix != NULL && prefix->bv_len > 0 ) {
2303 lutil_MD5Update( &MD5context,
2304 prefix->bv_val, prefix->bv_len );
2307 lutil_MD5Update( &MD5context,
2308 &pre, sizeof( pre ) );
2309 lutil_MD5Update( &MD5context,
2310 syntax->ssyn_oid, slen );
2311 lutil_MD5Update( &MD5context,
2312 mr->smr_oid, mlen );
2313 lutil_MD5Update( &MD5context,
2315 SLAP_INDEX_SUBSTR_MAXLEN );
2316 lutil_MD5Final( MD5digest, &MD5context );
2318 keys[nkeys++] = ber_bvdup( &digest );
2322 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2323 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2325 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2328 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2329 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2330 lutil_MD5Init( &MD5context );
2331 if( prefix != NULL && prefix->bv_len > 0 ) {
2332 lutil_MD5Update( &MD5context,
2333 prefix->bv_val, prefix->bv_len );
2335 lutil_MD5Update( &MD5context,
2336 &pre, sizeof( pre ) );
2337 lutil_MD5Update( &MD5context,
2338 syntax->ssyn_oid, slen );
2339 lutil_MD5Update( &MD5context,
2340 mr->smr_oid, mlen );
2341 lutil_MD5Update( &MD5context,
2343 lutil_MD5Final( MD5digest, &MD5context );
2345 keys[nkeys++] = ber_bvdup( &digest );
2348 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2349 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2350 lutil_MD5Init( &MD5context );
2351 if( prefix != NULL && prefix->bv_len > 0 ) {
2352 lutil_MD5Update( &MD5context,
2353 prefix->bv_val, prefix->bv_len );
2355 lutil_MD5Update( &MD5context,
2356 &pre, sizeof( pre ) );
2357 lutil_MD5Update( &MD5context,
2358 syntax->ssyn_oid, slen );
2359 lutil_MD5Update( &MD5context,
2360 mr->smr_oid, mlen );
2361 lutil_MD5Update( &MD5context,
2362 &value->bv_val[value->bv_len-j], j );
2363 lutil_MD5Final( MD5digest, &MD5context );
2365 keys[nkeys++] = ber_bvdup( &digest );
2379 return LDAP_SUCCESS;
2382 int caseExactIA5SubstringsFilter(
2387 struct berval *prefix,
2389 struct berval ***keysp )
2391 SubstringsAssertion *sa = assertValue;
2393 ber_len_t nkeys = 0;
2394 size_t slen, mlen, klen;
2395 struct berval **keys;
2396 lutil_MD5_CTX MD5context;
2397 unsigned char MD5digest[LUTIL_MD5_BYTES];
2398 struct berval *value;
2399 struct berval digest;
2401 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
2402 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2407 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2409 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2410 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2411 /* don't bother accounting for stepping */
2412 nkeys += sa->sa_any[i]->bv_len -
2413 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2418 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
2419 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2426 return LDAP_SUCCESS;
2429 digest.bv_val = MD5digest;
2430 digest.bv_len = sizeof(MD5digest);
2432 slen = strlen( syntax->ssyn_oid );
2433 mlen = strlen( mr->smr_oid );
2435 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2438 if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
2439 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2441 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2442 value = sa->sa_initial;
2444 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2445 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2447 lutil_MD5Init( &MD5context );
2448 if( prefix != NULL && prefix->bv_len > 0 ) {
2449 lutil_MD5Update( &MD5context,
2450 prefix->bv_val, prefix->bv_len );
2452 lutil_MD5Update( &MD5context,
2453 &pre, sizeof( pre ) );
2454 lutil_MD5Update( &MD5context,
2455 syntax->ssyn_oid, slen );
2456 lutil_MD5Update( &MD5context,
2457 mr->smr_oid, mlen );
2458 lutil_MD5Update( &MD5context,
2459 value->bv_val, klen );
2460 lutil_MD5Final( MD5digest, &MD5context );
2462 keys[nkeys++] = ber_bvdup( &digest );
2465 if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2467 pre = SLAP_INDEX_SUBSTR_PREFIX;
2468 klen = SLAP_INDEX_SUBSTR_MAXLEN;
2470 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2471 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
2475 value = sa->sa_any[i];
2478 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
2479 j += SLAP_INDEX_SUBSTR_STEP )
2481 lutil_MD5Init( &MD5context );
2482 if( prefix != NULL && prefix->bv_len > 0 ) {
2483 lutil_MD5Update( &MD5context,
2484 prefix->bv_val, prefix->bv_len );
2486 lutil_MD5Update( &MD5context,
2487 &pre, sizeof( pre ) );
2488 lutil_MD5Update( &MD5context,
2489 syntax->ssyn_oid, slen );
2490 lutil_MD5Update( &MD5context,
2491 mr->smr_oid, mlen );
2492 lutil_MD5Update( &MD5context,
2493 &value->bv_val[j], klen );
2494 lutil_MD5Final( MD5digest, &MD5context );
2496 keys[nkeys++] = ber_bvdup( &digest );
2501 if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
2502 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2504 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2505 value = sa->sa_final;
2507 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2508 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2510 lutil_MD5Init( &MD5context );
2511 if( prefix != NULL && prefix->bv_len > 0 ) {
2512 lutil_MD5Update( &MD5context,
2513 prefix->bv_val, prefix->bv_len );
2515 lutil_MD5Update( &MD5context,
2516 &pre, sizeof( pre ) );
2517 lutil_MD5Update( &MD5context,
2518 syntax->ssyn_oid, slen );
2519 lutil_MD5Update( &MD5context,
2520 mr->smr_oid, mlen );
2521 lutil_MD5Update( &MD5context,
2522 &value->bv_val[value->bv_len-klen], klen );
2523 lutil_MD5Final( MD5digest, &MD5context );
2525 keys[nkeys++] = ber_bvdup( &digest );
2536 return LDAP_SUCCESS;
2545 struct berval *value,
2546 void *assertedValue )
2548 int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
2551 match = strncasecmp( value->bv_val,
2552 ((struct berval *) assertedValue)->bv_val,
2557 return LDAP_SUCCESS;
2561 caseIgnoreIA5SubstringsMatch(
2566 struct berval *value,
2567 void *assertedValue )
2570 SubstringsAssertion *sub = assertedValue;
2571 struct berval left = *value;
2575 /* Add up asserted input length */
2576 if( sub->sa_initial ) {
2577 inlen += sub->sa_initial->bv_len;
2580 for(i=0; sub->sa_any[i] != NULL; i++) {
2581 inlen += sub->sa_any[i]->bv_len;
2584 if( sub->sa_final ) {
2585 inlen += sub->sa_final->bv_len;
2588 if( sub->sa_initial ) {
2589 if( inlen > left.bv_len ) {
2594 match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
2595 sub->sa_initial->bv_len );
2601 left.bv_val += sub->sa_initial->bv_len;
2602 left.bv_len -= sub->sa_initial->bv_len;
2603 inlen -= sub->sa_initial->bv_len;
2606 if( sub->sa_final ) {
2607 if( inlen > left.bv_len ) {
2612 match = strncasecmp( sub->sa_final->bv_val,
2613 &left.bv_val[left.bv_len - sub->sa_final->bv_len],
2614 sub->sa_final->bv_len );
2620 left.bv_len -= sub->sa_final->bv_len;
2621 inlen -= sub->sa_final->bv_len;
2625 for(i=0; sub->sa_any[i]; i++) {
2630 if( inlen > left.bv_len ) {
2631 /* not enough length */
2636 if( sub->sa_any[i]->bv_len == 0 ) {
2640 p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
2647 idx = p - left.bv_val;
2648 assert( idx < left.bv_len );
2650 if( idx >= left.bv_len ) {
2651 /* this shouldn't happen */
2658 if( sub->sa_any[i]->bv_len > left.bv_len ) {
2659 /* not enough left */
2664 match = strncasecmp( left.bv_val,
2665 sub->sa_any[i]->bv_val,
2666 sub->sa_any[i]->bv_len );
2675 left.bv_val += sub->sa_any[i]->bv_len;
2676 left.bv_len -= sub->sa_any[i]->bv_len;
2677 inlen -= sub->sa_any[i]->bv_len;
2683 return LDAP_SUCCESS;
2686 /* Index generation function */
2687 int caseIgnoreIA5Indexer(
2692 struct berval *prefix,
2693 struct berval **values,
2694 struct berval ***keysp )
2698 struct berval **keys;
2699 lutil_MD5_CTX MD5context;
2700 unsigned char MD5digest[16];
2701 struct berval digest;
2702 digest.bv_val = MD5digest;
2703 digest.bv_len = sizeof(MD5digest);
2705 for( i=0; values[i] != NULL; i++ ) {
2706 /* just count them */
2711 keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
2713 slen = strlen( syntax->ssyn_oid );
2714 mlen = strlen( mr->smr_oid );
2716 for( i=0; values[i] != NULL; i++ ) {
2717 struct berval *value = ber_bvdup( values[i] );
2718 ldap_pvt_str2upper( value->bv_val );
2720 lutil_MD5Init( &MD5context );
2721 if( prefix != NULL && prefix->bv_len > 0 ) {
2722 lutil_MD5Update( &MD5context,
2723 prefix->bv_val, prefix->bv_len );
2725 lutil_MD5Update( &MD5context,
2726 syntax->ssyn_oid, slen );
2727 lutil_MD5Update( &MD5context,
2728 mr->smr_oid, mlen );
2729 lutil_MD5Update( &MD5context,
2730 value->bv_val, value->bv_len );
2731 lutil_MD5Final( MD5digest, &MD5context );
2733 ber_bvfree( value );
2735 keys[i] = ber_bvdup( &digest );
2740 return LDAP_SUCCESS;
2743 /* Index generation function */
2744 int caseIgnoreIA5Filter(
2749 struct berval *prefix,
2751 struct berval ***keysp )
2754 struct berval **keys;
2755 lutil_MD5_CTX MD5context;
2756 unsigned char MD5digest[LUTIL_MD5_BYTES];
2757 struct berval *value;
2758 struct berval digest;
2759 digest.bv_val = MD5digest;
2760 digest.bv_len = sizeof(MD5digest);
2762 slen = strlen( syntax->ssyn_oid );
2763 mlen = strlen( mr->smr_oid );
2765 value = ber_bvdup( (struct berval *) assertValue );
2766 ldap_pvt_str2upper( value->bv_val );
2768 keys = ch_malloc( sizeof( struct berval * ) * 2 );
2770 lutil_MD5Init( &MD5context );
2771 if( prefix != NULL && prefix->bv_len > 0 ) {
2772 lutil_MD5Update( &MD5context,
2773 prefix->bv_val, prefix->bv_len );
2775 lutil_MD5Update( &MD5context,
2776 syntax->ssyn_oid, slen );
2777 lutil_MD5Update( &MD5context,
2778 mr->smr_oid, mlen );
2779 lutil_MD5Update( &MD5context,
2780 value->bv_val, value->bv_len );
2781 lutil_MD5Final( MD5digest, &MD5context );
2783 keys[0] = ber_bvdup( &digest );
2786 ber_bvfree( value );
2790 return LDAP_SUCCESS;
2793 /* Substrings Index generation function */
2794 int caseIgnoreIA5SubstringsIndexer(
2799 struct berval *prefix,
2800 struct berval **values,
2801 struct berval ***keysp )
2805 struct berval **keys;
2806 lutil_MD5_CTX MD5context;
2807 unsigned char MD5digest[16];
2808 struct berval digest;
2809 digest.bv_val = MD5digest;
2810 digest.bv_len = sizeof(MD5digest);
2813 for( i=0; values[i] != NULL; i++ ) {
2814 /* count number of indices to generate */
2815 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2819 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2820 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2821 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2822 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2824 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2828 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2829 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2830 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2834 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2835 if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2836 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2837 ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2839 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2846 /* no keys to generate */
2848 return LDAP_SUCCESS;
2851 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2853 slen = strlen( syntax->ssyn_oid );
2854 mlen = strlen( mr->smr_oid );
2857 for( i=0; values[i] != NULL; i++ ) {
2859 struct berval *value;
2861 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2863 value = ber_bvdup( values[i] );
2864 ldap_pvt_str2upper( value->bv_val );
2866 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2867 ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2869 char pre = SLAP_INDEX_SUBSTR_PREFIX;
2870 max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2872 for( j=0; j<max; j++ ) {
2873 lutil_MD5Init( &MD5context );
2874 if( prefix != NULL && prefix->bv_len > 0 ) {
2875 lutil_MD5Update( &MD5context,
2876 prefix->bv_val, prefix->bv_len );
2879 lutil_MD5Update( &MD5context,
2880 &pre, sizeof( pre ) );
2881 lutil_MD5Update( &MD5context,
2882 syntax->ssyn_oid, slen );
2883 lutil_MD5Update( &MD5context,
2884 mr->smr_oid, mlen );
2885 lutil_MD5Update( &MD5context,
2887 SLAP_INDEX_SUBSTR_MAXLEN );
2888 lutil_MD5Final( MD5digest, &MD5context );
2890 keys[nkeys++] = ber_bvdup( &digest );
2894 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2895 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2897 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2900 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2901 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2902 lutil_MD5Init( &MD5context );
2903 if( prefix != NULL && prefix->bv_len > 0 ) {
2904 lutil_MD5Update( &MD5context,
2905 prefix->bv_val, prefix->bv_len );
2907 lutil_MD5Update( &MD5context,
2908 &pre, sizeof( pre ) );
2909 lutil_MD5Update( &MD5context,
2910 syntax->ssyn_oid, slen );
2911 lutil_MD5Update( &MD5context,
2912 mr->smr_oid, mlen );
2913 lutil_MD5Update( &MD5context,
2915 lutil_MD5Final( MD5digest, &MD5context );
2917 keys[nkeys++] = ber_bvdup( &digest );
2920 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2921 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2922 lutil_MD5Init( &MD5context );
2923 if( prefix != NULL && prefix->bv_len > 0 ) {
2924 lutil_MD5Update( &MD5context,
2925 prefix->bv_val, prefix->bv_len );
2927 lutil_MD5Update( &MD5context,
2928 &pre, sizeof( pre ) );
2929 lutil_MD5Update( &MD5context,
2930 syntax->ssyn_oid, slen );
2931 lutil_MD5Update( &MD5context,
2932 mr->smr_oid, mlen );
2933 lutil_MD5Update( &MD5context,
2934 &value->bv_val[value->bv_len-j], j );
2935 lutil_MD5Final( MD5digest, &MD5context );
2937 keys[nkeys++] = ber_bvdup( &digest );
2942 ber_bvfree( value );
2953 return LDAP_SUCCESS;
2956 int caseIgnoreIA5SubstringsFilter(
2961 struct berval *prefix,
2963 struct berval ***keysp )
2965 SubstringsAssertion *sa = assertValue;
2967 ber_len_t nkeys = 0;
2968 size_t slen, mlen, klen;
2969 struct berval **keys;
2970 lutil_MD5_CTX MD5context;
2971 unsigned char MD5digest[LUTIL_MD5_BYTES];
2972 struct berval *value;
2973 struct berval digest;
2975 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
2976 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2981 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
2983 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2984 if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2985 /* don't bother accounting for stepping */
2986 nkeys += sa->sa_any[i]->bv_len -
2987 ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2992 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
2993 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3000 return LDAP_SUCCESS;
3003 digest.bv_val = MD5digest;
3004 digest.bv_len = sizeof(MD5digest);
3006 slen = strlen( syntax->ssyn_oid );
3007 mlen = strlen( mr->smr_oid );
3009 keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
3012 if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
3013 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3015 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3016 value = ber_bvdup( sa->sa_initial );
3017 ldap_pvt_str2upper( value->bv_val );
3019 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3020 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3022 lutil_MD5Init( &MD5context );
3023 if( prefix != NULL && prefix->bv_len > 0 ) {
3024 lutil_MD5Update( &MD5context,
3025 prefix->bv_val, prefix->bv_len );
3027 lutil_MD5Update( &MD5context,
3028 &pre, sizeof( pre ) );
3029 lutil_MD5Update( &MD5context,
3030 syntax->ssyn_oid, slen );
3031 lutil_MD5Update( &MD5context,
3032 mr->smr_oid, mlen );
3033 lutil_MD5Update( &MD5context,
3034 value->bv_val, klen );
3035 lutil_MD5Final( MD5digest, &MD5context );
3037 ber_bvfree( value );
3038 keys[nkeys++] = ber_bvdup( &digest );
3041 if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3043 pre = SLAP_INDEX_SUBSTR_PREFIX;
3044 klen = SLAP_INDEX_SUBSTR_MAXLEN;
3046 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3047 if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
3051 value = ber_bvdup( sa->sa_any[i] );
3052 ldap_pvt_str2upper( value->bv_val );
3055 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
3056 j += SLAP_INDEX_SUBSTR_STEP )
3058 lutil_MD5Init( &MD5context );
3059 if( prefix != NULL && prefix->bv_len > 0 ) {
3060 lutil_MD5Update( &MD5context,
3061 prefix->bv_val, prefix->bv_len );
3063 lutil_MD5Update( &MD5context,
3064 &pre, sizeof( pre ) );
3065 lutil_MD5Update( &MD5context,
3066 syntax->ssyn_oid, slen );
3067 lutil_MD5Update( &MD5context,
3068 mr->smr_oid, mlen );
3069 lutil_MD5Update( &MD5context,
3070 &value->bv_val[j], klen );
3071 lutil_MD5Final( MD5digest, &MD5context );
3073 keys[nkeys++] = ber_bvdup( &digest );
3076 ber_bvfree( value );
3080 if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
3081 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3083 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3084 value = ber_bvdup( sa->sa_final );
3085 ldap_pvt_str2upper( value->bv_val );
3087 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3088 ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3090 lutil_MD5Init( &MD5context );
3091 if( prefix != NULL && prefix->bv_len > 0 ) {
3092 lutil_MD5Update( &MD5context,
3093 prefix->bv_val, prefix->bv_len );
3095 lutil_MD5Update( &MD5context,
3096 &pre, sizeof( pre ) );
3097 lutil_MD5Update( &MD5context,
3098 syntax->ssyn_oid, slen );
3099 lutil_MD5Update( &MD5context,
3100 mr->smr_oid, mlen );
3101 lutil_MD5Update( &MD5context,
3102 &value->bv_val[value->bv_len-klen], klen );
3103 lutil_MD5Final( MD5digest, &MD5context );
3105 ber_bvfree( value );
3106 keys[nkeys++] = ber_bvdup( &digest );
3117 return LDAP_SUCCESS;
3121 numericStringNormalize(
3124 struct berval **normalized )
3126 /* similiar to IA5StringNormalize except removes all spaces */
3127 struct berval *newval;
3130 newval = ch_malloc( sizeof( struct berval ) );
3134 /* Ignore initial whitespace */
3135 while ( ASCII_SPACE( *p ) ) {
3141 return LDAP_INVALID_SYNTAX;
3144 newval->bv_val = ch_strdup( p );
3145 p = q = newval->bv_val;
3148 if ( ASCII_SPACE( *p ) ) {
3149 /* Ignore whitespace */
3156 assert( *newval->bv_val );
3157 assert( newval->bv_val < p );
3160 /* cannot start with a space */
3161 assert( !ASCII_SPACE(*newval->bv_val) );
3163 /* cannot end with a space */
3164 assert( !ASCII_SPACE( q[-1] ) );
3166 /* null terminate */
3169 newval->bv_len = q - newval->bv_val;
3170 *normalized = newval;
3172 return LDAP_SUCCESS;
3176 objectIdentifierFirstComponentMatch(
3181 struct berval *value,
3182 void *assertedValue )
3184 int rc = LDAP_SUCCESS;
3186 struct berval *asserted = (struct berval *) assertedValue;
3190 if( value->bv_len == 0 || value->bv_val[0] != '(' /*')'*/ ) {
3191 return LDAP_INVALID_SYNTAX;
3194 /* trim leading white space */
3195 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
3199 /* grab next word */
3200 oid.bv_val = &value->bv_val[i];
3201 oid.bv_len = value->bv_len - i;
3202 for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
3207 /* insert attributeTypes, objectclass check here */
3208 if( OID_LEADCHAR(asserted->bv_val[0]) ) {
3209 rc = objectIdentifierMatch( &match, flags, syntax, mr, &oid, asserted );
3212 char *stored = ch_malloc( oid.bv_len + 1 );
3213 AC_MEMCPY( stored, oid.bv_val, oid.bv_len );
3214 stored[oid.bv_len] = '\0';
3216 if ( !strcmp( syntax->ssyn_oid, SLAP_SYNTAX_MATCHINGRULES_OID ) ) {
3217 MatchingRule *asserted_mr = mr_find( asserted->bv_val );
3218 MatchingRule *stored_mr = mr_find( stored );
3220 if( asserted_mr == NULL ) {
3221 rc = SLAPD_COMPARE_UNDEFINED;
3223 match = asserted_mr != stored_mr;
3226 } else if ( !strcmp( syntax->ssyn_oid,
3227 SLAP_SYNTAX_ATTRIBUTETYPES_OID ) )
3229 AttributeType *asserted_at = at_find( asserted->bv_val );
3230 AttributeType *stored_at = at_find( stored );
3232 if( asserted_at == NULL ) {
3233 rc = SLAPD_COMPARE_UNDEFINED;
3235 match = asserted_at != stored_at;
3238 } else if ( !strcmp( syntax->ssyn_oid,
3239 SLAP_SYNTAX_OBJECTCLASSES_OID ) )
3241 ObjectClass *asserted_oc = oc_find( asserted->bv_val );
3242 ObjectClass *stored_oc = oc_find( stored );
3244 if( asserted_oc == NULL ) {
3245 rc = SLAPD_COMPARE_UNDEFINED;
3247 match = asserted_oc != stored_oc;
3254 Debug( LDAP_DEBUG_ARGS, "objectIdentifierFirstComponentMatch "
3255 "%d\n\t\"%s\"\n\t\"%s\"\n",
3256 match, value->bv_val, asserted->bv_val );
3258 if( rc == LDAP_SUCCESS ) *matchp = match;
3263 check_time_syntax (struct berval *val,
3267 static int ceiling[9] = { 99, 99, 11, 30, 23, 59, 59, 12, 59 };
3268 static int mdays[2][12] = {
3269 /* non-leap years */
3270 { 30, 27, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 },
3272 { 30, 28, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 }
3275 int part, c, tzoffset, leapyear = 0 ;
3277 if( val->bv_len == 0 ) {
3278 return LDAP_INVALID_SYNTAX;
3281 p = (char *)val->bv_val;
3282 e = p + val->bv_len;
3284 /* Ignore initial whitespace */
3285 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3289 if (e - p < 13 - (2 * start)) {
3290 return LDAP_INVALID_SYNTAX;
3293 for (part = 0; part < 9; part++) {
3297 for (part = start; part < 7; part++) {
3299 if ((part == 6) && (c == 'Z' || c == '+' || c == '-')) {
3306 return LDAP_INVALID_SYNTAX;
3308 if (c < 0 || c > 9) {
3309 return LDAP_INVALID_SYNTAX;
3315 return LDAP_INVALID_SYNTAX;
3317 if (c < 0 || c > 9) {
3318 return LDAP_INVALID_SYNTAX;
3323 if (part == 2 || part == 3) {
3326 if (parts[part] < 0) {
3327 return LDAP_INVALID_SYNTAX;
3329 if (parts[part] > ceiling[part]) {
3330 return LDAP_INVALID_SYNTAX;
3334 /* leapyear check for the Gregorian calendar (year>1581) */
3335 if (((parts[1] % 4 == 0) && (parts[1] != 0)) ||
3336 ((parts[0] % 4 == 0) && (parts[1] == 0)))
3341 if (parts[3] > mdays[leapyear][parts[2]]) {
3342 return LDAP_INVALID_SYNTAX;
3347 tzoffset = 0; /* UTC */
3348 } else if (c != '+' && c != '-') {
3349 return LDAP_INVALID_SYNTAX;
3353 } else /* c == '+' */ {
3358 return LDAP_INVALID_SYNTAX;
3361 for (part = 7; part < 9; part++) {
3363 if (c < 0 || c > 9) {
3364 return LDAP_INVALID_SYNTAX;
3369 if (c < 0 || c > 9) {
3370 return LDAP_INVALID_SYNTAX;
3374 if (parts[part] < 0 || parts[part] > ceiling[part]) {
3375 return LDAP_INVALID_SYNTAX;
3380 /* Ignore trailing whitespace */
3381 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3385 return LDAP_INVALID_SYNTAX;
3388 switch ( tzoffset ) {
3389 case -1: /* negativ offset to UTC, ie west of Greenwich */
3390 parts[4] += parts[7];
3391 parts[5] += parts[8];
3392 for (part = 6; --part > 0; ) { /* offset is just hhmm, no seconds */
3396 c = mdays[leapyear][parts[2]];
3398 if (parts[part] > c) {
3399 parts[part] -= c + 1;
3404 case 1: /* positive offset to UTC, ie east of Greenwich */
3405 parts[4] -= parts[7];
3406 parts[5] -= parts[8];
3407 for (part = 6; --part > 0; ) {
3411 /* first arg to % needs to be non negativ */
3412 c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
3414 if (parts[part] < 0) {
3415 parts[part] += c + 1;
3420 case 0: /* already UTC */
3424 return LDAP_SUCCESS;
3431 struct berval **normalized )
3436 rc = check_time_syntax(val, 1, parts);
3437 if (rc != LDAP_SUCCESS) {
3442 out = ch_malloc( sizeof(struct berval) );
3444 return LBER_ERROR_MEMORY;
3447 out->bv_val = ch_malloc( 14 );
3448 if ( out->bv_val == NULL ) {
3450 return LBER_ERROR_MEMORY;
3453 sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ldZ",
3454 parts[1], parts[2] + 1, parts[3] + 1,
3455 parts[4], parts[5], parts[6] );
3459 return LDAP_SUCCESS;
3469 return check_time_syntax(in, 1, parts);
3473 generalizedTimeValidate(
3479 return check_time_syntax(in, 0, parts);
3483 generalizedTimeNormalize(
3486 struct berval **normalized )
3491 rc = check_time_syntax(val, 0, parts);
3492 if (rc != LDAP_SUCCESS) {
3497 out = ch_malloc( sizeof(struct berval) );
3499 return LBER_ERROR_MEMORY;
3502 out->bv_val = ch_malloc( 16 );
3503 if ( out->bv_val == NULL ) {
3505 return LBER_ERROR_MEMORY;
3508 sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ld%02ldZ",
3509 parts[0], parts[1], parts[2] + 1, parts[3] + 1,
3510 parts[4], parts[5], parts[6] );
3514 return LDAP_SUCCESS;
3518 nisNetgroupTripleValidate(
3520 struct berval *val )
3525 if ( val->bv_len == 0 ) {
3526 return LDAP_INVALID_SYNTAX;
3529 p = (char *)val->bv_val;
3530 e = p + val->bv_len;
3533 /* syntax does not allow leading white space */
3534 /* Ignore initial whitespace */
3535 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3540 if ( *p != '(' /*')'*/ ) {
3541 return LDAP_INVALID_SYNTAX;
3544 for ( p++; ( p < e ) && ( *p != ')' ); p++ ) {
3548 return LDAP_INVALID_SYNTAX;
3551 } else if ( !ATTR_CHAR( *p ) ) {
3552 return LDAP_INVALID_SYNTAX;
3556 if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
3557 return LDAP_INVALID_SYNTAX;
3563 /* syntax does not allow trailing white space */
3564 /* Ignore trailing whitespace */
3565 while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3571 return LDAP_INVALID_SYNTAX;
3574 return LDAP_SUCCESS;
3578 bootParameterValidate(
3580 struct berval *val )
3584 if ( val->bv_len == 0 ) {
3585 return LDAP_INVALID_SYNTAX;
3588 p = (char *)val->bv_val;
3589 e = p + val->bv_len;
3592 for (; ( p < e ) && ( *p != '=' ); p++ ) {
3593 if ( !ATTR_CHAR( *p ) ) {
3594 return LDAP_INVALID_SYNTAX;
3599 return LDAP_INVALID_SYNTAX;
3603 for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
3604 if ( !ATTR_CHAR( *p ) ) {
3605 return LDAP_INVALID_SYNTAX;
3610 return LDAP_INVALID_SYNTAX;
3614 for ( p++; p < e; p++ ) {
3615 if ( !ATTR_CHAR( *p ) ) {
3616 return LDAP_INVALID_SYNTAX;
3620 return LDAP_SUCCESS;
3623 struct syntax_defs_rec {
3626 slap_syntax_validate_func *sd_validate;
3627 slap_syntax_transform_func *sd_normalize;
3628 slap_syntax_transform_func *sd_pretty;
3629 #ifdef SLAPD_BINARY_CONVERSION
3630 slap_syntax_transform_func *sd_ber2str;
3631 slap_syntax_transform_func *sd_str2ber;
3635 #define X_HIDE "X-HIDE 'TRUE' "
3636 #define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
3637 #define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
3639 struct syntax_defs_rec syntax_defs[] = {
3640 {"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' " X_BINARY X_NOT_H_R ")",
3641 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
3642 {"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
3643 0, NULL, NULL, NULL},
3644 {"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
3645 0, NULL, NULL, NULL},
3646 {"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' " X_NOT_H_R ")",
3647 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
3648 {"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' " X_BINARY X_NOT_H_R ")",
3649 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3650 {"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
3651 0, bitStringValidate, NULL, NULL },
3652 {"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
3653 0, booleanValidate, NULL, NULL},
3654 {"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
3655 X_BINARY X_NOT_H_R ")",
3656 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3657 {"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
3658 X_BINARY X_NOT_H_R ")",
3659 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3660 {"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
3661 X_BINARY X_NOT_H_R ")",
3662 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3663 {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
3664 0, NULL, NULL, NULL},
3665 {"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
3666 0, dnValidate, dnNormalize, dnPretty},
3667 {"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
3668 0, NULL, NULL, NULL},
3669 {"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
3670 0, NULL, NULL, NULL},
3671 {"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
3672 0, UTF8StringValidate, UTF8StringNormalize, NULL},
3673 {"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
3674 0, NULL, NULL, NULL},
3675 {"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
3676 0, NULL, NULL, NULL},
3677 {"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
3678 0, NULL, NULL, NULL},
3679 {"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
3680 0, NULL, NULL, NULL},
3681 {"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
3682 0, NULL, NULL, NULL},
3683 {"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
3684 0, IA5StringValidate, faxNumberNormalize, NULL},
3685 {"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
3686 SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
3687 {"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
3688 0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
3689 {"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
3690 0, NULL, NULL, NULL},
3691 {"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
3692 0, IA5StringValidate, IA5StringNormalize, NULL},
3693 {"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
3694 0, integerValidate, integerNormalize, integerPretty},
3695 {"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
3696 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
3697 {"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
3698 0, NULL, NULL, NULL},
3699 {"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
3700 0, NULL, NULL, NULL},
3701 {"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
3702 0, NULL, NULL, NULL},
3703 {"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
3704 0, NULL, NULL, NULL},
3705 {"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
3706 0, NULL, NULL, NULL},
3707 {"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
3708 0, nameUIDValidate, nameUIDNormalize, NULL},
3709 {"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
3710 0, NULL, NULL, NULL},
3711 {"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
3712 0, IA5StringValidate, numericStringNormalize, NULL},
3713 {"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
3714 0, NULL, NULL, NULL},
3715 {"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
3716 0, oidValidate, NULL, NULL},
3717 {"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
3718 0, NULL, NULL, NULL},
3719 {"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
3720 0, blobValidate, NULL, NULL},
3721 {"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
3722 0, blobValidate, NULL, NULL},
3723 {"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
3724 0, NULL, NULL, NULL},
3725 {"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
3726 0, NULL, NULL, NULL},
3727 {"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
3728 0, printableStringValidate, NULL, NULL},
3729 {"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
3730 X_BINARY X_NOT_H_R ")",
3731 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3732 {"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
3733 0, IA5StringValidate, phoneNumberNormalize, NULL},
3734 {"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
3735 0, NULL, NULL, NULL},
3736 {"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
3737 0, IA5StringValidate, telexNumberNormalize, NULL},
3738 {"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
3739 0, utcTimeValidate, utcTimeNormalize, NULL},
3740 {"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
3741 0, NULL, NULL, NULL},
3742 {"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
3743 0, NULL, NULL, NULL},
3744 {"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
3745 0, NULL, NULL, NULL},
3746 {"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
3747 0, NULL, NULL, NULL},
3748 {"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
3749 0, NULL, NULL, NULL},
3751 /* RFC 2307 NIS Syntaxes */
3752 {"( 1.3.6.1.1.1.0.0 DESC 'RFC2307 NIS Netgroup Triple' )",
3753 0, nisNetgroupTripleValidate, NULL, NULL},
3754 {"( 1.3.6.1.1.1.0.1 DESC 'RFC2307 Boot Parameter' )",
3755 0, bootParameterValidate, NULL, NULL},
3757 /* OpenLDAP Experimental Syntaxes */
3758 {"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
3759 0, IA5StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */,
3761 {"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
3762 0, NULL, NULL, NULL},
3764 /* OpenLDAP Void Syntax */
3765 {"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' " X_HIDE ")" ,
3766 SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
3767 {NULL, 0, NULL, NULL, NULL}
3770 struct mrule_defs_rec {
3772 slap_mask_t mrd_usage;
3773 slap_mr_convert_func * mrd_convert;
3774 slap_mr_normalize_func * mrd_normalize;
3775 slap_mr_match_func * mrd_match;
3776 slap_mr_indexer_func * mrd_indexer;
3777 slap_mr_filter_func * mrd_filter;
3779 char * mrd_associated;
3783 * Other matching rules in X.520 that we do not use (yet):
3785 * 2.5.13.9 numericStringOrderingMatch
3786 * 2.5.13.15 integerOrderingMatch
3787 * 2.5.13.18 octetStringOrderingMatch
3788 * 2.5.13.19 octetStringSubstringsMatch
3789 * 2.5.13.25 uTCTimeMatch
3790 * 2.5.13.26 uTCTimeOrderingMatch
3791 * 2.5.13.31 directoryStringFirstComponentMatch
3792 * 2.5.13.32 wordMatch
3793 * 2.5.13.33 keywordMatch
3794 * 2.5.13.34 certificateExactMatch
3795 * 2.5.13.35 certificateMatch
3796 * 2.5.13.36 certificatePairExactMatch
3797 * 2.5.13.37 certificatePairMatch
3798 * 2.5.13.38 certificateListExactMatch
3799 * 2.5.13.39 certificateListMatch
3800 * 2.5.13.40 algorithmIdentifierMatch
3801 * 2.5.13.41 storedPrefixMatch
3802 * 2.5.13.42 attributeCertificateMatch
3803 * 2.5.13.43 readerAndKeyIDMatch
3804 * 2.5.13.44 attributeIntegrityMatch
3807 struct mrule_defs_rec mrule_defs[] = {
3809 * EQUALITY matching rules must be listed after associated APPROX
3810 * matching rules. So, we list all APPROX matching rules first.
3812 {"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
3813 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3814 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
3816 directoryStringApproxMatch, NULL, NULL,
3819 {"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
3820 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
3821 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
3823 IA5StringApproxMatch, NULL, NULL,
3827 * Other matching rules
3830 {"( 2.5.13.0 NAME 'objectIdentifierMatch' "
3831 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
3832 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3834 objectIdentifierMatch, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
3837 {"( 2.5.13.1 NAME 'distinguishedNameMatch' "
3838 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
3839 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3841 dnMatch, dnIndexer, dnFilter,
3844 {"( 2.5.13.2 NAME 'caseIgnoreMatch' "
3845 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3846 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3848 caseIgnoreMatch, caseIgnoreIndexer, caseIgnoreFilter,
3849 directoryStringApproxMatchOID },
3851 {"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
3852 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3855 caseIgnoreOrderingMatch, NULL, NULL,
3858 {"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
3859 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3860 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3862 caseIgnoreSubstringsMatch,
3863 caseIgnoreSubstringsIndexer,
3864 caseIgnoreSubstringsFilter,
3867 {"( 2.5.13.5 NAME 'caseExactMatch' "
3868 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3869 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3871 caseExactMatch, caseExactIndexer, caseExactFilter,
3872 directoryStringApproxMatchOID },
3874 {"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
3875 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3878 caseExactOrderingMatch, NULL, NULL,
3881 {"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
3882 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3883 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3885 caseExactSubstringsMatch,
3886 caseExactSubstringsIndexer,
3887 caseExactSubstringsFilter,
3890 {"( 2.5.13.8 NAME 'numericStringMatch' "
3891 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
3892 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3894 caseIgnoreIA5Match, NULL, NULL,
3897 {"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
3898 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3899 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3901 caseIgnoreIA5SubstringsMatch,
3902 caseIgnoreIA5SubstringsIndexer,
3903 caseIgnoreIA5SubstringsFilter,
3906 {"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
3907 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
3908 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3910 caseIgnoreListMatch, NULL, NULL,
3913 {"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
3914 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3915 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3917 caseIgnoreListSubstringsMatch, NULL, NULL,
3920 {"( 2.5.13.13 NAME 'booleanMatch' "
3921 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
3922 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3924 booleanMatch, NULL, NULL,
3927 {"( 2.5.13.14 NAME 'integerMatch' "
3928 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
3929 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3931 integerMatch, integerIndexer, integerFilter,
3934 {"( 2.5.13.16 NAME 'bitStringMatch' "
3935 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
3936 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3938 bitStringMatch, NULL, NULL,
3941 {"( 2.5.13.17 NAME 'octetStringMatch' "
3942 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
3943 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3945 octetStringMatch, octetStringIndexer, octetStringFilter,
3948 {"( 2.5.13.20 NAME 'telephoneNumberMatch' "
3949 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
3950 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3952 telephoneNumberMatch, NULL, NULL,
3955 {"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
3956 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3957 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3959 telephoneNumberSubstringsMatch, NULL, NULL,
3962 {"( 2.5.13.22 NAME 'presentationAddressMatch' "
3963 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
3964 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3966 presentationAddressMatch, NULL, NULL,
3969 {"( 2.5.13.23 NAME 'uniqueMemberMatch' "
3970 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
3971 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3973 uniqueMemberMatch, NULL, NULL,
3976 {"( 2.5.13.24 NAME 'protocolInformationMatch' "
3977 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
3978 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3980 protocolInformationMatch, NULL, NULL,
3983 {"( 2.5.13.27 NAME 'generalizedTimeMatch' "
3984 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
3985 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3987 generalizedTimeMatch, NULL, NULL,
3990 {"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
3991 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
3994 generalizedTimeOrderingMatch, NULL, NULL,
3997 {"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
3998 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
3999 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4001 integerFirstComponentMatch, NULL, NULL,
4004 {"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
4005 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4006 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4008 objectIdentifierFirstComponentMatch, NULL, NULL,
4011 {"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
4012 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4013 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4015 caseExactIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
4016 IA5StringApproxMatchOID },
4018 {"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
4019 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4020 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4022 caseIgnoreIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
4023 IA5StringApproxMatchOID },
4025 {"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
4026 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4029 caseIgnoreIA5SubstringsMatch,
4030 caseIgnoreIA5SubstringsIndexer,
4031 caseIgnoreIA5SubstringsFilter,
4034 {"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
4035 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4038 caseExactIA5SubstringsMatch,
4039 caseExactIA5SubstringsIndexer,
4040 caseExactIA5SubstringsFilter,
4043 {"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
4044 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4047 authPasswordMatch, NULL, NULL,
4050 {"( 1.3.6.1.4.1.4203.666.4.2 NAME 'OpenLDAPaciMatch' "
4051 "SYNTAX 1.3.6.1.4.1.4203.666.2.1 )",
4054 OpenLDAPaciMatch, NULL, NULL,
4057 {NULL, SLAP_MR_NONE, NULL, NULL, NULL, NULL}
4066 /* we should only be called once (from main) */
4067 assert( schema_init_done == 0 );
4069 for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
4070 res = register_syntax( syntax_defs[i].sd_desc,
4071 syntax_defs[i].sd_flags,
4072 syntax_defs[i].sd_validate,
4073 syntax_defs[i].sd_normalize,
4074 syntax_defs[i].sd_pretty
4075 #ifdef SLAPD_BINARY_CONVERSION
4077 syntax_defs[i].sd_ber2str,
4078 syntax_defs[i].sd_str2ber
4083 fprintf( stderr, "schema_init: Error registering syntax %s\n",
4084 syntax_defs[i].sd_desc );
4089 for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
4090 if( mrule_defs[i].mrd_usage == SLAP_MR_NONE ) {
4092 "schema_init: Ingoring unusable matching rule %s\n",
4093 mrule_defs[i].mrd_desc );
4097 res = register_matching_rule(
4098 mrule_defs[i].mrd_desc,
4099 mrule_defs[i].mrd_usage,
4100 mrule_defs[i].mrd_convert,
4101 mrule_defs[i].mrd_normalize,
4102 mrule_defs[i].mrd_match,
4103 mrule_defs[i].mrd_indexer,
4104 mrule_defs[i].mrd_filter,
4105 mrule_defs[i].mrd_associated );
4109 "schema_init: Error registering matching rule %s\n",
4110 mrule_defs[i].mrd_desc );
4114 schema_init_done = 1;
4115 return LDAP_SUCCESS;