git.sur5r.net Git - openldap/blob - servers/slapd/schema_init.c

   1 /* schema_init.c - init builtin schema */
   2 /* $OpenLDAP$ */
   3 /*
   4  * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
   5  * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
   6  */
   7
   8 #include "portable.h"
   9
  10 #include <stdio.h>
  11
  12 #include <ac/ctype.h>
  13 #include <ac/string.h>
  14 #include <ac/socket.h>
  15
  16 #include "slap.h"
  17 #include "ldap_pvt.h"
  18 #include "lutil_md5.h"
  19
  20 /* recycled validatation routines */
  21 #define berValidate                                             blobValidate
  22
  23 /* recycled normalization routines */
  24 #define faxNumberNormalize                              numericStringNormalize
  25 #define phoneNumberNormalize                    numericStringNormalize
  26 #define telexNumberNormalize                    numericStringNormalize
  27
  28 /* unimplemented normalizers */
  29 #define bitStringNormalize                              NULL
  30
  31 /* unimplemented pretters */
  32 #define dnPretty                                                NULL
  33 #define integerPretty                                   NULL
  34
  35 /* recycled matching routines */
  36 #define bitStringMatch                                  octetStringMatch
  37 #define integerMatch                                    caseIgnoreIA5Match
  38 #define numericStringMatch                              caseIgnoreMatch
  39 #define objectIdentifierMatch                   numericStringMatch
  40 #define telephoneNumberMatch                    numericStringMatch
  41 #define telephoneNumberSubstringsMatch  caseIgnoreIA5SubstringsMatch
  42 #define generalizedTimeMatch                    numericStringMatch
  43 #define generalizedTimeOrderingMatch    numericStringMatch
  44 #define uniqueMemberMatch                               dnMatch
  45
  46 /* approx matching rules */
  47 #define directoryStringApproxMatchOID   "1.3.6.1.4.1.4203.666.4.4"
  48 #define directoryStringApproxMatch              NULL
  49 #define IA5StringApproxMatchOID                 "1.3.6.1.4.1.4203.666.4.5"
  50 #define IA5StringApproxMatch                    NULL
  51
  52 /* orderring matching rules */
  53 #define caseIgnoreOrderingMatch                 caseIgnoreMatch
  54 #define caseExactOrderingMatch                  caseExactMatch
  55
  56 /* unimplemented matching routines */
  57 #define caseIgnoreListMatch                             NULL
  58 #define caseIgnoreListSubstringsMatch   NULL
  59 #define presentationAddressMatch                NULL
  60 #define protocolInformationMatch                NULL
  61 #define integerFirstComponentMatch              NULL
  62
  63 #define OpenLDAPaciMatch                                NULL
  64 #define authPasswordMatch                               NULL
  65
  66 /* recycled indexing/filtering routines */
  67 #define dnIndexer                                               caseIgnoreIndexer
  68 #define dnFilter                                                caseIgnoreFilter
  69 #define integerIndexer                                  caseIgnoreIA5Indexer
  70 #define integerFilter                                   caseIgnoreIA5Filter
  71
  72 static char *strcasechr( const char *str, int c )
  73 {
  74         char *lower = strchr( str, TOLOWER(c) );
  75         char *upper = strchr( str, TOUPPER(c) );
  76
  77         if( lower && upper ) {
  78                 return lower < upper ? lower : upper;
  79         } else if ( lower ) {
  80                 return lower;
  81         } else {
  82                 return upper;
  83         }
  84 }
  85
  86 static int
  87 octetStringMatch(
  88         int *matchp,
  89         slap_mask_t flags,
  90         Syntax *syntax,
  91         MatchingRule *mr,
  92         struct berval *value,
  93         void *assertedValue )
  94 {
  95         int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
  96
  97         if( match == 0 ) {
  98                 match = memcmp( value->bv_val,
  99                         ((struct berval *) assertedValue)->bv_val,
 100                         value->bv_len );
 101         }
 102
 103         *matchp = match;
 104         return LDAP_SUCCESS;
 105 }
 106
 107 /* Index generation function */
 108 int octetStringIndexer(
 109         slap_mask_t use,
 110         slap_mask_t flags,
 111         Syntax *syntax,
 112         MatchingRule *mr,
 113         struct berval *prefix,
 114         struct berval **values,
 115         struct berval ***keysp )
 116 {
 117         int i;
 118         size_t slen, mlen;
 119         struct berval **keys;
 120         lutil_MD5_CTX   MD5context;
 121         unsigned char   MD5digest[16];
 122         struct berval digest;
 123         digest.bv_val = MD5digest;
 124         digest.bv_len = sizeof(MD5digest);
 125
 126         for( i=0; values[i] != NULL; i++ ) {
 127                 /* just count them */
 128         }
 129
 130         assert( i > 0 );
 131
 132         keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
 133
 134         slen = strlen( syntax->ssyn_oid );
 135         mlen = strlen( mr->smr_oid );
 136
 137         for( i=0; values[i] != NULL; i++ ) {
 138                 lutil_MD5Init( &MD5context );
 139                 if( prefix != NULL && prefix->bv_len > 0 ) {
 140                         lutil_MD5Update( &MD5context,
 141                                 prefix->bv_val, prefix->bv_len );
 142                 }
 143                 lutil_MD5Update( &MD5context,
 144                         syntax->ssyn_oid, slen );
 145                 lutil_MD5Update( &MD5context,
 146                         mr->smr_oid, mlen );
 147                 lutil_MD5Update( &MD5context,
 148                         values[i]->bv_val, values[i]->bv_len );
 149                 lutil_MD5Final( MD5digest, &MD5context );
 150
 151                 keys[i] = ber_bvdup( &digest );
 152         }
 153
 154         keys[i] = NULL;
 155
 156         *keysp = keys;
 157
 158         return LDAP_SUCCESS;
 159 }
 160
 161 /* Index generation function */
 162 int octetStringFilter(
 163         slap_mask_t use,
 164         slap_mask_t flags,
 165         Syntax *syntax,
 166         MatchingRule *mr,
 167         struct berval *prefix,
 168         void * assertValue,
 169         struct berval ***keysp )
 170 {
 171         size_t slen, mlen;
 172         struct berval **keys;
 173         lutil_MD5_CTX   MD5context;
 174         unsigned char   MD5digest[LUTIL_MD5_BYTES];
 175         struct berval *value = (struct berval *) assertValue;
 176         struct berval digest;
 177         digest.bv_val = MD5digest;
 178         digest.bv_len = sizeof(MD5digest);
 179
 180         slen = strlen( syntax->ssyn_oid );
 181         mlen = strlen( mr->smr_oid );
 182
 183         keys = ch_malloc( sizeof( struct berval * ) * 2 );
 184
 185         lutil_MD5Init( &MD5context );
 186         if( prefix != NULL && prefix->bv_len > 0 ) {
 187                 lutil_MD5Update( &MD5context,
 188                         prefix->bv_val, prefix->bv_len );
 189         }
 190         lutil_MD5Update( &MD5context,
 191                 syntax->ssyn_oid, slen );
 192         lutil_MD5Update( &MD5context,
 193                 mr->smr_oid, mlen );
 194         lutil_MD5Update( &MD5context,
 195                 value->bv_val, value->bv_len );
 196         lutil_MD5Final( MD5digest, &MD5context );
 197
 198         keys[0] = ber_bvdup( &digest );
 199         keys[1] = NULL;
 200
 201         *keysp = keys;
 202
 203         return LDAP_SUCCESS;
 204 }
 205
 206 static int
 207 dnValidate(
 208         Syntax *syntax,
 209         struct berval *in )
 210 {
 211         int rc;
 212         char *dn;
 213
 214         if( in->bv_len == 0 ) return LDAP_SUCCESS;
 215
 216         dn = ch_strdup( in->bv_val );
 217
 218         rc = dn_validate( dn ) == NULL
 219                 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
 220
 221         ch_free( dn );
 222         return rc;
 223 }
 224
 225 static int
 226 dnNormalize(
 227         Syntax *syntax,
 228         struct berval *val,
 229         struct berval **normalized )
 230 {
 231         struct berval *out = ber_bvdup( val );
 232
 233         if( out->bv_len != 0 ) {
 234                 char *dn;
 235 #ifdef USE_DN_NORMALIZE
 236                 dn = dn_normalize( out->bv_val );
 237 #else
 238                 dn = dn_validate( out->bv_val );
 239 #endif
 240
 241                 if( dn == NULL ) {
 242                         ber_bvfree( out );
 243                         return LDAP_INVALID_SYNTAX;
 244                 }
 245
 246                 out->bv_val = dn;
 247                 out->bv_len = strlen( dn );
 248         }
 249
 250         *normalized = out;
 251         return LDAP_SUCCESS;
 252 }
 253
 254 static int
 255 dnMatch(
 256         int *matchp,
 257         slap_mask_t flags,
 258         Syntax *syntax,
 259         MatchingRule *mr,
 260         struct berval *value,
 261         void *assertedValue )
 262 {
 263         int match;
 264         struct berval *asserted = (struct berval *) assertedValue;
 265
 266         match = value->bv_len - asserted->bv_len;
 267
 268         if( match == 0 ) {
 269 #ifdef USE_DN_NORMALIZE
 270                 match = strcmp( value->bv_val, asserted->bv_val );
 271 #else
 272                 match = strcasecmp( value->bv_val, asserted->bv_val );
 273 #endif
 274         }
 275
 276         Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
 277             match, value->bv_val, asserted->bv_val );
 278
 279         *matchp = match;
 280         return LDAP_SUCCESS;
 281 }
 282
 283 static int
 284 nameUIDValidate(
 285         Syntax *syntax,
 286         struct berval *in )
 287 {
 288         int rc;
 289         struct berval *dn;
 290
 291         if( in->bv_len == 0 ) return LDAP_SUCCESS;
 292
 293         dn = ber_bvdup( in );
 294
 295         if( dn->bv_val[dn->bv_len-1] == '\'' ) {
 296                 /* assume presence of optional UID */
 297                 ber_len_t i;
 298
 299                 for(i=dn->bv_len-2; i>2; i--) {
 300                         if( dn->bv_val[i] != '0' &&     dn->bv_val[i] != '1' ) {
 301                                 break;
 302                         }
 303                 }
 304                 if( dn->bv_val[i] != '\'' ) {
 305                         return LDAP_INVALID_SYNTAX;
 306                 }
 307                 if( dn->bv_val[i-1] != 'B' ) {
 308                         return LDAP_INVALID_SYNTAX;
 309                 }
 310                 if( dn->bv_val[i-2] != '#' ) {
 311                         return LDAP_INVALID_SYNTAX;
 312                 }
 313
 314                 /* trim the UID to allow use of dn_validate */
 315                 dn->bv_val[i-2] = '\0';
 316         }
 317
 318         rc = dn_validate( dn->bv_val ) == NULL
 319                 ? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
 320
 321         ber_bvfree( dn );
 322         return rc;
 323 }
 324
 325 static int
 326 nameUIDNormalize(
 327         Syntax *syntax,
 328         struct berval *val,
 329         struct berval **normalized )
 330 {
 331         struct berval *out = ber_bvdup( val );
 332
 333         if( out->bv_len != 0 ) {
 334                 char *dn;
 335                 ber_len_t dnlen;
 336                 char *uid = NULL;
 337                 ber_len_t uidlen = 0;
 338
 339                 if( out->bv_val[out->bv_len-1] == '\'' ) {
 340                         /* assume presence of optional UID */
 341                         uid = strrchr( out->bv_val, '#' );
 342
 343                         if( uid == NULL ) {
 344                                 ber_bvfree( out );
 345                                 return LDAP_INVALID_SYNTAX;
 346                         }
 347
 348                         uidlen = out->bv_len - (out->bv_val - uid);
 349                         /* temporarily trim the UID */
 350                         *uid = '\0';
 351                 }
 352
 353 #ifdef USE_DN_NORMALIZE
 354                 dn = dn_normalize( out->bv_val );
 355 #else
 356                 dn = dn_validate( out->bv_val );
 357 #endif
 358
 359                 if( dn == NULL ) {
 360                         ber_bvfree( out );
 361                         return LDAP_INVALID_SYNTAX;
 362                 }
 363
 364                 dnlen = strlen(dn);
 365
 366                 if( uidlen ) {
 367                         /* restore the separator */
 368                         *uid = '#';
 369                         /* shift the UID */
 370                         SAFEMEMCPY( &dn[dnlen], uid, uidlen );
 371                 }
 372
 373                 out->bv_val = dn;
 374                 out->bv_len = dnlen + uidlen;
 375         }
 376
 377         *normalized = out;
 378         return LDAP_SUCCESS;
 379 }
 380
 381 static int
 382 inValidate(
 383         Syntax *syntax,
 384         struct berval *in )
 385 {
 386         /* any value allowed */
 387         return LDAP_OTHER;
 388 }
 389
 390 static int
 391 blobValidate(
 392         Syntax *syntax,
 393         struct berval *in )
 394 {
 395         /* any value allowed */
 396         return LDAP_SUCCESS;
 397 }
 398
 399 static int
 400 bitStringValidate(
 401         Syntax *syntax,
 402         struct berval *in )
 403 {
 404         ber_len_t i;
 405
 406         /* very unforgiving validation, requires no normalization
 407          * before simplistic matching
 408          */
 409         if( in->bv_len < 3 ) {
 410                 return LDAP_INVALID_SYNTAX;
 411         }
 412         if( in->bv_val[0] != 'B' ||
 413                 in->bv_val[1] != '\'' ||
 414                 in->bv_val[in->bv_len-1] != '\'' )
 415         {
 416                 return LDAP_INVALID_SYNTAX;
 417         }
 418
 419         for( i=in->bv_len-2; i>1; i-- ) {
 420                 if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
 421                         return LDAP_INVALID_SYNTAX;
 422                 }
 423         }
 424
 425         return LDAP_SUCCESS;
 426 }
 427
 428 /*
 429  * Handling boolean syntax and matching is quite rigid.
 430  * A more flexible approach would be to allow a variety
 431  * of strings to be normalized and prettied into TRUE
 432  * and FALSE.
 433  */
 434 static int
 435 booleanValidate(
 436         Syntax *syntax,
 437         struct berval *in )
 438 {
 439         /* very unforgiving validation, requires no normalization
 440          * before simplistic matching
 441          */
 442
 443         if( in->bv_len == 4 ) {
 444                 if( !memcmp( in->bv_val, "TRUE", 4 ) ) {
 445                         return LDAP_SUCCESS;
 446                 }
 447         } else if( in->bv_len == 5 ) {
 448                 if( !memcmp( in->bv_val, "FALSE", 5 ) ) {
 449                         return LDAP_SUCCESS;
 450                 }
 451         }
 452
 453         return LDAP_INVALID_SYNTAX;
 454 }
 455
 456 static int
 457 booleanMatch(
 458         int *matchp,
 459         slap_mask_t flags,
 460         Syntax *syntax,
 461         MatchingRule *mr,
 462         struct berval *value,
 463         void *assertedValue )
 464 {
 465         /* simplistic matching allowed by rigid validation */
 466         struct berval *asserted = (struct berval *) assertedValue;
 467         *matchp = value->bv_len != asserted->bv_len;
 468         return LDAP_SUCCESS;
 469 }
 470
 471 #if 0
 472 static int
 473 UTF8casecmp(
 474         struct berval *right,
 475         struct berval *left )
 476 {
 477         ber_len_t r, l;
 478         int rlen, llen;
 479         ldap_unicode_t ru, lu;
 480         ldap_unicode_t ruu, luu;
 481
 482         for( r=0, l=0;
 483                 r < right->bv_len && l < left->bv_len;
 484                 r+=rlen, l+=llen )
 485         {
 486                 /*
 487                  * XXYYZ: we convert to ucs4 even though -llunicode
 488                  * expects ucs2 in an unsigned long
 489                  */
 490                 ru = ldap_utf8_to_ucs4( &right->bv_val[r] );
 491                 if( ru == LDAP_UCS4_INVALID ) {
 492                         return 1;
 493                 }
 494
 495                 lu = ldap_utf8_to_ucs4( &left->bv_val[l] );
 496                 if( lu == LDAP_UCS4_INVALID ) {
 497                         return -1;
 498                 }
 499
 500                 ruu = uctoupper( ru );
 501                 luu = uctoupper( lu );
 502
 503                 if( ruu > luu ) {
 504                         return 1;
 505                 } else if( luu > ruu ) {
 506                         return -1;
 507                 }
 508
 509                 rlen = LDAP_UTF8_CHARLEN( &right->bv_val[r] );
 510                 llen = LDAP_UTF8_CHARLEN( &left->bv_val[l] );
 511         }
 512
 513         if( r < right->bv_len ) {
 514                 /* less left */
 515                 return -1;
 516         }
 517
 518         if( l < left->bv_len ) {
 519                 /* less right */
 520                 return 1;
 521         }
 522
 523         return 0;
 524 }
 525 #endif
 526
 527 static int
 528 UTF8StringValidate(
 529         Syntax *syntax,
 530         struct berval *in )
 531 {
 532         ber_len_t count;
 533         int len;
 534         unsigned char *u = in->bv_val;
 535
 536         if( !in->bv_len ) return LDAP_INVALID_SYNTAX;
 537
 538         for( count = in->bv_len; count > 0; count-=len, u+=len ) {
 539                 /* get the length indicated by the first byte */
 540                 len = LDAP_UTF8_CHARLEN( u );
 541
 542                 /* should not be zero */
 543                 if( len == 0 ) return LDAP_INVALID_SYNTAX;
 544
 545                 /* make sure len corresponds with the offset
 546                         to the next character */
 547                 if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
 548         }
 549
 550         if( count != 0 ) return LDAP_INVALID_SYNTAX;
 551
 552         return LDAP_SUCCESS;
 553 }
 554
 555 static int
 556 UTF8StringNormalize(
 557         Syntax *syntax,
 558         struct berval *val,
 559         struct berval **normalized )
 560 {
 561         struct berval *newval;
 562         char *p, *q, *s;
 563
 564         newval = ch_malloc( sizeof( struct berval ) );
 565
 566         p = val->bv_val;
 567
 568         /* Ignore initial whitespace */
 569         while ( ldap_utf8_isspace( p ) ) {
 570                 LDAP_UTF8_INCR( p );
 571         }
 572
 573         if( *p == '\0' ) {
 574                 ch_free( newval );
 575                 return LDAP_INVALID_SYNTAX;
 576         }
 577
 578         newval->bv_val = ch_strdup( p );
 579         p = q = newval->bv_val;
 580         s = NULL;
 581
 582         while ( *p ) {
 583                 int len;
 584
 585                 if ( ldap_utf8_isspace( p ) ) {
 586                         len = LDAP_UTF8_COPY(q,p);
 587                         s=q;
 588                         p+=len;
 589                         q+=len;
 590
 591                         /* Ignore the extra whitespace */
 592                         while ( ldap_utf8_isspace( p ) ) {
 593                                 LDAP_UTF8_INCR( p );
 594                         }
 595                 } else {
 596                         len = LDAP_UTF8_COPY(q,p);
 597                         s=NULL;
 598                         p+=len;
 599                         q+=len;
 600                 }
 601         }
 602
 603         assert( *newval->bv_val );
 604         assert( newval->bv_val < p );
 605         assert( p >= q );
 606
 607         /* cannot start with a space */
 608         assert( !ldap_utf8_isspace(newval->bv_val) );
 609
 610         /*
 611          * If the string ended in space, backup the pointer one
 612          * position.  One is enough because the above loop collapsed
 613          * all whitespace to a single space.
 614          */
 615
 616         if ( s != NULL ) {
 617                 q = s;
 618         }
 619
 620         /* cannot end with a space */
 621         assert( !ldap_utf8_isspace( LDAP_UTF8_PREV(q) ) );
 622
 623         /* null terminate */
 624         *q = '\0';
 625
 626         newval->bv_len = q - newval->bv_val;
 627         *normalized = newval;
 628
 629         return LDAP_SUCCESS;
 630 }
 631
 632 static int
 633 caseExactMatch(
 634         int *matchp,
 635         slap_mask_t flags,
 636         Syntax *syntax,
 637         MatchingRule *mr,
 638         struct berval *value,
 639         void *assertedValue )
 640 {
 641         int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
 642
 643         if( match == 0 ) {
 644                 match = strncmp( value->bv_val,
 645                         ((struct berval *) assertedValue)->bv_val,
 646                         value->bv_len );
 647         }
 648
 649         *matchp = match;
 650         return LDAP_SUCCESS;
 651 }
 652
 653 static int
 654 caseExactSubstringsMatch(
 655         int *matchp,
 656         slap_mask_t flags,
 657         Syntax *syntax,
 658         MatchingRule *mr,
 659         struct berval *value,
 660         void *assertedValue )
 661 {
 662         int match = 0;
 663         SubstringsAssertion *sub = assertedValue;
 664         struct berval left = *value;
 665         int i;
 666         ber_len_t inlen=0;
 667
 668         /* Add up asserted input length */
 669         if( sub->sa_initial ) {
 670                 inlen += sub->sa_initial->bv_len;
 671         }
 672         if( sub->sa_any ) {
 673                 for(i=0; sub->sa_any[i] != NULL; i++) {
 674                         inlen += sub->sa_any[i]->bv_len;
 675                 }
 676         }
 677         if( sub->sa_final ) {
 678                 inlen += sub->sa_final->bv_len;
 679         }
 680
 681         if( sub->sa_initial ) {
 682                 if( inlen > left.bv_len ) {
 683                         match = 1;
 684                         goto done;
 685                 }
 686
 687                 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
 688                         sub->sa_initial->bv_len );
 689
 690                 if( match != 0 ) {
 691                         goto done;
 692                 }
 693
 694                 left.bv_val += sub->sa_initial->bv_len;
 695                 left.bv_len -= sub->sa_initial->bv_len;
 696                 inlen -= sub->sa_initial->bv_len;
 697         }
 698
 699         if( sub->sa_final ) {
 700                 if( inlen > left.bv_len ) {
 701                         match = 1;
 702                         goto done;
 703                 }
 704
 705                 match = strncmp( sub->sa_final->bv_val,
 706                         &left.bv_val[left.bv_len - sub->sa_final->bv_len],
 707                         sub->sa_final->bv_len );
 708
 709                 if( match != 0 ) {
 710                         goto done;
 711                 }
 712
 713                 left.bv_len -= sub->sa_final->bv_len;
 714                 inlen -= sub->sa_final->bv_len;
 715         }
 716
 717         if( sub->sa_any ) {
 718                 for(i=0; sub->sa_any[i]; i++) {
 719                         ber_len_t idx;
 720                         char *p;
 721
 722 retry:
 723                         if( inlen > left.bv_len ) {
 724                                 /* not enough length */
 725                                 match = 1;
 726                                 goto done;
 727                         }
 728
 729                         if( sub->sa_any[i]->bv_len == 0 ) {
 730                                 continue;
 731                         }
 732
 733                         p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
 734
 735                         if( p == NULL ) {
 736                                 match = 1;
 737                                 goto done;
 738                         }
 739
 740                         idx = p - left.bv_val;
 741                         assert( idx < left.bv_len );
 742
 743                         if( idx >= left.bv_len ) {
 744                                 /* this shouldn't happen */
 745                                 return LDAP_OTHER;
 746                         }
 747
 748                         left.bv_val = p;
 749                         left.bv_len -= idx;
 750
 751                         if( sub->sa_any[i]->bv_len > left.bv_len ) {
 752                                 /* not enough left */
 753                                 match = 1;
 754                                 goto done;
 755                         }
 756
 757                         match = strncmp( left.bv_val,
 758                                 sub->sa_any[i]->bv_val,
 759                                 sub->sa_any[i]->bv_len );
 760
 761                         if( match != 0 ) {
 762                                 left.bv_val++;
 763                                 left.bv_len--;
 764                                 goto retry;
 765                         }
 766
 767                         left.bv_val += sub->sa_any[i]->bv_len;
 768                         left.bv_len -= sub->sa_any[i]->bv_len;
 769                         inlen -= sub->sa_any[i]->bv_len;
 770                 }
 771         }
 772
 773 done:
 774         *matchp = match;
 775         return LDAP_SUCCESS;
 776 }
 777
 778 /* Index generation function */
 779 int caseExactIndexer(
 780         slap_mask_t use,
 781         slap_mask_t flags,
 782         Syntax *syntax,
 783         MatchingRule *mr,
 784         struct berval *prefix,
 785         struct berval **values,
 786         struct berval ***keysp )
 787 {
 788         int i;
 789         size_t slen, mlen;
 790         struct berval **keys;
 791         lutil_MD5_CTX   MD5context;
 792         unsigned char   MD5digest[16];
 793         struct berval digest;
 794         digest.bv_val = MD5digest;
 795         digest.bv_len = sizeof(MD5digest);
 796
 797         for( i=0; values[i] != NULL; i++ ) {
 798                 /* just count them */
 799         }
 800
 801         assert( i > 0 );
 802
 803         keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
 804
 805         slen = strlen( syntax->ssyn_oid );
 806         mlen = strlen( mr->smr_oid );
 807
 808         for( i=0; values[i] != NULL; i++ ) {
 809                 struct berval *value = values[i];
 810
 811                 lutil_MD5Init( &MD5context );
 812                 if( prefix != NULL && prefix->bv_len > 0 ) {
 813                         lutil_MD5Update( &MD5context,
 814                                 prefix->bv_val, prefix->bv_len );
 815                 }
 816                 lutil_MD5Update( &MD5context,
 817                         syntax->ssyn_oid, slen );
 818                 lutil_MD5Update( &MD5context,
 819                         mr->smr_oid, mlen );
 820                 lutil_MD5Update( &MD5context,
 821                         value->bv_val, value->bv_len );
 822                 lutil_MD5Final( MD5digest, &MD5context );
 823
 824                 keys[i] = ber_bvdup( &digest );
 825         }
 826
 827         keys[i] = NULL;
 828         *keysp = keys;
 829         return LDAP_SUCCESS;
 830 }
 831
 832 /* Index generation function */
 833 int caseExactFilter(
 834         slap_mask_t use,
 835         slap_mask_t flags,
 836         Syntax *syntax,
 837         MatchingRule *mr,
 838         struct berval *prefix,
 839         void * assertValue,
 840         struct berval ***keysp )
 841 {
 842         size_t slen, mlen;
 843         struct berval **keys;
 844         lutil_MD5_CTX   MD5context;
 845         unsigned char   MD5digest[LUTIL_MD5_BYTES];
 846         struct berval *value;
 847         struct berval digest;
 848         digest.bv_val = MD5digest;
 849         digest.bv_len = sizeof(MD5digest);
 850
 851         slen = strlen( syntax->ssyn_oid );
 852         mlen = strlen( mr->smr_oid );
 853
 854         value = (struct berval *) assertValue;
 855
 856         keys = ch_malloc( sizeof( struct berval * ) * 2 );
 857
 858         lutil_MD5Init( &MD5context );
 859         if( prefix != NULL && prefix->bv_len > 0 ) {
 860                 lutil_MD5Update( &MD5context,
 861                         prefix->bv_val, prefix->bv_len );
 862         }
 863         lutil_MD5Update( &MD5context,
 864                 syntax->ssyn_oid, slen );
 865         lutil_MD5Update( &MD5context,
 866                 mr->smr_oid, mlen );
 867         lutil_MD5Update( &MD5context,
 868                 value->bv_val, value->bv_len );
 869         lutil_MD5Final( MD5digest, &MD5context );
 870
 871         keys[0] = ber_bvdup( &digest );
 872         keys[1] = NULL;
 873
 874         *keysp = keys;
 875         return LDAP_SUCCESS;
 876 }
 877
 878 /* Substrings Index generation function */
 879 int caseExactSubstringsIndexer(
 880         slap_mask_t use,
 881         slap_mask_t flags,
 882         Syntax *syntax,
 883         MatchingRule *mr,
 884         struct berval *prefix,
 885         struct berval **values,
 886         struct berval ***keysp )
 887 {
 888         ber_len_t i, nkeys;
 889         size_t slen, mlen;
 890         struct berval **keys;
 891         lutil_MD5_CTX   MD5context;
 892         unsigned char   MD5digest[16];
 893         struct berval digest;
 894         digest.bv_val = MD5digest;
 895         digest.bv_len = sizeof(MD5digest);
 896
 897         nkeys=0;
 898         for( i=0; values[i] != NULL; i++ ) {
 899                 /* count number of indices to generate */
 900                 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
 901                         continue;
 902                 }
 903
 904                 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
 905                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
 906                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
 907                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
 908                         } else {
 909                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
 910                         }
 911                 }
 912
 913                 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
 914                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
 915                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
 916                         }
 917                 }
 918
 919                 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
 920                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
 921                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
 922                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
 923                         } else {
 924                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
 925                         }
 926                 }
 927         }
 928         assert( i > 0 );
 929
 930         if( nkeys == 0 ) {
 931                 /* no keys to generate */
 932                 *keysp = NULL;
 933                 return LDAP_SUCCESS;
 934         }
 935
 936         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
 937
 938         slen = strlen( syntax->ssyn_oid );
 939         mlen = strlen( mr->smr_oid );
 940
 941         nkeys=0;
 942         for( i=0; values[i] != NULL; i++ ) {
 943                 ber_len_t j,max;
 944                 struct berval *value;
 945
 946                 value = values[i];
 947                 if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
 948
 949                 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
 950                         ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
 951                 {
 952                         char pre = SLAP_INDEX_SUBSTR_PREFIX;
 953                         max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
 954
 955                         for( j=0; j<max; j++ ) {
 956                                 lutil_MD5Init( &MD5context );
 957                                 if( prefix != NULL && prefix->bv_len > 0 ) {
 958                                         lutil_MD5Update( &MD5context,
 959                                                 prefix->bv_val, prefix->bv_len );
 960                                 }
 961
 962                                 lutil_MD5Update( &MD5context,
 963                                         &pre, sizeof( pre ) );
 964                                 lutil_MD5Update( &MD5context,
 965                                         syntax->ssyn_oid, slen );
 966                                 lutil_MD5Update( &MD5context,
 967                                         mr->smr_oid, mlen );
 968                                 lutil_MD5Update( &MD5context,
 969                                         &value->bv_val[j],
 970                                         SLAP_INDEX_SUBSTR_MAXLEN );
 971                                 lutil_MD5Final( MD5digest, &MD5context );
 972
 973                                 keys[nkeys++] = ber_bvdup( &digest );
 974                         }
 975                 }
 976
 977                 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
 978                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
 979
 980                 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
 981                         char pre;
 982
 983                         if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
 984                                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
 985                                 lutil_MD5Init( &MD5context );
 986                                 if( prefix != NULL && prefix->bv_len > 0 ) {
 987                                         lutil_MD5Update( &MD5context,
 988                                                 prefix->bv_val, prefix->bv_len );
 989                                 }
 990                                 lutil_MD5Update( &MD5context,
 991                                         &pre, sizeof( pre ) );
 992                                 lutil_MD5Update( &MD5context,
 993                                         syntax->ssyn_oid, slen );
 994                                 lutil_MD5Update( &MD5context,
 995                                         mr->smr_oid, mlen );
 996                                 lutil_MD5Update( &MD5context,
 997                                         value->bv_val, j );
 998                                 lutil_MD5Final( MD5digest, &MD5context );
 999
1000                                 keys[nkeys++] = ber_bvdup( &digest );
1001                         }
1002
1003                         if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1004                                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1005                                 lutil_MD5Init( &MD5context );
1006                                 if( prefix != NULL && prefix->bv_len > 0 ) {
1007                                         lutil_MD5Update( &MD5context,
1008                                                 prefix->bv_val, prefix->bv_len );
1009                                 }
1010                                 lutil_MD5Update( &MD5context,
1011                                         &pre, sizeof( pre ) );
1012                                 lutil_MD5Update( &MD5context,
1013                                         syntax->ssyn_oid, slen );
1014                                 lutil_MD5Update( &MD5context,
1015                                         mr->smr_oid, mlen );
1016                                 lutil_MD5Update( &MD5context,
1017                                         &value->bv_val[value->bv_len-j], j );
1018                                 lutil_MD5Final( MD5digest, &MD5context );
1019
1020                                 keys[nkeys++] = ber_bvdup( &digest );
1021                         }
1022
1023                 }
1024         }
1025
1026         if( nkeys > 0 ) {
1027                 keys[nkeys] = NULL;
1028                 *keysp = keys;
1029         } else {
1030                 ch_free( keys );
1031                 *keysp = NULL;
1032         }
1033
1034         return LDAP_SUCCESS;
1035 }
1036
1037 int caseExactSubstringsFilter(
1038         slap_mask_t use,
1039         slap_mask_t flags,
1040         Syntax *syntax,
1041         MatchingRule *mr,
1042         struct berval *prefix,
1043         void * assertValue,
1044         struct berval ***keysp )
1045 {
1046         SubstringsAssertion *sa = assertValue;
1047         char pre;
1048         ber_len_t nkeys = 0;
1049         size_t slen, mlen, klen;
1050         struct berval **keys;
1051         lutil_MD5_CTX   MD5context;
1052         unsigned char   MD5digest[LUTIL_MD5_BYTES];
1053         struct berval *value;
1054         struct berval digest;
1055
1056         if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1057                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1058         {
1059                 nkeys++;
1060         }
1061
1062         if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1063                 ber_len_t i;
1064                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1065                         if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1066                                 /* don't bother accounting for stepping */
1067                                 nkeys += sa->sa_any[i]->bv_len -
1068                                         ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1069                         }
1070                 }
1071         }
1072
1073         if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1074                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1075         {
1076                 nkeys++;
1077         }
1078
1079         if( nkeys == 0 ) {
1080                 *keysp = NULL;
1081                 return LDAP_SUCCESS;
1082         }
1083
1084         digest.bv_val = MD5digest;
1085         digest.bv_len = sizeof(MD5digest);
1086
1087         slen = strlen( syntax->ssyn_oid );
1088         mlen = strlen( mr->smr_oid );
1089
1090         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1091         nkeys = 0;
1092
1093         if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
1094                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1095         {
1096                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1097                 value = sa->sa_initial;
1098
1099                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1100                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1101
1102                 lutil_MD5Init( &MD5context );
1103                 if( prefix != NULL && prefix->bv_len > 0 ) {
1104                         lutil_MD5Update( &MD5context,
1105                                 prefix->bv_val, prefix->bv_len );
1106                 }
1107                 lutil_MD5Update( &MD5context,
1108                         &pre, sizeof( pre ) );
1109                 lutil_MD5Update( &MD5context,
1110                         syntax->ssyn_oid, slen );
1111                 lutil_MD5Update( &MD5context,
1112                         mr->smr_oid, mlen );
1113                 lutil_MD5Update( &MD5context,
1114                         value->bv_val, klen );
1115                 lutil_MD5Final( MD5digest, &MD5context );
1116
1117                 keys[nkeys++] = ber_bvdup( &digest );
1118         }
1119
1120         if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
1121                 ber_len_t i, j;
1122                 pre = SLAP_INDEX_SUBSTR_PREFIX;
1123                 klen = SLAP_INDEX_SUBSTR_MAXLEN;
1124
1125                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1126                         if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
1127                                 continue;
1128                         }
1129
1130                         value = sa->sa_any[i];
1131
1132                         for(j=0;
1133                                 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
1134                                 j += SLAP_INDEX_SUBSTR_STEP )
1135                         {
1136                                 lutil_MD5Init( &MD5context );
1137                                 if( prefix != NULL && prefix->bv_len > 0 ) {
1138                                         lutil_MD5Update( &MD5context,
1139                                                 prefix->bv_val, prefix->bv_len );
1140                                 }
1141                                 lutil_MD5Update( &MD5context,
1142                                         &pre, sizeof( pre ) );
1143                                 lutil_MD5Update( &MD5context,
1144                                         syntax->ssyn_oid, slen );
1145                                 lutil_MD5Update( &MD5context,
1146                                         mr->smr_oid, mlen );
1147                                 lutil_MD5Update( &MD5context,
1148                                         &value->bv_val[j], klen );
1149                                 lutil_MD5Final( MD5digest, &MD5context );
1150
1151                                 keys[nkeys++] = ber_bvdup( &digest );
1152                         }
1153                 }
1154         }
1155
1156         if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
1157                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1158         {
1159                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1160                 value = sa->sa_final;
1161
1162                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1163                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1164
1165                 lutil_MD5Init( &MD5context );
1166                 if( prefix != NULL && prefix->bv_len > 0 ) {
1167                         lutil_MD5Update( &MD5context,
1168                                 prefix->bv_val, prefix->bv_len );
1169                 }
1170                 lutil_MD5Update( &MD5context,
1171                         &pre, sizeof( pre ) );
1172                 lutil_MD5Update( &MD5context,
1173                         syntax->ssyn_oid, slen );
1174                 lutil_MD5Update( &MD5context,
1175                         mr->smr_oid, mlen );
1176                 lutil_MD5Update( &MD5context,
1177                         &value->bv_val[value->bv_len-klen], klen );
1178                 lutil_MD5Final( MD5digest, &MD5context );
1179
1180                 keys[nkeys++] = ber_bvdup( &digest );
1181         }
1182
1183         if( nkeys > 0 ) {
1184                 keys[nkeys] = NULL;
1185                 *keysp = keys;
1186         } else {
1187                 ch_free( keys );
1188                 *keysp = NULL;
1189         }
1190
1191         return LDAP_SUCCESS;
1192 }
1193
1194 static int
1195 caseIgnoreMatch(
1196         int *matchp,
1197         slap_mask_t flags,
1198         Syntax *syntax,
1199         MatchingRule *mr,
1200         struct berval *value,
1201         void *assertedValue )
1202 {
1203 #if 0
1204         *matchp = UTF8casecmp( value, (struct berval *) assertedValue );
1205 #else
1206         int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
1207
1208         if( match == 0 ) {
1209                 match = strncasecmp( value->bv_val,
1210                         ((struct berval *) assertedValue)->bv_val,
1211                         value->bv_len );
1212         }
1213
1214         *matchp = match;
1215 #endif
1216         return LDAP_SUCCESS;
1217 }
1218
1219 static int
1220 caseIgnoreSubstringsMatch(
1221         int *matchp,
1222         slap_mask_t flags,
1223         Syntax *syntax,
1224         MatchingRule *mr,
1225         struct berval *value,
1226         void *assertedValue )
1227 {
1228         int match = 0;
1229         SubstringsAssertion *sub = assertedValue;
1230         struct berval left = *value;
1231         int i;
1232         ber_len_t inlen=0;
1233
1234         /* Add up asserted input length */
1235         if( sub->sa_initial ) {
1236                 inlen += sub->sa_initial->bv_len;
1237         }
1238         if( sub->sa_any ) {
1239                 for(i=0; sub->sa_any[i] != NULL; i++) {
1240                         inlen += sub->sa_any[i]->bv_len;
1241                 }
1242         }
1243         if( sub->sa_final ) {
1244                 inlen += sub->sa_final->bv_len;
1245         }
1246
1247         if( sub->sa_initial ) {
1248                 if( inlen > left.bv_len ) {
1249                         match = 1;
1250                         goto done;
1251                 }
1252
1253                 match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
1254                         sub->sa_initial->bv_len );
1255
1256                 if( match != 0 ) {
1257                         goto done;
1258                 }
1259
1260                 left.bv_val += sub->sa_initial->bv_len;
1261                 left.bv_len -= sub->sa_initial->bv_len;
1262                 inlen -= sub->sa_initial->bv_len;
1263         }
1264
1265         if( sub->sa_final ) {
1266                 if( inlen > left.bv_len ) {
1267                         match = 1;
1268                         goto done;
1269                 }
1270
1271                 match = strncasecmp( sub->sa_final->bv_val,
1272                         &left.bv_val[left.bv_len - sub->sa_final->bv_len],
1273                         sub->sa_final->bv_len );
1274
1275                 if( match != 0 ) {
1276                         goto done;
1277                 }
1278
1279                 left.bv_len -= sub->sa_final->bv_len;
1280                 inlen -= sub->sa_final->bv_len;
1281         }
1282
1283         if( sub->sa_any ) {
1284                 for(i=0; sub->sa_any[i]; i++) {
1285                         ber_len_t idx;
1286                         char *p;
1287
1288 retry:
1289                         if( inlen > left.bv_len ) {
1290                                 /* not enough length */
1291                                 match = 1;
1292                                 goto done;
1293                         }
1294
1295                         if( sub->sa_any[i]->bv_len == 0 ) {
1296                                 continue;
1297                         }
1298
1299                         p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
1300
1301                         if( p == NULL ) {
1302                                 match = 1;
1303                                 goto done;
1304                         }
1305
1306                         idx = p - left.bv_val;
1307                         assert( idx < left.bv_len );
1308
1309                         if( idx >= left.bv_len ) {
1310                                 /* this shouldn't happen */
1311                                 return LDAP_OTHER;
1312                         }
1313
1314                         left.bv_val = p;
1315                         left.bv_len -= idx;
1316
1317                         if( sub->sa_any[i]->bv_len > left.bv_len ) {
1318                                 /* not enough left */
1319                                 match = 1;
1320                                 goto done;
1321                         }
1322
1323                         match = strncasecmp( left.bv_val,
1324                                 sub->sa_any[i]->bv_val,
1325                                 sub->sa_any[i]->bv_len );
1326
1327                         if( match != 0 ) {
1328                                 left.bv_val++;
1329                                 left.bv_len--;
1330
1331                                 goto retry;
1332                         }
1333
1334                         left.bv_val += sub->sa_any[i]->bv_len;
1335                         left.bv_len -= sub->sa_any[i]->bv_len;
1336                         inlen -= sub->sa_any[i]->bv_len;
1337                 }
1338         }
1339
1340 done:
1341         *matchp = match;
1342         return LDAP_SUCCESS;
1343 }
1344
1345 /* Index generation function */
1346 int caseIgnoreIndexer(
1347         slap_mask_t use,
1348         slap_mask_t flags,
1349         Syntax *syntax,
1350         MatchingRule *mr,
1351         struct berval *prefix,
1352         struct berval **values,
1353         struct berval ***keysp )
1354 {
1355         int i;
1356         size_t slen, mlen;
1357         struct berval **keys;
1358         lutil_MD5_CTX   MD5context;
1359         unsigned char   MD5digest[16];
1360         struct berval digest;
1361         digest.bv_val = MD5digest;
1362         digest.bv_len = sizeof(MD5digest);
1363
1364         for( i=0; values[i] != NULL; i++ ) {
1365                 /* just count them */
1366         }
1367
1368         assert( i > 0 );
1369
1370         keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
1371
1372         slen = strlen( syntax->ssyn_oid );
1373         mlen = strlen( mr->smr_oid );
1374
1375         for( i=0; values[i] != NULL; i++ ) {
1376                 struct berval *value = ber_bvdup( values[i] );
1377                 ldap_pvt_str2upper( value->bv_val );
1378
1379                 lutil_MD5Init( &MD5context );
1380                 if( prefix != NULL && prefix->bv_len > 0 ) {
1381                         lutil_MD5Update( &MD5context,
1382                                 prefix->bv_val, prefix->bv_len );
1383                 }
1384                 lutil_MD5Update( &MD5context,
1385                         syntax->ssyn_oid, slen );
1386                 lutil_MD5Update( &MD5context,
1387                         mr->smr_oid, mlen );
1388                 lutil_MD5Update( &MD5context,
1389                         value->bv_val, value->bv_len );
1390                 lutil_MD5Final( MD5digest, &MD5context );
1391
1392                 ber_bvfree( value );
1393
1394                 keys[i] = ber_bvdup( &digest );
1395         }
1396
1397         keys[i] = NULL;
1398         *keysp = keys;
1399         return LDAP_SUCCESS;
1400 }
1401
1402 /* Index generation function */
1403 int caseIgnoreFilter(
1404         slap_mask_t use,
1405         slap_mask_t flags,
1406         Syntax *syntax,
1407         MatchingRule *mr,
1408         struct berval *prefix,
1409         void * assertValue,
1410         struct berval ***keysp )
1411 {
1412         size_t slen, mlen;
1413         struct berval **keys;
1414         lutil_MD5_CTX   MD5context;
1415         unsigned char   MD5digest[LUTIL_MD5_BYTES];
1416         struct berval *value;
1417         struct berval digest;
1418         digest.bv_val = MD5digest;
1419         digest.bv_len = sizeof(MD5digest);
1420
1421         slen = strlen( syntax->ssyn_oid );
1422         mlen = strlen( mr->smr_oid );
1423
1424         value = ber_bvdup( (struct berval *) assertValue );
1425         ldap_pvt_str2upper( value->bv_val );
1426
1427         keys = ch_malloc( sizeof( struct berval * ) * 2 );
1428
1429         lutil_MD5Init( &MD5context );
1430         if( prefix != NULL && prefix->bv_len > 0 ) {
1431                 lutil_MD5Update( &MD5context,
1432                         prefix->bv_val, prefix->bv_len );
1433         }
1434         lutil_MD5Update( &MD5context,
1435                 syntax->ssyn_oid, slen );
1436         lutil_MD5Update( &MD5context,
1437                 mr->smr_oid, mlen );
1438         lutil_MD5Update( &MD5context,
1439                 value->bv_val, value->bv_len );
1440         lutil_MD5Final( MD5digest, &MD5context );
1441
1442         keys[0] = ber_bvdup( &digest );
1443         keys[1] = NULL;
1444
1445         ber_bvfree( value );
1446
1447         *keysp = keys;
1448
1449         return LDAP_SUCCESS;
1450 }
1451
1452 /* Substrings Index generation function */
1453 int caseIgnoreSubstringsIndexer(
1454         slap_mask_t use,
1455         slap_mask_t flags,
1456         Syntax *syntax,
1457         MatchingRule *mr,
1458         struct berval *prefix,
1459         struct berval **values,
1460         struct berval ***keysp )
1461 {
1462         ber_len_t i, nkeys;
1463         size_t slen, mlen;
1464         struct berval **keys;
1465         lutil_MD5_CTX   MD5context;
1466         unsigned char   MD5digest[16];
1467         struct berval digest;
1468         digest.bv_val = MD5digest;
1469         digest.bv_len = sizeof(MD5digest);
1470
1471         nkeys=0;
1472         for( i=0; values[i] != NULL; i++ ) {
1473                 /* count number of indices to generate */
1474                 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
1475                         continue;
1476                 }
1477
1478                 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1479                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1480                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1481                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1482                         } else {
1483                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1484                         }
1485                 }
1486
1487                 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
1488                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1489                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1490                         }
1491                 }
1492
1493                 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1494                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1495                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
1496                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
1497                         } else {
1498                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
1499                         }
1500                 }
1501         }
1502         assert( i > 0 );
1503
1504         if( nkeys == 0 ) {
1505                 /* no keys to generate */
1506                 *keysp = NULL;
1507                 return LDAP_SUCCESS;
1508         }
1509
1510         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1511
1512         slen = strlen( syntax->ssyn_oid );
1513         mlen = strlen( mr->smr_oid );
1514
1515         nkeys=0;
1516         for( i=0; values[i] != NULL; i++ ) {
1517                 int j,max;
1518                 struct berval *value;
1519
1520                 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
1521
1522                 value = ber_bvdup( values[i] );
1523                 ldap_pvt_str2upper( value->bv_val );
1524
1525                 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
1526                         ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
1527                 {
1528                         char pre = SLAP_INDEX_SUBSTR_PREFIX;
1529                         max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
1530
1531                         for( j=0; j<max; j++ ) {
1532                                 lutil_MD5Init( &MD5context );
1533                                 if( prefix != NULL && prefix->bv_len > 0 ) {
1534                                         lutil_MD5Update( &MD5context,
1535                                                 prefix->bv_val, prefix->bv_len );
1536                                 }
1537
1538                                 lutil_MD5Update( &MD5context,
1539                                         &pre, sizeof( pre ) );
1540                                 lutil_MD5Update( &MD5context,
1541                                         syntax->ssyn_oid, slen );
1542                                 lutil_MD5Update( &MD5context,
1543                                         mr->smr_oid, mlen );
1544                                 lutil_MD5Update( &MD5context,
1545                                         &value->bv_val[j],
1546                                         SLAP_INDEX_SUBSTR_MAXLEN );
1547                                 lutil_MD5Final( MD5digest, &MD5context );
1548
1549                                 keys[nkeys++] = ber_bvdup( &digest );
1550                         }
1551                 }
1552
1553                 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1554                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1555
1556                 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
1557                         char pre;
1558
1559                         if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
1560                                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1561                                 lutil_MD5Init( &MD5context );
1562                                 if( prefix != NULL && prefix->bv_len > 0 ) {
1563                                         lutil_MD5Update( &MD5context,
1564                                                 prefix->bv_val, prefix->bv_len );
1565                                 }
1566                                 lutil_MD5Update( &MD5context,
1567                                         &pre, sizeof( pre ) );
1568                                 lutil_MD5Update( &MD5context,
1569                                         syntax->ssyn_oid, slen );
1570                                 lutil_MD5Update( &MD5context,
1571                                         mr->smr_oid, mlen );
1572                                 lutil_MD5Update( &MD5context,
1573                                         value->bv_val, j );
1574                                 lutil_MD5Final( MD5digest, &MD5context );
1575
1576                                 keys[nkeys++] = ber_bvdup( &digest );
1577                         }
1578
1579                         if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
1580                                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1581                                 lutil_MD5Init( &MD5context );
1582                                 if( prefix != NULL && prefix->bv_len > 0 ) {
1583                                         lutil_MD5Update( &MD5context,
1584                                                 prefix->bv_val, prefix->bv_len );
1585                                 }
1586                                 lutil_MD5Update( &MD5context,
1587                                         &pre, sizeof( pre ) );
1588                                 lutil_MD5Update( &MD5context,
1589                                         syntax->ssyn_oid, slen );
1590                                 lutil_MD5Update( &MD5context,
1591                                         mr->smr_oid, mlen );
1592                                 lutil_MD5Update( &MD5context,
1593                                         &value->bv_val[value->bv_len-j], j );
1594                                 lutil_MD5Final( MD5digest, &MD5context );
1595
1596                                 keys[nkeys++] = ber_bvdup( &digest );
1597                         }
1598
1599                 }
1600
1601                 ber_bvfree( value );
1602         }
1603
1604         if( nkeys > 0 ) {
1605                 keys[nkeys] = NULL;
1606                 *keysp = keys;
1607         } else {
1608                 ch_free( keys );
1609                 *keysp = NULL;
1610         }
1611
1612         return LDAP_SUCCESS;
1613 }
1614
1615 int caseIgnoreSubstringsFilter(
1616         slap_mask_t use,
1617         slap_mask_t flags,
1618         Syntax *syntax,
1619         MatchingRule *mr,
1620         struct berval *prefix,
1621         void * assertValue,
1622         struct berval ***keysp )
1623 {
1624         SubstringsAssertion *sa = assertValue;
1625         char pre;
1626         ber_len_t nkeys = 0;
1627         size_t slen, mlen, klen;
1628         struct berval **keys;
1629         lutil_MD5_CTX   MD5context;
1630         unsigned char   MD5digest[LUTIL_MD5_BYTES];
1631         struct berval *value;
1632         struct berval digest;
1633
1634         if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
1635                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1636         {
1637                 nkeys++;
1638         }
1639
1640         if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
1641                 ber_len_t i;
1642                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1643                         if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
1644                                 /* don't bother accounting for stepping */
1645                                 nkeys += sa->sa_any[i]->bv_len -
1646                                         ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
1647                         }
1648                 }
1649         }
1650
1651         if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
1652                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1653         {
1654                 nkeys++;
1655         }
1656
1657         if( nkeys == 0 ) {
1658                 *keysp = NULL;
1659                 return LDAP_SUCCESS;
1660         }
1661
1662         digest.bv_val = MD5digest;
1663         digest.bv_len = sizeof(MD5digest);
1664
1665         slen = strlen( syntax->ssyn_oid );
1666         mlen = strlen( mr->smr_oid );
1667
1668         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
1669         nkeys = 0;
1670
1671         if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
1672                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1673         {
1674                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
1675                 value = ber_bvdup( sa->sa_initial );
1676                 ldap_pvt_str2upper( value->bv_val );
1677
1678                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1679                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1680
1681                 lutil_MD5Init( &MD5context );
1682                 if( prefix != NULL && prefix->bv_len > 0 ) {
1683                         lutil_MD5Update( &MD5context,
1684                                 prefix->bv_val, prefix->bv_len );
1685                 }
1686                 lutil_MD5Update( &MD5context,
1687                         &pre, sizeof( pre ) );
1688                 lutil_MD5Update( &MD5context,
1689                         syntax->ssyn_oid, slen );
1690                 lutil_MD5Update( &MD5context,
1691                         mr->smr_oid, mlen );
1692                 lutil_MD5Update( &MD5context,
1693                         value->bv_val, klen );
1694                 lutil_MD5Final( MD5digest, &MD5context );
1695
1696                 ber_bvfree( value );
1697                 keys[nkeys++] = ber_bvdup( &digest );
1698         }
1699
1700         if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
1701                 ber_len_t i, j;
1702                 pre = SLAP_INDEX_SUBSTR_PREFIX;
1703                 klen = SLAP_INDEX_SUBSTR_MAXLEN;
1704
1705                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
1706                         if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
1707                                 continue;
1708                         }
1709
1710                         value = ber_bvdup( sa->sa_any[i] );
1711                         ldap_pvt_str2upper( value->bv_val );
1712
1713                         for(j=0;
1714                                 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
1715                                 j += SLAP_INDEX_SUBSTR_STEP )
1716                         {
1717                                 lutil_MD5Init( &MD5context );
1718                                 if( prefix != NULL && prefix->bv_len > 0 ) {
1719                                         lutil_MD5Update( &MD5context,
1720                                                 prefix->bv_val, prefix->bv_len );
1721                                 }
1722                                 lutil_MD5Update( &MD5context,
1723                                         &pre, sizeof( pre ) );
1724                                 lutil_MD5Update( &MD5context,
1725                                         syntax->ssyn_oid, slen );
1726                                 lutil_MD5Update( &MD5context,
1727                                         mr->smr_oid, mlen );
1728                                 lutil_MD5Update( &MD5context,
1729                                         &value->bv_val[j], klen );
1730                                 lutil_MD5Final( MD5digest, &MD5context );
1731
1732                                 keys[nkeys++] = ber_bvdup( &digest );
1733                         }
1734
1735                         ber_bvfree( value );
1736                 }
1737         }
1738
1739         if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
1740                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
1741         {
1742                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
1743                 value = ber_bvdup( sa->sa_final );
1744                 ldap_pvt_str2upper( value->bv_val );
1745
1746                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
1747                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
1748
1749                 lutil_MD5Init( &MD5context );
1750                 if( prefix != NULL && prefix->bv_len > 0 ) {
1751                         lutil_MD5Update( &MD5context,
1752                                 prefix->bv_val, prefix->bv_len );
1753                 }
1754                 lutil_MD5Update( &MD5context,
1755                         &pre, sizeof( pre ) );
1756                 lutil_MD5Update( &MD5context,
1757                         syntax->ssyn_oid, slen );
1758                 lutil_MD5Update( &MD5context,
1759                         mr->smr_oid, mlen );
1760                 lutil_MD5Update( &MD5context,
1761                         &value->bv_val[value->bv_len-klen], klen );
1762                 lutil_MD5Final( MD5digest, &MD5context );
1763
1764                 ber_bvfree( value );
1765                 keys[nkeys++] = ber_bvdup( &digest );
1766         }
1767
1768         if( nkeys > 0 ) {
1769                 keys[nkeys] = NULL;
1770                 *keysp = keys;
1771         } else {
1772                 ch_free( keys );
1773                 *keysp = NULL;
1774         }
1775
1776         return LDAP_SUCCESS;
1777 }
1778
1779 static int
1780 oidValidate(
1781         Syntax *syntax,
1782         struct berval *val )
1783 {
1784         ber_len_t i;
1785
1786         if( val->bv_len == 0 ) return 0;
1787
1788         if( OID_LEADCHAR(val->bv_val[0]) ) {
1789                 int dot = 0;
1790                 for(i=1; i < val->bv_len; i++) {
1791                         if( OID_SEPARATOR( val->bv_val[i] ) ) {
1792                                 if( dot++ ) return 1;
1793                         } else if ( OID_CHAR( val->bv_val[i] ) ) {
1794                                 dot = 0;
1795                         } else {
1796                                 return LDAP_INVALID_SYNTAX;
1797                         }
1798                 }
1799
1800                 return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
1801
1802         } else if( DESC_LEADCHAR(val->bv_val[0]) ) {
1803                 for(i=1; i < val->bv_len; i++) {
1804                         if( !DESC_CHAR(val->bv_val[i] ) ) {
1805                                 return LDAP_INVALID_SYNTAX;
1806                         }
1807                 }
1808
1809                 return LDAP_SUCCESS;
1810         }
1811
1812         return LDAP_INVALID_SYNTAX;
1813 }
1814
1815 static int
1816 integerValidate(
1817         Syntax *syntax,
1818         struct berval *val )
1819 {
1820         ber_len_t i;
1821
1822         if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
1823
1824         if( val->bv_val[0] == '+' || val->bv_val[0] == '-' ) {
1825                 if( val->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
1826         } else if( !ASCII_DIGIT(val->bv_val[0]) ) {
1827                 return LDAP_INVALID_SYNTAX;
1828         }
1829
1830         for(i=1; i < val->bv_len; i++) {
1831                 if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
1832         }
1833
1834         return LDAP_SUCCESS;
1835 }
1836
1837 static int
1838 integerNormalize(
1839         Syntax *syntax,
1840         struct berval *val,
1841         struct berval **normalized )
1842 {
1843         int negative;
1844         struct berval *newval;
1845         char *p, *q;
1846
1847         p = val->bv_val;
1848
1849         /* save sign */
1850         negative = ( *p == '-' );
1851         if( *p == '-' || *p == '+' ) p++;
1852
1853         /* Ignore leading zeros */
1854         while ( *p == '0' ) p++;
1855
1856         newval = (struct berval *) ch_malloc( sizeof(struct berval) );
1857
1858         if( *p == '\0' ) {
1859                 newval->bv_val = ch_strdup("0");
1860                 newval->bv_len = 1;
1861                 goto done;
1862         }
1863
1864         newval->bv_val = ch_malloc( val->bv_len + 1 );
1865         newval->bv_len = 0;
1866
1867         if( negative ) {
1868                 newval->bv_val[newval->bv_len++] = '-';
1869         }
1870
1871         for( ; *p != '\0'; p++ ) {
1872                 newval->bv_val[newval->bv_len++] = *p;
1873         }
1874
1875 done:
1876         *normalized = newval;
1877         return LDAP_SUCCESS;
1878 }
1879
1880 static int
1881 printableStringValidate(
1882         Syntax *syntax,
1883         struct berval *val )
1884 {
1885         ber_len_t i;
1886
1887         if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
1888
1889         for(i=0; i < val->bv_len; i++) {
1890                 if( !isprint(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
1891         }
1892
1893         return LDAP_SUCCESS;
1894 }
1895
1896 static int
1897 IA5StringValidate(
1898         Syntax *syntax,
1899         struct berval *val )
1900 {
1901         ber_len_t i;
1902
1903         if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
1904
1905         for(i=0; i < val->bv_len; i++) {
1906                 if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
1907         }
1908
1909         return LDAP_SUCCESS;
1910 }
1911
1912 static int
1913 IA5StringNormalize(
1914         Syntax *syntax,
1915         struct berval *val,
1916         struct berval **normalized )
1917 {
1918         struct berval *newval;
1919         char *p, *q;
1920
1921         newval = ch_malloc( sizeof( struct berval ) );
1922
1923         p = val->bv_val;
1924
1925         /* Ignore initial whitespace */
1926         while ( ASCII_SPACE( *p ) ) {
1927                 p++;
1928         }
1929
1930         if( *p == '\0' ) {
1931                 ch_free( newval );
1932                 return LDAP_INVALID_SYNTAX;
1933         }
1934
1935         newval->bv_val = ch_strdup( p );
1936         p = q = newval->bv_val;
1937
1938         while ( *p ) {
1939                 if ( ASCII_SPACE( *p ) ) {
1940                         *q++ = *p++;
1941
1942                         /* Ignore the extra whitespace */
1943                         while ( ASCII_SPACE( *p ) ) {
1944                                 p++;
1945                         }
1946                 } else {
1947                         *q++ = *p++;
1948                 }
1949         }
1950
1951         assert( *newval->bv_val );
1952         assert( newval->bv_val < p );
1953         assert( p <= q );
1954
1955         /* cannot start with a space */
1956         assert( !ASCII_SPACE(*newval->bv_val) );
1957
1958         /*
1959          * If the string ended in space, backup the pointer one
1960          * position.  One is enough because the above loop collapsed
1961          * all whitespace to a single space.
1962          */
1963
1964         if ( ASCII_SPACE( q[-1] ) ) {
1965                 --q;
1966         }
1967
1968         /* cannot end with a space */
1969         assert( !ASCII_SPACE( q[-1] ) );
1970
1971         /* null terminate */
1972         *q = '\0';
1973
1974         newval->bv_len = q - newval->bv_val;
1975         *normalized = newval;
1976
1977         return LDAP_SUCCESS;
1978 }
1979
1980 static int
1981 caseExactIA5Match(
1982         int *matchp,
1983         slap_mask_t flags,
1984         Syntax *syntax,
1985         MatchingRule *mr,
1986         struct berval *value,
1987         void *assertedValue )
1988 {
1989         int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
1990
1991         if( match == 0 ) {
1992                 match = strncmp( value->bv_val,
1993                         ((struct berval *) assertedValue)->bv_val,
1994                         value->bv_len );
1995         }
1996
1997         *matchp = match;
1998         return LDAP_SUCCESS;
1999 }
2000
2001 static int
2002 caseExactIA5SubstringsMatch(
2003         int *matchp,
2004         slap_mask_t flags,
2005         Syntax *syntax,
2006         MatchingRule *mr,
2007         struct berval *value,
2008         void *assertedValue )
2009 {
2010         int match = 0;
2011         SubstringsAssertion *sub = assertedValue;
2012         struct berval left = *value;
2013         int i;
2014         ber_len_t inlen=0;
2015
2016         /* Add up asserted input length */
2017         if( sub->sa_initial ) {
2018                 inlen += sub->sa_initial->bv_len;
2019         }
2020         if( sub->sa_any ) {
2021                 for(i=0; sub->sa_any[i] != NULL; i++) {
2022                         inlen += sub->sa_any[i]->bv_len;
2023                 }
2024         }
2025         if( sub->sa_final ) {
2026                 inlen += sub->sa_final->bv_len;
2027         }
2028
2029         if( sub->sa_initial ) {
2030                 if( inlen > left.bv_len ) {
2031                         match = 1;
2032                         goto done;
2033                 }
2034
2035                 match = strncmp( sub->sa_initial->bv_val, left.bv_val,
2036                         sub->sa_initial->bv_len );
2037
2038                 if( match != 0 ) {
2039                         goto done;
2040                 }
2041
2042                 left.bv_val += sub->sa_initial->bv_len;
2043                 left.bv_len -= sub->sa_initial->bv_len;
2044                 inlen -= sub->sa_initial->bv_len;
2045         }
2046
2047         if( sub->sa_final ) {
2048                 if( inlen > left.bv_len ) {
2049                         match = 1;
2050                         goto done;
2051                 }
2052
2053                 match = strncmp( sub->sa_final->bv_val,
2054                         &left.bv_val[left.bv_len - sub->sa_final->bv_len],
2055                         sub->sa_final->bv_len );
2056
2057                 if( match != 0 ) {
2058                         goto done;
2059                 }
2060
2061                 left.bv_len -= sub->sa_final->bv_len;
2062                 inlen -= sub->sa_final->bv_len;
2063         }
2064
2065         if( sub->sa_any ) {
2066                 for(i=0; sub->sa_any[i]; i++) {
2067                         ber_len_t idx;
2068                         char *p;
2069
2070 retry:
2071                         if( inlen > left.bv_len ) {
2072                                 /* not enough length */
2073                                 match = 1;
2074                                 goto done;
2075                         }
2076
2077                         if( sub->sa_any[i]->bv_len == 0 ) {
2078                                 continue;
2079                         }
2080
2081                         p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
2082
2083                         if( p == NULL ) {
2084                                 match = 1;
2085                                 goto done;
2086                         }
2087
2088                         idx = p - left.bv_val;
2089                         assert( idx < left.bv_len );
2090
2091                         if( idx >= left.bv_len ) {
2092                                 /* this shouldn't happen */
2093                                 return LDAP_OTHER;
2094                         }
2095
2096                         left.bv_val = p;
2097                         left.bv_len -= idx;
2098
2099                         if( sub->sa_any[i]->bv_len > left.bv_len ) {
2100                                 /* not enough left */
2101                                 match = 1;
2102                                 goto done;
2103                         }
2104
2105                         match = strncmp( left.bv_val,
2106                                 sub->sa_any[i]->bv_val,
2107                                 sub->sa_any[i]->bv_len );
2108
2109                         if( match != 0 ) {
2110                                 left.bv_val++;
2111                                 left.bv_len--;
2112                                 goto retry;
2113                         }
2114
2115                         left.bv_val += sub->sa_any[i]->bv_len;
2116                         left.bv_len -= sub->sa_any[i]->bv_len;
2117                         inlen -= sub->sa_any[i]->bv_len;
2118                 }
2119         }
2120
2121 done:
2122         *matchp = match;
2123         return LDAP_SUCCESS;
2124 }
2125
2126 /* Index generation function */
2127 int caseExactIA5Indexer(
2128         slap_mask_t use,
2129         slap_mask_t flags,
2130         Syntax *syntax,
2131         MatchingRule *mr,
2132         struct berval *prefix,
2133         struct berval **values,
2134         struct berval ***keysp )
2135 {
2136         int i;
2137         size_t slen, mlen;
2138         struct berval **keys;
2139         lutil_MD5_CTX   MD5context;
2140         unsigned char   MD5digest[16];
2141         struct berval digest;
2142         digest.bv_val = MD5digest;
2143         digest.bv_len = sizeof(MD5digest);
2144
2145         for( i=0; values[i] != NULL; i++ ) {
2146                 /* just count them */
2147         }
2148
2149         assert( i > 0 );
2150
2151         keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
2152
2153         slen = strlen( syntax->ssyn_oid );
2154         mlen = strlen( mr->smr_oid );
2155
2156         for( i=0; values[i] != NULL; i++ ) {
2157                 struct berval *value = values[i];
2158
2159                 lutil_MD5Init( &MD5context );
2160                 if( prefix != NULL && prefix->bv_len > 0 ) {
2161                         lutil_MD5Update( &MD5context,
2162                                 prefix->bv_val, prefix->bv_len );
2163                 }
2164                 lutil_MD5Update( &MD5context,
2165                         syntax->ssyn_oid, slen );
2166                 lutil_MD5Update( &MD5context,
2167                         mr->smr_oid, mlen );
2168                 lutil_MD5Update( &MD5context,
2169                         value->bv_val, value->bv_len );
2170                 lutil_MD5Final( MD5digest, &MD5context );
2171
2172                 keys[i] = ber_bvdup( &digest );
2173         }
2174
2175         keys[i] = NULL;
2176         *keysp = keys;
2177         return LDAP_SUCCESS;
2178 }
2179
2180 /* Index generation function */
2181 int caseExactIA5Filter(
2182         slap_mask_t use,
2183         slap_mask_t flags,
2184         Syntax *syntax,
2185         MatchingRule *mr,
2186         struct berval *prefix,
2187         void * assertValue,
2188         struct berval ***keysp )
2189 {
2190         size_t slen, mlen;
2191         struct berval **keys;
2192         lutil_MD5_CTX   MD5context;
2193         unsigned char   MD5digest[LUTIL_MD5_BYTES];
2194         struct berval *value;
2195         struct berval digest;
2196         digest.bv_val = MD5digest;
2197         digest.bv_len = sizeof(MD5digest);
2198
2199         slen = strlen( syntax->ssyn_oid );
2200         mlen = strlen( mr->smr_oid );
2201
2202         value = (struct berval *) assertValue;
2203
2204         keys = ch_malloc( sizeof( struct berval * ) * 2 );
2205
2206         lutil_MD5Init( &MD5context );
2207         if( prefix != NULL && prefix->bv_len > 0 ) {
2208                 lutil_MD5Update( &MD5context,
2209                         prefix->bv_val, prefix->bv_len );
2210         }
2211         lutil_MD5Update( &MD5context,
2212                 syntax->ssyn_oid, slen );
2213         lutil_MD5Update( &MD5context,
2214                 mr->smr_oid, mlen );
2215         lutil_MD5Update( &MD5context,
2216                 value->bv_val, value->bv_len );
2217         lutil_MD5Final( MD5digest, &MD5context );
2218
2219         keys[0] = ber_bvdup( &digest );
2220         keys[1] = NULL;
2221
2222         *keysp = keys;
2223         return LDAP_SUCCESS;
2224 }
2225
2226 /* Substrings Index generation function */
2227 int caseExactIA5SubstringsIndexer(
2228         slap_mask_t use,
2229         slap_mask_t flags,
2230         Syntax *syntax,
2231         MatchingRule *mr,
2232         struct berval *prefix,
2233         struct berval **values,
2234         struct berval ***keysp )
2235 {
2236         ber_len_t i, nkeys;
2237         size_t slen, mlen;
2238         struct berval **keys;
2239         lutil_MD5_CTX   MD5context;
2240         unsigned char   MD5digest[16];
2241         struct berval digest;
2242         digest.bv_val = MD5digest;
2243         digest.bv_len = sizeof(MD5digest);
2244
2245         nkeys=0;
2246         for( i=0; values[i] != NULL; i++ ) {
2247                 /* count number of indices to generate */
2248                 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2249                         continue;
2250                 }
2251
2252                 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2253                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2254                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2255                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2256                         } else {
2257                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2258                         }
2259                 }
2260
2261                 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2262                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2263                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2264                         }
2265                 }
2266
2267                 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2268                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2269                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2270                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2271                         } else {
2272                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2273                         }
2274                 }
2275         }
2276         assert( i > 0 );
2277
2278         if( nkeys == 0 ) {
2279                 /* no keys to generate */
2280                 *keysp = NULL;
2281                 return LDAP_SUCCESS;
2282         }
2283
2284         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2285
2286         slen = strlen( syntax->ssyn_oid );
2287         mlen = strlen( mr->smr_oid );
2288
2289         nkeys=0;
2290         for( i=0; values[i] != NULL; i++ ) {
2291                 ber_len_t j,max;
2292                 struct berval *value;
2293
2294                 value = values[i];
2295                 if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2296
2297                 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2298                         ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2299                 {
2300                         char pre = SLAP_INDEX_SUBSTR_PREFIX;
2301                         max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2302
2303                         for( j=0; j<max; j++ ) {
2304                                 lutil_MD5Init( &MD5context );
2305                                 if( prefix != NULL && prefix->bv_len > 0 ) {
2306                                         lutil_MD5Update( &MD5context,
2307                                                 prefix->bv_val, prefix->bv_len );
2308                                 }
2309
2310                                 lutil_MD5Update( &MD5context,
2311                                         &pre, sizeof( pre ) );
2312                                 lutil_MD5Update( &MD5context,
2313                                         syntax->ssyn_oid, slen );
2314                                 lutil_MD5Update( &MD5context,
2315                                         mr->smr_oid, mlen );
2316                                 lutil_MD5Update( &MD5context,
2317                                         &value->bv_val[j],
2318                                         SLAP_INDEX_SUBSTR_MAXLEN );
2319                                 lutil_MD5Final( MD5digest, &MD5context );
2320
2321                                 keys[nkeys++] = ber_bvdup( &digest );
2322                         }
2323                 }
2324
2325                 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2326                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2327
2328                 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2329                         char pre;
2330
2331                         if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2332                                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2333                                 lutil_MD5Init( &MD5context );
2334                                 if( prefix != NULL && prefix->bv_len > 0 ) {
2335                                         lutil_MD5Update( &MD5context,
2336                                                 prefix->bv_val, prefix->bv_len );
2337                                 }
2338                                 lutil_MD5Update( &MD5context,
2339                                         &pre, sizeof( pre ) );
2340                                 lutil_MD5Update( &MD5context,
2341                                         syntax->ssyn_oid, slen );
2342                                 lutil_MD5Update( &MD5context,
2343                                         mr->smr_oid, mlen );
2344                                 lutil_MD5Update( &MD5context,
2345                                         value->bv_val, j );
2346                                 lutil_MD5Final( MD5digest, &MD5context );
2347
2348                                 keys[nkeys++] = ber_bvdup( &digest );
2349                         }
2350
2351                         if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2352                                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2353                                 lutil_MD5Init( &MD5context );
2354                                 if( prefix != NULL && prefix->bv_len > 0 ) {
2355                                         lutil_MD5Update( &MD5context,
2356                                                 prefix->bv_val, prefix->bv_len );
2357                                 }
2358                                 lutil_MD5Update( &MD5context,
2359                                         &pre, sizeof( pre ) );
2360                                 lutil_MD5Update( &MD5context,
2361                                         syntax->ssyn_oid, slen );
2362                                 lutil_MD5Update( &MD5context,
2363                                         mr->smr_oid, mlen );
2364                                 lutil_MD5Update( &MD5context,
2365                                         &value->bv_val[value->bv_len-j], j );
2366                                 lutil_MD5Final( MD5digest, &MD5context );
2367
2368                                 keys[nkeys++] = ber_bvdup( &digest );
2369                         }
2370
2371                 }
2372         }
2373
2374         if( nkeys > 0 ) {
2375                 keys[nkeys] = NULL;
2376                 *keysp = keys;
2377         } else {
2378                 ch_free( keys );
2379                 *keysp = NULL;
2380         }
2381
2382         return LDAP_SUCCESS;
2383 }
2384
2385 int caseExactIA5SubstringsFilter(
2386         slap_mask_t use,
2387         slap_mask_t flags,
2388         Syntax *syntax,
2389         MatchingRule *mr,
2390         struct berval *prefix,
2391         void * assertValue,
2392         struct berval ***keysp )
2393 {
2394         SubstringsAssertion *sa = assertValue;
2395         char pre;
2396         ber_len_t nkeys = 0;
2397         size_t slen, mlen, klen;
2398         struct berval **keys;
2399         lutil_MD5_CTX   MD5context;
2400         unsigned char   MD5digest[LUTIL_MD5_BYTES];
2401         struct berval *value;
2402         struct berval digest;
2403
2404         if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
2405                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2406         {
2407                 nkeys++;
2408         }
2409
2410         if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2411                 ber_len_t i;
2412                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2413                         if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2414                                 /* don't bother accounting for stepping */
2415                                 nkeys += sa->sa_any[i]->bv_len -
2416                                         ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2417                         }
2418                 }
2419         }
2420
2421         if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
2422                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2423         {
2424                 nkeys++;
2425         }
2426
2427         if( nkeys == 0 ) {
2428                 *keysp = NULL;
2429                 return LDAP_SUCCESS;
2430         }
2431
2432         digest.bv_val = MD5digest;
2433         digest.bv_len = sizeof(MD5digest);
2434
2435         slen = strlen( syntax->ssyn_oid );
2436         mlen = strlen( mr->smr_oid );
2437
2438         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2439         nkeys = 0;
2440
2441         if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
2442                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2443         {
2444                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2445                 value = sa->sa_initial;
2446
2447                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2448                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2449
2450                 lutil_MD5Init( &MD5context );
2451                 if( prefix != NULL && prefix->bv_len > 0 ) {
2452                         lutil_MD5Update( &MD5context,
2453                                 prefix->bv_val, prefix->bv_len );
2454                 }
2455                 lutil_MD5Update( &MD5context,
2456                         &pre, sizeof( pre ) );
2457                 lutil_MD5Update( &MD5context,
2458                         syntax->ssyn_oid, slen );
2459                 lutil_MD5Update( &MD5context,
2460                         mr->smr_oid, mlen );
2461                 lutil_MD5Update( &MD5context,
2462                         value->bv_val, klen );
2463                 lutil_MD5Final( MD5digest, &MD5context );
2464
2465                 keys[nkeys++] = ber_bvdup( &digest );
2466         }
2467
2468         if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
2469                 ber_len_t i, j;
2470                 pre = SLAP_INDEX_SUBSTR_PREFIX;
2471                 klen = SLAP_INDEX_SUBSTR_MAXLEN;
2472
2473                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2474                         if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
2475                                 continue;
2476                         }
2477
2478                         value = sa->sa_any[i];
2479
2480                         for(j=0;
2481                                 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
2482                                 j += SLAP_INDEX_SUBSTR_STEP )
2483                         {
2484                                 lutil_MD5Init( &MD5context );
2485                                 if( prefix != NULL && prefix->bv_len > 0 ) {
2486                                         lutil_MD5Update( &MD5context,
2487                                                 prefix->bv_val, prefix->bv_len );
2488                                 }
2489                                 lutil_MD5Update( &MD5context,
2490                                         &pre, sizeof( pre ) );
2491                                 lutil_MD5Update( &MD5context,
2492                                         syntax->ssyn_oid, slen );
2493                                 lutil_MD5Update( &MD5context,
2494                                         mr->smr_oid, mlen );
2495                                 lutil_MD5Update( &MD5context,
2496                                         &value->bv_val[j], klen );
2497                                 lutil_MD5Final( MD5digest, &MD5context );
2498
2499                                 keys[nkeys++] = ber_bvdup( &digest );
2500                         }
2501                 }
2502         }
2503
2504         if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
2505                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2506         {
2507                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2508                 value = sa->sa_final;
2509
2510                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2511                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2512
2513                 lutil_MD5Init( &MD5context );
2514                 if( prefix != NULL && prefix->bv_len > 0 ) {
2515                         lutil_MD5Update( &MD5context,
2516                                 prefix->bv_val, prefix->bv_len );
2517                 }
2518                 lutil_MD5Update( &MD5context,
2519                         &pre, sizeof( pre ) );
2520                 lutil_MD5Update( &MD5context,
2521                         syntax->ssyn_oid, slen );
2522                 lutil_MD5Update( &MD5context,
2523                         mr->smr_oid, mlen );
2524                 lutil_MD5Update( &MD5context,
2525                         &value->bv_val[value->bv_len-klen], klen );
2526                 lutil_MD5Final( MD5digest, &MD5context );
2527
2528                 keys[nkeys++] = ber_bvdup( &digest );
2529         }
2530
2531         if( nkeys > 0 ) {
2532                 keys[nkeys] = NULL;
2533                 *keysp = keys;
2534         } else {
2535                 ch_free( keys );
2536                 *keysp = NULL;
2537         }
2538
2539         return LDAP_SUCCESS;
2540 }
2541
2542 static int
2543 caseIgnoreIA5Match(
2544         int *matchp,
2545         slap_mask_t flags,
2546         Syntax *syntax,
2547         MatchingRule *mr,
2548         struct berval *value,
2549         void *assertedValue )
2550 {
2551         int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
2552
2553         if( match == 0 ) {
2554                 match = strncasecmp( value->bv_val,
2555                         ((struct berval *) assertedValue)->bv_val,
2556                         value->bv_len );
2557         }
2558
2559         *matchp = match;
2560         return LDAP_SUCCESS;
2561 }
2562
2563 static int
2564 caseIgnoreIA5SubstringsMatch(
2565         int *matchp,
2566         slap_mask_t flags,
2567         Syntax *syntax,
2568         MatchingRule *mr,
2569         struct berval *value,
2570         void *assertedValue )
2571 {
2572         int match = 0;
2573         SubstringsAssertion *sub = assertedValue;
2574         struct berval left = *value;
2575         int i;
2576         ber_len_t inlen=0;
2577
2578         /* Add up asserted input length */
2579         if( sub->sa_initial ) {
2580                 inlen += sub->sa_initial->bv_len;
2581         }
2582         if( sub->sa_any ) {
2583                 for(i=0; sub->sa_any[i] != NULL; i++) {
2584                         inlen += sub->sa_any[i]->bv_len;
2585                 }
2586         }
2587         if( sub->sa_final ) {
2588                 inlen += sub->sa_final->bv_len;
2589         }
2590
2591         if( sub->sa_initial ) {
2592                 if( inlen > left.bv_len ) {
2593                         match = 1;
2594                         goto done;
2595                 }
2596
2597                 match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
2598                         sub->sa_initial->bv_len );
2599
2600                 if( match != 0 ) {
2601                         goto done;
2602                 }
2603
2604                 left.bv_val += sub->sa_initial->bv_len;
2605                 left.bv_len -= sub->sa_initial->bv_len;
2606                 inlen -= sub->sa_initial->bv_len;
2607         }
2608
2609         if( sub->sa_final ) {
2610                 if( inlen > left.bv_len ) {
2611                         match = 1;
2612                         goto done;
2613                 }
2614
2615                 match = strncasecmp( sub->sa_final->bv_val,
2616                         &left.bv_val[left.bv_len - sub->sa_final->bv_len],
2617                         sub->sa_final->bv_len );
2618
2619                 if( match != 0 ) {
2620                         goto done;
2621                 }
2622
2623                 left.bv_len -= sub->sa_final->bv_len;
2624                 inlen -= sub->sa_final->bv_len;
2625         }
2626
2627         if( sub->sa_any ) {
2628                 for(i=0; sub->sa_any[i]; i++) {
2629                         ber_len_t idx;
2630                         char *p;
2631
2632 retry:
2633                         if( inlen > left.bv_len ) {
2634                                 /* not enough length */
2635                                 match = 1;
2636                                 goto done;
2637                         }
2638
2639                         if( sub->sa_any[i]->bv_len == 0 ) {
2640                                 continue;
2641                         }
2642
2643                         p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
2644
2645                         if( p == NULL ) {
2646                                 match = 1;
2647                                 goto done;
2648                         }
2649
2650                         idx = p - left.bv_val;
2651                         assert( idx < left.bv_len );
2652
2653                         if( idx >= left.bv_len ) {
2654                                 /* this shouldn't happen */
2655                                 return LDAP_OTHER;
2656                         }
2657
2658                         left.bv_val = p;
2659                         left.bv_len -= idx;
2660
2661                         if( sub->sa_any[i]->bv_len > left.bv_len ) {
2662                                 /* not enough left */
2663                                 match = 1;
2664                                 goto done;
2665                         }
2666
2667                         match = strncasecmp( left.bv_val,
2668                                 sub->sa_any[i]->bv_val,
2669                                 sub->sa_any[i]->bv_len );
2670
2671                         if( match != 0 ) {
2672                                 left.bv_val++;
2673                                 left.bv_len--;
2674
2675                                 goto retry;
2676                         }
2677
2678                         left.bv_val += sub->sa_any[i]->bv_len;
2679                         left.bv_len -= sub->sa_any[i]->bv_len;
2680                         inlen -= sub->sa_any[i]->bv_len;
2681                 }
2682         }
2683
2684 done:
2685         *matchp = match;
2686         return LDAP_SUCCESS;
2687 }
2688
2689 /* Index generation function */
2690 int caseIgnoreIA5Indexer(
2691         slap_mask_t use,
2692         slap_mask_t flags,
2693         Syntax *syntax,
2694         MatchingRule *mr,
2695         struct berval *prefix,
2696         struct berval **values,
2697         struct berval ***keysp )
2698 {
2699         int i;
2700         size_t slen, mlen;
2701         struct berval **keys;
2702         lutil_MD5_CTX   MD5context;
2703         unsigned char   MD5digest[16];
2704         struct berval digest;
2705         digest.bv_val = MD5digest;
2706         digest.bv_len = sizeof(MD5digest);
2707
2708         for( i=0; values[i] != NULL; i++ ) {
2709                 /* just count them */
2710         }
2711
2712         assert( i > 0 );
2713
2714         keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
2715
2716         slen = strlen( syntax->ssyn_oid );
2717         mlen = strlen( mr->smr_oid );
2718
2719         for( i=0; values[i] != NULL; i++ ) {
2720                 struct berval *value = ber_bvdup( values[i] );
2721                 ldap_pvt_str2upper( value->bv_val );
2722
2723                 lutil_MD5Init( &MD5context );
2724                 if( prefix != NULL && prefix->bv_len > 0 ) {
2725                         lutil_MD5Update( &MD5context,
2726                                 prefix->bv_val, prefix->bv_len );
2727                 }
2728                 lutil_MD5Update( &MD5context,
2729                         syntax->ssyn_oid, slen );
2730                 lutil_MD5Update( &MD5context,
2731                         mr->smr_oid, mlen );
2732                 lutil_MD5Update( &MD5context,
2733                         value->bv_val, value->bv_len );
2734                 lutil_MD5Final( MD5digest, &MD5context );
2735
2736                 ber_bvfree( value );
2737
2738                 keys[i] = ber_bvdup( &digest );
2739         }
2740
2741         keys[i] = NULL;
2742         *keysp = keys;
2743         return LDAP_SUCCESS;
2744 }
2745
2746 /* Index generation function */
2747 int caseIgnoreIA5Filter(
2748         slap_mask_t use,
2749         slap_mask_t flags,
2750         Syntax *syntax,
2751         MatchingRule *mr,
2752         struct berval *prefix,
2753         void * assertValue,
2754         struct berval ***keysp )
2755 {
2756         size_t slen, mlen;
2757         struct berval **keys;
2758         lutil_MD5_CTX   MD5context;
2759         unsigned char   MD5digest[LUTIL_MD5_BYTES];
2760         struct berval *value;
2761         struct berval digest;
2762         digest.bv_val = MD5digest;
2763         digest.bv_len = sizeof(MD5digest);
2764
2765         slen = strlen( syntax->ssyn_oid );
2766         mlen = strlen( mr->smr_oid );
2767
2768         value = ber_bvdup( (struct berval *) assertValue );
2769         ldap_pvt_str2upper( value->bv_val );
2770
2771         keys = ch_malloc( sizeof( struct berval * ) * 2 );
2772
2773         lutil_MD5Init( &MD5context );
2774         if( prefix != NULL && prefix->bv_len > 0 ) {
2775                 lutil_MD5Update( &MD5context,
2776                         prefix->bv_val, prefix->bv_len );
2777         }
2778         lutil_MD5Update( &MD5context,
2779                 syntax->ssyn_oid, slen );
2780         lutil_MD5Update( &MD5context,
2781                 mr->smr_oid, mlen );
2782         lutil_MD5Update( &MD5context,
2783                 value->bv_val, value->bv_len );
2784         lutil_MD5Final( MD5digest, &MD5context );
2785
2786         keys[0] = ber_bvdup( &digest );
2787         keys[1] = NULL;
2788
2789         ber_bvfree( value );
2790
2791         *keysp = keys;
2792
2793         return LDAP_SUCCESS;
2794 }
2795
2796 /* Substrings Index generation function */
2797 int caseIgnoreIA5SubstringsIndexer(
2798         slap_mask_t use,
2799         slap_mask_t flags,
2800         Syntax *syntax,
2801         MatchingRule *mr,
2802         struct berval *prefix,
2803         struct berval **values,
2804         struct berval ***keysp )
2805 {
2806         ber_len_t i, nkeys;
2807         size_t slen, mlen;
2808         struct berval **keys;
2809         lutil_MD5_CTX   MD5context;
2810         unsigned char   MD5digest[16];
2811         struct berval digest;
2812         digest.bv_val = MD5digest;
2813         digest.bv_len = sizeof(MD5digest);
2814
2815         nkeys=0;
2816         for( i=0; values[i] != NULL; i++ ) {
2817                 /* count number of indices to generate */
2818                 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
2819                         continue;
2820                 }
2821
2822                 if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2823                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2824                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2825                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2826                         } else {
2827                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2828                         }
2829                 }
2830
2831                 if( flags & SLAP_INDEX_SUBSTR_ANY ) {
2832                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2833                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2834                         }
2835                 }
2836
2837                 if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2838                         if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2839                                 nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
2840                                         ( SLAP_INDEX_SUBSTR_MINLEN - 1);
2841                         } else {
2842                                 nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
2843                         }
2844                 }
2845         }
2846         assert( i > 0 );
2847
2848         if( nkeys == 0 ) {
2849                 /* no keys to generate */
2850                 *keysp = NULL;
2851                 return LDAP_SUCCESS;
2852         }
2853
2854         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
2855
2856         slen = strlen( syntax->ssyn_oid );
2857         mlen = strlen( mr->smr_oid );
2858
2859         nkeys=0;
2860         for( i=0; values[i] != NULL; i++ ) {
2861                 int j,max;
2862                 struct berval *value;
2863
2864                 if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
2865
2866                 value = ber_bvdup( values[i] );
2867                 ldap_pvt_str2upper( value->bv_val );
2868
2869                 if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
2870                         ( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
2871                 {
2872                         char pre = SLAP_INDEX_SUBSTR_PREFIX;
2873                         max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
2874
2875                         for( j=0; j<max; j++ ) {
2876                                 lutil_MD5Init( &MD5context );
2877                                 if( prefix != NULL && prefix->bv_len > 0 ) {
2878                                         lutil_MD5Update( &MD5context,
2879                                                 prefix->bv_val, prefix->bv_len );
2880                                 }
2881
2882                                 lutil_MD5Update( &MD5context,
2883                                         &pre, sizeof( pre ) );
2884                                 lutil_MD5Update( &MD5context,
2885                                         syntax->ssyn_oid, slen );
2886                                 lutil_MD5Update( &MD5context,
2887                                         mr->smr_oid, mlen );
2888                                 lutil_MD5Update( &MD5context,
2889                                         &value->bv_val[j],
2890                                         SLAP_INDEX_SUBSTR_MAXLEN );
2891                                 lutil_MD5Final( MD5digest, &MD5context );
2892
2893                                 keys[nkeys++] = ber_bvdup( &digest );
2894                         }
2895                 }
2896
2897                 max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
2898                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
2899
2900                 for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
2901                         char pre;
2902
2903                         if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
2904                                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
2905                                 lutil_MD5Init( &MD5context );
2906                                 if( prefix != NULL && prefix->bv_len > 0 ) {
2907                                         lutil_MD5Update( &MD5context,
2908                                                 prefix->bv_val, prefix->bv_len );
2909                                 }
2910                                 lutil_MD5Update( &MD5context,
2911                                         &pre, sizeof( pre ) );
2912                                 lutil_MD5Update( &MD5context,
2913                                         syntax->ssyn_oid, slen );
2914                                 lutil_MD5Update( &MD5context,
2915                                         mr->smr_oid, mlen );
2916                                 lutil_MD5Update( &MD5context,
2917                                         value->bv_val, j );
2918                                 lutil_MD5Final( MD5digest, &MD5context );
2919
2920                                 keys[nkeys++] = ber_bvdup( &digest );
2921                         }
2922
2923                         if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
2924                                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
2925                                 lutil_MD5Init( &MD5context );
2926                                 if( prefix != NULL && prefix->bv_len > 0 ) {
2927                                         lutil_MD5Update( &MD5context,
2928                                                 prefix->bv_val, prefix->bv_len );
2929                                 }
2930                                 lutil_MD5Update( &MD5context,
2931                                         &pre, sizeof( pre ) );
2932                                 lutil_MD5Update( &MD5context,
2933                                         syntax->ssyn_oid, slen );
2934                                 lutil_MD5Update( &MD5context,
2935                                         mr->smr_oid, mlen );
2936                                 lutil_MD5Update( &MD5context,
2937                                         &value->bv_val[value->bv_len-j], j );
2938                                 lutil_MD5Final( MD5digest, &MD5context );
2939
2940                                 keys[nkeys++] = ber_bvdup( &digest );
2941                         }
2942
2943                 }
2944
2945                 ber_bvfree( value );
2946         }
2947
2948         if( nkeys > 0 ) {
2949                 keys[nkeys] = NULL;
2950                 *keysp = keys;
2951         } else {
2952                 ch_free( keys );
2953                 *keysp = NULL;
2954         }
2955
2956         return LDAP_SUCCESS;
2957 }
2958
2959 int caseIgnoreIA5SubstringsFilter(
2960         slap_mask_t use,
2961         slap_mask_t flags,
2962         Syntax *syntax,
2963         MatchingRule *mr,
2964         struct berval *prefix,
2965         void * assertValue,
2966         struct berval ***keysp )
2967 {
2968         SubstringsAssertion *sa = assertValue;
2969         char pre;
2970         ber_len_t nkeys = 0;
2971         size_t slen, mlen, klen;
2972         struct berval **keys;
2973         lutil_MD5_CTX   MD5context;
2974         unsigned char   MD5digest[LUTIL_MD5_BYTES];
2975         struct berval *value;
2976         struct berval digest;
2977
2978         if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
2979                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2980         {
2981                 nkeys++;
2982         }
2983
2984         if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
2985                 ber_len_t i;
2986                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
2987                         if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
2988                                 /* don't bother accounting for stepping */
2989                                 nkeys += sa->sa_any[i]->bv_len -
2990                                         ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
2991                         }
2992                 }
2993         }
2994
2995         if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
2996                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
2997         {
2998                 nkeys++;
2999         }
3000
3001         if( nkeys == 0 ) {
3002                 *keysp = NULL;
3003                 return LDAP_SUCCESS;
3004         }
3005
3006         digest.bv_val = MD5digest;
3007         digest.bv_len = sizeof(MD5digest);
3008
3009         slen = strlen( syntax->ssyn_oid );
3010         mlen = strlen( mr->smr_oid );
3011
3012         keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
3013         nkeys = 0;
3014
3015         if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
3016                 sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3017         {
3018                 pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
3019                 value = ber_bvdup( sa->sa_initial );
3020                 ldap_pvt_str2upper( value->bv_val );
3021
3022                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3023                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3024
3025                 lutil_MD5Init( &MD5context );
3026                 if( prefix != NULL && prefix->bv_len > 0 ) {
3027                         lutil_MD5Update( &MD5context,
3028                                 prefix->bv_val, prefix->bv_len );
3029                 }
3030                 lutil_MD5Update( &MD5context,
3031                         &pre, sizeof( pre ) );
3032                 lutil_MD5Update( &MD5context,
3033                         syntax->ssyn_oid, slen );
3034                 lutil_MD5Update( &MD5context,
3035                         mr->smr_oid, mlen );
3036                 lutil_MD5Update( &MD5context,
3037                         value->bv_val, klen );
3038                 lutil_MD5Final( MD5digest, &MD5context );
3039
3040                 ber_bvfree( value );
3041                 keys[nkeys++] = ber_bvdup( &digest );
3042         }
3043
3044         if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
3045                 ber_len_t i, j;
3046                 pre = SLAP_INDEX_SUBSTR_PREFIX;
3047                 klen = SLAP_INDEX_SUBSTR_MAXLEN;
3048
3049                 for( i=0; sa->sa_any[i] != NULL; i++ ) {
3050                         if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
3051                                 continue;
3052                         }
3053
3054                         value = ber_bvdup( sa->sa_any[i] );
3055                         ldap_pvt_str2upper( value->bv_val );
3056
3057                         for(j=0;
3058                                 j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
3059                                 j += SLAP_INDEX_SUBSTR_STEP )
3060                         {
3061                                 lutil_MD5Init( &MD5context );
3062                                 if( prefix != NULL && prefix->bv_len > 0 ) {
3063                                         lutil_MD5Update( &MD5context,
3064                                                 prefix->bv_val, prefix->bv_len );
3065                                 }
3066                                 lutil_MD5Update( &MD5context,
3067                                         &pre, sizeof( pre ) );
3068                                 lutil_MD5Update( &MD5context,
3069                                         syntax->ssyn_oid, slen );
3070                                 lutil_MD5Update( &MD5context,
3071                                         mr->smr_oid, mlen );
3072                                 lutil_MD5Update( &MD5context,
3073                                         &value->bv_val[j], klen );
3074                                 lutil_MD5Final( MD5digest, &MD5context );
3075
3076                                 keys[nkeys++] = ber_bvdup( &digest );
3077                         }
3078
3079                         ber_bvfree( value );
3080                 }
3081         }
3082
3083         if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
3084                 sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
3085         {
3086                 pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
3087                 value = ber_bvdup( sa->sa_final );
3088                 ldap_pvt_str2upper( value->bv_val );
3089
3090                 klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
3091                         ? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
3092
3093                 lutil_MD5Init( &MD5context );
3094                 if( prefix != NULL && prefix->bv_len > 0 ) {
3095                         lutil_MD5Update( &MD5context,
3096                                 prefix->bv_val, prefix->bv_len );
3097                 }
3098                 lutil_MD5Update( &MD5context,
3099                         &pre, sizeof( pre ) );
3100                 lutil_MD5Update( &MD5context,
3101                         syntax->ssyn_oid, slen );
3102                 lutil_MD5Update( &MD5context,
3103                         mr->smr_oid, mlen );
3104                 lutil_MD5Update( &MD5context,
3105                         &value->bv_val[value->bv_len-klen], klen );
3106                 lutil_MD5Final( MD5digest, &MD5context );
3107
3108                 ber_bvfree( value );
3109                 keys[nkeys++] = ber_bvdup( &digest );
3110         }
3111
3112         if( nkeys > 0 ) {
3113                 keys[nkeys] = NULL;
3114                 *keysp = keys;
3115         } else {
3116                 ch_free( keys );
3117                 *keysp = NULL;
3118         }
3119
3120         return LDAP_SUCCESS;
3121 }
3122
3123 static int
3124 numericStringNormalize(
3125         Syntax *syntax,
3126         struct berval *val,
3127         struct berval **normalized )
3128 {
3129         /* similiar to IA5StringNormalize except removes all spaces */
3130         struct berval *newval;
3131         char *p, *q;
3132
3133         newval = ch_malloc( sizeof( struct berval ) );
3134
3135         p = val->bv_val;
3136
3137         /* Ignore initial whitespace */
3138         while ( ASCII_SPACE( *p ) ) {
3139                 p++;
3140         }
3141
3142         if( *p == '\0' ) {
3143                 ch_free( newval );
3144                 return LDAP_INVALID_SYNTAX;
3145         }
3146
3147         newval->bv_val = ch_strdup( p );
3148         p = q = newval->bv_val;
3149
3150         while ( *p ) {
3151                 if ( ASCII_SPACE( *p ) ) {
3152                         /* Ignore whitespace */
3153                         p++;
3154                 } else {
3155                         *q++ = *p++;
3156                 }
3157         }
3158
3159         assert( *newval->bv_val );
3160         assert( newval->bv_val < p );
3161         assert( q <= p );
3162
3163         /* cannot start with a space */
3164         assert( !ASCII_SPACE(*newval->bv_val) );
3165
3166         /* cannot end with a space */
3167         assert( !ASCII_SPACE( q[-1] ) );
3168
3169         /* null terminate */
3170         *q = '\0';
3171
3172         newval->bv_len = q - newval->bv_val;
3173         *normalized = newval;
3174
3175         return LDAP_SUCCESS;
3176 }
3177
3178 static int
3179 objectIdentifierFirstComponentMatch(
3180         int *matchp,
3181         slap_mask_t flags,
3182         Syntax *syntax,
3183         MatchingRule *mr,
3184         struct berval *value,
3185         void *assertedValue )
3186 {
3187         int rc = LDAP_SUCCESS;
3188         int match;
3189         struct berval *asserted = (struct berval *) assertedValue;
3190         ber_len_t i;
3191         struct berval oid;
3192
3193         if( value->bv_len == 0 || value->bv_val[0] != '(' /*')'*/ ) {
3194                 return LDAP_INVALID_SYNTAX;
3195         }
3196
3197         /* trim leading white space */
3198         for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
3199                 /* empty */
3200         }
3201
3202         /* grab next word */
3203         oid.bv_val = &value->bv_val[i];
3204         oid.bv_len = value->bv_len - i;
3205         for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
3206                 /* empty */
3207         }
3208         oid.bv_len = i;
3209
3210         /* insert attributeTypes, objectclass check here */
3211         if( OID_LEADCHAR(asserted->bv_val[0]) ) {
3212                 rc = objectIdentifierMatch( &match, flags, syntax, mr, &oid, asserted );
3213
3214         } else {
3215                 char *stored = ch_malloc( oid.bv_len + 1 );
3216                 AC_MEMCPY( stored, oid.bv_val, oid.bv_len );
3217                 stored[oid.bv_len] = '\0';
3218
3219                 if ( !strcmp( syntax->ssyn_oid, SLAP_SYNTAX_MATCHINGRULES_OID ) ) {
3220                         MatchingRule *asserted_mr = mr_find( asserted->bv_val );
3221                         MatchingRule *stored_mr = mr_find( stored );
3222
3223                         if( asserted_mr == NULL ) {
3224                                 rc = SLAPD_COMPARE_UNDEFINED;
3225                         } else {
3226                                 match = asserted_mr != stored_mr;
3227                         }
3228
3229                 } else if ( !strcmp( syntax->ssyn_oid,
3230                         SLAP_SYNTAX_ATTRIBUTETYPES_OID ) )
3231                 {
3232                         AttributeType *asserted_at = at_find( asserted->bv_val );
3233                         AttributeType *stored_at = at_find( stored );
3234
3235                         if( asserted_at == NULL ) {
3236                                 rc = SLAPD_COMPARE_UNDEFINED;
3237                         } else {
3238                                 match = asserted_at != stored_at;
3239                         }
3240
3241                 } else if ( !strcmp( syntax->ssyn_oid,
3242                         SLAP_SYNTAX_OBJECTCLASSES_OID ) )
3243                 {
3244                         ObjectClass *asserted_oc = oc_find( asserted->bv_val );
3245                         ObjectClass *stored_oc = oc_find( stored );
3246
3247                         if( asserted_oc == NULL ) {
3248                                 rc = SLAPD_COMPARE_UNDEFINED;
3249                         } else {
3250                                 match = asserted_oc != stored_oc;
3251                         }
3252                 }
3253
3254                 ch_free( stored );
3255         }
3256
3257         Debug( LDAP_DEBUG_ARGS, "objectIdentifierFirstComponentMatch "
3258                 "%d\n\t\"%s\"\n\t\"%s\"\n",
3259             match, value->bv_val, asserted->bv_val );
3260
3261         if( rc == LDAP_SUCCESS ) *matchp = match;
3262         return rc;
3263 }
3264
3265 static int
3266 check_time_syntax (struct berval *val,
3267         int start,
3268         int *parts)
3269 {
3270         static int ceiling[9] = { 99, 99, 11, 30, 23, 59, 59, 12, 59 };
3271         static int mdays[2][12] = {
3272                 /* non-leap years */
3273                 { 30, 27, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 },
3274                 /* leap years */
3275                 { 30, 28, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 }
3276         };
3277         char *p, *e;
3278         int part, c, tzoffset, leapyear = 0 ;
3279
3280         if( val->bv_len == 0 ) {
3281                 return LDAP_INVALID_SYNTAX;
3282         }
3283
3284         p = (char *)val->bv_val;
3285         e = p + val->bv_len;
3286
3287         /* Ignore initial whitespace */
3288         while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3289                 p++;
3290         }
3291
3292         if (e - p < 13 - (2 * start)) {
3293                 return LDAP_INVALID_SYNTAX;
3294         }
3295
3296         for (part = 0; part < 9; part++) {
3297                 parts[part] = 0;
3298         }
3299
3300         for (part = start; part < 7; part++) {
3301                 c = *p;
3302                 if ((part == 6) && (c == 'Z' || c == '+' || c == '-')) {
3303                         part++;
3304                         break;
3305                 }
3306                 p++;
3307                 c -= '0';
3308                 if (p == e) {
3309                         return LDAP_INVALID_SYNTAX;
3310                 }
3311                 if (c < 0 || c > 9) {
3312                         return LDAP_INVALID_SYNTAX;
3313                 }
3314                 parts[part] = c;
3315
3316                 c = *p++ - '0';
3317                 if (p == e) {
3318                         return LDAP_INVALID_SYNTAX;
3319                 }
3320                 if (c < 0 || c > 9) {
3321                         return LDAP_INVALID_SYNTAX;
3322                 }
3323                 parts[part] *= 10;
3324                 parts[part] += c;
3325
3326                 if (part == 2 || part == 3) {
3327                         parts[part]--;
3328                 }
3329                 if (parts[part] < 0) {
3330                         return LDAP_INVALID_SYNTAX;
3331                 }
3332                 if (parts[part] > ceiling[part]) {
3333                         return LDAP_INVALID_SYNTAX;
3334                 }
3335         }
3336
3337         /* leapyear check for the Gregorian calendar (year>1581) */
3338         if (((parts[1] % 4 == 0) && (parts[1] != 0)) ||
3339                 ((parts[0] % 4 == 0) && (parts[1] == 0)))
3340         {
3341                 leapyear = 1;
3342         }
3343
3344         if (parts[3] > mdays[leapyear][parts[2]]) {
3345                 return LDAP_INVALID_SYNTAX;
3346         }
3347
3348         c = *p++;
3349         if (c == 'Z') {
3350                 tzoffset = 0; /* UTC */
3351         } else if (c != '+' && c != '-') {
3352                 return LDAP_INVALID_SYNTAX;
3353         } else {
3354                 if (c == '-') {
3355                         tzoffset = -1;
3356                 } else /* c == '+' */ {
3357                         tzoffset = 1;
3358                 }
3359
3360                 if (p > e - 4) {
3361                         return LDAP_INVALID_SYNTAX;
3362                 }
3363
3364                 for (part = 7; part < 9; part++) {
3365                         c = *p++ - '0';
3366                         if (c < 0 || c > 9) {
3367                                 return LDAP_INVALID_SYNTAX;
3368                         }
3369                         parts[part] = c;
3370
3371                         c = *p++ - '0';
3372                         if (c < 0 || c > 9) {
3373                                 return LDAP_INVALID_SYNTAX;
3374                         }
3375                         parts[part] *= 10;
3376                         parts[part] += c;
3377                         if (parts[part] < 0 || parts[part] > ceiling[part]) {
3378                                 return LDAP_INVALID_SYNTAX;
3379                         }
3380                 }
3381         }
3382
3383         /* Ignore trailing whitespace */
3384         while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3385                 p++;
3386         }
3387         if (p != e) {
3388                 return LDAP_INVALID_SYNTAX;
3389         }
3390
3391         switch ( tzoffset ) {
3392         case -1: /* negativ offset to UTC, ie west of Greenwich  */
3393                 parts[4] += parts[7];
3394                 parts[5] += parts[8];
3395                 for (part = 6; --part > 0; ) { /* offset is just hhmm, no seconds */
3396                         if (part != 3) {
3397                                 c = ceiling[part];
3398                         } else {
3399                                 c = mdays[leapyear][parts[2]];
3400                         }
3401                         if (parts[part] > c) {
3402                                 parts[part] -= c + 1;
3403                                 parts[part - 1]++;
3404                         }
3405                 }
3406                 break;
3407         case 1: /* positive offset to UTC, ie east of Greenwich */
3408                 parts[4] -= parts[7];
3409                 parts[5] -= parts[8];
3410                 for (part = 6; --part > 0; ) {
3411                         if (part != 3) {
3412                                 c = ceiling[part];
3413                         } else {
3414                                 /* first arg to % needs to be non negativ */
3415                                 c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
3416                         }
3417                         if (parts[part] < 0) {
3418                                 parts[part] += c + 1;
3419                                 parts[part - 1]--;
3420                         }
3421                 }
3422                 break;
3423         case 0: /* already UTC */
3424                 break;
3425         }
3426
3427         return LDAP_SUCCESS;
3428 }
3429
3430 static int
3431 utcTimeNormalize(
3432         Syntax *syntax,
3433         struct berval *val,
3434         struct berval **normalized )
3435 {
3436         struct berval *out;
3437         int parts[9], rc;
3438
3439         rc = check_time_syntax(val, 1, parts);
3440         if (rc != LDAP_SUCCESS) {
3441                 return rc;
3442         }
3443
3444         *normalized = NULL;
3445         out = ch_malloc( sizeof(struct berval) );
3446         if( out == NULL ) {
3447                 return LBER_ERROR_MEMORY;
3448         }
3449
3450         out->bv_val = ch_malloc( 14 );
3451         if ( out->bv_val == NULL ) {
3452                 ch_free( out );
3453                 return LBER_ERROR_MEMORY;
3454         }
3455
3456         sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ldZ",
3457                 parts[1], parts[2] + 1, parts[3] + 1,
3458                 parts[4], parts[5], parts[6] );
3459         out->bv_len = 13;
3460         *normalized = out;
3461
3462         return LDAP_SUCCESS;
3463 }
3464
3465 static int
3466 utcTimeValidate(
3467         Syntax *syntax,
3468         struct berval *in )
3469 {
3470         int parts[9];
3471
3472         return check_time_syntax(in, 1, parts);
3473 }
3474
3475 static int
3476 generalizedTimeValidate(
3477         Syntax *syntax,
3478         struct berval *in )
3479 {
3480         int parts[9];
3481
3482         return check_time_syntax(in, 0, parts);
3483 }
3484
3485 static int
3486 generalizedTimeNormalize(
3487         Syntax *syntax,
3488         struct berval *val,
3489         struct berval **normalized )
3490 {
3491         struct berval *out;
3492         int parts[9], rc;
3493
3494         rc = check_time_syntax(val, 0, parts);
3495         if (rc != LDAP_SUCCESS) {
3496                 return rc;
3497         }
3498
3499         *normalized = NULL;
3500         out = ch_malloc( sizeof(struct berval) );
3501         if( out == NULL ) {
3502                 return LBER_ERROR_MEMORY;
3503         }
3504
3505         out->bv_val = ch_malloc( 16 );
3506         if ( out->bv_val == NULL ) {
3507                 ch_free( out );
3508                 return LBER_ERROR_MEMORY;
3509         }
3510
3511         sprintf( out->bv_val, "%02ld%02ld%02ld%02ld%02ld%02ld%02ldZ",
3512                 parts[0], parts[1], parts[2] + 1, parts[3] + 1,
3513                 parts[4], parts[5], parts[6] );
3514         out->bv_len = 15;
3515         *normalized = out;
3516
3517         return LDAP_SUCCESS;
3518 }
3519
3520 static int
3521 nisNetgroupTripleValidate(
3522         Syntax *syntax,
3523         struct berval *val )
3524 {
3525         char *p, *e;
3526         int commas = 0;
3527
3528         if ( val->bv_len == 0 ) {
3529                 return LDAP_INVALID_SYNTAX;
3530         }
3531
3532         p = (char *)val->bv_val;
3533         e = p + val->bv_len;
3534
3535 #if 0
3536         /* syntax does not allow leading white space */
3537         /* Ignore initial whitespace */
3538         while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3539                 p++;
3540         }
3541 #endif
3542
3543         if ( *p != '(' /*')'*/ ) {
3544                 return LDAP_INVALID_SYNTAX;
3545         }
3546
3547         for ( p++; ( p < e ) && ( *p != ')' ); p++ ) {
3548                 if ( *p == ',' ) {
3549                         commas++;
3550                         if ( commas > 2 ) {
3551                                 return LDAP_INVALID_SYNTAX;
3552                         }
3553
3554                 } else if ( !ATTR_CHAR( *p ) ) {
3555                         return LDAP_INVALID_SYNTAX;
3556                 }
3557         }
3558
3559         if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
3560                 return LDAP_INVALID_SYNTAX;
3561         }
3562
3563         p++;
3564
3565 #if 0
3566         /* syntax does not allow trailing white space */
3567         /* Ignore trailing whitespace */
3568         while ( ( p < e ) && ASCII_SPACE( *p ) ) {
3569                 p++;
3570         }
3571 #endif
3572
3573         if (p != e) {
3574                 return LDAP_INVALID_SYNTAX;
3575         }
3576
3577         return LDAP_SUCCESS;
3578 }
3579
3580 static int
3581 bootParameterValidate(
3582         Syntax *syntax,
3583         struct berval *val )
3584 {
3585         char *p, *e;
3586
3587         if ( val->bv_len == 0 ) {
3588                 return LDAP_INVALID_SYNTAX;
3589         }
3590
3591         p = (char *)val->bv_val;
3592         e = p + val->bv_len;
3593
3594         /* key */
3595         for (; ( p < e ) && ( *p != '=' ); p++ ) {
3596                 if ( !ATTR_CHAR( *p ) ) {
3597                         return LDAP_INVALID_SYNTAX;
3598                 }
3599         }
3600
3601         if ( *p != '=' ) {
3602                 return LDAP_INVALID_SYNTAX;
3603         }
3604
3605         /* server */
3606         for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
3607                 if ( !ATTR_CHAR( *p ) ) {
3608                         return LDAP_INVALID_SYNTAX;
3609                 }
3610         }
3611
3612         if ( *p != ':' ) {
3613                 return LDAP_INVALID_SYNTAX;
3614         }
3615
3616         /* path */
3617         for ( p++; p < e; p++ ) {
3618                 if ( !ATTR_CHAR( *p ) ) {
3619                         return LDAP_INVALID_SYNTAX;
3620                 }
3621         }
3622
3623         return LDAP_SUCCESS;
3624 }
3625
3626 struct syntax_defs_rec {
3627         char *sd_desc;
3628         int sd_flags;
3629         slap_syntax_validate_func *sd_validate;
3630         slap_syntax_transform_func *sd_normalize;
3631         slap_syntax_transform_func *sd_pretty;
3632 #ifdef SLAPD_BINARY_CONVERSION
3633         slap_syntax_transform_func *sd_ber2str;
3634         slap_syntax_transform_func *sd_str2ber;
3635 #endif
3636 };
3637
3638 #define X_HIDE "X-HIDE 'TRUE' "
3639 #define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
3640 #define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
3641
3642 struct syntax_defs_rec syntax_defs[] = {
3643         {"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' " X_BINARY X_NOT_H_R ")",
3644                 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
3645         {"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
3646                 0, NULL, NULL, NULL},
3647         {"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
3648                 0, NULL, NULL, NULL},
3649         {"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' " X_NOT_H_R ")",
3650                 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
3651         {"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' " X_BINARY X_NOT_H_R ")",
3652                 SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3653         {"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
3654                 0, bitStringValidate, NULL, NULL },
3655         {"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
3656                 0, booleanValidate, NULL, NULL},
3657         {"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
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.9 DESC 'Certificate List' "
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.10 DESC 'Certificate Pair' "
3664                 X_BINARY X_NOT_H_R ")",
3665                 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3666         {"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
3667                 0, NULL, NULL, NULL},
3668         {"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
3669                 0, dnValidate, dnNormalize, dnPretty},
3670         {"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
3671                 0, NULL, NULL, NULL},
3672         {"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
3673                 0, NULL, NULL, NULL},
3674         {"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
3675                 0, UTF8StringValidate, UTF8StringNormalize, NULL},
3676         {"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
3677                 0, NULL, NULL, NULL},
3678         {"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
3679                 0, NULL, NULL, NULL},
3680         {"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
3681                 0, NULL, NULL, NULL},
3682         {"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
3683                 0, NULL, NULL, NULL},
3684         {"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
3685                 0, NULL, NULL, NULL},
3686         {"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
3687                 0, IA5StringValidate, faxNumberNormalize, NULL},
3688         {"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
3689                 SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
3690         {"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
3691                 0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
3692         {"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
3693                 0, NULL, NULL, NULL},
3694         {"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
3695                 0, IA5StringValidate, IA5StringNormalize, NULL},
3696         {"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
3697                 0, integerValidate, integerNormalize, integerPretty},
3698         {"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
3699                 SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
3700         {"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
3701                 0, NULL, NULL, NULL},
3702         {"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
3703                 0, NULL, NULL, NULL},
3704         {"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
3705                 0, NULL, NULL, NULL},
3706         {"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
3707                 0, NULL, NULL, NULL},
3708         {"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
3709                 0, NULL, NULL, NULL},
3710         {"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
3711                 0, nameUIDValidate, nameUIDNormalize, NULL},
3712         {"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
3713                 0, NULL, NULL, NULL},
3714         {"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
3715                 0, IA5StringValidate, numericStringNormalize, NULL},
3716         {"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
3717                 0, NULL, NULL, NULL},
3718         {"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
3719                 0, oidValidate, NULL, NULL},
3720         {"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
3721                 0, NULL, NULL, NULL},
3722         {"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
3723                 0, blobValidate, NULL, NULL},
3724         {"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
3725                 0, blobValidate, NULL, NULL},
3726         {"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
3727                 0, NULL, NULL, NULL},
3728         {"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
3729                 0, NULL, NULL, NULL},
3730         {"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
3731                 0, printableStringValidate, NULL, NULL},
3732         {"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
3733                 X_BINARY X_NOT_H_R ")",
3734                 SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
3735         {"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
3736                 0, IA5StringValidate, phoneNumberNormalize, NULL},
3737         {"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
3738                 0, NULL, NULL, NULL},
3739         {"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
3740                 0, IA5StringValidate, telexNumberNormalize, NULL},
3741         {"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
3742                 0, utcTimeValidate, utcTimeNormalize, NULL},
3743         {"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
3744                 0, NULL, NULL, NULL},
3745         {"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
3746                 0, NULL, NULL, NULL},
3747         {"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
3748                 0, NULL, NULL, NULL},
3749         {"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
3750                 0, NULL, NULL, NULL},
3751         {"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
3752                 0, NULL, NULL, NULL},
3753
3754         /* RFC 2307 NIS Syntaxes */
3755         {"( 1.3.6.1.1.1.0.0  DESC 'RFC2307 NIS Netgroup Triple' )",
3756                 0, nisNetgroupTripleValidate, NULL, NULL},
3757         {"( 1.3.6.1.1.1.0.1  DESC 'RFC2307 Boot Parameter' )",
3758                 0, bootParameterValidate, NULL, NULL},
3759
3760         /* OpenLDAP Experimental Syntaxes */
3761         {"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
3762                 0, IA5StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */,
3763                 NULL, NULL},
3764         {"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
3765                 0, NULL, NULL, NULL},
3766
3767         /* OpenLDAP Void Syntax */
3768         {"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' " X_HIDE ")" ,
3769                 SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
3770         {NULL, 0, NULL, NULL, NULL}
3771 };
3772
3773 struct mrule_defs_rec {
3774         char *                                          mrd_desc;
3775         slap_mask_t                                     mrd_usage;
3776         slap_mr_convert_func *          mrd_convert;
3777         slap_mr_normalize_func *        mrd_normalize;
3778         slap_mr_match_func *            mrd_match;
3779         slap_mr_indexer_func *          mrd_indexer;
3780         slap_mr_filter_func *           mrd_filter;
3781
3782         char *                                          mrd_associated;
3783 };
3784
3785 /*
3786  * Other matching rules in X.520 that we do not use (yet):
3787  *
3788  * 2.5.13.9             numericStringOrderingMatch
3789  * 2.5.13.15    integerOrderingMatch
3790  * 2.5.13.18    octetStringOrderingMatch
3791  * 2.5.13.19    octetStringSubstringsMatch
3792  * 2.5.13.25    uTCTimeMatch
3793  * 2.5.13.26    uTCTimeOrderingMatch
3794  * 2.5.13.31    directoryStringFirstComponentMatch
3795  * 2.5.13.32    wordMatch
3796  * 2.5.13.33    keywordMatch
3797  * 2.5.13.34    certificateExactMatch
3798  * 2.5.13.35    certificateMatch
3799  * 2.5.13.36    certificatePairExactMatch
3800  * 2.5.13.37    certificatePairMatch
3801  * 2.5.13.38    certificateListExactMatch
3802  * 2.5.13.39    certificateListMatch
3803  * 2.5.13.40    algorithmIdentifierMatch
3804  * 2.5.13.41    storedPrefixMatch
3805  * 2.5.13.42    attributeCertificateMatch
3806  * 2.5.13.43    readerAndKeyIDMatch
3807  * 2.5.13.44    attributeIntegrityMatch
3808  */
3809
3810 struct mrule_defs_rec mrule_defs[] = {
3811         /*
3812          * EQUALITY matching rules must be listed after associated APPROX
3813          * matching rules.  So, we list all APPROX matching rules first.
3814          */
3815         {"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
3816                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3817                 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
3818                 NULL, NULL,
3819                 directoryStringApproxMatch, NULL, NULL,
3820                 NULL},
3821
3822         {"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
3823                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
3824                 SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
3825                 NULL, NULL,
3826                 IA5StringApproxMatch, NULL, NULL,
3827                 NULL},
3828
3829         /*
3830          * Other matching rules
3831          */
3832
3833         {"( 2.5.13.0 NAME 'objectIdentifierMatch' "
3834                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
3835                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3836                 NULL, NULL,
3837                 objectIdentifierMatch, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
3838                 NULL},
3839
3840         {"( 2.5.13.1 NAME 'distinguishedNameMatch' "
3841                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
3842                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3843                 NULL, NULL,
3844                 dnMatch, dnIndexer, dnFilter,
3845                 NULL},
3846
3847         {"( 2.5.13.2 NAME 'caseIgnoreMatch' "
3848                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3849                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3850                 NULL, NULL,
3851                 caseIgnoreMatch, caseIgnoreIndexer, caseIgnoreFilter,
3852                 directoryStringApproxMatchOID },
3853
3854         {"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
3855                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3856                 SLAP_MR_ORDERING,
3857                 NULL, NULL,
3858                 caseIgnoreOrderingMatch, NULL, NULL,
3859                 NULL},
3860
3861         {"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
3862                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3863                 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3864                 NULL, NULL,
3865                 caseIgnoreSubstringsMatch,
3866                 caseIgnoreSubstringsIndexer,
3867                 caseIgnoreSubstringsFilter,
3868                 NULL},
3869
3870         {"( 2.5.13.5 NAME 'caseExactMatch' "
3871                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3872                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3873                 NULL, NULL,
3874                 caseExactMatch, caseExactIndexer, caseExactFilter,
3875                 directoryStringApproxMatchOID },
3876
3877         {"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
3878                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
3879                 SLAP_MR_ORDERING,
3880                 NULL, NULL,
3881                 caseExactOrderingMatch, NULL, NULL,
3882                 NULL},
3883
3884         {"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
3885                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3886                 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3887                 NULL, NULL,
3888                 caseExactSubstringsMatch,
3889                 caseExactSubstringsIndexer,
3890                 caseExactSubstringsFilter,
3891                 NULL},
3892
3893         {"( 2.5.13.8 NAME 'numericStringMatch' "
3894                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
3895                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3896                 NULL, NULL,
3897                 caseIgnoreIA5Match, NULL, NULL,
3898                 NULL},
3899
3900         {"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
3901                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3902                 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3903                 NULL, NULL,
3904                 caseIgnoreIA5SubstringsMatch,
3905                 caseIgnoreIA5SubstringsIndexer,
3906                 caseIgnoreIA5SubstringsFilter,
3907                 NULL},
3908
3909         {"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
3910                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
3911                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3912                 NULL, NULL,
3913                 caseIgnoreListMatch, NULL, NULL,
3914                 NULL},
3915
3916         {"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
3917                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3918                 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3919                 NULL, NULL,
3920                 caseIgnoreListSubstringsMatch, NULL, NULL,
3921                 NULL},
3922
3923         {"( 2.5.13.13 NAME 'booleanMatch' "
3924                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
3925                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3926                 NULL, NULL,
3927                 booleanMatch, NULL, NULL,
3928                 NULL},
3929
3930         {"( 2.5.13.14 NAME 'integerMatch' "
3931                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
3932                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3933                 NULL, NULL,
3934                 integerMatch, integerIndexer, integerFilter,
3935                 NULL},
3936
3937         {"( 2.5.13.16 NAME 'bitStringMatch' "
3938                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
3939                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3940                 NULL, NULL,
3941                 bitStringMatch, NULL, NULL,
3942                 NULL},
3943
3944         {"( 2.5.13.17 NAME 'octetStringMatch' "
3945                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
3946                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3947                 NULL, NULL,
3948                 octetStringMatch, octetStringIndexer, octetStringFilter,
3949                 NULL},
3950
3951         {"( 2.5.13.20 NAME 'telephoneNumberMatch' "
3952                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
3953                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3954                 NULL, NULL,
3955                 telephoneNumberMatch, NULL, NULL,
3956                 NULL},
3957
3958         {"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
3959                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
3960                 SLAP_MR_SUBSTR | SLAP_MR_EXT,
3961                 NULL, NULL,
3962                 telephoneNumberSubstringsMatch, NULL, NULL,
3963                 NULL},
3964
3965         {"( 2.5.13.22 NAME 'presentationAddressMatch' "
3966                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
3967                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3968                 NULL, NULL,
3969                 presentationAddressMatch, NULL, NULL,
3970                 NULL},
3971
3972         {"( 2.5.13.23 NAME 'uniqueMemberMatch' "
3973                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
3974                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3975                 NULL, NULL,
3976                 uniqueMemberMatch, NULL, NULL,
3977                 NULL},
3978
3979         {"( 2.5.13.24 NAME 'protocolInformationMatch' "
3980                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
3981                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3982                 NULL, NULL,
3983                 protocolInformationMatch, NULL, NULL,
3984                 NULL},
3985
3986         {"( 2.5.13.27 NAME 'generalizedTimeMatch' "
3987                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
3988                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
3989                 NULL, NULL,
3990                 generalizedTimeMatch, NULL, NULL,
3991                 NULL},
3992
3993         {"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
3994                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
3995                 SLAP_MR_ORDERING,
3996                 NULL, NULL,
3997                 generalizedTimeOrderingMatch, NULL, NULL,
3998                 NULL},
3999
4000         {"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
4001                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
4002                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4003                 NULL, NULL,
4004                 integerFirstComponentMatch, NULL, NULL,
4005                 NULL},
4006
4007         {"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
4008                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
4009                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4010                 NULL, NULL,
4011                 objectIdentifierFirstComponentMatch, NULL, NULL,
4012                 NULL},
4013
4014         {"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
4015                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4016                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4017                 NULL, NULL,
4018                 caseExactIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
4019                 IA5StringApproxMatchOID },
4020
4021         {"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
4022                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4023                 SLAP_MR_EQUALITY | SLAP_MR_EXT,
4024                 NULL, NULL,
4025                 caseIgnoreIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
4026                 IA5StringApproxMatchOID },
4027
4028         {"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
4029                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4030                 SLAP_MR_SUBSTR,
4031                 NULL, NULL,
4032                 caseIgnoreIA5SubstringsMatch,
4033                 caseIgnoreIA5SubstringsIndexer,
4034                 caseIgnoreIA5SubstringsFilter,
4035                 NULL},
4036
4037         {"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
4038                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
4039                 SLAP_MR_SUBSTR,
4040                 NULL, NULL,
4041                 caseExactIA5SubstringsMatch,
4042                 caseExactIA5SubstringsIndexer,
4043                 caseExactIA5SubstringsFilter,
4044                 NULL},
4045
4046         {"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
4047                 "SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
4048                 SLAP_MR_EQUALITY,
4049                 NULL, NULL,
4050                 authPasswordMatch, NULL, NULL,
4051                 NULL},
4052
4053         {"( 1.3.6.1.4.1.4203.666.4.2 NAME 'OpenLDAPaciMatch' "
4054                 "SYNTAX 1.3.6.1.4.1.4203.666.2.1 )",
4055                 SLAP_MR_EQUALITY,
4056                 NULL, NULL,
4057                 OpenLDAPaciMatch, NULL, NULL,
4058                 NULL},
4059
4060         {NULL, SLAP_MR_NONE, NULL, NULL, NULL, NULL}
4061 };
4062
4063 int
4064 schema_init( void )
4065 {
4066         int             res;
4067         int             i;
4068
4069         /* we should only be called once (from main) */
4070         assert( schema_init_done == 0 );
4071
4072         for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
4073                 res = register_syntax( syntax_defs[i].sd_desc,
4074                     syntax_defs[i].sd_flags,
4075                     syntax_defs[i].sd_validate,
4076                     syntax_defs[i].sd_normalize,
4077                         syntax_defs[i].sd_pretty
4078 #ifdef SLAPD_BINARY_CONVERSION
4079                         ,
4080                     syntax_defs[i].sd_ber2str,
4081                         syntax_defs[i].sd_str2ber
4082 #endif
4083                 );
4084
4085                 if ( res ) {
4086                         fprintf( stderr, "schema_init: Error registering syntax %s\n",
4087                                  syntax_defs[i].sd_desc );
4088                         return LDAP_OTHER;
4089                 }
4090         }
4091
4092         for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
4093                 if( mrule_defs[i].mrd_usage == SLAP_MR_NONE ) {
4094                         fprintf( stderr,
4095                                 "schema_init: Ingoring unusable matching rule %s\n",
4096                                  mrule_defs[i].mrd_desc );
4097                         continue;
4098                 }
4099
4100                 res = register_matching_rule(
4101                         mrule_defs[i].mrd_desc,
4102                         mrule_defs[i].mrd_usage,
4103                         mrule_defs[i].mrd_convert,
4104                         mrule_defs[i].mrd_normalize,
4105                     mrule_defs[i].mrd_match,
4106                         mrule_defs[i].mrd_indexer,
4107                         mrule_defs[i].mrd_filter,
4108                         mrule_defs[i].mrd_associated );
4109
4110                 if ( res ) {
4111                         fprintf( stderr,
4112                                 "schema_init: Error registering matching rule %s\n",
4113                                  mrule_defs[i].mrd_desc );
4114                         return LDAP_OTHER;
4115                 }
4116         }
4117         schema_init_done = 1;
4118         return LDAP_SUCCESS;
4119 }