1999-09-09 03:06:24 +08:00
|
|
|
/* $OpenLDAP$ */
|
1998-10-24 11:49:07 +08:00
|
|
|
/*
|
2002-01-05 05:17:25 +08:00
|
|
|
* Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
|
1999-07-16 10:45:46 +08:00
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
1998-10-24 11:49:07 +08:00
|
|
|
*/
|
|
|
|
|
1998-11-05 13:05:05 +08:00
|
|
|
#include "portable.h"
|
|
|
|
|
1998-10-24 11:49:07 +08:00
|
|
|
#include <stdio.h>
|
1999-06-03 08:37:44 +08:00
|
|
|
#include <ac/string.h>
|
|
|
|
#include <ac/socket.h>
|
1998-10-24 11:49:07 +08:00
|
|
|
#include "slap.h"
|
|
|
|
#include "back-ldbm.h"
|
1998-10-24 12:01:20 +08:00
|
|
|
#include "proto-back-ldbm.h"
|
1998-10-24 11:49:07 +08:00
|
|
|
|
1999-07-16 10:45:46 +08:00
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
static int get_alias_dn(
|
1999-07-16 10:45:46 +08:00
|
|
|
Entry *e,
|
2002-01-01 21:31:20 +08:00
|
|
|
struct berval *al,
|
1999-07-16 10:45:46 +08:00
|
|
|
int *err,
|
2000-05-22 11:46:57 +08:00
|
|
|
const char **errmsg );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
static void new_superior(
|
|
|
|
struct berval *dn,
|
|
|
|
struct berval *oldSup,
|
|
|
|
struct berval *newSup,
|
|
|
|
struct berval *res );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
static int dnlist_subordinate(
|
2002-01-14 09:43:17 +08:00
|
|
|
BerVarray dnlist,
|
2002-01-01 21:31:20 +08:00
|
|
|
struct berval *dn );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
Entry *deref_internal_r(
|
|
|
|
Backend* be,
|
|
|
|
Entry* alias,
|
2001-12-27 08:26:59 +08:00
|
|
|
struct berval* dn_in,
|
1999-07-16 10:45:46 +08:00
|
|
|
int* err,
|
|
|
|
Entry** matched,
|
2000-05-22 11:46:57 +08:00
|
|
|
const char** text )
|
1999-07-16 10:45:46 +08:00
|
|
|
{
|
2002-01-01 21:31:20 +08:00
|
|
|
struct berval dn;
|
1999-07-16 10:45:46 +08:00
|
|
|
struct ldbminfo *li = (struct ldbminfo *) be->be_private;
|
|
|
|
Entry *entry;
|
|
|
|
Entry *sup;
|
|
|
|
unsigned depth;
|
2002-01-14 09:43:17 +08:00
|
|
|
BerVarray dnlist;
|
1999-07-16 10:45:46 +08:00
|
|
|
|
2000-06-16 01:37:02 +08:00
|
|
|
assert( ( alias != NULL && dn_in == NULL )
|
|
|
|
|| ( alias == NULL && dn_in != NULL ) );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
*matched = NULL;
|
2000-08-28 01:53:01 +08:00
|
|
|
*err = LDAP_NO_SUCH_OBJECT;
|
1999-07-16 10:45:46 +08:00
|
|
|
*text = NULL;
|
|
|
|
|
|
|
|
if( alias == NULL ) {
|
2002-01-01 21:31:20 +08:00
|
|
|
ber_dupbv( &dn, dn_in );
|
|
|
|
entry = dn2entry_r( be, &dn, &sup );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
} else {
|
2002-01-01 21:31:20 +08:00
|
|
|
ber_dupbv( &dn, &alias->e_nname );
|
1999-07-16 10:45:46 +08:00
|
|
|
entry = alias;
|
|
|
|
sup = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
dnlist = NULL;
|
2002-01-14 09:43:17 +08:00
|
|
|
ber_bvarray_add( &dnlist, &dn );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
for( depth=0 ; ; depth++ ) {
|
|
|
|
if( entry != NULL ) {
|
|
|
|
Entry *newe;
|
2002-01-01 21:31:20 +08:00
|
|
|
struct berval aliasDN;
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
/* have entry, may be an alias */
|
|
|
|
|
|
|
|
if( !is_entry_alias( entry ) ) {
|
|
|
|
/* entry is not an alias */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* entry is alias */
|
|
|
|
if( depth > be->be_max_deref_depth ) {
|
|
|
|
*matched = entry;
|
|
|
|
entry = NULL;
|
|
|
|
*err = LDAP_ALIAS_DEREF_PROBLEM;
|
|
|
|
*text = "maximum deref depth exceeded";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* deref entry */
|
2002-01-01 21:31:20 +08:00
|
|
|
if( get_alias_dn( entry, &aliasDN, err, text )) {
|
1999-07-16 10:45:46 +08:00
|
|
|
*matched = entry;
|
|
|
|
entry = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check if aliasDN is a subordinate of any DN in our list */
|
2002-01-01 21:31:20 +08:00
|
|
|
if( dnlist_subordinate( dnlist, &aliasDN ) ) {
|
|
|
|
ch_free( aliasDN.bv_val );
|
1999-07-16 10:45:46 +08:00
|
|
|
*matched = entry;
|
|
|
|
entry = NULL;
|
|
|
|
*err = LDAP_ALIAS_PROBLEM;
|
|
|
|
*text = "circular alias";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* attempt to dereference alias */
|
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
newe = dn2entry_r( be, &aliasDN, &sup );
|
|
|
|
ch_free( aliasDN.bv_val );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
if( newe != NULL ) {
|
|
|
|
cache_return_entry_r(&li->li_cache, entry );
|
|
|
|
entry = newe;
|
2002-01-01 21:31:20 +08:00
|
|
|
ber_dupbv( &dn, &entry->e_nname );
|
2002-01-14 09:43:17 +08:00
|
|
|
ber_bvarray_add( &dnlist, &dn );
|
1999-07-16 10:45:46 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( sup != NULL ) {
|
|
|
|
cache_return_entry_r(&li->li_cache, entry );
|
|
|
|
entry = NULL;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* no newe and no superior, we're done */
|
|
|
|
break;
|
|
|
|
|
|
|
|
} else if( sup != NULL ) {
|
|
|
|
/* have superior, may be an alias */
|
|
|
|
Entry *newe;
|
|
|
|
Entry *newSup;
|
2002-01-01 21:31:20 +08:00
|
|
|
struct berval supDN;
|
|
|
|
struct berval aliasDN;
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
if( !is_entry_alias( sup ) ) {
|
|
|
|
/* entry is not an alias */
|
|
|
|
*matched = sup;
|
|
|
|
sup = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* entry is alias */
|
|
|
|
if( depth > be->be_max_deref_depth ) {
|
|
|
|
*matched = sup;
|
|
|
|
entry = NULL;
|
|
|
|
*err = LDAP_ALIAS_DEREF_PROBLEM;
|
|
|
|
*text = "maximum deref depth exceeded";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* deref entry */
|
2002-01-01 21:31:20 +08:00
|
|
|
if( get_alias_dn( sup, &supDN, err, text )) {
|
1999-07-16 10:45:46 +08:00
|
|
|
*matched = sup;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
new_superior( &dn, &sup->e_nname, &supDN, &aliasDN );
|
|
|
|
free(supDN.bv_val);
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
/* check if aliasDN is a subordinate of any DN in our list */
|
2002-01-01 21:31:20 +08:00
|
|
|
if( dnlist_subordinate( dnlist, &aliasDN ) ) {
|
|
|
|
free(aliasDN.bv_val);
|
1999-07-16 10:45:46 +08:00
|
|
|
*matched = entry;
|
|
|
|
entry = NULL;
|
|
|
|
*err = LDAP_ALIAS_PROBLEM;
|
|
|
|
*text = "subordinate circular alias";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* attempt to dereference alias */
|
2002-01-01 21:31:20 +08:00
|
|
|
newe = dn2entry_r( be, &aliasDN, &newSup );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
if( newe != NULL ) {
|
2002-01-01 21:31:20 +08:00
|
|
|
free(aliasDN.bv_val);
|
1999-07-16 10:45:46 +08:00
|
|
|
cache_return_entry_r(&li->li_cache, sup );
|
|
|
|
entry = newe;
|
2002-01-01 21:31:20 +08:00
|
|
|
ber_dupbv( &dn, &entry->e_nname );
|
2002-01-14 09:43:17 +08:00
|
|
|
ber_bvarray_add( &dnlist, &dn );
|
1999-07-16 10:45:46 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( newSup != NULL ) {
|
|
|
|
cache_return_entry_r(&li->li_cache, sup );
|
|
|
|
sup = newSup;
|
2002-01-01 21:31:20 +08:00
|
|
|
ber_dupbv( &dn, &aliasDN );
|
1999-07-16 10:45:46 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
/* no newe and no superior, we're done */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-01-14 09:43:17 +08:00
|
|
|
ber_bvarray_free( dnlist );
|
1999-07-16 10:45:46 +08:00
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
static int get_alias_dn(
|
1999-07-16 10:45:46 +08:00
|
|
|
Entry *e,
|
2002-01-01 21:31:20 +08:00
|
|
|
struct berval *ndn,
|
1999-07-16 10:45:46 +08:00
|
|
|
int *err,
|
2000-05-22 11:46:57 +08:00
|
|
|
const char **errmsg )
|
1999-07-16 10:45:46 +08:00
|
|
|
{
|
2001-12-28 15:41:52 +08:00
|
|
|
int rc;
|
2000-02-15 04:57:34 +08:00
|
|
|
Attribute *a;
|
2001-12-28 15:41:52 +08:00
|
|
|
AttributeDescription *aliasedObjectName
|
|
|
|
= slap_schema.si_ad_aliasedObjectName;
|
2000-02-15 04:57:34 +08:00
|
|
|
|
|
|
|
a = attr_find( e->e_attrs, aliasedObjectName );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
if( a == NULL ) {
|
|
|
|
/*
|
|
|
|
* there was an aliasedobjectname defined but no data.
|
|
|
|
*/
|
|
|
|
*err = LDAP_ALIAS_PROBLEM;
|
|
|
|
*errmsg = "alias missing aliasedObjectName attribute";
|
2002-01-01 21:31:20 +08:00
|
|
|
return -1;
|
1999-07-16 10:45:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* aliasedObjectName should be SINGLE-VALUED with a single value.
|
|
|
|
*/
|
2002-01-02 19:00:36 +08:00
|
|
|
if ( a->a_vals[0].bv_val == NULL ) {
|
1999-07-16 10:45:46 +08:00
|
|
|
/*
|
|
|
|
* there was an aliasedobjectname defined but no data.
|
|
|
|
*/
|
|
|
|
*err = LDAP_ALIAS_PROBLEM;
|
|
|
|
*errmsg = "alias missing aliasedObjectName value";
|
2002-01-01 21:31:20 +08:00
|
|
|
return -1;
|
1999-07-16 10:45:46 +08:00
|
|
|
}
|
|
|
|
|
2002-01-02 19:00:36 +08:00
|
|
|
if( a->a_vals[1].bv_val != NULL ) {
|
1999-07-16 10:45:46 +08:00
|
|
|
*err = LDAP_ALIAS_PROBLEM;
|
|
|
|
*errmsg = "alias has multivalued aliasedObjectName";
|
2002-01-01 21:31:20 +08:00
|
|
|
return -1;
|
1999-07-16 10:45:46 +08:00
|
|
|
}
|
|
|
|
|
2002-01-02 19:00:36 +08:00
|
|
|
rc = dnNormalize2( NULL, &a->a_vals[0], ndn );
|
2001-12-28 15:41:52 +08:00
|
|
|
if( rc != LDAP_SUCCESS ) {
|
2000-06-17 10:00:30 +08:00
|
|
|
*err = LDAP_ALIAS_PROBLEM;
|
|
|
|
*errmsg = "alias aliasedObjectName value is invalid";
|
2002-01-01 21:31:20 +08:00
|
|
|
return -1;
|
2000-06-17 10:00:30 +08:00
|
|
|
}
|
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
return 0;
|
1999-07-16 10:45:46 +08:00
|
|
|
}
|
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
static void new_superior(
|
|
|
|
struct berval *dn,
|
|
|
|
struct berval *oldSup,
|
|
|
|
struct berval *newSup,
|
|
|
|
struct berval *newDN )
|
1998-10-24 11:49:07 +08:00
|
|
|
{
|
1999-07-16 10:45:46 +08:00
|
|
|
size_t dnlen, olen, nlen;
|
2002-01-01 21:31:20 +08:00
|
|
|
assert( dn && oldSup && newSup && newDN );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
dnlen = dn->bv_len;
|
|
|
|
olen = oldSup->bv_len;
|
|
|
|
nlen = newSup->bv_len;
|
1999-07-16 10:45:46 +08:00
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
newDN->bv_val = ch_malloc( dnlen - olen + nlen + 1 );
|
1999-07-16 10:45:46 +08:00
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
AC_MEMCPY( newDN->bv_val, dn->bv_val, dnlen - olen );
|
|
|
|
AC_MEMCPY( &newDN->bv_val[dnlen - olen], newSup->bv_val, nlen );
|
|
|
|
newDN->bv_val[dnlen - olen + nlen] = '\0';
|
1999-07-16 10:45:46 +08:00
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
return;
|
1998-10-24 11:49:07 +08:00
|
|
|
}
|
|
|
|
|
1999-07-16 10:45:46 +08:00
|
|
|
static int dnlist_subordinate(
|
2002-01-14 09:43:17 +08:00
|
|
|
BerVarray dnlist,
|
2002-01-01 21:31:20 +08:00
|
|
|
struct berval *dn )
|
1998-10-24 11:49:07 +08:00
|
|
|
{
|
1999-07-16 10:45:46 +08:00
|
|
|
assert( dnlist );
|
|
|
|
|
2002-01-01 21:31:20 +08:00
|
|
|
for( ; dnlist->bv_val != NULL; dnlist++ ) {
|
|
|
|
if( dnIsSuffix( dnlist, dn ) ) {
|
1999-07-16 10:45:46 +08:00
|
|
|
return 1;
|
|
|
|
}
|
1998-10-24 11:49:07 +08:00
|
|
|
}
|
1999-07-16 10:45:46 +08:00
|
|
|
|
|
|
|
return 0;
|
1998-10-24 11:49:07 +08:00
|
|
|
}
|