X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=servers%2Fslapd%2Fdn.c;h=148d8155e9756adda8cd41f9053395a96af96769;hb=1fbbc1181152a32c1b9b82342ad6d63034ec7fbb;hp=be68d02a08c939f8b97032c7b16eedce783c2c33;hpb=0c28b66a7564728d8046d7e9c9840bf3e46f79f9;p=openldap

diff --git a/servers/slapd/dn.c b/servers/slapd/dn.c
index be68d02a08..148d8155e9 100644
--- a/servers/slapd/dn.c
+++ b/servers/slapd/dn.c
@@ -1,7 +1,7 @@
 /* dn.c - routines for dealing with distinguished names */
 /* $OpenLDAP$ */
 /*
- * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
+ * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
  * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
  */
 
@@ -18,527 +18,816 @@
 
 #include "slap.h"
 
-#define B4LEADTYPE		0
-#define B4TYPE			1
-#define INOIDTYPE		2
-#define INKEYTYPE		3
-#define B4EQUAL			4
-#define B4VALUE			5
-#define INVALUE			6
-#define INQUOTEDVALUE	7
-#define B4SEPARATOR		8
-
-#if 0
+#include "lutil.h"
+
+const struct berval slap_empty_bv = { 0, "" };
+
 /*
- * dn_pretty - "pretty" the DN
+ * The DN syntax-related functions take advantage of the dn representation
+ * handling functions ldap_str2dn/ldap_dn2str.  The latter are not schema-
+ * aware, so the attributes and their values need be validated (and possibly
+ * normalized).  In the current implementation the required validation/nor-
+ * malization/"pretty"ing are done on newly created DN structural represen-
+ * tations; however the idea is to move towards DN handling in structural
+ * representation instead of the current string representation.  To this
+ * purpose, we need to do only the required operations and keep track of
+ * what has been done to minimize their impact on performances.
+ *
+ * Developers are strongly encouraged to use this feature, to speed-up
+ * its stabilization.
  */
-char *dn_pretty( const char *dn_in )
-{
-	/*
-	 * dn_validate based implementation (for now)
-	 *	likely better just to zap this, dn_validate, dn_normalize
-	 */
-	char *dn, *dn_out;
 
-	dn = ch_strdup( dn_in );
-	dn_out = dn_validate( dn );
-	if( dn_out == NULL ) free( dn );
-	return dn_out;
-}
-#endif
+#define	AVA_PRIVATE( ava ) ( ( AttributeDescription * )(ava)->la_private )
 
 /*
- * dn_validate - validate and compress dn.  the dn is
- * compressed in place are returned if valid.
+ * In-place, schema-aware validation of the
+ * structural representation of a distinguished name.
  */
-
-char *
-dn_validate( char *dn_in )
+static int
+LDAPDN_validate( LDAPDN *dn )
 {
-	struct berval	val, *normalized;
-	int		rc;
+	int 		iRDN;
+	int 		rc;
 
-	if ( dn_in == NULL || dn_in[ 0 ] == '\0' ) {
-		return( dn_in );
-	}
+	assert( dn );
 
-	val.bv_val = dn_in;
-	val.bv_len = strlen( dn_in );
+	for ( iRDN = 0; dn[ 0 ][ iRDN ]; iRDN++ ) {
+		LDAPRDN		*rdn = dn[ 0 ][ iRDN ];
+		int		iAVA;
 
-	rc = dnPretty( NULL, &val, &normalized );
-	if ( rc != LDAP_SUCCESS ) {
-		return( NULL );
-	}
+		assert( rdn );
 
-	if ( val.bv_len < normalized->bv_len ) {
-		ber_bvfree( normalized );
-		return( NULL );
-	}
+		for ( iAVA = 0; rdn[ 0 ][ iAVA ]; iAVA++ ) {
+			LDAPAVA			*ava = rdn[ 0 ][ iAVA ];
+			AttributeDescription	*ad;
+			slap_syntax_validate_func *validate = NULL;
+
+			assert( ava );
+			
+			if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
+				const char	*text = NULL;
+
+				rc = slap_bv2ad( &ava->la_attr, &ad, &text );
+				if ( rc != LDAP_SUCCESS ) {
+					return LDAP_INVALID_SYNTAX;
+				}
+
+				ava->la_private = ( void * )ad;
+			}
 
-	AC_MEMCPY( dn_in, normalized->bv_val, normalized->bv_len + 1 );
-	ber_bvfree( normalized );
+			/* 
+			 * Replace attr oid/name with the canonical name
+			 */
+			ava->la_attr = ad->ad_cname;
+
+			validate = ad->ad_type->sat_syntax->ssyn_validate;
+
+			if ( validate ) {
+				/*
+			 	 * validate value by validate function
+				 */
+				rc = ( *validate )( ad->ad_type->sat_syntax,
+					&ava->la_value );
+			
+				if ( rc != LDAP_SUCCESS ) {
+					return LDAP_INVALID_SYNTAX;
+				}
+			}
+		}
+	}
 
-	return( dn_in );
+	return LDAP_SUCCESS;
 }
 
 /*
- * dn_normalize - put dn into a canonical form suitable for storing
- * in a hash database.	this involves normalizing the case as well as
- * the format.	the dn is normalized in place as well as returned if valid.
+ * dn validate routine
  */
-
-char *
-dn_normalize( char *dn )
+int
+dnValidate(
+	Syntax *syntax,
+	struct berval *in )
 {
-	struct berval	val, *normalized;
 	int		rc;
+	LDAPDN		*dn = NULL;
 
-	if ( dn == NULL || dn[ 0 ] == '\0' ) {
-		return( dn );
-	}
+	assert( in );
 
-	val.bv_val = dn;
-	val.bv_len = strlen( dn );
+	if ( in->bv_len == 0 ) {
+		return LDAP_SUCCESS;
 
-	rc = dnNormalize( NULL, &val, &normalized );
-	if ( rc != LDAP_SUCCESS ) {
-		return( NULL );
+	} else if ( in->bv_len > SLAP_LDAPDN_MAXLEN ) {
+		return LDAP_INVALID_SYNTAX;
 	}
 
-	if ( val.bv_len < normalized->bv_len ) {
-		ber_bvfree( normalized );
-		return( NULL );
+	rc = ldap_bv2dn( in, &dn, LDAP_DN_FORMAT_LDAP );
+	if ( rc != LDAP_SUCCESS ) {
+		return LDAP_INVALID_SYNTAX;
 	}
 
-	AC_MEMCPY( dn, normalized->bv_val, normalized->bv_len + 1 );
-	ber_bvfree( normalized );
-
-	return( dn );
-}
+	assert( strlen( in->bv_val ) == in->bv_len );
 
-int
-dn_match( const char *val, const char *asserted )
-{
-	struct berval	bval, basserted;
+	/*
+	 * Schema-aware validate
+	 */
+	rc = LDAPDN_validate( dn );
+	ldap_dnfree( dn );
 
-	if ( val == NULL || asserted == NULL ) {
-		return 0;
+	if ( rc != LDAP_SUCCESS ) {
+		return LDAP_INVALID_SYNTAX;
 	}
 
-	bval.bv_val = ( char * )val;
-	bval.bv_len = strlen( val );
-
-	basserted.bv_val = ( char * )asserted;
-	basserted.bv_len = strlen( asserted);
-
-	return dnMatch( NULL, 0, NULL, NULL, &bval, &basserted);
+	return LDAP_SUCCESS;
 }
 
 /*
- * dn_parent - return the dn's parent, in-place
+ * AVA sorting inside a RDN
+ *
+ * rule: sort attributeTypes in alphabetical order; in case of multiple
+ * occurrences of the same attributeType, sort values in byte order
+ * (use memcmp, which implies alphabetical order in case of IA5 value;
+ * this should guarantee the repeatability of the operation).
+ *
+ * Note: the sorting can be slightly improved by sorting first
+ * by attribute type length, then by alphabetical order.
+ *
+ * uses a linear search; should be fine since the number of AVAs in
+ * a RDN should be limited.
  */
-
-char *
-dn_parent(
-	Backend	*be,
-	const char	*dn )
+static void
+AVA_Sort( LDAPRDN *rdn, int iAVA )
 {
-	const char	*s;
-	int	inquote;
+	int		i;
+	LDAPAVA		*ava_in = rdn[ 0 ][ iAVA ];
 
-	if( dn == NULL ) {
-		return NULL;
-	}
+	assert( rdn );
+	assert( ava_in );
+	
+	for ( i = 0; i < iAVA; i++ ) {
+		LDAPAVA		*ava = rdn[ 0 ][ i ];
+		int		a, j;
 
-	while(*dn != '\0' && ASCII_SPACE(*dn)) {
-		dn++;
-	}
+		assert( ava );
 
-	if( *dn == '\0' ) {
-		return NULL;
-	}
+		a = strcmp( ava_in->la_attr.bv_val, ava->la_attr.bv_val );
 
-	if ( be != NULL && be_issuffix( be, dn ) ) {
-		return NULL;
-	}
+		if ( a > 0 ) {
+			break;
+		}
 
-	/*
-	 * assume it is an X.500-style name, which looks like
-	 * foo=bar,sha=baz,...
-	 */
+		while ( a == 0 ) {
+			int		v, d;
+
+			d = ava_in->la_value.bv_len - ava->la_value.bv_len;
+
+			v = memcmp( ava_in->la_value.bv_val, 
+					ava->la_value.bv_val,
+					d <= 0 ? ava_in->la_value.bv_len 
+						: ava->la_value.bv_len );
 
-	inquote = 0;
-	for ( s = dn; *s; s++ ) {
-		if ( *s == '\\' ) {
-			if ( *(s + 1) ) {
-				s++;
+			if ( v == 0 && d != 0 ) {
+				v = d;
 			}
-			continue;
-		}
-		if ( inquote ) {
-			if ( *s == '"' ) {
-				inquote = 0;
+
+			if ( v <= 0 ) {
+				/* 
+				 * got it!
+				 */
+				break;
 			}
-		} else {
-			if ( *s == '"' ) {
-				inquote = 1;
-			} else if ( DN_SEPARATOR( *s ) ) {
-				return (char *)s + 1;
+
+			if ( ++i == iAVA ) {
+				/*
+				 * already sorted
+				 */
+				return;
 			}
+
+			ava = rdn[ 0 ][ i ];
+			a = strcmp( ava_in->la_attr.bv_val, 
+					ava->la_attr.bv_val );
 		}
-	}
 
-	return "";
+		/*
+		 * move ahead
+		 */
+		for ( j = iAVA; j > i; j-- ) {
+			rdn[ 0 ][ j ] = rdn[ 0 ][ j - 1 ];
+		}
+		rdn[ 0 ][ i ] = ava_in;
+
+		return;
+	}
 }
 
-int dn_rdnlen(
-	Backend	*be,
-	const char	*dn_in )
+/*
+ * In-place, schema-aware normalization / "pretty"ing of the
+ * structural representation of a distinguished name.
+ */
+static int
+LDAPDN_rewrite( LDAPDN *dn, unsigned flags )
 {
-	char	*s;
-	int	inquote;
+	int 		iRDN;
+	int 		rc;
 
-	if( dn_in == NULL ) {
-		return 0;
-	}
+	assert( dn );
 
-	while(*dn_in && ASCII_SPACE(*dn_in)) {
-		dn_in++;
-	}
+	for ( iRDN = 0; dn[ 0 ][ iRDN ]; iRDN++ ) {
+		LDAPRDN		*rdn = dn[ 0 ][ iRDN ];
+		int		iAVA;
+
+		assert( rdn );
+
+		for ( iAVA = 0; rdn[ 0 ][ iAVA ]; iAVA++ ) {
+			LDAPAVA			*ava = rdn[ 0 ][ iAVA ];
+			AttributeDescription	*ad;
+			slap_syntax_validate_func *validf = NULL;
+			slap_syntax_transform_func *transf = NULL;
+			MatchingRule *mr;
+			struct berval		bv = { 0, NULL };
+			int			do_sort = 0;
+
+			assert( ava );
+
+			if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
+				const char	*text = NULL;
+
+				rc = slap_bv2ad( &ava->la_attr, &ad, &text );
+				if ( rc != LDAP_SUCCESS ) {
+					return LDAP_INVALID_SYNTAX;
+				}
+				
+				ava->la_private = ( void * )ad;
+				do_sort = 1;
+			}
 
-	if( *dn_in == '\0' ) {
-		return( 0 );
-	}
+			/* 
+			 * Replace attr oid/name with the canonical name
+			 */
+			ava->la_attr = ad->ad_cname;
+
+			if( ava->la_flags & LDAP_AVA_BINARY ) {
+				/* AVA is binary encoded, don't muck with it */
+				validf = NULL;
+				transf = NULL;
+				mr = NULL;
+			} else if( flags & SLAP_LDAPDN_PRETTY ) {
+				validf = NULL;
+				transf = ad->ad_type->sat_syntax->ssyn_pretty;
+				mr = NULL;
+			} else {
+				validf = ad->ad_type->sat_syntax->ssyn_validate;
+				transf = ad->ad_type->sat_syntax->ssyn_normalize;
+				mr = ad->ad_type->sat_equality;
+			}
 
-	if ( be != NULL && be_issuffix( be, dn_in ) ) {
-		return( 0 );
-	}
+			if ( validf ) {
+				/* validate value before normalization */
+				rc = ( *validf )( ad->ad_type->sat_syntax,
+					ava->la_value.bv_len
+						? &ava->la_value
+						: (struct berval *) &slap_empty_bv );
 
-	inquote = 0;
+				if ( rc != LDAP_SUCCESS ) {
+					return LDAP_INVALID_SYNTAX;
+				}
+			}
 
-	for ( s = (char *)dn_in; *s; s++ ) {
-		if ( *s == '\\' ) {
-			if ( *(s + 1) ) {
-				s++;
+			if ( transf ) {
+				/*
+			 	 * transform value by normalize/pretty function
+				 *	if value is empty, use empty_bv
+				 */
+				rc = ( *transf )( ad->ad_type->sat_syntax,
+					ava->la_value.bv_len
+						? &ava->la_value
+						: (struct berval *) &slap_empty_bv,
+					&bv );
+			
+				if ( rc != LDAP_SUCCESS ) {
+					return LDAP_INVALID_SYNTAX;
+				}
 			}
-			continue;
-		}
-		if ( inquote ) {
-			if ( *s == '"' ) {
-				inquote = 0;
+
+			if( mr && ( mr->smr_usage & SLAP_MR_DN_FOLD ) ) {
+				char *s = bv.bv_val;
+
+				if ( UTF8bvnormalize( &bv, &bv, 
+						LDAP_UTF8_CASEFOLD ) == NULL ) {
+					return LDAP_INVALID_SYNTAX;
+				}
+				free( s );
 			}
-		} else {
-			if ( *s == '"' ) {
-				inquote = 1;
-			} else if ( DN_SEPARATOR( *s ) ) {
-				break;
+
+			if( bv.bv_val ) {
+				free( ava->la_value.bv_val );
+				ava->la_value = bv;
 			}
+
+			if( do_sort ) AVA_Sort( rdn, iAVA );
 		}
 	}
 
-	return( s - dn_in );
+	return LDAP_SUCCESS;
 }
 
-char * dn_rdn(
-	Backend	*be,
-	const char	*dn_in )
+/*
+ * dn normalize routine
+ */
+int
+dnNormalize(
+	Syntax *syntax,
+	struct berval *val,
+	struct berval **normalized )
 {
-	char *rdn;
-	int i = dn_rdnlen( be, dn_in );
+	struct berval *out;
+	int rc;
+
+	assert( normalized && *normalized == NULL );
+
+	out = ch_malloc( sizeof( struct berval ) );
+	rc = dnNormalize2( syntax, val, out );
+	if ( rc != LDAP_SUCCESS )
+		free( out );
+	else
+		*normalized = out;
+	return rc;
+}
+
+int
+dnNormalize2(
+	Syntax *syntax,
+	struct berval *val,
+	struct berval *out )
+{
+	assert( val );
+	assert( out );
+
+	Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val, 0, 0 );
+
+	if ( val->bv_len != 0 ) {
+		LDAPDN		*dn = NULL;
+		int		rc;
+
+		/*
+		 * Go to structural representation
+		 */
+		rc = ldap_bv2dn( val, &dn, LDAP_DN_FORMAT_LDAP );
+		if ( rc != LDAP_SUCCESS ) {
+			return LDAP_INVALID_SYNTAX;
+		}
+
+		assert( strlen( val->bv_val ) == val->bv_len );
+
+		/*
+		 * Schema-aware rewrite
+		 */
+		if ( LDAPDN_rewrite( dn, 0 ) != LDAP_SUCCESS ) {
+			ldap_dnfree( dn );
+			return LDAP_INVALID_SYNTAX;
+		}
+
+		/*
+		 * Back to string representation
+		 */
+		rc = ldap_dn2bv( dn, out,
+			LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
 
-	rdn = ch_malloc( i + 1 );
-	strncpy(rdn, dn_in, i);
-	rdn[i] = '\0';
-	return rdn;
+		ldap_dnfree( dn );
+
+		if ( rc != LDAP_SUCCESS ) {
+			return LDAP_INVALID_SYNTAX;
+		}
+	} else {
+		ber_dupbv( out, val );
+	}
+
+	Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val, 0, 0 );
+
+	return LDAP_SUCCESS;
 }
 
 /*
- * return a charray of all subtrees to which the DN resides in
+ * dn "pretty"ing routine
  */
-char **dn_subtree(
-	Backend	*be,
-	const char	*dn )
+int
+dnPretty(
+	Syntax *syntax,
+	struct berval *val,
+	struct berval **pretty)
 {
-	char **subtree = NULL;
-	
-	do {
-		charray_add( &subtree, dn );
+	struct berval *out;
+	int rc;
+
+	assert( pretty && *pretty == NULL );
+
+	out = ch_malloc( sizeof( struct berval ) );
+	rc = dnPretty2( syntax, val, out );
+	if ( rc != LDAP_SUCCESS )
+		free( out );
+	else
+		*pretty = out;
+	return rc;
+}
 
-		dn = dn_parent( be, dn );
+int
+dnPretty2(
+	Syntax *syntax,
+	struct berval *val,
+	struct berval *out)
+{
+	assert( val );
+	assert( out );
 
-	} while ( dn != NULL );
+#ifdef NEW_LOGGING
+	LDAP_LOG( OPERATION, ARGS, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
+#endif
 
-	return subtree;
-}
+	if ( val->bv_len == 0 ) {
+		ber_dupbv( out, val );
+
+	} else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
+		return LDAP_INVALID_SYNTAX;
+
+	} else {
+		LDAPDN		*dn = NULL;
+		int		rc;
+
+		/* FIXME: should be liberal in what we accept */
+		rc = ldap_bv2dn( val, &dn, LDAP_DN_FORMAT_LDAP );
+		if ( rc != LDAP_SUCCESS ) {
+			return LDAP_INVALID_SYNTAX;
+		}
+
+		assert( strlen( val->bv_val ) == val->bv_len );
+
+		/*
+		 * Schema-aware rewrite
+		 */
+		if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY ) != LDAP_SUCCESS ) {
+			ldap_dnfree( dn );
+			return LDAP_INVALID_SYNTAX;
+		}
 
+		/* FIXME: not sure why the default isn't pretty */
+		/* RE: the default is the form that is used as
+		 * an internal representation; the pretty form
+		 * is a variant */
+		rc = ldap_dn2bv( dn, out,
+			LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
+
+		ldap_dnfree( dn );
+
+		if ( rc != LDAP_SUCCESS ) {
+			return LDAP_INVALID_SYNTAX;
+		}
+	}
+
+	Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val, 0, 0 );
+
+	return LDAP_SUCCESS;
+}
 
 int
-dn_issuffixbv(
-	const struct berval *dn,
-	const struct berval *suffix
-)
+dnPrettyNormalDN(
+	Syntax *syntax,
+	struct berval *val,
+	LDAPDN **dn,
+	int flags )
 {
-	int	d = dn->bv_len - suffix->bv_len;
-
+	assert( val );
 	assert( dn );
-	assert( suffix );
 
-	/* empty suffix matches any dn */
-	if ( suffix->bv_len == 0 ) {
-		return 1;
-	}
+#ifdef NEW_LOGGING
+	LDAP_LOG( OPERATION, ARGS, ">>> dn%sDN: <%s>\n", 
+			flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal", 
+			val->bv_val, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, ">>> dn%sDN: <%s>\n", 
+			flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal", 
+			val->bv_val, 0 );
+#endif
 
-	/* suffix longer than dn */
-	if ( d < 0 ) {
-		return 0;
-	}
+	if ( val->bv_len == 0 ) {
+		return LDAP_SUCCESS;
 
-	/* no rdn separator or escaped rdn separator */
-	if ( d > 1 && ( !DN_SEPARATOR( dn->bv_val[ d - 1 ] ) 
-				|| DN_ESCAPE( dn->bv_val[ d - 2 ] ) ) ) {
-		return 0;
-	}
+	} else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
+		return LDAP_INVALID_SYNTAX;
 
-	/* no possible match or malformed dn */
-	if ( d == 1 ) {
-		return 0;
+	} else {
+		int		rc;
+
+		/* FIXME: should be liberal in what we accept */
+		rc = ldap_bv2dn( val, dn, LDAP_DN_FORMAT_LDAP );
+		if ( rc != LDAP_SUCCESS ) {
+			return LDAP_INVALID_SYNTAX;
+		}
+
+		assert( strlen( val->bv_val ) == val->bv_len );
+
+		/*
+		 * Schema-aware rewrite
+		 */
+		if ( LDAPDN_rewrite( *dn, flags ) != LDAP_SUCCESS ) {
+			ldap_dnfree( *dn );
+			*dn = NULL;
+			return LDAP_INVALID_SYNTAX;
+		}
 	}
 
-	/* compare */
-	return( strcmp( dn->bv_val + d, suffix->bv_val ) == 0 );
+	Debug( LDAP_DEBUG_TRACE, "<<< dn%sDN\n", 
+			flags == SLAP_LDAPDN_PRETTY ? "Pretty" : "Normal",
+			0, 0 );
+
+	return LDAP_SUCCESS;
 }
 
 /*
- * dn_issuffix - tells whether suffix is a suffix of dn. Both dn
- * and suffix must be normalized.
+ * Combination of both dnPretty and dnNormalize
  */
-
 int
-dn_issuffix(
-	const char	*dn,
-	const char	*suffix
-)
+dnPrettyNormal(
+	Syntax *syntax,
+	struct berval *val,
+	struct berval *pretty,
+	struct berval *normal)
 {
-	struct berval	bvdn, bvsuffix;
+#ifdef NEW_LOGGING
+	LDAP_LOG ( OPERATION, ENTRY, ">>> dnPrettyNormal: <%s>\n", val->bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, ">>> dnPrettyNormal: <%s>\n", val->bv_val, 0, 0 );
+#endif
 
-	assert( dn );
-	assert( suffix );
+	assert( val );
+	assert( pretty );
+	assert( normal );
 
-	bvdn.bv_val = (char *) dn;
-	bvdn.bv_len = strlen( dn );
-	bvsuffix.bv_val = (char *) suffix;
-	bvsuffix.bv_len = strlen( suffix );
+	if ( val->bv_len == 0 ) {
+		ber_dupbv( pretty, val );
+		ber_dupbv( normal, val );
 
-	return dn_issuffixbv( &bvdn, &bvsuffix );
-}
+	} else if ( val->bv_len > SLAP_LDAPDN_MAXLEN ) {
+		/* too big */
+		return LDAP_INVALID_SYNTAX;
 
-/*
- * get_next_substring(), rdn_attr_type(), rdn_attr_value(), and
- * build_new_dn().
- *
- * Copyright 1999, Juan C. Gomez, All rights reserved.
- * This software is not subject to any license of Silicon Graphics
- * Inc. or Purdue University.
- *
- * Redistribution and use in source and binary forms are permitted
- * without restriction or fee of any kind as long as this notice
- * is preserved.
- *
- */
+	} else {
+		LDAPDN		*dn = NULL;
+		int		rc;
 
-/* get_next_substring:
- *
- * Gets next substring in s, using d (or the end of the string '\0') as a
- * string delimiter, and places it in a duplicated memory space. Leading
- * spaces are ignored. String s **must** be null-terminated.
- */
+		pretty->bv_val = NULL;
+		normal->bv_val = NULL;
+		pretty->bv_len = 0;
+		normal->bv_len = 0;
 
-static char *
-get_next_substring( const char * s, char d )
-{
+		/* FIXME: should be liberal in what we accept */
+		rc = ldap_bv2dn( val, &dn, LDAP_DN_FORMAT_LDAP );
+		if ( rc != LDAP_SUCCESS ) {
+			return LDAP_INVALID_SYNTAX;
+		}
 
-	char	*str, *r;
+		assert( strlen( val->bv_val ) == val->bv_len );
 
-	r = str = ch_malloc( strlen(s) + 1 );
+		/*
+		 * Schema-aware rewrite
+		 */
+		if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY ) != LDAP_SUCCESS ) {
+			ldap_dnfree( dn );
+			return LDAP_INVALID_SYNTAX;
+		}
 
-	/* Skip leading spaces */
-	
-	while ( *s && ASCII_SPACE(*s) ) {
-		s++;
-	}
-	
-	/* Copy word */
+		rc = ldap_dn2bv( dn, pretty,
+			LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
 
-	while ( *s && (*s != d) ) {
+		if ( rc != LDAP_SUCCESS ) {
+			ldap_dnfree( dn );
+			return LDAP_INVALID_SYNTAX;
+		}
+
+		if ( LDAPDN_rewrite( dn, 0 ) != LDAP_SUCCESS ) {
+			ldap_dnfree( dn );
+			free( pretty->bv_val );
+			pretty->bv_val = NULL;
+			pretty->bv_len = 0;
+			return LDAP_INVALID_SYNTAX;
+		}
 
-		/* Don't stop when you see trailing spaces may be a multi-word
-		* string, i.e. name=John Doe!
-		*/
+		rc = ldap_dn2bv( dn, normal,
+			LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
 
-		*str++ = *s++;
+		ldap_dnfree( dn );
+		if ( rc != LDAP_SUCCESS ) {
+			free( pretty->bv_val );
+			pretty->bv_val = NULL;
+			pretty->bv_len = 0;
+			return LDAP_INVALID_SYNTAX;
+		}
 	}
-	
-	*str = '\0';
-	
-	return r;
-	
-}
 
+#ifdef NEW_LOGGING
+	LDAP_LOG (OPERATION, RESULTS, "<<< dnPrettyNormal: <%s>, <%s>\n",
+		pretty->bv_val, normal->bv_val, 0  );
+#else
+	Debug( LDAP_DEBUG_TRACE, "<<< dnPrettyNormal: <%s>, <%s>\n",
+		pretty->bv_val, normal->bv_val, 0 );
+#endif
+
+	return LDAP_SUCCESS;
+}
 
-/* rdn_attr_type:
- *
- * Given a string (i.e. an rdn) of the form:
- *	 "attribute_type = attribute_value"
- * this function returns the type of an attribute, that is the
- * string "attribute_type" which is placed in newly allocated
- * memory. The returned string will be null-terminated.
+/*
+ * dnMatch routine
  */
-
-char * rdn_attr_type( const char * s )
+int
+dnMatch(
+	int *matchp,
+	slap_mask_t flags,
+	Syntax *syntax,
+	MatchingRule *mr,
+	struct berval *value,
+	void *assertedValue )
 {
-	return get_next_substring( s, '=' );
-}
+	int match;
+	struct berval *asserted = (struct berval *) assertedValue;
 
+	assert( matchp );
+	assert( value );
+	assert( assertedValue );
+	
+	match = value->bv_len - asserted->bv_len;
+
+	if ( match == 0 ) {
+		match = memcmp( value->bv_val, asserted->bv_val, 
+				value->bv_len );
+	}
+
+#ifdef NEW_LOGGING
+	LDAP_LOG( CONFIG, ENTRY, "dnMatch: %d\n    %s\n    %s\n", 
+		match, value->bv_val, asserted->bv_val  );
+#else
+	Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
+		match, value->bv_val, asserted->bv_val );
+#endif
+
+	*matchp = match;
+	return( LDAP_SUCCESS );
+}
 
-/* rdn_attr_value:
+/*
+ * dnParent - dn's parent, in-place
  *
- * Given a string (i.e. an rdn) of the form:
- *	 "attribute_type = attribute_value"
- * this function returns "attribute_type" which is placed in newly allocated
- * memory. The returned string will be null-terminated and may contain
- * spaces (i.e. "John Doe\0").
+ * note: the incoming dn is assumed to be normalized/prettyfied,
+ * so that escaped rdn/ava separators are in '\'+hexpair form
  */
-
-char *
-rdn_attr_value( const char * rdn )
+void
+dnParent( 
+	struct berval	*dn, 
+	struct berval	*pdn )
 {
+	char	*p;
 
-	const char	*str;
+	p = strchr( dn->bv_val, ',' );
 
-	if ( (str = strchr( rdn, '=' )) != NULL ) {
-		return get_next_substring(++str, '\0');
+	/* one-level dn */
+	if ( p == NULL ) {
+		pdn->bv_len = 0;
+		pdn->bv_val = dn->bv_val + dn->bv_len;
+		return;
 	}
 
-	return NULL;
+	assert( DN_SEPARATOR( p[ 0 ] ) );
+	p++;
+
+	assert( ATTR_LEADCHAR( p[ 0 ] ) );
+	pdn->bv_val = p;
+	pdn->bv_len = dn->bv_len - (p - dn->bv_val);
 
+	return;
 }
 
+int
+dnExtractRdn( 
+	struct berval	*dn, 
+	struct berval 	*rdn )
+{
+	LDAPRDN		*tmpRDN;
+	const char	*p;
+	int		rc;
 
-/* rdn_attrs:
- *
- * Given a string (i.e. an rdn) of the form:
- *   "attribute_type=attribute_value[+attribute_type=attribute_value[...]]"
- * this function stores the types of the attributes in ptypes, that is the
- * array of strings "attribute_type" which is placed in newly allocated
- * memory, and the values of the attributes in pvalues, that is the
- * array of strings "attribute_value" which is placed in newly allocated
- * memory. Returns 0 on success, -1 on failure.
- *
- * note: got part of the code from dn_validate
- */
+	assert( dn );
+	assert( rdn );
 
-int
-rdn_attrs( const char * rdn_in, char ***ptypes, char ***pvalues)
+	if( dn->bv_len == 0 ) {
+		return LDAP_OTHER;
+	}
+
+	rc = ldap_bv2rdn( dn, &tmpRDN, (char **)&p, LDAP_DN_FORMAT_LDAP );
+	if ( rc != LDAP_SUCCESS ) {
+		return rc;
+	}
+
+	rc = ldap_rdn2bv( tmpRDN, rdn, LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
+
+	ldap_rdnfree( tmpRDN );
+	if ( rc != LDAP_SUCCESS ) {
+		return rc;
+	}
+
+	return LDAP_SUCCESS;
+}
+
+/*
+ * We can assume the input is a prettied or normalized DN
+ */
+int 
+dn_rdnlen(
+	Backend		*be,
+	struct berval	*dn_in )
 {
-	char **parts, **p;
+	const char	*p;
 
-	*ptypes = NULL;
-	*pvalues = NULL;
+	assert( dn_in );
 
-	/*
-	 * explode the rdn in parts
-	 */
-	parts = ldap_explode_rdn( rdn_in, 0 );
+	if ( dn_in == NULL ) {
+		return 0;
+	}
 
-	if ( parts == NULL ) {
-		return( -1 );
+	if ( !dn_in->bv_len ) {
+		return 0;
 	}
 
-	for ( p = parts; p[0]; p++ ) {
-		char *s, *e, *d;
-		
-		/* split each rdn part in type value */
-		s = strchr( p[0], '=' );
-		if ( s == NULL ) {
-			charray_free( *ptypes );
-			charray_free( *pvalues );
-			charray_free( parts );
-			return( -1 );
-		}
-		
-		/* type should be fine */
-		charray_add_n( ptypes, p[0], ( s-p[0] ) );
-
-		/* value needs to be unescaped
-		 * (maybe this should be moved to ldap_explode_rdn?) */
-		for ( e = d = s + 1; e[0]; e++ ) {
-			if ( *e != '\\' ) {
-				*d++ = *e;
-			}
-		}
-		d[0] = '\0';
-		charray_add( pvalues, s + 1 );
+	if ( be != NULL && be_issuffix( be, dn_in ) ) {
+		return 0;
 	}
 
-	/* free array */
-	charray_free( parts );
+	p = strchr( dn_in->bv_val, ',' );
 
-	return( 0 );
+	return p ? p - dn_in->bv_val : dn_in->bv_len;
 }
 
 
-/* rdn_validate:
- *
- * 1 if rdn is a legal rdn;
- * 0 otherwise (including a sequence of rdns)
+/* rdnValidate:
  *
- * note: got it from dn_rdn; it should be rewritten
- * according to dn_validate
+ * LDAP_SUCCESS if rdn is a legal rdn;
+ * LDAP_INVALID_SYNTAX otherwise (including a sequence of rdns)
  */
 int
-rdn_validate( const char * rdn )
+rdnValidate( struct berval *rdn )
 {
-	int	inquote;
-
-	if ( rdn == NULL ) {
-		return( 0 );
+#if 1
+	/* Major cheat!
+	 * input is a pretty or normalized DN
+	 * hence, we can just search for ','
+	 */
+	if( rdn == NULL || rdn->bv_len == 0 ||
+		rdn->bv_len > SLAP_LDAPDN_MAXLEN )
+	{
+		return LDAP_INVALID_SYNTAX;
 	}
 
-	if ( strchr( rdn, '=' ) == NULL ) {
-		return( 0 );
-	}
+	return strchr( rdn->bv_val, ',' ) == NULL
+		? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
+
+#else
+	LDAPRDN		*RDN, **DN[ 2 ] = { &RDN, NULL };
+	const char	*p;
+	int		rc;
 
-	while ( *rdn && ASCII_SPACE( *rdn ) ) {
-		rdn++;
+	/*
+	 * must be non-empty
+	 */
+	if ( rdn == NULL || rdn == '\0' ) {
+		return 0;
 	}
 
-	if( *rdn == '\0' ) {
-		return( 0 );
+	/*
+	 * must be parsable
+	 */
+	rc = ldap_bv2rdn( rdn, &RDN, (char **)&p, LDAP_DN_FORMAT_LDAP );
+	if ( rc != LDAP_SUCCESS ) {
+		return 0;
 	}
 
-	inquote = 0;
+	/*
+	 * Must be one-level
+	 */
+	if ( p[ 0 ] != '\0' ) {
+		return 0;
+	}
 
-	for ( ; *rdn; rdn++ ) {
-		if ( *rdn == '\\' ) {
-			if ( *(rdn + 1) ) {
-				rdn++;
-			}
-			continue;
-		}
-		if ( inquote ) {
-			if ( *rdn == '"' ) {
-				inquote = 0;
-			}
-		} else {
-			if ( *rdn == '"' ) {
-				inquote = 1;
-			} else if ( DN_SEPARATOR( *rdn ) ) {
-				return( 0 );
-			}
-		}
+	/*
+	 * Schema-aware validate
+	 */
+	if ( rc == LDAP_SUCCESS ) {
+		rc = LDAPDN_validate( DN );
 	}
+	ldap_rdnfree( RDN );
 
-	return( 1 );
+	/*
+	 * Must validate (there's a repeated parsing ...)
+	 */
+	return ( rc == LDAP_SUCCESS );
+#endif
 }
 
 
@@ -547,24 +836,86 @@ rdn_validate( const char * rdn )
  * Used by ldbm/bdb2 back_modrdn to create the new dn of entries being
  * renamed.
  *
- * new_dn = parent (p_dn) + separator(s) + rdn (newrdn) + null.
+ * new_dn = parent (p_dn) + separator + rdn (newrdn) + null.
  */
 
 void
-build_new_dn( char ** new_dn,
-	const char *e_dn,
-	const char * p_dn,
-	const char * newrdn )
+build_new_dn( struct berval * new_dn,
+	struct berval * parent_dn,
+	struct berval * newrdn )
 {
+	char *ptr;
 
-	if ( p_dn == NULL ) {
-		*new_dn = ch_strdup( newrdn );
+	if ( parent_dn == NULL ) {
+		ber_dupbv( new_dn, newrdn );
 		return;
 	}
 
-	*new_dn = (char *) ch_malloc( strlen( p_dn ) + strlen( newrdn ) + 3 );
+	new_dn->bv_len = parent_dn->bv_len + newrdn->bv_len + 1;
+	new_dn->bv_val = (char *) ch_malloc( new_dn->bv_len + 1 );
+
+	ptr = lutil_strcopy( new_dn->bv_val, newrdn->bv_val );
+	*ptr++ = ',';
+	strcpy( ptr, parent_dn->bv_val );
+}
+
+
+/*
+ * dnIsSuffix - tells whether suffix is a suffix of dn.
+ * Both dn and suffix must be normalized.
+ */
+int
+dnIsSuffix(
+	const struct berval *dn,
+	const struct berval *suffix )
+{
+	int	d = dn->bv_len - suffix->bv_len;
+
+	assert( dn );
+	assert( suffix );
+
+	/* empty suffix matches any dn */
+	if ( suffix->bv_len == 0 ) {
+		return 1;
+	}
+
+	/* suffix longer than dn */
+	if ( d < 0 ) {
+		return 0;
+	}
 
-	strcpy( *new_dn, newrdn );
-	strcat( *new_dn, "," );
-	strcat( *new_dn, p_dn );
+	/* no rdn separator or escaped rdn separator */
+	if ( d > 1 && !DN_SEPARATOR( dn->bv_val[ d - 1 ] ) ) {
+		return 0;
+	}
+
+	/* no possible match or malformed dn */
+	if ( d == 1 ) {
+		return 0;
+	}
+
+	/* compare */
+	return( strcmp( dn->bv_val + d, suffix->bv_val ) == 0 );
+}
+
+#ifdef HAVE_TLS
+/*
+ * Convert an X.509 DN into a normalized LDAP DN
+ */
+int
+dnX509normalize( void *x509_name, struct berval *out )
+{
+	/* Invoke the LDAP library's converter with our schema-rewriter */
+	return ldap_X509dn2bv( x509_name, out, LDAPDN_rewrite, 0 );
 }
+
+/*
+ * Get the TLS session's peer's DN into a normalized LDAP DN
+ */
+int
+dnX509peerNormalize( void *ssl, struct berval *dn )
+{
+
+	return ldap_pvt_tls_get_peer_dn( ssl, dn, (LDAPDN_rewrite_dummy *)LDAPDN_rewrite, 0 );
+}
+#endif