mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-27 03:20:22 +08:00
2484 lines
62 KiB
C
2484 lines
62 KiB
C
/* syncrepl.c -- Replication Engine which uses the LDAP Sync protocol */
|
|
/* $OpenLDAP$ */
|
|
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
|
*
|
|
* Copyright 2003-2005 The OpenLDAP Foundation.
|
|
* Portions Copyright 2003 by IBM Corporation.
|
|
* Portions Copyright 2003 by Howard Chu, Symas 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.
|
|
*
|
|
* 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>.
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <ac/string.h>
|
|
#include <ac/socket.h>
|
|
|
|
#include "lutil.h"
|
|
#include "slap.h"
|
|
#include "lutil_ldap.h"
|
|
|
|
#include "ldap_rq.h"
|
|
|
|
/* FIXME: for ldap_ld_free() */
|
|
#undef ldap_debug
|
|
#include "../../libraries/libldap/ldap-int.h"
|
|
|
|
#define SYNCREPL_STR "syncreplxxx"
|
|
#define CN_STR "cn="
|
|
|
|
static const struct berval slap_syncrepl_bvc = BER_BVC(SYNCREPL_STR);
|
|
static const struct berval slap_syncrepl_cn_bvc = BER_BVC(CN_STR SYNCREPL_STR);
|
|
|
|
static int syncuuid_cmp( const void *, const void * );
|
|
static void avl_ber_bvfree( void * );
|
|
static void syncrepl_del_nonpresent( Operation *, syncinfo_t *, BerVarray );
|
|
|
|
/* callback functions */
|
|
static int dn_callback( struct slap_op *, struct slap_rep * );
|
|
static int nonpresent_callback( struct slap_op *, struct slap_rep * );
|
|
static int null_callback( struct slap_op *, struct slap_rep * );
|
|
|
|
static AttributeDescription *sync_descs[4];
|
|
|
|
void
|
|
init_syncrepl(syncinfo_t *si)
|
|
{
|
|
int i, j, k, l, n;
|
|
char **attrs, **exattrs;
|
|
|
|
if ( !sync_descs[0] ) {
|
|
sync_descs[0] = slap_schema.si_ad_objectClass;
|
|
sync_descs[1] = slap_schema.si_ad_structuralObjectClass;
|
|
sync_descs[2] = slap_schema.si_ad_entryCSN;
|
|
sync_descs[3] = NULL;
|
|
}
|
|
|
|
if ( si->si_allattrs && si->si_allopattrs )
|
|
attrs = NULL;
|
|
else
|
|
attrs = anlist2attrs( si->si_anlist );
|
|
|
|
if ( attrs ) {
|
|
if ( si->si_allattrs ) {
|
|
i = 0;
|
|
while ( attrs[i] ) {
|
|
if ( !is_at_operational( at_find( attrs[i] ))) {
|
|
for ( j = i; attrs[j] != NULL; j++ ) {
|
|
if ( j == i )
|
|
ch_free( attrs[i] );
|
|
attrs[j] = attrs[j+1];
|
|
}
|
|
} else {
|
|
i++;
|
|
}
|
|
}
|
|
attrs = ( char ** ) ch_realloc( attrs, (i + 2)*sizeof( char * ) );
|
|
attrs[i] = ch_strdup("*");
|
|
attrs[i + 1] = NULL;
|
|
|
|
} else if ( si->si_allopattrs ) {
|
|
i = 0;
|
|
while ( attrs[i] ) {
|
|
if ( is_at_operational( at_find( attrs[i] ))) {
|
|
for ( j = i; attrs[j] != NULL; j++ ) {
|
|
if ( j == i )
|
|
ch_free( attrs[i] );
|
|
attrs[j] = attrs[j+1];
|
|
}
|
|
} else {
|
|
i++;
|
|
}
|
|
}
|
|
attrs = ( char ** ) ch_realloc( attrs, (i + 2)*sizeof( char * ) );
|
|
attrs[i] = ch_strdup("+");
|
|
attrs[i + 1] = NULL;
|
|
}
|
|
|
|
for ( i = 0; sync_descs[i] != NULL; i++ ) {
|
|
j = 0;
|
|
while ( attrs[j] ) {
|
|
if ( !strcmp( attrs[j], sync_descs[i]->ad_cname.bv_val )) {
|
|
for ( k = j; attrs[k] != NULL; k++ ) {
|
|
if ( k == j )
|
|
ch_free( attrs[k] );
|
|
attrs[k] = attrs[k+1];
|
|
}
|
|
} else {
|
|
j++;
|
|
}
|
|
}
|
|
}
|
|
|
|
for ( n = 0; attrs[ n ] != NULL; n++ ) /* empty */;
|
|
|
|
if ( si->si_allopattrs ) {
|
|
attrs = ( char ** ) ch_realloc( attrs, (n + 2)*sizeof( char * ));
|
|
} else {
|
|
attrs = ( char ** ) ch_realloc( attrs, (n + 4)*sizeof( char * ));
|
|
}
|
|
|
|
if ( attrs == NULL ) {
|
|
Debug( LDAP_DEBUG_ANY, "out of memory\n", 0,0,0 );
|
|
}
|
|
|
|
/* Add Attributes */
|
|
if ( si->si_allopattrs ) {
|
|
attrs[n++] = ch_strdup( sync_descs[0]->ad_cname.bv_val );
|
|
} else {
|
|
for ( i = 0; sync_descs[ i ] != NULL; i++ ) {
|
|
attrs[ n++ ] = ch_strdup ( sync_descs[i]->ad_cname.bv_val );
|
|
}
|
|
}
|
|
attrs[ n ] = NULL;
|
|
|
|
} else {
|
|
|
|
i = 0;
|
|
if ( si->si_allattrs == si->si_allopattrs ) {
|
|
attrs = (char**) ch_malloc( 3 * sizeof(char*) );
|
|
attrs[i++] = ch_strdup( "*" );
|
|
attrs[i++] = ch_strdup( "+" );
|
|
} else if ( si->si_allattrs && !si->si_allopattrs ) {
|
|
for ( n = 0; sync_descs[ n ] != NULL; n++ ) ;
|
|
attrs = (char**) ch_malloc( (n+1)* sizeof(char*) );
|
|
attrs[i++] = ch_strdup( "*" );
|
|
for ( j = 1; sync_descs[ j ] != NULL; j++ ) {
|
|
attrs[i++] = ch_strdup ( sync_descs[j]->ad_cname.bv_val );
|
|
}
|
|
} else if ( !si->si_allattrs && si->si_allopattrs ) {
|
|
attrs = (char**) ch_malloc( 3 * sizeof(char*) );
|
|
attrs[i++] = ch_strdup( "+" );
|
|
attrs[i++] = ch_strdup( sync_descs[0]->ad_cname.bv_val );
|
|
}
|
|
attrs[i] = NULL;
|
|
}
|
|
|
|
si->si_attrs = attrs;
|
|
|
|
exattrs = anlist2attrs( si->si_exanlist );
|
|
|
|
if ( exattrs ) {
|
|
for ( n = 0; exattrs[n] != NULL; n++ ) ;
|
|
|
|
for ( i = 0; sync_descs[i] != NULL; i++ ) {
|
|
j = 0;
|
|
while ( exattrs[j] != NULL ) {
|
|
if ( !strcmp( exattrs[j], sync_descs[i]->ad_cname.bv_val )) {
|
|
for ( k = j; exattrs[k] != NULL; k++ ) {
|
|
if ( k == j )
|
|
ch_free( exattrs[k] );
|
|
exattrs[k] = exattrs[k+1];
|
|
}
|
|
} else {
|
|
j++;
|
|
}
|
|
}
|
|
}
|
|
|
|
for ( i = 0; exattrs[i] != NULL; i++ ) {
|
|
for ( j = 0; si->si_anlist[j].an_name.bv_val; j++ ) {
|
|
ObjectClass *oc;
|
|
if ( ( oc = si->si_anlist[j].an_oc ) ) {
|
|
k = 0;
|
|
while ( oc->soc_required[k] ) {
|
|
if ( !strcmp( exattrs[i],
|
|
oc->soc_required[k]->sat_cname.bv_val )) {
|
|
for ( l = i; exattrs[l]; l++ ) {
|
|
if ( l == i )
|
|
ch_free( exattrs[i] );
|
|
exattrs[l] = exattrs[l+1];
|
|
}
|
|
} else {
|
|
k++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
for ( i = 0; exattrs[i] != NULL; i++ ) ;
|
|
|
|
if ( i != n )
|
|
exattrs = (char **) ch_realloc( exattrs, (i + 1)*sizeof(char *));
|
|
}
|
|
|
|
si->si_exattrs = exattrs;
|
|
}
|
|
|
|
static int
|
|
ldap_sync_search(
|
|
syncinfo_t *si,
|
|
void *ctx )
|
|
{
|
|
BerElementBuffer berbuf;
|
|
BerElement *ber = (BerElement *)&berbuf;
|
|
LDAPControl c[2], *ctrls[3];
|
|
struct timeval timeout;
|
|
ber_int_t msgid;
|
|
int rc;
|
|
|
|
/* setup LDAP SYNC control */
|
|
ber_init2( ber, NULL, LBER_USE_DER );
|
|
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &ctx );
|
|
|
|
if ( si->si_syncCookie.octet_str &&
|
|
!BER_BVISNULL( &si->si_syncCookie.octet_str[0] ) )
|
|
{
|
|
ber_printf( ber, "{eO}",
|
|
abs(si->si_type),
|
|
&si->si_syncCookie.octet_str[0] );
|
|
} else {
|
|
ber_printf( ber, "{e}",
|
|
abs(si->si_type) );
|
|
}
|
|
|
|
if ( (rc = ber_flatten2( ber, &c[0].ldctl_value, 0 )) == LBER_ERROR ) {
|
|
ber_free_buf( ber );
|
|
return rc;
|
|
}
|
|
|
|
c[0].ldctl_oid = LDAP_CONTROL_SYNC;
|
|
c[0].ldctl_iscritical = si->si_type < 0;
|
|
ctrls[0] = &c[0];
|
|
|
|
if ( si->si_authzId ) {
|
|
c[1].ldctl_oid = LDAP_CONTROL_PROXY_AUTHZ;
|
|
ber_str2bv( si->si_authzId, 0, 0, &c[1].ldctl_value );
|
|
c[1].ldctl_iscritical = 1;
|
|
ctrls[1] = &c[1];
|
|
ctrls[2] = NULL;
|
|
} else {
|
|
ctrls[1] = NULL;
|
|
}
|
|
|
|
timeout.tv_sec = si->si_tlimit;
|
|
timeout.tv_usec = 0;
|
|
|
|
rc = ldap_search_ext( si->si_ld, si->si_base.bv_val, si->si_scope,
|
|
si->si_filterstr.bv_val, si->si_attrs, si->si_attrsonly,
|
|
ctrls, NULL, si->si_tlimit > 0 ? &timeout : NULL,
|
|
si->si_slimit, &msgid );
|
|
ber_free_buf( ber );
|
|
return rc;
|
|
}
|
|
|
|
static int
|
|
do_syncrep1(
|
|
Operation *op,
|
|
syncinfo_t *si )
|
|
{
|
|
int rc;
|
|
int cmdline_cookie_found = 0;
|
|
|
|
char syncrepl_cbuf[sizeof(CN_STR SYNCREPL_STR)];
|
|
struct berval syncrepl_cn_bv;
|
|
struct sync_cookie *sc = NULL;
|
|
struct berval *psub;
|
|
#ifdef HAVE_TLS
|
|
void *ssl;
|
|
#endif
|
|
|
|
psub = &si->si_be->be_nsuffix[0];
|
|
|
|
/* Init connection to master */
|
|
rc = ldap_initialize( &si->si_ld, si->si_provideruri );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"do_syncrep1: ldap_initialize failed (%s)\n",
|
|
si->si_provideruri, 0, 0 );
|
|
return rc;
|
|
}
|
|
|
|
op->o_protocol = LDAP_VERSION3;
|
|
ldap_set_option( si->si_ld, LDAP_OPT_PROTOCOL_VERSION, &op->o_protocol );
|
|
|
|
/* Bind to master */
|
|
|
|
if ( si->si_tls ) {
|
|
rc = ldap_start_tls_s( si->si_ld, NULL, NULL );
|
|
if( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"%s: ldap_start_tls failed (%d)\n",
|
|
si->si_tls == SYNCINFO_TLS_CRITICAL ? "Error" : "Warning",
|
|
rc, 0 );
|
|
if( si->si_tls == SYNCINFO_TLS_CRITICAL ) goto done;
|
|
}
|
|
}
|
|
|
|
if ( si->si_bindmethod == LDAP_AUTH_SASL ) {
|
|
#ifdef HAVE_CYRUS_SASL
|
|
void *defaults;
|
|
|
|
if ( si->si_secprops != NULL ) {
|
|
rc = ldap_set_option( si->si_ld,
|
|
LDAP_OPT_X_SASL_SECPROPS, si->si_secprops);
|
|
|
|
if( rc != LDAP_OPT_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "Error: ldap_set_option "
|
|
"(%s,SECPROPS,\"%s\") failed!\n",
|
|
si->si_provideruri, si->si_secprops, 0 );
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
defaults = lutil_sasl_defaults( si->si_ld, si->si_saslmech,
|
|
si->si_realm, si->si_authcId, si->si_passwd, si->si_authzId );
|
|
|
|
rc = ldap_sasl_interactive_bind_s( si->si_ld,
|
|
si->si_binddn,
|
|
si->si_saslmech,
|
|
NULL, NULL,
|
|
LDAP_SASL_QUIET,
|
|
lutil_sasl_interact,
|
|
defaults );
|
|
|
|
lutil_sasl_freedefs( defaults );
|
|
|
|
/* FIXME: different error behaviors according to
|
|
* 1) return code
|
|
* 2) on err policy : exit, retry, backoff ...
|
|
*/
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep1: "
|
|
"ldap_sasl_interactive_bind_s failed (%d)\n",
|
|
rc, 0, 0 );
|
|
|
|
/* FIXME (see above comment) */
|
|
/* if Kerberos credentials cache is not active, retry */
|
|
if ( strcmp( si->si_saslmech, "GSSAPI" ) == 0 &&
|
|
rc == LDAP_LOCAL_ERROR )
|
|
{
|
|
rc = LDAP_SERVER_DOWN;
|
|
}
|
|
|
|
goto done;
|
|
}
|
|
#else /* HAVE_CYRUS_SASL */
|
|
/* Should never get here, we trapped this at config time */
|
|
assert(0);
|
|
fprintf( stderr, "not compiled with SASL support\n" );
|
|
rc = LDAP_OTHER;
|
|
goto done;
|
|
#endif
|
|
|
|
} else {
|
|
rc = ldap_bind_s( si->si_ld,
|
|
si->si_binddn, si->si_passwd, si->si_bindmethod );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep1: "
|
|
"ldap_bind_s failed (%d)\n", rc, 0, 0 );
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
/* Set SSF to strongest of TLS, SASL SSFs */
|
|
op->o_sasl_ssf = 0;
|
|
op->o_tls_ssf = 0;
|
|
op->o_transport_ssf = 0;
|
|
#ifdef HAVE_TLS
|
|
if ( ldap_get_option( si->si_ld, LDAP_OPT_X_TLS_SSL_CTX, &ssl )
|
|
== LDAP_SUCCESS && ssl != NULL )
|
|
{
|
|
op->o_tls_ssf = ldap_pvt_tls_get_strength( ssl );
|
|
}
|
|
#endif /* HAVE_TLS */
|
|
ldap_get_option( si->si_ld, LDAP_OPT_X_SASL_SSF, &op->o_sasl_ssf );
|
|
op->o_ssf = ( op->o_sasl_ssf > op->o_tls_ssf )
|
|
? op->o_sasl_ssf : op->o_tls_ssf;
|
|
|
|
/* get syncrepl cookie of shadow replica from subentry */
|
|
assert( si->si_rid < 1000 );
|
|
syncrepl_cn_bv.bv_val = syncrepl_cbuf;
|
|
syncrepl_cn_bv.bv_len = snprintf( syncrepl_cbuf, sizeof(syncrepl_cbuf),
|
|
CN_STR "syncrepl%ld", si->si_rid );
|
|
build_new_dn( &op->o_req_ndn, psub, &syncrepl_cn_bv, op->o_tmpmemctx );
|
|
op->o_req_dn = op->o_req_ndn;
|
|
|
|
LDAP_STAILQ_FOREACH( sc, &slap_sync_cookie, sc_next ) {
|
|
if ( si->si_rid == sc->rid ) {
|
|
cmdline_cookie_found = 1;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if ( cmdline_cookie_found ) {
|
|
/* cookie is supplied in the command line */
|
|
BerVarray cookie = NULL;
|
|
struct berval cookie_bv;
|
|
|
|
LDAP_STAILQ_REMOVE( &slap_sync_cookie, sc, sync_cookie, sc_next );
|
|
slap_sync_cookie_free( &si->si_syncCookie, 0 );
|
|
|
|
/* read stored cookie if it exists */
|
|
backend_attribute( op, NULL, &op->o_req_ndn,
|
|
slap_schema.si_ad_syncreplCookie, &cookie, ACL_READ );
|
|
|
|
if ( !cookie ) {
|
|
/* no stored cookie */
|
|
if ( sc->ctxcsn == NULL ||
|
|
BER_BVISNULL( sc->ctxcsn ) ) {
|
|
/* if cmdline cookie does not have ctxcsn */
|
|
/* component, set it to an initial value */
|
|
slap_init_sync_cookie_ctxcsn( sc );
|
|
}
|
|
slap_dup_sync_cookie( &si->si_syncCookie, sc );
|
|
slap_sync_cookie_free( sc, 1 );
|
|
sc = NULL;
|
|
|
|
} else {
|
|
/* stored cookie */
|
|
struct berval newcookie = BER_BVNULL;
|
|
ber_dupbv( &cookie_bv, &cookie[0] );
|
|
ber_bvarray_add( &si->si_syncCookie.octet_str, &cookie_bv );
|
|
slap_parse_sync_cookie( &si->si_syncCookie );
|
|
ber_bvarray_free( si->si_syncCookie.octet_str );
|
|
si->si_syncCookie.octet_str = NULL;
|
|
ber_bvarray_free_x( cookie, op->o_tmpmemctx );
|
|
if ( sc->sid != -1 ) {
|
|
/* command line cookie wins */
|
|
si->si_syncCookie.sid = sc->sid;
|
|
}
|
|
if ( sc->ctxcsn != NULL ) {
|
|
/* command line cookie wins */
|
|
if ( si->si_syncCookie.ctxcsn ) {
|
|
ber_bvarray_free( si->si_syncCookie.ctxcsn );
|
|
si->si_syncCookie.ctxcsn = NULL;
|
|
}
|
|
ber_dupbv( &cookie_bv, &sc->ctxcsn[0] );
|
|
ber_bvarray_add( &si->si_syncCookie.ctxcsn, &cookie_bv );
|
|
}
|
|
if ( sc->rid != -1 ) {
|
|
/* command line cookie wins */
|
|
si->si_syncCookie.rid = sc->rid;
|
|
}
|
|
slap_sync_cookie_free( sc, 1 );
|
|
sc = NULL;
|
|
slap_compose_sync_cookie( NULL, &newcookie,
|
|
&si->si_syncCookie.ctxcsn[0],
|
|
si->si_syncCookie.sid, si->si_syncCookie.rid );
|
|
ber_bvarray_add( &si->si_syncCookie.octet_str, &newcookie );
|
|
}
|
|
|
|
} else {
|
|
/* no command line cookie is specified */
|
|
if ( si->si_syncCookie.octet_str == NULL ) {
|
|
BerVarray cookie = NULL;
|
|
struct berval cookie_bv;
|
|
/* try to read stored cookie */
|
|
backend_attribute( op, NULL, &op->o_req_ndn,
|
|
slap_schema.si_ad_syncreplCookie, &cookie, ACL_READ );
|
|
if ( cookie ) {
|
|
ber_dupbv( &cookie_bv, &cookie[0] );
|
|
ber_bvarray_add( &si->si_syncCookie.octet_str, &cookie_bv );
|
|
slap_parse_sync_cookie( &si->si_syncCookie );
|
|
ber_bvarray_free_x( cookie, op->o_tmpmemctx );
|
|
}
|
|
}
|
|
}
|
|
|
|
rc = ldap_sync_search( si, op->o_tmpmemctx );
|
|
|
|
if( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep1: "
|
|
"ldap_search_ext: %s (%d)\n", ldap_err2string( rc ), rc, 0 );
|
|
}
|
|
|
|
done:
|
|
if ( rc ) {
|
|
if ( si->si_ld ) {
|
|
ldap_unbind( si->si_ld );
|
|
si->si_ld = NULL;
|
|
}
|
|
}
|
|
|
|
slap_sl_free( op->o_req_ndn.bv_val, op->o_tmpmemctx );
|
|
|
|
return rc;
|
|
}
|
|
|
|
static int
|
|
do_syncrep2(
|
|
Operation *op,
|
|
syncinfo_t *si )
|
|
{
|
|
LDAPControl **rctrls = NULL;
|
|
LDAPControl *rctrlp;
|
|
|
|
BerElementBuffer berbuf;
|
|
BerElement *ber = (BerElement *)&berbuf;
|
|
|
|
LDAPMessage *res = NULL;
|
|
LDAPMessage *msg = NULL;
|
|
|
|
char *retoid = NULL;
|
|
struct berval *retdata = NULL;
|
|
|
|
Entry *entry = NULL;
|
|
|
|
int syncstate;
|
|
struct berval syncUUID = BER_BVNULL;
|
|
struct sync_cookie syncCookie = { NULL, -1, NULL };
|
|
struct sync_cookie syncCookie_req = { NULL, -1, NULL };
|
|
struct berval cookie = BER_BVNULL;
|
|
|
|
int rc, err, i;
|
|
ber_len_t len;
|
|
|
|
int rc_efree = 1;
|
|
|
|
struct berval *psub;
|
|
Modifications *modlist = NULL;
|
|
|
|
const char *text;
|
|
int match;
|
|
|
|
struct timeval *tout_p = NULL;
|
|
struct timeval tout = { 0, 0 };
|
|
|
|
int refreshDeletes = 0;
|
|
int refreshDone = 1;
|
|
BerVarray syncUUIDs = NULL;
|
|
ber_tag_t si_tag;
|
|
|
|
if ( slapd_shutdown ) {
|
|
rc = -2;
|
|
goto done;
|
|
}
|
|
|
|
ber_init2( ber, NULL, LBER_USE_DER );
|
|
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "=>do_syncrep2\n", 0, 0, 0 );
|
|
|
|
psub = &si->si_be->be_nsuffix[0];
|
|
|
|
slap_dup_sync_cookie( &syncCookie_req, &si->si_syncCookie );
|
|
|
|
if ( abs(si->si_type) == LDAP_SYNC_REFRESH_AND_PERSIST ) {
|
|
tout_p = &tout;
|
|
} else {
|
|
tout_p = NULL;
|
|
}
|
|
|
|
while (( rc = ldap_result( si->si_ld, LDAP_RES_ANY, LDAP_MSG_ONE,
|
|
tout_p, &res )) > 0 )
|
|
{
|
|
if ( slapd_shutdown ) {
|
|
rc = -2;
|
|
goto done;
|
|
}
|
|
for( msg = ldap_first_message( si->si_ld, res );
|
|
msg != NULL;
|
|
msg = ldap_next_message( si->si_ld, msg ) )
|
|
{
|
|
switch( ldap_msgtype( msg ) ) {
|
|
case LDAP_RES_SEARCH_ENTRY:
|
|
ldap_get_entry_controls( si->si_ld, msg, &rctrls );
|
|
/* we can't work without the control */
|
|
if ( !rctrls ) {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep2: "
|
|
"got search entry without "
|
|
"control\n", 0, 0, 0 );
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
rctrlp = *rctrls;
|
|
ber_init2( ber, &rctrlp->ldctl_value, LBER_USE_DER );
|
|
ber_scanf( ber, "{em" /*"}"*/, &syncstate, &syncUUID );
|
|
if ( ber_peek_tag( ber, &len ) == LDAP_TAG_SYNC_COOKIE ) {
|
|
ber_scanf( ber, /*"{"*/ "m}", &cookie );
|
|
if ( !BER_BVISNULL( &cookie ) ) {
|
|
struct berval tmp_bv;
|
|
ber_dupbv( &tmp_bv, &cookie );
|
|
ber_bvarray_add( &syncCookie.octet_str, &tmp_bv );
|
|
}
|
|
if ( syncCookie.octet_str &&
|
|
!BER_BVISNULL( &syncCookie.octet_str[0] ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie );
|
|
}
|
|
}
|
|
if ( syncrepl_message_to_entry( si, op, msg,
|
|
&modlist, &entry, syncstate ) == LDAP_SUCCESS ) {
|
|
rc_efree = syncrepl_entry( si, op, entry, &modlist,
|
|
syncstate, &syncUUID, &syncCookie_req, syncCookie.ctxcsn );
|
|
if ( syncCookie.octet_str &&
|
|
!BER_BVISNULL( &syncCookie.octet_str[0] ) )
|
|
{
|
|
syncrepl_updateCookie( si, op, psub, &syncCookie );
|
|
}
|
|
}
|
|
ldap_controls_free( rctrls );
|
|
if ( modlist ) {
|
|
slap_mods_free( modlist );
|
|
}
|
|
if ( rc_efree && entry ) {
|
|
entry_free( entry );
|
|
}
|
|
entry = NULL;
|
|
break;
|
|
|
|
case LDAP_RES_SEARCH_REFERENCE:
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"do_syncrep2: reference received error\n", 0, 0, 0 );
|
|
break;
|
|
|
|
case LDAP_RES_SEARCH_RESULT:
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"do_syncrep2: LDAP_RES_SEARCH_RESULT\n", 0, 0, 0 );
|
|
ldap_parse_result( si->si_ld, msg, &err, NULL, NULL, NULL,
|
|
&rctrls, 0 );
|
|
if ( rctrls ) {
|
|
rctrlp = *rctrls;
|
|
ber_init2( ber, &rctrlp->ldctl_value, LBER_USE_DER );
|
|
|
|
ber_scanf( ber, "{" /*"}"*/);
|
|
if ( ber_peek_tag( ber, &len ) == LDAP_TAG_SYNC_COOKIE ) {
|
|
ber_scanf( ber, "m", &cookie );
|
|
if ( !BER_BVISNULL( &cookie ) ) {
|
|
struct berval tmp_bv;
|
|
ber_dupbv( &tmp_bv, &cookie );
|
|
ber_bvarray_add( &syncCookie.octet_str, &tmp_bv);
|
|
}
|
|
if ( syncCookie.octet_str &&
|
|
!BER_BVISNULL( &syncCookie.octet_str[0] ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie );
|
|
}
|
|
}
|
|
if ( ber_peek_tag( ber, &len ) == LDAP_TAG_REFRESHDELETES )
|
|
{
|
|
ber_scanf( ber, "b", &refreshDeletes );
|
|
}
|
|
ber_scanf( ber, /*"{"*/ "}" );
|
|
}
|
|
if ( syncCookie_req.ctxcsn == NULL ) {
|
|
match = -1;
|
|
} else if ( syncCookie.ctxcsn == NULL ) {
|
|
match = 1;
|
|
} else {
|
|
value_match( &match, slap_schema.si_ad_entryCSN,
|
|
slap_schema.si_ad_entryCSN->ad_type->sat_ordering,
|
|
SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
|
|
&syncCookie_req.ctxcsn[0], &syncCookie.ctxcsn[0],
|
|
&text );
|
|
}
|
|
if ( syncCookie.octet_str && !BER_BVISNULL( syncCookie.octet_str ) &&
|
|
match < 0 && err == LDAP_SUCCESS )
|
|
{
|
|
syncrepl_updateCookie( si, op, psub, &syncCookie );
|
|
}
|
|
if ( rctrls ) {
|
|
ldap_controls_free( rctrls );
|
|
}
|
|
if (si->si_type != LDAP_SYNC_REFRESH_AND_PERSIST) {
|
|
/* FIXME : different error behaviors according to
|
|
* 1) err code : LDAP_BUSY ...
|
|
* 2) on err policy : stop service, stop sync, retry
|
|
*/
|
|
if ( refreshDeletes == 0 && match < 0 &&
|
|
err == LDAP_SUCCESS )
|
|
{
|
|
syncrepl_del_nonpresent( op, si, NULL );
|
|
} else {
|
|
avl_free( si->si_presentlist, avl_ber_bvfree );
|
|
si->si_presentlist = NULL;
|
|
}
|
|
}
|
|
rc = -2;
|
|
goto done;
|
|
break;
|
|
|
|
case LDAP_RES_INTERMEDIATE:
|
|
rc = ldap_parse_intermediate( si->si_ld, msg,
|
|
&retoid, &retdata, NULL, 0 );
|
|
if ( !rc && !strcmp( retoid, LDAP_SYNC_INFO ) ) {
|
|
ber_init2( ber, retdata, LBER_USE_DER );
|
|
|
|
switch ( si_tag = ber_peek_tag( ber, &len )) {
|
|
ber_tag_t tag;
|
|
case LDAP_TAG_SYNC_NEW_COOKIE:
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"do_syncrep2: %s - %s%s\n",
|
|
"LDAP_RES_INTERMEDIATE",
|
|
"NEW_COOKIE", "\n" );
|
|
ber_scanf( ber, "tm", &tag, &cookie );
|
|
break;
|
|
case LDAP_TAG_SYNC_REFRESH_DELETE:
|
|
case LDAP_TAG_SYNC_REFRESH_PRESENT:
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"do_syncrep2: %s - %s%s\n",
|
|
"LDAP_RES_INTERMEDIATE",
|
|
si_tag == LDAP_TAG_SYNC_REFRESH_PRESENT ?
|
|
"REFRESH_PRESENT" : "REFRESH_DELETE",
|
|
"\n" );
|
|
if ( si_tag == LDAP_TAG_SYNC_REFRESH_DELETE ) {
|
|
si->si_refreshDelete = 1;
|
|
} else {
|
|
si->si_refreshPresent = 1;
|
|
}
|
|
ber_scanf( ber, "t{" /*"}"*/, &tag );
|
|
if ( ber_peek_tag( ber, &len ) == LDAP_TAG_SYNC_COOKIE )
|
|
{
|
|
ber_scanf( ber, "m", &cookie );
|
|
if ( !BER_BVISNULL( &cookie ) ) {
|
|
struct berval tmp_bv;
|
|
ber_dupbv( &tmp_bv, &cookie );
|
|
ber_bvarray_add( &syncCookie.octet_str,
|
|
&tmp_bv);
|
|
}
|
|
if ( syncCookie.octet_str &&
|
|
!BER_BVISNULL( &syncCookie.octet_str[0] ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie );
|
|
}
|
|
}
|
|
if ( ber_peek_tag( ber, &len ) ==
|
|
LDAP_TAG_REFRESHDONE )
|
|
{
|
|
ber_scanf( ber, "b", &refreshDone );
|
|
}
|
|
ber_scanf( ber, /*"{"*/ "}" );
|
|
break;
|
|
case LDAP_TAG_SYNC_ID_SET:
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"do_syncrep2: %s - %s%s\n",
|
|
"LDAP_RES_INTERMEDIATE",
|
|
"SYNC_ID_SET",
|
|
"\n" );
|
|
ber_scanf( ber, "t{" /*"}"*/, &tag );
|
|
if ( ber_peek_tag( ber, &len ) ==
|
|
LDAP_TAG_SYNC_COOKIE )
|
|
{
|
|
ber_scanf( ber, "m", &cookie );
|
|
if ( !BER_BVISNULL( &cookie ) ) {
|
|
struct berval tmp_bv;
|
|
ber_dupbv( &tmp_bv, &cookie );
|
|
ber_bvarray_add( &syncCookie.octet_str,
|
|
&tmp_bv );
|
|
}
|
|
if ( syncCookie.octet_str &&
|
|
!BER_BVISNULL( &syncCookie.octet_str[0] ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie );
|
|
}
|
|
}
|
|
if ( ber_peek_tag( ber, &len ) ==
|
|
LDAP_TAG_REFRESHDELETES )
|
|
{
|
|
ber_scanf( ber, "b", &refreshDeletes );
|
|
}
|
|
ber_scanf( ber, "[W]", &syncUUIDs );
|
|
ber_scanf( ber, /*"{"*/ "}" );
|
|
if ( refreshDeletes ) {
|
|
syncrepl_del_nonpresent( op, si, syncUUIDs );
|
|
ber_bvarray_free_x( syncUUIDs, op->o_tmpmemctx );
|
|
} else {
|
|
for ( i = 0; !BER_BVISNULL( &syncUUIDs[i] ); i++ ) {
|
|
struct berval *syncuuid_bv;
|
|
syncuuid_bv = ber_dupbv( NULL, &syncUUIDs[i] );
|
|
slap_sl_free( syncUUIDs[i].bv_val,op->o_tmpmemctx );
|
|
avl_insert( &si->si_presentlist,
|
|
(caddr_t) syncuuid_bv,
|
|
syncuuid_cmp, avl_dup_error );
|
|
}
|
|
slap_sl_free( syncUUIDs, op->o_tmpmemctx );
|
|
}
|
|
break;
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"do_syncrep2 : unknown syncinfo tag (%ld)\n",
|
|
(long) si_tag, 0, 0 );
|
|
ldap_memfree( retoid );
|
|
ber_bvfree( retdata );
|
|
continue;
|
|
}
|
|
|
|
if ( syncCookie_req.ctxcsn == NULL ) {
|
|
match = -1;
|
|
} else if ( syncCookie.ctxcsn == NULL ) {
|
|
match = 1;
|
|
} else {
|
|
value_match( &match, slap_schema.si_ad_entryCSN,
|
|
slap_schema.si_ad_entryCSN->ad_type->sat_ordering,
|
|
SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
|
|
&syncCookie_req.ctxcsn[0],
|
|
&syncCookie.ctxcsn[0], &text );
|
|
}
|
|
|
|
if ( syncCookie.ctxcsn && !BER_BVISNULL( &syncCookie.ctxcsn[0] ) &&
|
|
match < 0 )
|
|
{
|
|
syncrepl_updateCookie( si, op, psub, &syncCookie);
|
|
}
|
|
|
|
if ( si->si_refreshPresent == 1 ) {
|
|
if ( match < 0 ) {
|
|
syncrepl_del_nonpresent( op, si, NULL );
|
|
}
|
|
}
|
|
|
|
ldap_memfree( retoid );
|
|
ber_bvfree( retdata );
|
|
break;
|
|
|
|
} else {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep2 : "
|
|
"unknown intermediate response (%d)\n",
|
|
rc, 0, 0 );
|
|
ldap_memfree( retoid );
|
|
ber_bvfree( retdata );
|
|
break;
|
|
}
|
|
break;
|
|
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep2 : "
|
|
"unknown message\n", 0, 0, 0 );
|
|
break;
|
|
|
|
}
|
|
if ( syncCookie.octet_str ) {
|
|
slap_sync_cookie_free( &syncCookie_req, 0 );
|
|
slap_dup_sync_cookie( &syncCookie_req, &syncCookie );
|
|
slap_sync_cookie_free( &syncCookie, 0 );
|
|
}
|
|
}
|
|
ldap_msgfree( res );
|
|
res = NULL;
|
|
}
|
|
|
|
if ( rc == -1 ) {
|
|
const char *errstr;
|
|
|
|
ldap_get_option( si->si_ld, LDAP_OPT_ERROR_NUMBER, &rc );
|
|
errstr = ldap_err2string( rc );
|
|
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"do_syncrep2 : %s\n", errstr, 0, 0 );
|
|
}
|
|
|
|
done:
|
|
slap_sync_cookie_free( &syncCookie, 0 );
|
|
slap_sync_cookie_free( &syncCookie_req, 0 );
|
|
|
|
if ( res ) ldap_msgfree( res );
|
|
|
|
if ( rc && si->si_ld ) {
|
|
ldap_unbind( si->si_ld );
|
|
si->si_ld = NULL;
|
|
}
|
|
|
|
return rc;
|
|
}
|
|
|
|
void *
|
|
do_syncrepl(
|
|
void *ctx,
|
|
void *arg )
|
|
{
|
|
struct re_s* rtask = arg;
|
|
syncinfo_t *si = ( syncinfo_t * ) rtask->arg;
|
|
Connection conn = {0};
|
|
char opbuf[OPERATION_BUFFER_SIZE];
|
|
Operation *op;
|
|
int rc = LDAP_SUCCESS;
|
|
int first = 0;
|
|
int dostop = 0;
|
|
ber_socket_t s;
|
|
int i, defer = 1;
|
|
Backend *be;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "=>do_syncrepl\n", 0, 0, 0 );
|
|
|
|
if ( si == NULL )
|
|
return NULL;
|
|
|
|
switch( abs( si->si_type )) {
|
|
case LDAP_SYNC_REFRESH_ONLY:
|
|
case LDAP_SYNC_REFRESH_AND_PERSIST:
|
|
break;
|
|
default:
|
|
return NULL;
|
|
}
|
|
|
|
if ( slapd_shutdown ) {
|
|
if ( si->si_ld ) {
|
|
ldap_get_option( si->si_ld, LDAP_OPT_DESC, &s );
|
|
connection_client_stop( s );
|
|
ldap_unbind( si->si_ld );
|
|
si->si_ld = NULL;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
op = (Operation *)opbuf;
|
|
connection_fake_init( &conn, op, ctx );
|
|
|
|
/* use global malloc for now */
|
|
op->o_tmpmemctx = NULL;
|
|
op->o_tmpmfuncs = &ch_mfuncs;
|
|
|
|
op->o_dn = si->si_updatedn;
|
|
op->o_ndn = si->si_updatedn;
|
|
op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
|
|
op->o_bd = be = si->si_be;
|
|
|
|
/* Establish session, do search */
|
|
if ( !si->si_ld ) {
|
|
first = 1;
|
|
si->si_refreshDelete = 0;
|
|
si->si_refreshPresent = 0;
|
|
rc = do_syncrep1( op, si );
|
|
}
|
|
|
|
/* Process results */
|
|
if ( rc == LDAP_SUCCESS ) {
|
|
ldap_get_option( si->si_ld, LDAP_OPT_DESC, &s );
|
|
|
|
rc = do_syncrep2( op, si );
|
|
|
|
if ( abs(si->si_type) == LDAP_SYNC_REFRESH_AND_PERSIST ) {
|
|
/* If we succeeded, enable the connection for further listening.
|
|
* If we failed, tear down the connection and reschedule.
|
|
*/
|
|
if ( rc == LDAP_SUCCESS ) {
|
|
if ( first ) {
|
|
rc = connection_client_setup( s, do_syncrepl, arg );
|
|
} else {
|
|
connection_client_enable( s );
|
|
}
|
|
} else if ( !first ) {
|
|
dostop = 1;
|
|
}
|
|
} else {
|
|
if ( rc == -2 ) rc = 0;
|
|
}
|
|
}
|
|
|
|
/* At this point, we have 4 cases:
|
|
* 1) for any hard failure, give up and remove this task
|
|
* 2) for ServerDown, reschedule this task to run
|
|
* 3) for Refresh and Success, reschedule to run
|
|
* 4) for Persist and Success, reschedule to defer
|
|
*/
|
|
ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
|
|
|
|
if ( ldap_pvt_runqueue_isrunning( &slapd_rq, rtask )) {
|
|
ldap_pvt_runqueue_stoptask( &slapd_rq, rtask );
|
|
}
|
|
|
|
if ( dostop ) {
|
|
connection_client_stop( s );
|
|
}
|
|
|
|
if ( rc == LDAP_SUCCESS ) {
|
|
if ( si->si_type == LDAP_SYNC_REFRESH_ONLY ) {
|
|
defer = 0;
|
|
}
|
|
rtask->interval.tv_sec = si->si_interval;
|
|
ldap_pvt_runqueue_resched( &slapd_rq, rtask, defer );
|
|
if ( si->si_retrynum ) {
|
|
for ( i = 0; si->si_retrynum_init[i] != -2; i++ ) {
|
|
si->si_retrynum[i] = si->si_retrynum_init[i];
|
|
}
|
|
si->si_retrynum[i] = -2;
|
|
}
|
|
} else {
|
|
for ( i = 0; si->si_retrynum && si->si_retrynum[i] <= 0; i++ ) {
|
|
if ( si->si_retrynum[i] == -1 || si->si_retrynum[i] == -2 )
|
|
break;
|
|
}
|
|
|
|
if ( !si->si_retrynum || si->si_retrynum[i] == -2 ) {
|
|
ldap_pvt_runqueue_remove( &slapd_rq, rtask );
|
|
LDAP_STAILQ_REMOVE( &be->be_syncinfo, si, syncinfo_s, si_next );
|
|
syncinfo_free( si );
|
|
} else if ( si->si_retrynum[i] >= -1 ) {
|
|
if ( si->si_retrynum[i] > 0 )
|
|
si->si_retrynum[i]--;
|
|
rtask->interval.tv_sec = si->si_retryinterval[i];
|
|
ldap_pvt_runqueue_resched( &slapd_rq, rtask, 0 );
|
|
slap_wake_listener();
|
|
}
|
|
}
|
|
|
|
ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
|
|
|
|
return NULL;
|
|
}
|
|
|
|
int
|
|
syncrepl_message_to_entry(
|
|
syncinfo_t *si,
|
|
Operation *op,
|
|
LDAPMessage *msg,
|
|
Modifications **modlist,
|
|
Entry **entry,
|
|
int syncstate
|
|
)
|
|
{
|
|
Entry *e = NULL;
|
|
BerElement *ber = NULL;
|
|
Modifications tmp;
|
|
Modifications *mod;
|
|
Modifications **modtail = modlist;
|
|
|
|
const char *text;
|
|
char txtbuf[SLAP_TEXT_BUFLEN];
|
|
size_t textlen = sizeof txtbuf;
|
|
|
|
struct berval bdn = {0, NULL}, dn, ndn;
|
|
int rc;
|
|
|
|
*modlist = NULL;
|
|
|
|
if ( ldap_msgtype( msg ) != LDAP_RES_SEARCH_ENTRY ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"Message type should be entry (%d)", ldap_msgtype( msg ), 0, 0 );
|
|
return -1;
|
|
}
|
|
|
|
op->o_tag = LDAP_REQ_ADD;
|
|
|
|
rc = ldap_get_dn_ber( si->si_ld, msg, &ber, &bdn );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_message_to_entry : dn get failed (%d)", rc, 0, 0 );
|
|
return rc;
|
|
}
|
|
|
|
dnPrettyNormal( NULL, &bdn, &dn, &ndn, op->o_tmpmemctx );
|
|
ber_dupbv( &op->o_req_dn, &dn );
|
|
ber_dupbv( &op->o_req_ndn, &ndn );
|
|
slap_sl_free( ndn.bv_val, op->o_tmpmemctx );
|
|
slap_sl_free( dn.bv_val, op->o_tmpmemctx );
|
|
|
|
if ( syncstate == LDAP_SYNC_PRESENT || syncstate == LDAP_SYNC_DELETE ) {
|
|
if ( entry )
|
|
*entry = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
if ( entry == NULL ) {
|
|
return -1;
|
|
}
|
|
|
|
e = ( Entry * ) ch_calloc( 1, sizeof( Entry ) );
|
|
*entry = e;
|
|
e->e_name = op->o_req_dn;
|
|
e->e_nname = op->o_req_ndn;
|
|
|
|
while ( ber_remaining( ber ) ) {
|
|
if ( (ber_scanf( ber, "{mW}", &tmp.sml_type, &tmp.sml_values ) ==
|
|
LBER_ERROR ) || BER_BVISNULL( &tmp.sml_type ) )
|
|
{
|
|
break;
|
|
}
|
|
|
|
mod = (Modifications *) ch_malloc( sizeof( Modifications ));
|
|
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_next = NULL;
|
|
mod->sml_desc = NULL;
|
|
mod->sml_type = tmp.sml_type;
|
|
mod->sml_values = tmp.sml_values;
|
|
mod->sml_nvalues = NULL;
|
|
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
}
|
|
|
|
if ( *modlist == NULL ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_entry: no attributes\n",
|
|
0, 0, 0 );
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
|
|
rc = slap_mods_check( *modlist, &text, txtbuf, textlen, NULL );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_entry: mods check (%s)\n",
|
|
text, 0, 0 );
|
|
goto done;
|
|
}
|
|
|
|
/* Strip out dynamically generated attrs */
|
|
for ( modtail = modlist; *modtail ; ) {
|
|
mod = *modtail;
|
|
if ( mod->sml_desc->ad_type->sat_flags & SLAP_AT_DYNAMIC ) {
|
|
*modtail = mod->sml_next;
|
|
slap_mod_free( &mod->sml_mod, 0 );
|
|
ch_free( mod );
|
|
} else {
|
|
modtail = &mod->sml_next;
|
|
}
|
|
}
|
|
|
|
/* Strip out attrs in exattrs list */
|
|
for ( modtail = modlist; *modtail ; ) {
|
|
mod = *modtail;
|
|
if ( ldap_charray_inlist( si->si_exattrs,
|
|
mod->sml_desc->ad_type->sat_cname.bv_val )) {
|
|
*modtail = mod->sml_next;
|
|
slap_mod_free( &mod->sml_mod, 0 );
|
|
ch_free( mod );
|
|
} else {
|
|
modtail = &mod->sml_next;
|
|
}
|
|
}
|
|
|
|
rc = slap_mods2entry( *modlist, &e, 1, 1, &text, txtbuf, textlen);
|
|
if( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_entry: mods2entry (%s)\n",
|
|
text, 0, 0 );
|
|
}
|
|
|
|
done:
|
|
ber_free ( ber, 0 );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
if ( e ) {
|
|
entry_free( e );
|
|
*entry = e = NULL;
|
|
}
|
|
}
|
|
|
|
return rc;
|
|
}
|
|
|
|
static struct berval generic_filterstr = BER_BVC("(objectclass=*)");
|
|
|
|
/* During a refresh, we may get an LDAP_SYNC_ADD for an already existing
|
|
* entry if a previous refresh was interrupted before sending us a new
|
|
* context state. We try to compare the new entry to the existing entry
|
|
* and ignore the new entry if they are the same.
|
|
*
|
|
* Also, we may get an update where the entryDN has changed, due to
|
|
* a ModDn on the provider. We detect this as well, so we can issue
|
|
* the corresponding operation locally.
|
|
*
|
|
* In the case of a modify, we get a list of all the attributes
|
|
* in the original entry. Rather than deleting the entry and re-adding it,
|
|
* we issue a Modify request that deletes all the attributes and adds all
|
|
* the new ones. This avoids the issue of trying to delete/add a non-leaf
|
|
* entry.
|
|
*
|
|
* We don't try to otherwise distinguish ModDN from Modify; in the case of
|
|
* a ModDN we will issue both operations on the local database.
|
|
*/
|
|
typedef struct dninfo {
|
|
Entry *new_entry;
|
|
struct berval dn;
|
|
struct berval ndn;
|
|
int renamed; /* Was an existing entry renamed? */
|
|
int wasChanged; /* are the attributes changed? */
|
|
int attrs; /* how many attribute types are in the ads list */
|
|
AttributeDescription **ads;
|
|
} dninfo;
|
|
|
|
int
|
|
syncrepl_entry(
|
|
syncinfo_t* si,
|
|
Operation *op,
|
|
Entry* entry,
|
|
Modifications** modlist,
|
|
int syncstate,
|
|
struct berval* syncUUID,
|
|
struct sync_cookie* syncCookie_req,
|
|
struct berval* syncCSN )
|
|
{
|
|
Backend *be = op->o_bd;
|
|
slap_callback cb = { NULL };
|
|
struct berval *syncuuid_bv = NULL;
|
|
struct berval syncUUID_strrep = BER_BVNULL;
|
|
struct berval uuid_bv = BER_BVNULL;
|
|
|
|
SlapReply rs_search = {REP_RESULT};
|
|
SlapReply rs_delete = {REP_RESULT};
|
|
SlapReply rs_add = {REP_RESULT};
|
|
SlapReply rs_modify = {REP_RESULT};
|
|
Filter f = {0};
|
|
AttributeAssertion ava = {0};
|
|
int rc = LDAP_SUCCESS;
|
|
int ret = LDAP_SUCCESS;
|
|
|
|
struct berval pdn = BER_BVNULL;
|
|
struct berval org_req_dn = BER_BVNULL;
|
|
struct berval org_req_ndn = BER_BVNULL;
|
|
struct berval org_dn = BER_BVNULL;
|
|
struct berval org_ndn = BER_BVNULL;
|
|
int org_managedsait;
|
|
dninfo dni = {0};
|
|
int retry = 1;
|
|
|
|
switch( syncstate ) {
|
|
case LDAP_SYNC_PRESENT:
|
|
Debug( LDAP_DEBUG_SYNC, "%s: %s\n",
|
|
"syncrepl_entry",
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_PRESENT)", 0 );
|
|
break;
|
|
case LDAP_SYNC_ADD:
|
|
Debug( LDAP_DEBUG_SYNC, "%s: %s\n",
|
|
"syncrepl_entry",
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_ADD)", 0 );
|
|
break;
|
|
case LDAP_SYNC_DELETE:
|
|
Debug( LDAP_DEBUG_SYNC, "%s: %s\n",
|
|
"syncrepl_entry",
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_DELETE)", 0 );
|
|
break;
|
|
case LDAP_SYNC_MODIFY:
|
|
Debug( LDAP_DEBUG_SYNC, "%s: %s\n",
|
|
"syncrepl_entry",
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_MODIFY)", 0 );
|
|
break;
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s\n",
|
|
"syncrepl_entry",
|
|
"LDAP_RES_SEARCH_ENTRY(UNKNOWN syncstate)", 0 );
|
|
}
|
|
|
|
if (( syncstate == LDAP_SYNC_PRESENT || syncstate == LDAP_SYNC_ADD )) {
|
|
if ( !si->si_refreshPresent ) {
|
|
syncuuid_bv = ber_dupbv( NULL, syncUUID );
|
|
avl_insert( &si->si_presentlist, (caddr_t) syncuuid_bv,
|
|
syncuuid_cmp, avl_dup_error );
|
|
}
|
|
}
|
|
|
|
if ( syncstate == LDAP_SYNC_PRESENT ) {
|
|
return 0;
|
|
} else if ( syncstate != LDAP_SYNC_DELETE ) {
|
|
if ( entry == NULL ) {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
f.f_choice = LDAP_FILTER_EQUALITY;
|
|
f.f_ava = &ava;
|
|
ava.aa_desc = slap_schema.si_ad_entryUUID;
|
|
(void)slap_uuidstr_from_normalized( &syncUUID_strrep, syncUUID, op->o_tmpmemctx );
|
|
ava.aa_value = *syncUUID;
|
|
op->ors_filter = &f;
|
|
|
|
op->ors_filterstr.bv_len = STRLENOF( "entryUUID=" ) + syncUUID->bv_len;
|
|
op->ors_filterstr.bv_val = (char *) slap_sl_malloc(
|
|
op->ors_filterstr.bv_len + 1, op->o_tmpmemctx );
|
|
AC_MEMCPY( op->ors_filterstr.bv_val, "entryUUID=", STRLENOF( "entryUUID=" ) );
|
|
AC_MEMCPY( &op->ors_filterstr.bv_val[STRLENOF( "entryUUID=" )],
|
|
syncUUID->bv_val, syncUUID->bv_len );
|
|
op->ors_filterstr.bv_val[op->ors_filterstr.bv_len] = '\0';
|
|
|
|
op->o_tag = LDAP_REQ_SEARCH;
|
|
op->ors_scope = LDAP_SCOPE_SUBTREE;
|
|
|
|
/* get the entry for this UUID */
|
|
op->o_req_dn = si->si_base;
|
|
op->o_req_ndn = si->si_base;
|
|
|
|
op->o_time = slap_get_time();
|
|
op->ors_tlimit = SLAP_NO_LIMIT;
|
|
op->ors_slimit = 1;
|
|
|
|
op->ors_attrs = slap_anlist_all_attributes;
|
|
op->ors_attrsonly = 0;
|
|
|
|
/* set callback function */
|
|
op->o_callback = &cb;
|
|
cb.sc_response = dn_callback;
|
|
cb.sc_private = &dni;
|
|
dni.new_entry = entry;
|
|
|
|
if ( limits_check( op, &rs_search ) == 0 ) {
|
|
rc = be->be_search( op, &rs_search );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s (%d)\n",
|
|
"be_search", rc, 0 );
|
|
}
|
|
|
|
if ( !BER_BVISNULL( &op->ors_filterstr ) ) {
|
|
slap_sl_free( op->ors_filterstr.bv_val, op->o_tmpmemctx );
|
|
}
|
|
|
|
cb.sc_response = null_callback;
|
|
cb.sc_private = si;
|
|
|
|
if ( entry && entry->e_name.bv_val ) {
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s\n",
|
|
entry->e_name.bv_val, 0, 0 );
|
|
} else {
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s\n",
|
|
dni.dn.bv_val ? dni.dn.bv_val : "(null)", 0, 0 );
|
|
}
|
|
|
|
org_req_dn = op->o_req_dn;
|
|
org_req_ndn = op->o_req_ndn;
|
|
org_dn = op->o_dn;
|
|
org_ndn = op->o_ndn;
|
|
org_managedsait = get_manageDSAit( op );
|
|
op->o_dn = op->o_bd->be_rootdn;
|
|
op->o_ndn = op->o_bd->be_rootndn;
|
|
op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
|
|
|
|
if ( syncstate != LDAP_SYNC_DELETE ) {
|
|
attr_delete( &entry->e_attrs, slap_schema.si_ad_entryUUID );
|
|
attr_merge_one( entry, slap_schema.si_ad_entryUUID,
|
|
&syncUUID_strrep, syncUUID );
|
|
}
|
|
|
|
switch ( syncstate ) {
|
|
case LDAP_SYNC_ADD:
|
|
case LDAP_SYNC_MODIFY:
|
|
retry_add:;
|
|
if ( BER_BVISNULL( &dni.dn )) {
|
|
|
|
op->o_req_dn = entry->e_name;
|
|
op->o_req_ndn = entry->e_nname;
|
|
op->o_tag = LDAP_REQ_ADD;
|
|
op->ora_e = entry;
|
|
|
|
rc = be->be_add( op, &rs_add );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s (%d)\n",
|
|
"be_add", rc, 0 );
|
|
switch ( rs_add.sr_err ) {
|
|
case LDAP_SUCCESS:
|
|
be_entry_release_w( op, entry );
|
|
ret = 0;
|
|
break;
|
|
|
|
case LDAP_REFERRAL:
|
|
/* we assume that LDAP_NO_SUCH_OBJECT is returned
|
|
* only if the suffix entry is not present */
|
|
case LDAP_NO_SUCH_OBJECT:
|
|
syncrepl_add_glue( op, entry );
|
|
ret = 0;
|
|
break;
|
|
|
|
/* if an entry was added via syncrepl_add_glue(),
|
|
* it likely has no entryUUID, so the previous
|
|
* be_search() doesn't find it. In this case,
|
|
* give syncrepl a chance to modify it. Also
|
|
* allow for entries that were recreated with the
|
|
* same DN but a different entryUUID.
|
|
*/
|
|
case LDAP_ALREADY_EXISTS:
|
|
if ( retry ) {
|
|
Operation op2 = *op;
|
|
SlapReply rs2 = { 0 };
|
|
slap_callback cb2 = { 0 };
|
|
|
|
op2.o_tag = LDAP_REQ_SEARCH;
|
|
op2.o_req_dn = entry->e_name;
|
|
op2.o_req_ndn = entry->e_nname;
|
|
op2.ors_scope = LDAP_SCOPE_BASE;
|
|
op2.ors_attrs = slap_anlist_all_attributes;
|
|
op2.ors_attrsonly = 0;
|
|
op2.ors_limit = NULL;
|
|
op2.ors_slimit = 1;
|
|
op2.ors_tlimit = SLAP_NO_LIMIT;
|
|
|
|
f.f_choice = LDAP_FILTER_PRESENT;
|
|
f.f_desc = slap_schema.si_ad_objectClass;
|
|
op2.ors_filter = &f;
|
|
op2.ors_filterstr = generic_filterstr;
|
|
|
|
op2.o_callback = &cb2;
|
|
cb2.sc_response = dn_callback;
|
|
cb2.sc_private = &dni;
|
|
|
|
be->be_search( &op2, &rs2 );
|
|
|
|
retry = 0;
|
|
goto retry_add;
|
|
}
|
|
/* FALLTHRU */
|
|
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_entry : be_add failed (%d)\n",
|
|
rs_add.sr_err, 0, 0 );
|
|
ret = 1;
|
|
break;
|
|
}
|
|
goto done;
|
|
}
|
|
/* FALLTHRU */
|
|
op->o_req_dn = dni.dn;
|
|
op->o_req_ndn = dni.ndn;
|
|
if ( dni.renamed ) {
|
|
struct berval noldp, newp, nnewp;
|
|
|
|
op->o_tag = LDAP_REQ_MODRDN;
|
|
dnRdn( &entry->e_name, &op->orr_newrdn );
|
|
dnRdn( &entry->e_nname, &op->orr_nnewrdn );
|
|
|
|
dnParent( &dni.ndn, &noldp );
|
|
dnParent( &entry->e_nname, &nnewp );
|
|
if ( !dn_match( &noldp, &newp )) {
|
|
dnParent( &entry->e_name, &newp );
|
|
op->orr_newSup = &newp;
|
|
op->orr_nnewSup = &nnewp;
|
|
}
|
|
op->orr_deleteoldrdn = 0;
|
|
rc = be->be_modrdn( op, &rs_modify );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s (%d)\n",
|
|
"be_modrdn", rc, 0 );
|
|
if ( rs_modify.sr_err == LDAP_SUCCESS ) {
|
|
op->o_req_dn = entry->e_name;
|
|
op->o_req_ndn = entry->e_nname;
|
|
} else {
|
|
ret = 1;
|
|
goto done;
|
|
}
|
|
}
|
|
if ( dni.wasChanged ) {
|
|
Modifications *mod, *modhead = NULL;
|
|
Modifications *modtail = NULL;
|
|
int i;
|
|
|
|
op->o_tag = LDAP_REQ_MODIFY;
|
|
|
|
assert( *modlist );
|
|
|
|
/* Delete all the old attrs */
|
|
for ( i = 0; i < dni.attrs; i++ ) {
|
|
mod = ch_malloc( sizeof( Modifications ) );
|
|
mod->sml_op = LDAP_MOD_DELETE;
|
|
mod->sml_desc = dni.ads[i];
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = NULL;
|
|
mod->sml_nvalues = NULL;
|
|
if ( !modhead ) modhead = mod;
|
|
if ( modtail ) {
|
|
modtail->sml_next = mod;
|
|
}
|
|
modtail = mod;
|
|
}
|
|
|
|
/* Append passed in list to ours */
|
|
if ( modtail ) {
|
|
modtail->sml_next = *modlist;
|
|
*modlist = modhead;
|
|
} else {
|
|
mod = *modlist;
|
|
}
|
|
|
|
/* Find end of this list */
|
|
for ( ; mod != NULL; mod = mod->sml_next ) {
|
|
modtail = mod;
|
|
}
|
|
|
|
mod = (Modifications *)ch_calloc(1, sizeof(Modifications));
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_desc = slap_schema.si_ad_entryUUID;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
ber_dupbv( &uuid_bv, &syncUUID_strrep );
|
|
ber_bvarray_add( &mod->sml_values, &uuid_bv );
|
|
ber_dupbv( &uuid_bv, syncUUID );
|
|
ber_bvarray_add( &mod->sml_nvalues, &uuid_bv );
|
|
modtail->sml_next = mod;
|
|
|
|
op->o_tag = LDAP_REQ_MODIFY;
|
|
op->orm_modlist = *modlist;
|
|
|
|
rc = be->be_modify( op, &rs_modify );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s (%d)\n",
|
|
"be_modify", rc, 0 );
|
|
if ( rs_modify.sr_err != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_entry : be_modify failed (%d)\n",
|
|
rs_modify.sr_err, 0, 0 );
|
|
}
|
|
}
|
|
ret = 1;
|
|
goto done;
|
|
case LDAP_SYNC_DELETE :
|
|
if ( !BER_BVISNULL( &dni.dn )) {
|
|
op->o_req_dn = dni.dn;
|
|
op->o_req_ndn = dni.ndn;
|
|
op->o_tag = LDAP_REQ_DELETE;
|
|
rc = be->be_delete( op, &rs_delete );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s (%d)\n",
|
|
"be_delete", rc, 0 );
|
|
|
|
while ( rs_delete.sr_err == LDAP_SUCCESS
|
|
&& op->o_delete_glue_parent ) {
|
|
op->o_delete_glue_parent = 0;
|
|
if ( !be_issuffix( op->o_bd, &op->o_req_ndn )) {
|
|
slap_callback cb = { NULL };
|
|
cb.sc_response = slap_null_cb;
|
|
dnParent( &op->o_req_ndn, &pdn );
|
|
op->o_req_dn = pdn;
|
|
op->o_req_ndn = pdn;
|
|
op->o_callback = &cb;
|
|
op->o_bd->be_delete( op, &rs_delete );
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
ret = 0;
|
|
goto done;
|
|
|
|
default :
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_entry : unknown syncstate\n", 0, 0, 0 );
|
|
ret = 1;
|
|
goto done;
|
|
}
|
|
|
|
done :
|
|
if ( !BER_BVISNULL( &syncUUID_strrep ) ) {
|
|
slap_sl_free( syncUUID_strrep.bv_val, op->o_tmpmemctx );
|
|
BER_BVZERO( &syncUUID_strrep );
|
|
}
|
|
if ( dni.ads ) {
|
|
op->o_tmpfree( dni.ads, op->o_tmpmemctx );
|
|
}
|
|
if ( !BER_BVISNULL( &dni.ndn ) ) {
|
|
op->o_tmpfree( dni.ndn.bv_val, op->o_tmpmemctx );
|
|
}
|
|
if ( !BER_BVISNULL( &dni.dn ) ) {
|
|
op->o_tmpfree( dni.dn.bv_val, op->o_tmpmemctx );
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
static struct berval gcbva[] = {
|
|
BER_BVC("top"),
|
|
BER_BVC("glue"),
|
|
BER_BVNULL
|
|
};
|
|
|
|
#define NP_DELETE_ONE 2
|
|
|
|
static void
|
|
syncrepl_del_nonpresent(
|
|
Operation *op,
|
|
syncinfo_t *si,
|
|
BerVarray uuids )
|
|
{
|
|
Backend* be = op->o_bd;
|
|
slap_callback cb = { NULL };
|
|
SlapReply rs_search = {REP_RESULT};
|
|
SlapReply rs_delete = {REP_RESULT};
|
|
SlapReply rs_modify = {REP_RESULT};
|
|
struct nonpresent_entry *np_list, *np_prev;
|
|
int rc;
|
|
Modifications *ml;
|
|
Modifications *mlnext;
|
|
Modifications *mod;
|
|
Modifications *modlist = NULL;
|
|
Modifications **modtail;
|
|
AttributeName an[2];
|
|
|
|
struct berval pdn = BER_BVNULL;
|
|
struct berval org_req_dn = BER_BVNULL;
|
|
struct berval org_req_ndn = BER_BVNULL;
|
|
struct berval org_dn = BER_BVNULL;
|
|
struct berval org_ndn = BER_BVNULL;
|
|
int org_managedsait;
|
|
|
|
op->o_req_dn = si->si_base;
|
|
op->o_req_ndn = si->si_base;
|
|
|
|
cb.sc_response = nonpresent_callback;
|
|
cb.sc_private = si;
|
|
|
|
op->o_callback = &cb;
|
|
op->o_tag = LDAP_REQ_SEARCH;
|
|
op->ors_scope = si->si_scope;
|
|
op->ors_deref = LDAP_DEREF_NEVER;
|
|
op->o_time = slap_get_time();
|
|
op->ors_tlimit = SLAP_NO_LIMIT;
|
|
|
|
|
|
if ( uuids ) {
|
|
Filter uf;
|
|
AttributeAssertion eq;
|
|
int i;
|
|
|
|
op->ors_attrsonly = 1;
|
|
op->ors_attrs = slap_anlist_no_attrs;
|
|
op->ors_limit = NULL;
|
|
op->ors_filter = &uf;
|
|
op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
|
|
|
|
uf.f_ava = &eq;
|
|
uf.f_av_desc = slap_schema.si_ad_entryUUID;
|
|
uf.f_next = NULL;
|
|
uf.f_choice = LDAP_FILTER_EQUALITY;
|
|
si->si_refreshDelete |= NP_DELETE_ONE;
|
|
|
|
for (i=0; uuids[i].bv_val; i++) {
|
|
op->ors_slimit = 1;
|
|
uf.f_av_value = uuids[i];
|
|
rc = be->be_search( op, &rs_search );
|
|
}
|
|
si->si_refreshDelete ^= NP_DELETE_ONE;
|
|
} else {
|
|
memset( &an[0], 0, 2 * sizeof( AttributeName ) );
|
|
an[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
|
|
an[0].an_desc = slap_schema.si_ad_entryUUID;
|
|
op->ors_attrs = an;
|
|
op->ors_slimit = SLAP_NO_LIMIT;
|
|
op->ors_attrsonly = 0;
|
|
op->ors_filter = str2filter_x( op, si->si_filterstr.bv_val );
|
|
op->ors_filterstr = si->si_filterstr;
|
|
op->o_nocaching = 1;
|
|
op->o_managedsait = SLAP_CONTROL_NONE;
|
|
|
|
if ( limits_check( op, &rs_search ) == 0 ) {
|
|
rc = be->be_search( op, &rs_search );
|
|
}
|
|
if ( op->ors_filter ) filter_free_x( op, op->ors_filter );
|
|
}
|
|
|
|
op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
|
|
op->o_nocaching = 0;
|
|
|
|
if ( !LDAP_LIST_EMPTY( &si->si_nonpresentlist ) ) {
|
|
np_list = LDAP_LIST_FIRST( &si->si_nonpresentlist );
|
|
while ( np_list != NULL ) {
|
|
LDAP_LIST_REMOVE( np_list, npe_link );
|
|
np_prev = np_list;
|
|
np_list = LDAP_LIST_NEXT( np_list, npe_link );
|
|
op->o_tag = LDAP_REQ_DELETE;
|
|
op->o_callback = &cb;
|
|
cb.sc_response = null_callback;
|
|
cb.sc_private = si;
|
|
op->o_req_dn = *np_prev->npe_name;
|
|
op->o_req_ndn = *np_prev->npe_nname;
|
|
rc = op->o_bd->be_delete( op, &rs_delete );
|
|
|
|
if ( rs_delete.sr_err == LDAP_NOT_ALLOWED_ON_NONLEAF ) {
|
|
modtail = &modlist;
|
|
mod = (Modifications *) ch_calloc( 1, sizeof( Modifications ));
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_desc = slap_schema.si_ad_objectClass;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = &gcbva[0];
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
|
|
mod = (Modifications *) ch_calloc( 1, sizeof( Modifications ));
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_desc = slap_schema.si_ad_structuralObjectClass;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = &gcbva[1];
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
|
|
op->o_tag = LDAP_REQ_MODIFY;
|
|
op->orm_modlist = modlist;
|
|
|
|
rc = be->be_modify( op, &rs_modify );
|
|
|
|
for ( ml = modlist; ml != NULL; ml = mlnext ) {
|
|
mlnext = ml->sml_next;
|
|
free( ml );
|
|
}
|
|
}
|
|
|
|
org_req_dn = op->o_req_dn;
|
|
org_req_ndn = op->o_req_ndn;
|
|
org_dn = op->o_dn;
|
|
org_ndn = op->o_ndn;
|
|
org_managedsait = get_manageDSAit( op );
|
|
op->o_dn = op->o_bd->be_rootdn;
|
|
op->o_ndn = op->o_bd->be_rootndn;
|
|
op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
|
|
|
|
while ( rs_delete.sr_err == LDAP_SUCCESS &&
|
|
op->o_delete_glue_parent ) {
|
|
op->o_delete_glue_parent = 0;
|
|
if ( !be_issuffix( op->o_bd, &op->o_req_ndn )) {
|
|
slap_callback cb = { NULL };
|
|
cb.sc_response = slap_null_cb;
|
|
dnParent( &op->o_req_ndn, &pdn );
|
|
op->o_req_dn = pdn;
|
|
op->o_req_ndn = pdn;
|
|
op->o_callback = &cb;
|
|
/* give it a root privil ? */
|
|
op->o_bd->be_delete( op, &rs_delete );
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
|
|
op->o_managedsait = org_managedsait;
|
|
op->o_dn = org_dn;
|
|
op->o_ndn = org_ndn;
|
|
op->o_req_dn = org_req_dn;
|
|
op->o_req_ndn = org_req_ndn;
|
|
op->o_delete_glue_parent = 0;
|
|
|
|
ber_bvfree( np_prev->npe_name );
|
|
ber_bvfree( np_prev->npe_nname );
|
|
BER_BVZERO( &op->o_req_dn );
|
|
BER_BVZERO( &op->o_req_ndn );
|
|
ch_free( np_prev );
|
|
}
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
syncrepl_add_glue(
|
|
Operation* op,
|
|
Entry *e )
|
|
{
|
|
Backend *be = op->o_bd;
|
|
slap_callback cb = { NULL };
|
|
Attribute *a;
|
|
int rc;
|
|
int suffrdns;
|
|
int i;
|
|
struct berval dn = {0, NULL};
|
|
struct berval ndn = {0, NULL};
|
|
Entry *glue;
|
|
SlapReply rs_add = {REP_RESULT};
|
|
char *ptr, *comma;
|
|
|
|
op->o_tag = LDAP_REQ_ADD;
|
|
op->o_callback = &cb;
|
|
cb.sc_response = null_callback;
|
|
cb.sc_private = NULL;
|
|
|
|
dn = e->e_name;
|
|
ndn = e->e_nname;
|
|
|
|
/* count RDNs in suffix */
|
|
if ( !BER_BVISEMPTY( &be->be_nsuffix[0] ) ) {
|
|
for ( i = 0, ptr = be->be_nsuffix[0].bv_val; ptr; ptr = strchr( ptr, ',' ) ) {
|
|
ptr++;
|
|
i++;
|
|
}
|
|
suffrdns = i;
|
|
} else {
|
|
/* suffix is "" */
|
|
suffrdns = 0;
|
|
}
|
|
|
|
/* Start with BE suffix */
|
|
for ( i = 0, ptr = NULL; i < suffrdns; i++ ) {
|
|
comma = strrchr( dn.bv_val, ',' );
|
|
if ( ptr ) *ptr = ',';
|
|
if ( comma ) *comma = '\0';
|
|
ptr = comma;
|
|
}
|
|
if ( ptr ) {
|
|
*ptr++ = ',';
|
|
dn.bv_len -= ptr - dn.bv_val;
|
|
dn.bv_val = ptr;
|
|
}
|
|
/* the normalizedDNs are always the same length, no counting
|
|
* required.
|
|
*/
|
|
if ( ndn.bv_len > be->be_nsuffix[0].bv_len ) {
|
|
ndn.bv_val += ndn.bv_len - be->be_nsuffix[0].bv_len;
|
|
ndn.bv_len = be->be_nsuffix[0].bv_len;
|
|
}
|
|
|
|
while ( ndn.bv_val > e->e_nname.bv_val ) {
|
|
glue = (Entry *) ch_calloc( 1, sizeof(Entry) );
|
|
ber_dupbv( &glue->e_name, &dn );
|
|
ber_dupbv( &glue->e_nname, &ndn );
|
|
|
|
a = ch_calloc( 1, sizeof( Attribute ));
|
|
a->a_desc = slap_schema.si_ad_objectClass;
|
|
|
|
a->a_vals = ch_calloc( 3, sizeof( struct berval ));
|
|
ber_dupbv( &a->a_vals[0], &gcbva[0] );
|
|
ber_dupbv( &a->a_vals[1], &gcbva[1] );
|
|
ber_dupbv( &a->a_vals[2], &gcbva[2] );
|
|
|
|
a->a_nvals = a->a_vals;
|
|
|
|
a->a_next = glue->e_attrs;
|
|
glue->e_attrs = a;
|
|
|
|
a = ch_calloc( 1, sizeof( Attribute ));
|
|
a->a_desc = slap_schema.si_ad_structuralObjectClass;
|
|
|
|
a->a_vals = ch_calloc( 2, sizeof( struct berval ));
|
|
ber_dupbv( &a->a_vals[0], &gcbva[1] );
|
|
ber_dupbv( &a->a_vals[1], &gcbva[2] );
|
|
|
|
a->a_nvals = a->a_vals;
|
|
|
|
a->a_next = glue->e_attrs;
|
|
glue->e_attrs = a;
|
|
|
|
op->o_req_dn = glue->e_name;
|
|
op->o_req_ndn = glue->e_nname;
|
|
op->ora_e = glue;
|
|
rc = be->be_add ( op, &rs_add );
|
|
if ( rs_add.sr_err == LDAP_SUCCESS ) {
|
|
be_entry_release_w( op, glue );
|
|
} else {
|
|
/* incl. ALREADY EXIST */
|
|
entry_free( glue );
|
|
}
|
|
|
|
/* Move to next child */
|
|
for (ptr = dn.bv_val-2; ptr > e->e_name.bv_val && *ptr != ','; ptr--) {
|
|
/* empty */
|
|
}
|
|
if ( ptr == e->e_name.bv_val ) break;
|
|
dn.bv_val = ++ptr;
|
|
dn.bv_len = e->e_name.bv_len - (ptr-e->e_name.bv_val);
|
|
for( ptr = ndn.bv_val-2;
|
|
ptr > e->e_nname.bv_val && *ptr != ',';
|
|
ptr--)
|
|
{
|
|
/* empty */
|
|
}
|
|
ndn.bv_val = ++ptr;
|
|
ndn.bv_len = e->e_nname.bv_len - (ptr-e->e_nname.bv_val);
|
|
}
|
|
|
|
op->o_req_dn = e->e_name;
|
|
op->o_req_ndn = e->e_nname;
|
|
op->ora_e = e;
|
|
rc = be->be_add ( op, &rs_add );
|
|
if ( rs_add.sr_err == LDAP_SUCCESS ) {
|
|
be_entry_release_w( op, e );
|
|
} else {
|
|
entry_free( e );
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
static struct berval ocbva[] = {
|
|
BER_BVC("top"),
|
|
BER_BVC("subentry"),
|
|
BER_BVC("syncConsumerSubentry"),
|
|
BER_BVNULL
|
|
};
|
|
|
|
static struct berval cnbva[] = {
|
|
BER_BVNULL,
|
|
BER_BVNULL
|
|
};
|
|
|
|
static struct berval ssbva[] = {
|
|
BER_BVC("{}"),
|
|
BER_BVNULL
|
|
};
|
|
|
|
static struct berval scbva[] = {
|
|
BER_BVNULL,
|
|
BER_BVNULL
|
|
};
|
|
|
|
void
|
|
syncrepl_updateCookie(
|
|
syncinfo_t *si,
|
|
Operation *op,
|
|
struct berval *pdn,
|
|
struct sync_cookie *syncCookie )
|
|
{
|
|
Backend *be = op->o_bd;
|
|
Modifications *ml;
|
|
Modifications *mlnext;
|
|
Modifications *mod;
|
|
Modifications *modlist = NULL;
|
|
Modifications **modtail = &modlist;
|
|
|
|
const char *text;
|
|
char txtbuf[SLAP_TEXT_BUFLEN];
|
|
size_t textlen = sizeof txtbuf;
|
|
|
|
Entry* e = NULL;
|
|
int rc;
|
|
|
|
char syncrepl_cbuf[sizeof(CN_STR SYNCREPL_STR)];
|
|
struct berval slap_syncrepl_dn_bv = BER_BVNULL;
|
|
struct berval slap_syncrepl_cn_bv = BER_BVNULL;
|
|
|
|
slap_callback cb = { NULL };
|
|
SlapReply rs_add = {REP_RESULT};
|
|
SlapReply rs_modify = {REP_RESULT};
|
|
|
|
slap_sync_cookie_free( &si->si_syncCookie, 0 );
|
|
slap_dup_sync_cookie( &si->si_syncCookie, syncCookie );
|
|
|
|
mod = (Modifications *) ch_calloc( 1, sizeof( Modifications ));
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_desc = slap_schema.si_ad_objectClass;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = ocbva;
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
|
|
ber_dupbv( &cnbva[0], (struct berval *) &slap_syncrepl_bvc );
|
|
assert( si->si_rid < 1000 );
|
|
cnbva[0].bv_len = snprintf( cnbva[0].bv_val,
|
|
slap_syncrepl_bvc.bv_len + 1,
|
|
"syncrepl%ld", si->si_rid );
|
|
mod = (Modifications *) ch_calloc( 1, sizeof( Modifications ));
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_desc = slap_schema.si_ad_cn;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = cnbva;
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
|
|
mod = (Modifications *) ch_calloc( 1, sizeof( Modifications ));
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_desc = slap_schema.si_ad_subtreeSpecification;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = ssbva;
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
|
|
/* Keep this last, so we can avoid touching the previous
|
|
* attributes unnecessarily.
|
|
*/
|
|
if ( scbva[0].bv_val ) ch_free( scbva[0].bv_val );
|
|
ber_dupbv( &scbva[0], &si->si_syncCookie.octet_str[0] );
|
|
mod = (Modifications *) ch_calloc( 1, sizeof( Modifications ));
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_desc = slap_schema.si_ad_syncreplCookie;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = scbva;
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
|
|
slap_queue_csn( op, si->si_syncCookie.ctxcsn );
|
|
|
|
mlnext = mod;
|
|
|
|
op->o_tag = LDAP_REQ_ADD;
|
|
rc = slap_mods_opattrs( op, modlist, modtail,
|
|
&text, txtbuf, textlen, 0 );
|
|
|
|
for ( ml = modlist; ml != NULL; ml = ml->sml_next ) {
|
|
ml->sml_op = LDAP_MOD_REPLACE;
|
|
}
|
|
|
|
if( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_updateCookie: mods opattrs (%s)\n",
|
|
text, 0, 0 );
|
|
}
|
|
|
|
e = ( Entry * ) ch_calloc( 1, sizeof( Entry ));
|
|
|
|
slap_syncrepl_cn_bv.bv_val = syncrepl_cbuf;
|
|
assert( si->si_rid < 1000 );
|
|
slap_syncrepl_cn_bv.bv_len = snprintf( slap_syncrepl_cn_bv.bv_val,
|
|
slap_syncrepl_cn_bvc.bv_len + 1,
|
|
"cn=syncrepl%ld", si->si_rid );
|
|
|
|
build_new_dn( &slap_syncrepl_dn_bv, pdn, &slap_syncrepl_cn_bv,
|
|
op->o_tmpmemctx );
|
|
ber_dupbv( &e->e_name, &slap_syncrepl_dn_bv );
|
|
ber_dupbv( &e->e_nname, &slap_syncrepl_dn_bv );
|
|
|
|
if ( !BER_BVISNULL( &slap_syncrepl_dn_bv ) ) {
|
|
slap_sl_free( slap_syncrepl_dn_bv.bv_val, op->o_tmpmemctx );
|
|
}
|
|
|
|
e->e_attrs = NULL;
|
|
|
|
rc = slap_mods2entry( modlist, &e, 1, 1, &text, txtbuf, textlen );
|
|
|
|
if( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_updateCookie: mods2entry (%s)\n",
|
|
text, 0, 0 );
|
|
}
|
|
|
|
cb.sc_response = null_callback;
|
|
cb.sc_private = si;
|
|
|
|
op->o_callback = &cb;
|
|
op->o_req_dn = e->e_name;
|
|
op->o_req_ndn = e->e_nname;
|
|
|
|
/* update persistent cookie */
|
|
update_cookie_retry:
|
|
op->o_tag = LDAP_REQ_MODIFY;
|
|
/* Just modify the cookie value, not the entire entry */
|
|
op->orm_modlist = mod;
|
|
rc = be->be_modify( op, &rs_modify );
|
|
|
|
if ( rs_modify.sr_err != LDAP_SUCCESS ) {
|
|
if ( rs_modify.sr_err == LDAP_REFERRAL ||
|
|
rs_modify.sr_err == LDAP_NO_SUCH_OBJECT ) {
|
|
op->o_tag = LDAP_REQ_ADD;
|
|
op->ora_e = e;
|
|
rc = be->be_add( op, &rs_add );
|
|
if ( rs_add.sr_err != LDAP_SUCCESS ) {
|
|
if ( rs_add.sr_err == LDAP_ALREADY_EXISTS ) {
|
|
goto update_cookie_retry;
|
|
} else if ( rs_add.sr_err == LDAP_REFERRAL ||
|
|
rs_add.sr_err == LDAP_NO_SUCH_OBJECT ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"cookie will be non-persistent\n",
|
|
0, 0, 0 );
|
|
} else {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"be_add failed (%d)\n", rs_add.sr_err, 0, 0 );
|
|
}
|
|
} else {
|
|
be_entry_release_w( op, e );
|
|
goto done;
|
|
}
|
|
} else {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"be_modify failed (%d)\n", rs_modify.sr_err, 0, 0 );
|
|
}
|
|
}
|
|
if ( e != NULL ) {
|
|
entry_free( e );
|
|
}
|
|
|
|
done :
|
|
slap_graduate_commit_csn( op );
|
|
|
|
|
|
if ( !BER_BVISNULL( &cnbva[0] ) ) {
|
|
ch_free( cnbva[0].bv_val );
|
|
BER_BVZERO( &cnbva[0] );
|
|
}
|
|
if ( !BER_BVISNULL( &scbva[0] ) ) {
|
|
ch_free( scbva[0].bv_val );
|
|
BER_BVZERO( &scbva[0] );
|
|
}
|
|
|
|
if ( mlnext->sml_next ) {
|
|
slap_mods_free( mlnext->sml_next );
|
|
mlnext->sml_next = NULL;
|
|
}
|
|
|
|
for (ml = modlist ; ml != NULL; ml = mlnext ) {
|
|
mlnext = ml->sml_next;
|
|
free( ml );
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
int
|
|
syncrepl_isupdate( Operation *op )
|
|
{
|
|
return ( syncrepl_isupdate_dn( op->o_bd, &op->o_ndn ));
|
|
}
|
|
|
|
int
|
|
syncrepl_isupdate_dn(
|
|
Backend* be,
|
|
struct berval* ndn )
|
|
{
|
|
syncinfo_t* si;
|
|
int ret = 0;
|
|
|
|
if ( !LDAP_STAILQ_EMPTY( &be->be_syncinfo )) {
|
|
LDAP_STAILQ_FOREACH( si, &be->be_syncinfo, si_next ) {
|
|
if ( ( ret = dn_match( &si->si_updatedn, ndn ) ) ) {
|
|
return ret;
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
dn_callback(
|
|
Operation* op,
|
|
SlapReply* rs )
|
|
{
|
|
dninfo *dni = op->o_callback->sc_private;
|
|
|
|
if ( rs->sr_type == REP_SEARCH ) {
|
|
if ( !BER_BVISNULL( &dni->dn ) ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"dn_callback : consistency error - "
|
|
"entryUUID is not unique\n", 0, 0, 0 );
|
|
} else {
|
|
ber_dupbv_x( &dni->dn, &rs->sr_entry->e_name, op->o_tmpmemctx );
|
|
ber_dupbv_x( &dni->ndn, &rs->sr_entry->e_nname, op->o_tmpmemctx );
|
|
/* If there is a new entry, see if it differs from the old.
|
|
* We compare the non-normalized values so that cosmetic changes
|
|
* in the provider are always propagated.
|
|
*/
|
|
if ( dni->new_entry ) {
|
|
Attribute *old, *new;
|
|
int i;
|
|
|
|
/* Did the DN change? Note that we don't explicitly try to
|
|
* discover if the deleteOldRdn argument applies here. It
|
|
* would save an unnecessary Modify if we detected it, but
|
|
* that's a fair amount of trouble to compare the two attr
|
|
* lists in detail.
|
|
*/
|
|
if ( !dn_match( &rs->sr_entry->e_name,
|
|
&dni->new_entry->e_name ) )
|
|
{
|
|
dni->renamed = 1;
|
|
}
|
|
|
|
for ( i = 0, old = rs->sr_entry->e_attrs;
|
|
old;
|
|
i++, old = old->a_next )
|
|
;
|
|
|
|
dni->attrs = i;
|
|
|
|
/* We assume that attributes are saved in the same order
|
|
* in the remote and local databases. So if we walk through
|
|
* the attributeDescriptions one by one they should match in
|
|
* lock step. If not, we signal a change. Otherwise we test
|
|
* all the values...
|
|
*/
|
|
for ( old = rs->sr_entry->e_attrs, new = dni->new_entry->e_attrs;
|
|
old && new;
|
|
old = old->a_next, new = new->a_next )
|
|
{
|
|
if ( old->a_desc != new->a_desc ) {
|
|
dni->wasChanged = 1;
|
|
break;
|
|
}
|
|
for ( i = 0; ; i++ ) {
|
|
int nold, nnew;
|
|
nold = BER_BVISNULL( &old->a_vals[i] );
|
|
nnew = BER_BVISNULL( &new->a_vals[i] );
|
|
/* If both are empty, stop looking */
|
|
if ( nold && nnew ) {
|
|
break;
|
|
}
|
|
/* If they are different, stop looking */
|
|
if ( nold != nnew ) {
|
|
dni->wasChanged = 1;
|
|
break;
|
|
}
|
|
if ( ber_bvcmp( &old->a_vals[i], &new->a_vals[i] )) {
|
|
dni->wasChanged = 1;
|
|
break;
|
|
}
|
|
}
|
|
if ( dni->wasChanged ) break;
|
|
}
|
|
if ( dni->wasChanged ) {
|
|
dni->ads = op->o_tmpalloc( dni->attrs *
|
|
sizeof(AttributeDescription *), op->o_tmpmemctx );
|
|
i = 0;
|
|
for ( old = rs->sr_entry->e_attrs; old; old = old->a_next ) {
|
|
dni->ads[i] = old->a_desc;
|
|
i++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else if ( rs->sr_type == REP_RESULT ) {
|
|
if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"dn_callback : consistency error - "
|
|
"entryUUID is not unique\n", 0, 0, 0 );
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
nonpresent_callback(
|
|
Operation* op,
|
|
SlapReply* rs )
|
|
{
|
|
syncinfo_t *si = op->o_callback->sc_private;
|
|
Attribute *a;
|
|
int count = 0;
|
|
struct berval* present_uuid = NULL;
|
|
struct nonpresent_entry *np_entry;
|
|
|
|
if ( rs->sr_type == REP_RESULT ) {
|
|
count = avl_free( si->si_presentlist, avl_ber_bvfree );
|
|
si->si_presentlist = NULL;
|
|
|
|
} else if ( rs->sr_type == REP_SEARCH ) {
|
|
if ( !(si->si_refreshDelete & NP_DELETE_ONE )) {
|
|
a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
|
|
|
|
if ( a == NULL ) return 0;
|
|
|
|
present_uuid = avl_find( si->si_presentlist, &a->a_nvals[0],
|
|
syncuuid_cmp );
|
|
}
|
|
|
|
if ( present_uuid == NULL ) {
|
|
np_entry = (struct nonpresent_entry *)
|
|
ch_calloc( 1, sizeof( struct nonpresent_entry ));
|
|
np_entry->npe_name = ber_dupbv( NULL, &rs->sr_entry->e_name );
|
|
np_entry->npe_nname = ber_dupbv( NULL, &rs->sr_entry->e_nname );
|
|
LDAP_LIST_INSERT_HEAD( &si->si_nonpresentlist, np_entry, npe_link );
|
|
|
|
} else {
|
|
avl_delete( &si->si_presentlist,
|
|
&a->a_nvals[0], syncuuid_cmp );
|
|
ch_free( present_uuid->bv_val );
|
|
ch_free( present_uuid );
|
|
}
|
|
}
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
null_callback(
|
|
Operation* op,
|
|
SlapReply* rs )
|
|
{
|
|
if ( rs->sr_err != LDAP_SUCCESS &&
|
|
rs->sr_err != LDAP_REFERRAL &&
|
|
rs->sr_err != LDAP_ALREADY_EXISTS &&
|
|
rs->sr_err != LDAP_NO_SUCH_OBJECT &&
|
|
rs->sr_err != LDAP_NOT_ALLOWED_ON_NONLEAF )
|
|
{
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"null_callback : error code 0x%x\n",
|
|
rs->sr_err, 0, 0 );
|
|
}
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
Entry *
|
|
slap_create_syncrepl_entry(
|
|
Backend *be,
|
|
struct berval *context_csn,
|
|
struct berval *rdn,
|
|
struct berval *cn )
|
|
{
|
|
Entry* e;
|
|
|
|
struct berval bv;
|
|
|
|
e = ( Entry * ) ch_calloc( 1, sizeof( Entry ));
|
|
|
|
attr_merge( e, slap_schema.si_ad_objectClass, ocbva, NULL );
|
|
|
|
attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
|
|
&ocbva[1], NULL );
|
|
|
|
attr_merge_one( e, slap_schema.si_ad_cn, cn, NULL );
|
|
|
|
if ( context_csn ) {
|
|
attr_merge_one( e, slap_schema.si_ad_syncreplCookie,
|
|
context_csn, NULL );
|
|
}
|
|
|
|
BER_BVSTR( &bv, "{}" );
|
|
attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
|
|
|
|
build_new_dn( &e->e_name, &be->be_nsuffix[0], rdn, NULL );
|
|
ber_dupbv( &e->e_nname, &e->e_name );
|
|
|
|
return e;
|
|
}
|
|
|
|
struct berval *
|
|
slap_uuidstr_from_normalized(
|
|
struct berval* uuidstr,
|
|
struct berval* normalized,
|
|
void *ctx )
|
|
{
|
|
struct berval *new;
|
|
unsigned char nibble;
|
|
int i, d = 0;
|
|
|
|
if ( normalized == NULL ) return NULL;
|
|
if ( normalized->bv_len != 16 ) return NULL;
|
|
|
|
if ( uuidstr ) {
|
|
new = uuidstr;
|
|
} else {
|
|
new = (struct berval *)slap_sl_malloc( sizeof(struct berval), ctx );
|
|
if ( new == NULL ) {
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
new->bv_len = 36;
|
|
|
|
if ( ( new->bv_val = slap_sl_malloc( new->bv_len + 1, ctx ) ) == NULL ) {
|
|
if ( new != uuidstr ) {
|
|
slap_sl_free( new, ctx );
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
for ( i = 0; i < 16; i++ ) {
|
|
if ( i == 4 || i == 6 || i == 8 || i == 10 ) {
|
|
new->bv_val[(i<<1)+d] = '-';
|
|
d += 1;
|
|
}
|
|
|
|
nibble = (normalized->bv_val[i] >> 4) & 0xF;
|
|
if ( nibble < 10 ) {
|
|
new->bv_val[(i<<1)+d] = nibble + '0';
|
|
} else {
|
|
new->bv_val[(i<<1)+d] = nibble - 10 + 'a';
|
|
}
|
|
|
|
nibble = (normalized->bv_val[i]) & 0xF;
|
|
if ( nibble < 10 ) {
|
|
new->bv_val[(i<<1)+d+1] = nibble + '0';
|
|
} else {
|
|
new->bv_val[(i<<1)+d+1] = nibble - 10 + 'a';
|
|
}
|
|
}
|
|
|
|
new->bv_val[new->bv_len] = '\0';
|
|
return new;
|
|
}
|
|
|
|
static int
|
|
syncuuid_cmp( const void* v_uuid1, const void* v_uuid2 )
|
|
{
|
|
const struct berval *uuid1 = v_uuid1;
|
|
const struct berval *uuid2 = v_uuid2;
|
|
int rc = uuid1->bv_len - uuid2->bv_len;
|
|
if ( rc ) return rc;
|
|
return ( memcmp( uuid1->bv_val, uuid2->bv_val, uuid1->bv_len ) );
|
|
}
|
|
|
|
static void
|
|
avl_ber_bvfree( void *v_bv )
|
|
{
|
|
struct berval *bv = (struct berval *)v_bv;
|
|
|
|
if( v_bv == NULL ) return;
|
|
if ( !BER_BVISNULL( bv ) ) {
|
|
ch_free( bv->bv_val );
|
|
}
|
|
ch_free( (char *) bv );
|
|
}
|
|
|
|
void
|
|
syncinfo_free( syncinfo_t *sie )
|
|
{
|
|
if ( sie->si_provideruri ) {
|
|
ch_free( sie->si_provideruri );
|
|
}
|
|
if ( sie->si_provideruri_bv ) {
|
|
ber_bvarray_free( sie->si_provideruri_bv );
|
|
}
|
|
if ( sie->si_updatedn.bv_val ) {
|
|
ch_free( sie->si_updatedn.bv_val );
|
|
}
|
|
if ( sie->si_binddn ) {
|
|
ch_free( sie->si_binddn );
|
|
}
|
|
if ( sie->si_passwd ) {
|
|
ch_free( sie->si_passwd );
|
|
}
|
|
if ( sie->si_saslmech ) {
|
|
ch_free( sie->si_saslmech );
|
|
}
|
|
if ( sie->si_secprops ) {
|
|
ch_free( sie->si_secprops );
|
|
}
|
|
if ( sie->si_realm ) {
|
|
ch_free( sie->si_realm );
|
|
}
|
|
if ( sie->si_authcId ) {
|
|
ch_free( sie->si_authcId );
|
|
}
|
|
if ( sie->si_authzId ) {
|
|
ch_free( sie->si_authzId );
|
|
}
|
|
if ( sie->si_filterstr.bv_val ) {
|
|
ch_free( sie->si_filterstr.bv_val );
|
|
}
|
|
if ( sie->si_base.bv_val ) {
|
|
ch_free( sie->si_base.bv_val );
|
|
}
|
|
if ( sie->si_attrs ) {
|
|
int i = 0;
|
|
while ( sie->si_attrs[i] != NULL ) {
|
|
ch_free( sie->si_attrs[i] );
|
|
i++;
|
|
}
|
|
ch_free( sie->si_attrs );
|
|
}
|
|
if ( sie->si_exattrs ) {
|
|
int i = 0;
|
|
while ( sie->si_exattrs[i] != NULL ) {
|
|
ch_free( sie->si_exattrs[i] );
|
|
i++;
|
|
}
|
|
ch_free( sie->si_exattrs );
|
|
}
|
|
if ( sie->si_anlist ) {
|
|
int i = 0;
|
|
while ( sie->si_anlist[i].an_name.bv_val != NULL ) {
|
|
ch_free( sie->si_anlist[i].an_name.bv_val );
|
|
i++;
|
|
}
|
|
ch_free( sie->si_anlist );
|
|
}
|
|
if ( sie->si_exanlist ) {
|
|
int i = 0;
|
|
while ( sie->si_exanlist[i].an_name.bv_val != NULL ) {
|
|
ch_free( sie->si_exanlist[i].an_name.bv_val );
|
|
i++;
|
|
}
|
|
ch_free( sie->si_exanlist );
|
|
}
|
|
if ( sie->si_retryinterval ) {
|
|
ch_free( sie->si_retryinterval );
|
|
}
|
|
if ( sie->si_retrynum ) {
|
|
ch_free( sie->si_retrynum );
|
|
}
|
|
if ( sie->si_retrynum_init ) {
|
|
ch_free( sie->si_retrynum_init );
|
|
}
|
|
slap_sync_cookie_free( &sie->si_syncCookie, 0 );
|
|
if ( sie->si_presentlist ) {
|
|
avl_free( sie->si_presentlist, avl_ber_bvfree );
|
|
}
|
|
if ( sie->si_ld ) {
|
|
ldap_ld_free( sie->si_ld, 1, NULL, NULL );
|
|
}
|
|
while ( !LDAP_LIST_EMPTY( &sie->si_nonpresentlist )) {
|
|
struct nonpresent_entry* npe;
|
|
npe = LDAP_LIST_FIRST( &sie->si_nonpresentlist );
|
|
LDAP_LIST_REMOVE( npe, npe_link );
|
|
if ( npe->npe_name ) {
|
|
if ( npe->npe_name->bv_val ) {
|
|
ch_free( npe->npe_name->bv_val );
|
|
}
|
|
ch_free( npe->npe_name );
|
|
}
|
|
if ( npe->npe_nname ) {
|
|
if ( npe->npe_nname->bv_val ) {
|
|
ch_free( npe->npe_nname->bv_val );
|
|
}
|
|
ch_free( npe->npe_nname );
|
|
}
|
|
ch_free( npe );
|
|
}
|
|
ch_free( sie );
|
|
}
|