servers/slapd/overlays/syncprov.c - diff

Return to syncprov.c CVS log

Up to [OpenLDAP] / servers / slapd / overlays

Diff for /servers/slapd/overlays/syncprov.c between versions 1.56.2.32 and 1.84

version 1.56.2.32, 2006/05/15 15:51:59	version 1.84, 2005/05/09 08:33:01
Line 1	Line 1
/* $OpenLDAP: pkg/ldap/servers/slapd/overlays/syncprov.c,v 1.150 2006/05/11 08:46:44 hyc Exp $ */	/* $OpenLDAP: pkg/ldap/servers/slapd/overlays/syncprov.c,v 1.83 2005/05/09 03:02:01 hyc Exp $ */
/* syncprov.c - syncrepl provider */	/* syncprov.c - syncrepl provider */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.	/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*	*
* Copyright 2004-2006 The OpenLDAP Foundation.	* Copyright 2004-2005 The OpenLDAP Foundation.
* All rights reserved.	* All rights reserved.
*	*
* Redistribution and use in source and binary forms, with or without	* Redistribution and use in source and binary forms, with or without
Line 26	Line 26
#include "lutil.h"	#include "lutil.h"
#include "slap.h"	#include "slap.h"
#include "config.h"	#include "config.h"
#include "ldap_rq.h"

/* A modify request on a particular entry */	/* A modify request on a particular entry */
typedef struct modinst {	typedef struct modinst {
Line 61 typedef struct syncops {	Line 60 typedef struct syncops {
int s_rid;	int s_rid;
struct berval s_filterstr;	struct berval s_filterstr;
int s_flags; /* search status */	int s_flags; /* search status */
#define PS_IS_REFRESHING 0x01
#define PS_IS_DETACHED 0x02
#define PS_WROTE_BASE 0x04
#define PS_FIND_BASE 0x08

int s_inuse; /* reference count */	int s_inuse; /* reference count */
struct syncres *s_res;	struct syncres *s_res;
struct syncres *s_restail;	struct syncres *s_restail;
struct re_s s_qtask; / task for playing psearch responses */
#define RUNQ_INTERVAL 36000 /* a long time */
ldap_pvt_thread_mutex_t s_mutex;	ldap_pvt_thread_mutex_t s_mutex;
} syncops;	} syncops;

Line 91 typedef struct sync_control {	Line 83 typedef struct sync_control {
#define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)	#define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
#define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)	#define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)

	#define PS_IS_REFRESHING 0x01
	#define PS_IS_DETACHED 0x02

/* Record of which searches matched at premodify step */	/* Record of which searches matched at premodify step */
typedef struct syncmatches {	typedef struct syncmatches {
struct syncmatches *sm_next;	struct syncmatches *sm_next;
Line 121 typedef struct syncprov_info_t {	Line 116 typedef struct syncprov_info_t {
int si_chkops; /* checkpointing info */	int si_chkops; /* checkpointing info */
int si_chktime;	int si_chktime;
int si_numops; /* number of ops since last checkpoint */	int si_numops; /* number of ops since last checkpoint */
int si_nopres; /* Skip present phase */
int si_usehint; /* use reload hint */
time_t si_chklast; /* time of last checkpoint */	time_t si_chklast; /* time of last checkpoint */
Avlnode si_mods; / entries being modified */	Avlnode si_mods; / entries being modified */
sessionlog *si_logs;	sessionlog *si_logs;
Line 149 typedef struct fbase_cookie {	Line 142 typedef struct fbase_cookie {
int fscope; /* if TRUE then fdn is within the psearch scope */	int fscope; /* if TRUE then fdn is within the psearch scope */
} fbase_cookie;	} fbase_cookie;

static AttributeName csn_anlist[3];	static AttributeName csn_anlist[2];
static AttributeName uuid_anlist[2];	static AttributeName uuid_anlist[2];

/* Build a LDAPsync intermediate state control */	/* Build a LDAPsync intermediate state control */
Line 166 syncprov_state_ctrl(	Line 159 syncprov_state_ctrl(
{	{
Attribute* a;	Attribute* a;
int ret;	int ret;
	int res;
	const char *text = NULL;

BerElementBuffer berbuf;	BerElementBuffer berbuf;
BerElement ber = (BerElement )&berbuf;	BerElement ber = (BerElement )&berbuf;
Line 185 syncprov_state_ctrl(	Line 180 syncprov_state_ctrl(
}	}
}	}

/* FIXME: what if entryuuid is NULL or empty ? */

if ( send_cookie && cookie ) {	if ( send_cookie && cookie ) {
ber_printf( ber, "{eOON}",	ber_printf( ber, "{eOON}",
entry_sync_state, &entryuuid_bv, cookie );	entry_sync_state, &entryuuid_bv, cookie );
Line 366 findbase_cb( Operation op, SlapReply r	Line 359 findbase_cb( Operation op, SlapReply r
* Just store whatever we got.	* Just store whatever we got.
*/	*/
if ( fc->fss->s_eid == NOID ) {	if ( fc->fss->s_eid == NOID ) {
fc->fbase = 2;	fc->fbase = 1;
fc->fss->s_eid = rs->sr_entry->e_id;	fc->fss->s_eid = rs->sr_entry->e_id;
ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );	ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );

} else if ( rs->sr_entry->e_id == fc->fss->s_eid &&	} else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {	dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {

/* OK, the DN is the same and the entryID is the same. */	/* OK, the DN is the same and the entryID is the same. Now
	* see if the fdn resides in the scope.
	*/
fc->fbase = 1;	fc->fbase = 1;
	switch ( fc->fss->s_op->ors_scope ) {
	case LDAP_SCOPE_BASE:
	fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
	break;
	case LDAP_SCOPE_ONELEVEL: {
	struct berval pdn;
	dnParent( fc->fdn, &pdn );
	fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
	break; }
	case LDAP_SCOPE_SUBTREE:
	fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
	break;
	#ifdef LDAP_SCOPE_SUBORDINATE
	case LDAP_SCOPE_SUBORDINATE:
	fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
	!dn_match( fc->fdn, &rs->sr_entry->e_nname );
	break;
	#endif
	}
}	}
}	}
if ( rs->sr_err != LDAP_SUCCESS ) {	if ( rs->sr_err != LDAP_SUCCESS ) {
Line 383 findbase_cb( Operation op, SlapReply r	Line 397 findbase_cb( Operation op, SlapReply r
return LDAP_SUCCESS;	return LDAP_SUCCESS;
}	}

static Filter generic_filter = { LDAP_FILTER_PRESENT, { 0 }, NULL };
static struct berval generic_filterstr = BER_BVC("(objectclass=*)");

static int	static int
syncprov_findbase( Operation op, fbase_cookie fc )	syncprov_findbase( Operation op, fbase_cookie fc )
{	{
opcookie *opc = op->o_callback->sc_private;	opcookie *opc = op->o_callback->sc_private;
slap_overinst *on = opc->son;	slap_overinst *on = opc->son;
	syncprov_info_t *si = on->on_bi.bi_private;

/* Use basic parameters from syncrepl search, but use	slap_callback cb = {0};
* current op's threadctx / tmpmemctx	Operation fop;
*/	SlapReply frs = { REP_RESULT };
ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex );	int rc;
if ( fc->fss->s_flags & PS_FIND_BASE ) {
slap_callback cb = {0};
Operation fop;
SlapReply frs = { REP_RESULT };
int rc;

fc->fss->s_flags ^= PS_FIND_BASE;
ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );

fop = *fc->fss->s_op;

fop.o_hdr = op->o_hdr;	fop = *op;
fop.o_bd = op->o_bd;
fop.o_time = op->o_time;
fop.o_tincr = op->o_tincr;

cb.sc_response = findbase_cb;	cb.sc_response = findbase_cb;
cb.sc_private = fc;	cb.sc_private = fc;

fop.o_sync_mode = 0; /* turn off sync mode */	fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
fop.o_managedsait = SLAP_CONTROL_CRITICAL;	fop.o_managedsait = SLAP_CONTROL_CRITICAL;
fop.o_callback = &cb;	fop.o_callback = &cb;
fop.o_tag = LDAP_REQ_SEARCH;	fop.o_tag = LDAP_REQ_SEARCH;
fop.ors_scope = LDAP_SCOPE_BASE;	fop.ors_scope = LDAP_SCOPE_BASE;
fop.ors_limit = NULL;	fop.ors_deref = fc->fss->s_op->ors_deref;
fop.ors_slimit = 1;	fop.ors_limit = NULL;
fop.ors_tlimit = SLAP_NO_LIMIT;	fop.ors_slimit = 1;
fop.ors_attrs = slap_anlist_no_attrs;	fop.ors_tlimit = SLAP_NO_LIMIT;
fop.ors_attrsonly = 1;	fop.ors_attrs = slap_anlist_no_attrs;
fop.ors_filter = &generic_filter;	fop.ors_attrsonly = 1;
fop.ors_filterstr = generic_filterstr;	fop.ors_filter = fc->fss->s_op->ors_filter;
	fop.ors_filterstr = fc->fss->s_op->ors_filterstr;

fop.o_bd->bd_info = on->on_info->oi_orig;	fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
rc = fop.o_bd->be_search( &fop, &frs );
fop.o_bd->bd_info = (BackendInfo *)on;
} else {
ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
fc->fbase = 1;
}

/* After the first call, see if the fdn resides in the scope */	fop.o_bd->bd_info = on->on_info->oi_orig;
if ( fc->fbase == 1 ) {	rc = fop.o_bd->be_search( &fop, &frs );
switch ( fc->fss->s_op->ors_scope ) {	fop.o_bd->bd_info = (BackendInfo *)on;
case LDAP_SCOPE_BASE:
fc->fscope = dn_match( fc->fdn, &fc->fss->s_base );
break;
case LDAP_SCOPE_ONELEVEL: {
struct berval pdn;
dnParent( fc->fdn, &pdn );
fc->fscope = dn_match( &pdn, &fc->fss->s_base );
break; }
case LDAP_SCOPE_SUBTREE:
fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base );
break;
case LDAP_SCOPE_SUBORDINATE:
fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) &&
!dn_match( fc->fdn, &fc->fss->s_base );
break;
}
}

if ( fc->fbase )	if ( fc->fbase ) return LDAP_SUCCESS;
return LDAP_SUCCESS;

/* If entryID has changed, then the base of this search has	/* If entryID has changed, then the base of this search has
* changed. Invalidate the psearch.	* changed. Invalidate the psearch.
Line 474 syncprov_findbase( Operation *op, fbase_	Line 450 syncprov_findbase( Operation *op, fbase_
* was not checkpointed at the previous shutdown.	* was not checkpointed at the previous shutdown.
*	*
* 2: when the current contextCSN is known and we have a sync cookie, we search	* 2: when the current contextCSN is known and we have a sync cookie, we search
* for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.	* for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
* If an entry is found, the cookie CSN is valid, otherwise it is stale.	* entry is found, the cookie CSN is valid, otherwise it is stale.
*	*
* 3: during a refresh phase, we search for all entries with CSN <= the cookie	* 3: during a refresh phase, we search for all entries with CSN <= the cookie
* CSN, and generate Present records for them. We always collect this result	* CSN, and generate Present records for them. We always collect this result
* in SyncID sets, even if there's only one match.	* in SyncID sets, even if there's only one match.
*/	*/
typedef enum find_csn_t {	#define FIND_MAXCSN 1
FIND_MAXCSN = 1,	#define FIND_CSN 2
FIND_CSN = 2,	#define FIND_PRESENT 3
FIND_PRESENT = 3
} find_csn_t;

static int	static int
findmax_cb( Operation op, SlapReply rs )	findmax_cb( Operation op, SlapReply rs )
Line 508 findcsn_cb( Operation op, SlapReply rs	Line 482 findcsn_cb( Operation op, SlapReply rs
{	{
slap_callback *sc = op->o_callback;	slap_callback *sc = op->o_callback;

/* We just want to know that at least one exists, so it's OK if	if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
* we exceed the unchecked limit.
*/
if ( rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED \|\|
(rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS )) {
sc->sc_private = (void *)1;	sc->sc_private = (void *)1;
}	}
return LDAP_SUCCESS;	return LDAP_SUCCESS;
Line 568 findpres_cb( Operation op, SlapReply r	Line 538 findpres_cb( Operation op, SlapReply r
}	}

static int	static int
syncprov_findcsn( Operation *op, find_csn_t mode )	syncprov_findcsn( Operation *op, int mode )
{	{
slap_overinst on = (slap_overinst )op->o_bd->bd_info;	slap_overinst on = (slap_overinst )op->o_bd->bd_info;
syncprov_info_t *si = on->on_bi.bi_private;	syncprov_info_t *si = on->on_bi.bi_private;
Line 578 syncprov_findcsn( Operation *op, find_cs	Line 548 syncprov_findcsn( Operation *op, find_cs
SlapReply frs = { REP_RESULT };	SlapReply frs = { REP_RESULT };
char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];	char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];	char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
struct berval maxcsn;	struct berval fbuf, maxcsn;
Filter cf, af;	Filter cf, af;
#ifdef LDAP_COMP_MATCH	#ifdef LDAP_COMP_MATCH
AttributeAssertion eq = { NULL, BER_BVNULL, NULL };	AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
#else	#else
AttributeAssertion eq = { NULL, BER_BVNULL };	AttributeAssertion eq = { NULL, BER_BVNULL };
#endif	#endif
	int i, rc = LDAP_SUCCESS;
fpres_cookie pcookie;	fpres_cookie pcookie;
sync_control *srs = NULL;	sync_control *srs = NULL;
struct slap_limits_set fc_limits;
int i, rc = LDAP_SUCCESS, findcsn_retry = 1;

if ( mode != FIND_MAXCSN ) {	if ( mode != FIND_MAXCSN ) {
srs = op->o_controls[slap_cids.sc_LDAPsync];	srs = op->o_controls[slap_cids.sc_LDAPsync];
Line 603 syncprov_findcsn( Operation *op, find_cs	Line 572 syncprov_findcsn( Operation *op, find_cs
/* We want pure entries, not referrals */	/* We want pure entries, not referrals */
fop.o_managedsait = SLAP_CONTROL_CRITICAL;	fop.o_managedsait = SLAP_CONTROL_CRITICAL;

	fbuf.bv_val = buf;
cf.f_ava = &eq;	cf.f_ava = &eq;
cf.f_av_desc = slap_schema.si_ad_entryCSN;	cf.f_av_desc = slap_schema.si_ad_entryCSN;
cf.f_next = NULL;	cf.f_next = NULL;
Line 611 syncprov_findcsn( Operation *op, find_cs	Line 581 syncprov_findcsn( Operation *op, find_cs
fop.ors_limit = NULL;	fop.ors_limit = NULL;
fop.ors_tlimit = SLAP_NO_LIMIT;	fop.ors_tlimit = SLAP_NO_LIMIT;
fop.ors_filter = &cf;	fop.ors_filter = &cf;
fop.ors_filterstr.bv_val = buf;	fop.ors_filterstr = fbuf;

again:
switch( mode ) {	switch( mode ) {
case FIND_MAXCSN:	case FIND_MAXCSN:
cf.f_choice = LDAP_FILTER_GE;	cf.f_choice = LDAP_FILTER_GE;
cf.f_av_value = si->si_ctxcsn;	cf.f_av_value = si->si_ctxcsn;
fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",	fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)",
cf.f_av_value.bv_val );	cf.f_av_value.bv_val );
fop.ors_attrsonly = 0;	fop.ors_attrsonly = 0;
fop.ors_attrs = csn_anlist;	fop.ors_attrs = csn_anlist;
Line 630 again:	Line 599 again:
maxcsn.bv_len = si->si_ctxcsn.bv_len;	maxcsn.bv_len = si->si_ctxcsn.bv_len;
break;	break;
case FIND_CSN:	case FIND_CSN:
	cf.f_choice = LDAP_FILTER_LE;
cf.f_av_value = srs->sr_state.ctxcsn;	cf.f_av_value = srs->sr_state.ctxcsn;
/* Look for exact match the first time */	fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
if ( findcsn_retry ) {	cf.f_av_value.bv_val );
cf.f_choice = LDAP_FILTER_EQUALITY;
fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN=%s)",
cf.f_av_value.bv_val );
/* On retry, look for <= */
} else {
cf.f_choice = LDAP_FILTER_LE;
fop.ors_limit = &fc_limits;
fc_limits.lms_s_unchecked = 1;
fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
cf.f_av_value.bv_val );
}
fop.ors_attrsonly = 1;	fop.ors_attrsonly = 1;
fop.ors_attrs = slap_anlist_no_attrs;	fop.ors_attrs = slap_anlist_no_attrs;
fop.ors_slimit = 1;	fop.ors_slimit = 1;
Line 691 again:	Line 650 again:
break;	break;
case FIND_CSN:	case FIND_CSN:
/* If matching CSN was not found, invalidate the context. */	/* If matching CSN was not found, invalidate the context. */
if ( !cb.sc_private ) {	if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
/* If we didn't find an exact match, then try for <= */
if ( findcsn_retry ) {
findcsn_retry = 0;
goto again;
}
rc = LDAP_NO_SUCH_OBJECT;
}
break;	break;
case FIND_PRESENT:	case FIND_PRESENT:
op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );	op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
Line 709 again:	Line 661 again:
return rc;	return rc;
}	}

static void	/* Queue a persistent search response */
syncprov_free_syncop( syncops *so )	static int
	syncprov_qresp( opcookie opc, syncops so, int mode )
{	{
syncres sr, srnext;	syncres *sr;
GroupAssertion ga, gnext;

ldap_pvt_thread_mutex_lock( &so->s_mutex );	sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
if ( --so->s_inuse > 0 ) {	opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
ldap_pvt_thread_mutex_unlock( &so->s_mutex );	sr->s_next = NULL;
return;	sr->s_dn.bv_val = (char *)(sr + 1);
	sr->s_dn.bv_len = opc->sdn.bv_len;
	sr->s_mode = mode;
	sr->s_isreference = opc->sreference;
	sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
	sr->s_ndn.bv_len = opc->sndn.bv_len;
	*(sr->s_ndn.bv_val++) = '\0';
	sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
	sr->s_uuid.bv_len = opc->suuid.bv_len;
	*(sr->s_uuid.bv_val++) = '\0';
	sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
	sr->s_csn.bv_len = opc->sctxcsn.bv_len;
	strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );

	if ( !so->s_res ) {
	so->s_res = sr;
	} else {
	so->s_restail->s_next = sr;
}	}
	so->s_restail = sr;
ldap_pvt_thread_mutex_unlock( &so->s_mutex );	ldap_pvt_thread_mutex_unlock( &so->s_mutex );
if ( so->s_flags & PS_IS_DETACHED ) {	return LDAP_SUCCESS;
filter_free( so->s_op->ors_filter );	}
for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
gnext = ga->ga_next;	/* Play back queued responses */
ch_free( ga );	static int
}	syncprov_sendresp( Operation op, opcookie opc, syncops so, Entry *e, int mode, int queue );
ch_free( so->s_op );
}	static int
ch_free( so->s_base.bv_val );	syncprov_qplay( Operation op, slap_overinst on, syncops *so )
for ( sr=so->s_res; sr; sr=srnext ) {	{
	syncres sr, srnext;
	Entry *e;
	opcookie opc;
	int rc;

	opc.son = on;
	op->o_bd->bd_info = (BackendInfo *)on->on_info;
	for (sr = so->s_res; sr; sr=srnext) {
srnext = sr->s_next;	srnext = sr->s_next;
	opc.sdn = sr->s_dn;
	opc.sndn = sr->s_ndn;
	opc.suuid = sr->s_uuid;
	opc.sctxcsn = sr->s_csn;
	opc.sreference = sr->s_isreference;
	e = NULL;

	if ( sr->s_mode != LDAP_SYNC_DELETE ) {
	rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
	if ( rc ) {
	ch_free( sr );
	so->s_res = srnext;
	continue;
	}
	}
	rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );

	if ( e ) {
	be_entry_release_rw( op, e, 0 );
	}
	if ( rc )
	break;

ch_free( sr );	ch_free( sr );
	so->s_res = srnext;
}	}
ldap_pvt_thread_mutex_destroy( &so->s_mutex );	op->o_bd->bd_info = (BackendInfo *)on;
ch_free( so );	if ( !so->s_res )
	so->s_restail = NULL;
	return rc;
}	}

/* Send a persistent search response */	/* Send a persistent search response */
static int	static int
syncprov_sendresp( Operation op, opcookie opc, syncops *so,	syncprov_sendresp( Operation op, opcookie opc, syncops so, Entry *e, int mode, int queue )
Entry **e, int mode )
{	{
slap_overinst *on = opc->son;	slap_overinst *on = opc->son;
	syncprov_info_t *si = on->on_bi.bi_private;

SlapReply rs = { REP_SEARCH };	SlapReply rs = { REP_SEARCH };
LDAPControl *ctrls[2];	LDAPControl *ctrls[2];
struct berval cookie;	struct berval cookie;
Entry e_uuid = {0};	Entry e_uuid = {0};
Attribute a_uuid = {0};	Attribute a_uuid = {0};
	Operation sop = *so->s_op;
	Opheader ohdr;

if ( so->s_op->o_abandon )	if ( so->s_op->o_abandon )
return SLAPD_ABANDON;	return SLAPD_ABANDON;

	ohdr = *sop.o_hdr;
	sop.o_hdr = &ohdr;
	sop.o_tmpmemctx = op->o_tmpmemctx;
	sop.o_bd = op->o_bd;
	sop.o_controls = op->o_controls;
	sop.o_private = op->o_private;

	/* If queueing is allowed */
	if ( queue ) {
	ldap_pvt_thread_mutex_lock( &so->s_mutex );
	/* If we're still in refresh mode, must queue */
	if (so->s_flags & PS_IS_REFRESHING) {
	return syncprov_qresp( opc, so, mode );
	}
	/* If connection is free but queue is non-empty,
	* try to flush the queue.
	*/
	if ( so->s_res ) {
	rs.sr_err = syncprov_qplay( &sop, on, so );
	}
	/* If the connection is busy, must queue */
	if ( sop.o_conn->c_writewaiter \|\| rs.sr_err == LDAP_BUSY ) {
	return syncprov_qresp( opc, so, mode );
	}
	ldap_pvt_thread_mutex_unlock( &so->s_mutex );

	/* If syncprov_qplay returned any other error, bail out. */
	if ( rs.sr_err ) {
	return rs.sr_err;
	}
	} else {
	/* Queueing not allowed and conn is busy, give up */
	if ( sop.o_conn->c_writewaiter )
	return LDAP_BUSY;
	}

ctrls[1] = NULL;	ctrls[1] = NULL;
slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );	slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );

e_uuid.e_attrs = &a_uuid;	e_uuid.e_attrs = &a_uuid;
a_uuid.a_desc = slap_schema.si_ad_entryUUID;	a_uuid.a_desc = slap_schema.si_ad_entryUUID;
a_uuid.a_nvals = &opc->suuid;	a_uuid.a_nvals = &opc->suuid;
rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid,	rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
mode, ctrls, 0, 1, &cookie );	mode, ctrls, 0, 1, &cookie );
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );

rs.sr_ctrls = ctrls;	rs.sr_ctrls = ctrls;
op->o_bd->bd_info = (BackendInfo *)on->on_info;	op->o_bd->bd_info = (BackendInfo *)on->on_info;
Line 772 syncprov_sendresp( Operation *op, opcook	Line 813 syncprov_sendresp( Operation *op, opcook
if ( rs.sr_entry->e_private )	if ( rs.sr_entry->e_private )
rs.sr_flags = REP_ENTRY_MUSTRELEASE;	rs.sr_flags = REP_ENTRY_MUSTRELEASE;
if ( opc->sreference ) {	if ( opc->sreference ) {
rs.sr_ref = get_entry_referrals( op, rs.sr_entry );	rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
send_search_reference( op, &rs );	send_search_reference( &sop, &rs );
ber_bvarray_free( rs.sr_ref );	ber_bvarray_free( rs.sr_ref );
if ( !rs.sr_entry )	if ( !rs.sr_entry )
*e = NULL;	*e = NULL;
Line 784 syncprov_sendresp( Operation *op, opcook	Line 825 syncprov_sendresp( Operation *op, opcook
rs.sr_entry = *e;	rs.sr_entry = *e;
if ( rs.sr_entry->e_private )	if ( rs.sr_entry->e_private )
rs.sr_flags = REP_ENTRY_MUSTRELEASE;	rs.sr_flags = REP_ENTRY_MUSTRELEASE;
rs.sr_attrs = op->ors_attrs;	rs.sr_attrs = sop.ors_attrs;
send_search_entry( op, &rs );	send_search_entry( &sop, &rs );
if ( !rs.sr_entry )	if ( !rs.sr_entry )
*e = NULL;	*e = NULL;
break;	break;
Line 797 syncprov_sendresp( Operation *op, opcook	Line 838 syncprov_sendresp( Operation *op, opcook
if ( opc->sreference ) {	if ( opc->sreference ) {
struct berval bv = BER_BVNULL;	struct berval bv = BER_BVNULL;
rs.sr_ref = &bv;	rs.sr_ref = &bv;
send_search_reference( op, &rs );	send_search_reference( &sop, &rs );
} else {	} else {
send_search_entry( op, &rs );	send_search_entry( &sop, &rs );
}	}
break;	break;
default:	default:
assert(0);	assert(0);
}	}
/* In case someone else freed it already? */	op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
if ( rs.sr_ctrls ) {	op->o_private = sop.o_private;
op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );	rs.sr_ctrls = NULL;
rs.sr_ctrls = NULL;	/* Check queue again here; if we were hanging in a send and eventually
}	* recovered, there may be more to send now. But don't check if the
	* original psearch has been abandoned.
return rs.sr_err;	*/
}	if ( so->s_op->o_abandon )
	return SLAPD_ABANDON;
/* Play back queued responses */
static int
syncprov_qplay( Operation op, slap_overinst on, syncops *so )
{
syncres *sr;
Entry *e;
opcookie opc;
int rc = 0;

opc.son = on;
op->o_bd->bd_info = (BackendInfo *)on->on_info;

for (;;) {	if ( rs.sr_err == LDAP_SUCCESS && queue && so->s_res ) {
ldap_pvt_thread_mutex_lock( &so->s_mutex );	ldap_pvt_thread_mutex_lock( &so->s_mutex );
sr = so->s_res;	rs.sr_err = syncprov_qplay( &sop, on, so );
if ( sr )
so->s_res = sr->s_next;
if ( !so->s_res )
so->s_restail = NULL;
ldap_pvt_thread_mutex_unlock( &so->s_mutex );	ldap_pvt_thread_mutex_unlock( &so->s_mutex );

if ( !sr \|\| so->s_op->o_abandon )
break;

opc.sdn = sr->s_dn;
opc.sndn = sr->s_ndn;
opc.suuid = sr->s_uuid;
opc.sctxcsn = sr->s_csn;
opc.sreference = sr->s_isreference;
e = NULL;

if ( sr->s_mode != LDAP_SYNC_DELETE ) {
rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
if ( rc ) {
ch_free( sr );
continue;
}
}
rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode );

if ( e ) {
be_entry_release_rw( op, e, 0 );
}

ch_free( sr );

if ( rc )
break;
}	}
op->o_bd->bd_info = (BackendInfo *)on;	return rs.sr_err;
return rc;
}

/* runqueue task for playing back queued responses */
static void *
syncprov_qtask( void ctx, void arg )
{
struct re_s *rtask = arg;
syncops *so = rtask->arg;
slap_overinst *on = so->s_op->o_private;
OperationBuffer opbuf;
Operation *op;
BackendDB be;

op = (Operation *) &opbuf;
op = so->s_op;
op->o_hdr = (Opheader *)(op+1);
op->o_controls = (void **)(op->o_hdr+1);
memset( op->o_controls, 0, SLAP_MAX_CIDS * sizeof(void *));

op->o_hdr = so->s_op->o_hdr;

op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx);
op->o_tmpmfuncs = &slap_sl_mfuncs;
op->o_threadctx = ctx;

/* syncprov_qplay expects a fake db */
be = *so->s_op->o_bd;
be.be_flags \|= SLAP_DBFLAG_OVERLAY;
op->o_bd = &be;
op->o_private = NULL;
op->o_callback = NULL;

(void)syncprov_qplay( op, on, so );

/* decrement use count... */
syncprov_free_syncop( so );

/* wait until we get explicitly scheduled again */
ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
ldap_pvt_runqueue_stoptask( &slapd_rq, so->s_qtask );
ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 1 );
ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );

return NULL;
}	}

/* Queue a persistent search response */	static void
static int	syncprov_free_syncop( syncops *so )
syncprov_qresp( opcookie opc, syncops so, int mode )
{	{
syncres *sr;	syncres sr, srnext;
	GroupAssertion ga, gnext;
sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
sr->s_next = NULL;
sr->s_dn.bv_val = (char *)(sr + 1);
sr->s_dn.bv_len = opc->sdn.bv_len;
sr->s_mode = mode;
sr->s_isreference = opc->sreference;
sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val,
opc->sdn.bv_val ) + 1;
sr->s_ndn.bv_len = opc->sndn.bv_len;
sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val,
opc->sndn.bv_val ) + 1;
sr->s_uuid.bv_len = opc->suuid.bv_len;
AC_MEMCPY( sr->s_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
sr->s_csn.bv_val = sr->s_uuid.bv_val + sr->s_uuid.bv_len + 1;
sr->s_csn.bv_len = opc->sctxcsn.bv_len;
strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );

ldap_pvt_thread_mutex_lock( &so->s_mutex );	ldap_pvt_thread_mutex_lock( &so->s_mutex );
if ( !so->s_res ) {	so->s_inuse--;
so->s_res = sr;	if ( so->s_inuse > 0 ) {
} else {	ldap_pvt_thread_mutex_unlock( &so->s_mutex );
so->s_restail->s_next = sr;	return;
}
so->s_restail = sr;

/* If the base of the psearch was modified, check it next time round */
if ( so->s_flags & PS_WROTE_BASE ) {
so->s_flags ^= PS_WROTE_BASE;
so->s_flags \|= PS_FIND_BASE;
}	}
	ldap_pvt_thread_mutex_unlock( &so->s_mutex );
if ( so->s_flags & PS_IS_DETACHED ) {	if ( so->s_flags & PS_IS_DETACHED ) {
int wake=0;	filter_free( so->s_op->ors_filter );
ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );	for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
if ( !so->s_qtask ) {	gnext = ga->ga_next;
so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, RUNQ_INTERVAL,	ch_free( ga );
syncprov_qtask, so, "syncprov_qtask",
so->s_op->o_conn->c_peer_name.bv_val );
++so->s_inuse;
wake = 1;
} else {
if (!ldap_pvt_runqueue_isrunning( &slapd_rq, so->s_qtask ) &&
!so->s_qtask->next_sched.tv_sec ) {
so->s_qtask->interval.tv_sec = 0;
ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 0 );
so->s_qtask->interval.tv_sec = RUNQ_INTERVAL;
++so->s_inuse;
wake = 1;
}
}	}
ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );	ch_free( so->s_op );
if ( wake )
slap_wake_listener();
}	}
ldap_pvt_thread_mutex_unlock( &so->s_mutex );	ch_free( so->s_base.bv_val );
return LDAP_SUCCESS;	for ( sr=so->s_res; sr; sr=srnext ) {
	srnext = sr->s_next;
	ch_free( sr );
	}
	ldap_pvt_thread_mutex_destroy( &so->s_mutex );
	ch_free( so );
}	}

static int	static int
Line 1081 syncprov_matchops( Operation *op, opcook	Line 1000 syncprov_matchops( Operation *op, opcook
e = op->ora_e;	e = op->ora_e;
}	}

if ( saveit \|\| op->o_tag == LDAP_REQ_ADD ) {	if ( saveit ) {
ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );	ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );	ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
opc->sreference = is_entry_referral( e );	opc->sreference = is_entry_referral( e );
	}
	if ( saveit \|\| op->o_tag == LDAP_REQ_ADD ) {
a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );	a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
if ( a )	if ( a )
ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );	ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
} else if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
}	}

ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );	ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
Line 1116 syncprov_matchops( Operation *op, opcook	Line 1032 syncprov_matchops( Operation *op, opcook
"search base has changed" );	"search base has changed" );
sprev->s_next = snext;	sprev->s_next = snext;
syncprov_drop_psearch( ss, 1 );	syncprov_drop_psearch( ss, 1 );
ss = sprev;
continue;	continue;
}	}


/* If we're sending results now, look for this op in old matches */	/* If we're sending results now, look for this op in old matches */
if ( !saveit ) {	if ( !saveit ) {
syncmatches *old;	syncmatches *old;

/* Did we modify the search base? */
if ( dn_match( &op->o_req_ndn, &ss->s_base )) {
ldap_pvt_thread_mutex_lock( &ss->s_mutex );
ss->s_flags \|= PS_WROTE_BASE;
ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
}

for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;	for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
old=sm, sm=sm->sm_next ) {	old=sm, sm=sm->sm_next ) {
if ( sm->sm_op == ss ) {	if ( sm->sm_op == ss ) {
Line 1150 syncprov_matchops( Operation *op, opcook	Line 1056 syncprov_matchops( Operation *op, opcook
sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );	sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
sm->sm_next = opc->smatches;	sm->sm_next = opc->smatches;
sm->sm_op = ss;	sm->sm_op = ss;
ldap_pvt_thread_mutex_lock( &ss->s_mutex );	ss->s_inuse++;
++ss->s_inuse;
ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
opc->smatches = sm;	opc->smatches = sm;
} else {	} else {
/* if found send UPDATE else send ADD */	/* if found send UPDATE else send ADD */
syncprov_qresp( opc, ss,	ss->s_inuse++;
found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD );	ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
	syncprov_sendresp( op, opc, ss, &e,
	found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
	ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
	ss->s_inuse--;
}	}
} else if ( !saveit && found ) {	} else if ( !saveit && found ) {
/* send DELETE */	/* send DELETE */
syncprov_qresp( opc, ss, LDAP_SYNC_DELETE );	ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
	syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
	ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
}	}
}	}
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );	ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
	done:
if ( op->o_tag != LDAP_REQ_ADD && e ) {	if ( op->o_tag != LDAP_REQ_ADD && e ) {
op->o_bd->bd_info = (BackendInfo *)on->on_info;	op->o_bd->bd_info = (BackendInfo *)on->on_info;
be_entry_release_rw( op, e, 0 );	be_entry_release_rw( op, e, 0 );
Line 1231 syncprov_checkpoint( Operation *op, Slap	Line 1141 syncprov_checkpoint( Operation *op, Slap
syncprov_info_t *si = on->on_bi.bi_private;	syncprov_info_t *si = on->on_bi.bi_private;
Modifications mod;	Modifications mod;
Operation opm;	Operation opm;
SlapReply rsm = { 0 };
struct berval bv[2];	struct berval bv[2];
slap_callback cb = {0};	slap_callback cb = {0};
	int manage = get_manageDSAit(op);

mod.sml_values = bv;	mod.sml_values = bv;
bv[1].bv_val = NULL;	bv[1].bv_val = NULL;
Line 1241 syncprov_checkpoint( Operation *op, Slap	Line 1151 syncprov_checkpoint( Operation *op, Slap
mod.sml_nvalues = NULL;	mod.sml_nvalues = NULL;
mod.sml_desc = slap_schema.si_ad_contextCSN;	mod.sml_desc = slap_schema.si_ad_contextCSN;
mod.sml_op = LDAP_MOD_REPLACE;	mod.sml_op = LDAP_MOD_REPLACE;
mod.sml_flags = 0;
mod.sml_next = NULL;	mod.sml_next = NULL;

cb.sc_response = slap_null_cb;	cb.sc_response = slap_null_cb;
Line 1253 syncprov_checkpoint( Operation *op, Slap	Line 1162 syncprov_checkpoint( Operation *op, Slap
opm.o_req_ndn = op->o_bd->be_nsuffix[0];	opm.o_req_ndn = op->o_bd->be_nsuffix[0];
opm.o_bd->bd_info = on->on_info->oi_orig;	opm.o_bd->bd_info = on->on_info->oi_orig;
opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;	opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
SLAP_DBFLAGS( opm.o_bd ) \|= SLAP_DBFLAG_NOLASTMOD;	opm.o_bd->be_modify( &opm, rs );
opm.o_bd->be_modify( &opm, &rsm );	opm.o_managedsait = manage;
SLAP_DBFLAGS( opm.o_bd ) ^= SLAP_DBFLAG_NOLASTMOD;
if ( mod.sml_next != NULL ) {
slap_mods_free( mod.sml_next, 1 );
}
}	}

static void	static void
Line 1278 syncprov_add_slog( Operation *op, struct	Line 1183 syncprov_add_slog( Operation *op, struct
se->se_next = NULL;	se->se_next = NULL;
se->se_tag = op->o_tag;	se->se_tag = op->o_tag;

se->se_uuid.bv_val = (char *)(&se[1]);	se->se_uuid.bv_val = (char *)(se+1);
	se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );	AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
se->se_uuid.bv_len = opc->suuid.bv_len;	se->se_uuid.bv_len = opc->suuid.bv_len;

se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );	AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
se->se_csn.bv_val[csn->bv_len] = '\0';	se->se_csn.bv_val[csn->bv_len] = '\0';
se->se_csn.bv_len = csn->bv_len;	se->se_csn.bv_len = csn->bv_len;
Line 1302 syncprov_add_slog( Operation *op, struct	Line 1207 syncprov_add_slog( Operation *op, struct
sl->sl_mincsn.bv_len = se->se_csn.bv_len;	sl->sl_mincsn.bv_len = se->se_csn.bv_len;
ch_free( se );	ch_free( se );
sl->sl_num--;	sl->sl_num--;
	if ( !sl->sl_head ) {
	sl->sl_tail = NULL;
	}
}	}
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );	ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
}	}
Line 1320 playlog_cb( Operation op, SlapReply rs	Line 1228 playlog_cb( Operation op, SlapReply rs
/* enter with sl->sl_mutex locked, release before returning */	/* enter with sl->sl_mutex locked, release before returning */
static void	static void
syncprov_playlog( Operation op, SlapReply rs, sessionlog *sl,	syncprov_playlog( Operation op, SlapReply rs, sessionlog *sl,
sync_control srs, struct berval ctxcsn )	struct berval oldcsn, struct berval ctxcsn )
{	{
slap_overinst on = (slap_overinst )op->o_bd->bd_info;	slap_overinst on = (slap_overinst )op->o_bd->bd_info;
	syncprov_info_t *si = on->on_bi.bi_private;
slog_entry *se;	slog_entry *se;
int i, j, ndel, num, nmods, mmods;	int i, j, ndel, num, nmods, mmods;
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
BerVarray uuids;	BerVarray uuids;
struct berval delcsn;

if ( !sl->sl_num ) {	if ( !sl->sl_num ) {
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );	ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
Line 1340 syncprov_playlog( Operation *op, SlapRep	Line 1247 syncprov_playlog( Operation *op, SlapRep

uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +	uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
num * UUID_LEN, op->o_tmpmemctx );	num * UUID_LEN, op->o_tmpmemctx );
uuids[0].bv_val = (char *)(uuids + num + 1);

delcsn.bv_len = 0;	uuids[0].bv_val = (char *)(uuids + num + 1);
delcsn.bv_val = cbuf;

/* Make a copy of the relevant UUIDs. Put the Deletes up front	/* Make a copy of the relevant UUIDs. Put the Deletes up front
* and everything else at the end. Do this first so we can	* and everything else at the end. Do this first so we can
* unlock the list mutex.	* unlock the list mutex.
*/	*/
for ( se=sl->sl_head; se; se=se->se_next ) {	for ( se=sl->sl_head; se; se=se->se_next ) {
if ( ber_bvcmp( &se->se_csn, &srs->sr_state.ctxcsn ) <= 0 ) continue;	if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;	if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
if ( se->se_tag == LDAP_REQ_DELETE ) {	if ( se->se_tag == LDAP_REQ_DELETE ) {
j = i;	j = i;
i++;	i++;
AC_MEMCPY( cbuf, se->se_csn.bv_val, se->se_csn.bv_len );
delcsn.bv_len = se->se_csn.bv_len;
} else {	} else {
nmods++;	nmods++;
j = num - nmods;	j = num - nmods;
Line 1437 syncprov_playlog( Operation *op, SlapRep	Line 1340 syncprov_playlog( Operation *op, SlapRep
mf.f_av_value = uuids[i];	mf.f_av_value = uuids[i];
cb.sc_private = NULL;	cb.sc_private = NULL;
fop.ors_slimit = 1;	fop.ors_slimit = 1;
frs.sr_nentries = 0;
rc = fop.o_bd->be_search( &fop, &frs );	rc = fop.o_bd->be_search( &fop, &frs );

/* If entry was not found, add to delete list */	/* If entry was not found, add to delete list */
Line 1448 syncprov_playlog( Operation *op, SlapRep	Line 1350 syncprov_playlog( Operation *op, SlapRep
fop.o_bd->bd_info = (BackendInfo *)on;	fop.o_bd->bd_info = (BackendInfo *)on;
}	}
if ( ndel ) {	if ( ndel ) {
struct berval cookie;

slap_compose_sync_cookie( op, &cookie, &delcsn, srs->sr_state.rid );
uuids[ndel].bv_val = NULL;	uuids[ndel].bv_val = NULL;
syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, &cookie, 0, uuids, 1 );	syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
}	}
op->o_tmpfree( uuids, op->o_tmpmemctx );
}	}

static int	static int
Line 1527 syncprov_op_response( Operation *op, Sla	Line 1424 syncprov_op_response( Operation *op, Sla
for ( sm = opc->smatches; sm; sm=sm->sm_next ) {	for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
if ( sm->sm_op->s_op->o_abandon )	if ( sm->sm_op->s_op->o_abandon )
continue;	continue;
syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE );	syncprov_sendresp( op, opc, sm->sm_op, NULL,
	LDAP_SYNC_DELETE, 1 );
}	}
break;	break;
}	}
Line 1699 typedef struct searchstate {	Line 1597 typedef struct searchstate {
slap_overinst *ss_on;	slap_overinst *ss_on;
syncops *ss_so;	syncops *ss_so;
int ss_present;	int ss_present;
struct berval ss_ctxcsn;
char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
} searchstate;	} searchstate;

static int	static int
Line 1715 syncprov_search_cleanup( Operation *op,	Line 1611 syncprov_search_cleanup( Operation *op,
}	}

static void	static void
syncprov_detach_op( Operation op, syncops so, slap_overinst *on )	syncprov_detach_op( Operation op, syncops so )
{	{
Operation *op2;	Operation *op2;
int i, alen = 0;	int i, alen = 0;
Line 1741 syncprov_detach_op( Operation *op, synco	Line 1637 syncprov_detach_op( Operation *op, synco
op2->o_hdr = op->o_hdr;	op2->o_hdr = op->o_hdr;
op2->o_tag = op->o_tag;	op2->o_tag = op->o_tag;
op2->o_time = op->o_time;	op2->o_time = op->o_time;
op2->o_bd = on->on_info->oi_origdb;	op2->o_bd = op->o_bd;
op2->o_request = op->o_request;	op2->o_request = op->o_request;
op2->o_private = on;

if ( i ) {	if ( i ) {
op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);	op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
Line 1770 syncprov_detach_op( Operation *op, synco	Line 1665 syncprov_detach_op( Operation *op, synco
op2->ors_filterstr.bv_val = ptr;	op2->ors_filterstr.bv_val = ptr;
strcpy( ptr, so->s_filterstr.bv_val );	strcpy( ptr, so->s_filterstr.bv_val );
op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;	op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
op2->ors_filter = filter_dup( op->ors_filter, NULL );	op2->ors_filter = str2filter( ptr );
so->s_op = op2;	so->s_op = op2;

/* Copy any cached group ACLs individually */	/* Copy any cached group ACLs individually */
Line 1782 syncprov_detach_op( Operation *op, synco	Line 1677 syncprov_detach_op( Operation *op, synco
g2->ga_next = op2->o_groups;	g2->ga_next = op2->o_groups;
op2->o_groups = g2;	op2->o_groups = g2;
}	}
/* Don't allow any further group caching */
op2->o_do_not_cache = 1;

/* Add op2 to conn so abandon will find us */	/* Add op2 to conn so abandon will find us */
ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );	ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
Line 1792 syncprov_detach_op( Operation *op, synco	Line 1685 syncprov_detach_op( Operation *op, synco
LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );	LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
so->s_flags \|= PS_IS_DETACHED;	so->s_flags \|= PS_IS_DETACHED;
ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );	ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );

/* Prevent anyone else from trying to send a result for this op */
op->o_abandon = 1;
}	}

static int	static int
Line 1802 syncprov_search_response( Operation *op,	Line 1692 syncprov_search_response( Operation *op,
{	{
searchstate *ss = op->o_callback->sc_private;	searchstate *ss = op->o_callback->sc_private;
slap_overinst *on = ss->ss_on;	slap_overinst *on = ss->ss_on;
	syncprov_info_t *si = on->on_bi.bi_private;
sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];	sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];

if ( rs->sr_type == REP_SEARCH \|\| rs->sr_type == REP_SEARCHREF ) {	if ( rs->sr_type == REP_SEARCH \|\| rs->sr_type == REP_SEARCHREF ) {
Attribute *a;	int i;
/* If we got a referral without a referral object, there's	/* If we got a referral without a referral object, there's
* something missing that we cannot replicate. Just ignore it.	* something missing that we cannot replicate. Just ignore it.
* The consumer will abort because we didn't send the expected	* The consumer will abort because we didn't send the expected
* control.	* control.
*/	*/
if ( !rs->sr_entry ) {	if ( !rs->sr_entry ) {
assert( rs->sr_entry != NULL );	assert( rs->sr_entry );
Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );	Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
return SLAP_CB_CONTINUE;	return SLAP_CB_CONTINUE;
}	}
a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );	if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
if ( a == NULL && rs->sr_operational_attrs != NULL ) {	Attribute *a = attr_find( rs->sr_entry->e_attrs,
a = attr_find( rs->sr_operational_attrs, slap_schema.si_ad_entryCSN );	slap_schema.si_ad_entryCSN );
}
if ( a ) {
/* Make sure entry is less than the snapshot'd contextCSN */
if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 ) {
Debug( LDAP_DEBUG_SYNC, "Entry %s CSN %s greater than snapshot %s\n",
rs->sr_entry->e_name.bv_val,
a->a_nvals[0].bv_val,
ss->ss_ctxcsn.bv_val );
return LDAP_SUCCESS;
}

/* Don't send the ctx entry twice */	/* Don't send the ctx entry twice */
if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) &&	if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) ) {
Debug( LDAP_DEBUG_SYNC, "Entry %s CSN %s matches ctx %s\n",
rs->sr_entry->e_name.bv_val,
a->a_nvals[0].bv_val,
srs->sr_state.ctxcsn.bv_val );
return LDAP_SUCCESS;	return LDAP_SUCCESS;
}
}	}
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl )2,	rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl )2,
op->o_tmpmemctx );	op->o_tmpmemctx );
Line 1848 syncprov_search_response( Operation *op,	Line 1723 syncprov_search_response( Operation *op,
} else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {	} else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
struct berval cookie;	struct berval cookie;

slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn,	slap_compose_sync_cookie( op, &cookie,
	&op->ors_filter->f_and->f_ava->aa_value,
srs->sr_state.rid );	srs->sr_state.rid );

/* Is this a regular refresh? */	/* Is this a regular refresh? */
Line 1859 syncprov_search_response( Operation *op,	Line 1735 syncprov_search_response( Operation *op,
rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,	rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :	0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
LDAP_SYNC_REFRESH_DELETES );	LDAP_SYNC_REFRESH_DELETES );
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
} else {	} else {
	int locked = 0;
/* It's RefreshAndPersist, transition to Persist phase */	/* It's RefreshAndPersist, transition to Persist phase */
syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?	syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,	LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
&cookie, 1, NULL, 0 );	&cookie, 1, NULL, 0 );
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );	/* Flush any queued persist messages */
	if ( ss->ss_so->s_res ) {
/* Detach this Op from frontend control */	ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );	locked = 1;
	syncprov_qplay( op, on, ss->ss_so );
	}

/* Turn off the refreshing flag */	/* Turn off the refreshing flag */
ss->ss_so->s_flags ^= PS_IS_REFRESHING;	ss->ss_so->s_flags ^= PS_IS_REFRESHING;
	if ( locked )
	ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );

syncprov_detach_op( op, ss->ss_so, on );	/* Detach this Op from frontend control */
ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );	syncprov_detach_op( op, ss->ss_so );

return LDAP_SUCCESS;	return LDAP_SUCCESS;
}	}
Line 1889 syncprov_op_search( Operation *op, SlapR	Line 1769 syncprov_op_search( Operation *op, SlapR
slap_overinst on = (slap_overinst )op->o_bd->bd_info;	slap_overinst on = (slap_overinst )op->o_bd->bd_info;
syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;	syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;
slap_callback *cb;	slap_callback *cb;
int gotstate = 0, nochange = 0, do_present;	int gotstate = 0, nochange = 0, do_present = 1;
	Filter fand, fava;
syncops *sop = NULL;	syncops *sop = NULL;
searchstate *ss;	searchstate *ss;
sync_control *srs;	sync_control *srs;
Line 1903 syncprov_op_search( Operation *op, SlapR	Line 1784 syncprov_op_search( Operation *op, SlapR
return rs->sr_err;	return rs->sr_err;
}	}

do_present = si->si_nopres ? 0 : 1;

srs = op->o_controls[slap_cids.sc_LDAPsync];	srs = op->o_controls[slap_cids.sc_LDAPsync];
op->o_managedsait = SLAP_CONTROL_NONCRITICAL;	op->o_managedsait = SLAP_CONTROL_NONCRITICAL;

Line 1919 syncprov_op_search( Operation *op, SlapR	Line 1798 syncprov_op_search( Operation *op, SlapR
fc.fbase = 0;	fc.fbase = 0;
so.s_eid = NOID;	so.s_eid = NOID;
so.s_op = op;	so.s_op = op;
so.s_flags = PS_IS_REFRESHING \| PS_FIND_BASE;	so.s_flags = PS_IS_REFRESHING;
/* syncprov_findbase expects to be called as a callback... */	/* syncprov_findbase expects to be called as a callback... */
sc.sc_private = &opc;	sc.sc_private = &opc;
opc.son = on;	opc.son = on;
ldap_pvt_thread_mutex_init( &so.s_mutex );
cb = op->o_callback;	cb = op->o_callback;
op->o_callback = &sc;	op->o_callback = &sc;
rs->sr_err = syncprov_findbase( op, &fc );	rs->sr_err = syncprov_findbase( op, &fc );
op->o_callback = cb;	op->o_callback = cb;
ldap_pvt_thread_mutex_destroy( &so.s_mutex );

if ( rs->sr_err != LDAP_SUCCESS ) {	if ( rs->sr_err != LDAP_SUCCESS ) {
send_ldap_result( op, rs );	send_ldap_result( op, rs );
Line 1984 syncprov_op_search( Operation *op, SlapR	Line 1861 syncprov_op_search( Operation *op, SlapR
if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {	if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
do_present = 0;	do_present = 0;
/* mutex is unlocked in playlog */	/* mutex is unlocked in playlog */
syncprov_playlog( op, rs, sl, srs, &ctxcsn );	syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
} else {	} else {
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );	ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
}	}
Line 1992 syncprov_op_search( Operation *op, SlapR	Line 1869 syncprov_op_search( Operation *op, SlapR
/* Is the CSN still present in the database? */	/* Is the CSN still present in the database? */
if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {	if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
/* No, so a reload is required */	/* No, so a reload is required */
/* the 2.2 consumer doesn't send this hint */	#if 0 /* the consumer doesn't seem to send this hint */
if ( si->si_usehint && srs->sr_rhint == 0 ) {	if ( op->o_sync_rhint == 0 ) {
send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );	send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
return rs->sr_err;	return rs->sr_err;
}	}
	#endif
} else {	} else {
gotstate = 1;	gotstate = 1;
/* If changed and doing Present lookup, send Present UUIDs */	/* If changed and doing Present lookup, send Present UUIDs */
Line 2016 shortcut:	Line 1894 shortcut:
sop->s_filterstr= op->ors_filterstr;	sop->s_filterstr= op->ors_filterstr;
}	}

/* If something changed, find the changes */	fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
if ( gotstate && !nochange ) {	fand->f_choice = LDAP_FILTER_AND;
Filter fand, fava;	fand->f_next = NULL;
	fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );	fava->f_choice = LDAP_FILTER_LE;
fand->f_choice = LDAP_FILTER_AND;	fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
fand->f_next = NULL;	fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );	#ifdef LDAP_COMP_MATCH
fand->f_and = fava;	fava->f_ava->aa_cf = NULL;
	#endif
	ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
	fand->f_and = fava;
	if ( gotstate ) {
	fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
	fava = fava->f_next;
fava->f_choice = LDAP_FILTER_GE;	fava->f_choice = LDAP_FILTER_GE;
fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );	fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;	fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
Line 2032 shortcut:	Line 1916 shortcut:
fava->f_ava->aa_cf = NULL;	fava->f_ava->aa_cf = NULL;
#endif	#endif
ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );	ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
fava->f_next = op->ors_filter;
op->ors_filter = fand;
filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
}	}
	fava->f_next = op->ors_filter;
	op->ors_filter = fand;
	filter2bv_x( op, op->ors_filter, &op->ors_filterstr );

/* Let our callback add needed info to returned entries */	/* Let our callback add needed info to returned entries */
cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);	cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
Line 2043 shortcut:	Line 1927 shortcut:
ss->ss_on = on;	ss->ss_on = on;
ss->ss_so = sop;	ss->ss_so = sop;
ss->ss_present = do_present;	ss->ss_present = do_present;
ss->ss_ctxcsn.bv_len = ctxcsn.bv_len;
ss->ss_ctxcsn.bv_val = ss->ss_csnbuf;
strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val );
cb->sc_response = syncprov_search_response;	cb->sc_response = syncprov_search_response;
cb->sc_cleanup = syncprov_search_cleanup;	cb->sc_cleanup = syncprov_search_cleanup;
cb->sc_private = ss;	cb->sc_private = ss;
Line 2116 syncprov_operational(	Line 1997 syncprov_operational(

enum {	enum {
SP_CHKPT = 1,	SP_CHKPT = 1,
SP_SESSL,	SP_SESSL
SP_NOPRES,
SP_USEHINT
};	};

static ConfigDriver sp_cf_gen;	static ConfigDriver sp_cf_gen;
Line 2128 static ConfigTable spcfg[] = {	Line 2007 static ConfigTable spcfg[] = {
sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "	sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
"DESC 'ContextCSN checkpoint interval in ops and minutes' "	"DESC 'ContextCSN checkpoint interval in ops and minutes' "
"SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },	"SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
{ "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT\|ARG_MAGIC\|SP_SESSL,	{ "syncprov-sessionlog", "size", 2, 2, 0, ARG_INT\|ARG_MAGIC\|SP_SESSL,
sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "	sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
"DESC 'Session log size in ops' "	"DESC 'Session log size in ops' "
"SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },	"SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
{ "syncprov-nopresent", NULL, 2, 2, 0, ARG_ON_OFF\|ARG_MAGIC\|SP_NOPRES,
sp_cf_gen, "( OLcfgOvAt:1.3 NAME 'olcSpNoPresent' "
"DESC 'Omit Present phase processing' "
"SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
{ "syncprov-reloadhint", NULL, 2, 2, 0, ARG_ON_OFF\|ARG_MAGIC\|SP_USEHINT,
sp_cf_gen, "( OLcfgOvAt:1.4 NAME 'olcSpReloadHint' "
"DESC 'Observe Reload Hint in Request control' "
"SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
{ NULL, NULL, 0, 0, 0, ARG_IGNORED }	{ NULL, NULL, 0, 0, 0, ARG_IGNORED }
};	};

Line 2148 static ConfigOCs spocs[] = {	Line 2019 static ConfigOCs spocs[] = {
"NAME 'olcSyncProvConfig' "	"NAME 'olcSyncProvConfig' "
"DESC 'SyncRepl Provider configuration' "	"DESC 'SyncRepl Provider configuration' "
"SUP olcOverlayConfig "	"SUP olcOverlayConfig "
"MAY ( olcSpCheckpoint $ olcSpSessionlog $ olcSpNoPresent ) )",	"MAY ( olcSpCheckpoint $ olcSpSessionlog ) )",
Cft_Overlay, spcfg },	Cft_Overlay, spcfg },
{ NULL, 0, NULL }	{ NULL, 0, NULL }
};	};
Line 2180 sp_cf_gen(ConfigArgs *c)	Line 2051 sp_cf_gen(ConfigArgs *c)
rc = 1;	rc = 1;
}	}
break;	break;
case SP_NOPRES:
if ( si->si_nopres ) {
c->value_int = 1;
} else {
rc = 1;
}
break;
case SP_USEHINT:
if ( si->si_usehint ) {
c->value_int = 1;
} else {
rc = 1;
}
break;
}	}
return rc;	return rc;
} else if ( c->op == LDAP_MOD_DELETE ) {	} else if ( c->op == LDAP_MOD_DELETE ) {
Line 2208 sp_cf_gen(ConfigArgs *c)	Line 2065 sp_cf_gen(ConfigArgs *c)
else	else
rc = LDAP_NO_SUCH_ATTRIBUTE;	rc = LDAP_NO_SUCH_ATTRIBUTE;
break;	break;
case SP_NOPRES:
if ( si->si_nopres )
si->si_nopres = 0;
else
rc = LDAP_NO_SUCH_ATTRIBUTE;
break;
case SP_USEHINT:
if ( si->si_usehint )
si->si_usehint = 0;
else
rc = LDAP_NO_SUCH_ATTRIBUTE;
break;
}	}
return rc;	return rc;
}	}
switch ( c->type ) {	switch ( c->type ) {
case SP_CHKPT:	case SP_CHKPT:
if ( lutil_atoi( &si->si_chkops, c->argv[1] ) != 0 ) {	si->si_chkops = atoi( c->argv[1] );
sprintf( c->msg, "%s unable to parse checkpoint ops # \"%s\"",	si->si_chktime = atoi( c->argv[2] ) * 60;
c->argv[0], c->argv[1] );
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
return ARG_BAD_CONF;
}
if ( si->si_chkops <= 0 ) {
sprintf( c->msg, "%s invalid checkpoint ops # \"%d\"",
c->argv[0], si->si_chkops );
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
return ARG_BAD_CONF;
}
if ( lutil_atoi( &si->si_chktime, c->argv[2] ) != 0 ) {
sprintf( c->msg, "%s unable to parse checkpoint time \"%s\"",
c->argv[0], c->argv[1] );
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
return ARG_BAD_CONF;
}
if ( si->si_chktime <= 0 ) {
sprintf( c->msg, "%s invalid checkpoint time \"%d\"",
c->argv[0], si->si_chkops );
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
return ARG_BAD_CONF;
}
si->si_chktime *= 60;
break;	break;
case SP_SESSL: {	case SP_SESSL: {
sessionlog *sl;	sessionlog *sl;
Line 2274 sp_cf_gen(ConfigArgs *c)	Line 2096 sp_cf_gen(ConfigArgs *c)
sl->sl_size = size;	sl->sl_size = size;
}	}
break;	break;
case SP_NOPRES:
si->si_nopres = c->value_int;
break;
case SP_USEHINT:
si->si_usehint = c->value_int;
break;
}	}
return rc;	return rc;
}	}

/* ITS#3456 we cannot run this search on the main thread, must use a	/* Cheating - we have no thread pool context for these functions,
* child thread in order to insure we have a big enough stack.	* so make one.
*/	*/
static void *	typedef struct thread_keys {
syncprov_db_otask(	void *key;
void *ptr	void *data;
)	ldap_pvt_thread_pool_keyfree_t *xfree;
{	} thread_keys;
syncprov_findcsn( ptr, FIND_MAXCSN );
return NULL;	#define MAXKEYS 32
}	/* A fake thread context */
	static thread_keys thrctx[MAXKEYS];

/* Read any existing contextCSN from the underlying db.	/* Read any existing contextCSN from the underlying db.
* Then search for any entries newer than that. If no value exists,	* Then search for any entries newer than that. If no value exists,
Line 2308 syncprov_db_open(	Line 2125 syncprov_db_open(
slap_overinst on = (slap_overinst ) be->bd_info;	slap_overinst on = (slap_overinst ) be->bd_info;
syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;	syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;

Connection conn = { 0 };	Connection conn;
OperationBuffer opbuf = { 0 };	char opbuf[OPERATION_BUFFER_SIZE];
char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];	char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
Operation op = (Operation ) &opbuf;	Operation op = (Operation )opbuf;
Entry *e;	Entry *e;
Attribute *a;	Attribute *a;
int rc;	int rc;
void *thrctx = NULL;

if ( slapMode & SLAP_TOOL_MODE ) {	if ( slapMode & SLAP_TOOL_MODE ) {
return 0;	return 0;
Line 2326 syncprov_db_open(	Line 2142 syncprov_db_open(
return rc;	return rc;
}	}

thrctx = ldap_pvt_thread_pool_context();
connection_fake_init( &conn, op, thrctx );	connection_fake_init( &conn, op, thrctx );
op->o_bd = be;	op->o_bd = be;
op->o_dn = be->be_rootdn;	op->o_dn = be->be_rootdn;
Line 2339 syncprov_db_open(	Line 2154 syncprov_db_open(
slap_schema.si_ad_contextCSN, 0, &e );	slap_schema.si_ad_contextCSN, 0, &e );

if ( e ) {	if ( e ) {
ldap_pvt_thread_t tid;

a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );	a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
if ( a ) {	if ( a ) {
si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;	si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
Line 2352 syncprov_db_open(	Line 2165 syncprov_db_open(
strcpy( ctxcsnbuf, si->si_ctxcsnbuf );	strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
}	}
be_entry_release_rw( op, e, 0 );	be_entry_release_rw( op, e, 0 );
if ( !BER_BVISEMPTY( &si->si_ctxcsn ) ) {	op->o_bd->bd_info = (BackendInfo *)on;
op->o_bd->bd_info = (BackendInfo *)on;	op->o_req_dn = be->be_suffix[0];
op->o_req_dn = be->be_suffix[0];	op->o_req_ndn = be->be_nsuffix[0];
op->o_req_ndn = be->be_nsuffix[0];	op->ors_scope = LDAP_SCOPE_SUBTREE;
op->ors_scope = LDAP_SCOPE_SUBTREE;	syncprov_findcsn( op, FIND_MAXCSN );
ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
ldap_pvt_thread_join( tid, NULL );
}
} else if ( SLAP_SYNC_SHADOW( op->o_bd )) {	} else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
/* If we're also a consumer, and we didn't find the context entry,	/* If we're also a consumer, and we didn't find the context entry,
* then don't generate anything, wait for our provider to send it	* then don't generate anything, wait for our provider to send it
Line 2369 syncprov_db_open(	Line 2179 syncprov_db_open(
}	}

if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {	if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
si->si_ctxcsn.bv_len = sizeof( si->si_ctxcsnbuf );	slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
slap_get_csn( op, &si->si_ctxcsn, 0 );	&si->si_ctxcsn, 0 );
}	}

/* If our ctxcsn is different from what was read from the root	/* If our ctxcsn is different from what was read from the root
* entry, make sure we do a checkpoint on close	* entry, write the new value out.
*/	*/
if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {	if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
si->si_numops++;	SlapReply rs = {REP_RESULT};
	syncprov_checkpoint( op, &rs, on );
}	}

out:	out:
op->o_bd->bd_info = (BackendInfo *)on;	op->o_bd->bd_info = (BackendInfo *)on;
ldap_pvt_thread_pool_context_reset( thrctx );
return 0;	return 0;
}	}

Line 2395 syncprov_db_close(	Line 2205 syncprov_db_close(
{	{
slap_overinst on = (slap_overinst ) be->bd_info;	slap_overinst on = (slap_overinst ) be->bd_info;
syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;	syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;
	int i;

if ( slapMode & SLAP_TOOL_MODE ) {	if ( slapMode & SLAP_TOOL_MODE ) {
return 0;	return 0;
}	}
if ( si->si_numops ) {	if ( si->si_numops ) {
Connection conn;	Connection conn;
OperationBuffer opbuf;	char opbuf[OPERATION_BUFFER_SIZE];
Operation op = (Operation ) &opbuf;	Operation op = (Operation )opbuf;
SlapReply rs = {REP_RESULT};	SlapReply rs = {REP_RESULT};
void *thrctx;

thrctx = ldap_pvt_thread_pool_context();
connection_fake_init( &conn, op, thrctx );	connection_fake_init( &conn, op, thrctx );
op->o_bd = be;	op->o_bd = be;
op->o_dn = be->be_rootdn;	op->o_dn = be->be_rootdn;
op->o_ndn = be->be_rootndn;	op->o_ndn = be->be_rootndn;
syncprov_checkpoint( op, &rs, on );	syncprov_checkpoint( op, &rs, on );
ldap_pvt_thread_pool_context_reset( thrctx );	}
	for ( i=0; thrctx[i].key; i++) {
	if ( thrctx[i].xfree )
	thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
	thrctx[i].key = NULL;
}	}

return 0;	return 0;
Line 2435 syncprov_db_init(	Line 2248 syncprov_db_init(

csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;	csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;	csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
csn_anlist[1].an_desc = slap_schema.si_ad_entryUUID;
csn_anlist[1].an_name = slap_schema.si_ad_entryUUID->ad_cname;

uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;	uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;	uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
Line 2453 syncprov_db_destroy(	Line 2264 syncprov_db_destroy(
syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;	syncprov_info_t si = (syncprov_info_t )on->on_bi.bi_private;

if ( si ) {	if ( si ) {
if ( si->si_logs ) {
slog_entry *se = si->si_logs->sl_head;

while ( se ) {
slog_entry *se_next = se->se_next;
ch_free( se );
se = se_next;
}

ch_free( si->si_logs );
}
ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );	ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );	ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );	ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
Line 2479 static int syncprov_parseCtrl (	Line 2279 static int syncprov_parseCtrl (
LDAPControl *ctrl )	LDAPControl *ctrl )
{	{
ber_tag_t tag;	ber_tag_t tag;
BerElementBuffer berbuf;	BerElement *ber;
BerElement ber = (BerElement )&berbuf;
ber_int_t mode;	ber_int_t mode;
ber_len_t len;	ber_len_t len;
struct berval cookie = BER_BVNULL;	struct berval cookie = BER_BVNULL;
Line 2514 static int syncprov_parseCtrl (	Line 2313 static int syncprov_parseCtrl (
* }	* }
*/	*/

ber_init2( ber, &ctrl->ldctl_value, 0 );	ber = ber_init( &ctrl->ldctl_value );
	if( ber == NULL ) {
	rs->sr_text = "internal error";
	return LDAP_OTHER;
	}

if ( (tag = ber_scanf( ber, "{i" /}/, &mode )) == LBER_ERROR ) {	if ( (tag = ber_scanf( ber, "{i" /}/, &mode )) == LBER_ERROR ) {
rs->sr_text = "Sync control : mode decoding error";	rs->sr_text = "Sync control : mode decoding error";
Line 2536 static int syncprov_parseCtrl (	Line 2339 static int syncprov_parseCtrl (
tag = ber_peek_tag( ber, &len );	tag = ber_peek_tag( ber, &len );

if ( tag == LDAP_TAG_SYNC_COOKIE ) {	if ( tag == LDAP_TAG_SYNC_COOKIE ) {
if (( ber_scanf( ber, /{/ "m", &cookie )) == LBER_ERROR ) {	if (( ber_scanf( ber, /{/ "o", &cookie )) == LBER_ERROR ) {
rs->sr_text = "Sync control : cookie decoding error";	rs->sr_text = "Sync control : cookie decoding error";
return LDAP_PROTOCOL_ERROR;	return LDAP_PROTOCOL_ERROR;
}	}
tag = ber_peek_tag( ber, &len );
}	}
if ( tag == LDAP_TAG_RELOAD_HINT ) {	if ( tag == LDAP_TAG_RELOAD_HINT ) {
if (( ber_scanf( ber, /{/ "b", &rhint )) == LBER_ERROR ) {	if (( ber_scanf( ber, /{/ "b", &rhint )) == LBER_ERROR ) {
Line 2555 static int syncprov_parseCtrl (	Line 2357 static int syncprov_parseCtrl (
sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );	sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
sr->sr_rhint = rhint;	sr->sr_rhint = rhint;
if (!BER_BVISNULL(&cookie)) {	if (!BER_BVISNULL(&cookie)) {
ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );	ber_dupbv( &sr->sr_state.octet_str, &cookie );
slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx );	slap_parse_sync_cookie( &sr->sr_state );
if ( sr->sr_state.rid == -1 ) {
rs->sr_text = "Sync control : cookie parsing error";
return LDAP_PROTOCOL_ERROR;
}
}	}

op->o_controls[slap_cids.sc_LDAPsync] = sr;	op->o_controls[slap_cids.sc_LDAPsync] = sr;

	(void) ber_free( ber, 1 );

op->o_sync = ctrl->ldctl_iscritical	op->o_sync = ctrl->ldctl_iscritical
? SLAP_CONTROL_CRITICAL	? SLAP_CONTROL_CRITICAL
: SLAP_CONTROL_NONCRITICAL;	: SLAP_CONTROL_NONCRITICAL;
Line 2582 static int syncprov_parseCtrl (	Line 2382 static int syncprov_parseCtrl (
static slap_overinst syncprov;	static slap_overinst syncprov;

int	int
syncprov_initialize()	syncprov_init()
{	{
int rc;	int rc;

rc = register_supported_control( LDAP_CONTROL_SYNC,	rc = register_supported_control( LDAP_CONTROL_SYNC,
SLAP_CTRL_SEARCH, NULL,	SLAP_CTRL_HIDE\|SLAP_CTRL_SEARCH, NULL,
syncprov_parseCtrl, &slap_cids.sc_LDAPsync );	syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
if ( rc != LDAP_SUCCESS ) {	if ( rc != LDAP_SUCCESS ) {
Debug( LDAP_DEBUG_ANY,	Debug( LDAP_DEBUG_ANY,
Line 2615 syncprov_initialize()	Line 2415 syncprov_initialize()

syncprov.on_bi.bi_cf_ocs = spocs;	syncprov.on_bi.bi_cf_ocs = spocs;

generic_filter.f_desc = slap_schema.si_ad_objectClass;

rc = config_register_schema( spcfg, spocs );	rc = config_register_schema( spcfg, spocs );
if ( rc ) return rc;	if ( rc ) return rc;

Line 2627 syncprov_initialize()	Line 2425 syncprov_initialize()
int	int
init_module( int argc, char *argv[] )	init_module( int argc, char *argv[] )
{	{
return syncprov_initialize();	return syncprov_init();
}	}
#endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */	#endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */

Removed from v.1.56.2.32
changed lines
	Added in v.1.84