version 1.149, 2006/05/02 03:08:59
|
version 1.184, 2007/02/16 01:22:25
|
Line 1
|
Line 1
|
/* $OpenLDAP: pkg/ldap/servers/slapd/overlays/syncprov.c,v 1.148 2006/04/28 01:06:47 hyc Exp $ */ |
/* $OpenLDAP: pkg/ldap/servers/slapd/overlays/syncprov.c,v 1.183 2007/02/14 07:51:47 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-2007 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 59 typedef struct syncops {
|
Line 59 typedef struct syncops {
|
ID s_eid; /* entryID of search base */ |
ID s_eid; /* entryID of search base */ |
Operation *s_op; /* search op */ |
Operation *s_op; /* search op */ |
int s_rid; |
int s_rid; |
|
int s_sid; |
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_REFRESHING 0x01 |
#define PS_IS_DETACHED 0x02 |
#define PS_IS_DETACHED 0x02 |
#define PS_WROTE_BASE 0x04 |
#define PS_WROTE_BASE 0x04 |
#define PS_FIND_BASE 0x08 |
#define PS_FIND_BASE 0x08 |
|
#define PS_FIX_FILTER 0x10 |
|
|
int s_inuse; /* reference count */ |
int s_inuse; /* reference count */ |
struct syncres *s_res; |
struct syncres *s_res; |
Line 102 typedef struct slog_entry {
|
Line 104 typedef struct slog_entry {
|
struct slog_entry *se_next; |
struct slog_entry *se_next; |
struct berval se_uuid; |
struct berval se_uuid; |
struct berval se_csn; |
struct berval se_csn; |
|
int se_sid; |
ber_tag_t se_tag; |
ber_tag_t se_tag; |
} slog_entry; |
} slog_entry; |
|
|
Line 117 typedef struct sessionlog {
|
Line 120 typedef struct sessionlog {
|
/* The main state for this overlay */ |
/* The main state for this overlay */ |
typedef struct syncprov_info_t { |
typedef struct syncprov_info_t { |
syncops *si_ops; |
syncops *si_ops; |
struct berval si_ctxcsn; /* ldapsync context */ |
BerVarray si_ctxcsn; /* ldapsync context */ |
|
int *si_sids; |
|
int si_numcsns; |
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 */ |
Line 126 typedef struct syncprov_info_t {
|
Line 131 typedef struct syncprov_info_t {
|
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; |
ldap_pvt_thread_mutex_t si_csn_mutex; |
ldap_pvt_thread_rdwr_t si_csn_rwlock; |
ldap_pvt_thread_mutex_t si_ops_mutex; |
ldap_pvt_thread_mutex_t si_ops_mutex; |
ldap_pvt_thread_mutex_t si_mods_mutex; |
ldap_pvt_thread_mutex_t si_mods_mutex; |
char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
|
} syncprov_info_t; |
} syncprov_info_t; |
|
|
typedef struct opcookie { |
typedef struct opcookie { |
Line 400 syncprov_findbase( Operation *op, fbase_
|
Line 404 syncprov_findbase( Operation *op, fbase_
|
slap_callback cb = {0}; |
slap_callback cb = {0}; |
Operation fop; |
Operation fop; |
SlapReply frs = { REP_RESULT }; |
SlapReply frs = { REP_RESULT }; |
|
BackendInfo *bi; |
int rc; |
int rc; |
|
|
fc->fss->s_flags ^= PS_FIND_BASE; |
fc->fss->s_flags ^= PS_FIND_BASE; |
Line 411 syncprov_findbase( Operation *op, fbase_
|
Line 416 syncprov_findbase( Operation *op, fbase_
|
fop.o_bd = op->o_bd; |
fop.o_bd = op->o_bd; |
fop.o_time = op->o_time; |
fop.o_time = op->o_time; |
fop.o_tincr = op->o_tincr; |
fop.o_tincr = op->o_tincr; |
|
bi = op->o_bd->bd_info; |
|
|
cb.sc_response = findbase_cb; |
cb.sc_response = findbase_cb; |
cb.sc_private = fc; |
cb.sc_private = fc; |
Line 428 syncprov_findbase( Operation *op, fbase_
|
Line 434 syncprov_findbase( Operation *op, fbase_
|
fop.ors_filter = &generic_filter; |
fop.ors_filter = &generic_filter; |
fop.ors_filterstr = generic_filterstr; |
fop.ors_filterstr = generic_filterstr; |
|
|
fop.o_bd->bd_info = on->on_info->oi_orig; |
rc = overlay_op_walk( &fop, &frs, op_search, on->on_info, on ); |
rc = fop.o_bd->be_search( &fop, &frs ); |
op->o_bd->bd_info = bi; |
fop.o_bd->bd_info = (BackendInfo *)on; |
|
} else { |
} else { |
ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex ); |
ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex ); |
fc->fbase = 1; |
fc->fbase = 1; |
Line 579 syncprov_findcsn( Operation *op, find_cs
|
Line 584 syncprov_findcsn( Operation *op, find_cs
|
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 maxcsn; |
Filter cf, af; |
Filter cf; |
#ifdef LDAP_COMP_MATCH |
#ifdef LDAP_COMP_MATCH |
AttributeAssertion eq = { NULL, BER_BVNULL, NULL }; |
AttributeAssertion eq = { NULL, BER_BVNULL, NULL }; |
#else |
#else |
Line 589 syncprov_findcsn( Operation *op, find_cs
|
Line 594 syncprov_findcsn( Operation *op, find_cs
|
sync_control *srs = NULL; |
sync_control *srs = NULL; |
struct slap_limits_set fc_limits; |
struct slap_limits_set fc_limits; |
int i, rc = LDAP_SUCCESS, findcsn_retry = 1; |
int i, rc = LDAP_SUCCESS, findcsn_retry = 1; |
|
int maxid = 0; |
|
|
if ( mode != FIND_MAXCSN ) { |
if ( mode != FIND_MAXCSN ) { |
srs = op->o_controls[slap_cids.sc_LDAPsync]; |
srs = op->o_controls[slap_cids.sc_LDAPsync]; |
|
|
if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) { |
|
return LDAP_OTHER; |
|
} |
|
} |
} |
|
|
fop = *op; |
fop = *op; |
Line 605 syncprov_findcsn( Operation *op, find_cs
|
Line 607 syncprov_findcsn( Operation *op, find_cs
|
|
|
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; |
|
BER_BVZERO( &cf.f_av_value ); |
cf.f_next = NULL; |
cf.f_next = NULL; |
|
|
fop.o_callback = &cb; |
fop.o_callback = &cb; |
Line 617 again:
|
Line 620 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[0]; |
|
/* If there are multiple CSNs, use the largest */ |
|
for ( i=1; i<si->si_numcsns; i++) { |
|
if ( ber_bvcmp( &cf.f_av_value, &si->si_ctxcsn[i] ) < 0 ) { |
|
cf.f_av_value = si->si_ctxcsn[i]; |
|
maxid = i; |
|
} |
|
} |
fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)", |
fop.ors_filterstr.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; |
Line 625 again:
|
Line 635 again:
|
fop.ors_slimit = SLAP_NO_LIMIT; |
fop.ors_slimit = SLAP_NO_LIMIT; |
cb.sc_private = &maxcsn; |
cb.sc_private = &maxcsn; |
cb.sc_response = findmax_cb; |
cb.sc_response = findmax_cb; |
strcpy( cbuf, si->si_ctxcsn.bv_val ); |
strcpy( cbuf, cf.f_av_value.bv_val ); |
maxcsn.bv_val = cbuf; |
maxcsn.bv_val = cbuf; |
maxcsn.bv_len = si->si_ctxcsn.bv_len; |
maxcsn.bv_len = cf.f_av_value.bv_len; |
break; |
break; |
case FIND_CSN: |
case FIND_CSN: |
cf.f_av_value = srs->sr_state.ctxcsn; |
if ( BER_BVISEMPTY( &cf.f_av_value )) { |
|
cf.f_av_value = srs->sr_state.ctxcsn[0]; |
|
/* If there are multiple CSNs, use the smallest */ |
|
for ( i=1; i<srs->sr_state.numcsns; i++ ) { |
|
if ( ber_bvcmp( &cf.f_av_value, &srs->sr_state.ctxcsn[i] ) |
|
> 0 ) { |
|
cf.f_av_value = srs->sr_state.ctxcsn[i]; |
|
} |
|
} |
|
} |
/* Look for exact match the first time */ |
/* Look for exact match the first time */ |
if ( findcsn_retry ) { |
if ( findcsn_retry ) { |
cf.f_choice = LDAP_FILTER_EQUALITY; |
cf.f_choice = LDAP_FILTER_EQUALITY; |
Line 651 again:
|
Line 670 again:
|
cb.sc_response = findcsn_cb; |
cb.sc_response = findcsn_cb; |
break; |
break; |
case FIND_PRESENT: |
case FIND_PRESENT: |
af.f_choice = LDAP_FILTER_AND; |
fop.ors_filter = op->ors_filter; |
af.f_next = NULL; |
fop.ors_filterstr = op->ors_filterstr; |
af.f_and = &cf; |
|
cf.f_choice = LDAP_FILTER_LE; |
|
cf.f_av_value = srs->sr_state.ctxcsn; |
|
cf.f_next = op->ors_filter; |
|
fop.ors_filter = ⁡ |
|
filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr ); |
|
fop.ors_attrsonly = 0; |
fop.ors_attrsonly = 0; |
fop.ors_attrs = uuid_anlist; |
fop.ors_attrs = uuid_anlist; |
fop.ors_slimit = SLAP_NO_LIMIT; |
fop.ors_slimit = SLAP_NO_LIMIT; |
Line 686 again:
|
Line 699 again:
|
|
|
switch( mode ) { |
switch( mode ) { |
case FIND_MAXCSN: |
case FIND_MAXCSN: |
strcpy( si->si_ctxcsnbuf, maxcsn.bv_val ); |
if ( ber_bvcmp( &si->si_ctxcsn[maxid], &maxcsn )) { |
si->si_ctxcsn.bv_len = maxcsn.bv_len; |
ber_bvreplace( &si->si_ctxcsn[maxid], &maxcsn ); |
|
si->si_numops++; /* ensure a checkpoint */ |
|
} |
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. */ |
Line 702 again:
|
Line 717 again:
|
break; |
break; |
case FIND_PRESENT: |
case FIND_PRESENT: |
op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx ); |
op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx ); |
op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx ); |
|
break; |
break; |
} |
} |
|
|
Line 747 syncprov_sendresp( Operation *op, opcook
|
Line 761 syncprov_sendresp( Operation *op, opcook
|
|
|
SlapReply rs = { REP_SEARCH }; |
SlapReply rs = { REP_SEARCH }; |
LDAPControl *ctrls[2]; |
LDAPControl *ctrls[2]; |
struct berval cookie; |
struct berval cookie, csns[2]; |
Entry e_uuid = {0}; |
Entry e_uuid = {0}; |
Attribute a_uuid = {0}; |
Attribute a_uuid = {0}; |
|
|
Line 755 syncprov_sendresp( Operation *op, opcook
|
Line 769 syncprov_sendresp( Operation *op, opcook
|
return SLAPD_ABANDON; |
return SLAPD_ABANDON; |
|
|
ctrls[1] = NULL; |
ctrls[1] = NULL; |
slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid ); |
csns[0] = opc->sctxcsn; |
|
BER_BVZERO( &csns[1] ); |
|
slap_compose_sync_cookie( op, &cookie, csns, so->s_rid, so->s_sid ); |
|
|
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; |
Line 773 syncprov_sendresp( Operation *op, opcook
|
Line 789 syncprov_sendresp( Operation *op, opcook
|
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( op, rs.sr_entry ); |
send_search_reference( op, &rs ); |
rs.sr_err = send_search_reference( op, &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 785 syncprov_sendresp( Operation *op, opcook
|
Line 801 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; |
rs.sr_attrs = op->ors_attrs; |
rs.sr_attrs = op->ors_attrs; |
send_search_entry( op, &rs ); |
rs.sr_err = send_search_entry( op, &rs ); |
if ( !rs.sr_entry ) |
if ( !rs.sr_entry ) |
*e = NULL; |
*e = NULL; |
break; |
break; |
Line 797 syncprov_sendresp( Operation *op, opcook
|
Line 813 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 ); |
rs.sr_err = send_search_reference( op, &rs ); |
} else { |
} else { |
send_search_entry( op, &rs ); |
rs.sr_err = send_search_entry( op, &rs ); |
} |
} |
break; |
break; |
default: |
default: |
Line 824 syncprov_qplay( Operation *op, slap_over
|
Line 840 syncprov_qplay( Operation *op, slap_over
|
int rc = 0; |
int rc = 0; |
|
|
opc.son = on; |
opc.son = on; |
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
|
|
|
for (;;) { |
for (;;) { |
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
Line 846 syncprov_qplay( Operation *op, slap_over
|
Line 861 syncprov_qplay( Operation *op, slap_over
|
e = NULL; |
e = NULL; |
|
|
if ( sr->s_mode != LDAP_SYNC_DELETE ) { |
if ( sr->s_mode != LDAP_SYNC_DELETE ) { |
rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e ); |
rc = overlay_entry_get_ov( op, &opc.sndn, NULL, NULL, 0, &e, on ); |
if ( rc ) { |
if ( rc ) { |
|
Debug( LDAP_DEBUG_SYNC, "syncprov_qplay: failed to get %s, " |
|
"error (%d), ignoring...\n", opc.sndn.bv_val, rc, 0 ); |
ch_free( sr ); |
ch_free( sr ); |
|
rc = 0; |
continue; |
continue; |
} |
} |
} |
} |
rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode ); |
rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode ); |
|
|
if ( e ) { |
if ( e ) { |
be_entry_release_rw( op, e, 0 ); |
overlay_entry_release_ov( op, e, 0, on ); |
} |
} |
|
|
ch_free( sr ); |
ch_free( sr ); |
Line 863 syncprov_qplay( Operation *op, slap_over
|
Line 881 syncprov_qplay( Operation *op, slap_over
|
if ( rc ) |
if ( rc ) |
break; |
break; |
} |
} |
op->o_bd->bd_info = (BackendInfo *)on; |
|
return rc; |
return rc; |
} |
} |
|
|
Line 877 syncprov_qtask( void *ctx, void *arg )
|
Line 894 syncprov_qtask( void *ctx, void *arg )
|
OperationBuffer opbuf; |
OperationBuffer opbuf; |
Operation *op; |
Operation *op; |
BackendDB be; |
BackendDB be; |
|
int rc; |
|
|
op = (Operation *) &opbuf; |
op = (Operation *) &opbuf; |
*op = *so->s_op; |
*op = *so->s_op; |
Line 886 syncprov_qtask( void *ctx, void *arg )
|
Line 904 syncprov_qtask( void *ctx, void *arg )
|
|
|
*op->o_hdr = *so->s_op->o_hdr; |
*op->o_hdr = *so->s_op->o_hdr; |
|
|
op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx); |
op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx, 1); |
op->o_tmpmfuncs = &slap_sl_mfuncs; |
op->o_tmpmfuncs = &slap_sl_mfuncs; |
op->o_threadctx = ctx; |
op->o_threadctx = ctx; |
|
|
Line 897 syncprov_qtask( void *ctx, void *arg )
|
Line 915 syncprov_qtask( void *ctx, void *arg )
|
op->o_private = NULL; |
op->o_private = NULL; |
op->o_callback = NULL; |
op->o_callback = NULL; |
|
|
(void)syncprov_qplay( op, on, so ); |
rc = syncprov_qplay( op, on, so ); |
|
|
/* decrement use count... */ |
/* decrement use count... */ |
syncprov_free_syncop( so ); |
syncprov_free_syncop( so ); |
|
|
/* wait until we get explicitly scheduled again */ |
/* wait until we get explicitly scheduled again */ |
ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex ); |
ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex ); |
ldap_pvt_runqueue_stoptask( &slapd_rq, so->s_qtask ); |
ldap_pvt_runqueue_stoptask( &slapd_rq, rtask ); |
ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 1 ); |
if ( rc == 0 ) { |
|
ldap_pvt_runqueue_resched( &slapd_rq, rtask, 1 ); |
|
} else { |
|
/* bail out on any error */ |
|
ldap_pvt_runqueue_remove( &slapd_rq, rtask ); |
|
} |
ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex ); |
ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex ); |
|
|
|
#if 0 /* FIXME: connection_close isn't exported from slapd. |
|
* should it be? |
|
*/ |
|
if ( rc ) { |
|
ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex ); |
|
if ( connection_state_closing( op->o_conn )) { |
|
connection_close( op->o_conn ); |
|
} |
|
ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex ); |
|
} |
|
#endif |
return NULL; |
return NULL; |
} |
} |
|
|
|
/* Start the task to play back queued psearch responses */ |
|
static void |
|
syncprov_qstart( syncops *so ) |
|
{ |
|
int wake=0; |
|
ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex ); |
|
if ( !so->s_qtask ) { |
|
so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, RUNQ_INTERVAL, |
|
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 ); |
|
if ( wake ) |
|
slap_wake_listener(); |
|
} |
|
|
/* Queue a persistent search response */ |
/* Queue a persistent search response */ |
static int |
static int |
syncprov_qresp( opcookie *opc, syncops *so, int mode ) |
syncprov_qresp( opcookie *opc, syncops *so, int mode ) |
{ |
{ |
syncres *sr; |
syncres *sr; |
|
int sid; |
|
|
|
/* Don't send changes back to their originator */ |
|
sid = slap_parse_csn_sid( &opc->sctxcsn ); |
|
if ( sid >= 0 && sid == so->s_sid ) |
|
return LDAP_SUCCESS; |
|
|
sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 + |
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 ); |
opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 ); |
Line 949 syncprov_qresp( opcookie *opc, syncops *
|
Line 1016 syncprov_qresp( opcookie *opc, syncops *
|
so->s_flags |= PS_FIND_BASE; |
so->s_flags |= PS_FIND_BASE; |
} |
} |
if ( so->s_flags & PS_IS_DETACHED ) { |
if ( so->s_flags & PS_IS_DETACHED ) { |
int wake=0; |
syncprov_qstart( so ); |
ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex ); |
|
if ( !so->s_qtask ) { |
|
so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, RUNQ_INTERVAL, |
|
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 ); |
|
if ( wake ) |
|
slap_wake_listener(); |
|
} |
} |
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
Line 1050 syncprov_matchops( Operation *op, opcook
|
Line 1097 syncprov_matchops( Operation *op, opcook
|
|
|
fbase_cookie fc; |
fbase_cookie fc; |
syncops *ss, *sprev, *snext; |
syncops *ss, *sprev, *snext; |
Entry *e; |
Entry *e = NULL; |
Attribute *a; |
Attribute *a; |
int rc; |
int rc; |
struct berval newdn; |
struct berval newdn; |
int freefdn = 0; |
int freefdn = 0; |
|
BackendDB *b0 = op->o_bd, db; |
|
|
fc.fdn = &op->o_req_ndn; |
fc.fdn = &op->o_req_ndn; |
/* compute new DN */ |
/* compute new DN */ |
Line 1067 syncprov_matchops( Operation *op, opcook
|
Line 1115 syncprov_matchops( Operation *op, opcook
|
freefdn = 1; |
freefdn = 1; |
} |
} |
if ( op->o_tag != LDAP_REQ_ADD ) { |
if ( op->o_tag != LDAP_REQ_ADD ) { |
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
if ( !SLAP_ISOVERLAY( op->o_bd )) { |
rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e ); |
db = *op->o_bd; |
|
op->o_bd = &db; |
|
} |
|
rc = overlay_entry_get_ov( op, fc.fdn, NULL, NULL, 0, &e, on ); |
/* If we're sending responses now, make a copy and unlock the DB */ |
/* If we're sending responses now, make a copy and unlock the DB */ |
if ( e && !saveit ) { |
if ( e && !saveit ) { |
Entry *e2 = entry_dup( e ); |
Entry *e2 = entry_dup( e ); |
be_entry_release_rw( op, e, 0 ); |
overlay_entry_release_ov( op, e, 0, on ); |
e = e2; |
e = e2; |
} |
} |
op->o_bd->bd_info = (BackendInfo *)on; |
if ( rc ) { |
if ( rc ) return; |
op->o_bd = b0; |
|
return; |
|
} |
} else { |
} else { |
e = op->ora_e; |
e = op->ora_e; |
} |
} |
Line 1167 syncprov_matchops( Operation *op, opcook
|
Line 1220 syncprov_matchops( Operation *op, opcook
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
|
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; |
if ( !SLAP_ISOVERLAY( op->o_bd )) { |
be_entry_release_rw( op, e, 0 ); |
op->o_bd = &db; |
op->o_bd->bd_info = (BackendInfo *)on; |
} |
|
overlay_entry_release_ov( op, e, 0, on ); |
|
op->o_bd = b0; |
} |
} |
if ( freefdn ) { |
if ( freefdn ) { |
op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx ); |
op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx ); |
} |
} |
|
op->o_bd = b0; |
} |
} |
|
|
static int |
static int |
Line 1228 syncprov_op_cleanup( Operation *op, Slap
|
Line 1284 syncprov_op_cleanup( Operation *op, Slap
|
static void |
static void |
syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on ) |
syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on ) |
{ |
{ |
syncprov_info_t *si = on->on_bi.bi_private; |
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
Modifications mod; |
Modifications mod; |
Operation opm; |
Operation opm; |
SlapReply rsm = { 0 }; |
SlapReply rsm = { 0 }; |
struct berval bv[2]; |
|
slap_callback cb = {0}; |
slap_callback cb = {0}; |
|
|
mod.sml_values = bv; |
mod.sml_values = si->si_ctxcsn; |
bv[1].bv_val = NULL; |
|
bv[0] = si->si_ctxcsn; |
|
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; |
Line 1249 syncprov_checkpoint( Operation *op, Slap
|
Line 1302 syncprov_checkpoint( Operation *op, Slap
|
opm.o_tag = LDAP_REQ_MODIFY; |
opm.o_tag = LDAP_REQ_MODIFY; |
opm.o_callback = &cb; |
opm.o_callback = &cb; |
opm.orm_modlist = &mod; |
opm.orm_modlist = &mod; |
|
opm.orm_no_opattrs = 1; |
opm.o_req_dn = op->o_bd->be_suffix[0]; |
opm.o_req_dn = op->o_bd->be_suffix[0]; |
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, &rsm ); |
opm.o_bd->be_modify( &opm, &rsm ); |
SLAP_DBFLAGS( opm.o_bd ) ^= SLAP_DBFLAG_NOLASTMOD; |
|
if ( mod.sml_next != NULL ) { |
if ( mod.sml_next != NULL ) { |
slap_mods_free( mod.sml_next, 1 ); |
slap_mods_free( mod.sml_next, 1 ); |
} |
} |
} |
} |
|
|
static void |
static void |
syncprov_add_slog( Operation *op, struct berval *csn ) |
syncprov_add_slog( Operation *op ) |
{ |
{ |
opcookie *opc = op->o_callback->sc_private; |
opcookie *opc = op->o_callback->sc_private; |
slap_overinst *on = opc->son; |
slap_overinst *on = opc->son; |
Line 1274 syncprov_add_slog( Operation *op, struct
|
Line 1326 syncprov_add_slog( Operation *op, struct
|
{ |
{ |
/* Allocate a record. UUIDs are not NUL-terminated. */ |
/* Allocate a record. UUIDs are not NUL-terminated. */ |
se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len + |
se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len + |
csn->bv_len + 1 ); |
op->o_csn.bv_len + 1 ); |
se->se_next = NULL; |
se->se_next = NULL; |
se->se_tag = op->o_tag; |
se->se_tag = op->o_tag; |
|
|
Line 1283 syncprov_add_slog( Operation *op, struct
|
Line 1335 syncprov_add_slog( Operation *op, struct
|
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; |
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, op->o_csn.bv_val, op->o_csn.bv_len ); |
se->se_csn.bv_val[csn->bv_len] = '\0'; |
se->se_csn.bv_val[op->o_csn.bv_len] = '\0'; |
se->se_csn.bv_len = csn->bv_len; |
se->se_csn.bv_len = op->o_csn.bv_len; |
|
se->se_sid = slap_parse_csn_sid( &se->se_csn ); |
|
|
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
if ( sl->sl_head ) { |
if ( sl->sl_head ) { |
Line 1320 playlog_cb( Operation *op, SlapReply *rs
|
Line 1373 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, |
struct berval *oldcsn, struct berval *ctxcsn ) |
sync_control *srs, BerVarray ctxcsn, int numcsns, int *sids ) |
{ |
{ |
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
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[2]; |
|
|
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 1338 syncprov_playlog( Operation *op, SlapRep
|
Line 1393 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); |
uuids[0].bv_val = (char *)(uuids + num + 1); |
|
|
|
delcsn[0].bv_len = 0; |
|
delcsn[0].bv_val = cbuf; |
|
BER_BVZERO(&delcsn[1]); |
|
|
/* 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. |
*/ |
*/ |
|
Debug( LDAP_DEBUG_SYNC, "srs csn %s\n", |
|
srs->sr_state.ctxcsn[0].bv_val, 0, 0 ); |
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, oldcsn ) <= 0 ) continue; |
int k; |
if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break; |
Debug( LDAP_DEBUG_SYNC, "log csn %s\n", se->se_csn.bv_val, 0, 0 ); |
|
ndel = 1; |
|
for ( k=0; k<srs->sr_state.numcsns; k++ ) { |
|
if ( se->se_sid == srs->sr_state.sids[k] ) { |
|
ndel = ber_bvcmp( &se->se_csn, &srs->sr_state.ctxcsn[k] ); |
|
break; |
|
} |
|
} |
|
if ( ndel <= 0 ) { |
|
Debug( LDAP_DEBUG_SYNC, "cmp %d, too old\n", ndel, 0, 0 ); |
|
continue; |
|
} |
|
ndel = 0; |
|
for ( k=0; k<numcsns; k++ ) { |
|
if ( se->se_sid == sids[k] ) { |
|
ndel = ber_bvcmp( &se->se_csn, &ctxcsn[k] ); |
|
break; |
|
} |
|
} |
|
if ( ndel > 0 ) { |
|
Debug( LDAP_DEBUG_SYNC, "cmp %d, too new\n", ndel, 0, 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[0].bv_len = se->se_csn.bv_len; |
|
delcsn[0].bv_val[delcsn[0].bv_len] = '\0'; |
} else { |
} else { |
nmods++; |
nmods++; |
j = num - nmods; |
j = num - nmods; |
Line 1442 syncprov_playlog( Operation *op, SlapRep
|
Line 1527 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, |
|
srs->sr_state.sid ); |
uuids[ndel].bv_val = NULL; |
uuids[ndel].bv_val = NULL; |
syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 ); |
syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, &cookie, 0, uuids, 1 ); |
|
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
} |
} |
|
op->o_tmpfree( uuids, op->o_tmpmemctx ); |
} |
} |
|
|
static int |
static int |
Line 1457 syncprov_op_response( Operation *op, Sla
|
Line 1548 syncprov_op_response( Operation *op, Sla
|
|
|
if ( rs->sr_err == LDAP_SUCCESS ) |
if ( rs->sr_err == LDAP_SUCCESS ) |
{ |
{ |
struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL; |
struct berval maxcsn = BER_BVNULL; |
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
|
int do_check = 0; |
|
|
/* Update our context CSN */ |
/* Update our context CSN */ |
cbuf[0] = '\0'; |
cbuf[0] = '\0'; |
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_wlock( &si->si_csn_rwlock ); |
slap_get_commit_csn( op, &maxcsn, &curcsn ); |
slap_get_commit_csn( op, &maxcsn ); |
if ( !BER_BVISNULL( &maxcsn ) ) { |
if ( !BER_BVISNULL( &maxcsn ) ) { |
|
int i, sid; |
strcpy( cbuf, maxcsn.bv_val ); |
strcpy( cbuf, maxcsn.bv_val ); |
if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) { |
sid = slap_parse_csn_sid( &maxcsn ); |
strcpy( si->si_ctxcsnbuf, cbuf ); |
for ( i=0; i<si->si_numcsns; i++ ) { |
si->si_ctxcsn.bv_len = maxcsn.bv_len; |
if ( sid == si->si_sids[i] ) { |
|
if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn[i] ) > 0 ) { |
|
ber_bvreplace( &si->si_ctxcsn[i], &maxcsn ); |
|
} |
|
break; |
|
} |
|
} |
|
/* It's a new SID for us */ |
|
if ( i == si->si_numcsns ) { |
|
value_add_one( &si->si_ctxcsn, &maxcsn ); |
|
si->si_numcsns++; |
|
si->si_sids = ch_realloc( si->si_sids, si->si_numcsns * |
|
sizeof(int)); |
|
si->si_sids[i] = sid; |
} |
} |
} |
} |
|
|
/* Don't do any processing for consumer contextCSN updates */ |
/* Don't do any processing for consumer contextCSN updates */ |
if ( SLAP_SYNC_SHADOW( op->o_bd ) && |
if ( SLAP_SYNC_SHADOW( op->o_bd ) && |
op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) { |
op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) { |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock ); |
return SLAP_CB_CONTINUE; |
return SLAP_CB_CONTINUE; |
} |
} |
|
|
si->si_numops++; |
si->si_numops++; |
if ( si->si_chkops || si->si_chktime ) { |
if ( si->si_chkops || si->si_chktime ) { |
int do_check=0; |
|
if ( si->si_chkops && si->si_numops >= si->si_chkops ) { |
if ( si->si_chkops && si->si_numops >= si->si_chkops ) { |
do_check = 1; |
do_check = 1; |
si->si_numops = 0; |
si->si_numops = 0; |
Line 1491 syncprov_op_response( Operation *op, Sla
|
Line 1596 syncprov_op_response( Operation *op, Sla
|
do_check = 1; |
do_check = 1; |
si->si_chklast = op->o_time; |
si->si_chklast = op->o_time; |
} |
} |
if ( do_check ) { |
|
syncprov_checkpoint( op, rs, on ); |
|
} |
|
} |
} |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock ); |
|
|
|
if ( do_check ) { |
|
ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock ); |
|
syncprov_checkpoint( op, rs, on ); |
|
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
|
} |
|
|
opc->sctxcsn.bv_len = maxcsn.bv_len; |
opc->sctxcsn.bv_len = maxcsn.bv_len; |
opc->sctxcsn.bv_val = cbuf; |
opc->sctxcsn.bv_val = cbuf; |
Line 1524 syncprov_op_response( Operation *op, Sla
|
Line 1632 syncprov_op_response( Operation *op, Sla
|
|
|
/* Add any log records */ |
/* Add any log records */ |
if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) { |
if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) { |
syncprov_add_slog( op, &curcsn ); |
syncprov_add_slog( op ); |
} |
} |
|
|
} |
} |
Line 1547 syncprov_op_compare( Operation *op, Slap
|
Line 1655 syncprov_op_compare( Operation *op, Slap
|
{ |
{ |
Entry e = {0}; |
Entry e = {0}; |
Attribute a = {0}; |
Attribute a = {0}; |
struct berval bv[2]; |
|
|
|
e.e_name = op->o_bd->be_suffix[0]; |
e.e_name = op->o_bd->be_suffix[0]; |
e.e_nname = op->o_bd->be_nsuffix[0]; |
e.e_nname = op->o_bd->be_nsuffix[0]; |
|
e.e_attrs = &a; |
BER_BVZERO( &bv[1] ); |
|
bv[0] = si->si_ctxcsn; |
|
|
|
a.a_desc = slap_schema.si_ad_contextCSN; |
a.a_desc = slap_schema.si_ad_contextCSN; |
a.a_vals = bv; |
|
a.a_nvals = a.a_vals; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock ); |
|
|
|
a.a_vals = si->si_ctxcsn; |
|
a.a_nvals = a.a_vals; |
|
|
rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc, |
rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc, |
&op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL ); |
&op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL ); |
Line 1588 syncprov_op_compare( Operation *op, Slap
|
Line 1694 syncprov_op_compare( Operation *op, Slap
|
|
|
return_results:; |
return_results:; |
|
|
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
|
|
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
|
|
Line 1687 syncprov_op_extended( Operation *op, Sla
|
Line 1793 syncprov_op_extended( Operation *op, Sla
|
typedef struct searchstate { |
typedef struct searchstate { |
slap_overinst *ss_on; |
slap_overinst *ss_on; |
syncops *ss_so; |
syncops *ss_so; |
|
BerVarray ss_ctxcsn; |
|
int *ss_sids; |
|
int ss_numcsns; |
int ss_present; |
int ss_present; |
struct berval ss_ctxcsn; |
|
char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
|
} searchstate; |
} searchstate; |
|
|
static int |
static int |
Line 1759 syncprov_detach_op( Operation *op, synco
|
Line 1866 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 ); |
|
|
/* Skip the AND/GE clause that we stuck on in front */ |
|
if ( so->s_flags & PS_FIX_FILTER ) { |
|
op2->ors_filter = op->ors_filter->f_and->f_next; |
|
so->s_flags ^= PS_FIX_FILTER; |
|
} else { |
|
op2->ors_filter = op->ors_filter; |
|
} |
|
op2->ors_filter = filter_dup( op2->ors_filter, NULL ); |
so->s_op = op2; |
so->s_op = op2; |
|
|
/* Copy any cached group ACLs individually */ |
/* Copy any cached group ACLs individually */ |
Line 1810 syncprov_search_response( Operation *op,
|
Line 1925 syncprov_search_response( Operation *op,
|
a = attr_find( rs->sr_operational_attrs, slap_schema.si_ad_entryCSN ); |
a = attr_find( rs->sr_operational_attrs, slap_schema.si_ad_entryCSN ); |
} |
} |
if ( a ) { |
if ( a ) { |
/* Make sure entry is less than the snapshot'd contextCSN */ |
int i, sid; |
if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 ) { |
sid = slap_parse_csn_sid( &a->a_nvals[0] ); |
Debug( LDAP_DEBUG_SYNC, "Entry %s CSN %s greater than snapshot %s\n", |
|
rs->sr_entry->e_name.bv_val, |
/* Don't send changed entries back to the originator */ |
a->a_nvals[0].bv_val, |
if ( sid == srs->sr_state.sid && srs->sr_state.numcsns ) { |
ss->ss_ctxcsn.bv_val ); |
Debug( LDAP_DEBUG_SYNC, |
|
"Entry %s changed by peer, ignored\n", |
|
rs->sr_entry->e_name.bv_val, 0, 0 ); |
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
|
/* Make sure entry is less than the snapshot'd contextCSN */ |
|
for ( i=0; i<ss->ss_numcsns; i++ ) { |
|
if ( sid == ss->ss_sids[i] && ber_bvcmp( &a->a_nvals[0], |
|
&ss->ss_ctxcsn[i] ) > 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[i].bv_val ); |
|
return LDAP_SUCCESS; |
|
} |
|
} |
|
|
/* Don't send the ctx entry twice */ |
/* Don't send old entries twice */ |
if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) && |
if ( srs->sr_state.ctxcsn ) { |
bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) ) { |
for ( i=0; i<srs->sr_state.numcsns; i++ ) { |
Debug( LDAP_DEBUG_SYNC, "Entry %s CSN %s matches ctx %s\n", |
if ( sid == srs->sr_state.sids[i] && |
rs->sr_entry->e_name.bv_val, |
ber_bvcmp( &a->a_nvals[0], |
a->a_nvals[0].bv_val, |
&srs->sr_state.ctxcsn[i] )<= 0 ) { |
srs->sr_state.ctxcsn.bv_val ); |
Debug( LDAP_DEBUG_SYNC, |
return LDAP_SUCCESS; |
"Entry %s CSN %s older or equal to ctx %s\n", |
|
rs->sr_entry->e_name.bv_val, |
|
a->a_nvals[0].bv_val, |
|
srs->sr_state.ctxcsn[i].bv_val ); |
|
return LDAP_SUCCESS; |
|
} |
|
} |
} |
} |
} |
} |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
Line 1837 syncprov_search_response( Operation *op,
|
Line 1972 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, ss->ss_ctxcsn, |
srs->sr_state.rid ); |
srs->sr_state.rid, srs->sr_state.sid ); |
|
|
/* Is this a regular refresh? */ |
/* Is this a regular refresh? */ |
if ( !ss->ss_so ) { |
if ( !ss->ss_so ) { |
Line 1851 syncprov_search_response( Operation *op,
|
Line 1986 syncprov_search_response( Operation *op,
|
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
} else { |
} else { |
/* 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 ? |
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 ); |
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
Line 1863 syncprov_search_response( Operation *op,
|
Line 1998 syncprov_search_response( Operation *op,
|
ss->ss_so->s_flags ^= PS_IS_REFRESHING; |
ss->ss_so->s_flags ^= PS_IS_REFRESHING; |
|
|
syncprov_detach_op( op, ss->ss_so, on ); |
syncprov_detach_op( op, ss->ss_so, on ); |
|
|
|
/* If there are queued responses, fire them off */ |
|
if ( ss->ss_so->s_res ) |
|
syncprov_qstart( ss->ss_so ); |
ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex ); |
ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex ); |
|
|
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
Line 1882 syncprov_op_search( Operation *op, SlapR
|
Line 2021 syncprov_op_search( Operation *op, SlapR
|
syncops *sop = NULL; |
syncops *sop = NULL; |
searchstate *ss; |
searchstate *ss; |
sync_control *srs; |
sync_control *srs; |
struct berval ctxcsn; |
BerVarray ctxcsn; |
char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
int i, *sids, numcsns; |
|
struct berval mincsn; |
|
|
if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE; |
if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE; |
|
|
Line 1927 syncprov_op_search( Operation *op, SlapR
|
Line 2067 syncprov_op_search( Operation *op, SlapR
|
*sop = so; |
*sop = so; |
ldap_pvt_thread_mutex_init( &sop->s_mutex ); |
ldap_pvt_thread_mutex_init( &sop->s_mutex ); |
sop->s_rid = srs->sr_state.rid; |
sop->s_rid = srs->sr_state.rid; |
|
sop->s_sid = srs->sr_state.sid; |
sop->s_inuse = 1; |
sop->s_inuse = 1; |
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
Line 1936 syncprov_op_search( Operation *op, SlapR
|
Line 2077 syncprov_op_search( Operation *op, SlapR
|
} |
} |
|
|
/* snapshot the ctxcsn */ |
/* snapshot the ctxcsn */ |
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock ); |
strcpy( csnbuf, si->si_ctxcsnbuf ); |
numcsns = si->si_numcsns; |
ctxcsn.bv_len = si->si_ctxcsn.bv_len; |
if ( numcsns ) { |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
ber_bvarray_dup_x( &ctxcsn, si->si_ctxcsn, op->o_tmpmemctx ); |
ctxcsn.bv_val = csnbuf; |
sids = op->o_tmpalloc( numcsns * sizeof(int), op->o_tmpmemctx ); |
|
for ( i=0; i<numcsns; i++ ) |
|
sids[i] = si->si_sids[i]; |
|
} else { |
|
ctxcsn = NULL; |
|
sids = NULL; |
|
} |
|
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
|
|
/* If we have a cookie, handle the PRESENT lookups */ |
/* If we have a cookie, handle the PRESENT lookups */ |
if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) { |
if ( srs->sr_state.ctxcsn ) { |
sessionlog *sl; |
sessionlog *sl; |
|
int i, j; |
|
|
/* The cookie was validated when it was parsed, just use it */ |
/* If we don't have any CSN of our own yet, pretend nothing |
|
* has changed. |
|
*/ |
|
if ( !numcsns ) |
|
goto no_change; |
|
|
/* If just Refreshing and nothing has changed, shortcut it */ |
/* If there are SIDs we don't recognize in the cookie, drop them */ |
if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) { |
for (i=0; i<srs->sr_state.numcsns; ) { |
nochange = 1; |
for (j=0; j<numcsns; j++) { |
if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) { |
if ( srs->sr_state.sids[i] == sids[j] ) { |
LDAPControl *ctrls[2]; |
break; |
|
} |
ctrls[0] = NULL; |
} |
ctrls[1] = NULL; |
/* not found */ |
syncprov_done_ctrl( op, rs, ctrls, 0, 0, |
if ( j == numcsns ) { |
NULL, LDAP_SYNC_REFRESH_DELETES ); |
struct berval tmp = srs->sr_state.ctxcsn[i]; |
rs->sr_ctrls = ctrls; |
j = srs->sr_state.numcsns - 1; |
rs->sr_err = LDAP_SUCCESS; |
srs->sr_state.ctxcsn[i] = srs->sr_state.ctxcsn[j]; |
send_ldap_result( op, rs ); |
tmp.bv_len = 0; |
rs->sr_ctrls = NULL; |
srs->sr_state.ctxcsn[j] = tmp; |
return rs->sr_err; |
srs->sr_state.numcsns = j; |
|
srs->sr_state.sids[i] = srs->sr_state.sids[j]; |
|
continue; |
|
} |
|
i++; |
|
} |
|
|
|
/* Find the smallest CSN */ |
|
mincsn = srs->sr_state.ctxcsn[0]; |
|
for ( i=1; i<srs->sr_state.numcsns; i++ ) { |
|
if ( ber_bvcmp( &mincsn, &srs->sr_state.ctxcsn[i] ) > 0 ) |
|
mincsn = srs->sr_state.ctxcsn[i]; |
|
} |
|
|
|
/* If nothing has changed, shortcut it */ |
|
if ( srs->sr_state.numcsns == numcsns ) { |
|
int i, j, changed = 0; |
|
for ( i=0; i<srs->sr_state.numcsns; i++ ) { |
|
for ( j=0; j<numcsns; j++ ) { |
|
if ( srs->sr_state.sids[i] != sids[j] ) |
|
continue; |
|
if ( !bvmatch( &srs->sr_state.ctxcsn[i], &ctxcsn[j] )) |
|
changed = 1; |
|
break; |
|
} |
|
if ( changed ) |
|
break; |
|
} |
|
if ( !changed ) { |
|
no_change: nochange = 1; |
|
if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) { |
|
LDAPControl *ctrls[2]; |
|
|
|
ctrls[0] = NULL; |
|
ctrls[1] = NULL; |
|
syncprov_done_ctrl( op, rs, ctrls, 0, 0, |
|
NULL, LDAP_SYNC_REFRESH_DELETES ); |
|
rs->sr_ctrls = ctrls; |
|
rs->sr_err = LDAP_SUCCESS; |
|
send_ldap_result( op, rs ); |
|
rs->sr_ctrls = NULL; |
|
return rs->sr_err; |
|
} |
|
goto shortcut; |
} |
} |
goto shortcut; |
|
} |
} |
/* Do we have a sessionlog for this search? */ |
/* Do we have a sessionlog for this search? */ |
sl=si->si_logs; |
sl=si->si_logs; |
if ( sl ) { |
if ( sl ) { |
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) { |
/* Are there any log entries, and is the consumer state |
|
* present in the session log? |
|
*/ |
|
if ( sl->sl_num > 0 && ber_bvcmp( &mincsn, &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->sr_state.ctxcsn, &ctxcsn ); |
syncprov_playlog( op, rs, sl, srs, ctxcsn, numcsns, sids ); |
} else { |
} else { |
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
} |
} |
Line 1983 syncprov_op_search( Operation *op, SlapR
|
Line 2181 syncprov_op_search( Operation *op, SlapR
|
/* No, so a reload is required */ |
/* No, so a reload is required */ |
/* the 2.2 consumer doesn't send this hint */ |
/* the 2.2 consumer doesn't send this hint */ |
if ( si->si_usehint && srs->sr_rhint == 0 ) { |
if ( si->si_usehint && srs->sr_rhint == 0 ) { |
|
if ( ctxcsn ) |
|
ber_bvarray_free_x( ctxcsn, op->o_tmpmemctx ); |
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; |
} |
} |
Line 1991 syncprov_op_search( Operation *op, SlapR
|
Line 2191 syncprov_op_search( Operation *op, SlapR
|
/* If changed and doing Present lookup, send Present UUIDs */ |
/* If changed and doing Present lookup, send Present UUIDs */ |
if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) != |
if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) != |
LDAP_SUCCESS ) { |
LDAP_SUCCESS ) { |
|
if ( ctxcsn ) |
|
ber_bvarray_free_x( ctxcsn, op->o_tmpmemctx ); |
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
return rs->sr_err; |
return rs->sr_err; |
} |
} |
Line 2020 shortcut:
|
Line 2222 shortcut:
|
#ifdef LDAP_COMP_MATCH |
#ifdef LDAP_COMP_MATCH |
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, &mincsn, op->o_tmpmemctx ); |
fava->f_next = op->ors_filter; |
fava->f_next = op->ors_filter; |
op->ors_filter = fand; |
op->ors_filter = fand; |
filter2bv_x( op, op->ors_filter, &op->ors_filterstr ); |
filter2bv_x( op, op->ors_filter, &op->ors_filterstr ); |
|
if ( sop ) |
|
sop->s_flags |= PS_FIX_FILTER; |
} |
} |
|
|
/* Let our callback add needed info to returned entries */ |
/* Let our callback add needed info to returned entries */ |
Line 2032 shortcut:
|
Line 2236 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 = ctxcsn; |
ss->ss_ctxcsn.bv_val = ss->ss_csnbuf; |
ss->ss_numcsns = numcsns; |
strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val ); |
ss->ss_sids = sids; |
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; |
cb->sc_next = op->o_callback; |
cb->sc_next = op->o_callback; |
op->o_callback = cb; |
op->o_callback = cb; |
|
|
#if 0 /* I don't think we need to shortcircuit back-bdb any more */ |
|
op->o_sync_mode &= SLAP_CONTROL_MASK; |
|
#endif |
|
|
|
/* If this is a persistent search and no changes were reported during |
/* If this is a persistent search and no changes were reported during |
* the refresh phase, just invoke the response callback to transition |
* the refresh phase, just invoke the response callback to transition |
* us into persist phase |
* us into persist phase |
Line 2078 syncprov_operational(
|
Line 2278 syncprov_operational(
|
break; |
break; |
} |
} |
|
|
if ( !a ) { |
ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock ); |
for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next ); |
if ( si->si_ctxcsn ) { |
|
if ( !a ) { |
|
for ( ap = &rs->sr_operational_attrs; *ap; |
|
ap=&(*ap)->a_next ); |
|
|
a = ch_malloc( sizeof(Attribute)); |
a = attr_alloc( slap_schema.si_ad_contextCSN ); |
a->a_desc = slap_schema.si_ad_contextCSN; |
*ap = a; |
a->a_vals = ch_malloc( 2 * sizeof(struct berval)); |
} |
a->a_vals[1].bv_val = NULL; |
|
a->a_nvals = a->a_vals; |
|
a->a_next = NULL; |
|
a->a_flags = 0; |
|
*ap = a; |
|
} |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
if ( !ap ) { |
if ( !ap ) { |
if ( !rs->sr_flags & REP_ENTRY_MODIFIABLE ) { |
strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf ); |
rs->sr_entry = entry_dup( rs->sr_entry ); |
} else { |
rs->sr_flags |= |
ber_dupbv( &a->a_vals[0], &si->si_ctxcsn ); |
REP_ENTRY_MODIFIABLE|REP_ENTRY_MUSTBEFREED; |
|
a = attr_find( rs->sr_entry->e_attrs, |
|
slap_schema.si_ad_contextCSN ); |
|
} |
|
free( a->a_vals ); |
|
} |
|
ber_bvarray_dup_x( &a->a_vals, si->si_ctxcsn, NULL ); |
|
a->a_nvals = a->a_vals; |
} |
} |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
} |
} |
} |
} |
return SLAP_CB_CONTINUE; |
return SLAP_CB_CONTINUE; |
Line 2215 sp_cf_gen(ConfigArgs *c)
|
Line 2419 sp_cf_gen(ConfigArgs *c)
|
switch ( c->type ) { |
switch ( c->type ) { |
case SP_CHKPT: |
case SP_CHKPT: |
if ( lutil_atoi( &si->si_chkops, c->argv[1] ) != 0 ) { |
if ( lutil_atoi( &si->si_chkops, c->argv[1] ) != 0 ) { |
sprintf( c->msg, "%s unable to parse checkpoint ops # \"%s\"", |
snprintf( c->msg, sizeof( c->msg ), "%s unable to parse checkpoint ops # \"%s\"", |
c->argv[0], c->argv[1] ); |
c->argv[0], c->argv[1] ); |
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 ); |
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->msg, 0 ); |
return ARG_BAD_CONF; |
return ARG_BAD_CONF; |
} |
} |
if ( si->si_chkops <= 0 ) { |
if ( si->si_chkops <= 0 ) { |
sprintf( c->msg, "%s invalid checkpoint ops # \"%d\"", |
snprintf( c->msg, sizeof( c->msg ), "%s invalid checkpoint ops # \"%d\"", |
c->argv[0], si->si_chkops ); |
c->argv[0], si->si_chkops ); |
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 ); |
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->msg, 0 ); |
return ARG_BAD_CONF; |
return ARG_BAD_CONF; |
} |
} |
if ( lutil_atoi( &si->si_chktime, c->argv[2] ) != 0 ) { |
if ( lutil_atoi( &si->si_chktime, c->argv[2] ) != 0 ) { |
sprintf( c->msg, "%s unable to parse checkpoint time \"%s\"", |
snprintf( c->msg, sizeof( c->msg ), "%s unable to parse checkpoint time \"%s\"", |
c->argv[0], c->argv[1] ); |
c->argv[0], c->argv[1] ); |
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 ); |
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->msg, 0 ); |
return ARG_BAD_CONF; |
return ARG_BAD_CONF; |
} |
} |
if ( si->si_chktime <= 0 ) { |
if ( si->si_chktime <= 0 ) { |
sprintf( c->msg, "%s invalid checkpoint time \"%d\"", |
snprintf( c->msg, sizeof( c->msg ), "%s invalid checkpoint time \"%d\"", |
c->argv[0], si->si_chkops ); |
c->argv[0], si->si_chkops ); |
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 ); |
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->msg, 0 ); |
return ARG_BAD_CONF; |
return ARG_BAD_CONF; |
} |
} |
si->si_chktime *= 60; |
si->si_chktime *= 60; |
Line 2245 sp_cf_gen(ConfigArgs *c)
|
Line 2453 sp_cf_gen(ConfigArgs *c)
|
int size = c->value_int; |
int size = c->value_int; |
|
|
if ( size < 0 ) { |
if ( size < 0 ) { |
sprintf( c->msg, "%s size %d is negative", |
snprintf( c->msg, sizeof( c->msg ), "%s size %d is negative", |
c->argv[0], size ); |
c->argv[0], size ); |
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 ); |
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->msg, 0 ); |
return ARG_BAD_CONF; |
return ARG_BAD_CONF; |
} |
} |
sl = si->si_logs; |
sl = si->si_logs; |
Line 2299 syncprov_db_open(
|
Line 2508 syncprov_db_open(
|
|
|
Connection conn = { 0 }; |
Connection conn = { 0 }; |
OperationBuffer opbuf = { 0 }; |
OperationBuffer opbuf = { 0 }; |
char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
|
Operation *op = (Operation *) &opbuf; |
Operation *op = (Operation *) &opbuf; |
Entry *e; |
Entry *e = NULL; |
Attribute *a; |
Attribute *a; |
int rc; |
int rc; |
void *thrctx = NULL; |
void *thrctx = NULL; |
|
|
|
if ( !SLAP_LASTMOD( be )) { |
|
Debug( LDAP_DEBUG_ANY, |
|
"syncprov_db_open: invalid config, lastmod must be enabled\n", 0, 0, 0 ); |
|
return -1; |
|
} |
|
|
if ( slapMode & SLAP_TOOL_MODE ) { |
if ( slapMode & SLAP_TOOL_MODE ) { |
return 0; |
return 0; |
} |
} |
Line 2321 syncprov_db_open(
|
Line 2535 syncprov_db_open(
|
op->o_dn = be->be_rootdn; |
op->o_dn = be->be_rootdn; |
op->o_ndn = be->be_rootndn; |
op->o_ndn = be->be_rootndn; |
|
|
ctxcsnbuf[0] = '\0'; |
rc = overlay_entry_get_ov( op, be->be_nsuffix, NULL, |
|
slap_schema.si_ad_contextCSN, 0, &e, on ); |
op->o_bd->bd_info = on->on_info->oi_orig; |
|
rc = be_entry_get_rw( op, be->be_nsuffix, NULL, |
|
slap_schema.si_ad_contextCSN, 0, &e ); |
|
|
|
if ( e ) { |
if ( e ) { |
ldap_pvt_thread_t tid; |
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; |
int i; |
if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf )) |
ber_bvarray_dup_x( &si->si_ctxcsn, a->a_vals, NULL ); |
si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1; |
for ( i = 0; !BER_BVISNULL( &a->a_vals[i] ); i++ ); |
strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val, |
si->si_numcsns = i; |
si->si_ctxcsn.bv_len ); |
si->si_sids = slap_parse_csn_sids( si->si_ctxcsn, i, NULL ); |
si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0'; |
} |
strcpy( ctxcsnbuf, si->si_ctxcsnbuf ); |
overlay_entry_release_ov( op, e, 0, on ); |
} |
if ( si->si_ctxcsn ) { |
be_entry_release_rw( op, e, 0 ); |
|
if ( !BER_BVISEMPTY( &si->si_ctxcsn ) ) { |
|
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; |
ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op ); |
ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op ); |
ldap_pvt_thread_join( tid, NULL ); |
ldap_pvt_thread_join( tid, NULL ); |
} |
} |
} else if ( SLAP_SYNC_SHADOW( op->o_bd )) { |
|
/* 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 |
|
* to us. |
|
*/ |
|
goto out; |
|
} |
} |
|
|
if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) { |
/* Didn't find a contextCSN, should we generate one? */ |
si->si_ctxcsn.bv_len = sizeof( si->si_ctxcsnbuf ); |
if ( !si->si_ctxcsn ) { |
slap_get_csn( op, &si->si_ctxcsn, 0 ); |
char csnbuf[ LDAP_LUTIL_CSNSTR_BUFSIZE ]; |
} |
struct berval csn; |
|
|
|
if ( SLAP_SYNC_SHADOW( op->o_bd )) { |
|
/* If we're also a consumer, then don't generate anything. |
|
* Wait for our provider to send it to us, or for a local |
|
* modify if we have multimaster. |
|
*/ |
|
goto out; |
|
} |
|
csn.bv_val = csnbuf; |
|
csn.bv_len = sizeof( csnbuf ); |
|
slap_get_csn( op, &csn, 0 ); |
|
value_add_one( &si->si_ctxcsn, &csn ); |
|
si->si_numcsns = 1; |
|
si->si_sids = ch_malloc( sizeof(int) ); |
|
si->si_sids[0] = slap_serverID; |
|
|
/* If our ctxcsn is different from what was read from the root |
/* make sure we do a checkpoint on close */ |
* entry, make sure we do a checkpoint on close |
|
*/ |
|
if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) { |
|
si->si_numops++; |
si->si_numops++; |
} |
} |
|
|
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 2401 syncprov_db_close(
|
Line 2614 syncprov_db_close(
|
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 ); |
|
} |
} |
|
|
return 0; |
return 0; |
Line 2415 syncprov_db_init(
|
Line 2627 syncprov_db_init(
|
slap_overinst *on = (slap_overinst *)be->bd_info; |
slap_overinst *on = (slap_overinst *)be->bd_info; |
syncprov_info_t *si; |
syncprov_info_t *si; |
|
|
|
if ( SLAP_ISGLOBALOVERLAY( be ) ) { |
|
Debug( LDAP_DEBUG_ANY, |
|
"syncprov must be instantiated within a database.\n", |
|
0, 0, 0 ); |
|
return 1; |
|
} |
|
|
si = ch_calloc(1, sizeof(syncprov_info_t)); |
si = ch_calloc(1, sizeof(syncprov_info_t)); |
on->on_bi.bi_private = si; |
on->on_bi.bi_private = si; |
ldap_pvt_thread_mutex_init( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_init( &si->si_csn_rwlock ); |
ldap_pvt_thread_mutex_init( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_init( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_init( &si->si_mods_mutex ); |
ldap_pvt_thread_mutex_init( &si->si_mods_mutex ); |
si->si_ctxcsn.bv_val = si->si_ctxcsnbuf; |
|
|
|
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; |
Line 2453 syncprov_db_destroy(
|
Line 2671 syncprov_db_destroy(
|
|
|
ch_free( si->si_logs ); |
ch_free( si->si_logs ); |
} |
} |
|
if ( si->si_ctxcsn ) |
|
ber_bvarray_free( si->si_ctxcsn ); |
|
if ( si->si_sids ) |
|
ch_free( si->si_sids ); |
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_rdwr_destroy( &si->si_csn_rwlock ); |
ch_free( si ); |
ch_free( si ); |
} |
} |
|
|