mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-21 03:10:25 +08:00
191 lines
5.5 KiB
C
191 lines
5.5 KiB
C
/*
|
|
* Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
*
|
|
* Copyright 2001, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
|
|
*
|
|
* This work has been developed to fulfill the requirements
|
|
* of SysNet s.n.c. <http:www.sys-net.it> and it has been donated
|
|
* to the OpenLDAP Foundation in the hope that it may be useful
|
|
* to the Open Source community, but WITHOUT ANY WARRANTY.
|
|
*
|
|
* Permission is granted to anyone to use this software for any purpose
|
|
* on any computer system, and to alter it and redistribute it, subject
|
|
* to the following restrictions:
|
|
*
|
|
* 1. The author and SysNet s.n.c. are not responsible for the consequences
|
|
* of use of this software, no matter how awful, even if they arise from
|
|
* flaws in it.
|
|
*
|
|
* 2. The origin of this software must not be misrepresented, either by
|
|
* explicit claim or by omission. Since few users ever read sources,
|
|
* credits should appear in the documentation.
|
|
*
|
|
* 3. Altered versions must be plainly marked as such, and must not be
|
|
* misrepresented as being the original software. Since few users
|
|
* ever read sources, credits should appear in the documentation.
|
|
* SysNet s.n.c. cannot be responsible for the consequences of the
|
|
* alterations.
|
|
*
|
|
* 4. This notice may not be removed or altered.
|
|
*
|
|
*
|
|
* This software is based on the backend back-ldap, implemented
|
|
* by Howard Chu <hyc@highlandsun.com>, and modified by Mark Valence
|
|
* <kurash@sassafras.com>, Pierangelo Masarati <ando@sys-net.it> and other
|
|
* contributors. The contribution of the original software to the present
|
|
* implementation is acknowledged in this copyright statement.
|
|
*
|
|
* A special acknowledgement goes to Howard for the overall architecture
|
|
* (and for borrowing large pieces of code), and to Mark, who implemented
|
|
* from scratch the attribute/objectclass mapping.
|
|
*
|
|
* The original copyright statement follows.
|
|
*
|
|
* Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
|
|
*
|
|
* Permission is granted to anyone to use this software for any purpose
|
|
* on any computer system, and to alter it and redistribute it, subject
|
|
* to the following restrictions:
|
|
*
|
|
* 1. The author is not responsible for the consequences of use of this
|
|
* software, no matter how awful, even if they arise from flaws in it.
|
|
*
|
|
* 2. The origin of this software must not be misrepresented, either by
|
|
* explicit claim or by omission. Since few users ever read sources,
|
|
* credits should appear in the documentation.
|
|
*
|
|
* 3. Altered versions must be plainly marked as such, and must not be
|
|
* misrepresented as being the original software. Since few users
|
|
* ever read sources, credits should appear in the
|
|
* documentation.
|
|
*
|
|
* 4. This notice may not be removed or altered.
|
|
*
|
|
*/
|
|
|
|
#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"
|
|
|
|
int
|
|
meta_back_modrdn( Operation *op, SlapReply *rs )
|
|
/*
|
|
Backend *be,
|
|
Connection *conn,
|
|
Operation *op,
|
|
struct berval *dn,
|
|
struct berval *ndn,
|
|
struct berval *newrdn,
|
|
struct berval *nnewrdn,
|
|
int deleteoldrdn,
|
|
struct berval *newSuperior,
|
|
struct berval *nnewSuperior
|
|
) */
|
|
{
|
|
struct metainfo *li = ( struct metainfo * )op->o_bd->be_private;
|
|
struct metaconn *lc;
|
|
int rc = 0;
|
|
int candidate = -1;
|
|
struct berval mdn = { 0, NULL },
|
|
mnewSuperior = { 0, NULL };
|
|
dncookie dc;
|
|
|
|
lc = meta_back_getconn( op, rs, META_OP_REQUIRE_SINGLE,
|
|
&op->o_req_ndn, &candidate );
|
|
if ( !lc ) {
|
|
rc = -1;
|
|
goto cleanup;
|
|
}
|
|
|
|
if ( !meta_back_dobind( lc, op )
|
|
|| !meta_back_is_valid( lc, candidate ) ) {
|
|
rs->sr_err = LDAP_OTHER;
|
|
rc = -1;
|
|
goto cleanup;
|
|
}
|
|
|
|
dc.conn = op->o_conn;
|
|
dc.rs = rs;
|
|
|
|
if ( op->oq_modrdn.rs_newSup ) {
|
|
int nsCandidate, version = LDAP_VERSION3;
|
|
|
|
nsCandidate = meta_back_select_unique_candidate( li,
|
|
op->oq_modrdn.rs_newSup );
|
|
|
|
if ( nsCandidate != candidate ) {
|
|
/*
|
|
* FIXME: one possibility is to delete the entry
|
|
* from one target and add it to the other;
|
|
* unfortunately we'd need write access to both,
|
|
* which is nearly impossible; for administration
|
|
* needs, the rootdn of the metadirectory could
|
|
* be mapped to an administrative account on each
|
|
* target (the binddn?); we'll see.
|
|
*/
|
|
/*
|
|
* FIXME: is this the correct return code?
|
|
*/
|
|
rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
|
|
rc = -1;
|
|
goto cleanup;
|
|
}
|
|
|
|
ldap_set_option( lc->conns[ nsCandidate ].ld,
|
|
LDAP_OPT_PROTOCOL_VERSION, &version );
|
|
|
|
/*
|
|
* Rewrite the new superior, if defined and required
|
|
*/
|
|
dc.rwmap = &li->targets[ nsCandidate ]->rwmap;
|
|
dc.ctx = "newSuperiorDN";
|
|
if ( ldap_back_dn_massage( &dc, op->oq_modrdn.rs_newSup, &mnewSuperior ) ) {
|
|
rc = -1;
|
|
goto cleanup;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Rewrite the modrdn dn, if required
|
|
*/
|
|
dc.rwmap = &li->targets[ candidate ]->rwmap;
|
|
dc.ctx = "modrDN";
|
|
if ( ldap_back_dn_massage( &dc, &op->o_req_dn, &mdn ) ) {
|
|
rc = -1;
|
|
goto cleanup;
|
|
}
|
|
|
|
ldap_rename2_s( lc->conns[ candidate ].ld, mdn.bv_val,
|
|
op->oq_modrdn.rs_newrdn.bv_val,
|
|
mnewSuperior.bv_val,
|
|
op->oq_modrdn.rs_deleteoldrdn );
|
|
|
|
cleanup:;
|
|
if ( mdn.bv_val != op->o_req_dn.bv_val ) {
|
|
free( mdn.bv_val );
|
|
}
|
|
|
|
if ( mnewSuperior.bv_val != NULL
|
|
&& mnewSuperior.bv_val != op->oq_modrdn.rs_newSup->bv_val ) {
|
|
free( mnewSuperior.bv_val );
|
|
}
|
|
|
|
if ( rc == 0 ) {
|
|
return meta_back_op_result( lc, op, rs ) == LDAP_SUCCESS
|
|
? 0 : 1;
|
|
} /* else */
|
|
|
|
send_ldap_result( op, rs );
|
|
return rc;
|
|
|
|
}
|
|
|