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>
30 /* A modify request on a particular entry */
31 typedef struct modinst {
32 struct modinst *mi_next;
36 typedef struct modtarget {
37 struct modinst *mt_mods;
38 struct modinst *mt_tail;
40 ldap_pvt_thread_mutex_t mt_mutex;
43 /* A queued result of a persistent search */
44 typedef struct syncres {
45 struct syncres *s_next;
54 /* Record of a persistent search */
55 typedef struct syncops {
56 struct syncops *s_next;
57 struct berval s_base; /* ndn of search base */
58 ID s_eid; /* entryID of search base */
59 Operation *s_op; /* search op */
61 struct berval s_filterstr;
62 int s_flags; /* search status */
63 int s_inuse; /* reference count */
64 struct syncres *s_res;
65 struct syncres *s_restail;
66 ldap_pvt_thread_mutex_t s_mutex;
69 /* A received sync control */
70 typedef struct sync_control {
71 struct sync_cookie sr_state;
75 #if 0 /* moved back to slap.h */
76 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
78 /* o_sync_mode uses data bits of o_sync */
79 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
81 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
82 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
83 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
84 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
86 #define PS_IS_REFRESHING 0x01
87 #define PS_IS_DETACHED 0x02
89 /* Record of which searches matched at premodify step */
90 typedef struct syncmatches {
91 struct syncmatches *sm_next;
95 /* Session log data */
96 typedef struct slog_entry {
97 struct slog_entry *se_next;
98 struct berval se_uuid;
103 typedef struct sessionlog {
104 struct berval sl_mincsn;
109 ldap_pvt_thread_mutex_t sl_mutex;
112 /* The main state for this overlay */
113 typedef struct syncprov_info_t {
115 struct berval si_ctxcsn; /* ldapsync context */
116 int si_chkops; /* checkpointing info */
118 int si_numops; /* number of ops since last checkpoint */
119 time_t si_chklast; /* time of last checkpoint */
120 Avlnode *si_mods; /* entries being modified */
122 ldap_pvt_thread_mutex_t si_csn_mutex;
123 ldap_pvt_thread_mutex_t si_ops_mutex;
124 ldap_pvt_thread_mutex_t si_mods_mutex;
125 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
128 typedef struct opcookie {
130 syncmatches *smatches;
131 struct berval sdn; /* DN of entry, for deletes */
133 struct berval suuid; /* UUID of entry */
134 struct berval sctxcsn;
135 int sreference; /* Is the entry a reference? */
138 typedef struct fbase_cookie {
139 struct berval *fdn; /* DN of a modified entry, for scope testing */
140 syncops *fss; /* persistent search we're testing against */
141 int fbase; /* if TRUE we found the search base and it's still valid */
142 int fscope; /* if TRUE then fdn is within the psearch scope */
145 static AttributeName csn_anlist[2];
146 static AttributeName uuid_anlist[2];
148 /* Build a LDAPsync intermediate state control */
154 int entry_sync_state,
158 struct berval *cookie )
163 const char *text = NULL;
165 BerElementBuffer berbuf;
166 BerElement *ber = (BerElement *)&berbuf;
168 struct berval entryuuid_bv = BER_BVNULL;
170 ber_init2( ber, 0, LBER_USE_DER );
171 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
173 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
175 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
176 AttributeDescription *desc = a->a_desc;
177 if ( desc == slap_schema.si_ad_entryUUID ) {
178 entryuuid_bv = a->a_nvals[0];
183 if ( send_cookie && cookie ) {
184 ber_printf( ber, "{eOON}",
185 entry_sync_state, &entryuuid_bv, cookie );
187 ber_printf( ber, "{eON}",
188 entry_sync_state, &entryuuid_bv );
191 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
192 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
193 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
198 Debug( LDAP_DEBUG_TRACE,
199 "slap_build_sync_ctrl: ber_flatten2 failed\n",
201 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
208 /* Build a LDAPsync final state control */
216 struct berval *cookie,
220 BerElementBuffer berbuf;
221 BerElement *ber = (BerElement *)&berbuf;
223 ber_init2( ber, NULL, LBER_USE_DER );
224 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
226 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
228 ber_printf( ber, "{" );
229 if ( send_cookie && cookie ) {
230 ber_printf( ber, "O", cookie );
232 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
233 ber_printf( ber, "b", refreshDeletes );
235 ber_printf( ber, "N}" );
237 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
238 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
239 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
244 Debug( LDAP_DEBUG_TRACE,
245 "syncprov_done_ctrl: ber_flatten2 failed\n",
247 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
259 struct berval *cookie,
264 BerElementBuffer berbuf;
265 BerElement *ber = (BerElement *)&berbuf;
266 struct berval rspdata;
270 ber_init2( ber, NULL, LBER_USE_DER );
271 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
275 case LDAP_TAG_SYNC_NEW_COOKIE:
276 ber_printf( ber, "tO", type, cookie );
278 case LDAP_TAG_SYNC_REFRESH_DELETE:
279 case LDAP_TAG_SYNC_REFRESH_PRESENT:
280 ber_printf( ber, "t{", type );
282 ber_printf( ber, "O", cookie );
284 if ( refreshDone == 0 ) {
285 ber_printf( ber, "b", refreshDone );
287 ber_printf( ber, "N}" );
289 case LDAP_TAG_SYNC_ID_SET:
290 ber_printf( ber, "t{", type );
292 ber_printf( ber, "O", cookie );
294 if ( refreshDeletes == 1 ) {
295 ber_printf( ber, "b", refreshDeletes );
297 ber_printf( ber, "[W]", syncUUIDs );
298 ber_printf( ber, "N}" );
301 Debug( LDAP_DEBUG_TRACE,
302 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
308 ret = ber_flatten2( ber, &rspdata, 0 );
311 Debug( LDAP_DEBUG_TRACE,
312 "syncprov_sendinfo: ber_flatten2 failed\n",
314 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
318 rs->sr_rspoid = LDAP_SYNC_INFO;
319 rs->sr_rspdata = &rspdata;
320 send_ldap_intermediate( op, rs );
321 rs->sr_rspdata = NULL;
327 /* Find a modtarget in an AVL tree */
329 sp_avl_cmp( const void *c1, const void *c2 )
331 const modtarget *m1, *m2;
335 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
338 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
341 /* syncprov_findbase:
342 * finds the true DN of the base of a search (with alias dereferencing) and
343 * checks to make sure the base entry doesn't get replaced with a different
344 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
345 * change is detected, any persistent search on this base must be terminated /
347 * On the first call, we just save the DN and entryID. On subsequent calls
348 * we compare the DN and entryID with the saved values.
351 findbase_cb( Operation *op, SlapReply *rs )
353 slap_callback *sc = op->o_callback;
355 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
356 fbase_cookie *fc = sc->sc_private;
358 /* If no entryID, we're looking for the first time.
359 * Just store whatever we got.
361 if ( fc->fss->s_eid == NOID ) {
363 fc->fss->s_eid = rs->sr_entry->e_id;
364 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
366 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
367 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
369 /* OK, the DN is the same and the entryID is the same. Now
370 * see if the fdn resides in the scope.
373 switch ( fc->fss->s_op->ors_scope ) {
374 case LDAP_SCOPE_BASE:
375 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
377 case LDAP_SCOPE_ONELEVEL: {
379 dnParent( fc->fdn, &pdn );
380 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
382 case LDAP_SCOPE_SUBTREE:
383 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
385 #ifdef LDAP_SCOPE_SUBORDINATE
386 case LDAP_SCOPE_SUBORDINATE:
387 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
388 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
394 if ( rs->sr_err != LDAP_SUCCESS ) {
395 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
401 syncprov_findbase( Operation *op, fbase_cookie *fc )
403 opcookie *opc = op->o_callback->sc_private;
404 slap_overinst *on = opc->son;
405 syncprov_info_t *si = on->on_bi.bi_private;
407 slap_callback cb = {0};
409 SlapReply frs = { REP_RESULT };
414 cb.sc_response = findbase_cb;
417 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
418 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
419 fop.o_callback = &cb;
420 fop.o_tag = LDAP_REQ_SEARCH;
421 fop.ors_scope = LDAP_SCOPE_BASE;
422 fop.ors_deref = fc->fss->s_op->ors_deref;
423 fop.ors_limit = NULL;
425 fop.ors_tlimit = SLAP_NO_LIMIT;
426 fop.ors_attrs = slap_anlist_no_attrs;
427 fop.ors_attrsonly = 1;
428 fop.ors_filter = fc->fss->s_op->ors_filter;
429 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
431 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
433 fop.o_bd->bd_info = on->on_info->oi_orig;
434 rc = fop.o_bd->be_search( &fop, &frs );
435 fop.o_bd->bd_info = (BackendInfo *)on;
437 if ( fc->fbase ) return LDAP_SUCCESS;
439 /* If entryID has changed, then the base of this search has
440 * changed. Invalidate the psearch.
442 return LDAP_NO_SUCH_OBJECT;
446 * This function has three different purposes, but they all use a search
447 * that filters on entryCSN so they're combined here.
448 * 1: at startup time, after a contextCSN has been read from the database,
449 * we search for all entries with CSN >= contextCSN in case the contextCSN
450 * was not checkpointed at the previous shutdown.
452 * 2: when the current contextCSN is known and we have a sync cookie, we search
453 * for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
454 * entry is found, the cookie CSN is valid, otherwise it is stale.
456 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
457 * CSN, and generate Present records for them. We always collect this result
458 * in SyncID sets, even if there's only one match.
460 #define FIND_MAXCSN 1
462 #define FIND_PRESENT 3
465 findmax_cb( Operation *op, SlapReply *rs )
467 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
468 struct berval *maxcsn = op->o_callback->sc_private;
469 Attribute *a = attr_find( rs->sr_entry->e_attrs,
470 slap_schema.si_ad_entryCSN );
472 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
473 maxcsn->bv_len = a->a_vals[0].bv_len;
474 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
481 findcsn_cb( Operation *op, SlapReply *rs )
483 slap_callback *sc = op->o_callback;
485 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
486 sc->sc_private = (void *)1;
491 /* Build a list of entryUUIDs for sending in a SyncID set */
495 typedef struct fpres_cookie {
502 findpres_cb( Operation *op, SlapReply *rs )
504 slap_callback *sc = op->o_callback;
505 fpres_cookie *pc = sc->sc_private;
507 int ret = SLAP_CB_CONTINUE;
509 switch ( rs->sr_type ) {
511 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
513 pc->uuids[pc->num].bv_val = pc->last;
514 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
515 pc->uuids[pc->num].bv_len );
517 pc->last = pc->uuids[pc->num].bv_val;
518 pc->uuids[pc->num].bv_val = NULL;
521 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
527 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
529 pc->uuids[pc->num].bv_val = pc->last;
531 pc->last = pc->uuids[0].bv_val;
541 syncprov_findcsn( Operation *op, int mode )
543 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
544 syncprov_info_t *si = on->on_bi.bi_private;
546 slap_callback cb = {0};
548 SlapReply frs = { REP_RESULT };
549 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
550 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
551 struct berval maxcsn;
553 #ifdef LDAP_COMP_MATCH
554 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
556 AttributeAssertion eq = { NULL, BER_BVNULL };
558 int i, rc = LDAP_SUCCESS;
559 fpres_cookie pcookie;
560 sync_control *srs = NULL;
562 if ( mode != FIND_MAXCSN ) {
563 srs = op->o_controls[slap_cids.sc_LDAPsync];
565 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
571 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
572 /* We want pure entries, not referrals */
573 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
576 cf.f_av_desc = slap_schema.si_ad_entryCSN;
579 fop.o_callback = &cb;
580 fop.ors_limit = NULL;
581 fop.ors_tlimit = SLAP_NO_LIMIT;
582 fop.ors_filter = &cf;
583 fop.ors_filterstr.bv_val = buf;
587 cf.f_choice = LDAP_FILTER_GE;
588 cf.f_av_value = si->si_ctxcsn;
589 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
590 cf.f_av_value.bv_val );
591 fop.ors_attrsonly = 0;
592 fop.ors_attrs = csn_anlist;
593 fop.ors_slimit = SLAP_NO_LIMIT;
594 cb.sc_private = &maxcsn;
595 cb.sc_response = findmax_cb;
596 strcpy( cbuf, si->si_ctxcsn.bv_val );
597 maxcsn.bv_val = cbuf;
598 maxcsn.bv_len = si->si_ctxcsn.bv_len;
601 cf.f_choice = LDAP_FILTER_LE;
602 cf.f_av_value = srs->sr_state.ctxcsn;
603 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
604 cf.f_av_value.bv_val );
605 fop.ors_attrsonly = 1;
606 fop.ors_attrs = slap_anlist_no_attrs;
608 cb.sc_private = NULL;
609 cb.sc_response = findcsn_cb;
612 af.f_choice = LDAP_FILTER_AND;
615 cf.f_choice = LDAP_FILTER_LE;
616 cf.f_av_value = srs->sr_state.ctxcsn;
617 cf.f_next = op->ors_filter;
618 fop.ors_filter = ⁡
619 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
620 fop.ors_attrsonly = 0;
621 fop.ors_attrs = uuid_anlist;
622 fop.ors_slimit = SLAP_NO_LIMIT;
623 cb.sc_private = &pcookie;
624 cb.sc_response = findpres_cb;
627 /* preallocate storage for a full set */
628 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
629 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
631 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
632 pcookie.uuids[0].bv_val = pcookie.last;
633 pcookie.uuids[0].bv_len = UUID_LEN;
634 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
635 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
636 pcookie.uuids[i].bv_len = UUID_LEN;
641 fop.o_bd->bd_info = on->on_info->oi_orig;
642 fop.o_bd->be_search( &fop, &frs );
643 fop.o_bd->bd_info = (BackendInfo *)on;
647 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
648 si->si_ctxcsn.bv_len = maxcsn.bv_len;
651 /* If matching CSN was not found, invalidate the context. */
652 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
655 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
656 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
663 /* Queue a persistent search response */
665 syncprov_qresp( opcookie *opc, syncops *so, int mode )
669 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
670 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
672 sr->s_dn.bv_val = (char *)(sr + 1);
673 sr->s_dn.bv_len = opc->sdn.bv_len;
675 sr->s_isreference = opc->sreference;
676 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
677 sr->s_ndn.bv_len = opc->sndn.bv_len;
678 *(sr->s_ndn.bv_val++) = '\0';
679 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
680 sr->s_uuid.bv_len = opc->suuid.bv_len;
681 *(sr->s_uuid.bv_val++) = '\0';
682 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
683 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
684 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
689 so->s_restail->s_next = sr;
692 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
696 /* Play back queued responses */
698 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue );
701 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
703 syncres *sr, *srnext;
709 op->o_bd->bd_info = (BackendInfo *)on->on_info;
710 for (sr = so->s_res; sr; sr=srnext) {
713 opc.sndn = sr->s_ndn;
714 opc.suuid = sr->s_uuid;
715 opc.sctxcsn = sr->s_csn;
716 opc.sreference = sr->s_isreference;
719 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
720 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
727 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );
730 be_entry_release_rw( op, e, 0 );
738 op->o_bd->bd_info = (BackendInfo *)on;
740 so->s_restail = NULL;
744 /* Send a persistent search response */
746 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue )
748 slap_overinst *on = opc->son;
749 syncprov_info_t *si = on->on_bi.bi_private;
751 SlapReply rs = { REP_SEARCH };
752 LDAPControl *ctrls[2];
753 struct berval cookie;
755 Attribute a_uuid = {0};
756 Operation sop = *so->s_op;
759 if ( so->s_op->o_abandon )
760 return SLAPD_ABANDON;
764 sop.o_tmpmemctx = op->o_tmpmemctx;
766 sop.o_controls = op->o_controls;
767 sop.o_private = op->o_private;
769 /* If queueing is allowed */
771 ldap_pvt_thread_mutex_lock( &so->s_mutex );
772 /* If we're still in refresh mode, must queue */
773 if (so->s_flags & PS_IS_REFRESHING) {
774 return syncprov_qresp( opc, so, mode );
776 /* If connection is free but queue is non-empty,
777 * try to flush the queue.
780 rs.sr_err = syncprov_qplay( &sop, on, so );
782 /* If the connection is busy, must queue */
783 if ( sop.o_conn->c_writewaiter || rs.sr_err == LDAP_BUSY ) {
784 return syncprov_qresp( opc, so, mode );
786 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
788 /* If syncprov_qplay returned any other error, bail out. */
793 /* Queueing not allowed and conn is busy, give up */
794 if ( sop.o_conn->c_writewaiter )
799 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
801 e_uuid.e_attrs = &a_uuid;
802 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
803 a_uuid.a_nvals = &opc->suuid;
804 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
805 mode, ctrls, 0, 1, &cookie );
808 op->o_bd->bd_info = (BackendInfo *)on->on_info;
812 if ( rs.sr_entry->e_private )
813 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
814 if ( opc->sreference ) {
815 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
816 send_search_reference( &sop, &rs );
817 ber_bvarray_free( rs.sr_ref );
823 case LDAP_SYNC_MODIFY:
825 if ( rs.sr_entry->e_private )
826 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
827 rs.sr_attrs = sop.ors_attrs;
828 send_search_entry( &sop, &rs );
832 case LDAP_SYNC_DELETE:
833 e_uuid.e_attrs = NULL;
834 e_uuid.e_name = opc->sdn;
835 e_uuid.e_nname = opc->sndn;
836 rs.sr_entry = &e_uuid;
837 if ( opc->sreference ) {
838 struct berval bv = BER_BVNULL;
840 send_search_reference( &sop, &rs );
842 send_search_entry( &sop, &rs );
848 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
849 op->o_private = sop.o_private;
851 /* Check queue again here; if we were hanging in a send and eventually
852 * recovered, there may be more to send now. But don't check if the
853 * original psearch has been abandoned.
855 if ( so->s_op->o_abandon )
856 return SLAPD_ABANDON;
858 if ( rs.sr_err == LDAP_SUCCESS && queue && so->s_res ) {
859 ldap_pvt_thread_mutex_lock( &so->s_mutex );
860 rs.sr_err = syncprov_qplay( &sop, on, so );
861 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
867 syncprov_free_syncop( syncops *so )
869 syncres *sr, *srnext;
870 GroupAssertion *ga, *gnext;
872 ldap_pvt_thread_mutex_lock( &so->s_mutex );
874 if ( so->s_inuse > 0 ) {
875 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
878 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
879 if ( so->s_flags & PS_IS_DETACHED ) {
880 filter_free( so->s_op->ors_filter );
881 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
887 ch_free( so->s_base.bv_val );
888 for ( sr=so->s_res; sr; sr=srnext ) {
892 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
897 syncprov_drop_psearch( syncops *so, int lock )
899 if ( so->s_flags & PS_IS_DETACHED ) {
901 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
902 so->s_op->o_conn->c_n_ops_executing--;
903 so->s_op->o_conn->c_n_ops_completed++;
904 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
907 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
909 syncprov_free_syncop( so );
915 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
917 slap_callback *sc = op->o_callback;
918 op->o_callback = sc->sc_next;
919 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
920 op->o_tmpfree( sc, op->o_tmpmemctx );
925 syncprov_op_abandon( Operation *op, SlapReply *rs )
927 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
928 syncprov_info_t *si = on->on_bi.bi_private;
929 syncops *so, *soprev;
931 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
932 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
933 soprev=so, so=so->s_next ) {
934 if ( so->s_op->o_connid == op->o_connid &&
935 so->s_op->o_msgid == op->orn_msgid ) {
936 so->s_op->o_abandon = 1;
937 soprev->s_next = so->s_next;
941 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
943 /* Is this really a Cancel exop? */
944 if ( op->o_tag != LDAP_REQ_ABANDON ) {
945 so->s_op->o_cancel = SLAP_CANCEL_ACK;
946 rs->sr_err = LDAP_CANCELLED;
947 send_ldap_result( so->s_op, rs );
948 if ( so->s_flags & PS_IS_DETACHED ) {
950 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
951 cb->sc_cleanup = syncprov_ab_cleanup;
952 cb->sc_next = op->o_callback;
954 return SLAP_CB_CONTINUE;
957 syncprov_drop_psearch( so, 0 );
959 return SLAP_CB_CONTINUE;
962 /* Find which persistent searches are affected by this operation */
964 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
966 slap_overinst *on = opc->son;
967 syncprov_info_t *si = on->on_bi.bi_private;
970 syncops *ss, *sprev, *snext;
977 fc.fdn = &op->o_req_ndn;
979 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
981 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
982 else dnParent( fc.fdn, &pdn );
983 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
987 if ( op->o_tag != LDAP_REQ_ADD ) {
988 op->o_bd->bd_info = (BackendInfo *)on->on_info;
989 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
990 /* If we're sending responses now, make a copy and unlock the DB */
991 if ( e && !saveit ) {
992 Entry *e2 = entry_dup( e );
993 be_entry_release_rw( op, e, 0 );
996 op->o_bd->bd_info = (BackendInfo *)on;
1003 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1004 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1005 opc->sreference = is_entry_referral( e );
1007 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1008 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1010 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1013 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1014 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1015 sprev = ss, ss=snext)
1026 /* If the base of the search is missing, signal a refresh */
1027 rc = syncprov_findbase( op, &fc );
1028 if ( rc != LDAP_SUCCESS ) {
1029 SlapReply rs = {REP_RESULT};
1030 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1031 "search base has changed" );
1032 sprev->s_next = snext;
1033 syncprov_drop_psearch( ss, 1 );
1037 /* If we're sending results now, look for this op in old matches */
1040 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1041 old=sm, sm=sm->sm_next ) {
1042 if ( sm->sm_op == ss ) {
1044 old->sm_next = sm->sm_next;
1045 op->o_tmpfree( sm, op->o_tmpmemctx );
1051 /* check if current o_req_dn is in scope and matches filter */
1052 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1053 LDAP_COMPARE_TRUE ) {
1055 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1056 sm->sm_next = opc->smatches;
1061 /* if found send UPDATE else send ADD */
1063 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1064 syncprov_sendresp( op, opc, ss, &e,
1065 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1066 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1069 } else if ( !saveit && found ) {
1071 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1072 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1073 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1076 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1078 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1079 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1080 be_entry_release_rw( op, e, 0 );
1081 op->o_bd->bd_info = (BackendInfo *)on;
1084 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1089 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1091 slap_callback *cb = op->o_callback;
1092 opcookie *opc = cb->sc_private;
1093 slap_overinst *on = opc->son;
1094 syncprov_info_t *si = on->on_bi.bi_private;
1095 syncmatches *sm, *snext;
1096 modtarget *mt, mtdummy;
1098 for (sm = opc->smatches; sm; sm=snext) {
1099 snext = sm->sm_next;
1100 syncprov_free_syncop( sm->sm_op );
1101 op->o_tmpfree( sm, op->o_tmpmemctx );
1104 /* Remove op from lock table */
1106 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1107 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1109 modinst *mi = mt->mt_mods;
1111 /* If there are more, promote the next one */
1112 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1113 if ( mi->mi_next ) {
1114 mt->mt_mods = mi->mi_next;
1115 mt->mt_op = mt->mt_mods->mi_op;
1116 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1118 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1119 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1120 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1124 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1125 if ( !BER_BVISNULL( &opc->suuid ))
1126 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1127 if ( !BER_BVISNULL( &opc->sndn ))
1128 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1129 if ( !BER_BVISNULL( &opc->sdn ))
1130 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1131 op->o_callback = cb->sc_next;
1132 op->o_tmpfree(cb, op->o_tmpmemctx);
1138 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1140 syncprov_info_t *si = on->on_bi.bi_private;
1143 struct berval bv[2];
1144 slap_callback cb = {0};
1145 int manage = get_manageDSAit(op);
1147 mod.sml_values = bv;
1148 bv[1].bv_val = NULL;
1149 bv[0] = si->si_ctxcsn;
1150 mod.sml_nvalues = NULL;
1151 mod.sml_desc = slap_schema.si_ad_contextCSN;
1152 mod.sml_op = LDAP_MOD_REPLACE;
1154 mod.sml_next = NULL;
1156 cb.sc_response = slap_null_cb;
1158 opm.o_tag = LDAP_REQ_MODIFY;
1159 opm.o_callback = &cb;
1160 opm.orm_modlist = &mod;
1161 opm.o_req_dn = op->o_bd->be_suffix[0];
1162 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1163 opm.o_bd->bd_info = on->on_info->oi_orig;
1164 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1165 opm.o_bd->be_modify( &opm, rs );
1166 opm.o_managedsait = manage;
1170 syncprov_add_slog( Operation *op, struct berval *csn )
1172 opcookie *opc = op->o_callback->sc_private;
1173 slap_overinst *on = opc->son;
1174 syncprov_info_t *si = on->on_bi.bi_private;
1180 /* Allocate a record. UUIDs are not NUL-terminated. */
1181 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1184 se->se_tag = op->o_tag;
1186 se->se_uuid.bv_val = (char *)(se+1);
1187 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1188 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1189 se->se_uuid.bv_len = opc->suuid.bv_len;
1191 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1192 se->se_csn.bv_val[csn->bv_len] = '\0';
1193 se->se_csn.bv_len = csn->bv_len;
1195 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1196 if ( sl->sl_head ) {
1197 sl->sl_tail->se_next = se;
1203 while ( sl->sl_num > sl->sl_size ) {
1205 sl->sl_head = se->se_next;
1206 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1207 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1210 if ( !sl->sl_head ) {
1214 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1218 /* Just set a flag if we found the matching entry */
1220 playlog_cb( Operation *op, SlapReply *rs )
1222 if ( rs->sr_type == REP_SEARCH ) {
1223 op->o_callback->sc_private = (void *)1;
1228 /* enter with sl->sl_mutex locked, release before returning */
1230 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1231 struct berval *oldcsn, struct berval *ctxcsn )
1233 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1234 syncprov_info_t *si = on->on_bi.bi_private;
1236 int i, j, ndel, num, nmods, mmods;
1239 if ( !sl->sl_num ) {
1240 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1248 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1249 num * UUID_LEN, op->o_tmpmemctx );
1251 uuids[0].bv_val = (char *)(uuids + num + 1);
1253 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1254 * and everything else at the end. Do this first so we can
1255 * unlock the list mutex.
1257 for ( se=sl->sl_head; se; se=se->se_next ) {
1258 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1259 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1260 if ( se->se_tag == LDAP_REQ_DELETE ) {
1267 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1268 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1269 uuids[j].bv_len = UUID_LEN;
1271 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1275 /* Zero out unused slots */
1276 for ( i=ndel; i < num - nmods; i++ )
1277 uuids[i].bv_len = 0;
1279 /* Mods must be validated to see if they belong in this delete set.
1283 /* Strip any duplicates */
1284 for ( i=0; i<nmods; i++ ) {
1285 for ( j=0; j<ndel; j++ ) {
1286 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1287 uuids[num - 1 - i].bv_len = 0;
1292 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1293 for ( j=0; j<i; j++ ) {
1294 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1295 uuids[num - 1 - i].bv_len = 0;
1304 SlapReply frs = { REP_RESULT };
1307 #ifdef LDAP_COMP_MATCH
1308 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1310 AttributeAssertion eq;
1312 slap_callback cb = {0};
1316 fop.o_sync_mode = 0;
1317 fop.o_callback = &cb;
1318 fop.ors_limit = NULL;
1319 fop.ors_tlimit = SLAP_NO_LIMIT;
1320 fop.ors_attrs = slap_anlist_all_attributes;
1321 fop.ors_attrsonly = 0;
1322 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1324 af.f_choice = LDAP_FILTER_AND;
1327 mf.f_choice = LDAP_FILTER_EQUALITY;
1329 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1330 mf.f_next = fop.ors_filter;
1332 fop.ors_filter = ⁡
1334 cb.sc_response = playlog_cb;
1335 fop.o_bd->bd_info = on->on_info->oi_orig;
1337 for ( i=ndel; i<num; i++ ) {
1338 if ( uuids[i].bv_len == 0 ) continue;
1340 mf.f_av_value = uuids[i];
1341 cb.sc_private = NULL;
1343 rc = fop.o_bd->be_search( &fop, &frs );
1345 /* If entry was not found, add to delete list */
1346 if ( !cb.sc_private ) {
1347 uuids[ndel++] = uuids[i];
1350 fop.o_bd->bd_info = (BackendInfo *)on;
1353 uuids[ndel].bv_val = NULL;
1354 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1359 syncprov_op_response( Operation *op, SlapReply *rs )
1361 opcookie *opc = op->o_callback->sc_private;
1362 slap_overinst *on = opc->son;
1363 syncprov_info_t *si = on->on_bi.bi_private;
1366 if ( rs->sr_err == LDAP_SUCCESS )
1368 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1369 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1371 /* Update our context CSN */
1373 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1374 slap_get_commit_csn( op, &maxcsn, &curcsn );
1375 if ( !BER_BVISNULL( &maxcsn ) ) {
1376 strcpy( cbuf, maxcsn.bv_val );
1377 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1378 strcpy( si->si_ctxcsnbuf, cbuf );
1379 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1383 /* Don't do any processing for consumer contextCSN updates */
1384 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1385 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1386 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1387 return SLAP_CB_CONTINUE;
1391 if ( si->si_chkops || si->si_chktime ) {
1393 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1397 if ( si->si_chktime &&
1398 (op->o_time - si->si_chklast >= si->si_chktime )) {
1400 si->si_chklast = op->o_time;
1403 syncprov_checkpoint( op, rs, on );
1406 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1408 opc->sctxcsn.bv_len = maxcsn.bv_len;
1409 opc->sctxcsn.bv_val = cbuf;
1411 /* Handle any persistent searches */
1415 case LDAP_REQ_MODIFY:
1416 case LDAP_REQ_MODRDN:
1417 case LDAP_REQ_EXTENDED:
1418 syncprov_matchops( op, opc, 0 );
1420 case LDAP_REQ_DELETE:
1421 /* for each match in opc->smatches:
1424 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1425 if ( sm->sm_op->s_op->o_abandon )
1427 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1428 LDAP_SYNC_DELETE, 1 );
1434 /* Add any log records */
1435 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1436 syncprov_add_slog( op, &curcsn );
1440 return SLAP_CB_CONTINUE;
1443 /* We don't use a subentry to store the context CSN any more.
1444 * We expose the current context CSN as an operational attribute
1445 * of the suffix entry.
1448 syncprov_op_compare( Operation *op, SlapReply *rs )
1450 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1451 syncprov_info_t *si = on->on_bi.bi_private;
1452 int rc = SLAP_CB_CONTINUE;
1454 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1455 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1459 struct berval bv[2];
1461 e.e_name = op->o_bd->be_suffix[0];
1462 e.e_nname = op->o_bd->be_nsuffix[0];
1464 BER_BVZERO( &bv[1] );
1465 bv[0] = si->si_ctxcsn;
1467 a.a_desc = slap_schema.si_ad_contextCSN;
1469 a.a_nvals = a.a_vals;
1471 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1473 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1474 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1475 if ( ! rs->sr_err ) {
1476 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1477 goto return_results;
1480 if ( get_assert( op ) &&
1481 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1483 rs->sr_err = LDAP_ASSERTION_FAILED;
1484 goto return_results;
1488 rs->sr_err = LDAP_COMPARE_FALSE;
1490 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1491 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1492 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1493 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1495 rs->sr_err = LDAP_COMPARE_TRUE;
1500 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1502 send_ldap_result( op, rs );
1504 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1505 rs->sr_err = LDAP_SUCCESS;
1514 syncprov_op_mod( Operation *op, SlapReply *rs )
1516 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1517 syncprov_info_t *si = on->on_bi.bi_private;
1519 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1521 (si->si_ops ? sizeof(modinst) : 0 ),
1523 opcookie *opc = (opcookie *)(cb+1);
1525 cb->sc_response = syncprov_op_response;
1526 cb->sc_cleanup = syncprov_op_cleanup;
1527 cb->sc_private = opc;
1528 cb->sc_next = op->o_callback;
1529 op->o_callback = cb;
1531 /* If there are active persistent searches, lock this operation.
1532 * See seqmod.c for the locking logic on its own.
1535 modtarget *mt, mtdummy;
1538 mi = (modinst *)(opc+1);
1541 /* See if we're already modifying this entry... */
1543 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1544 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1546 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1547 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1548 mt->mt_tail->mi_next = mi;
1550 /* wait for this op to get to head of list */
1551 while ( mt->mt_mods != mi ) {
1552 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1553 ldap_pvt_thread_yield();
1554 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1556 /* clean up if the caller is giving up */
1557 if ( op->o_abandon ) {
1559 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1561 m2->mi_next = mi->mi_next;
1562 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1563 op->o_tmpfree( cb, op->o_tmpmemctx );
1564 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1565 return SLAPD_ABANDON;
1568 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1570 /* Record that we're modifying this entry now */
1571 mt = ch_malloc( sizeof(modtarget) );
1574 mt->mt_op = mi->mi_op;
1575 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1576 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1577 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1581 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1582 syncprov_matchops( op, opc, 1 );
1584 return SLAP_CB_CONTINUE;
1588 syncprov_op_extended( Operation *op, SlapReply *rs )
1590 if ( exop_is_write( op ))
1591 return syncprov_op_mod( op, rs );
1593 return SLAP_CB_CONTINUE;
1596 typedef struct searchstate {
1597 slap_overinst *ss_on;
1603 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1605 if ( rs->sr_ctrls ) {
1606 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1607 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1608 rs->sr_ctrls = NULL;
1614 syncprov_detach_op( Operation *op, syncops *so )
1620 GroupAssertion *g1, *g2;
1622 /* count the search attrs */
1623 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1624 alen += op->ors_attrs[i].an_name.bv_len + 1;
1626 /* Make a new copy of the operation */
1627 size = sizeof(Operation) + sizeof(Opheader) +
1628 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1629 op->o_req_dn.bv_len + 1 +
1630 op->o_req_ndn.bv_len + 1 +
1631 op->o_ndn.bv_len + 1 +
1632 so->s_filterstr.bv_len + 1;
1633 op2 = (Operation *)ch_calloc( 1, size );
1634 op2->o_hdr = (Opheader *)(op2+1);
1636 /* Copy the fields we care about explicitly, leave the rest alone */
1637 *op2->o_hdr = *op->o_hdr;
1638 op2->o_tag = op->o_tag;
1639 op2->o_time = op->o_time;
1640 op2->o_bd = op->o_bd;
1641 op2->o_request = op->o_request;
1644 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1645 ptr = (char *)(op2->ors_attrs+i+1);
1646 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1647 op2->ors_attrs[i] = op->ors_attrs[i];
1648 op2->ors_attrs[i].an_name.bv_val = ptr;
1649 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1651 BER_BVZERO( &op2->ors_attrs[i].an_name );
1653 ptr = (char *)(op2->o_hdr + 1);
1655 op2->o_authz = op->o_authz;
1656 op2->o_ndn.bv_val = ptr;
1657 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1658 op2->o_dn = op2->o_ndn;
1659 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1660 op2->o_req_dn.bv_val = ptr;
1661 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1662 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1663 op2->o_req_ndn.bv_val = ptr;
1664 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1665 op2->ors_filterstr.bv_val = ptr;
1666 strcpy( ptr, so->s_filterstr.bv_val );
1667 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1668 op2->ors_filter = str2filter( ptr );
1671 /* Copy any cached group ACLs individually */
1672 op2->o_groups = NULL;
1673 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1674 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1676 strcpy( g2->ga_ndn, g1->ga_ndn );
1677 g2->ga_next = op2->o_groups;
1681 /* Add op2 to conn so abandon will find us */
1682 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1683 op->o_conn->c_n_ops_executing++;
1684 op->o_conn->c_n_ops_completed--;
1685 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1686 so->s_flags |= PS_IS_DETACHED;
1687 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1691 syncprov_search_response( Operation *op, SlapReply *rs )
1693 searchstate *ss = op->o_callback->sc_private;
1694 slap_overinst *on = ss->ss_on;
1695 syncprov_info_t *si = on->on_bi.bi_private;
1696 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1698 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1700 /* If we got a referral without a referral object, there's
1701 * something missing that we cannot replicate. Just ignore it.
1702 * The consumer will abort because we didn't send the expected
1705 if ( !rs->sr_entry ) {
1706 assert( rs->sr_entry );
1707 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1708 return SLAP_CB_CONTINUE;
1710 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1711 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1712 slap_schema.si_ad_entryCSN );
1714 /* Don't send the ctx entry twice */
1715 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1716 return LDAP_SUCCESS;
1718 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1720 rs->sr_ctrls[1] = NULL;
1721 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1722 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1723 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1724 struct berval cookie;
1726 slap_compose_sync_cookie( op, &cookie,
1727 &op->ors_filter->f_and->f_ava->aa_value,
1728 srs->sr_state.rid );
1730 /* Is this a regular refresh? */
1732 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1734 rs->sr_ctrls[1] = NULL;
1735 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1736 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1737 LDAP_SYNC_REFRESH_DELETES );
1740 /* It's RefreshAndPersist, transition to Persist phase */
1741 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1742 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1743 &cookie, 1, NULL, 0 );
1744 /* Flush any queued persist messages */
1745 if ( ss->ss_so->s_res ) {
1746 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1748 syncprov_qplay( op, on, ss->ss_so );
1751 /* Turn off the refreshing flag */
1752 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1754 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1756 /* Detach this Op from frontend control */
1757 syncprov_detach_op( op, ss->ss_so );
1759 return LDAP_SUCCESS;
1763 return SLAP_CB_CONTINUE;
1767 syncprov_op_search( Operation *op, SlapReply *rs )
1769 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1770 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1772 int gotstate = 0, nochange = 0, do_present = 1;
1773 Filter *fand, *fava;
1774 syncops *sop = NULL;
1777 struct berval ctxcsn;
1778 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1780 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1782 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1783 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1787 srs = op->o_controls[slap_cids.sc_LDAPsync];
1788 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1790 /* If this is a persistent search, set it up right away */
1791 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1801 so.s_flags = PS_IS_REFRESHING;
1802 /* syncprov_findbase expects to be called as a callback... */
1803 sc.sc_private = &opc;
1805 cb = op->o_callback;
1806 op->o_callback = ≻
1807 rs->sr_err = syncprov_findbase( op, &fc );
1808 op->o_callback = cb;
1810 if ( rs->sr_err != LDAP_SUCCESS ) {
1811 send_ldap_result( op, rs );
1814 sop = ch_malloc( sizeof( syncops ));
1816 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1817 sop->s_rid = srs->sr_state.rid;
1820 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1821 sop->s_next = si->si_ops;
1823 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1826 /* snapshot the ctxcsn */
1827 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1828 strcpy( csnbuf, si->si_ctxcsnbuf );
1829 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1830 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1831 ctxcsn.bv_val = csnbuf;
1833 /* If we have a cookie, handle the PRESENT lookups */
1834 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1837 /* The cookie was validated when it was parsed, just use it */
1839 /* If just Refreshing and nothing has changed, shortcut it */
1840 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1842 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1843 LDAPControl *ctrls[2];
1847 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1848 NULL, LDAP_SYNC_REFRESH_DELETES );
1849 rs->sr_ctrls = ctrls;
1850 rs->sr_err = LDAP_SUCCESS;
1851 send_ldap_result( op, rs );
1852 rs->sr_ctrls = NULL;
1857 /* Do we have a sessionlog for this search? */
1860 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1861 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1863 /* mutex is unlocked in playlog */
1864 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1866 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1869 /* Is the CSN still present in the database? */
1870 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1871 /* No, so a reload is required */
1872 #if 0 /* the consumer doesn't seem to send this hint */
1873 if ( op->o_sync_rhint == 0 ) {
1874 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1880 /* If changed and doing Present lookup, send Present UUIDs */
1881 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1883 send_ldap_result( op, rs );
1890 /* Append CSN range to search filter, save original filter
1891 * for persistent search evaluation
1894 sop->s_filterstr= op->ors_filterstr;
1897 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1898 fand->f_choice = LDAP_FILTER_AND;
1899 fand->f_next = NULL;
1900 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1901 fava->f_choice = LDAP_FILTER_LE;
1902 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1903 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1904 #ifdef LDAP_COMP_MATCH
1905 fava->f_ava->aa_cf = NULL;
1907 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1910 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1911 fava = fava->f_next;
1912 fava->f_choice = LDAP_FILTER_GE;
1913 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1914 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1915 #ifdef LDAP_COMP_MATCH
1916 fava->f_ava->aa_cf = NULL;
1918 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1920 fava->f_next = op->ors_filter;
1921 op->ors_filter = fand;
1922 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1924 /* Let our callback add needed info to returned entries */
1925 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1926 ss = (searchstate *)(cb+1);
1929 ss->ss_present = do_present;
1930 cb->sc_response = syncprov_search_response;
1931 cb->sc_cleanup = syncprov_search_cleanup;
1932 cb->sc_private = ss;
1933 cb->sc_next = op->o_callback;
1934 op->o_callback = cb;
1936 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1937 op->o_sync_mode &= SLAP_CONTROL_MASK;
1940 /* If this is a persistent search and no changes were reported during
1941 * the refresh phase, just invoke the response callback to transition
1942 * us into persist phase
1945 rs->sr_err = LDAP_SUCCESS;
1946 rs->sr_nentries = 0;
1947 send_ldap_result( op, rs );
1950 return SLAP_CB_CONTINUE;
1954 syncprov_operational(
1958 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1959 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1961 if ( rs->sr_entry &&
1962 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1964 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1965 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1966 Attribute *a, **ap = NULL;
1968 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1969 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1974 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1976 a = ch_malloc( sizeof(Attribute));
1977 a->a_desc = slap_schema.si_ad_contextCSN;
1978 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1979 a->a_vals[1].bv_val = NULL;
1980 a->a_nvals = a->a_vals;
1986 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1988 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1990 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1992 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1995 return SLAP_CB_CONTINUE;
2003 static ConfigDriver sp_cf_gen;
2005 static ConfigTable spcfg[] = {
2006 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2007 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2008 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2009 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2010 { "syncprov-sessionlog", "size", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2011 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2012 "DESC 'Session log size in ops' "
2013 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2014 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2017 static ConfigOCs spocs[] = {
2018 { "( OLcfgOvOc:1.1 "
2019 "NAME 'olcSyncProvConfig' "
2020 "DESC 'SyncRepl Provider configuration' "
2021 "SUP olcOverlayConfig "
2022 "MAY ( olcSpCheckpoint $ olcSpSessionlog ) )",
2023 Cft_Overlay, spcfg },
2028 sp_cf_gen(ConfigArgs *c)
2030 slap_overinst *on = (slap_overinst *)c->bi;
2031 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2034 if ( c->op == SLAP_CONFIG_EMIT ) {
2035 switch ( c->type ) {
2037 if ( si->si_chkops || si->si_chktime ) {
2039 bv.bv_len = sprintf( c->msg, "%d %d",
2040 si->si_chkops, si->si_chktime );
2042 value_add_one( &c->rvalue_vals, &bv );
2048 if ( si->si_logs ) {
2049 c->value_int = si->si_logs->sl_size;
2056 } else if ( c->op == LDAP_MOD_DELETE ) {
2057 switch ( c->type ) {
2064 si->si_logs->sl_size = 0;
2066 rc = LDAP_NO_SUCH_ATTRIBUTE;
2071 switch ( c->type ) {
2073 si->si_chkops = atoi( c->argv[1] );
2074 si->si_chktime = atoi( c->argv[2] ) * 60;
2078 int size = c->value_int;
2081 sprintf( c->msg, "%s size %d is negative",
2083 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2084 return ARG_BAD_CONF;
2088 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2089 sl->sl_mincsn.bv_val = (char *)(sl+1);
2090 sl->sl_mincsn.bv_len = 0;
2092 sl->sl_head = sl->sl_tail = NULL;
2093 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2103 /* Cheating - we have no thread pool context for these functions,
2106 typedef struct thread_keys {
2109 ldap_pvt_thread_pool_keyfree_t *xfree;
2113 /* A fake thread context */
2114 static thread_keys thrctx[MAXKEYS];
2116 /* ITS#3456 we cannot run this search on the main thread, must use a
2117 * child thread in order to insure we have a big enough stack.
2124 syncprov_findcsn( ptr, FIND_MAXCSN );
2128 /* Read any existing contextCSN from the underlying db.
2129 * Then search for any entries newer than that. If no value exists,
2130 * just generate it. Cache whatever result.
2137 slap_overinst *on = (slap_overinst *) be->bd_info;
2138 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2141 char opbuf[OPERATION_BUFFER_SIZE];
2142 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2143 Operation *op = (Operation *)opbuf;
2148 if ( slapMode & SLAP_TOOL_MODE ) {
2152 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2157 connection_fake_init( &conn, op, thrctx );
2159 op->o_dn = be->be_rootdn;
2160 op->o_ndn = be->be_rootndn;
2162 ctxcsnbuf[0] = '\0';
2164 op->o_bd->bd_info = on->on_info->oi_orig;
2165 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2166 slap_schema.si_ad_contextCSN, 0, &e );
2169 ldap_pvt_thread_t tid;
2171 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2173 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2174 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2175 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2176 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2177 si->si_ctxcsn.bv_len );
2178 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2179 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2181 be_entry_release_rw( op, e, 0 );
2182 op->o_bd->bd_info = (BackendInfo *)on;
2183 op->o_req_dn = be->be_suffix[0];
2184 op->o_req_ndn = be->be_nsuffix[0];
2185 op->ors_scope = LDAP_SCOPE_SUBTREE;
2186 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2187 ldap_pvt_thread_join( tid, NULL );
2188 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2189 /* If we're also a consumer, and we didn't find the context entry,
2190 * then don't generate anything, wait for our provider to send it
2196 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2197 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2198 &si->si_ctxcsn, 0 );
2201 /* If our ctxcsn is different from what was read from the root
2202 * entry, make sure we do a checkpoint on close
2204 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2209 op->o_bd->bd_info = (BackendInfo *)on;
2213 /* Write the current contextCSN into the underlying db.
2220 slap_overinst *on = (slap_overinst *) be->bd_info;
2221 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2224 if ( slapMode & SLAP_TOOL_MODE ) {
2227 if ( si->si_numops ) {
2229 char opbuf[OPERATION_BUFFER_SIZE];
2230 Operation *op = (Operation *)opbuf;
2231 SlapReply rs = {REP_RESULT};
2233 connection_fake_init( &conn, op, thrctx );
2235 op->o_dn = be->be_rootdn;
2236 op->o_ndn = be->be_rootndn;
2237 syncprov_checkpoint( op, &rs, on );
2239 for ( i=0; thrctx[i].key; i++) {
2240 if ( thrctx[i].xfree )
2241 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2242 thrctx[i].key = NULL;
2253 slap_overinst *on = (slap_overinst *)be->bd_info;
2254 syncprov_info_t *si;
2256 si = ch_calloc(1, sizeof(syncprov_info_t));
2257 on->on_bi.bi_private = si;
2258 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2259 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2260 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2261 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2263 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2264 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2266 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2267 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2273 syncprov_db_destroy(
2277 slap_overinst *on = (slap_overinst *)be->bd_info;
2278 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2281 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2282 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2283 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2290 static int syncprov_parseCtrl (
2299 struct berval cookie = BER_BVNULL;
2303 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2304 rs->sr_text = "Sync control specified multiple times";
2305 return LDAP_PROTOCOL_ERROR;
2308 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2309 rs->sr_text = "Sync control specified with pagedResults control";
2310 return LDAP_PROTOCOL_ERROR;
2313 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2314 rs->sr_text = "Sync control value is empty (or absent)";
2315 return LDAP_PROTOCOL_ERROR;
2318 /* Parse the control value
2319 * syncRequestValue ::= SEQUENCE {
2324 * refreshAndPersist (3)
2326 * cookie syncCookie OPTIONAL
2330 ber = ber_init( &ctrl->ldctl_value );
2332 rs->sr_text = "internal error";
2336 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2337 rs->sr_text = "Sync control : mode decoding error";
2338 return LDAP_PROTOCOL_ERROR;
2342 case LDAP_SYNC_REFRESH_ONLY:
2343 mode = SLAP_SYNC_REFRESH;
2345 case LDAP_SYNC_REFRESH_AND_PERSIST:
2346 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2349 rs->sr_text = "Sync control : unknown update mode";
2350 return LDAP_PROTOCOL_ERROR;
2353 tag = ber_peek_tag( ber, &len );
2355 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2356 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2357 rs->sr_text = "Sync control : cookie decoding error";
2358 return LDAP_PROTOCOL_ERROR;
2361 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2362 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2363 rs->sr_text = "Sync control : rhint decoding error";
2364 return LDAP_PROTOCOL_ERROR;
2367 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2368 rs->sr_text = "Sync control : decoding error";
2369 return LDAP_PROTOCOL_ERROR;
2371 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2372 sr->sr_rhint = rhint;
2373 if (!BER_BVISNULL(&cookie)) {
2374 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2375 slap_parse_sync_cookie( &sr->sr_state );
2378 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2380 (void) ber_free( ber, 1 );
2382 op->o_sync = ctrl->ldctl_iscritical
2383 ? SLAP_CONTROL_CRITICAL
2384 : SLAP_CONTROL_NONCRITICAL;
2386 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2388 return LDAP_SUCCESS;
2391 /* This overlay is set up for dynamic loading via moduleload. For static
2392 * configuration, you'll need to arrange for the slap_overinst to be
2393 * initialized and registered by some other function inside slapd.
2396 static slap_overinst syncprov;
2403 rc = register_supported_control( LDAP_CONTROL_SYNC,
2404 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2405 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2406 if ( rc != LDAP_SUCCESS ) {
2407 Debug( LDAP_DEBUG_ANY,
2408 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2412 syncprov.on_bi.bi_type = "syncprov";
2413 syncprov.on_bi.bi_db_init = syncprov_db_init;
2414 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2415 syncprov.on_bi.bi_db_open = syncprov_db_open;
2416 syncprov.on_bi.bi_db_close = syncprov_db_close;
2418 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2419 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2421 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2422 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2423 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2424 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2425 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2426 syncprov.on_bi.bi_op_search = syncprov_op_search;
2427 syncprov.on_bi.bi_extended = syncprov_op_extended;
2428 syncprov.on_bi.bi_operational = syncprov_operational;
2430 syncprov.on_bi.bi_cf_ocs = spocs;
2432 rc = config_register_schema( spcfg, spocs );
2433 if ( rc ) return rc;
2435 return overlay_register( &syncprov );
2438 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2440 init_module( int argc, char *argv[] )
2442 return syncprov_init();
2444 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2446 #endif /* defined(SLAPD_OVER_SYNCPROV) */