version 1.22, 2004/11/27 06:29:10
|
version 1.147.2.92, 2011/01/31 19:05:48
|
Line 1
|
Line 1
|
|
/* $OpenLDAP$ */ |
/* 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-2011 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" |
|
|
|
#ifdef LDAP_DEVEL |
|
#define CHECK_CSN 1 |
|
#endif |
|
|
/* A modify request on a particular entry */ |
/* A modify request on a particular entry */ |
typedef struct modinst { |
typedef struct modinst { |
Line 41 typedef struct modtarget {
|
Line 48 typedef struct modtarget {
|
/* A queued result of a persistent search */ |
/* A queued result of a persistent search */ |
typedef struct syncres { |
typedef struct syncres { |
struct syncres *s_next; |
struct syncres *s_next; |
|
Entry *s_e; |
struct berval s_dn; |
struct berval s_dn; |
struct berval s_ndn; |
struct berval s_ndn; |
struct berval s_uuid; |
struct berval s_uuid; |
Line 55 typedef struct syncops {
|
Line 63 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; |
int s_sid; |
struct berval s_filterstr; |
struct berval s_filterstr; |
int s_flags; /* search status */ |
int s_flags; /* search status */ |
|
#define PS_IS_REFRESHING 0x01 |
|
#define PS_IS_DETACHED 0x02 |
|
#define PS_WROTE_BASE 0x04 |
|
#define PS_FIND_BASE 0x08 |
|
#define PS_FIX_FILTER 0x10 |
|
#define PS_TASK_QUEUED 0x20 |
|
|
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; |
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; |
|
int se_sid; |
|
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 */ |
BerVarray si_ctxcsn; /* ldapsync context */ |
int si_gotcsn; /* is our ctxcsn up to date? */ |
struct berval si_contextdn; |
|
int *si_sids; |
|
int si_numcsns; |
|
int si_chkops; /* checkpointing info */ |
|
int si_chktime; |
|
int si_numops; /* number of ops since last checkpoint */ |
|
int si_nopres; /* Skip present phase */ |
|
int si_usehint; /* use reload hint */ |
|
int si_active; /* True if there are active mods */ |
|
int si_dirty; /* True if the context is dirty, i.e changes |
|
* have been made without updating the csn. */ |
|
time_t si_chklast; /* time of last checkpoint */ |
Avlnode *si_mods; /* entries being modified */ |
Avlnode *si_mods; /* entries being modified */ |
ldap_pvt_thread_mutex_t si_csn_mutex; |
sessionlog *si_logs; |
|
ldap_pvt_thread_rdwr_t si_csn_rwlock; |
ldap_pvt_thread_mutex_t si_ops_mutex; |
ldap_pvt_thread_mutex_t si_ops_mutex; |
ldap_pvt_thread_mutex_t si_mods_mutex; |
ldap_pvt_thread_mutex_t si_mods_mutex; |
char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
ldap_pvt_thread_mutex_t si_resp_mutex; |
} syncprov_info_t; |
} syncprov_info_t; |
|
|
typedef struct opcookie { |
typedef struct opcookie { |
slap_overinst *son; |
slap_overinst *son; |
syncmatches *smatches; |
syncmatches *smatches; |
|
modtarget *smt; |
|
Entry *se; |
struct berval sdn; /* DN of entry, for deletes */ |
struct berval sdn; /* DN of entry, for deletes */ |
struct berval sndn; |
struct berval sndn; |
struct berval suuid; /* UUID of entry */ |
struct berval suuid; /* UUID of entry */ |
struct berval sctxcsn; |
struct berval sctxcsn; |
int sreference; /* Is the entry a reference? */ |
short osid; /* sid of op csn */ |
|
short rsid; /* sid of relay */ |
|
short sreference; /* Is the entry a reference? */ |
} opcookie; |
} opcookie; |
|
|
|
typedef struct mutexint { |
|
ldap_pvt_thread_mutex_t mi_mutex; |
|
int mi_int; |
|
} mutexint; |
|
|
typedef struct fbase_cookie { |
typedef struct fbase_cookie { |
struct berval *fdn; /* DN of a modified entry, for scope testing */ |
struct berval *fdn; /* DN of a modified entry, for scope testing */ |
syncops *fss; /* persistent search we're testing against */ |
syncops *fss; /* persistent search we're testing against */ |
Line 119 typedef struct fbase_cookie {
|
Line 171 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 180 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 207 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 173 syncprov_state_ctrl(
|
Line 225 syncprov_state_ctrl(
|
|
|
if ( ret < 0 ) { |
if ( ret < 0 ) { |
Debug( LDAP_DEBUG_TRACE, |
Debug( LDAP_DEBUG_TRACE, |
"slap_build_sync_ctrl: ber_flatten2 failed\n", |
"slap_build_sync_ctrl: ber_flatten2 failed (%d)\n", |
0, 0, 0 ); |
ret, 0, 0 ); |
send_ldap_error( op, rs, LDAP_OTHER, "internal error" ); |
send_ldap_error( op, rs, LDAP_OTHER, "internal error" ); |
return ret; |
return LDAP_OTHER; |
} |
} |
|
|
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
Line 200 syncprov_done_ctrl(
|
Line 252 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 261 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 219 syncprov_done_ctrl(
|
Line 271 syncprov_done_ctrl(
|
|
|
if ( ret < 0 ) { |
if ( ret < 0 ) { |
Debug( LDAP_DEBUG_TRACE, |
Debug( LDAP_DEBUG_TRACE, |
"syncprov_done_ctrl: ber_flatten2 failed\n", |
"syncprov_done_ctrl: ber_flatten2 failed (%d)\n", |
0, 0, 0 ); |
ret, 0, 0 ); |
send_ldap_error( op, rs, LDAP_OTHER, "internal error" ); |
|
return ret; |
|
} |
|
|
|
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" ); |
send_ldap_error( op, rs, LDAP_OTHER, "internal error" ); |
return ret; |
return LDAP_OTHER; |
} |
} |
|
|
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
#endif |
|
|
|
static int |
static int |
syncprov_sendinfo( |
syncprov_sendinfo( |
Line 342 syncprov_sendinfo(
|
Line 338 syncprov_sendinfo(
|
|
|
if ( ret < 0 ) { |
if ( ret < 0 ) { |
Debug( LDAP_DEBUG_TRACE, |
Debug( LDAP_DEBUG_TRACE, |
"syncprov_sendinfo: ber_flatten2 failed\n", |
"syncprov_sendinfo: ber_flatten2 failed (%d)\n", |
0, 0, 0 ); |
ret, 0, 0 ); |
send_ldap_error( op, rs, LDAP_OTHER, "internal error" ); |
send_ldap_error( op, rs, LDAP_OTHER, "internal error" ); |
return ret; |
return LDAP_OTHER; |
} |
} |
|
|
rs->sr_rspoid = LDAP_SYNC_INFO; |
rs->sr_rspoid = LDAP_SYNC_INFO; |
Line 392 findbase_cb( Operation *op, SlapReply *r
|
Line 388 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; |
} |
} |
|
|
|
static Filter generic_filter = { LDAP_FILTER_PRESENT, { 0 }, NULL }; |
|
static struct berval generic_filterstr = BER_BVC("(objectclass=*)"); |
|
|
static int |
static int |
syncprov_findbase( Operation *op, fbase_cookie *fc ) |
syncprov_findbase( Operation *op, fbase_cookie *fc ) |
{ |
{ |
opcookie *opc = op->o_callback->sc_private; |
/* Use basic parameters from syncrepl search, but use |
slap_overinst *on = opc->son; |
* current op's threadctx / tmpmemctx |
syncprov_info_t *si = on->on_bi.bi_private; |
*/ |
|
ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex ); |
slap_callback cb = {0}; |
if ( fc->fss->s_flags & PS_FIND_BASE ) { |
Operation fop; |
slap_callback cb = {0}; |
SlapReply frs = { REP_RESULT }; |
Operation fop; |
int rc; |
SlapReply frs = { REP_RESULT }; |
|
int rc; |
fop = *op; |
|
|
fc->fss->s_flags ^= PS_FIND_BASE; |
|
ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex ); |
|
|
|
fop = *fc->fss->s_op; |
|
|
|
fop.o_bd = fop.o_bd->bd_self; |
|
fop.o_hdr = op->o_hdr; |
|
fop.o_time = op->o_time; |
|
fop.o_tincr = op->o_tincr; |
|
|
cb.sc_response = findbase_cb; |
cb.sc_response = findbase_cb; |
cb.sc_private = fc; |
cb.sc_private = fc; |
|
|
fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */ |
fop.o_sync_mode = 0; /* turn off sync mode */ |
fop.o_callback = &cb; |
fop.o_managedsait = SLAP_CONTROL_CRITICAL; |
fop.o_tag = LDAP_REQ_SEARCH; |
fop.o_callback = &cb; |
fop.ors_scope = LDAP_SCOPE_BASE; |
fop.o_tag = LDAP_REQ_SEARCH; |
fop.ors_deref = fc->fss->s_op->ors_deref; |
fop.ors_scope = LDAP_SCOPE_BASE; |
fop.ors_slimit = 1; |
fop.ors_limit = NULL; |
fop.ors_tlimit = SLAP_NO_LIMIT; |
fop.ors_slimit = 1; |
fop.ors_attrs = slap_anlist_no_attrs; |
fop.ors_tlimit = SLAP_NO_LIMIT; |
fop.ors_attrsonly = 1; |
fop.ors_attrs = slap_anlist_no_attrs; |
fop.ors_filter = fc->fss->s_op->ors_filter; |
fop.ors_attrsonly = 1; |
fop.ors_filterstr = fc->fss->s_op->ors_filterstr; |
fop.ors_filter = &generic_filter; |
|
fop.ors_filterstr = generic_filterstr; |
|
|
fop.o_req_ndn = fc->fss->s_op->o_req_ndn; |
rc = fop.o_bd->be_search( &fop, &frs ); |
|
} 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; |
|
case LDAP_SCOPE_SUBORDINATE: |
|
fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) && |
|
!dn_match( fc->fdn, &fc->fss->s_base ); |
|
break; |
|
} |
|
} |
|
|
if ( fc->fbase ) 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 486 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 |
typedef enum find_csn_t { |
#define FIND_PRESENT 2 |
FIND_MAXCSN = 1, |
|
FIND_CSN = 2, |
|
FIND_PRESENT = 3 |
|
} find_csn_t; |
|
|
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 && |
|
slap_parse_csn_sid( &a->a_vals[0] ) == slap_serverID ) { |
|
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 ) |
{ |
{ |
slap_callback *sc = op->o_callback; |
slap_callback *sc = op->o_callback; |
|
|
if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) { |
/* We just want to know that at least one exists, so it's OK if |
/* If the private pointer is set, it points to an fcsn_cookie |
* we exceed the unchecked limit. |
* and we want to record the maxcsn and match state. |
*/ |
*/ |
if ( rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED || |
if ( sc->sc_private ) { |
(rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS )) { |
int i; |
sc->sc_private = (void *)1; |
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 551 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, find_csn_t mode ) |
{ |
{ |
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
syncprov_info_t *si = on->on_bi.bi_private; |
syncprov_info_t *si = on->on_bi.bi_private; |
Line 582 syncprov_findcsn( Operation *op, int mod
|
Line 594 syncprov_findcsn( Operation *op, int mod
|
slap_callback cb = {0}; |
slap_callback cb = {0}; |
Operation fop; |
Operation fop; |
SlapReply frs = { REP_RESULT }; |
SlapReply frs = { REP_RESULT }; |
char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")]; |
char buf[LDAP_PVT_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")]; |
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
char cbuf[LDAP_PVT_CSNSTR_BUFSIZE]; |
struct berval fbuf; |
struct berval maxcsn; |
Filter cf; |
Filter cf; |
AttributeAssertion eq; |
AttributeAssertion eq = ATTRIBUTEASSERTION_INIT; |
int rc; |
|
fcsn_cookie fcookie; |
|
fpres_cookie pcookie; |
fpres_cookie pcookie; |
int locked = 0; |
sync_control *srs = NULL; |
sync_control *srs = op->o_controls[sync_cid]; |
struct slap_limits_set fc_limits; |
|
int i, rc = LDAP_SUCCESS, findcsn_retry = 1; |
|
int maxid; |
|
|
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]; |
} |
} |
|
|
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 ) { |
BER_BVZERO( &cf.f_av_value ); |
/* If we don't know the current ctxcsn, find it */ |
cf.f_next = NULL; |
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
|
locked = 1; |
fop.o_callback = &cb; |
} |
fop.ors_limit = NULL; |
if ( !si->si_gotcsn ) { |
fop.ors_tlimit = SLAP_NO_LIMIT; |
cf.f_choice = LDAP_FILTER_GE; |
fop.ors_filter = &cf; |
fop.ors_attrsonly = 0; |
fop.ors_filterstr.bv_val = buf; |
fop.ors_attrs = csn_anlist; |
|
fop.ors_slimit = SLAP_NO_LIMIT; |
again: |
cb.sc_private = &fcookie; |
switch( mode ) { |
fcookie.maxcsn.bv_val = cbuf; |
case FIND_MAXCSN: |
fcookie.maxcsn.bv_len = 0; |
cf.f_choice = LDAP_FILTER_GE; |
fcookie.gotmatch = 0; |
/* If there are multiple CSNs, use the one with our serverID */ |
fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)", srs->sr_state.ctxcsn->bv_val ); |
for ( i=0; i<si->si_numcsns; i++) { |
} else { |
if ( slap_serverID == si->si_sids[i] ) { |
if ( locked ) { |
maxid = i; |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
break; |
locked = 0; |
} |
|
} |
|
if ( i == si->si_numcsns ) { |
|
/* No match: this is multimaster, and none of the content in the DB |
|
* originated locally. Treat like no CSN. |
|
*/ |
|
return LDAP_NO_SUCH_OBJECT; |
|
} |
|
cf.f_av_value = si->si_ctxcsn[maxid]; |
|
fop.ors_filterstr.bv_len = snprintf( buf, sizeof( buf ), |
|
"(entryCSN>=%s)", cf.f_av_value.bv_val ); |
|
if ( fop.ors_filterstr.bv_len >= sizeof( buf ) ) { |
|
return LDAP_OTHER; |
|
} |
|
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, cf.f_av_value.bv_val ); |
|
maxcsn.bv_val = cbuf; |
|
maxcsn.bv_len = cf.f_av_value.bv_len; |
|
break; |
|
case FIND_CSN: |
|
if ( BER_BVISEMPTY( &cf.f_av_value )) { |
|
cf.f_av_value = srs->sr_state.ctxcsn[0]; |
|
/* If there are multiple CSNs, use the smallest */ |
|
for ( i=1; i<srs->sr_state.numcsns; i++ ) { |
|
if ( ber_bvcmp( &cf.f_av_value, &srs->sr_state.ctxcsn[i] ) |
|
> 0 ) { |
|
cf.f_av_value = srs->sr_state.ctxcsn[i]; |
|
} |
} |
} |
|
} |
|
/* Look for exact match the first time */ |
|
if ( findcsn_retry ) { |
|
cf.f_choice = LDAP_FILTER_EQUALITY; |
|
fop.ors_filterstr.bv_len = snprintf( buf, sizeof( buf ), |
|
"(entryCSN=%s)", cf.f_av_value.bv_val ); |
|
/* On retry, look for <= */ |
|
} else { |
cf.f_choice = LDAP_FILTER_LE; |
cf.f_choice = LDAP_FILTER_LE; |
fop.ors_attrsonly = 1; |
fop.ors_limit = &fc_limits; |
fop.ors_attrs = slap_anlist_no_attrs; |
memset( &fc_limits, 0, sizeof( fc_limits )); |
fop.ors_slimit = 1; |
fc_limits.lms_s_unchecked = 1; |
cb.sc_private = NULL; |
fop.ors_filterstr.bv_len = snprintf( buf, sizeof( buf ), |
fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)", srs->sr_state.ctxcsn->bv_val ); |
"(entryCSN<=%s)", cf.f_av_value.bv_val ); |
|
} |
|
if ( fop.ors_filterstr.bv_len >= sizeof( buf ) ) { |
|
return LDAP_OTHER; |
} |
} |
|
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: |
cf.f_choice = LDAP_FILTER_LE; |
fop.ors_filter = op->ors_filter; |
|
fop.ors_filterstr = op->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 = (BackendInfo *)on->on_info; |
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); |
if ( ber_bvcmp( &si->si_ctxcsn[maxid], &maxcsn )) { |
si->si_ctxcsn.bv_len = fcookie.maxcsn.bv_len; |
#ifdef CHECK_CSN |
si->si_gotcsn = 1; |
Syntax *syn = slap_schema.si_ad_contextCSN->ad_type->sat_syntax; |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
assert( !syn->ssyn_validate( syn, &maxcsn )); |
if ( fcookie.gotmatch ) return LDAP_SUCCESS; |
#endif |
|
ber_bvreplace( &si->si_ctxcsn[maxid], &maxcsn ); |
} else { |
si->si_numops++; /* ensure a checkpoint */ |
if ( cb.sc_private ) return LDAP_SUCCESS; |
|
} |
} |
} else if ( mode == FIND_PRESENT ) { |
break; |
return LDAP_SUCCESS; |
case FIND_CSN: |
|
/* If matching CSN was not found, invalidate the context. */ |
|
if ( !cb.sc_private ) { |
|
/* If we didn't find an exact match, then try for <= */ |
|
if ( findcsn_retry ) { |
|
findcsn_retry = 0; |
|
rs_reinit( &frs, REP_RESULT ); |
|
goto again; |
|
} |
|
rc = LDAP_NO_SUCH_OBJECT; |
|
} |
|
break; |
|
case FIND_PRESENT: |
|
op->o_tmpfree( pcookie.uuids, 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 */ |
/* Should find a place to cache these */ |
static int |
static mutexint *get_mutexint() |
syncprov_qresp( opcookie *opc, syncops *so, int mode ) |
|
{ |
{ |
syncres *sr; |
mutexint *mi = ch_malloc( sizeof( mutexint )); |
|
ldap_pvt_thread_mutex_init( &mi->mi_mutex ); |
|
mi->mi_int = 1; |
|
return mi; |
|
} |
|
|
sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 + |
static void inc_mutexint( mutexint *mi ) |
opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 ); |
{ |
sr->s_next = NULL; |
ldap_pvt_thread_mutex_lock( &mi->mi_mutex ); |
sr->s_dn.bv_val = (char *)(sr + 1); |
mi->mi_int++; |
sr->s_mode = mode; |
ldap_pvt_thread_mutex_unlock( &mi->mi_mutex ); |
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 ) { |
/* return resulting counter */ |
so->s_res = sr; |
static int dec_mutexint( mutexint *mi ) |
} else { |
{ |
so->s_restail->s_next = sr; |
int i; |
|
ldap_pvt_thread_mutex_lock( &mi->mi_mutex ); |
|
i = --mi->mi_int; |
|
ldap_pvt_thread_mutex_unlock( &mi->mi_mutex ); |
|
if ( !i ) { |
|
ldap_pvt_thread_mutex_destroy( &mi->mi_mutex ); |
|
ch_free( mi ); |
|
} |
|
return i; |
|
} |
|
|
|
static void |
|
syncprov_free_syncop( syncops *so ) |
|
{ |
|
syncres *sr, *srnext; |
|
GroupAssertion *ga, *gnext; |
|
|
|
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
|
/* already being freed, or still in use */ |
|
if ( !so->s_inuse || --so->s_inuse > 0 ) { |
|
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
|
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; |
|
if ( sr->s_e ) { |
|
if ( !dec_mutexint( sr->s_e->e_private )) { |
|
sr->s_e->e_private = NULL; |
|
entry_free( sr->s_e ); |
|
} |
|
} |
|
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, int mode ) |
{ |
{ |
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 = BER_BVNULL, csns[2]; |
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) ) { |
ctrls[1] = NULL; |
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
if ( !BER_BVISNULL( &opc->sctxcsn )) { |
if ( so->s_flags & PS_IS_REFRESHING ) |
csns[0] = opc->sctxcsn; |
return syncprov_qresp( opc, so, mode ); |
BER_BVZERO( &csns[1] ); |
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
slap_compose_sync_cookie( op, &cookie, csns, so->s_rid, slap_serverID ? slap_serverID : -1 ); |
} |
} |
|
|
ctrls[1] = NULL; |
#ifdef LDAP_DEBUG |
slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, |
if ( so->s_sid > 0 ) { |
so->s_sid, so->s_rid ); |
Debug( LDAP_DEBUG_SYNC, "syncprov_sendresp: to=%03x, cookie=%s\n", |
|
so->s_sid, cookie.bv_val ? cookie.bv_val : "", 0 ); |
|
} else { |
|
Debug( LDAP_DEBUG_SYNC, "syncprov_sendresp: cookie=%s\n", |
|
cookie.bv_val ? cookie.bv_val : "", 0, 0 ); |
|
} |
|
#endif |
|
|
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 ); |
|
if ( !BER_BVISNULL( &cookie )) { |
|
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
|
} |
|
|
rs.sr_entry = e; |
|
rs.sr_ctrls = ctrls; |
rs.sr_ctrls = ctrls; |
|
rs.sr_entry = &e_uuid; |
|
if ( mode == LDAP_SYNC_ADD || mode == LDAP_SYNC_MODIFY ) { |
|
e_uuid = *opc->se; |
|
e_uuid.e_private = NULL; |
|
} |
|
|
switch( mode ) { |
switch( mode ) { |
case LDAP_SYNC_ADD: |
case LDAP_SYNC_ADD: |
if ( opc->sreference ) { |
if ( opc->sreference && so->s_op->o_managedsait <= SLAP_CONTROL_IGNORED ) { |
rs.sr_ref = get_entry_referrals( &sop, e ); |
rs.sr_ref = get_entry_referrals( op, rs.sr_entry ); |
send_search_reference( &sop, &rs ); |
rs.sr_err = send_search_reference( op, &rs ); |
ber_bvarray_free( rs.sr_ref ); |
ber_bvarray_free( rs.sr_ref ); |
break; |
break; |
} |
} |
/* fallthru */ |
/* fallthru */ |
case LDAP_SYNC_MODIFY: |
case LDAP_SYNC_MODIFY: |
rs.sr_attrs = sop.ors_attrs; |
rs.sr_attrs = op->ors_attrs; |
send_search_entry( &sop, &rs ); |
rs.sr_err = send_search_entry( op, &rs ); |
break; |
break; |
case LDAP_SYNC_DELETE: |
case LDAP_SYNC_DELETE: |
e_uuid.e_attrs = NULL; |
e_uuid.e_attrs = NULL; |
e_uuid.e_name = opc->sdn; |
e_uuid.e_name = opc->sdn; |
e_uuid.e_nname = opc->sndn; |
e_uuid.e_nname = opc->sndn; |
rs.sr_entry = &e_uuid; |
if ( opc->sreference && so->s_op->o_managedsait <= SLAP_CONTROL_IGNORED ) { |
if ( opc->sreference ) { |
struct berval bv = BER_BVNULL; |
struct berval bv; |
|
bv.bv_val = NULL; |
|
bv.bv_len = 0; |
|
rs.sr_ref = &bv; |
rs.sr_ref = &bv; |
send_search_reference( &sop, &rs ); |
rs.sr_err = send_search_reference( op, &rs ); |
} else { |
} else { |
send_search_entry( &sop, &rs ); |
rs.sr_err = 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 ) { |
|
int i; |
|
for ( i=0; rs.sr_ctrls[i]; i++ ) { |
|
if ( rs.sr_ctrls[i] == ctrls[0] ) { |
|
op->o_tmpfree( ctrls[0]->ldctl_value.bv_val, op->o_tmpmemctx ); |
|
ctrls[0]->ldctl_value.bv_val = NULL; |
|
break; |
|
} |
|
} |
|
rs.sr_ctrls = NULL; |
|
} |
|
|
return rs.sr_err; |
return rs.sr_err; |
} |
} |
|
|
|
static void |
|
syncprov_qstart( syncops *so ); |
|
|
|
/* Play back queued responses */ |
|
static int |
|
syncprov_qplay( Operation *op, syncops *so ) |
|
{ |
|
slap_overinst *on = LDAP_SLIST_FIRST(&so->s_op->o_extra)->oe_key; |
|
syncres *sr; |
|
opcookie opc; |
|
int rc = 0; |
|
|
|
opc.son = on; |
|
|
|
do { |
|
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; |
|
/* Exit loop with mutex held */ |
|
if ( !sr || so->s_op->o_abandon ) |
|
break; |
|
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
|
|
|
if ( sr->s_mode == LDAP_SYNC_NEW_COOKIE ) { |
|
SlapReply rs = { REP_INTERMEDIATE }; |
|
|
|
rc = syncprov_sendinfo( op, &rs, LDAP_TAG_SYNC_NEW_COOKIE, |
|
&sr->s_csn, 0, NULL, 0 ); |
|
} else { |
|
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; |
|
opc.se = sr->s_e; |
|
|
|
rc = syncprov_sendresp( op, &opc, so, sr->s_mode ); |
|
|
|
} |
|
if ( sr->s_e ) { |
|
if ( !dec_mutexint( sr->s_e->e_private )) { |
|
sr->s_e->e_private = NULL; |
|
entry_free ( sr->s_e ); |
|
} |
|
} |
|
|
|
ch_free( sr ); |
|
|
|
/* Exit loop with mutex held */ |
|
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
|
|
|
} while (0); |
|
|
|
/* We now only send one change at a time, to prevent one |
|
* psearch from hogging all the CPU. Resubmit this task if |
|
* there are more responses queued and no errors occurred. |
|
*/ |
|
|
|
if ( rc == 0 && so->s_res ) { |
|
syncprov_qstart( so ); |
|
} else { |
|
so->s_flags ^= PS_TASK_QUEUED; |
|
} |
|
|
|
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
|
return rc; |
|
} |
|
|
|
/* task for playing back queued responses */ |
|
static void * |
|
syncprov_qtask( void *ctx, void *arg ) |
|
{ |
|
syncops *so = arg; |
|
OperationBuffer opbuf; |
|
Operation *op; |
|
BackendDB be; |
|
int rc; |
|
|
|
op = &opbuf.ob_op; |
|
*op = *so->s_op; |
|
op->o_hdr = &opbuf.ob_hdr; |
|
op->o_controls = opbuf.ob_controls; |
|
memset( op->o_controls, 0, sizeof(opbuf.ob_controls) ); |
|
|
|
*op->o_hdr = *so->s_op->o_hdr; |
|
|
|
op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx, 1); |
|
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; |
|
LDAP_SLIST_FIRST(&op->o_extra) = NULL; |
|
op->o_callback = NULL; |
|
|
|
rc = syncprov_qplay( op, so ); |
|
|
|
/* decrement use count... */ |
|
syncprov_free_syncop( so ); |
|
|
|
return NULL; |
|
} |
|
|
|
/* Start the task to play back queued psearch responses */ |
|
static void |
|
syncprov_qstart( syncops *so ) |
|
{ |
|
so->s_flags |= PS_TASK_QUEUED; |
|
so->s_inuse++; |
|
ldap_pvt_thread_pool_submit( &connection_pool, |
|
syncprov_qtask, so ); |
|
} |
|
|
|
/* Queue a persistent search response */ |
|
static int |
|
syncprov_qresp( opcookie *opc, syncops *so, int mode ) |
|
{ |
|
syncres *sr; |
|
int srsize; |
|
struct berval cookie = opc->sctxcsn; |
|
|
|
if ( mode == LDAP_SYNC_NEW_COOKIE ) { |
|
syncprov_info_t *si = opc->son->on_bi.bi_private; |
|
|
|
slap_compose_sync_cookie( NULL, &cookie, si->si_ctxcsn, |
|
so->s_rid, slap_serverID ? slap_serverID : -1); |
|
} |
|
|
|
srsize = sizeof(syncres) + opc->suuid.bv_len + 1 + |
|
opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1; |
|
if ( cookie.bv_len ) |
|
srsize += cookie.bv_len + 1; |
|
sr = ch_malloc( srsize ); |
|
sr->s_next = NULL; |
|
sr->s_e = opc->se; |
|
/* bump refcount on this entry */ |
|
if ( opc->se ) |
|
inc_mutexint( opc->se->e_private ); |
|
sr->s_dn.bv_val = (char *)(sr + 1); |
|
sr->s_dn.bv_len = opc->sdn.bv_len; |
|
sr->s_mode = mode; |
|
sr->s_isreference = opc->sreference; |
|
sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, |
|
opc->sdn.bv_val ) + 1; |
|
sr->s_ndn.bv_len = opc->sndn.bv_len; |
|
sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, |
|
opc->sndn.bv_val ) + 1; |
|
sr->s_uuid.bv_len = opc->suuid.bv_len; |
|
AC_MEMCPY( sr->s_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len ); |
|
if ( cookie.bv_len ) { |
|
sr->s_csn.bv_val = sr->s_uuid.bv_val + sr->s_uuid.bv_len + 1; |
|
strcpy( sr->s_csn.bv_val, cookie.bv_val ); |
|
} else { |
|
sr->s_csn.bv_val = NULL; |
|
} |
|
sr->s_csn.bv_len = cookie.bv_len; |
|
|
|
if ( mode == LDAP_SYNC_NEW_COOKIE && cookie.bv_val ) { |
|
ch_free( cookie.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|PS_TASK_QUEUED)) == PS_IS_DETACHED ) { |
|
syncprov_qstart( so ); |
|
} |
|
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, Operation, |
|
o_next ); |
|
if ( lock ) |
|
ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex ); |
|
} |
|
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 |
|
syncprov_op_abandon( Operation *op, SlapReply *rs ) |
|
{ |
|
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
|
syncprov_info_t *si = on->on_bi.bi_private; |
|
syncops *so, *soprev; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so; |
|
soprev=so, so=so->s_next ) { |
|
if ( so->s_op->o_connid == op->o_connid && |
|
so->s_op->o_msgid == op->orn_msgid ) { |
|
so->s_op->o_abandon = 1; |
|
soprev->s_next = so->s_next; |
|
break; |
|
} |
|
} |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
if ( so ) { |
|
/* Is this really a Cancel exop? */ |
|
if ( op->o_tag != LDAP_REQ_ABANDON ) { |
|
so->s_op->o_cancel = SLAP_CANCEL_ACK; |
|
rs->sr_err = LDAP_CANCELLED; |
|
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, 0 ); |
|
} |
|
return SLAP_CB_CONTINUE; |
|
} |
|
|
/* Find which persistent searches are affected by this operation */ |
/* Find which persistent searches are affected by this operation */ |
static void |
static void |
syncprov_matchops( Operation *op, opcookie *opc, int saveit ) |
syncprov_matchops( Operation *op, opcookie *opc, int saveit ) |
Line 788 syncprov_matchops( Operation *op, opcook
|
Line 1166 syncprov_matchops( Operation *op, opcook
|
syncprov_info_t *si = on->on_bi.bi_private; |
syncprov_info_t *si = on->on_bi.bi_private; |
|
|
fbase_cookie fc; |
fbase_cookie fc; |
syncops *ss; |
syncops *ss, *sprev, *snext; |
Entry *e; |
Entry *e = NULL; |
Attribute *a; |
Attribute *a; |
int rc; |
int rc; |
struct berval newdn; |
struct berval newdn; |
|
int freefdn = 0; |
|
BackendDB *b0 = op->o_bd, db; |
|
|
fc.fdn = &op->o_req_ndn; |
fc.fdn = &op->o_req_ndn; |
/* compute new DN */ |
/* compute new DN */ |
Line 802 syncprov_matchops( Operation *op, opcook
|
Line 1182 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; |
if ( !SLAP_ISOVERLAY( op->o_bd )) { |
rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e ); |
db = *op->o_bd; |
op->o_bd->bd_info = (BackendInfo *)on; |
op->o_bd = &db; |
if ( rc ) return; |
} |
|
rc = overlay_entry_get_ov( op, fc.fdn, NULL, NULL, 0, &e, on ); |
|
/* If we're sending responses now, make a copy and unlock the DB */ |
|
if ( e && !saveit ) { |
|
if ( !opc->se ) { |
|
opc->se = entry_dup( e ); |
|
opc->se->e_private = get_mutexint(); |
|
} |
|
overlay_entry_release_ov( op, e, 0, on ); |
|
e = opc->se; |
|
} |
|
if ( rc ) { |
|
op->o_bd = b0; |
|
return; |
|
} |
} else { |
} else { |
e = op->ora_e; |
e = op->ora_e; |
|
if ( !saveit ) { |
|
if ( !opc->se ) { |
|
opc->se = entry_dup( e ); |
|
opc->se->e_private = get_mutexint(); |
|
} |
|
e = opc->se; |
|
} |
} |
} |
|
|
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 ); |
for (ss = si->si_ops; ss; ss=ss->s_next) |
for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss; |
|
sprev = ss, ss=snext) |
{ |
{ |
|
Operation op2; |
|
Opheader oh; |
syncmatches *sm; |
syncmatches *sm; |
int found = 0; |
int found = 0; |
|
|
|
snext = ss->s_next; |
|
if ( ss->s_op->o_abandon ) |
|
continue; |
|
|
|
/* Don't send ops back to the originator */ |
|
if ( opc->osid > 0 && opc->osid == ss->s_sid ) { |
|
Debug( LDAP_DEBUG_SYNC, "syncprov_matchops: skipping original sid %03x\n", |
|
opc->osid, 0, 0 ); |
|
continue; |
|
} |
|
|
|
/* Don't send ops back to the messenger */ |
|
if ( opc->rsid > 0 && opc->rsid == ss->s_sid ) { |
|
Debug( LDAP_DEBUG_SYNC, "syncprov_matchops: skipping relayed sid %03x\n", |
|
opc->rsid, 0, 0 ); |
|
continue; |
|
} |
|
|
/* validate base */ |
/* validate base */ |
fc.fss = ss; |
fc.fss = ss; |
fc.fbase = 0; |
fc.fbase = 0; |
fc.fscope = 0; |
fc.fscope = 0; |
|
|
|
/* If the base of the search is missing, signal a refresh */ |
rc = syncprov_findbase( op, &fc ); |
rc = syncprov_findbase( op, &fc ); |
if ( rc != LDAP_SUCCESS ) continue; |
if ( rc != LDAP_SUCCESS ) { |
|
SlapReply rs = {REP_RESULT}; |
|
send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED, |
|
"search base has changed" ); |
|
sprev->s_next = snext; |
|
syncprov_drop_psearch( ss, 1 ); |
|
ss = sprev; |
|
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 850 syncprov_matchops( Operation *op, opcook
|
Line 1294 syncprov_matchops( Operation *op, opcook
|
} |
} |
} |
} |
|
|
|
if ( fc.fscope ) { |
|
ldap_pvt_thread_mutex_lock( &ss->s_mutex ); |
|
op2 = *ss->s_op; |
|
oh = *op->o_hdr; |
|
oh.oh_conn = ss->s_op->o_conn; |
|
oh.oh_connid = ss->s_op->o_connid; |
|
op2.o_bd = op->o_bd->bd_self; |
|
op2.o_hdr = &oh; |
|
op2.o_extra = op->o_extra; |
|
op2.o_callback = NULL; |
|
if (ss->s_flags & PS_FIX_FILTER) { |
|
/* Skip the AND/GE clause that we stuck on in front. We |
|
would lose deletes/mods that happen during the refresh |
|
phase otherwise (ITS#6555) */ |
|
op2.ors_filter = ss->s_op->ors_filter->f_and->f_next; |
|
} |
|
ldap_pvt_thread_mutex_unlock( &ss->s_mutex ); |
|
rc = test_filter( &op2, e, op2.ors_filter ); |
|
} |
|
|
|
Debug( LDAP_DEBUG_TRACE, "syncprov_matchops: sid %03x fscope %d rc %d\n", |
|
ss->s_sid, fc.fscope, rc ); |
|
|
/* check if current o_req_dn is in scope and matches filter */ |
/* check if current o_req_dn is in scope and matches filter */ |
if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) == |
if ( fc.fscope && rc == LDAP_COMPARE_TRUE ) { |
LDAP_COMPARE_TRUE ) { |
|
if ( saveit ) { |
if ( saveit ) { |
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 ); |
|
} else if ( !saveit ) { |
|
syncprov_qresp( opc, ss, LDAP_SYNC_NEW_COOKIE ); |
|
} |
|
if ( !saveit && found ) { |
|
/* Decrement s_inuse, was incremented when called |
|
* with saveit == TRUE |
|
*/ |
|
syncprov_free_syncop( ss ); |
} |
} |
} |
} |
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 ) { |
|
op->o_bd->bd_info = (BackendInfo *)on->on_info; |
|
be_entry_release_r( op, e ); |
|
op->o_bd->bd_info = (BackendInfo *)on; |
|
} |
|
} |
|
|
|
static void |
|
syncprov_free_syncop( syncops *so ) |
|
{ |
|
syncres *sr, *srnext; |
|
|
|
ldap_pvt_thread_mutex_lock( &so->s_mutex ); |
if ( op->o_tag != LDAP_REQ_ADD && e ) { |
so->s_inuse--; |
if ( !SLAP_ISOVERLAY( op->o_bd )) { |
if ( so->s_inuse > 0 ) { |
op->o_bd = &db; |
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
} |
return; |
if ( saveit ) |
|
overlay_entry_release_ov( op, e, 0, on ); |
|
op->o_bd = b0; |
} |
} |
ldap_pvt_thread_mutex_unlock( &so->s_mutex ); |
if ( opc->se && !saveit ) { |
filter_free( so->s_op->ors_filter ); |
if ( !dec_mutexint( opc->se->e_private )) { |
ch_free( so->s_op ); |
opc->se->e_private = NULL; |
ch_free( so->s_base.bv_val ); |
entry_free( opc->se ); |
for ( sr=so->s_res; sr; sr=srnext ) { |
opc->se = NULL; |
srnext = sr->s_next; |
} |
ch_free( sr ); |
|
} |
} |
ldap_pvt_thread_mutex_destroy( &so->s_mutex ); |
if ( freefdn ) { |
ch_free( so ); |
op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx ); |
|
} |
|
op->o_bd = b0; |
} |
} |
|
|
static int |
static int |
Line 908 syncprov_op_cleanup( Operation *op, Slap
|
Line 1376 syncprov_op_cleanup( Operation *op, Slap
|
slap_overinst *on = opc->son; |
slap_overinst *on = opc->son; |
syncprov_info_t *si = on->on_bi.bi_private; |
syncprov_info_t *si = on->on_bi.bi_private; |
syncmatches *sm, *snext; |
syncmatches *sm, *snext; |
modtarget *mt, mtdummy; |
modtarget *mt; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
if ( si->si_active ) |
|
si->si_active--; |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
|
for (sm = opc->smatches; sm; sm=snext) { |
for (sm = opc->smatches; sm; sm=snext) { |
snext = sm->sm_next; |
snext = sm->sm_next; |
Line 917 syncprov_op_cleanup( Operation *op, Slap
|
Line 1390 syncprov_op_cleanup( Operation *op, Slap
|
} |
} |
|
|
/* Remove op from lock table */ |
/* Remove op from lock table */ |
mtdummy.mt_op = op; |
mt = opc->smt; |
ldap_pvt_thread_mutex_lock( &si->si_mods_mutex ); |
|
mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp ); |
|
if ( mt ) { |
if ( mt ) { |
modinst *mi = mt->mt_mods; |
|
|
|
/* 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 ) { |
mt->mt_mods = mt->mt_mods->mi_next; |
mt->mt_mods = mi->mi_next; |
/* If there are more, promote the next one */ |
|
if ( mt->mt_mods ) { |
mt->mt_op = mt->mt_mods->mi_op; |
mt->mt_op = mt->mt_mods->mi_op; |
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
} else { |
} else { |
avl_delete( &si->si_mods, mt, sp_avl_cmp ); |
|
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
|
ldap_pvt_thread_mutex_lock( &si->si_mods_mutex ); |
|
avl_delete( &si->si_mods, mt, sp_avl_cmp ); |
|
ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex ); |
ldap_pvt_thread_mutex_destroy( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_destroy( &mt->mt_mutex ); |
ch_free( mt ); |
ch_free( mt ); |
} |
} |
} |
} |
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, slap_overinst *on ) |
|
{ |
|
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
|
Modifications mod; |
|
Operation opm; |
|
SlapReply rsm = {REP_RESULT}; |
|
slap_callback cb = {0}; |
|
BackendDB be; |
|
BackendInfo *bi; |
|
|
|
#ifdef CHECK_CSN |
|
Syntax *syn = slap_schema.si_ad_contextCSN->ad_type->sat_syntax; |
|
|
|
int i; |
|
for ( i=0; i<si->si_numcsns; i++ ) { |
|
assert( !syn->ssyn_validate( syn, si->si_ctxcsn+i )); |
|
} |
|
#endif |
|
mod.sml_numvals = si->si_numcsns; |
|
mod.sml_values = si->si_ctxcsn; |
|
mod.sml_nvalues = NULL; |
|
mod.sml_desc = slap_schema.si_ad_contextCSN; |
|
mod.sml_op = LDAP_MOD_REPLACE; |
|
mod.sml_flags = SLAP_MOD_INTERNAL; |
|
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.orm_no_opattrs = 1; |
|
if ( SLAP_GLUE_SUBORDINATE( op->o_bd )) { |
|
be = *on->on_info->oi_origdb; |
|
opm.o_bd = &be; |
|
} |
|
opm.o_req_dn = si->si_contextdn; |
|
opm.o_req_ndn = si->si_contextdn; |
|
bi = opm.o_bd->bd_info; |
|
opm.o_bd->bd_info = on->on_info->oi_orig; |
|
opm.o_managedsait = SLAP_CONTROL_NONCRITICAL; |
|
opm.o_no_schema_check = 1; |
|
opm.o_bd->be_modify( &opm, &rsm ); |
|
|
|
if ( rsm.sr_err == LDAP_NO_SUCH_OBJECT && |
|
SLAP_SYNC_SUBENTRY( opm.o_bd )) { |
|
const char *text; |
|
char txtbuf[SLAP_TEXT_BUFLEN]; |
|
size_t textlen = sizeof txtbuf; |
|
Entry *e = slap_create_context_csn_entry( opm.o_bd, NULL ); |
|
rs_reinit( &rsm, REP_RESULT ); |
|
slap_mods2entry( &mod, &e, 0, 1, &text, txtbuf, textlen); |
|
opm.ora_e = e; |
|
opm.o_bd->be_add( &opm, &rsm ); |
|
if ( e == opm.ora_e ) |
|
be_entry_release_w( &opm, opm.ora_e ); |
|
} |
|
opm.o_bd->bd_info = bi; |
|
|
|
if ( mod.sml_next != NULL ) { |
|
slap_mods_free( mod.sml_next, 1 ); |
|
} |
|
#ifdef CHECK_CSN |
|
for ( i=0; i<si->si_numcsns; i++ ) { |
|
assert( !syn->ssyn_validate( syn, si->si_ctxcsn+i )); |
|
} |
|
#endif |
|
} |
|
|
|
static void |
|
syncprov_add_slog( Operation *op ) |
|
{ |
|
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; |
|
{ |
|
if ( BER_BVISEMPTY( &op->o_csn ) ) { |
|
/* During the syncrepl refresh phase we can receive operations |
|
* without a csn. We cannot reliably determine the consumers |
|
* state with respect to such operations, so we ignore them and |
|
* wipe out anything in the log if we see them. |
|
*/ |
|
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
|
while ( se = sl->sl_head ) { |
|
sl->sl_head = se->se_next; |
|
ch_free( se ); |
|
} |
|
sl->sl_tail = NULL; |
|
sl->sl_num = 0; |
|
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
|
return; |
|
} |
|
|
|
/* Allocate a record. UUIDs are not NUL-terminated. */ |
|
se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len + |
|
op->o_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, op->o_csn.bv_val, op->o_csn.bv_len ); |
|
se->se_csn.bv_val[op->o_csn.bv_len] = '\0'; |
|
se->se_csn.bv_len = op->o_csn.bv_len; |
|
se->se_sid = slap_parse_csn_sid( &se->se_csn ); |
|
|
|
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
|
if ( sl->sl_head ) { |
|
/* Keep the list in csn order. */ |
|
if ( ber_bvcmp( &sl->sl_tail->se_csn, &se->se_csn ) <= 0 ) { |
|
sl->sl_tail->se_next = se; |
|
sl->sl_tail = se; |
|
} else { |
|
slog_entry **sep; |
|
|
|
for ( sep = &sl->sl_head; *sep; sep = &(*sep)->se_next ) { |
|
if ( ber_bvcmp( &se->se_csn, &(*sep)->se_csn ) < 0 ) { |
|
se->se_next = *sep; |
|
*sep = se; |
|
break; |
|
} |
|
} |
|
} |
|
} 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; |
|
AC_MEMCPY( sl->sl_mincsn.bv_val, se->se_csn.bv_val, se->se_csn.bv_len ); |
|
sl->sl_mincsn.bv_len = se->se_csn.bv_len; |
|
ch_free( se ); |
|
sl->sl_num--; |
|
} |
|
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, |
|
sync_control *srs, BerVarray ctxcsn, int numcsns, int *sids ) |
|
{ |
|
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
|
slog_entry *se; |
|
int i, j, ndel, num, nmods, mmods; |
|
char cbuf[LDAP_PVT_CSNSTR_BUFSIZE]; |
|
BerVarray uuids; |
|
struct berval delcsn[2]; |
|
|
|
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); |
|
|
|
delcsn[0].bv_len = 0; |
|
delcsn[0].bv_val = cbuf; |
|
BER_BVZERO(&delcsn[1]); |
|
|
|
/* Make a copy of the relevant UUIDs. Put the Deletes up front |
|
* and everything else at the end. Do this first so we can |
|
* unlock the list mutex. |
|
*/ |
|
Debug( LDAP_DEBUG_SYNC, "srs csn %s\n", |
|
srs->sr_state.ctxcsn[0].bv_val, 0, 0 ); |
|
for ( se=sl->sl_head; se; se=se->se_next ) { |
|
int k; |
|
Debug( LDAP_DEBUG_SYNC, "log csn %s\n", se->se_csn.bv_val, 0, 0 ); |
|
ndel = 1; |
|
for ( k=0; k<srs->sr_state.numcsns; k++ ) { |
|
if ( se->se_sid == srs->sr_state.sids[k] ) { |
|
ndel = ber_bvcmp( &se->se_csn, &srs->sr_state.ctxcsn[k] ); |
|
break; |
|
} |
|
} |
|
if ( ndel <= 0 ) { |
|
Debug( LDAP_DEBUG_SYNC, "cmp %d, too old\n", ndel, 0, 0 ); |
|
continue; |
|
} |
|
ndel = 0; |
|
for ( k=0; k<numcsns; k++ ) { |
|
if ( se->se_sid == sids[k] ) { |
|
ndel = ber_bvcmp( &se->se_csn, &ctxcsn[k] ); |
|
break; |
|
} |
|
} |
|
if ( ndel > 0 ) { |
|
Debug( LDAP_DEBUG_SYNC, "cmp %d, too new\n", ndel, 0, 0 ); |
|
break; |
|
} |
|
if ( se->se_tag == LDAP_REQ_DELETE ) { |
|
j = i; |
|
i++; |
|
AC_MEMCPY( cbuf, se->se_csn.bv_val, se->se_csn.bv_len ); |
|
delcsn[0].bv_len = se->se_csn.bv_len; |
|
delcsn[0].bv_val[delcsn[0].bv_len] = '\0'; |
|
} else { |
|
if ( se->se_tag == LDAP_REQ_ADD ) |
|
continue; |
|
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; |
|
int rc; |
|
Filter mf, af; |
|
AttributeAssertion eq = ATTRIBUTEASSERTION_INIT; |
|
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 = (BackendInfo *)on->on_info; |
|
|
|
for ( i=ndel; i<num; i++ ) { |
|
if ( uuids[i].bv_len != 0 ) { |
|
SlapReply frs = { REP_RESULT }; |
|
|
|
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 ) { |
|
struct berval cookie; |
|
|
|
if ( delcsn[0].bv_len ) { |
|
slap_compose_sync_cookie( op, &cookie, delcsn, srs->sr_state.rid, |
|
slap_serverID ? slap_serverID : -1 ); |
|
|
|
Debug( LDAP_DEBUG_SYNC, "syncprov_playlog: cookie=%s\n", cookie.bv_val, 0, 0 ); |
|
} |
|
|
|
uuids[ndel].bv_val = NULL; |
|
syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, |
|
delcsn[0].bv_len ? &cookie : NULL, 0, uuids, 1 ); |
|
if ( delcsn[0].bv_len ) { |
|
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
|
} |
|
} |
|
op->o_tmpfree( uuids, op->o_tmpmemctx ); |
} |
} |
|
|
static int |
static int |
Line 952 syncprov_op_response( Operation *op, Sla
|
Line 1762 syncprov_op_response( Operation *op, Sla
|
if ( rs->sr_err == LDAP_SUCCESS ) |
if ( rs->sr_err == LDAP_SUCCESS ) |
{ |
{ |
struct berval maxcsn; |
struct berval maxcsn; |
char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE]; |
char cbuf[LDAP_PVT_CSNSTR_BUFSIZE]; |
|
int do_check = 0, have_psearches, foundit, csn_changed = 0; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_resp_mutex ); |
|
|
/* Update our context CSN */ |
/* Update our context CSN */ |
cbuf[0] = '\0'; |
cbuf[0] = '\0'; |
ldap_pvt_thread_mutex_lock( &si->si_csn_mutex ); |
maxcsn.bv_val = cbuf; |
slap_get_commit_csn( op, &maxcsn ); |
maxcsn.bv_len = sizeof(cbuf); |
if ( maxcsn.bv_val ) { |
ldap_pvt_thread_rdwr_wlock( &si->si_csn_rwlock ); |
strcpy( cbuf, maxcsn.bv_val ); |
|
if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) { |
slap_get_commit_csn( op, &maxcsn, &foundit ); |
strcpy( si->si_ctxcsnbuf, cbuf ); |
if ( BER_BVISEMPTY( &maxcsn ) && SLAP_GLUE_SUBORDINATE( op->o_bd )) { |
si->si_ctxcsn.bv_len = maxcsn.bv_len; |
/* syncrepl queues the CSN values in the db where |
|
* it is configured , not where the changes are made. |
|
* So look for a value in the glue db if we didn't |
|
* find any in this db. |
|
*/ |
|
BackendDB *be = op->o_bd; |
|
op->o_bd = select_backend( &be->be_nsuffix[0], 1); |
|
maxcsn.bv_val = cbuf; |
|
maxcsn.bv_len = sizeof(cbuf); |
|
slap_get_commit_csn( op, &maxcsn, &foundit ); |
|
op->o_bd = be; |
|
} |
|
if ( !BER_BVISEMPTY( &maxcsn ) ) { |
|
int i, sid; |
|
#ifdef CHECK_CSN |
|
Syntax *syn = slap_schema.si_ad_contextCSN->ad_type->sat_syntax; |
|
assert( !syn->ssyn_validate( syn, &maxcsn )); |
|
#endif |
|
sid = slap_parse_csn_sid( &maxcsn ); |
|
for ( i=0; i<si->si_numcsns; i++ ) { |
|
if ( sid == si->si_sids[i] ) { |
|
if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn[i] ) > 0 ) { |
|
ber_bvreplace( &si->si_ctxcsn[i], &maxcsn ); |
|
csn_changed = 1; |
|
} |
|
break; |
|
} |
|
} |
|
/* It's a new SID for us */ |
|
if ( i == si->si_numcsns ) { |
|
value_add_one( &si->si_ctxcsn, &maxcsn ); |
|
csn_changed = 1; |
|
si->si_numcsns++; |
|
si->si_sids = ch_realloc( si->si_sids, si->si_numcsns * |
|
sizeof(int)); |
|
si->si_sids[i] = sid; |
|
} |
|
} |
|
|
|
/* Don't do any processing for consumer contextCSN updates */ |
|
if ( op->o_dont_replicate ) { |
|
if ( op->o_tag == LDAP_REQ_MODIFY && |
|
op->orm_modlist->sml_op == LDAP_MOD_REPLACE && |
|
op->orm_modlist->sml_desc == slap_schema.si_ad_contextCSN ) { |
|
/* Catch contextCSN updates from syncrepl. We have to look at |
|
* all the attribute values, as there may be more than one csn |
|
* that changed, and only one can be passed in the csn queue. |
|
*/ |
|
Modifications *mod = op->orm_modlist; |
|
unsigned i; |
|
int j, sid; |
|
|
|
for ( i=0; i<mod->sml_numvals; i++ ) { |
|
sid = slap_parse_csn_sid( &mod->sml_values[i] ); |
|
for ( j=0; j<si->si_numcsns; j++ ) { |
|
if ( sid == si->si_sids[j] ) { |
|
if ( ber_bvcmp( &mod->sml_values[i], &si->si_ctxcsn[j] ) > 0 ) { |
|
ber_bvreplace( &si->si_ctxcsn[j], &mod->sml_values[i] ); |
|
csn_changed = 1; |
|
} |
|
break; |
|
} |
|
} |
|
|
|
if ( j == si->si_numcsns ) { |
|
value_add_one( &si->si_ctxcsn, &mod->sml_values[i] ); |
|
si->si_numcsns++; |
|
si->si_sids = ch_realloc( si->si_sids, si->si_numcsns * |
|
sizeof(int)); |
|
si->si_sids[j] = sid; |
|
csn_changed = 1; |
|
} |
|
} |
|
if ( csn_changed ) |
|
si->si_dirty = 0; |
|
ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock ); |
|
|
|
if ( csn_changed ) { |
|
syncops *ss; |
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
for ( ss = si->si_ops; ss; ss = ss->s_next ) { |
|
if ( ss->s_op->o_abandon ) |
|
continue; |
|
/* Send the updated csn to all syncrepl consumers, |
|
* including the server from which it originated. |
|
* The syncrepl consumer and syncprov provider on |
|
* the originating server may be configured to store |
|
* their csn values in different entries. |
|
*/ |
|
syncprov_qresp( opc, ss, LDAP_SYNC_NEW_COOKIE ); |
|
} |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
} |
|
} else { |
|
ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock ); |
|
} |
|
goto leave; |
|
} |
|
|
|
si->si_numops++; |
|
if ( si->si_chkops || si->si_chktime ) { |
|
/* Never checkpoint adding the context entry, |
|
* it will deadlock |
|
*/ |
|
if ( op->o_tag != LDAP_REQ_ADD || |
|
!dn_match( &op->o_req_ndn, &si->si_contextdn )) { |
|
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 )) { |
|
if ( si->si_chklast ) { |
|
do_check = 1; |
|
si->si_chklast = op->o_time; |
|
} else { |
|
si->si_chklast = 1; |
|
} |
|
} |
} |
} |
si->si_gotcsn = 1; |
|
} |
} |
ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex ); |
si->si_dirty = !csn_changed; |
|
ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock ); |
|
|
opc->sctxcsn.bv_len = maxcsn.bv_len; |
if ( do_check ) { |
opc->sctxcsn.bv_val = cbuf; |
ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock ); |
|
syncprov_checkpoint( op, on ); |
|
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
|
} |
|
|
|
/* only update consumer ctx if this is a newer csn */ |
|
if ( csn_changed ) { |
|
opc->sctxcsn = maxcsn; |
|
} |
|
|
/* Handle any persistent searches */ |
/* Handle any persistent searches */ |
if ( si->si_ops ) { |
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
have_psearches = ( si->si_ops != NULL ); |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
if ( have_psearches ) { |
switch(op->o_tag) { |
switch(op->o_tag) { |
case LDAP_REQ_ADD: |
case LDAP_REQ_ADD: |
case LDAP_REQ_MODIFY: |
case LDAP_REQ_MODIFY: |
Line 984 syncprov_op_response( Operation *op, Sla
|
Line 1926 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 */ |
return SLAP_CB_CONTINUE; |
if ( si->si_logs ) { |
} |
syncprov_add_slog( op ); |
|
|
static int |
|
syncprov_op_abandon( Operation *op, SlapReply *rs ) |
|
{ |
|
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
|
syncprov_info_t *si = on->on_bi.bi_private; |
|
syncops *so, *soprev; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so; |
|
soprev=so, so=so->s_next ) { |
|
if ( so->s_op->o_connid == op->o_connid && |
|
so->s_op->o_msgid == op->orn_msgid ) { |
|
so->s_op->o_abandon = 1; |
|
soprev->s_next = so->s_next; |
|
break; |
|
} |
|
} |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
if ( so ) { |
|
ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex ); |
|
op->o_conn->c_n_ops_executing--; |
|
op->o_conn->c_n_ops_completed++; |
|
ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex ); |
|
/* Is this really a Cancel exop? */ |
|
if ( op->o_tag != LDAP_REQ_ABANDON ) { |
|
rs->sr_err = LDAP_CANCELLED; |
|
send_ldap_result( so->s_op, rs ); |
|
} |
} |
syncprov_free_syncop( so ); |
leave: ldap_pvt_thread_mutex_unlock( &si->si_resp_mutex ); |
} |
} |
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 1045 syncprov_op_compare( Operation *op, Slap
|
Line 1955 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, &si->si_contextdn ) && |
|
op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN ) |
{ |
{ |
Attribute *a; |
Entry e = {0}; |
|
Attribute a = {0}; |
|
|
ldap_pvt_thread_mutex_lock( &si->si_e_mutex ); |
e.e_name = si->si_contextdn; |
|
e.e_nname = si->si_contextdn; |
|
e.e_attrs = &a; |
|
|
if ( get_assert( op ) && |
a.a_desc = slap_schema.si_ad_contextCSN; |
( test_filter( op, si->si_e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) ) |
|
{ |
|
rs->sr_err = LDAP_ASSERTION_FAILED; |
|
goto return_results; |
|
} |
|
|
|
rs->sr_err = access_allowed( op, si->si_e, op->oq_compare.rs_ava->aa_desc, |
ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock ); |
|
|
|
a.a_vals = si->si_ctxcsn; |
|
a.a_nvals = a.a_vals; |
|
a.a_numvals = si->si_numcsns; |
|
|
|
rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc, |
&op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL ); |
&op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL ); |
if ( ! rs->sr_err ) { |
if ( ! rs->sr_err ) { |
rs->sr_err = LDAP_INSUFFICIENT_ACCESS; |
rs->sr_err = LDAP_INSUFFICIENT_ACCESS; |
goto return_results; |
goto return_results; |
} |
} |
|
|
rs->sr_err = LDAP_NO_SUCH_ATTRIBUTE; |
if ( get_assert( op ) && |
|
( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) ) |
for ( a = attr_find( si->si_e->e_attrs, op->oq_compare.rs_ava->aa_desc ); |
|
a != NULL; |
|
a = attr_find( a->a_next, op->oq_compare.rs_ava->aa_desc ) ) |
|
{ |
{ |
rs->sr_err = LDAP_COMPARE_FALSE; |
rs->sr_err = LDAP_ASSERTION_FAILED; |
|
goto return_results; |
|
} |
|
|
if ( value_find_ex( op->oq_compare.rs_ava->aa_desc, |
|
SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH | |
rs->sr_err = LDAP_COMPARE_FALSE; |
SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH, |
|
a->a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 ) |
if ( attr_valfind( &a, |
{ |
SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH | |
rs->sr_err = LDAP_COMPARE_TRUE; |
SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH, |
break; |
&op->oq_compare.rs_ava->aa_value, NULL, op->o_tmpmemctx ) == 0 ) |
} |
{ |
|
rs->sr_err = LDAP_COMPARE_TRUE; |
} |
} |
|
|
return_results:; |
return_results:; |
|
|
ldap_pvt_thread_mutex_unlock( &si->si_e_mutex ); |
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
|
|
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
|
|
Line 1095 return_results:;
|
Line 2010 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 ) |
{ |
{ |
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
slap_overinst *on = (slap_overinst *)op->o_bd->bd_info; |
syncprov_info_t *si = on->on_bi.bi_private; |
syncprov_info_t *si = on->on_bi.bi_private; |
|
slap_callback *cb; |
|
opcookie *opc; |
|
int have_psearches, cbsize; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
have_psearches = ( si->si_ops != NULL ); |
|
si->si_active++; |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
|
slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+ |
cbsize = sizeof(slap_callback) + sizeof(opcookie) + |
sizeof(opcookie) + |
(have_psearches ? sizeof(modinst) : 0 ); |
(si->si_ops ? sizeof(modinst) : 0 ), |
|
op->o_tmpmemctx); |
cb = op->o_tmpcalloc(1, cbsize, op->o_tmpmemctx); |
opcookie *opc = (opcookie *)(cb+1); |
opc = (opcookie *)(cb+1); |
opc->son = on; |
opc->son = on; |
cb->sc_response = syncprov_op_response; |
cb->sc_response = syncprov_op_response; |
cb->sc_cleanup = syncprov_op_cleanup; |
cb->sc_cleanup = syncprov_op_cleanup; |
Line 1117 syncprov_op_mod( Operation *op, SlapRepl
|
Line 2039 syncprov_op_mod( Operation *op, SlapRepl
|
cb->sc_next = op->o_callback; |
cb->sc_next = op->o_callback; |
op->o_callback = cb; |
op->o_callback = cb; |
|
|
|
opc->osid = -1; |
|
opc->rsid = -1; |
|
if ( op->o_csn.bv_val ) { |
|
opc->osid = slap_parse_csn_sid( &op->o_csn ); |
|
} |
|
if ( op->o_controls ) { |
|
struct sync_cookie *scook = |
|
op->o_controls[slap_cids.sc_LDAPsync]; |
|
if ( scook ) |
|
opc->rsid = scook->sid; |
|
} |
|
|
/* If there are active persistent searches, lock this operation. |
/* If there are active persistent searches, lock this operation. |
* See seqmod.c for the locking logic on its own. |
* See seqmod.c for the locking logic on its own. |
*/ |
*/ |
if ( si->si_ops ) { |
if ( have_psearches ) { |
modtarget *mt, mtdummy; |
modtarget *mt, mtdummy; |
modinst *mi; |
modinst *mi; |
|
|
Line 1133 syncprov_op_mod( Operation *op, SlapRepl
|
Line 2067 syncprov_op_mod( Operation *op, SlapRepl
|
mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp ); |
mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp ); |
if ( mt ) { |
if ( mt ) { |
ldap_pvt_thread_mutex_lock( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_lock( &mt->mt_mutex ); |
|
if ( mt->mt_mods == NULL ) { |
|
/* Cannot reuse this mt, as another thread is about |
|
* to release it in syncprov_op_cleanup. |
|
*/ |
|
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
|
mt = NULL; |
|
} |
|
} |
|
if ( mt ) { |
ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex ); |
ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex ); |
mt->mt_tail->mi_next = mi; |
mt->mt_tail->mi_next = mi; |
mt->mt_tail = mi; |
mt->mt_tail = mi; |
/* wait for this op to get to head of list */ |
/* wait for this op to get to head of list */ |
while ( mt->mt_mods != mi ) { |
while ( mt->mt_mods != mi ) { |
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
ldap_pvt_thread_mutex_unlock( &mt->mt_mutex ); |
ldap_pvt_thread_yield(); |
/* FIXME: if dynamic config can delete overlays or |
|
* databases we'll have to check for cleanup here. |
|
* Currently it's not an issue because there are |
|
* no dynamic config deletes... |
|
*/ |
|
if ( slapd_shutdown ) |
|
return SLAPD_ABANDON; |
|
|
|
if ( !ldap_pvt_thread_pool_pausecheck( &connection_pool )) |
|
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 1152 syncprov_op_mod( Operation *op, SlapRepl
|
Line 2117 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 ); |
} |
} |
|
opc->smt = mt; |
if ( op->o_tag != LDAP_REQ_ADD ) |
|
syncprov_matchops( op, opc, 1 ); |
|
} |
} |
|
|
|
if (( have_psearches || si->si_logs ) && op->o_tag != LDAP_REQ_ADD ) |
|
syncprov_matchops( op, opc, 1 ); |
|
|
return SLAP_CB_CONTINUE; |
return SLAP_CB_CONTINUE; |
} |
} |
|
|
Line 1172 syncprov_op_extended( Operation *op, Sla
|
Line 2138 syncprov_op_extended( Operation *op, Sla
|
typedef struct searchstate { |
typedef struct searchstate { |
slap_overinst *ss_on; |
slap_overinst *ss_on; |
syncops *ss_so; |
syncops *ss_so; |
|
BerVarray ss_ctxcsn; |
|
int *ss_sids; |
|
int ss_numcsns; |
|
#define SS_PRESENT 0x01 |
|
#define SS_CHANGED 0x02 |
|
int ss_flags; |
} 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; |
} |
} |
|
|
|
typedef struct SyncOperationBuffer { |
|
Operation sob_op; |
|
Opheader sob_hdr; |
|
OpExtra sob_oe; |
|
AttributeName sob_extra; /* not always present */ |
|
/* Further data allocated here */ |
|
} SyncOperationBuffer; |
|
|
static void |
static void |
syncprov_detach_op( Operation *op, syncops *so ) |
syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on ) |
{ |
{ |
|
SyncOperationBuffer *sopbuf2; |
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 */ |
size = sizeof(Operation) + sizeof(Opheader) + |
size = offsetof( SyncOperationBuffer, sob_extra ) + |
(i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) + |
(i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) + |
op->o_req_dn.bv_len + 1 + |
op->o_req_dn.bv_len + 1 + |
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 ); |
sopbuf2 = ch_calloc( 1, size ); |
*op2 = *op; |
op2 = &sopbuf2->sob_op; |
op2->o_hdr = (Opheader *)(op2+1); |
op2->o_hdr = &sopbuf2->sob_hdr; |
|
LDAP_SLIST_FIRST(&op2->o_extra) = &sopbuf2->sob_oe; |
|
|
|
/* 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_managedsait = op->o_managedsait; |
|
LDAP_SLIST_FIRST(&op2->o_extra)->oe_key = on; |
|
LDAP_SLIST_NEXT(LDAP_SLIST_FIRST(&op2->o_extra), oe_next) = NULL; |
|
|
|
ptr = (char *) sopbuf2 + offsetof( SyncOperationBuffer, sob_extra ); |
if ( i ) { |
if ( i ) { |
op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1); |
op2->ors_attrs = (AttributeName *) ptr; |
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 { |
|
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->o_controls = NULL; |
/* Skip the AND/GE clause that we stuck on in front */ |
op2->o_callback = NULL; |
if ( so->s_flags & PS_FIX_FILTER ) { |
|
op2->ors_filter = op->ors_filter->f_and->f_next; |
|
so->s_flags ^= PS_FIX_FILTER; |
|
} else { |
|
op2->ors_filter = op->ors_filter; |
|
} |
|
op2->ors_filter = filter_dup( op2->ors_filter, NULL ); |
so->s_op = op2; |
so->s_op = op2; |
|
|
/* Increment number of ops so that idletimeout ignores us */ |
/* Copy any cached group ACLs individually */ |
ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex ); |
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 */ |
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_pvt_thread_mutex_unlock( &op->o_conn->c_mutex ); |
LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next ); |
|
so->s_flags |= PS_IS_DETACHED; |
|
|
|
/* Prevent anyone else from trying to send a result for this op */ |
|
op->o_abandon = 1; |
} |
} |
|
|
static int |
static int |
Line 1248 syncprov_search_response( Operation *op,
|
Line 2264 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; |
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
sync_control *srs = op->o_controls[sync_cid]; |
sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync]; |
|
|
if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) { |
if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) { |
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 |
/* Don't send the ctx entry twice */ |
* control. |
if ( bvmatch( &a->a_nvals[0], srs->sr_state.ctxcsn )) |
*/ |
|
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 == NULL && rs->sr_operational_attrs != NULL ) { |
|
a = attr_find( rs->sr_operational_attrs, slap_schema.si_ad_entryCSN ); |
|
} |
|
if ( a ) { |
|
int i, sid; |
|
sid = slap_parse_csn_sid( &a->a_nvals[0] ); |
|
|
|
/* Don't send changed entries back to the originator */ |
|
if ( sid == srs->sr_state.sid && srs->sr_state.numcsns ) { |
|
Debug( LDAP_DEBUG_SYNC, |
|
"Entry %s changed by peer, ignored\n", |
|
rs->sr_entry->e_name.bv_val, 0, 0 ); |
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
|
} |
|
|
|
/* If not a persistent search */ |
|
if ( !ss->ss_so ) { |
|
/* Make sure entry is less than the snapshot'd contextCSN */ |
|
for ( i=0; i<ss->ss_numcsns; i++ ) { |
|
if ( sid == ss->ss_sids[i] && ber_bvcmp( &a->a_nvals[0], |
|
&ss->ss_ctxcsn[i] ) > 0 ) { |
|
Debug( LDAP_DEBUG_SYNC, |
|
"Entry %s CSN %s greater than snapshot %s\n", |
|
rs->sr_entry->e_name.bv_val, |
|
a->a_nvals[0].bv_val, |
|
ss->ss_ctxcsn[i].bv_val ); |
|
return LDAP_SUCCESS; |
|
} |
|
} |
|
} |
|
|
|
/* Don't send old entries twice */ |
|
if ( srs->sr_state.ctxcsn ) { |
|
for ( i=0; i<srs->sr_state.numcsns; i++ ) { |
|
if ( sid == srs->sr_state.sids[i] && |
|
ber_bvcmp( &a->a_nvals[0], |
|
&srs->sr_state.ctxcsn[i] )<= 0 ) { |
|
Debug( LDAP_DEBUG_SYNC, |
|
"Entry %s CSN %s older or equal to ctx %s\n", |
|
rs->sr_entry->e_name.bv_val, |
|
a->a_nvals[0].bv_val, |
|
srs->sr_state.ctxcsn[i].bv_val ); |
|
return LDAP_SUCCESS; |
|
} |
|
} |
|
} |
} |
} |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
op->o_tmpmemctx ); |
op->o_tmpmemctx ); |
rs->sr_ctrls[1] = NULL; |
rs->sr_ctrls[1] = NULL; |
rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry, |
rs->sr_flags |= REP_CTRLS_MUSTBEFREED; |
LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL ); |
/* If we're in delta-sync mode, always send a cookie */ |
|
if ( si->si_nopres && si->si_usehint && a ) { |
|
struct berval cookie; |
|
slap_compose_sync_cookie( op, &cookie, a->a_nvals, srs->sr_state.rid, slap_serverID ? slap_serverID : -1 ); |
|
rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry, |
|
LDAP_SYNC_ADD, rs->sr_ctrls, 0, 1, &cookie ); |
|
} else { |
|
rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry, |
|
LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL ); |
|
} |
} 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 = BER_BVNULL; |
|
|
slap_compose_sync_cookie( op, &cookie, |
if ( ( ss->ss_flags & SS_CHANGED ) && |
&op->ors_filter->f_and->f_ava->aa_value, |
ss->ss_ctxcsn && !BER_BVISNULL( &ss->ss_ctxcsn[0] )) { |
srs->sr_state.sid, srs->sr_state.rid ); |
slap_compose_sync_cookie( op, &cookie, ss->ss_ctxcsn, |
|
srs->sr_state.rid, slap_serverID ? slap_serverID : -1 ); |
|
|
/* Is this a regular refresh? */ |
Debug( LDAP_DEBUG_SYNC, "syncprov_search_response: cookie=%s\n", cookie.bv_val, 0, 0 ); |
|
} |
|
|
|
/* Is this a regular refresh? |
|
* Note: refresh never gets here if there were no changes |
|
*/ |
if ( !ss->ss_so ) { |
if ( !ss->ss_so ) { |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2, |
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_flags & 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_flags & SS_PRESENT ) ? |
LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE, |
LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE, |
&cookie, 1, NULL, 0 ); |
( ss->ss_flags & SS_CHANGED ) ? &cookie : NULL, |
/* Flush any queued persist messages */ |
1, NULL, 0 ); |
if ( ss->ss_so->s_res ) { |
if ( !BER_BVISNULL( &cookie )) |
syncres *sr, *srnext; |
op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx ); |
Entry *e; |
|
opcookie opc; |
/* Detach this Op from frontend control */ |
|
ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex ); |
|
|
|
/* But not if this connection was closed along the way */ |
|
if ( op->o_abandon ) { |
|
ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex ); |
|
/* syncprov_ab_cleanup will free this syncop */ |
|
return SLAPD_ABANDON; |
|
|
opc.son = on; |
} else { |
ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex ); |
ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex ); |
locked = 1; |
/* Turn off the refreshing flag */ |
for (sr = ss->ss_so->s_res; sr; sr=srnext) { |
ss->ss_so->s_flags ^= PS_IS_REFRESHING; |
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 */ |
syncprov_detach_op( op, ss->ss_so, on ); |
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 */ |
ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex ); |
syncprov_detach_op( op, ss->ss_so ); |
|
|
/* If there are queued responses, fire them off */ |
|
if ( ss->ss_so->s_res ) |
|
syncprov_qstart( ss->ss_so ); |
|
ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex ); |
|
} |
|
|
return LDAP_SUCCESS; |
return LDAP_SUCCESS; |
} |
} |
Line 1345 syncprov_op_search( Operation *op, SlapR
|
Line 2409 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, changed = 0, do_present = 0; |
Filter *fand, *fava; |
|
syncops *sop = NULL; |
syncops *sop = NULL; |
searchstate *ss; |
searchstate *ss; |
sync_control *srs; |
sync_control *srs; |
|
BerVarray ctxcsn; |
|
int i, *sids, numcsns; |
|
struct berval mincsn, maxcsn; |
|
int dirty = 0; |
|
|
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 1358 syncprov_op_search( Operation *op, SlapR
|
Line 2425 syncprov_op_search( Operation *op, SlapR
|
return rs->sr_err; |
return rs->sr_err; |
} |
} |
|
|
srs = op->o_controls[sync_cid]; |
srs = op->o_controls[slap_cids.sc_LDAPsync]; |
|
|
/* 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 1371 syncprov_op_search( Operation *op, SlapR
|
Line 2438 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; |
|
ldap_pvt_thread_mutex_init( &so.s_mutex ); |
cb = op->o_callback; |
cb = op->o_callback; |
op->o_callback = ≻ |
op->o_callback = ≻ |
rs->sr_err = syncprov_findbase( op, &fc ); |
rs->sr_err = syncprov_findbase( op, &fc ); |
op->o_callback = cb; |
op->o_callback = cb; |
|
ldap_pvt_thread_mutex_destroy( &so.s_mutex ); |
|
|
if ( rs->sr_err != LDAP_SUCCESS ) { |
if ( rs->sr_err != LDAP_SUCCESS ) { |
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
Line 1387 syncprov_op_search( Operation *op, SlapR
|
Line 2456 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_sid = srs->sr_state.sid; |
sop->s_inuse = 1; |
sop->s_inuse = 1; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
while ( si->si_active ) { |
|
/* Wait for active mods to finish before proceeding, as they |
|
* may already have inspected the si_ops list looking for |
|
* consumers to replicate the change to. Using the log |
|
* doesn't help, as we may finish playing it before the |
|
* active mods gets added to it. |
|
*/ |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
if ( slapd_shutdown ) |
|
return SLAPD_ABANDON; |
|
if ( !ldap_pvt_thread_pool_pausecheck( &connection_pool )) |
|
ldap_pvt_thread_yield(); |
|
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_rdwr_rlock( &si->si_csn_rwlock ); |
|
numcsns = si->si_numcsns; |
|
if ( numcsns ) { |
|
ber_bvarray_dup_x( &ctxcsn, si->si_ctxcsn, op->o_tmpmemctx ); |
|
sids = op->o_tmpalloc( numcsns * sizeof(int), op->o_tmpmemctx ); |
|
for ( i=0; i<numcsns; i++ ) |
|
sids[i] = si->si_sids[i]; |
|
} else { |
|
ctxcsn = NULL; |
|
sids = NULL; |
|
} |
|
dirty = si->si_dirty; |
|
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
|
|
|
/* If we have a cookie, handle the PRESENT lookups */ |
if ( srs->sr_state.ctxcsn ) { |
if ( srs->sr_state.ctxcsn ) { |
/* Is the CSN in a valid format? */ |
sessionlog *sl; |
if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) { |
int i, j; |
send_ldap_error( op, rs, LDAP_OTHER, "invalid sync cookie" ); |
|
return rs->sr_err; |
/* If we don't have any CSN of our own yet, pretend nothing |
|
* has changed. |
|
*/ |
|
if ( !numcsns ) |
|
goto no_change; |
|
|
|
if ( !si->si_nopres ) |
|
do_present = SS_PRESENT; |
|
|
|
/* If there are SIDs we don't recognize in the cookie, drop them */ |
|
for (i=0; i<srs->sr_state.numcsns; ) { |
|
for (j=0; j<numcsns; j++) { |
|
if ( srs->sr_state.sids[i] == sids[j] ) { |
|
break; |
|
} |
|
} |
|
/* not found */ |
|
if ( j == numcsns ) { |
|
struct berval tmp = srs->sr_state.ctxcsn[i]; |
|
j = srs->sr_state.numcsns - 1; |
|
srs->sr_state.ctxcsn[i] = srs->sr_state.ctxcsn[j]; |
|
tmp.bv_len = 0; |
|
srs->sr_state.ctxcsn[j] = tmp; |
|
srs->sr_state.numcsns = j; |
|
srs->sr_state.sids[i] = srs->sr_state.sids[j]; |
|
continue; |
|
} |
|
i++; |
} |
} |
/* Is the CSN still present in the database? */ |
|
if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) { |
/* Find the smallest CSN which differs from contextCSN */ |
/* No, so a reload is required */ |
mincsn.bv_len = 0; |
#if 0 /* the consumer doesn't seem to send this hint */ |
maxcsn.bv_len = 0; |
if ( op->o_sync_rhint == 0 ) { |
for ( i=0; i<srs->sr_state.numcsns; i++ ) { |
send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" ); |
for ( j=0; j<numcsns; j++ ) { |
return rs->sr_err; |
if ( srs->sr_state.sids[i] != sids[j] ) |
|
continue; |
|
if ( BER_BVISEMPTY( &maxcsn ) || ber_bvcmp( &maxcsn, |
|
&srs->sr_state.ctxcsn[i] ) < 0 ) { |
|
maxcsn = srs->sr_state.ctxcsn[i]; |
|
} |
|
if ( ber_bvcmp( &srs->sr_state.ctxcsn[i], &ctxcsn[j] ) < 0) { |
|
if ( BER_BVISEMPTY( &mincsn ) || ber_bvcmp( &mincsn, |
|
&srs->sr_state.ctxcsn[i] ) > 0 ) { |
|
mincsn = srs->sr_state.ctxcsn[i]; |
|
} |
|
} |
} |
} |
#endif |
} |
} else { |
if ( BER_BVISEMPTY( &mincsn )) |
gotstate = 1; |
mincsn = maxcsn; |
/* If just Refreshing and nothing has changed, shortcut it */ |
|
if ( bvmatch( srs->sr_state.ctxcsn, &si->si_ctxcsn )) { |
/* If nothing has changed, shortcut it */ |
nochange = 1; |
if ( srs->sr_state.numcsns == numcsns ) { |
if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) { |
int i, j, newer; |
|
for ( i=0; i<srs->sr_state.numcsns; i++ ) { |
|
for ( j=0; j<numcsns; j++ ) { |
|
if ( srs->sr_state.sids[i] != sids[j] ) |
|
continue; |
|
newer = ber_bvcmp( &srs->sr_state.ctxcsn[i], &ctxcsn[j] ); |
|
/* If our state is newer, tell consumer about changes */ |
|
if ( newer < 0 ) |
|
changed = SS_CHANGED; |
|
else if ( newer > 0 ) { |
|
/* our state is older, complain to consumer */ |
|
rs->sr_err = LDAP_UNWILLING_TO_PERFORM; |
|
rs->sr_text = "consumer state is newer than provider!"; |
|
bailout: |
|
if ( sop ) { |
|
syncops **sp = &si->si_ops; |
|
|
|
ldap_pvt_thread_mutex_lock( &si->si_ops_mutex ); |
|
while ( *sp != sop ) |
|
sp = &(*sp)->s_next; |
|
*sp = sop->s_next; |
|
ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex ); |
|
ch_free( sop ); |
|
} |
|
rs->sr_ctrls = NULL; |
|
send_ldap_result( op, rs ); |
|
return rs->sr_err; |
|
} |
|
break; |
|
} |
|
if ( changed ) |
|
break; |
|
} |
|
if ( !changed && !dirty ) { |
|
do_present = 0; |
|
no_change: if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) { |
LDAPControl *ctrls[2]; |
LDAPControl *ctrls[2]; |
|
|
ctrls[0] = NULL; |
ctrls[0] = NULL; |
Line 1428 syncprov_op_search( Operation *op, SlapR
|
Line 2599 syncprov_op_search( Operation *op, SlapR
|
rs->sr_ctrls = ctrls; |
rs->sr_ctrls = ctrls; |
rs->sr_err = LDAP_SUCCESS; |
rs->sr_err = LDAP_SUCCESS; |
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
|
rs->sr_ctrls = NULL; |
return rs->sr_err; |
return rs->sr_err; |
} |
} |
goto shortcut; |
goto shortcut; |
} else |
|
/* If context has changed, check for Present UUIDs */ |
|
if ( syncprov_findcsn( op, FIND_PRESENT ) != LDAP_SUCCESS ) { |
|
send_ldap_result( op, rs ); |
|
return rs->sr_err; |
|
} |
} |
|
} else { |
|
/* consumer doesn't have the right number of CSNs */ |
|
changed = SS_CHANGED; |
} |
} |
|
/* Do we have a sessionlog for this search? */ |
|
sl=si->si_logs; |
|
if ( sl ) { |
|
ldap_pvt_thread_mutex_lock( &sl->sl_mutex ); |
|
/* Are there any log entries, and is the consumer state |
|
* present in the session log? |
|
*/ |
|
if ( sl->sl_num > 0 && ber_bvcmp( &mincsn, &sl->sl_mincsn ) >= 0 ) { |
|
do_present = 0; |
|
/* mutex is unlocked in playlog */ |
|
syncprov_playlog( op, rs, sl, srs, ctxcsn, numcsns, sids ); |
|
} else { |
|
ldap_pvt_thread_mutex_unlock( &sl->sl_mutex ); |
|
} |
|
} |
|
/* Is the CSN still present in the database? */ |
|
if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) { |
|
/* No, so a reload is required */ |
|
/* the 2.2 consumer doesn't send this hint */ |
|
if ( si->si_usehint && srs->sr_rhint == 0 ) { |
|
if ( ctxcsn ) |
|
ber_bvarray_free_x( ctxcsn, op->o_tmpmemctx ); |
|
if ( sids ) |
|
op->o_tmpfree( sids, op->o_tmpmemctx ); |
|
rs->sr_err = LDAP_SYNC_REFRESH_REQUIRED; |
|
rs->sr_text = "sync cookie is stale"; |
|
goto bailout; |
|
} |
|
if ( srs->sr_state.ctxcsn ) { |
|
ber_bvarray_free_x( srs->sr_state.ctxcsn, op->o_tmpmemctx ); |
|
srs->sr_state.ctxcsn = NULL; |
|
} |
|
if ( srs->sr_state.sids ) { |
|
slap_sl_free( srs->sr_state.sids, op->o_tmpmemctx ); |
|
srs->sr_state.sids = NULL; |
|
} |
|
srs->sr_state.numcsns = 0; |
|
} else { |
|
gotstate = 1; |
|
/* If changed and doing Present lookup, send Present UUIDs */ |
|
if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) != |
|
LDAP_SUCCESS ) { |
|
if ( ctxcsn ) |
|
ber_bvarray_free_x( ctxcsn, op->o_tmpmemctx ); |
|
if ( sids ) |
|
op->o_tmpfree( sids, op->o_tmpmemctx ); |
|
goto bailout; |
|
} |
|
} |
|
} else { |
|
/* No consumer state, assume something has changed */ |
|
changed = SS_CHANGED; |
} |
} |
|
|
/* 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 1459 syncprov_op_search( Operation *op, SlapR
|
Line 2670 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 && ( changed || dirty ) ) { |
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, &mincsn, op->o_tmpmemctx ); |
|
fava->f_next = op->ors_filter; |
|
if ( sop ) |
|
ldap_pvt_thread_mutex_lock( &sop->s_mutex ); |
|
op->ors_filter = fand; |
|
filter2bv_x( op, op->ors_filter, &op->ors_filterstr ); |
|
if ( sop ) { |
|
sop->s_flags |= PS_FIX_FILTER; |
|
ldap_pvt_thread_mutex_unlock( &sop->s_mutex ); |
|
} |
} |
} |
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_flags = do_present | changed; |
|
ss->ss_ctxcsn = ctxcsn; |
|
ss->ss_numcsns = numcsns; |
|
ss->ss_sids = sids; |
cb->sc_response = syncprov_search_response; |
cb->sc_response = syncprov_search_response; |
cb->sc_cleanup = syncprov_search_cleanup; |
cb->sc_cleanup = syncprov_search_cleanup; |
cb->sc_private = ss; |
cb->sc_private = ss; |
cb->sc_next = op->o_callback; |
cb->sc_next = op->o_callback; |
op->o_callback = cb; |
op->o_callback = cb; |
|
|
op->o_sync_mode &= SLAP_CONTROL_MASK; |
|
|
|
/* If this is a persistent search and no changes were reported during |
/* If this is a persistent search and no changes were reported during |
* the refresh phase, just invoke the response callback to transition |
* the refresh phase, just invoke the response callback to transition |
* us into persist phase |
* us into persist phase |
*/ |
*/ |
if ( nochange ) { |
if ( !changed && !dirty ) { |
rs->sr_err = LDAP_SUCCESS; |
rs->sr_err = LDAP_SUCCESS; |
rs->sr_nentries = 0; |
rs->sr_nentries = 0; |
send_ldap_result( op, rs ); |
send_ldap_result( op, rs ); |
Line 1508 shortcut:
|
Line 2726 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 |
/* This prevents generating unnecessarily; frontend will strip |
if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) { |
* any statically stored copy. |
if ( argc != 3 ) { |
*/ |
fprintf( stderr, "%s: line %d: wrong number of arguments in " |
if ( op->o_sync != SLAP_CONTROL_NONE ) |
"\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno ); |
return SLAP_CB_CONTINUE; |
return -1; |
|
|
if ( rs->sr_entry && |
|
dn_match( &rs->sr_entry->e_nname, &si->si_contextdn )) { |
|
|
|
if ( SLAP_OPATTRS( rs->sr_attr_flags ) || |
|
ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) { |
|
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; |
|
} |
|
|
|
ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock ); |
|
if ( si->si_ctxcsn ) { |
|
if ( !a ) { |
|
for ( ap = &rs->sr_operational_attrs; *ap; |
|
ap=&(*ap)->a_next ); |
|
|
|
a = attr_alloc( slap_schema.si_ad_contextCSN ); |
|
*ap = a; |
|
} |
|
|
|
if ( !ap ) { |
|
if ( rs_entry2modifiable( op, rs, on )) { |
|
a = attr_find( rs->sr_entry->e_attrs, |
|
slap_schema.si_ad_contextCSN ); |
|
} |
|
if ( a->a_nvals != a->a_vals ) { |
|
ber_bvarray_free( a->a_nvals ); |
|
} |
|
a->a_nvals = NULL; |
|
ber_bvarray_free( a->a_vals ); |
|
a->a_vals = NULL; |
|
a->a_numvals = 0; |
|
} |
|
attr_valadd( a, si->si_ctxcsn, si->si_ctxcsn, si->si_numcsns ); |
|
} |
|
ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock ); |
} |
} |
si->si_chkops = atoi( argv[1] ); |
} |
si->si_chktime = atoi( argv[2] ) * 60; |
return SLAP_CB_CONTINUE; |
|
} |
|
|
|
enum { |
|
SP_CHKPT = 1, |
|
SP_SESSL, |
|
SP_NOPRES, |
|
SP_USEHINT |
|
}; |
|
|
|
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 }, |
|
{ "syncprov-reloadhint", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_USEHINT, |
|
sp_cf_gen, "( OLcfgOvAt:1.4 NAME 'olcSpReloadHint' " |
|
"DESC 'Observe Reload Hint in Request control' " |
|
"SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL }, |
|
{ NULL, NULL, 0, 0, 0, ARG_IGNORED } |
|
}; |
|
|
|
static ConfigOCs spocs[] = { |
|
{ "( OLcfgOvOc:1.1 " |
|
"NAME 'olcSyncProvConfig' " |
|
"DESC 'SyncRepl Provider configuration' " |
|
"SUP olcOverlayConfig " |
|
"MAY ( olcSpCheckpoint " |
|
"$ olcSpSessionlog " |
|
"$ olcSpNoPresent " |
|
"$ olcSpReloadHint " |
|
") )", |
|
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; |
|
/* we assume si_chktime is a multiple of 60 |
|
* because the parsed value was originally |
|
* multiplied by 60 */ |
|
bv.bv_len = snprintf( c->cr_msg, sizeof( c->cr_msg ), |
|
"%d %d", si->si_chkops, si->si_chktime/60 ); |
|
if ( bv.bv_len >= sizeof( c->cr_msg ) ) { |
|
rc = 1; |
|
} else { |
|
bv.bv_val = c->cr_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; |
|
case SP_USEHINT: |
|
if ( si->si_usehint ) { |
|
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; |
|
case SP_USEHINT: |
|
if ( si->si_usehint ) |
|
si->si_usehint = 0; |
|
else |
|
rc = LDAP_NO_SUCH_ATTRIBUTE; |
|
break; |
|
} |
|
return rc; |
|
} |
|
switch ( c->type ) { |
|
case SP_CHKPT: |
|
if ( lutil_atoi( &si->si_chkops, c->argv[1] ) != 0 ) { |
|
snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s unable to parse checkpoint ops # \"%s\"", |
|
c->argv[0], c->argv[1] ); |
|
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->cr_msg, 0 ); |
|
return ARG_BAD_CONF; |
|
} |
|
if ( si->si_chkops <= 0 ) { |
|
snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s invalid checkpoint ops # \"%d\"", |
|
c->argv[0], si->si_chkops ); |
|
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->cr_msg, 0 ); |
|
return ARG_BAD_CONF; |
|
} |
|
if ( lutil_atoi( &si->si_chktime, c->argv[2] ) != 0 ) { |
|
snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s unable to parse checkpoint time \"%s\"", |
|
c->argv[0], c->argv[1] ); |
|
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->cr_msg, 0 ); |
|
return ARG_BAD_CONF; |
|
} |
|
if ( si->si_chktime <= 0 ) { |
|
snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s invalid checkpoint time \"%d\"", |
|
c->argv[0], si->si_chkops ); |
|
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->cr_msg, 0 ); |
|
return ARG_BAD_CONF; |
|
} |
|
si->si_chktime *= 60; |
|
break; |
|
case SP_SESSL: { |
|
sessionlog *sl; |
|
int size = c->value_int; |
|
|
|
if ( size < 0 ) { |
|
snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s size %d is negative", |
|
c->argv[0], size ); |
|
Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE, |
|
"%s: %s\n", c->log, c->cr_msg, 0 ); |
|
return ARG_BAD_CONF; |
|
} |
|
sl = si->si_logs; |
|
if ( !sl ) { |
|
sl = ch_malloc( sizeof( sessionlog ) + LDAP_PVT_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; |
|
case SP_USEHINT: |
|
si->si_usehint = 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, |
|
ConfigReply *cr |
|
) |
|
{ |
|
slap_overinst *on = (slap_overinst *) be->bd_info; |
|
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
|
|
|
Connection conn = { 0 }; |
|
OperationBuffer opbuf; |
|
Operation *op; |
|
Entry *e = NULL; |
|
Attribute *a; |
|
int rc; |
|
void *thrctx = NULL; |
|
|
|
if ( !SLAP_LASTMOD( be )) { |
|
Debug( LDAP_DEBUG_ANY, |
|
"syncprov_db_open: invalid config, lastmod must be enabled\n", 0, 0, 0 ); |
|
return -1; |
|
} |
|
|
|
if ( slapMode & SLAP_TOOL_MODE ) { |
|
return 0; |
|
} |
|
|
|
rc = overlay_register_control( be, LDAP_CONTROL_SYNC ); |
|
if ( rc ) { |
|
return rc; |
|
} |
|
|
|
thrctx = ldap_pvt_thread_pool_context(); |
|
connection_fake_init2( &conn, &opbuf, thrctx, 0 ); |
|
op = &opbuf.ob_op; |
|
op->o_bd = be; |
|
op->o_dn = be->be_rootdn; |
|
op->o_ndn = be->be_rootndn; |
|
|
|
if ( SLAP_SYNC_SUBENTRY( be )) { |
|
build_new_dn( &si->si_contextdn, be->be_nsuffix, |
|
(struct berval *)&slap_ldapsync_cn_bv, NULL ); |
} else { |
} else { |
return SLAP_CONF_UNKNOWN; |
si->si_contextdn = be->be_nsuffix[0]; |
} |
} |
#endif |
rc = overlay_entry_get_ov( op, &si->si_contextdn, NULL, |
|
slap_schema.si_ad_contextCSN, 0, &e, on ); |
|
|
|
if ( e ) { |
|
ldap_pvt_thread_t tid; |
|
|
|
a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN ); |
|
if ( a ) { |
|
ber_bvarray_dup_x( &si->si_ctxcsn, a->a_vals, NULL ); |
|
si->si_numcsns = a->a_numvals; |
|
si->si_sids = slap_parse_csn_sids( si->si_ctxcsn, a->a_numvals, NULL ); |
|
} |
|
overlay_entry_release_ov( op, e, 0, on ); |
|
if ( si->si_ctxcsn && !SLAP_DBCLEAN( be )) { |
|
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 ); |
|
} |
|
} |
|
|
|
/* Didn't find a contextCSN, should we generate one? */ |
|
if ( !si->si_ctxcsn ) { |
|
char csnbuf[ LDAP_PVT_CSNSTR_BUFSIZE ]; |
|
struct berval csn; |
|
|
|
if ( SLAP_SYNC_SHADOW( op->o_bd )) { |
|
/* If we're also a consumer, then don't generate anything. |
|
* Wait for our provider to send it to us, or for a local |
|
* modify if we have multimaster. |
|
*/ |
|
goto out; |
|
} |
|
csn.bv_val = csnbuf; |
|
csn.bv_len = sizeof( csnbuf ); |
|
slap_get_csn( op, &csn, 0 ); |
|
value_add_one( &si->si_ctxcsn, &csn ); |
|
si->si_numcsns = 1; |
|
si->si_sids = ch_malloc( sizeof(int) ); |
|
si->si_sids[0] = slap_serverID; |
|
|
|
/* make sure we do a checkpoint on close */ |
|
si->si_numops++; |
|
} |
|
|
|
/* Initialize the sessionlog mincsn */ |
|
if ( si->si_logs && si->si_numcsns ) { |
|
sessionlog *sl = si->si_logs; |
|
int i; |
|
/* If there are multiple, find the newest */ |
|
for ( i=0; i < si->si_numcsns; i++ ) { |
|
if ( ber_bvcmp( &sl->sl_mincsn, &si->si_ctxcsn[i] ) < 0 ) { |
|
AC_MEMCPY( sl->sl_mincsn.bv_val, si->si_ctxcsn[i].bv_val, |
|
si->si_ctxcsn[i].bv_len ); |
|
sl->sl_mincsn.bv_len = si->si_ctxcsn[i].bv_len; |
|
} |
|
} |
|
} |
|
|
|
out: |
|
op->o_bd->bd_info = (BackendInfo *)on; |
|
return 0; |
|
} |
|
|
|
/* Write the current contextCSN into the underlying db. |
|
*/ |
|
static int |
|
syncprov_db_close( |
|
BackendDB *be, |
|
ConfigReply *cr |
|
) |
|
{ |
|
slap_overinst *on = (slap_overinst *) be->bd_info; |
|
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
|
|
return SLAP_CONF_UNKNOWN; |
if ( slapMode & SLAP_TOOL_MODE ) { |
|
return 0; |
|
} |
|
if ( si->si_numops ) { |
|
Connection conn = {0}; |
|
OperationBuffer opbuf; |
|
Operation *op; |
|
void *thrctx; |
|
|
|
thrctx = ldap_pvt_thread_pool_context(); |
|
connection_fake_init2( &conn, &opbuf, thrctx, 0 ); |
|
op = &opbuf.ob_op; |
|
op->o_bd = be; |
|
op->o_dn = be->be_rootdn; |
|
op->o_ndn = be->be_rootndn; |
|
syncprov_checkpoint( op, on ); |
|
} |
|
|
|
return 0; |
} |
} |
|
|
static int |
static int |
syncprov_db_init( |
syncprov_db_init( |
BackendDB *be |
BackendDB *be, |
|
ConfigReply *cr |
) |
) |
{ |
{ |
slap_overinst *on = (slap_overinst *)be->bd_info; |
slap_overinst *on = (slap_overinst *)be->bd_info; |
syncprov_info_t *si; |
syncprov_info_t *si; |
|
|
|
if ( SLAP_ISGLOBALOVERLAY( be ) ) { |
|
Debug( LDAP_DEBUG_ANY, |
|
"syncprov must be instantiated within a database.\n", |
|
0, 0, 0 ); |
|
return 1; |
|
} |
|
|
si = ch_calloc(1, sizeof(syncprov_info_t)); |
si = ch_calloc(1, sizeof(syncprov_info_t)); |
on->on_bi.bi_private = si; |
on->on_bi.bi_private = si; |
ldap_pvt_thread_mutex_init( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_init( &si->si_csn_rwlock ); |
ldap_pvt_thread_mutex_init( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_init( &si->si_ops_mutex ); |
si->si_ctxcsn.bv_val = si->si_ctxcsnbuf; |
ldap_pvt_thread_mutex_init( &si->si_mods_mutex ); |
|
ldap_pvt_thread_mutex_init( &si->si_resp_mutex ); |
|
|
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 1562 syncprov_db_init(
|
Line 3162 syncprov_db_init(
|
|
|
static int |
static int |
syncprov_db_destroy( |
syncprov_db_destroy( |
BackendDB *be |
BackendDB *be, |
|
ConfigReply *cr |
) |
) |
{ |
{ |
slap_overinst *on = (slap_overinst *)be->bd_info; |
slap_overinst *on = (slap_overinst *)be->bd_info; |
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private; |
|
|
if ( si ) { |
if ( si ) { |
|
if ( si->si_logs ) { |
|
slog_entry *se = si->si_logs->sl_head; |
|
|
|
while ( se ) { |
|
slog_entry *se_next = se->se_next; |
|
ch_free( se ); |
|
se = se_next; |
|
} |
|
|
|
ldap_pvt_thread_mutex_destroy(&si->si_logs->sl_mutex); |
|
ch_free( si->si_logs ); |
|
} |
|
if ( si->si_ctxcsn ) |
|
ber_bvarray_free( si->si_ctxcsn ); |
|
if ( si->si_sids ) |
|
ch_free( si->si_sids ); |
|
ldap_pvt_thread_mutex_destroy( &si->si_resp_mutex ); |
|
ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex ); |
ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex ); |
ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex ); |
ldap_pvt_thread_rdwr_destroy( &si->si_csn_rwlock ); |
ch_free( si ); |
ch_free( si ); |
} |
} |
|
|
Line 1583 static int syncprov_parseCtrl (
|
Line 3202 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 1600 static int syncprov_parseCtrl (
|
Line 3220 static int syncprov_parseCtrl (
|
return LDAP_PROTOCOL_ERROR; |
return LDAP_PROTOCOL_ERROR; |
} |
} |
|
|
if ( ctrl->ldctl_value.bv_len == 0 ) { |
if ( BER_BVISNULL( &ctrl->ldctl_value ) ) { |
rs->sr_text = "Sync control value is empty (or absent)"; |
rs->sr_text = "Sync control value is absent"; |
|
return LDAP_PROTOCOL_ERROR; |
|
} |
|
|
|
if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) { |
|
rs->sr_text = "Sync control value is empty"; |
return LDAP_PROTOCOL_ERROR; |
return LDAP_PROTOCOL_ERROR; |
} |
} |
|
|
Line 1617 static int syncprov_parseCtrl (
|
Line 3242 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 1643 static int syncprov_parseCtrl (
|
Line 3264 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; |
} |
} |
|
tag = ber_peek_tag( ber, &len ); |
} |
} |
if ( tag == LDAP_TAG_RELOAD_HINT ) { |
if ( tag == LDAP_TAG_RELOAD_HINT ) { |
if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) { |
if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) { |
Line 1661 static int syncprov_parseCtrl (
|
Line 3283 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 ); |
/* If parse fails, pretend no cookie was sent */ |
|
if ( slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx ) || |
|
sr->sr_state.rid == -1 ) { |
|
if ( sr->sr_state.ctxcsn ) { |
|
ber_bvarray_free_x( sr->sr_state.ctxcsn, op->o_tmpmemctx ); |
|
sr->sr_state.ctxcsn = NULL; |
|
} |
|
sr->sr_state.numcsns = 0; |
|
} |
} |
} |
|
|
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 1686 static int syncprov_parseCtrl (
|
Line 3314 static int syncprov_parseCtrl (
|
static slap_overinst syncprov; |
static slap_overinst syncprov; |
|
|
int |
int |
syncprov_init() |
syncprov_initialize() |
{ |
{ |
int rc; |
int rc; |
|
|
rc = register_supported_control( LDAP_CONTROL_SYNC, |
rc = register_supported_control( LDAP_CONTROL_SYNC, |
SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL, |
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 |
generic_filter.f_desc = slap_schema.si_ad_objectClass; |
|
|
|
rc = config_register_schema( spcfg, spocs ); |
|
if ( rc ) return rc; |
|
|
return overlay_register( &syncprov ); |
return overlay_register( &syncprov ); |
} |
} |
Line 1727 syncprov_init()
|
Line 3359 syncprov_init()
|
int |
int |
init_module( int argc, char *argv[] ) |
init_module( int argc, char *argv[] ) |
{ |
{ |
return syncprov_init(); |
return syncprov_initialize(); |
} |
} |
#endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */ |
#endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */ |
|
|