]> git.sur5r.net Git - openldap/blobdiff - servers/slapd/dn.c
Move backend_syncfreq code down into back-ldbm. Creates new configuration
[openldap] / servers / slapd / dn.c
index 0b85141b88ca3e9cf27c86528ba685c72616b580..08cda568fa7072cd43aa37cfbe73721dc0644811 100644 (file)
@@ -1,7 +1,7 @@
 /* dn.c - routines for dealing with distinguished names */
 /* $OpenLDAP$ */
 /*
- * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
+ * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
  * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
  */
 
 #define INQUOTEDVALUE  7
 #define B4SEPARATOR            8
 
+#define UTF8DN 1
+
 /*
  * dn_validate - validate and compress dn.  the dn is
  * compressed in place are returned if valid.
  */
 
 char *
-dn_validate( char *dn )
+dn_validate( char *dn_in )
 {
        char    *d, *s;
        int     state, gotesc;
+       char    *dn = dn_in;
 
        gotesc = 0;
        state = B4LEADTYPE;
@@ -45,13 +48,13 @@ dn_validate( char *dn )
                switch ( state ) {
                case B4LEADTYPE:
                case B4TYPE:
-                       if ( LEADOIDCHAR(*s) ) {
+                       if ( OID_LEADCHAR(*s) ) {
                                state = INOIDTYPE;
                                *d++ = *s;
-                       } else if ( LEADKEYCHAR(*s) ) {
+                       } else if ( ATTR_LEADCHAR(*s) ) {
                                state = INKEYTYPE;
                                *d++ = *s;
-                       } else if ( ! SPACE( *s ) ) {
+                       } else if ( ! ASCII_SPACE( *s ) ) {
                                dn = NULL;
                                state = INKEYTYPE;
                                *d++ = *s;
@@ -59,12 +62,12 @@ dn_validate( char *dn )
                        break;
 
                case INOIDTYPE:
-                       if ( OIDCHAR(*s) ) {
+                       if ( OID_CHAR(*s) ) {
                                *d++ = *s;
                        } else if ( *s == '=' ) {
                                state = B4VALUE;
                                *d++ = *s;
-                       } else if ( SPACE( *s ) ) {
+                       } else if ( ASCII_SPACE( *s ) ) {
                                state = B4EQUAL;
                        } else {
                                dn = NULL;
@@ -73,12 +76,12 @@ dn_validate( char *dn )
                        break;
 
                case INKEYTYPE:
-                       if ( KEYCHAR(*s) ) {
+                       if ( ATTR_CHAR(*s) ) {
                                *d++ = *s;
                        } else if ( *s == '=' ) {
                                state = B4VALUE;
                                *d++ = *s;
-                       } else if ( SPACE( *s ) ) {
+                       } else if ( ASCII_SPACE( *s ) ) {
                                state = B4EQUAL;
                        } else {
                                dn = NULL;
@@ -90,7 +93,7 @@ dn_validate( char *dn )
                        if ( *s == '=' ) {
                                state = B4VALUE;
                                *d++ = *s;
-                       } else if ( ! SPACE( *s ) ) {
+                       } else if ( ! ASCII_SPACE( *s ) ) {
                                /* not a valid dn - but what can we do here? */
                                *d++ = *s;
                                dn = NULL;
@@ -101,15 +104,15 @@ dn_validate( char *dn )
                        if ( *s == '"' ) {
                                state = INQUOTEDVALUE;
                                *d++ = *s;
-                       } else if ( ! SPACE( *s ) ) { 
+                       } else if ( ! ASCII_SPACE( *s ) ) { 
                                state = INVALUE;
                                *d++ = *s;
                        }
                        break;
 
                case INVALUE:
-                       if ( !gotesc && SEPARATOR( *s ) ) {
-                               while ( SPACE( *(d - 1) ) )
+                       if ( !gotesc && RDN_SEPARATOR( *s ) ) {
+                               while ( ASCII_SPACE( *(d - 1) ) )
                                        d--;
                                state = B4TYPE;
                                if ( *s == '+' ) {
@@ -117,11 +120,11 @@ dn_validate( char *dn )
                                } else {
                                        *d++ = ',';
                                }
-                       } else if ( gotesc && !NEEDSESCAPE( *s ) &&
-                           !SEPARATOR( *s ) ) {
+                       } else if ( gotesc && !RDN_NEEDSESCAPE( *s ) &&
+                           !RDN_SEPARATOR( *s ) ) {
                                *--d = *s;
                                d++;
-                       } else {
+                       } else if( !ASCII_SPACE( *s ) || !ASCII_SPACE( *(d - 1) ) ) {
                                *d++ = *s;
                        }
                        break;
@@ -130,31 +133,47 @@ dn_validate( char *dn )
                        if ( !gotesc && *s == '"' ) {
                                state = B4SEPARATOR;
                                *d++ = *s;
-                       } else if ( gotesc && !NEEDSESCAPE( *s ) ) {
+                       } else if ( gotesc && !RDN_NEEDSESCAPE( *s ) ) {
                                *--d = *s;
                                d++;
-                       } else {
+                       } else if( !ASCII_SPACE( *s ) || !ASCII_SPACE( *(d - 1) ) ) {
                                *d++ = *s;
                        }
                        break;
+
                case B4SEPARATOR:
-                       if ( SEPARATOR( *s ) ) {
+                       if ( RDN_SEPARATOR( *s ) ) {
                                state = B4TYPE;
                                *d++ = *s;
+                       } else if ( !ASCII_SPACE( *s ) ) {
+                               dn = NULL;
                        }
                        break;
+
                default:
                        dn = NULL;
+#ifdef NEW_LOGGING
+                       LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
+                                  "dn_validate: unknown state %d for dn \"%s\".\n",
+                                  state, dn_in ));
+#else
                        Debug( LDAP_DEBUG_ANY,
                            "dn_validate - unknown state %d\n", state, 0, 0 );
+#endif
                        break;
                }
+
                if ( *s == '\\' ) {
                        gotesc = 1;
                } else {
                        gotesc = 0;
                }
        }
+
+       /* trim trailing spaces */
+       while( d > dn_in && ASCII_SPACE( *(d-1) ) ) {
+               --d;
+       }
        *d = '\0';
 
        if( gotesc ) {
@@ -177,20 +196,38 @@ dn_validate( char *dn )
 
 /*
  * 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.
+ * 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.
  */
 
 char *
 dn_normalize( char *dn )
 {
+       char *out;
        /* upper case it */
+#ifndef UTF8DN
        ldap_pvt_str2upper( dn );
-
        /* validate and compress dn */
-       dn = dn_validate( dn );
+       out = dn_validate( dn );
+#else
+       /* enabling this might require reindexing */
+       struct berval *bvdn, *nbvdn;
 
-       return( dn );
+       out = NULL;
+       bvdn = ber_bvstr( dn );
+       
+       if ( dnNormalize( NULL, bvdn, &nbvdn ) == LDAP_SUCCESS ) {
+               if ( nbvdn->bv_len <= bvdn->bv_len ) {
+                       out = dn;
+                       strcpy( out, nbvdn->bv_val );
+               }
+               ber_bvfree( nbvdn );
+       }
+       bvdn->bv_val = NULL; /* prevent bvfree from freeing dn */
+       ber_bvfree( bvdn );
+#endif
+
+       return( out );
 }
 
 /*
@@ -210,20 +247,20 @@ dn_parent(
                return NULL;
        }
 
-       while(*dn && SPACE(*dn)) {
+       while(*dn != '\0' && ASCII_SPACE(*dn)) {
                dn++;
        }
 
        if( *dn == '\0' ) {
-               return( NULL );
+               return NULL;
        }
 
        if ( be != NULL && be_issuffix( be, dn ) ) {
-               return( NULL );
+               return NULL;
        }
 
        /*
-        * else assume it is an X.500-style name, which looks like
+        * assume it is an X.500-style name, which looks like
         * foo=bar,sha=baz,...
         */
 
@@ -242,39 +279,39 @@ dn_parent(
                } else {
                        if ( *s == '"' ) {
                                inquote = 1;
-                       } else if ( DNSEPARATOR( *s ) ) {
-                               return( ch_strdup( &s[1] ) );
+                       } else if ( DN_SEPARATOR( *s ) ) {
+                               return ch_strdup( &s[1] );
                        }
                }
        }
 
-       return( ch_strdup( "" ) );
+       return ch_strdup( "" );
 }
 
 char * dn_rdn( 
     Backend    *be,
-    char       *dn )
+    const char *dn_in )
 {
-       char    *s;
+       char    *dn, *s;
        int     inquote;
 
-       if( dn == NULL ) {
+       if( dn_in == NULL ) {
                return NULL;
        }
 
-       while(*dn && SPACE(*dn)) {
-               dn++;
+       while(*dn_in && ASCII_SPACE(*dn_in)) {
+               dn_in++;
        }
 
-       if( *dn == '\0' ) {
+       if( *dn_in == '\0' ) {
                return( NULL );
        }
 
-       if ( be != NULL && be_issuffix( be, dn ) ) {
+       if ( be != NULL && be_issuffix( be, dn_in ) ) {
                return( NULL );
        }
 
-       dn = ch_strdup( dn );
+       dn = ch_strdup( dn_in );
 
        inquote = 0;
 
@@ -292,7 +329,7 @@ char * dn_rdn(
                } else {
                        if ( *s == '"' ) {
                                inquote = 1;
-                       } else if ( DNSEPARATOR( *s ) ) {
+                       } else if ( DN_SEPARATOR( *s ) ) {
                                *s = '\0';
                                return( dn );
                        }
@@ -336,8 +373,8 @@ char **dn_subtree(
 
 int
 dn_issuffix(
-    char       *dn,
-    char       *suffix
+    const char *dn,
+    const char *suffix
 )
 {
        int     dnlen, suffixlen;
@@ -378,7 +415,7 @@ dn_issuffix(
  */ 
 
 static char * 
-get_next_substring( char * s, char d )
+get_next_substring( const char * s, char d )
 {
 
        char    *str, *r;
@@ -387,10 +424,8 @@ get_next_substring( char * s, char d )
 
        /* Skip leading spaces */
        
-       while ( *s && SPACE(*s) ) {
-           
+       while ( *s && ASCII_SPACE(*s) ) {
                s++;
-           
        }
        
        /* Copy word */
@@ -421,11 +456,9 @@ get_next_substring( char * s, char d )
  * memory. The returned string will be null-terminated.
  */
 
-char * rdn_attr_type( char * s )
+char * rdn_attr_type( const char * s )
 {
-
        return get_next_substring( s, '=' );
-
 }
 
 
@@ -439,15 +472,13 @@ char * rdn_attr_type( char * s )
  */
 
 char * 
-rdn_attr_value( char * rdn )
+rdn_attr_value( const char * rdn )
 {
 
-       char    *str;
+       const char      *str;
 
        if ( (str = strchr( rdn, '=' )) != NULL ) {
-
                return get_next_substring(++str, '\0');
-
        }
 
        return NULL;
@@ -478,10 +509,8 @@ build_new_dn( char ** new_dn,
 {
 
     if ( p_dn == NULL ) {
-
        *new_dn = ch_strdup( newrdn );
        return;
-
     }
     
     *new_dn = (char *) ch_malloc( strlen( p_dn ) + strlen( newrdn ) + 3 );