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>
29 /* A modify request on a particular entry */
30 typedef struct modinst {
31 struct modinst *mi_next;
35 typedef struct modtarget {
36 struct modinst *mt_mods;
37 struct modinst *mt_tail;
39 ldap_pvt_thread_mutex_t mt_mutex;
42 /* A queued result of a persistent search */
43 typedef struct syncres {
44 struct syncres *s_next;
53 /* Record of a persistent search */
54 typedef struct syncops {
55 struct syncops *s_next;
56 struct berval s_base; /* ndn of search base */
57 ID s_eid; /* entryID of search base */
58 Operation *s_op; /* search op */
60 struct berval s_filterstr;
61 int s_flags; /* search status */
62 int s_inuse; /* reference count */
63 struct syncres *s_res;
64 struct syncres *s_restail;
65 ldap_pvt_thread_mutex_t s_mutex;
68 /* A received sync control */
69 typedef struct sync_control {
70 struct sync_cookie sr_state;
74 #if 0 /* moved back to slap.h */
75 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
77 /* o_sync_mode uses data bits of o_sync */
78 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
80 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
81 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
82 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
83 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
85 #define PS_IS_REFRESHING 0x01
86 #define PS_IS_DETACHED 0x02
88 /* Record of which searches matched at premodify step */
89 typedef struct syncmatches {
90 struct syncmatches *sm_next;
94 /* Session log data */
95 typedef struct slog_entry {
96 struct slog_entry *se_next;
97 struct berval se_uuid;
102 typedef struct sessionlog {
103 struct berval sl_mincsn;
108 ldap_pvt_thread_mutex_t sl_mutex;
111 /* The main state for this overlay */
112 typedef struct syncprov_info_t {
114 struct berval si_ctxcsn; /* ldapsync context */
115 int si_chkops; /* checkpointing info */
117 int si_numops; /* number of ops since last checkpoint */
118 time_t si_chklast; /* time of last checkpoint */
119 Avlnode *si_mods; /* entries being modified */
121 ldap_pvt_thread_mutex_t si_csn_mutex;
122 ldap_pvt_thread_mutex_t si_ops_mutex;
123 ldap_pvt_thread_mutex_t si_mods_mutex;
124 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
127 typedef struct opcookie {
129 syncmatches *smatches;
130 struct berval sdn; /* DN of entry, for deletes */
132 struct berval suuid; /* UUID of entry */
133 struct berval sctxcsn;
134 int sreference; /* Is the entry a reference? */
137 typedef struct fbase_cookie {
138 struct berval *fdn; /* DN of a modified entry, for scope testing */
139 syncops *fss; /* persistent search we're testing against */
140 int fbase; /* if TRUE we found the search base and it's still valid */
141 int fscope; /* if TRUE then fdn is within the psearch scope */
144 static AttributeName csn_anlist[2];
145 static AttributeName uuid_anlist[2];
147 /* Build a LDAPsync intermediate state control */
153 int entry_sync_state,
157 struct berval *cookie )
162 const char *text = NULL;
164 BerElementBuffer berbuf;
165 BerElement *ber = (BerElement *)&berbuf;
167 struct berval entryuuid_bv = BER_BVNULL;
169 ber_init2( ber, 0, LBER_USE_DER );
170 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
172 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
174 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
175 AttributeDescription *desc = a->a_desc;
176 if ( desc == slap_schema.si_ad_entryUUID ) {
177 entryuuid_bv = a->a_nvals[0];
182 if ( send_cookie && cookie ) {
183 ber_printf( ber, "{eOON}",
184 entry_sync_state, &entryuuid_bv, cookie );
186 ber_printf( ber, "{eON}",
187 entry_sync_state, &entryuuid_bv );
190 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
191 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
192 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
197 Debug( LDAP_DEBUG_TRACE,
198 "slap_build_sync_ctrl: ber_flatten2 failed\n",
200 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
207 /* Build a LDAPsync final state control */
215 struct berval *cookie,
219 BerElementBuffer berbuf;
220 BerElement *ber = (BerElement *)&berbuf;
222 ber_init2( ber, NULL, LBER_USE_DER );
223 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
225 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
227 ber_printf( ber, "{" );
228 if ( send_cookie && cookie ) {
229 ber_printf( ber, "O", cookie );
231 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
232 ber_printf( ber, "b", refreshDeletes );
234 ber_printf( ber, "N}" );
236 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
237 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
238 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
243 Debug( LDAP_DEBUG_TRACE,
244 "syncprov_done_ctrl: ber_flatten2 failed\n",
246 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
258 struct berval *cookie,
263 BerElementBuffer berbuf;
264 BerElement *ber = (BerElement *)&berbuf;
265 struct berval rspdata;
269 ber_init2( ber, NULL, LBER_USE_DER );
270 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
274 case LDAP_TAG_SYNC_NEW_COOKIE:
275 ber_printf( ber, "tO", type, cookie );
277 case LDAP_TAG_SYNC_REFRESH_DELETE:
278 case LDAP_TAG_SYNC_REFRESH_PRESENT:
279 ber_printf( ber, "t{", type );
281 ber_printf( ber, "O", cookie );
283 if ( refreshDone == 0 ) {
284 ber_printf( ber, "b", refreshDone );
286 ber_printf( ber, "N}" );
288 case LDAP_TAG_SYNC_ID_SET:
289 ber_printf( ber, "t{", type );
291 ber_printf( ber, "O", cookie );
293 if ( refreshDeletes == 1 ) {
294 ber_printf( ber, "b", refreshDeletes );
296 ber_printf( ber, "[W]", syncUUIDs );
297 ber_printf( ber, "N}" );
300 Debug( LDAP_DEBUG_TRACE,
301 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
307 ret = ber_flatten2( ber, &rspdata, 0 );
310 Debug( LDAP_DEBUG_TRACE,
311 "syncprov_sendinfo: ber_flatten2 failed\n",
313 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
317 rs->sr_rspoid = LDAP_SYNC_INFO;
318 rs->sr_rspdata = &rspdata;
319 send_ldap_intermediate( op, rs );
320 rs->sr_rspdata = NULL;
326 /* Find a modtarget in an AVL tree */
328 sp_avl_cmp( const void *c1, const void *c2 )
330 const modtarget *m1, *m2;
334 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
337 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
340 /* syncprov_findbase:
341 * finds the true DN of the base of a search (with alias dereferencing) and
342 * checks to make sure the base entry doesn't get replaced with a different
343 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
344 * change is detected, any persistent search on this base must be terminated /
346 * On the first call, we just save the DN and entryID. On subsequent calls
347 * we compare the DN and entryID with the saved values.
350 findbase_cb( Operation *op, SlapReply *rs )
352 slap_callback *sc = op->o_callback;
354 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
355 fbase_cookie *fc = sc->sc_private;
357 /* If no entryID, we're looking for the first time.
358 * Just store whatever we got.
360 if ( fc->fss->s_eid == NOID ) {
362 fc->fss->s_eid = rs->sr_entry->e_id;
363 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
365 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
366 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
368 /* OK, the DN is the same and the entryID is the same. Now
369 * see if the fdn resides in the scope.
372 switch ( fc->fss->s_op->ors_scope ) {
373 case LDAP_SCOPE_BASE:
374 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
376 case LDAP_SCOPE_ONELEVEL: {
378 dnParent( fc->fdn, &pdn );
379 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
381 case LDAP_SCOPE_SUBTREE:
382 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
384 #ifdef LDAP_SCOPE_SUBORDINATE
385 case LDAP_SCOPE_SUBORDINATE:
386 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
387 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
393 if ( rs->sr_err != LDAP_SUCCESS ) {
394 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
400 syncprov_findbase( Operation *op, fbase_cookie *fc )
402 opcookie *opc = op->o_callback->sc_private;
403 slap_overinst *on = opc->son;
404 syncprov_info_t *si = on->on_bi.bi_private;
406 slap_callback cb = {0};
408 SlapReply frs = { REP_RESULT };
413 cb.sc_response = findbase_cb;
416 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
417 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
418 fop.o_callback = &cb;
419 fop.o_tag = LDAP_REQ_SEARCH;
420 fop.ors_scope = LDAP_SCOPE_BASE;
421 fop.ors_deref = fc->fss->s_op->ors_deref;
422 fop.ors_limit = NULL;
424 fop.ors_tlimit = SLAP_NO_LIMIT;
425 fop.ors_attrs = slap_anlist_no_attrs;
426 fop.ors_attrsonly = 1;
427 fop.ors_filter = fc->fss->s_op->ors_filter;
428 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
430 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
432 fop.o_bd->bd_info = on->on_info->oi_orig;
433 rc = fop.o_bd->be_search( &fop, &frs );
434 fop.o_bd->bd_info = (BackendInfo *)on;
436 if ( fc->fbase ) return LDAP_SUCCESS;
438 /* If entryID has changed, then the base of this search has
439 * changed. Invalidate the psearch.
441 return LDAP_NO_SUCH_OBJECT;
445 * This function has three different purposes, but they all use a search
446 * that filters on entryCSN so they're combined here.
447 * 1: at startup time, after a contextCSN has been read from the database,
448 * we search for all entries with CSN >= contextCSN in case the contextCSN
449 * was not checkpointed at the previous shutdown.
451 * 2: when the current contextCSN is known and we have a sync cookie, we search
452 * for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
453 * entry is found, the cookie CSN is valid, otherwise it is stale.
455 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
456 * CSN, and generate Present records for them. We always collect this result
457 * in SyncID sets, even if there's only one match.
459 #define FIND_MAXCSN 1
461 #define FIND_PRESENT 3
464 findmax_cb( Operation *op, SlapReply *rs )
466 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
467 struct berval *maxcsn = op->o_callback->sc_private;
468 Attribute *a = attr_find( rs->sr_entry->e_attrs,
469 slap_schema.si_ad_entryCSN );
471 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
472 maxcsn->bv_len = a->a_vals[0].bv_len;
473 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
480 findcsn_cb( Operation *op, SlapReply *rs )
482 slap_callback *sc = op->o_callback;
484 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
485 sc->sc_private = (void *)1;
490 /* Build a list of entryUUIDs for sending in a SyncID set */
494 typedef struct fpres_cookie {
501 findpres_cb( Operation *op, SlapReply *rs )
503 slap_callback *sc = op->o_callback;
504 fpres_cookie *pc = sc->sc_private;
506 int ret = SLAP_CB_CONTINUE;
508 switch ( rs->sr_type ) {
510 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
512 pc->uuids[pc->num].bv_val = pc->last;
513 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
514 pc->uuids[pc->num].bv_len );
516 pc->last = pc->uuids[pc->num].bv_val;
517 pc->uuids[pc->num].bv_val = NULL;
520 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
526 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
528 pc->uuids[pc->num].bv_val = pc->last;
530 pc->last = pc->uuids[0].bv_val;
540 syncprov_findcsn( Operation *op, int mode )
542 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
543 syncprov_info_t *si = on->on_bi.bi_private;
545 slap_callback cb = {0};
547 SlapReply frs = { REP_RESULT };
548 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
549 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
550 struct berval fbuf, maxcsn;
552 #ifdef LDAP_COMP_MATCH
553 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
555 AttributeAssertion eq = { NULL, BER_BVNULL };
557 int i, rc = LDAP_SUCCESS;
558 fpres_cookie pcookie;
559 sync_control *srs = NULL;
561 if ( mode != FIND_MAXCSN ) {
562 srs = op->o_controls[slap_cids.sc_LDAPsync];
564 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
570 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
571 /* We want pure entries, not referrals */
572 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 = fbuf;
587 cf.f_choice = LDAP_FILTER_GE;
588 cf.f_av_value = si->si_ctxcsn;
589 fbuf.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 fbuf.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 if still in Refresh stage */
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);
674 sr->s_isreference = opc->sreference;
675 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
676 *(sr->s_ndn.bv_val++) = '\0';
677 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
678 *(sr->s_uuid.bv_val++) = '\0';
679 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
684 so->s_restail->s_next = sr;
687 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
691 /* Send a persistent search response */
693 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry *e, int mode, int queue )
695 slap_overinst *on = opc->son;
696 syncprov_info_t *si = on->on_bi.bi_private;
698 SlapReply rs = { REP_SEARCH };
699 LDAPControl *ctrls[2];
700 struct berval cookie;
702 Attribute a_uuid = {0};
703 Operation sop = *so->s_op;
708 sop.o_tmpmemctx = op->o_tmpmemctx;
710 sop.o_controls = op->o_controls;
712 if ( queue && (so->s_flags & PS_IS_REFRESHING) ) {
713 ldap_pvt_thread_mutex_lock( &so->s_mutex );
714 if ( so->s_flags & PS_IS_REFRESHING )
715 return syncprov_qresp( opc, so, mode );
716 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
720 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
722 e_uuid.e_attrs = &a_uuid;
723 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
724 a_uuid.a_nvals = &opc->suuid;
725 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
726 mode, ctrls, 0, 1, &cookie );
732 if ( opc->sreference ) {
733 rs.sr_ref = get_entry_referrals( &sop, e );
734 send_search_reference( &sop, &rs );
735 ber_bvarray_free( rs.sr_ref );
739 case LDAP_SYNC_MODIFY:
740 rs.sr_attrs = sop.ors_attrs;
741 send_search_entry( &sop, &rs );
743 case LDAP_SYNC_DELETE:
744 e_uuid.e_attrs = NULL;
745 e_uuid.e_name = opc->sdn;
746 e_uuid.e_nname = opc->sndn;
747 rs.sr_entry = &e_uuid;
748 if ( opc->sreference ) {
749 struct berval bv = BER_BVNULL;
751 send_search_reference( &sop, &rs );
753 send_search_entry( &sop, &rs );
759 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
765 syncprov_free_syncop( syncops *so )
767 syncres *sr, *srnext;
768 GroupAssertion *ga, *gnext;
770 ldap_pvt_thread_mutex_lock( &so->s_mutex );
772 if ( so->s_inuse > 0 ) {
773 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
776 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
777 if ( so->s_flags & PS_IS_DETACHED ) {
778 filter_free( so->s_op->ors_filter );
779 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
785 ch_free( so->s_base.bv_val );
786 for ( sr=so->s_res; sr; sr=srnext ) {
790 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
795 syncprov_drop_psearch( syncops *so, int lock )
797 if ( so->s_flags & PS_IS_DETACHED ) {
799 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
800 so->s_op->o_conn->c_n_ops_executing--;
801 so->s_op->o_conn->c_n_ops_completed++;
802 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
805 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
807 syncprov_free_syncop( so );
813 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
815 slap_callback *sc = op->o_callback;
816 op->o_callback = sc->sc_next;
817 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
818 op->o_tmpfree( sc, op->o_tmpmemctx );
823 syncprov_op_abandon( Operation *op, SlapReply *rs )
825 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
826 syncprov_info_t *si = on->on_bi.bi_private;
827 syncops *so, *soprev;
829 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
830 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
831 soprev=so, so=so->s_next ) {
832 if ( so->s_op->o_connid == op->o_connid &&
833 so->s_op->o_msgid == op->orn_msgid ) {
834 so->s_op->o_abandon = 1;
835 soprev->s_next = so->s_next;
839 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
841 /* Is this really a Cancel exop? */
842 if ( op->o_tag != LDAP_REQ_ABANDON ) {
843 so->s_op->o_cancel = SLAP_CANCEL_ACK;
844 rs->sr_err = LDAP_CANCELLED;
845 send_ldap_result( so->s_op, rs );
846 if ( so->s_flags & PS_IS_DETACHED ) {
848 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
849 cb->sc_cleanup = syncprov_ab_cleanup;
850 cb->sc_next = op->o_callback;
852 return SLAP_CB_CONTINUE;
855 syncprov_drop_psearch( so, 0 );
857 return SLAP_CB_CONTINUE;
860 /* Find which persistent searches are affected by this operation */
862 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
864 slap_overinst *on = opc->son;
865 syncprov_info_t *si = on->on_bi.bi_private;
868 syncops *ss, *sprev, *snext;
875 fc.fdn = &op->o_req_ndn;
877 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
879 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
880 else dnParent( fc.fdn, &pdn );
881 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
885 if ( op->o_tag != LDAP_REQ_ADD ) {
886 op->o_bd->bd_info = (BackendInfo *)on->on_info;
887 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
888 op->o_bd->bd_info = (BackendInfo *)on;
895 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
896 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
897 opc->sreference = is_entry_referral( e );
899 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
900 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
902 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
905 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
906 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
907 sprev = ss, ss=snext)
918 /* If the base of the search is missing, signal a refresh */
919 rc = syncprov_findbase( op, &fc );
920 if ( rc != LDAP_SUCCESS ) {
921 SlapReply rs = {REP_RESULT};
922 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
923 "search base has changed" );
924 sprev->s_next = snext;
925 syncprov_drop_psearch( ss, 1 );
929 /* If we're sending results now, look for this op in old matches */
932 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
933 old=sm, sm=sm->sm_next ) {
934 if ( sm->sm_op == ss ) {
936 old->sm_next = sm->sm_next;
937 op->o_tmpfree( sm, op->o_tmpmemctx );
943 /* check if current o_req_dn is in scope and matches filter */
944 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
945 LDAP_COMPARE_TRUE ) {
947 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
948 sm->sm_next = opc->smatches;
953 /* if found send UPDATE else send ADD */
954 syncprov_sendresp( op, opc, ss, e,
955 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
957 } else if ( !saveit && found ) {
959 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
962 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
964 if ( op->o_tag != LDAP_REQ_ADD ) {
965 op->o_bd->bd_info = (BackendInfo *)on->on_info;
966 be_entry_release_rw( op, e, 0 );
967 op->o_bd->bd_info = (BackendInfo *)on;
970 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
975 syncprov_op_cleanup( Operation *op, SlapReply *rs )
977 slap_callback *cb = op->o_callback;
978 opcookie *opc = cb->sc_private;
979 slap_overinst *on = opc->son;
980 syncprov_info_t *si = on->on_bi.bi_private;
981 syncmatches *sm, *snext;
982 modtarget *mt, mtdummy;
984 for (sm = opc->smatches; sm; sm=snext) {
986 syncprov_free_syncop( sm->sm_op );
987 op->o_tmpfree( sm, op->o_tmpmemctx );
990 /* Remove op from lock table */
992 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
993 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
994 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
996 modinst *mi = mt->mt_mods;
998 /* If there are more, promote the next one */
999 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1000 if ( mi->mi_next ) {
1001 mt->mt_mods = mi->mi_next;
1002 mt->mt_op = mt->mt_mods->mi_op;
1003 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1005 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1006 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1007 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1008 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1009 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1013 if ( !BER_BVISNULL( &opc->suuid ))
1014 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1015 if ( !BER_BVISNULL( &opc->sndn ))
1016 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1017 if ( !BER_BVISNULL( &opc->sdn ))
1018 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1019 op->o_callback = cb->sc_next;
1020 op->o_tmpfree(cb, op->o_tmpmemctx);
1026 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1028 syncprov_info_t *si = on->on_bi.bi_private;
1031 struct berval bv[2];
1032 slap_callback cb = {0};
1033 int manage = get_manageDSAit(op);
1035 mod.sml_values = bv;
1036 bv[1].bv_val = NULL;
1037 bv[0] = si->si_ctxcsn;
1038 mod.sml_nvalues = NULL;
1039 mod.sml_desc = slap_schema.si_ad_contextCSN;
1040 mod.sml_op = LDAP_MOD_REPLACE;
1041 mod.sml_next = NULL;
1043 cb.sc_response = slap_null_cb;
1045 opm.o_tag = LDAP_REQ_MODIFY;
1046 opm.o_callback = &cb;
1047 opm.orm_modlist = &mod;
1048 opm.o_req_dn = op->o_bd->be_suffix[0];
1049 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1050 opm.o_bd->bd_info = on->on_info->oi_orig;
1051 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1052 opm.o_bd->be_modify( &opm, rs );
1053 opm.o_managedsait = manage;
1057 syncprov_add_slog( Operation *op, struct berval *csn )
1059 opcookie *opc = op->o_callback->sc_private;
1060 slap_overinst *on = opc->son;
1061 syncprov_info_t *si = on->on_bi.bi_private;
1067 /* Allocate a record. UUIDs are not NUL-terminated. */
1068 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1071 se->se_tag = op->o_tag;
1073 se->se_uuid.bv_val = (char *)(se+1);
1074 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1075 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1076 se->se_uuid.bv_len = opc->suuid.bv_len;
1078 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1079 se->se_csn.bv_val[csn->bv_len] = '\0';
1080 se->se_csn.bv_len = csn->bv_len;
1082 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1083 if ( sl->sl_head ) {
1084 sl->sl_tail->se_next = se;
1090 while ( sl->sl_num > sl->sl_size ) {
1092 sl->sl_head = se->se_next;
1093 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1094 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1097 if ( !sl->sl_head ) {
1101 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1105 /* Just set a flag if we found the matching entry */
1107 playlog_cb( Operation *op, SlapReply *rs )
1109 if ( rs->sr_type == REP_SEARCH ) {
1110 op->o_callback->sc_private = (void *)1;
1115 /* enter with sl->sl_mutex locked, release before returning */
1117 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1118 struct berval *oldcsn, struct berval *ctxcsn )
1120 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1121 syncprov_info_t *si = on->on_bi.bi_private;
1123 int i, j, ndel, num, nmods, mmods;
1126 if ( !sl->sl_num ) {
1127 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1135 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1136 num * UUID_LEN, op->o_tmpmemctx );
1138 uuids[0].bv_val = (char *)(uuids + num + 1);
1140 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1141 * and everything else at the end. Do this first so we can
1142 * unlock the list mutex.
1144 for ( se=sl->sl_head; se; se=se->se_next ) {
1145 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1146 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1147 if ( se->se_tag == LDAP_REQ_DELETE ) {
1154 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1155 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1156 uuids[j].bv_len = UUID_LEN;
1158 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1162 /* Zero out unused slots */
1163 for ( i=ndel; i < num - nmods; i++ )
1164 uuids[i].bv_len = 0;
1166 /* Mods must be validated to see if they belong in this delete set.
1170 /* Strip any duplicates */
1171 for ( i=0; i<nmods; i++ ) {
1172 for ( j=0; j<ndel; j++ ) {
1173 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1174 uuids[num - 1 - i].bv_len = 0;
1179 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1180 for ( j=0; j<i; j++ ) {
1181 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1182 uuids[num - 1 - i].bv_len = 0;
1191 SlapReply frs = { REP_RESULT };
1194 #ifdef LDAP_COMP_MATCH
1195 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1197 AttributeAssertion eq;
1199 slap_callback cb = {0};
1203 fop.o_sync_mode = 0;
1204 fop.o_callback = &cb;
1205 fop.ors_limit = NULL;
1206 fop.ors_tlimit = SLAP_NO_LIMIT;
1207 fop.ors_attrs = slap_anlist_all_attributes;
1208 fop.ors_attrsonly = 0;
1209 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1211 af.f_choice = LDAP_FILTER_AND;
1214 mf.f_choice = LDAP_FILTER_EQUALITY;
1216 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1217 mf.f_next = fop.ors_filter;
1219 fop.ors_filter = ⁡
1221 cb.sc_response = playlog_cb;
1222 fop.o_bd->bd_info = on->on_info->oi_orig;
1224 for ( i=ndel; i<num; i++ ) {
1225 if ( uuids[i].bv_len == 0 ) continue;
1227 mf.f_av_value = uuids[i];
1228 cb.sc_private = NULL;
1230 rc = fop.o_bd->be_search( &fop, &frs );
1232 /* If entry was not found, add to delete list */
1233 if ( !cb.sc_private ) {
1234 uuids[ndel++] = uuids[i];
1237 fop.o_bd->bd_info = (BackendInfo *)on;
1240 uuids[ndel].bv_val = NULL;
1241 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1246 syncprov_op_response( Operation *op, SlapReply *rs )
1248 opcookie *opc = op->o_callback->sc_private;
1249 slap_overinst *on = opc->son;
1250 syncprov_info_t *si = on->on_bi.bi_private;
1253 if ( rs->sr_err == LDAP_SUCCESS )
1255 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1256 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1258 /* Update our context CSN */
1260 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1261 slap_get_commit_csn( op, &maxcsn, &curcsn );
1262 if ( !BER_BVISNULL( &maxcsn ) ) {
1263 strcpy( cbuf, maxcsn.bv_val );
1264 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1265 strcpy( si->si_ctxcsnbuf, cbuf );
1266 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1270 /* Don't do any processing for consumer contextCSN updates */
1271 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1272 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1273 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1274 return SLAP_CB_CONTINUE;
1278 if ( si->si_chkops || si->si_chktime ) {
1280 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1284 if ( si->si_chktime &&
1285 (op->o_time - si->si_chklast >= si->si_chktime )) {
1287 si->si_chklast = op->o_time;
1290 syncprov_checkpoint( op, rs, on );
1293 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1295 opc->sctxcsn.bv_len = maxcsn.bv_len;
1296 opc->sctxcsn.bv_val = cbuf;
1298 /* Handle any persistent searches */
1302 case LDAP_REQ_MODIFY:
1303 case LDAP_REQ_MODRDN:
1304 case LDAP_REQ_EXTENDED:
1305 syncprov_matchops( op, opc, 0 );
1307 case LDAP_REQ_DELETE:
1308 /* for each match in opc->smatches:
1311 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1312 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1313 if ( sm->sm_op->s_op->o_abandon )
1315 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1316 LDAP_SYNC_DELETE, 1 );
1318 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1323 /* Add any log records */
1324 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1325 syncprov_add_slog( op, &curcsn );
1329 return SLAP_CB_CONTINUE;
1332 /* We don't use a subentry to store the context CSN any more.
1333 * We expose the current context CSN as an operational attribute
1334 * of the suffix entry.
1337 syncprov_op_compare( Operation *op, SlapReply *rs )
1339 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1340 syncprov_info_t *si = on->on_bi.bi_private;
1341 int rc = SLAP_CB_CONTINUE;
1343 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1344 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1348 struct berval bv[2];
1350 e.e_name = op->o_bd->be_suffix[0];
1351 e.e_nname = op->o_bd->be_nsuffix[0];
1353 BER_BVZERO( &bv[1] );
1354 bv[0] = si->si_ctxcsn;
1356 a.a_desc = slap_schema.si_ad_contextCSN;
1358 a.a_nvals = a.a_vals;
1360 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1362 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1363 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1364 if ( ! rs->sr_err ) {
1365 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1366 goto return_results;
1369 if ( get_assert( op ) &&
1370 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1372 rs->sr_err = LDAP_ASSERTION_FAILED;
1373 goto return_results;
1377 rs->sr_err = LDAP_COMPARE_FALSE;
1379 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1380 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1381 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1382 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1384 rs->sr_err = LDAP_COMPARE_TRUE;
1389 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1391 send_ldap_result( op, rs );
1393 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1394 rs->sr_err = LDAP_SUCCESS;
1403 syncprov_op_mod( Operation *op, SlapReply *rs )
1405 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1406 syncprov_info_t *si = on->on_bi.bi_private;
1408 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1410 (si->si_ops ? sizeof(modinst) : 0 ),
1412 opcookie *opc = (opcookie *)(cb+1);
1414 cb->sc_response = syncprov_op_response;
1415 cb->sc_cleanup = syncprov_op_cleanup;
1416 cb->sc_private = opc;
1417 cb->sc_next = op->o_callback;
1418 op->o_callback = cb;
1420 /* If there are active persistent searches, lock this operation.
1421 * See seqmod.c for the locking logic on its own.
1424 modtarget *mt, mtdummy;
1427 mi = (modinst *)(opc+1);
1430 /* See if we're already modifying this entry... */
1432 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1433 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1435 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1436 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1437 mt->mt_tail->mi_next = mi;
1439 /* wait for this op to get to head of list */
1440 while ( mt->mt_mods != mi ) {
1441 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1442 ldap_pvt_thread_yield();
1443 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1445 /* clean up if the caller is giving up */
1446 if ( op->o_abandon ) {
1448 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1450 m2->mi_next = mi->mi_next;
1451 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1452 op->o_tmpfree( cb, op->o_tmpmemctx );
1453 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1454 return SLAPD_ABANDON;
1457 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1459 /* Record that we're modifying this entry now */
1460 mt = ch_malloc( sizeof(modtarget) );
1463 mt->mt_op = mi->mi_op;
1464 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1465 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1466 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1470 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1471 syncprov_matchops( op, opc, 1 );
1474 return SLAP_CB_CONTINUE;
1478 syncprov_op_extended( Operation *op, SlapReply *rs )
1480 if ( exop_is_write( op ))
1481 return syncprov_op_mod( op, rs );
1483 return SLAP_CB_CONTINUE;
1486 typedef struct searchstate {
1487 slap_overinst *ss_on;
1493 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1495 if ( rs->sr_ctrls ) {
1496 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1497 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1498 rs->sr_ctrls = NULL;
1504 syncprov_detach_op( Operation *op, syncops *so )
1510 GroupAssertion *g1, *g2;
1512 /* count the search attrs */
1513 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1514 alen += op->ors_attrs[i].an_name.bv_len + 1;
1516 /* Make a new copy of the operation */
1517 size = sizeof(Operation) + sizeof(Opheader) +
1518 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1519 op->o_req_dn.bv_len + 1 +
1520 op->o_req_ndn.bv_len + 1 +
1521 op->o_ndn.bv_len + 1 +
1522 so->s_filterstr.bv_len + 1;
1523 op2 = (Operation *)ch_calloc( 1, size );
1524 op2->o_hdr = (Opheader *)(op2+1);
1526 /* Copy the fields we care about explicitly, leave the rest alone */
1527 *op2->o_hdr = *op->o_hdr;
1528 op2->o_tag = op->o_tag;
1529 op2->o_time = op->o_time;
1530 op2->o_bd = op->o_bd;
1531 op2->o_request = op->o_request;
1534 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1535 ptr = (char *)(op2->ors_attrs+i+1);
1536 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1537 op2->ors_attrs[i] = op->ors_attrs[i];
1538 op2->ors_attrs[i].an_name.bv_val = ptr;
1539 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1541 BER_BVZERO( &op2->ors_attrs[i].an_name );
1543 ptr = (char *)(op2->o_hdr + 1);
1545 op2->o_authz = op->o_authz;
1546 op2->o_ndn.bv_val = ptr;
1547 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1548 op2->o_dn = op2->o_ndn;
1549 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1550 op2->o_req_dn.bv_val = ptr;
1551 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1552 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1553 op2->o_req_ndn.bv_val = ptr;
1554 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1555 op2->ors_filterstr.bv_val = ptr;
1556 strcpy( ptr, so->s_filterstr.bv_val );
1557 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1558 op2->ors_filter = str2filter( ptr );
1561 /* Copy any cached group ACLs individually */
1562 op2->o_groups = NULL;
1563 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1564 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1566 strcpy( g2->ga_ndn, g1->ga_ndn );
1567 g2->ga_next = op2->o_groups;
1571 /* Add op2 to conn so abandon will find us */
1572 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1573 op->o_conn->c_n_ops_executing++;
1574 op->o_conn->c_n_ops_completed--;
1575 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1576 so->s_flags |= PS_IS_DETACHED;
1577 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1581 syncprov_search_response( Operation *op, SlapReply *rs )
1583 searchstate *ss = op->o_callback->sc_private;
1584 slap_overinst *on = ss->ss_on;
1585 syncprov_info_t *si = on->on_bi.bi_private;
1586 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1588 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1590 /* If we got a referral without a referral object, there's
1591 * something missing that we cannot replicate. Just ignore it.
1592 * The consumer will abort because we didn't send the expected
1595 if ( !rs->sr_entry ) {
1596 assert( rs->sr_entry );
1597 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1598 return SLAP_CB_CONTINUE;
1600 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1601 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1602 slap_schema.si_ad_entryCSN );
1604 /* Don't send the ctx entry twice */
1605 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1606 return LDAP_SUCCESS;
1608 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1610 rs->sr_ctrls[1] = NULL;
1611 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1612 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1613 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1614 struct berval cookie;
1616 slap_compose_sync_cookie( op, &cookie,
1617 &op->ors_filter->f_and->f_ava->aa_value,
1618 srs->sr_state.rid );
1620 /* Is this a regular refresh? */
1622 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1624 rs->sr_ctrls[1] = NULL;
1625 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1626 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1627 LDAP_SYNC_REFRESH_DELETES );
1630 /* It's RefreshAndPersist, transition to Persist phase */
1631 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1632 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1633 &cookie, 1, NULL, 0 );
1634 /* Flush any queued persist messages */
1635 if ( ss->ss_so->s_res ) {
1636 syncres *sr, *srnext;
1641 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1643 for (sr = ss->ss_so->s_res; sr; sr=srnext) {
1644 int rc = LDAP_SUCCESS;
1645 srnext = sr->s_next;
1647 opc.sndn = sr->s_ndn;
1648 opc.suuid = sr->s_uuid;
1649 opc.sctxcsn = sr->s_csn;
1650 opc.sreference = sr->s_isreference;
1653 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
1654 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1655 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
1656 op->o_bd->bd_info = (BackendInfo *)on;
1658 if ( rc == LDAP_SUCCESS )
1659 syncprov_sendresp( op, &opc, ss->ss_so, e,
1663 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1664 be_entry_release_rw( op, e, 0 );
1665 op->o_bd->bd_info = (BackendInfo *)on;
1669 ss->ss_so->s_res = NULL;
1670 ss->ss_so->s_restail = NULL;
1673 /* Turn off the refreshing flag */
1674 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1676 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1678 /* Detach this Op from frontend control */
1679 syncprov_detach_op( op, ss->ss_so );
1681 return LDAP_SUCCESS;
1685 return SLAP_CB_CONTINUE;
1689 syncprov_op_search( Operation *op, SlapReply *rs )
1691 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1692 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1694 int gotstate = 0, nochange = 0, do_present = 1;
1695 Filter *fand, *fava;
1696 syncops *sop = NULL;
1699 struct berval ctxcsn;
1700 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1702 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1704 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1705 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1709 srs = op->o_controls[slap_cids.sc_LDAPsync];
1710 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1712 /* If this is a persistent search, set it up right away */
1713 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1723 so.s_flags = PS_IS_REFRESHING;
1724 /* syncprov_findbase expects to be called as a callback... */
1725 sc.sc_private = &opc;
1727 cb = op->o_callback;
1728 op->o_callback = ≻
1729 rs->sr_err = syncprov_findbase( op, &fc );
1730 op->o_callback = cb;
1732 if ( rs->sr_err != LDAP_SUCCESS ) {
1733 send_ldap_result( op, rs );
1736 sop = ch_malloc( sizeof( syncops ));
1738 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1739 sop->s_rid = srs->sr_state.rid;
1742 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1743 sop->s_next = si->si_ops;
1745 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1748 /* snapshot the ctxcsn */
1749 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1750 strcpy( csnbuf, si->si_ctxcsnbuf );
1751 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1752 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1753 ctxcsn.bv_val = csnbuf;
1755 /* If we have a cookie, handle the PRESENT lookups */
1756 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1759 /* The cookie was validated when it was parsed, just use it */
1761 /* If just Refreshing and nothing has changed, shortcut it */
1762 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1764 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1765 LDAPControl *ctrls[2];
1769 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1770 NULL, LDAP_SYNC_REFRESH_DELETES );
1771 rs->sr_ctrls = ctrls;
1772 rs->sr_err = LDAP_SUCCESS;
1773 send_ldap_result( op, rs );
1774 rs->sr_ctrls = NULL;
1779 /* Do we have a sessionlog for this search? */
1782 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1783 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1785 /* mutex is unlocked in playlog */
1786 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1788 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1791 /* Is the CSN still present in the database? */
1792 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1793 /* No, so a reload is required */
1794 #if 0 /* the consumer doesn't seem to send this hint */
1795 if ( op->o_sync_rhint == 0 ) {
1796 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1802 /* If changed and doing Present lookup, send Present UUIDs */
1803 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1805 send_ldap_result( op, rs );
1812 /* Append CSN range to search filter, save original filter
1813 * for persistent search evaluation
1816 sop->s_filterstr= op->ors_filterstr;
1819 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1820 fand->f_choice = LDAP_FILTER_AND;
1821 fand->f_next = NULL;
1822 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1823 fava->f_choice = LDAP_FILTER_LE;
1824 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1825 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1826 #ifdef LDAP_COMP_MATCH
1827 fava->f_ava->aa_cf = NULL;
1829 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1832 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1833 fava = fava->f_next;
1834 fava->f_choice = LDAP_FILTER_GE;
1835 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1836 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1837 #ifdef LDAP_COMP_MATCH
1838 fava->f_ava->aa_cf = NULL;
1840 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1842 fava->f_next = op->ors_filter;
1843 op->ors_filter = fand;
1844 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1846 /* Let our callback add needed info to returned entries */
1847 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1848 ss = (searchstate *)(cb+1);
1851 ss->ss_present = do_present;
1852 cb->sc_response = syncprov_search_response;
1853 cb->sc_cleanup = syncprov_search_cleanup;
1854 cb->sc_private = ss;
1855 cb->sc_next = op->o_callback;
1856 op->o_callback = cb;
1858 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1859 op->o_sync_mode &= SLAP_CONTROL_MASK;
1862 /* If this is a persistent search and no changes were reported during
1863 * the refresh phase, just invoke the response callback to transition
1864 * us into persist phase
1867 rs->sr_err = LDAP_SUCCESS;
1868 rs->sr_nentries = 0;
1869 send_ldap_result( op, rs );
1872 return SLAP_CB_CONTINUE;
1876 syncprov_operational(
1880 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1881 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1883 if ( rs->sr_entry &&
1884 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1886 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1887 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1888 Attribute *a, **ap = NULL;
1890 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1891 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1896 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1898 a = ch_malloc( sizeof(Attribute));
1899 a->a_desc = slap_schema.si_ad_contextCSN;
1900 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1901 a->a_vals[1].bv_val = NULL;
1902 a->a_nvals = a->a_vals;
1908 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1910 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1912 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1914 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1917 return SLAP_CB_CONTINUE;
1929 slap_overinst *on = (slap_overinst *)be->bd_info;
1930 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1932 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1934 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1935 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1938 si->si_chkops = atoi( argv[1] );
1939 si->si_chktime = atoi( argv[2] ) * 60;
1942 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
1946 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1947 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
1950 size = atoi( argv[1] );
1953 "%s: line %d: session log size %d is negative\n",
1954 fname, lineno, size );
1959 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
1960 sl->sl_mincsn.bv_val = (char *)(sl+1);
1961 sl->sl_mincsn.bv_len = 0;
1963 sl->sl_head = sl->sl_tail = NULL;
1964 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
1971 return SLAP_CONF_UNKNOWN;
1974 /* Cheating - we have no thread pool context for these functions,
1977 typedef struct thread_keys {
1980 ldap_pvt_thread_pool_keyfree_t *xfree;
1984 /* A fake thread context */
1985 static thread_keys thrctx[MAXKEYS];
1987 /* Read any existing contextCSN from the underlying db.
1988 * Then search for any entries newer than that. If no value exists,
1989 * just generate it. Cache whatever result.
1996 slap_overinst *on = (slap_overinst *) be->bd_info;
1997 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2000 char opbuf[OPERATION_BUFFER_SIZE];
2001 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2002 Operation *op = (Operation *)opbuf;
2007 if ( slapMode & SLAP_TOOL_MODE ) {
2011 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2016 connection_fake_init( &conn, op, thrctx );
2018 op->o_dn = be->be_rootdn;
2019 op->o_ndn = be->be_rootndn;
2021 ctxcsnbuf[0] = '\0';
2023 op->o_bd->bd_info = on->on_info->oi_orig;
2024 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2025 slap_schema.si_ad_contextCSN, 0, &e );
2028 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2030 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2031 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2032 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2033 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2034 si->si_ctxcsn.bv_len );
2035 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2036 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2038 be_entry_release_rw( op, e, 0 );
2039 op->o_bd->bd_info = (BackendInfo *)on;
2040 op->o_req_dn = be->be_suffix[0];
2041 op->o_req_ndn = be->be_nsuffix[0];
2042 op->ors_scope = LDAP_SCOPE_SUBTREE;
2043 syncprov_findcsn( op, FIND_MAXCSN );
2044 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2045 /* If we're also a consumer, and we didn't find the context entry,
2046 * then don't generate anything, wait for our provider to send it
2052 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2053 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2054 &si->si_ctxcsn, 0 );
2057 /* If our ctxcsn is different from what was read from the root
2058 * entry, write the new value out.
2060 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2061 SlapReply rs = {REP_RESULT};
2062 syncprov_checkpoint( op, &rs, on );
2066 op->o_bd->bd_info = (BackendInfo *)on;
2070 /* Write the current contextCSN into the underlying db.
2077 slap_overinst *on = (slap_overinst *) be->bd_info;
2078 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2081 if ( slapMode & SLAP_TOOL_MODE ) {
2084 if ( si->si_numops ) {
2086 char opbuf[OPERATION_BUFFER_SIZE];
2087 Operation *op = (Operation *)opbuf;
2088 SlapReply rs = {REP_RESULT};
2090 connection_fake_init( &conn, op, thrctx );
2092 op->o_dn = be->be_rootdn;
2093 op->o_ndn = be->be_rootndn;
2094 syncprov_checkpoint( op, &rs, on );
2096 for ( i=0; thrctx[i].key; i++) {
2097 if ( thrctx[i].xfree )
2098 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2099 thrctx[i].key = NULL;
2110 slap_overinst *on = (slap_overinst *)be->bd_info;
2111 syncprov_info_t *si;
2113 si = ch_calloc(1, sizeof(syncprov_info_t));
2114 on->on_bi.bi_private = si;
2115 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2116 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2117 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2118 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2120 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2121 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2123 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2124 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2130 syncprov_db_destroy(
2134 slap_overinst *on = (slap_overinst *)be->bd_info;
2135 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2138 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2139 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2140 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2147 static int syncprov_parseCtrl (
2156 struct berval cookie = BER_BVNULL;
2160 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2161 rs->sr_text = "Sync control specified multiple times";
2162 return LDAP_PROTOCOL_ERROR;
2165 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2166 rs->sr_text = "Sync control specified with pagedResults control";
2167 return LDAP_PROTOCOL_ERROR;
2170 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2171 rs->sr_text = "Sync control value is empty (or absent)";
2172 return LDAP_PROTOCOL_ERROR;
2175 /* Parse the control value
2176 * syncRequestValue ::= SEQUENCE {
2181 * refreshAndPersist (3)
2183 * cookie syncCookie OPTIONAL
2187 ber = ber_init( &ctrl->ldctl_value );
2189 rs->sr_text = "internal error";
2193 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2194 rs->sr_text = "Sync control : mode decoding error";
2195 return LDAP_PROTOCOL_ERROR;
2199 case LDAP_SYNC_REFRESH_ONLY:
2200 mode = SLAP_SYNC_REFRESH;
2202 case LDAP_SYNC_REFRESH_AND_PERSIST:
2203 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2206 rs->sr_text = "Sync control : unknown update mode";
2207 return LDAP_PROTOCOL_ERROR;
2210 tag = ber_peek_tag( ber, &len );
2212 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2213 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2214 rs->sr_text = "Sync control : cookie decoding error";
2215 return LDAP_PROTOCOL_ERROR;
2218 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2219 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2220 rs->sr_text = "Sync control : rhint decoding error";
2221 return LDAP_PROTOCOL_ERROR;
2224 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2225 rs->sr_text = "Sync control : decoding error";
2226 return LDAP_PROTOCOL_ERROR;
2228 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2229 sr->sr_rhint = rhint;
2230 if (!BER_BVISNULL(&cookie)) {
2231 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2232 slap_parse_sync_cookie( &sr->sr_state );
2235 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2237 (void) ber_free( ber, 1 );
2239 op->o_sync = ctrl->ldctl_iscritical
2240 ? SLAP_CONTROL_CRITICAL
2241 : SLAP_CONTROL_NONCRITICAL;
2243 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2245 return LDAP_SUCCESS;
2248 /* This overlay is set up for dynamic loading via moduleload. For static
2249 * configuration, you'll need to arrange for the slap_overinst to be
2250 * initialized and registered by some other function inside slapd.
2253 static slap_overinst syncprov;
2260 rc = register_supported_control( LDAP_CONTROL_SYNC,
2261 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2262 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2263 if ( rc != LDAP_SUCCESS ) {
2264 fprintf( stderr, "Failed to register control %d\n", rc );
2268 syncprov.on_bi.bi_type = "syncprov";
2269 syncprov.on_bi.bi_db_init = syncprov_db_init;
2270 syncprov.on_bi.bi_db_config = syncprov_db_config;
2271 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2272 syncprov.on_bi.bi_db_open = syncprov_db_open;
2273 syncprov.on_bi.bi_db_close = syncprov_db_close;
2275 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2276 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2278 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2279 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2280 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2281 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2282 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2283 syncprov.on_bi.bi_op_search = syncprov_op_search;
2284 syncprov.on_bi.bi_extended = syncprov_op_extended;
2285 syncprov.on_bi.bi_operational = syncprov_operational;
2287 return overlay_register( &syncprov );
2290 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2292 init_module( int argc, char *argv[] )
2294 return syncprov_init();
2296 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2298 #endif /* defined(SLAPD_OVER_SYNCPROV) */