mirror of
https://git.openldap.org/openldap/openldap.git
synced 2025-01-06 10:46:21 +08:00
trim (long ago) unused files
This commit is contained in:
Pierangelo Masarati
parent
1e5334eb80
commit
03b6a692aa
@ -1,163 +0,0 @@
|
||||
/* $OpenLDAP$ */
|
||||
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
||||
*
|
||||
* Copyright 1999-2005 The OpenLDAP Foundation.
|
||||
* Portions Copyright 2001-2003 Pierangelo Masarati.
|
||||
* Portions Copyright 1999-2003 Howard Chu.
|
||||
* 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>.
|
||||
*/
|
||||
/* ACKNOWLEDGEMENTS:
|
||||
* This work was initially developed by the Howard Chu for inclusion
|
||||
* in OpenLDAP Software and subsequently enhanced by Pierangelo
|
||||
* Masarati.
|
||||
*/
|
||||
|
||||
#include "portable.h"
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
#include <ac/socket.h>
|
||||
#include <ac/string.h>
|
||||
|
||||
#include "slap.h"
|
||||
#include "../back-ldap/back-ldap.h"
|
||||
#include "back-meta.h"
|
||||
|
||||
|
||||
/* return 0 IFF we can retrieve the attributes
|
||||
* of entry with e_ndn
|
||||
*/
|
||||
|
||||
/*
|
||||
* FIXME: I never testd this function; I know it compiles ... :)
|
||||
*/
|
||||
int
|
||||
meta_back_attribute(
|
||||
Backend *be,
|
||||
Connection *conn,
|
||||
Operation *op,
|
||||
Entry *target,
|
||||
struct berval *ndn,
|
||||
AttributeDescription *entry_at,
|
||||
BerVarray *vals
|
||||
)
|
||||
{
|
||||
struct metainfo *li = ( struct metainfo * )be->be_private;
|
||||
int rc = 1, i, j, count, is_oc, candidate;
|
||||
Attribute *attr;
|
||||
BerVarray abv, v;
|
||||
char **vs;
|
||||
struct berval mapped;
|
||||
LDAPMessage *result, *e;
|
||||
char *gattr[ 2 ];
|
||||
LDAP *ld;
|
||||
|
||||
*vals = NULL;
|
||||
if ( target != NULL && dn_match( &target->e_nname, ndn ) ) {
|
||||
/* we already have a copy of the entry */
|
||||
/* attribute and objectclass mapping has already been done */
|
||||
attr = attr_find( target->e_attrs, entry_at );
|
||||
if ( attr == NULL ) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
for ( count = 0; attr->a_vals[ count ].bv_val != NULL; count++ )
|
||||
;
|
||||
v = ( BerVarray )ch_calloc( ( count + 1 ), sizeof( struct berval ) );
|
||||
if ( v == NULL ) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
for ( j = 0, abv = attr->a_vals; --count >= 0; abv++ ) {
|
||||
if ( abv->bv_len > 0 ) {
|
||||
ber_dupbv( &v[ j ], abv );
|
||||
if ( v[ j ].bv_val == NULL ) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
v[ j ].bv_val = NULL;
|
||||
*vals = v;
|
||||
|
||||
return 0;
|
||||
} /* else */
|
||||
|
||||
candidate = meta_back_select_unique_candidate( li, ndn );
|
||||
if ( candidate == META_TARGET_NONE ) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
ldap_back_map( &li->targets[ candidate ]->at_map,
|
||||
&entry_at->ad_cname, &mapped, BACKLDAP_MAP );
|
||||
if ( mapped.bv_val == NULL || mapped.bv_val[0] == '\0' )
|
||||
return 1;
|
||||
|
||||
rc = ldap_initialize( &ld, li->targets[ candidate ]->uri );
|
||||
if ( rc != LDAP_SUCCESS ) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
rc = ldap_bind_s( ld, li->targets[ candidate ]->binddn.bv_val,
|
||||
li->targets[ candidate ]->bindpw.bv_val, LDAP_AUTH_SIMPLE );
|
||||
if ( rc != LDAP_SUCCESS) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
gattr[ 0 ] = mapped.bv_val;
|
||||
gattr[ 1 ] = NULL;
|
||||
if ( ldap_search_ext_s( ld, ndn->bv_val, LDAP_SCOPE_BASE,
|
||||
"(objectClass=*)",
|
||||
gattr, 0, NULL, NULL, LDAP_NO_LIMIT,
|
||||
LDAP_NO_LIMIT, &result) == LDAP_SUCCESS) {
|
||||
if ( ( e = ldap_first_entry( ld, result ) ) != NULL ) {
|
||||
vs = ldap_get_values( ld, e, mapped.bv_val );
|
||||
if ( vs != NULL ) {
|
||||
for ( count = 0; vs[ count ] != NULL;
|
||||
count++ ) { }
|
||||
v = ( BerVarray )ch_calloc( ( count + 1 ),
|
||||
sizeof( struct berval ) );
|
||||
if ( v == NULL ) {
|
||||
ldap_value_free( vs );
|
||||
} else {
|
||||
is_oc = ( strcasecmp( "objectclass", mapped.bv_val ) == 0 );
|
||||
for ( i = 0, j = 0; i < count; i++ ) {
|
||||
ber_str2bv( vs[ i ], 0, 0, &v[ j ] );
|
||||
if ( !is_oc ) {
|
||||
if ( v[ j ].bv_val == NULL ) {
|
||||
ch_free( vs[ i ] );
|
||||
} else {
|
||||
j++;
|
||||
}
|
||||
} else {
|
||||
ldap_back_map( &li->targets[ candidate ]->oc_map, &v[ j ], &mapped, BACKLDAP_REMAP );
|
||||
if ( mapped.bv_val && mapped.bv_val[0] != '\0' ) {
|
||||
ber_dupbv( &v[ j ], &mapped );
|
||||
if ( v[ j ].bv_val ) {
|
||||
j++;
|
||||
}
|
||||
}
|
||||
ch_free( vs[ i ] );
|
||||
}
|
||||
}
|
||||
v[ j ].bv_val = NULL;
|
||||
*vals = v;
|
||||
rc = 0;
|
||||
ch_free( vs );
|
||||
}
|
||||
}
|
||||
}
|
||||
ldap_msgfree( result );
|
||||
}
|
||||
ldap_unbind( ld );
|
||||
|
||||
return(rc);
|
||||
}
|
||||
|
||||
@ -1,235 +0,0 @@
|
||||
/* $OpenLDAP$ */
|
||||
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
||||
*
|
||||
* Copyright 1999-2005 The OpenLDAP Foundation.
|
||||
* Portions Copyright 2001-2003 Pierangelo Masarati.
|
||||
* Portions Copyright 1999-2003 Howard Chu.
|
||||
* 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>.
|
||||
*/
|
||||
/* ACKNOWLEDGEMENTS:
|
||||
* This work was initially developed by the Howard Chu for inclusion
|
||||
* in OpenLDAP Software and subsequently enhanced by Pierangelo
|
||||
* Masarati.
|
||||
*/
|
||||
|
||||
#include "portable.h"
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
#include <ac/socket.h>
|
||||
#include <ac/string.h>
|
||||
|
||||
#include "slap.h"
|
||||
#include "../back-ldap/back-ldap.h"
|
||||
#include "back-meta.h"
|
||||
#include "lutil.h"
|
||||
|
||||
/* return 0 IFF op_dn is a value in group_at (member) attribute
|
||||
* of entry with gr_dn AND that entry has an objectClass
|
||||
* value of group_oc (groupOfNames)
|
||||
*/
|
||||
int
|
||||
meta_back_group(
|
||||
Backend *be,
|
||||
Connection *conn,
|
||||
Operation *op,
|
||||
Entry *target,
|
||||
struct berval *gr_ndn,
|
||||
struct berval *op_ndn,
|
||||
ObjectClass *group_oc,
|
||||
AttributeDescription *group_at
|
||||
)
|
||||
{
|
||||
struct metainfo *li = ( struct metainfo * )be->be_private;
|
||||
int rc = 1, candidate;
|
||||
Attribute *attr;
|
||||
AttributeDescription *ad_objectClass = slap_schema.si_ad_objectClass;
|
||||
LDAPMessage *result;
|
||||
char *gattr[ 2 ];
|
||||
char *filter = NULL, *ptr;
|
||||
LDAP *ld = NULL;
|
||||
struct berval mop_ndn = BER_BVNULL, mgr_ndn = BER_BVNULL;
|
||||
|
||||
struct berval group_oc_name = BER_BVNULL;
|
||||
struct berval group_at_name = group_at->ad_cname;
|
||||
|
||||
if ( group_oc->soc_names && group_oc->soc_names[ 0 ] ) {
|
||||
group_oc_name.bv_val = group_oc->soc_names[ 0 ];
|
||||
} else {
|
||||
group_oc_name.bv_val = group_oc->soc_oid;
|
||||
}
|
||||
|
||||
if ( group_oc_name.bv_val ) {
|
||||
group_oc_name.bv_len = strlen( group_oc_name.bv_val );
|
||||
}
|
||||
|
||||
if ( target != NULL && dn_match( &target->e_nname, gr_ndn ) ) {
|
||||
/* we already have a copy of the entry */
|
||||
/* attribute and objectclass mapping has already been done */
|
||||
|
||||
/*
|
||||
* first we need to check if the objectClass attribute
|
||||
* has been retrieved; otherwise we need to repeat the search
|
||||
*/
|
||||
attr = attr_find( target->e_attrs, ad_objectClass );
|
||||
if ( attr != NULL ) {
|
||||
|
||||
/*
|
||||
* Now we can check for the group objectClass value
|
||||
*/
|
||||
if ( !is_entry_objectclass( target, group_oc, 0 ) ) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
/*
|
||||
* This part has been reworked: the group attr compare
|
||||
* fails only if the attribute is PRESENT but the value
|
||||
* is NOT PRESENT; if the attribute is NOT PRESENT, the
|
||||
* search must be repeated as well.
|
||||
* This may happen if a search for an entry has already
|
||||
* been performed (target is not null) but the group
|
||||
* attribute has not been required
|
||||
*/
|
||||
attr = attr_find( target->e_attrs, group_at );
|
||||
if ( attr != NULL ) {
|
||||
rc = value_find_ex( group_at,
|
||||
SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
|
||||
attr->a_vals, op_ndn );
|
||||
if ( rc != LDAP_SUCCESS ) {
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
} /* else: repeat the search */
|
||||
} /* else: repeat the search */
|
||||
} /* else: do the search */
|
||||
|
||||
candidate = meta_back_select_unique_candidate( li, gr_ndn );
|
||||
if ( candidate == META_TARGET_NONE ) {
|
||||
goto cleanup;
|
||||
}
|
||||
|
||||
/*
|
||||
* Rewrite the op ndn if needed
|
||||
*/
|
||||
switch ( rewrite_session( li->targets[ candidate ]->rwinfo, "bindDn",
|
||||
op_ndn->bv_val, conn, &mop_ndn.bv_val ) ) {
|
||||
case REWRITE_REGEXEC_OK:
|
||||
if ( mop_ndn.bv_val != NULL && mop_ndn.bv_val[ 0 ] != '\0' ) {
|
||||
mop_ndn.bv_len = strlen( mop_ndn.bv_val );
|
||||
} else {
|
||||
mop_ndn = *op_ndn;
|
||||
}
|
||||
Debug( LDAP_DEBUG_ARGS,
|
||||
"rw> bindDn (op ndn in group):"
|
||||
" \"%s\" -> \"%s\"\n%s",
|
||||
op_ndn->bv_val, mop_ndn.bv_val, "" );
|
||||
break;
|
||||
|
||||
case REWRITE_REGEXEC_UNWILLING:
|
||||
/* continues to next case */
|
||||
|
||||
case REWRITE_REGEXEC_ERR:
|
||||
return 1;
|
||||
}
|
||||
|
||||
/*
|
||||
* Rewrite the gr ndn if needed
|
||||
*/
|
||||
switch ( rewrite_session( li->targets[ candidate ]->rwinfo,
|
||||
"searchBase",
|
||||
gr_ndn->bv_val, conn, &mgr_ndn.bv_val ) ) {
|
||||
case REWRITE_REGEXEC_OK:
|
||||
if ( mgr_ndn.bv_val != NULL && mgr_ndn.bv_val[ 0 ] != '\0' ) {
|
||||
mgr_ndn.bv_len = strlen( mgr_ndn.bv_val );
|
||||
} else {
|
||||
mgr_ndn = *gr_ndn;
|
||||
}
|
||||
Debug( LDAP_DEBUG_ARGS,
|
||||
"rw> searchBase (gr ndn in group):"
|
||||
" \"%s\" -> \"%s\"\n%s",
|
||||
gr_ndn->bv_val, mgr_ndn.bv_val, "" );
|
||||
break;
|
||||
|
||||
case REWRITE_REGEXEC_UNWILLING:
|
||||
/* continues to next case */
|
||||
|
||||
case REWRITE_REGEXEC_ERR:
|
||||
goto cleanup;
|
||||
}
|
||||
|
||||
ldap_back_map( &li->targets[ candidate ]->oc_map,
|
||||
&group_oc_name, &group_oc_name, BACKLDAP_MAP );
|
||||
if ( group_oc_name.bv_val == NULL || group_oc_name.bv_val[0] == '\0' ) {
|
||||
goto cleanup;
|
||||
}
|
||||
ldap_back_map( &li->targets[ candidate ]->at_map,
|
||||
&group_at_name, &group_at_name, BACKLDAP_MAP );
|
||||
if ( group_at_name.bv_val == NULL || group_at_name.bv_val[0] == '\0' ) {
|
||||
goto cleanup;
|
||||
}
|
||||
|
||||
filter = ch_malloc( sizeof( "(&(objectclass=)(=))" )
|
||||
+ group_oc_name.bv_len
|
||||
+ group_at_name.bv_len
|
||||
+ mop_ndn.bv_len + 1 );
|
||||
if ( filter == NULL ) {
|
||||
goto cleanup;
|
||||
}
|
||||
|
||||
rc = ldap_initialize( &ld, li->targets[ candidate ]->uri );
|
||||
if ( rc != LDAP_SUCCESS ) {
|
||||
goto cleanup;
|
||||
}
|
||||
|
||||
rc = ldap_bind_s( ld, li->targets[ candidate ]->binddn.bv_val,
|
||||
li->targets[ candidate ]->bindpw.bv_val,
|
||||
LDAP_AUTH_SIMPLE );
|
||||
if ( rc != LDAP_SUCCESS ) {
|
||||
goto cleanup;
|
||||
}
|
||||
|
||||
ptr = lutil_strcopy( filter, "(&(objectclass=" );
|
||||
ptr = lutil_strcopy( ptr , group_oc_name.bv_val );
|
||||
ptr = lutil_strcopy( ptr , ")(" );
|
||||
ptr = lutil_strcopy( ptr , group_at_name.bv_val );
|
||||
ptr = lutil_strcopy( ptr , "=" );
|
||||
ptr = lutil_strcopy( ptr , mop_ndn.bv_val );
|
||||
strcpy( ptr , "))" );
|
||||
|
||||
gattr[ 0 ] = "objectclass";
|
||||
gattr[ 1 ] = NULL;
|
||||
rc = 1;
|
||||
if ( ldap_search_ext_s( ld, mgr_ndn.bv_val, LDAP_SCOPE_BASE, filter,
|
||||
gattr, 0, NULL, NULL, LDAP_NO_LIMIT,
|
||||
LDAP_NO_LIMIT, &result ) == LDAP_SUCCESS ) {
|
||||
if ( ldap_first_entry( ld, result ) != NULL ) {
|
||||
rc = 0;
|
||||
}
|
||||
ldap_msgfree( result );
|
||||
}
|
||||
|
||||
cleanup:;
|
||||
if ( ld != NULL ) {
|
||||
ldap_unbind( ld );
|
||||
}
|
||||
if ( filter != NULL ) {
|
||||
ch_free( filter );
|
||||
}
|
||||
if ( mop_ndn.bv_val != op_ndn->bv_val ) {
|
||||
free( mop_ndn.bv_val );
|
||||
}
|
||||
if ( mgr_ndn.bv_val != gr_ndn->bv_val ) {
|
||||
free( mgr_ndn.bv_val );
|
||||
}
|
||||
|
||||
return rc;
|
||||
}
|
||||
|
||||
Loading…
Reference in New Issue
Block a user