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

   1 /* dn.c - routines for dealing with distinguished names */
   2 /* $OpenLDAP$ */
   3 /*
   4  * Copyright 1998-2003 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/socket.h>
  14 #include <ac/string.h>
  15 #include <ac/time.h>
  16
  17 #include "ldap_pvt.h"
  18
  19 #include "slap.h"
  20
  21 #include "lutil.h"
  22
  23 /*
  24  * The DN syntax-related functions take advantage of the dn representation
  25  * handling functions ldap_str2dn/ldap_dn2str.  The latter are not schema-
  26  * aware, so the attributes and their values need be validated (and possibly
  27  * normalized).  In the current implementation the required validation/nor-
  28  * malization/"pretty"ing are done on newly created DN structural represen-
  29  * tations; however the idea is to move towards DN handling in structural
  30  * representation instead of the current string representation.  To this
  31  * purpose, we need to do only the required operations and keep track of
  32  * what has been done to minimize their impact on performances.
  33  *
  34  * Developers are strongly encouraged to use this feature, to speed-up
  35  * its stabilization.
  36  */
  37
  38 #define AVA_PRIVATE( ava ) ( ( AttributeDescription * )(ava)->la_private )
  39
  40 /*
  41  * In-place, schema-aware validation of the
  42  * structural representation of a distinguished name.
  43  */
  44 static int
  45 LDAPDN_validate( LDAPDN dn )
  46 {
  47         int             iRDN;
  48         int             rc;
  49
  50         assert( dn );
  51
  52         for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
  53                 LDAPRDN         rdn = dn[ iRDN ];
  54                 int             iAVA;
  55
  56                 assert( rdn );
  57
  58                 for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
  59                         LDAPAVA                 *ava = rdn[ iAVA ];
  60                         AttributeDescription    *ad;
  61                         slap_syntax_validate_func *validate = NULL;
  62
  63                         assert( ava );
  64
  65                         if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
  66                                 const char      *text = NULL;
  67
  68                                 rc = slap_bv2ad( &ava->la_attr, &ad, &text );
  69                                 if ( rc != LDAP_SUCCESS ) {
  70                                         return LDAP_INVALID_SYNTAX;
  71                                 }
  72
  73                                 ava->la_private = ( void * )ad;
  74                         }
  75
  76                         /*
  77                          * Replace attr oid/name with the canonical name
  78                          */
  79                         ava->la_attr = ad->ad_cname;
  80
  81                         validate = ad->ad_type->sat_syntax->ssyn_validate;
  82
  83                         if ( validate ) {
  84                                 /*
  85                                  * validate value by validate function
  86                                  */
  87                                 rc = ( *validate )( ad->ad_type->sat_syntax,
  88                                         &ava->la_value );
  89
  90                                 if ( rc != LDAP_SUCCESS ) {
  91                                         return LDAP_INVALID_SYNTAX;
  92                                 }
  93                         }
  94                 }
  95         }
  96
  97         return LDAP_SUCCESS;
  98 }
  99
 100 /*
 101  * dn validate routine
 102  */
 103 int
 104 dnValidate(
 105         Syntax *syntax,
 106         struct berval *in )
 107 {
 108         int             rc;
 109         LDAPDN          dn = NULL;
 110
 111         assert( in );
 112
 113         if ( in->bv_len == 0 ) {
 114                 return LDAP_SUCCESS;
 115
 116         } else if ( in->bv_len > SLAP_LDAPDN_MAXLEN ) {
 117                 return LDAP_INVALID_SYNTAX;
 118         }
 119
 120         rc = ldap_bv2dn( in, &dn, LDAP_DN_FORMAT_LDAP );
 121         if ( rc != LDAP_SUCCESS ) {
 122                 return LDAP_INVALID_SYNTAX;
 123         }
 124
 125         assert( strlen( in->bv_val ) == in->bv_len );
 126
 127         /*
 128          * Schema-aware validate
 129          */
 130         rc = LDAPDN_validate( dn );
 131         ldap_dnfree( dn );
 132
 133         if ( rc != LDAP_SUCCESS ) {
 134                 return LDAP_INVALID_SYNTAX;
 135         }
 136
 137         return LDAP_SUCCESS;
 138 }
 139
 140 /*
 141  * AVA sorting inside a RDN
 142  *
 143  * rule: sort attributeTypes in alphabetical order; in case of multiple
 144  * occurrences of the same attributeType, sort values in byte order
 145  * (use memcmp, which implies alphabetical order in case of IA5 value;
 146  * this should guarantee the repeatability of the operation).
 147  *
 148  * Note: the sorting can be slightly improved by sorting first
 149  * by attribute type length, then by alphabetical order.
 150  *
 151  * uses a linear search; should be fine since the number of AVAs in
 152  * a RDN should be limited.
 153  */
 154 static void
 155 AVA_Sort( LDAPRDN rdn, int iAVA )
 156 {
 157         int             i;
 158         LDAPAVA         *ava_in = rdn[ iAVA ];
 159
 160         assert( rdn );
 161         assert( ava_in );
 162
 163         for ( i = 0; i < iAVA; i++ ) {
 164                 LDAPAVA         *ava = rdn[ i ];
 165                 int             a, j;
 166
 167                 assert( ava );
 168
 169                 a = strcmp( ava_in->la_attr.bv_val, ava->la_attr.bv_val );
 170
 171                 if ( a > 0 ) {
 172                         break;
 173                 }
 174
 175                 while ( a == 0 ) {
 176                         int             v, d;
 177
 178                         d = ava_in->la_value.bv_len - ava->la_value.bv_len;
 179
 180                         v = memcmp( ava_in->la_value.bv_val,
 181                                         ava->la_value.bv_val,
 182                                         d <= 0 ? ava_in->la_value.bv_len
 183                                                 : ava->la_value.bv_len );
 184
 185                         if ( v == 0 && d != 0 ) {
 186                                 v = d;
 187                         }
 188
 189                         if ( v <= 0 ) {
 190                                 /*
 191                                  * got it!
 192                                  */
 193                                 break;
 194                         }
 195
 196                         if ( ++i == iAVA ) {
 197                                 /*
 198                                  * already sorted
 199                                  */
 200                                 return;
 201                         }
 202
 203                         ava = rdn[ i ];
 204                         a = strcmp( ava_in->la_attr.bv_val,
 205                                         ava->la_attr.bv_val );
 206                 }
 207
 208                 /*
 209                  * move ahead
 210                  */
 211                 for ( j = iAVA; j > i; j-- ) {
 212                         rdn[ j ] = rdn[ j - 1 ];
 213                 }
 214                 rdn[ i ] = ava_in;
 215
 216                 return;
 217         }
 218 }
 219
 220 /*
 221  * In-place, schema-aware normalization / "pretty"ing of the
 222  * structural representation of a distinguished name.
 223  */
 224 static int
 225 LDAPDN_rewrite( LDAPDN dn, unsigned flags, void *ctx )
 226 {
 227         int             iRDN;
 228         int             rc;
 229
 230         assert( dn );
 231
 232         for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
 233                 LDAPRDN         rdn = dn[ iRDN ];
 234                 int             iAVA;
 235
 236                 assert( rdn );
 237
 238                 for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
 239                         LDAPAVA                 *ava = rdn[ iAVA ];
 240                         AttributeDescription    *ad;
 241                         slap_syntax_validate_func *validf = NULL;
 242                         slap_mr_normalize_func *normf = NULL;
 243                         slap_syntax_transform_func *transf = NULL;
 244                         MatchingRule *mr = NULL;
 245                         struct berval           bv = { 0, NULL };
 246                         int                     do_sort = 0;
 247
 248                         assert( ava );
 249
 250                         if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
 251                                 const char      *text = NULL;
 252
 253                                 rc = slap_bv2ad( &ava->la_attr, &ad, &text );
 254                                 if ( rc != LDAP_SUCCESS ) {
 255                                         return LDAP_INVALID_SYNTAX;
 256                                 }
 257
 258                                 ava->la_private = ( void * )ad;
 259                                 do_sort = 1;
 260                         }
 261
 262                         /*
 263                          * Replace attr oid/name with the canonical name
 264                          */
 265                         ava->la_attr = ad->ad_cname;
 266
 267                         if( ava->la_flags & LDAP_AVA_BINARY ) {
 268                                 if( ava->la_value.bv_len == 0 ) {
 269                                         /* BER encoding is empty */
 270                                         return LDAP_INVALID_SYNTAX;
 271                                 }
 272
 273                                 /* AVA is binary encoded, don't muck with it */
 274                         } else if( flags & SLAP_LDAPDN_PRETTY ) {
 275                                 transf = ad->ad_type->sat_syntax->ssyn_pretty;
 276                                 if( !transf ) {
 277                                         validf = ad->ad_type->sat_syntax->ssyn_validate;
 278                                 }
 279                         } else { /* normalization */
 280                                 validf = ad->ad_type->sat_syntax->ssyn_validate;
 281                                 mr = ad->ad_type->sat_equality;
 282                                 if( mr ) normf = mr->smr_normalize;
 283                         }
 284
 285                         if ( validf ) {
 286                                 /* validate value before normalization */
 287                                 rc = ( *validf )( ad->ad_type->sat_syntax,
 288                                         ava->la_value.bv_len
 289                                                 ? &ava->la_value
 290                                                 : (struct berval *) &slap_empty_bv );
 291
 292                                 if ( rc != LDAP_SUCCESS ) {
 293                                         return LDAP_INVALID_SYNTAX;
 294                                 }
 295                         }
 296
 297                         if ( transf ) {
 298                                 /*
 299                                  * transform value by pretty function
 300                                  *      if value is empty, use empty_bv
 301                                  */
 302                                 rc = ( *transf )( ad->ad_type->sat_syntax,
 303                                         ava->la_value.bv_len
 304                                                 ? &ava->la_value
 305                                                 : (struct berval *) &slap_empty_bv,
 306                                         &bv, ctx );
 307
 308                                 if ( rc != LDAP_SUCCESS ) {
 309                                         return LDAP_INVALID_SYNTAX;
 310                                 }
 311                         }
 312
 313                         if ( normf ) {
 314                                 /*
 315                                  * normalize value
 316                                  *      if value is empty, use empty_bv
 317                                  */
 318                                 rc = ( *normf )(
 319                                         0,
 320                                         ad->ad_type->sat_syntax,
 321                                         mr,
 322                                         ava->la_value.bv_len
 323                                                 ? &ava->la_value
 324                                                 : (struct berval *) &slap_empty_bv,
 325                                         &bv, ctx );
 326
 327                                 if ( rc != LDAP_SUCCESS ) {
 328                                         return LDAP_INVALID_SYNTAX;
 329                                 }
 330                         }
 331
 332
 333                         if( bv.bv_val ) {
 334                                 ber_memfree_x( ava->la_value.bv_val, ctx );
 335                                 ava->la_value = bv;
 336                         }
 337
 338                         if( do_sort ) AVA_Sort( rdn, iAVA );
 339                 }
 340         }
 341
 342         return LDAP_SUCCESS;
 343 }
 344
 345 int
 346 dnNormalize(
 347     slap_mask_t use,
 348     Syntax *syntax,
 349     MatchingRule *mr,
 350     struct berval *val,
 351     struct berval *out,
 352     void *ctx)
 353 {
 354         assert( val );
 355         assert( out );
 356
 357         Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val, 0, 0 );
 358
 359         if ( val->bv_len != 0 ) {
 360                 LDAPDN          dn = NULL;
 361                 int             rc;
 362
 363                 /*
 364                  * Go to structural representation
 365                  */
 366                 rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
 367                 if ( rc != LDAP_SUCCESS ) {
 368                         return LDAP_INVALID_SYNTAX;
 369                 }
 370
 371                 assert( strlen( val->bv_val ) == val->bv_len );
 372
 373                 /*
 374                  * Schema-aware rewrite
 375                  */
 376                 if ( LDAPDN_rewrite( dn, 0, ctx ) != LDAP_SUCCESS ) {
 377                         ldap_dnfree( dn );
 378                         return LDAP_INVALID_SYNTAX;
 379                 }
 380
 381                 /*
 382                  * Back to string representation
 383                  */
 384                 rc = ldap_dn2bv_x( dn, out,
 385                         LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
 386
 387                 ldap_dnfree_x( dn, ctx );
 388
 389                 if ( rc != LDAP_SUCCESS ) {
 390                         return LDAP_INVALID_SYNTAX;
 391                 }
 392         } else {
 393                 ber_dupbv_x( out, val, ctx );
 394         }
 395
 396         Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val, 0, 0 );
 397
 398         return LDAP_SUCCESS;
 399 }
 400
 401 int
 402 dnPretty(
 403         Syntax *syntax,
 404         struct berval *val,
 405         struct berval *out,
 406         void *ctx)
 407 {
 408         assert( val );
 409         assert( out );
 410
 411 #ifdef NEW_LOGGING
 412         LDAP_LOG( OPERATION, ARGS, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
 413 #else
 414         Debug( LDAP_DEBUG_TRACE, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
 415 #endif
 416
 417         if ( val->bv_len == 0 ) {
 418                 ber_dupbv_x( out, val, ctx );
 419
 420         } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
 421                 return LDAP_INVALID_SYNTAX;
 422
 423         } else {
 424                 LDAPDN          dn = NULL;
 425                 int             rc;
 426
 427                 /* FIXME: should be liberal in what we accept */
 428                 rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
 429                 if ( rc != LDAP_SUCCESS ) {
 430                         return LDAP_INVALID_SYNTAX;
 431                 }
 432
 433                 assert( strlen( val->bv_val ) == val->bv_len );
 434
 435                 /*
 436                  * Schema-aware rewrite
 437                  */
 438                 if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY, ctx ) != LDAP_SUCCESS ) {
 439                         ldap_dnfree_x( dn, ctx );
 440                         return LDAP_INVALID_SYNTAX;
 441                 }
 442
 443                 /* FIXME: not sure why the default isn't pretty */
 444                 /* RE: the default is the form that is used as
 445                  * an internal representation; the pretty form
 446                  * is a variant */
 447                 rc = ldap_dn2bv_x( dn, out,
 448                         LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
 449
 450                 ldap_dnfree_x( dn, ctx );
 451
 452                 if ( rc != LDAP_SUCCESS ) {
 453                         return LDAP_INVALID_SYNTAX;
 454                 }
 455         }
 456
 457         Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val, 0, 0 );
 458
 459         return LDAP_SUCCESS;
 460 }
 461
 462 int
 463 dnPrettyNormalDN(
 464         Syntax *syntax,
 465         struct berval *val,
 466         LDAPDN *dn,
 467         int flags,
 468         void *ctx )
 469 {
 470         assert( val );
 471         assert( dn );
 472
 473 #ifdef NEW_LOGGING
 474         LDAP_LOG( OPERATION, ARGS, ">>> dn%sDN: <%s>\n",
 475                         flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
 476                         val->bv_val, 0 );
 477 #else
 478         Debug( LDAP_DEBUG_TRACE, ">>> dn%sDN: <%s>\n",
 479                         flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
 480                         val->bv_val, 0 );
 481 #endif
 482
 483         if ( val->bv_len == 0 ) {
 484                 return LDAP_SUCCESS;
 485
 486         } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
 487                 return LDAP_INVALID_SYNTAX;
 488
 489         } else {
 490                 int             rc;
 491
 492                 /* FIXME: should be liberal in what we accept */
 493                 rc = ldap_bv2dn_x( val, dn, LDAP_DN_FORMAT_LDAP, ctx );
 494                 if ( rc != LDAP_SUCCESS ) {
 495                         return LDAP_INVALID_SYNTAX;
 496                 }
 497
 498                 assert( strlen( val->bv_val ) == val->bv_len );
 499
 500                 /*
 501                  * Schema-aware rewrite
 502                  */
 503                 if ( LDAPDN_rewrite( *dn, flags, ctx ) != LDAP_SUCCESS ) {
 504                         ldap_dnfree_x( *dn, ctx );
 505                         *dn = NULL;
 506                         return LDAP_INVALID_SYNTAX;
 507                 }
 508         }
 509
 510         Debug( LDAP_DEBUG_TRACE, "<<< dn%sDN\n",
 511                         flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
 512                         0, 0 );
 513
 514         return LDAP_SUCCESS;
 515 }
 516
 517 /*
 518  * Combination of both dnPretty and dnNormalize
 519  */
 520 int
 521 dnPrettyNormal(
 522         Syntax *syntax,
 523         struct berval *val,
 524         struct berval *pretty,
 525         struct berval *normal,
 526         void *ctx)
 527 {
 528 #ifdef NEW_LOGGING
 529         LDAP_LOG ( OPERATION, ENTRY, ">>> dnPrettyNormal: <%s>\n", val->bv_val, 0, 0 );
 530 #else
 531         Debug( LDAP_DEBUG_TRACE, ">>> dnPrettyNormal: <%s>\n", val->bv_val, 0, 0 );
 532 #endif
 533
 534         assert( val );
 535         assert( pretty );
 536         assert( normal );
 537
 538         if ( val->bv_len == 0 ) {
 539                 ber_dupbv_x( pretty, val, ctx );
 540                 ber_dupbv_x( normal, val, ctx );
 541
 542         } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
 543                 /* too big */
 544                 return LDAP_INVALID_SYNTAX;
 545
 546         } else {
 547                 LDAPDN          dn = NULL;
 548                 int             rc;
 549
 550                 pretty->bv_val = NULL;
 551                 normal->bv_val = NULL;
 552                 pretty->bv_len = 0;
 553                 normal->bv_len = 0;
 554
 555                 /* FIXME: should be liberal in what we accept */
 556                 rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
 557                 if ( rc != LDAP_SUCCESS ) {
 558                         return LDAP_INVALID_SYNTAX;
 559                 }
 560
 561                 assert( strlen( val->bv_val ) == val->bv_len );
 562
 563                 /*
 564                  * Schema-aware rewrite
 565                  */
 566                 if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY, ctx ) != LDAP_SUCCESS ) {
 567                         ldap_dnfree_x( dn, ctx );
 568                         return LDAP_INVALID_SYNTAX;
 569                 }
 570
 571                 rc = ldap_dn2bv_x( dn, pretty,
 572                         LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
 573
 574                 if ( rc != LDAP_SUCCESS ) {
 575                         ldap_dnfree_x( dn, ctx );
 576                         return LDAP_INVALID_SYNTAX;
 577                 }
 578
 579                 if ( LDAPDN_rewrite( dn, 0, ctx ) != LDAP_SUCCESS ) {
 580                         ldap_dnfree_x( dn, ctx );
 581                         ber_memfree_x( pretty->bv_val, ctx );
 582                         pretty->bv_val = NULL;
 583                         pretty->bv_len = 0;
 584                         return LDAP_INVALID_SYNTAX;
 585                 }
 586
 587                 rc = ldap_dn2bv_x( dn, normal,
 588                         LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
 589
 590                 ldap_dnfree_x( dn, ctx );
 591                 if ( rc != LDAP_SUCCESS ) {
 592                         ber_memfree_x( pretty->bv_val, ctx );
 593                         pretty->bv_val = NULL;
 594                         pretty->bv_len = 0;
 595                         return LDAP_INVALID_SYNTAX;
 596                 }
 597         }
 598
 599 #ifdef NEW_LOGGING
 600         LDAP_LOG (OPERATION, RESULTS, "<<< dnPrettyNormal: <%s>, <%s>\n",
 601                 pretty->bv_val, normal->bv_val, 0  );
 602 #else
 603         Debug( LDAP_DEBUG_TRACE, "<<< dnPrettyNormal: <%s>, <%s>\n",
 604                 pretty->bv_val, normal->bv_val, 0 );
 605 #endif
 606
 607         return LDAP_SUCCESS;
 608 }
 609
 610 /*
 611  * dnMatch routine
 612  */
 613 int
 614 dnMatch(
 615         int *matchp,
 616         slap_mask_t flags,
 617         Syntax *syntax,
 618         MatchingRule *mr,
 619         struct berval *value,
 620         void *assertedValue )
 621 {
 622         int match;
 623         struct berval *asserted = (struct berval *) assertedValue;
 624
 625         assert( matchp );
 626         assert( value );
 627         assert( assertedValue );
 628
 629         match = value->bv_len - asserted->bv_len;
 630
 631         if ( match == 0 ) {
 632                 match = memcmp( value->bv_val, asserted->bv_val,
 633                                 value->bv_len );
 634         }
 635
 636 #ifdef NEW_LOGGING
 637         LDAP_LOG( CONFIG, ENTRY, "dnMatch: %d\n    %s\n    %s\n",
 638                 match, value->bv_val, asserted->bv_val  );
 639 #else
 640         Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
 641                 match, value->bv_val, asserted->bv_val );
 642 #endif
 643
 644         *matchp = match;
 645         return( LDAP_SUCCESS );
 646 }
 647
 648 /*
 649  * dnParent - dn's parent, in-place
 650  *
 651  * note: the incoming dn is assumed to be normalized/prettyfied,
 652  * so that escaped rdn/ava separators are in '\'+hexpair form
 653  */
 654 void
 655 dnParent(
 656         struct berval   *dn,
 657         struct berval   *pdn )
 658 {
 659         char    *p;
 660
 661         p = strchr( dn->bv_val, ',' );
 662
 663         /* one-level dn */
 664         if ( p == NULL ) {
 665                 pdn->bv_len = 0;
 666                 pdn->bv_val = dn->bv_val + dn->bv_len;
 667                 return;
 668         }
 669
 670         assert( DN_SEPARATOR( p[ 0 ] ) );
 671         p++;
 672
 673         assert( ATTR_LEADCHAR( p[ 0 ] ) );
 674         pdn->bv_val = p;
 675         pdn->bv_len = dn->bv_len - (p - dn->bv_val);
 676
 677         return;
 678 }
 679
 680 int
 681 dnExtractRdn(
 682         struct berval   *dn,
 683         struct berval   *rdn,
 684         void *ctx )
 685 {
 686         LDAPRDN         tmpRDN;
 687         const char      *p;
 688         int             rc;
 689
 690         assert( dn );
 691         assert( rdn );
 692
 693         if( dn->bv_len == 0 ) {
 694                 return LDAP_OTHER;
 695         }
 696
 697         rc = ldap_bv2rdn_x( dn, &tmpRDN, (char **)&p, LDAP_DN_FORMAT_LDAP, ctx );
 698         if ( rc != LDAP_SUCCESS ) {
 699                 return rc;
 700         }
 701
 702         rc = ldap_rdn2bv_x( tmpRDN, rdn, LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
 703
 704         ldap_rdnfree_x( tmpRDN, ctx );
 705         if ( rc != LDAP_SUCCESS ) {
 706                 return rc;
 707         }
 708
 709         return LDAP_SUCCESS;
 710 }
 711
 712 /*
 713  * We can assume the input is a prettied or normalized DN
 714  */
 715 int
 716 dn_rdnlen(
 717         Backend         *be,
 718         struct berval   *dn_in )
 719 {
 720         const char      *p;
 721
 722         assert( dn_in );
 723
 724         if ( dn_in == NULL ) {
 725                 return 0;
 726         }
 727
 728         if ( !dn_in->bv_len ) {
 729                 return 0;
 730         }
 731
 732         if ( be != NULL && be_issuffix( be, dn_in ) ) {
 733                 return 0;
 734         }
 735
 736         p = strchr( dn_in->bv_val, ',' );
 737
 738         return p ? p - dn_in->bv_val : dn_in->bv_len;
 739 }
 740
 741
 742 /* rdnValidate:
 743  *
 744  * LDAP_SUCCESS if rdn is a legal rdn;
 745  * LDAP_INVALID_SYNTAX otherwise (including a sequence of rdns)
 746  */
 747 int
 748 rdnValidate( struct berval *rdn )
 749 {
 750 #if 1
 751         /* Major cheat!
 752          * input is a pretty or normalized DN
 753          * hence, we can just search for ','
 754          */
 755         if( rdn == NULL || rdn->bv_len == 0 ||
 756                 rdn->bv_len > SLAP_LDAPDN_MAXLEN )
 757         {
 758                 return LDAP_INVALID_SYNTAX;
 759         }
 760
 761         return strchr( rdn->bv_val, ',' ) == NULL
 762                 ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
 763
 764 #else
 765         LDAPRDN         *RDN, **DN[ 2 ] = { &RDN, NULL };
 766         const char      *p;
 767         int             rc;
 768
 769         /*
 770          * must be non-empty
 771          */
 772         if ( rdn == NULL || rdn == '\0' ) {
 773                 return 0;
 774         }
 775
 776         /*
 777          * must be parsable
 778          */
 779         rc = ldap_bv2rdn( rdn, &RDN, (char **)&p, LDAP_DN_FORMAT_LDAP );
 780         if ( rc != LDAP_SUCCESS ) {
 781                 return 0;
 782         }
 783
 784         /*
 785          * Must be one-level
 786          */
 787         if ( p[ 0 ] != '\0' ) {
 788                 return 0;
 789         }
 790
 791         /*
 792          * Schema-aware validate
 793          */
 794         if ( rc == LDAP_SUCCESS ) {
 795                 rc = LDAPDN_validate( DN );
 796         }
 797         ldap_rdnfree( RDN );
 798
 799         /*
 800          * Must validate (there's a repeated parsing ...)
 801          */
 802         return ( rc == LDAP_SUCCESS );
 803 #endif
 804 }
 805
 806
 807 /* build_new_dn:
 808  *
 809  * Used by ldbm/bdb2 back_modrdn to create the new dn of entries being
 810  * renamed.
 811  *
 812  * new_dn = parent (p_dn) + separator + rdn (newrdn) + null.
 813  */
 814
 815 void
 816 build_new_dn( struct berval * new_dn,
 817         struct berval * parent_dn,
 818         struct berval * newrdn )
 819 {
 820         char *ptr;
 821
 822         if ( parent_dn == NULL ) {
 823                 ber_dupbv( new_dn, newrdn );
 824                 return;
 825         }
 826
 827         new_dn->bv_len = parent_dn->bv_len + newrdn->bv_len + 1;
 828         new_dn->bv_val = (char *) ch_malloc( new_dn->bv_len + 1 );
 829
 830         ptr = lutil_strcopy( new_dn->bv_val, newrdn->bv_val );
 831         *ptr++ = ',';
 832         strcpy( ptr, parent_dn->bv_val );
 833 }
 834
 835
 836 /*
 837  * dnIsSuffix - tells whether suffix is a suffix of dn.
 838  * Both dn and suffix must be normalized.
 839  */
 840 int
 841 dnIsSuffix(
 842         const struct berval *dn,
 843         const struct berval *suffix )
 844 {
 845         int     d = dn->bv_len - suffix->bv_len;
 846
 847         assert( dn );
 848         assert( suffix );
 849
 850         /* empty suffix matches any dn */
 851         if ( suffix->bv_len == 0 ) {
 852                 return 1;
 853         }
 854
 855         /* suffix longer than dn */
 856         if ( d < 0 ) {
 857                 return 0;
 858         }
 859
 860         /* no rdn separator or escaped rdn separator */
 861         if ( d > 1 && !DN_SEPARATOR( dn->bv_val[ d - 1 ] ) ) {
 862                 return 0;
 863         }
 864
 865         /* no possible match or malformed dn */
 866         if ( d == 1 ) {
 867                 return 0;
 868         }
 869
 870         /* compare */
 871         return( strcmp( dn->bv_val + d, suffix->bv_val ) == 0 );
 872 }
 873
 874 #ifdef HAVE_TLS
 875 /*
 876  * Convert an X.509 DN into a normalized LDAP DN
 877  */
 878 int
 879 dnX509normalize( void *x509_name, struct berval *out )
 880 {
 881         /* Invoke the LDAP library's converter with our schema-rewriter */
 882         return ldap_X509dn2bv( x509_name, out, LDAPDN_rewrite, 0 );
 883 }
 884
 885 /*
 886  * Get the TLS session's peer's DN into a normalized LDAP DN
 887  */
 888 int
 889 dnX509peerNormalize( void *ssl, struct berval *dn )
 890 {
 891
 892         return ldap_pvt_tls_get_peer_dn( ssl, dn, (LDAPDN_rewrite_dummy *)LDAPDN_rewrite, 0 );
 893 }
 894 #endif