mirror of
git://git.gnupg.org/gnupg.git
synced 2024-10-31 20:08:43 +01:00
cc1d475f98
--
955 lines
19 KiB
C
955 lines
19 KiB
C
/* The following code comes from the OpenLDAP project. The references
|
||
to the COPYRIGHT file below refer to the corresponding file in the
|
||
OpenLDAP distribution, which is reproduced here in full:
|
||
|
||
Copyright 1998-2004 The OpenLDAP Foundation
|
||
All rights reserved.
|
||
|
||
Redistribution and use in source and binary forms, with or without
|
||
modification, are permitted only as authorized by the OpenLDAP
|
||
Public License.
|
||
|
||
A copy of this license is available in the file LICENSE in the
|
||
top-level directory of the distribution or, alternatively, at
|
||
<http://www.OpenLDAP.org/license.html>.
|
||
|
||
OpenLDAP is a registered trademark of the OpenLDAP Foundation.
|
||
|
||
Individual files and/or contributed packages may be copyright by
|
||
other parties and subject to additional restrictions.
|
||
|
||
This work is derived from the University of Michigan LDAP v3.3
|
||
distribution. Information concerning this software is available
|
||
at <http://www.umich.edu/~dirsvcs/ldap/>.
|
||
|
||
This work also contains materials derived from public sources.
|
||
|
||
Additional information about OpenLDAP can be obtained at
|
||
<http://www.openldap.org/>.
|
||
|
||
---
|
||
|
||
Portions Copyright 1998-2004 Kurt D. Zeilenga.
|
||
Portions Copyright 1998-2004 Net Boolean Incorporated.
|
||
Portions Copyright 2001-2004 IBM Corporation.
|
||
All rights reserved.
|
||
|
||
Redistribution and use in source and binary forms, with or without
|
||
modification, are permitted only as authorized by the OpenLDAP
|
||
Public License.
|
||
|
||
---
|
||
|
||
Portions Copyright 1999-2003 Howard Y.H. Chu.
|
||
Portions Copyright 1999-2003 Symas Corporation.
|
||
Portions Copyright 1998-2003 Hallvard B. Furuseth.
|
||
All rights reserved.
|
||
|
||
Redistribution and use in source and binary forms, with or without
|
||
modification, are permitted provided that this notice is preserved.
|
||
The names of the copyright holders may not be used to endorse or
|
||
promote products derived from this software without their specific
|
||
prior written permission. This software is provided `'as is''
|
||
without express or implied warranty.
|
||
|
||
---
|
||
|
||
Portions Copyright (c) 1992-1996 Regents of the University of Michigan.
|
||
All rights reserved.
|
||
|
||
Redistribution and use in source and binary forms are permitted
|
||
provided that this notice is preserved and that due credit is given
|
||
to the University of Michigan at Ann Arbor. The name of the
|
||
University may not be used to endorse or promote products derived
|
||
from this software without specific prior written permission. This
|
||
software is provided `'as is'' without express or implied warranty. */
|
||
|
||
|
||
#include <config.h>
|
||
#include <assert.h>
|
||
#include <stdio.h>
|
||
#include <stdlib.h>
|
||
#include <string.h>
|
||
#include <time.h>
|
||
|
||
#include <winsock2.h>
|
||
#include <winldap.h>
|
||
#include "ldap-url.h"
|
||
#define LDAP_P(protos) protos
|
||
#define LDAP_URL_URLCOLON "URL:"
|
||
#define LDAP_URL_URLCOLON_LEN (sizeof(LDAP_URL_URLCOLON)-1)
|
||
#define LDAP_URL_PREFIX "ldap://"
|
||
#define LDAP_URL_PREFIX_LEN (sizeof(LDAP_URL_PREFIX)-1)
|
||
#define LDAPS_URL_PREFIX "ldaps://"
|
||
#define LDAPS_URL_PREFIX_LEN (sizeof(LDAPS_URL_PREFIX)-1)
|
||
#define LDAPI_URL_PREFIX "ldapi://"
|
||
#define LDAPI_URL_PREFIX_LEN (sizeof(LDAPI_URL_PREFIX)-1)
|
||
#define LDAP_VFREE(v) { int _i; for (_i = 0; (v)[_i]; _i++) free((v)[_i]); }
|
||
#define LDAP_FREE free
|
||
#define LDAP_STRDUP strdup
|
||
#define LDAP_CALLOC calloc
|
||
#define LDAP_MALLOC malloc
|
||
#define LDAP_REALLOC realloc
|
||
#define ldap_utf8_strchr strchr
|
||
#define ldap_utf8_strtok(n,d) strtok (n,d)
|
||
#define Debug(a,b,c,d,e)
|
||
void ldap_pvt_hex_unescape( char *s );
|
||
|
||
|
||
#ifndef LDAP_SCOPE_DEFAULT
|
||
# define LDAP_SCOPE_DEFAULT -1
|
||
#endif
|
||
|
||
#if __GNUC__
|
||
# define MY_GCC_VERSION (__GNUC__ * 10000 \
|
||
+ __GNUC_MINOR__ * 100 \
|
||
+ __GNUC_PATCHLEVEL__)
|
||
#else
|
||
# define MY_GCC_VERSION 0
|
||
#endif
|
||
|
||
|
||
/* Avoid warnings about strncpy usage. */
|
||
#if MY_GCC_VERSION >= 80000
|
||
# pragma GCC diagnostic ignored "-Wstringop-truncation"
|
||
# pragma GCC diagnostic ignored "-Wstringop-overflow"
|
||
#elif defined __clang__
|
||
# pragma clang diagnostic ignored "-Wstringop-truncation"
|
||
# pragma clang diagnostic ignored "-Wstringop-overflow"
|
||
#endif
|
||
|
||
|
||
|
||
|
||
/* $OpenLDAP: pkg/ldap/libraries/libldap/charray.c,v 1.9.2.2 2003/03/03 17:10:04 kurt Exp $ */
|
||
/*
|
||
* Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
|
||
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
||
*/
|
||
/* charray.c - routines for dealing with char * arrays */
|
||
|
||
int
|
||
ldap_charray_add(
|
||
char ***a,
|
||
char *s
|
||
)
|
||
{
|
||
int n;
|
||
|
||
if ( *a == NULL ) {
|
||
*a = (char **) LDAP_MALLOC( 2 * sizeof(char *) );
|
||
n = 0;
|
||
|
||
if( *a == NULL ) {
|
||
return -1;
|
||
}
|
||
|
||
} else {
|
||
char **new;
|
||
|
||
for ( n = 0; *a != NULL && (*a)[n] != NULL; n++ ) {
|
||
; /* NULL */
|
||
}
|
||
|
||
new = (char **) LDAP_REALLOC( (char *) *a,
|
||
(n + 2) * sizeof(char *) );
|
||
|
||
if( new == NULL ) {
|
||
/* caller is required to call ldap_charray_free(*a) */
|
||
return -1;
|
||
}
|
||
|
||
*a = new;
|
||
}
|
||
|
||
(*a)[n] = LDAP_STRDUP(s);
|
||
|
||
if( (*a)[n] == NULL ) {
|
||
return 1;
|
||
}
|
||
|
||
(*a)[++n] = NULL;
|
||
|
||
return 0;
|
||
}
|
||
|
||
int
|
||
ldap_charray_merge(
|
||
char ***a,
|
||
char **s
|
||
)
|
||
{
|
||
int i, n, nn;
|
||
char **aa;
|
||
|
||
for ( n = 0; *a != NULL && (*a)[n] != NULL; n++ ) {
|
||
; /* NULL */
|
||
}
|
||
for ( nn = 0; s[nn] != NULL; nn++ ) {
|
||
; /* NULL */
|
||
}
|
||
|
||
aa = (char **) LDAP_REALLOC( (char *) *a, (n + nn + 1) * sizeof(char *) );
|
||
|
||
if( aa == NULL ) {
|
||
return -1;
|
||
}
|
||
|
||
*a = aa;
|
||
|
||
for ( i = 0; i < nn; i++ ) {
|
||
(*a)[n + i] = LDAP_STRDUP(s[i]);
|
||
|
||
if( (*a)[n + i] == NULL ) {
|
||
for( --i ; i >= 0 ; i-- ) {
|
||
LDAP_FREE( (*a)[n + i] );
|
||
(*a)[n + i] = NULL;
|
||
}
|
||
return -1;
|
||
}
|
||
}
|
||
|
||
(*a)[n + nn] = NULL;
|
||
return 0;
|
||
}
|
||
|
||
void
|
||
ldap_charray_free( char **a )
|
||
{
|
||
char **p;
|
||
|
||
if ( a == NULL ) {
|
||
return;
|
||
}
|
||
|
||
for ( p = a; *p != NULL; p++ ) {
|
||
if ( *p != NULL ) {
|
||
LDAP_FREE( *p );
|
||
}
|
||
}
|
||
|
||
LDAP_FREE( (char *) a );
|
||
}
|
||
|
||
int
|
||
ldap_charray_inlist(
|
||
char **a,
|
||
char *s
|
||
)
|
||
{
|
||
int i;
|
||
|
||
if( a == NULL ) return 0;
|
||
|
||
for ( i=0; a[i] != NULL; i++ ) {
|
||
if ( strcasecmp( s, a[i] ) == 0 ) {
|
||
return 1;
|
||
}
|
||
}
|
||
|
||
return 0;
|
||
}
|
||
|
||
char **
|
||
ldap_charray_dup( char **a )
|
||
{
|
||
int i;
|
||
char **new;
|
||
|
||
for ( i = 0; a[i] != NULL; i++ )
|
||
; /* NULL */
|
||
|
||
new = (char **) LDAP_MALLOC( (i + 1) * sizeof(char *) );
|
||
|
||
if( new == NULL ) {
|
||
return NULL;
|
||
}
|
||
|
||
for ( i = 0; a[i] != NULL; i++ ) {
|
||
new[i] = LDAP_STRDUP( a[i] );
|
||
|
||
if( new[i] == NULL ) {
|
||
for( --i ; i >= 0 ; i-- ) {
|
||
LDAP_FREE( new[i] );
|
||
}
|
||
LDAP_FREE( new );
|
||
return NULL;
|
||
}
|
||
}
|
||
new[i] = NULL;
|
||
|
||
return( new );
|
||
}
|
||
|
||
char **
|
||
ldap_str2charray( const char *str_in, const char *brkstr )
|
||
{
|
||
char **res;
|
||
char *str, *s;
|
||
int i;
|
||
|
||
/* protect the input string from strtok */
|
||
str = LDAP_STRDUP( str_in );
|
||
if( str == NULL ) {
|
||
return NULL;
|
||
}
|
||
|
||
i = 1;
|
||
for ( s = str; *s; s++ ) {
|
||
if ( ldap_utf8_strchr( brkstr, *s ) != NULL ) {
|
||
i++;
|
||
}
|
||
}
|
||
|
||
res = (char **) LDAP_MALLOC( (i + 1) * sizeof(char *) );
|
||
|
||
if( res == NULL ) {
|
||
LDAP_FREE( str );
|
||
return NULL;
|
||
}
|
||
|
||
i = 0;
|
||
|
||
for ( s = ldap_utf8_strtok( str, brkstr);
|
||
s != NULL;
|
||
s = ldap_utf8_strtok( NULL, brkstr) )
|
||
{
|
||
res[i] = LDAP_STRDUP( s );
|
||
|
||
if(res[i] == NULL) {
|
||
for( --i ; i >= 0 ; i-- ) {
|
||
LDAP_FREE( res[i] );
|
||
}
|
||
LDAP_FREE( res );
|
||
LDAP_FREE( str );
|
||
return NULL;
|
||
}
|
||
|
||
i++;
|
||
}
|
||
|
||
res[i] = NULL;
|
||
|
||
LDAP_FREE( str );
|
||
return( res );
|
||
}
|
||
|
||
char * ldap_charray2str( char **a, const char *sep )
|
||
{
|
||
char *s, **v, *p;
|
||
int len;
|
||
int slen;
|
||
|
||
if( sep == NULL ) sep = " ";
|
||
|
||
slen = strlen( sep );
|
||
len = 0;
|
||
|
||
for ( v = a; *v != NULL; v++ ) {
|
||
len += strlen( *v ) + slen;
|
||
}
|
||
|
||
if ( len == 0 ) {
|
||
return NULL;
|
||
}
|
||
|
||
/* trim extra sep len */
|
||
len -= slen;
|
||
|
||
s = LDAP_MALLOC ( len + 1 );
|
||
|
||
if ( s == NULL ) {
|
||
return NULL;
|
||
}
|
||
|
||
p = s;
|
||
for ( v = a; *v != NULL; v++ ) {
|
||
if ( v != a ) {
|
||
strncpy( p, sep, slen );
|
||
p += slen;
|
||
}
|
||
|
||
len = strlen( *v );
|
||
strncpy( p, *v, len );
|
||
p += len;
|
||
}
|
||
|
||
*p = '\0';
|
||
return s;
|
||
}
|
||
|
||
|
||
|
||
/* $OpenLDAP: pkg/ldap/libraries/libldap/url.c,v 1.64.2.5 2003/03/03 17:10:05 kurt Exp $ */
|
||
/*
|
||
* Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
|
||
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
||
*/
|
||
/* Portions
|
||
* Copyright (c) 1996 Regents of the University of Michigan.
|
||
* All rights reserved.
|
||
*
|
||
* LIBLDAP url.c -- LDAP URL (RFC 2255) related routines
|
||
*
|
||
* LDAP URLs look like this:
|
||
* ldap[is]://host:port[/[dn[?[attributes][?[scope][?[filter][?exts]]]]]]
|
||
*
|
||
* where:
|
||
* attributes is a comma separated list
|
||
* scope is one of these three strings: base one sub (default=base)
|
||
* filter is an string-represented filter as in RFC 2254
|
||
*
|
||
* e.g., ldap://host:port/dc=com?o,cn?base?(o=openldap)?extension
|
||
*
|
||
* We also tolerate URLs that look like: <ldapurl> and <URL:ldapurl>
|
||
*/
|
||
|
||
/* local functions */
|
||
static const char* skip_url_prefix LDAP_P((
|
||
const char *url,
|
||
int *enclosedp,
|
||
const char **scheme ));
|
||
|
||
int
|
||
ldap_is_ldap_url( LDAP_CONST char *url )
|
||
{
|
||
int enclosed;
|
||
const char * scheme;
|
||
|
||
if( url == NULL ) {
|
||
return 0;
|
||
}
|
||
|
||
if( skip_url_prefix( url, &enclosed, &scheme ) == NULL ) {
|
||
return 0;
|
||
}
|
||
|
||
return 1;
|
||
}
|
||
|
||
|
||
static const char*
|
||
skip_url_prefix(
|
||
const char *url,
|
||
int *enclosedp,
|
||
const char **scheme )
|
||
{
|
||
/*
|
||
* return non-zero if this looks like a LDAP URL; zero if not
|
||
* if non-zero returned, *urlp will be moved past "ldap://" part of URL
|
||
*/
|
||
const char *p;
|
||
|
||
if ( url == NULL ) {
|
||
return( NULL );
|
||
}
|
||
|
||
p = url;
|
||
|
||
/* skip leading '<' (if any) */
|
||
if ( *p == '<' ) {
|
||
*enclosedp = 1;
|
||
++p;
|
||
} else {
|
||
*enclosedp = 0;
|
||
}
|
||
|
||
/* skip leading "URL:" (if any) */
|
||
if ( strncasecmp( p, LDAP_URL_URLCOLON, LDAP_URL_URLCOLON_LEN ) == 0 ) {
|
||
p += LDAP_URL_URLCOLON_LEN;
|
||
}
|
||
|
||
/* check for "ldap://" prefix */
|
||
if ( strncasecmp( p, LDAP_URL_PREFIX, LDAP_URL_PREFIX_LEN ) == 0 ) {
|
||
/* skip over "ldap://" prefix and return success */
|
||
p += LDAP_URL_PREFIX_LEN;
|
||
*scheme = "ldap";
|
||
return( p );
|
||
}
|
||
|
||
/* check for "ldaps://" prefix */
|
||
if ( strncasecmp( p, LDAPS_URL_PREFIX, LDAPS_URL_PREFIX_LEN ) == 0 ) {
|
||
/* skip over "ldaps://" prefix and return success */
|
||
p += LDAPS_URL_PREFIX_LEN;
|
||
*scheme = "ldaps";
|
||
return( p );
|
||
}
|
||
|
||
/* check for "ldapi://" prefix */
|
||
if ( strncasecmp( p, LDAPI_URL_PREFIX, LDAPI_URL_PREFIX_LEN ) == 0 ) {
|
||
/* skip over "ldapi://" prefix and return success */
|
||
p += LDAPI_URL_PREFIX_LEN;
|
||
*scheme = "ldapi";
|
||
return( p );
|
||
}
|
||
|
||
#ifdef LDAP_CONNECTIONLESS
|
||
/* check for "cldap://" prefix */
|
||
if ( strncasecmp( p, LDAPC_URL_PREFIX, LDAPC_URL_PREFIX_LEN ) == 0 ) {
|
||
/* skip over "cldap://" prefix and return success */
|
||
p += LDAPC_URL_PREFIX_LEN;
|
||
*scheme = "cldap";
|
||
return( p );
|
||
}
|
||
#endif
|
||
|
||
return( NULL );
|
||
}
|
||
|
||
|
||
static int str2scope( const char *p )
|
||
{
|
||
if ( strcasecmp( p, "one" ) == 0 ) {
|
||
return LDAP_SCOPE_ONELEVEL;
|
||
|
||
} else if ( strcasecmp( p, "onetree" ) == 0 ) {
|
||
return LDAP_SCOPE_ONELEVEL;
|
||
|
||
} else if ( strcasecmp( p, "base" ) == 0 ) {
|
||
return LDAP_SCOPE_BASE;
|
||
|
||
} else if ( strcasecmp( p, "sub" ) == 0 ) {
|
||
return LDAP_SCOPE_SUBTREE;
|
||
|
||
} else if ( strcasecmp( p, "subtree" ) == 0 ) {
|
||
return LDAP_SCOPE_SUBTREE;
|
||
}
|
||
|
||
return( -1 );
|
||
}
|
||
|
||
|
||
int
|
||
ldap_url_parse_ext( LDAP_CONST char *url_in, LDAPURLDesc **ludpp )
|
||
{
|
||
/*
|
||
* Pick apart the pieces of an LDAP URL.
|
||
*/
|
||
|
||
LDAPURLDesc *ludp;
|
||
char *p, *q, *r;
|
||
int i, enclosed;
|
||
const char *scheme = NULL;
|
||
const char *url_tmp;
|
||
char *url;
|
||
|
||
if( url_in == NULL || ludpp == NULL ) {
|
||
return LDAP_URL_ERR_PARAM;
|
||
}
|
||
|
||
#ifndef LDAP_INT_IN_KERNEL
|
||
/* Global options may not be created yet
|
||
* We can't test if the global options are initialized
|
||
* because a call to LDAP_INT_GLOBAL_OPT() will try to allocate
|
||
* the options and cause infinite recursion
|
||
*/
|
||
#ifdef NEW_LOGGING
|
||
LDAP_LOG ( OPERATION, ENTRY, "ldap_url_parse_ext(%s)\n", url_in, 0, 0 );
|
||
#else
|
||
Debug( LDAP_DEBUG_TRACE, "ldap_url_parse_ext(%s)\n", url_in, 0, 0 );
|
||
#endif
|
||
#endif
|
||
|
||
*ludpp = NULL; /* pessimistic */
|
||
|
||
url_tmp = skip_url_prefix( url_in, &enclosed, &scheme );
|
||
|
||
if ( url_tmp == NULL ) {
|
||
return LDAP_URL_ERR_BADSCHEME;
|
||
}
|
||
|
||
assert( scheme );
|
||
|
||
/* make working copy of the remainder of the URL */
|
||
url = LDAP_STRDUP( url_tmp );
|
||
if ( url == NULL ) {
|
||
return LDAP_URL_ERR_MEM;
|
||
}
|
||
|
||
if ( enclosed ) {
|
||
p = &url[strlen(url)-1];
|
||
|
||
if( *p != '>' ) {
|
||
LDAP_FREE( url );
|
||
return LDAP_URL_ERR_BADENCLOSURE;
|
||
}
|
||
|
||
*p = '\0';
|
||
}
|
||
|
||
/* allocate return struct */
|
||
ludp = (LDAPURLDesc *)LDAP_CALLOC( 1, sizeof( LDAPURLDesc ));
|
||
|
||
if ( ludp == NULL ) {
|
||
LDAP_FREE( url );
|
||
return LDAP_URL_ERR_MEM;
|
||
}
|
||
|
||
ludp->lud_next = NULL;
|
||
ludp->lud_host = NULL;
|
||
ludp->lud_port = 0;
|
||
ludp->lud_dn = NULL;
|
||
ludp->lud_attrs = NULL;
|
||
ludp->lud_filter = NULL;
|
||
ludp->lud_scope = LDAP_SCOPE_DEFAULT;
|
||
ludp->lud_filter = NULL;
|
||
ludp->lud_exts = NULL;
|
||
|
||
ludp->lud_scheme = LDAP_STRDUP( scheme );
|
||
|
||
if ( ludp->lud_scheme == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_MEM;
|
||
}
|
||
|
||
/* scan forward for '/' that marks end of hostport and begin. of dn */
|
||
p = strchr( url, '/' );
|
||
|
||
if( p != NULL ) {
|
||
/* terminate hostport; point to start of dn */
|
||
*p++ = '\0';
|
||
}
|
||
|
||
/* IPv6 syntax with [ip address]:port */
|
||
if ( *url == '[' ) {
|
||
r = strchr( url, ']' );
|
||
if ( r == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADURL;
|
||
}
|
||
*r++ = '\0';
|
||
q = strchr( r, ':' );
|
||
} else {
|
||
q = strchr( url, ':' );
|
||
}
|
||
|
||
if ( q != NULL ) {
|
||
*q++ = '\0';
|
||
ldap_pvt_hex_unescape( q );
|
||
|
||
if( *q == '\0' ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADURL;
|
||
}
|
||
|
||
ludp->lud_port = atoi( q );
|
||
}
|
||
|
||
ldap_pvt_hex_unescape( url );
|
||
|
||
/* If [ip address]:port syntax, url is [ip and we skip the [ */
|
||
ludp->lud_host = LDAP_STRDUP( url + ( *url == '[' ) );
|
||
|
||
if( ludp->lud_host == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_MEM;
|
||
}
|
||
|
||
/*
|
||
* Kludge. ldap://111.222.333.444:389??cn=abc,o=company
|
||
*
|
||
* On early Novell releases, search references/referrals were returned
|
||
* in this format, i.e., the dn was kind of in the scope position,
|
||
* but the required slash is missing. The whole thing is illegal syntax,
|
||
* but we need to account for it. Fortunately it can't be confused with
|
||
* anything real.
|
||
*/
|
||
if( (p == NULL) && (q != NULL) && ((q = strchr( q, '?')) != NULL)) {
|
||
q++;
|
||
/* ? immediately followed by question */
|
||
if( *q == '?') {
|
||
q++;
|
||
if( *q != '\0' ) {
|
||
/* parse dn part */
|
||
ldap_pvt_hex_unescape( q );
|
||
ludp->lud_dn = LDAP_STRDUP( q );
|
||
} else {
|
||
ludp->lud_dn = LDAP_STRDUP( "" );
|
||
}
|
||
|
||
if( ludp->lud_dn == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_MEM;
|
||
}
|
||
}
|
||
}
|
||
|
||
if( p == NULL ) {
|
||
LDAP_FREE( url );
|
||
*ludpp = ludp;
|
||
return LDAP_URL_SUCCESS;
|
||
}
|
||
|
||
/* scan forward for '?' that may marks end of dn */
|
||
q = strchr( p, '?' );
|
||
|
||
if( q != NULL ) {
|
||
/* terminate dn part */
|
||
*q++ = '\0';
|
||
}
|
||
|
||
if( *p != '\0' ) {
|
||
/* parse dn part */
|
||
ldap_pvt_hex_unescape( p );
|
||
ludp->lud_dn = LDAP_STRDUP( p );
|
||
} else {
|
||
ludp->lud_dn = LDAP_STRDUP( "" );
|
||
}
|
||
|
||
if( ludp->lud_dn == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_MEM;
|
||
}
|
||
|
||
if( q == NULL ) {
|
||
/* no more */
|
||
LDAP_FREE( url );
|
||
*ludpp = ludp;
|
||
return LDAP_URL_SUCCESS;
|
||
}
|
||
|
||
/* scan forward for '?' that may marks end of attributes */
|
||
p = q;
|
||
q = strchr( p, '?' );
|
||
|
||
if( q != NULL ) {
|
||
/* terminate attributes part */
|
||
*q++ = '\0';
|
||
}
|
||
|
||
if( *p != '\0' ) {
|
||
/* parse attributes */
|
||
ldap_pvt_hex_unescape( p );
|
||
ludp->lud_attrs = ldap_str2charray( p, "," );
|
||
|
||
if( ludp->lud_attrs == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADATTRS;
|
||
}
|
||
}
|
||
|
||
if ( q == NULL ) {
|
||
/* no more */
|
||
LDAP_FREE( url );
|
||
*ludpp = ludp;
|
||
return LDAP_URL_SUCCESS;
|
||
}
|
||
|
||
/* scan forward for '?' that may marks end of scope */
|
||
p = q;
|
||
q = strchr( p, '?' );
|
||
|
||
if( q != NULL ) {
|
||
/* terminate the scope part */
|
||
*q++ = '\0';
|
||
}
|
||
|
||
if( *p != '\0' ) {
|
||
/* parse the scope */
|
||
ldap_pvt_hex_unescape( p );
|
||
ludp->lud_scope = str2scope( p );
|
||
|
||
if( ludp->lud_scope == -1 ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADSCOPE;
|
||
}
|
||
}
|
||
|
||
if ( q == NULL ) {
|
||
/* no more */
|
||
LDAP_FREE( url );
|
||
*ludpp = ludp;
|
||
return LDAP_URL_SUCCESS;
|
||
}
|
||
|
||
/* scan forward for '?' that may marks end of filter */
|
||
p = q;
|
||
q = strchr( p, '?' );
|
||
|
||
if( q != NULL ) {
|
||
/* terminate the filter part */
|
||
*q++ = '\0';
|
||
}
|
||
|
||
if( *p != '\0' ) {
|
||
/* parse the filter */
|
||
ldap_pvt_hex_unescape( p );
|
||
|
||
if( ! *p ) {
|
||
/* missing filter */
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADFILTER;
|
||
}
|
||
|
||
LDAP_FREE( ludp->lud_filter );
|
||
ludp->lud_filter = LDAP_STRDUP( p );
|
||
|
||
if( ludp->lud_filter == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_MEM;
|
||
}
|
||
}
|
||
|
||
if ( q == NULL ) {
|
||
/* no more */
|
||
LDAP_FREE( url );
|
||
*ludpp = ludp;
|
||
return LDAP_URL_SUCCESS;
|
||
}
|
||
|
||
/* scan forward for '?' that may marks end of extensions */
|
||
p = q;
|
||
q = strchr( p, '?' );
|
||
|
||
if( q != NULL ) {
|
||
/* extra '?' */
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADURL;
|
||
}
|
||
|
||
/* parse the extensions */
|
||
ludp->lud_exts = ldap_str2charray( p, "," );
|
||
|
||
if( ludp->lud_exts == NULL ) {
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADEXTS;
|
||
}
|
||
|
||
for( i=0; ludp->lud_exts[i] != NULL; i++ ) {
|
||
ldap_pvt_hex_unescape( ludp->lud_exts[i] );
|
||
|
||
if( *ludp->lud_exts[i] == '!' ) {
|
||
/* count the number of critical extensions */
|
||
ludp->lud_crit_exts++;
|
||
}
|
||
}
|
||
|
||
if( i == 0 ) {
|
||
/* must have 1 or more */
|
||
LDAP_FREE( url );
|
||
ldap_free_urldesc( ludp );
|
||
return LDAP_URL_ERR_BADEXTS;
|
||
}
|
||
|
||
/* no more */
|
||
*ludpp = ludp;
|
||
LDAP_FREE( url );
|
||
return LDAP_URL_SUCCESS;
|
||
}
|
||
|
||
int
|
||
ldap_url_parse( LDAP_CONST char *url_in, LDAPURLDesc **ludpp )
|
||
{
|
||
int rc = ldap_url_parse_ext( url_in, ludpp );
|
||
|
||
if( rc != LDAP_URL_SUCCESS ) {
|
||
return rc;
|
||
}
|
||
|
||
if ((*ludpp)->lud_scope == LDAP_SCOPE_DEFAULT) {
|
||
(*ludpp)->lud_scope = LDAP_SCOPE_BASE;
|
||
}
|
||
|
||
if ((*ludpp)->lud_host != NULL && *(*ludpp)->lud_host == '\0') {
|
||
LDAP_FREE( (*ludpp)->lud_host );
|
||
(*ludpp)->lud_host = NULL;
|
||
}
|
||
|
||
if ((*ludpp)->lud_port == 0) {
|
||
if( strcmp((*ludpp)->lud_scheme, "ldap") == 0 ) {
|
||
(*ludpp)->lud_port = LDAP_PORT;
|
||
#ifdef LDAP_CONNECTIONLESS
|
||
} else if( strcmp((*ludpp)->lud_scheme, "cldap") == 0 ) {
|
||
(*ludpp)->lud_port = LDAP_PORT;
|
||
#endif
|
||
} else if( strcmp((*ludpp)->lud_scheme, "ldaps") == 0 ) {
|
||
(*ludpp)->lud_port = LDAPS_PORT;
|
||
}
|
||
}
|
||
|
||
return rc;
|
||
}
|
||
|
||
|
||
void
|
||
ldap_free_urldesc( LDAPURLDesc *ludp )
|
||
{
|
||
if ( ludp == NULL ) {
|
||
return;
|
||
}
|
||
|
||
if ( ludp->lud_scheme != NULL ) {
|
||
LDAP_FREE( ludp->lud_scheme );
|
||
}
|
||
|
||
if ( ludp->lud_host != NULL ) {
|
||
LDAP_FREE( ludp->lud_host );
|
||
}
|
||
|
||
if ( ludp->lud_dn != NULL ) {
|
||
LDAP_FREE( ludp->lud_dn );
|
||
}
|
||
|
||
if ( ludp->lud_filter != NULL ) {
|
||
LDAP_FREE( ludp->lud_filter);
|
||
}
|
||
|
||
if ( ludp->lud_attrs != NULL ) {
|
||
LDAP_VFREE( ludp->lud_attrs );
|
||
}
|
||
|
||
if ( ludp->lud_exts != NULL ) {
|
||
LDAP_VFREE( ludp->lud_exts );
|
||
}
|
||
|
||
LDAP_FREE( ludp );
|
||
}
|
||
|
||
|
||
static int
|
||
ldap_int_unhex( int c )
|
||
{
|
||
return( c >= '0' && c <= '9' ? c - '0'
|
||
: c >= 'A' && c <= 'F' ? c - 'A' + 10
|
||
: c - 'a' + 10 );
|
||
}
|
||
|
||
void
|
||
ldap_pvt_hex_unescape( char *s )
|
||
{
|
||
/*
|
||
* Remove URL hex escapes from s... done in place. The basic concept for
|
||
* this routine is borrowed from the WWW library HTUnEscape() routine.
|
||
*/
|
||
char *p;
|
||
|
||
for ( p = s; *s != '\0'; ++s ) {
|
||
if ( *s == '%' ) {
|
||
if ( *++s == '\0' ) {
|
||
break;
|
||
}
|
||
*p = ldap_int_unhex( *s ) << 4;
|
||
if ( *++s == '\0' ) {
|
||
break;
|
||
}
|
||
*p++ += ldap_int_unhex( *s );
|
||
} else {
|
||
*p++ = *s;
|
||
}
|
||
}
|
||
|
||
*p = '\0';
|
||
}
|