2 /* syncprov.c - syncrepl provider */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2004-2010 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
17 * This work was initially developed by Howard Chu for inclusion in
23 #ifdef SLAPD_OVER_SYNCPROV
25 #include <ac/string.h>
35 /* A modify request on a particular entry */
36 typedef struct modinst {
37 struct modinst *mi_next;
41 typedef struct modtarget {
42 struct modinst *mt_mods;
43 struct modinst *mt_tail;
45 ldap_pvt_thread_mutex_t mt_mutex;
48 /* A queued result of a persistent search */
49 typedef struct syncres {
50 struct syncres *s_next;
60 /* Record of a persistent search */
61 typedef struct syncops {
62 struct syncops *s_next;
63 struct berval s_base; /* ndn of search base */
64 ID s_eid; /* entryID of search base */
65 Operation *s_op; /* search op */
68 struct berval s_filterstr;
69 int s_flags; /* search status */
70 #define PS_IS_REFRESHING 0x01
71 #define PS_IS_DETACHED 0x02
72 #define PS_WROTE_BASE 0x04
73 #define PS_FIND_BASE 0x08
74 #define PS_FIX_FILTER 0x10
75 #define PS_TASK_QUEUED 0x20
77 int s_inuse; /* reference count */
78 struct syncres *s_res;
79 struct syncres *s_restail;
80 ldap_pvt_thread_mutex_t s_mutex;
83 /* A received sync control */
84 typedef struct sync_control {
85 struct sync_cookie sr_state;
89 #if 0 /* moved back to slap.h */
90 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
92 /* o_sync_mode uses data bits of o_sync */
93 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
95 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
96 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
97 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
98 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
100 /* Record of which searches matched at premodify step */
101 typedef struct syncmatches {
102 struct syncmatches *sm_next;
106 /* Session log data */
107 typedef struct slog_entry {
108 struct slog_entry *se_next;
109 struct berval se_uuid;
110 struct berval se_csn;
115 typedef struct sessionlog {
120 ldap_pvt_thread_mutex_t sl_mutex;
123 /* The main state for this overlay */
124 typedef struct syncprov_info_t {
126 BerVarray si_ctxcsn; /* ldapsync context */
127 struct berval si_contextdn;
130 int si_chkops; /* checkpointing info */
132 int si_numops; /* number of ops since last checkpoint */
133 int si_nopres; /* Skip present phase */
134 int si_usehint; /* use reload hint */
135 int si_active; /* True if there are active mods */
136 int si_dirty; /* True if the context is dirty, i.e changes
137 * have been made without updating the csn. */
138 time_t si_chklast; /* time of last checkpoint */
139 Avlnode *si_mods; /* entries being modified */
141 ldap_pvt_thread_rdwr_t si_csn_rwlock;
142 ldap_pvt_thread_mutex_t si_ops_mutex;
143 ldap_pvt_thread_mutex_t si_mods_mutex;
144 ldap_pvt_thread_mutex_t si_resp_mutex;
147 typedef struct opcookie {
149 syncmatches *smatches;
152 struct berval sdn; /* DN of entry, for deletes */
154 struct berval suuid; /* UUID of entry */
155 struct berval sctxcsn;
156 short osid; /* sid of op csn */
157 short rsid; /* sid of relay */
158 short sreference; /* Is the entry a reference? */
161 typedef struct mutexint {
162 ldap_pvt_thread_mutex_t mi_mutex;
166 typedef struct fbase_cookie {
167 struct berval *fdn; /* DN of a modified entry, for scope testing */
168 syncops *fss; /* persistent search we're testing against */
169 int fbase; /* if TRUE we found the search base and it's still valid */
170 int fscope; /* if TRUE then fdn is within the psearch scope */
173 static AttributeName csn_anlist[3];
174 static AttributeName uuid_anlist[2];
176 /* Build a LDAPsync intermediate state control */
182 int entry_sync_state,
186 struct berval *cookie )
191 BerElementBuffer berbuf;
192 BerElement *ber = (BerElement *)&berbuf;
194 struct berval entryuuid_bv = BER_BVNULL;
196 ber_init2( ber, 0, LBER_USE_DER );
197 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
199 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
201 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
202 AttributeDescription *desc = a->a_desc;
203 if ( desc == slap_schema.si_ad_entryUUID ) {
204 entryuuid_bv = a->a_nvals[0];
209 /* FIXME: what if entryuuid is NULL or empty ? */
211 if ( send_cookie && cookie ) {
212 ber_printf( ber, "{eOON}",
213 entry_sync_state, &entryuuid_bv, cookie );
215 ber_printf( ber, "{eON}",
216 entry_sync_state, &entryuuid_bv );
219 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
220 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
221 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
226 Debug( LDAP_DEBUG_TRACE,
227 "slap_build_sync_ctrl: ber_flatten2 failed\n",
229 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
236 /* Build a LDAPsync final state control */
244 struct berval *cookie,
248 BerElementBuffer berbuf;
249 BerElement *ber = (BerElement *)&berbuf;
251 ber_init2( ber, NULL, LBER_USE_DER );
252 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
254 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
256 ber_printf( ber, "{" );
257 if ( send_cookie && cookie ) {
258 ber_printf( ber, "O", cookie );
260 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
261 ber_printf( ber, "b", refreshDeletes );
263 ber_printf( ber, "N}" );
265 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
266 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
267 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
272 Debug( LDAP_DEBUG_TRACE,
273 "syncprov_done_ctrl: ber_flatten2 failed\n",
275 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
287 struct berval *cookie,
292 BerElementBuffer berbuf;
293 BerElement *ber = (BerElement *)&berbuf;
294 struct berval rspdata;
298 ber_init2( ber, NULL, LBER_USE_DER );
299 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
303 case LDAP_TAG_SYNC_NEW_COOKIE:
304 ber_printf( ber, "tO", type, cookie );
306 case LDAP_TAG_SYNC_REFRESH_DELETE:
307 case LDAP_TAG_SYNC_REFRESH_PRESENT:
308 ber_printf( ber, "t{", type );
310 ber_printf( ber, "O", cookie );
312 if ( refreshDone == 0 ) {
313 ber_printf( ber, "b", refreshDone );
315 ber_printf( ber, "N}" );
317 case LDAP_TAG_SYNC_ID_SET:
318 ber_printf( ber, "t{", type );
320 ber_printf( ber, "O", cookie );
322 if ( refreshDeletes == 1 ) {
323 ber_printf( ber, "b", refreshDeletes );
325 ber_printf( ber, "[W]", syncUUIDs );
326 ber_printf( ber, "N}" );
329 Debug( LDAP_DEBUG_TRACE,
330 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
336 ret = ber_flatten2( ber, &rspdata, 0 );
339 Debug( LDAP_DEBUG_TRACE,
340 "syncprov_sendinfo: ber_flatten2 failed\n",
342 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
346 rs->sr_rspoid = LDAP_SYNC_INFO;
347 rs->sr_rspdata = &rspdata;
348 send_ldap_intermediate( op, rs );
349 rs->sr_rspdata = NULL;
355 /* Find a modtarget in an AVL tree */
357 sp_avl_cmp( const void *c1, const void *c2 )
359 const modtarget *m1, *m2;
363 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
366 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
369 /* syncprov_findbase:
370 * finds the true DN of the base of a search (with alias dereferencing) and
371 * checks to make sure the base entry doesn't get replaced with a different
372 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
373 * change is detected, any persistent search on this base must be terminated /
375 * On the first call, we just save the DN and entryID. On subsequent calls
376 * we compare the DN and entryID with the saved values.
379 findbase_cb( Operation *op, SlapReply *rs )
381 slap_callback *sc = op->o_callback;
383 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
384 fbase_cookie *fc = sc->sc_private;
386 /* If no entryID, we're looking for the first time.
387 * Just store whatever we got.
389 if ( fc->fss->s_eid == NOID ) {
391 fc->fss->s_eid = rs->sr_entry->e_id;
392 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
394 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
395 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
397 /* OK, the DN is the same and the entryID is the same. */
401 if ( rs->sr_err != LDAP_SUCCESS ) {
402 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
407 static Filter generic_filter = { LDAP_FILTER_PRESENT, { 0 }, NULL };
408 static struct berval generic_filterstr = BER_BVC("(objectclass=*)");
411 syncprov_findbase( Operation *op, fbase_cookie *fc )
413 /* Use basic parameters from syncrepl search, but use
414 * current op's threadctx / tmpmemctx
416 ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex );
417 if ( fc->fss->s_flags & PS_FIND_BASE ) {
418 slap_callback cb = {0};
420 SlapReply frs = { REP_RESULT };
423 fc->fss->s_flags ^= PS_FIND_BASE;
424 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
426 fop = *fc->fss->s_op;
428 fop.o_bd = fop.o_bd->bd_self;
429 fop.o_hdr = op->o_hdr;
430 fop.o_time = op->o_time;
431 fop.o_tincr = op->o_tincr;
433 cb.sc_response = findbase_cb;
436 fop.o_sync_mode = 0; /* turn off sync mode */
437 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
438 fop.o_callback = &cb;
439 fop.o_tag = LDAP_REQ_SEARCH;
440 fop.ors_scope = LDAP_SCOPE_BASE;
441 fop.ors_limit = NULL;
443 fop.ors_tlimit = SLAP_NO_LIMIT;
444 fop.ors_attrs = slap_anlist_no_attrs;
445 fop.ors_attrsonly = 1;
446 fop.ors_filter = &generic_filter;
447 fop.ors_filterstr = generic_filterstr;
449 rc = fop.o_bd->be_search( &fop, &frs );
451 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
455 /* After the first call, see if the fdn resides in the scope */
456 if ( fc->fbase == 1 ) {
457 switch ( fc->fss->s_op->ors_scope ) {
458 case LDAP_SCOPE_BASE:
459 fc->fscope = dn_match( fc->fdn, &fc->fss->s_base );
461 case LDAP_SCOPE_ONELEVEL: {
463 dnParent( fc->fdn, &pdn );
464 fc->fscope = dn_match( &pdn, &fc->fss->s_base );
466 case LDAP_SCOPE_SUBTREE:
467 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base );
469 case LDAP_SCOPE_SUBORDINATE:
470 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) &&
471 !dn_match( fc->fdn, &fc->fss->s_base );
479 /* If entryID has changed, then the base of this search has
480 * changed. Invalidate the psearch.
482 return LDAP_NO_SUCH_OBJECT;
486 * This function has three different purposes, but they all use a search
487 * that filters on entryCSN so they're combined here.
488 * 1: at startup time, after a contextCSN has been read from the database,
489 * we search for all entries with CSN >= contextCSN in case the contextCSN
490 * was not checkpointed at the previous shutdown.
492 * 2: when the current contextCSN is known and we have a sync cookie, we search
493 * for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.
494 * If an entry is found, the cookie CSN is valid, otherwise it is stale.
496 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
497 * CSN, and generate Present records for them. We always collect this result
498 * in SyncID sets, even if there's only one match.
500 typedef enum find_csn_t {
507 findmax_cb( Operation *op, SlapReply *rs )
509 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
510 struct berval *maxcsn = op->o_callback->sc_private;
511 Attribute *a = attr_find( rs->sr_entry->e_attrs,
512 slap_schema.si_ad_entryCSN );
514 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 &&
515 slap_parse_csn_sid( &a->a_vals[0] ) == slap_serverID ) {
516 maxcsn->bv_len = a->a_vals[0].bv_len;
517 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
524 findcsn_cb( Operation *op, SlapReply *rs )
526 slap_callback *sc = op->o_callback;
528 /* We just want to know that at least one exists, so it's OK if
529 * we exceed the unchecked limit.
531 if ( rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED ||
532 (rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS )) {
533 sc->sc_private = (void *)1;
538 /* Build a list of entryUUIDs for sending in a SyncID set */
542 typedef struct fpres_cookie {
549 findpres_cb( Operation *op, SlapReply *rs )
551 slap_callback *sc = op->o_callback;
552 fpres_cookie *pc = sc->sc_private;
554 int ret = SLAP_CB_CONTINUE;
556 switch ( rs->sr_type ) {
558 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
560 pc->uuids[pc->num].bv_val = pc->last;
561 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
562 pc->uuids[pc->num].bv_len );
564 pc->last = pc->uuids[pc->num].bv_val;
565 pc->uuids[pc->num].bv_val = NULL;
568 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
574 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
576 pc->uuids[pc->num].bv_val = pc->last;
578 pc->last = pc->uuids[0].bv_val;
588 syncprov_findcsn( Operation *op, find_csn_t mode )
590 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
591 syncprov_info_t *si = on->on_bi.bi_private;
593 slap_callback cb = {0};
595 SlapReply frs = { REP_RESULT };
596 char buf[LDAP_PVT_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
597 char cbuf[LDAP_PVT_CSNSTR_BUFSIZE];
598 struct berval maxcsn;
600 AttributeAssertion eq = ATTRIBUTEASSERTION_INIT;
601 fpres_cookie pcookie;
602 sync_control *srs = NULL;
603 struct slap_limits_set fc_limits;
604 int i, rc = LDAP_SUCCESS, findcsn_retry = 1;
607 if ( mode != FIND_MAXCSN ) {
608 srs = op->o_controls[slap_cids.sc_LDAPsync];
612 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
613 /* We want pure entries, not referrals */
614 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
617 cf.f_av_desc = slap_schema.si_ad_entryCSN;
618 BER_BVZERO( &cf.f_av_value );
621 fop.o_callback = &cb;
622 fop.ors_limit = NULL;
623 fop.ors_tlimit = SLAP_NO_LIMIT;
624 fop.ors_filter = &cf;
625 fop.ors_filterstr.bv_val = buf;
630 cf.f_choice = LDAP_FILTER_GE;
631 /* If there are multiple CSNs, use the one with our serverID */
632 for ( i=0; i<si->si_numcsns; i++) {
633 if ( slap_serverID == si->si_sids[i] ) {
638 if ( i == si->si_numcsns ) {
639 /* No match: this is multimaster, and none of the content in the DB
640 * originated locally. Treat like no CSN.
642 return LDAP_NO_SUCH_OBJECT;
644 cf.f_av_value = si->si_ctxcsn[maxid];
645 fop.ors_filterstr.bv_len = snprintf( buf, sizeof( buf ),
646 "(entryCSN>=%s)", cf.f_av_value.bv_val );
647 if ( fop.ors_filterstr.bv_len >= sizeof( buf ) ) {
650 fop.ors_attrsonly = 0;
651 fop.ors_attrs = csn_anlist;
652 fop.ors_slimit = SLAP_NO_LIMIT;
653 cb.sc_private = &maxcsn;
654 cb.sc_response = findmax_cb;
655 strcpy( cbuf, cf.f_av_value.bv_val );
656 maxcsn.bv_val = cbuf;
657 maxcsn.bv_len = cf.f_av_value.bv_len;
660 if ( BER_BVISEMPTY( &cf.f_av_value )) {
661 cf.f_av_value = srs->sr_state.ctxcsn[0];
662 /* If there are multiple CSNs, use the smallest */
663 for ( i=1; i<srs->sr_state.numcsns; i++ ) {
664 if ( ber_bvcmp( &cf.f_av_value, &srs->sr_state.ctxcsn[i] )
666 cf.f_av_value = srs->sr_state.ctxcsn[i];
670 /* Look for exact match the first time */
671 if ( findcsn_retry ) {
672 cf.f_choice = LDAP_FILTER_EQUALITY;
673 fop.ors_filterstr.bv_len = snprintf( buf, sizeof( buf ),
674 "(entryCSN=%s)", cf.f_av_value.bv_val );
675 /* On retry, look for <= */
677 cf.f_choice = LDAP_FILTER_LE;
678 fop.ors_limit = &fc_limits;
679 memset( &fc_limits, 0, sizeof( fc_limits ));
680 fc_limits.lms_s_unchecked = 1;
681 fop.ors_filterstr.bv_len = snprintf( buf, sizeof( buf ),
682 "(entryCSN<=%s)", cf.f_av_value.bv_val );
684 if ( fop.ors_filterstr.bv_len >= sizeof( buf ) ) {
687 fop.ors_attrsonly = 1;
688 fop.ors_attrs = slap_anlist_no_attrs;
690 cb.sc_private = NULL;
691 cb.sc_response = findcsn_cb;
694 fop.ors_filter = op->ors_filter;
695 fop.ors_filterstr = op->ors_filterstr;
696 fop.ors_attrsonly = 0;
697 fop.ors_attrs = uuid_anlist;
698 fop.ors_slimit = SLAP_NO_LIMIT;
699 cb.sc_private = &pcookie;
700 cb.sc_response = findpres_cb;
703 /* preallocate storage for a full set */
704 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
705 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
707 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
708 pcookie.uuids[0].bv_val = pcookie.last;
709 pcookie.uuids[0].bv_len = UUID_LEN;
710 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
711 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
712 pcookie.uuids[i].bv_len = UUID_LEN;
717 fop.o_bd->bd_info = (BackendInfo *)on->on_info;
718 fop.o_bd->be_search( &fop, &frs );
719 fop.o_bd->bd_info = (BackendInfo *)on;
723 if ( ber_bvcmp( &si->si_ctxcsn[maxid], &maxcsn )) {
725 Syntax *syn = slap_schema.si_ad_contextCSN->ad_type->sat_syntax;
726 assert( !syn->ssyn_validate( syn, &maxcsn ));
728 ber_bvreplace( &si->si_ctxcsn[maxid], &maxcsn );
729 si->si_numops++; /* ensure a checkpoint */
733 /* If matching CSN was not found, invalidate the context. */
734 if ( !cb.sc_private ) {
735 /* If we didn't find an exact match, then try for <= */
736 if ( findcsn_retry ) {
738 rs_reinit( &frs, REP_RESULT );
741 rc = LDAP_NO_SUCH_OBJECT;
745 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
752 /* Should find a place to cache these */
753 static mutexint *get_mutexint()
755 mutexint *mi = ch_malloc( sizeof( mutexint ));
756 ldap_pvt_thread_mutex_init( &mi->mi_mutex );
761 static void inc_mutexint( mutexint *mi )
763 ldap_pvt_thread_mutex_lock( &mi->mi_mutex );
765 ldap_pvt_thread_mutex_unlock( &mi->mi_mutex );
768 /* return resulting counter */
769 static int dec_mutexint( mutexint *mi )
772 ldap_pvt_thread_mutex_lock( &mi->mi_mutex );
774 ldap_pvt_thread_mutex_unlock( &mi->mi_mutex );
776 ldap_pvt_thread_mutex_destroy( &mi->mi_mutex );
783 syncprov_free_syncop( syncops *so )
785 syncres *sr, *srnext;
786 GroupAssertion *ga, *gnext;
788 ldap_pvt_thread_mutex_lock( &so->s_mutex );
789 /* already being freed, or still in use */
790 if ( !so->s_inuse || --so->s_inuse > 0 ) {
791 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
794 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
795 if ( so->s_flags & PS_IS_DETACHED ) {
796 filter_free( so->s_op->ors_filter );
797 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
803 ch_free( so->s_base.bv_val );
804 for ( sr=so->s_res; sr; sr=srnext ) {
807 if ( !dec_mutexint( sr->s_e->e_private )) {
808 sr->s_e->e_private = NULL;
809 entry_free( sr->s_e );
814 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
818 /* Send a persistent search response */
820 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, int mode )
822 SlapReply rs = { REP_SEARCH };
823 LDAPControl *ctrls[2];
824 struct berval cookie = BER_BVNULL, csns[2];
826 Attribute a_uuid = {0};
828 if ( so->s_op->o_abandon )
829 return SLAPD_ABANDON;
832 if ( !BER_BVISNULL( &opc->sctxcsn )) {
833 csns[0] = opc->sctxcsn;
834 BER_BVZERO( &csns[1] );
835 slap_compose_sync_cookie( op, &cookie, csns, so->s_rid, slap_serverID ? slap_serverID : -1 );
839 if ( so->s_sid > 0 ) {
840 Debug( LDAP_DEBUG_SYNC, "syncprov_sendresp: to=%03x, cookie=%s\n",
841 so->s_sid, cookie.bv_val ? cookie.bv_val : "", 0 );
843 Debug( LDAP_DEBUG_SYNC, "syncprov_sendresp: cookie=%s\n",
844 cookie.bv_val ? cookie.bv_val : "", 0, 0 );
848 e_uuid.e_attrs = &a_uuid;
849 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
850 a_uuid.a_nvals = &opc->suuid;
851 rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid,
852 mode, ctrls, 0, 1, &cookie );
853 if ( !BER_BVISNULL( &cookie )) {
854 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
858 rs.sr_entry = &e_uuid;
859 if ( mode == LDAP_SYNC_ADD || mode == LDAP_SYNC_MODIFY ) {
861 e_uuid.e_private = NULL;
866 if ( opc->sreference && so->s_op->o_managedsait <= SLAP_CONTROL_IGNORED ) {
867 rs.sr_ref = get_entry_referrals( op, rs.sr_entry );
868 rs.sr_err = send_search_reference( op, &rs );
869 ber_bvarray_free( rs.sr_ref );
873 case LDAP_SYNC_MODIFY:
874 rs.sr_attrs = op->ors_attrs;
875 rs.sr_err = send_search_entry( op, &rs );
877 case LDAP_SYNC_DELETE:
878 e_uuid.e_attrs = NULL;
879 e_uuid.e_name = opc->sdn;
880 e_uuid.e_nname = opc->sndn;
881 if ( opc->sreference && so->s_op->o_managedsait <= SLAP_CONTROL_IGNORED ) {
882 struct berval bv = BER_BVNULL;
884 rs.sr_err = send_search_reference( op, &rs );
886 rs.sr_err = send_search_entry( op, &rs );
892 /* In case someone else freed it already? */
895 for ( i=0; rs.sr_ctrls[i]; i++ ) {
896 if ( rs.sr_ctrls[i] == ctrls[0] ) {
897 op->o_tmpfree( ctrls[0]->ldctl_value.bv_val, op->o_tmpmemctx );
898 ctrls[0]->ldctl_value.bv_val = NULL;
909 syncprov_qstart( syncops *so );
911 /* Play back queued responses */
913 syncprov_qplay( Operation *op, syncops *so )
915 slap_overinst *on = LDAP_SLIST_FIRST(&so->s_op->o_extra)->oe_key;
923 ldap_pvt_thread_mutex_lock( &so->s_mutex );
926 so->s_res = sr->s_next;
928 so->s_restail = NULL;
929 /* Exit loop with mutex held */
930 if ( !sr || so->s_op->o_abandon )
932 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
934 if ( sr->s_mode == LDAP_SYNC_NEW_COOKIE ) {
935 SlapReply rs = { REP_INTERMEDIATE };
937 rc = syncprov_sendinfo( op, &rs, LDAP_TAG_SYNC_NEW_COOKIE,
938 &sr->s_csn, 0, NULL, 0 );
941 opc.sndn = sr->s_ndn;
942 opc.suuid = sr->s_uuid;
943 opc.sctxcsn = sr->s_csn;
944 opc.sreference = sr->s_isreference;
947 rc = syncprov_sendresp( op, &opc, so, sr->s_mode );
951 if ( !dec_mutexint( sr->s_e->e_private )) {
952 sr->s_e->e_private = NULL;
953 entry_free ( sr->s_e );
959 /* Exit loop with mutex held */
960 ldap_pvt_thread_mutex_lock( &so->s_mutex );
964 /* We now only send one change at a time, to prevent one
965 * psearch from hogging all the CPU. Resubmit this task if
966 * there are more responses queued and no errors occurred.
969 if ( rc == 0 && so->s_res ) {
970 syncprov_qstart( so );
972 so->s_flags ^= PS_TASK_QUEUED;
975 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
979 /* task for playing back queued responses */
981 syncprov_qtask( void *ctx, void *arg )
984 OperationBuffer opbuf;
991 op->o_hdr = &opbuf.ob_hdr;
992 op->o_controls = opbuf.ob_controls;
993 memset( op->o_controls, 0, sizeof(opbuf.ob_controls) );
995 *op->o_hdr = *so->s_op->o_hdr;
997 op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx, 1);
998 op->o_tmpmfuncs = &slap_sl_mfuncs;
999 op->o_threadctx = ctx;
1001 /* syncprov_qplay expects a fake db */
1002 be = *so->s_op->o_bd;
1003 be.be_flags |= SLAP_DBFLAG_OVERLAY;
1005 LDAP_SLIST_FIRST(&op->o_extra) = NULL;
1006 op->o_callback = NULL;
1008 rc = syncprov_qplay( op, so );
1010 /* decrement use count... */
1011 syncprov_free_syncop( so );
1016 /* Start the task to play back queued psearch responses */
1018 syncprov_qstart( syncops *so )
1020 so->s_flags |= PS_TASK_QUEUED;
1022 ldap_pvt_thread_pool_submit( &connection_pool,
1023 syncprov_qtask, so );
1026 /* Queue a persistent search response */
1028 syncprov_qresp( opcookie *opc, syncops *so, int mode )
1032 struct berval cookie = opc->sctxcsn;
1034 if ( mode == LDAP_SYNC_NEW_COOKIE ) {
1035 syncprov_info_t *si = opc->son->on_bi.bi_private;
1037 slap_compose_sync_cookie( NULL, &cookie, si->si_ctxcsn,
1038 so->s_rid, slap_serverID ? slap_serverID : -1);
1041 srsize = sizeof(syncres) + opc->suuid.bv_len + 1 +
1042 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1;
1043 if ( cookie.bv_len )
1044 srsize += cookie.bv_len + 1;
1045 sr = ch_malloc( srsize );
1048 /* bump refcount on this entry */
1050 inc_mutexint( opc->se->e_private );
1051 sr->s_dn.bv_val = (char *)(sr + 1);
1052 sr->s_dn.bv_len = opc->sdn.bv_len;
1054 sr->s_isreference = opc->sreference;
1055 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val,
1056 opc->sdn.bv_val ) + 1;
1057 sr->s_ndn.bv_len = opc->sndn.bv_len;
1058 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val,
1059 opc->sndn.bv_val ) + 1;
1060 sr->s_uuid.bv_len = opc->suuid.bv_len;
1061 AC_MEMCPY( sr->s_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1062 if ( cookie.bv_len ) {
1063 sr->s_csn.bv_val = sr->s_uuid.bv_val + sr->s_uuid.bv_len + 1;
1064 strcpy( sr->s_csn.bv_val, cookie.bv_val );
1066 sr->s_csn.bv_val = NULL;
1068 sr->s_csn.bv_len = cookie.bv_len;
1070 if ( mode == LDAP_SYNC_NEW_COOKIE && cookie.bv_val ) {
1071 ch_free( cookie.bv_val );
1074 ldap_pvt_thread_mutex_lock( &so->s_mutex );
1078 so->s_restail->s_next = sr;
1082 /* If the base of the psearch was modified, check it next time round */
1083 if ( so->s_flags & PS_WROTE_BASE ) {
1084 so->s_flags ^= PS_WROTE_BASE;
1085 so->s_flags |= PS_FIND_BASE;
1087 if (( so->s_flags & (PS_IS_DETACHED|PS_TASK_QUEUED)) == PS_IS_DETACHED ) {
1088 syncprov_qstart( so );
1090 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
1091 return LDAP_SUCCESS;
1095 syncprov_drop_psearch( syncops *so, int lock )
1097 if ( so->s_flags & PS_IS_DETACHED ) {
1099 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
1100 so->s_op->o_conn->c_n_ops_executing--;
1101 so->s_op->o_conn->c_n_ops_completed++;
1102 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, Operation,
1105 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
1107 syncprov_free_syncop( so );
1113 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
1115 slap_callback *sc = op->o_callback;
1116 op->o_callback = sc->sc_next;
1117 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
1118 op->o_tmpfree( sc, op->o_tmpmemctx );
1123 syncprov_op_abandon( Operation *op, SlapReply *rs )
1125 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1126 syncprov_info_t *si = on->on_bi.bi_private;
1127 syncops *so, *soprev;
1129 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1130 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
1131 soprev=so, so=so->s_next ) {
1132 if ( so->s_op->o_connid == op->o_connid &&
1133 so->s_op->o_msgid == op->orn_msgid ) {
1134 so->s_op->o_abandon = 1;
1135 soprev->s_next = so->s_next;
1139 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1141 /* Is this really a Cancel exop? */
1142 if ( op->o_tag != LDAP_REQ_ABANDON ) {
1143 so->s_op->o_cancel = SLAP_CANCEL_ACK;
1144 rs->sr_err = LDAP_CANCELLED;
1145 send_ldap_result( so->s_op, rs );
1146 if ( so->s_flags & PS_IS_DETACHED ) {
1148 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
1149 cb->sc_cleanup = syncprov_ab_cleanup;
1150 cb->sc_next = op->o_callback;
1151 cb->sc_private = so;
1152 return SLAP_CB_CONTINUE;
1155 syncprov_drop_psearch( so, 0 );
1157 return SLAP_CB_CONTINUE;
1160 /* Find which persistent searches are affected by this operation */
1162 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
1164 slap_overinst *on = opc->son;
1165 syncprov_info_t *si = on->on_bi.bi_private;
1168 syncops *ss, *sprev, *snext;
1172 struct berval newdn;
1174 BackendDB *b0 = op->o_bd, db;
1176 fc.fdn = &op->o_req_ndn;
1177 /* compute new DN */
1178 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1180 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
1181 else dnParent( fc.fdn, &pdn );
1182 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
1186 if ( op->o_tag != LDAP_REQ_ADD ) {
1187 if ( !SLAP_ISOVERLAY( op->o_bd )) {
1191 rc = overlay_entry_get_ov( op, fc.fdn, NULL, NULL, 0, &e, on );
1192 /* If we're sending responses now, make a copy and unlock the DB */
1193 if ( e && !saveit ) {
1195 opc->se = entry_dup( e );
1196 opc->se->e_private = get_mutexint();
1198 overlay_entry_release_ov( op, e, 0, on );
1209 opc->se = entry_dup( e );
1210 opc->se->e_private = get_mutexint();
1216 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1217 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1218 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1219 opc->sreference = is_entry_referral( e );
1220 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1222 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1223 } else if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1224 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1225 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1226 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1227 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1230 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1231 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1232 sprev = ss, ss=snext)
1240 if ( ss->s_op->o_abandon )
1243 /* Don't send ops back to the originator */
1244 if ( opc->osid > 0 && opc->osid == ss->s_sid ) {
1245 Debug( LDAP_DEBUG_SYNC, "syncprov_matchops: skipping original sid %03x\n",
1250 /* Don't send ops back to the messenger */
1251 if ( opc->rsid > 0 && opc->rsid == ss->s_sid ) {
1252 Debug( LDAP_DEBUG_SYNC, "syncprov_matchops: skipping relayed sid %03x\n",
1262 /* If the base of the search is missing, signal a refresh */
1263 rc = syncprov_findbase( op, &fc );
1264 if ( rc != LDAP_SUCCESS ) {
1265 SlapReply rs = {REP_RESULT};
1266 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1267 "search base has changed" );
1268 sprev->s_next = snext;
1269 syncprov_drop_psearch( ss, 1 );
1274 /* If we're sending results now, look for this op in old matches */
1278 /* Did we modify the search base? */
1279 if ( dn_match( &op->o_req_ndn, &ss->s_base )) {
1280 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1281 ss->s_flags |= PS_WROTE_BASE;
1282 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1285 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1286 old=sm, sm=sm->sm_next ) {
1287 if ( sm->sm_op == ss ) {
1289 old->sm_next = sm->sm_next;
1290 op->o_tmpfree( sm, op->o_tmpmemctx );
1297 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1300 oh.oh_conn = ss->s_op->o_conn;
1301 oh.oh_connid = ss->s_op->o_connid;
1302 op2.o_bd = op->o_bd->bd_self;
1304 op2.o_extra = op->o_extra;
1305 op2.o_callback = NULL;
1306 if (ss->s_flags & PS_FIX_FILTER) {
1307 /* Skip the AND/GE clause that we stuck on in front. We
1308 would lose deletes/mods that happen during the refresh
1309 phase otherwise (ITS#6555) */
1310 op2.ors_filter = ss->s_op->ors_filter->f_and->f_next;
1312 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1313 rc = test_filter( &op2, e, op2.ors_filter );
1316 Debug( LDAP_DEBUG_TRACE, "syncprov_matchops: sid %03x fscope %d rc %d\n",
1317 ss->s_sid, fc.fscope, rc );
1319 /* check if current o_req_dn is in scope and matches filter */
1320 if ( fc.fscope && rc == LDAP_COMPARE_TRUE ) {
1322 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1323 sm->sm_next = opc->smatches;
1325 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1327 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1330 /* if found send UPDATE else send ADD */
1331 syncprov_qresp( opc, ss,
1332 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD );
1334 } else if ( !saveit && found ) {
1336 syncprov_qresp( opc, ss, LDAP_SYNC_DELETE );
1337 } else if ( !saveit ) {
1338 syncprov_qresp( opc, ss, LDAP_SYNC_NEW_COOKIE );
1340 if ( !saveit && found ) {
1341 /* Decrement s_inuse, was incremented when called
1342 * with saveit == TRUE
1344 syncprov_free_syncop( ss );
1347 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1349 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1350 if ( !SLAP_ISOVERLAY( op->o_bd )) {
1354 overlay_entry_release_ov( op, e, 0, on );
1357 if ( opc->se && !saveit ) {
1358 if ( !dec_mutexint( opc->se->e_private )) {
1359 opc->se->e_private = NULL;
1360 entry_free( opc->se );
1365 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1371 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1373 slap_callback *cb = op->o_callback;
1374 opcookie *opc = cb->sc_private;
1375 slap_overinst *on = opc->son;
1376 syncprov_info_t *si = on->on_bi.bi_private;
1377 syncmatches *sm, *snext;
1380 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1381 if ( si->si_active )
1383 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1385 for (sm = opc->smatches; sm; sm=snext) {
1386 snext = sm->sm_next;
1387 syncprov_free_syncop( sm->sm_op );
1388 op->o_tmpfree( sm, op->o_tmpmemctx );
1391 /* Remove op from lock table */
1394 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1395 mt->mt_mods = mt->mt_mods->mi_next;
1396 /* If there are more, promote the next one */
1397 if ( mt->mt_mods ) {
1398 mt->mt_op = mt->mt_mods->mi_op;
1399 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1401 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1402 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1403 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1404 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1405 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1409 if ( !BER_BVISNULL( &opc->suuid ))
1410 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1411 if ( !BER_BVISNULL( &opc->sndn ))
1412 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1413 if ( !BER_BVISNULL( &opc->sdn ))
1414 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1415 op->o_callback = cb->sc_next;
1416 op->o_tmpfree(cb, op->o_tmpmemctx);
1422 syncprov_checkpoint( Operation *op, slap_overinst *on )
1424 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1427 SlapReply rsm = {REP_RESULT};
1428 slap_callback cb = {0};
1433 Syntax *syn = slap_schema.si_ad_contextCSN->ad_type->sat_syntax;
1436 for ( i=0; i<si->si_numcsns; i++ ) {
1437 assert( !syn->ssyn_validate( syn, si->si_ctxcsn+i ));
1440 mod.sml_numvals = si->si_numcsns;
1441 mod.sml_values = si->si_ctxcsn;
1442 mod.sml_nvalues = NULL;
1443 mod.sml_desc = slap_schema.si_ad_contextCSN;
1444 mod.sml_op = LDAP_MOD_REPLACE;
1445 mod.sml_flags = SLAP_MOD_INTERNAL;
1446 mod.sml_next = NULL;
1448 cb.sc_response = slap_null_cb;
1450 opm.o_tag = LDAP_REQ_MODIFY;
1451 opm.o_callback = &cb;
1452 opm.orm_modlist = &mod;
1453 opm.orm_no_opattrs = 1;
1454 if ( SLAP_GLUE_SUBORDINATE( op->o_bd )) {
1455 be = *on->on_info->oi_origdb;
1458 opm.o_req_dn = si->si_contextdn;
1459 opm.o_req_ndn = si->si_contextdn;
1460 bi = opm.o_bd->bd_info;
1461 opm.o_bd->bd_info = on->on_info->oi_orig;
1462 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1463 opm.o_no_schema_check = 1;
1464 opm.o_bd->be_modify( &opm, &rsm );
1466 if ( rsm.sr_err == LDAP_NO_SUCH_OBJECT &&
1467 SLAP_SYNC_SUBENTRY( opm.o_bd )) {
1469 char txtbuf[SLAP_TEXT_BUFLEN];
1470 size_t textlen = sizeof txtbuf;
1471 Entry *e = slap_create_context_csn_entry( opm.o_bd, NULL );
1472 rs_reinit( &rsm, REP_RESULT );
1473 slap_mods2entry( &mod, &e, 0, 1, &text, txtbuf, textlen);
1475 opm.o_bd->be_add( &opm, &rsm );
1476 if ( e == opm.ora_e )
1477 be_entry_release_w( &opm, opm.ora_e );
1479 opm.o_bd->bd_info = bi;
1481 if ( mod.sml_next != NULL ) {
1482 slap_mods_free( mod.sml_next, 1 );
1485 for ( i=0; i<si->si_numcsns; i++ ) {
1486 assert( !syn->ssyn_validate( syn, si->si_ctxcsn+i ));
1492 syncprov_add_slog( Operation *op )
1494 opcookie *opc = op->o_callback->sc_private;
1495 slap_overinst *on = opc->son;
1496 syncprov_info_t *si = on->on_bi.bi_private;
1502 if ( BER_BVISEMPTY( &op->o_csn ) ) {
1503 /* During the syncrepl refresh phase we can receive operations
1504 * without a csn. We cannot reliably determine the consumers
1505 * state with respect to such operations, so we ignore them and
1506 * wipe out anything in the log if we see them.
1508 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1509 while ( se = sl->sl_head ) {
1510 sl->sl_head = se->se_next;
1515 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1519 /* Allocate a record. UUIDs are not NUL-terminated. */
1520 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1521 op->o_csn.bv_len + 1 );
1523 se->se_tag = op->o_tag;
1525 se->se_uuid.bv_val = (char *)(&se[1]);
1526 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1527 se->se_uuid.bv_len = opc->suuid.bv_len;
1529 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
1530 AC_MEMCPY( se->se_csn.bv_val, op->o_csn.bv_val, op->o_csn.bv_len );
1531 se->se_csn.bv_val[op->o_csn.bv_len] = '\0';
1532 se->se_csn.bv_len = op->o_csn.bv_len;
1533 se->se_sid = slap_parse_csn_sid( &se->se_csn );
1535 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1536 if ( sl->sl_head ) {
1537 /* Keep the list in csn order. */
1538 if ( ber_bvcmp( &sl->sl_tail->se_csn, &se->se_csn ) <= 0 ) {
1539 sl->sl_tail->se_next = se;
1544 for ( sep = &sl->sl_head; *sep; sep = &(*sep)->se_next ) {
1545 if ( ber_bvcmp( &se->se_csn, &(*sep)->se_csn ) < 0 ) {
1557 while ( sl->sl_num > sl->sl_size ) {
1559 sl->sl_head = se->se_next;
1563 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1567 /* Just set a flag if we found the matching entry */
1569 playlog_cb( Operation *op, SlapReply *rs )
1571 if ( rs->sr_type == REP_SEARCH ) {
1572 op->o_callback->sc_private = (void *)1;
1577 /* enter with sl->sl_mutex locked, release before returning */
1579 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1580 sync_control *srs, BerVarray ctxcsn, int numcsns, int *sids )
1582 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1584 int i, j, ndel, num, nmods, mmods;
1585 char cbuf[LDAP_PVT_CSNSTR_BUFSIZE];
1587 struct berval delcsn[2];
1589 if ( !sl->sl_num ) {
1590 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1598 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1599 num * UUID_LEN, op->o_tmpmemctx );
1600 uuids[0].bv_val = (char *)(uuids + num + 1);
1602 delcsn[0].bv_len = 0;
1603 delcsn[0].bv_val = cbuf;
1604 BER_BVZERO(&delcsn[1]);
1606 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1607 * and everything else at the end. Do this first so we can
1608 * unlock the list mutex.
1610 Debug( LDAP_DEBUG_SYNC, "srs csn %s\n",
1611 srs->sr_state.ctxcsn[0].bv_val, 0, 0 );
1612 for ( se=sl->sl_head; se; se=se->se_next ) {
1614 Debug( LDAP_DEBUG_SYNC, "log csn %s\n", se->se_csn.bv_val, 0, 0 );
1616 for ( k=0; k<srs->sr_state.numcsns; k++ ) {
1617 if ( se->se_sid == srs->sr_state.sids[k] ) {
1618 ndel = ber_bvcmp( &se->se_csn, &srs->sr_state.ctxcsn[k] );
1623 Debug( LDAP_DEBUG_SYNC, "cmp %d, too old\n", ndel, 0, 0 );
1627 for ( k=0; k<numcsns; k++ ) {
1628 if ( se->se_sid == sids[k] ) {
1629 ndel = ber_bvcmp( &se->se_csn, &ctxcsn[k] );
1634 Debug( LDAP_DEBUG_SYNC, "cmp %d, too new\n", ndel, 0, 0 );
1637 if ( se->se_tag == LDAP_REQ_DELETE ) {
1640 AC_MEMCPY( cbuf, se->se_csn.bv_val, se->se_csn.bv_len );
1641 delcsn[0].bv_len = se->se_csn.bv_len;
1642 delcsn[0].bv_val[delcsn[0].bv_len] = '\0';
1647 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1648 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1649 uuids[j].bv_len = UUID_LEN;
1651 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1655 /* Zero out unused slots */
1656 for ( i=ndel; i < num - nmods; i++ )
1657 uuids[i].bv_len = 0;
1659 /* Mods must be validated to see if they belong in this delete set.
1663 /* Strip any duplicates */
1664 for ( i=0; i<nmods; i++ ) {
1665 for ( j=0; j<ndel; j++ ) {
1666 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1667 uuids[num - 1 - i].bv_len = 0;
1672 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1673 for ( j=0; j<i; j++ ) {
1674 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1675 uuids[num - 1 - i].bv_len = 0;
1686 AttributeAssertion eq = ATTRIBUTEASSERTION_INIT;
1687 slap_callback cb = {0};
1691 fop.o_sync_mode = 0;
1692 fop.o_callback = &cb;
1693 fop.ors_limit = NULL;
1694 fop.ors_tlimit = SLAP_NO_LIMIT;
1695 fop.ors_attrs = slap_anlist_all_attributes;
1696 fop.ors_attrsonly = 0;
1697 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1699 af.f_choice = LDAP_FILTER_AND;
1702 mf.f_choice = LDAP_FILTER_EQUALITY;
1704 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1705 mf.f_next = fop.ors_filter;
1707 fop.ors_filter = ⁡
1709 cb.sc_response = playlog_cb;
1710 fop.o_bd->bd_info = (BackendInfo *)on->on_info;
1712 for ( i=ndel; i<num; i++ ) {
1713 if ( uuids[i].bv_len != 0 ) {
1714 SlapReply frs = { REP_RESULT };
1716 mf.f_av_value = uuids[i];
1717 cb.sc_private = NULL;
1719 rc = fop.o_bd->be_search( &fop, &frs );
1721 /* If entry was not found, add to delete list */
1722 if ( !cb.sc_private ) {
1723 uuids[ndel++] = uuids[i];
1727 fop.o_bd->bd_info = (BackendInfo *)on;
1730 struct berval cookie;
1732 if ( delcsn[0].bv_len ) {
1733 slap_compose_sync_cookie( op, &cookie, delcsn, srs->sr_state.rid,
1734 slap_serverID ? slap_serverID : -1 );
1736 Debug( LDAP_DEBUG_SYNC, "syncprov_playlog: cookie=%s\n", cookie.bv_val, 0, 0 );
1739 uuids[ndel].bv_val = NULL;
1740 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET,
1741 delcsn[0].bv_len ? &cookie : NULL, 0, uuids, 1 );
1742 if ( delcsn[0].bv_len ) {
1743 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1746 op->o_tmpfree( uuids, op->o_tmpmemctx );
1750 syncprov_op_response( Operation *op, SlapReply *rs )
1752 opcookie *opc = op->o_callback->sc_private;
1753 slap_overinst *on = opc->son;
1754 syncprov_info_t *si = on->on_bi.bi_private;
1757 if ( rs->sr_err == LDAP_SUCCESS )
1759 struct berval maxcsn;
1760 char cbuf[LDAP_PVT_CSNSTR_BUFSIZE];
1761 int do_check = 0, have_psearches, foundit, csn_changed = 0;
1763 ldap_pvt_thread_mutex_lock( &si->si_resp_mutex );
1765 /* Update our context CSN */
1767 maxcsn.bv_val = cbuf;
1768 maxcsn.bv_len = sizeof(cbuf);
1769 ldap_pvt_thread_rdwr_wlock( &si->si_csn_rwlock );
1771 slap_get_commit_csn( op, &maxcsn, &foundit );
1772 if ( BER_BVISEMPTY( &maxcsn ) && SLAP_GLUE_SUBORDINATE( op->o_bd )) {
1773 /* syncrepl queues the CSN values in the db where
1774 * it is configured , not where the changes are made.
1775 * So look for a value in the glue db if we didn't
1776 * find any in this db.
1778 BackendDB *be = op->o_bd;
1779 op->o_bd = select_backend( &be->be_nsuffix[0], 1);
1780 maxcsn.bv_val = cbuf;
1781 maxcsn.bv_len = sizeof(cbuf);
1782 slap_get_commit_csn( op, &maxcsn, &foundit );
1785 if ( !BER_BVISEMPTY( &maxcsn ) ) {
1788 Syntax *syn = slap_schema.si_ad_contextCSN->ad_type->sat_syntax;
1789 assert( !syn->ssyn_validate( syn, &maxcsn ));
1791 sid = slap_parse_csn_sid( &maxcsn );
1792 for ( i=0; i<si->si_numcsns; i++ ) {
1793 if ( sid == si->si_sids[i] ) {
1794 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn[i] ) > 0 ) {
1795 ber_bvreplace( &si->si_ctxcsn[i], &maxcsn );
1801 /* It's a new SID for us */
1802 if ( i == si->si_numcsns ) {
1803 value_add_one( &si->si_ctxcsn, &maxcsn );
1806 si->si_sids = ch_realloc( si->si_sids, si->si_numcsns *
1808 si->si_sids[i] = sid;
1812 /* Don't do any processing for consumer contextCSN updates */
1813 if ( op->o_dont_replicate ) {
1814 if ( op->o_tag == LDAP_REQ_MODIFY &&
1815 op->orm_modlist->sml_op == LDAP_MOD_REPLACE &&
1816 op->orm_modlist->sml_desc == slap_schema.si_ad_contextCSN ) {
1817 /* Catch contextCSN updates from syncrepl. We have to look at
1818 * all the attribute values, as there may be more than one csn
1819 * that changed, and only one can be passed in the csn queue.
1821 Modifications *mod = op->orm_modlist;
1824 for ( i=0; i<mod->sml_numvals; i++ ) {
1825 sid = slap_parse_csn_sid( &mod->sml_values[i] );
1826 for ( j=0; j<si->si_numcsns; j++ ) {
1827 if ( sid == si->si_sids[j] ) {
1828 if ( ber_bvcmp( &mod->sml_values[i], &si->si_ctxcsn[j] ) > 0 ) {
1829 ber_bvreplace( &si->si_ctxcsn[j], &mod->sml_values[i] );
1836 if ( j == si->si_numcsns ) {
1837 value_add_one( &si->si_ctxcsn, &mod->sml_values[i] );
1839 si->si_sids = ch_realloc( si->si_sids, si->si_numcsns *
1841 si->si_sids[j] = sid;
1847 ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock );
1849 if ( csn_changed ) {
1851 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1852 for ( ss = si->si_ops; ss; ss = ss->s_next ) {
1853 if ( ss->s_op->o_abandon )
1855 /* Send the updated csn to all syncrepl consumers,
1856 * including the server from which it originated.
1857 * The syncrepl consumer and syncprov provider on
1858 * the originating server may be configured to store
1859 * their csn values in different entries.
1861 syncprov_qresp( opc, ss, LDAP_SYNC_NEW_COOKIE );
1863 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1866 ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock );
1872 if ( si->si_chkops || si->si_chktime ) {
1873 /* Never checkpoint adding the context entry,
1876 if ( op->o_tag != LDAP_REQ_ADD ||
1877 !dn_match( &op->o_req_ndn, &si->si_contextdn )) {
1878 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1882 if ( si->si_chktime &&
1883 (op->o_time - si->si_chklast >= si->si_chktime )) {
1884 if ( si->si_chklast ) {
1886 si->si_chklast = op->o_time;
1893 si->si_dirty = !csn_changed;
1894 ldap_pvt_thread_rdwr_wunlock( &si->si_csn_rwlock );
1897 ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock );
1898 syncprov_checkpoint( op, on );
1899 ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock );
1902 /* only update consumer ctx if this is a newer csn */
1903 if ( csn_changed ) {
1904 opc->sctxcsn = maxcsn;
1907 /* Handle any persistent searches */
1908 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1909 have_psearches = ( si->si_ops != NULL );
1910 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1911 if ( have_psearches ) {
1914 case LDAP_REQ_MODIFY:
1915 case LDAP_REQ_MODRDN:
1916 case LDAP_REQ_EXTENDED:
1917 syncprov_matchops( op, opc, 0 );
1919 case LDAP_REQ_DELETE:
1920 /* for each match in opc->smatches:
1923 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1924 if ( sm->sm_op->s_op->o_abandon )
1926 syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE );
1932 /* Add any log records */
1933 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1934 syncprov_add_slog( op );
1936 leave: ldap_pvt_thread_mutex_unlock( &si->si_resp_mutex );
1938 return SLAP_CB_CONTINUE;
1941 /* We don't use a subentry to store the context CSN any more.
1942 * We expose the current context CSN as an operational attribute
1943 * of the suffix entry.
1946 syncprov_op_compare( Operation *op, SlapReply *rs )
1948 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1949 syncprov_info_t *si = on->on_bi.bi_private;
1950 int rc = SLAP_CB_CONTINUE;
1952 if ( dn_match( &op->o_req_ndn, &si->si_contextdn ) &&
1953 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1958 e.e_name = si->si_contextdn;
1959 e.e_nname = si->si_contextdn;
1962 a.a_desc = slap_schema.si_ad_contextCSN;
1964 ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock );
1966 a.a_vals = si->si_ctxcsn;
1967 a.a_nvals = a.a_vals;
1968 a.a_numvals = si->si_numcsns;
1970 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1971 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1972 if ( ! rs->sr_err ) {
1973 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1974 goto return_results;
1977 if ( get_assert( op ) &&
1978 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1980 rs->sr_err = LDAP_ASSERTION_FAILED;
1981 goto return_results;
1985 rs->sr_err = LDAP_COMPARE_FALSE;
1987 if ( attr_valfind( &a,
1988 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1989 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1990 &op->oq_compare.rs_ava->aa_value, NULL, op->o_tmpmemctx ) == 0 )
1992 rs->sr_err = LDAP_COMPARE_TRUE;
1997 ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock );
1999 send_ldap_result( op, rs );
2001 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
2002 rs->sr_err = LDAP_SUCCESS;
2011 syncprov_op_mod( Operation *op, SlapReply *rs )
2013 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2014 syncprov_info_t *si = on->on_bi.bi_private;
2017 int have_psearches, cbsize;
2019 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
2020 have_psearches = ( si->si_ops != NULL );
2022 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
2024 cbsize = sizeof(slap_callback) + sizeof(opcookie) +
2025 (have_psearches ? sizeof(modinst) : 0 );
2027 cb = op->o_tmpcalloc(1, cbsize, op->o_tmpmemctx);
2028 opc = (opcookie *)(cb+1);
2030 cb->sc_response = syncprov_op_response;
2031 cb->sc_cleanup = syncprov_op_cleanup;
2032 cb->sc_private = opc;
2033 cb->sc_next = op->o_callback;
2034 op->o_callback = cb;
2038 if ( op->o_csn.bv_val ) {
2039 opc->osid = slap_parse_csn_sid( &op->o_csn );
2041 if ( op->o_controls ) {
2042 struct sync_cookie *scook =
2043 op->o_controls[slap_cids.sc_LDAPsync];
2045 opc->rsid = scook->sid;
2048 /* If there are active persistent searches, lock this operation.
2049 * See seqmod.c for the locking logic on its own.
2051 if ( have_psearches ) {
2052 modtarget *mt, mtdummy;
2055 mi = (modinst *)(opc+1);
2058 /* See if we're already modifying this entry... */
2060 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
2061 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
2063 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
2064 if ( mt->mt_mods == NULL ) {
2065 /* Cannot reuse this mt, as another thread is about
2066 * to release it in syncprov_op_cleanup.
2068 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
2073 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
2074 mt->mt_tail->mi_next = mi;
2076 /* wait for this op to get to head of list */
2077 while ( mt->mt_mods != mi ) {
2078 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
2079 /* FIXME: if dynamic config can delete overlays or
2080 * databases we'll have to check for cleanup here.
2081 * Currently it's not an issue because there are
2082 * no dynamic config deletes...
2084 if ( slapd_shutdown )
2085 return SLAPD_ABANDON;
2087 if ( !ldap_pvt_thread_pool_pausecheck( &connection_pool ))
2088 ldap_pvt_thread_yield();
2089 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
2091 /* clean up if the caller is giving up */
2092 if ( op->o_abandon ) {
2094 for ( m2 = mt->mt_mods; m2->mi_next != mi;
2096 m2->mi_next = mi->mi_next;
2097 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
2098 op->o_tmpfree( cb, op->o_tmpmemctx );
2099 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
2100 return SLAPD_ABANDON;
2103 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
2105 /* Record that we're modifying this entry now */
2106 mt = ch_malloc( sizeof(modtarget) );
2109 mt->mt_op = mi->mi_op;
2110 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
2111 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
2112 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
2117 if (( have_psearches || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
2118 syncprov_matchops( op, opc, 1 );
2120 return SLAP_CB_CONTINUE;
2124 syncprov_op_extended( Operation *op, SlapReply *rs )
2126 if ( exop_is_write( op ))
2127 return syncprov_op_mod( op, rs );
2129 return SLAP_CB_CONTINUE;
2132 typedef struct searchstate {
2133 slap_overinst *ss_on;
2135 BerVarray ss_ctxcsn;
2138 #define SS_PRESENT 0x01
2139 #define SS_CHANGED 0x02
2144 syncprov_search_cleanup( Operation *op, SlapReply *rs )
2146 if ( rs->sr_ctrls ) {
2147 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
2148 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
2149 rs->sr_ctrls = NULL;
2154 typedef struct SyncOperationBuffer {
2158 AttributeName sob_extra; /* not always present */
2159 /* Further data allocated here */
2160 } SyncOperationBuffer;
2163 syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on )
2165 SyncOperationBuffer *sopbuf2;
2170 GroupAssertion *g1, *g2;
2172 /* count the search attrs */
2173 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
2174 alen += op->ors_attrs[i].an_name.bv_len + 1;
2176 /* Make a new copy of the operation */
2177 size = offsetof( SyncOperationBuffer, sob_extra ) +
2178 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
2179 op->o_req_dn.bv_len + 1 +
2180 op->o_req_ndn.bv_len + 1 +
2181 op->o_ndn.bv_len + 1 +
2182 so->s_filterstr.bv_len + 1;
2183 sopbuf2 = ch_calloc( 1, size );
2184 op2 = &sopbuf2->sob_op;
2185 op2->o_hdr = &sopbuf2->sob_hdr;
2186 LDAP_SLIST_FIRST(&op2->o_extra) = &sopbuf2->sob_oe;
2188 /* Copy the fields we care about explicitly, leave the rest alone */
2189 *op2->o_hdr = *op->o_hdr;
2190 op2->o_tag = op->o_tag;
2191 op2->o_time = op->o_time;
2192 op2->o_bd = on->on_info->oi_origdb;
2193 op2->o_request = op->o_request;
2194 op2->o_managedsait = op->o_managedsait;
2195 LDAP_SLIST_FIRST(&op2->o_extra)->oe_key = on;
2196 LDAP_SLIST_NEXT(LDAP_SLIST_FIRST(&op2->o_extra), oe_next) = NULL;
2198 ptr = (char *) sopbuf2 + offsetof( SyncOperationBuffer, sob_extra );
2200 op2->ors_attrs = (AttributeName *) ptr;
2201 ptr = (char *) &op2->ors_attrs[i+1];
2202 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
2203 op2->ors_attrs[i] = op->ors_attrs[i];
2204 op2->ors_attrs[i].an_name.bv_val = ptr;
2205 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
2207 BER_BVZERO( &op2->ors_attrs[i].an_name );
2210 op2->o_authz = op->o_authz;
2211 op2->o_ndn.bv_val = ptr;
2212 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
2213 op2->o_dn = op2->o_ndn;
2214 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
2215 op2->o_req_dn.bv_val = ptr;
2216 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
2217 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
2218 op2->o_req_ndn.bv_val = ptr;
2219 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
2220 op2->ors_filterstr.bv_val = ptr;
2221 strcpy( ptr, so->s_filterstr.bv_val );
2222 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
2224 /* Skip the AND/GE clause that we stuck on in front */
2225 if ( so->s_flags & PS_FIX_FILTER ) {
2226 op2->ors_filter = op->ors_filter->f_and->f_next;
2227 so->s_flags ^= PS_FIX_FILTER;
2229 op2->ors_filter = op->ors_filter;
2231 op2->ors_filter = filter_dup( op2->ors_filter, NULL );
2234 /* Copy any cached group ACLs individually */
2235 op2->o_groups = NULL;
2236 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
2237 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
2239 strcpy( g2->ga_ndn, g1->ga_ndn );
2240 g2->ga_next = op2->o_groups;
2243 /* Don't allow any further group caching */
2244 op2->o_do_not_cache = 1;
2246 /* Add op2 to conn so abandon will find us */
2247 op->o_conn->c_n_ops_executing++;
2248 op->o_conn->c_n_ops_completed--;
2249 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
2250 so->s_flags |= PS_IS_DETACHED;
2252 /* Prevent anyone else from trying to send a result for this op */
2257 syncprov_search_response( Operation *op, SlapReply *rs )
2259 searchstate *ss = op->o_callback->sc_private;
2260 slap_overinst *on = ss->ss_on;
2261 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2262 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
2264 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
2266 /* If we got a referral without a referral object, there's
2267 * something missing that we cannot replicate. Just ignore it.
2268 * The consumer will abort because we didn't send the expected
2271 if ( !rs->sr_entry ) {
2272 assert( rs->sr_entry != NULL );
2273 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
2274 return SLAP_CB_CONTINUE;
2276 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );
2277 if ( a == NULL && rs->sr_operational_attrs != NULL ) {
2278 a = attr_find( rs->sr_operational_attrs, slap_schema.si_ad_entryCSN );
2282 sid = slap_parse_csn_sid( &a->a_nvals[0] );
2284 /* Don't send changed entries back to the originator */
2285 if ( sid == srs->sr_state.sid && srs->sr_state.numcsns ) {
2286 Debug( LDAP_DEBUG_SYNC,
2287 "Entry %s changed by peer, ignored\n",
2288 rs->sr_entry->e_name.bv_val, 0, 0 );
2289 return LDAP_SUCCESS;
2292 /* If not a persistent search */
2294 /* Make sure entry is less than the snapshot'd contextCSN */
2295 for ( i=0; i<ss->ss_numcsns; i++ ) {
2296 if ( sid == ss->ss_sids[i] && ber_bvcmp( &a->a_nvals[0],
2297 &ss->ss_ctxcsn[i] ) > 0 ) {
2298 Debug( LDAP_DEBUG_SYNC,
2299 "Entry %s CSN %s greater than snapshot %s\n",
2300 rs->sr_entry->e_name.bv_val,
2301 a->a_nvals[0].bv_val,
2302 ss->ss_ctxcsn[i].bv_val );
2303 return LDAP_SUCCESS;
2308 /* Don't send old entries twice */
2309 if ( srs->sr_state.ctxcsn ) {
2310 for ( i=0; i<srs->sr_state.numcsns; i++ ) {
2311 if ( sid == srs->sr_state.sids[i] &&
2312 ber_bvcmp( &a->a_nvals[0],
2313 &srs->sr_state.ctxcsn[i] )<= 0 ) {
2314 Debug( LDAP_DEBUG_SYNC,
2315 "Entry %s CSN %s older or equal to ctx %s\n",
2316 rs->sr_entry->e_name.bv_val,
2317 a->a_nvals[0].bv_val,
2318 srs->sr_state.ctxcsn[i].bv_val );
2319 return LDAP_SUCCESS;
2324 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
2326 rs->sr_ctrls[1] = NULL;
2327 /* If we're in delta-sync mode, always send a cookie */
2328 if ( si->si_nopres && si->si_usehint && a ) {
2329 struct berval cookie;
2330 slap_compose_sync_cookie( op, &cookie, a->a_nvals, srs->sr_state.rid, slap_serverID ? slap_serverID : -1 );
2331 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
2332 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 1, &cookie );
2334 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
2335 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
2337 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
2338 struct berval cookie = BER_BVNULL;
2340 if ( ( ss->ss_flags & SS_CHANGED ) &&
2341 ss->ss_ctxcsn && !BER_BVISNULL( &ss->ss_ctxcsn[0] )) {
2342 slap_compose_sync_cookie( op, &cookie, ss->ss_ctxcsn,
2343 srs->sr_state.rid, slap_serverID ? slap_serverID : -1 );
2345 Debug( LDAP_DEBUG_SYNC, "syncprov_search_response: cookie=%s\n", cookie.bv_val, 0, 0 );
2348 /* Is this a regular refresh?
2349 * Note: refresh never gets here if there were no changes
2352 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
2354 rs->sr_ctrls[1] = NULL;
2355 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
2356 0, 1, &cookie, ( ss->ss_flags & SS_PRESENT ) ? LDAP_SYNC_REFRESH_PRESENTS :
2357 LDAP_SYNC_REFRESH_DELETES );
2358 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
2360 /* It's RefreshAndPersist, transition to Persist phase */
2361 syncprov_sendinfo( op, rs, ( ss->ss_flags & SS_PRESENT ) ?
2362 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
2363 ( ss->ss_flags & SS_CHANGED ) ? &cookie : NULL,
2365 if ( !BER_BVISNULL( &cookie ))
2366 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
2368 /* Detach this Op from frontend control */
2369 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
2371 /* But not if this connection was closed along the way */
2372 if ( op->o_abandon ) {
2373 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
2374 /* syncprov_ab_cleanup will free this syncop */
2375 return SLAPD_ABANDON;
2378 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
2379 /* Turn off the refreshing flag */
2380 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
2382 syncprov_detach_op( op, ss->ss_so, on );
2384 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
2386 /* If there are queued responses, fire them off */
2387 if ( ss->ss_so->s_res )
2388 syncprov_qstart( ss->ss_so );
2389 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
2392 return LDAP_SUCCESS;
2396 return SLAP_CB_CONTINUE;
2400 syncprov_op_search( Operation *op, SlapReply *rs )
2402 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2403 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2405 int gotstate = 0, changed = 0, do_present = 0;
2406 syncops *sop = NULL;
2410 int i, *sids, numcsns;
2411 struct berval mincsn;
2414 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
2416 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
2417 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
2421 srs = op->o_controls[slap_cids.sc_LDAPsync];
2423 /* If this is a persistent search, set it up right away */
2424 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
2434 so.s_flags = PS_IS_REFRESHING | PS_FIND_BASE;
2435 /* syncprov_findbase expects to be called as a callback... */
2436 sc.sc_private = &opc;
2438 ldap_pvt_thread_mutex_init( &so.s_mutex );
2439 cb = op->o_callback;
2440 op->o_callback = ≻
2441 rs->sr_err = syncprov_findbase( op, &fc );
2442 op->o_callback = cb;
2443 ldap_pvt_thread_mutex_destroy( &so.s_mutex );
2445 if ( rs->sr_err != LDAP_SUCCESS ) {
2446 send_ldap_result( op, rs );
2449 sop = ch_malloc( sizeof( syncops ));
2451 ldap_pvt_thread_mutex_init( &sop->s_mutex );
2452 sop->s_rid = srs->sr_state.rid;
2453 sop->s_sid = srs->sr_state.sid;
2456 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
2457 while ( si->si_active ) {
2458 /* Wait for active mods to finish before proceeding, as they
2459 * may already have inspected the si_ops list looking for
2460 * consumers to replicate the change to. Using the log
2461 * doesn't help, as we may finish playing it before the
2462 * active mods gets added to it.
2464 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
2465 if ( slapd_shutdown )
2466 return SLAPD_ABANDON;
2467 if ( !ldap_pvt_thread_pool_pausecheck( &connection_pool ))
2468 ldap_pvt_thread_yield();
2469 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
2471 sop->s_next = si->si_ops;
2473 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
2476 /* snapshot the ctxcsn */
2477 ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock );
2478 numcsns = si->si_numcsns;
2480 ber_bvarray_dup_x( &ctxcsn, si->si_ctxcsn, op->o_tmpmemctx );
2481 sids = op->o_tmpalloc( numcsns * sizeof(int), op->o_tmpmemctx );
2482 for ( i=0; i<numcsns; i++ )
2483 sids[i] = si->si_sids[i];
2488 dirty = si->si_dirty;
2489 ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock );
2491 /* If we have a cookie, handle the PRESENT lookups */
2492 if ( srs->sr_state.ctxcsn ) {
2496 /* If we don't have any CSN of our own yet, pretend nothing
2502 if ( !si->si_nopres )
2503 do_present = SS_PRESENT;
2505 /* If there are SIDs we don't recognize in the cookie, drop them */
2506 for (i=0; i<srs->sr_state.numcsns; ) {
2507 for (j=0; j<numcsns; j++) {
2508 if ( srs->sr_state.sids[i] == sids[j] ) {
2513 if ( j == numcsns ) {
2514 struct berval tmp = srs->sr_state.ctxcsn[i];
2515 j = srs->sr_state.numcsns - 1;
2516 srs->sr_state.ctxcsn[i] = srs->sr_state.ctxcsn[j];
2518 srs->sr_state.ctxcsn[j] = tmp;
2519 srs->sr_state.numcsns = j;
2520 srs->sr_state.sids[i] = srs->sr_state.sids[j];
2526 /* Find the smallest CSN */
2527 mincsn = srs->sr_state.ctxcsn[0];
2528 for ( i=1; i<srs->sr_state.numcsns; i++ ) {
2529 if ( ber_bvcmp( &mincsn, &srs->sr_state.ctxcsn[i] ) > 0 )
2530 mincsn = srs->sr_state.ctxcsn[i];
2533 /* If nothing has changed, shortcut it */
2534 if ( srs->sr_state.numcsns == numcsns ) {
2536 for ( i=0; i<srs->sr_state.numcsns; i++ ) {
2537 for ( j=0; j<numcsns; j++ ) {
2538 if ( srs->sr_state.sids[i] != sids[j] )
2540 newer = ber_bvcmp( &srs->sr_state.ctxcsn[i], &ctxcsn[j] );
2541 /* If our state is newer, tell consumer about changes */
2543 changed = SS_CHANGED;
2544 else if ( newer > 0 ) {
2545 /* our state is older, complain to consumer */
2546 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
2547 rs->sr_text = "consumer state is newer than provider!";
2550 syncops **sp = &si->si_ops;
2552 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
2553 while ( *sp != sop )
2554 sp = &(*sp)->s_next;
2556 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
2559 rs->sr_ctrls = NULL;
2560 send_ldap_result( op, rs );
2568 if ( !changed && !dirty ) {
2570 no_change: if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
2571 LDAPControl *ctrls[2];
2575 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
2576 NULL, LDAP_SYNC_REFRESH_DELETES );
2577 rs->sr_ctrls = ctrls;
2578 rs->sr_err = LDAP_SUCCESS;
2579 send_ldap_result( op, rs );
2580 rs->sr_ctrls = NULL;
2586 /* consumer doesn't have the right number of CSNs */
2587 changed = SS_CHANGED;
2589 /* Do we have a sessionlog for this search? */
2592 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
2593 /* Are there any log entries, and is the consumer state
2594 * present in the session log?
2596 if ( sl->sl_num > 0 && ber_bvcmp( &mincsn, &sl->sl_head->se_csn ) >= 0 ) {
2598 /* mutex is unlocked in playlog */
2599 syncprov_playlog( op, rs, sl, srs, ctxcsn, numcsns, sids );
2601 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
2604 /* Is the CSN still present in the database? */
2605 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
2606 /* No, so a reload is required */
2607 /* the 2.2 consumer doesn't send this hint */
2608 if ( si->si_usehint && srs->sr_rhint == 0 ) {
2610 ber_bvarray_free_x( ctxcsn, op->o_tmpmemctx );
2612 op->o_tmpfree( sids, op->o_tmpmemctx );
2613 rs->sr_err = LDAP_SYNC_REFRESH_REQUIRED;
2614 rs->sr_text = "sync cookie is stale";
2617 if ( srs->sr_state.ctxcsn ) {
2618 ber_bvarray_free_x( srs->sr_state.ctxcsn, op->o_tmpmemctx );
2619 srs->sr_state.ctxcsn = NULL;
2621 if ( srs->sr_state.sids ) {
2622 slap_sl_free( srs->sr_state.sids, op->o_tmpmemctx );
2623 srs->sr_state.sids = NULL;
2625 srs->sr_state.numcsns = 0;
2628 /* If changed and doing Present lookup, send Present UUIDs */
2629 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
2632 ber_bvarray_free_x( ctxcsn, op->o_tmpmemctx );
2634 op->o_tmpfree( sids, op->o_tmpmemctx );
2639 /* No consumer state, assume something has changed */
2640 changed = SS_CHANGED;
2644 /* Append CSN range to search filter, save original filter
2645 * for persistent search evaluation
2648 sop->s_filterstr= op->ors_filterstr;
2651 /* If something changed, find the changes */
2652 if ( gotstate && ( changed || dirty ) ) {
2653 Filter *fand, *fava;
2655 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
2656 fand->f_choice = LDAP_FILTER_AND;
2657 fand->f_next = NULL;
2658 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
2660 fava->f_choice = LDAP_FILTER_GE;
2661 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
2662 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
2663 #ifdef LDAP_COMP_MATCH
2664 fava->f_ava->aa_cf = NULL;
2666 ber_dupbv_x( &fava->f_ava->aa_value, &mincsn, op->o_tmpmemctx );
2667 fava->f_next = op->ors_filter;
2669 ldap_pvt_thread_mutex_lock( &sop->s_mutex );
2670 op->ors_filter = fand;
2671 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
2673 sop->s_flags |= PS_FIX_FILTER;
2674 ldap_pvt_thread_mutex_unlock( &sop->s_mutex );
2678 /* Let our callback add needed info to returned entries */
2679 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
2680 ss = (searchstate *)(cb+1);
2683 ss->ss_flags = do_present | changed;
2684 ss->ss_ctxcsn = ctxcsn;
2685 ss->ss_numcsns = numcsns;
2687 cb->sc_response = syncprov_search_response;
2688 cb->sc_cleanup = syncprov_search_cleanup;
2689 cb->sc_private = ss;
2690 cb->sc_next = op->o_callback;
2691 op->o_callback = cb;
2693 /* If this is a persistent search and no changes were reported during
2694 * the refresh phase, just invoke the response callback to transition
2695 * us into persist phase
2697 if ( !changed && !dirty ) {
2698 rs->sr_err = LDAP_SUCCESS;
2699 rs->sr_nentries = 0;
2700 send_ldap_result( op, rs );
2703 return SLAP_CB_CONTINUE;
2707 syncprov_operational(
2711 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2712 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2714 /* This prevents generating unnecessarily; frontend will strip
2715 * any statically stored copy.
2717 if ( op->o_sync != SLAP_CONTROL_NONE )
2718 return SLAP_CB_CONTINUE;
2720 if ( rs->sr_entry &&
2721 dn_match( &rs->sr_entry->e_nname, &si->si_contextdn )) {
2723 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
2724 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
2725 Attribute *a, **ap = NULL;
2727 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
2728 if ( a->a_desc == slap_schema.si_ad_contextCSN )
2732 ldap_pvt_thread_rdwr_rlock( &si->si_csn_rwlock );
2733 if ( si->si_ctxcsn ) {
2735 for ( ap = &rs->sr_operational_attrs; *ap;
2736 ap=&(*ap)->a_next );
2738 a = attr_alloc( slap_schema.si_ad_contextCSN );
2743 if ( !(rs->sr_flags & REP_ENTRY_MODIFIABLE) ) {
2744 Entry *e = entry_dup( rs->sr_entry );
2745 if ( rs->sr_flags & REP_ENTRY_MUSTRELEASE ) {
2746 overlay_entry_release_ov( op, rs->sr_entry, 0, on );
2747 rs->sr_flags ^= REP_ENTRY_MUSTRELEASE;
2748 } else if ( rs->sr_flags & REP_ENTRY_MUSTBEFREED ) {
2749 entry_free( rs->sr_entry );
2753 REP_ENTRY_MODIFIABLE|REP_ENTRY_MUSTBEFREED;
2754 a = attr_find( rs->sr_entry->e_attrs,
2755 slap_schema.si_ad_contextCSN );
2757 if ( a->a_nvals != a->a_vals ) {
2758 ber_bvarray_free( a->a_nvals );
2761 ber_bvarray_free( a->a_vals );
2765 attr_valadd( a, si->si_ctxcsn, si->si_ctxcsn, si->si_numcsns );
2767 ldap_pvt_thread_rdwr_runlock( &si->si_csn_rwlock );
2770 return SLAP_CB_CONTINUE;
2780 static ConfigDriver sp_cf_gen;
2782 static ConfigTable spcfg[] = {
2783 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2784 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2785 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2786 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2787 { "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2788 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2789 "DESC 'Session log size in ops' "
2790 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2791 { "syncprov-nopresent", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_NOPRES,
2792 sp_cf_gen, "( OLcfgOvAt:1.3 NAME 'olcSpNoPresent' "
2793 "DESC 'Omit Present phase processing' "
2794 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2795 { "syncprov-reloadhint", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_USEHINT,
2796 sp_cf_gen, "( OLcfgOvAt:1.4 NAME 'olcSpReloadHint' "
2797 "DESC 'Observe Reload Hint in Request control' "
2798 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2799 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2802 static ConfigOCs spocs[] = {
2803 { "( OLcfgOvOc:1.1 "
2804 "NAME 'olcSyncProvConfig' "
2805 "DESC 'SyncRepl Provider configuration' "
2806 "SUP olcOverlayConfig "
2807 "MAY ( olcSpCheckpoint "
2808 "$ olcSpSessionlog "
2810 "$ olcSpReloadHint "
2812 Cft_Overlay, spcfg },
2817 sp_cf_gen(ConfigArgs *c)
2819 slap_overinst *on = (slap_overinst *)c->bi;
2820 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2823 if ( c->op == SLAP_CONFIG_EMIT ) {
2824 switch ( c->type ) {
2826 if ( si->si_chkops || si->si_chktime ) {
2828 /* we assume si_chktime is a multiple of 60
2829 * because the parsed value was originally
2830 * multiplied by 60 */
2831 bv.bv_len = snprintf( c->cr_msg, sizeof( c->cr_msg ),
2832 "%d %d", si->si_chkops, si->si_chktime/60 );
2833 if ( bv.bv_len >= sizeof( c->cr_msg ) ) {
2836 bv.bv_val = c->cr_msg;
2837 value_add_one( &c->rvalue_vals, &bv );
2844 if ( si->si_logs ) {
2845 c->value_int = si->si_logs->sl_size;
2851 if ( si->si_nopres ) {
2858 if ( si->si_usehint ) {
2866 } else if ( c->op == LDAP_MOD_DELETE ) {
2867 switch ( c->type ) {
2874 si->si_logs->sl_size = 0;
2876 rc = LDAP_NO_SUCH_ATTRIBUTE;
2879 if ( si->si_nopres )
2882 rc = LDAP_NO_SUCH_ATTRIBUTE;
2885 if ( si->si_usehint )
2888 rc = LDAP_NO_SUCH_ATTRIBUTE;
2893 switch ( c->type ) {
2895 if ( lutil_atoi( &si->si_chkops, c->argv[1] ) != 0 ) {
2896 snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s unable to parse checkpoint ops # \"%s\"",
2897 c->argv[0], c->argv[1] );
2898 Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE,
2899 "%s: %s\n", c->log, c->cr_msg, 0 );
2900 return ARG_BAD_CONF;
2902 if ( si->si_chkops <= 0 ) {
2903 snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s invalid checkpoint ops # \"%d\"",
2904 c->argv[0], si->si_chkops );
2905 Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE,
2906 "%s: %s\n", c->log, c->cr_msg, 0 );
2907 return ARG_BAD_CONF;
2909 if ( lutil_atoi( &si->si_chktime, c->argv[2] ) != 0 ) {
2910 snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s unable to parse checkpoint time \"%s\"",
2911 c->argv[0], c->argv[1] );
2912 Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE,
2913 "%s: %s\n", c->log, c->cr_msg, 0 );
2914 return ARG_BAD_CONF;
2916 if ( si->si_chktime <= 0 ) {
2917 snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s invalid checkpoint time \"%d\"",
2918 c->argv[0], si->si_chkops );
2919 Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE,
2920 "%s: %s\n", c->log, c->cr_msg, 0 );
2921 return ARG_BAD_CONF;
2923 si->si_chktime *= 60;
2927 int size = c->value_int;
2930 snprintf( c->cr_msg, sizeof( c->cr_msg ), "%s size %d is negative",
2932 Debug( LDAP_DEBUG_CONFIG|LDAP_DEBUG_NONE,
2933 "%s: %s\n", c->log, c->cr_msg, 0 );
2934 return ARG_BAD_CONF;
2938 sl = ch_malloc( sizeof( sessionlog ) );
2940 sl->sl_head = sl->sl_tail = NULL;
2941 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2948 si->si_nopres = c->value_int;
2951 si->si_usehint = c->value_int;
2957 /* ITS#3456 we cannot run this search on the main thread, must use a
2958 * child thread in order to insure we have a big enough stack.
2965 syncprov_findcsn( ptr, FIND_MAXCSN );
2969 /* Read any existing contextCSN from the underlying db.
2970 * Then search for any entries newer than that. If no value exists,
2971 * just generate it. Cache whatever result.
2979 slap_overinst *on = (slap_overinst *) be->bd_info;
2980 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2982 Connection conn = { 0 };
2983 OperationBuffer opbuf;
2988 void *thrctx = NULL;
2990 if ( !SLAP_LASTMOD( be )) {
2991 Debug( LDAP_DEBUG_ANY,
2992 "syncprov_db_open: invalid config, lastmod must be enabled\n", 0, 0, 0 );
2996 if ( slapMode & SLAP_TOOL_MODE ) {
3000 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
3005 thrctx = ldap_pvt_thread_pool_context();
3006 connection_fake_init2( &conn, &opbuf, thrctx, 0 );
3009 op->o_dn = be->be_rootdn;
3010 op->o_ndn = be->be_rootndn;
3012 if ( SLAP_SYNC_SUBENTRY( be )) {
3013 build_new_dn( &si->si_contextdn, be->be_nsuffix,
3014 (struct berval *)&slap_ldapsync_cn_bv, NULL );
3016 si->si_contextdn = be->be_nsuffix[0];
3018 rc = overlay_entry_get_ov( op, &si->si_contextdn, NULL,
3019 slap_schema.si_ad_contextCSN, 0, &e, on );
3022 ldap_pvt_thread_t tid;
3024 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
3026 ber_bvarray_dup_x( &si->si_ctxcsn, a->a_vals, NULL );
3027 si->si_numcsns = a->a_numvals;
3028 si->si_sids = slap_parse_csn_sids( si->si_ctxcsn, a->a_numvals, NULL );
3030 overlay_entry_release_ov( op, e, 0, on );
3031 if ( si->si_ctxcsn && !SLAP_DBCLEAN( be )) {
3032 op->o_req_dn = be->be_suffix[0];
3033 op->o_req_ndn = be->be_nsuffix[0];
3034 op->ors_scope = LDAP_SCOPE_SUBTREE;
3035 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
3036 ldap_pvt_thread_join( tid, NULL );
3040 /* Didn't find a contextCSN, should we generate one? */
3041 if ( !si->si_ctxcsn ) {
3042 char csnbuf[ LDAP_PVT_CSNSTR_BUFSIZE ];
3045 if ( SLAP_SYNC_SHADOW( op->o_bd )) {
3046 /* If we're also a consumer, then don't generate anything.
3047 * Wait for our provider to send it to us, or for a local
3048 * modify if we have multimaster.
3052 csn.bv_val = csnbuf;
3053 csn.bv_len = sizeof( csnbuf );
3054 slap_get_csn( op, &csn, 0 );
3055 value_add_one( &si->si_ctxcsn, &csn );
3057 si->si_sids = ch_malloc( sizeof(int) );
3058 si->si_sids[0] = slap_serverID;
3060 /* make sure we do a checkpoint on close */
3065 op->o_bd->bd_info = (BackendInfo *)on;
3069 /* Write the current contextCSN into the underlying db.
3077 slap_overinst *on = (slap_overinst *) be->bd_info;
3078 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
3079 #ifdef SLAP_CONFIG_DELETE
3080 syncops *so, *sonext;
3081 #endif /* SLAP_CONFIG_DELETE */
3083 if ( slapMode & SLAP_TOOL_MODE ) {
3086 if ( si->si_numops ) {
3087 Connection conn = {0};
3088 OperationBuffer opbuf;
3092 thrctx = ldap_pvt_thread_pool_context();
3093 connection_fake_init2( &conn, &opbuf, thrctx, 0 );
3096 op->o_dn = be->be_rootdn;
3097 op->o_ndn = be->be_rootndn;
3098 syncprov_checkpoint( op, on );
3101 #ifdef SLAP_CONFIG_DELETE
3102 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
3103 for ( so=si->si_ops, sonext=so; so; so=sonext ) {
3104 SlapReply rs = {REP_RESULT};
3105 rs.sr_err = LDAP_UNAVAILABLE;
3106 send_ldap_result( so->s_op, &rs );
3108 syncprov_drop_psearch( so, 0);
3111 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
3112 overlay_unregister_control( be, LDAP_CONTROL_SYNC );
3113 #endif /* SLAP_CONFIG_DELETE */
3124 slap_overinst *on = (slap_overinst *)be->bd_info;
3125 syncprov_info_t *si;
3127 if ( SLAP_ISGLOBALOVERLAY( be ) ) {
3128 Debug( LDAP_DEBUG_ANY,
3129 "syncprov must be instantiated within a database.\n",
3134 si = ch_calloc(1, sizeof(syncprov_info_t));
3135 on->on_bi.bi_private = si;
3136 ldap_pvt_thread_rdwr_init( &si->si_csn_rwlock );
3137 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
3138 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
3139 ldap_pvt_thread_mutex_init( &si->si_resp_mutex );
3141 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
3142 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
3143 csn_anlist[1].an_desc = slap_schema.si_ad_entryUUID;
3144 csn_anlist[1].an_name = slap_schema.si_ad_entryUUID->ad_cname;
3146 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
3147 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
3153 syncprov_db_destroy(
3158 slap_overinst *on = (slap_overinst *)be->bd_info;
3159 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
3162 if ( si->si_logs ) {
3163 slog_entry *se = si->si_logs->sl_head;
3166 slog_entry *se_next = se->se_next;
3171 ldap_pvt_thread_mutex_destroy(&si->si_logs->sl_mutex);
3172 ch_free( si->si_logs );
3174 if ( si->si_ctxcsn )
3175 ber_bvarray_free( si->si_ctxcsn );
3177 ch_free( si->si_sids );
3178 ldap_pvt_thread_mutex_destroy( &si->si_resp_mutex );
3179 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
3180 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
3181 ldap_pvt_thread_rdwr_destroy( &si->si_csn_rwlock );
3188 static int syncprov_parseCtrl (
3194 BerElementBuffer berbuf;
3195 BerElement *ber = (BerElement *)&berbuf;
3198 struct berval cookie = BER_BVNULL;
3202 if ( op->o_sync != SLAP_CONTROL_NONE ) {
3203 rs->sr_text = "Sync control specified multiple times";
3204 return LDAP_PROTOCOL_ERROR;
3207 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
3208 rs->sr_text = "Sync control specified with pagedResults control";
3209 return LDAP_PROTOCOL_ERROR;
3212 if ( BER_BVISNULL( &ctrl->ldctl_value ) ) {
3213 rs->sr_text = "Sync control value is absent";
3214 return LDAP_PROTOCOL_ERROR;
3217 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
3218 rs->sr_text = "Sync control value is empty";
3219 return LDAP_PROTOCOL_ERROR;
3222 /* Parse the control value
3223 * syncRequestValue ::= SEQUENCE {
3228 * refreshAndPersist (3)
3230 * cookie syncCookie OPTIONAL
3234 ber_init2( ber, &ctrl->ldctl_value, 0 );
3236 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
3237 rs->sr_text = "Sync control : mode decoding error";
3238 return LDAP_PROTOCOL_ERROR;
3242 case LDAP_SYNC_REFRESH_ONLY:
3243 mode = SLAP_SYNC_REFRESH;
3245 case LDAP_SYNC_REFRESH_AND_PERSIST:
3246 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
3249 rs->sr_text = "Sync control : unknown update mode";
3250 return LDAP_PROTOCOL_ERROR;
3253 tag = ber_peek_tag( ber, &len );
3255 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
3256 if (( ber_scanf( ber, /*{*/ "m", &cookie )) == LBER_ERROR ) {
3257 rs->sr_text = "Sync control : cookie decoding error";
3258 return LDAP_PROTOCOL_ERROR;
3260 tag = ber_peek_tag( ber, &len );
3262 if ( tag == LDAP_TAG_RELOAD_HINT ) {
3263 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
3264 rs->sr_text = "Sync control : rhint decoding error";
3265 return LDAP_PROTOCOL_ERROR;
3268 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
3269 rs->sr_text = "Sync control : decoding error";
3270 return LDAP_PROTOCOL_ERROR;
3272 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
3273 sr->sr_rhint = rhint;
3274 if (!BER_BVISNULL(&cookie)) {
3275 ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );
3276 /* If parse fails, pretend no cookie was sent */
3277 if ( slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx ) ||
3278 sr->sr_state.rid == -1 ) {
3279 if ( sr->sr_state.ctxcsn ) {
3280 ber_bvarray_free_x( sr->sr_state.ctxcsn, op->o_tmpmemctx );
3281 sr->sr_state.ctxcsn = NULL;
3283 sr->sr_state.numcsns = 0;
3287 op->o_controls[slap_cids.sc_LDAPsync] = sr;
3289 op->o_sync = ctrl->ldctl_iscritical
3290 ? SLAP_CONTROL_CRITICAL
3291 : SLAP_CONTROL_NONCRITICAL;
3293 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
3295 return LDAP_SUCCESS;
3298 /* This overlay is set up for dynamic loading via moduleload. For static
3299 * configuration, you'll need to arrange for the slap_overinst to be
3300 * initialized and registered by some other function inside slapd.
3303 static slap_overinst syncprov;
3306 syncprov_initialize()
3310 rc = register_supported_control( LDAP_CONTROL_SYNC,
3311 SLAP_CTRL_SEARCH, NULL,
3312 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
3313 if ( rc != LDAP_SUCCESS ) {
3314 Debug( LDAP_DEBUG_ANY,
3315 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
3319 syncprov.on_bi.bi_type = "syncprov";
3320 syncprov.on_bi.bi_db_init = syncprov_db_init;
3321 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
3322 syncprov.on_bi.bi_db_open = syncprov_db_open;
3323 syncprov.on_bi.bi_db_close = syncprov_db_close;
3325 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
3326 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
3328 syncprov.on_bi.bi_op_add = syncprov_op_mod;
3329 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
3330 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
3331 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
3332 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
3333 syncprov.on_bi.bi_op_search = syncprov_op_search;
3334 syncprov.on_bi.bi_extended = syncprov_op_extended;
3335 syncprov.on_bi.bi_operational = syncprov_operational;
3337 syncprov.on_bi.bi_cf_ocs = spocs;
3339 generic_filter.f_desc = slap_schema.si_ad_objectClass;
3341 rc = config_register_schema( spcfg, spocs );
3342 if ( rc ) return rc;
3344 return overlay_register( &syncprov );
3347 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
3349 init_module( int argc, char *argv[] )
3351 return syncprov_initialize();
3353 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
3355 #endif /* defined(SLAPD_OVER_SYNCPROV) */