2 /* syncprov.c - syncrepl provider */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2004-2005 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>
31 /* A modify request on a particular entry */
32 typedef struct modinst {
33 struct modinst *mi_next;
37 typedef struct modtarget {
38 struct modinst *mt_mods;
39 struct modinst *mt_tail;
41 ldap_pvt_thread_mutex_t mt_mutex;
44 /* A queued result of a persistent search */
45 typedef struct syncres {
46 struct syncres *s_next;
55 /* Record of a persistent search */
56 typedef struct syncops {
57 struct syncops *s_next;
58 struct berval s_base; /* ndn of search base */
59 ID s_eid; /* entryID of search base */
60 Operation *s_op; /* search op */
62 struct berval s_filterstr;
63 int s_flags; /* search status */
64 #define PS_IS_REFRESHING 0x01
65 #define PS_IS_DETACHED 0x02
66 #define PS_WROTE_BASE 0x04
67 #define PS_FIND_BASE 0x08
69 int s_inuse; /* reference count */
70 struct syncres *s_res;
71 struct syncres *s_restail;
72 struct re_s *s_qtask; /* task for playing psearch responses */
73 ldap_pvt_thread_mutex_t s_mutex;
76 /* A received sync control */
77 typedef struct sync_control {
78 struct sync_cookie sr_state;
82 #if 0 /* moved back to slap.h */
83 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
85 /* o_sync_mode uses data bits of o_sync */
86 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
88 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
89 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
90 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
91 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
93 /* Record of which searches matched at premodify step */
94 typedef struct syncmatches {
95 struct syncmatches *sm_next;
99 /* Session log data */
100 typedef struct slog_entry {
101 struct slog_entry *se_next;
102 struct berval se_uuid;
103 struct berval se_csn;
107 typedef struct sessionlog {
108 struct berval sl_mincsn;
113 ldap_pvt_thread_mutex_t sl_mutex;
116 /* The main state for this overlay */
117 typedef struct syncprov_info_t {
119 struct berval si_ctxcsn; /* ldapsync context */
120 int si_chkops; /* checkpointing info */
122 int si_numops; /* number of ops since last checkpoint */
123 int si_nopres; /* Skip present phase */
124 time_t si_chklast; /* time of last checkpoint */
125 Avlnode *si_mods; /* entries being modified */
127 ldap_pvt_thread_mutex_t si_csn_mutex;
128 ldap_pvt_thread_mutex_t si_ops_mutex;
129 ldap_pvt_thread_mutex_t si_mods_mutex;
130 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
133 typedef struct opcookie {
135 syncmatches *smatches;
136 struct berval sdn; /* DN of entry, for deletes */
138 struct berval suuid; /* UUID of entry */
139 struct berval sctxcsn;
140 int sreference; /* Is the entry a reference? */
143 typedef struct fbase_cookie {
144 struct berval *fdn; /* DN of a modified entry, for scope testing */
145 syncops *fss; /* persistent search we're testing against */
146 int fbase; /* if TRUE we found the search base and it's still valid */
147 int fscope; /* if TRUE then fdn is within the psearch scope */
150 static AttributeName csn_anlist[3];
151 static AttributeName uuid_anlist[2];
153 /* Build a LDAPsync intermediate state control */
159 int entry_sync_state,
163 struct berval *cookie )
168 BerElementBuffer berbuf;
169 BerElement *ber = (BerElement *)&berbuf;
171 struct berval entryuuid_bv = BER_BVNULL;
173 ber_init2( ber, 0, LBER_USE_DER );
174 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
176 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
178 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
179 AttributeDescription *desc = a->a_desc;
180 if ( desc == slap_schema.si_ad_entryUUID ) {
181 entryuuid_bv = a->a_nvals[0];
186 /* FIXME: what if entryuuid is NULL or empty ? */
188 if ( send_cookie && cookie ) {
189 ber_printf( ber, "{eOON}",
190 entry_sync_state, &entryuuid_bv, cookie );
192 ber_printf( ber, "{eON}",
193 entry_sync_state, &entryuuid_bv );
196 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
197 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
198 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
203 Debug( LDAP_DEBUG_TRACE,
204 "slap_build_sync_ctrl: ber_flatten2 failed\n",
206 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
213 /* Build a LDAPsync final state control */
221 struct berval *cookie,
225 BerElementBuffer berbuf;
226 BerElement *ber = (BerElement *)&berbuf;
228 ber_init2( ber, NULL, LBER_USE_DER );
229 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
231 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
233 ber_printf( ber, "{" );
234 if ( send_cookie && cookie ) {
235 ber_printf( ber, "O", cookie );
237 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
238 ber_printf( ber, "b", refreshDeletes );
240 ber_printf( ber, "N}" );
242 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
243 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
244 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
249 Debug( LDAP_DEBUG_TRACE,
250 "syncprov_done_ctrl: ber_flatten2 failed\n",
252 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
264 struct berval *cookie,
269 BerElementBuffer berbuf;
270 BerElement *ber = (BerElement *)&berbuf;
271 struct berval rspdata;
275 ber_init2( ber, NULL, LBER_USE_DER );
276 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
280 case LDAP_TAG_SYNC_NEW_COOKIE:
281 ber_printf( ber, "tO", type, cookie );
283 case LDAP_TAG_SYNC_REFRESH_DELETE:
284 case LDAP_TAG_SYNC_REFRESH_PRESENT:
285 ber_printf( ber, "t{", type );
287 ber_printf( ber, "O", cookie );
289 if ( refreshDone == 0 ) {
290 ber_printf( ber, "b", refreshDone );
292 ber_printf( ber, "N}" );
294 case LDAP_TAG_SYNC_ID_SET:
295 ber_printf( ber, "t{", type );
297 ber_printf( ber, "O", cookie );
299 if ( refreshDeletes == 1 ) {
300 ber_printf( ber, "b", refreshDeletes );
302 ber_printf( ber, "[W]", syncUUIDs );
303 ber_printf( ber, "N}" );
306 Debug( LDAP_DEBUG_TRACE,
307 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
313 ret = ber_flatten2( ber, &rspdata, 0 );
316 Debug( LDAP_DEBUG_TRACE,
317 "syncprov_sendinfo: ber_flatten2 failed\n",
319 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
323 rs->sr_rspoid = LDAP_SYNC_INFO;
324 rs->sr_rspdata = &rspdata;
325 send_ldap_intermediate( op, rs );
326 rs->sr_rspdata = NULL;
332 /* Find a modtarget in an AVL tree */
334 sp_avl_cmp( const void *c1, const void *c2 )
336 const modtarget *m1, *m2;
340 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
343 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
346 /* syncprov_findbase:
347 * finds the true DN of the base of a search (with alias dereferencing) and
348 * checks to make sure the base entry doesn't get replaced with a different
349 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
350 * change is detected, any persistent search on this base must be terminated /
352 * On the first call, we just save the DN and entryID. On subsequent calls
353 * we compare the DN and entryID with the saved values.
356 findbase_cb( Operation *op, SlapReply *rs )
358 slap_callback *sc = op->o_callback;
360 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
361 fbase_cookie *fc = sc->sc_private;
363 /* If no entryID, we're looking for the first time.
364 * Just store whatever we got.
366 if ( fc->fss->s_eid == NOID ) {
368 fc->fss->s_eid = rs->sr_entry->e_id;
369 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
371 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
372 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
374 /* OK, the DN is the same and the entryID is the same. */
378 if ( rs->sr_err != LDAP_SUCCESS ) {
379 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
385 syncprov_findbase( Operation *op, fbase_cookie *fc )
387 opcookie *opc = op->o_callback->sc_private;
388 slap_overinst *on = opc->son;
390 /* Use basic parameters from syncrepl search, but use
391 * current op's threadctx / tmpmemctx
393 ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex );
394 if ( fc->fss->s_flags & PS_FIND_BASE ) {
395 slap_callback cb = {0};
397 SlapReply frs = { REP_RESULT };
400 fc->fss->s_flags ^= PS_FIND_BASE;
401 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
403 fop = *fc->fss->s_op;
405 fop.o_hdr = op->o_hdr;
407 fop.o_time = op->o_time;
408 fop.o_tincr = op->o_tincr;
410 cb.sc_response = findbase_cb;
413 fop.o_sync_mode = 0; /* turn off sync mode */
414 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
415 fop.o_callback = &cb;
416 fop.o_tag = LDAP_REQ_SEARCH;
417 fop.ors_scope = LDAP_SCOPE_BASE;
418 fop.ors_limit = NULL;
420 fop.ors_tlimit = SLAP_NO_LIMIT;
421 fop.ors_attrs = slap_anlist_no_attrs;
422 fop.ors_attrsonly = 1;
424 fop.o_bd->bd_info = on->on_info->oi_orig;
425 rc = fop.o_bd->be_search( &fop, &frs );
426 fop.o_bd->bd_info = (BackendInfo *)on;
428 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
432 /* After the first call, see if the fdn resides in the scope */
433 if ( fc->fbase == 1 ) {
434 switch ( fc->fss->s_op->ors_scope ) {
435 case LDAP_SCOPE_BASE:
436 fc->fscope = dn_match( fc->fdn, &fc->fss->s_base );
438 case LDAP_SCOPE_ONELEVEL: {
440 dnParent( fc->fdn, &pdn );
441 fc->fscope = dn_match( &pdn, &fc->fss->s_base );
443 case LDAP_SCOPE_SUBTREE:
444 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base );
446 #ifdef LDAP_SCOPE_SUBORDINATE
447 case LDAP_SCOPE_SUBORDINATE:
448 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) &&
449 !dn_match( fc->fdn, &fc->fss->s_base );
458 /* If entryID has changed, then the base of this search has
459 * changed. Invalidate the psearch.
461 return LDAP_NO_SUCH_OBJECT;
465 * This function has three different purposes, but they all use a search
466 * that filters on entryCSN so they're combined here.
467 * 1: at startup time, after a contextCSN has been read from the database,
468 * we search for all entries with CSN >= contextCSN in case the contextCSN
469 * was not checkpointed at the previous shutdown.
471 * 2: when the current contextCSN is known and we have a sync cookie, we search
472 * for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.
473 * If an entry is found, the cookie CSN is valid, otherwise it is stale.
475 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
476 * CSN, and generate Present records for them. We always collect this result
477 * in SyncID sets, even if there's only one match.
479 #define FIND_MAXCSN 1
481 #define FIND_PRESENT 3
484 findmax_cb( Operation *op, SlapReply *rs )
486 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
487 struct berval *maxcsn = op->o_callback->sc_private;
488 Attribute *a = attr_find( rs->sr_entry->e_attrs,
489 slap_schema.si_ad_entryCSN );
491 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
492 maxcsn->bv_len = a->a_vals[0].bv_len;
493 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
500 findcsn_cb( Operation *op, SlapReply *rs )
502 slap_callback *sc = op->o_callback;
504 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
505 sc->sc_private = (void *)1;
510 /* Build a list of entryUUIDs for sending in a SyncID set */
514 typedef struct fpres_cookie {
521 findpres_cb( Operation *op, SlapReply *rs )
523 slap_callback *sc = op->o_callback;
524 fpres_cookie *pc = sc->sc_private;
526 int ret = SLAP_CB_CONTINUE;
528 switch ( rs->sr_type ) {
530 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
532 pc->uuids[pc->num].bv_val = pc->last;
533 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
534 pc->uuids[pc->num].bv_len );
536 pc->last = pc->uuids[pc->num].bv_val;
537 pc->uuids[pc->num].bv_val = NULL;
540 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
546 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
548 pc->uuids[pc->num].bv_val = pc->last;
550 pc->last = pc->uuids[0].bv_val;
560 syncprov_findcsn( Operation *op, int mode )
562 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
563 syncprov_info_t *si = on->on_bi.bi_private;
565 slap_callback cb = {0};
567 SlapReply frs = { REP_RESULT };
568 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
569 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
570 struct berval maxcsn;
572 #ifdef LDAP_COMP_MATCH
573 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
575 AttributeAssertion eq = { NULL, BER_BVNULL };
577 int i, rc = LDAP_SUCCESS;
578 fpres_cookie pcookie;
579 sync_control *srs = NULL;
580 int findcsn_retry = 1;
582 if ( mode != FIND_MAXCSN ) {
583 srs = op->o_controls[slap_cids.sc_LDAPsync];
585 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
591 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
592 /* We want pure entries, not referrals */
593 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
596 cf.f_av_desc = slap_schema.si_ad_entryCSN;
599 fop.o_callback = &cb;
600 fop.ors_limit = NULL;
601 fop.ors_tlimit = SLAP_NO_LIMIT;
602 fop.ors_filter = &cf;
603 fop.ors_filterstr.bv_val = buf;
608 cf.f_choice = LDAP_FILTER_GE;
609 cf.f_av_value = si->si_ctxcsn;
610 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
611 cf.f_av_value.bv_val );
612 fop.ors_attrsonly = 0;
613 fop.ors_attrs = csn_anlist;
614 fop.ors_slimit = SLAP_NO_LIMIT;
615 cb.sc_private = &maxcsn;
616 cb.sc_response = findmax_cb;
617 strcpy( cbuf, si->si_ctxcsn.bv_val );
618 maxcsn.bv_val = cbuf;
619 maxcsn.bv_len = si->si_ctxcsn.bv_len;
622 cf.f_av_value = srs->sr_state.ctxcsn;
623 /* Look for exact match the first time */
624 if ( findcsn_retry ) {
625 cf.f_choice = LDAP_FILTER_EQUALITY;
626 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN=%s)",
627 cf.f_av_value.bv_val );
628 /* On retry, look for <= */
630 cf.f_choice = LDAP_FILTER_LE;
631 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
632 cf.f_av_value.bv_val );
634 fop.ors_attrsonly = 1;
635 fop.ors_attrs = slap_anlist_no_attrs;
637 cb.sc_private = NULL;
638 cb.sc_response = findcsn_cb;
641 af.f_choice = LDAP_FILTER_AND;
644 cf.f_choice = LDAP_FILTER_LE;
645 cf.f_av_value = srs->sr_state.ctxcsn;
646 cf.f_next = op->ors_filter;
647 fop.ors_filter = ⁡
648 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
649 fop.ors_attrsonly = 0;
650 fop.ors_attrs = uuid_anlist;
651 fop.ors_slimit = SLAP_NO_LIMIT;
652 cb.sc_private = &pcookie;
653 cb.sc_response = findpres_cb;
656 /* preallocate storage for a full set */
657 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
658 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
660 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
661 pcookie.uuids[0].bv_val = pcookie.last;
662 pcookie.uuids[0].bv_len = UUID_LEN;
663 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
664 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
665 pcookie.uuids[i].bv_len = UUID_LEN;
670 fop.o_bd->bd_info = on->on_info->oi_orig;
671 fop.o_bd->be_search( &fop, &frs );
672 fop.o_bd->bd_info = (BackendInfo *)on;
676 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
677 si->si_ctxcsn.bv_len = maxcsn.bv_len;
680 /* If matching CSN was not found, invalidate the context. */
681 if ( !cb.sc_private ) {
682 /* If we didn't find an exact match, then try for <= */
683 if ( findcsn_retry ) {
687 rc = LDAP_NO_SUCH_OBJECT;
691 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
692 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
699 /* Send a persistent search response */
701 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode)
703 slap_overinst *on = opc->son;
705 SlapReply rs = { REP_SEARCH };
706 LDAPControl *ctrls[2];
707 struct berval cookie;
709 Attribute a_uuid = {0};
711 if ( so->s_op->o_abandon )
712 return SLAPD_ABANDON;
715 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
717 e_uuid.e_attrs = &a_uuid;
718 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
719 a_uuid.a_nvals = &opc->suuid;
720 rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid,
721 mode, ctrls, 0, 1, &cookie );
724 op->o_bd->bd_info = (BackendInfo *)on->on_info;
728 if ( rs.sr_entry->e_private )
729 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
730 if ( opc->sreference ) {
731 rs.sr_ref = get_entry_referrals( op, rs.sr_entry );
732 send_search_reference( op, &rs );
733 ber_bvarray_free( rs.sr_ref );
739 case LDAP_SYNC_MODIFY:
741 if ( rs.sr_entry->e_private )
742 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
743 rs.sr_attrs = op->ors_attrs;
744 send_search_entry( op, &rs );
748 case LDAP_SYNC_DELETE:
749 e_uuid.e_attrs = NULL;
750 e_uuid.e_name = opc->sdn;
751 e_uuid.e_nname = opc->sndn;
752 rs.sr_entry = &e_uuid;
753 if ( opc->sreference ) {
754 struct berval bv = BER_BVNULL;
756 send_search_reference( op, &rs );
758 send_search_entry( op, &rs );
764 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
770 /* Play back queued responses */
772 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
780 op->o_bd->bd_info = (BackendInfo *)on->on_info;
783 ldap_pvt_thread_mutex_lock( &so->s_mutex );
786 so->s_res = sr->s_next;
788 so->s_restail = NULL;
789 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
794 if ( !so->s_op->o_abandon ) {
796 opc.sndn = sr->s_ndn;
797 opc.suuid = sr->s_uuid;
798 opc.sctxcsn = sr->s_csn;
799 opc.sreference = sr->s_isreference;
802 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
803 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
809 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode );
812 be_entry_release_rw( op, e, 0 );
820 op->o_bd->bd_info = (BackendInfo *)on;
824 /* runqueue task for playing back queued responses */
826 syncprov_qtask( void *ctx, void *arg )
828 struct re_s *rtask = arg;
829 syncops *so = rtask->arg;
830 slap_overinst *on = so->s_op->o_private;
831 char opbuf[OPERATION_BUFFER_SIZE];
835 op = (Operation *)opbuf;
836 memset( op, 0, sizeof(opbuf));
837 op->o_hdr = (Opheader *)(op+1);
838 op->o_controls = (void **)(op->o_hdr+1);
840 *op->o_hdr = *so->s_op->o_hdr;
842 op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx);
843 op->o_tmpmfuncs = &slap_sl_mfuncs;
844 op->o_threadctx = ctx;
846 /* syncprov_qplay expects a fake db */
847 be = *so->s_op->o_bd;
848 be.be_flags |= SLAP_DBFLAG_OVERLAY;
850 op->o_private = NULL;
851 op->o_callback = NULL;
853 syncprov_qplay( op, on, so );
855 /* wait until we get explicitly scheduled again */
856 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
857 ldap_pvt_runqueue_stoptask( &slapd_rq, so->s_qtask );
858 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 1 );
859 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
864 /* Queue a persistent search response */
866 syncprov_qresp( opcookie *opc, syncops *so, int mode )
870 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
871 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
873 sr->s_dn.bv_val = (char *)(sr + 1);
874 sr->s_dn.bv_len = opc->sdn.bv_len;
876 sr->s_isreference = opc->sreference;
877 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
878 sr->s_ndn.bv_len = opc->sndn.bv_len;
879 *(sr->s_ndn.bv_val++) = '\0';
880 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
881 sr->s_uuid.bv_len = opc->suuid.bv_len;
882 *(sr->s_uuid.bv_val++) = '\0';
883 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
884 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
885 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
887 ldap_pvt_thread_mutex_lock( &so->s_mutex );
891 so->s_restail->s_next = sr;
895 /* If the base of the psearch was modified, check it next time round */
896 if ( so->s_flags & PS_WROTE_BASE ) {
897 so->s_flags ^= PS_WROTE_BASE;
898 so->s_flags |= PS_FIND_BASE;
900 if ( so->s_flags & PS_IS_DETACHED ) {
901 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
902 if ( !so->s_qtask ) {
903 so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, 1,
904 syncprov_qtask, so, "syncprov_qtask",
905 so->s_op->o_conn->c_peer_name.bv_val );
907 if (!ldap_pvt_runqueue_isrunning( &slapd_rq, so->s_qtask )) {
908 so->s_qtask->interval.tv_sec = 0;
909 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 0 );
910 so->s_qtask->interval.tv_sec = 1;
913 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
915 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
920 syncprov_free_syncop( syncops *so )
922 syncres *sr, *srnext;
923 GroupAssertion *ga, *gnext;
925 ldap_pvt_thread_mutex_lock( &so->s_mutex );
927 if ( so->s_inuse > 0 ) {
928 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
931 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
932 if ( so->s_flags & PS_IS_DETACHED ) {
933 filter_free( so->s_op->ors_filter );
934 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
940 ch_free( so->s_base.bv_val );
941 for ( sr=so->s_res; sr; sr=srnext ) {
945 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
950 syncprov_drop_psearch( syncops *so, int lock )
952 if ( so->s_flags & PS_IS_DETACHED ) {
954 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
955 so->s_op->o_conn->c_n_ops_executing--;
956 so->s_op->o_conn->c_n_ops_completed++;
957 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
960 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
962 syncprov_free_syncop( so );
968 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
970 slap_callback *sc = op->o_callback;
971 op->o_callback = sc->sc_next;
972 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
973 op->o_tmpfree( sc, op->o_tmpmemctx );
978 syncprov_op_abandon( Operation *op, SlapReply *rs )
980 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
981 syncprov_info_t *si = on->on_bi.bi_private;
982 syncops *so, *soprev;
984 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
985 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
986 soprev=so, so=so->s_next ) {
987 if ( so->s_op->o_connid == op->o_connid &&
988 so->s_op->o_msgid == op->orn_msgid ) {
989 so->s_op->o_abandon = 1;
990 soprev->s_next = so->s_next;
994 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
996 /* Is this really a Cancel exop? */
997 if ( op->o_tag != LDAP_REQ_ABANDON ) {
998 so->s_op->o_cancel = SLAP_CANCEL_ACK;
999 rs->sr_err = LDAP_CANCELLED;
1000 send_ldap_result( so->s_op, rs );
1001 if ( so->s_flags & PS_IS_DETACHED ) {
1003 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
1004 cb->sc_cleanup = syncprov_ab_cleanup;
1005 cb->sc_next = op->o_callback;
1006 cb->sc_private = so;
1007 return SLAP_CB_CONTINUE;
1010 syncprov_drop_psearch( so, 0 );
1012 return SLAP_CB_CONTINUE;
1015 /* Find which persistent searches are affected by this operation */
1017 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
1019 slap_overinst *on = opc->son;
1020 syncprov_info_t *si = on->on_bi.bi_private;
1023 syncops *ss, *sprev, *snext;
1027 struct berval newdn;
1030 fc.fdn = &op->o_req_ndn;
1031 /* compute new DN */
1032 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1034 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
1035 else dnParent( fc.fdn, &pdn );
1036 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
1040 if ( op->o_tag != LDAP_REQ_ADD ) {
1041 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1042 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
1043 /* If we're sending responses now, make a copy and unlock the DB */
1044 if ( e && !saveit ) {
1045 Entry *e2 = entry_dup( e );
1046 be_entry_release_rw( op, e, 0 );
1049 op->o_bd->bd_info = (BackendInfo *)on;
1055 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1056 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1057 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1058 opc->sreference = is_entry_referral( e );
1059 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1061 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1062 } else if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1063 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1064 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1065 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1066 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1069 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1070 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1071 sprev = ss, ss=snext)
1082 /* If the base of the search is missing, signal a refresh */
1083 rc = syncprov_findbase( op, &fc );
1084 if ( rc != LDAP_SUCCESS ) {
1085 SlapReply rs = {REP_RESULT};
1086 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1087 "search base has changed" );
1088 sprev->s_next = snext;
1089 syncprov_drop_psearch( ss, 1 );
1095 /* If we're sending results now, look for this op in old matches */
1099 /* Did we modify the search base? */
1100 if ( dn_match( &op->o_req_ndn, &ss->s_base )) {
1101 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1102 ss->s_flags |= PS_WROTE_BASE;
1103 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1106 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1107 old=sm, sm=sm->sm_next ) {
1108 if ( sm->sm_op == ss ) {
1110 old->sm_next = sm->sm_next;
1111 op->o_tmpfree( sm, op->o_tmpmemctx );
1117 /* check if current o_req_dn is in scope and matches filter */
1118 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1119 LDAP_COMPARE_TRUE ) {
1121 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1122 sm->sm_next = opc->smatches;
1127 /* if found send UPDATE else send ADD */
1129 syncprov_qresp( opc, ss,
1130 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD );
1133 } else if ( !saveit && found ) {
1135 syncprov_qresp( opc, ss, LDAP_SYNC_DELETE );
1138 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1140 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1141 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1142 be_entry_release_rw( op, e, 0 );
1143 op->o_bd->bd_info = (BackendInfo *)on;
1146 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1151 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1153 slap_callback *cb = op->o_callback;
1154 opcookie *opc = cb->sc_private;
1155 slap_overinst *on = opc->son;
1156 syncprov_info_t *si = on->on_bi.bi_private;
1157 syncmatches *sm, *snext;
1158 modtarget *mt, mtdummy;
1160 for (sm = opc->smatches; sm; sm=snext) {
1161 snext = sm->sm_next;
1162 syncprov_free_syncop( sm->sm_op );
1163 op->o_tmpfree( sm, op->o_tmpmemctx );
1166 /* Remove op from lock table */
1168 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1169 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1171 modinst *mi = mt->mt_mods;
1173 /* If there are more, promote the next one */
1174 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1175 if ( mi->mi_next ) {
1176 mt->mt_mods = mi->mi_next;
1177 mt->mt_op = mt->mt_mods->mi_op;
1178 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1180 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1181 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1182 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1186 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1187 if ( !BER_BVISNULL( &opc->suuid ))
1188 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1189 if ( !BER_BVISNULL( &opc->sndn ))
1190 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1191 if ( !BER_BVISNULL( &opc->sdn ))
1192 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1193 op->o_callback = cb->sc_next;
1194 op->o_tmpfree(cb, op->o_tmpmemctx);
1200 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1202 syncprov_info_t *si = on->on_bi.bi_private;
1205 struct berval bv[2];
1206 slap_callback cb = {0};
1207 int manage = get_manageDSAit(op);
1209 mod.sml_values = bv;
1210 bv[1].bv_val = NULL;
1211 bv[0] = si->si_ctxcsn;
1212 mod.sml_nvalues = NULL;
1213 mod.sml_desc = slap_schema.si_ad_contextCSN;
1214 mod.sml_op = LDAP_MOD_REPLACE;
1216 mod.sml_next = NULL;
1218 cb.sc_response = slap_null_cb;
1220 opm.o_tag = LDAP_REQ_MODIFY;
1221 opm.o_callback = &cb;
1222 opm.orm_modlist = &mod;
1223 opm.o_req_dn = op->o_bd->be_suffix[0];
1224 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1225 opm.o_bd->bd_info = on->on_info->oi_orig;
1226 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1227 opm.o_bd->be_modify( &opm, rs );
1228 opm.o_managedsait = manage;
1232 syncprov_add_slog( Operation *op, struct berval *csn )
1234 opcookie *opc = op->o_callback->sc_private;
1235 slap_overinst *on = opc->son;
1236 syncprov_info_t *si = on->on_bi.bi_private;
1242 /* Allocate a record. UUIDs are not NUL-terminated. */
1243 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1246 se->se_tag = op->o_tag;
1248 se->se_uuid.bv_val = (char *)(se+1);
1249 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1250 se->se_uuid.bv_len = opc->suuid.bv_len;
1252 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
1253 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1254 se->se_csn.bv_val[csn->bv_len] = '\0';
1255 se->se_csn.bv_len = csn->bv_len;
1257 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1258 if ( sl->sl_head ) {
1259 sl->sl_tail->se_next = se;
1265 while ( sl->sl_num > sl->sl_size ) {
1267 sl->sl_head = se->se_next;
1268 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1269 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1272 if ( !sl->sl_head ) {
1276 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1280 /* Just set a flag if we found the matching entry */
1282 playlog_cb( Operation *op, SlapReply *rs )
1284 if ( rs->sr_type == REP_SEARCH ) {
1285 op->o_callback->sc_private = (void *)1;
1290 /* enter with sl->sl_mutex locked, release before returning */
1292 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1293 struct berval *oldcsn, struct berval *ctxcsn )
1295 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1297 int i, j, ndel, num, nmods, mmods;
1300 if ( !sl->sl_num ) {
1301 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1309 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1310 num * UUID_LEN, op->o_tmpmemctx );
1312 uuids[0].bv_val = (char *)(uuids + num + 1);
1314 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1315 * and everything else at the end. Do this first so we can
1316 * unlock the list mutex.
1318 for ( se=sl->sl_head; se; se=se->se_next ) {
1319 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1320 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1321 if ( se->se_tag == LDAP_REQ_DELETE ) {
1328 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1329 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1330 uuids[j].bv_len = UUID_LEN;
1332 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1336 /* Zero out unused slots */
1337 for ( i=ndel; i < num - nmods; i++ )
1338 uuids[i].bv_len = 0;
1340 /* Mods must be validated to see if they belong in this delete set.
1344 /* Strip any duplicates */
1345 for ( i=0; i<nmods; i++ ) {
1346 for ( j=0; j<ndel; j++ ) {
1347 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1348 uuids[num - 1 - i].bv_len = 0;
1353 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1354 for ( j=0; j<i; j++ ) {
1355 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1356 uuids[num - 1 - i].bv_len = 0;
1365 SlapReply frs = { REP_RESULT };
1368 #ifdef LDAP_COMP_MATCH
1369 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1371 AttributeAssertion eq;
1373 slap_callback cb = {0};
1377 fop.o_sync_mode = 0;
1378 fop.o_callback = &cb;
1379 fop.ors_limit = NULL;
1380 fop.ors_tlimit = SLAP_NO_LIMIT;
1381 fop.ors_attrs = slap_anlist_all_attributes;
1382 fop.ors_attrsonly = 0;
1383 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1385 af.f_choice = LDAP_FILTER_AND;
1388 mf.f_choice = LDAP_FILTER_EQUALITY;
1390 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1391 mf.f_next = fop.ors_filter;
1393 fop.ors_filter = ⁡
1395 cb.sc_response = playlog_cb;
1396 fop.o_bd->bd_info = on->on_info->oi_orig;
1398 for ( i=ndel; i<num; i++ ) {
1399 if ( uuids[i].bv_len == 0 ) continue;
1401 mf.f_av_value = uuids[i];
1402 cb.sc_private = NULL;
1404 rc = fop.o_bd->be_search( &fop, &frs );
1406 /* If entry was not found, add to delete list */
1407 if ( !cb.sc_private ) {
1408 uuids[ndel++] = uuids[i];
1411 fop.o_bd->bd_info = (BackendInfo *)on;
1414 uuids[ndel].bv_val = NULL;
1415 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1420 syncprov_op_response( Operation *op, SlapReply *rs )
1422 opcookie *opc = op->o_callback->sc_private;
1423 slap_overinst *on = opc->son;
1424 syncprov_info_t *si = on->on_bi.bi_private;
1427 if ( rs->sr_err == LDAP_SUCCESS )
1429 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1430 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1432 /* Update our context CSN */
1434 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1435 slap_get_commit_csn( op, &maxcsn, &curcsn );
1436 if ( !BER_BVISNULL( &maxcsn ) ) {
1437 strcpy( cbuf, maxcsn.bv_val );
1438 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1439 strcpy( si->si_ctxcsnbuf, cbuf );
1440 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1444 /* Don't do any processing for consumer contextCSN updates */
1445 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1446 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1447 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1448 return SLAP_CB_CONTINUE;
1452 if ( si->si_chkops || si->si_chktime ) {
1454 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1458 if ( si->si_chktime &&
1459 (op->o_time - si->si_chklast >= si->si_chktime )) {
1461 si->si_chklast = op->o_time;
1464 syncprov_checkpoint( op, rs, on );
1467 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1469 opc->sctxcsn.bv_len = maxcsn.bv_len;
1470 opc->sctxcsn.bv_val = cbuf;
1472 /* Handle any persistent searches */
1476 case LDAP_REQ_MODIFY:
1477 case LDAP_REQ_MODRDN:
1478 case LDAP_REQ_EXTENDED:
1479 syncprov_matchops( op, opc, 0 );
1481 case LDAP_REQ_DELETE:
1482 /* for each match in opc->smatches:
1485 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1486 if ( sm->sm_op->s_op->o_abandon )
1488 syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE );
1494 /* Add any log records */
1495 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1496 syncprov_add_slog( op, &curcsn );
1500 return SLAP_CB_CONTINUE;
1503 /* We don't use a subentry to store the context CSN any more.
1504 * We expose the current context CSN as an operational attribute
1505 * of the suffix entry.
1508 syncprov_op_compare( Operation *op, SlapReply *rs )
1510 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1511 syncprov_info_t *si = on->on_bi.bi_private;
1512 int rc = SLAP_CB_CONTINUE;
1514 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1515 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1519 struct berval bv[2];
1521 e.e_name = op->o_bd->be_suffix[0];
1522 e.e_nname = op->o_bd->be_nsuffix[0];
1524 BER_BVZERO( &bv[1] );
1525 bv[0] = si->si_ctxcsn;
1527 a.a_desc = slap_schema.si_ad_contextCSN;
1529 a.a_nvals = a.a_vals;
1531 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1533 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1534 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1535 if ( ! rs->sr_err ) {
1536 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1537 goto return_results;
1540 if ( get_assert( op ) &&
1541 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1543 rs->sr_err = LDAP_ASSERTION_FAILED;
1544 goto return_results;
1548 rs->sr_err = LDAP_COMPARE_FALSE;
1550 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1551 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1552 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1553 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1555 rs->sr_err = LDAP_COMPARE_TRUE;
1560 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1562 send_ldap_result( op, rs );
1564 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1565 rs->sr_err = LDAP_SUCCESS;
1574 syncprov_op_mod( Operation *op, SlapReply *rs )
1576 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1577 syncprov_info_t *si = on->on_bi.bi_private;
1579 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1581 (si->si_ops ? sizeof(modinst) : 0 ),
1583 opcookie *opc = (opcookie *)(cb+1);
1585 cb->sc_response = syncprov_op_response;
1586 cb->sc_cleanup = syncprov_op_cleanup;
1587 cb->sc_private = opc;
1588 cb->sc_next = op->o_callback;
1589 op->o_callback = cb;
1591 /* If there are active persistent searches, lock this operation.
1592 * See seqmod.c for the locking logic on its own.
1595 modtarget *mt, mtdummy;
1598 mi = (modinst *)(opc+1);
1601 /* See if we're already modifying this entry... */
1603 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1604 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1606 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1607 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1608 mt->mt_tail->mi_next = mi;
1610 /* wait for this op to get to head of list */
1611 while ( mt->mt_mods != mi ) {
1612 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1613 ldap_pvt_thread_yield();
1614 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1616 /* clean up if the caller is giving up */
1617 if ( op->o_abandon ) {
1619 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1621 m2->mi_next = mi->mi_next;
1622 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1623 op->o_tmpfree( cb, op->o_tmpmemctx );
1624 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1625 return SLAPD_ABANDON;
1628 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1630 /* Record that we're modifying this entry now */
1631 mt = ch_malloc( sizeof(modtarget) );
1634 mt->mt_op = mi->mi_op;
1635 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1636 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1637 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1641 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1642 syncprov_matchops( op, opc, 1 );
1644 return SLAP_CB_CONTINUE;
1648 syncprov_op_extended( Operation *op, SlapReply *rs )
1650 if ( exop_is_write( op ))
1651 return syncprov_op_mod( op, rs );
1653 return SLAP_CB_CONTINUE;
1656 typedef struct searchstate {
1657 slap_overinst *ss_on;
1660 struct berval ss_ctxcsn;
1661 char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1665 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1667 if ( rs->sr_ctrls ) {
1668 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1669 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1670 rs->sr_ctrls = NULL;
1676 syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on )
1682 GroupAssertion *g1, *g2;
1684 /* count the search attrs */
1685 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1686 alen += op->ors_attrs[i].an_name.bv_len + 1;
1688 /* Make a new copy of the operation */
1689 size = sizeof(Operation) + sizeof(Opheader) +
1690 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1691 op->o_req_dn.bv_len + 1 +
1692 op->o_req_ndn.bv_len + 1 +
1693 op->o_ndn.bv_len + 1 +
1694 so->s_filterstr.bv_len + 1;
1695 op2 = (Operation *)ch_calloc( 1, size );
1696 op2->o_hdr = (Opheader *)(op2+1);
1698 /* Copy the fields we care about explicitly, leave the rest alone */
1699 *op2->o_hdr = *op->o_hdr;
1700 op2->o_tag = op->o_tag;
1701 op2->o_time = op->o_time;
1702 op2->o_bd = on->on_info->oi_origdb;
1703 op2->o_request = op->o_request;
1704 op2->o_private = on;
1707 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1708 ptr = (char *)(op2->ors_attrs+i+1);
1709 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1710 op2->ors_attrs[i] = op->ors_attrs[i];
1711 op2->ors_attrs[i].an_name.bv_val = ptr;
1712 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1714 BER_BVZERO( &op2->ors_attrs[i].an_name );
1716 ptr = (char *)(op2->o_hdr + 1);
1718 op2->o_authz = op->o_authz;
1719 op2->o_ndn.bv_val = ptr;
1720 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1721 op2->o_dn = op2->o_ndn;
1722 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1723 op2->o_req_dn.bv_val = ptr;
1724 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1725 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1726 op2->o_req_ndn.bv_val = ptr;
1727 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1728 op2->ors_filterstr.bv_val = ptr;
1729 strcpy( ptr, so->s_filterstr.bv_val );
1730 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1731 op2->ors_filter = str2filter( ptr );
1734 /* Copy any cached group ACLs individually */
1735 op2->o_groups = NULL;
1736 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1737 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1739 strcpy( g2->ga_ndn, g1->ga_ndn );
1740 g2->ga_next = op2->o_groups;
1743 /* Don't allow any further group caching */
1744 op2->o_do_not_cache = 1;
1746 /* Add op2 to conn so abandon will find us */
1747 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1748 op->o_conn->c_n_ops_executing++;
1749 op->o_conn->c_n_ops_completed--;
1750 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1751 so->s_flags |= PS_IS_DETACHED;
1752 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1756 syncprov_search_response( Operation *op, SlapReply *rs )
1758 searchstate *ss = op->o_callback->sc_private;
1759 slap_overinst *on = ss->ss_on;
1760 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1762 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1764 /* If we got a referral without a referral object, there's
1765 * something missing that we cannot replicate. Just ignore it.
1766 * The consumer will abort because we didn't send the expected
1769 if ( !rs->sr_entry ) {
1770 assert( rs->sr_entry != NULL );
1771 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1772 return SLAP_CB_CONTINUE;
1774 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );
1776 /* Make sure entry is less than the snaphot'd contextCSN */
1777 if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 )
1778 return LDAP_SUCCESS;
1780 /* Don't send the ctx entry twice */
1781 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) &&
1782 bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1783 return LDAP_SUCCESS;
1785 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1787 rs->sr_ctrls[1] = NULL;
1788 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1789 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1790 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1791 struct berval cookie;
1793 slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn,
1794 srs->sr_state.rid );
1796 /* Is this a regular refresh? */
1798 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1800 rs->sr_ctrls[1] = NULL;
1801 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1802 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1803 LDAP_SYNC_REFRESH_DELETES );
1805 /* It's RefreshAndPersist, transition to Persist phase */
1806 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1807 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1808 &cookie, 1, NULL, 0 );
1809 /* Flush any queued persist messages */
1810 if ( ss->ss_so->s_res ) {
1811 syncprov_qplay( op, on, ss->ss_so );
1814 /* Detach this Op from frontend control */
1815 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1817 /* Turn off the refreshing flag */
1818 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1820 syncprov_detach_op( op, ss->ss_so, on );
1821 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1823 return LDAP_SUCCESS;
1827 return SLAP_CB_CONTINUE;
1831 syncprov_op_search( Operation *op, SlapReply *rs )
1833 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1834 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1836 int gotstate = 0, nochange = 0, do_present;
1837 syncops *sop = NULL;
1840 struct berval ctxcsn;
1841 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1843 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1845 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1846 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1850 do_present = si->si_nopres ? 0 : 1;
1852 srs = op->o_controls[slap_cids.sc_LDAPsync];
1853 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1855 /* If this is a persistent search, set it up right away */
1856 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1866 so.s_flags = PS_IS_REFRESHING | PS_FIND_BASE;
1867 /* syncprov_findbase expects to be called as a callback... */
1868 sc.sc_private = &opc;
1870 cb = op->o_callback;
1871 op->o_callback = ≻
1872 rs->sr_err = syncprov_findbase( op, &fc );
1873 op->o_callback = cb;
1875 if ( rs->sr_err != LDAP_SUCCESS ) {
1876 send_ldap_result( op, rs );
1879 sop = ch_malloc( sizeof( syncops ));
1881 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1882 sop->s_rid = srs->sr_state.rid;
1885 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1886 sop->s_next = si->si_ops;
1888 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1891 /* snapshot the ctxcsn */
1892 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1893 strcpy( csnbuf, si->si_ctxcsnbuf );
1894 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1895 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1896 ctxcsn.bv_val = csnbuf;
1898 /* If we have a cookie, handle the PRESENT lookups */
1899 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1902 /* The cookie was validated when it was parsed, just use it */
1904 /* If just Refreshing and nothing has changed, shortcut it */
1905 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1907 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1908 LDAPControl *ctrls[2];
1912 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1913 NULL, LDAP_SYNC_REFRESH_DELETES );
1914 rs->sr_ctrls = ctrls;
1915 rs->sr_err = LDAP_SUCCESS;
1916 send_ldap_result( op, rs );
1917 rs->sr_ctrls = NULL;
1922 /* Do we have a sessionlog for this search? */
1925 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1926 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1928 /* mutex is unlocked in playlog */
1929 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1931 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1934 /* Is the CSN still present in the database? */
1935 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1936 /* No, so a reload is required */
1937 #if 0 /* the consumer doesn't seem to send this hint */
1938 if ( op->o_sync_rhint == 0 ) {
1939 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1945 /* If changed and doing Present lookup, send Present UUIDs */
1946 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1948 send_ldap_result( op, rs );
1955 /* Append CSN range to search filter, save original filter
1956 * for persistent search evaluation
1959 sop->s_filterstr= op->ors_filterstr;
1962 /* If something changed, find the changes */
1963 if ( gotstate && !nochange ) {
1964 Filter *fand, *fava;
1966 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1967 fand->f_choice = LDAP_FILTER_AND;
1968 fand->f_next = NULL;
1969 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1971 fava->f_choice = LDAP_FILTER_GE;
1972 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1973 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1974 #ifdef LDAP_COMP_MATCH
1975 fava->f_ava->aa_cf = NULL;
1977 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1978 fava->f_next = op->ors_filter;
1979 op->ors_filter = fand;
1980 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1983 /* Let our callback add needed info to returned entries */
1984 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1985 ss = (searchstate *)(cb+1);
1988 ss->ss_present = do_present;
1989 ss->ss_ctxcsn.bv_len = ctxcsn.bv_len;
1990 ss->ss_ctxcsn.bv_val = ss->ss_csnbuf;
1991 strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val );
1992 cb->sc_response = syncprov_search_response;
1993 cb->sc_cleanup = syncprov_search_cleanup;
1994 cb->sc_private = ss;
1995 cb->sc_next = op->o_callback;
1996 op->o_callback = cb;
1998 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1999 op->o_sync_mode &= SLAP_CONTROL_MASK;
2002 /* If this is a persistent search and no changes were reported during
2003 * the refresh phase, just invoke the response callback to transition
2004 * us into persist phase
2007 rs->sr_err = LDAP_SUCCESS;
2008 rs->sr_nentries = 0;
2009 send_ldap_result( op, rs );
2012 return SLAP_CB_CONTINUE;
2016 syncprov_operational(
2020 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2021 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2023 if ( rs->sr_entry &&
2024 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
2026 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
2027 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
2028 Attribute *a, **ap = NULL;
2030 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
2031 if ( a->a_desc == slap_schema.si_ad_contextCSN )
2036 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
2038 a = ch_malloc( sizeof(Attribute));
2039 a->a_desc = slap_schema.si_ad_contextCSN;
2040 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
2041 a->a_vals[1].bv_val = NULL;
2042 a->a_nvals = a->a_vals;
2048 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
2050 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
2052 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
2054 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
2057 return SLAP_CB_CONTINUE;
2066 static ConfigDriver sp_cf_gen;
2068 static ConfigTable spcfg[] = {
2069 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2070 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2071 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2072 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2073 { "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2074 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2075 "DESC 'Session log size in ops' "
2076 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2077 { "syncprov-nopresent", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_NOPRES,
2078 sp_cf_gen, "( OLcfgOvAt:1.3 NAME 'olcSpNoPresent' "
2079 "DESC 'Omit Present phase processing' "
2080 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2081 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2084 static ConfigOCs spocs[] = {
2085 { "( OLcfgOvOc:1.1 "
2086 "NAME 'olcSyncProvConfig' "
2087 "DESC 'SyncRepl Provider configuration' "
2088 "SUP olcOverlayConfig "
2089 "MAY ( olcSpCheckpoint $ olcSpSessionlog $ olcSpNoPresent ) )",
2090 Cft_Overlay, spcfg },
2095 sp_cf_gen(ConfigArgs *c)
2097 slap_overinst *on = (slap_overinst *)c->bi;
2098 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2101 if ( c->op == SLAP_CONFIG_EMIT ) {
2102 switch ( c->type ) {
2104 if ( si->si_chkops || si->si_chktime ) {
2106 bv.bv_len = sprintf( c->msg, "%d %d",
2107 si->si_chkops, si->si_chktime );
2109 value_add_one( &c->rvalue_vals, &bv );
2115 if ( si->si_logs ) {
2116 c->value_int = si->si_logs->sl_size;
2122 if ( si->si_nopres ) {
2130 } else if ( c->op == LDAP_MOD_DELETE ) {
2131 switch ( c->type ) {
2138 si->si_logs->sl_size = 0;
2140 rc = LDAP_NO_SUCH_ATTRIBUTE;
2143 if ( si->si_nopres )
2146 rc = LDAP_NO_SUCH_ATTRIBUTE;
2151 switch ( c->type ) {
2153 si->si_chkops = atoi( c->argv[1] );
2154 si->si_chktime = atoi( c->argv[2] ) * 60;
2158 int size = c->value_int;
2161 sprintf( c->msg, "%s size %d is negative",
2163 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2164 return ARG_BAD_CONF;
2168 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2169 sl->sl_mincsn.bv_val = (char *)(sl+1);
2170 sl->sl_mincsn.bv_len = 0;
2172 sl->sl_head = sl->sl_tail = NULL;
2173 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2180 si->si_nopres = c->value_int;
2186 /* ITS#3456 we cannot run this search on the main thread, must use a
2187 * child thread in order to insure we have a big enough stack.
2194 syncprov_findcsn( ptr, FIND_MAXCSN );
2198 /* Read any existing contextCSN from the underlying db.
2199 * Then search for any entries newer than that. If no value exists,
2200 * just generate it. Cache whatever result.
2207 slap_overinst *on = (slap_overinst *) be->bd_info;
2208 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2211 char opbuf[OPERATION_BUFFER_SIZE];
2212 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2213 Operation *op = (Operation *)opbuf;
2217 void *thrctx = NULL;
2219 if ( slapMode & SLAP_TOOL_MODE ) {
2223 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2228 thrctx = ldap_pvt_thread_pool_context();
2229 connection_fake_init( &conn, op, thrctx );
2231 op->o_dn = be->be_rootdn;
2232 op->o_ndn = be->be_rootndn;
2234 ctxcsnbuf[0] = '\0';
2236 op->o_bd->bd_info = on->on_info->oi_orig;
2237 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2238 slap_schema.si_ad_contextCSN, 0, &e );
2241 ldap_pvt_thread_t tid;
2243 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2245 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2246 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2247 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2248 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2249 si->si_ctxcsn.bv_len );
2250 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2251 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2253 be_entry_release_rw( op, e, 0 );
2254 op->o_bd->bd_info = (BackendInfo *)on;
2255 op->o_req_dn = be->be_suffix[0];
2256 op->o_req_ndn = be->be_nsuffix[0];
2257 op->ors_scope = LDAP_SCOPE_SUBTREE;
2258 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2259 ldap_pvt_thread_join( tid, NULL );
2260 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2261 /* If we're also a consumer, and we didn't find the context entry,
2262 * then don't generate anything, wait for our provider to send it
2268 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2269 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2270 &si->si_ctxcsn, 0 );
2273 /* If our ctxcsn is different from what was read from the root
2274 * entry, make sure we do a checkpoint on close
2276 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2281 op->o_bd->bd_info = (BackendInfo *)on;
2282 ldap_pvt_thread_pool_context_reset( thrctx );
2286 /* Write the current contextCSN into the underlying db.
2293 slap_overinst *on = (slap_overinst *) be->bd_info;
2294 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2296 if ( slapMode & SLAP_TOOL_MODE ) {
2299 if ( si->si_numops ) {
2301 char opbuf[OPERATION_BUFFER_SIZE];
2302 Operation *op = (Operation *)opbuf;
2303 SlapReply rs = {REP_RESULT};
2306 thrctx = ldap_pvt_thread_pool_context();
2307 connection_fake_init( &conn, op, thrctx );
2309 op->o_dn = be->be_rootdn;
2310 op->o_ndn = be->be_rootndn;
2311 syncprov_checkpoint( op, &rs, on );
2312 ldap_pvt_thread_pool_context_reset( thrctx );
2323 slap_overinst *on = (slap_overinst *)be->bd_info;
2324 syncprov_info_t *si;
2326 si = ch_calloc(1, sizeof(syncprov_info_t));
2327 on->on_bi.bi_private = si;
2328 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2329 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2330 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2331 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2333 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2334 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2335 csn_anlist[1].an_desc = slap_schema.si_ad_entryUUID;
2336 csn_anlist[1].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2338 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2339 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2345 syncprov_db_destroy(
2349 slap_overinst *on = (slap_overinst *)be->bd_info;
2350 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2353 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2354 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2355 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2362 static int syncprov_parseCtrl (
2368 BerElementBuffer berbuf;
2369 BerElement *ber = (BerElement *)&berbuf;
2372 struct berval cookie = BER_BVNULL;
2376 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2377 rs->sr_text = "Sync control specified multiple times";
2378 return LDAP_PROTOCOL_ERROR;
2381 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2382 rs->sr_text = "Sync control specified with pagedResults control";
2383 return LDAP_PROTOCOL_ERROR;
2386 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2387 rs->sr_text = "Sync control value is empty (or absent)";
2388 return LDAP_PROTOCOL_ERROR;
2391 /* Parse the control value
2392 * syncRequestValue ::= SEQUENCE {
2397 * refreshAndPersist (3)
2399 * cookie syncCookie OPTIONAL
2403 ber_init2( ber, &ctrl->ldctl_value, 0 );
2405 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2406 rs->sr_text = "Sync control : mode decoding error";
2407 return LDAP_PROTOCOL_ERROR;
2411 case LDAP_SYNC_REFRESH_ONLY:
2412 mode = SLAP_SYNC_REFRESH;
2414 case LDAP_SYNC_REFRESH_AND_PERSIST:
2415 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2418 rs->sr_text = "Sync control : unknown update mode";
2419 return LDAP_PROTOCOL_ERROR;
2422 tag = ber_peek_tag( ber, &len );
2424 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2425 if (( ber_scanf( ber, /*{*/ "m", &cookie )) == LBER_ERROR ) {
2426 rs->sr_text = "Sync control : cookie decoding error";
2427 return LDAP_PROTOCOL_ERROR;
2430 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2431 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2432 rs->sr_text = "Sync control : rhint decoding error";
2433 return LDAP_PROTOCOL_ERROR;
2436 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2437 rs->sr_text = "Sync control : decoding error";
2438 return LDAP_PROTOCOL_ERROR;
2440 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2441 sr->sr_rhint = rhint;
2442 if (!BER_BVISNULL(&cookie)) {
2443 ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );
2444 slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx );
2445 if ( sr->sr_state.rid == -1 ) {
2446 rs->sr_text = "Sync control : cookie parsing error";
2447 return LDAP_PROTOCOL_ERROR;
2451 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2453 op->o_sync = ctrl->ldctl_iscritical
2454 ? SLAP_CONTROL_CRITICAL
2455 : SLAP_CONTROL_NONCRITICAL;
2457 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2459 return LDAP_SUCCESS;
2462 /* This overlay is set up for dynamic loading via moduleload. For static
2463 * configuration, you'll need to arrange for the slap_overinst to be
2464 * initialized and registered by some other function inside slapd.
2467 static slap_overinst syncprov;
2474 rc = register_supported_control( LDAP_CONTROL_SYNC,
2475 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2476 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2477 if ( rc != LDAP_SUCCESS ) {
2478 Debug( LDAP_DEBUG_ANY,
2479 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2483 syncprov.on_bi.bi_type = "syncprov";
2484 syncprov.on_bi.bi_db_init = syncprov_db_init;
2485 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2486 syncprov.on_bi.bi_db_open = syncprov_db_open;
2487 syncprov.on_bi.bi_db_close = syncprov_db_close;
2489 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2490 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2492 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2493 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2494 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2495 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2496 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2497 syncprov.on_bi.bi_op_search = syncprov_op_search;
2498 syncprov.on_bi.bi_extended = syncprov_op_extended;
2499 syncprov.on_bi.bi_operational = syncprov_operational;
2501 syncprov.on_bi.bi_cf_ocs = spocs;
2503 rc = config_register_schema( spcfg, spocs );
2504 if ( rc ) return rc;
2506 return overlay_register( &syncprov );
2509 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2511 init_module( int argc, char *argv[] )
2513 return syncprov_init();
2515 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2517 #endif /* defined(SLAPD_OVER_SYNCPROV) */