2 /* syncprov.c - syncrepl provider */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2004-2006 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
68 #define PS_FIX_FILTER 0x10
70 int s_inuse; /* reference count */
71 struct syncres *s_res;
72 struct syncres *s_restail;
73 struct re_s *s_qtask; /* task for playing psearch responses */
74 #define RUNQ_INTERVAL 36000 /* a long time */
75 ldap_pvt_thread_mutex_t s_mutex;
78 /* A received sync control */
79 typedef struct sync_control {
80 struct sync_cookie sr_state;
84 #if 0 /* moved back to slap.h */
85 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
87 /* o_sync_mode uses data bits of o_sync */
88 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
90 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
91 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
92 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
93 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
95 /* Record of which searches matched at premodify step */
96 typedef struct syncmatches {
97 struct syncmatches *sm_next;
101 /* Session log data */
102 typedef struct slog_entry {
103 struct slog_entry *se_next;
104 struct berval se_uuid;
105 struct berval se_csn;
109 typedef struct sessionlog {
110 struct berval sl_mincsn;
115 ldap_pvt_thread_mutex_t sl_mutex;
118 /* The main state for this overlay */
119 typedef struct syncprov_info_t {
121 struct berval si_ctxcsn; /* ldapsync context */
122 int si_chkops; /* checkpointing info */
124 int si_numops; /* number of ops since last checkpoint */
125 int si_nopres; /* Skip present phase */
126 int si_usehint; /* use reload hint */
127 time_t si_chklast; /* time of last checkpoint */
128 Avlnode *si_mods; /* entries being modified */
130 ldap_pvt_thread_mutex_t si_csn_mutex;
131 ldap_pvt_thread_mutex_t si_ops_mutex;
132 ldap_pvt_thread_mutex_t si_mods_mutex;
133 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
136 typedef struct opcookie {
138 syncmatches *smatches;
139 struct berval sdn; /* DN of entry, for deletes */
141 struct berval suuid; /* UUID of entry */
142 struct berval sctxcsn;
143 int sreference; /* Is the entry a reference? */
146 typedef struct fbase_cookie {
147 struct berval *fdn; /* DN of a modified entry, for scope testing */
148 syncops *fss; /* persistent search we're testing against */
149 int fbase; /* if TRUE we found the search base and it's still valid */
150 int fscope; /* if TRUE then fdn is within the psearch scope */
153 static AttributeName csn_anlist[3];
154 static AttributeName uuid_anlist[2];
156 /* Build a LDAPsync intermediate state control */
162 int entry_sync_state,
166 struct berval *cookie )
171 BerElementBuffer berbuf;
172 BerElement *ber = (BerElement *)&berbuf;
174 struct berval entryuuid_bv = BER_BVNULL;
176 ber_init2( ber, 0, LBER_USE_DER );
177 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
179 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
181 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
182 AttributeDescription *desc = a->a_desc;
183 if ( desc == slap_schema.si_ad_entryUUID ) {
184 entryuuid_bv = a->a_nvals[0];
189 /* FIXME: what if entryuuid is NULL or empty ? */
191 if ( send_cookie && cookie ) {
192 ber_printf( ber, "{eOON}",
193 entry_sync_state, &entryuuid_bv, cookie );
195 ber_printf( ber, "{eON}",
196 entry_sync_state, &entryuuid_bv );
199 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
200 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
201 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
206 Debug( LDAP_DEBUG_TRACE,
207 "slap_build_sync_ctrl: ber_flatten2 failed\n",
209 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
216 /* Build a LDAPsync final state control */
224 struct berval *cookie,
228 BerElementBuffer berbuf;
229 BerElement *ber = (BerElement *)&berbuf;
231 ber_init2( ber, NULL, LBER_USE_DER );
232 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
234 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
236 ber_printf( ber, "{" );
237 if ( send_cookie && cookie ) {
238 ber_printf( ber, "O", cookie );
240 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
241 ber_printf( ber, "b", refreshDeletes );
243 ber_printf( ber, "N}" );
245 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
246 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
247 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
252 Debug( LDAP_DEBUG_TRACE,
253 "syncprov_done_ctrl: ber_flatten2 failed\n",
255 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
267 struct berval *cookie,
272 BerElementBuffer berbuf;
273 BerElement *ber = (BerElement *)&berbuf;
274 struct berval rspdata;
278 ber_init2( ber, NULL, LBER_USE_DER );
279 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
283 case LDAP_TAG_SYNC_NEW_COOKIE:
284 ber_printf( ber, "tO", type, cookie );
286 case LDAP_TAG_SYNC_REFRESH_DELETE:
287 case LDAP_TAG_SYNC_REFRESH_PRESENT:
288 ber_printf( ber, "t{", type );
290 ber_printf( ber, "O", cookie );
292 if ( refreshDone == 0 ) {
293 ber_printf( ber, "b", refreshDone );
295 ber_printf( ber, "N}" );
297 case LDAP_TAG_SYNC_ID_SET:
298 ber_printf( ber, "t{", type );
300 ber_printf( ber, "O", cookie );
302 if ( refreshDeletes == 1 ) {
303 ber_printf( ber, "b", refreshDeletes );
305 ber_printf( ber, "[W]", syncUUIDs );
306 ber_printf( ber, "N}" );
309 Debug( LDAP_DEBUG_TRACE,
310 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
316 ret = ber_flatten2( ber, &rspdata, 0 );
319 Debug( LDAP_DEBUG_TRACE,
320 "syncprov_sendinfo: ber_flatten2 failed\n",
322 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
326 rs->sr_rspoid = LDAP_SYNC_INFO;
327 rs->sr_rspdata = &rspdata;
328 send_ldap_intermediate( op, rs );
329 rs->sr_rspdata = NULL;
335 /* Find a modtarget in an AVL tree */
337 sp_avl_cmp( const void *c1, const void *c2 )
339 const modtarget *m1, *m2;
343 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
346 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
349 /* syncprov_findbase:
350 * finds the true DN of the base of a search (with alias dereferencing) and
351 * checks to make sure the base entry doesn't get replaced with a different
352 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
353 * change is detected, any persistent search on this base must be terminated /
355 * On the first call, we just save the DN and entryID. On subsequent calls
356 * we compare the DN and entryID with the saved values.
359 findbase_cb( Operation *op, SlapReply *rs )
361 slap_callback *sc = op->o_callback;
363 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
364 fbase_cookie *fc = sc->sc_private;
366 /* If no entryID, we're looking for the first time.
367 * Just store whatever we got.
369 if ( fc->fss->s_eid == NOID ) {
371 fc->fss->s_eid = rs->sr_entry->e_id;
372 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
374 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
375 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
377 /* OK, the DN is the same and the entryID is the same. */
381 if ( rs->sr_err != LDAP_SUCCESS ) {
382 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
387 static Filter generic_filter = { LDAP_FILTER_PRESENT, { 0 }, NULL };
388 static struct berval generic_filterstr = BER_BVC("(objectclass=*)");
391 syncprov_findbase( Operation *op, fbase_cookie *fc )
393 opcookie *opc = op->o_callback->sc_private;
394 slap_overinst *on = opc->son;
396 /* Use basic parameters from syncrepl search, but use
397 * current op's threadctx / tmpmemctx
399 ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex );
400 if ( fc->fss->s_flags & PS_FIND_BASE ) {
401 slap_callback cb = {0};
403 SlapReply frs = { REP_RESULT };
406 fc->fss->s_flags ^= PS_FIND_BASE;
407 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
409 fop = *fc->fss->s_op;
411 fop.o_hdr = op->o_hdr;
413 fop.o_time = op->o_time;
414 fop.o_tincr = op->o_tincr;
416 cb.sc_response = findbase_cb;
419 fop.o_sync_mode = 0; /* turn off sync mode */
420 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
421 fop.o_callback = &cb;
422 fop.o_tag = LDAP_REQ_SEARCH;
423 fop.ors_scope = LDAP_SCOPE_BASE;
424 fop.ors_limit = NULL;
426 fop.ors_tlimit = SLAP_NO_LIMIT;
427 fop.ors_attrs = slap_anlist_no_attrs;
428 fop.ors_attrsonly = 1;
429 fop.ors_filter = &generic_filter;
430 fop.ors_filterstr = generic_filterstr;
432 fop.o_bd->bd_info = on->on_info->oi_orig;
433 rc = fop.o_bd->be_search( &fop, &frs );
434 fop.o_bd->bd_info = (BackendInfo *)on;
436 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
440 /* After the first call, see if the fdn resides in the scope */
441 if ( fc->fbase == 1 ) {
442 switch ( fc->fss->s_op->ors_scope ) {
443 case LDAP_SCOPE_BASE:
444 fc->fscope = dn_match( fc->fdn, &fc->fss->s_base );
446 case LDAP_SCOPE_ONELEVEL: {
448 dnParent( fc->fdn, &pdn );
449 fc->fscope = dn_match( &pdn, &fc->fss->s_base );
451 case LDAP_SCOPE_SUBTREE:
452 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base );
454 case LDAP_SCOPE_SUBORDINATE:
455 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) &&
456 !dn_match( fc->fdn, &fc->fss->s_base );
464 /* If entryID has changed, then the base of this search has
465 * changed. Invalidate the psearch.
467 return LDAP_NO_SUCH_OBJECT;
471 * This function has three different purposes, but they all use a search
472 * that filters on entryCSN so they're combined here.
473 * 1: at startup time, after a contextCSN has been read from the database,
474 * we search for all entries with CSN >= contextCSN in case the contextCSN
475 * was not checkpointed at the previous shutdown.
477 * 2: when the current contextCSN is known and we have a sync cookie, we search
478 * for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.
479 * If an entry is found, the cookie CSN is valid, otherwise it is stale.
481 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
482 * CSN, and generate Present records for them. We always collect this result
483 * in SyncID sets, even if there's only one match.
485 typedef enum find_csn_t {
492 findmax_cb( Operation *op, SlapReply *rs )
494 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
495 struct berval *maxcsn = op->o_callback->sc_private;
496 Attribute *a = attr_find( rs->sr_entry->e_attrs,
497 slap_schema.si_ad_entryCSN );
499 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
500 maxcsn->bv_len = a->a_vals[0].bv_len;
501 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
508 findcsn_cb( Operation *op, SlapReply *rs )
510 slap_callback *sc = op->o_callback;
512 /* We just want to know that at least one exists, so it's OK if
513 * we exceed the unchecked limit.
515 if ( rs->sr_err == LDAP_ADMINLIMIT_EXCEEDED ||
516 (rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS )) {
517 sc->sc_private = (void *)1;
522 /* Build a list of entryUUIDs for sending in a SyncID set */
526 typedef struct fpres_cookie {
533 findpres_cb( Operation *op, SlapReply *rs )
535 slap_callback *sc = op->o_callback;
536 fpres_cookie *pc = sc->sc_private;
538 int ret = SLAP_CB_CONTINUE;
540 switch ( rs->sr_type ) {
542 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
544 pc->uuids[pc->num].bv_val = pc->last;
545 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
546 pc->uuids[pc->num].bv_len );
548 pc->last = pc->uuids[pc->num].bv_val;
549 pc->uuids[pc->num].bv_val = NULL;
552 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
558 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
560 pc->uuids[pc->num].bv_val = pc->last;
562 pc->last = pc->uuids[0].bv_val;
572 syncprov_findcsn( Operation *op, find_csn_t mode )
574 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
575 syncprov_info_t *si = on->on_bi.bi_private;
577 slap_callback cb = {0};
579 SlapReply frs = { REP_RESULT };
580 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
581 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
582 struct berval maxcsn;
584 #ifdef LDAP_COMP_MATCH
585 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
587 AttributeAssertion eq = { NULL, BER_BVNULL };
589 fpres_cookie pcookie;
590 sync_control *srs = NULL;
591 struct slap_limits_set fc_limits;
592 int i, rc = LDAP_SUCCESS, findcsn_retry = 1;
594 if ( mode != FIND_MAXCSN ) {
595 srs = op->o_controls[slap_cids.sc_LDAPsync];
597 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
603 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
604 /* We want pure entries, not referrals */
605 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
608 cf.f_av_desc = slap_schema.si_ad_entryCSN;
611 fop.o_callback = &cb;
612 fop.ors_limit = NULL;
613 fop.ors_tlimit = SLAP_NO_LIMIT;
614 fop.ors_filter = &cf;
615 fop.ors_filterstr.bv_val = buf;
620 cf.f_choice = LDAP_FILTER_GE;
621 cf.f_av_value = si->si_ctxcsn;
622 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
623 cf.f_av_value.bv_val );
624 fop.ors_attrsonly = 0;
625 fop.ors_attrs = csn_anlist;
626 fop.ors_slimit = SLAP_NO_LIMIT;
627 cb.sc_private = &maxcsn;
628 cb.sc_response = findmax_cb;
629 strcpy( cbuf, si->si_ctxcsn.bv_val );
630 maxcsn.bv_val = cbuf;
631 maxcsn.bv_len = si->si_ctxcsn.bv_len;
634 cf.f_av_value = srs->sr_state.ctxcsn;
635 /* Look for exact match the first time */
636 if ( findcsn_retry ) {
637 cf.f_choice = LDAP_FILTER_EQUALITY;
638 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN=%s)",
639 cf.f_av_value.bv_val );
640 /* On retry, look for <= */
642 cf.f_choice = LDAP_FILTER_LE;
643 fop.ors_limit = &fc_limits;
644 fc_limits.lms_s_unchecked = 1;
645 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
646 cf.f_av_value.bv_val );
648 fop.ors_attrsonly = 1;
649 fop.ors_attrs = slap_anlist_no_attrs;
651 cb.sc_private = NULL;
652 cb.sc_response = findcsn_cb;
655 af.f_choice = LDAP_FILTER_AND;
658 cf.f_choice = LDAP_FILTER_LE;
659 cf.f_av_value = srs->sr_state.ctxcsn;
660 cf.f_next = op->ors_filter;
661 fop.ors_filter = ⁡
662 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
663 fop.ors_attrsonly = 0;
664 fop.ors_attrs = uuid_anlist;
665 fop.ors_slimit = SLAP_NO_LIMIT;
666 cb.sc_private = &pcookie;
667 cb.sc_response = findpres_cb;
670 /* preallocate storage for a full set */
671 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
672 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
674 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
675 pcookie.uuids[0].bv_val = pcookie.last;
676 pcookie.uuids[0].bv_len = UUID_LEN;
677 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
678 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
679 pcookie.uuids[i].bv_len = UUID_LEN;
684 fop.o_bd->bd_info = on->on_info->oi_orig;
685 fop.o_bd->be_search( &fop, &frs );
686 fop.o_bd->bd_info = (BackendInfo *)on;
690 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
691 si->si_ctxcsn.bv_len = maxcsn.bv_len;
694 /* If matching CSN was not found, invalidate the context. */
695 if ( !cb.sc_private ) {
696 /* If we didn't find an exact match, then try for <= */
697 if ( findcsn_retry ) {
701 rc = LDAP_NO_SUCH_OBJECT;
705 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
706 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
714 syncprov_free_syncop( syncops *so )
716 syncres *sr, *srnext;
717 GroupAssertion *ga, *gnext;
719 ldap_pvt_thread_mutex_lock( &so->s_mutex );
720 if ( --so->s_inuse > 0 ) {
721 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
724 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
725 if ( so->s_flags & PS_IS_DETACHED ) {
726 filter_free( so->s_op->ors_filter );
727 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
733 ch_free( so->s_base.bv_val );
734 for ( sr=so->s_res; sr; sr=srnext ) {
738 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
742 /* Send a persistent search response */
744 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so,
745 Entry **e, int mode )
747 slap_overinst *on = opc->son;
749 SlapReply rs = { REP_SEARCH };
750 LDAPControl *ctrls[2];
751 struct berval cookie;
753 Attribute a_uuid = {0};
755 if ( so->s_op->o_abandon )
756 return SLAPD_ABANDON;
759 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
761 e_uuid.e_attrs = &a_uuid;
762 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
763 a_uuid.a_nvals = &opc->suuid;
764 rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid,
765 mode, ctrls, 0, 1, &cookie );
766 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
769 op->o_bd->bd_info = (BackendInfo *)on->on_info;
773 if ( rs.sr_entry->e_private )
774 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
775 if ( opc->sreference ) {
776 rs.sr_ref = get_entry_referrals( op, rs.sr_entry );
777 send_search_reference( op, &rs );
778 ber_bvarray_free( rs.sr_ref );
784 case LDAP_SYNC_MODIFY:
786 if ( rs.sr_entry->e_private )
787 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
788 rs.sr_attrs = op->ors_attrs;
789 send_search_entry( op, &rs );
793 case LDAP_SYNC_DELETE:
794 e_uuid.e_attrs = NULL;
795 e_uuid.e_name = opc->sdn;
796 e_uuid.e_nname = opc->sndn;
797 rs.sr_entry = &e_uuid;
798 if ( opc->sreference ) {
799 struct berval bv = BER_BVNULL;
801 send_search_reference( op, &rs );
803 send_search_entry( op, &rs );
809 /* In case someone else freed it already? */
811 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
818 /* Play back queued responses */
820 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
828 op->o_bd->bd_info = (BackendInfo *)on->on_info;
831 ldap_pvt_thread_mutex_lock( &so->s_mutex );
834 so->s_res = sr->s_next;
836 so->s_restail = NULL;
837 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
839 if ( !sr || so->s_op->o_abandon )
843 opc.sndn = sr->s_ndn;
844 opc.suuid = sr->s_uuid;
845 opc.sctxcsn = sr->s_csn;
846 opc.sreference = sr->s_isreference;
849 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
850 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
856 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode );
859 be_entry_release_rw( op, e, 0 );
867 op->o_bd->bd_info = (BackendInfo *)on;
871 /* runqueue task for playing back queued responses */
873 syncprov_qtask( void *ctx, void *arg )
875 struct re_s *rtask = arg;
876 syncops *so = rtask->arg;
877 slap_overinst *on = so->s_op->o_private;
878 OperationBuffer opbuf;
882 op = (Operation *) &opbuf;
884 op->o_hdr = (Opheader *)(op+1);
885 op->o_controls = (void **)(op->o_hdr+1);
886 memset( op->o_controls, 0, SLAP_MAX_CIDS * sizeof(void *));
888 *op->o_hdr = *so->s_op->o_hdr;
890 op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx);
891 op->o_tmpmfuncs = &slap_sl_mfuncs;
892 op->o_threadctx = ctx;
894 /* syncprov_qplay expects a fake db */
895 be = *so->s_op->o_bd;
896 be.be_flags |= SLAP_DBFLAG_OVERLAY;
898 op->o_private = NULL;
899 op->o_callback = NULL;
901 (void)syncprov_qplay( op, on, so );
903 /* decrement use count... */
904 syncprov_free_syncop( so );
906 /* wait until we get explicitly scheduled again */
907 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
908 ldap_pvt_runqueue_stoptask( &slapd_rq, so->s_qtask );
909 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 1 );
910 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
915 /* Start the task to play back queued psearch responses */
917 syncprov_qstart( syncops *so )
920 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
921 if ( !so->s_qtask ) {
922 so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, RUNQ_INTERVAL,
923 syncprov_qtask, so, "syncprov_qtask",
924 so->s_op->o_conn->c_peer_name.bv_val );
928 if (!ldap_pvt_runqueue_isrunning( &slapd_rq, so->s_qtask ) &&
929 !so->s_qtask->next_sched.tv_sec ) {
930 so->s_qtask->interval.tv_sec = 0;
931 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 0 );
932 so->s_qtask->interval.tv_sec = RUNQ_INTERVAL;
937 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
939 slap_wake_listener();
942 /* Queue a persistent search response */
944 syncprov_qresp( opcookie *opc, syncops *so, int mode )
948 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
949 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
951 sr->s_dn.bv_val = (char *)(sr + 1);
952 sr->s_dn.bv_len = opc->sdn.bv_len;
954 sr->s_isreference = opc->sreference;
955 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val,
956 opc->sdn.bv_val ) + 1;
957 sr->s_ndn.bv_len = opc->sndn.bv_len;
958 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val,
959 opc->sndn.bv_val ) + 1;
960 sr->s_uuid.bv_len = opc->suuid.bv_len;
961 AC_MEMCPY( sr->s_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
962 sr->s_csn.bv_val = sr->s_uuid.bv_val + sr->s_uuid.bv_len + 1;
963 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
964 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
966 ldap_pvt_thread_mutex_lock( &so->s_mutex );
970 so->s_restail->s_next = sr;
974 /* If the base of the psearch was modified, check it next time round */
975 if ( so->s_flags & PS_WROTE_BASE ) {
976 so->s_flags ^= PS_WROTE_BASE;
977 so->s_flags |= PS_FIND_BASE;
979 if ( so->s_flags & PS_IS_DETACHED ) {
980 syncprov_qstart( so );
982 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
987 syncprov_drop_psearch( syncops *so, int lock )
989 if ( so->s_flags & PS_IS_DETACHED ) {
991 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
992 so->s_op->o_conn->c_n_ops_executing--;
993 so->s_op->o_conn->c_n_ops_completed++;
994 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
997 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
999 syncprov_free_syncop( so );
1005 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
1007 slap_callback *sc = op->o_callback;
1008 op->o_callback = sc->sc_next;
1009 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
1010 op->o_tmpfree( sc, op->o_tmpmemctx );
1015 syncprov_op_abandon( Operation *op, SlapReply *rs )
1017 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1018 syncprov_info_t *si = on->on_bi.bi_private;
1019 syncops *so, *soprev;
1021 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1022 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
1023 soprev=so, so=so->s_next ) {
1024 if ( so->s_op->o_connid == op->o_connid &&
1025 so->s_op->o_msgid == op->orn_msgid ) {
1026 so->s_op->o_abandon = 1;
1027 soprev->s_next = so->s_next;
1031 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1033 /* Is this really a Cancel exop? */
1034 if ( op->o_tag != LDAP_REQ_ABANDON ) {
1035 so->s_op->o_cancel = SLAP_CANCEL_ACK;
1036 rs->sr_err = LDAP_CANCELLED;
1037 send_ldap_result( so->s_op, rs );
1038 if ( so->s_flags & PS_IS_DETACHED ) {
1040 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
1041 cb->sc_cleanup = syncprov_ab_cleanup;
1042 cb->sc_next = op->o_callback;
1043 cb->sc_private = so;
1044 return SLAP_CB_CONTINUE;
1047 syncprov_drop_psearch( so, 0 );
1049 return SLAP_CB_CONTINUE;
1052 /* Find which persistent searches are affected by this operation */
1054 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
1056 slap_overinst *on = opc->son;
1057 syncprov_info_t *si = on->on_bi.bi_private;
1060 syncops *ss, *sprev, *snext;
1064 struct berval newdn;
1066 BackendDB *b0 = op->o_bd, db;
1068 fc.fdn = &op->o_req_ndn;
1069 /* compute new DN */
1070 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1072 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
1073 else dnParent( fc.fdn, &pdn );
1074 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
1078 if ( op->o_tag != LDAP_REQ_ADD ) {
1079 if ( !SLAP_ISOVERLAY( op->o_bd )) {
1083 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1084 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
1085 /* If we're sending responses now, make a copy and unlock the DB */
1086 if ( e && !saveit ) {
1087 Entry *e2 = entry_dup( e );
1088 be_entry_release_rw( op, e, 0 );
1091 op->o_bd->bd_info = (BackendInfo *)on;
1100 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1101 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1102 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1103 opc->sreference = is_entry_referral( e );
1104 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1106 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1107 } else if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1108 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1109 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1110 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1111 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1114 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1115 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1116 sprev = ss, ss=snext)
1127 /* If the base of the search is missing, signal a refresh */
1128 rc = syncprov_findbase( op, &fc );
1129 if ( rc != LDAP_SUCCESS ) {
1130 SlapReply rs = {REP_RESULT};
1131 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1132 "search base has changed" );
1133 sprev->s_next = snext;
1134 syncprov_drop_psearch( ss, 1 );
1140 /* If we're sending results now, look for this op in old matches */
1144 /* Did we modify the search base? */
1145 if ( dn_match( &op->o_req_ndn, &ss->s_base )) {
1146 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1147 ss->s_flags |= PS_WROTE_BASE;
1148 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1151 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1152 old=sm, sm=sm->sm_next ) {
1153 if ( sm->sm_op == ss ) {
1155 old->sm_next = sm->sm_next;
1156 op->o_tmpfree( sm, op->o_tmpmemctx );
1162 /* check if current o_req_dn is in scope and matches filter */
1163 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1164 LDAP_COMPARE_TRUE ) {
1166 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1167 sm->sm_next = opc->smatches;
1169 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1171 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1174 /* if found send UPDATE else send ADD */
1175 syncprov_qresp( opc, ss,
1176 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD );
1178 } else if ( !saveit && found ) {
1180 syncprov_qresp( opc, ss, LDAP_SYNC_DELETE );
1183 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1185 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1186 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1187 be_entry_release_rw( op, e, 0 );
1188 op->o_bd->bd_info = (BackendInfo *)on;
1191 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1197 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1199 slap_callback *cb = op->o_callback;
1200 opcookie *opc = cb->sc_private;
1201 slap_overinst *on = opc->son;
1202 syncprov_info_t *si = on->on_bi.bi_private;
1203 syncmatches *sm, *snext;
1204 modtarget *mt, mtdummy;
1206 for (sm = opc->smatches; sm; sm=snext) {
1207 snext = sm->sm_next;
1208 syncprov_free_syncop( sm->sm_op );
1209 op->o_tmpfree( sm, op->o_tmpmemctx );
1212 /* Remove op from lock table */
1214 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1215 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1217 modinst *mi = mt->mt_mods;
1219 /* If there are more, promote the next one */
1220 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1221 if ( mi->mi_next ) {
1222 mt->mt_mods = mi->mi_next;
1223 mt->mt_op = mt->mt_mods->mi_op;
1224 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1226 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1227 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1228 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1232 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1233 if ( !BER_BVISNULL( &opc->suuid ))
1234 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1235 if ( !BER_BVISNULL( &opc->sndn ))
1236 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1237 if ( !BER_BVISNULL( &opc->sdn ))
1238 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1239 op->o_callback = cb->sc_next;
1240 op->o_tmpfree(cb, op->o_tmpmemctx);
1246 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1248 syncprov_info_t *si = on->on_bi.bi_private;
1251 SlapReply rsm = { 0 };
1252 struct berval bv[2];
1253 slap_callback cb = {0};
1255 /* If ctxcsn is empty, delete it */
1256 if ( BER_BVISEMPTY( &si->si_ctxcsn )) {
1257 mod.sml_values = NULL;
1259 mod.sml_values = bv;
1260 bv[1].bv_val = NULL;
1261 bv[0] = si->si_ctxcsn;
1263 mod.sml_nvalues = NULL;
1264 mod.sml_desc = slap_schema.si_ad_contextCSN;
1265 mod.sml_op = LDAP_MOD_REPLACE;
1267 mod.sml_next = NULL;
1269 cb.sc_response = slap_null_cb;
1271 opm.o_tag = LDAP_REQ_MODIFY;
1272 opm.o_callback = &cb;
1273 opm.orm_modlist = &mod;
1274 opm.o_req_dn = op->o_bd->be_suffix[0];
1275 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1276 opm.o_bd->bd_info = on->on_info->oi_orig;
1277 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1278 SLAP_DBFLAGS( opm.o_bd ) |= SLAP_DBFLAG_NOLASTMOD;
1279 opm.o_bd->be_modify( &opm, &rsm );
1280 SLAP_DBFLAGS( opm.o_bd ) ^= SLAP_DBFLAG_NOLASTMOD;
1281 if ( mod.sml_next != NULL ) {
1282 slap_mods_free( mod.sml_next, 1 );
1287 syncprov_add_slog( Operation *op )
1289 opcookie *opc = op->o_callback->sc_private;
1290 slap_overinst *on = opc->son;
1291 syncprov_info_t *si = on->on_bi.bi_private;
1297 /* Allocate a record. UUIDs are not NUL-terminated. */
1298 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1299 op->o_csn.bv_len + 1 );
1301 se->se_tag = op->o_tag;
1303 se->se_uuid.bv_val = (char *)(&se[1]);
1304 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1305 se->se_uuid.bv_len = opc->suuid.bv_len;
1307 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
1308 AC_MEMCPY( se->se_csn.bv_val, op->o_csn.bv_val, op->o_csn.bv_len );
1309 se->se_csn.bv_val[op->o_csn.bv_len] = '\0';
1310 se->se_csn.bv_len = op->o_csn.bv_len;
1312 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1313 if ( sl->sl_head ) {
1314 sl->sl_tail->se_next = se;
1320 while ( sl->sl_num > sl->sl_size ) {
1322 sl->sl_head = se->se_next;
1323 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1324 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1328 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1332 /* Just set a flag if we found the matching entry */
1334 playlog_cb( Operation *op, SlapReply *rs )
1336 if ( rs->sr_type == REP_SEARCH ) {
1337 op->o_callback->sc_private = (void *)1;
1342 /* enter with sl->sl_mutex locked, release before returning */
1344 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1345 sync_control *srs, struct berval *ctxcsn )
1347 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1349 int i, j, ndel, num, nmods, mmods;
1350 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1352 struct berval delcsn;
1354 if ( !sl->sl_num ) {
1355 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1363 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1364 num * UUID_LEN, op->o_tmpmemctx );
1365 uuids[0].bv_val = (char *)(uuids + num + 1);
1368 delcsn.bv_val = cbuf;
1370 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1371 * and everything else at the end. Do this first so we can
1372 * unlock the list mutex.
1374 for ( se=sl->sl_head; se; se=se->se_next ) {
1375 if ( ber_bvcmp( &se->se_csn, &srs->sr_state.ctxcsn ) <= 0 ) continue;
1376 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1377 if ( se->se_tag == LDAP_REQ_DELETE ) {
1380 AC_MEMCPY( cbuf, se->se_csn.bv_val, se->se_csn.bv_len );
1381 delcsn.bv_len = se->se_csn.bv_len;
1382 delcsn.bv_val[delcsn.bv_len] = '\0';
1387 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1388 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1389 uuids[j].bv_len = UUID_LEN;
1391 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1395 /* Zero out unused slots */
1396 for ( i=ndel; i < num - nmods; i++ )
1397 uuids[i].bv_len = 0;
1399 /* Mods must be validated to see if they belong in this delete set.
1403 /* Strip any duplicates */
1404 for ( i=0; i<nmods; i++ ) {
1405 for ( j=0; j<ndel; j++ ) {
1406 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1407 uuids[num - 1 - i].bv_len = 0;
1412 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1413 for ( j=0; j<i; j++ ) {
1414 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1415 uuids[num - 1 - i].bv_len = 0;
1424 SlapReply frs = { REP_RESULT };
1427 #ifdef LDAP_COMP_MATCH
1428 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1430 AttributeAssertion eq;
1432 slap_callback cb = {0};
1436 fop.o_sync_mode = 0;
1437 fop.o_callback = &cb;
1438 fop.ors_limit = NULL;
1439 fop.ors_tlimit = SLAP_NO_LIMIT;
1440 fop.ors_attrs = slap_anlist_all_attributes;
1441 fop.ors_attrsonly = 0;
1442 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1444 af.f_choice = LDAP_FILTER_AND;
1447 mf.f_choice = LDAP_FILTER_EQUALITY;
1449 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1450 mf.f_next = fop.ors_filter;
1452 fop.ors_filter = ⁡
1454 cb.sc_response = playlog_cb;
1455 fop.o_bd->bd_info = on->on_info->oi_orig;
1457 for ( i=ndel; i<num; i++ ) {
1458 if ( uuids[i].bv_len == 0 ) continue;
1460 mf.f_av_value = uuids[i];
1461 cb.sc_private = NULL;
1463 frs.sr_nentries = 0;
1464 rc = fop.o_bd->be_search( &fop, &frs );
1466 /* If entry was not found, add to delete list */
1467 if ( !cb.sc_private ) {
1468 uuids[ndel++] = uuids[i];
1471 fop.o_bd->bd_info = (BackendInfo *)on;
1474 struct berval cookie;
1476 slap_compose_sync_cookie( op, &cookie, &delcsn, srs->sr_state.rid );
1477 uuids[ndel].bv_val = NULL;
1478 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, &cookie, 0, uuids, 1 );
1479 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1481 op->o_tmpfree( uuids, op->o_tmpmemctx );
1485 syncprov_op_response( Operation *op, SlapReply *rs )
1487 opcookie *opc = op->o_callback->sc_private;
1488 slap_overinst *on = opc->son;
1489 syncprov_info_t *si = on->on_bi.bi_private;
1492 if ( rs->sr_err == LDAP_SUCCESS )
1494 struct berval maxcsn = BER_BVNULL;
1495 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1497 /* Update our context CSN */
1499 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1500 slap_get_commit_csn( op, &maxcsn );
1501 if ( !BER_BVISNULL( &maxcsn ) ) {
1502 strcpy( cbuf, maxcsn.bv_val );
1503 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1504 strcpy( si->si_ctxcsnbuf, cbuf );
1505 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1509 /* Don't do any processing for consumer contextCSN updates */
1510 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1511 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1512 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1513 return SLAP_CB_CONTINUE;
1517 if ( si->si_chkops || si->si_chktime ) {
1519 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1523 if ( si->si_chktime &&
1524 (op->o_time - si->si_chklast >= si->si_chktime )) {
1526 si->si_chklast = op->o_time;
1529 syncprov_checkpoint( op, rs, on );
1532 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1534 opc->sctxcsn.bv_len = maxcsn.bv_len;
1535 opc->sctxcsn.bv_val = cbuf;
1537 /* Handle any persistent searches */
1541 case LDAP_REQ_MODIFY:
1542 case LDAP_REQ_MODRDN:
1543 case LDAP_REQ_EXTENDED:
1544 syncprov_matchops( op, opc, 0 );
1546 case LDAP_REQ_DELETE:
1547 /* for each match in opc->smatches:
1550 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1551 if ( sm->sm_op->s_op->o_abandon )
1553 syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE );
1559 /* Add any log records */
1560 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1561 syncprov_add_slog( op );
1565 return SLAP_CB_CONTINUE;
1568 /* We don't use a subentry to store the context CSN any more.
1569 * We expose the current context CSN as an operational attribute
1570 * of the suffix entry.
1573 syncprov_op_compare( Operation *op, SlapReply *rs )
1575 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1576 syncprov_info_t *si = on->on_bi.bi_private;
1577 int rc = SLAP_CB_CONTINUE;
1579 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1580 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1584 struct berval bv[2];
1586 e.e_name = op->o_bd->be_suffix[0];
1587 e.e_nname = op->o_bd->be_nsuffix[0];
1589 BER_BVZERO( &bv[1] );
1590 bv[0] = si->si_ctxcsn;
1592 a.a_desc = slap_schema.si_ad_contextCSN;
1594 a.a_nvals = a.a_vals;
1596 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1598 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1599 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1600 if ( ! rs->sr_err ) {
1601 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1602 goto return_results;
1605 if ( get_assert( op ) &&
1606 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1608 rs->sr_err = LDAP_ASSERTION_FAILED;
1609 goto return_results;
1613 rs->sr_err = LDAP_COMPARE_FALSE;
1615 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1616 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1617 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1618 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1620 rs->sr_err = LDAP_COMPARE_TRUE;
1625 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1627 send_ldap_result( op, rs );
1629 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1630 rs->sr_err = LDAP_SUCCESS;
1639 syncprov_op_mod( Operation *op, SlapReply *rs )
1641 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1642 syncprov_info_t *si = on->on_bi.bi_private;
1644 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1646 (si->si_ops ? sizeof(modinst) : 0 ),
1648 opcookie *opc = (opcookie *)(cb+1);
1650 cb->sc_response = syncprov_op_response;
1651 cb->sc_cleanup = syncprov_op_cleanup;
1652 cb->sc_private = opc;
1653 cb->sc_next = op->o_callback;
1654 op->o_callback = cb;
1656 /* If there are active persistent searches, lock this operation.
1657 * See seqmod.c for the locking logic on its own.
1660 modtarget *mt, mtdummy;
1663 mi = (modinst *)(opc+1);
1666 /* See if we're already modifying this entry... */
1668 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1669 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1671 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1672 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1673 mt->mt_tail->mi_next = mi;
1675 /* wait for this op to get to head of list */
1676 while ( mt->mt_mods != mi ) {
1677 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1678 ldap_pvt_thread_yield();
1679 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1681 /* clean up if the caller is giving up */
1682 if ( op->o_abandon ) {
1684 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1686 m2->mi_next = mi->mi_next;
1687 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1688 op->o_tmpfree( cb, op->o_tmpmemctx );
1689 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1690 return SLAPD_ABANDON;
1693 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1695 /* Record that we're modifying this entry now */
1696 mt = ch_malloc( sizeof(modtarget) );
1699 mt->mt_op = mi->mi_op;
1700 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1701 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1702 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1706 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1707 syncprov_matchops( op, opc, 1 );
1709 return SLAP_CB_CONTINUE;
1713 syncprov_op_extended( Operation *op, SlapReply *rs )
1715 if ( exop_is_write( op ))
1716 return syncprov_op_mod( op, rs );
1718 return SLAP_CB_CONTINUE;
1721 typedef struct searchstate {
1722 slap_overinst *ss_on;
1725 struct berval ss_ctxcsn;
1726 char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1730 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1732 if ( rs->sr_ctrls ) {
1733 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1734 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1735 rs->sr_ctrls = NULL;
1741 syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on )
1747 GroupAssertion *g1, *g2;
1749 /* count the search attrs */
1750 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1751 alen += op->ors_attrs[i].an_name.bv_len + 1;
1753 /* Make a new copy of the operation */
1754 size = sizeof(Operation) + sizeof(Opheader) +
1755 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1756 op->o_req_dn.bv_len + 1 +
1757 op->o_req_ndn.bv_len + 1 +
1758 op->o_ndn.bv_len + 1 +
1759 so->s_filterstr.bv_len + 1;
1760 op2 = (Operation *)ch_calloc( 1, size );
1761 op2->o_hdr = (Opheader *)(op2+1);
1763 /* Copy the fields we care about explicitly, leave the rest alone */
1764 *op2->o_hdr = *op->o_hdr;
1765 op2->o_tag = op->o_tag;
1766 op2->o_time = op->o_time;
1767 op2->o_bd = on->on_info->oi_origdb;
1768 op2->o_request = op->o_request;
1769 op2->o_private = on;
1772 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1773 ptr = (char *)(op2->ors_attrs+i+1);
1774 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1775 op2->ors_attrs[i] = op->ors_attrs[i];
1776 op2->ors_attrs[i].an_name.bv_val = ptr;
1777 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1779 BER_BVZERO( &op2->ors_attrs[i].an_name );
1781 ptr = (char *)(op2->o_hdr + 1);
1783 op2->o_authz = op->o_authz;
1784 op2->o_ndn.bv_val = ptr;
1785 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1786 op2->o_dn = op2->o_ndn;
1787 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1788 op2->o_req_dn.bv_val = ptr;
1789 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1790 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1791 op2->o_req_ndn.bv_val = ptr;
1792 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1793 op2->ors_filterstr.bv_val = ptr;
1794 strcpy( ptr, so->s_filterstr.bv_val );
1795 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1797 /* Skip the AND/GE clause that we stuck on in front */
1798 if ( so->s_flags & PS_FIX_FILTER ) {
1799 op2->ors_filter = op->ors_filter->f_and->f_next;
1800 so->s_flags ^= PS_FIX_FILTER;
1802 op2->ors_filter = op->ors_filter;
1804 op2->ors_filter = filter_dup( op2->ors_filter, NULL );
1807 /* Copy any cached group ACLs individually */
1808 op2->o_groups = NULL;
1809 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1810 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1812 strcpy( g2->ga_ndn, g1->ga_ndn );
1813 g2->ga_next = op2->o_groups;
1816 /* Don't allow any further group caching */
1817 op2->o_do_not_cache = 1;
1819 /* Add op2 to conn so abandon will find us */
1820 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1821 op->o_conn->c_n_ops_executing++;
1822 op->o_conn->c_n_ops_completed--;
1823 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1824 so->s_flags |= PS_IS_DETACHED;
1825 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1827 /* Prevent anyone else from trying to send a result for this op */
1832 syncprov_search_response( Operation *op, SlapReply *rs )
1834 searchstate *ss = op->o_callback->sc_private;
1835 slap_overinst *on = ss->ss_on;
1836 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1838 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1840 /* If we got a referral without a referral object, there's
1841 * something missing that we cannot replicate. Just ignore it.
1842 * The consumer will abort because we didn't send the expected
1845 if ( !rs->sr_entry ) {
1846 assert( rs->sr_entry != NULL );
1847 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1848 return SLAP_CB_CONTINUE;
1850 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );
1851 if ( a == NULL && rs->sr_operational_attrs != NULL ) {
1852 a = attr_find( rs->sr_operational_attrs, slap_schema.si_ad_entryCSN );
1855 /* Make sure entry is less than the snapshot'd contextCSN */
1856 if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 ) {
1857 Debug( LDAP_DEBUG_SYNC, "Entry %s CSN %s greater than snapshot %s\n",
1858 rs->sr_entry->e_name.bv_val,
1859 a->a_nvals[0].bv_val,
1860 ss->ss_ctxcsn.bv_val );
1861 return LDAP_SUCCESS;
1864 /* Don't send the ctx entry twice */
1865 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) &&
1866 bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) ) {
1867 Debug( LDAP_DEBUG_SYNC, "Entry %s CSN %s matches ctx %s\n",
1868 rs->sr_entry->e_name.bv_val,
1869 a->a_nvals[0].bv_val,
1870 srs->sr_state.ctxcsn.bv_val );
1871 return LDAP_SUCCESS;
1874 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1876 rs->sr_ctrls[1] = NULL;
1877 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1878 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1879 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1880 struct berval cookie;
1882 slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn,
1883 srs->sr_state.rid );
1885 /* Is this a regular refresh? */
1887 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1889 rs->sr_ctrls[1] = NULL;
1890 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1891 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1892 LDAP_SYNC_REFRESH_DELETES );
1893 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1895 /* It's RefreshAndPersist, transition to Persist phase */
1896 syncprov_sendinfo( op, rs, ss->ss_present ?
1897 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1898 &cookie, 1, NULL, 0 );
1899 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1901 /* Detach this Op from frontend control */
1902 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1904 /* Turn off the refreshing flag */
1905 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1907 syncprov_detach_op( op, ss->ss_so, on );
1909 /* If there are queued responses, fire them off */
1910 if ( ss->ss_so->s_res )
1911 syncprov_qstart( ss->ss_so );
1912 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1914 return LDAP_SUCCESS;
1918 return SLAP_CB_CONTINUE;
1922 syncprov_op_search( Operation *op, SlapReply *rs )
1924 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1925 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1927 int gotstate = 0, nochange = 0, do_present;
1928 syncops *sop = NULL;
1931 struct berval ctxcsn;
1932 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1934 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1936 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1937 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1941 do_present = si->si_nopres ? 0 : 1;
1943 srs = op->o_controls[slap_cids.sc_LDAPsync];
1944 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1946 /* If this is a persistent search, set it up right away */
1947 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1957 so.s_flags = PS_IS_REFRESHING | PS_FIND_BASE;
1958 /* syncprov_findbase expects to be called as a callback... */
1959 sc.sc_private = &opc;
1961 ldap_pvt_thread_mutex_init( &so.s_mutex );
1962 cb = op->o_callback;
1963 op->o_callback = ≻
1964 rs->sr_err = syncprov_findbase( op, &fc );
1965 op->o_callback = cb;
1966 ldap_pvt_thread_mutex_destroy( &so.s_mutex );
1968 if ( rs->sr_err != LDAP_SUCCESS ) {
1969 send_ldap_result( op, rs );
1972 sop = ch_malloc( sizeof( syncops ));
1974 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1975 sop->s_rid = srs->sr_state.rid;
1978 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1979 sop->s_next = si->si_ops;
1981 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1984 /* snapshot the ctxcsn */
1985 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1986 strcpy( csnbuf, si->si_ctxcsnbuf );
1987 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1988 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1989 ctxcsn.bv_val = csnbuf;
1991 /* If we have a cookie, handle the PRESENT lookups */
1992 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1995 /* The cookie was validated when it was parsed, just use it */
1997 /* If just Refreshing and nothing has changed, shortcut it */
1998 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
2000 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
2001 LDAPControl *ctrls[2];
2005 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
2006 NULL, LDAP_SYNC_REFRESH_DELETES );
2007 rs->sr_ctrls = ctrls;
2008 rs->sr_err = LDAP_SUCCESS;
2009 send_ldap_result( op, rs );
2010 rs->sr_ctrls = NULL;
2015 /* Do we have a sessionlog for this search? */
2018 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
2019 /* Are there any log entries, and is the consumer state
2020 * present in the session log?
2022 if ( sl->sl_num > 0 && ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
2024 /* mutex is unlocked in playlog */
2025 syncprov_playlog( op, rs, sl, srs, &ctxcsn );
2027 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
2030 /* Is the CSN still present in the database? */
2031 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
2032 /* No, so a reload is required */
2033 /* the 2.2 consumer doesn't send this hint */
2034 if ( si->si_usehint && srs->sr_rhint == 0 ) {
2035 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
2040 /* If changed and doing Present lookup, send Present UUIDs */
2041 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
2043 send_ldap_result( op, rs );
2050 /* Append CSN range to search filter, save original filter
2051 * for persistent search evaluation
2054 sop->s_filterstr= op->ors_filterstr;
2057 /* If something changed, find the changes */
2058 if ( gotstate && !nochange ) {
2059 Filter *fand, *fava;
2061 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
2062 fand->f_choice = LDAP_FILTER_AND;
2063 fand->f_next = NULL;
2064 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
2066 fava->f_choice = LDAP_FILTER_GE;
2067 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
2068 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
2069 #ifdef LDAP_COMP_MATCH
2070 fava->f_ava->aa_cf = NULL;
2072 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
2073 fava->f_next = op->ors_filter;
2074 op->ors_filter = fand;
2075 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
2077 sop->s_flags |= PS_FIX_FILTER;
2080 /* Let our callback add needed info to returned entries */
2081 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
2082 ss = (searchstate *)(cb+1);
2085 ss->ss_present = do_present;
2086 ss->ss_ctxcsn.bv_len = ctxcsn.bv_len;
2087 ss->ss_ctxcsn.bv_val = ss->ss_csnbuf;
2088 strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val );
2089 cb->sc_response = syncprov_search_response;
2090 cb->sc_cleanup = syncprov_search_cleanup;
2091 cb->sc_private = ss;
2092 cb->sc_next = op->o_callback;
2093 op->o_callback = cb;
2095 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
2096 op->o_sync_mode &= SLAP_CONTROL_MASK;
2099 /* If this is a persistent search and no changes were reported during
2100 * the refresh phase, just invoke the response callback to transition
2101 * us into persist phase
2104 rs->sr_err = LDAP_SUCCESS;
2105 rs->sr_nentries = 0;
2106 send_ldap_result( op, rs );
2109 return SLAP_CB_CONTINUE;
2113 syncprov_operational(
2117 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2118 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2120 if ( rs->sr_entry &&
2121 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
2123 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
2124 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
2125 Attribute *a, **ap = NULL;
2127 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
2128 if ( a->a_desc == slap_schema.si_ad_contextCSN )
2133 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
2135 a = ch_malloc( sizeof(Attribute));
2136 a->a_desc = slap_schema.si_ad_contextCSN;
2137 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
2138 a->a_vals[1].bv_val = NULL;
2139 a->a_nvals = a->a_vals;
2145 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
2147 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
2149 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
2151 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
2154 return SLAP_CB_CONTINUE;
2164 static ConfigDriver sp_cf_gen;
2166 static ConfigTable spcfg[] = {
2167 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2168 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2169 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2170 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2171 { "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2172 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2173 "DESC 'Session log size in ops' "
2174 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2175 { "syncprov-nopresent", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_NOPRES,
2176 sp_cf_gen, "( OLcfgOvAt:1.3 NAME 'olcSpNoPresent' "
2177 "DESC 'Omit Present phase processing' "
2178 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2179 { "syncprov-reloadhint", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_USEHINT,
2180 sp_cf_gen, "( OLcfgOvAt:1.4 NAME 'olcSpReloadHint' "
2181 "DESC 'Observe Reload Hint in Request control' "
2182 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2183 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2186 static ConfigOCs spocs[] = {
2187 { "( OLcfgOvOc:1.1 "
2188 "NAME 'olcSyncProvConfig' "
2189 "DESC 'SyncRepl Provider configuration' "
2190 "SUP olcOverlayConfig "
2191 "MAY ( olcSpCheckpoint $ olcSpSessionlog $ olcSpNoPresent ) )",
2192 Cft_Overlay, spcfg },
2197 sp_cf_gen(ConfigArgs *c)
2199 slap_overinst *on = (slap_overinst *)c->bi;
2200 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2203 if ( c->op == SLAP_CONFIG_EMIT ) {
2204 switch ( c->type ) {
2206 if ( si->si_chkops || si->si_chktime ) {
2208 bv.bv_len = sprintf( c->msg, "%d %d",
2209 si->si_chkops, si->si_chktime );
2211 value_add_one( &c->rvalue_vals, &bv );
2217 if ( si->si_logs ) {
2218 c->value_int = si->si_logs->sl_size;
2224 if ( si->si_nopres ) {
2231 if ( si->si_usehint ) {
2239 } else if ( c->op == LDAP_MOD_DELETE ) {
2240 switch ( c->type ) {
2247 si->si_logs->sl_size = 0;
2249 rc = LDAP_NO_SUCH_ATTRIBUTE;
2252 if ( si->si_nopres )
2255 rc = LDAP_NO_SUCH_ATTRIBUTE;
2258 if ( si->si_usehint )
2261 rc = LDAP_NO_SUCH_ATTRIBUTE;
2266 switch ( c->type ) {
2268 if ( lutil_atoi( &si->si_chkops, c->argv[1] ) != 0 ) {
2269 sprintf( c->msg, "%s unable to parse checkpoint ops # \"%s\"",
2270 c->argv[0], c->argv[1] );
2271 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2272 return ARG_BAD_CONF;
2274 if ( si->si_chkops <= 0 ) {
2275 sprintf( c->msg, "%s invalid checkpoint ops # \"%d\"",
2276 c->argv[0], si->si_chkops );
2277 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2278 return ARG_BAD_CONF;
2280 if ( lutil_atoi( &si->si_chktime, c->argv[2] ) != 0 ) {
2281 sprintf( c->msg, "%s unable to parse checkpoint time \"%s\"",
2282 c->argv[0], c->argv[1] );
2283 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2284 return ARG_BAD_CONF;
2286 if ( si->si_chktime <= 0 ) {
2287 sprintf( c->msg, "%s invalid checkpoint time \"%d\"",
2288 c->argv[0], si->si_chkops );
2289 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2290 return ARG_BAD_CONF;
2292 si->si_chktime *= 60;
2296 int size = c->value_int;
2299 sprintf( c->msg, "%s size %d is negative",
2301 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2302 return ARG_BAD_CONF;
2306 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2307 sl->sl_mincsn.bv_val = (char *)(sl+1);
2308 sl->sl_mincsn.bv_len = 0;
2310 sl->sl_head = sl->sl_tail = NULL;
2311 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2318 si->si_nopres = c->value_int;
2321 si->si_usehint = c->value_int;
2327 /* ITS#3456 we cannot run this search on the main thread, must use a
2328 * child thread in order to insure we have a big enough stack.
2335 syncprov_findcsn( ptr, FIND_MAXCSN );
2339 /* Read any existing contextCSN from the underlying db.
2340 * Then search for any entries newer than that. If no value exists,
2341 * just generate it. Cache whatever result.
2348 slap_overinst *on = (slap_overinst *) be->bd_info;
2349 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2351 Connection conn = { 0 };
2352 OperationBuffer opbuf = { 0 };
2353 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2354 Operation *op = (Operation *) &opbuf;
2358 void *thrctx = NULL;
2360 if ( !SLAP_LASTMOD( be )) {
2361 Debug( LDAP_DEBUG_ANY,
2362 "syncprov_db_open: invalid config, lastmod must be enabled\n", 0, 0, 0 );
2366 if ( slapMode & SLAP_TOOL_MODE ) {
2370 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2375 thrctx = ldap_pvt_thread_pool_context();
2376 connection_fake_init( &conn, op, thrctx );
2378 op->o_dn = be->be_rootdn;
2379 op->o_ndn = be->be_rootndn;
2381 ctxcsnbuf[0] = '\0';
2383 op->o_bd->bd_info = on->on_info->oi_orig;
2384 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2385 slap_schema.si_ad_contextCSN, 0, &e );
2388 ldap_pvt_thread_t tid;
2390 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2392 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2393 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2394 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2395 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2396 si->si_ctxcsn.bv_len );
2397 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2398 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2400 be_entry_release_rw( op, e, 0 );
2401 if ( !BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2402 op->o_bd->bd_info = (BackendInfo *)on;
2403 op->o_req_dn = be->be_suffix[0];
2404 op->o_req_ndn = be->be_nsuffix[0];
2405 op->ors_scope = LDAP_SCOPE_SUBTREE;
2406 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2407 ldap_pvt_thread_join( tid, NULL );
2411 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2412 if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2413 /* If we're also a consumer, and we didn't get a contextCSN,
2414 * then don't generate anything, wait for our provider to send it
2419 si->si_ctxcsn.bv_len = sizeof( si->si_ctxcsnbuf );
2420 slap_get_csn( op, &si->si_ctxcsn, 0 );
2423 /* If our ctxcsn is different from what was read from the root
2424 * entry, make sure we do a checkpoint on close
2426 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2431 op->o_bd->bd_info = (BackendInfo *)on;
2432 ldap_pvt_thread_pool_context_reset( thrctx );
2436 /* Write the current contextCSN into the underlying db.
2443 slap_overinst *on = (slap_overinst *) be->bd_info;
2444 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2446 if ( slapMode & SLAP_TOOL_MODE ) {
2449 if ( si->si_numops ) {
2451 OperationBuffer opbuf;
2452 Operation *op = (Operation *) &opbuf;
2453 SlapReply rs = {REP_RESULT};
2456 thrctx = ldap_pvt_thread_pool_context();
2457 connection_fake_init( &conn, op, thrctx );
2459 op->o_dn = be->be_rootdn;
2460 op->o_ndn = be->be_rootndn;
2461 syncprov_checkpoint( op, &rs, on );
2462 ldap_pvt_thread_pool_context_reset( thrctx );
2473 slap_overinst *on = (slap_overinst *)be->bd_info;
2474 syncprov_info_t *si;
2476 si = ch_calloc(1, sizeof(syncprov_info_t));
2477 on->on_bi.bi_private = si;
2478 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2479 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2480 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2481 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2483 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2484 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2485 csn_anlist[1].an_desc = slap_schema.si_ad_entryUUID;
2486 csn_anlist[1].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2488 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2489 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2495 syncprov_db_destroy(
2499 slap_overinst *on = (slap_overinst *)be->bd_info;
2500 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2503 if ( si->si_logs ) {
2504 slog_entry *se = si->si_logs->sl_head;
2507 slog_entry *se_next = se->se_next;
2512 ch_free( si->si_logs );
2514 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2515 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2516 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2523 static int syncprov_parseCtrl (
2529 BerElementBuffer berbuf;
2530 BerElement *ber = (BerElement *)&berbuf;
2533 struct berval cookie = BER_BVNULL;
2537 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2538 rs->sr_text = "Sync control specified multiple times";
2539 return LDAP_PROTOCOL_ERROR;
2542 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2543 rs->sr_text = "Sync control specified with pagedResults control";
2544 return LDAP_PROTOCOL_ERROR;
2547 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2548 rs->sr_text = "Sync control value is empty (or absent)";
2549 return LDAP_PROTOCOL_ERROR;
2552 /* Parse the control value
2553 * syncRequestValue ::= SEQUENCE {
2558 * refreshAndPersist (3)
2560 * cookie syncCookie OPTIONAL
2564 ber_init2( ber, &ctrl->ldctl_value, 0 );
2566 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2567 rs->sr_text = "Sync control : mode decoding error";
2568 return LDAP_PROTOCOL_ERROR;
2572 case LDAP_SYNC_REFRESH_ONLY:
2573 mode = SLAP_SYNC_REFRESH;
2575 case LDAP_SYNC_REFRESH_AND_PERSIST:
2576 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2579 rs->sr_text = "Sync control : unknown update mode";
2580 return LDAP_PROTOCOL_ERROR;
2583 tag = ber_peek_tag( ber, &len );
2585 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2586 if (( ber_scanf( ber, /*{*/ "m", &cookie )) == LBER_ERROR ) {
2587 rs->sr_text = "Sync control : cookie decoding error";
2588 return LDAP_PROTOCOL_ERROR;
2590 tag = ber_peek_tag( ber, &len );
2592 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2593 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2594 rs->sr_text = "Sync control : rhint decoding error";
2595 return LDAP_PROTOCOL_ERROR;
2598 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2599 rs->sr_text = "Sync control : decoding error";
2600 return LDAP_PROTOCOL_ERROR;
2602 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2603 sr->sr_rhint = rhint;
2604 if (!BER_BVISNULL(&cookie)) {
2605 ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );
2606 slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx );
2607 if ( sr->sr_state.rid == -1 ) {
2608 rs->sr_text = "Sync control : cookie parsing error";
2609 return LDAP_PROTOCOL_ERROR;
2613 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2615 op->o_sync = ctrl->ldctl_iscritical
2616 ? SLAP_CONTROL_CRITICAL
2617 : SLAP_CONTROL_NONCRITICAL;
2619 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2621 return LDAP_SUCCESS;
2624 /* This overlay is set up for dynamic loading via moduleload. For static
2625 * configuration, you'll need to arrange for the slap_overinst to be
2626 * initialized and registered by some other function inside slapd.
2629 static slap_overinst syncprov;
2632 syncprov_initialize()
2636 rc = register_supported_control( LDAP_CONTROL_SYNC,
2637 SLAP_CTRL_SEARCH, NULL,
2638 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2639 if ( rc != LDAP_SUCCESS ) {
2640 Debug( LDAP_DEBUG_ANY,
2641 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2645 syncprov.on_bi.bi_type = "syncprov";
2646 syncprov.on_bi.bi_db_init = syncprov_db_init;
2647 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2648 syncprov.on_bi.bi_db_open = syncprov_db_open;
2649 syncprov.on_bi.bi_db_close = syncprov_db_close;
2651 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2652 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2654 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2655 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2656 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2657 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2658 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2659 syncprov.on_bi.bi_op_search = syncprov_op_search;
2660 syncprov.on_bi.bi_extended = syncprov_op_extended;
2661 syncprov.on_bi.bi_operational = syncprov_operational;
2663 syncprov.on_bi.bi_cf_ocs = spocs;
2665 generic_filter.f_desc = slap_schema.si_ad_objectClass;
2667 rc = config_register_schema( spcfg, spocs );
2668 if ( rc ) return rc;
2670 return overlay_register( &syncprov );
2673 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2675 init_module( int argc, char *argv[] )
2677 return syncprov_initialize();
2679 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2681 #endif /* defined(SLAPD_OVER_SYNCPROV) */