mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-27 03:20:22 +08:00
3998 lines
106 KiB
C
3998 lines
106 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-2007 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 "config.h"
|
|
|
|
#include "ldap_rq.h"
|
|
|
|
struct nonpresent_entry {
|
|
struct berval *npe_name;
|
|
struct berval *npe_nname;
|
|
LDAP_LIST_ENTRY(nonpresent_entry) npe_link;
|
|
};
|
|
|
|
typedef struct cookie_state {
|
|
ldap_pvt_thread_mutex_t cs_mutex;
|
|
int cs_num;
|
|
int cs_age;
|
|
struct berval *cs_vals;
|
|
int *cs_sids;
|
|
} cookie_state;
|
|
|
|
#define SYNCDATA_DEFAULT 0 /* entries are plain LDAP entries */
|
|
#define SYNCDATA_ACCESSLOG 1 /* entries are accesslog format */
|
|
#define SYNCDATA_CHANGELOG 2 /* entries are changelog format */
|
|
|
|
#define SYNCLOG_LOGGING 0 /* doing a log-based update */
|
|
#define SYNCLOG_FALLBACK 1 /* doing a full refresh */
|
|
|
|
#define RETRYNUM_FOREVER (-1) /* retry forever */
|
|
#define RETRYNUM_TAIL (-2) /* end of retrynum array */
|
|
#define RETRYNUM_VALID(n) ((n) >= RETRYNUM_FOREVER) /* valid retrynum */
|
|
#define RETRYNUM_FINITE(n) ((n) > RETRYNUM_FOREVER) /* not forever */
|
|
|
|
typedef struct syncinfo_s {
|
|
struct syncinfo_s *si_next;
|
|
struct slap_backend_db *si_be;
|
|
struct slap_backend_db *si_wbe;
|
|
struct re_s *si_re;
|
|
int si_rid;
|
|
char si_ridtxt[8];
|
|
slap_bindconf si_bindconf;
|
|
struct berval si_base;
|
|
struct berval si_logbase;
|
|
struct berval si_filterstr;
|
|
struct berval si_logfilterstr;
|
|
int si_scope;
|
|
int si_attrsonly;
|
|
char *si_anfile;
|
|
AttributeName *si_anlist;
|
|
AttributeName *si_exanlist;
|
|
char **si_attrs;
|
|
char **si_exattrs;
|
|
int si_allattrs;
|
|
int si_allopattrs;
|
|
int si_schemachecking;
|
|
int si_type; /* the active type */
|
|
int si_ctype; /* the configured type */
|
|
time_t si_interval;
|
|
time_t *si_retryinterval;
|
|
int *si_retrynum_init;
|
|
int *si_retrynum;
|
|
struct sync_cookie si_syncCookie;
|
|
cookie_state *si_cookieState;
|
|
int si_cookieAge;
|
|
int si_manageDSAit;
|
|
int si_slimit;
|
|
int si_tlimit;
|
|
int si_refreshDelete;
|
|
int si_refreshPresent;
|
|
int si_syncdata;
|
|
int si_logstate;
|
|
int si_conn_setup;
|
|
Avlnode *si_presentlist;
|
|
LDAP *si_ld;
|
|
LDAP_LIST_HEAD(np, nonpresent_entry) si_nonpresentlist;
|
|
ldap_pvt_thread_mutex_t si_mutex;
|
|
} syncinfo_t;
|
|
|
|
static int syncuuid_cmp( const void *, const void * );
|
|
static void avl_ber_bvfree( void * );
|
|
static void syncrepl_del_nonpresent( Operation *, syncinfo_t *, BerVarray, struct berval * );
|
|
static int syncrepl_message_to_op(
|
|
syncinfo_t *, Operation *, LDAPMessage * );
|
|
static int syncrepl_message_to_entry(
|
|
syncinfo_t *, Operation *, LDAPMessage *,
|
|
Modifications **, Entry **, int );
|
|
static int syncrepl_entry(
|
|
syncinfo_t *, Operation*, Entry*,
|
|
Modifications**,int, struct berval* );
|
|
static int syncrepl_updateCookie(
|
|
syncinfo_t *, Operation *, struct berval *,
|
|
struct sync_cookie * );
|
|
static struct berval * slap_uuidstr_from_normalized(
|
|
struct berval *, struct berval *, void * );
|
|
|
|
/* 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];
|
|
|
|
static 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 ) ) {
|
|
ch_free( exattrs[j] );
|
|
for ( k = j; exattrs[k] != NULL; 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 ) ) {
|
|
ch_free( exattrs[i] );
|
|
for ( l = i; exattrs[l]; l++ ) {
|
|
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;
|
|
}
|
|
|
|
typedef struct logschema {
|
|
struct berval ls_dn;
|
|
struct berval ls_req;
|
|
struct berval ls_mod;
|
|
struct berval ls_newRdn;
|
|
struct berval ls_delRdn;
|
|
struct berval ls_newSup;
|
|
} logschema;
|
|
|
|
static logschema changelog_sc = {
|
|
BER_BVC("targetDN"),
|
|
BER_BVC("changeType"),
|
|
BER_BVC("changes"),
|
|
BER_BVC("newRDN"),
|
|
BER_BVC("deleteOldRDN"),
|
|
BER_BVC("newSuperior")
|
|
};
|
|
|
|
static logschema accesslog_sc = {
|
|
BER_BVC("reqDN"),
|
|
BER_BVC("reqType"),
|
|
BER_BVC("reqMod"),
|
|
BER_BVC("reqNewRDN"),
|
|
BER_BVC("reqDeleteOldRDN"),
|
|
BER_BVC("reqNewSuperior")
|
|
};
|
|
|
|
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;
|
|
int rhint;
|
|
char *base;
|
|
char **attrs, *lattrs[8];
|
|
char *filter;
|
|
int attrsonly;
|
|
int scope;
|
|
|
|
/* setup LDAP SYNC control */
|
|
ber_init2( ber, NULL, LBER_USE_DER );
|
|
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &ctx );
|
|
|
|
/* If we're using a log but we have no state, then fallback to
|
|
* normal mode for a full refresh.
|
|
*/
|
|
if ( si->si_syncdata && !si->si_syncCookie.numcsns ) {
|
|
si->si_logstate = SYNCLOG_FALLBACK;
|
|
}
|
|
|
|
/* Use the log parameters if we're in log mode */
|
|
if ( si->si_syncdata && si->si_logstate == SYNCLOG_LOGGING ) {
|
|
logschema *ls;
|
|
if ( si->si_syncdata == SYNCDATA_ACCESSLOG )
|
|
ls = &accesslog_sc;
|
|
else
|
|
ls = &changelog_sc;
|
|
lattrs[0] = ls->ls_dn.bv_val;
|
|
lattrs[1] = ls->ls_req.bv_val;
|
|
lattrs[2] = ls->ls_mod.bv_val;
|
|
lattrs[3] = ls->ls_newRdn.bv_val;
|
|
lattrs[4] = ls->ls_delRdn.bv_val;
|
|
lattrs[5] = ls->ls_newSup.bv_val;
|
|
lattrs[6] = slap_schema.si_ad_entryCSN->ad_cname.bv_val;
|
|
lattrs[7] = NULL;
|
|
|
|
rhint = 0;
|
|
base = si->si_logbase.bv_val;
|
|
filter = si->si_logfilterstr.bv_val;
|
|
attrs = lattrs;
|
|
attrsonly = 0;
|
|
scope = LDAP_SCOPE_SUBTREE;
|
|
} else {
|
|
rhint = 1;
|
|
base = si->si_base.bv_val;
|
|
filter = si->si_filterstr.bv_val;
|
|
attrs = si->si_attrs;
|
|
attrsonly = si->si_attrsonly;
|
|
scope = si->si_scope;
|
|
}
|
|
if ( si->si_syncdata && si->si_logstate == SYNCLOG_FALLBACK ) {
|
|
si->si_type = LDAP_SYNC_REFRESH_ONLY;
|
|
} else {
|
|
si->si_type = si->si_ctype;
|
|
}
|
|
|
|
if ( !BER_BVISNULL( &si->si_syncCookie.octet_str ) )
|
|
{
|
|
ber_printf( ber, "{eOb}",
|
|
abs(si->si_type), &si->si_syncCookie.octet_str, rhint );
|
|
} else {
|
|
ber_printf( ber, "{eb}",
|
|
abs(si->si_type), rhint );
|
|
}
|
|
|
|
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 ( !BER_BVISNULL( &si->si_bindconf.sb_authzId ) ) {
|
|
c[1].ldctl_oid = LDAP_CONTROL_PROXY_AUTHZ;
|
|
c[1].ldctl_value = si->si_bindconf.sb_authzId;
|
|
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, base, scope, filter, attrs, 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;
|
|
|
|
struct sync_cookie *sc = NULL;
|
|
#ifdef HAVE_TLS
|
|
void *ssl;
|
|
#endif
|
|
|
|
rc = slap_client_connect( &si->si_ld, &si->si_bindconf );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
goto done;
|
|
}
|
|
op->o_protocol = LDAP_VERSION3;
|
|
|
|
/* 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;
|
|
|
|
/* We've just started up, or the remote server hasn't sent us
|
|
* any meaningful state.
|
|
*/
|
|
if ( BER_BVISNULL( &si->si_syncCookie.octet_str ) ) {
|
|
int i;
|
|
|
|
si->si_syncCookie.rid = si->si_rid;
|
|
si->si_syncCookie.sid = SLAP_SINGLE_SHADOW( si->si_be ) ? -1 :
|
|
slap_serverID;
|
|
|
|
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 */
|
|
|
|
LDAP_STAILQ_REMOVE( &slap_sync_cookie, sc, sync_cookie, sc_next );
|
|
|
|
/* ctxcsn wasn't parsed yet, do it now */
|
|
slap_parse_sync_cookie( sc, op->o_tmpmemctx );
|
|
slap_sync_cookie_free( &si->si_syncCookie, 0 );
|
|
slap_dup_sync_cookie( &si->si_syncCookie, sc );
|
|
slap_sync_cookie_free( sc, 1 );
|
|
} else {
|
|
ldap_pvt_thread_mutex_lock( &si->si_cookieState->cs_mutex );
|
|
if ( !si->si_cookieState->cs_num ) {
|
|
/* get contextCSN shadow replica from database */
|
|
BerVarray csn = NULL;
|
|
void *ctx = op->o_tmpmemctx;
|
|
|
|
op->o_req_ndn = op->o_bd->be_nsuffix[0];
|
|
op->o_req_dn = op->o_req_ndn;
|
|
|
|
/* try to read stored contextCSN */
|
|
op->o_tmpmemctx = NULL;
|
|
backend_attribute( op, NULL, &op->o_req_ndn,
|
|
slap_schema.si_ad_contextCSN, &csn, ACL_READ );
|
|
op->o_tmpmemctx = ctx;
|
|
if ( csn ) {
|
|
si->si_cookieState->cs_vals = csn;
|
|
for (i=0; !BER_BVISNULL( &csn[i] ); i++);
|
|
si->si_cookieState->cs_num = i;
|
|
si->si_cookieState->cs_sids = slap_parse_csn_sids( csn, i );
|
|
}
|
|
}
|
|
if ( si->si_cookieState->cs_num ) {
|
|
ber_bvarray_free( si->si_syncCookie.ctxcsn );
|
|
if ( ber_bvarray_dup_x( &si->si_syncCookie.ctxcsn,
|
|
si->si_cookieState->cs_vals, NULL )) {
|
|
rc = LDAP_NO_MEMORY;
|
|
goto done;
|
|
}
|
|
si->si_syncCookie.numcsns = si->si_cookieState->cs_num;
|
|
si->si_syncCookie.sids = ch_malloc( si->si_cookieState->cs_num *
|
|
sizeof(int) );
|
|
for ( i=0; i<si->si_syncCookie.numcsns; i++ )
|
|
si->si_syncCookie.sids[i] = si->si_cookieState->cs_sids[i];
|
|
}
|
|
ldap_pvt_thread_mutex_unlock( &si->si_cookieState->cs_mutex );
|
|
}
|
|
|
|
slap_compose_sync_cookie( NULL, &si->si_syncCookie.octet_str,
|
|
si->si_syncCookie.ctxcsn, si->si_syncCookie.rid,
|
|
si->si_syncCookie.sid );
|
|
} else {
|
|
AttributeName at[2];
|
|
Attribute a = { slap_schema.si_ad_contextCSN };
|
|
Entry e = {0};
|
|
SlapReply rs = {0};
|
|
int i, j, changed = 0;
|
|
|
|
/* Look for contextCSN from syncprov overlay. If
|
|
* there's no overlay, this will be a no-op. That means
|
|
* this is a pure consumer, so local changes will not be
|
|
* allowed, and all changes will already be reflected in
|
|
* the cookieState.
|
|
*/
|
|
e.e_attrs = &a;
|
|
e.e_name = si->si_wbe->be_suffix[0];
|
|
e.e_nname = si->si_wbe->be_nsuffix[0];
|
|
rs.sr_entry = &e;
|
|
rs.sr_flags = REP_ENTRY_MODIFIABLE;
|
|
at[0].an_name = a.a_desc->ad_cname;
|
|
at[0].an_desc = a.a_desc;
|
|
BER_BVZERO( &at[1].an_name );
|
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_cookieState->cs_mutex );
|
|
rc = backend_operational( op, &rs );
|
|
if ( rc == LDAP_SUCCESS && a.a_vals ) {
|
|
int num;
|
|
for (i=0; !BER_BVISNULL( &a.a_vals[i] ); i++) ;
|
|
num = i;
|
|
/* check for differences */
|
|
if ( num != si->si_cookieState->cs_num ) {
|
|
changed = 1;
|
|
} else {
|
|
for ( i=0; i<num; i++ ) {
|
|
if ( ber_bvcmp( &a.a_vals[i],
|
|
&si->si_cookieState->cs_vals[i] )) {
|
|
changed =1;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if ( changed ) {
|
|
ber_bvarray_free( si->si_cookieState->cs_vals );
|
|
ch_free( si->si_cookieState->cs_sids );
|
|
si->si_cookieState->cs_num = num;
|
|
si->si_cookieState->cs_vals = a.a_vals;
|
|
si->si_cookieState->cs_sids = slap_parse_csn_sids( a.a_vals,
|
|
num );
|
|
si->si_cookieState->cs_age++;
|
|
} else {
|
|
ber_bvarray_free( a.a_vals );
|
|
}
|
|
changed = 0;
|
|
}
|
|
/* See if the cookieState has changed due to anything outside
|
|
* this particular consumer. That includes other consumers in
|
|
* the same context, or local changes detected above.
|
|
*/
|
|
if ( si->si_cookieState->cs_num > 1 && si->si_cookieAge !=
|
|
si->si_cookieState->cs_age ) {
|
|
|
|
for (i=0; !BER_BVISNULL( &si->si_syncCookie.ctxcsn[i] ); i++) {
|
|
/* bogus, just dup everything */
|
|
if ( si->si_syncCookie.sids[i] == -1 ) {
|
|
ber_bvarray_free( si->si_syncCookie.ctxcsn );
|
|
ber_bvarray_dup_x( &si->si_syncCookie.ctxcsn,
|
|
si->si_cookieState->cs_vals, NULL );
|
|
changed = 1;
|
|
break;
|
|
}
|
|
for (j=0; j<si->si_cookieState->cs_num; j++) {
|
|
if ( si->si_syncCookie.sids[i] !=
|
|
si->si_cookieState->cs_sids[j] )
|
|
continue;
|
|
if ( bvmatch( &si->si_syncCookie.ctxcsn[i],
|
|
&si->si_cookieState->cs_vals[j] ))
|
|
break;
|
|
ber_bvreplace( &si->si_syncCookie.ctxcsn[i],
|
|
&si->si_cookieState->cs_vals[j] );
|
|
changed = 1;
|
|
break;
|
|
}
|
|
}
|
|
if ( changed ) {
|
|
ch_free( si->si_syncCookie.octet_str.bv_val );
|
|
slap_compose_sync_cookie( NULL, &si->si_syncCookie.octet_str,
|
|
si->si_syncCookie.ctxcsn, si->si_syncCookie.rid,
|
|
SLAP_SINGLE_SHADOW( si->si_be ) ? -1 : slap_serverID );
|
|
}
|
|
}
|
|
ldap_pvt_thread_mutex_unlock( &si->si_cookieState->cs_mutex );
|
|
}
|
|
|
|
rc = ldap_sync_search( si, op->o_tmpmemctx );
|
|
|
|
if( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep1: %s "
|
|
"ldap_search_ext: %s (%d)\n",
|
|
si->si_ridtxt, ldap_err2string( rc ), rc );
|
|
}
|
|
|
|
done:
|
|
if ( rc ) {
|
|
if ( si->si_ld ) {
|
|
ldap_unbind_ext( si->si_ld, NULL, NULL );
|
|
si->si_ld = NULL;
|
|
}
|
|
}
|
|
|
|
return rc;
|
|
}
|
|
|
|
static int
|
|
compare_csns( struct sync_cookie *sc1, struct sync_cookie *sc2, int *which )
|
|
{
|
|
int i, j, match = 0;
|
|
const char *text;
|
|
|
|
*which = 0;
|
|
|
|
if ( sc1->numcsns < sc2->numcsns ) {
|
|
*which = sc1->numcsns;
|
|
return -1;
|
|
}
|
|
|
|
for (i=0; !BER_BVISNULL( &sc1->ctxcsn[i] ); i++) {
|
|
for (j=0; !BER_BVISNULL( &sc2->ctxcsn[j] ); j++) {
|
|
if ( sc1->sids[i] != sc2->sids[j] )
|
|
continue;
|
|
value_match( &match, slap_schema.si_ad_entryCSN,
|
|
slap_schema.si_ad_entryCSN->ad_type->sat_ordering,
|
|
SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
|
|
&sc1->ctxcsn[i], &sc2->ctxcsn[i], &text );
|
|
if ( match < 0 ) {
|
|
*which = j;
|
|
return match;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
return match;
|
|
}
|
|
|
|
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 };
|
|
struct sync_cookie syncCookie_req = { NULL };
|
|
struct berval cookie = BER_BVNULL;
|
|
|
|
int rc, err;
|
|
ber_len_t len;
|
|
|
|
struct berval *psub;
|
|
Modifications *modlist = NULL;
|
|
|
|
int match, m;
|
|
|
|
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 %s\n", si->si_ridtxt, 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 ) )
|
|
{
|
|
if ( slapd_shutdown ) {
|
|
rc = -2;
|
|
goto done;
|
|
}
|
|
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 */
|
|
rctrlp = NULL;
|
|
if ( rctrls ) {
|
|
/* NOTE: make sure we use the right one;
|
|
* a better approach would be to run thru
|
|
* the whole list and take care of all */
|
|
rctrlp = ldap_find_control( LDAP_CONTROL_SYNC_STATE, rctrls );
|
|
}
|
|
if ( rctrlp == NULL ) {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep2: %s "
|
|
"got search entry without "
|
|
"Sync State control\n", si->si_ridtxt, 0, 0 );
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
ber_init2( ber, &rctrlp->ldctl_value, LBER_USE_DER );
|
|
ber_scanf( ber, "{em" /*"}"*/, &syncstate, &syncUUID );
|
|
/* FIXME: what if syncUUID is NULL or empty?
|
|
* (happens with back-sql...) */
|
|
if ( BER_BVISEMPTY( &syncUUID ) ) {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep2: %s "
|
|
"got empty syncUUID\n", si->si_ridtxt, 0, 0 );
|
|
ldap_controls_free( rctrls );
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
if ( ber_peek_tag( ber, &len ) == LDAP_TAG_SYNC_COOKIE ) {
|
|
ber_scanf( ber, /*"{"*/ "m}", &cookie );
|
|
if ( !BER_BVISNULL( &cookie ) ) {
|
|
ch_free( syncCookie.octet_str.bv_val );
|
|
ber_dupbv( &syncCookie.octet_str, &cookie );
|
|
}
|
|
if ( !BER_BVISNULL( &syncCookie.octet_str ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie, NULL );
|
|
}
|
|
}
|
|
rc = 0;
|
|
if ( si->si_syncdata && si->si_logstate == SYNCLOG_LOGGING ) {
|
|
modlist = NULL;
|
|
if ( ( rc = syncrepl_message_to_op( si, op, msg ) ) == LDAP_SUCCESS &&
|
|
syncCookie.ctxcsn )
|
|
{
|
|
rc = syncrepl_updateCookie( si, op, psub, &syncCookie );
|
|
}
|
|
} else if ( ( rc = syncrepl_message_to_entry( si, op, msg,
|
|
&modlist, &entry, syncstate ) ) == LDAP_SUCCESS )
|
|
{
|
|
if ( ( rc = syncrepl_entry( si, op, entry, &modlist,
|
|
syncstate, &syncUUID ) ) == LDAP_SUCCESS &&
|
|
syncCookie.ctxcsn )
|
|
{
|
|
rc = syncrepl_updateCookie( si, op, psub, &syncCookie );
|
|
}
|
|
}
|
|
ldap_controls_free( rctrls );
|
|
if ( modlist ) {
|
|
slap_mods_free( modlist, 1 );
|
|
}
|
|
if ( rc )
|
|
goto done;
|
|
break;
|
|
|
|
case LDAP_RES_SEARCH_REFERENCE:
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"do_syncrep2: %s reference received error\n",
|
|
si->si_ridtxt, 0, 0 );
|
|
break;
|
|
|
|
case LDAP_RES_SEARCH_RESULT:
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"do_syncrep2: %s LDAP_RES_SEARCH_RESULT\n",
|
|
si->si_ridtxt, 0, 0 );
|
|
ldap_parse_result( si->si_ld, msg, &err, NULL, NULL, NULL,
|
|
&rctrls, 0 );
|
|
#ifdef LDAP_X_SYNC_REFRESH_REQUIRED
|
|
if ( err == LDAP_X_SYNC_REFRESH_REQUIRED ) {
|
|
/* map old result code to registered code */
|
|
err = LDAP_SYNC_REFRESH_REQUIRED;
|
|
}
|
|
#endif
|
|
if ( err == LDAP_SYNC_REFRESH_REQUIRED ) {
|
|
if ( si->si_logstate == SYNCLOG_LOGGING ) {
|
|
si->si_logstate = SYNCLOG_FALLBACK;
|
|
}
|
|
rc = err;
|
|
goto done;
|
|
}
|
|
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 ) ) {
|
|
ch_free( syncCookie.octet_str.bv_val );
|
|
ber_dupbv( &syncCookie.octet_str, &cookie);
|
|
}
|
|
if ( !BER_BVISNULL( &syncCookie.octet_str ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie, NULL );
|
|
}
|
|
}
|
|
if ( ber_peek_tag( ber, &len ) == LDAP_TAG_REFRESHDELETES )
|
|
{
|
|
ber_scanf( ber, "b", &refreshDeletes );
|
|
}
|
|
ber_scanf( ber, /*"{"*/ "}" );
|
|
}
|
|
if ( !syncCookie_req.ctxcsn ) {
|
|
match = -1;
|
|
m = 0;
|
|
} else if ( !syncCookie.ctxcsn ) {
|
|
match = 1;
|
|
} else {
|
|
match = compare_csns( &syncCookie_req, &syncCookie, &m );
|
|
}
|
|
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,
|
|
&syncCookie.ctxcsn[m] );
|
|
} else {
|
|
avl_free( si->si_presentlist, avl_ber_bvfree );
|
|
si->si_presentlist = NULL;
|
|
}
|
|
}
|
|
if ( syncCookie.ctxcsn && match < 0 && err == LDAP_SUCCESS )
|
|
{
|
|
rc = syncrepl_updateCookie( si, op, psub, &syncCookie );
|
|
}
|
|
if ( err == LDAP_SUCCESS
|
|
&& si->si_logstate == SYNCLOG_FALLBACK ) {
|
|
si->si_logstate = SYNCLOG_LOGGING;
|
|
rc = LDAP_SYNC_REFRESH_REQUIRED;
|
|
} else {
|
|
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",
|
|
si->si_ridtxt,
|
|
"LDAP_RES_INTERMEDIATE",
|
|
"NEW_COOKIE" );
|
|
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",
|
|
si->si_ridtxt,
|
|
"LDAP_RES_INTERMEDIATE",
|
|
si_tag == LDAP_TAG_SYNC_REFRESH_PRESENT ?
|
|
"REFRESH_PRESENT" : "REFRESH_DELETE" );
|
|
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 ) ) {
|
|
ch_free( syncCookie.octet_str.bv_val );
|
|
ber_dupbv( &syncCookie.octet_str, &cookie );
|
|
}
|
|
if ( !BER_BVISNULL( &syncCookie.octet_str ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie, NULL );
|
|
}
|
|
}
|
|
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",
|
|
si->si_ridtxt,
|
|
"LDAP_RES_INTERMEDIATE",
|
|
"SYNC_ID_SET" );
|
|
ber_scanf( ber, "t{" /*"}"*/, &tag );
|
|
if ( ber_peek_tag( ber, &len ) ==
|
|
LDAP_TAG_SYNC_COOKIE )
|
|
{
|
|
ber_scanf( ber, "m", &cookie );
|
|
if ( !BER_BVISNULL( &cookie ) ) {
|
|
ch_free( syncCookie.octet_str.bv_val );
|
|
ber_dupbv( &syncCookie.octet_str, &cookie );
|
|
}
|
|
if ( !BER_BVISNULL( &syncCookie.octet_str ) )
|
|
{
|
|
slap_parse_sync_cookie( &syncCookie, NULL );
|
|
compare_csns( &syncCookie_req, &syncCookie, &m );
|
|
}
|
|
}
|
|
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,
|
|
&syncCookie.ctxcsn[m] );
|
|
ber_bvarray_free_x( syncUUIDs, op->o_tmpmemctx );
|
|
} else {
|
|
int i;
|
|
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 );
|
|
if ( avl_insert( &si->si_presentlist,
|
|
(caddr_t) syncuuid_bv,
|
|
syncuuid_cmp, avl_dup_error ) )
|
|
{
|
|
ber_bvfree( syncuuid_bv );
|
|
}
|
|
}
|
|
slap_sl_free( syncUUIDs, op->o_tmpmemctx );
|
|
}
|
|
slap_sync_cookie_free( &syncCookie, 0 );
|
|
break;
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"do_syncrep2: %s unknown syncinfo tag (%ld)\n",
|
|
si->si_ridtxt, (long) si_tag, 0 );
|
|
ldap_memfree( retoid );
|
|
ber_bvfree( retdata );
|
|
continue;
|
|
}
|
|
|
|
if ( !syncCookie_req.ctxcsn ) {
|
|
match = -1;
|
|
m = 0;
|
|
} else if ( !syncCookie.ctxcsn ) {
|
|
match = 1;
|
|
} else {
|
|
match = compare_csns( &syncCookie_req, &syncCookie, &m );
|
|
}
|
|
|
|
if ( match < 0 ) {
|
|
if ( si->si_refreshPresent == 1 ) {
|
|
syncrepl_del_nonpresent( op, si, NULL,
|
|
&syncCookie.ctxcsn[m] );
|
|
}
|
|
|
|
if ( syncCookie.ctxcsn )
|
|
{
|
|
rc = syncrepl_updateCookie( si, op, psub, &syncCookie);
|
|
}
|
|
}
|
|
|
|
ldap_memfree( retoid );
|
|
ber_bvfree( retdata );
|
|
break;
|
|
|
|
} else {
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep2: %s "
|
|
"unknown intermediate response (%d)\n",
|
|
si->si_ridtxt, rc, 0 );
|
|
ldap_memfree( retoid );
|
|
ber_bvfree( retdata );
|
|
break;
|
|
}
|
|
break;
|
|
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY, "do_syncrep2: %s "
|
|
"unknown message\n", si->si_ridtxt, 0, 0 );
|
|
break;
|
|
|
|
}
|
|
if ( !BER_BVISNULL( &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 %s\n", si->si_ridtxt, errstr, 0 );
|
|
}
|
|
|
|
done:
|
|
slap_sync_cookie_free( &syncCookie, 0 );
|
|
slap_sync_cookie_free( &syncCookie_req, 0 );
|
|
|
|
if ( res ) ldap_msgfree( res );
|
|
|
|
if ( rc && rc != LDAP_SYNC_REFRESH_REQUIRED && si->si_ld ) {
|
|
if ( si->si_conn_setup ) {
|
|
ber_socket_t s;
|
|
ldap_get_option( si->si_ld, LDAP_OPT_DESC, &s );
|
|
connection_client_stop( s );
|
|
si->si_conn_setup = 0;
|
|
}
|
|
ldap_unbind_ext( si->si_ld, NULL, NULL );
|
|
si->si_ld = NULL;
|
|
}
|
|
|
|
return rc;
|
|
}
|
|
|
|
static void *
|
|
do_syncrepl(
|
|
void *ctx,
|
|
void *arg )
|
|
{
|
|
struct re_s* rtask = arg;
|
|
syncinfo_t *si = ( syncinfo_t * ) rtask->arg;
|
|
Connection conn = {0};
|
|
OperationBuffer opbuf;
|
|
Operation *op;
|
|
int rc = LDAP_SUCCESS;
|
|
int dostop = 0;
|
|
ber_socket_t s;
|
|
int i, defer = 1;
|
|
Backend *be;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "=>do_syncrepl %s\n", si->si_ridtxt, 0, 0 );
|
|
|
|
if ( si == NULL )
|
|
return NULL;
|
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_mutex );
|
|
|
|
switch( abs( si->si_type ) ) {
|
|
case LDAP_SYNC_REFRESH_ONLY:
|
|
case LDAP_SYNC_REFRESH_AND_PERSIST:
|
|
break;
|
|
default:
|
|
ldap_pvt_thread_mutex_unlock( &si->si_mutex );
|
|
return NULL;
|
|
}
|
|
|
|
if ( slapd_shutdown ) {
|
|
if ( si->si_ld ) {
|
|
if ( si->si_conn_setup ) {
|
|
ldap_get_option( si->si_ld, LDAP_OPT_DESC, &s );
|
|
connection_client_stop( s );
|
|
si->si_conn_setup = 0;
|
|
}
|
|
ldap_unbind_ext( si->si_ld, NULL, NULL );
|
|
si->si_ld = NULL;
|
|
}
|
|
ldap_pvt_thread_mutex_unlock( &si->si_mutex );
|
|
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_managedsait = SLAP_CONTROL_NONCRITICAL;
|
|
op->o_bd = be = si->si_be;
|
|
op->o_dn = op->o_bd->be_rootdn;
|
|
op->o_ndn = op->o_bd->be_rootndn;
|
|
if ( !si->si_schemachecking )
|
|
op->o_no_schema_check = 1;
|
|
|
|
/* If we're glued, send writes through the glue parent */
|
|
if ( !si->si_wbe ) {
|
|
if ( SLAP_GLUE_SUBORDINATE( be )) {
|
|
si->si_wbe = select_backend( &be->be_nsuffix[0], 0, 1 );
|
|
} else {
|
|
si->si_wbe = be;
|
|
}
|
|
}
|
|
|
|
/* Establish session, do search */
|
|
if ( !si->si_ld ) {
|
|
si->si_refreshDelete = 0;
|
|
si->si_refreshPresent = 0;
|
|
rc = do_syncrep1( op, si );
|
|
}
|
|
|
|
reload:
|
|
/* Process results */
|
|
if ( rc == LDAP_SUCCESS ) {
|
|
ldap_get_option( si->si_ld, LDAP_OPT_DESC, &s );
|
|
|
|
rc = do_syncrep2( op, si );
|
|
if ( rc == LDAP_SYNC_REFRESH_REQUIRED ) {
|
|
rc = ldap_sync_search( si, op->o_tmpmemctx );
|
|
goto reload;
|
|
}
|
|
|
|
/* We got deleted while running on cn=config */
|
|
if ( !si->si_ctype ) {
|
|
if ( si->si_conn_setup )
|
|
dostop = 1;
|
|
rc = -1;
|
|
}
|
|
|
|
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 ( si->si_conn_setup ) {
|
|
connection_client_enable( s );
|
|
} else {
|
|
rc = connection_client_setup( s, do_syncrepl, arg );
|
|
if ( rc == 0 )
|
|
si->si_conn_setup = 1;
|
|
}
|
|
} else if ( si->si_conn_setup ) {
|
|
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] != RETRYNUM_TAIL; i++ ) {
|
|
si->si_retrynum[i] = si->si_retrynum_init[i];
|
|
}
|
|
si->si_retrynum[i] = RETRYNUM_TAIL;
|
|
}
|
|
} else {
|
|
for ( i = 0; si->si_retrynum && si->si_retrynum[i] <= 0; i++ ) {
|
|
if ( si->si_retrynum[i] == RETRYNUM_FOREVER || si->si_retrynum[i] == RETRYNUM_TAIL )
|
|
break;
|
|
}
|
|
|
|
if ( !si->si_ctype
|
|
|| !si->si_retrynum || si->si_retrynum[i] == RETRYNUM_TAIL ) {
|
|
ldap_pvt_runqueue_remove( &slapd_rq, rtask );
|
|
} else if ( RETRYNUM_VALID( si->si_retrynum[i] ) ) {
|
|
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 );
|
|
ldap_pvt_thread_mutex_unlock( &si->si_mutex );
|
|
|
|
/* Do final delete cleanup */
|
|
if ( !si->si_ctype ) {
|
|
cookie_state *cs = NULL;
|
|
syncinfo_t **sip;
|
|
|
|
cs = be->be_syncinfo->si_cookieState;
|
|
for ( sip = &be->be_syncinfo; *sip != si; sip = &(*sip)->si_next );
|
|
*sip = si->si_next;
|
|
syncinfo_free( si );
|
|
if ( !be->be_syncinfo ) {
|
|
SLAP_DBFLAGS( be ) &= ~(SLAP_DBFLAG_SHADOW|SLAP_DBFLAG_SYNC_SHADOW);
|
|
if ( cs ) {
|
|
ber_bvarray_free( cs->cs_vals );
|
|
ldap_pvt_thread_mutex_destroy( &cs->cs_mutex );
|
|
ch_free( cs );
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
static slap_verbmasks modops[] = {
|
|
{ BER_BVC("add"), LDAP_REQ_ADD },
|
|
{ BER_BVC("delete"), LDAP_REQ_DELETE },
|
|
{ BER_BVC("modify"), LDAP_REQ_MODIFY },
|
|
{ BER_BVC("modrdn"), LDAP_REQ_MODRDN},
|
|
{ BER_BVNULL, 0 }
|
|
};
|
|
|
|
static Modifications *
|
|
syncrepl_accesslog_mods(
|
|
syncinfo_t *si,
|
|
struct berval *vals
|
|
)
|
|
{
|
|
char *colon;
|
|
const char *text;
|
|
AttributeDescription *ad;
|
|
struct berval bv, bv2;
|
|
short op;
|
|
Modifications *mod = NULL, *modlist = NULL, **modtail;
|
|
int i;
|
|
|
|
modtail = &modlist;
|
|
|
|
for (i=0; !BER_BVISNULL( &vals[i] ); i++) {
|
|
ad = NULL;
|
|
bv = vals[i];
|
|
|
|
colon = ber_bvchr( &bv, ':' );
|
|
if ( !colon ) {
|
|
/* Invalid */
|
|
continue;
|
|
}
|
|
|
|
bv.bv_len = colon - bv.bv_val;
|
|
if ( slap_bv2ad( &bv, &ad, &text ) ) {
|
|
/* Invalid */
|
|
continue;
|
|
}
|
|
|
|
/* Ignore dynamically generated attrs */
|
|
if ( ad->ad_type->sat_flags & SLAP_AT_DYNAMIC ) {
|
|
continue;
|
|
}
|
|
|
|
/* Ignore excluded attrs */
|
|
if ( ldap_charray_inlist( si->si_exattrs,
|
|
ad->ad_type->sat_cname.bv_val ) )
|
|
{
|
|
continue;
|
|
}
|
|
|
|
switch(colon[1]) {
|
|
case '+': op = LDAP_MOD_ADD; break;
|
|
case '-': op = LDAP_MOD_DELETE; break;
|
|
case '=': op = LDAP_MOD_REPLACE; break;
|
|
case '#': op = LDAP_MOD_INCREMENT; break;
|
|
default: continue;
|
|
}
|
|
|
|
if ( !mod || ad != mod->sml_desc || op != mod->sml_op ) {
|
|
mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
|
|
mod->sml_flags = 0;
|
|
mod->sml_op = op;
|
|
mod->sml_next = NULL;
|
|
mod->sml_desc = ad;
|
|
mod->sml_type = ad->ad_cname;
|
|
mod->sml_values = NULL;
|
|
mod->sml_nvalues = NULL;
|
|
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
}
|
|
if ( colon[2] == ' ' ) {
|
|
bv.bv_val = colon + 3;
|
|
bv.bv_len = vals[i].bv_len - ( bv.bv_val - vals[i].bv_val );
|
|
ber_dupbv( &bv2, &bv );
|
|
ber_bvarray_add( &mod->sml_values, &bv2 );
|
|
}
|
|
}
|
|
return modlist;
|
|
}
|
|
|
|
static Modifications *
|
|
syncrepl_changelog_mods(
|
|
syncinfo_t *si,
|
|
struct berval *vals
|
|
)
|
|
{
|
|
return NULL; /* FIXME */
|
|
}
|
|
|
|
static int
|
|
syncrepl_message_to_op(
|
|
syncinfo_t *si,
|
|
Operation *op,
|
|
LDAPMessage *msg
|
|
)
|
|
{
|
|
BerElement *ber = NULL;
|
|
Modifications *modlist = NULL;
|
|
logschema *ls;
|
|
SlapReply rs = { REP_RESULT };
|
|
slap_callback cb = { NULL, null_callback, NULL, NULL };
|
|
|
|
const char *text;
|
|
char txtbuf[SLAP_TEXT_BUFLEN];
|
|
size_t textlen = sizeof txtbuf;
|
|
|
|
struct berval bdn, dn = BER_BVNULL, ndn;
|
|
struct berval bv, *bvals = NULL;
|
|
struct berval rdn = BER_BVNULL, sup = BER_BVNULL,
|
|
prdn = BER_BVNULL, nrdn = BER_BVNULL,
|
|
psup = BER_BVNULL, nsup = BER_BVNULL;
|
|
int rc, deleteOldRdn = 0, freeReqDn = 0;
|
|
|
|
if ( ldap_msgtype( msg ) != LDAP_RES_SEARCH_ENTRY ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_op: %s "
|
|
"Message type should be entry (%d)",
|
|
si->si_ridtxt, ldap_msgtype( msg ), 0 );
|
|
return -1;
|
|
}
|
|
|
|
if ( si->si_syncdata == SYNCDATA_ACCESSLOG )
|
|
ls = &accesslog_sc;
|
|
else
|
|
ls = &changelog_sc;
|
|
|
|
rc = ldap_get_dn_ber( si->si_ld, msg, &ber, &bdn );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_message_to_op: %s dn get failed (%d)",
|
|
si->si_ridtxt, rc, 0 );
|
|
return rc;
|
|
}
|
|
|
|
op->o_tag = LBER_DEFAULT;
|
|
op->o_bd = si->si_wbe;
|
|
|
|
while (( rc = ldap_get_attribute_ber( si->si_ld, msg, ber, &bv, &bvals ) )
|
|
== LDAP_SUCCESS ) {
|
|
if ( bv.bv_val == NULL )
|
|
break;
|
|
|
|
if ( !ber_bvstrcasecmp( &bv, &ls->ls_dn ) ) {
|
|
bdn = bvals[0];
|
|
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 );
|
|
freeReqDn = 1;
|
|
} else if ( !ber_bvstrcasecmp( &bv, &ls->ls_req ) ) {
|
|
int i = verb_to_mask( bvals[0].bv_val, modops );
|
|
if ( i < 0 ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_message_to_op: %s unknown op %s",
|
|
si->si_ridtxt, bvals[0].bv_val, 0 );
|
|
ch_free( bvals );
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
op->o_tag = modops[i].mask;
|
|
} else if ( !ber_bvstrcasecmp( &bv, &ls->ls_mod ) ) {
|
|
/* Parse attribute into modlist */
|
|
if ( si->si_syncdata == SYNCDATA_ACCESSLOG ) {
|
|
modlist = syncrepl_accesslog_mods( si, bvals );
|
|
} else {
|
|
modlist = syncrepl_changelog_mods( si, bvals );
|
|
}
|
|
} else if ( !ber_bvstrcasecmp( &bv, &ls->ls_newRdn ) ) {
|
|
rdn = bvals[0];
|
|
} else if ( !ber_bvstrcasecmp( &bv, &ls->ls_delRdn ) ) {
|
|
if ( !ber_bvstrcasecmp( &slap_true_bv, bvals ) ) {
|
|
deleteOldRdn = 1;
|
|
}
|
|
} else if ( !ber_bvstrcasecmp( &bv, &ls->ls_newSup ) ) {
|
|
sup = bvals[0];
|
|
} else if ( !ber_bvstrcasecmp( &bv,
|
|
&slap_schema.si_ad_entryCSN->ad_cname ) )
|
|
{
|
|
slap_queue_csn( op, bvals );
|
|
}
|
|
ch_free( bvals );
|
|
}
|
|
|
|
/* If we didn't get a mod type or a target DN, bail out */
|
|
if ( op->o_tag == LBER_DEFAULT || BER_BVISNULL( &dn ) ) {
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
|
|
op->o_callback = &cb;
|
|
slap_op_time( &op->o_time, &op->o_tincr );
|
|
|
|
switch( op->o_tag ) {
|
|
case LDAP_REQ_ADD:
|
|
case LDAP_REQ_MODIFY:
|
|
/* If we didn't get required data, bail */
|
|
if ( !modlist ) goto done;
|
|
|
|
rc = slap_mods_check( op, modlist, &text, txtbuf, textlen, NULL );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_op: %s "
|
|
"mods check (%s)\n",
|
|
si->si_ridtxt, text, 0 );
|
|
goto done;
|
|
}
|
|
|
|
if ( op->o_tag == LDAP_REQ_ADD ) {
|
|
Entry *e = entry_alloc();
|
|
op->ora_e = e;
|
|
op->ora_e->e_name = op->o_req_dn;
|
|
op->ora_e->e_nname = op->o_req_ndn;
|
|
freeReqDn = 0;
|
|
rc = slap_mods2entry( modlist, &op->ora_e, 1, 0, &text, txtbuf, textlen);
|
|
if( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_op: %s "
|
|
"mods2entry (%s)\n",
|
|
si->si_ridtxt, text, 0 );
|
|
} else {
|
|
rc = op->o_bd->be_add( op, &rs );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_message_to_op: %s be_add %s (%d)\n",
|
|
si->si_ridtxt, op->o_req_dn.bv_val, rc );
|
|
}
|
|
if ( e == op->ora_e )
|
|
be_entry_release_w( op, op->ora_e );
|
|
} else {
|
|
op->orm_modlist = modlist;
|
|
op->o_bd = si->si_wbe;
|
|
rc = op->o_bd->be_modify( op, &rs );
|
|
Debug( rc ? LDAP_DEBUG_ANY : LDAP_DEBUG_SYNC,
|
|
"syncrepl_message_to_op: %s be_modify %s (%d)\n",
|
|
si->si_ridtxt, op->o_req_dn.bv_val, rc );
|
|
op->o_bd = si->si_be;
|
|
}
|
|
break;
|
|
case LDAP_REQ_MODRDN:
|
|
if ( BER_BVISNULL( &rdn ) ) goto done;
|
|
|
|
if ( rdnPretty( NULL, &rdn, &prdn, NULL ) ) {
|
|
goto done;
|
|
}
|
|
if ( rdnNormalize( 0, NULL, NULL, &rdn, &nrdn, NULL ) ) {
|
|
goto done;
|
|
}
|
|
if ( !BER_BVISNULL( &sup ) ) {
|
|
if ( dnPrettyNormal( NULL, &sup, &psup, &nsup, NULL ) ) {
|
|
goto done;
|
|
}
|
|
op->orr_newSup = &psup;
|
|
op->orr_nnewSup = ⊅
|
|
} else {
|
|
op->orr_newSup = NULL;
|
|
op->orr_nnewSup = NULL;
|
|
}
|
|
op->orr_newrdn = prdn;
|
|
op->orr_nnewrdn = nrdn;
|
|
op->orr_deleteoldrdn = deleteOldRdn;
|
|
op->orr_modlist = NULL;
|
|
if ( slap_modrdn2mods( op, &rs ) ) {
|
|
goto done;
|
|
}
|
|
|
|
/* Append modlist for operational attrs */
|
|
{
|
|
Modifications *m;
|
|
|
|
for ( m = op->orr_modlist; m->sml_next; m = m->sml_next )
|
|
;
|
|
m->sml_next = modlist;
|
|
modlist = NULL;
|
|
}
|
|
rc = op->o_bd->be_modrdn( op, &rs );
|
|
slap_mods_free( op->orr_modlist, 1 );
|
|
Debug( rc ? LDAP_DEBUG_ANY : LDAP_DEBUG_SYNC,
|
|
"syncrepl_message_to_op: %s be_modrdn %s (%d)\n",
|
|
si->si_ridtxt, op->o_req_dn.bv_val, rc );
|
|
break;
|
|
case LDAP_REQ_DELETE:
|
|
rc = op->o_bd->be_delete( op, &rs );
|
|
Debug( rc ? LDAP_DEBUG_ANY : LDAP_DEBUG_SYNC,
|
|
"syncrepl_message_to_op: %s be_delete %s (%d)\n",
|
|
si->si_ridtxt, op->o_req_dn.bv_val, rc );
|
|
break;
|
|
}
|
|
done:
|
|
slap_graduate_commit_csn( op );
|
|
op->o_bd = si->si_be;
|
|
op->o_tmpfree( op->o_csn.bv_val, op->o_tmpmemctx );
|
|
BER_BVZERO( &op->o_csn );
|
|
if ( modlist ) {
|
|
slap_mods_free( modlist, op->o_tag != LDAP_REQ_ADD );
|
|
}
|
|
if ( !BER_BVISNULL( &rdn ) ) {
|
|
if ( !BER_BVISNULL( &nsup ) ) {
|
|
ch_free( nsup.bv_val );
|
|
}
|
|
if ( !BER_BVISNULL( &psup ) ) {
|
|
ch_free( psup.bv_val );
|
|
}
|
|
if ( !BER_BVISNULL( &nrdn ) ) {
|
|
ch_free( nrdn.bv_val );
|
|
}
|
|
if ( !BER_BVISNULL( &prdn ) ) {
|
|
ch_free( prdn.bv_val );
|
|
}
|
|
}
|
|
if ( freeReqDn ) {
|
|
ch_free( op->o_req_ndn.bv_val );
|
|
ch_free( op->o_req_dn.bv_val );
|
|
}
|
|
ber_free( ber, 0 );
|
|
return rc;
|
|
}
|
|
|
|
static 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 = BER_BVNULL, dn, ndn;
|
|
int rc, is_ctx;
|
|
|
|
*modlist = NULL;
|
|
|
|
if ( ldap_msgtype( msg ) != LDAP_RES_SEARCH_ENTRY ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_entry: %s "
|
|
"Message type should be entry (%d)",
|
|
si->si_ridtxt, ldap_msgtype( msg ), 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: %s dn get failed (%d)",
|
|
si->si_ridtxt, rc, 0 );
|
|
return rc;
|
|
}
|
|
|
|
if ( syncstate == LDAP_SYNC_PRESENT || syncstate == LDAP_SYNC_DELETE ) {
|
|
/* NOTE: this could be done even before decoding the DN,
|
|
* although encoding errors wouldn't be detected */
|
|
rc = LDAP_SUCCESS;
|
|
goto done;
|
|
}
|
|
|
|
if ( entry == NULL ) {
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
|
|
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 );
|
|
|
|
is_ctx = dn_match( &op->o_req_ndn, &op->o_bd->be_nsuffix[0] );
|
|
|
|
e = entry_alloc();
|
|
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;
|
|
}
|
|
|
|
/* Drop all updates to the contextCSN of the context entry
|
|
* (ITS#4622, etc.)
|
|
*/
|
|
if ( is_ctx && !strcasecmp( tmp.sml_type.bv_val,
|
|
slap_schema.si_ad_contextCSN->ad_cname.bv_val )) {
|
|
ber_bvarray_free( tmp.sml_values );
|
|
continue;
|
|
}
|
|
|
|
mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
|
|
|
|
mod->sml_op = LDAP_MOD_REPLACE;
|
|
mod->sml_flags = 0;
|
|
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: %s no attributes\n",
|
|
si->si_ridtxt, 0, 0 );
|
|
rc = -1;
|
|
goto done;
|
|
}
|
|
|
|
rc = slap_mods_check( op, *modlist, &text, txtbuf, textlen, NULL );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_message_to_entry: %s mods check (%s)\n",
|
|
si->si_ridtxt, text, 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: %s mods2entry (%s)\n",
|
|
si->si_ridtxt, text, 0 );
|
|
}
|
|
|
|
done:
|
|
ber_free( ber, 0 );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
if ( e ) {
|
|
entry_free( e );
|
|
e = NULL;
|
|
}
|
|
}
|
|
*entry = e;
|
|
|
|
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 otherwise distinguish ModDN from Modify; in the case of
|
|
* a ModDN we just use the CSN, modifyTimestamp and modifiersName
|
|
* operational attributes from the entry, and do a regular ModDN.
|
|
*/
|
|
typedef struct dninfo {
|
|
Entry *new_entry;
|
|
struct berval dn;
|
|
struct berval ndn;
|
|
int renamed; /* Was an existing entry renamed? */
|
|
int delOldRDN; /* Was old RDN deleted? */
|
|
Modifications **modlist; /* the modlist we received */
|
|
Modifications *mods; /* the modlist we compared */
|
|
} dninfo;
|
|
|
|
static int
|
|
syncrepl_entry(
|
|
syncinfo_t* si,
|
|
Operation *op,
|
|
Entry* entry,
|
|
Modifications** modlist,
|
|
int syncstate,
|
|
struct berval* syncUUID )
|
|
{
|
|
Backend *be = op->o_bd;
|
|
slap_callback cb = { NULL, NULL, NULL, 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};
|
|
#ifdef LDAP_COMP_MATCH
|
|
AttributeAssertion ava = { NULL, BER_BVNULL, NULL };
|
|
#else
|
|
AttributeAssertion ava = { NULL, BER_BVNULL };
|
|
#endif
|
|
int rc = LDAP_SUCCESS;
|
|
|
|
struct berval pdn = BER_BVNULL;
|
|
dninfo dni = {0};
|
|
int retry = 1;
|
|
|
|
switch( syncstate ) {
|
|
case LDAP_SYNC_PRESENT:
|
|
Debug( LDAP_DEBUG_SYNC, "syncrepl_entry: %s %s\n",
|
|
si->si_ridtxt,
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_PRESENT)", 0 );
|
|
break;
|
|
case LDAP_SYNC_ADD:
|
|
Debug( LDAP_DEBUG_SYNC, "syncrepl_entry: %s %s\n",
|
|
si->si_ridtxt,
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_ADD)", 0 );
|
|
break;
|
|
case LDAP_SYNC_DELETE:
|
|
Debug( LDAP_DEBUG_SYNC, "syncrepl_entry: %s %s\n",
|
|
si->si_ridtxt,
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_DELETE)", 0 );
|
|
break;
|
|
case LDAP_SYNC_MODIFY:
|
|
Debug( LDAP_DEBUG_SYNC, "syncrepl_entry: %s %s\n",
|
|
si->si_ridtxt,
|
|
"LDAP_RES_SEARCH_ENTRY(LDAP_SYNC_MODIFY)", 0 );
|
|
break;
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY, "syncrepl_entry: %s %s\n",
|
|
si->si_ridtxt,
|
|
"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 );
|
|
if ( avl_insert( &si->si_presentlist, (caddr_t) syncuuid_bv,
|
|
syncuuid_cmp, avl_dup_error ) )
|
|
{
|
|
ber_bvfree( syncuuid_bv );
|
|
syncuuid_bv = NULL;
|
|
}
|
|
}
|
|
}
|
|
|
|
if ( syncstate == LDAP_SYNC_PRESENT ) {
|
|
return 0;
|
|
} else if ( syncstate != LDAP_SYNC_DELETE ) {
|
|
if ( entry == NULL ) {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
(void)slap_uuidstr_from_normalized( &syncUUID_strrep, syncUUID, op->o_tmpmemctx );
|
|
if ( syncstate != LDAP_SYNC_DELETE ) {
|
|
Attribute *a = attr_find( entry->e_attrs, slap_schema.si_ad_entryUUID );
|
|
|
|
if ( a == NULL ) {
|
|
/* add if missing */
|
|
attr_merge_one( entry, slap_schema.si_ad_entryUUID,
|
|
&syncUUID_strrep, syncUUID );
|
|
|
|
} else if ( !bvmatch( &a->a_nvals[0], syncUUID ) ) {
|
|
/* replace only if necessary */
|
|
if ( a->a_nvals != a->a_vals ) {
|
|
ber_memfree( a->a_nvals[0].bv_val );
|
|
ber_dupbv( &a->a_nvals[0], syncUUID );
|
|
}
|
|
ber_memfree( a->a_vals[0].bv_val );
|
|
ber_dupbv( &a->a_vals[0], &syncUUID_strrep );
|
|
}
|
|
}
|
|
|
|
f.f_choice = LDAP_FILTER_EQUALITY;
|
|
f.f_ava = &ava;
|
|
ava.aa_desc = slap_schema.si_ad_entryUUID;
|
|
ava.aa_value = *syncUUID;
|
|
|
|
if ( syncuuid_bv ) {
|
|
Debug( LDAP_DEBUG_SYNC, "syncrepl_entry: %s inserted UUID %s\n",
|
|
si->si_ridtxt, syncUUID_strrep.bv_val, 0 );
|
|
}
|
|
op->ors_filter = &f;
|
|
|
|
op->ors_filterstr.bv_len = STRLENOF( "(entryUUID=)" ) + syncUUID_strrep.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_strrep.bv_val, syncUUID_strrep.bv_len );
|
|
op->ors_filterstr.bv_val[op->ors_filterstr.bv_len - 1] = ')';
|
|
op->ors_filterstr.bv_val[op->ors_filterstr.bv_len] = '\0';
|
|
|
|
op->o_tag = LDAP_REQ_SEARCH;
|
|
op->ors_scope = LDAP_SCOPE_SUBTREE;
|
|
op->ors_deref = LDAP_DEREF_NEVER;
|
|
|
|
/* 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;
|
|
dni.modlist = modlist;
|
|
|
|
if ( limits_check( op, &rs_search ) == 0 ) {
|
|
rc = be->be_search( op, &rs_search );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s be_search (%d)\n",
|
|
si->si_ridtxt, 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 && !BER_BVISNULL( &entry->e_name ) ) {
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s %s\n",
|
|
si->si_ridtxt, entry->e_name.bv_val, 0 );
|
|
} else {
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s %s\n",
|
|
si->si_ridtxt, dni.dn.bv_val ? dni.dn.bv_val : "(null)", 0 );
|
|
}
|
|
|
|
slap_op_time( &op->o_time, &op->o_tincr );
|
|
switch ( syncstate ) {
|
|
case LDAP_SYNC_ADD:
|
|
case LDAP_SYNC_MODIFY:
|
|
{
|
|
Attribute *a = attr_find( entry->e_attrs, slap_schema.si_ad_entryCSN );
|
|
if ( a ) {
|
|
/* FIXME: op->o_csn is assumed to be
|
|
* on the thread's slab; this needs
|
|
* to be cleared ASAP.
|
|
* What happens if already present?
|
|
*/
|
|
assert( BER_BVISNULL( &op->o_csn ) );
|
|
op->o_csn = a->a_vals[0];
|
|
}
|
|
}
|
|
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;
|
|
op->o_bd = si->si_wbe;
|
|
|
|
rc = op->o_bd->be_add( op, &rs_add );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s be_add (%d)\n",
|
|
si->si_ridtxt, rc, 0 );
|
|
switch ( rs_add.sr_err ) {
|
|
case LDAP_SUCCESS:
|
|
if ( op->ora_e == entry ) {
|
|
be_entry_release_w( op, entry );
|
|
}
|
|
entry = NULL;
|
|
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:
|
|
rc = syncrepl_add_glue( op, entry );
|
|
entry = NULL;
|
|
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_bd = be;
|
|
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_deref = LDAP_DEREF_NEVER;
|
|
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;
|
|
|
|
rc = be->be_search( &op2, &rs2 );
|
|
if ( rc ) goto done;
|
|
|
|
retry = 0;
|
|
slap_op_time( &op->o_time, &op->o_tincr );
|
|
goto retry_add;
|
|
}
|
|
/* FALLTHRU */
|
|
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_entry: %s be_add failed (%d)\n",
|
|
si->si_ridtxt, rs_add.sr_err, 0 );
|
|
break;
|
|
}
|
|
op->o_bd = be;
|
|
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, &nnewp ) ) {
|
|
dnParent( &entry->e_name, &newp );
|
|
op->orr_newSup = &newp;
|
|
op->orr_nnewSup = &nnewp;
|
|
} else {
|
|
op->orr_newSup = NULL;
|
|
op->orr_nnewSup = NULL;
|
|
}
|
|
op->orr_deleteoldrdn = dni.delOldRDN;
|
|
op->orr_modlist = NULL;
|
|
if ( ( rc = slap_modrdn2mods( op, &rs_modify ) ) ) {
|
|
goto done;
|
|
}
|
|
|
|
/* RDNs must be NUL-terminated for back-ldap */
|
|
noldp = op->orr_newrdn;
|
|
ber_dupbv_x( &op->orr_newrdn, &noldp, op->o_tmpmemctx );
|
|
noldp = op->orr_nnewrdn;
|
|
ber_dupbv_x( &op->orr_nnewrdn, &noldp, op->o_tmpmemctx );
|
|
|
|
/* Setup opattrs too */
|
|
{
|
|
AttributeDescription *opattrs[] = {
|
|
slap_schema.si_ad_entryCSN,
|
|
slap_schema.si_ad_modifiersName,
|
|
slap_schema.si_ad_modifyTimestamp,
|
|
NULL
|
|
};
|
|
Modifications *mod, **modtail, **ml;
|
|
int i;
|
|
|
|
for ( mod = op->orr_modlist;
|
|
mod->sml_next;
|
|
mod = mod->sml_next )
|
|
;
|
|
modtail = &mod->sml_next;
|
|
|
|
/* pull mod off incoming modlist, append to orr_modlist */
|
|
for ( i = 0; opattrs[i]; i++ ) {
|
|
for ( ml = modlist; *ml; ml = &(*ml)->sml_next )
|
|
{
|
|
if ( (*ml)->sml_desc == opattrs[i] ) {
|
|
mod = *ml;
|
|
*ml = mod->sml_next;
|
|
mod->sml_next = NULL;
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
op->o_bd = si->si_wbe;
|
|
rc = op->o_bd->be_modrdn( op, &rs_modify );
|
|
op->o_tmpfree( op->orr_nnewrdn.bv_val, op->o_tmpmemctx );
|
|
op->o_tmpfree( op->orr_newrdn.bv_val, op->o_tmpmemctx );
|
|
|
|
slap_mods_free( op->orr_modlist, 1 );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s be_modrdn (%d)\n",
|
|
si->si_ridtxt, rc, 0 );
|
|
op->o_bd = be;
|
|
goto done;
|
|
}
|
|
if ( dni.mods ) {
|
|
op->o_tag = LDAP_REQ_MODIFY;
|
|
op->orm_modlist = dni.mods;
|
|
op->orm_no_opattrs = 1;
|
|
op->o_bd = si->si_wbe;
|
|
|
|
rc = op->o_bd->be_modify( op, &rs_modify );
|
|
slap_mods_free( op->orm_modlist, 1 );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s be_modify (%d)\n",
|
|
si->si_ridtxt, rc, 0 );
|
|
if ( rs_modify.sr_err != LDAP_SUCCESS ) {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_entry: %s be_modify failed (%d)\n",
|
|
si->si_ridtxt, rs_modify.sr_err, 0 );
|
|
}
|
|
op->o_bd = be;
|
|
} else {
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s entry unchanged, ignored (%s)\n",
|
|
si->si_ridtxt, op->o_req_dn.bv_val, 0 );
|
|
}
|
|
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;
|
|
op->o_bd = si->si_wbe;
|
|
rc = op->o_bd->be_delete( op, &rs_delete );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_entry: %s be_delete (%d)\n",
|
|
si->si_ridtxt, rc, 0 );
|
|
|
|
while ( rs_delete.sr_err == LDAP_SUCCESS
|
|
&& op->o_delete_glue_parent ) {
|
|
op->o_delete_glue_parent = 0;
|
|
if ( !be_issuffix( be, &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;
|
|
}
|
|
}
|
|
op->o_bd = be;
|
|
}
|
|
goto done;
|
|
|
|
default :
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_entry: %s unknown syncstate\n", si->si_ridtxt, 0, 0 );
|
|
goto done;
|
|
}
|
|
|
|
done:
|
|
if ( !BER_BVISNULL( &syncUUID_strrep ) ) {
|
|
slap_sl_free( syncUUID_strrep.bv_val, op->o_tmpmemctx );
|
|
BER_BVZERO( &syncUUID_strrep );
|
|
}
|
|
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 );
|
|
}
|
|
if ( entry )
|
|
entry_free( entry );
|
|
BER_BVZERO( &op->o_csn );
|
|
return rc;
|
|
}
|
|
|
|
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,
|
|
struct berval *cookiecsn )
|
|
{
|
|
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;
|
|
AttributeName an[2];
|
|
|
|
struct berval pdn = BER_BVNULL;
|
|
struct berval csn;
|
|
|
|
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;
|
|
#ifdef LDAP_COMP_MATCH
|
|
AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
|
|
#else
|
|
AttributeAssertion eq = { NULL, BER_BVNULL };
|
|
#endif
|
|
int i;
|
|
|
|
op->ors_attrsonly = 1;
|
|
op->ors_attrs = slap_anlist_no_attrs;
|
|
op->ors_limit = NULL;
|
|
op->ors_filter = &uf;
|
|
|
|
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;
|
|
slap_uuidstr_from_normalized( &uf.f_av_value, &uuids[i],
|
|
op->o_tmpmemctx );
|
|
filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
|
|
op->o_tmpfree( uf.f_av_value.bv_val, op->o_tmpmemctx );
|
|
uf.f_av_value = uuids[i];
|
|
rc = be->be_search( op, &rs_search );
|
|
op->o_tmpfree( op->ors_filterstr.bv_val, op->o_tmpmemctx );
|
|
}
|
|
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;
|
|
|
|
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_nocaching = 0;
|
|
|
|
if ( !LDAP_LIST_EMPTY( &si->si_nonpresentlist ) ) {
|
|
|
|
if ( cookiecsn && !BER_BVISNULL( cookiecsn ) ) {
|
|
csn = *cookiecsn;
|
|
} else {
|
|
csn = si->si_syncCookie.ctxcsn[0];
|
|
}
|
|
|
|
op->o_bd = si->si_wbe;
|
|
slap_queue_csn( op, &csn );
|
|
|
|
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 );
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"syncrepl_del_nonpresent: %s be_delete %s (%d)\n",
|
|
si->si_ridtxt, op->o_req_dn.bv_val, rc );
|
|
|
|
if ( rs_delete.sr_err == LDAP_NOT_ALLOWED_ON_NONLEAF ) {
|
|
Modifications mod1, mod2;
|
|
mod1.sml_op = LDAP_MOD_REPLACE;
|
|
mod1.sml_flags = 0;
|
|
mod1.sml_desc = slap_schema.si_ad_objectClass;
|
|
mod1.sml_type = mod1.sml_desc->ad_cname;
|
|
mod1.sml_values = &gcbva[0];
|
|
mod1.sml_nvalues = NULL;
|
|
mod1.sml_next = &mod2;
|
|
|
|
mod2.sml_op = LDAP_MOD_REPLACE;
|
|
mod2.sml_flags = 0;
|
|
mod2.sml_desc = slap_schema.si_ad_structuralObjectClass;
|
|
mod2.sml_type = mod2.sml_desc->ad_cname;
|
|
mod2.sml_values = &gcbva[1];
|
|
mod2.sml_nvalues = NULL;
|
|
mod2.sml_next = NULL;
|
|
|
|
op->o_tag = LDAP_REQ_MODIFY;
|
|
op->orm_modlist = &mod1;
|
|
|
|
rc = op->o_bd->be_modify( op, &rs_modify );
|
|
if ( mod2.sml_next ) slap_mods_free( mod2.sml_next, 1 );
|
|
}
|
|
|
|
while ( rs_delete.sr_err == LDAP_SUCCESS &&
|
|
op->o_delete_glue_parent ) {
|
|
op->o_delete_glue_parent = 0;
|
|
if ( !be_issuffix( be, &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_delete_glue_parent = 0;
|
|
|
|
ber_bvfree( np_prev->npe_name );
|
|
ber_bvfree( np_prev->npe_nname );
|
|
ch_free( np_prev );
|
|
}
|
|
|
|
slap_graduate_commit_csn( op );
|
|
op->o_bd = be;
|
|
|
|
op->o_tmpfree( op->o_csn.bv_val, op->o_tmpmemctx );
|
|
BER_BVZERO( &op->o_csn );
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
int
|
|
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 = BER_BVNULL;
|
|
struct berval ndn = BER_BVNULL;
|
|
Entry *glue;
|
|
SlapReply rs_add = {REP_RESULT};
|
|
struct berval ptr, nptr;
|
|
char *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], comma = ptr.bv_val; comma != NULL; comma = ber_bvchr( &ptr, ',' ) ) {
|
|
comma++;
|
|
ptr.bv_len -= comma - ptr.bv_val;
|
|
ptr.bv_val = comma;
|
|
i++;
|
|
}
|
|
suffrdns = i;
|
|
} else {
|
|
/* suffix is "" */
|
|
suffrdns = 0;
|
|
}
|
|
|
|
/* Start with BE suffix */
|
|
ptr = dn;
|
|
for ( i = 0; i < suffrdns; i++ ) {
|
|
comma = ber_bvrchr( &ptr, ',' );
|
|
if ( comma != NULL ) {
|
|
ptr.bv_len = comma - ptr.bv_val;
|
|
} else {
|
|
ptr.bv_len = 0;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if ( !BER_BVISEMPTY( &ptr ) ) {
|
|
dn.bv_len -= ptr.bv_len + 1;
|
|
dn.bv_val += ptr.bv_len + 1;
|
|
}
|
|
|
|
/* the normalizedDNs are always the same length, no counting
|
|
* required.
|
|
*/
|
|
nptr = ndn;
|
|
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;
|
|
|
|
nptr.bv_len = ndn.bv_val - nptr.bv_val - 1;
|
|
|
|
} else {
|
|
nptr.bv_len = 0;
|
|
}
|
|
|
|
while ( ndn.bv_val > e->e_nname.bv_val ) {
|
|
glue = entry_alloc();
|
|
ber_dupbv( &glue->e_name, &dn );
|
|
ber_dupbv( &glue->e_nname, &ndn );
|
|
|
|
a = attr_alloc( 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 = attr_alloc( 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 ) {
|
|
if ( op->ora_e == glue )
|
|
be_entry_release_w( op, glue );
|
|
} else {
|
|
/* incl. ALREADY EXIST */
|
|
entry_free( glue );
|
|
if ( rs_add.sr_err != LDAP_ALREADY_EXISTS ) {
|
|
entry_free( e );
|
|
return rc;
|
|
}
|
|
}
|
|
|
|
/* Move to next child */
|
|
comma = ber_bvrchr( &ptr, ',' );
|
|
if ( comma == NULL ) {
|
|
break;
|
|
}
|
|
ptr.bv_len = comma - ptr.bv_val;
|
|
|
|
dn.bv_val = ++comma;
|
|
dn.bv_len = e->e_name.bv_len - (dn.bv_val - e->e_name.bv_val);
|
|
|
|
comma = ber_bvrchr( &nptr, ',' );
|
|
assert( comma != NULL );
|
|
nptr.bv_len = comma - nptr.bv_val;
|
|
|
|
ndn.bv_val = ++comma;
|
|
ndn.bv_len = e->e_nname.bv_len - (ndn.bv_val - 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 ) {
|
|
if ( op->ora_e == e )
|
|
be_entry_release_w( op, e );
|
|
} else {
|
|
entry_free( e );
|
|
}
|
|
|
|
return rc;
|
|
}
|
|
|
|
static int
|
|
syncrepl_updateCookie(
|
|
syncinfo_t *si,
|
|
Operation *op,
|
|
struct berval *pdn,
|
|
struct sync_cookie *syncCookie )
|
|
{
|
|
Backend *be = op->o_bd;
|
|
Modifications mod[2];
|
|
struct berval first = BER_BVNULL;
|
|
|
|
int rc, i, j;
|
|
|
|
slap_callback cb = { NULL };
|
|
SlapReply rs_modify = {REP_RESULT};
|
|
|
|
mod[0].sml_op = LDAP_MOD_DELETE;
|
|
mod[0].sml_desc = slap_schema.si_ad_contextCSN;
|
|
mod[0].sml_type = mod[0].sml_desc->ad_cname;
|
|
mod[0].sml_values = NULL;
|
|
mod[0].sml_nvalues = NULL;
|
|
mod[0].sml_next = &mod[1];
|
|
|
|
mod[1].sml_op = LDAP_MOD_ADD;
|
|
mod[1].sml_desc = slap_schema.si_ad_contextCSN;
|
|
mod[1].sml_type = mod[0].sml_desc->ad_cname;
|
|
mod[1].sml_values = NULL;
|
|
mod[1].sml_nvalues = NULL;
|
|
mod[1].sml_next = NULL;
|
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_cookieState->cs_mutex );
|
|
|
|
for ( i=0; i<syncCookie->numcsns; i++ ) {
|
|
for ( j=0; j<si->si_cookieState->cs_num; j++ ) {
|
|
if ( syncCookie->sids[i] != si->si_cookieState->cs_sids[j] )
|
|
continue;
|
|
if ( ber_bvcmp( &syncCookie->ctxcsn[i],
|
|
&si->si_cookieState->cs_vals[j] ) > 0 ) {
|
|
ber_bvarray_add_x( &mod[0].sml_values,
|
|
&si->si_cookieState->cs_vals[j], op->o_tmpmemctx );
|
|
ber_bvarray_add_x( &mod[1].sml_values,
|
|
&syncCookie->ctxcsn[i], op->o_tmpmemctx );
|
|
if ( BER_BVISNULL( &first ))
|
|
first = syncCookie->ctxcsn[i];
|
|
}
|
|
break;
|
|
}
|
|
/* there was no match for this SID, it's a new CSN */
|
|
if ( j == si->si_cookieState->cs_num ) {
|
|
ber_bvarray_add_x( &mod[1].sml_values,
|
|
&syncCookie->ctxcsn[i], op->o_tmpmemctx );
|
|
if ( BER_BVISNULL( &first ))
|
|
first = syncCookie->ctxcsn[i];
|
|
}
|
|
}
|
|
op->o_bd = si->si_wbe;
|
|
slap_queue_csn( op, &first );
|
|
|
|
op->o_tag = LDAP_REQ_MODIFY;
|
|
|
|
cb.sc_response = null_callback;
|
|
cb.sc_private = si;
|
|
|
|
op->o_callback = &cb;
|
|
op->o_req_dn = op->o_bd->be_suffix[0];
|
|
op->o_req_ndn = op->o_bd->be_nsuffix[0];
|
|
|
|
/* update contextCSN */
|
|
op->o_msgid = SLAP_SYNC_UPDATE_MSGID;
|
|
|
|
if ( mod[0].sml_values )
|
|
op->orm_modlist = mod;
|
|
else
|
|
op->orm_modlist = &mod[1];
|
|
|
|
op->orm_no_opattrs = 1;
|
|
rc = op->o_bd->be_modify( op, &rs_modify );
|
|
op->o_msgid = 0;
|
|
|
|
if ( rs_modify.sr_err == LDAP_SUCCESS ) {
|
|
slap_sync_cookie_free( &si->si_syncCookie, 0 );
|
|
slap_dup_sync_cookie( &si->si_syncCookie, syncCookie );
|
|
/* If we replaced any old values */
|
|
if ( mod[0].sml_values ) {
|
|
for ( i=0; !BER_BVISNULL( &mod[0].sml_values[i] ); i++ ) {
|
|
for ( j=0; j<si->si_cookieState->cs_num; j++ ) {
|
|
if ( mod[0].sml_values[i].bv_val !=
|
|
si->si_cookieState->cs_vals[j].bv_val )
|
|
continue;
|
|
ber_bvreplace( &si->si_cookieState->cs_vals[j],
|
|
&mod[1].sml_values[i] );
|
|
break;
|
|
}
|
|
}
|
|
} else {
|
|
/* Else we just added */
|
|
si->si_cookieState->cs_num += syncCookie->numcsns;
|
|
value_add( &si->si_cookieState->cs_vals, syncCookie->ctxcsn );
|
|
free( si->si_cookieState->cs_sids );
|
|
si->si_cookieState->cs_sids = slap_parse_csn_sids(
|
|
si->si_cookieState->cs_vals, si->si_cookieState->cs_num );
|
|
}
|
|
|
|
si->si_cookieState->cs_age++;
|
|
si->si_cookieAge = si->si_cookieState->cs_age;
|
|
} else {
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"syncrepl_updateCookie: %s be_modify failed (%d)\n",
|
|
si->si_ridtxt, rs_modify.sr_err, 0 );
|
|
}
|
|
ldap_pvt_thread_mutex_unlock( &si->si_cookieState->cs_mutex );
|
|
|
|
slap_graduate_commit_csn( op );
|
|
op->o_bd = be;
|
|
op->o_tmpfree( op->o_csn.bv_val, op->o_tmpmemctx );
|
|
BER_BVZERO( &op->o_csn );
|
|
if ( mod[1].sml_next ) slap_mods_free( mod[1].sml_next, 1 );
|
|
op->o_tmpfree( mod[1].sml_values, op->o_tmpmemctx );
|
|
op->o_tmpfree( mod[0].sml_values, op->o_tmpmemctx );
|
|
|
|
return rc;
|
|
}
|
|
|
|
static void
|
|
attr_cmp( Operation *op, Attribute *old, Attribute *new,
|
|
Modifications ***mret, Modifications ***mcur )
|
|
{
|
|
int i, j;
|
|
Modifications *mod, **modtail;
|
|
|
|
modtail = *mret;
|
|
|
|
if ( old ) {
|
|
int n, o, d, a, *adds, *dels;
|
|
/* count old and new */
|
|
for ( o=0; old->a_vals[o].bv_val; o++ ) ;
|
|
for ( n=0; new->a_vals[n].bv_val; n++ ) ;
|
|
|
|
adds = op->o_tmpalloc( sizeof(int) * n, op->o_tmpmemctx );
|
|
dels = op->o_tmpalloc( sizeof(int) * o, op->o_tmpmemctx );
|
|
d = 0;
|
|
a = 0;
|
|
i = 0;
|
|
j = 0;
|
|
|
|
while ( i < o && j < n ) {
|
|
int k;
|
|
if ( bvmatch( &old->a_vals[i], &new->a_vals[j] ) ) {
|
|
i++;
|
|
j++;
|
|
continue;
|
|
}
|
|
for ( k = j + 1; k<n; k++ ) {
|
|
if ( bvmatch( &old->a_vals[i], &new->a_vals[k] ) ) {
|
|
break;
|
|
}
|
|
}
|
|
/* an old value was deleted */
|
|
if ( k == n ) {
|
|
dels[d++] = i++;
|
|
continue;
|
|
}
|
|
for ( k = i + 1; k < o; k++ ) {
|
|
if ( bvmatch( &old->a_vals[k], &new->a_vals[j] ) ) {
|
|
break;
|
|
}
|
|
}
|
|
if ( k == o ) {
|
|
adds[a++] = j++;
|
|
}
|
|
}
|
|
while ( i < o )
|
|
dels[d++] = i++;
|
|
while ( j < n )
|
|
adds[a++] = j++;
|
|
|
|
/* all old values were deleted, just use the replace op */
|
|
if ( d == o ) {
|
|
i = j-1;
|
|
} else if ( d ) {
|
|
/* delete some values */
|
|
mod = ch_malloc( sizeof( Modifications ) );
|
|
mod->sml_op = LDAP_MOD_DELETE;
|
|
mod->sml_flags = 0;
|
|
mod->sml_desc = old->a_desc;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = ch_malloc( ( d + 1 ) * sizeof(struct berval) );
|
|
if ( old->a_vals != old->a_nvals ) {
|
|
mod->sml_nvalues = ch_malloc( ( d + 1 ) * sizeof(struct berval) );
|
|
} else {
|
|
mod->sml_nvalues = NULL;
|
|
}
|
|
for ( i = 0; i < d; i++ ) {
|
|
ber_dupbv( &mod->sml_values[i], &old->a_vals[dels[i]] );
|
|
if ( mod->sml_nvalues ) {
|
|
ber_dupbv( &mod->sml_nvalues[i], &old->a_nvals[dels[i]] );
|
|
}
|
|
}
|
|
BER_BVZERO( &mod->sml_values[i] );
|
|
if ( mod->sml_nvalues ) {
|
|
BER_BVZERO( &mod->sml_nvalues[i] );
|
|
}
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
i = j;
|
|
}
|
|
op->o_tmpfree( dels, op->o_tmpmemctx );
|
|
/* some values were added */
|
|
if ( a && d < o ) {
|
|
mod = ch_malloc( sizeof( Modifications ) );
|
|
mod->sml_op = LDAP_MOD_ADD;
|
|
mod->sml_flags = 0;
|
|
mod->sml_desc = old->a_desc;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = ch_malloc( ( a + 1 ) * sizeof(struct berval) );
|
|
if ( old->a_vals != old->a_nvals ) {
|
|
mod->sml_nvalues = ch_malloc( ( a + 1 ) * sizeof(struct berval) );
|
|
} else {
|
|
mod->sml_nvalues = NULL;
|
|
}
|
|
for ( i = 0; i < a; i++ ) {
|
|
ber_dupbv( &mod->sml_values[i], &new->a_vals[adds[i]] );
|
|
if ( mod->sml_nvalues ) {
|
|
ber_dupbv( &mod->sml_nvalues[i], &new->a_nvals[adds[i]] );
|
|
}
|
|
}
|
|
BER_BVZERO( &mod->sml_values[i] );
|
|
if ( mod->sml_nvalues ) {
|
|
BER_BVZERO( &mod->sml_nvalues[i] );
|
|
}
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
i = j;
|
|
}
|
|
op->o_tmpfree( adds, op->o_tmpmemctx );
|
|
} else {
|
|
/* new attr, just use the new mod */
|
|
i = 0;
|
|
j = 1;
|
|
}
|
|
/* advance to next element */
|
|
mod = **mcur;
|
|
if ( mod ) {
|
|
if ( i != j ) {
|
|
**mcur = mod->sml_next;
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
} else {
|
|
*mcur = &mod->sml_next;
|
|
}
|
|
}
|
|
*mret = modtail;
|
|
}
|
|
|
|
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 ) {
|
|
Modifications **modtail, **ml;
|
|
Attribute *old, *new;
|
|
int i, is_ctx;
|
|
|
|
is_ctx = dn_match( &rs->sr_entry->e_nname,
|
|
&op->o_bd->be_nsuffix[0] );
|
|
|
|
/* Did the DN change?
|
|
*/
|
|
if ( !dn_match( &rs->sr_entry->e_name,
|
|
&dni->new_entry->e_name ) )
|
|
{
|
|
struct berval oldRDN, oldVal;
|
|
AttributeDescription *ad = NULL;
|
|
Attribute *a;
|
|
|
|
dni->renamed = 1;
|
|
/* See if the oldRDN was deleted */
|
|
dnRdn( &rs->sr_entry->e_nname, &oldRDN );
|
|
oldVal.bv_val = strchr(oldRDN.bv_val, '=') + 1;
|
|
oldVal.bv_len = oldRDN.bv_len - ( oldVal.bv_val -
|
|
oldRDN.bv_val );
|
|
oldRDN.bv_len -= oldVal.bv_len + 2;
|
|
slap_bv2ad( &oldRDN, &ad, &rs->sr_text );
|
|
a = attr_find( dni->new_entry->e_attrs, ad );
|
|
if ( !a || value_find_ex( ad,
|
|
SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH |
|
|
SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
|
|
SLAP_MR_VALUE_OF_SYNTAX, a->a_nvals,
|
|
&oldVal, op->o_tmpmemctx ) != LDAP_SUCCESS )
|
|
{
|
|
dni->delOldRDN = 1;
|
|
}
|
|
/* OK, this was just a modDN, we're done */
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
modtail = &dni->mods;
|
|
ml = dni->modlist;
|
|
|
|
/* Make sure new entry is actually newer than old entry */
|
|
old = attr_find( rs->sr_entry->e_attrs,
|
|
slap_schema.si_ad_entryCSN );
|
|
new = attr_find( dni->new_entry->e_attrs,
|
|
slap_schema.si_ad_entryCSN );
|
|
if ( new && old && ber_bvcmp( &old->a_vals[0],
|
|
&new->a_vals[0] ) >= 0 ) {
|
|
Debug( LDAP_DEBUG_SYNC,
|
|
"dn_callback : new entry is older than ours "
|
|
"%s ours %s, new %s\n",
|
|
rs->sr_entry->e_name.bv_val,
|
|
old->a_vals[0].bv_val,
|
|
new->a_vals[0].bv_val );
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* 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, look for an add or delete.
|
|
*/
|
|
for ( old = rs->sr_entry->e_attrs, new = dni->new_entry->e_attrs;
|
|
old && new; )
|
|
{
|
|
/* If we've seen this before, use its mod now */
|
|
if ( new->a_flags & SLAP_ATTR_IXADD ) {
|
|
attr_cmp( op, NULL, new, &modtail, &ml );
|
|
new = new->a_next;
|
|
continue;
|
|
}
|
|
/* Skip contextCSN */
|
|
if ( is_ctx && old->a_desc ==
|
|
slap_schema.si_ad_contextCSN ) {
|
|
old = old->a_next;
|
|
continue;
|
|
}
|
|
|
|
if ( old->a_desc != new->a_desc ) {
|
|
Modifications *mod;
|
|
Attribute *tmp;
|
|
|
|
/* If it's just been re-added later,
|
|
* remember that we've seen it.
|
|
*/
|
|
tmp = attr_find( new, old->a_desc );
|
|
if ( tmp ) {
|
|
tmp->a_flags |= SLAP_ATTR_IXADD;
|
|
} else {
|
|
/* If it's a new attribute, pull it in.
|
|
*/
|
|
tmp = attr_find( old, new->a_desc );
|
|
if ( !tmp ) {
|
|
attr_cmp( op, NULL, new, &modtail, &ml );
|
|
new = new->a_next;
|
|
continue;
|
|
}
|
|
/* Delete old attr */
|
|
mod = ch_malloc( sizeof( Modifications ) );
|
|
mod->sml_op = LDAP_MOD_DELETE;
|
|
mod->sml_flags = 0;
|
|
mod->sml_desc = old->a_desc;
|
|
mod->sml_type = mod->sml_desc->ad_cname;
|
|
mod->sml_values = NULL;
|
|
mod->sml_nvalues = NULL;
|
|
*modtail = mod;
|
|
modtail = &mod->sml_next;
|
|
}
|
|
old = old->a_next;
|
|
continue;
|
|
}
|
|
/* kludge - always update modifiersName so that it
|
|
* stays co-located with the other mod opattrs. But only
|
|
* if we know there are other valid mods.
|
|
*/
|
|
if ( old->a_desc == slap_schema.si_ad_modifiersName &&
|
|
dni->mods )
|
|
attr_cmp( op, NULL, new, &modtail, &ml );
|
|
else
|
|
attr_cmp( op, old, new, &modtail, &ml );
|
|
new = new->a_next;
|
|
old = old->a_next;
|
|
}
|
|
*modtail = *ml;
|
|
*ml = NULL;
|
|
}
|
|
}
|
|
} 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 ) ) {
|
|
char buf[sizeof("rid=000 not")];
|
|
|
|
a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
|
|
|
|
if ( a ) {
|
|
present_uuid = avl_find( si->si_presentlist, &a->a_nvals[0],
|
|
syncuuid_cmp );
|
|
}
|
|
|
|
if ( slap_debug & LDAP_DEBUG_SYNC ) {
|
|
sprintf( buf, "%s %s", si->si_ridtxt,
|
|
present_uuid ? "got" : "not" );
|
|
}
|
|
|
|
Debug( LDAP_DEBUG_SYNC, "nonpresent_callback: %s UUID %s, dn %s\n",
|
|
buf, a ? a->a_vals[0].bv_val : "<missing>", rs->sr_entry->e_name.bv_val );
|
|
|
|
if ( a == NULL ) return 0;
|
|
}
|
|
|
|
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;
|
|
}
|
|
|
|
static 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_ld ) {
|
|
if ( sie->si_conn_setup ) {
|
|
ber_socket_t s;
|
|
ldap_get_option( sie->si_ld, LDAP_OPT_DESC, &s );
|
|
connection_client_stop( s );
|
|
sie->si_conn_setup = 0;
|
|
}
|
|
ldap_unbind_ext( sie->si_ld, NULL, NULL );
|
|
}
|
|
|
|
/* re-fetch it, in case it was already removed */
|
|
sie->si_re = ldap_pvt_runqueue_find( &slapd_rq, do_syncrepl, sie );
|
|
if ( sie->si_re ) {
|
|
if ( ldap_pvt_runqueue_isrunning( &slapd_rq, sie->si_re ) )
|
|
ldap_pvt_runqueue_stoptask( &slapd_rq, sie->si_re );
|
|
ldap_pvt_runqueue_remove( &slapd_rq, sie->si_re );
|
|
}
|
|
|
|
ldap_pvt_thread_mutex_destroy( &sie->si_mutex );
|
|
|
|
bindconf_free( &sie->si_bindconf );
|
|
|
|
if ( sie->si_filterstr.bv_val ) {
|
|
ch_free( sie->si_filterstr.bv_val );
|
|
}
|
|
if ( sie->si_logfilterstr.bv_val ) {
|
|
ch_free( sie->si_logfilterstr.bv_val );
|
|
}
|
|
if ( sie->si_base.bv_val ) {
|
|
ch_free( sie->si_base.bv_val );
|
|
}
|
|
if ( sie->si_logbase.bv_val ) {
|
|
ch_free( sie->si_logbase.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 );
|
|
}
|
|
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 );
|
|
}
|
|
|
|
|
|
|
|
/* NOTE: used & documented in slapd.conf(5) */
|
|
#define IDSTR "rid"
|
|
#define PROVIDERSTR "provider"
|
|
#define SCHEMASTR "schemachecking"
|
|
#define FILTERSTR "filter"
|
|
#define SEARCHBASESTR "searchbase"
|
|
#define SCOPESTR "scope"
|
|
#define ATTRSONLYSTR "attrsonly"
|
|
#define ATTRSSTR "attrs"
|
|
#define TYPESTR "type"
|
|
#define INTERVALSTR "interval"
|
|
#define RETRYSTR "retry"
|
|
#define SLIMITSTR "sizelimit"
|
|
#define TLIMITSTR "timelimit"
|
|
#define SYNCDATASTR "syncdata"
|
|
#define LOGBASESTR "logbase"
|
|
#define LOGFILTERSTR "logfilter"
|
|
|
|
/* FIXME: undocumented */
|
|
#define EXATTRSSTR "exattrs"
|
|
#define MANAGEDSAITSTR "manageDSAit"
|
|
|
|
/* mandatory */
|
|
#define GOT_ID 0x0001
|
|
#define GOT_PROVIDER 0x0002
|
|
#define GOT_BASE 0x0004
|
|
|
|
/* check */
|
|
#define GOT_ALL (GOT_ID|GOT_PROVIDER|GOT_BASE)
|
|
|
|
static struct {
|
|
struct berval key;
|
|
int val;
|
|
} scopes[] = {
|
|
{ BER_BVC("base"), LDAP_SCOPE_BASE },
|
|
{ BER_BVC("one"), LDAP_SCOPE_ONELEVEL },
|
|
{ BER_BVC("onelevel"), LDAP_SCOPE_ONELEVEL }, /* OpenLDAP extension */
|
|
{ BER_BVC("children"), LDAP_SCOPE_SUBORDINATE },
|
|
{ BER_BVC("subord"), LDAP_SCOPE_SUBORDINATE },
|
|
{ BER_BVC("subordinate"), LDAP_SCOPE_SUBORDINATE },
|
|
{ BER_BVC("sub"), LDAP_SCOPE_SUBTREE },
|
|
{ BER_BVC("subtree"), LDAP_SCOPE_SUBTREE }, /* OpenLDAP extension */
|
|
{ BER_BVNULL, 0 }
|
|
};
|
|
|
|
static slap_verbmasks datamodes[] = {
|
|
{ BER_BVC("default"), SYNCDATA_DEFAULT },
|
|
{ BER_BVC("accesslog"), SYNCDATA_ACCESSLOG },
|
|
{ BER_BVC("changelog"), SYNCDATA_CHANGELOG },
|
|
{ BER_BVNULL, 0 }
|
|
};
|
|
|
|
static int
|
|
parse_syncrepl_line(
|
|
ConfigArgs *c,
|
|
syncinfo_t *si )
|
|
{
|
|
int gots = 0;
|
|
int i;
|
|
char *val;
|
|
|
|
for ( i = 1; i < c->argc; i++ ) {
|
|
if ( !strncasecmp( c->argv[ i ], IDSTR "=",
|
|
STRLENOF( IDSTR "=" ) ) )
|
|
{
|
|
int tmp;
|
|
/* '\0' string terminator accounts for '=' */
|
|
val = c->argv[ i ] + STRLENOF( IDSTR "=" );
|
|
if ( lutil_atoi( &tmp, val ) != 0 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"unable to parse syncrepl id \"%s\"", val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
if ( tmp >= 1000 || tmp < 0 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"syncrepl id %d is out of range [0..999]", tmp );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
si->si_rid = tmp;
|
|
sprintf( si->si_ridtxt, IDSTR "=%03d", si->si_rid );
|
|
gots |= GOT_ID;
|
|
} else if ( !strncasecmp( c->argv[ i ], PROVIDERSTR "=",
|
|
STRLENOF( PROVIDERSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( PROVIDERSTR "=" );
|
|
ber_str2bv( val, 0, 1, &si->si_bindconf.sb_uri );
|
|
gots |= GOT_PROVIDER;
|
|
} else if ( !strncasecmp( c->argv[ i ], SCHEMASTR "=",
|
|
STRLENOF( SCHEMASTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( SCHEMASTR "=" );
|
|
if ( !strncasecmp( val, "on", STRLENOF( "on" ) ) ) {
|
|
si->si_schemachecking = 1;
|
|
} else if ( !strncasecmp( val, "off", STRLENOF( "off" ) ) ) {
|
|
si->si_schemachecking = 0;
|
|
} else {
|
|
si->si_schemachecking = 1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], FILTERSTR "=",
|
|
STRLENOF( FILTERSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( FILTERSTR "=" );
|
|
if ( si->si_filterstr.bv_val )
|
|
ch_free( si->si_filterstr.bv_val );
|
|
ber_str2bv( val, 0, 1, &si->si_filterstr );
|
|
} else if ( !strncasecmp( c->argv[ i ], LOGFILTERSTR "=",
|
|
STRLENOF( LOGFILTERSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( LOGFILTERSTR "=" );
|
|
if ( si->si_logfilterstr.bv_val )
|
|
ch_free( si->si_logfilterstr.bv_val );
|
|
ber_str2bv( val, 0, 1, &si->si_logfilterstr );
|
|
} else if ( !strncasecmp( c->argv[ i ], SEARCHBASESTR "=",
|
|
STRLENOF( SEARCHBASESTR "=" ) ) )
|
|
{
|
|
struct berval bv;
|
|
int rc;
|
|
|
|
val = c->argv[ i ] + STRLENOF( SEARCHBASESTR "=" );
|
|
if ( si->si_base.bv_val ) {
|
|
ch_free( si->si_base.bv_val );
|
|
}
|
|
ber_str2bv( val, 0, 0, &bv );
|
|
rc = dnNormalize( 0, NULL, NULL, &bv, &si->si_base, NULL );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Invalid base DN \"%s\": %d (%s)",
|
|
val, rc, ldap_err2string( rc ) );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
gots |= GOT_BASE;
|
|
} else if ( !strncasecmp( c->argv[ i ], LOGBASESTR "=",
|
|
STRLENOF( LOGBASESTR "=" ) ) )
|
|
{
|
|
struct berval bv;
|
|
int rc;
|
|
|
|
val = c->argv[ i ] + STRLENOF( LOGBASESTR "=" );
|
|
if ( si->si_logbase.bv_val ) {
|
|
ch_free( si->si_logbase.bv_val );
|
|
}
|
|
ber_str2bv( val, 0, 0, &bv );
|
|
rc = dnNormalize( 0, NULL, NULL, &bv, &si->si_logbase, NULL );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Invalid logbase DN \"%s\": %d (%s)",
|
|
val, rc, ldap_err2string( rc ) );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], SCOPESTR "=",
|
|
STRLENOF( SCOPESTR "=" ) ) )
|
|
{
|
|
int j;
|
|
val = c->argv[ i ] + STRLENOF( SCOPESTR "=" );
|
|
for ( j = 0; !BER_BVISNULL(&scopes[j].key); j++ ) {
|
|
if (!strcasecmp( val, scopes[j].key.bv_val ) ) {
|
|
si->si_scope = scopes[j].val;
|
|
break;
|
|
}
|
|
}
|
|
if ( BER_BVISNULL(&scopes[j].key) ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"unknown scope \"%s\"", val);
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], ATTRSONLYSTR,
|
|
STRLENOF( ATTRSONLYSTR ) ) )
|
|
{
|
|
si->si_attrsonly = 1;
|
|
} else if ( !strncasecmp( c->argv[ i ], ATTRSSTR "=",
|
|
STRLENOF( ATTRSSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( ATTRSSTR "=" );
|
|
if ( !strncasecmp( val, ":include:", STRLENOF(":include:") ) ) {
|
|
char *attr_fname;
|
|
attr_fname = ch_strdup( val + STRLENOF(":include:") );
|
|
si->si_anlist = file2anlist( si->si_anlist, attr_fname, " ,\t" );
|
|
if ( si->si_anlist == NULL ) {
|
|
ch_free( attr_fname );
|
|
return -1;
|
|
}
|
|
si->si_anfile = attr_fname;
|
|
} else {
|
|
char *str, *s, *next;
|
|
char delimstr[] = " ,\t";
|
|
str = ch_strdup( val );
|
|
for ( s = ldap_pvt_strtok( str, delimstr, &next );
|
|
s != NULL;
|
|
s = ldap_pvt_strtok( NULL, delimstr, &next ) )
|
|
{
|
|
if ( strlen(s) == 1 && *s == '*' ) {
|
|
si->si_allattrs = 1;
|
|
val[ s - str ] = delimstr[0];
|
|
}
|
|
if ( strlen(s) == 1 && *s == '+' ) {
|
|
si->si_allopattrs = 1;
|
|
val [ s - str ] = delimstr[0];
|
|
}
|
|
}
|
|
ch_free( str );
|
|
si->si_anlist = str2anlist( si->si_anlist, val, " ,\t" );
|
|
if ( si->si_anlist == NULL ) {
|
|
return -1;
|
|
}
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], EXATTRSSTR "=",
|
|
STRLENOF( EXATTRSSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( EXATTRSSTR "=" );
|
|
if ( !strncasecmp( val, ":include:", STRLENOF(":include:") ) ) {
|
|
char *attr_fname;
|
|
attr_fname = ch_strdup( val + STRLENOF(":include:") );
|
|
si->si_exanlist = file2anlist(
|
|
si->si_exanlist, attr_fname, " ,\t" );
|
|
if ( si->si_exanlist == NULL ) {
|
|
ch_free( attr_fname );
|
|
return -1;
|
|
}
|
|
ch_free( attr_fname );
|
|
} else {
|
|
si->si_exanlist = str2anlist( si->si_exanlist, val, " ,\t" );
|
|
if ( si->si_exanlist == NULL ) {
|
|
return -1;
|
|
}
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], TYPESTR "=",
|
|
STRLENOF( TYPESTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( TYPESTR "=" );
|
|
if ( !strncasecmp( val, "refreshOnly",
|
|
STRLENOF("refreshOnly") ) )
|
|
{
|
|
si->si_type = si->si_ctype = LDAP_SYNC_REFRESH_ONLY;
|
|
} else if ( !strncasecmp( val, "refreshAndPersist",
|
|
STRLENOF("refreshAndPersist") ) )
|
|
{
|
|
si->si_type = si->si_ctype = LDAP_SYNC_REFRESH_AND_PERSIST;
|
|
si->si_interval = 60;
|
|
} else {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"unknown sync type \"%s\"", val);
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], INTERVALSTR "=",
|
|
STRLENOF( INTERVALSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( INTERVALSTR "=" );
|
|
if ( si->si_type == LDAP_SYNC_REFRESH_AND_PERSIST ) {
|
|
si->si_interval = 0;
|
|
} else if ( strchr( val, ':' ) != NULL ) {
|
|
char *next, *ptr = val;
|
|
unsigned dd, hh, mm, ss;
|
|
|
|
/* NOTE: the test for ptr[ 0 ] == '-'
|
|
* should go before the call to strtoul() */
|
|
dd = strtoul( ptr, &next, 10 );
|
|
if ( ptr[ 0 ] == '-' || next == ptr || next[0] != ':' ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"invalid interval \"%s\", unable to parse days", val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
ptr = next + 1;
|
|
hh = strtoul( ptr, &next, 10 );
|
|
if ( ptr[ 0 ] == '-' || next == ptr || next[0] != ':' || hh > 24 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"invalid interval \"%s\", unable to parse hours", val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
ptr = next + 1;
|
|
mm = strtoul( ptr, &next, 10 );
|
|
if ( ptr[ 0 ] == '-' || next == ptr || next[0] != ':' || mm > 60 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"invalid interval \"%s\", unable to parse minutes", val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
ptr = next + 1;
|
|
ss = strtoul( ptr, &next, 10 );
|
|
if ( ptr[ 0 ] == '-' || next == ptr || next[0] != '\0' || ss > 60 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"invalid interval \"%s\", unable to parse seconds", val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
si->si_interval = (( dd * 24 + hh ) * 60 + mm ) * 60 + ss;
|
|
} else {
|
|
unsigned long t;
|
|
|
|
if ( lutil_parse_time( val, &t ) != 0 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"invalid interval \"%s\"", val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
si->si_interval = (time_t)t;
|
|
}
|
|
if ( si->si_interval < 0 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"invalid interval \"%ld\"",
|
|
(long) si->si_interval);
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], RETRYSTR "=",
|
|
STRLENOF( RETRYSTR "=" ) ) )
|
|
{
|
|
char **retry_list;
|
|
int j, k, n;
|
|
|
|
val = c->argv[ i ] + STRLENOF( RETRYSTR "=" );
|
|
retry_list = (char **) ch_calloc( 1, sizeof( char * ) );
|
|
retry_list[0] = NULL;
|
|
|
|
slap_str2clist( &retry_list, val, " ,\t" );
|
|
|
|
for ( k = 0; retry_list && retry_list[k]; k++ ) ;
|
|
n = k / 2;
|
|
if ( k % 2 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: incomplete syncrepl retry list" );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
for ( k = 0; retry_list && retry_list[k]; k++ ) {
|
|
ch_free( retry_list[k] );
|
|
}
|
|
ch_free( retry_list );
|
|
return 1;
|
|
}
|
|
si->si_retryinterval = (time_t *) ch_calloc( n + 1, sizeof( time_t ) );
|
|
si->si_retrynum = (int *) ch_calloc( n + 1, sizeof( int ) );
|
|
si->si_retrynum_init = (int *) ch_calloc( n + 1, sizeof( int ) );
|
|
for ( j = 0; j < n; j++ ) {
|
|
unsigned long t;
|
|
if ( lutil_atoul( &t, retry_list[j*2] ) != 0 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: invalid retry interval \"%s\" (#%d)",
|
|
retry_list[j*2], j );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
/* do some cleanup */
|
|
return 1;
|
|
}
|
|
si->si_retryinterval[j] = (time_t)t;
|
|
if ( *retry_list[j*2+1] == '+' ) {
|
|
si->si_retrynum_init[j] = RETRYNUM_FOREVER;
|
|
si->si_retrynum[j] = RETRYNUM_FOREVER;
|
|
j++;
|
|
break;
|
|
} else {
|
|
if ( lutil_atoi( &si->si_retrynum_init[j], retry_list[j*2+1] ) != 0
|
|
|| si->si_retrynum_init[j] <= 0 )
|
|
{
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: invalid initial retry number \"%s\" (#%d)",
|
|
retry_list[j*2+1], j );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
/* do some cleanup */
|
|
return 1;
|
|
}
|
|
if ( lutil_atoi( &si->si_retrynum[j], retry_list[j*2+1] ) != 0
|
|
|| si->si_retrynum[j] <= 0 )
|
|
{
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: invalid retry number \"%s\" (#%d)",
|
|
retry_list[j*2+1], j );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
/* do some cleanup */
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
si->si_retrynum_init[j] = RETRYNUM_TAIL;
|
|
si->si_retrynum[j] = RETRYNUM_TAIL;
|
|
si->si_retryinterval[j] = 0;
|
|
|
|
for ( k = 0; retry_list && retry_list[k]; k++ ) {
|
|
ch_free( retry_list[k] );
|
|
}
|
|
ch_free( retry_list );
|
|
} else if ( !strncasecmp( c->argv[ i ], MANAGEDSAITSTR "=",
|
|
STRLENOF( MANAGEDSAITSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( MANAGEDSAITSTR "=" );
|
|
if ( lutil_atoi( &si->si_manageDSAit, val ) != 0
|
|
|| si->si_manageDSAit < 0 || si->si_manageDSAit > 1 )
|
|
{
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"invalid manageDSAit value \"%s\".\n",
|
|
val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return 1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], SLIMITSTR "=",
|
|
STRLENOF( SLIMITSTR "=") ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( SLIMITSTR "=" );
|
|
if ( strcasecmp( val, "unlimited" ) == 0 ) {
|
|
si->si_slimit = 0;
|
|
|
|
} else if ( lutil_atoi( &si->si_slimit, val ) != 0 || si->si_slimit < 0 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"invalid size limit value \"%s\".\n",
|
|
val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return 1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], TLIMITSTR "=",
|
|
STRLENOF( TLIMITSTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( TLIMITSTR "=" );
|
|
if ( strcasecmp( val, "unlimited" ) == 0 ) {
|
|
si->si_tlimit = 0;
|
|
|
|
} else if ( lutil_atoi( &si->si_tlimit, val ) != 0 || si->si_tlimit < 0 ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"invalid time limit value \"%s\".\n",
|
|
val );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return 1;
|
|
}
|
|
} else if ( !strncasecmp( c->argv[ i ], SYNCDATASTR "=",
|
|
STRLENOF( SYNCDATASTR "=" ) ) )
|
|
{
|
|
val = c->argv[ i ] + STRLENOF( SYNCDATASTR "=" );
|
|
si->si_syncdata = verb_to_mask( val, datamodes );
|
|
} else if ( bindconf_parse( c->argv[i], &si->si_bindconf ) ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: parse_syncrepl_line: "
|
|
"unable to parse \"%s\"\n", c->argv[ i ] );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
if ( gots != GOT_ALL ) {
|
|
snprintf( c->msg, sizeof( c->msg ),
|
|
"Error: Malformed \"syncrepl\" line in slapd config file, missing%s%s%s",
|
|
gots & GOT_ID ? "" : " "IDSTR,
|
|
gots & GOT_PROVIDER ? "" : " "PROVIDERSTR,
|
|
gots & GOT_BASE ? "" : " "SEARCHBASESTR );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s.\n", c->log, c->msg, 0 );
|
|
return -1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
add_syncrepl(
|
|
ConfigArgs *c )
|
|
{
|
|
syncinfo_t *si;
|
|
int rc = 0;
|
|
|
|
if ( !( c->be->be_search && c->be->be_add && c->be->be_modify && c->be->be_delete ) ) {
|
|
snprintf( c->msg, sizeof(c->msg), "database %s does not support "
|
|
"operations required for syncrepl", c->be->be_type );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s\n", c->log, c->msg, 0 );
|
|
return 1;
|
|
}
|
|
if ( BER_BVISEMPTY( &c->be->be_rootdn ) ) {
|
|
strcpy( c->msg, "rootDN must be defined before syncrepl may be used" );
|
|
Debug( LDAP_DEBUG_ANY, "%s: %s\n", c->log, c->msg, 0 );
|
|
return 1;
|
|
}
|
|
si = (syncinfo_t *) ch_calloc( 1, sizeof( syncinfo_t ) );
|
|
|
|
if ( si == NULL ) {
|
|
Debug( LDAP_DEBUG_ANY, "out of memory in add_syncrepl\n", 0, 0, 0 );
|
|
return 1;
|
|
}
|
|
|
|
si->si_bindconf.sb_tls = SB_TLS_OFF;
|
|
si->si_bindconf.sb_method = LDAP_AUTH_SIMPLE;
|
|
si->si_schemachecking = 0;
|
|
ber_str2bv( "(objectclass=*)", STRLENOF("(objectclass=*)"), 1,
|
|
&si->si_filterstr );
|
|
si->si_base.bv_val = NULL;
|
|
si->si_scope = LDAP_SCOPE_SUBTREE;
|
|
si->si_attrsonly = 0;
|
|
si->si_anlist = (AttributeName *) ch_calloc( 1, sizeof( AttributeName ) );
|
|
si->si_exanlist = (AttributeName *) ch_calloc( 1, sizeof( AttributeName ) );
|
|
si->si_attrs = NULL;
|
|
si->si_allattrs = 0;
|
|
si->si_allopattrs = 0;
|
|
si->si_exattrs = NULL;
|
|
si->si_type = si->si_ctype = LDAP_SYNC_REFRESH_ONLY;
|
|
si->si_interval = 86400;
|
|
si->si_retryinterval = NULL;
|
|
si->si_retrynum_init = NULL;
|
|
si->si_retrynum = NULL;
|
|
si->si_manageDSAit = 0;
|
|
si->si_tlimit = 0;
|
|
si->si_slimit = 0;
|
|
si->si_conn_setup = 0;
|
|
|
|
si->si_presentlist = NULL;
|
|
LDAP_LIST_INIT( &si->si_nonpresentlist );
|
|
ldap_pvt_thread_mutex_init( &si->si_mutex );
|
|
|
|
rc = parse_syncrepl_line( c, si );
|
|
|
|
if ( rc == 0 ) {
|
|
/* Must be LDAPv3 because we need controls */
|
|
switch ( si->si_bindconf.sb_version ) {
|
|
case 0:
|
|
/* not explicitly set */
|
|
si->si_bindconf.sb_version = LDAP_VERSION3;
|
|
break;
|
|
case 3:
|
|
/* explicitly set */
|
|
break;
|
|
default:
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"version %d incompatible with syncrepl\n",
|
|
si->si_bindconf.sb_version, 0, 0 );
|
|
syncinfo_free( si );
|
|
return 1;
|
|
}
|
|
|
|
si->si_be = c->be;
|
|
if ( slapMode & SLAP_SERVER_MODE ) {
|
|
Listener **l = slapd_get_listeners();
|
|
int isMe = 0;
|
|
|
|
/* check if URL points to current server. If so, ignore
|
|
* this configuration. We require an exact match. Just
|
|
* in case they really want to do this, they can vary
|
|
* the case of the URL to allow it.
|
|
*/
|
|
if ( l && !SLAP_DBHIDDEN( c->be ) ) {
|
|
int i;
|
|
for ( i=0; l[i]; i++ ) {
|
|
if ( bvmatch( &l[i]->sl_url, &si->si_bindconf.sb_uri ) ) {
|
|
isMe = 1;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
if ( !isMe ) {
|
|
init_syncrepl( si );
|
|
si->si_re = ldap_pvt_runqueue_insert( &slapd_rq,
|
|
si->si_interval, do_syncrepl, si, "do_syncrepl",
|
|
si->si_ridtxt );
|
|
if ( si->si_re )
|
|
rc = config_sync_shadow( c ) ? -1 : 0;
|
|
else
|
|
rc = -1;
|
|
}
|
|
}
|
|
}
|
|
|
|
#ifdef HAVE_TLS
|
|
/* Use main slapd defaults */
|
|
bindconf_tls_defaults( &si->si_bindconf );
|
|
#endif
|
|
if ( rc < 0 ) {
|
|
Debug( LDAP_DEBUG_ANY, "failed to add syncinfo\n", 0, 0, 0 );
|
|
syncinfo_free( si );
|
|
return 1;
|
|
} else {
|
|
Debug( LDAP_DEBUG_CONFIG,
|
|
"Config: ** successfully added syncrepl \"%s\"\n",
|
|
BER_BVISNULL( &si->si_bindconf.sb_uri ) ?
|
|
"(null)" : si->si_bindconf.sb_uri.bv_val, 0, 0 );
|
|
if ( !si->si_schemachecking ) {
|
|
SLAP_DBFLAGS(c->be) |= SLAP_DBFLAG_NO_SCHEMA_CHECK;
|
|
}
|
|
if ( c->be->be_syncinfo ) {
|
|
si->si_cookieState = c->be->be_syncinfo->si_cookieState;
|
|
} else {
|
|
si->si_cookieState = ch_calloc( 1, sizeof( cookie_state ));
|
|
ldap_pvt_thread_mutex_init( &si->si_cookieState->cs_mutex );
|
|
}
|
|
si->si_next = c->be->be_syncinfo;
|
|
c->be->be_syncinfo = si;
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static void
|
|
syncrepl_unparse( syncinfo_t *si, struct berval *bv )
|
|
{
|
|
struct berval bc, uri;
|
|
char buf[BUFSIZ*2], *ptr;
|
|
int i;
|
|
|
|
#define WHATSLEFT ( sizeof( buf ) - ( ptr - buf ) )
|
|
|
|
BER_BVZERO( bv );
|
|
|
|
/* temporarily inhibit bindconf from printing URI */
|
|
uri = si->si_bindconf.sb_uri;
|
|
BER_BVZERO( &si->si_bindconf.sb_uri );
|
|
si->si_bindconf.sb_version = 0;
|
|
bindconf_unparse( &si->si_bindconf, &bc );
|
|
si->si_bindconf.sb_uri = uri;
|
|
si->si_bindconf.sb_version = LDAP_VERSION3;
|
|
|
|
ptr = buf;
|
|
ptr += snprintf( ptr, WHATSLEFT, IDSTR "=%03ld " PROVIDERSTR "=%s",
|
|
si->si_rid, si->si_bindconf.sb_uri.bv_val );
|
|
if ( ptr - buf >= sizeof( buf ) ) return;
|
|
if ( !BER_BVISNULL( &bc ) ) {
|
|
if ( WHATSLEFT <= bc.bv_len ) {
|
|
free( bc.bv_val );
|
|
return;
|
|
}
|
|
ptr = lutil_strcopy( ptr, bc.bv_val );
|
|
free( bc.bv_val );
|
|
}
|
|
if ( !BER_BVISEMPTY( &si->si_filterstr ) ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " FILTERSTR "=\"" "\"" ) + si->si_filterstr.bv_len ) return;
|
|
ptr = lutil_strcopy( ptr, " " FILTERSTR "=\"" );
|
|
ptr = lutil_strcopy( ptr, si->si_filterstr.bv_val );
|
|
*ptr++ = '"';
|
|
}
|
|
if ( !BER_BVISNULL( &si->si_base ) ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " SEARCHBASESTR "=\"" "\"" ) + si->si_base.bv_len ) return;
|
|
ptr = lutil_strcopy( ptr, " " SEARCHBASESTR "=\"" );
|
|
ptr = lutil_strcopy( ptr, si->si_base.bv_val );
|
|
*ptr++ = '"';
|
|
}
|
|
if ( !BER_BVISEMPTY( &si->si_logfilterstr ) ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " LOGFILTERSTR "=\"" "\"" ) + si->si_logfilterstr.bv_len ) return;
|
|
ptr = lutil_strcopy( ptr, " " LOGFILTERSTR "=\"" );
|
|
ptr = lutil_strcopy( ptr, si->si_logfilterstr.bv_val );
|
|
*ptr++ = '"';
|
|
}
|
|
if ( !BER_BVISNULL( &si->si_logbase ) ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " LOGBASESTR "=\"" "\"" ) + si->si_logbase.bv_len ) return;
|
|
ptr = lutil_strcopy( ptr, " " LOGBASESTR "=\"" );
|
|
ptr = lutil_strcopy( ptr, si->si_logbase.bv_val );
|
|
*ptr++ = '"';
|
|
}
|
|
for (i=0; !BER_BVISNULL(&scopes[i].key);i++) {
|
|
if ( si->si_scope == scopes[i].val ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " SCOPESTR "=" ) + scopes[i].key.bv_len ) return;
|
|
ptr = lutil_strcopy( ptr, " " SCOPESTR "=" );
|
|
ptr = lutil_strcopy( ptr, scopes[i].key.bv_val );
|
|
break;
|
|
}
|
|
}
|
|
if ( si->si_attrsonly ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " ATTRSONLYSTR "=\"" "\"" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " ATTRSONLYSTR );
|
|
}
|
|
if ( si->si_anfile ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " ATTRSSTR "=\":include:" "\"" ) + strlen( si->si_anfile ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " ATTRSSTR "=:include:\"" );
|
|
ptr = lutil_strcopy( ptr, si->si_anfile );
|
|
*ptr++ = '"';
|
|
} else if ( si->si_allattrs || si->si_allopattrs ||
|
|
( si->si_anlist && !BER_BVISNULL(&si->si_anlist[0].an_name) ) )
|
|
{
|
|
char *old;
|
|
|
|
if ( WHATSLEFT <= STRLENOF( " " ATTRSONLYSTR "=\"" "\"" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " ATTRSSTR "=\"" );
|
|
old = ptr;
|
|
/* FIXME: add check for overflow */
|
|
ptr = anlist_unparse( si->si_anlist, ptr, WHATSLEFT );
|
|
if ( si->si_allattrs ) {
|
|
if ( WHATSLEFT <= STRLENOF( ",*\"" ) ) return;
|
|
if ( old != ptr ) *ptr++ = ',';
|
|
*ptr++ = '*';
|
|
}
|
|
if ( si->si_allopattrs ) {
|
|
if ( WHATSLEFT <= STRLENOF( ",+\"" ) ) return;
|
|
if ( old != ptr ) *ptr++ = ',';
|
|
*ptr++ = '+';
|
|
}
|
|
*ptr++ = '"';
|
|
}
|
|
if ( si->si_exanlist && !BER_BVISNULL(&si->si_exanlist[0].an_name) ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " EXATTRSSTR "=" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " EXATTRSSTR "=" );
|
|
/* FIXME: add check for overflow */
|
|
ptr = anlist_unparse( si->si_exanlist, ptr, WHATSLEFT );
|
|
}
|
|
if ( WHATSLEFT <= STRLENOF( " " SCHEMASTR "=" ) + STRLENOF( "off" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " SCHEMASTR "=" );
|
|
ptr = lutil_strcopy( ptr, si->si_schemachecking ? "on" : "off" );
|
|
|
|
if ( WHATSLEFT <= STRLENOF( " " TYPESTR "=" ) + STRLENOF( "refreshAndPersist" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " TYPESTR "=" );
|
|
ptr = lutil_strcopy( ptr, si->si_type == LDAP_SYNC_REFRESH_AND_PERSIST ?
|
|
"refreshAndPersist" : "refreshOnly" );
|
|
|
|
if ( si->si_type == LDAP_SYNC_REFRESH_ONLY ) {
|
|
int dd, hh, mm, ss;
|
|
|
|
dd = si->si_interval;
|
|
ss = dd % 60;
|
|
dd /= 60;
|
|
mm = dd % 60;
|
|
dd /= 60;
|
|
hh = dd % 24;
|
|
dd /= 24;
|
|
ptr = lutil_strcopy( ptr, " " INTERVALSTR "=" );
|
|
ptr += snprintf( ptr, WHATSLEFT, "%02d:%02d:%02d:%02d", dd, hh, mm, ss );
|
|
if ( ptr - buf >= sizeof( buf ) ) return;
|
|
} else if ( si->si_retryinterval ) {
|
|
int space=0;
|
|
if ( WHATSLEFT <= STRLENOF( " " RETRYSTR "=\"" "\"" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " RETRYSTR "=\"" );
|
|
for (i=0; si->si_retryinterval[i]; i++) {
|
|
if ( space ) *ptr++ = ' ';
|
|
space = 1;
|
|
ptr += snprintf( ptr, WHATSLEFT, "%ld ", (long) si->si_retryinterval[i] );
|
|
if ( si->si_retrynum_init[i] == RETRYNUM_FOREVER )
|
|
*ptr++ = '+';
|
|
else
|
|
ptr += snprintf( ptr, WHATSLEFT, "%d", si->si_retrynum_init[i] );
|
|
}
|
|
if ( WHATSLEFT <= STRLENOF( "\"" ) ) return;
|
|
*ptr++ = '"';
|
|
}
|
|
|
|
if ( si->si_slimit ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " SLIMITSTR "=" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " SLIMITSTR "=" );
|
|
ptr += snprintf( ptr, WHATSLEFT, "%d", si->si_slimit );
|
|
}
|
|
|
|
if ( si->si_tlimit ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " TLIMITSTR "=" ) ) return;
|
|
ptr = lutil_strcopy( ptr, " " TLIMITSTR "=" );
|
|
ptr += snprintf( ptr, WHATSLEFT, "%d", si->si_tlimit );
|
|
}
|
|
|
|
if ( si->si_syncdata ) {
|
|
if ( enum_to_verb( datamodes, si->si_syncdata, &bc ) >= 0 ) {
|
|
if ( WHATSLEFT <= STRLENOF( " " SYNCDATASTR "=" ) + bc.bv_len ) return;
|
|
ptr = lutil_strcopy( ptr, " " SYNCDATASTR "=" );
|
|
ptr = lutil_strcopy( ptr, bc.bv_val );
|
|
}
|
|
}
|
|
bc.bv_len = ptr - buf;
|
|
bc.bv_val = buf;
|
|
ber_dupbv( bv, &bc );
|
|
}
|
|
|
|
int
|
|
syncrepl_config( ConfigArgs *c )
|
|
{
|
|
if (c->op == SLAP_CONFIG_EMIT) {
|
|
if ( c->be->be_syncinfo ) {
|
|
struct berval bv;
|
|
syncinfo_t *si;
|
|
|
|
for ( si = c->be->be_syncinfo; si; si=si->si_next ) {
|
|
syncrepl_unparse( si, &bv );
|
|
ber_bvarray_add( &c->rvalue_vals, &bv );
|
|
}
|
|
return 0;
|
|
}
|
|
return 1;
|
|
} else if ( c->op == LDAP_MOD_DELETE ) {
|
|
cookie_state *cs = NULL;
|
|
if ( c->be->be_syncinfo ) {
|
|
syncinfo_t *si, **sip;
|
|
int i;
|
|
|
|
cs = c->be->be_syncinfo->si_cookieState;
|
|
for ( sip = &c->be->be_syncinfo, i=0; *sip; i++ ) {
|
|
si = *sip;
|
|
if ( c->valx == -1 || i == c->valx ) {
|
|
*sip = si->si_next;
|
|
/* If the task is currently active, we have to leave
|
|
* it running. It will exit on its own. This will only
|
|
* happen when running on the cn=config DB.
|
|
*/
|
|
if ( si->si_re &&
|
|
ldap_pvt_runqueue_isrunning( &slapd_rq, si->si_re ) ) {
|
|
si->si_ctype = 0;
|
|
} else {
|
|
syncinfo_free( si );
|
|
}
|
|
if ( i == c->valx )
|
|
break;
|
|
} else {
|
|
sip = &si->si_next;
|
|
}
|
|
}
|
|
}
|
|
if ( !c->be->be_syncinfo ) {
|
|
SLAP_DBFLAGS( c->be ) &= ~(SLAP_DBFLAG_SHADOW|SLAP_DBFLAG_SYNC_SHADOW);
|
|
if ( cs ) {
|
|
ber_bvarray_free( cs->cs_vals );
|
|
ldap_pvt_thread_mutex_destroy( &cs->cs_mutex );
|
|
ch_free( cs );
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
if ( SLAP_SLURP_SHADOW( c->be ) ) {
|
|
Debug(LDAP_DEBUG_ANY, "%s: "
|
|
"syncrepl: database already shadowed.\n",
|
|
c->log, 0, 0);
|
|
return(1);
|
|
} else {
|
|
return add_syncrepl( c );
|
|
}
|
|
}
|