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>
28 #define INQUOTEDVALUE 7
32 * dn_validate - validate and compress dn. the dn is
33 * compressed in place are returned if valid.
37 dn_validate( char *dn_in )
45 for ( d = s = dn; *s; s++ ) {
49 if ( OID_LEADCHAR(*s) ) {
52 } else if ( ATTR_LEADCHAR(*s) ) {
55 } else if ( ! ASCII_SPACE( *s ) ) {
65 } else if ( *s == '=' ) {
68 } else if ( ASCII_SPACE( *s ) ) {
77 if ( ATTR_CHAR(*s) ) {
79 } else if ( *s == '=' ) {
82 } else if ( ASCII_SPACE( *s ) ) {
94 } else if ( ! ASCII_SPACE( *s ) ) {
95 /* not a valid dn - but what can we do here? */
103 state = INQUOTEDVALUE;
105 } else if ( ! ASCII_SPACE( *s ) ) {
112 if ( !gotesc && RDN_SEPARATOR( *s ) ) {
113 while ( ASCII_SPACE( *(d - 1) ) )
121 } else if ( gotesc && !RDN_NEEDSESCAPE( *s ) &&
122 !RDN_SEPARATOR( *s ) )
126 } else if( !ASCII_SPACE( *s ) || !ASCII_SPACE( *(d - 1) ) ) {
132 if ( !gotesc && *s == '"' ) {
135 } else if ( gotesc && !RDN_NEEDSESCAPE( *s ) ) {
138 } else if( !ASCII_SPACE( *s ) || !ASCII_SPACE( *(d - 1) ) ) {
144 if ( RDN_SEPARATOR( *s ) ) {
147 } else if ( !ASCII_SPACE( *s ) ) {
155 LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
156 "dn_validate: unknown state %d for dn \"%s\".\n",
159 Debug( LDAP_DEBUG_ANY,
160 "dn_validate - unknown state %d\n", state, 0, 0 );
172 /* trim trailing spaces */
173 while( d > dn_in && ASCII_SPACE( *(d-1) ) ) {
179 /* shouldn't be left in escape */
183 /* check end state */
185 case B4LEADTYPE: /* looking for first type */
186 case B4SEPARATOR: /* looking for separator */
187 case INVALUE: /* inside value */
197 * dn_normalize - put dn into a canonical form suitable for storing
198 * in a hash database. this involves normalizing the case as well as
199 * the format. the dn is normalized in place as well as returned if valid.
203 dn_normalize( char *dn )
206 struct berval *bvdn, *nbvdn;
209 bvdn = ber_bvstr( dn );
211 if ( dnNormalize( NULL, bvdn, &nbvdn ) == LDAP_SUCCESS ) {
212 if ( nbvdn->bv_len <= bvdn->bv_len ) {
214 strcpy( out, nbvdn->bv_val );
218 bvdn->bv_val = NULL; /* prevent bvfree from freeing dn */
225 * dn_parent - return a copy of the dn of dn's parent
241 while(*dn != '\0' && ASCII_SPACE(*dn)) {
249 if ( be != NULL && be_issuffix( be, dn ) ) {
254 * assume it is an X.500-style name, which looks like
255 * foo=bar,sha=baz,...
259 for ( s = dn; *s; s++ ) {
273 } else if ( DN_SEPARATOR( *s ) ) {
274 return ch_strdup( &s[1] );
279 return ch_strdup( "" );
289 if( dn_in == NULL ) {
293 while(*dn_in && ASCII_SPACE(*dn_in)) {
297 if( *dn_in == '\0' ) {
301 if ( be != NULL && be_issuffix( be, dn_in ) ) {
305 dn = ch_strdup( dn_in );
309 for ( s = dn; *s; s++ ) {
323 } else if ( DN_SEPARATOR( *s ) ) {
335 * return a charray of all subtrees to which the DN resides in
341 char *child, *parent;
342 char **subtree = NULL;
344 child = ch_strdup( dn );
347 charray_add( &subtree, child );
349 parent = dn_parent( be, child );
354 } while ( child != NULL );
361 * dn_issuffix - tells whether suffix is a suffix of dn. Both dn
362 * and suffix must be normalized.
371 int dnlen, suffixlen;
377 suffixlen = strlen( suffix );
378 dnlen = strlen( dn );
380 if ( suffixlen > dnlen ) {
384 return( strcmp( dn + dnlen - suffixlen, suffix ) == 0 );
388 * get_next_substring(), rdn_attr_type(), rdn_attr_value(), and
391 * Copyright 1999, Juan C. Gomez, All rights reserved.
392 * This software is not subject to any license of Silicon Graphics
393 * Inc. or Purdue University.
395 * Redistribution and use in source and binary forms are permitted
396 * without restriction or fee of any kind as long as this notice
401 /* get_next_substring:
403 * Gets next substring in s, using d (or the end of the string '\0') as a
404 * string delimiter, and places it in a duplicated memory space. Leading
405 * spaces are ignored. String s **must** be null-terminated.
409 get_next_substring( const char * s, char d )
414 r = str = ch_malloc( strlen(s) + 1 );
416 /* Skip leading spaces */
418 while ( *s && ASCII_SPACE(*s) ) {
424 while ( *s && (*s != d) ) {
426 /* Don't stop when you see trailing spaces may be a multi-word
427 * string, i.e. name=John Doe!
442 * Given a string (i.e. an rdn) of the form:
443 * "attribute_type = attribute_value"
444 * this function returns the type of an attribute, that is the
445 * string "attribute_type" which is placed in newly allocated
446 * memory. The returned string will be null-terminated.
449 char * rdn_attr_type( const char * s )
451 return get_next_substring( s, '=' );
457 * Given a string (i.e. an rdn) of the form:
458 * "attribute_type = attribute_value"
459 * this function returns "attribute_type" which is placed in newly allocated
460 * memory. The returned string will be null-terminated and may contain
461 * spaces (i.e. "John Doe\0").
465 rdn_attr_value( const char * rdn )
470 if ( (str = strchr( rdn, '=' )) != NULL ) {
471 return get_next_substring(++str, '\0');
481 * Given a string (i.e. an rdn) of the form:
482 * "attribute_type=attribute_value[+attribute_type=attribute_value[...]]"
483 * this function stores the types of the attributes in ptypes, that is the
484 * array of strings "attribute_type" which is placed in newly allocated
485 * memory, and the values of the attributes in pvalues, that is the
486 * array of strings "attribute_value" which is placed in newly allocated
487 * memory. Returns 0 on success, -1 on failure.
489 * note: got part of the code from dn_validate
493 rdn_attrs( const char * rdn_in, char ***ptypes, char ***pvalues)
501 * explode the rdn in parts
503 parts = ldap_explode_rdn( rdn_in, 0 );
505 if ( parts == NULL ) {
509 for ( p = parts; p[0]; p++ ) {
512 /* split each rdn part in type value */
513 s = strchr( p[0], '=' );
515 charray_free( *ptypes );
516 charray_free( *pvalues );
517 charray_free( parts );
521 /* type should be fine */
522 charray_add_n( ptypes, p[0], ( s-p[0] ) );
524 /* value needs to be unescaped
525 * (maybe this should be moved to ldap_explode_rdn?) */
526 for ( e = d = s + 1; e[0]; e++ ) {
532 charray_add( pvalues, s + 1 );
536 charray_free( parts );
544 * 1 if rdn is a legal rdn;
545 * 0 otherwise (including a sequence of rdns)
547 * note: got it from dn_rdn; it should be rewritten
548 * according to dn_validate
551 rdn_validate( const char * rdn )
559 if ( strchr( rdn, '=' ) == NULL ) {
563 while ( *rdn && ASCII_SPACE( *rdn ) ) {
573 for ( ; *rdn; rdn++ ) {
574 if ( *rdn == '\\' ) {
587 } else if ( DN_SEPARATOR( *rdn ) ) {
599 * Used by ldbm/bdb2 back_modrdn to create the new dn of entries being
602 * new_dn = parent (p_dn) + separator(s) + rdn (newrdn) + null.
606 build_new_dn( char ** new_dn,
609 const char * newrdn )
612 if ( p_dn == NULL ) {
613 *new_dn = ch_strdup( newrdn );
617 *new_dn = (char *) ch_malloc( strlen( p_dn ) + strlen( newrdn ) + 3 );
619 strcpy( *new_dn, newrdn );
620 strcat( *new_dn, "," );
621 strcat( *new_dn, p_dn );