version 1.23, 2004/11/27 06:47:24
|
version 1.115, 2005/10/06 16:45:53
|
Line 1
|
Line 1
|
|
/* $OpenLDAP: pkg/ldap/servers/slapd/overlays/syncprov.c,v 1.114 2005/10/04 00:29:25 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 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 24
|
Line 25
|
#include <ac/string.h> |
#include <ac/string.h> |
#include "lutil.h" |
#include "lutil.h" |
#include "slap.h" |
#include "slap.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 55 typedef struct syncops {
|
Line 58 typedef struct syncops {
|
struct berval s_base; /* ndn of search base */ |
struct berval s_base; /* ndn of search base */ |
ID s_eid; /* entryID of search base */ |
ID s_eid; /* entryID of search base */ |
Operation *s_op; /* search op */ |
Operation *s_op; /* search op */ |
long s_sid; |
int s_rid; |
long 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; |
|
|
static int sync_cid; |
|
|
|
/* A received sync control */ |
/* A received sync control */ |
typedef struct sync_control { |
typedef struct sync_control { |
struct sync_cookie sr_state; |
struct sync_cookie sr_state; |
int sr_rhint; |
int sr_rhint; |
} sync_control; |
} sync_control; |
|
|
|
#if 0 /* moved back to slap.h */ |
|
#define o_sync o_ctrlflag[slap_cids.sc_LDAPsync] |
|
#endif |
/* o_sync_mode uses data bits of o_sync */ |
/* o_sync_mode uses data bits of o_sync */ |
#define o_sync o_ctrlflag[sync_cid] |
#define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync] |
#define o_sync_mode o_ctrlflag[sync_cid] |
|
|
|
#define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT) |
#define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT) |
#define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT) |
#define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT) |
#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 |
|
|
|
/* 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; |
syncops *sm_op; |
syncops *sm_op; |
} syncmatches; |
} syncmatches; |
|
|
|
/* Session log data */ |
|
typedef struct slog_entry { |
|
struct slog_entry *se_next; |
|
struct berval se_uuid; |
|
struct berval se_csn; |
|
ber_tag_t se_tag; |
|
} slog_entry; |
|
|
|
typedef struct sessionlog { |
|
struct berval sl_mincsn; |
|
int sl_num; |
|
int sl_size; |
|
slog_entry *sl_head; |
|
slog_entry *sl_tail; |
|
ldap_pvt_thread_mutex_t sl_mutex; |
|
} 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 */ |
struct berval si_ctxcsn; /* ldapsync context */ |
int si_gotcsn; /* is our ctxcsn up to date? */ |
int si_chkops; /* checkpointing info */ |
|
int si_chktime; |
|
int si_numops; /* number of ops since last checkpoint */ |
|
int si_nopres; /* Skip present phase */ |
|
time_t si_chklast; /* time of last checkpoint */ |
Avlnode *si_mods; /* entries being modified */ |
Avlnode *si_mods; /* entries being modified */ |
|
sessionlog *si_logs; |
ldap_pvt_thread_mutex_t si_csn_mutex; |
ldap_pvt_thread_mutex_t si_csn_mutex; |
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; |
Line 119 typedef struct fbase_cookie {
|
Line 148 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[2]; |
static AttributeName csn_anlist[3]; |
static AttributeName uuid_anlist[2]; |
static AttributeName uuid_anlist[2]; |
|
|
/* Build a LDAPsync intermediate state control */ |
/* Build a LDAPsync intermediate state control */ |
Line 128 syncprov_state_ctrl(
|
Line 157 syncprov_state_ctrl(
|
Operation *op, |
Operation *op, |
SlapReply *rs, |
SlapReply *rs, |
Entry *e, |
Entry *e, |
int entry_sync_state, |
int entry_sync_state, |
LDAPControl **ctrls, |
LDAPControl **ctrls, |
int num_ctrls, |
int num_ctrls, |
int send_cookie, |
int send_cookie, |
struct berval *cookie) |
struct berval *cookie ) |
{ |
{ |
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; |
|
|
struct berval entryuuid_bv = BER_BVNULL; |
struct berval entryuuid_bv = BER_BVNULL; |
|
|
ber_init2( ber, 0, LBER_USE_DER ); |
ber_init2( ber, 0, LBER_USE_DER ); |
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx ); |
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx ); |
|
|
ctrls[num_ctrls] = slap_sl_malloc ( sizeof ( LDAPControl ), op->o_tmpmemctx ); |
ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx ); |
|
|
for ( a = e->e_attrs; a != NULL; a = a->a_next ) { |
for ( a = e->e_attrs; a != NULL; a = a->a_next ) { |
AttributeDescription *desc = a->a_desc; |
AttributeDescription *desc = a->a_desc; |
Line 157 syncprov_state_ctrl(
|
Line 184 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 200 syncprov_done_ctrl(
|
Line 229 syncprov_done_ctrl(
|
ber_init2( ber, NULL, LBER_USE_DER ); |
ber_init2( ber, NULL, LBER_USE_DER ); |
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx ); |
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx ); |
|
|
ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) ); |
ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx ); |
|
|
ber_printf( ber, "{" ); |
ber_printf( ber, "{" ); |
if ( send_cookie && cookie ) { |
if ( send_cookie && cookie ) { |
Line 209 syncprov_done_ctrl(
|
Line 238 syncprov_done_ctrl(
|
if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) { |
if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) { |
ber_printf( ber, "b", refreshDeletes ); |
ber_printf( ber, "b", refreshDeletes ); |
} |
} |
ber_printf( ber, "N}" ); |
ber_printf( ber, "N}" ); |
|
|
ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE; |
ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE; |
ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL); |
ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL); |
Line 228 syncprov_done_ctrl(
|
Line 257 syncprov_done_ctrl(
|
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
|
|
#if 0 |
|
/* Generate state based on session log - not implemented yet */ |
|
static int |
|
syncprov_state_ctrl_from_slog( |
|
Operation *op, |
|
SlapReply *rs, |
|
struct slog_entry *slog_e, |
|
int entry_sync_state, |
|
LDAPControl **ctrls, |
|
int num_ctrls, |
|
int send_cookie, |
|
struct berval *cookie) |
|
{ |
|
Attribute* a; |
|
int ret; |
|
int res; |
|
const char *text = NULL; |
|
|
|
BerElementBuffer berbuf; |
|
BerElement *ber = (BerElement *)&berbuf; |
|
|
|
struct berval entryuuid_bv = BER_BVNULL; |
|
|
|
ber_init2( ber, NULL, LBER_USE_DER ); |
|
ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx ); |
|
|
|
ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) ); |
|
|
|
entryuuid_bv = slog_e->sl_uuid; |
|
|
|
if ( send_cookie && cookie ) { |
|
ber_printf( ber, "{eOON}", |
|
entry_sync_state, &entryuuid_bv, cookie ); |
|
} else { |
|
ber_printf( ber, "{eON}", |
|
entry_sync_state, &entryuuid_bv ); |
|
} |
|
|
|
ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE; |
|
ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL); |
|
ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 ); |
|
|
|
ber_free_buf( ber ); |
|
|
|
if ( ret < 0 ) { |
|
Debug( LDAP_DEBUG_TRACE, |
|
"slap_build_sync_ctrl: ber_flatten2 failed\n", |
|
0, 0, 0 ); |
|
send_ldap_error( op, rs, LDAP_OTHER, "internal error" ); |
|
return ret; |
|
} |
|
|
|
return LDAP_SUCCESS; |
|
} |
|
#endif |
|
|
|
static int |
static int |
syncprov_sendinfo( |
syncprov_sendinfo( |
Operation *op, |
Operation *op, |
Line 392 findbase_cb( Operation *op, SlapReply *r
|
Line 365 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 = 1; |
fc->fbase = 2; |
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. Now |
/* OK, the DN is the same and the entryID is the same. */ |
* 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 ) { |
|
Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 ); |
|
} |
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
|
|
Line 432 syncprov_findbase( Operation *op, fbase_
|
Line 387 syncprov_findbase( Operation *op, fbase_
|
{ |
{ |
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; |
|
|
|
slap_callback cb = {0}; |
|
Operation fop; |
|
SlapReply frs = { REP_RESULT }; |
|
int rc; |
|
|
|
fop = *op; |
|
|
|
cb.sc_response = findbase_cb; |
/* Use basic parameters from syncrepl search, but use |
cb.sc_private = fc; |
* current op's threadctx / tmpmemctx |
|
*/ |
|
ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex ); |
|
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.o_bd = op->o_bd; |
|
fop.o_time = op->o_time; |
|
fop.o_tincr = op->o_tincr; |
|
|
fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */ |
cb.sc_response = findbase_cb; |
fop.o_callback = &cb; |
cb.sc_private = fc; |
fop.o_tag = LDAP_REQ_SEARCH; |
|
fop.ors_scope = LDAP_SCOPE_BASE; |
|
fop.ors_deref = fc->fss->s_op->ors_deref; |
|
fop.ors_slimit = 1; |
|
fop.ors_tlimit = SLAP_NO_LIMIT; |
|
fop.ors_attrs = slap_anlist_no_attrs; |
|
fop.ors_attrsonly = 1; |
|
fop.ors_filter = fc->fss->s_op->ors_filter; |
|
fop.ors_filterstr = fc->fss->s_op->ors_filterstr; |
|
|
|
fop.o_req_ndn = fc->fss->s_op->o_req_ndn; |
fop.o_sync_mode = 0; /* turn off sync mode */ |
|
fop.o_managedsait = SLAP_CONTROL_CRITICAL; |
|
fop.o_callback = &cb; |
|
fop.o_tag = LDAP_REQ_SEARCH; |
|
fop.ors_scope = LDAP_SCOPE_BASE; |
|
fop.ors_limit = NULL; |
|
fop.ors_slimit = 1; |
|
fop.ors_tlimit = SLAP_NO_LIMIT; |
|
fop.ors_attrs = slap_anlist_no_attrs; |
|
fop.ors_attrsonly = 1; |
|
|
|
fop.o_bd->bd_info = on->on_info->oi_orig; |
|
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; |
|
} |
|
|
fop.o_bd->bd_info = on->on_info->oi_orig; |
/* After the first call, see if the fdn resides in the scope */ |
rc = fop.o_bd->be_search( &fop, &frs ); |
if ( fc->fbase == 1 ) { |
fop.o_bd->bd_info = (BackendInfo *)on; |
switch ( fc->fss->s_op->ors_scope ) { |
|
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; |
|
#ifdef LDAP_SCOPE_SUBORDINATE |
|
case LDAP_SCOPE_SUBORDINATE: |
|
fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) && |
|
!dn_match( fc->fdn, &fc->fss->s_base ); |
|
break; |
|
#endif |
|
} |
|
} |
|
|
if ( fc->fbase ) return LDAP_SUCCESS; |
if ( fc->fbase ) |
|
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 473 syncprov_findbase( Operation *op, fbase_
|
Line 465 syncprov_findbase( Operation *op, fbase_
|
/* syncprov_findcsn: |
/* syncprov_findcsn: |
* This function has three different purposes, but they all use a search |
* This function has three different purposes, but they all use a search |
* that filters on entryCSN so they're combined here. |
* that filters on entryCSN so they're combined here. |
* 1: when the current contextCSN is unknown (i.e., at server start time) |
* 1: at startup time, after a contextCSN has been read from the database, |
* and a syncrepl search has arrived with a cookie, we search for all entries |
* we search for all entries with CSN >= contextCSN in case the contextCSN |
* with CSN >= the cookie CSN, and store the maximum as our contextCSN. Also, |
* was not checkpointed at the previous shutdown. |
* we expect to find the cookie CSN in the search results, and note if we did |
|
* or not. If not, we assume the cookie is stale. (This may be too restrictive, |
|
* notice case 2.) |
|
* |
* |
* 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. (Used to search for =.) If an |
* for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN. |
* entry is found, the cookie CSN is valid, otherwise it is stale. Case 1 is |
* If an entry is found, the cookie CSN is valid, otherwise it is stale. |
* considered a special case of case 2, and both are generally called the |
|
* "find CSN" task. |
|
* |
* |
* 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. |
*/ |
*/ |
#define FIND_CSN 1 |
#define FIND_MAXCSN 1 |
#define FIND_PRESENT 2 |
#define FIND_CSN 2 |
|
#define FIND_PRESENT 3 |
|
|
typedef struct fcsn_cookie { |
static int |
struct berval maxcsn; |
findmax_cb( Operation *op, SlapReply *rs ) |
int gotmatch; |
{ |
} fcsn_cookie; |
if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) { |
|
struct berval *maxcsn = op->o_callback->sc_private; |
|
Attribute *a = attr_find( rs->sr_entry->e_attrs, |
|
slap_schema.si_ad_entryCSN ); |
|
|
|
if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) { |
|
maxcsn->bv_len = a->a_vals[0].bv_len; |
|
strcpy( maxcsn->bv_val, a->a_vals[0].bv_val ); |
|
} |
|
} |
|
return LDAP_SUCCESS; |
|
} |
|
|
static int |
static int |
findcsn_cb( Operation *op, SlapReply *rs ) |
findcsn_cb( Operation *op, SlapReply *rs ) |
Line 504 findcsn_cb( Operation *op, SlapReply *rs
|
Line 503 findcsn_cb( Operation *op, SlapReply *rs
|
slap_callback *sc = op->o_callback; |
slap_callback *sc = op->o_callback; |
|
|
if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) { |
if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) { |
/* If the private pointer is set, it points to an fcsn_cookie |
sc->sc_private = (void *)1; |
* and we want to record the maxcsn and match state. |
|
*/ |
|
if ( sc->sc_private ) { |
|
int i; |
|
fcsn_cookie *fc = sc->sc_private; |
|
sync_control *srs = op->o_controls[sync_cid]; |
|
Attribute *a = attr_find(rs->sr_entry->e_attrs, |
|
slap_schema.si_ad_entryCSN ); |
|
i = ber_bvcmp( &a->a_vals[0], srs->sr_state.ctxcsn ); |
|
if ( i == 0 ) fc->gotmatch = 1; |
|
i = ber_bvcmp( &a->a_vals[0], &fc->maxcsn ); |
|
if ( i > 0 ) { |
|
fc->maxcsn.bv_len = a->a_vals[0].bv_len; |
|
strcpy(fc->maxcsn.bv_val, a->a_vals[0].bv_val ); |
|
} |
|
} else { |
|
/* Otherwise, if the private pointer is not set, we just |
|
* want to know if any entry matched the filter. |
|
*/ |
|
sc->sc_private = (void *)1; |
|
} |
|
} |
} |
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
|
|
/* Build a list of entryUUIDs for sending in a SyncID set */ |
/* Build a list of entryUUIDs for sending in a SyncID set */ |
|
|
|
#define UUID_LEN 16 |
|
|
typedef struct fpres_cookie { |
typedef struct fpres_cookie { |
int num; |
int num; |
BerVarray uuids; |
BerVarray uuids; |
|
char *last; |
} fpres_cookie; |
} fpres_cookie; |
|
|
static int |
static int |
Line 542 findpres_cb( Operation *op, SlapReply *r
|
Line 523 findpres_cb( Operation *op, SlapReply *r
|
{ |
{ |
slap_callback *sc = op->o_callback; |
slap_callback *sc = op->o_callback; |
fpres_cookie *pc = sc->sc_private; |
fpres_cookie *pc = sc->sc_private; |
|
Attribute *a; |
int ret = SLAP_CB_CONTINUE; |
int ret = SLAP_CB_CONTINUE; |
|
|
if ( rs->sr_type == REP_SEARCH ) { |
switch ( rs->sr_type ) { |
ret = slap_build_syncUUID_set( op, &pc->uuids, rs->sr_entry ); |
case REP_SEARCH: |
if ( ret > 0 ) { |
a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID ); |
|
if ( a ) { |
|
pc->uuids[pc->num].bv_val = pc->last; |
|
AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val, |
|
pc->uuids[pc->num].bv_len ); |
pc->num++; |
pc->num++; |
ret = LDAP_SUCCESS; |
pc->last = pc->uuids[pc->num].bv_val; |
if ( pc->num == SLAP_SYNCUUID_SET_SIZE ) { |
pc->uuids[pc->num].bv_val = NULL; |
ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, |
|
0, pc->uuids, 0 ); |
|
ber_bvarray_free_x( pc->uuids, op->o_tmpmemctx ); |
|
pc->uuids = NULL; |
|
pc->num = 0; |
|
} |
|
} else { |
|
ret = LDAP_OTHER; |
|
} |
} |
} else if ( rs->sr_type == REP_RESULT ) { |
ret = LDAP_SUCCESS; |
|
if ( pc->num != SLAP_SYNCUUID_SET_SIZE ) |
|
break; |
|
/* FALLTHRU */ |
|
case REP_RESULT: |
ret = rs->sr_err; |
ret = rs->sr_err; |
if ( pc->num ) { |
if ( pc->num ) { |
ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, |
ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, |
0, pc->uuids, 0 ); |
0, pc->uuids, 0 ); |
ber_bvarray_free_x( pc->uuids, op->o_tmpmemctx ); |
pc->uuids[pc->num].bv_val = pc->last; |
pc->uuids = NULL; |
|
pc->num = 0; |
pc->num = 0; |
|
pc->last = pc->uuids[0].bv_val; |
} |
} |
|
break; |
|
default: |
|
break; |
} |
} |
return ret; |
return ret; |
} |
} |
|
|
|
|
static int |
static int |
syncprov_findcsn( Operation *op, int mode ) |
syncprov_findcsn( Operation *op, int mode ) |
{ |
{ |
Line 584 syncprov_findcsn( Operation *op, int mod
|
Line 568 syncprov_findcsn( Operation *op, int mod
|
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 fbuf; |
struct berval maxcsn; |
Filter cf; |
Filter cf, af; |
AttributeAssertion eq; |
#ifdef LDAP_COMP_MATCH |
int rc; |
AttributeAssertion eq = { NULL, BER_BVNULL, NULL }; |
fcsn_cookie fcookie; |
#else |
|
AttributeAssertion eq = { NULL, BER_BVNULL }; |
|
#endif |
|
int i, rc = LDAP_SUCCESS; |
fpres_cookie pcookie; |
fpres_cookie pcookie; |
int locked = 0; |
sync_control *srs = NULL; |
sync_control *srs = op->o_controls[sync_cid]; |
int findcsn_retry = 1; |
|
|
if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) { |
if ( mode != FIND_MAXCSN ) { |
return LDAP_OTHER; |
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; |
fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */ |
fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */ |
|
/* We want pure entries, not referrals */ |
|
fop.o_managedsait = SLAP_CONTROL_CRITICAL; |
|
|
fbuf.bv_val = buf; |
cf.f_ava = &eq; |
if ( mode == FIND_CSN ) { |
cf.f_av_desc = slap_schema.si_ad_entryCSN; |
if ( !si->si_gotcsn ) { |
cf.f_next = NULL; |
/* If we don't know the current ctxcsn, find it */ |
|
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
fop.o_callback = &cb; |
locked = 1; |
fop.ors_limit = NULL; |
} |
fop.ors_tlimit = SLAP_NO_LIMIT; |
if ( !si->si_gotcsn ) { |
fop.ors_filter = &cf; |
cf.f_choice = LDAP_FILTER_GE; |
fop.ors_filterstr.bv_val = buf; |
fop.ors_attrsonly = 0; |
|
fop.ors_attrs = csn_anlist; |
again: |
fop.ors_slimit = SLAP_NO_LIMIT; |
switch( mode ) { |
cb.sc_private = &fcookie; |
case FIND_MAXCSN: |
fcookie.maxcsn.bv_val = cbuf; |
cf.f_choice = LDAP_FILTER_GE; |
fcookie.maxcsn.bv_len = 0; |
cf.f_av_value = si->si_ctxcsn; |
fcookie.gotmatch = 0; |
fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)", |
fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)", srs->sr_state.ctxcsn->bv_val ); |
cf.f_av_value.bv_val ); |
|
fop.ors_attrsonly = 0; |
|
fop.ors_attrs = csn_anlist; |
|
fop.ors_slimit = SLAP_NO_LIMIT; |
|
cb.sc_private = &maxcsn; |
|
cb.sc_response = findmax_cb; |
|
strcpy( cbuf, si->si_ctxcsn.bv_val ); |
|
maxcsn.bv_val = cbuf; |
|
maxcsn.bv_len = si->si_ctxcsn.bv_len; |
|
break; |
|
case FIND_CSN: |
|
cf.f_av_value = srs->sr_state.ctxcsn; |
|
/* Look for exact match the first time */ |
|
if ( findcsn_retry ) { |
|
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 { |
} else { |
if ( locked ) { |
|
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
|
locked = 0; |
|
} |
|
cf.f_choice = LDAP_FILTER_LE; |
cf.f_choice = LDAP_FILTER_LE; |
fop.ors_attrsonly = 1; |
fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)", |
fop.ors_attrs = slap_anlist_no_attrs; |
cf.f_av_value.bv_val ); |
fop.ors_slimit = 1; |
|
cb.sc_private = NULL; |
|
fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)", srs->sr_state.ctxcsn->bv_val ); |
|
} |
} |
|
fop.ors_attrsonly = 1; |
|
fop.ors_attrs = slap_anlist_no_attrs; |
|
fop.ors_slimit = 1; |
|
cb.sc_private = NULL; |
cb.sc_response = findcsn_cb; |
cb.sc_response = findcsn_cb; |
|
break; |
} else if ( mode == FIND_PRESENT ) { |
case FIND_PRESENT: |
|
af.f_choice = LDAP_FILTER_AND; |
|
af.f_next = NULL; |
|
af.f_and = &cf; |
cf.f_choice = LDAP_FILTER_LE; |
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; |
/* We want pure entries, not referrals */ |
|
fop.o_managedsait = SLAP_CONTROL_CRITICAL; |
|
cb.sc_private = &pcookie; |
cb.sc_private = &pcookie; |
cb.sc_response = findpres_cb; |
cb.sc_response = findpres_cb; |
pcookie.num = 0; |
pcookie.num = 0; |
pcookie.uuids = NULL; |
|
fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)", srs->sr_state.ctxcsn->bv_val ); |
|
} |
|
cf.f_ava = &eq; |
|
cf.f_av_desc = slap_schema.si_ad_entryCSN; |
|
cf.f_av_value = *srs->sr_state.ctxcsn; |
|
cf.f_next = NULL; |
|
|
|
fop.o_callback = &cb; |
/* preallocate storage for a full set */ |
fop.ors_tlimit = SLAP_NO_LIMIT; |
pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) * |
fop.ors_filter = &cf; |
sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN, |
fop.ors_filterstr = fbuf; |
op->o_tmpmemctx ); |
|
pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1); |
|
pcookie.uuids[0].bv_val = pcookie.last; |
|
pcookie.uuids[0].bv_len = UUID_LEN; |
|
for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) { |
|
pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN; |
|
pcookie.uuids[i].bv_len = UUID_LEN; |
|
} |
|
break; |
|
} |
|
|
fop.o_bd->bd_info = on->on_info->oi_orig; |
fop.o_bd->bd_info = on->on_info->oi_orig; |
rc = fop.o_bd->be_search( &fop, &frs ); |
fop.o_bd->be_search( &fop, &frs ); |
fop.o_bd->bd_info = (BackendInfo *)on; |
fop.o_bd->bd_info = (BackendInfo *)on; |
|
|
if ( mode == FIND_CSN ) { |
switch( mode ) { |
if ( !si->si_gotcsn ) { |
case FIND_MAXCSN: |
strcpy(si->si_ctxcsnbuf, fcookie.maxcsn.bv_val); |
strcpy( si->si_ctxcsnbuf, maxcsn.bv_val ); |
si->si_ctxcsn.bv_len = fcookie.maxcsn.bv_len; |
si->si_ctxcsn.bv_len = maxcsn.bv_len; |
si->si_gotcsn = 1; |
break; |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
case FIND_CSN: |
if ( fcookie.gotmatch ) return LDAP_SUCCESS; |
/* If matching CSN was not found, invalidate the context. */ |
|
if ( !cb.sc_private ) { |
} else { |
/* If we didn't find an exact match, then try for <= */ |
if ( cb.sc_private ) return LDAP_SUCCESS; |
if ( findcsn_retry ) { |
|
findcsn_retry = 0; |
|
goto again; |
|
} |
|
rc = LDAP_NO_SUCH_OBJECT; |
} |
} |
} else if ( mode == FIND_PRESENT ) { |
break; |
return LDAP_SUCCESS; |
case FIND_PRESENT: |
|
op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx ); |
|
op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx ); |
|
break; |
} |
} |
|
|
/* If matching CSN was not found, invalidate the context. */ |
return rc; |
return LDAP_NO_SUCH_OBJECT; |
|
} |
} |
|
|
/* Queue a persistent search response if still in Refresh stage */ |
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_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_val++) = '\0'; |
|
sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val ); |
|
*(sr->s_uuid.bv_val++) = '\0'; |
|
sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val ); |
|
|
|
if ( !so->s_res ) { |
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
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; |
|
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
return LDAP_SUCCESS; |
if ( so->s_flags & PS_IS_DETACHED ) { |
|
filter_free( so->s_op->ors_filter ); |
|
for ( ga = so->s_op->o_groups; ga; ga=gnext ) { |
|
gnext = ga->ga_next; |
|
ch_free( ga ); |
|
} |
|
ch_free( so->s_op ); |
|
} |
|
ch_free( so->s_base.bv_val ); |
|
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 ); |
} |
} |
|
|
/* Send a persistent search response */ |
/* Send a persistent search response */ |
static int |
static int |
syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry *e, int mode, int queue ) |
syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, 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; |
|
|
|
ohdr = *sop.o_hdr; |
if ( so->s_op->o_abandon ) |
sop.o_hdr = &ohdr; |
return SLAPD_ABANDON; |
sop.o_tmpmemctx = op->o_tmpmemctx; |
|
sop.o_bd = op->o_bd; |
|
sop.o_controls = op->o_controls; |
|
|
|
if ( queue && (so->s_flags & PS_IS_REFRESHING) ) { |
|
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
|
if ( so->s_flags & PS_IS_REFRESHING ) |
|
return syncprov_qresp( opc, so, mode ); |
|
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
|
} |
|
|
|
ctrls[1] = NULL; |
ctrls[1] = NULL; |
slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, |
slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid ); |
so->s_sid, 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( &sop, &rs, &e_uuid, |
rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid, |
mode, ctrls, 0, 1, &cookie ); |
mode, ctrls, 0, 1, &cookie ); |
|
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
|
|
rs.sr_entry = e; |
|
rs.sr_ctrls = ctrls; |
rs.sr_ctrls = ctrls; |
|
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
switch( mode ) { |
switch( mode ) { |
case LDAP_SYNC_ADD: |
case LDAP_SYNC_ADD: |
|
rs.sr_entry = *e; |
|
if ( rs.sr_entry->e_private ) |
|
rs.sr_flags = REP_ENTRY_MUSTRELEASE; |
if ( opc->sreference ) { |
if ( opc->sreference ) { |
rs.sr_ref = get_entry_referrals( &sop, e ); |
rs.sr_ref = get_entry_referrals( op, rs.sr_entry ); |
send_search_reference( &sop, &rs ); |
send_search_reference( op, &rs ); |
ber_bvarray_free( rs.sr_ref ); |
ber_bvarray_free( rs.sr_ref ); |
|
if ( !rs.sr_entry ) |
|
*e = NULL; |
break; |
break; |
} |
} |
/* fallthru */ |
/* fallthru */ |
case LDAP_SYNC_MODIFY: |
case LDAP_SYNC_MODIFY: |
rs.sr_attrs = sop.ors_attrs; |
rs.sr_entry = *e; |
send_search_entry( &sop, &rs ); |
if ( rs.sr_entry->e_private ) |
|
rs.sr_flags = REP_ENTRY_MUSTRELEASE; |
|
rs.sr_attrs = op->ors_attrs; |
|
send_search_entry( op, &rs ); |
|
if ( !rs.sr_entry ) |
|
*e = NULL; |
break; |
break; |
case LDAP_SYNC_DELETE: |
case LDAP_SYNC_DELETE: |
e_uuid.e_attrs = NULL; |
e_uuid.e_attrs = NULL; |
Line 764 syncprov_sendresp( Operation *op, opcook
|
Line 782 syncprov_sendresp( Operation *op, opcook
|
e_uuid.e_nname = opc->sndn; |
e_uuid.e_nname = opc->sndn; |
rs.sr_entry = &e_uuid; |
rs.sr_entry = &e_uuid; |
if ( opc->sreference ) { |
if ( opc->sreference ) { |
struct berval bv; |
struct berval bv = BER_BVNULL; |
bv.bv_val = NULL; |
|
bv.bv_len = 0; |
|
rs.sr_ref = &bv; |
rs.sr_ref = &bv; |
send_search_reference( &sop, &rs ); |
send_search_reference( op, &rs ); |
} else { |
} else { |
send_search_entry( &sop, &rs ); |
send_search_entry( op, &rs ); |
} |
} |
break; |
break; |
default: |
default: |
assert(0); |
assert(0); |
} |
} |
free( rs.sr_ctrls[0] ); |
/* In case someone else freed it already? */ |
|
if ( rs.sr_ctrls ) { |
|
op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx ); |
|
rs.sr_ctrls = NULL; |
|
} |
|
|
return rs.sr_err; |
return rs.sr_err; |
} |
} |
|
|
static void |
/* Play back queued responses */ |
syncprov_free_syncop( syncops *so ) |
static int |
|
syncprov_qplay( Operation *op, slap_overinst *on, syncops *so ) |
{ |
{ |
syncres *sr, *srnext; |
syncres *sr; |
|
Entry *e; |
|
opcookie opc; |
|
int rc; |
|
|
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
opc.son = on; |
so->s_inuse--; |
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
if ( so->s_inuse > 0 ) { |
|
|
for (;;) { |
|
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
|
sr = so->s_res; |
|
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 ); |
return; |
|
} |
if ( !sr || so->s_op->o_abandon ) |
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
break; |
filter_free( so->s_op->ors_filter ); |
|
ch_free( so->s_op ); |
opc.sdn = sr->s_dn; |
ch_free( so->s_base.bv_val ); |
opc.sndn = sr->s_ndn; |
for ( sr=so->s_res; sr; sr=srnext ) { |
opc.suuid = sr->s_uuid; |
srnext = sr->s_next; |
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 ); |
ch_free( sr ); |
|
|
|
if ( rc ) |
|
break; |
} |
} |
ldap_pvt_thread_mutex_destroy( &so->s_mutex ); |
op->o_bd->bd_info = (BackendInfo *)on; |
ch_free( so ); |
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; |
|
char opbuf[OPERATION_BUFFER_SIZE]; |
|
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; |
|
|
|
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 int |
static int |
syncprov_drop_psearch( syncops *so ) |
syncprov_qresp( opcookie *opc, syncops *so, int mode ) |
{ |
{ |
ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex ); |
syncres *sr; |
so->s_op->o_conn->c_n_ops_executing--; |
|
so->s_op->o_conn->c_n_ops_completed++; |
sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 + |
ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex ); |
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 ); |
|
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 ); |
|
|
|
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
|
if ( !so->s_res ) { |
|
so->s_res = sr; |
|
} else { |
|
so->s_restail->s_next = sr; |
|
} |
|
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; |
|
} |
|
if ( so->s_flags & PS_IS_DETACHED ) { |
|
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; |
|
} 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; |
|
} |
|
} |
|
ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex ); |
|
} |
|
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
|
return LDAP_SUCCESS; |
|
} |
|
|
|
static int |
|
syncprov_drop_psearch( syncops *so, int lock ) |
|
{ |
|
if ( so->s_flags & PS_IS_DETACHED ) { |
|
if ( lock ) |
|
ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex ); |
|
so->s_op->o_conn->c_n_ops_executing--; |
|
so->s_op->o_conn->c_n_ops_completed++; |
|
LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op, |
|
o_next ); |
|
if ( lock ) |
|
ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex ); |
|
} |
syncprov_free_syncop( so ); |
syncprov_free_syncop( so ); |
|
|
|
return 0; |
|
} |
|
|
|
static int |
|
syncprov_ab_cleanup( Operation *op, SlapReply *rs ) |
|
{ |
|
slap_callback *sc = op->o_callback; |
|
op->o_callback = sc->sc_next; |
|
syncprov_drop_psearch( op->o_callback->sc_private, 0 ); |
|
op->o_tmpfree( sc, op->o_tmpmemctx ); |
|
return 0; |
} |
} |
|
|
static int |
static int |
Line 834 syncprov_op_abandon( Operation *op, Slap
|
Line 1005 syncprov_op_abandon( Operation *op, Slap
|
if ( so ) { |
if ( so ) { |
/* Is this really a Cancel exop? */ |
/* Is this really a Cancel exop? */ |
if ( op->o_tag != LDAP_REQ_ABANDON ) { |
if ( op->o_tag != LDAP_REQ_ABANDON ) { |
|
so->s_op->o_cancel = SLAP_CANCEL_ACK; |
rs->sr_err = LDAP_CANCELLED; |
rs->sr_err = LDAP_CANCELLED; |
send_ldap_result( so->s_op, rs ); |
send_ldap_result( so->s_op, rs ); |
|
if ( so->s_flags & PS_IS_DETACHED ) { |
|
slap_callback *cb; |
|
cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx ); |
|
cb->sc_cleanup = syncprov_ab_cleanup; |
|
cb->sc_next = op->o_callback; |
|
cb->sc_private = so; |
|
return SLAP_CB_CONTINUE; |
|
} |
} |
} |
syncprov_drop_psearch( so ); |
syncprov_drop_psearch( so, 0 ); |
} |
} |
return SLAP_CB_CONTINUE; |
return SLAP_CB_CONTINUE; |
} |
} |
Line 855 syncprov_matchops( Operation *op, opcook
|
Line 1035 syncprov_matchops( Operation *op, opcook
|
Attribute *a; |
Attribute *a; |
int rc; |
int rc; |
struct berval newdn; |
struct berval newdn; |
|
int freefdn = 0; |
|
|
fc.fdn = &op->o_req_ndn; |
fc.fdn = &op->o_req_ndn; |
/* compute new DN */ |
/* compute new DN */ |
Line 864 syncprov_matchops( Operation *op, opcook
|
Line 1045 syncprov_matchops( Operation *op, opcook
|
else dnParent( fc.fdn, &pdn ); |
else dnParent( fc.fdn, &pdn ); |
build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx ); |
build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx ); |
fc.fdn = &newdn; |
fc.fdn = &newdn; |
|
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; |
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e ); |
rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e ); |
|
/* If we're sending responses now, make a copy and unlock the DB */ |
|
if ( e && !saveit ) { |
|
Entry *e2 = entry_dup( e ); |
|
be_entry_release_rw( op, e, 0 ); |
|
e = e2; |
|
} |
op->o_bd->bd_info = (BackendInfo *)on; |
op->o_bd->bd_info = (BackendInfo *)on; |
if ( rc ) return; |
if ( rc ) return; |
} else { |
} else { |
e = op->ora_e; |
e = op->ora_e; |
} |
} |
|
|
if ( saveit ) { |
if ( saveit || op->o_tag == LDAP_REQ_ADD ) { |
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 905 syncprov_matchops( Operation *op, opcook
|
Line 1096 syncprov_matchops( Operation *op, opcook
|
send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED, |
send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED, |
"search base has changed" ); |
"search base has changed" ); |
sprev->s_next = snext; |
sprev->s_next = snext; |
syncprov_drop_psearch( ss ); |
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 930 syncprov_matchops( Operation *op, opcook
|
Line 1131 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; |
ss->s_inuse++; |
ldap_pvt_thread_mutex_lock( &ss->s_mutex ); |
|
++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_sendresp( op, opc, ss, e, |
syncprov_qresp( opc, ss, |
found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 ); |
found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD ); |
} |
} |
} else if ( !saveit && found ) { |
} else if ( !saveit && found ) { |
/* send DELETE */ |
/* send DELETE */ |
syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 ); |
syncprov_qresp( opc, ss, LDAP_SYNC_DELETE ); |
} |
} |
} |
} |
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 ) { |
|
|
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_r( op, e ); |
be_entry_release_rw( op, e, 0 ); |
op->o_bd->bd_info = (BackendInfo *)on; |
op->o_bd->bd_info = (BackendInfo *)on; |
} |
} |
|
if ( freefdn ) { |
|
op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx ); |
|
} |
} |
} |
|
|
static int |
static int |
Line 972 syncprov_op_cleanup( Operation *op, Slap
|
Line 1179 syncprov_op_cleanup( Operation *op, Slap
|
mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp ); |
mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp ); |
if ( mt ) { |
if ( mt ) { |
modinst *mi = mt->mt_mods; |
modinst *mi = mt->mt_mods; |
|
|
/* If there are more, promote the next one */ |
/* If there are more, promote the next one */ |
ldap_pvt_thread_mutex_lock( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_lock( &mt->mt_mutex ); |
if ( mi->mi_next ) { |
if ( mi->mi_next ) { |
Line 987 syncprov_op_cleanup( Operation *op, Slap
|
Line 1194 syncprov_op_cleanup( Operation *op, Slap
|
} |
} |
} |
} |
ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex ); |
ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex ); |
|
if ( !BER_BVISNULL( &opc->suuid )) |
|
op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx ); |
|
if ( !BER_BVISNULL( &opc->sndn )) |
|
op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx ); |
|
if ( !BER_BVISNULL( &opc->sdn )) |
|
op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx ); |
op->o_callback = cb->sc_next; |
op->o_callback = cb->sc_next; |
op->o_tmpfree(cb, op->o_tmpmemctx); |
op->o_tmpfree(cb, op->o_tmpmemctx); |
|
|
|
return 0; |
|
} |
|
|
|
static void |
|
syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on ) |
|
{ |
|
syncprov_info_t *si = on->on_bi.bi_private; |
|
Modifications mod; |
|
Operation opm; |
|
struct berval bv[2]; |
|
slap_callback cb = {0}; |
|
int manage = get_manageDSAit(op); |
|
|
|
mod.sml_values = bv; |
|
bv[1].bv_val = NULL; |
|
bv[0] = si->si_ctxcsn; |
|
mod.sml_nvalues = NULL; |
|
mod.sml_desc = slap_schema.si_ad_contextCSN; |
|
mod.sml_op = LDAP_MOD_REPLACE; |
|
mod.sml_flags = 0; |
|
mod.sml_next = NULL; |
|
|
|
cb.sc_response = slap_null_cb; |
|
opm = *op; |
|
opm.o_tag = LDAP_REQ_MODIFY; |
|
opm.o_callback = &cb; |
|
opm.orm_modlist = &mod; |
|
opm.o_req_dn = op->o_bd->be_suffix[0]; |
|
opm.o_req_ndn = op->o_bd->be_nsuffix[0]; |
|
opm.o_bd->bd_info = on->on_info->oi_orig; |
|
opm.o_managedsait = SLAP_CONTROL_NONCRITICAL; |
|
opm.o_bd->be_modify( &opm, rs ); |
|
opm.o_managedsait = manage; |
|
} |
|
|
|
static void |
|
syncprov_add_slog( Operation *op, struct berval *csn ) |
|
{ |
|
opcookie *opc = op->o_callback->sc_private; |
|
slap_overinst *on = opc->son; |
|
syncprov_info_t *si = on->on_bi.bi_private; |
|
sessionlog *sl; |
|
slog_entry *se; |
|
|
|
sl = si->si_logs; |
|
{ |
|
/* Allocate a record. UUIDs are not NUL-terminated. */ |
|
se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len + |
|
csn->bv_len + 1 ); |
|
se->se_next = NULL; |
|
se->se_tag = op->o_tag; |
|
|
|
se->se_uuid.bv_val = (char *)(se+1); |
|
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_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 ); |
|
se->se_csn.bv_val[csn->bv_len] = '\0'; |
|
se->se_csn.bv_len = csn->bv_len; |
|
|
|
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
|
if ( sl->sl_head ) { |
|
sl->sl_tail->se_next = se; |
|
} else { |
|
sl->sl_head = se; |
|
} |
|
sl->sl_tail = se; |
|
sl->sl_num++; |
|
while ( sl->sl_num > sl->sl_size ) { |
|
se = sl->sl_head; |
|
sl->sl_head = se->se_next; |
|
strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val ); |
|
sl->sl_mincsn.bv_len = se->se_csn.bv_len; |
|
ch_free( se ); |
|
sl->sl_num--; |
|
if ( !sl->sl_head ) { |
|
sl->sl_tail = NULL; |
|
} |
|
} |
|
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
|
} |
|
} |
|
|
|
/* Just set a flag if we found the matching entry */ |
|
static int |
|
playlog_cb( Operation *op, SlapReply *rs ) |
|
{ |
|
if ( rs->sr_type == REP_SEARCH ) { |
|
op->o_callback->sc_private = (void *)1; |
|
} |
|
return rs->sr_err; |
|
} |
|
|
|
/* enter with sl->sl_mutex locked, release before returning */ |
|
static void |
|
syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl, |
|
struct berval *oldcsn, struct berval *ctxcsn ) |
|
{ |
|
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
|
slog_entry *se; |
|
int i, j, ndel, num, nmods, mmods; |
|
BerVarray uuids; |
|
|
|
if ( !sl->sl_num ) { |
|
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
|
return; |
|
} |
|
|
|
num = sl->sl_num; |
|
i = 0; |
|
nmods = 0; |
|
|
|
uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) + |
|
num * UUID_LEN, op->o_tmpmemctx ); |
|
|
|
uuids[0].bv_val = (char *)(uuids + num + 1); |
|
|
|
/* Make a copy of the relevant UUIDs. Put the Deletes up front |
|
* and everything else at the end. Do this first so we can |
|
* unlock the list mutex. |
|
*/ |
|
for ( se=sl->sl_head; se; se=se->se_next ) { |
|
if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue; |
|
if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break; |
|
if ( se->se_tag == LDAP_REQ_DELETE ) { |
|
j = i; |
|
i++; |
|
} else { |
|
nmods++; |
|
j = num - nmods; |
|
} |
|
uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN); |
|
AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN); |
|
uuids[j].bv_len = UUID_LEN; |
|
} |
|
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
|
|
|
ndel = i; |
|
|
|
/* Zero out unused slots */ |
|
for ( i=ndel; i < num - nmods; i++ ) |
|
uuids[i].bv_len = 0; |
|
|
|
/* Mods must be validated to see if they belong in this delete set. |
|
*/ |
|
|
|
mmods = nmods; |
|
/* Strip any duplicates */ |
|
for ( i=0; i<nmods; i++ ) { |
|
for ( j=0; j<ndel; j++ ) { |
|
if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) { |
|
uuids[num - 1 - i].bv_len = 0; |
|
mmods --; |
|
break; |
|
} |
|
} |
|
if ( uuids[num - 1 - i].bv_len == 0 ) continue; |
|
for ( j=0; j<i; j++ ) { |
|
if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) { |
|
uuids[num - 1 - i].bv_len = 0; |
|
mmods --; |
|
break; |
|
} |
|
} |
|
} |
|
|
|
if ( mmods ) { |
|
Operation fop; |
|
SlapReply frs = { REP_RESULT }; |
|
int rc; |
|
Filter mf, af; |
|
#ifdef LDAP_COMP_MATCH |
|
AttributeAssertion eq = { NULL, BER_BVNULL, NULL }; |
|
#else |
|
AttributeAssertion eq; |
|
#endif |
|
slap_callback cb = {0}; |
|
|
|
fop = *op; |
|
|
|
fop.o_sync_mode = 0; |
|
fop.o_callback = &cb; |
|
fop.ors_limit = NULL; |
|
fop.ors_tlimit = SLAP_NO_LIMIT; |
|
fop.ors_attrs = slap_anlist_all_attributes; |
|
fop.ors_attrsonly = 0; |
|
fop.o_managedsait = SLAP_CONTROL_CRITICAL; |
|
|
|
af.f_choice = LDAP_FILTER_AND; |
|
af.f_next = NULL; |
|
af.f_and = &mf; |
|
mf.f_choice = LDAP_FILTER_EQUALITY; |
|
mf.f_ava = &eq; |
|
mf.f_av_desc = slap_schema.si_ad_entryUUID; |
|
mf.f_next = fop.ors_filter; |
|
|
|
fop.ors_filter = ⁡ |
|
|
|
cb.sc_response = playlog_cb; |
|
fop.o_bd->bd_info = on->on_info->oi_orig; |
|
|
|
for ( i=ndel; i<num; i++ ) { |
|
if ( uuids[i].bv_len == 0 ) continue; |
|
|
|
mf.f_av_value = uuids[i]; |
|
cb.sc_private = NULL; |
|
fop.ors_slimit = 1; |
|
rc = fop.o_bd->be_search( &fop, &frs ); |
|
|
|
/* If entry was not found, add to delete list */ |
|
if ( !cb.sc_private ) { |
|
uuids[ndel++] = uuids[i]; |
|
} |
|
} |
|
fop.o_bd->bd_info = (BackendInfo *)on; |
|
} |
|
if ( ndel ) { |
|
uuids[ndel].bv_val = NULL; |
|
syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 ); |
|
} |
} |
} |
|
|
static int |
static int |
Line 1001 syncprov_op_response( Operation *op, Sla
|
Line 1436 syncprov_op_response( Operation *op, Sla
|
|
|
if ( rs->sr_err == LDAP_SUCCESS ) |
if ( rs->sr_err == LDAP_SUCCESS ) |
{ |
{ |
struct berval maxcsn; |
struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL; |
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
|
|
/* 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_mutex_lock( &si->si_csn_mutex ); |
slap_get_commit_csn( op, &maxcsn ); |
slap_get_commit_csn( op, &maxcsn, &curcsn ); |
if ( maxcsn.bv_val ) { |
if ( !BER_BVISNULL( &maxcsn ) ) { |
strcpy( cbuf, maxcsn.bv_val ); |
strcpy( cbuf, maxcsn.bv_val ); |
if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) { |
if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) { |
strcpy( si->si_ctxcsnbuf, cbuf ); |
strcpy( si->si_ctxcsnbuf, cbuf ); |
si->si_ctxcsn.bv_len = maxcsn.bv_len; |
si->si_ctxcsn.bv_len = maxcsn.bv_len; |
} |
} |
si->si_gotcsn = 1; |
} |
|
|
|
/* Don't do any processing for consumer contextCSN updates */ |
|
if ( SLAP_SYNC_SHADOW( op->o_bd ) && |
|
op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) { |
|
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
|
return SLAP_CB_CONTINUE; |
|
} |
|
|
|
si->si_numops++; |
|
if ( si->si_chkops || si->si_chktime ) { |
|
int do_check=0; |
|
if ( si->si_chkops && si->si_numops >= si->si_chkops ) { |
|
do_check = 1; |
|
si->si_numops = 0; |
|
} |
|
if ( si->si_chktime && |
|
(op->o_time - si->si_chklast >= si->si_chktime )) { |
|
do_check = 1; |
|
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_mutex_unlock( &si->si_csn_mutex ); |
|
|
Line 1034 syncprov_op_response( Operation *op, Sla
|
Line 1492 syncprov_op_response( Operation *op, Sla
|
/* for each match in opc->smatches: |
/* for each match in opc->smatches: |
* send DELETE msg |
* send DELETE msg |
*/ |
*/ |
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
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_sendresp( op, opc, sm->sm_op, NULL, |
syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE ); |
LDAP_SYNC_DELETE, 1 ); |
|
} |
} |
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
break; |
break; |
} |
} |
} |
} |
|
|
|
/* Add any log records */ |
|
if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) { |
|
syncprov_add_slog( op, &curcsn ); |
|
} |
|
|
} |
} |
return SLAP_CB_CONTINUE; |
return SLAP_CB_CONTINUE; |
} |
} |
|
|
#if 0 |
/* We don't use a subentry to store the context CSN any more. |
/* We don't use a subentry to store the context CSN any more. But |
* We expose the current context CSN as an operational attribute |
* we ought to expose the current context CSN as an operational attribute |
* of the suffix entry. |
* somewhere, like on the suffix entry. |
|
*/ |
*/ |
static int |
static int |
syncprov_op_compare( Operation *op, SlapReply *rs ) |
syncprov_op_compare( Operation *op, SlapReply *rs ) |
Line 1062 syncprov_op_compare( Operation *op, Slap
|
Line 1521 syncprov_op_compare( Operation *op, Slap
|
syncprov_info_t *si = on->on_bi.bi_private; |
syncprov_info_t *si = on->on_bi.bi_private; |
int rc = SLAP_CB_CONTINUE; |
int rc = SLAP_CB_CONTINUE; |
|
|
if ( dn_match( &op->o_req_ndn, &si->si_e->e_nname ) ) |
if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) && |
|
op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN ) |
{ |
{ |
Attribute *a; |
Entry e = {0}; |
|
Attribute a = {0}; |
|
struct berval bv[2]; |
|
|
|
e.e_name = op->o_bd->be_suffix[0]; |
|
e.e_nname = op->o_bd->be_nsuffix[0]; |
|
|
|
BER_BVZERO( &bv[1] ); |
|
bv[0] = si->si_ctxcsn; |
|
|
|
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_e_mutex ); |
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
|
|
|
rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc, |
|
&op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL ); |
|
if ( ! rs->sr_err ) { |
|
rs->sr_err = LDAP_INSUFFICIENT_ACCESS; |
|
goto return_results; |
|
} |
|
|
if ( get_assert( op ) && |
if ( get_assert( op ) && |
( test_filter( op, si->si_e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) ) |
( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) ) |
{ |
{ |
rs->sr_err = LDAP_ASSERTION_FAILED; |
rs->sr_err = LDAP_ASSERTION_FAILED; |
goto return_results; |
goto return_results; |
} |
} |
|
|
rs->sr_err = access_allowed( op, si->si_e, op->oq_compare.rs_ava->aa_desc, |
|
&op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL ); |
|
if ( ! rs->sr_err ) { |
|
rs->sr_err = LDAP_INSUFFICIENT_ACCESS; |
|
goto return_results; |
|
} |
|
|
|
rs->sr_err = LDAP_NO_SUCH_ATTRIBUTE; |
rs->sr_err = LDAP_COMPARE_FALSE; |
|
|
for ( a = attr_find( si->si_e->e_attrs, op->oq_compare.rs_ava->aa_desc ); |
if ( value_find_ex( op->oq_compare.rs_ava->aa_desc, |
a != NULL; |
SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH | |
a = attr_find( a->a_next, op->oq_compare.rs_ava->aa_desc ) ) |
SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH, |
|
a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 ) |
{ |
{ |
rs->sr_err = LDAP_COMPARE_FALSE; |
rs->sr_err = LDAP_COMPARE_TRUE; |
|
|
if ( value_find_ex( op->oq_compare.rs_ava->aa_desc, |
|
SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH | |
|
SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH, |
|
a->a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 ) |
|
{ |
|
rs->sr_err = LDAP_COMPARE_TRUE; |
|
break; |
|
} |
|
} |
} |
|
|
return_results:; |
return_results:; |
|
|
ldap_pvt_thread_mutex_unlock( &si->si_e_mutex ); |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
|
|
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
|
|
Line 1112 return_results:;
|
Line 1577 return_results:;
|
rc = rs->sr_err; |
rc = rs->sr_err; |
} |
} |
|
|
return SLAP_CB_CONTINUE; |
return rc; |
} |
} |
#endif |
|
|
|
static int |
static int |
syncprov_op_mod( Operation *op, SlapReply *rs ) |
syncprov_op_mod( Operation *op, SlapReply *rs ) |
{ |
{ |
Line 1158 syncprov_op_mod( Operation *op, SlapRepl
|
Line 1622 syncprov_op_mod( Operation *op, SlapRepl
|
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
ldap_pvt_thread_yield(); |
ldap_pvt_thread_yield(); |
ldap_pvt_thread_mutex_lock( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_lock( &mt->mt_mutex ); |
|
|
|
/* clean up if the caller is giving up */ |
|
if ( op->o_abandon ) { |
|
modinst *m2; |
|
for ( m2 = mt->mt_mods; m2->mi_next != mi; |
|
m2 = m2->mi_next ); |
|
m2->mi_next = mi->mi_next; |
|
if ( mt->mt_tail == mi ) mt->mt_tail = m2; |
|
op->o_tmpfree( cb, op->o_tmpmemctx ); |
|
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
|
return SLAPD_ABANDON; |
|
} |
} |
} |
|
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
} else { |
} else { |
/* Record that we're modifying this entry now */ |
/* Record that we're modifying this entry now */ |
mt = malloc( sizeof(modtarget) ); |
mt = ch_malloc( sizeof(modtarget) ); |
mt->mt_mods = mi; |
mt->mt_mods = mi; |
mt->mt_tail = mi; |
mt->mt_tail = mi; |
mt->mt_op = mi->mi_op; |
mt->mt_op = mi->mi_op; |
Line 1169 syncprov_op_mod( Operation *op, SlapRepl
|
Line 1646 syncprov_op_mod( Operation *op, SlapRepl
|
avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error ); |
avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error ); |
ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex ); |
ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex ); |
} |
} |
|
|
if ( op->o_tag != LDAP_REQ_ADD ) |
|
syncprov_matchops( op, opc, 1 ); |
|
} |
} |
|
|
|
if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD ) |
|
syncprov_matchops( op, opc, 1 ); |
|
|
return SLAP_CB_CONTINUE; |
return SLAP_CB_CONTINUE; |
} |
} |
|
|
Line 1189 syncprov_op_extended( Operation *op, Sla
|
Line 1666 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; |
|
int ss_present; |
|
struct berval ss_ctxcsn; |
|
char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
} searchstate; |
} searchstate; |
|
|
static int |
static int |
syncprov_search_cleanup( Operation *op, SlapReply *rs ) |
syncprov_search_cleanup( Operation *op, SlapReply *rs ) |
{ |
{ |
searchstate *ss = op->o_callback->sc_private; |
|
if ( rs->sr_ctrls ) { |
if ( rs->sr_ctrls ) { |
free( rs->sr_ctrls[0] ); |
op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx ); |
op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx ); |
op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx ); |
|
rs->sr_ctrls = NULL; |
} |
} |
return 0; |
return 0; |
} |
} |
|
|
static void |
static void |
syncprov_detach_op( Operation *op, syncops *so ) |
syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on ) |
{ |
{ |
Operation *op2; |
Operation *op2; |
int i, alen = 0; |
int i, alen = 0; |
size_t size; |
size_t size; |
char *ptr; |
char *ptr; |
|
GroupAssertion *g1, *g2; |
|
|
/* count the search attrs */ |
/* count the search attrs */ |
for (i=0; op->ors_attrs && op->ors_attrs[i].an_name.bv_val; i++) { |
for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) { |
alen += op->ors_attrs[i].an_name.bv_len + 1; |
alen += op->ors_attrs[i].an_name.bv_len + 1; |
} |
} |
/* Make a new copy of the operation */ |
/* Make a new copy of the operation */ |
Line 1221 syncprov_detach_op( Operation *op, synco
|
Line 1702 syncprov_detach_op( Operation *op, synco
|
op->o_req_ndn.bv_len + 1 + |
op->o_req_ndn.bv_len + 1 + |
op->o_ndn.bv_len + 1 + |
op->o_ndn.bv_len + 1 + |
so->s_filterstr.bv_len + 1; |
so->s_filterstr.bv_len + 1; |
op2 = (Operation *)ch_malloc( size ); |
op2 = (Operation *)ch_calloc( 1, size ); |
*op2 = *op; |
|
op2->o_hdr = (Opheader *)(op2+1); |
op2->o_hdr = (Opheader *)(op2+1); |
|
|
|
/* Copy the fields we care about explicitly, leave the rest alone */ |
*op2->o_hdr = *op->o_hdr; |
*op2->o_hdr = *op->o_hdr; |
|
op2->o_tag = op->o_tag; |
|
op2->o_time = op->o_time; |
|
op2->o_bd = on->on_info->oi_origdb; |
|
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); |
ptr = (char *)(op2->ors_attrs+i+1); |
ptr = (char *)(op2->ors_attrs+i+1); |
for (i=0; op->ors_attrs[i].an_name.bv_val; i++) { |
for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) { |
op2->ors_attrs[i] = op->ors_attrs[i]; |
op2->ors_attrs[i] = op->ors_attrs[i]; |
op2->ors_attrs[i].an_name.bv_val = ptr; |
op2->ors_attrs[i].an_name.bv_val = ptr; |
ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1; |
ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1; |
} |
} |
op2->ors_attrs[i].an_name.bv_val = NULL; |
BER_BVZERO( &op2->ors_attrs[i].an_name ); |
op2->ors_attrs[i].an_name.bv_len = 0; |
|
} else { |
} else { |
ptr = (char *)(op2->o_hdr + 1); |
ptr = (char *)(op2->o_hdr + 1); |
} |
} |
|
op2->o_authz = op->o_authz; |
op2->o_ndn.bv_val = ptr; |
op2->o_ndn.bv_val = ptr; |
ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1; |
ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1; |
op2->o_dn = op2->o_ndn; |
op2->o_dn = op2->o_ndn; |
|
op2->o_req_dn.bv_len = op->o_req_dn.bv_len; |
op2->o_req_dn.bv_val = ptr; |
op2->o_req_dn.bv_val = ptr; |
ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1; |
ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1; |
|
op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len; |
op2->o_req_ndn.bv_val = ptr; |
op2->o_req_ndn.bv_val = ptr; |
ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1; |
ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1; |
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 = str2filter( ptr ); |
op2->ors_filter = str2filter( ptr ); |
op2->o_controls = NULL; |
|
op2->o_callback = NULL; |
|
so->s_op = op2; |
so->s_op = op2; |
|
|
/* Increment number of ops so that idletimeout ignores us */ |
/* Copy any cached group ACLs individually */ |
|
op2->o_groups = NULL; |
|
for ( g1=op->o_groups; g1; g1=g1->ga_next ) { |
|
g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len ); |
|
*g2 = *g1; |
|
strcpy( g2->ga_ndn, g1->ga_ndn ); |
|
g2->ga_next = op2->o_groups; |
|
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 */ |
ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex ); |
ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex ); |
op->o_conn->c_n_ops_executing++; |
op->o_conn->c_n_ops_executing++; |
op->o_conn->c_n_ops_completed--; |
op->o_conn->c_n_ops_completed--; |
|
LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next ); |
|
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 ); |
} |
} |
|
|
Line 1265 syncprov_search_response( Operation *op,
|
Line 1767 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[sync_cid]; |
|
|
|
if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) { |
if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) { |
int i; |
Attribute *a; |
if ( srs->sr_state.ctxcsn ) { |
/* If we got a referral without a referral object, there's |
Attribute *a = attr_find( rs->sr_entry->e_attrs, |
* something missing that we cannot replicate. Just ignore it. |
slap_schema.si_ad_entryCSN ); |
* The consumer will abort because we didn't send the expected |
|
* control. |
|
*/ |
|
if ( !rs->sr_entry ) { |
|
assert( rs->sr_entry != NULL ); |
|
Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 ); |
|
return SLAP_CB_CONTINUE; |
|
} |
|
a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN ); |
|
if ( a ) { |
|
/* Make sure entry is less than the snaphot'd contextCSN */ |
|
if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 ) |
|
return LDAP_SUCCESS; |
|
|
/* Don't send the ctx entry twice */ |
/* Don't send the ctx entry twice */ |
if ( bvmatch( &a->a_nvals[0], srs->sr_state.ctxcsn )) |
if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) && |
|
bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) ) |
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
Line 1285 syncprov_search_response( Operation *op,
|
Line 1800 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, |
slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn, |
&op->ors_filter->f_and->f_ava->aa_value, |
srs->sr_state.rid ); |
srs->sr_state.sid, srs->sr_state.rid ); |
|
|
|
/* Is this a regular refresh? */ |
/* Is this a regular refresh? */ |
if ( !ss->ss_so ) { |
if ( !ss->ss_so ) { |
Line 1295 syncprov_search_response( Operation *op,
|
Line 1809 syncprov_search_response( Operation *op,
|
op->o_tmpmemctx ); |
op->o_tmpmemctx ); |
rs->sr_ctrls[1] = NULL; |
rs->sr_ctrls[1] = NULL; |
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, LDAP_SYNC_REFRESH_PRESENTS ); |
0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS : |
|
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, 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 ); |
/* Flush any queued persist messages */ |
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
if ( ss->ss_so->s_res ) { |
|
syncres *sr, *srnext; |
/* Detach this Op from frontend control */ |
Entry *e; |
ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex ); |
opcookie opc; |
|
|
|
opc.son = on; |
|
ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex ); |
|
locked = 1; |
|
for (sr = ss->ss_so->s_res; sr; sr=srnext) { |
|
int rc = LDAP_SUCCESS; |
|
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 ) { |
|
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
|
rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e ); |
|
op->o_bd->bd_info = (BackendInfo *)on; |
|
} |
|
if ( rc == LDAP_SUCCESS ) |
|
syncprov_sendresp( op, &opc, ss->ss_so, e, |
|
sr->s_mode, 0 ); |
|
|
|
if ( e ) { |
|
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
|
be_entry_release_r( op, e ); |
|
op->o_bd->bd_info = (BackendInfo *)on; |
|
} |
|
ch_free( sr ); |
|
} |
|
ss->ss_so->s_res = NULL; |
|
ss->ss_so->s_restail = NULL; |
|
} |
|
|
|
/* 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 ); |
|
|
|
/* Detach this Op from frontend control */ |
syncprov_detach_op( op, ss->ss_so, on ); |
syncprov_detach_op( op, ss->ss_so ); |
ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex ); |
|
|
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
Line 1362 syncprov_op_search( Operation *op, SlapR
|
Line 1841 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; |
int gotstate = 0, nochange = 0, do_present; |
Filter *fand, *fava; |
|
syncops *sop = NULL; |
syncops *sop = NULL; |
searchstate *ss; |
searchstate *ss; |
sync_control *srs; |
sync_control *srs; |
|
struct berval ctxcsn; |
|
char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
|
|
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 1375 syncprov_op_search( Operation *op, SlapR
|
Line 1855 syncprov_op_search( Operation *op, SlapR
|
return rs->sr_err; |
return rs->sr_err; |
} |
} |
|
|
srs = op->o_controls[sync_cid]; |
do_present = si->si_nopres ? 0 : 1; |
|
|
|
srs = op->o_controls[slap_cids.sc_LDAPsync]; |
|
op->o_managedsait = SLAP_CONTROL_NONCRITICAL; |
|
|
/* If this is a persistent search, set it up right away */ |
/* If this is a persistent search, set it up right away */ |
if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) { |
if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) { |
Line 1388 syncprov_op_search( Operation *op, SlapR
|
Line 1871 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; |
so.s_flags = PS_IS_REFRESHING | PS_FIND_BASE; |
/* 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; |
Line 1404 syncprov_op_search( Operation *op, SlapR
|
Line 1887 syncprov_op_search( Operation *op, SlapR
|
sop = ch_malloc( sizeof( syncops )); |
sop = ch_malloc( sizeof( syncops )); |
*sop = so; |
*sop = so; |
ldap_pvt_thread_mutex_init( &sop->s_mutex ); |
ldap_pvt_thread_mutex_init( &sop->s_mutex ); |
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
sop->s_sid = srs->sr_state.sid; |
|
sop->s_rid = srs->sr_state.rid; |
sop->s_rid = srs->sr_state.rid; |
sop->s_next = si->si_ops; |
|
sop->s_inuse = 1; |
sop->s_inuse = 1; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
sop->s_next = si->si_ops; |
si->si_ops = sop; |
si->si_ops = sop; |
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
} |
} |
|
|
/* If we have a cookie, handle the PRESENT lookups |
/* snapshot the ctxcsn */ |
*/ |
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
if ( srs->sr_state.ctxcsn ) { |
strcpy( csnbuf, si->si_ctxcsnbuf ); |
/* Is the CSN in a valid format? */ |
ctxcsn.bv_len = si->si_ctxcsn.bv_len; |
if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) { |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
send_ldap_error( op, rs, LDAP_OTHER, "invalid sync cookie" ); |
ctxcsn.bv_val = csnbuf; |
return rs->sr_err; |
|
|
/* If we have a cookie, handle the PRESENT lookups */ |
|
if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) { |
|
sessionlog *sl; |
|
|
|
/* The cookie was validated when it was parsed, just use it */ |
|
|
|
/* If just Refreshing and nothing has changed, shortcut it */ |
|
if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) { |
|
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; |
|
} |
|
/* Do we have a sessionlog for this search? */ |
|
sl=si->si_logs; |
|
if ( sl ) { |
|
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
|
if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) { |
|
do_present = 0; |
|
/* mutex is unlocked in playlog */ |
|
syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn ); |
|
} else { |
|
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
|
} |
} |
} |
/* 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 ) { |
Line 1432 syncprov_op_search( Operation *op, SlapR
|
Line 1950 syncprov_op_search( Operation *op, SlapR
|
#endif |
#endif |
} else { |
} else { |
gotstate = 1; |
gotstate = 1; |
/* If just Refreshing and nothing has changed, shortcut it */ |
/* If changed and doing Present lookup, send Present UUIDs */ |
if ( bvmatch( srs->sr_state.ctxcsn, &si->si_ctxcsn )) { |
if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) != |
nochange = 1; |
LDAP_SUCCESS ) { |
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 ); |
|
return rs->sr_err; |
|
} |
|
goto shortcut; |
|
} else |
|
/* If context has changed, check for Present UUIDs */ |
|
if ( syncprov_findcsn( op, FIND_PRESENT ) != LDAP_SUCCESS ) { |
|
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
return rs->sr_err; |
return rs->sr_err; |
} |
} |
} |
} |
} |
} |
|
|
/* If we didn't get a cookie and we don't know our contextcsn, try to |
shortcut: |
* find it anyway. |
|
*/ |
|
if ( !gotstate && !si->si_gotcsn ) { |
|
struct berval bv = BER_BVC("1"), *old; |
|
|
|
old = srs->sr_state.ctxcsn; |
|
srs->sr_state.ctxcsn = &bv; |
|
syncprov_findcsn( op, FIND_CSN ); |
|
srs->sr_state.ctxcsn = old; |
|
} |
|
|
|
/* Append CSN range to search filter, save original filter |
/* Append CSN range to search filter, save original filter |
* for persistent search evaluation |
* for persistent search evaluation |
*/ |
*/ |
Line 1476 syncprov_op_search( Operation *op, SlapR
|
Line 1967 syncprov_op_search( Operation *op, SlapR
|
sop->s_filterstr= op->ors_filterstr; |
sop->s_filterstr= op->ors_filterstr; |
} |
} |
|
|
fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx ); |
/* If something changed, find the changes */ |
fand->f_choice = LDAP_FILTER_AND; |
if ( gotstate && !nochange ) { |
fand->f_next = NULL; |
Filter *fand, *fava; |
fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx ); |
|
fava->f_choice = LDAP_FILTER_LE; |
fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx ); |
fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx ); |
fand->f_choice = LDAP_FILTER_AND; |
fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN; |
fand->f_next = NULL; |
ber_dupbv_x( &fava->f_ava->aa_value, &si->si_ctxcsn, op->o_tmpmemctx ); |
fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx ); |
fand->f_and = fava; |
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; |
ber_dupbv_x( &fava->f_ava->aa_value, srs->sr_state.ctxcsn, op->o_tmpmemctx ); |
#ifdef LDAP_COMP_MATCH |
|
fava->f_ava->aa_cf = NULL; |
|
#endif |
|
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 ); |
|
|
|
shortcut: |
|
/* 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); |
ss = (searchstate *)(cb+1); |
ss = (searchstate *)(cb+1); |
ss->ss_on = on; |
ss->ss_on = on; |
ss->ss_so = sop; |
ss->ss_so = sop; |
|
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; |
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; |
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 |
Line 1525 shortcut:
|
Line 2021 shortcut:
|
} |
} |
|
|
static int |
static int |
syncprov_db_config( |
syncprov_operational( |
BackendDB *be, |
Operation *op, |
const char *fname, |
SlapReply *rs ) |
int lineno, |
|
int argc, |
|
char **argv |
|
) |
|
{ |
{ |
slap_overinst *on = (slap_overinst *)be->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; |
|
|
#if 0 |
if ( rs->sr_entry && |
if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) { |
dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) { |
if ( argc != 3 ) { |
|
fprintf( stderr, "%s: line %d: wrong number of arguments in " |
if ( SLAP_OPATTRS( rs->sr_attr_flags ) || |
"\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno ); |
ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) { |
return -1; |
Attribute *a, **ap = NULL; |
|
|
|
for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) { |
|
if ( a->a_desc == slap_schema.si_ad_contextCSN ) |
|
break; |
|
} |
|
|
|
if ( !a ) { |
|
for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next ); |
|
|
|
a = ch_malloc( sizeof(Attribute)); |
|
a->a_desc = slap_schema.si_ad_contextCSN; |
|
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 ) { |
|
strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf ); |
|
} else { |
|
ber_dupbv( &a->a_vals[0], &si->si_ctxcsn ); |
|
} |
|
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
} |
} |
si->si_chkops = atoi( argv[1] ); |
} |
si->si_chktime = atoi( argv[2] ) * 60; |
return SLAP_CB_CONTINUE; |
|
} |
|
|
} else { |
enum { |
return SLAP_CONF_UNKNOWN; |
SP_CHKPT = 1, |
|
SP_SESSL, |
|
SP_NOPRES |
|
}; |
|
|
|
static ConfigDriver sp_cf_gen; |
|
|
|
static ConfigTable spcfg[] = { |
|
{ "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT, |
|
sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' " |
|
"DESC 'ContextCSN checkpoint interval in ops and minutes' " |
|
"SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL }, |
|
{ "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL, |
|
sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' " |
|
"DESC 'Session log size in ops' " |
|
"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 }, |
|
{ NULL, NULL, 0, 0, 0, ARG_IGNORED } |
|
}; |
|
|
|
static ConfigOCs spocs[] = { |
|
{ "( OLcfgOvOc:1.1 " |
|
"NAME 'olcSyncProvConfig' " |
|
"DESC 'SyncRepl Provider configuration' " |
|
"SUP olcOverlayConfig " |
|
"MAY ( olcSpCheckpoint $ olcSpSessionlog $ olcSpNoPresent ) )", |
|
Cft_Overlay, spcfg }, |
|
{ NULL, 0, NULL } |
|
}; |
|
|
|
static int |
|
sp_cf_gen(ConfigArgs *c) |
|
{ |
|
slap_overinst *on = (slap_overinst *)c->bi; |
|
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
|
int rc = 0; |
|
|
|
if ( c->op == SLAP_CONFIG_EMIT ) { |
|
switch ( c->type ) { |
|
case SP_CHKPT: |
|
if ( si->si_chkops || si->si_chktime ) { |
|
struct berval bv; |
|
bv.bv_len = sprintf( c->msg, "%d %d", |
|
si->si_chkops, si->si_chktime ); |
|
bv.bv_val = c->msg; |
|
value_add_one( &c->rvalue_vals, &bv ); |
|
} else { |
|
rc = 1; |
|
} |
|
break; |
|
case SP_SESSL: |
|
if ( si->si_logs ) { |
|
c->value_int = si->si_logs->sl_size; |
|
} else { |
|
rc = 1; |
|
} |
|
break; |
|
case SP_NOPRES: |
|
if ( si->si_nopres ) { |
|
c->value_int = 1; |
|
} else { |
|
rc = 1; |
|
} |
|
break; |
|
} |
|
return rc; |
|
} else if ( c->op == LDAP_MOD_DELETE ) { |
|
switch ( c->type ) { |
|
case SP_CHKPT: |
|
si->si_chkops = 0; |
|
si->si_chktime = 0; |
|
break; |
|
case SP_SESSL: |
|
if ( si->si_logs ) |
|
si->si_logs->sl_size = 0; |
|
else |
|
rc = LDAP_NO_SUCH_ATTRIBUTE; |
|
break; |
|
case SP_NOPRES: |
|
if ( si->si_nopres ) |
|
si->si_nopres = 0; |
|
else |
|
rc = LDAP_NO_SUCH_ATTRIBUTE; |
|
break; |
|
} |
|
return rc; |
|
} |
|
switch ( c->type ) { |
|
case SP_CHKPT: |
|
si->si_chkops = atoi( c->argv[1] ); |
|
si->si_chktime = atoi( c->argv[2] ) * 60; |
|
break; |
|
case SP_SESSL: { |
|
sessionlog *sl; |
|
int size = c->value_int; |
|
|
|
if ( size < 0 ) { |
|
sprintf( c->msg, "%s size %d is negative", |
|
c->argv[0], size ); |
|
Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 ); |
|
return ARG_BAD_CONF; |
|
} |
|
sl = si->si_logs; |
|
if ( !sl ) { |
|
sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE ); |
|
sl->sl_mincsn.bv_val = (char *)(sl+1); |
|
sl->sl_mincsn.bv_len = 0; |
|
sl->sl_num = 0; |
|
sl->sl_head = sl->sl_tail = NULL; |
|
ldap_pvt_thread_mutex_init( &sl->sl_mutex ); |
|
si->si_logs = sl; |
|
} |
|
sl->sl_size = size; |
|
} |
|
break; |
|
case SP_NOPRES: |
|
si->si_nopres = c->value_int; |
|
break; |
|
} |
|
return rc; |
|
} |
|
|
|
/* ITS#3456 we cannot run this search on the main thread, must use a |
|
* child thread in order to insure we have a big enough stack. |
|
*/ |
|
static void * |
|
syncprov_db_otask( |
|
void *ptr |
|
) |
|
{ |
|
syncprov_findcsn( ptr, FIND_MAXCSN ); |
|
return NULL; |
|
} |
|
|
|
/* Read any existing contextCSN from the underlying db. |
|
* Then search for any entries newer than that. If no value exists, |
|
* just generate it. Cache whatever result. |
|
*/ |
|
static int |
|
syncprov_db_open( |
|
BackendDB *be |
|
) |
|
{ |
|
slap_overinst *on = (slap_overinst *) be->bd_info; |
|
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
|
|
|
Connection conn; |
|
char opbuf[OPERATION_BUFFER_SIZE]; |
|
char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
|
Operation *op = (Operation *)opbuf; |
|
Entry *e; |
|
Attribute *a; |
|
int rc; |
|
void *thrctx = NULL; |
|
|
|
if ( slapMode & SLAP_TOOL_MODE ) { |
|
return 0; |
|
} |
|
|
|
rc = overlay_register_control( be, LDAP_CONTROL_SYNC ); |
|
if ( rc ) { |
|
return rc; |
|
} |
|
|
|
thrctx = ldap_pvt_thread_pool_context(); |
|
connection_fake_init( &conn, op, thrctx ); |
|
op->o_bd = be; |
|
op->o_dn = be->be_rootdn; |
|
op->o_ndn = be->be_rootndn; |
|
|
|
ctxcsnbuf[0] = '\0'; |
|
|
|
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 ) { |
|
ldap_pvt_thread_t tid; |
|
|
|
a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN ); |
|
if ( a ) { |
|
si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len; |
|
if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf )) |
|
si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1; |
|
strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val, |
|
si->si_ctxcsn.bv_len ); |
|
si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0'; |
|
strcpy( ctxcsnbuf, si->si_ctxcsnbuf ); |
|
} |
|
be_entry_release_rw( op, e, 0 ); |
|
op->o_bd->bd_info = (BackendInfo *)on; |
|
op->o_req_dn = be->be_suffix[0]; |
|
op->o_req_ndn = be->be_nsuffix[0]; |
|
op->ors_scope = LDAP_SCOPE_SUBTREE; |
|
ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op ); |
|
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 ) ) { |
|
slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf), |
|
&si->si_ctxcsn, 0 ); |
} |
} |
#endif |
|
|
|
return SLAP_CONF_UNKNOWN; |
/* If our ctxcsn is different from what was read from the root |
|
* entry, make sure we do a checkpoint on close |
|
*/ |
|
if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) { |
|
si->si_numops++; |
|
} |
|
|
|
out: |
|
op->o_bd->bd_info = (BackendInfo *)on; |
|
ldap_pvt_thread_pool_context_reset( thrctx ); |
|
return 0; |
|
} |
|
|
|
/* Write the current contextCSN into the underlying db. |
|
*/ |
|
static int |
|
syncprov_db_close( |
|
BackendDB *be |
|
) |
|
{ |
|
slap_overinst *on = (slap_overinst *) be->bd_info; |
|
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
|
|
|
if ( slapMode & SLAP_TOOL_MODE ) { |
|
return 0; |
|
} |
|
if ( si->si_numops ) { |
|
Connection conn; |
|
char opbuf[OPERATION_BUFFER_SIZE]; |
|
Operation *op = (Operation *)opbuf; |
|
SlapReply rs = {REP_RESULT}; |
|
void *thrctx; |
|
|
|
thrctx = ldap_pvt_thread_pool_context(); |
|
connection_fake_init( &conn, op, thrctx ); |
|
op->o_bd = be; |
|
op->o_dn = be->be_rootdn; |
|
op->o_ndn = be->be_rootndn; |
|
syncprov_checkpoint( op, &rs, on ); |
|
ldap_pvt_thread_pool_context_reset( thrctx ); |
|
} |
|
|
|
return 0; |
} |
} |
|
|
static int |
static int |
Line 1566 syncprov_db_init(
|
Line 2335 syncprov_db_init(
|
on->on_bi.bi_private = si; |
on->on_bi.bi_private = si; |
ldap_pvt_thread_mutex_init( &si->si_csn_mutex ); |
ldap_pvt_thread_mutex_init( &si->si_csn_mutex ); |
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 ); |
si->si_ctxcsn.bv_val = si->si_ctxcsnbuf; |
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; |
|
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 1586 syncprov_db_destroy(
|
Line 2358 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 ) { |
|
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 ); |
ch_free( si ); |
ch_free( si ); |
Line 1600 static int syncprov_parseCtrl (
|
Line 2373 static int syncprov_parseCtrl (
|
LDAPControl *ctrl ) |
LDAPControl *ctrl ) |
{ |
{ |
ber_tag_t tag; |
ber_tag_t tag; |
BerElement *ber; |
BerElementBuffer berbuf; |
|
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 1617 static int syncprov_parseCtrl (
|
Line 2391 static int syncprov_parseCtrl (
|
return LDAP_PROTOCOL_ERROR; |
return LDAP_PROTOCOL_ERROR; |
} |
} |
|
|
if ( ctrl->ldctl_value.bv_len == 0 ) { |
if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) { |
rs->sr_text = "Sync control value is empty (or absent)"; |
rs->sr_text = "Sync control value is empty (or absent)"; |
return LDAP_PROTOCOL_ERROR; |
return LDAP_PROTOCOL_ERROR; |
} |
} |
Line 1634 static int syncprov_parseCtrl (
|
Line 2408 static int syncprov_parseCtrl (
|
* } |
* } |
*/ |
*/ |
|
|
ber = ber_init( &ctrl->ldctl_value ); |
ber_init2( ber, &ctrl->ldctl_value, 0 ); |
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 1660 static int syncprov_parseCtrl (
|
Line 2430 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, /*{*/ "o", &cookie )) == LBER_ERROR ) { |
if (( ber_scanf( ber, /*{*/ "m", &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; |
} |
} |
Line 1678 static int syncprov_parseCtrl (
|
Line 2448 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_bvarray_add( &sr->sr_state.octet_str, &cookie ); |
ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx ); |
slap_parse_sync_cookie( &sr->sr_state ); |
slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx ); |
|
if ( sr->sr_state.rid == -1 ) { |
|
rs->sr_text = "Sync control : cookie parsing error"; |
|
return LDAP_PROTOCOL_ERROR; |
|
} |
} |
} |
|
|
op->o_controls[sync_cid] = 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 |
Line 1709 syncprov_init()
|
Line 2481 syncprov_init()
|
|
|
rc = register_supported_control( LDAP_CONTROL_SYNC, |
rc = register_supported_control( LDAP_CONTROL_SYNC, |
SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL, |
SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL, |
syncprov_parseCtrl, &sync_cid ); |
syncprov_parseCtrl, &slap_cids.sc_LDAPsync ); |
if ( rc != LDAP_SUCCESS ) { |
if ( rc != LDAP_SUCCESS ) { |
fprintf( stderr, "Failed to register control %d\n", rc ); |
Debug( LDAP_DEBUG_ANY, |
|
"syncprov_init: Failed to register control %d\n", rc, 0, 0 ); |
return rc; |
return rc; |
} |
} |
|
|
syncprov.on_bi.bi_type = "syncprov"; |
syncprov.on_bi.bi_type = "syncprov"; |
syncprov.on_bi.bi_db_init = syncprov_db_init; |
syncprov.on_bi.bi_db_init = syncprov_db_init; |
syncprov.on_bi.bi_db_config = syncprov_db_config; |
|
syncprov.on_bi.bi_db_destroy = syncprov_db_destroy; |
syncprov.on_bi.bi_db_destroy = syncprov_db_destroy; |
|
syncprov.on_bi.bi_db_open = syncprov_db_open; |
|
syncprov.on_bi.bi_db_close = syncprov_db_close; |
|
|
syncprov.on_bi.bi_op_abandon = syncprov_op_abandon; |
syncprov.on_bi.bi_op_abandon = syncprov_op_abandon; |
syncprov.on_bi.bi_op_cancel = syncprov_op_abandon; |
syncprov.on_bi.bi_op_cancel = syncprov_op_abandon; |
|
|
syncprov.on_bi.bi_op_add = syncprov_op_mod; |
syncprov.on_bi.bi_op_add = syncprov_op_mod; |
#if 0 |
|
syncprov.on_bi.bi_op_compare = syncprov_op_compare; |
syncprov.on_bi.bi_op_compare = syncprov_op_compare; |
#endif |
|
syncprov.on_bi.bi_op_delete = syncprov_op_mod; |
syncprov.on_bi.bi_op_delete = syncprov_op_mod; |
syncprov.on_bi.bi_op_modify = syncprov_op_mod; |
syncprov.on_bi.bi_op_modify = syncprov_op_mod; |
syncprov.on_bi.bi_op_modrdn = syncprov_op_mod; |
syncprov.on_bi.bi_op_modrdn = syncprov_op_mod; |
syncprov.on_bi.bi_op_search = syncprov_op_search; |
syncprov.on_bi.bi_op_search = syncprov_op_search; |
syncprov.on_bi.bi_extended = syncprov_op_extended; |
syncprov.on_bi.bi_extended = syncprov_op_extended; |
|
syncprov.on_bi.bi_operational = syncprov_operational; |
|
|
#if 0 |
syncprov.on_bi.bi_cf_ocs = spocs; |
syncprov.on_response = syncprov_response; |
|
#endif |
rc = config_register_schema( spcfg, spocs ); |
|
if ( rc ) return rc; |
|
|
return overlay_register( &syncprov ); |
return overlay_register( &syncprov ); |
} |
} |