1 /* dn.c - routines for dealing with distinguished names */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/socket.h>
14 #include <ac/string.h>
18 #include "ldap_pvt.h" /* must be after slap.h, to get ldap_bv2dn_x() & co */
22 * The DN syntax-related functions take advantage of the dn representation
23 * handling functions ldap_str2dn/ldap_dn2str. The latter are not schema-
24 * aware, so the attributes and their values need be validated (and possibly
25 * normalized). In the current implementation the required validation/nor-
26 * malization/"pretty"ing are done on newly created DN structural represen-
27 * tations; however the idea is to move towards DN handling in structural
28 * representation instead of the current string representation. To this
29 * purpose, we need to do only the required operations and keep track of
30 * what has been done to minimize their impact on performances.
32 * Developers are strongly encouraged to use this feature, to speed-up
36 #define AVA_PRIVATE( ava ) ( ( AttributeDescription * )(ava)->la_private )
39 * In-place, schema-aware validation of the
40 * structural representation of a distinguished name.
43 LDAPDN_validate( LDAPDN dn )
50 for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
51 LDAPRDN rdn = dn[ iRDN ];
56 for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
57 LDAPAVA *ava = rdn[ iAVA ];
58 AttributeDescription *ad;
59 slap_syntax_validate_func *validate = NULL;
63 if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
64 const char *text = NULL;
66 rc = slap_bv2ad( &ava->la_attr, &ad, &text );
67 if ( rc != LDAP_SUCCESS ) {
68 return LDAP_INVALID_SYNTAX;
71 ava->la_private = ( void * )ad;
75 * Replace attr oid/name with the canonical name
77 ava->la_attr = ad->ad_cname;
79 validate = ad->ad_type->sat_syntax->ssyn_validate;
83 * validate value by validate function
85 rc = ( *validate )( ad->ad_type->sat_syntax,
88 if ( rc != LDAP_SUCCESS ) {
89 return LDAP_INVALID_SYNTAX;
111 if ( in->bv_len == 0 ) {
114 } else if ( in->bv_len > SLAP_LDAPDN_MAXLEN ) {
115 return LDAP_INVALID_SYNTAX;
118 rc = ldap_bv2dn( in, &dn, LDAP_DN_FORMAT_LDAP );
119 if ( rc != LDAP_SUCCESS ) {
120 return LDAP_INVALID_SYNTAX;
123 assert( strlen( in->bv_val ) == in->bv_len );
126 * Schema-aware validate
128 rc = LDAPDN_validate( dn );
131 if ( rc != LDAP_SUCCESS ) {
132 return LDAP_INVALID_SYNTAX;
139 * AVA sorting inside a RDN
141 * rule: sort attributeTypes in alphabetical order; in case of multiple
142 * occurrences of the same attributeType, sort values in byte order
143 * (use memcmp, which implies alphabetical order in case of IA5 value;
144 * this should guarantee the repeatability of the operation).
146 * Note: the sorting can be slightly improved by sorting first
147 * by attribute type length, then by alphabetical order.
149 * uses a linear search; should be fine since the number of AVAs in
150 * a RDN should be limited.
153 AVA_Sort( LDAPRDN rdn, int iAVA )
156 LDAPAVA *ava_in = rdn[ iAVA ];
161 for ( i = 0; i < iAVA; i++ ) {
162 LDAPAVA *ava = rdn[ i ];
167 a = strcmp( ava_in->la_attr.bv_val, ava->la_attr.bv_val );
176 d = ava_in->la_value.bv_len - ava->la_value.bv_len;
178 v = memcmp( ava_in->la_value.bv_val,
179 ava->la_value.bv_val,
180 d <= 0 ? ava_in->la_value.bv_len
181 : ava->la_value.bv_len );
183 if ( v == 0 && d != 0 ) {
202 a = strcmp( ava_in->la_attr.bv_val,
203 ava->la_attr.bv_val );
209 for ( j = iAVA; j > i; j-- ) {
210 rdn[ j ] = rdn[ j - 1 ];
219 * In-place, schema-aware normalization / "pretty"ing of the
220 * structural representation of a distinguished name.
223 LDAPDN_rewrite( LDAPDN dn, unsigned flags, void *ctx )
230 for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
231 LDAPRDN rdn = dn[ iRDN ];
236 for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
237 LDAPAVA *ava = rdn[ iAVA ];
238 AttributeDescription *ad;
239 slap_syntax_validate_func *validf = NULL;
240 slap_mr_normalize_func *normf = NULL;
241 slap_syntax_transform_func *transf = NULL;
242 MatchingRule *mr = NULL;
243 struct berval bv = { 0, NULL };
248 if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
249 const char *text = NULL;
251 rc = slap_bv2ad( &ava->la_attr, &ad, &text );
252 if ( rc != LDAP_SUCCESS ) {
253 return LDAP_INVALID_SYNTAX;
256 ava->la_private = ( void * )ad;
261 * Replace attr oid/name with the canonical name
263 ava->la_attr = ad->ad_cname;
265 if( ava->la_flags & LDAP_AVA_BINARY ) {
266 if( ava->la_value.bv_len == 0 ) {
267 /* BER encoding is empty */
268 return LDAP_INVALID_SYNTAX;
271 /* AVA is binary encoded, don't muck with it */
272 } else if( flags & SLAP_LDAPDN_PRETTY ) {
273 transf = ad->ad_type->sat_syntax->ssyn_pretty;
275 validf = ad->ad_type->sat_syntax->ssyn_validate;
277 } else { /* normalization */
278 validf = ad->ad_type->sat_syntax->ssyn_validate;
279 mr = ad->ad_type->sat_equality;
280 if( mr ) normf = mr->smr_normalize;
284 /* validate value before normalization */
285 rc = ( *validf )( ad->ad_type->sat_syntax,
288 : (struct berval *) &slap_empty_bv );
290 if ( rc != LDAP_SUCCESS ) {
291 return LDAP_INVALID_SYNTAX;
297 * transform value by pretty function
298 * if value is empty, use empty_bv
300 rc = ( *transf )( ad->ad_type->sat_syntax,
303 : (struct berval *) &slap_empty_bv,
306 if ( rc != LDAP_SUCCESS ) {
307 return LDAP_INVALID_SYNTAX;
314 * if value is empty, use empty_bv
318 ad->ad_type->sat_syntax,
322 : (struct berval *) &slap_empty_bv,
325 if ( rc != LDAP_SUCCESS ) {
326 return LDAP_INVALID_SYNTAX;
332 if ( ava->la_flags & LDAP_AVA_FREE_VALUE )
333 ber_memfree_x( ava->la_value.bv_val, ctx );
335 ava->la_flags |= LDAP_AVA_FREE_VALUE;
338 if( do_sort ) AVA_Sort( rdn, iAVA );
357 Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val, 0, 0 );
359 if ( val->bv_len != 0 ) {
364 * Go to structural representation
366 rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
367 if ( rc != LDAP_SUCCESS ) {
368 return LDAP_INVALID_SYNTAX;
371 assert( strlen( val->bv_val ) == val->bv_len );
374 * Schema-aware rewrite
376 if ( LDAPDN_rewrite( dn, 0, ctx ) != LDAP_SUCCESS ) {
377 ldap_dnfree_x( dn, ctx );
378 return LDAP_INVALID_SYNTAX;
382 * Back to string representation
384 rc = ldap_dn2bv_x( dn, out,
385 LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
387 ldap_dnfree_x( dn, ctx );
389 if ( rc != LDAP_SUCCESS ) {
390 return LDAP_INVALID_SYNTAX;
393 ber_dupbv_x( out, val, ctx );
396 Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val, 0, 0 );
412 LDAP_LOG( OPERATION, ARGS, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
414 Debug( LDAP_DEBUG_TRACE, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
417 if ( val->bv_len == 0 ) {
418 ber_dupbv_x( out, val, ctx );
420 } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
421 return LDAP_INVALID_SYNTAX;
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;
433 assert( strlen( val->bv_val ) == val->bv_len );
436 * Schema-aware rewrite
438 if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY, ctx ) != LDAP_SUCCESS ) {
439 ldap_dnfree_x( dn, ctx );
440 return LDAP_INVALID_SYNTAX;
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
447 rc = ldap_dn2bv_x( dn, out,
448 LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
450 ldap_dnfree_x( dn, ctx );
452 if ( rc != LDAP_SUCCESS ) {
453 return LDAP_INVALID_SYNTAX;
458 LDAP_LOG( OPERATION, ARGS, "<<< dnPretty: <%s>\n", out->bv_val, 0, 0 );
460 Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val, 0, 0 );
478 LDAP_LOG( OPERATION, ARGS, ">>> dn%sDN: <%s>\n",
479 flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
482 Debug( LDAP_DEBUG_TRACE, ">>> dn%sDN: <%s>\n",
483 flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
487 if ( val->bv_len == 0 ) {
490 } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
491 return LDAP_INVALID_SYNTAX;
496 /* FIXME: should be liberal in what we accept */
497 rc = ldap_bv2dn_x( val, dn, LDAP_DN_FORMAT_LDAP, ctx );
498 if ( rc != LDAP_SUCCESS ) {
499 return LDAP_INVALID_SYNTAX;
502 assert( strlen( val->bv_val ) == val->bv_len );
505 * Schema-aware rewrite
507 if ( LDAPDN_rewrite( *dn, flags, ctx ) != LDAP_SUCCESS ) {
508 ldap_dnfree_x( *dn, ctx );
510 return LDAP_INVALID_SYNTAX;
514 Debug( LDAP_DEBUG_TRACE, "<<< dn%sDN\n",
515 flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
522 * Combination of both dnPretty and dnNormalize
528 struct berval *pretty,
529 struct berval *normal,
533 LDAP_LOG ( OPERATION, ENTRY, ">>> dnPrettyNormal: <%s>\n", val->bv_val, 0, 0 );
535 Debug( LDAP_DEBUG_TRACE, ">>> dnPrettyNormal: <%s>\n", val->bv_val, 0, 0 );
542 if ( val->bv_len == 0 ) {
543 ber_dupbv_x( pretty, val, ctx );
544 ber_dupbv_x( normal, val, ctx );
546 } else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
548 return LDAP_INVALID_SYNTAX;
554 pretty->bv_val = NULL;
555 normal->bv_val = NULL;
559 /* FIXME: should be liberal in what we accept */
560 rc = ldap_bv2dn_x( val, &dn, LDAP_DN_FORMAT_LDAP, ctx );
561 if ( rc != LDAP_SUCCESS ) {
562 return LDAP_INVALID_SYNTAX;
565 assert( strlen( val->bv_val ) == val->bv_len );
568 * Schema-aware rewrite
570 if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY, ctx ) != LDAP_SUCCESS ) {
571 ldap_dnfree_x( dn, ctx );
572 return LDAP_INVALID_SYNTAX;
575 rc = ldap_dn2bv_x( dn, pretty,
576 LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
578 if ( rc != LDAP_SUCCESS ) {
579 ldap_dnfree_x( dn, ctx );
580 return LDAP_INVALID_SYNTAX;
583 if ( LDAPDN_rewrite( dn, 0, ctx ) != LDAP_SUCCESS ) {
584 ldap_dnfree_x( dn, ctx );
585 ber_memfree_x( pretty->bv_val, ctx );
586 pretty->bv_val = NULL;
588 return LDAP_INVALID_SYNTAX;
591 rc = ldap_dn2bv_x( dn, normal,
592 LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
594 ldap_dnfree_x( dn, ctx );
595 if ( rc != LDAP_SUCCESS ) {
596 ber_memfree_x( pretty->bv_val, ctx );
597 pretty->bv_val = NULL;
599 return LDAP_INVALID_SYNTAX;
604 LDAP_LOG (OPERATION, RESULTS, "<<< dnPrettyNormal: <%s>, <%s>\n",
605 pretty->bv_val, normal->bv_val, 0 );
607 Debug( LDAP_DEBUG_TRACE, "<<< dnPrettyNormal: <%s>, <%s>\n",
608 pretty->bv_val, normal->bv_val, 0 );
623 struct berval *value,
624 void *assertedValue )
627 struct berval *asserted = (struct berval *) assertedValue;
631 assert( assertedValue );
633 match = value->bv_len - asserted->bv_len;
636 match = memcmp( value->bv_val, asserted->bv_val,
641 LDAP_LOG( CONFIG, ENTRY, "dnMatch: %d\n %s\n %s\n",
642 match, value->bv_val, asserted->bv_val );
644 Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
645 match, value->bv_val, asserted->bv_val );
649 return( LDAP_SUCCESS );
653 * dnParent - dn's parent, in-place
655 * note: the incoming dn is assumed to be normalized/prettyfied,
656 * so that escaped rdn/ava separators are in '\'+hexpair form
665 p = strchr( dn->bv_val, ',' );
670 pdn->bv_val = dn->bv_val + dn->bv_len;
674 assert( DN_SEPARATOR( p[ 0 ] ) );
677 assert( ATTR_LEADCHAR( p[ 0 ] ) );
679 pdn->bv_len = dn->bv_len - (p - dn->bv_val);
697 if( dn->bv_len == 0 ) {
701 rc = ldap_bv2rdn_x( dn, &tmpRDN, (char **)&p, LDAP_DN_FORMAT_LDAP, ctx );
702 if ( rc != LDAP_SUCCESS ) {
706 rc = ldap_rdn2bv_x( tmpRDN, rdn, LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY, ctx );
708 ldap_rdnfree_x( tmpRDN, ctx );
709 if ( rc != LDAP_SUCCESS ) {
717 * We can assume the input is a prettied or normalized DN
722 struct berval *dn_in )
728 if ( dn_in == NULL ) {
732 if ( !dn_in->bv_len ) {
736 if ( be != NULL && be_issuffix( be, dn_in ) ) {
740 p = strchr( dn_in->bv_val, ',' );
742 return p ? p - dn_in->bv_val : dn_in->bv_len;
748 * LDAP_SUCCESS if rdn is a legal rdn;
749 * LDAP_INVALID_SYNTAX otherwise (including a sequence of rdns)
752 rdnValidate( struct berval *rdn )
756 * input is a pretty or normalized DN
757 * hence, we can just search for ','
759 if( rdn == NULL || rdn->bv_len == 0 ||
760 rdn->bv_len > SLAP_LDAPDN_MAXLEN )
762 return LDAP_INVALID_SYNTAX;
765 return strchr( rdn->bv_val, ',' ) == NULL
766 ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
769 LDAPRDN *RDN, **DN[ 2 ] = { &RDN, NULL };
776 if ( rdn == NULL || rdn == '\0' ) {
783 rc = ldap_bv2rdn( rdn, &RDN, (char **)&p, LDAP_DN_FORMAT_LDAP );
784 if ( rc != LDAP_SUCCESS ) {
791 if ( p[ 0 ] != '\0' ) {
796 * Schema-aware validate
798 if ( rc == LDAP_SUCCESS ) {
799 rc = LDAPDN_validate( DN );
804 * Must validate (there's a repeated parsing ...)
806 return ( rc == LDAP_SUCCESS );
813 * Used by ldbm/bdb2 back_modrdn to create the new dn of entries being
816 * new_dn = parent (p_dn) + separator + rdn (newrdn) + null.
820 build_new_dn( struct berval * new_dn,
821 struct berval * parent_dn,
822 struct berval * newrdn,
827 if ( parent_dn == NULL ) {
828 ber_dupbv( new_dn, newrdn );
832 new_dn->bv_len = parent_dn->bv_len + newrdn->bv_len + 1;
833 new_dn->bv_val = (char *) sl_malloc( new_dn->bv_len + 1, memctx );
835 ptr = lutil_strcopy( new_dn->bv_val, newrdn->bv_val );
837 strcpy( ptr, parent_dn->bv_val );
842 * dnIsSuffix - tells whether suffix is a suffix of dn.
843 * Both dn and suffix must be normalized.
847 const struct berval *dn,
848 const struct berval *suffix )
850 int d = dn->bv_len - suffix->bv_len;
855 /* empty suffix matches any dn */
856 if ( suffix->bv_len == 0 ) {
860 /* suffix longer than dn */
865 /* no rdn separator or escaped rdn separator */
866 if ( d > 1 && !DN_SEPARATOR( dn->bv_val[ d - 1 ] ) ) {
870 /* no possible match or malformed dn */
876 return( strcmp( dn->bv_val + d, suffix->bv_val ) == 0 );
881 * Convert an X.509 DN into a normalized LDAP DN
884 dnX509normalize( void *x509_name, struct berval *out )
886 /* Invoke the LDAP library's converter with our schema-rewriter */
887 int rc = ldap_X509dn2bv( x509_name, out, LDAPDN_rewrite, 0 );
889 Debug( LDAP_DEBUG_TRACE,
890 "dnX509Normalize: <%s>\n", out->bv_val, 0, 0 );
896 * Get the TLS session's peer's DN into a normalized LDAP DN
899 dnX509peerNormalize( void *ssl, struct berval *dn )
902 return ldap_pvt_tls_get_peer_dn( ssl, dn, (LDAPDN_rewrite_dummy *)LDAPDN_rewrite, 0 );