1 /* dn.c - routines for dealing with distinguished names */
4 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/socket.h>
14 #include <ac/string.h>
21 const struct berval slap_empty_bv = { 0, "" };
23 #define SLAP_LDAPDN_PRETTY 0x1
26 * The DN syntax-related functions take advantage of the dn representation
27 * handling functions ldap_str2dn/ldap_dn2str. The latter are not schema-
28 * aware, so the attributes and their values need be validated (and possibly
29 * normalized). In the current implementation the required validation/nor-
30 * malization/"pretty"ing are done on newly created DN structural represen-
31 * tations; however the idea is to move towards DN handling in structural
32 * representation instead of the current string representation. To this
33 * purpose, we need to do only the required operations and keep track of
34 * what has been done to minimize their impact on performances.
36 * Developers are strongly encouraged to use this feature, to speed-up
40 #define AVA_PRIVATE( ava ) ( ( AttributeDescription * )(ava)->la_private )
43 * In-place, schema-aware validation of the
44 * structural representation of a distinguished name.
47 LDAPDN_validate( LDAPDN *dn )
54 for ( iRDN = 0; dn[ 0 ][ iRDN ]; iRDN++ ) {
55 LDAPRDN *rdn = dn[ 0 ][ iRDN ];
60 for ( iAVA = 0; rdn[ 0 ][ iAVA ]; iAVA++ ) {
61 LDAPAVA *ava = rdn[ 0 ][ iAVA ];
62 AttributeDescription *ad;
63 slap_syntax_validate_func *validate = NULL;
67 if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
68 const char *text = NULL;
70 rc = slap_bv2ad( &ava->la_attr, &ad, &text );
71 if ( rc != LDAP_SUCCESS ) {
72 return LDAP_INVALID_SYNTAX;
75 ava->la_private = ( void * )ad;
79 * Replace attr oid/name with the canonical name
81 ava->la_attr = ad->ad_cname;
83 validate = ad->ad_type->sat_syntax->ssyn_validate;
87 * validate value by validate function
89 rc = ( *validate )( ad->ad_type->sat_syntax,
92 if ( rc != LDAP_SUCCESS ) {
93 return LDAP_INVALID_SYNTAX;
103 * dn validate routine
115 if ( in->bv_len == 0 ) {
116 return( LDAP_SUCCESS );
119 /* FIXME: str2dn should take a bv and handle this */
120 if( strlen( in->bv_val ) != in->bv_len ) {
121 return LDAP_INVALID_SYNTAX;
124 rc = ldap_str2dn( in->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
127 * Schema-aware validate
129 if ( rc == LDAP_SUCCESS ) {
130 rc = LDAPDN_validate( dn );
134 if ( rc != LDAP_SUCCESS ) {
135 return( LDAP_INVALID_SYNTAX );
138 return( LDAP_SUCCESS );
142 * AVA sorting inside a RDN
144 * rule: sort attributeTypes in alphabetical order; in case of multiple
145 * occurrences of the same attributeType, sort values in byte order
146 * (use memcmp, which implies alphabetical order in case of IA5 value;
147 * this should guarantee the repeatability of the operation).
149 * Note: the sorting can be slightly improved by sorting first
150 * by attribute type length, then by alphabetical order.
152 * uses a linear search; should be fine since the number of AVAs in
153 * a RDN should be limited.
156 AVA_Sort( LDAPRDN *rdn, int iAVA )
159 LDAPAVA *ava_in = rdn[ 0 ][ iAVA ];
164 for ( i = 0; i < iAVA; i++ ) {
165 LDAPAVA *ava = rdn[ 0 ][ i ];
170 a = strcmp( ava_in->la_attr.bv_val, ava->la_attr.bv_val );
179 d = ava_in->la_value.bv_len - ava->la_value.bv_len;
181 v = memcmp( ava_in->la_value.bv_val,
182 ava->la_value.bv_val,
183 d <= 0 ? ava_in->la_value.bv_len
184 : ava->la_value.bv_len );
186 if ( v == 0 && d != 0 ) {
205 a = strcmp( ava_in->la_attr.bv_val,
206 ava->la_attr.bv_val );
212 for ( j = iAVA; j > i; j-- ) {
213 rdn[ 0 ][ j ] = rdn[ 0 ][ j - 1 ];
215 rdn[ 0 ][ i ] = ava_in;
222 * In-place, schema-aware normalization / "pretty"ing of the
223 * structural representation of a distinguished name.
226 LDAPDN_rewrite( LDAPDN *dn, unsigned flags )
233 for ( iRDN = 0; dn[ 0 ][ iRDN ]; iRDN++ ) {
234 LDAPRDN *rdn = dn[ 0 ][ iRDN ];
239 for ( iAVA = 0; rdn[ 0 ][ iAVA ]; iAVA++ ) {
240 LDAPAVA *ava = rdn[ 0 ][ iAVA ];
241 AttributeDescription *ad;
242 slap_syntax_transform_func *transf = NULL;
244 struct berval bv = { 0, NULL };
249 if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
250 const char *text = NULL;
252 rc = slap_bv2ad( &ava->la_attr, &ad, &text );
253 if ( rc != LDAP_SUCCESS ) {
254 return LDAP_INVALID_SYNTAX;
257 ava->la_private = ( void * )ad;
262 * Replace attr oid/name with the canonical name
264 ava->la_attr = ad->ad_cname;
266 if( ava->la_flags & LDAP_AVA_BINARY ) {
267 /* AVA is binary encoded, don't muck with it */
271 } else if( flags & SLAP_LDAPDN_PRETTY ) {
272 transf = ad->ad_type->sat_syntax->ssyn_pretty;
275 transf = ad->ad_type->sat_syntax->ssyn_normalize;
276 mr = ad->ad_type->sat_equality;
281 * transform value by normalize/pretty function
282 * if value is empty, use empty_bv
284 rc = ( *transf )( ad->ad_type->sat_syntax,
287 : (struct berval *) &slap_empty_bv,
290 if ( rc != LDAP_SUCCESS ) {
291 return LDAP_INVALID_SYNTAX;
295 if( mr && ( mr->smr_usage & SLAP_MR_DN_FOLD ) ) {
298 ber_str2bv( UTF8normalize( bv.bv_val ? &bv
299 : &ava->la_value, LDAP_UTF8_CASEFOLD ),
305 free( ava->la_value.bv_val );
309 if( do_sort ) AVA_Sort( rdn, iAVA );
317 * dn normalize routine
323 struct berval **normalized )
328 assert( normalized && *normalized == NULL );
330 out = ch_malloc( sizeof( struct berval ) );
331 rc = dnNormalize2( syntax, val, out );
332 if ( rc != LDAP_SUCCESS )
348 Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val, 0, 0 );
350 if ( val->bv_len != 0 ) {
355 * Go to structural representation
357 rc = ldap_str2dn( val->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
358 if ( rc != LDAP_SUCCESS ) {
359 return LDAP_INVALID_SYNTAX;
363 * Schema-aware rewrite
365 if ( LDAPDN_rewrite( dn, 0 ) != LDAP_SUCCESS ) {
367 return LDAP_INVALID_SYNTAX;
371 * Back to string representation
373 rc = ldap_dn2bv( dn, out, LDAP_DN_FORMAT_LDAPV3 );
377 if ( rc != LDAP_SUCCESS ) {
378 return LDAP_INVALID_SYNTAX;
381 ber_dupbv( out, val );
384 Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val, 0, 0 );
390 * dn "pretty"ing routine
396 struct berval **pretty)
401 assert( pretty && *pretty == NULL );
403 out = ch_malloc( sizeof( struct berval ) );
404 rc = dnPretty2( syntax, val, out );
405 if ( rc != LDAP_SUCCESS )
421 Debug( LDAP_DEBUG_TRACE, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
423 if ( val->bv_len != 0 ) {
427 /* FIXME: str2dn should take a bv and handle this */
428 if( strlen( val->bv_val ) != val->bv_len ) {
429 return LDAP_INVALID_SYNTAX;
432 /* FIXME: should be liberal in what we accept */
433 rc = ldap_str2dn( val->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
434 if ( rc != LDAP_SUCCESS ) {
435 return LDAP_INVALID_SYNTAX;
439 * Schema-aware rewrite
441 if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY ) != LDAP_SUCCESS ) {
443 return LDAP_INVALID_SYNTAX;
446 /* FIXME: not sure why the default isn't pretty */
447 /* RE: the default is the form that is used as
448 * an internal representation; the pretty form
450 rc = ldap_dn2bv( dn, out,
451 LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
455 if ( rc != LDAP_SUCCESS ) {
456 return LDAP_INVALID_SYNTAX;
459 ber_dupbv( out, val );
462 Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val, 0, 0 );
468 * Combination of both dnPretty and dnNormalize
474 struct berval *pretty,
475 struct berval *normal)
477 Debug( LDAP_DEBUG_TRACE, ">>> dnPrettyNormal: <%s>\n", val->bv_val, 0, 0 );
483 if ( val->bv_len != 0 ) {
487 pretty->bv_val = NULL;
488 normal->bv_val = NULL;
492 /* FIXME: str2dn should take a bv and handle this */
493 if( strlen( val->bv_val ) != val->bv_len ) {
494 return LDAP_INVALID_SYNTAX;
497 /* FIXME: should be liberal in what we accept */
498 rc = ldap_str2dn( val->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
499 if ( rc != LDAP_SUCCESS ) {
500 return LDAP_INVALID_SYNTAX;
504 * Schema-aware rewrite
506 if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY ) != LDAP_SUCCESS ) {
508 return LDAP_INVALID_SYNTAX;
511 rc = ldap_dn2bv( dn, pretty,
512 LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
514 if ( rc != LDAP_SUCCESS ) {
516 return LDAP_INVALID_SYNTAX;
519 if ( LDAPDN_rewrite( dn, 0 ) != LDAP_SUCCESS ) {
521 free( pretty->bv_val );
522 pretty->bv_val = NULL;
524 return LDAP_INVALID_SYNTAX;
527 rc = ldap_dn2bv( dn, normal, LDAP_DN_FORMAT_LDAPV3 );
530 if ( rc != LDAP_SUCCESS ) {
531 free( pretty->bv_val );
532 pretty->bv_val = NULL;
534 return LDAP_INVALID_SYNTAX;
537 ber_dupbv( pretty, val );
538 ber_dupbv( normal, val );
541 Debug( LDAP_DEBUG_TRACE, "<<< dnPrettyNormal: <%s>, <%s>\n",
542 pretty->bv_val, normal->bv_val, 0 );
556 struct berval *value,
557 void *assertedValue )
560 struct berval *asserted = (struct berval *) assertedValue;
564 assert( assertedValue );
566 match = value->bv_len - asserted->bv_len;
569 match = strcmp( value->bv_val, asserted->bv_val );
573 LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
574 "dnMatch: %d\n %s\n %s\n", match,
575 value->bv_val, asserted->bv_val ));
577 Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
578 match, value->bv_val, asserted->bv_val );
582 return( LDAP_SUCCESS );
586 * dnParent - dn's parent, in-place
588 * note: the incoming dn is assumed to be normalized/prettyfied,
589 * so that escaped rdn/ava separators are in '\'+hexpair form
598 p = strchr( dn->bv_val, ',' );
602 *pdn = slap_empty_bv;
606 assert( DN_SEPARATOR( p[ 0 ] ) );
609 assert( ATTR_LEADCHAR( p[ 0 ] ) );
611 pdn->bv_len = dn->bv_len - (p - dn->bv_val);
628 if( dn->bv_len == 0 ) {
632 rc = ldap_str2rdn( dn->bv_val, &tmpRDN, (char **)&p, LDAP_DN_FORMAT_LDAP );
633 if ( rc != LDAP_SUCCESS ) {
637 rc = ldap_rdn2bv( tmpRDN, rdn, LDAP_DN_FORMAT_LDAPV3 );
638 ldap_rdnfree( tmpRDN );
639 if ( rc != LDAP_SUCCESS ) {
647 * We can assume the input is a prettied or normalized DN
652 struct berval *dn_in )
658 if ( dn_in == NULL ) {
662 if ( !dn_in->bv_len ) {
666 if ( be != NULL && be_issuffix( be, dn_in ) ) {
670 p = strchr( dn_in->bv_val, ',' );
672 return p ? p - dn_in->bv_val : dn_in->bv_len;
678 * LDAP_SUCCESS if rdn is a legal rdn;
679 * LDAP_INVALID_SYNTAX otherwise (including a sequence of rdns)
682 rdnValidate( struct berval *rdn )
686 * input is a pretty or normalized DN
687 * hence, we can just search for ','
689 if( rdn == NULL || rdn->bv_len == 0 ) {
690 return LDAP_INVALID_SYNTAX;
693 return strchr( rdn->bv_val, ',' ) == NULL
694 ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
697 LDAPRDN *RDN, **DN[ 2 ] = { &RDN, NULL };
704 if ( rdn == NULL || rdn == '\0' ) {
711 rc = ldap_str2rdn( rdn, &RDN, (char **)&p, LDAP_DN_FORMAT_LDAP );
712 if ( rc != LDAP_SUCCESS ) {
719 if ( p[ 0 ] != '\0' ) {
724 * Schema-aware validate
726 if ( rc == LDAP_SUCCESS ) {
727 rc = LDAPDN_validate( DN );
732 * Must validate (there's a repeated parsing ...)
734 return ( rc == LDAP_SUCCESS );
741 * Used by ldbm/bdb2 back_modrdn to create the new dn of entries being
744 * new_dn = parent (p_dn) + separator + rdn (newrdn) + null.
748 build_new_dn( struct berval * new_dn,
749 struct berval * parent_dn,
750 struct berval * newrdn )
754 if ( parent_dn == NULL ) {
755 ber_dupbv( new_dn, newrdn );
759 new_dn->bv_len = parent_dn->bv_len + newrdn->bv_len + 1;
760 new_dn->bv_val = (char *) ch_malloc( new_dn->bv_len + 1 );
762 ptr = slap_strcopy( new_dn->bv_val, newrdn->bv_val );
764 strcpy( ptr, parent_dn->bv_val );
769 * dnIsSuffix - tells whether suffix is a suffix of dn.
770 * Both dn and suffix must be normalized.
774 const struct berval *dn,
775 const struct berval *suffix )
777 int d = dn->bv_len - suffix->bv_len;
782 /* empty suffix matches any dn */
783 if ( suffix->bv_len == 0 ) {
787 /* suffix longer than dn */
792 /* no rdn separator or escaped rdn separator */
793 if ( d > 1 && !DN_SEPARATOR( dn->bv_val[ d - 1 ] ) ) {
797 /* no possible match or malformed dn */
803 return( strcmp( dn->bv_val + d, suffix->bv_val ) == 0 );