1 /* dn.c - routines for dealing with distinguished names */
4 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/socket.h>
14 #include <ac/string.h>
21 #define SLAP_LDAPDN_PRETTY 0x1
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.
34 * Developers are strongly encouraged to use this feature, to speed-up
38 #define AVA_PRIVATE( ava ) ( ( AttributeDescription * )(ava)->la_private )
41 * In-place, schema-aware validation of the
42 * structural representation of a distinguished name.
45 LDAPDN_validate( LDAPDN *dn )
52 for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
53 LDAPRDN *rdn = dn[ iRDN ][ 0 ];
58 for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
59 LDAPAVA *ava = rdn[ iAVA ][ 0 ];
60 AttributeDescription *ad;
61 slap_syntax_validate_func *validate = NULL;
65 if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
66 const char *text = NULL;
68 rc = slap_bv2ad( ava->la_attr, &ad, &text );
69 if ( rc != LDAP_SUCCESS ) {
70 return LDAP_INVALID_SYNTAX;
73 ava->la_private = ( void * )ad;
77 * Replace attr oid/name with the canonical name
79 ber_bvfree( ava->la_attr );
80 ava->la_attr = ber_bvdup( &ad->ad_cname );
82 validate = ad->ad_type->sat_syntax->ssyn_validate;
86 * validate value by validate function
88 rc = ( *validate )( ad->ad_type->sat_syntax,
91 if ( rc != LDAP_SUCCESS ) {
92 return LDAP_INVALID_SYNTAX;
102 * dn validate routine
114 if ( in->bv_len == 0 ) {
115 return( LDAP_SUCCESS );
118 rc = ldap_str2dn( in->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
121 * Schema-aware validate
123 if ( rc == LDAP_SUCCESS ) {
124 rc = LDAPDN_validate( dn );
129 if ( rc != LDAP_SUCCESS ) {
130 return( LDAP_INVALID_SYNTAX );
133 return( LDAP_SUCCESS );
137 * AVA sorting inside a RDN
139 * rule: sort attributeTypes in alphabetical order; in case of multiple
140 * occurrences of the same attributeType, sort values in byte order
141 * (use memcmp, which implies alphabetical order in case of IA5 value;
142 * this should guarantee the repeatability of the operation).
144 * uses a linear search; should be fine since the number of AVAs in
145 * a RDN should be limited.
148 AVA_Sort( LDAPRDN *rdn, int iAVA )
151 LDAPAVA *ava_in = rdn[ iAVA ][ 0 ];
156 for ( i = 0; i < iAVA; i++ ) {
157 LDAPAVA *ava = rdn[ i ][ 0 ];
162 a = strcmp( ava_in->la_attr->bv_val, ava->la_attr->bv_val );
171 d = ava_in->la_value->bv_len - ava->la_value->bv_len;
173 v = memcmp( ava_in->la_value->bv_val,
174 ava->la_value->bv_val,
175 d <= 0 ? ava_in->la_value->bv_len
176 : ava->la_value->bv_len );
178 if ( v == 0 && d != 0 ) {
197 a = strcmp( ava_in->la_value->bv_val,
198 ava->la_value->bv_val );
204 for ( j = iAVA; j > i; j-- ) {
205 rdn[ j ][ 0 ] = rdn[ j - 1 ][ 0 ];
207 rdn[ i ][ 0 ] = ava_in;
214 * In-place, schema-aware normalization / "pretty"ing of the
215 * structural representation of a distinguished name.
218 LDAPDN_rewrite( LDAPDN *dn, unsigned flags )
225 for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
226 LDAPRDN *rdn = dn[ iRDN ][ 0 ];
231 for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
232 LDAPAVA *ava = rdn[ iAVA ][ 0 ];
233 AttributeDescription *ad;
234 slap_syntax_transform_func *transf = NULL;
236 struct berval *bv = NULL;
240 if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
241 const char *text = NULL;
243 rc = slap_bv2ad( ava->la_attr, &ad, &text );
244 if ( rc != LDAP_SUCCESS ) {
245 return LDAP_INVALID_SYNTAX;
248 ava->la_private = ( void * )ad;
252 * Replace attr oid/name with the canonical name
254 ber_bvfree( ava->la_attr );
255 ava->la_attr = ber_bvdup( &ad->ad_cname );
257 if( flags & SLAP_LDAPDN_PRETTY ) {
258 transf = ad->ad_type->sat_syntax->ssyn_pretty;
261 transf = ad->ad_type->sat_syntax->ssyn_normalize;
262 mr = ad->ad_type->sat_equality;
267 * transform value by normalize/pretty function
269 rc = ( *transf )( ad->ad_type->sat_syntax,
270 ava->la_value, &bv );
272 if ( rc != LDAP_SUCCESS ) {
273 return LDAP_INVALID_SYNTAX;
277 if( mr && ( mr->smr_usage & SLAP_MR_DN_FOLD ) ) {
278 struct berval *s = bv;
280 bv = ber_bvstr( UTF8normalize( bv ? bv : ava->la_value,
287 ber_bvfree( ava->la_value );
291 AVA_Sort( rdn, iAVA );
299 * dn normalize routine
305 struct berval **normalized )
307 struct berval *out = NULL;
309 Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val, 0, 0 );
312 assert( normalized );
314 assert( *normalized == NULL );
316 if ( val->bv_len != 0 ) {
322 * Go to structural representation
324 rc = ldap_str2dn( val->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
325 if ( rc != LDAP_SUCCESS ) {
326 return LDAP_INVALID_SYNTAX;
330 * Schema-aware rewrite
332 if ( LDAPDN_rewrite( dn, 0 ) != LDAP_SUCCESS ) {
334 return LDAP_INVALID_SYNTAX;
338 * Back to string representation
340 rc = ldap_dn2str( dn, &dn_out, LDAP_DN_FORMAT_LDAPV3 );
344 if ( rc != LDAP_SUCCESS ) {
345 return LDAP_INVALID_SYNTAX;
348 out = ber_bvstr( dn_out );
351 out = ber_bvdup( val );
354 Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val, 0, 0 );
361 * dn "pretty"ing routine
367 struct berval **pretty)
369 struct berval *out = NULL;
371 Debug( LDAP_DEBUG_TRACE, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
375 assert( *pretty == NULL );
377 if ( val->bv_len != 0 ) {
382 /* FIXME: should be liberal in what we accept */
383 rc = ldap_str2dn( val->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
384 if ( rc != LDAP_SUCCESS ) {
385 return LDAP_INVALID_SYNTAX;
389 * Schema-aware rewrite
391 if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY ) != LDAP_SUCCESS ) {
393 return LDAP_INVALID_SYNTAX;
396 /* FIXME: not sure why the default isn't pretty */
397 /* RE: the default is the form that is used as
398 * an internal representation; the pretty form
400 rc = ldap_dn2str( dn, &dn_out,
401 LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
405 if ( rc != LDAP_SUCCESS ) {
406 return LDAP_INVALID_SYNTAX;
409 out = ber_bvstr( dn_out );
412 out = ber_bvdup( val );
415 Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val, 0, 0 );
431 struct berval *value,
432 void *assertedValue )
435 struct berval *asserted = (struct berval *) assertedValue;
439 assert( assertedValue );
441 match = value->bv_len - asserted->bv_len;
444 match = strcmp( value->bv_val, asserted->bv_val );
448 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
449 "dnMatch: %d\n %s\n %s\n", match,
450 value->bv_val, asserted->bv_val ));
452 Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
453 match, value->bv_val, asserted->bv_val );
457 return( LDAP_SUCCESS );
460 #ifdef SLAP_DN_MIGRATION
462 * these routines are provided for migration purposes only!
463 * dn_validate is deprecated in favor of dnValidate
464 * dn_normalize is deprecated in favor of dnNormalize
465 * strcmp/strcasecmp for DNs is deprecated in favor of dnMatch
467 * other routines are likewise deprecated but may not yet have
468 * replacement functions.
472 * dn_validate - validate and compress dn. the dn is
473 * compressed in place are returned if valid.
474 * Deprecated in favor of dnValidate()
477 dn_validate( char *dn )
480 struct berval *pretty = NULL;
483 if ( dn == NULL || dn[0] == '\0' ) {
488 val.bv_len = strlen( dn );
490 rc = dnPretty( NULL, &val, &pretty );
491 if ( rc != LDAP_SUCCESS ) {
495 if ( val.bv_len < pretty->bv_len ) {
496 ber_bvfree( pretty );
500 AC_MEMCPY( dn, pretty->bv_val, pretty->bv_len + 1 );
501 ber_bvfree( pretty );
507 * dn_normalize - put dn into a canonical form suitable for storing
508 * in a hash database. this involves normalizing the case as well as
509 * the format. the dn is normalized in place as well as returned if valid.
510 * Deprecated in favor of dnNormalize()
513 dn_normalize( char *dn )
516 struct berval *normalized = NULL;
519 if ( dn == NULL || dn[0] == '\0' ) {
524 val.bv_len = strlen( dn );
526 rc = dnNormalize( NULL, &val, &normalized );
527 if ( rc != LDAP_SUCCESS ) {
531 if ( val.bv_len < normalized->bv_len ) {
532 ber_bvfree( normalized );
536 AC_MEMCPY( dn, normalized->bv_val, normalized->bv_len + 1 );
537 ber_bvfree( normalized );
543 * dnParent - dn's parent, in-place
554 rc = ldap_str2rdn( dn, &tmpRDN, &p, LDAP_DN_FORMAT_LDAP );
555 if ( rc != LDAP_SUCCESS ) {
558 ldap_rdnfree( tmpRDN );
560 assert( DN_SEPARATOR( p[ 0 ] ) );
563 while ( ASCII_SPACE( p[ 0 ] ) ) {
573 * dn_parent - return the dn's parent, in-place
574 * FIXME: should be replaced by dnParent()
587 while ( dn[ 0 ] != '\0' && ASCII_SPACE( dn[ 0 ] ) ) {
591 if ( dn[ 0 ] == '\0' ) {
595 if ( be != NULL && be_issuffix( be, dn ) ) {
599 if ( dnParent( dn, &pdn ) != LDAP_SUCCESS ) {
603 return ( char * )pdn;
609 struct berval **rdn )
619 rc = ldap_str2rdn( dn, &tmpRDN, &p, LDAP_DN_FORMAT_LDAP );
620 if ( rc != LDAP_SUCCESS ) {
624 rc = ldap_rdn2str( tmpRDN, &rdnout, LDAP_DN_FORMAT_LDAPV3 );
625 ldap_rdnfree( tmpRDN );
626 if ( rc != LDAP_SUCCESS ) {
630 *rdn = ber_bvstr( rdnout );
631 if ( *rdn == NULL ) {
633 return LDAP_NO_MEMORY;
640 * FIXME: should be replaced by dnExtractRdn() (together with dn_rdn)
647 struct berval *rdn = NULL;
652 if ( dn_in == NULL ) {
656 while ( dn_in[ 0 ] && ASCII_SPACE( dn_in[ 0 ] ) ) {
660 if ( dn_in[ 0 ] == '\0' ) {
664 if ( be != NULL && be_issuffix( be, dn_in ) ) {
668 if ( dnExtractRdn( dn_in, &rdn ) != LDAP_SUCCESS ) {
673 retval = rdn->bv_len;
680 * FIXME: should be replaced by dnExtractRdn() (together with dn_rdnlen)
686 struct berval *rdn = NULL;
691 if ( dn_in == NULL ) {
695 while ( dn_in[ 0 ] && ASCII_SPACE( dn_in[ 0 ] ) ) {
699 if ( dn_in[ 0 ] == '\0' ) {
703 if ( be != NULL && be_issuffix( be, dn_in ) ) {
707 if ( dnExtractRdn( dn_in, &rdn ) != LDAP_SUCCESS ) {
712 retval = rdn->bv_val;
719 * return a charray of all subtrees to which the DN resides in
725 char **subtree = NULL;
728 charray_add( &subtree, dn );
730 dn = dn_parent( be, dn );
732 } while ( dn != NULL );
738 * dn_issuffix - tells whether suffix is a suffix of dn.
739 * Both dn and suffix must be normalized.
740 * deprecated in favor of dnIsSuffix()
748 struct berval bvdn, bvsuffix;
753 bvdn.bv_val = (char *) dn;
754 bvdn.bv_len = strlen( dn );
755 bvsuffix.bv_val = (char *) suffix;
756 bvsuffix.bv_len = strlen( suffix );
758 return dnIsSuffix( &bvdn, &bvsuffix );
763 * Given a string (i.e. an rdn) of the form:
764 * "attribute_type = attribute_value"
765 * this function returns the type of an attribute, that is the
766 * string "attribute_type" which is placed in newly allocated
767 * memory. The returned string will be null-terminated.
772 char * rdn_attr_type( const char * s )
774 char **attrs, **values, *retval;
776 if ( rdn_attrs( s, &attrs, &values ) != LDAP_SUCCESS ) {
780 retval = ch_strdup( attrs[ 0 ] );
782 charray_free( attrs );
783 charray_free( values );
791 * Given a string (i.e. an rdn) of the form:
792 * "attribute_type = attribute_value"
793 * this function returns "attribute_type" which is placed in newly allocated
794 * memory. The returned string will be null-terminated and may contain
795 * spaces (i.e. "John Doe\0").
801 rdn_attr_value( const char * rdn )
803 char **attrs, **values, *retval;
805 if ( rdn_attrs( rdn, &attrs, &values ) != LDAP_SUCCESS ) {
809 retval = ch_strdup( values[ 0 ] );
811 charray_free( attrs );
812 charray_free( values );
820 * Given a string (i.e. an rdn) of the form:
821 * "attribute_type=attribute_value[+attribute_type=attribute_value[...]]"
822 * this function stores the types of the attributes in ptypes, that is the
823 * array of strings "attribute_type" which is placed in newly allocated
824 * memory, and the values of the attributes in pvalues, that is the
825 * array of strings "attribute_value" which is placed in newly allocated
826 * memory. Returns 0 on success, -1 on failure.
828 * note: got part of the code from dn_validate
830 * Deprecated; directly use LDAPRDN from ldap_str2rdn
834 rdn_attrs( const char * rdn, char ***types, char ***values)
845 rc = ldap_str2rdn( rdn, &tmpRDN, &p, LDAP_DN_FORMAT_LDAP );
846 if ( rc != LDAP_SUCCESS ) {
850 for ( iAVA = 0; tmpRDN[ iAVA ]; iAVA++ ) {
851 LDAPAVA *ava = tmpRDN[ iAVA ][ 0 ];
854 assert( ava->la_attr );
855 assert( ava->la_value );
857 charray_add_n( types, ava->la_attr->bv_val,
858 ava->la_attr->bv_len );
859 charray_add_n( values, ava->la_value->bv_val,
860 ava->la_value->bv_len );
863 ldap_rdnfree( tmpRDN );
871 * 1 if rdn is a legal rdn;
872 * 0 otherwise (including a sequence of rdns)
875 rdn_validate( const char *rdn )
877 LDAPRDN *RDN, **DN[ 2 ] = { &RDN, NULL };
884 if ( rdn == NULL || rdn == '\0' ) {
891 rc = ldap_str2rdn( rdn, &RDN, &p, LDAP_DN_FORMAT_LDAP );
892 if ( rc != LDAP_SUCCESS ) {
899 if ( p[ 0 ] != '\0' ) {
904 * Schema-aware validate
906 if ( rc == LDAP_SUCCESS ) {
907 rc = LDAPDN_validate( DN );
912 * Must validate (there's a repeated parsing ...)
914 return ( rc == LDAP_SUCCESS );
920 * Used by ldbm/bdb2 back_modrdn to create the new dn of entries being
923 * new_dn = parent (p_dn) + separator + rdn (newrdn) + null.
927 build_new_dn( char ** new_dn,
928 const char * entry_dn,
929 const char * parent_dn,
930 const char * newrdn )
933 if ( parent_dn == NULL ) {
934 *new_dn = ch_strdup( newrdn );
938 *new_dn = (char *) ch_malloc(
939 strlen( parent_dn ) + strlen( newrdn ) + 2 );
941 strcpy( *new_dn, newrdn );
942 strcat( *new_dn, "," );
943 strcat( *new_dn, parent_dn );
946 #endif /* SLAP_DN_MIGRATION */
949 * dnIsSuffix - tells whether suffix is a suffix of dn.
950 * Both dn and suffix must be normalized.
954 const struct berval *dn,
955 const struct berval *suffix )
957 int d = dn->bv_len - suffix->bv_len;
962 /* empty suffix matches any dn */
963 if ( suffix->bv_len == 0 ) {
967 /* suffix longer than dn */
972 /* no rdn separator or escaped rdn separator */
973 if ( d > 1 && ( !DN_SEPARATOR( dn->bv_val[ d - 1 ] )
974 || DN_ESCAPE( dn->bv_val[ d - 2 ] ) ) ) {
978 /* no possible match or malformed dn */
984 return( strcmp( dn->bv_val + d, suffix->bv_val ) == 0 );