mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-21 03:10:25 +08:00
309 lines
5.3 KiB
C
309 lines
5.3 KiB
C
/* $OpenLDAP$ */
|
|
/*
|
|
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
*/
|
|
/* Portions
|
|
* Copyright (c) 1994 Regents of the University of Michigan.
|
|
* All rights reserved.
|
|
*
|
|
* getdn.c
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <ac/stdlib.h>
|
|
|
|
#include <ac/ctype.h>
|
|
#include <ac/socket.h>
|
|
#include <ac/string.h>
|
|
#include <ac/time.h>
|
|
|
|
#include "ldap-int.h"
|
|
|
|
#define NAME_TYPE_LDAP_RDN 0
|
|
#define NAME_TYPE_LDAP_DN 1
|
|
#define NAME_TYPE_DCE_DN 2
|
|
|
|
static char **explode_name( const char *name, int notypes, int is_type );
|
|
|
|
char *
|
|
ldap_get_dn( LDAP *ld, LDAPMessage *entry )
|
|
{
|
|
char *dn;
|
|
BerElement tmp;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_get_dn\n", 0, 0, 0 );
|
|
|
|
if ( entry == NULL ) {
|
|
ld->ld_errno = LDAP_PARAM_ERROR;
|
|
return( NULL );
|
|
}
|
|
|
|
tmp = *entry->lm_ber; /* struct copy */
|
|
if ( ber_scanf( &tmp, "{a" /*}*/, &dn ) == LBER_ERROR ) {
|
|
ld->ld_errno = LDAP_DECODING_ERROR;
|
|
return( NULL );
|
|
}
|
|
|
|
return( dn );
|
|
}
|
|
|
|
char *
|
|
ldap_dn2ufn( LDAP_CONST char *dn )
|
|
{
|
|
char *ufn;
|
|
char **vals;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_dn2ufn\n", 0, 0, 0 );
|
|
|
|
/* produces completely untyped UFNs */
|
|
|
|
if( dn == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
vals = ldap_explode_dn( dn , 1 );
|
|
if( vals == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
ufn = ldap_charray2str( vals, ", " );
|
|
|
|
LDAP_VFREE( vals );
|
|
return ufn;
|
|
}
|
|
|
|
char **
|
|
ldap_explode_dn( LDAP_CONST char *dn, int notypes )
|
|
{
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_explode_dn\n", 0, 0, 0 );
|
|
|
|
return explode_name( dn, notypes, NAME_TYPE_LDAP_DN );
|
|
}
|
|
|
|
char **
|
|
ldap_explode_rdn( LDAP_CONST char *rdn, int notypes )
|
|
{
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_explode_rdn\n", 0, 0, 0 );
|
|
return explode_name( rdn, notypes, NAME_TYPE_LDAP_RDN );
|
|
}
|
|
|
|
char *
|
|
ldap_dn2dcedn( LDAP_CONST char *dn )
|
|
{
|
|
char *dce, *q, **rdns, **p;
|
|
int len = 0;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_dn2dcedn\n", 0, 0, 0 );
|
|
|
|
rdns = explode_name( dn, 0, NAME_TYPE_LDAP_DN );
|
|
if ( rdns == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
for ( p = rdns; *p != NULL; p++ ) {
|
|
len += strlen( *p ) + 1;
|
|
}
|
|
|
|
q = dce = LDAP_MALLOC( len + 1 );
|
|
if ( dce == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
p--; /* get back past NULL */
|
|
|
|
for ( ; p != rdns; p-- ) {
|
|
strcpy( q, "/" );
|
|
q++;
|
|
strcpy( q, *p );
|
|
q += strlen( *p );
|
|
}
|
|
|
|
strcpy( q, "/" );
|
|
q++;
|
|
strcpy( q, *p );
|
|
|
|
return dce;
|
|
}
|
|
|
|
char *
|
|
ldap_dcedn2dn( LDAP_CONST char *dce )
|
|
{
|
|
char *dn, *q, **rdns, **p;
|
|
int len;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "ldap_dcedn2dn\n", 0, 0, 0 );
|
|
|
|
rdns = explode_name( dce, 0, NAME_TYPE_DCE_DN );
|
|
if ( rdns == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
len = 0;
|
|
|
|
for ( p = rdns; *p != NULL; p++ ) {
|
|
len += strlen( *p ) + 1;
|
|
}
|
|
|
|
q = dn = LDAP_MALLOC( len );
|
|
if ( dn == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
p--;
|
|
|
|
for ( ; p != rdns; p-- ) {
|
|
strcpy( q, *p );
|
|
q += strlen( *p );
|
|
strcpy( q, "," );
|
|
q++;
|
|
}
|
|
|
|
if ( *dce == '/' ) {
|
|
/* the name was fully qualified, thus the most-significant
|
|
* RDN was empty. trash the last comma */
|
|
q--;
|
|
*q = '\0';
|
|
} else {
|
|
/* the name was relative. copy the most significant RDN */
|
|
strcpy( q, *p );
|
|
}
|
|
|
|
return dn;
|
|
}
|
|
|
|
#define INQUOTE 1
|
|
#define OUTQUOTE 2
|
|
|
|
static char **
|
|
explode_name( const char *name, int notypes, int is_type )
|
|
{
|
|
const char *p, *q, *rdn;
|
|
char **parts = NULL;
|
|
int offset, state, have_equals, count = 0, endquote, len;
|
|
|
|
/* safe guard */
|
|
if(name == NULL) name = "";
|
|
|
|
/* skip leading whitespace */
|
|
while( ldap_utf8_isspace( name )) {
|
|
LDAP_UTF8_INCR( name );
|
|
}
|
|
|
|
p = rdn = name;
|
|
offset = 0;
|
|
state = OUTQUOTE;
|
|
have_equals=0;
|
|
|
|
do {
|
|
/* step forward */
|
|
p += offset;
|
|
offset = 1;
|
|
|
|
switch ( *p ) {
|
|
case '\\':
|
|
if ( p[1] != '\0' ) {
|
|
offset = LDAP_UTF8_OFFSET(++p);
|
|
}
|
|
break;
|
|
case '"':
|
|
if ( state == INQUOTE )
|
|
state = OUTQUOTE;
|
|
else
|
|
state = INQUOTE;
|
|
break;
|
|
case '=':
|
|
if( state == OUTQUOTE ) have_equals++;
|
|
break;
|
|
case '+':
|
|
if (is_type == NAME_TYPE_LDAP_RDN)
|
|
goto end_part;
|
|
break;
|
|
case '/':
|
|
if (is_type == NAME_TYPE_DCE_DN)
|
|
goto end_part;
|
|
break;
|
|
case ';':
|
|
case ',':
|
|
if (is_type == NAME_TYPE_LDAP_DN)
|
|
goto end_part;
|
|
break;
|
|
case '\0':
|
|
end_part:
|
|
if ( state == OUTQUOTE ) {
|
|
++count;
|
|
have_equals=0;
|
|
|
|
if ( parts == NULL ) {
|
|
if (( parts = (char **)LDAP_MALLOC( 8
|
|
* sizeof( char *))) == NULL )
|
|
return( NULL );
|
|
} else if ( count >= 8 ) {
|
|
if (( parts = (char **)LDAP_REALLOC( parts,
|
|
(count+1) * sizeof( char *)))
|
|
== NULL )
|
|
return( NULL );
|
|
}
|
|
|
|
parts[ count ] = NULL;
|
|
endquote = 0;
|
|
|
|
if ( notypes ) {
|
|
for ( q = rdn; q < p && *q != '='; ++q ) {
|
|
/* EMPTY */;
|
|
}
|
|
|
|
if ( q < p ) {
|
|
rdn = ++q;
|
|
}
|
|
|
|
if ( *rdn == '"' ) {
|
|
++rdn;
|
|
}
|
|
|
|
if ( p[-1] == '"' ) {
|
|
endquote = 1;
|
|
--p;
|
|
}
|
|
}
|
|
|
|
len = p - rdn;
|
|
|
|
if (( parts[ count-1 ] = (char *)LDAP_CALLOC( 1,
|
|
len + 1 )) != NULL )
|
|
{
|
|
AC_MEMCPY( parts[ count-1 ], rdn, len );
|
|
|
|
if( !endquote ) {
|
|
/* skip trailing spaces */
|
|
while( len > 0 && ldap_utf8_isspace(
|
|
&parts[count-1][len-1] ) )
|
|
{
|
|
--len;
|
|
}
|
|
}
|
|
|
|
parts[ count-1 ][ len ] = '\0';
|
|
}
|
|
|
|
/*
|
|
* Don't forget to increment 'p' back to where
|
|
* it should be. If we don't, then we will
|
|
* never get past an "end quote."
|
|
*/
|
|
if ( endquote == 1 )
|
|
p++;
|
|
|
|
rdn = *p ? &p[1] : p;
|
|
while ( ldap_utf8_isspace( rdn ) )
|
|
++rdn;
|
|
} break;
|
|
}
|
|
} while ( *p );
|
|
|
|
return( parts );
|
|
}
|