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 );
387 syncprov_findbase( Operation *op, fbase_cookie *fc )
389 opcookie *opc = op->o_callback->sc_private;
390 slap_overinst *on = opc->son;
392 /* Use basic parameters from syncrepl search, but use
393 * current op's threadctx / tmpmemctx
395 ldap_pvt_thread_mutex_lock( &fc->fss->s_mutex );
396 if ( fc->fss->s_flags & PS_FIND_BASE ) {
397 slap_callback cb = {0};
399 SlapReply frs = { REP_RESULT };
402 fc->fss->s_flags ^= PS_FIND_BASE;
403 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
405 fop = *fc->fss->s_op;
407 fop.o_hdr = op->o_hdr;
409 fop.o_time = op->o_time;
410 fop.o_tincr = op->o_tincr;
412 cb.sc_response = findbase_cb;
415 fop.o_sync_mode = 0; /* turn off sync mode */
416 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
417 fop.o_callback = &cb;
418 fop.o_tag = LDAP_REQ_SEARCH;
419 fop.ors_scope = LDAP_SCOPE_BASE;
420 fop.ors_limit = NULL;
422 fop.ors_tlimit = SLAP_NO_LIMIT;
423 fop.ors_attrs = slap_anlist_no_attrs;
424 fop.ors_attrsonly = 1;
426 fop.o_bd->bd_info = on->on_info->oi_orig;
427 rc = fop.o_bd->be_search( &fop, &frs );
428 fop.o_bd->bd_info = (BackendInfo *)on;
430 ldap_pvt_thread_mutex_unlock( &fc->fss->s_mutex );
434 /* After the first call, see if the fdn resides in the scope */
435 if ( fc->fbase == 1 ) {
436 switch ( fc->fss->s_op->ors_scope ) {
437 case LDAP_SCOPE_BASE:
438 fc->fscope = dn_match( fc->fdn, &fc->fss->s_base );
440 case LDAP_SCOPE_ONELEVEL: {
442 dnParent( fc->fdn, &pdn );
443 fc->fscope = dn_match( &pdn, &fc->fss->s_base );
445 case LDAP_SCOPE_SUBTREE:
446 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base );
448 #ifdef LDAP_SCOPE_SUBORDINATE
449 case LDAP_SCOPE_SUBORDINATE:
450 fc->fscope = dnIsSuffix( fc->fdn, &fc->fss->s_base ) &&
451 !dn_match( fc->fdn, &fc->fss->s_base );
460 /* If entryID has changed, then the base of this search has
461 * changed. Invalidate the psearch.
463 return LDAP_NO_SUCH_OBJECT;
467 * This function has three different purposes, but they all use a search
468 * that filters on entryCSN so they're combined here.
469 * 1: at startup time, after a contextCSN has been read from the database,
470 * we search for all entries with CSN >= contextCSN in case the contextCSN
471 * was not checkpointed at the previous shutdown.
473 * 2: when the current contextCSN is known and we have a sync cookie, we search
474 * for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.
475 * If an entry is found, the cookie CSN is valid, otherwise it is stale.
477 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
478 * CSN, and generate Present records for them. We always collect this result
479 * in SyncID sets, even if there's only one match.
481 #define FIND_MAXCSN 1
483 #define FIND_PRESENT 3
486 findmax_cb( Operation *op, SlapReply *rs )
488 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
489 struct berval *maxcsn = op->o_callback->sc_private;
490 Attribute *a = attr_find( rs->sr_entry->e_attrs,
491 slap_schema.si_ad_entryCSN );
493 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
494 maxcsn->bv_len = a->a_vals[0].bv_len;
495 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
502 findcsn_cb( Operation *op, SlapReply *rs )
504 slap_callback *sc = op->o_callback;
506 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
507 sc->sc_private = (void *)1;
512 /* Build a list of entryUUIDs for sending in a SyncID set */
516 typedef struct fpres_cookie {
523 findpres_cb( Operation *op, SlapReply *rs )
525 slap_callback *sc = op->o_callback;
526 fpres_cookie *pc = sc->sc_private;
528 int ret = SLAP_CB_CONTINUE;
530 switch ( rs->sr_type ) {
532 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
534 pc->uuids[pc->num].bv_val = pc->last;
535 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
536 pc->uuids[pc->num].bv_len );
538 pc->last = pc->uuids[pc->num].bv_val;
539 pc->uuids[pc->num].bv_val = NULL;
542 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
548 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
550 pc->uuids[pc->num].bv_val = pc->last;
552 pc->last = pc->uuids[0].bv_val;
562 syncprov_findcsn( Operation *op, int mode )
564 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
565 syncprov_info_t *si = on->on_bi.bi_private;
567 slap_callback cb = {0};
569 SlapReply frs = { REP_RESULT };
570 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
571 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
572 struct berval maxcsn;
574 #ifdef LDAP_COMP_MATCH
575 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
577 AttributeAssertion eq = { NULL, BER_BVNULL };
579 int i, rc = LDAP_SUCCESS;
580 fpres_cookie pcookie;
581 sync_control *srs = NULL;
582 int findcsn_retry = 1;
584 if ( mode != FIND_MAXCSN ) {
585 srs = op->o_controls[slap_cids.sc_LDAPsync];
587 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
593 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
594 /* We want pure entries, not referrals */
595 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
598 cf.f_av_desc = slap_schema.si_ad_entryCSN;
601 fop.o_callback = &cb;
602 fop.ors_limit = NULL;
603 fop.ors_tlimit = SLAP_NO_LIMIT;
604 fop.ors_filter = &cf;
605 fop.ors_filterstr.bv_val = buf;
610 cf.f_choice = LDAP_FILTER_GE;
611 cf.f_av_value = si->si_ctxcsn;
612 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
613 cf.f_av_value.bv_val );
614 fop.ors_attrsonly = 0;
615 fop.ors_attrs = csn_anlist;
616 fop.ors_slimit = SLAP_NO_LIMIT;
617 cb.sc_private = &maxcsn;
618 cb.sc_response = findmax_cb;
619 strcpy( cbuf, si->si_ctxcsn.bv_val );
620 maxcsn.bv_val = cbuf;
621 maxcsn.bv_len = si->si_ctxcsn.bv_len;
624 cf.f_av_value = srs->sr_state.ctxcsn;
625 /* Look for exact match the first time */
626 if ( findcsn_retry ) {
627 cf.f_choice = LDAP_FILTER_EQUALITY;
628 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN=%s)",
629 cf.f_av_value.bv_val );
630 /* On retry, look for <= */
632 cf.f_choice = LDAP_FILTER_LE;
633 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
634 cf.f_av_value.bv_val );
636 fop.ors_attrsonly = 1;
637 fop.ors_attrs = slap_anlist_no_attrs;
639 cb.sc_private = NULL;
640 cb.sc_response = findcsn_cb;
643 af.f_choice = LDAP_FILTER_AND;
646 cf.f_choice = LDAP_FILTER_LE;
647 cf.f_av_value = srs->sr_state.ctxcsn;
648 cf.f_next = op->ors_filter;
649 fop.ors_filter = ⁡
650 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
651 fop.ors_attrsonly = 0;
652 fop.ors_attrs = uuid_anlist;
653 fop.ors_slimit = SLAP_NO_LIMIT;
654 cb.sc_private = &pcookie;
655 cb.sc_response = findpres_cb;
658 /* preallocate storage for a full set */
659 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
660 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
662 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
663 pcookie.uuids[0].bv_val = pcookie.last;
664 pcookie.uuids[0].bv_len = UUID_LEN;
665 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
666 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
667 pcookie.uuids[i].bv_len = UUID_LEN;
672 fop.o_bd->bd_info = on->on_info->oi_orig;
673 fop.o_bd->be_search( &fop, &frs );
674 fop.o_bd->bd_info = (BackendInfo *)on;
678 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
679 si->si_ctxcsn.bv_len = maxcsn.bv_len;
682 /* If matching CSN was not found, invalidate the context. */
683 if ( !cb.sc_private ) {
684 /* If we didn't find an exact match, then try for <= */
685 if ( findcsn_retry ) {
689 rc = LDAP_NO_SUCH_OBJECT;
693 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
694 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
702 syncprov_free_syncop( syncops *so )
704 syncres *sr, *srnext;
705 GroupAssertion *ga, *gnext;
707 ldap_pvt_thread_mutex_lock( &so->s_mutex );
708 if ( --so->s_inuse > 0 ) {
709 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
712 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
713 if ( so->s_flags & PS_IS_DETACHED ) {
714 filter_free( so->s_op->ors_filter );
715 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
721 ch_free( so->s_base.bv_val );
722 for ( sr=so->s_res; sr; sr=srnext ) {
726 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
730 /* Send a persistent search response */
732 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode)
734 slap_overinst *on = opc->son;
736 SlapReply rs = { REP_SEARCH };
737 LDAPControl *ctrls[2];
738 struct berval cookie;
740 Attribute a_uuid = {0};
742 if ( so->s_op->o_abandon )
743 return SLAPD_ABANDON;
746 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
748 e_uuid.e_attrs = &a_uuid;
749 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
750 a_uuid.a_nvals = &opc->suuid;
751 rs.sr_err = syncprov_state_ctrl( op, &rs, &e_uuid,
752 mode, ctrls, 0, 1, &cookie );
753 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
756 op->o_bd->bd_info = (BackendInfo *)on->on_info;
760 if ( rs.sr_entry->e_private )
761 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
762 if ( opc->sreference ) {
763 rs.sr_ref = get_entry_referrals( op, rs.sr_entry );
764 send_search_reference( op, &rs );
765 ber_bvarray_free( rs.sr_ref );
771 case LDAP_SYNC_MODIFY:
773 if ( rs.sr_entry->e_private )
774 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
775 rs.sr_attrs = op->ors_attrs;
776 send_search_entry( op, &rs );
780 case LDAP_SYNC_DELETE:
781 e_uuid.e_attrs = NULL;
782 e_uuid.e_name = opc->sdn;
783 e_uuid.e_nname = opc->sndn;
784 rs.sr_entry = &e_uuid;
785 if ( opc->sreference ) {
786 struct berval bv = BER_BVNULL;
788 send_search_reference( op, &rs );
790 send_search_entry( op, &rs );
796 /* In case someone else freed it already? */
798 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
805 /* Play back queued responses */
807 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
815 op->o_bd->bd_info = (BackendInfo *)on->on_info;
818 ldap_pvt_thread_mutex_lock( &so->s_mutex );
821 so->s_res = sr->s_next;
823 so->s_restail = NULL;
824 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
826 if ( !sr || so->s_op->o_abandon )
830 opc.sndn = sr->s_ndn;
831 opc.suuid = sr->s_uuid;
832 opc.sctxcsn = sr->s_csn;
833 opc.sreference = sr->s_isreference;
836 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
837 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
843 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode );
846 be_entry_release_rw( op, e, 0 );
854 op->o_bd->bd_info = (BackendInfo *)on;
858 /* runqueue task for playing back queued responses */
860 syncprov_qtask( void *ctx, void *arg )
862 struct re_s *rtask = arg;
863 syncops *so = rtask->arg;
864 slap_overinst *on = so->s_op->o_private;
865 OperationBuffer opbuf;
869 op = (Operation *) &opbuf;
871 op->o_hdr = (Opheader *)(op+1);
872 op->o_controls = (void **)(op->o_hdr+1);
873 memset( op->o_controls, 0, SLAP_MAX_CIDS * sizeof(void *));
875 *op->o_hdr = *so->s_op->o_hdr;
877 op->o_tmpmemctx = slap_sl_mem_create(SLAP_SLAB_SIZE, SLAP_SLAB_STACK, ctx);
878 op->o_tmpmfuncs = &slap_sl_mfuncs;
879 op->o_threadctx = ctx;
881 /* syncprov_qplay expects a fake db */
882 be = *so->s_op->o_bd;
883 be.be_flags |= SLAP_DBFLAG_OVERLAY;
885 op->o_private = NULL;
886 op->o_callback = NULL;
888 syncprov_qplay( op, on, so );
890 /* decrement use count... */
891 syncprov_free_syncop( so );
893 /* wait until we get explicitly scheduled again */
894 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
895 ldap_pvt_runqueue_stoptask( &slapd_rq, so->s_qtask );
896 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 1 );
897 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
902 /* Queue a persistent search response */
904 syncprov_qresp( opcookie *opc, syncops *so, int mode )
908 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
909 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
911 sr->s_dn.bv_val = (char *)(sr + 1);
912 sr->s_dn.bv_len = opc->sdn.bv_len;
914 sr->s_isreference = opc->sreference;
915 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val,
916 opc->sdn.bv_val ) + 1;
917 sr->s_ndn.bv_len = opc->sndn.bv_len;
918 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val,
919 opc->sndn.bv_val ) + 1;
920 sr->s_uuid.bv_len = opc->suuid.bv_len;
921 AC_MEMCPY( sr->s_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
922 sr->s_csn.bv_val = sr->s_uuid.bv_val + sr->s_uuid.bv_len + 1;
923 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
924 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
926 ldap_pvt_thread_mutex_lock( &so->s_mutex );
930 so->s_restail->s_next = sr;
934 /* If the base of the psearch was modified, check it next time round */
935 if ( so->s_flags & PS_WROTE_BASE ) {
936 so->s_flags ^= PS_WROTE_BASE;
937 so->s_flags |= PS_FIND_BASE;
939 if ( so->s_flags & PS_IS_DETACHED ) {
940 ldap_pvt_thread_mutex_lock( &slapd_rq.rq_mutex );
941 if ( !so->s_qtask ) {
942 so->s_qtask = ldap_pvt_runqueue_insert( &slapd_rq, RUNQ_INTERVAL,
943 syncprov_qtask, so, "syncprov_qtask",
944 so->s_op->o_conn->c_peer_name.bv_val );
947 if (!ldap_pvt_runqueue_isrunning( &slapd_rq, so->s_qtask ) &&
948 !so->s_qtask->next_sched.tv_sec ) {
949 so->s_qtask->interval.tv_sec = 0;
950 ldap_pvt_runqueue_resched( &slapd_rq, so->s_qtask, 0 );
951 so->s_qtask->interval.tv_sec = RUNQ_INTERVAL;
955 ldap_pvt_thread_mutex_unlock( &slapd_rq.rq_mutex );
957 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
962 syncprov_drop_psearch( syncops *so, int lock )
964 if ( so->s_flags & PS_IS_DETACHED ) {
966 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
967 so->s_op->o_conn->c_n_ops_executing--;
968 so->s_op->o_conn->c_n_ops_completed++;
969 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
972 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
974 syncprov_free_syncop( so );
980 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
982 slap_callback *sc = op->o_callback;
983 op->o_callback = sc->sc_next;
984 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
985 op->o_tmpfree( sc, op->o_tmpmemctx );
990 syncprov_op_abandon( Operation *op, SlapReply *rs )
992 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
993 syncprov_info_t *si = on->on_bi.bi_private;
994 syncops *so, *soprev;
996 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
997 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
998 soprev=so, so=so->s_next ) {
999 if ( so->s_op->o_connid == op->o_connid &&
1000 so->s_op->o_msgid == op->orn_msgid ) {
1001 so->s_op->o_abandon = 1;
1002 soprev->s_next = so->s_next;
1006 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1008 /* Is this really a Cancel exop? */
1009 if ( op->o_tag != LDAP_REQ_ABANDON ) {
1010 so->s_op->o_cancel = SLAP_CANCEL_ACK;
1011 rs->sr_err = LDAP_CANCELLED;
1012 send_ldap_result( so->s_op, rs );
1013 if ( so->s_flags & PS_IS_DETACHED ) {
1015 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
1016 cb->sc_cleanup = syncprov_ab_cleanup;
1017 cb->sc_next = op->o_callback;
1018 cb->sc_private = so;
1019 return SLAP_CB_CONTINUE;
1022 syncprov_drop_psearch( so, 0 );
1024 return SLAP_CB_CONTINUE;
1027 /* Find which persistent searches are affected by this operation */
1029 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
1031 slap_overinst *on = opc->son;
1032 syncprov_info_t *si = on->on_bi.bi_private;
1035 syncops *ss, *sprev, *snext;
1039 struct berval newdn;
1042 fc.fdn = &op->o_req_ndn;
1043 /* compute new DN */
1044 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1046 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
1047 else dnParent( fc.fdn, &pdn );
1048 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
1052 if ( op->o_tag != LDAP_REQ_ADD ) {
1053 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1054 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
1055 /* If we're sending responses now, make a copy and unlock the DB */
1056 if ( e && !saveit ) {
1057 Entry *e2 = entry_dup( e );
1058 be_entry_release_rw( op, e, 0 );
1061 op->o_bd->bd_info = (BackendInfo *)on;
1067 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1068 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1069 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1070 opc->sreference = is_entry_referral( e );
1071 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1073 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1074 } else if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
1075 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1076 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1077 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1078 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1081 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1082 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1083 sprev = ss, ss=snext)
1094 /* If the base of the search is missing, signal a refresh */
1095 rc = syncprov_findbase( op, &fc );
1096 if ( rc != LDAP_SUCCESS ) {
1097 SlapReply rs = {REP_RESULT};
1098 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1099 "search base has changed" );
1100 sprev->s_next = snext;
1101 syncprov_drop_psearch( ss, 1 );
1107 /* If we're sending results now, look for this op in old matches */
1111 /* Did we modify the search base? */
1112 if ( dn_match( &op->o_req_ndn, &ss->s_base )) {
1113 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1114 ss->s_flags |= PS_WROTE_BASE;
1115 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1118 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1119 old=sm, sm=sm->sm_next ) {
1120 if ( sm->sm_op == ss ) {
1122 old->sm_next = sm->sm_next;
1123 op->o_tmpfree( sm, op->o_tmpmemctx );
1129 /* check if current o_req_dn is in scope and matches filter */
1130 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1131 LDAP_COMPARE_TRUE ) {
1133 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1134 sm->sm_next = opc->smatches;
1136 ldap_pvt_thread_mutex_lock( &ss->s_mutex );
1138 ldap_pvt_thread_mutex_unlock( &ss->s_mutex );
1141 /* if found send UPDATE else send ADD */
1142 syncprov_qresp( opc, ss,
1143 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD );
1145 } else if ( !saveit && found ) {
1147 syncprov_qresp( opc, ss, LDAP_SYNC_DELETE );
1150 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1152 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1153 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1154 be_entry_release_rw( op, e, 0 );
1155 op->o_bd->bd_info = (BackendInfo *)on;
1158 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1163 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1165 slap_callback *cb = op->o_callback;
1166 opcookie *opc = cb->sc_private;
1167 slap_overinst *on = opc->son;
1168 syncprov_info_t *si = on->on_bi.bi_private;
1169 syncmatches *sm, *snext;
1170 modtarget *mt, mtdummy;
1172 for (sm = opc->smatches; sm; sm=snext) {
1173 snext = sm->sm_next;
1174 syncprov_free_syncop( sm->sm_op );
1175 op->o_tmpfree( sm, op->o_tmpmemctx );
1178 /* Remove op from lock table */
1180 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1181 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1183 modinst *mi = mt->mt_mods;
1185 /* If there are more, promote the next one */
1186 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1187 if ( mi->mi_next ) {
1188 mt->mt_mods = mi->mi_next;
1189 mt->mt_op = mt->mt_mods->mi_op;
1190 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1192 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1193 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1194 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1198 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1199 if ( !BER_BVISNULL( &opc->suuid ))
1200 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1201 if ( !BER_BVISNULL( &opc->sndn ))
1202 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1203 if ( !BER_BVISNULL( &opc->sdn ))
1204 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1205 op->o_callback = cb->sc_next;
1206 op->o_tmpfree(cb, op->o_tmpmemctx);
1212 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1214 syncprov_info_t *si = on->on_bi.bi_private;
1217 struct berval bv[2];
1218 slap_callback cb = {0};
1219 int manage = get_manageDSAit(op);
1221 mod.sml_values = bv;
1222 bv[1].bv_val = NULL;
1223 bv[0] = si->si_ctxcsn;
1224 mod.sml_nvalues = NULL;
1225 mod.sml_desc = slap_schema.si_ad_contextCSN;
1226 mod.sml_op = LDAP_MOD_REPLACE;
1228 mod.sml_next = NULL;
1230 cb.sc_response = slap_null_cb;
1232 opm.o_tag = LDAP_REQ_MODIFY;
1233 opm.o_callback = &cb;
1234 opm.orm_modlist = &mod;
1235 opm.o_req_dn = op->o_bd->be_suffix[0];
1236 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1237 opm.o_bd->bd_info = on->on_info->oi_orig;
1238 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1239 opm.o_bd->be_modify( &opm, rs );
1240 opm.o_managedsait = manage;
1244 syncprov_add_slog( Operation *op, struct berval *csn )
1246 opcookie *opc = op->o_callback->sc_private;
1247 slap_overinst *on = opc->son;
1248 syncprov_info_t *si = on->on_bi.bi_private;
1254 /* Allocate a record. UUIDs are not NUL-terminated. */
1255 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1258 se->se_tag = op->o_tag;
1260 se->se_uuid.bv_val = (char *)(se+1);
1261 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1262 se->se_uuid.bv_len = opc->suuid.bv_len;
1264 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
1265 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1266 se->se_csn.bv_val[csn->bv_len] = '\0';
1267 se->se_csn.bv_len = csn->bv_len;
1269 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1270 if ( sl->sl_head ) {
1271 sl->sl_tail->se_next = se;
1277 while ( sl->sl_num > sl->sl_size ) {
1279 sl->sl_head = se->se_next;
1280 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1281 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1284 if ( !sl->sl_head ) {
1288 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1292 /* Just set a flag if we found the matching entry */
1294 playlog_cb( Operation *op, SlapReply *rs )
1296 if ( rs->sr_type == REP_SEARCH ) {
1297 op->o_callback->sc_private = (void *)1;
1302 /* enter with sl->sl_mutex locked, release before returning */
1304 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1305 struct berval *oldcsn, struct berval *ctxcsn )
1307 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1309 int i, j, ndel, num, nmods, mmods;
1312 if ( !sl->sl_num ) {
1313 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1321 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1322 num * UUID_LEN, op->o_tmpmemctx );
1324 uuids[0].bv_val = (char *)(uuids + num + 1);
1326 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1327 * and everything else at the end. Do this first so we can
1328 * unlock the list mutex.
1330 for ( se=sl->sl_head; se; se=se->se_next ) {
1331 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1332 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1333 if ( se->se_tag == LDAP_REQ_DELETE ) {
1340 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1341 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1342 uuids[j].bv_len = UUID_LEN;
1344 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1348 /* Zero out unused slots */
1349 for ( i=ndel; i < num - nmods; i++ )
1350 uuids[i].bv_len = 0;
1352 /* Mods must be validated to see if they belong in this delete set.
1356 /* Strip any duplicates */
1357 for ( i=0; i<nmods; i++ ) {
1358 for ( j=0; j<ndel; j++ ) {
1359 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1360 uuids[num - 1 - i].bv_len = 0;
1365 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1366 for ( j=0; j<i; j++ ) {
1367 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1368 uuids[num - 1 - i].bv_len = 0;
1377 SlapReply frs = { REP_RESULT };
1380 #ifdef LDAP_COMP_MATCH
1381 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1383 AttributeAssertion eq;
1385 slap_callback cb = {0};
1389 fop.o_sync_mode = 0;
1390 fop.o_callback = &cb;
1391 fop.ors_limit = NULL;
1392 fop.ors_tlimit = SLAP_NO_LIMIT;
1393 fop.ors_attrs = slap_anlist_all_attributes;
1394 fop.ors_attrsonly = 0;
1395 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1397 af.f_choice = LDAP_FILTER_AND;
1400 mf.f_choice = LDAP_FILTER_EQUALITY;
1402 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1403 mf.f_next = fop.ors_filter;
1405 fop.ors_filter = ⁡
1407 cb.sc_response = playlog_cb;
1408 fop.o_bd->bd_info = on->on_info->oi_orig;
1410 for ( i=ndel; i<num; i++ ) {
1411 if ( uuids[i].bv_len == 0 ) continue;
1413 mf.f_av_value = uuids[i];
1414 cb.sc_private = NULL;
1416 rc = fop.o_bd->be_search( &fop, &frs );
1418 /* If entry was not found, add to delete list */
1419 if ( !cb.sc_private ) {
1420 uuids[ndel++] = uuids[i];
1423 fop.o_bd->bd_info = (BackendInfo *)on;
1426 uuids[ndel].bv_val = NULL;
1427 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1432 syncprov_op_response( Operation *op, SlapReply *rs )
1434 opcookie *opc = op->o_callback->sc_private;
1435 slap_overinst *on = opc->son;
1436 syncprov_info_t *si = on->on_bi.bi_private;
1439 if ( rs->sr_err == LDAP_SUCCESS )
1441 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1442 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1444 /* Update our context CSN */
1446 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1447 slap_get_commit_csn( op, &maxcsn, &curcsn );
1448 if ( !BER_BVISNULL( &maxcsn ) ) {
1449 strcpy( cbuf, maxcsn.bv_val );
1450 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1451 strcpy( si->si_ctxcsnbuf, cbuf );
1452 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1456 /* Don't do any processing for consumer contextCSN updates */
1457 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1458 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1459 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1460 return SLAP_CB_CONTINUE;
1464 if ( si->si_chkops || si->si_chktime ) {
1466 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1470 if ( si->si_chktime &&
1471 (op->o_time - si->si_chklast >= si->si_chktime )) {
1473 si->si_chklast = op->o_time;
1476 syncprov_checkpoint( op, rs, on );
1479 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1481 opc->sctxcsn.bv_len = maxcsn.bv_len;
1482 opc->sctxcsn.bv_val = cbuf;
1484 /* Handle any persistent searches */
1488 case LDAP_REQ_MODIFY:
1489 case LDAP_REQ_MODRDN:
1490 case LDAP_REQ_EXTENDED:
1491 syncprov_matchops( op, opc, 0 );
1493 case LDAP_REQ_DELETE:
1494 /* for each match in opc->smatches:
1497 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1498 if ( sm->sm_op->s_op->o_abandon )
1500 syncprov_qresp( opc, sm->sm_op, LDAP_SYNC_DELETE );
1506 /* Add any log records */
1507 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1508 syncprov_add_slog( op, &curcsn );
1512 return SLAP_CB_CONTINUE;
1515 /* We don't use a subentry to store the context CSN any more.
1516 * We expose the current context CSN as an operational attribute
1517 * of the suffix entry.
1520 syncprov_op_compare( Operation *op, SlapReply *rs )
1522 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1523 syncprov_info_t *si = on->on_bi.bi_private;
1524 int rc = SLAP_CB_CONTINUE;
1526 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1527 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1531 struct berval bv[2];
1533 e.e_name = op->o_bd->be_suffix[0];
1534 e.e_nname = op->o_bd->be_nsuffix[0];
1536 BER_BVZERO( &bv[1] );
1537 bv[0] = si->si_ctxcsn;
1539 a.a_desc = slap_schema.si_ad_contextCSN;
1541 a.a_nvals = a.a_vals;
1543 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1545 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1546 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1547 if ( ! rs->sr_err ) {
1548 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1549 goto return_results;
1552 if ( get_assert( op ) &&
1553 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1555 rs->sr_err = LDAP_ASSERTION_FAILED;
1556 goto return_results;
1560 rs->sr_err = LDAP_COMPARE_FALSE;
1562 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1563 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1564 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1565 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1567 rs->sr_err = LDAP_COMPARE_TRUE;
1572 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1574 send_ldap_result( op, rs );
1576 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1577 rs->sr_err = LDAP_SUCCESS;
1586 syncprov_op_mod( Operation *op, SlapReply *rs )
1588 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1589 syncprov_info_t *si = on->on_bi.bi_private;
1591 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1593 (si->si_ops ? sizeof(modinst) : 0 ),
1595 opcookie *opc = (opcookie *)(cb+1);
1597 cb->sc_response = syncprov_op_response;
1598 cb->sc_cleanup = syncprov_op_cleanup;
1599 cb->sc_private = opc;
1600 cb->sc_next = op->o_callback;
1601 op->o_callback = cb;
1603 /* If there are active persistent searches, lock this operation.
1604 * See seqmod.c for the locking logic on its own.
1607 modtarget *mt, mtdummy;
1610 mi = (modinst *)(opc+1);
1613 /* See if we're already modifying this entry... */
1615 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1616 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1618 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1619 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1620 mt->mt_tail->mi_next = mi;
1622 /* wait for this op to get to head of list */
1623 while ( mt->mt_mods != mi ) {
1624 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1625 ldap_pvt_thread_yield();
1626 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1628 /* clean up if the caller is giving up */
1629 if ( op->o_abandon ) {
1631 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1633 m2->mi_next = mi->mi_next;
1634 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1635 op->o_tmpfree( cb, op->o_tmpmemctx );
1636 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1637 return SLAPD_ABANDON;
1640 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1642 /* Record that we're modifying this entry now */
1643 mt = ch_malloc( sizeof(modtarget) );
1646 mt->mt_op = mi->mi_op;
1647 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1648 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1649 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1653 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1654 syncprov_matchops( op, opc, 1 );
1656 return SLAP_CB_CONTINUE;
1660 syncprov_op_extended( Operation *op, SlapReply *rs )
1662 if ( exop_is_write( op ))
1663 return syncprov_op_mod( op, rs );
1665 return SLAP_CB_CONTINUE;
1668 typedef struct searchstate {
1669 slap_overinst *ss_on;
1672 struct berval ss_ctxcsn;
1673 char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1677 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1679 if ( rs->sr_ctrls ) {
1680 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1681 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1682 rs->sr_ctrls = NULL;
1688 syncprov_detach_op( Operation *op, syncops *so, slap_overinst *on )
1694 GroupAssertion *g1, *g2;
1696 /* count the search attrs */
1697 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1698 alen += op->ors_attrs[i].an_name.bv_len + 1;
1700 /* Make a new copy of the operation */
1701 size = sizeof(Operation) + sizeof(Opheader) +
1702 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1703 op->o_req_dn.bv_len + 1 +
1704 op->o_req_ndn.bv_len + 1 +
1705 op->o_ndn.bv_len + 1 +
1706 so->s_filterstr.bv_len + 1;
1707 op2 = (Operation *)ch_calloc( 1, size );
1708 op2->o_hdr = (Opheader *)(op2+1);
1710 /* Copy the fields we care about explicitly, leave the rest alone */
1711 *op2->o_hdr = *op->o_hdr;
1712 op2->o_tag = op->o_tag;
1713 op2->o_time = op->o_time;
1714 op2->o_bd = on->on_info->oi_origdb;
1715 op2->o_request = op->o_request;
1716 op2->o_private = on;
1719 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1720 ptr = (char *)(op2->ors_attrs+i+1);
1721 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1722 op2->ors_attrs[i] = op->ors_attrs[i];
1723 op2->ors_attrs[i].an_name.bv_val = ptr;
1724 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1726 BER_BVZERO( &op2->ors_attrs[i].an_name );
1728 ptr = (char *)(op2->o_hdr + 1);
1730 op2->o_authz = op->o_authz;
1731 op2->o_ndn.bv_val = ptr;
1732 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1733 op2->o_dn = op2->o_ndn;
1734 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1735 op2->o_req_dn.bv_val = ptr;
1736 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1737 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1738 op2->o_req_ndn.bv_val = ptr;
1739 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1740 op2->ors_filterstr.bv_val = ptr;
1741 strcpy( ptr, so->s_filterstr.bv_val );
1742 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1743 op2->ors_filter = str2filter( ptr );
1746 /* Copy any cached group ACLs individually */
1747 op2->o_groups = NULL;
1748 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1749 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1751 strcpy( g2->ga_ndn, g1->ga_ndn );
1752 g2->ga_next = op2->o_groups;
1755 /* Don't allow any further group caching */
1756 op2->o_do_not_cache = 1;
1758 /* Add op2 to conn so abandon will find us */
1759 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1760 op->o_conn->c_n_ops_executing++;
1761 op->o_conn->c_n_ops_completed--;
1762 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1763 so->s_flags |= PS_IS_DETACHED;
1764 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1768 syncprov_search_response( Operation *op, SlapReply *rs )
1770 searchstate *ss = op->o_callback->sc_private;
1771 slap_overinst *on = ss->ss_on;
1772 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1774 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1776 /* If we got a referral without a referral object, there's
1777 * something missing that we cannot replicate. Just ignore it.
1778 * The consumer will abort because we didn't send the expected
1781 if ( !rs->sr_entry ) {
1782 assert( rs->sr_entry != NULL );
1783 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1784 return SLAP_CB_CONTINUE;
1786 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );
1788 /* Make sure entry is less than the snaphot'd contextCSN */
1789 if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 )
1790 return LDAP_SUCCESS;
1792 /* Don't send the ctx entry twice */
1793 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) &&
1794 bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1795 return LDAP_SUCCESS;
1797 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1799 rs->sr_ctrls[1] = NULL;
1800 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1801 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1802 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1803 struct berval cookie;
1805 slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn,
1806 srs->sr_state.rid );
1808 /* Is this a regular refresh? */
1810 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1812 rs->sr_ctrls[1] = NULL;
1813 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1814 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1815 LDAP_SYNC_REFRESH_DELETES );
1816 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1818 /* It's RefreshAndPersist, transition to Persist phase */
1819 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1820 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1821 &cookie, 1, NULL, 0 );
1822 op->o_tmpfree( cookie.bv_val, op->o_tmpmemctx );
1824 /* Detach this Op from frontend control */
1825 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1827 /* Turn off the refreshing flag */
1828 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1830 syncprov_detach_op( op, ss->ss_so, on );
1831 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1833 return LDAP_SUCCESS;
1837 return SLAP_CB_CONTINUE;
1841 syncprov_op_search( Operation *op, SlapReply *rs )
1843 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1844 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1846 int gotstate = 0, nochange = 0, do_present;
1847 syncops *sop = NULL;
1850 struct berval ctxcsn;
1851 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1853 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1855 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1856 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1860 do_present = si->si_nopres ? 0 : 1;
1862 srs = op->o_controls[slap_cids.sc_LDAPsync];
1863 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1865 /* If this is a persistent search, set it up right away */
1866 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1876 so.s_flags = PS_IS_REFRESHING | PS_FIND_BASE;
1877 /* syncprov_findbase expects to be called as a callback... */
1878 sc.sc_private = &opc;
1880 cb = op->o_callback;
1881 op->o_callback = ≻
1882 rs->sr_err = syncprov_findbase( op, &fc );
1883 op->o_callback = cb;
1885 if ( rs->sr_err != LDAP_SUCCESS ) {
1886 send_ldap_result( op, rs );
1889 sop = ch_malloc( sizeof( syncops ));
1891 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1892 sop->s_rid = srs->sr_state.rid;
1895 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1896 sop->s_next = si->si_ops;
1898 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1901 /* snapshot the ctxcsn */
1902 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1903 strcpy( csnbuf, si->si_ctxcsnbuf );
1904 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1905 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1906 ctxcsn.bv_val = csnbuf;
1908 /* If we have a cookie, handle the PRESENT lookups */
1909 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1912 /* The cookie was validated when it was parsed, just use it */
1914 /* If just Refreshing and nothing has changed, shortcut it */
1915 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1917 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1918 LDAPControl *ctrls[2];
1922 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1923 NULL, LDAP_SYNC_REFRESH_DELETES );
1924 rs->sr_ctrls = ctrls;
1925 rs->sr_err = LDAP_SUCCESS;
1926 send_ldap_result( op, rs );
1927 rs->sr_ctrls = NULL;
1932 /* Do we have a sessionlog for this search? */
1935 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1936 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1938 /* mutex is unlocked in playlog */
1939 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1941 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1944 /* Is the CSN still present in the database? */
1945 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1946 /* No, so a reload is required */
1947 /* the 2.2 consumer doesn't send this hint */
1948 if ( si->si_usehint && srs->sr_rhint == 0 ) {
1949 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1954 /* If changed and doing Present lookup, send Present UUIDs */
1955 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1957 send_ldap_result( op, rs );
1964 /* Append CSN range to search filter, save original filter
1965 * for persistent search evaluation
1968 sop->s_filterstr= op->ors_filterstr;
1971 /* If something changed, find the changes */
1972 if ( gotstate && !nochange ) {
1973 Filter *fand, *fava;
1975 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1976 fand->f_choice = LDAP_FILTER_AND;
1977 fand->f_next = NULL;
1978 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1980 fava->f_choice = LDAP_FILTER_GE;
1981 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1982 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1983 #ifdef LDAP_COMP_MATCH
1984 fava->f_ava->aa_cf = NULL;
1986 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1987 fava->f_next = op->ors_filter;
1988 op->ors_filter = fand;
1989 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1992 /* Let our callback add needed info to returned entries */
1993 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1994 ss = (searchstate *)(cb+1);
1997 ss->ss_present = do_present;
1998 ss->ss_ctxcsn.bv_len = ctxcsn.bv_len;
1999 ss->ss_ctxcsn.bv_val = ss->ss_csnbuf;
2000 strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val );
2001 cb->sc_response = syncprov_search_response;
2002 cb->sc_cleanup = syncprov_search_cleanup;
2003 cb->sc_private = ss;
2004 cb->sc_next = op->o_callback;
2005 op->o_callback = cb;
2007 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
2008 op->o_sync_mode &= SLAP_CONTROL_MASK;
2011 /* If this is a persistent search and no changes were reported during
2012 * the refresh phase, just invoke the response callback to transition
2013 * us into persist phase
2016 rs->sr_err = LDAP_SUCCESS;
2017 rs->sr_nentries = 0;
2018 send_ldap_result( op, rs );
2021 return SLAP_CB_CONTINUE;
2025 syncprov_operational(
2029 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
2030 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2032 if ( rs->sr_entry &&
2033 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
2035 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
2036 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
2037 Attribute *a, **ap = NULL;
2039 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
2040 if ( a->a_desc == slap_schema.si_ad_contextCSN )
2045 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
2047 a = ch_malloc( sizeof(Attribute));
2048 a->a_desc = slap_schema.si_ad_contextCSN;
2049 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
2050 a->a_vals[1].bv_val = NULL;
2051 a->a_nvals = a->a_vals;
2057 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
2059 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
2061 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
2063 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
2066 return SLAP_CB_CONTINUE;
2076 static ConfigDriver sp_cf_gen;
2078 static ConfigTable spcfg[] = {
2079 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2080 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2081 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2082 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2083 { "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2084 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2085 "DESC 'Session log size in ops' "
2086 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2087 { "syncprov-nopresent", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_NOPRES,
2088 sp_cf_gen, "( OLcfgOvAt:1.3 NAME 'olcSpNoPresent' "
2089 "DESC 'Omit Present phase processing' "
2090 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2091 { "syncprov-reloadhint", NULL, 2, 2, 0, ARG_ON_OFF|ARG_MAGIC|SP_USEHINT,
2092 sp_cf_gen, "( OLcfgOvAt:1.4 NAME 'olcSpReloadHint' "
2093 "DESC 'Observe Reload Hint in Request control' "
2094 "SYNTAX OMsBoolean SINGLE-VALUE )", NULL, NULL },
2095 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2098 static ConfigOCs spocs[] = {
2099 { "( OLcfgOvOc:1.1 "
2100 "NAME 'olcSyncProvConfig' "
2101 "DESC 'SyncRepl Provider configuration' "
2102 "SUP olcOverlayConfig "
2103 "MAY ( olcSpCheckpoint $ olcSpSessionlog $ olcSpNoPresent ) )",
2104 Cft_Overlay, spcfg },
2109 sp_cf_gen(ConfigArgs *c)
2111 slap_overinst *on = (slap_overinst *)c->bi;
2112 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2115 if ( c->op == SLAP_CONFIG_EMIT ) {
2116 switch ( c->type ) {
2118 if ( si->si_chkops || si->si_chktime ) {
2120 bv.bv_len = sprintf( c->msg, "%d %d",
2121 si->si_chkops, si->si_chktime );
2123 value_add_one( &c->rvalue_vals, &bv );
2129 if ( si->si_logs ) {
2130 c->value_int = si->si_logs->sl_size;
2136 if ( si->si_nopres ) {
2143 if ( si->si_usehint ) {
2151 } else if ( c->op == LDAP_MOD_DELETE ) {
2152 switch ( c->type ) {
2159 si->si_logs->sl_size = 0;
2161 rc = LDAP_NO_SUCH_ATTRIBUTE;
2164 if ( si->si_nopres )
2167 rc = LDAP_NO_SUCH_ATTRIBUTE;
2170 if ( si->si_usehint )
2173 rc = LDAP_NO_SUCH_ATTRIBUTE;
2178 switch ( c->type ) {
2180 si->si_chkops = atoi( c->argv[1] );
2181 si->si_chktime = atoi( c->argv[2] ) * 60;
2185 int size = c->value_int;
2188 sprintf( c->msg, "%s size %d is negative",
2190 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2191 return ARG_BAD_CONF;
2195 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2196 sl->sl_mincsn.bv_val = (char *)(sl+1);
2197 sl->sl_mincsn.bv_len = 0;
2199 sl->sl_head = sl->sl_tail = NULL;
2200 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2207 si->si_nopres = c->value_int;
2210 si->si_usehint = c->value_int;
2216 /* ITS#3456 we cannot run this search on the main thread, must use a
2217 * child thread in order to insure we have a big enough stack.
2224 syncprov_findcsn( ptr, FIND_MAXCSN );
2228 /* Read any existing contextCSN from the underlying db.
2229 * Then search for any entries newer than that. If no value exists,
2230 * just generate it. Cache whatever result.
2237 slap_overinst *on = (slap_overinst *) be->bd_info;
2238 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2241 OperationBuffer opbuf;
2242 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2243 Operation *op = (Operation *) &opbuf;
2247 void *thrctx = NULL;
2249 if ( slapMode & SLAP_TOOL_MODE ) {
2253 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2258 thrctx = ldap_pvt_thread_pool_context();
2259 connection_fake_init( &conn, op, thrctx );
2261 op->o_dn = be->be_rootdn;
2262 op->o_ndn = be->be_rootndn;
2264 ctxcsnbuf[0] = '\0';
2266 op->o_bd->bd_info = on->on_info->oi_orig;
2267 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2268 slap_schema.si_ad_contextCSN, 0, &e );
2271 ldap_pvt_thread_t tid;
2273 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2275 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2276 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2277 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2278 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2279 si->si_ctxcsn.bv_len );
2280 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2281 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2283 be_entry_release_rw( op, e, 0 );
2284 op->o_bd->bd_info = (BackendInfo *)on;
2285 op->o_req_dn = be->be_suffix[0];
2286 op->o_req_ndn = be->be_nsuffix[0];
2287 op->ors_scope = LDAP_SCOPE_SUBTREE;
2288 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2289 ldap_pvt_thread_join( tid, NULL );
2290 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2291 /* If we're also a consumer, and we didn't find the context entry,
2292 * then don't generate anything, wait for our provider to send it
2298 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2299 si->si_ctxcsn.bv_len = sizeof( si->si_ctxcsnbuf );
2300 slap_get_csn( op, &si->si_ctxcsn, 0 );
2303 /* If our ctxcsn is different from what was read from the root
2304 * entry, make sure we do a checkpoint on close
2306 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2311 op->o_bd->bd_info = (BackendInfo *)on;
2312 ldap_pvt_thread_pool_context_reset( thrctx );
2316 /* Write the current contextCSN into the underlying db.
2323 slap_overinst *on = (slap_overinst *) be->bd_info;
2324 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2326 if ( slapMode & SLAP_TOOL_MODE ) {
2329 if ( si->si_numops ) {
2331 OperationBuffer opbuf;
2332 Operation *op = (Operation *) &opbuf;
2333 SlapReply rs = {REP_RESULT};
2336 thrctx = ldap_pvt_thread_pool_context();
2337 connection_fake_init( &conn, op, thrctx );
2339 op->o_dn = be->be_rootdn;
2340 op->o_ndn = be->be_rootndn;
2341 syncprov_checkpoint( op, &rs, on );
2342 ldap_pvt_thread_pool_context_reset( thrctx );
2353 slap_overinst *on = (slap_overinst *)be->bd_info;
2354 syncprov_info_t *si;
2356 si = ch_calloc(1, sizeof(syncprov_info_t));
2357 on->on_bi.bi_private = si;
2358 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2359 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2360 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2361 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2363 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2364 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2365 csn_anlist[1].an_desc = slap_schema.si_ad_entryUUID;
2366 csn_anlist[1].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2368 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2369 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2375 syncprov_db_destroy(
2379 slap_overinst *on = (slap_overinst *)be->bd_info;
2380 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2383 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2384 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2385 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2392 static int syncprov_parseCtrl (
2398 BerElementBuffer berbuf;
2399 BerElement *ber = (BerElement *)&berbuf;
2402 struct berval cookie = BER_BVNULL;
2406 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2407 rs->sr_text = "Sync control specified multiple times";
2408 return LDAP_PROTOCOL_ERROR;
2411 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2412 rs->sr_text = "Sync control specified with pagedResults control";
2413 return LDAP_PROTOCOL_ERROR;
2416 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2417 rs->sr_text = "Sync control value is empty (or absent)";
2418 return LDAP_PROTOCOL_ERROR;
2421 /* Parse the control value
2422 * syncRequestValue ::= SEQUENCE {
2427 * refreshAndPersist (3)
2429 * cookie syncCookie OPTIONAL
2433 ber_init2( ber, &ctrl->ldctl_value, 0 );
2435 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2436 rs->sr_text = "Sync control : mode decoding error";
2437 return LDAP_PROTOCOL_ERROR;
2441 case LDAP_SYNC_REFRESH_ONLY:
2442 mode = SLAP_SYNC_REFRESH;
2444 case LDAP_SYNC_REFRESH_AND_PERSIST:
2445 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2448 rs->sr_text = "Sync control : unknown update mode";
2449 return LDAP_PROTOCOL_ERROR;
2452 tag = ber_peek_tag( ber, &len );
2454 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2455 if (( ber_scanf( ber, /*{*/ "m", &cookie )) == LBER_ERROR ) {
2456 rs->sr_text = "Sync control : cookie decoding error";
2457 return LDAP_PROTOCOL_ERROR;
2459 tag = ber_peek_tag( ber, &len );
2461 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2462 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2463 rs->sr_text = "Sync control : rhint decoding error";
2464 return LDAP_PROTOCOL_ERROR;
2467 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2468 rs->sr_text = "Sync control : decoding error";
2469 return LDAP_PROTOCOL_ERROR;
2471 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2472 sr->sr_rhint = rhint;
2473 if (!BER_BVISNULL(&cookie)) {
2474 ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );
2475 slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx );
2476 if ( sr->sr_state.rid == -1 ) {
2477 rs->sr_text = "Sync control : cookie parsing error";
2478 return LDAP_PROTOCOL_ERROR;
2482 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2484 op->o_sync = ctrl->ldctl_iscritical
2485 ? SLAP_CONTROL_CRITICAL
2486 : SLAP_CONTROL_NONCRITICAL;
2488 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2490 return LDAP_SUCCESS;
2493 /* This overlay is set up for dynamic loading via moduleload. For static
2494 * configuration, you'll need to arrange for the slap_overinst to be
2495 * initialized and registered by some other function inside slapd.
2498 static slap_overinst syncprov;
2505 rc = register_supported_control( LDAP_CONTROL_SYNC,
2506 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2507 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2508 if ( rc != LDAP_SUCCESS ) {
2509 Debug( LDAP_DEBUG_ANY,
2510 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2514 syncprov.on_bi.bi_type = "syncprov";
2515 syncprov.on_bi.bi_db_init = syncprov_db_init;
2516 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2517 syncprov.on_bi.bi_db_open = syncprov_db_open;
2518 syncprov.on_bi.bi_db_close = syncprov_db_close;
2520 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2521 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2523 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2524 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2525 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2526 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2527 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2528 syncprov.on_bi.bi_op_search = syncprov_op_search;
2529 syncprov.on_bi.bi_extended = syncprov_op_extended;
2530 syncprov.on_bi.bi_operational = syncprov_operational;
2532 syncprov.on_bi.bi_cf_ocs = spocs;
2534 rc = config_register_schema( spcfg, spocs );
2535 if ( rc ) return rc;
2537 return overlay_register( &syncprov );
2540 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2542 init_module( int argc, char *argv[] )
2544 return syncprov_init();
2546 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2548 #endif /* defined(SLAPD_OVER_SYNCPROV) */