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 int si_usehint; /* use reload hint */
126 time_t si_chklast; /* time of last checkpoint */
127 Avlnode *si_mods; /* entries being modified */
129 ldap_pvt_thread_mutex_t si_csn_mutex;
130 ldap_pvt_thread_mutex_t si_ops_mutex;
131 ldap_pvt_thread_mutex_t si_mods_mutex;
132 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
135 typedef struct opcookie {
137 syncmatches *smatches;
138 struct berval sdn; /* DN of entry, for deletes */
140 struct berval suuid; /* UUID of entry */
141 struct berval sctxcsn;
142 int sreference; /* Is the entry a reference? */
145 typedef struct fbase_cookie {
146 struct berval *fdn; /* DN of a modified entry, for scope testing */
147 syncops *fss; /* persistent search we're testing against */
148 int fbase; /* if TRUE we found the search base and it's still valid */
149 int fscope; /* if TRUE then fdn is within the psearch scope */
152 static AttributeName csn_anlist[3];
153 static AttributeName uuid_anlist[2];
155 /* Build a LDAPsync intermediate state control */
161 int entry_sync_state,
165 struct berval *cookie )
170 BerElementBuffer berbuf;
171 BerElement *ber = (BerElement *)&berbuf;
173 struct berval entryuuid_bv = BER_BVNULL;
175 ber_init2( ber, 0, LBER_USE_DER );
176 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
178 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
180 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
181 AttributeDescription *desc = a->a_desc;
182 if ( desc == slap_schema.si_ad_entryUUID ) {
183 entryuuid_bv = a->a_nvals[0];
188 /* FIXME: what if entryuuid is NULL or empty ? */
190 if ( send_cookie && cookie ) {
191 ber_printf( ber, "{eOON}",
192 entry_sync_state, &entryuuid_bv, cookie );
194 ber_printf( ber, "{eON}",
195 entry_sync_state, &entryuuid_bv );
198 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
199 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
200 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
205 Debug( LDAP_DEBUG_TRACE,
206 "slap_build_sync_ctrl: ber_flatten2 failed\n",
208 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
215 /* Build a LDAPsync final state control */
223 struct berval *cookie,
227 BerElementBuffer berbuf;
228 BerElement *ber = (BerElement *)&berbuf;
230 ber_init2( ber, NULL, LBER_USE_DER );
231 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
233 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
235 ber_printf( ber, "{" );
236 if ( send_cookie && cookie ) {
237 ber_printf( ber, "O", cookie );
239 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
240 ber_printf( ber, "b", refreshDeletes );
242 ber_printf( ber, "N}" );
244 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
245 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
246 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
251 Debug( LDAP_DEBUG_TRACE,
252 "syncprov_done_ctrl: ber_flatten2 failed\n",
254 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
266 struct berval *cookie,
271 BerElementBuffer berbuf;
272 BerElement *ber = (BerElement *)&berbuf;
273 struct berval rspdata;
277 ber_init2( ber, NULL, LBER_USE_DER );
278 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
282 case LDAP_TAG_SYNC_NEW_COOKIE:
283 ber_printf( ber, "tO", type, cookie );
285 case LDAP_TAG_SYNC_REFRESH_DELETE:
286 case LDAP_TAG_SYNC_REFRESH_PRESENT:
287 ber_printf( ber, "t{", type );
289 ber_printf( ber, "O", cookie );
291 if ( refreshDone == 0 ) {
292 ber_printf( ber, "b", refreshDone );
294 ber_printf( ber, "N}" );
296 case LDAP_TAG_SYNC_ID_SET:
297 ber_printf( ber, "t{", type );
299 ber_printf( ber, "O", cookie );
301 if ( refreshDeletes == 1 ) {
302 ber_printf( ber, "b", refreshDeletes );
304 ber_printf( ber, "[W]", syncUUIDs );
305 ber_printf( ber, "N}" );
308 Debug( LDAP_DEBUG_TRACE,
309 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
315 ret = ber_flatten2( ber, &rspdata, 0 );
318 Debug( LDAP_DEBUG_TRACE,
319 "syncprov_sendinfo: ber_flatten2 failed\n",
321 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
325 rs->sr_rspoid = LDAP_SYNC_INFO;
326 rs->sr_rspdata = &rspdata;
327 send_ldap_intermediate( op, rs );
328 rs->sr_rspdata = NULL;
334 /* Find a modtarget in an AVL tree */
336 sp_avl_cmp( const void *c1, const void *c2 )
338 const modtarget *m1, *m2;
342 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
345 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
348 /* syncprov_findbase:
349 * finds the true DN of the base of a search (with alias dereferencing) and
350 * checks to make sure the base entry doesn't get replaced with a different
351 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
352 * change is detected, any persistent search on this base must be terminated /
354 * On the first call, we just save the DN and entryID. On subsequent calls
355 * we compare the DN and entryID with the saved values.
358 findbase_cb( Operation *op, SlapReply *rs )
360 slap_callback *sc = op->o_callback;
362 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
363 fbase_cookie *fc = sc->sc_private;
365 /* If no entryID, we're looking for the first time.
366 * Just store whatever we got.
368 if ( fc->fss->s_eid == NOID ) {
370 fc->fss->s_eid = rs->sr_entry->e_id;
371 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
373 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
374 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
376 /* OK, the DN is the same and the entryID is the same. */
380 if ( rs->sr_err != LDAP_SUCCESS ) {
381 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
386 static Filter generic_filter = { LDAP_FILTER_PRESENT, { 0 }, NULL };
387 static struct berval generic_filterstr = BER_BVC("(objectclass=*)");
390 syncprov_findbase( Operation *op, fbase_cookie *fc )
392 opcookie *opc = op->o_callback->sc_private;
393 slap_overinst *on = opc->son;
395 /* Use basic parameters from syncrepl search, but use
396 * current op's threadctx / tmpmemctx
398 ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex );
399 if ( fc->fss->s_flags & PS_FIND_BASE ) {
400 slap_callback cb = {0};
402 SlapReply frs = { REP_RESULT };
405 fc->fss->s_flags ^= PS_FIND_BASE;
406 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
408 fop = *fc->fss->s_op;
410 fop.o_hdr = op->o_hdr;
412 fop.o_time = op->o_time;
413 fop.o_tincr = op->o_tincr;
415 cb.sc_response = findbase_cb;
418 fop.o_sync_mode = 0; /* turn off sync mode */
419 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
420 fop.o_callback = &cb;
421 fop.o_tag = LDAP_REQ_SEARCH;
422 fop.ors_scope = LDAP_SCOPE_BASE;
423 fop.ors_limit = NULL;
425 fop.ors_tlimit = SLAP_NO_LIMIT;
426 fop.ors_attrs = slap_anlist_no_attrs;
427 fop.ors_attrsonly = 1;
428 fop.ors_filter = &generic_filter;
429 fop.ors_filterstr = generic_filterstr;
431 fop.o_bd->bd_info = on->on_info->oi_orig;
432 rc = fop.o_bd->be_search( &fop, &frs );
433 fop.o_bd->bd_info = (BackendInfo *)on;
435 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
439 /* After the first call, see if the fdn resides in the scope */
440 if ( fc->fbase == 1 ) {
441 switch ( fc->fss->s_op->ors_scope ) {
442 case LDAP_SCOPE_BASE:
443 fc->fscope = dn_match( fc->fdn, &fc->fss->s_base );
445 case LDAP_SCOPE_ONELEVEL: {
447 dnParent( fc->fdn, &pdn );
448 fc->fscope = dn_match( &pdn, &fc->fss->s_base );
450 case LDAP_SCOPE_SUBTREE:
451 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base );
453 #ifdef LDAP_SCOPE_SUBORDINATE
454 case LDAP_SCOPE_SUBORDINATE:
455 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) &&
456 !dn_match( fc->fdn, &fc->fss->s_base );
465 /* If entryID has changed, then the base of this search has
466 * changed. Invalidate the psearch.
468 return LDAP_NO_SUCH_OBJECT;
472 * This function has three different purposes, but they all use a search
473 * that filters on entryCSN so they're combined here.
474 * 1: at startup time, after a contextCSN has been read from the database,
475 * we search for all entries with CSN >= contextCSN in case the contextCSN
476 * was not checkpointed at the previous shutdown.
478 * 2: when the current contextCSN is known and we have a sync cookie, we search
479 * for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.
480 * If an entry is found, the cookie CSN is valid, otherwise it is stale.
482 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
483 * CSN, and generate Present records for them. We always collect this result
484 * in SyncID sets, even if there's only one match.
486 typedef enum find_csn_t {
493 findmax_cb( Operation *op, SlapReply *rs )
495 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
496 struct berval *maxcsn = op->o_callback->sc_private;
497 Attribute *a = attr_find( rs->sr_entry->e_attrs,
498 slap_schema.si_ad_entryCSN );
500 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
501 maxcsn->bv_len = a->a_vals[0].bv_len;
502 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
509 findcsn_cb( Operation *op, SlapReply *rs )
511 slap_callback *sc = op->o_callback;
513 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
514 sc->sc_private = (void *)1;
519 /* Build a list of entryUUIDs for sending in a SyncID set */
523 typedef struct fpres_cookie {
530 findpres_cb( Operation *op, SlapReply *rs )
532 slap_callback *sc = op->o_callback;
533 fpres_cookie *pc = sc->sc_private;
535 int ret = SLAP_CB_CONTINUE;
537 switch ( rs->sr_type ) {
539 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
541 pc->uuids[pc->num].bv_val = pc->last;
542 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
543 pc->uuids[pc->num].bv_len );
545 pc->last = pc->uuids[pc->num].bv_val;
546 pc->uuids[pc->num].bv_val = NULL;
549 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
555 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
557 pc->uuids[pc->num].bv_val = pc->last;
559 pc->last = pc->uuids[0].bv_val;
569 syncprov_findcsn( Operation *op, find_csn_t mode )
571 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
572 syncprov_info_t *si = on->on_bi.bi_private;
574 slap_callback cb = {0};
576 SlapReply frs = { REP_RESULT };
577 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
578 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
579 struct berval maxcsn;
581 #ifdef LDAP_COMP_MATCH
582 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
584 AttributeAssertion eq = { NULL, BER_BVNULL };
586 int i, rc = LDAP_SUCCESS;
587 fpres_cookie pcookie;
588 sync_control *srs = NULL;
589 int findcsn_retry = 1;
591 if ( mode != FIND_MAXCSN ) {
592 srs = op->o_controls[slap_cids.sc_LDAPsync];
594 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
600 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
601 /* We want pure entries, not referrals */
602 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
605 cf.f_av_desc = slap_schema.si_ad_entryCSN;
608 fop.o_callback = &cb;
609 fop.ors_limit = NULL;
610 fop.ors_tlimit = SLAP_NO_LIMIT;
611 fop.ors_filter = &cf;
612 fop.ors_filterstr.bv_val = buf;
617 cf.f_choice = LDAP_FILTER_GE;
618 cf.f_av_value = si->si_ctxcsn;
619 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
620 cf.f_av_value.bv_val );
621 fop.ors_attrsonly = 0;
622 fop.ors_attrs = csn_anlist;
623 fop.ors_slimit = SLAP_NO_LIMIT;
624 cb.sc_private = &maxcsn;
625 cb.sc_response = findmax_cb;
626 strcpy( cbuf, si->si_ctxcsn.bv_val );
627 maxcsn.bv_val = cbuf;
628 maxcsn.bv_len = si->si_ctxcsn.bv_len;
631 cf.f_av_value = srs->sr_state.ctxcsn;
632 /* Look for exact match the first time */
633 if ( findcsn_retry ) {
634 cf.f_choice = LDAP_FILTER_EQUALITY;
635 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN=%s)",
636 cf.f_av_value.bv_val );
637 /* On retry, look for <= */
639 cf.f_choice = LDAP_FILTER_LE;
640 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
641 cf.f_av_value.bv_val );
643 fop.ors_attrsonly = 1;
644 fop.ors_attrs = slap_anlist_no_attrs;
646 cb.sc_private = NULL;
647 cb.sc_response = findcsn_cb;
650 af.f_choice = LDAP_FILTER_AND;
653 cf.f_choice = LDAP_FILTER_LE;
654 cf.f_av_value = srs->sr_state.ctxcsn;
655 cf.f_next = op->ors_filter;
656 fop.ors_filter = ⁡
657 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
658 fop.ors_attrsonly = 0;
659 fop.ors_attrs = uuid_anlist;
660 fop.ors_slimit = SLAP_NO_LIMIT;
661 cb.sc_private = &pcookie;
662 cb.sc_response = findpres_cb;
665 /* preallocate storage for a full set */
666 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
667 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
669 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
670 pcookie.uuids[0].bv_val = pcookie.last;
671 pcookie.uuids[0].bv_len = UUID_LEN;
672 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
673 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
674 pcookie.uuids[i].bv_len = UUID_LEN;
679 fop.o_bd->bd_info = on->on_info->oi_orig;
680 fop.o_bd->be_search( &fop, &frs );
681 fop.o_bd->bd_info = (BackendInfo *)on;
685 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
686 si->si_ctxcsn.bv_len = maxcsn.bv_len;
689 /* If matching CSN was not found, invalidate the context. */
690 if ( !cb.sc_private ) {
691 /* If we didn't find an exact match, then try for <= */
692 if ( findcsn_retry ) {
696 rc = LDAP_NO_SUCH_OBJECT;
700 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
701 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
709 syncprov_free_syncop( syncops *so )
711 syncres *sr, *srnext;
712 GroupAssertion *ga, *gnext;
714 ldap_pvt_thread_mutex_lock( &so->s_mutex );
715 if ( --so->s_inuse > 0 ) {
716 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
719 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
720 if ( so->s_flags & PS_IS_DETACHED ) {
721 filter_free( so->s_op->ors_filter );
722 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
728 ch_free( so->s_base.bv_val );
729 for ( sr=so->s_res; sr; sr=srnext ) {
733 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
737 /* Send a persistent search response */
739 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so,
740 Entry **e, int mode )
742 slap_overinst *on = opc->son;
744 SlapReply rs = { REP_SEARCH };
745 LDAPControl *ctrls[2];
746 struct berval cookie;
748 Attribute a_uuid = {0};
750 if ( so->s_op->o_abandon )
751 return SLAPD_ABANDON;
754 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
756 e_uuid.e_attrs = &a_uuid;
757 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
758 a_uuid.a_nvals = &opc->suuid;
759 rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid,
760 mode, ctrls, 0, 1, &cookie );
761 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
764 op->o_bd->bd_info = (BackendInfo *)on->on_info;
768 if ( rs.sr_entry->e_private )
769 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
770 if ( opc->sreference ) {
771 rs.sr_ref = get_entry_referrals( op, rs.sr_entry );
772 send_search_reference( op, &rs );
773 ber_bvarray_free( rs.sr_ref );
779 case LDAP_SYNC_MODIFY:
781 if ( rs.sr_entry->e_private )
782 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
783 rs.sr_attrs = op->ors_attrs;
784 send_search_entry( op, &rs );
788 case LDAP_SYNC_DELETE:
789 e_uuid.e_attrs = NULL;
790 e_uuid.e_name = opc->sdn;
791 e_uuid.e_nname = opc->sndn;
792 rs.sr_entry = &e_uuid;
793 if ( opc->sreference ) {
794 struct berval bv = BER_BVNULL;
796 send_search_reference( op, &rs );
798 send_search_entry( op, &rs );
804 /* In case someone else freed it already? */
806 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
813 /* Play back queued responses */
815 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
823 op->o_bd->bd_info = (BackendInfo *)on->on_info;
826 ldap_pvt_thread_mutex_lock( &so->s_mutex );
829 so->s_res = sr->s_next;
831 so->s_restail = NULL;
832 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
834 if ( !sr || so->s_op->o_abandon )
838 opc.sndn = sr->s_ndn;
839 opc.suuid = sr->s_uuid;
840 opc.sctxcsn = sr->s_csn;
841 opc.sreference = sr->s_isreference;
844 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
845 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
851 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode );
854 be_entry_release_rw( op, e, 0 );
862 op->o_bd->bd_info = (BackendInfo *)on;
866 /* runqueue task for playing back queued responses */
868 syncprov_qtask( void *ctx, void *arg )
870 struct re_s *rtask = arg;
871 syncops *so = rtask->arg;
872 slap_overinst *on = so->s_op->o_private;
873 OperationBuffer opbuf;
877 op = (Operation *) &opbuf;
879 op->o_hdr = (Opheader *)(op+1);
880 op->o_controls = (void **)(op->o_hdr+1);
881 memset( op->o_controls, 0, SLAP_MAX_CIDS * sizeof(void *));
883 *op->o_hdr = *so->s_op->o_hdr;
885 op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx);
886 op->o_tmpmfuncs = &slap_sl_mfuncs;
887 op->o_threadctx = ctx;
889 /* syncprov_qplay expects a fake db */
890 be = *so->s_op->o_bd;
891 be.be_flags |= SLAP_DBFLAG_OVERLAY;
893 op->o_private = NULL;
894 op->o_callback = NULL;
896 syncprov_qplay( op, on, so );
898 /* decrement use count... */
899 syncprov_free_syncop( so );
901 /* wait until we get explicitly scheduled again */
902 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
903 ldap_pvt_runqueue_stoptask( &slapd_rq, so->s_qtask );
904 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 1 );
905 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
910 /* Queue a persistent search response */
912 syncprov_qresp( opcookie *opc, syncops *so, int mode )
916 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
917 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
919 sr->s_dn.bv_val = (char *)(sr + 1);
920 sr->s_dn.bv_len = opc->sdn.bv_len;
922 sr->s_isreference = opc->sreference;
923 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val,
924 opc->sdn.bv_val ) + 1;
925 sr->s_ndn.bv_len = opc->sndn.bv_len;
926 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val,
927 opc->sndn.bv_val ) + 1;
928 sr->s_uuid.bv_len = opc->suuid.bv_len;
929 AC_MEMCPY( sr->s_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
930 sr->s_csn.bv_val = sr->s_uuid.bv_val + sr->s_uuid.bv_len + 1;
931 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
932 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
934 ldap_pvt_thread_mutex_lock( &so->s_mutex );
938 so->s_restail->s_next = sr;
942 /* If the base of the psearch was modified, check it next time round */
943 if ( so->s_flags & PS_WROTE_BASE ) {
944 so->s_flags ^= PS_WROTE_BASE;
945 so->s_flags |= PS_FIND_BASE;
947 if ( so->s_flags & PS_IS_DETACHED ) {
948 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
949 if ( !so->s_qtask ) {
950 so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, RUNQ_INTERVAL,
951 syncprov_qtask, so, "syncprov_qtask",
952 so->s_op->o_conn->c_peer_name.bv_val );
955 if (!ldap_pvt_runqueue_isrunning( &slapd_rq, so->s_qtask ) &&
956 !so->s_qtask->next_sched.tv_sec ) {
957 so->s_qtask->interval.tv_sec = 0;
958 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 0 );
959 so->s_qtask->interval.tv_sec = RUNQ_INTERVAL;
963 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
965 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
970 syncprov_drop_psearch( syncops *so, int lock )
972 if ( so->s_flags & PS_IS_DETACHED ) {
974 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
975 so->s_op->o_conn->c_n_ops_executing--;
976 so->s_op->o_conn->c_n_ops_completed++;
977 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
980 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
982 syncprov_free_syncop( so );
988 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
990 slap_callback *sc = op->o_callback;
991 op->o_callback = sc->sc_next;
992 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
993 op->o_tmpfree( sc, op->o_tmpmemctx );
998 syncprov_op_abandon( Operation *op, SlapReply *rs )
1000 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1001 syncprov_info_t *si = on->on_bi.bi_private;
1002 syncops *so, *soprev;
1004 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1005 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
1006 soprev=so, so=so->s_next ) {
1007 if ( so->s_op->o_connid == op->o_connid &&
1008 so->s_op->o_msgid == op->orn_msgid ) {
1009 so->s_op->o_abandon = 1;
1010 soprev->s_next = so->s_next;
1014 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1016 /* Is this really a Cancel exop? */
1017 if ( op->o_tag != LDAP_REQ_ABANDON ) {
1018 so->s_op->o_cancel = SLAP_CANCEL_ACK;
1019 rs->sr_err = LDAP_CANCELLED;
1020 send_ldap_result( so->s_op, rs );
1021 if ( so->s_flags & PS_IS_DETACHED ) {
1023 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
1024 cb->sc_cleanup = syncprov_ab_cleanup;
1025 cb->sc_next = op->o_callback;
1026 cb->sc_private = so;
1027 return SLAP_CB_CONTINUE;
1030 syncprov_drop_psearch( so, 0 );
1032 return SLAP_CB_CONTINUE;
1035 /* Find which persistent searches are affected by this operation */
1037 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
1039 slap_overinst *on = opc->son;
1040 syncprov_info_t *si = on->on_bi.bi_private;
1043 syncops *ss, *sprev, *snext;
1047 struct berval newdn;
1050 fc.fdn = &op->o_req_ndn;
1051 /* compute new DN */
1052 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1054 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
1055 else dnParent( fc.fdn, &pdn );
1056 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
1060 if ( op->o_tag != LDAP_REQ_ADD ) {
1061 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1062 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
1063 /* If we're sending responses now, make a copy and unlock the DB */
1064 if ( e && !saveit ) {
1065 Entry *e2 = entry_dup( e );
1066 be_entry_release_rw( op, e, 0 );
1069 op->o_bd->bd_info = (BackendInfo *)on;
1075 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1076 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1077 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1078 opc->sreference = is_entry_referral( e );
1079 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1081 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1082 } else if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1083 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1084 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1085 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1086 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1089 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1090 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1091 sprev = ss, ss=snext)
1102 /* If the base of the search is missing, signal a refresh */
1103 rc = syncprov_findbase( op, &fc );
1104 if ( rc != LDAP_SUCCESS ) {
1105 SlapReply rs = {REP_RESULT};
1106 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1107 "search base has changed" );
1108 sprev->s_next = snext;
1109 syncprov_drop_psearch( ss, 1 );
1115 /* If we're sending results now, look for this op in old matches */
1119 /* Did we modify the search base? */
1120 if ( dn_match( &op->o_req_ndn, &ss->s_base )) {
1121 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1122 ss->s_flags |= PS_WROTE_BASE;
1123 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1126 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1127 old=sm, sm=sm->sm_next ) {
1128 if ( sm->sm_op == ss ) {
1130 old->sm_next = sm->sm_next;
1131 op->o_tmpfree( sm, op->o_tmpmemctx );
1137 /* check if current o_req_dn is in scope and matches filter */
1138 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1139 LDAP_COMPARE_TRUE ) {
1141 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1142 sm->sm_next = opc->smatches;
1144 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1146 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1149 /* if found send UPDATE else send ADD */
1150 syncprov_qresp( opc, ss,
1151 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD );
1153 } else if ( !saveit && found ) {
1155 syncprov_qresp( opc, ss, LDAP_SYNC_DELETE );
1158 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1160 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1161 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1162 be_entry_release_rw( op, e, 0 );
1163 op->o_bd->bd_info = (BackendInfo *)on;
1166 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1171 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1173 slap_callback *cb = op->o_callback;
1174 opcookie *opc = cb->sc_private;
1175 slap_overinst *on = opc->son;
1176 syncprov_info_t *si = on->on_bi.bi_private;
1177 syncmatches *sm, *snext;
1178 modtarget *mt, mtdummy;
1180 for (sm = opc->smatches; sm; sm=snext) {
1181 snext = sm->sm_next;
1182 syncprov_free_syncop( sm->sm_op );
1183 op->o_tmpfree( sm, op->o_tmpmemctx );
1186 /* Remove op from lock table */
1188 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1189 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1191 modinst *mi = mt->mt_mods;
1193 /* If there are more, promote the next one */
1194 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1195 if ( mi->mi_next ) {
1196 mt->mt_mods = mi->mi_next;
1197 mt->mt_op = mt->mt_mods->mi_op;
1198 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1200 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1201 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1202 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1206 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1207 if ( !BER_BVISNULL( &opc->suuid ))
1208 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1209 if ( !BER_BVISNULL( &opc->sndn ))
1210 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1211 if ( !BER_BVISNULL( &opc->sdn ))
1212 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1213 op->o_callback = cb->sc_next;
1214 op->o_tmpfree(cb, op->o_tmpmemctx);
1220 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1222 syncprov_info_t *si = on->on_bi.bi_private;
1225 struct berval bv[2];
1226 slap_callback cb = {0};
1228 mod.sml_values = bv;
1229 bv[1].bv_val = NULL;
1230 bv[0] = si->si_ctxcsn;
1231 mod.sml_nvalues = NULL;
1232 mod.sml_desc = slap_schema.si_ad_contextCSN;
1233 mod.sml_op = LDAP_MOD_REPLACE;
1235 mod.sml_next = NULL;
1237 cb.sc_response = slap_null_cb;
1239 opm.o_tag = LDAP_REQ_MODIFY;
1240 opm.o_callback = &cb;
1241 opm.orm_modlist = &mod;
1242 opm.o_req_dn = op->o_bd->be_suffix[0];
1243 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1244 opm.o_bd->bd_info = on->on_info->oi_orig;
1245 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1246 opm.o_bd->be_modify( &opm, rs );
1247 if ( mod.sml_next != NULL ) {
1248 slap_mods_free( mod.sml_next, 1 );
1253 syncprov_add_slog( Operation *op, struct berval *csn )
1255 opcookie *opc = op->o_callback->sc_private;
1256 slap_overinst *on = opc->son;
1257 syncprov_info_t *si = on->on_bi.bi_private;
1263 /* Allocate a record. UUIDs are not NUL-terminated. */
1264 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1267 se->se_tag = op->o_tag;
1269 se->se_uuid.bv_val = (char *)(se+1);
1270 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1271 se->se_uuid.bv_len = opc->suuid.bv_len;
1273 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
1274 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1275 se->se_csn.bv_val[csn->bv_len] = '\0';
1276 se->se_csn.bv_len = csn->bv_len;
1278 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1279 if ( sl->sl_head ) {
1280 sl->sl_tail->se_next = se;
1286 while ( sl->sl_num > sl->sl_size ) {
1288 sl->sl_head = se->se_next;
1289 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1290 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1293 if ( !sl->sl_head ) {
1297 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1301 /* Just set a flag if we found the matching entry */
1303 playlog_cb( Operation *op, SlapReply *rs )
1305 if ( rs->sr_type == REP_SEARCH ) {
1306 op->o_callback->sc_private = (void *)1;
1311 /* enter with sl->sl_mutex locked, release before returning */
1313 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1314 struct berval *oldcsn, struct berval *ctxcsn )
1316 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1318 int i, j, ndel, num, nmods, mmods;
1321 if ( !sl->sl_num ) {
1322 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1330 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1331 num * UUID_LEN, op->o_tmpmemctx );
1333 uuids[0].bv_val = (char *)(uuids + num + 1);
1335 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1336 * and everything else at the end. Do this first so we can
1337 * unlock the list mutex.
1339 for ( se=sl->sl_head; se; se=se->se_next ) {
1340 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1341 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1342 if ( se->se_tag == LDAP_REQ_DELETE ) {
1349 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1350 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1351 uuids[j].bv_len = UUID_LEN;
1353 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1357 /* Zero out unused slots */
1358 for ( i=ndel; i < num - nmods; i++ )
1359 uuids[i].bv_len = 0;
1361 /* Mods must be validated to see if they belong in this delete set.
1365 /* Strip any duplicates */
1366 for ( i=0; i<nmods; i++ ) {
1367 for ( j=0; j<ndel; j++ ) {
1368 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1369 uuids[num - 1 - i].bv_len = 0;
1374 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1375 for ( j=0; j<i; j++ ) {
1376 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1377 uuids[num - 1 - i].bv_len = 0;
1386 SlapReply frs = { REP_RESULT };
1389 #ifdef LDAP_COMP_MATCH
1390 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1392 AttributeAssertion eq;
1394 slap_callback cb = {0};
1398 fop.o_sync_mode = 0;
1399 fop.o_callback = &cb;
1400 fop.ors_limit = NULL;
1401 fop.ors_tlimit = SLAP_NO_LIMIT;
1402 fop.ors_attrs = slap_anlist_all_attributes;
1403 fop.ors_attrsonly = 0;
1404 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1406 af.f_choice = LDAP_FILTER_AND;
1409 mf.f_choice = LDAP_FILTER_EQUALITY;
1411 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1412 mf.f_next = fop.ors_filter;
1414 fop.ors_filter = ⁡
1416 cb.sc_response = playlog_cb;
1417 fop.o_bd->bd_info = on->on_info->oi_orig;
1419 for ( i=ndel; i<num; i++ ) {
1420 if ( uuids[i].bv_len == 0 ) continue;
1422 mf.f_av_value = uuids[i];
1423 cb.sc_private = NULL;
1425 rc = fop.o_bd->be_search( &fop, &frs );
1427 /* If entry was not found, add to delete list */
1428 if ( !cb.sc_private ) {
1429 uuids[ndel++] = uuids[i];
1432 fop.o_bd->bd_info = (BackendInfo *)on;
1435 uuids[ndel].bv_val = NULL;
1436 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1441 syncprov_op_response( Operation *op, SlapReply *rs )
1443 opcookie *opc = op->o_callback->sc_private;
1444 slap_overinst *on = opc->son;
1445 syncprov_info_t *si = on->on_bi.bi_private;
1448 if ( rs->sr_err == LDAP_SUCCESS )
1450 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1451 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1453 /* Update our context CSN */
1455 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1456 slap_get_commit_csn( op, &maxcsn, &curcsn );
1457 if ( !BER_BVISNULL( &maxcsn ) ) {
1458 strcpy( cbuf, maxcsn.bv_val );
1459 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1460 strcpy( si->si_ctxcsnbuf, cbuf );
1461 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1465 /* Don't do any processing for consumer contextCSN updates */
1466 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1467 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1468 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1469 return SLAP_CB_CONTINUE;
1473 if ( si->si_chkops || si->si_chktime ) {
1475 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1479 if ( si->si_chktime &&
1480 (op->o_time - si->si_chklast >= si->si_chktime )) {
1482 si->si_chklast = op->o_time;
1485 syncprov_checkpoint( op, rs, on );
1488 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1490 opc->sctxcsn.bv_len = maxcsn.bv_len;
1491 opc->sctxcsn.bv_val = cbuf;
1493 /* Handle any persistent searches */
1497 case LDAP_REQ_MODIFY:
1498 case LDAP_REQ_MODRDN:
1499 case LDAP_REQ_EXTENDED:
1500 syncprov_matchops( op, opc, 0 );
1502 case LDAP_REQ_DELETE:
1503 /* for each match in opc->smatches:
1506 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1507 if ( sm->sm_op->s_op->o_abandon )
1509 syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE );
1515 /* Add any log records */
1516 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1517 syncprov_add_slog( op, &curcsn );
1521 return SLAP_CB_CONTINUE;
1524 /* We don't use a subentry to store the context CSN any more.
1525 * We expose the current context CSN as an operational attribute
1526 * of the suffix entry.
1529 syncprov_op_compare( Operation *op, SlapReply *rs )
1531 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1532 syncprov_info_t *si = on->on_bi.bi_private;
1533 int rc = SLAP_CB_CONTINUE;
1535 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1536 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1540 struct berval bv[2];
1542 e.e_name = op->o_bd->be_suffix[0];
1543 e.e_nname = op->o_bd->be_nsuffix[0];
1545 BER_BVZERO( &bv[1] );
1546 bv[0] = si->si_ctxcsn;
1548 a.a_desc = slap_schema.si_ad_contextCSN;
1550 a.a_nvals = a.a_vals;
1552 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1554 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1555 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1556 if ( ! rs->sr_err ) {
1557 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1558 goto return_results;
1561 if ( get_assert( op ) &&
1562 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1564 rs->sr_err = LDAP_ASSERTION_FAILED;
1565 goto return_results;
1569 rs->sr_err = LDAP_COMPARE_FALSE;
1571 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1572 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1573 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1574 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1576 rs->sr_err = LDAP_COMPARE_TRUE;
1581 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1583 send_ldap_result( op, rs );
1585 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1586 rs->sr_err = LDAP_SUCCESS;
1595 syncprov_op_mod( Operation *op, SlapReply *rs )
1597 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1598 syncprov_info_t *si = on->on_bi.bi_private;
1600 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1602 (si->si_ops ? sizeof(modinst) : 0 ),
1604 opcookie *opc = (opcookie *)(cb+1);
1606 cb->sc_response = syncprov_op_response;
1607 cb->sc_cleanup = syncprov_op_cleanup;
1608 cb->sc_private = opc;
1609 cb->sc_next = op->o_callback;
1610 op->o_callback = cb;
1612 /* If there are active persistent searches, lock this operation.
1613 * See seqmod.c for the locking logic on its own.
1616 modtarget *mt, mtdummy;
1619 mi = (modinst *)(opc+1);
1622 /* See if we're already modifying this entry... */
1624 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1625 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1627 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1628 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1629 mt->mt_tail->mi_next = mi;
1631 /* wait for this op to get to head of list */
1632 while ( mt->mt_mods != mi ) {
1633 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1634 ldap_pvt_thread_yield();
1635 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1637 /* clean up if the caller is giving up */
1638 if ( op->o_abandon ) {
1640 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1642 m2->mi_next = mi->mi_next;
1643 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1644 op->o_tmpfree( cb, op->o_tmpmemctx );
1645 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1646 return SLAPD_ABANDON;
1649 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1651 /* Record that we're modifying this entry now */
1652 mt = ch_malloc( sizeof(modtarget) );
1655 mt->mt_op = mi->mi_op;
1656 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1657 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1658 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1662 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1663 syncprov_matchops( op, opc, 1 );
1665 return SLAP_CB_CONTINUE;
1669 syncprov_op_extended( Operation *op, SlapReply *rs )
1671 if ( exop_is_write( op ))
1672 return syncprov_op_mod( op, rs );
1674 return SLAP_CB_CONTINUE;
1677 typedef struct searchstate {
1678 slap_overinst *ss_on;
1681 struct berval ss_ctxcsn;
1682 char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1686 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1688 if ( rs->sr_ctrls ) {
1689 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1690 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1691 rs->sr_ctrls = NULL;
1697 syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on )
1703 GroupAssertion *g1, *g2;
1705 /* count the search attrs */
1706 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1707 alen += op->ors_attrs[i].an_name.bv_len + 1;
1709 /* Make a new copy of the operation */
1710 size = sizeof(Operation) + sizeof(Opheader) +
1711 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1712 op->o_req_dn.bv_len + 1 +
1713 op->o_req_ndn.bv_len + 1 +
1714 op->o_ndn.bv_len + 1 +
1715 so->s_filterstr.bv_len + 1;
1716 op2 = (Operation *)ch_calloc( 1, size );
1717 op2->o_hdr = (Opheader *)(op2+1);
1719 /* Copy the fields we care about explicitly, leave the rest alone */
1720 *op2->o_hdr = *op->o_hdr;
1721 op2->o_tag = op->o_tag;
1722 op2->o_time = op->o_time;
1723 op2->o_bd = on->on_info->oi_origdb;
1724 op2->o_request = op->o_request;
1725 op2->o_private = on;
1728 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1729 ptr = (char *)(op2->ors_attrs+i+1);
1730 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1731 op2->ors_attrs[i] = op->ors_attrs[i];
1732 op2->ors_attrs[i].an_name.bv_val = ptr;
1733 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1735 BER_BVZERO( &op2->ors_attrs[i].an_name );
1737 ptr = (char *)(op2->o_hdr + 1);
1739 op2->o_authz = op->o_authz;
1740 op2->o_ndn.bv_val = ptr;
1741 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1742 op2->o_dn = op2->o_ndn;
1743 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1744 op2->o_req_dn.bv_val = ptr;
1745 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1746 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1747 op2->o_req_ndn.bv_val = ptr;
1748 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1749 op2->ors_filterstr.bv_val = ptr;
1750 strcpy( ptr, so->s_filterstr.bv_val );
1751 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1752 op2->ors_filter = str2filter( ptr );
1755 /* Copy any cached group ACLs individually */
1756 op2->o_groups = NULL;
1757 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1758 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1760 strcpy( g2->ga_ndn, g1->ga_ndn );
1761 g2->ga_next = op2->o_groups;
1764 /* Don't allow any further group caching */
1765 op2->o_do_not_cache = 1;
1767 /* Add op2 to conn so abandon will find us */
1768 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1769 op->o_conn->c_n_ops_executing++;
1770 op->o_conn->c_n_ops_completed--;
1771 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1772 so->s_flags |= PS_IS_DETACHED;
1773 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1777 syncprov_search_response( Operation *op, SlapReply *rs )
1779 searchstate *ss = op->o_callback->sc_private;
1780 slap_overinst *on = ss->ss_on;
1781 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1783 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1785 /* If we got a referral without a referral object, there's
1786 * something missing that we cannot replicate. Just ignore it.
1787 * The consumer will abort because we didn't send the expected
1790 if ( !rs->sr_entry ) {
1791 assert( rs->sr_entry != NULL );
1792 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1793 return SLAP_CB_CONTINUE;
1795 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );
1797 /* Make sure entry is less than the snaphot'd contextCSN */
1798 if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 )
1799 return LDAP_SUCCESS;
1801 /* Don't send the ctx entry twice */
1802 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) &&
1803 bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1804 return LDAP_SUCCESS;
1806 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1808 rs->sr_ctrls[1] = NULL;
1809 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1810 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1811 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1812 struct berval cookie;
1814 slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn,
1815 srs->sr_state.rid );
1817 /* Is this a regular refresh? */
1819 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1821 rs->sr_ctrls[1] = NULL;
1822 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1823 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1824 LDAP_SYNC_REFRESH_DELETES );
1825 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1827 /* It's RefreshAndPersist, transition to Persist phase */
1828 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1829 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1830 &cookie, 1, NULL, 0 );
1831 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1833 /* Detach this Op from frontend control */
1834 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1836 /* Turn off the refreshing flag */
1837 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1839 syncprov_detach_op( op, ss->ss_so, on );
1840 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1842 return LDAP_SUCCESS;
1846 return SLAP_CB_CONTINUE;
1850 syncprov_op_search( Operation *op, SlapReply *rs )
1852 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1853 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1855 int gotstate = 0, nochange = 0, do_present;
1856 syncops *sop = NULL;
1859 struct berval ctxcsn;
1860 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1862 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1864 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1865 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1869 do_present = si->si_nopres ? 0 : 1;
1871 srs = op->o_controls[slap_cids.sc_LDAPsync];
1872 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1874 /* If this is a persistent search, set it up right away */
1875 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1885 so.s_flags = PS_IS_REFRESHING | PS_FIND_BASE;
1886 /* syncprov_findbase expects to be called as a callback... */
1887 sc.sc_private = &opc;
1889 cb = op->o_callback;
1890 op->o_callback = ≻
1891 rs->sr_err = syncprov_findbase( op, &fc );
1892 op->o_callback = cb;
1894 if ( rs->sr_err != LDAP_SUCCESS ) {
1895 send_ldap_result( op, rs );
1898 sop = ch_malloc( sizeof( syncops ));
1900 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1901 sop->s_rid = srs->sr_state.rid;
1904 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1905 sop->s_next = si->si_ops;
1907 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1910 /* snapshot the ctxcsn */
1911 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1912 strcpy( csnbuf, si->si_ctxcsnbuf );
1913 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1914 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1915 ctxcsn.bv_val = csnbuf;
1917 /* If we have a cookie, handle the PRESENT lookups */
1918 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1921 /* The cookie was validated when it was parsed, just use it */
1923 /* If just Refreshing and nothing has changed, shortcut it */
1924 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1926 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1927 LDAPControl *ctrls[2];
1931 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1932 NULL, LDAP_SYNC_REFRESH_DELETES );
1933 rs->sr_ctrls = ctrls;
1934 rs->sr_err = LDAP_SUCCESS;
1935 send_ldap_result( op, rs );
1936 rs->sr_ctrls = NULL;
1941 /* Do we have a sessionlog for this search? */
1944 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1945 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1947 /* mutex is unlocked in playlog */
1948 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1950 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1953 /* Is the CSN still present in the database? */
1954 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1955 /* No, so a reload is required */
1956 /* the 2.2 consumer doesn't send this hint */
1957 if ( si->si_usehint && srs->sr_rhint == 0 ) {
1958 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1963 /* If changed and doing Present lookup, send Present UUIDs */
1964 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1966 send_ldap_result( op, rs );
1973 /* Append CSN range to search filter, save original filter
1974 * for persistent search evaluation
1977 sop->s_filterstr= op->ors_filterstr;
1980 /* If something changed, find the changes */
1981 if ( gotstate && !nochange ) {
1982 Filter *fand, *fava;
1984 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1985 fand->f_choice = LDAP_FILTER_AND;
1986 fand->f_next = NULL;
1987 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1989 fava->f_choice = LDAP_FILTER_GE;
1990 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1991 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1992 #ifdef LDAP_COMP_MATCH
1993 fava->f_ava->aa_cf = NULL;
1995 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1996 fava->f_next = op->ors_filter;
1997 op->ors_filter = fand;
1998 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
2001 /* Let our callback add needed info to returned entries */
2002 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
2003 ss = (searchstate *)(cb+1);
2006 ss->ss_present = do_present;
2007 ss->ss_ctxcsn.bv_len = ctxcsn.bv_len;
2008 ss->ss_ctxcsn.bv_val = ss->ss_csnbuf;
2009 strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val );
2010 cb->sc_response = syncprov_search_response;
2011 cb->sc_cleanup = syncprov_search_cleanup;
2012 cb->sc_private = ss;
2013 cb->sc_next = op->o_callback;
2014 op->o_callback = cb;
2016 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
2017 op->o_sync_mode &= SLAP_CONTROL_MASK;
2020 /* If this is a persistent search and no changes were reported during
2021 * the refresh phase, just invoke the response callback to transition
2022 * us into persist phase
2025 rs->sr_err = LDAP_SUCCESS;
2026 rs->sr_nentries = 0;
2027 send_ldap_result( op, rs );
2030 return SLAP_CB_CONTINUE;
2034 syncprov_operational(
2038 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2039 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2041 if ( rs->sr_entry &&
2042 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
2044 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
2045 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
2046 Attribute *a, **ap = NULL;
2048 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
2049 if ( a->a_desc == slap_schema.si_ad_contextCSN )
2054 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
2056 a = ch_malloc( sizeof(Attribute));
2057 a->a_desc = slap_schema.si_ad_contextCSN;
2058 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
2059 a->a_vals[1].bv_val = NULL;
2060 a->a_nvals = a->a_vals;
2066 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
2068 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
2070 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
2072 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
2075 return SLAP_CB_CONTINUE;
2085 static ConfigDriver sp_cf_gen;
2087 static ConfigTable spcfg[] = {
2088 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2089 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2090 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2091 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2092 { "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2093 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2094 "DESC 'Session log size in ops' "
2095 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2096 { "syncprov-nopresent", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_NOPRES,
2097 sp_cf_gen, "( OLcfgOvAt:1.3 NAME 'olcSpNoPresent' "
2098 "DESC 'Omit Present phase processing' "
2099 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2100 { "syncprov-reloadhint", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_USEHINT,
2101 sp_cf_gen, "( OLcfgOvAt:1.4 NAME 'olcSpReloadHint' "
2102 "DESC 'Observe Reload Hint in Request control' "
2103 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2104 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2107 static ConfigOCs spocs[] = {
2108 { "( OLcfgOvOc:1.1 "
2109 "NAME 'olcSyncProvConfig' "
2110 "DESC 'SyncRepl Provider configuration' "
2111 "SUP olcOverlayConfig "
2112 "MAY ( olcSpCheckpoint $ olcSpSessionlog $ olcSpNoPresent ) )",
2113 Cft_Overlay, spcfg },
2118 sp_cf_gen(ConfigArgs *c)
2120 slap_overinst *on = (slap_overinst *)c->bi;
2121 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2124 if ( c->op == SLAP_CONFIG_EMIT ) {
2125 switch ( c->type ) {
2127 if ( si->si_chkops || si->si_chktime ) {
2129 bv.bv_len = sprintf( c->msg, "%d %d",
2130 si->si_chkops, si->si_chktime );
2132 value_add_one( &c->rvalue_vals, &bv );
2138 if ( si->si_logs ) {
2139 c->value_int = si->si_logs->sl_size;
2145 if ( si->si_nopres ) {
2152 if ( si->si_usehint ) {
2160 } else if ( c->op == LDAP_MOD_DELETE ) {
2161 switch ( c->type ) {
2168 si->si_logs->sl_size = 0;
2170 rc = LDAP_NO_SUCH_ATTRIBUTE;
2173 if ( si->si_nopres )
2176 rc = LDAP_NO_SUCH_ATTRIBUTE;
2179 if ( si->si_usehint )
2182 rc = LDAP_NO_SUCH_ATTRIBUTE;
2187 switch ( c->type ) {
2189 si->si_chkops = atoi( c->argv[1] );
2190 si->si_chktime = atoi( c->argv[2] ) * 60;
2194 int size = c->value_int;
2197 sprintf( c->msg, "%s size %d is negative",
2199 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2200 return ARG_BAD_CONF;
2204 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2205 sl->sl_mincsn.bv_val = (char *)(sl+1);
2206 sl->sl_mincsn.bv_len = 0;
2208 sl->sl_head = sl->sl_tail = NULL;
2209 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2216 si->si_nopres = c->value_int;
2219 si->si_usehint = c->value_int;
2225 /* ITS#3456 we cannot run this search on the main thread, must use a
2226 * child thread in order to insure we have a big enough stack.
2233 syncprov_findcsn( ptr, FIND_MAXCSN );
2237 /* Read any existing contextCSN from the underlying db.
2238 * Then search for any entries newer than that. If no value exists,
2239 * just generate it. Cache whatever result.
2246 slap_overinst *on = (slap_overinst *) be->bd_info;
2247 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2250 OperationBuffer opbuf;
2251 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2252 Operation *op = (Operation *) &opbuf;
2256 void *thrctx = NULL;
2258 if ( slapMode & SLAP_TOOL_MODE ) {
2262 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2267 thrctx = ldap_pvt_thread_pool_context();
2268 connection_fake_init( &conn, op, thrctx );
2270 op->o_dn = be->be_rootdn;
2271 op->o_ndn = be->be_rootndn;
2273 ctxcsnbuf[0] = '\0';
2275 op->o_bd->bd_info = on->on_info->oi_orig;
2276 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2277 slap_schema.si_ad_contextCSN, 0, &e );
2280 ldap_pvt_thread_t tid;
2282 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2284 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2285 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2286 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2287 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2288 si->si_ctxcsn.bv_len );
2289 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2290 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2292 be_entry_release_rw( op, e, 0 );
2293 op->o_bd->bd_info = (BackendInfo *)on;
2294 op->o_req_dn = be->be_suffix[0];
2295 op->o_req_ndn = be->be_nsuffix[0];
2296 op->ors_scope = LDAP_SCOPE_SUBTREE;
2297 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2298 ldap_pvt_thread_join( tid, NULL );
2299 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2300 /* If we're also a consumer, and we didn't find the context entry,
2301 * then don't generate anything, wait for our provider to send it
2307 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2308 si->si_ctxcsn.bv_len = sizeof( si->si_ctxcsnbuf );
2309 slap_get_csn( op, &si->si_ctxcsn, 0 );
2312 /* If our ctxcsn is different from what was read from the root
2313 * entry, make sure we do a checkpoint on close
2315 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2320 op->o_bd->bd_info = (BackendInfo *)on;
2321 ldap_pvt_thread_pool_context_reset( thrctx );
2325 /* Write the current contextCSN into the underlying db.
2332 slap_overinst *on = (slap_overinst *) be->bd_info;
2333 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2335 if ( slapMode & SLAP_TOOL_MODE ) {
2338 if ( si->si_numops ) {
2340 OperationBuffer opbuf;
2341 Operation *op = (Operation *) &opbuf;
2342 SlapReply rs = {REP_RESULT};
2345 thrctx = ldap_pvt_thread_pool_context();
2346 connection_fake_init( &conn, op, thrctx );
2348 op->o_dn = be->be_rootdn;
2349 op->o_ndn = be->be_rootndn;
2350 syncprov_checkpoint( op, &rs, on );
2351 ldap_pvt_thread_pool_context_reset( thrctx );
2362 slap_overinst *on = (slap_overinst *)be->bd_info;
2363 syncprov_info_t *si;
2365 si = ch_calloc(1, sizeof(syncprov_info_t));
2366 on->on_bi.bi_private = si;
2367 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2368 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2369 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2370 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2372 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2373 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2374 csn_anlist[1].an_desc = slap_schema.si_ad_entryUUID;
2375 csn_anlist[1].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2377 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2378 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2384 syncprov_db_destroy(
2388 slap_overinst *on = (slap_overinst *)be->bd_info;
2389 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2392 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2393 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2394 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2401 static int syncprov_parseCtrl (
2407 BerElementBuffer berbuf;
2408 BerElement *ber = (BerElement *)&berbuf;
2411 struct berval cookie = BER_BVNULL;
2415 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2416 rs->sr_text = "Sync control specified multiple times";
2417 return LDAP_PROTOCOL_ERROR;
2420 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2421 rs->sr_text = "Sync control specified with pagedResults control";
2422 return LDAP_PROTOCOL_ERROR;
2425 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2426 rs->sr_text = "Sync control value is empty (or absent)";
2427 return LDAP_PROTOCOL_ERROR;
2430 /* Parse the control value
2431 * syncRequestValue ::= SEQUENCE {
2436 * refreshAndPersist (3)
2438 * cookie syncCookie OPTIONAL
2442 ber_init2( ber, &ctrl->ldctl_value, 0 );
2444 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2445 rs->sr_text = "Sync control : mode decoding error";
2446 return LDAP_PROTOCOL_ERROR;
2450 case LDAP_SYNC_REFRESH_ONLY:
2451 mode = SLAP_SYNC_REFRESH;
2453 case LDAP_SYNC_REFRESH_AND_PERSIST:
2454 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2457 rs->sr_text = "Sync control : unknown update mode";
2458 return LDAP_PROTOCOL_ERROR;
2461 tag = ber_peek_tag( ber, &len );
2463 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2464 if (( ber_scanf( ber, /*{*/ "m", &cookie )) == LBER_ERROR ) {
2465 rs->sr_text = "Sync control : cookie decoding error";
2466 return LDAP_PROTOCOL_ERROR;
2468 tag = ber_peek_tag( ber, &len );
2470 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2471 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2472 rs->sr_text = "Sync control : rhint decoding error";
2473 return LDAP_PROTOCOL_ERROR;
2476 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2477 rs->sr_text = "Sync control : decoding error";
2478 return LDAP_PROTOCOL_ERROR;
2480 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2481 sr->sr_rhint = rhint;
2482 if (!BER_BVISNULL(&cookie)) {
2483 ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );
2484 slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx );
2485 if ( sr->sr_state.rid == -1 ) {
2486 rs->sr_text = "Sync control : cookie parsing error";
2487 return LDAP_PROTOCOL_ERROR;
2491 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2493 op->o_sync = ctrl->ldctl_iscritical
2494 ? SLAP_CONTROL_CRITICAL
2495 : SLAP_CONTROL_NONCRITICAL;
2497 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2499 return LDAP_SUCCESS;
2502 /* This overlay is set up for dynamic loading via moduleload. For static
2503 * configuration, you'll need to arrange for the slap_overinst to be
2504 * initialized and registered by some other function inside slapd.
2507 static slap_overinst syncprov;
2514 rc = register_supported_control( LDAP_CONTROL_SYNC,
2515 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2516 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2517 if ( rc != LDAP_SUCCESS ) {
2518 Debug( LDAP_DEBUG_ANY,
2519 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2523 syncprov.on_bi.bi_type = "syncprov";
2524 syncprov.on_bi.bi_db_init = syncprov_db_init;
2525 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2526 syncprov.on_bi.bi_db_open = syncprov_db_open;
2527 syncprov.on_bi.bi_db_close = syncprov_db_close;
2529 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2530 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2532 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2533 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2534 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2535 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2536 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2537 syncprov.on_bi.bi_op_search = syncprov_op_search;
2538 syncprov.on_bi.bi_extended = syncprov_op_extended;
2539 syncprov.on_bi.bi_operational = syncprov_operational;
2541 syncprov.on_bi.bi_cf_ocs = spocs;
2543 generic_filter.f_desc = slap_schema.si_ad_objectClass;
2545 rc = config_register_schema( spcfg, spocs );
2546 if ( rc ) return rc;
2548 return overlay_register( &syncprov );
2551 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2553 init_module( int argc, char *argv[] )
2555 return syncprov_init();
2557 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2559 #endif /* defined(SLAPD_OVER_SYNCPROV) */