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 #define RUNQ_INTERVAL 36000 /* a long time */
74 ldap_pvt_thread_mutex_t s_mutex;
77 /* A received sync control */
78 typedef struct sync_control {
79 struct sync_cookie sr_state;
83 #if 0 /* moved back to slap.h */
84 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
86 /* o_sync_mode uses data bits of o_sync */
87 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
89 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
90 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
91 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
92 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
94 /* Record of which searches matched at premodify step */
95 typedef struct syncmatches {
96 struct syncmatches *sm_next;
100 /* Session log data */
101 typedef struct slog_entry {
102 struct slog_entry *se_next;
103 struct berval se_uuid;
104 struct berval se_csn;
108 typedef struct sessionlog {
109 struct berval sl_mincsn;
114 ldap_pvt_thread_mutex_t sl_mutex;
117 /* The main state for this overlay */
118 typedef struct syncprov_info_t {
120 struct berval si_ctxcsn; /* ldapsync context */
121 int si_chkops; /* checkpointing info */
123 int si_numops; /* number of ops since last checkpoint */
124 int si_nopres; /* Skip present phase */
125 time_t si_chklast; /* time of last checkpoint */
126 Avlnode *si_mods; /* entries being modified */
128 ldap_pvt_thread_mutex_t si_csn_mutex;
129 ldap_pvt_thread_mutex_t si_ops_mutex;
130 ldap_pvt_thread_mutex_t si_mods_mutex;
131 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
134 typedef struct opcookie {
136 syncmatches *smatches;
137 struct berval sdn; /* DN of entry, for deletes */
139 struct berval suuid; /* UUID of entry */
140 struct berval sctxcsn;
141 int sreference; /* Is the entry a reference? */
144 typedef struct fbase_cookie {
145 struct berval *fdn; /* DN of a modified entry, for scope testing */
146 syncops *fss; /* persistent search we're testing against */
147 int fbase; /* if TRUE we found the search base and it's still valid */
148 int fscope; /* if TRUE then fdn is within the psearch scope */
151 static AttributeName csn_anlist[3];
152 static AttributeName uuid_anlist[2];
154 /* Build a LDAPsync intermediate state control */
160 int entry_sync_state,
164 struct berval *cookie )
169 BerElementBuffer berbuf;
170 BerElement *ber = (BerElement *)&berbuf;
172 struct berval entryuuid_bv = BER_BVNULL;
174 ber_init2( ber, 0, LBER_USE_DER );
175 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
177 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
179 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
180 AttributeDescription *desc = a->a_desc;
181 if ( desc == slap_schema.si_ad_entryUUID ) {
182 entryuuid_bv = a->a_nvals[0];
187 /* FIXME: what if entryuuid is NULL or empty ? */
189 if ( send_cookie && cookie ) {
190 ber_printf( ber, "{eOON}",
191 entry_sync_state, &entryuuid_bv, cookie );
193 ber_printf( ber, "{eON}",
194 entry_sync_state, &entryuuid_bv );
197 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
198 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
199 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
204 Debug( LDAP_DEBUG_TRACE,
205 "slap_build_sync_ctrl: ber_flatten2 failed\n",
207 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
214 /* Build a LDAPsync final state control */
222 struct berval *cookie,
226 BerElementBuffer berbuf;
227 BerElement *ber = (BerElement *)&berbuf;
229 ber_init2( ber, NULL, LBER_USE_DER );
230 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
232 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
234 ber_printf( ber, "{" );
235 if ( send_cookie && cookie ) {
236 ber_printf( ber, "O", cookie );
238 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
239 ber_printf( ber, "b", refreshDeletes );
241 ber_printf( ber, "N}" );
243 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
244 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
245 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
250 Debug( LDAP_DEBUG_TRACE,
251 "syncprov_done_ctrl: ber_flatten2 failed\n",
253 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
265 struct berval *cookie,
270 BerElementBuffer berbuf;
271 BerElement *ber = (BerElement *)&berbuf;
272 struct berval rspdata;
276 ber_init2( ber, NULL, LBER_USE_DER );
277 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
281 case LDAP_TAG_SYNC_NEW_COOKIE:
282 ber_printf( ber, "tO", type, cookie );
284 case LDAP_TAG_SYNC_REFRESH_DELETE:
285 case LDAP_TAG_SYNC_REFRESH_PRESENT:
286 ber_printf( ber, "t{", type );
288 ber_printf( ber, "O", cookie );
290 if ( refreshDone == 0 ) {
291 ber_printf( ber, "b", refreshDone );
293 ber_printf( ber, "N}" );
295 case LDAP_TAG_SYNC_ID_SET:
296 ber_printf( ber, "t{", type );
298 ber_printf( ber, "O", cookie );
300 if ( refreshDeletes == 1 ) {
301 ber_printf( ber, "b", refreshDeletes );
303 ber_printf( ber, "[W]", syncUUIDs );
304 ber_printf( ber, "N}" );
307 Debug( LDAP_DEBUG_TRACE,
308 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
314 ret = ber_flatten2( ber, &rspdata, 0 );
317 Debug( LDAP_DEBUG_TRACE,
318 "syncprov_sendinfo: ber_flatten2 failed\n",
320 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
324 rs->sr_rspoid = LDAP_SYNC_INFO;
325 rs->sr_rspdata = &rspdata;
326 send_ldap_intermediate( op, rs );
327 rs->sr_rspdata = NULL;
333 /* Find a modtarget in an AVL tree */
335 sp_avl_cmp( const void *c1, const void *c2 )
337 const modtarget *m1, *m2;
341 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
344 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
347 /* syncprov_findbase:
348 * finds the true DN of the base of a search (with alias dereferencing) and
349 * checks to make sure the base entry doesn't get replaced with a different
350 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
351 * change is detected, any persistent search on this base must be terminated /
353 * On the first call, we just save the DN and entryID. On subsequent calls
354 * we compare the DN and entryID with the saved values.
357 findbase_cb( Operation *op, SlapReply *rs )
359 slap_callback *sc = op->o_callback;
361 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
362 fbase_cookie *fc = sc->sc_private;
364 /* If no entryID, we're looking for the first time.
365 * Just store whatever we got.
367 if ( fc->fss->s_eid == NOID ) {
369 fc->fss->s_eid = rs->sr_entry->e_id;
370 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
372 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
373 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
375 /* OK, the DN is the same and the entryID is the same. */
379 if ( rs->sr_err != LDAP_SUCCESS ) {
380 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
386 syncprov_findbase( Operation *op, fbase_cookie *fc )
388 opcookie *opc = op->o_callback->sc_private;
389 slap_overinst *on = opc->son;
391 /* Use basic parameters from syncrepl search, but use
392 * current op's threadctx / tmpmemctx
394 ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex );
395 if ( fc->fss->s_flags & PS_FIND_BASE ) {
396 slap_callback cb = {0};
398 SlapReply frs = { REP_RESULT };
401 fc->fss->s_flags ^= PS_FIND_BASE;
402 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
404 fop = *fc->fss->s_op;
406 fop.o_hdr = op->o_hdr;
408 fop.o_time = op->o_time;
409 fop.o_tincr = op->o_tincr;
411 cb.sc_response = findbase_cb;
414 fop.o_sync_mode = 0; /* turn off sync mode */
415 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
416 fop.o_callback = &cb;
417 fop.o_tag = LDAP_REQ_SEARCH;
418 fop.ors_scope = LDAP_SCOPE_BASE;
419 fop.ors_limit = NULL;
421 fop.ors_tlimit = SLAP_NO_LIMIT;
422 fop.ors_attrs = slap_anlist_no_attrs;
423 fop.ors_attrsonly = 1;
425 fop.o_bd->bd_info = on->on_info->oi_orig;
426 rc = fop.o_bd->be_search( &fop, &frs );
427 fop.o_bd->bd_info = (BackendInfo *)on;
429 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
433 /* After the first call, see if the fdn resides in the scope */
434 if ( fc->fbase == 1 ) {
435 switch ( fc->fss->s_op->ors_scope ) {
436 case LDAP_SCOPE_BASE:
437 fc->fscope = dn_match( fc->fdn, &fc->fss->s_base );
439 case LDAP_SCOPE_ONELEVEL: {
441 dnParent( fc->fdn, &pdn );
442 fc->fscope = dn_match( &pdn, &fc->fss->s_base );
444 case LDAP_SCOPE_SUBTREE:
445 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base );
447 #ifdef LDAP_SCOPE_SUBORDINATE
448 case LDAP_SCOPE_SUBORDINATE:
449 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) &&
450 !dn_match( fc->fdn, &fc->fss->s_base );
459 /* If entryID has changed, then the base of this search has
460 * changed. Invalidate the psearch.
462 return LDAP_NO_SUCH_OBJECT;
466 * This function has three different purposes, but they all use a search
467 * that filters on entryCSN so they're combined here.
468 * 1: at startup time, after a contextCSN has been read from the database,
469 * we search for all entries with CSN >= contextCSN in case the contextCSN
470 * was not checkpointed at the previous shutdown.
472 * 2: when the current contextCSN is known and we have a sync cookie, we search
473 * for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.
474 * If an entry is found, the cookie CSN is valid, otherwise it is stale.
476 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
477 * CSN, and generate Present records for them. We always collect this result
478 * in SyncID sets, even if there's only one match.
480 #define FIND_MAXCSN 1
482 #define FIND_PRESENT 3
485 findmax_cb( Operation *op, SlapReply *rs )
487 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
488 struct berval *maxcsn = op->o_callback->sc_private;
489 Attribute *a = attr_find( rs->sr_entry->e_attrs,
490 slap_schema.si_ad_entryCSN );
492 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
493 maxcsn->bv_len = a->a_vals[0].bv_len;
494 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
501 findcsn_cb( Operation *op, SlapReply *rs )
503 slap_callback *sc = op->o_callback;
505 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
506 sc->sc_private = (void *)1;
511 /* Build a list of entryUUIDs for sending in a SyncID set */
515 typedef struct fpres_cookie {
522 findpres_cb( Operation *op, SlapReply *rs )
524 slap_callback *sc = op->o_callback;
525 fpres_cookie *pc = sc->sc_private;
527 int ret = SLAP_CB_CONTINUE;
529 switch ( rs->sr_type ) {
531 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
533 pc->uuids[pc->num].bv_val = pc->last;
534 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
535 pc->uuids[pc->num].bv_len );
537 pc->last = pc->uuids[pc->num].bv_val;
538 pc->uuids[pc->num].bv_val = NULL;
541 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
547 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
549 pc->uuids[pc->num].bv_val = pc->last;
551 pc->last = pc->uuids[0].bv_val;
561 syncprov_findcsn( Operation *op, int mode )
563 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
564 syncprov_info_t *si = on->on_bi.bi_private;
566 slap_callback cb = {0};
568 SlapReply frs = { REP_RESULT };
569 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
570 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
571 struct berval maxcsn;
573 #ifdef LDAP_COMP_MATCH
574 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
576 AttributeAssertion eq = { NULL, BER_BVNULL };
578 int i, rc = LDAP_SUCCESS;
579 fpres_cookie pcookie;
580 sync_control *srs = NULL;
581 int findcsn_retry = 1;
583 if ( mode != FIND_MAXCSN ) {
584 srs = op->o_controls[slap_cids.sc_LDAPsync];
586 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
592 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
593 /* We want pure entries, not referrals */
594 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
597 cf.f_av_desc = slap_schema.si_ad_entryCSN;
600 fop.o_callback = &cb;
601 fop.ors_limit = NULL;
602 fop.ors_tlimit = SLAP_NO_LIMIT;
603 fop.ors_filter = &cf;
604 fop.ors_filterstr.bv_val = buf;
609 cf.f_choice = LDAP_FILTER_GE;
610 cf.f_av_value = si->si_ctxcsn;
611 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
612 cf.f_av_value.bv_val );
613 fop.ors_attrsonly = 0;
614 fop.ors_attrs = csn_anlist;
615 fop.ors_slimit = SLAP_NO_LIMIT;
616 cb.sc_private = &maxcsn;
617 cb.sc_response = findmax_cb;
618 strcpy( cbuf, si->si_ctxcsn.bv_val );
619 maxcsn.bv_val = cbuf;
620 maxcsn.bv_len = si->si_ctxcsn.bv_len;
623 cf.f_av_value = srs->sr_state.ctxcsn;
624 /* Look for exact match the first time */
625 if ( findcsn_retry ) {
626 cf.f_choice = LDAP_FILTER_EQUALITY;
627 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN=%s)",
628 cf.f_av_value.bv_val );
629 /* On retry, look for <= */
631 cf.f_choice = LDAP_FILTER_LE;
632 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
633 cf.f_av_value.bv_val );
635 fop.ors_attrsonly = 1;
636 fop.ors_attrs = slap_anlist_no_attrs;
638 cb.sc_private = NULL;
639 cb.sc_response = findcsn_cb;
642 af.f_choice = LDAP_FILTER_AND;
645 cf.f_choice = LDAP_FILTER_LE;
646 cf.f_av_value = srs->sr_state.ctxcsn;
647 cf.f_next = op->ors_filter;
648 fop.ors_filter = ⁡
649 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
650 fop.ors_attrsonly = 0;
651 fop.ors_attrs = uuid_anlist;
652 fop.ors_slimit = SLAP_NO_LIMIT;
653 cb.sc_private = &pcookie;
654 cb.sc_response = findpres_cb;
657 /* preallocate storage for a full set */
658 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
659 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
661 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
662 pcookie.uuids[0].bv_val = pcookie.last;
663 pcookie.uuids[0].bv_len = UUID_LEN;
664 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
665 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
666 pcookie.uuids[i].bv_len = UUID_LEN;
671 fop.o_bd->bd_info = on->on_info->oi_orig;
672 fop.o_bd->be_search( &fop, &frs );
673 fop.o_bd->bd_info = (BackendInfo *)on;
677 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
678 si->si_ctxcsn.bv_len = maxcsn.bv_len;
681 /* If matching CSN was not found, invalidate the context. */
682 if ( !cb.sc_private ) {
683 /* If we didn't find an exact match, then try for <= */
684 if ( findcsn_retry ) {
688 rc = LDAP_NO_SUCH_OBJECT;
692 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
693 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
700 /* Send a persistent search response */
702 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode)
704 slap_overinst *on = opc->son;
706 SlapReply rs = { REP_SEARCH };
707 LDAPControl *ctrls[2];
708 struct berval cookie;
710 Attribute a_uuid = {0};
712 if ( so->s_op->o_abandon )
713 return SLAPD_ABANDON;
716 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
718 e_uuid.e_attrs = &a_uuid;
719 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
720 a_uuid.a_nvals = &opc->suuid;
721 rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid,
722 mode, ctrls, 0, 1, &cookie );
725 op->o_bd->bd_info = (BackendInfo *)on->on_info;
729 if ( rs.sr_entry->e_private )
730 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
731 if ( opc->sreference ) {
732 rs.sr_ref = get_entry_referrals( op, rs.sr_entry );
733 send_search_reference( op, &rs );
734 ber_bvarray_free( rs.sr_ref );
740 case LDAP_SYNC_MODIFY:
742 if ( rs.sr_entry->e_private )
743 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
744 rs.sr_attrs = op->ors_attrs;
745 send_search_entry( op, &rs );
749 case LDAP_SYNC_DELETE:
750 e_uuid.e_attrs = NULL;
751 e_uuid.e_name = opc->sdn;
752 e_uuid.e_nname = opc->sndn;
753 rs.sr_entry = &e_uuid;
754 if ( opc->sreference ) {
755 struct berval bv = BER_BVNULL;
757 send_search_reference( op, &rs );
759 send_search_entry( op, &rs );
765 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
771 /* Play back queued responses */
773 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
781 op->o_bd->bd_info = (BackendInfo *)on->on_info;
784 ldap_pvt_thread_mutex_lock( &so->s_mutex );
787 so->s_res = sr->s_next;
789 so->s_restail = NULL;
790 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
795 if ( !so->s_op->o_abandon ) {
797 opc.sndn = sr->s_ndn;
798 opc.suuid = sr->s_uuid;
799 opc.sctxcsn = sr->s_csn;
800 opc.sreference = sr->s_isreference;
803 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
804 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
810 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode );
813 be_entry_release_rw( op, e, 0 );
821 op->o_bd->bd_info = (BackendInfo *)on;
825 /* runqueue task for playing back queued responses */
827 syncprov_qtask( void *ctx, void *arg )
829 struct re_s *rtask = arg;
830 syncops *so = rtask->arg;
831 slap_overinst *on = so->s_op->o_private;
832 char opbuf[OPERATION_BUFFER_SIZE];
836 op = (Operation *)opbuf;
838 op->o_hdr = (Opheader *)(op+1);
839 op->o_controls = (void **)(op->o_hdr+1);
840 memset( op->o_controls, 0, SLAP_MAX_CIDS * sizeof(void *));
842 *op->o_hdr = *so->s_op->o_hdr;
844 op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx);
845 op->o_tmpmfuncs = &slap_sl_mfuncs;
846 op->o_threadctx = ctx;
848 /* syncprov_qplay expects a fake db */
849 be = *so->s_op->o_bd;
850 be.be_flags |= SLAP_DBFLAG_OVERLAY;
852 op->o_private = NULL;
853 op->o_callback = NULL;
855 syncprov_qplay( op, on, so );
857 /* wait until we get explicitly scheduled again */
858 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
859 ldap_pvt_runqueue_stoptask( &slapd_rq, so->s_qtask );
860 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 1 );
861 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
866 /* Queue a persistent search response */
868 syncprov_qresp( opcookie *opc, syncops *so, int mode )
872 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
873 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
875 sr->s_dn.bv_val = (char *)(sr + 1);
876 sr->s_dn.bv_len = opc->sdn.bv_len;
878 sr->s_isreference = opc->sreference;
879 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
880 sr->s_ndn.bv_len = opc->sndn.bv_len;
881 *(sr->s_ndn.bv_val++) = '\0';
882 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
883 sr->s_uuid.bv_len = opc->suuid.bv_len;
884 *(sr->s_uuid.bv_val++) = '\0';
885 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
886 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
887 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
889 ldap_pvt_thread_mutex_lock( &so->s_mutex );
893 so->s_restail->s_next = sr;
897 /* If the base of the psearch was modified, check it next time round */
898 if ( so->s_flags & PS_WROTE_BASE ) {
899 so->s_flags ^= PS_WROTE_BASE;
900 so->s_flags |= PS_FIND_BASE;
902 if ( so->s_flags & PS_IS_DETACHED ) {
903 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
904 if ( !so->s_qtask ) {
905 so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, RUNQ_INTERVAL,
906 syncprov_qtask, so, "syncprov_qtask",
907 so->s_op->o_conn->c_peer_name.bv_val );
909 if (!ldap_pvt_runqueue_isrunning( &slapd_rq, so->s_qtask ) &&
910 !so->s_qtask->next_sched.tv_sec ) {
911 so->s_qtask->interval.tv_sec = 0;
912 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 0 );
913 so->s_qtask->interval.tv_sec = RUNQ_INTERVAL;
916 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
918 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
923 syncprov_free_syncop( syncops *so )
925 syncres *sr, *srnext;
926 GroupAssertion *ga, *gnext;
928 ldap_pvt_thread_mutex_lock( &so->s_mutex );
930 if ( so->s_inuse > 0 ) {
931 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
934 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
935 if ( so->s_flags & PS_IS_DETACHED ) {
936 filter_free( so->s_op->ors_filter );
937 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
943 ch_free( so->s_base.bv_val );
944 for ( sr=so->s_res; sr; sr=srnext ) {
948 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
953 syncprov_drop_psearch( syncops *so, int lock )
955 if ( so->s_flags & PS_IS_DETACHED ) {
957 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
958 so->s_op->o_conn->c_n_ops_executing--;
959 so->s_op->o_conn->c_n_ops_completed++;
960 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
963 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
965 syncprov_free_syncop( so );
971 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
973 slap_callback *sc = op->o_callback;
974 op->o_callback = sc->sc_next;
975 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
976 op->o_tmpfree( sc, op->o_tmpmemctx );
981 syncprov_op_abandon( Operation *op, SlapReply *rs )
983 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
984 syncprov_info_t *si = on->on_bi.bi_private;
985 syncops *so, *soprev;
987 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
988 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
989 soprev=so, so=so->s_next ) {
990 if ( so->s_op->o_connid == op->o_connid &&
991 so->s_op->o_msgid == op->orn_msgid ) {
992 so->s_op->o_abandon = 1;
993 soprev->s_next = so->s_next;
997 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
999 /* Is this really a Cancel exop? */
1000 if ( op->o_tag != LDAP_REQ_ABANDON ) {
1001 so->s_op->o_cancel = SLAP_CANCEL_ACK;
1002 rs->sr_err = LDAP_CANCELLED;
1003 send_ldap_result( so->s_op, rs );
1004 if ( so->s_flags & PS_IS_DETACHED ) {
1006 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
1007 cb->sc_cleanup = syncprov_ab_cleanup;
1008 cb->sc_next = op->o_callback;
1009 cb->sc_private = so;
1010 return SLAP_CB_CONTINUE;
1013 syncprov_drop_psearch( so, 0 );
1015 return SLAP_CB_CONTINUE;
1018 /* Find which persistent searches are affected by this operation */
1020 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
1022 slap_overinst *on = opc->son;
1023 syncprov_info_t *si = on->on_bi.bi_private;
1026 syncops *ss, *sprev, *snext;
1030 struct berval newdn;
1033 fc.fdn = &op->o_req_ndn;
1034 /* compute new DN */
1035 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1037 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
1038 else dnParent( fc.fdn, &pdn );
1039 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
1043 if ( op->o_tag != LDAP_REQ_ADD ) {
1044 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1045 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
1046 /* If we're sending responses now, make a copy and unlock the DB */
1047 if ( e && !saveit ) {
1048 Entry *e2 = entry_dup( e );
1049 be_entry_release_rw( op, e, 0 );
1052 op->o_bd->bd_info = (BackendInfo *)on;
1058 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1059 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1060 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1061 opc->sreference = is_entry_referral( e );
1062 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1064 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1065 } else if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1066 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1067 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1068 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1069 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1072 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1073 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1074 sprev = ss, ss=snext)
1085 /* If the base of the search is missing, signal a refresh */
1086 rc = syncprov_findbase( op, &fc );
1087 if ( rc != LDAP_SUCCESS ) {
1088 SlapReply rs = {REP_RESULT};
1089 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1090 "search base has changed" );
1091 sprev->s_next = snext;
1092 syncprov_drop_psearch( ss, 1 );
1098 /* If we're sending results now, look for this op in old matches */
1102 /* Did we modify the search base? */
1103 if ( dn_match( &op->o_req_ndn, &ss->s_base )) {
1104 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1105 ss->s_flags |= PS_WROTE_BASE;
1106 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1109 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1110 old=sm, sm=sm->sm_next ) {
1111 if ( sm->sm_op == ss ) {
1113 old->sm_next = sm->sm_next;
1114 op->o_tmpfree( sm, op->o_tmpmemctx );
1120 /* check if current o_req_dn is in scope and matches filter */
1121 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1122 LDAP_COMPARE_TRUE ) {
1124 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1125 sm->sm_next = opc->smatches;
1130 /* if found send UPDATE else send ADD */
1132 syncprov_qresp( opc, ss,
1133 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD );
1136 } else if ( !saveit && found ) {
1138 syncprov_qresp( opc, ss, LDAP_SYNC_DELETE );
1141 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1143 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1144 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1145 be_entry_release_rw( op, e, 0 );
1146 op->o_bd->bd_info = (BackendInfo *)on;
1149 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1154 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1156 slap_callback *cb = op->o_callback;
1157 opcookie *opc = cb->sc_private;
1158 slap_overinst *on = opc->son;
1159 syncprov_info_t *si = on->on_bi.bi_private;
1160 syncmatches *sm, *snext;
1161 modtarget *mt, mtdummy;
1163 for (sm = opc->smatches; sm; sm=snext) {
1164 snext = sm->sm_next;
1165 syncprov_free_syncop( sm->sm_op );
1166 op->o_tmpfree( sm, op->o_tmpmemctx );
1169 /* Remove op from lock table */
1171 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1172 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1174 modinst *mi = mt->mt_mods;
1176 /* If there are more, promote the next one */
1177 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1178 if ( mi->mi_next ) {
1179 mt->mt_mods = mi->mi_next;
1180 mt->mt_op = mt->mt_mods->mi_op;
1181 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1183 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1184 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1185 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1189 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1190 if ( !BER_BVISNULL( &opc->suuid ))
1191 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1192 if ( !BER_BVISNULL( &opc->sndn ))
1193 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1194 if ( !BER_BVISNULL( &opc->sdn ))
1195 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1196 op->o_callback = cb->sc_next;
1197 op->o_tmpfree(cb, op->o_tmpmemctx);
1203 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1205 syncprov_info_t *si = on->on_bi.bi_private;
1208 struct berval bv[2];
1209 slap_callback cb = {0};
1210 int manage = get_manageDSAit(op);
1212 mod.sml_values = bv;
1213 bv[1].bv_val = NULL;
1214 bv[0] = si->si_ctxcsn;
1215 mod.sml_nvalues = NULL;
1216 mod.sml_desc = slap_schema.si_ad_contextCSN;
1217 mod.sml_op = LDAP_MOD_REPLACE;
1219 mod.sml_next = NULL;
1221 cb.sc_response = slap_null_cb;
1223 opm.o_tag = LDAP_REQ_MODIFY;
1224 opm.o_callback = &cb;
1225 opm.orm_modlist = &mod;
1226 opm.o_req_dn = op->o_bd->be_suffix[0];
1227 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1228 opm.o_bd->bd_info = on->on_info->oi_orig;
1229 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1230 opm.o_bd->be_modify( &opm, rs );
1231 opm.o_managedsait = manage;
1235 syncprov_add_slog( Operation *op, struct berval *csn )
1237 opcookie *opc = op->o_callback->sc_private;
1238 slap_overinst *on = opc->son;
1239 syncprov_info_t *si = on->on_bi.bi_private;
1245 /* Allocate a record. UUIDs are not NUL-terminated. */
1246 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1249 se->se_tag = op->o_tag;
1251 se->se_uuid.bv_val = (char *)(se+1);
1252 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1253 se->se_uuid.bv_len = opc->suuid.bv_len;
1255 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
1256 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1257 se->se_csn.bv_val[csn->bv_len] = '\0';
1258 se->se_csn.bv_len = csn->bv_len;
1260 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1261 if ( sl->sl_head ) {
1262 sl->sl_tail->se_next = se;
1268 while ( sl->sl_num > sl->sl_size ) {
1270 sl->sl_head = se->se_next;
1271 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1272 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1275 if ( !sl->sl_head ) {
1279 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1283 /* Just set a flag if we found the matching entry */
1285 playlog_cb( Operation *op, SlapReply *rs )
1287 if ( rs->sr_type == REP_SEARCH ) {
1288 op->o_callback->sc_private = (void *)1;
1293 /* enter with sl->sl_mutex locked, release before returning */
1295 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1296 struct berval *oldcsn, struct berval *ctxcsn )
1298 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1300 int i, j, ndel, num, nmods, mmods;
1303 if ( !sl->sl_num ) {
1304 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1312 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1313 num * UUID_LEN, op->o_tmpmemctx );
1315 uuids[0].bv_val = (char *)(uuids + num + 1);
1317 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1318 * and everything else at the end. Do this first so we can
1319 * unlock the list mutex.
1321 for ( se=sl->sl_head; se; se=se->se_next ) {
1322 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1323 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1324 if ( se->se_tag == LDAP_REQ_DELETE ) {
1331 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1332 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1333 uuids[j].bv_len = UUID_LEN;
1335 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1339 /* Zero out unused slots */
1340 for ( i=ndel; i < num - nmods; i++ )
1341 uuids[i].bv_len = 0;
1343 /* Mods must be validated to see if they belong in this delete set.
1347 /* Strip any duplicates */
1348 for ( i=0; i<nmods; i++ ) {
1349 for ( j=0; j<ndel; j++ ) {
1350 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1351 uuids[num - 1 - i].bv_len = 0;
1356 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1357 for ( j=0; j<i; j++ ) {
1358 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1359 uuids[num - 1 - i].bv_len = 0;
1368 SlapReply frs = { REP_RESULT };
1371 #ifdef LDAP_COMP_MATCH
1372 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1374 AttributeAssertion eq;
1376 slap_callback cb = {0};
1380 fop.o_sync_mode = 0;
1381 fop.o_callback = &cb;
1382 fop.ors_limit = NULL;
1383 fop.ors_tlimit = SLAP_NO_LIMIT;
1384 fop.ors_attrs = slap_anlist_all_attributes;
1385 fop.ors_attrsonly = 0;
1386 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1388 af.f_choice = LDAP_FILTER_AND;
1391 mf.f_choice = LDAP_FILTER_EQUALITY;
1393 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1394 mf.f_next = fop.ors_filter;
1396 fop.ors_filter = ⁡
1398 cb.sc_response = playlog_cb;
1399 fop.o_bd->bd_info = on->on_info->oi_orig;
1401 for ( i=ndel; i<num; i++ ) {
1402 if ( uuids[i].bv_len == 0 ) continue;
1404 mf.f_av_value = uuids[i];
1405 cb.sc_private = NULL;
1407 rc = fop.o_bd->be_search( &fop, &frs );
1409 /* If entry was not found, add to delete list */
1410 if ( !cb.sc_private ) {
1411 uuids[ndel++] = uuids[i];
1414 fop.o_bd->bd_info = (BackendInfo *)on;
1417 uuids[ndel].bv_val = NULL;
1418 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1423 syncprov_op_response( Operation *op, SlapReply *rs )
1425 opcookie *opc = op->o_callback->sc_private;
1426 slap_overinst *on = opc->son;
1427 syncprov_info_t *si = on->on_bi.bi_private;
1430 if ( rs->sr_err == LDAP_SUCCESS )
1432 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1433 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1435 /* Update our context CSN */
1437 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1438 slap_get_commit_csn( op, &maxcsn, &curcsn );
1439 if ( !BER_BVISNULL( &maxcsn ) ) {
1440 strcpy( cbuf, maxcsn.bv_val );
1441 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1442 strcpy( si->si_ctxcsnbuf, cbuf );
1443 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1447 /* Don't do any processing for consumer contextCSN updates */
1448 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1449 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1450 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1451 return SLAP_CB_CONTINUE;
1455 if ( si->si_chkops || si->si_chktime ) {
1457 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1461 if ( si->si_chktime &&
1462 (op->o_time - si->si_chklast >= si->si_chktime )) {
1464 si->si_chklast = op->o_time;
1467 syncprov_checkpoint( op, rs, on );
1470 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1472 opc->sctxcsn.bv_len = maxcsn.bv_len;
1473 opc->sctxcsn.bv_val = cbuf;
1475 /* Handle any persistent searches */
1479 case LDAP_REQ_MODIFY:
1480 case LDAP_REQ_MODRDN:
1481 case LDAP_REQ_EXTENDED:
1482 syncprov_matchops( op, opc, 0 );
1484 case LDAP_REQ_DELETE:
1485 /* for each match in opc->smatches:
1488 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1489 if ( sm->sm_op->s_op->o_abandon )
1491 syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE );
1497 /* Add any log records */
1498 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1499 syncprov_add_slog( op, &curcsn );
1503 return SLAP_CB_CONTINUE;
1506 /* We don't use a subentry to store the context CSN any more.
1507 * We expose the current context CSN as an operational attribute
1508 * of the suffix entry.
1511 syncprov_op_compare( Operation *op, SlapReply *rs )
1513 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1514 syncprov_info_t *si = on->on_bi.bi_private;
1515 int rc = SLAP_CB_CONTINUE;
1517 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1518 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1522 struct berval bv[2];
1524 e.e_name = op->o_bd->be_suffix[0];
1525 e.e_nname = op->o_bd->be_nsuffix[0];
1527 BER_BVZERO( &bv[1] );
1528 bv[0] = si->si_ctxcsn;
1530 a.a_desc = slap_schema.si_ad_contextCSN;
1532 a.a_nvals = a.a_vals;
1534 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1536 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1537 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1538 if ( ! rs->sr_err ) {
1539 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1540 goto return_results;
1543 if ( get_assert( op ) &&
1544 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1546 rs->sr_err = LDAP_ASSERTION_FAILED;
1547 goto return_results;
1551 rs->sr_err = LDAP_COMPARE_FALSE;
1553 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1554 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1555 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1556 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1558 rs->sr_err = LDAP_COMPARE_TRUE;
1563 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1565 send_ldap_result( op, rs );
1567 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1568 rs->sr_err = LDAP_SUCCESS;
1577 syncprov_op_mod( Operation *op, SlapReply *rs )
1579 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1580 syncprov_info_t *si = on->on_bi.bi_private;
1582 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1584 (si->si_ops ? sizeof(modinst) : 0 ),
1586 opcookie *opc = (opcookie *)(cb+1);
1588 cb->sc_response = syncprov_op_response;
1589 cb->sc_cleanup = syncprov_op_cleanup;
1590 cb->sc_private = opc;
1591 cb->sc_next = op->o_callback;
1592 op->o_callback = cb;
1594 /* If there are active persistent searches, lock this operation.
1595 * See seqmod.c for the locking logic on its own.
1598 modtarget *mt, mtdummy;
1601 mi = (modinst *)(opc+1);
1604 /* See if we're already modifying this entry... */
1606 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1607 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1609 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1610 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1611 mt->mt_tail->mi_next = mi;
1613 /* wait for this op to get to head of list */
1614 while ( mt->mt_mods != mi ) {
1615 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1616 ldap_pvt_thread_yield();
1617 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1619 /* clean up if the caller is giving up */
1620 if ( op->o_abandon ) {
1622 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1624 m2->mi_next = mi->mi_next;
1625 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1626 op->o_tmpfree( cb, op->o_tmpmemctx );
1627 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1628 return SLAPD_ABANDON;
1631 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1633 /* Record that we're modifying this entry now */
1634 mt = ch_malloc( sizeof(modtarget) );
1637 mt->mt_op = mi->mi_op;
1638 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1639 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1640 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1644 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1645 syncprov_matchops( op, opc, 1 );
1647 return SLAP_CB_CONTINUE;
1651 syncprov_op_extended( Operation *op, SlapReply *rs )
1653 if ( exop_is_write( op ))
1654 return syncprov_op_mod( op, rs );
1656 return SLAP_CB_CONTINUE;
1659 typedef struct searchstate {
1660 slap_overinst *ss_on;
1663 struct berval ss_ctxcsn;
1664 char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1668 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1670 if ( rs->sr_ctrls ) {
1671 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1672 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1673 rs->sr_ctrls = NULL;
1679 syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on )
1685 GroupAssertion *g1, *g2;
1687 /* count the search attrs */
1688 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1689 alen += op->ors_attrs[i].an_name.bv_len + 1;
1691 /* Make a new copy of the operation */
1692 size = sizeof(Operation) + sizeof(Opheader) +
1693 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1694 op->o_req_dn.bv_len + 1 +
1695 op->o_req_ndn.bv_len + 1 +
1696 op->o_ndn.bv_len + 1 +
1697 so->s_filterstr.bv_len + 1;
1698 op2 = (Operation *)ch_calloc( 1, size );
1699 op2->o_hdr = (Opheader *)(op2+1);
1701 /* Copy the fields we care about explicitly, leave the rest alone */
1702 *op2->o_hdr = *op->o_hdr;
1703 op2->o_tag = op->o_tag;
1704 op2->o_time = op->o_time;
1705 op2->o_bd = on->on_info->oi_origdb;
1706 op2->o_request = op->o_request;
1707 op2->o_private = on;
1710 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1711 ptr = (char *)(op2->ors_attrs+i+1);
1712 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1713 op2->ors_attrs[i] = op->ors_attrs[i];
1714 op2->ors_attrs[i].an_name.bv_val = ptr;
1715 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1717 BER_BVZERO( &op2->ors_attrs[i].an_name );
1719 ptr = (char *)(op2->o_hdr + 1);
1721 op2->o_authz = op->o_authz;
1722 op2->o_ndn.bv_val = ptr;
1723 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1724 op2->o_dn = op2->o_ndn;
1725 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1726 op2->o_req_dn.bv_val = ptr;
1727 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1728 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1729 op2->o_req_ndn.bv_val = ptr;
1730 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1731 op2->ors_filterstr.bv_val = ptr;
1732 strcpy( ptr, so->s_filterstr.bv_val );
1733 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1734 op2->ors_filter = str2filter( ptr );
1737 /* Copy any cached group ACLs individually */
1738 op2->o_groups = NULL;
1739 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1740 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1742 strcpy( g2->ga_ndn, g1->ga_ndn );
1743 g2->ga_next = op2->o_groups;
1746 /* Don't allow any further group caching */
1747 op2->o_do_not_cache = 1;
1749 /* Add op2 to conn so abandon will find us */
1750 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1751 op->o_conn->c_n_ops_executing++;
1752 op->o_conn->c_n_ops_completed--;
1753 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1754 so->s_flags |= PS_IS_DETACHED;
1755 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1759 syncprov_search_response( Operation *op, SlapReply *rs )
1761 searchstate *ss = op->o_callback->sc_private;
1762 slap_overinst *on = ss->ss_on;
1763 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1765 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1767 /* If we got a referral without a referral object, there's
1768 * something missing that we cannot replicate. Just ignore it.
1769 * The consumer will abort because we didn't send the expected
1772 if ( !rs->sr_entry ) {
1773 assert( rs->sr_entry != NULL );
1774 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1775 return SLAP_CB_CONTINUE;
1777 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );
1779 /* Make sure entry is less than the snaphot'd contextCSN */
1780 if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 )
1781 return LDAP_SUCCESS;
1783 /* Don't send the ctx entry twice */
1784 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) &&
1785 bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1786 return LDAP_SUCCESS;
1788 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1790 rs->sr_ctrls[1] = NULL;
1791 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1792 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1793 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1794 struct berval cookie;
1796 slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn,
1797 srs->sr_state.rid );
1799 /* Is this a regular refresh? */
1801 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1803 rs->sr_ctrls[1] = NULL;
1804 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1805 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1806 LDAP_SYNC_REFRESH_DELETES );
1808 /* It's RefreshAndPersist, transition to Persist phase */
1809 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1810 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1811 &cookie, 1, NULL, 0 );
1812 /* Flush any queued persist messages */
1813 if ( ss->ss_so->s_res ) {
1814 syncprov_qplay( op, on, ss->ss_so );
1817 /* Detach this Op from frontend control */
1818 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1820 /* Turn off the refreshing flag */
1821 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1823 syncprov_detach_op( op, ss->ss_so, on );
1824 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1826 return LDAP_SUCCESS;
1830 return SLAP_CB_CONTINUE;
1834 syncprov_op_search( Operation *op, SlapReply *rs )
1836 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1837 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1839 int gotstate = 0, nochange = 0, do_present;
1840 syncops *sop = NULL;
1843 struct berval ctxcsn;
1844 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1846 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1848 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1849 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1853 do_present = si->si_nopres ? 0 : 1;
1855 srs = op->o_controls[slap_cids.sc_LDAPsync];
1856 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1858 /* If this is a persistent search, set it up right away */
1859 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1869 so.s_flags = PS_IS_REFRESHING | PS_FIND_BASE;
1870 /* syncprov_findbase expects to be called as a callback... */
1871 sc.sc_private = &opc;
1873 cb = op->o_callback;
1874 op->o_callback = ≻
1875 rs->sr_err = syncprov_findbase( op, &fc );
1876 op->o_callback = cb;
1878 if ( rs->sr_err != LDAP_SUCCESS ) {
1879 send_ldap_result( op, rs );
1882 sop = ch_malloc( sizeof( syncops ));
1884 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1885 sop->s_rid = srs->sr_state.rid;
1888 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1889 sop->s_next = si->si_ops;
1891 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1894 /* snapshot the ctxcsn */
1895 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1896 strcpy( csnbuf, si->si_ctxcsnbuf );
1897 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1898 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1899 ctxcsn.bv_val = csnbuf;
1901 /* If we have a cookie, handle the PRESENT lookups */
1902 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1905 /* The cookie was validated when it was parsed, just use it */
1907 /* If just Refreshing and nothing has changed, shortcut it */
1908 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1910 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1911 LDAPControl *ctrls[2];
1915 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1916 NULL, LDAP_SYNC_REFRESH_DELETES );
1917 rs->sr_ctrls = ctrls;
1918 rs->sr_err = LDAP_SUCCESS;
1919 send_ldap_result( op, rs );
1920 rs->sr_ctrls = NULL;
1925 /* Do we have a sessionlog for this search? */
1928 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1929 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1931 /* mutex is unlocked in playlog */
1932 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1934 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1937 /* Is the CSN still present in the database? */
1938 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1939 /* No, so a reload is required */
1940 #if 0 /* the consumer doesn't seem to send this hint */
1941 if ( op->o_sync_rhint == 0 ) {
1942 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1948 /* If changed and doing Present lookup, send Present UUIDs */
1949 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1951 send_ldap_result( op, rs );
1958 /* Append CSN range to search filter, save original filter
1959 * for persistent search evaluation
1962 sop->s_filterstr= op->ors_filterstr;
1965 /* If something changed, find the changes */
1966 if ( gotstate && !nochange ) {
1967 Filter *fand, *fava;
1969 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1970 fand->f_choice = LDAP_FILTER_AND;
1971 fand->f_next = NULL;
1972 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1974 fava->f_choice = LDAP_FILTER_GE;
1975 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1976 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1977 #ifdef LDAP_COMP_MATCH
1978 fava->f_ava->aa_cf = NULL;
1980 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1981 fava->f_next = op->ors_filter;
1982 op->ors_filter = fand;
1983 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1986 /* Let our callback add needed info to returned entries */
1987 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1988 ss = (searchstate *)(cb+1);
1991 ss->ss_present = do_present;
1992 ss->ss_ctxcsn.bv_len = ctxcsn.bv_len;
1993 ss->ss_ctxcsn.bv_val = ss->ss_csnbuf;
1994 strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val );
1995 cb->sc_response = syncprov_search_response;
1996 cb->sc_cleanup = syncprov_search_cleanup;
1997 cb->sc_private = ss;
1998 cb->sc_next = op->o_callback;
1999 op->o_callback = cb;
2001 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
2002 op->o_sync_mode &= SLAP_CONTROL_MASK;
2005 /* If this is a persistent search and no changes were reported during
2006 * the refresh phase, just invoke the response callback to transition
2007 * us into persist phase
2010 rs->sr_err = LDAP_SUCCESS;
2011 rs->sr_nentries = 0;
2012 send_ldap_result( op, rs );
2015 return SLAP_CB_CONTINUE;
2019 syncprov_operational(
2023 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2024 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2026 if ( rs->sr_entry &&
2027 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
2029 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
2030 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
2031 Attribute *a, **ap = NULL;
2033 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
2034 if ( a->a_desc == slap_schema.si_ad_contextCSN )
2039 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
2041 a = ch_malloc( sizeof(Attribute));
2042 a->a_desc = slap_schema.si_ad_contextCSN;
2043 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
2044 a->a_vals[1].bv_val = NULL;
2045 a->a_nvals = a->a_vals;
2051 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
2053 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
2055 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
2057 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
2060 return SLAP_CB_CONTINUE;
2069 static ConfigDriver sp_cf_gen;
2071 static ConfigTable spcfg[] = {
2072 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2073 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2074 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2075 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2076 { "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2077 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2078 "DESC 'Session log size in ops' "
2079 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2080 { "syncprov-nopresent", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_NOPRES,
2081 sp_cf_gen, "( OLcfgOvAt:1.3 NAME 'olcSpNoPresent' "
2082 "DESC 'Omit Present phase processing' "
2083 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2084 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2087 static ConfigOCs spocs[] = {
2088 { "( OLcfgOvOc:1.1 "
2089 "NAME 'olcSyncProvConfig' "
2090 "DESC 'SyncRepl Provider configuration' "
2091 "SUP olcOverlayConfig "
2092 "MAY ( olcSpCheckpoint $ olcSpSessionlog $ olcSpNoPresent ) )",
2093 Cft_Overlay, spcfg },
2098 sp_cf_gen(ConfigArgs *c)
2100 slap_overinst *on = (slap_overinst *)c->bi;
2101 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2104 if ( c->op == SLAP_CONFIG_EMIT ) {
2105 switch ( c->type ) {
2107 if ( si->si_chkops || si->si_chktime ) {
2109 bv.bv_len = sprintf( c->msg, "%d %d",
2110 si->si_chkops, si->si_chktime );
2112 value_add_one( &c->rvalue_vals, &bv );
2118 if ( si->si_logs ) {
2119 c->value_int = si->si_logs->sl_size;
2125 if ( si->si_nopres ) {
2133 } else if ( c->op == LDAP_MOD_DELETE ) {
2134 switch ( c->type ) {
2141 si->si_logs->sl_size = 0;
2143 rc = LDAP_NO_SUCH_ATTRIBUTE;
2146 if ( si->si_nopres )
2149 rc = LDAP_NO_SUCH_ATTRIBUTE;
2154 switch ( c->type ) {
2156 si->si_chkops = atoi( c->argv[1] );
2157 si->si_chktime = atoi( c->argv[2] ) * 60;
2161 int size = c->value_int;
2164 sprintf( c->msg, "%s size %d is negative",
2166 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2167 return ARG_BAD_CONF;
2171 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2172 sl->sl_mincsn.bv_val = (char *)(sl+1);
2173 sl->sl_mincsn.bv_len = 0;
2175 sl->sl_head = sl->sl_tail = NULL;
2176 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2183 si->si_nopres = c->value_int;
2189 /* ITS#3456 we cannot run this search on the main thread, must use a
2190 * child thread in order to insure we have a big enough stack.
2197 syncprov_findcsn( ptr, FIND_MAXCSN );
2201 /* Read any existing contextCSN from the underlying db.
2202 * Then search for any entries newer than that. If no value exists,
2203 * just generate it. Cache whatever result.
2210 slap_overinst *on = (slap_overinst *) be->bd_info;
2211 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2214 char opbuf[OPERATION_BUFFER_SIZE];
2215 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2216 Operation *op = (Operation *)opbuf;
2220 void *thrctx = NULL;
2222 if ( slapMode & SLAP_TOOL_MODE ) {
2226 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2231 thrctx = ldap_pvt_thread_pool_context();
2232 connection_fake_init( &conn, op, thrctx );
2234 op->o_dn = be->be_rootdn;
2235 op->o_ndn = be->be_rootndn;
2237 ctxcsnbuf[0] = '\0';
2239 op->o_bd->bd_info = on->on_info->oi_orig;
2240 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2241 slap_schema.si_ad_contextCSN, 0, &e );
2244 ldap_pvt_thread_t tid;
2246 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2248 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2249 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2250 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2251 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2252 si->si_ctxcsn.bv_len );
2253 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2254 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2256 be_entry_release_rw( op, e, 0 );
2257 op->o_bd->bd_info = (BackendInfo *)on;
2258 op->o_req_dn = be->be_suffix[0];
2259 op->o_req_ndn = be->be_nsuffix[0];
2260 op->ors_scope = LDAP_SCOPE_SUBTREE;
2261 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2262 ldap_pvt_thread_join( tid, NULL );
2263 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2264 /* If we're also a consumer, and we didn't find the context entry,
2265 * then don't generate anything, wait for our provider to send it
2271 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2272 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2273 &si->si_ctxcsn, 0 );
2276 /* If our ctxcsn is different from what was read from the root
2277 * entry, make sure we do a checkpoint on close
2279 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2284 op->o_bd->bd_info = (BackendInfo *)on;
2285 ldap_pvt_thread_pool_context_reset( thrctx );
2289 /* Write the current contextCSN into the underlying db.
2296 slap_overinst *on = (slap_overinst *) be->bd_info;
2297 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2299 if ( slapMode & SLAP_TOOL_MODE ) {
2302 if ( si->si_numops ) {
2304 char opbuf[OPERATION_BUFFER_SIZE];
2305 Operation *op = (Operation *)opbuf;
2306 SlapReply rs = {REP_RESULT};
2309 thrctx = ldap_pvt_thread_pool_context();
2310 connection_fake_init( &conn, op, thrctx );
2312 op->o_dn = be->be_rootdn;
2313 op->o_ndn = be->be_rootndn;
2314 syncprov_checkpoint( op, &rs, on );
2315 ldap_pvt_thread_pool_context_reset( thrctx );
2326 slap_overinst *on = (slap_overinst *)be->bd_info;
2327 syncprov_info_t *si;
2329 si = ch_calloc(1, sizeof(syncprov_info_t));
2330 on->on_bi.bi_private = si;
2331 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2332 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2333 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2334 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2336 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2337 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2338 csn_anlist[1].an_desc = slap_schema.si_ad_entryUUID;
2339 csn_anlist[1].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2341 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2342 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2348 syncprov_db_destroy(
2352 slap_overinst *on = (slap_overinst *)be->bd_info;
2353 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2356 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2357 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2358 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2365 static int syncprov_parseCtrl (
2371 BerElementBuffer berbuf;
2372 BerElement *ber = (BerElement *)&berbuf;
2375 struct berval cookie = BER_BVNULL;
2379 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2380 rs->sr_text = "Sync control specified multiple times";
2381 return LDAP_PROTOCOL_ERROR;
2384 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2385 rs->sr_text = "Sync control specified with pagedResults control";
2386 return LDAP_PROTOCOL_ERROR;
2389 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2390 rs->sr_text = "Sync control value is empty (or absent)";
2391 return LDAP_PROTOCOL_ERROR;
2394 /* Parse the control value
2395 * syncRequestValue ::= SEQUENCE {
2400 * refreshAndPersist (3)
2402 * cookie syncCookie OPTIONAL
2406 ber_init2( ber, &ctrl->ldctl_value, 0 );
2408 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2409 rs->sr_text = "Sync control : mode decoding error";
2410 return LDAP_PROTOCOL_ERROR;
2414 case LDAP_SYNC_REFRESH_ONLY:
2415 mode = SLAP_SYNC_REFRESH;
2417 case LDAP_SYNC_REFRESH_AND_PERSIST:
2418 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2421 rs->sr_text = "Sync control : unknown update mode";
2422 return LDAP_PROTOCOL_ERROR;
2425 tag = ber_peek_tag( ber, &len );
2427 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2428 if (( ber_scanf( ber, /*{*/ "m", &cookie )) == LBER_ERROR ) {
2429 rs->sr_text = "Sync control : cookie decoding error";
2430 return LDAP_PROTOCOL_ERROR;
2433 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2434 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2435 rs->sr_text = "Sync control : rhint decoding error";
2436 return LDAP_PROTOCOL_ERROR;
2439 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2440 rs->sr_text = "Sync control : decoding error";
2441 return LDAP_PROTOCOL_ERROR;
2443 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2444 sr->sr_rhint = rhint;
2445 if (!BER_BVISNULL(&cookie)) {
2446 ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );
2447 slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx );
2448 if ( sr->sr_state.rid == -1 ) {
2449 rs->sr_text = "Sync control : cookie parsing error";
2450 return LDAP_PROTOCOL_ERROR;
2454 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2456 op->o_sync = ctrl->ldctl_iscritical
2457 ? SLAP_CONTROL_CRITICAL
2458 : SLAP_CONTROL_NONCRITICAL;
2460 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2462 return LDAP_SUCCESS;
2465 /* This overlay is set up for dynamic loading via moduleload. For static
2466 * configuration, you'll need to arrange for the slap_overinst to be
2467 * initialized and registered by some other function inside slapd.
2470 static slap_overinst syncprov;
2477 rc = register_supported_control( LDAP_CONTROL_SYNC,
2478 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2479 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2480 if ( rc != LDAP_SUCCESS ) {
2481 Debug( LDAP_DEBUG_ANY,
2482 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2486 syncprov.on_bi.bi_type = "syncprov";
2487 syncprov.on_bi.bi_db_init = syncprov_db_init;
2488 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2489 syncprov.on_bi.bi_db_open = syncprov_db_open;
2490 syncprov.on_bi.bi_db_close = syncprov_db_close;
2492 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2493 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2495 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2496 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2497 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2498 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2499 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2500 syncprov.on_bi.bi_op_search = syncprov_op_search;
2501 syncprov.on_bi.bi_extended = syncprov_op_extended;
2502 syncprov.on_bi.bi_operational = syncprov_operational;
2504 syncprov.on_bi.bi_cf_ocs = spocs;
2506 rc = config_register_schema( spcfg, spocs );
2507 if ( rc ) return rc;
2509 return overlay_register( &syncprov );
2512 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2514 init_module( int argc, char *argv[] )
2516 return syncprov_init();
2518 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2520 #endif /* defined(SLAPD_OVER_SYNCPROV) */