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 */
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 sessionlog *sl_next;
106 struct berval sl_mincsn;
111 ldap_pvt_thread_mutex_t sl_mutex;
114 /* The main state for this overlay */
115 typedef struct syncprov_info_t {
117 struct berval si_ctxcsn; /* ldapsync context */
118 int si_chkops; /* checkpointing info */
120 int si_numops; /* number of ops since last checkpoint */
121 time_t si_chklast; /* time of last checkpoint */
122 Avlnode *si_mods; /* entries being modified */
124 ldap_pvt_thread_mutex_t si_csn_mutex;
125 ldap_pvt_thread_mutex_t si_ops_mutex;
126 ldap_pvt_thread_mutex_t si_mods_mutex;
127 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
130 typedef struct opcookie {
132 syncmatches *smatches;
133 struct berval sdn; /* DN of entry, for deletes */
135 struct berval suuid; /* UUID of entry */
136 struct berval sctxcsn;
137 int sreference; /* Is the entry a reference? */
140 typedef struct fbase_cookie {
141 struct berval *fdn; /* DN of a modified entry, for scope testing */
142 syncops *fss; /* persistent search we're testing against */
143 int fbase; /* if TRUE we found the search base and it's still valid */
144 int fscope; /* if TRUE then fdn is within the psearch scope */
147 static AttributeName csn_anlist[2];
148 static AttributeName uuid_anlist[2];
150 /* Build a LDAPsync intermediate state control */
156 int entry_sync_state,
160 struct berval *cookie )
165 const char *text = NULL;
167 BerElementBuffer berbuf;
168 BerElement *ber = (BerElement *)&berbuf;
170 struct berval entryuuid_bv = BER_BVNULL;
172 ber_init2( ber, 0, LBER_USE_DER );
173 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
175 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
177 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
178 AttributeDescription *desc = a->a_desc;
179 if ( desc == slap_schema.si_ad_entryUUID ) {
180 entryuuid_bv = a->a_nvals[0];
185 if ( send_cookie && cookie ) {
186 ber_printf( ber, "{eOON}",
187 entry_sync_state, &entryuuid_bv, cookie );
189 ber_printf( ber, "{eON}",
190 entry_sync_state, &entryuuid_bv );
193 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
194 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
195 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
200 Debug( LDAP_DEBUG_TRACE,
201 "slap_build_sync_ctrl: ber_flatten2 failed\n",
203 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
210 /* Build a LDAPsync final state control */
218 struct berval *cookie,
222 BerElementBuffer berbuf;
223 BerElement *ber = (BerElement *)&berbuf;
225 ber_init2( ber, NULL, LBER_USE_DER );
226 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
228 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
230 ber_printf( ber, "{" );
231 if ( send_cookie && cookie ) {
232 ber_printf( ber, "O", cookie );
234 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
235 ber_printf( ber, "b", refreshDeletes );
237 ber_printf( ber, "N}" );
239 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
240 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
241 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
246 Debug( LDAP_DEBUG_TRACE,
247 "syncprov_done_ctrl: ber_flatten2 failed\n",
249 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
257 /* Generate state based on session log - not implemented yet */
259 syncprov_state_ctrl_from_slog(
262 struct slog_entry *slog_e,
263 int entry_sync_state,
267 struct berval *cookie)
272 const char *text = NULL;
274 BerElementBuffer berbuf;
275 BerElement *ber = (BerElement *)&berbuf;
277 struct berval entryuuid_bv = BER_BVNULL;
279 ber_init2( ber, NULL, LBER_USE_DER );
280 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
282 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
284 entryuuid_bv = slog_e->sl_uuid;
286 if ( send_cookie && cookie ) {
287 ber_printf( ber, "{eOON}",
288 entry_sync_state, &entryuuid_bv, cookie );
290 ber_printf( ber, "{eON}",
291 entry_sync_state, &entryuuid_bv );
294 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
295 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
296 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
301 Debug( LDAP_DEBUG_TRACE,
302 "slap_build_sync_ctrl: ber_flatten2 failed\n",
304 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
317 struct berval *cookie,
322 BerElementBuffer berbuf;
323 BerElement *ber = (BerElement *)&berbuf;
324 struct berval rspdata;
328 ber_init2( ber, NULL, LBER_USE_DER );
329 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
333 case LDAP_TAG_SYNC_NEW_COOKIE:
334 ber_printf( ber, "tO", type, cookie );
336 case LDAP_TAG_SYNC_REFRESH_DELETE:
337 case LDAP_TAG_SYNC_REFRESH_PRESENT:
338 ber_printf( ber, "t{", type );
340 ber_printf( ber, "O", cookie );
342 if ( refreshDone == 0 ) {
343 ber_printf( ber, "b", refreshDone );
345 ber_printf( ber, "N}" );
347 case LDAP_TAG_SYNC_ID_SET:
348 ber_printf( ber, "t{", type );
350 ber_printf( ber, "O", cookie );
352 if ( refreshDeletes == 1 ) {
353 ber_printf( ber, "b", refreshDeletes );
355 ber_printf( ber, "[W]", syncUUIDs );
356 ber_printf( ber, "N}" );
359 Debug( LDAP_DEBUG_TRACE,
360 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
366 ret = ber_flatten2( ber, &rspdata, 0 );
369 Debug( LDAP_DEBUG_TRACE,
370 "syncprov_sendinfo: ber_flatten2 failed\n",
372 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
376 rs->sr_rspoid = LDAP_SYNC_INFO;
377 rs->sr_rspdata = &rspdata;
378 send_ldap_intermediate( op, rs );
379 rs->sr_rspdata = NULL;
385 /* Find a modtarget in an AVL tree */
387 sp_avl_cmp( const void *c1, const void *c2 )
389 const modtarget *m1, *m2;
393 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
396 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
399 /* syncprov_findbase:
400 * finds the true DN of the base of a search (with alias dereferencing) and
401 * checks to make sure the base entry doesn't get replaced with a different
402 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
403 * change is detected, any persistent search on this base must be terminated /
405 * On the first call, we just save the DN and entryID. On subsequent calls
406 * we compare the DN and entryID with the saved values.
409 findbase_cb( Operation *op, SlapReply *rs )
411 slap_callback *sc = op->o_callback;
413 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
414 fbase_cookie *fc = sc->sc_private;
416 /* If no entryID, we're looking for the first time.
417 * Just store whatever we got.
419 if ( fc->fss->s_eid == NOID ) {
421 fc->fss->s_eid = rs->sr_entry->e_id;
422 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
424 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
425 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
427 /* OK, the DN is the same and the entryID is the same. Now
428 * see if the fdn resides in the scope.
431 switch ( fc->fss->s_op->ors_scope ) {
432 case LDAP_SCOPE_BASE:
433 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
435 case LDAP_SCOPE_ONELEVEL: {
437 dnParent( fc->fdn, &pdn );
438 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
440 case LDAP_SCOPE_SUBTREE:
441 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
443 #ifdef LDAP_SCOPE_SUBORDINATE
444 case LDAP_SCOPE_SUBORDINATE:
445 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
446 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
452 if ( rs->sr_err != LDAP_SUCCESS ) {
453 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
459 syncprov_findbase( Operation *op, fbase_cookie *fc )
461 opcookie *opc = op->o_callback->sc_private;
462 slap_overinst *on = opc->son;
463 syncprov_info_t *si = on->on_bi.bi_private;
465 slap_callback cb = {0};
467 SlapReply frs = { REP_RESULT };
472 cb.sc_response = findbase_cb;
475 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
476 fop.o_callback = &cb;
477 fop.o_tag = LDAP_REQ_SEARCH;
478 fop.ors_scope = LDAP_SCOPE_BASE;
479 fop.ors_deref = fc->fss->s_op->ors_deref;
480 fop.ors_limit = NULL;
482 fop.ors_tlimit = SLAP_NO_LIMIT;
483 fop.ors_attrs = slap_anlist_no_attrs;
484 fop.ors_attrsonly = 1;
485 fop.ors_filter = fc->fss->s_op->ors_filter;
486 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
488 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
490 fop.o_bd->bd_info = on->on_info->oi_orig;
491 rc = fop.o_bd->be_search( &fop, &frs );
492 fop.o_bd->bd_info = (BackendInfo *)on;
494 if ( fc->fbase ) return LDAP_SUCCESS;
496 /* If entryID has changed, then the base of this search has
497 * changed. Invalidate the psearch.
499 return LDAP_NO_SUCH_OBJECT;
503 * This function has three different purposes, but they all use a search
504 * that filters on entryCSN so they're combined here.
505 * 1: at startup time, after a contextCSN has been read from the database,
506 * we search for all entries with CSN >= contextCSN in case the contextCSN
507 * was not checkpointed at the previous shutdown.
509 * 2: when the current contextCSN is known and we have a sync cookie, we search
510 * for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
511 * entry is found, the cookie CSN is valid, otherwise it is stale.
513 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
514 * CSN, and generate Present records for them. We always collect this result
515 * in SyncID sets, even if there's only one match.
517 #define FIND_MAXCSN 1
519 #define FIND_PRESENT 3
522 findmax_cb( Operation *op, SlapReply *rs )
524 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
525 struct berval *maxcsn = op->o_callback->sc_private;
526 Attribute *a = attr_find( rs->sr_entry->e_attrs,
527 slap_schema.si_ad_entryCSN );
529 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
530 maxcsn->bv_len = a->a_vals[0].bv_len;
531 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
538 findcsn_cb( Operation *op, SlapReply *rs )
540 slap_callback *sc = op->o_callback;
542 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
543 sc->sc_private = (void *)1;
548 /* Build a list of entryUUIDs for sending in a SyncID set */
552 typedef struct fpres_cookie {
559 findpres_cb( Operation *op, SlapReply *rs )
561 slap_callback *sc = op->o_callback;
562 fpres_cookie *pc = sc->sc_private;
564 int ret = SLAP_CB_CONTINUE;
566 switch ( rs->sr_type ) {
568 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
570 pc->uuids[pc->num].bv_val = pc->last;
571 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
572 pc->uuids[pc->num].bv_len );
574 pc->last = pc->uuids[pc->num].bv_val;
575 pc->uuids[pc->num].bv_val = NULL;
578 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
584 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
586 pc->uuids[pc->num].bv_val = pc->last;
588 pc->last = pc->uuids[0].bv_val;
598 syncprov_findcsn( Operation *op, int mode )
600 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
601 syncprov_info_t *si = on->on_bi.bi_private;
603 slap_callback cb = {0};
605 SlapReply frs = { REP_RESULT };
606 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
607 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
608 struct berval fbuf, maxcsn;
610 AttributeAssertion eq;
611 int i, rc = LDAP_SUCCESS;
612 fpres_cookie pcookie;
615 if ( mode != FIND_MAXCSN ) {
616 srs = op->o_controls[slap_cids.sc_LDAPsync];
618 if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
624 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
628 cf.f_av_desc = slap_schema.si_ad_entryCSN;
631 fop.o_callback = &cb;
632 fop.ors_limit = NULL;
633 fop.ors_tlimit = SLAP_NO_LIMIT;
634 fop.ors_filter = &cf;
635 fop.ors_filterstr = fbuf;
639 cf.f_choice = LDAP_FILTER_GE;
640 cf.f_av_value = si->si_ctxcsn;
641 fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)",
642 cf.f_av_value.bv_val );
643 fop.ors_attrsonly = 0;
644 fop.ors_attrs = csn_anlist;
645 fop.ors_slimit = SLAP_NO_LIMIT;
646 cb.sc_private = &maxcsn;
647 cb.sc_response = findmax_cb;
648 strcpy( cbuf, si->si_ctxcsn.bv_val );
649 maxcsn.bv_val = cbuf;
650 maxcsn.bv_len = si->si_ctxcsn.bv_len;
653 cf.f_choice = LDAP_FILTER_LE;
654 cf.f_av_value = *srs->sr_state.ctxcsn;
655 fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
656 cf.f_av_value.bv_val );
657 fop.ors_attrsonly = 1;
658 fop.ors_attrs = slap_anlist_no_attrs;
660 cb.sc_private = NULL;
661 cb.sc_response = findcsn_cb;
664 af.f_choice = LDAP_FILTER_AND;
667 cf.f_choice = LDAP_FILTER_LE;
668 cf.f_av_value = *srs->sr_state.ctxcsn;
669 cf.f_next = op->ors_filter;
670 fop.ors_filter = ⁡
671 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
672 fop.ors_attrsonly = 0;
673 fop.ors_attrs = uuid_anlist;
674 fop.ors_slimit = SLAP_NO_LIMIT;
675 /* We want pure entries, not referrals */
676 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
677 cb.sc_private = &pcookie;
678 cb.sc_response = findpres_cb;
681 /* preallocate storage for a full set */
682 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
683 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
685 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
686 pcookie.uuids[0].bv_val = pcookie.last;
687 pcookie.uuids[0].bv_len = UUID_LEN;
688 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
689 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
690 pcookie.uuids[i].bv_len = UUID_LEN;
695 fop.o_bd->bd_info = on->on_info->oi_orig;
696 fop.o_bd->be_search( &fop, &frs );
697 fop.o_bd->bd_info = (BackendInfo *)on;
701 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
702 si->si_ctxcsn.bv_len = maxcsn.bv_len;
705 /* If matching CSN was not found, invalidate the context. */
706 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
709 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
710 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
717 /* Queue a persistent search response if still in Refresh stage */
719 syncprov_qresp( opcookie *opc, syncops *so, int mode )
723 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
724 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
726 sr->s_dn.bv_val = (char *)(sr + 1);
728 sr->s_isreference = opc->sreference;
729 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
730 *(sr->s_ndn.bv_val++) = '\0';
731 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
732 *(sr->s_uuid.bv_val++) = '\0';
733 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
738 so->s_restail->s_next = sr;
741 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
745 /* Send a persistent search response */
747 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry *e, int mode, int queue )
749 slap_overinst *on = opc->son;
750 syncprov_info_t *si = on->on_bi.bi_private;
752 SlapReply rs = { REP_SEARCH };
753 LDAPControl *ctrls[2];
754 struct berval cookie;
756 Attribute a_uuid = {0};
757 Operation sop = *so->s_op;
762 sop.o_tmpmemctx = op->o_tmpmemctx;
764 sop.o_controls = op->o_controls;
766 if ( queue && (so->s_flags & PS_IS_REFRESHING) ) {
767 ldap_pvt_thread_mutex_lock( &so->s_mutex );
768 if ( so->s_flags & PS_IS_REFRESHING )
769 return syncprov_qresp( opc, so, mode );
770 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
774 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn,
775 so->s_sid, so->s_rid );
777 e_uuid.e_attrs = &a_uuid;
778 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
779 a_uuid.a_nvals = &opc->suuid;
780 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
781 mode, ctrls, 0, 1, &cookie );
787 if ( opc->sreference ) {
788 rs.sr_ref = get_entry_referrals( &sop, e );
789 send_search_reference( &sop, &rs );
790 ber_bvarray_free( rs.sr_ref );
794 case LDAP_SYNC_MODIFY:
795 rs.sr_attrs = sop.ors_attrs;
796 send_search_entry( &sop, &rs );
798 case LDAP_SYNC_DELETE:
799 e_uuid.e_attrs = NULL;
800 e_uuid.e_name = opc->sdn;
801 e_uuid.e_nname = opc->sndn;
802 rs.sr_entry = &e_uuid;
803 if ( opc->sreference ) {
804 struct berval bv = BER_BVNULL;
806 send_search_reference( &sop, &rs );
808 send_search_entry( &sop, &rs );
814 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
820 syncprov_free_syncop( syncops *so )
822 syncres *sr, *srnext;
823 GroupAssertion *ga, *gnext;
825 ldap_pvt_thread_mutex_lock( &so->s_mutex );
827 if ( so->s_inuse > 0 ) {
828 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
831 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
832 if ( so->s_flags & PS_IS_DETACHED ) {
833 filter_free( so->s_op->ors_filter );
834 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
840 ch_free( so->s_base.bv_val );
841 for ( sr=so->s_res; sr; sr=srnext ) {
845 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
850 syncprov_drop_psearch( syncops *so, int lock )
852 if ( so->s_flags & PS_IS_DETACHED ) {
854 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
855 so->s_op->o_conn->c_n_ops_executing--;
856 so->s_op->o_conn->c_n_ops_completed++;
857 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
860 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
862 syncprov_free_syncop( so );
866 syncprov_op_abandon( Operation *op, SlapReply *rs )
868 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
869 syncprov_info_t *si = on->on_bi.bi_private;
870 syncops *so, *soprev;
872 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
873 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
874 soprev=so, so=so->s_next ) {
875 if ( so->s_op->o_connid == op->o_connid &&
876 so->s_op->o_msgid == op->orn_msgid ) {
877 so->s_op->o_abandon = 1;
878 soprev->s_next = so->s_next;
882 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
884 /* Is this really a Cancel exop? */
885 if ( op->o_tag != LDAP_REQ_ABANDON ) {
886 rs->sr_err = LDAP_CANCELLED;
887 send_ldap_result( so->s_op, rs );
889 /* Our cloned searches have no ctrls set.
890 * we don't want to muck with real search ops
893 if ( ! so->s_op->o_sync )
894 syncprov_drop_psearch( so, 0 );
896 return SLAP_CB_CONTINUE;
899 /* Find which persistent searches are affected by this operation */
901 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
903 slap_overinst *on = opc->son;
904 syncprov_info_t *si = on->on_bi.bi_private;
907 syncops *ss, *sprev, *snext;
914 fc.fdn = &op->o_req_ndn;
916 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
918 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
919 else dnParent( fc.fdn, &pdn );
920 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
924 if ( op->o_tag != LDAP_REQ_ADD ) {
925 op->o_bd->bd_info = (BackendInfo *)on->on_info;
926 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
927 op->o_bd->bd_info = (BackendInfo *)on;
933 /* Never replicate these */
934 if ( is_entry_syncConsumerSubentry( e )) {
938 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
939 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
940 opc->sreference = is_entry_referral( e );
942 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
943 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
945 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
948 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
949 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
950 sprev = ss, ss=snext)
961 /* If the base of the search is missing, signal a refresh */
962 rc = syncprov_findbase( op, &fc );
963 if ( rc != LDAP_SUCCESS ) {
964 SlapReply rs = {REP_RESULT};
965 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
966 "search base has changed" );
967 sprev->s_next = snext;
968 syncprov_drop_psearch( ss, 1 );
972 /* If we're sending results now, look for this op in old matches */
975 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
976 old=sm, sm=sm->sm_next ) {
977 if ( sm->sm_op == ss ) {
979 old->sm_next = sm->sm_next;
980 op->o_tmpfree( sm, op->o_tmpmemctx );
986 /* check if current o_req_dn is in scope and matches filter */
987 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
988 LDAP_COMPARE_TRUE ) {
990 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
991 sm->sm_next = opc->smatches;
996 /* if found send UPDATE else send ADD */
997 syncprov_sendresp( op, opc, ss, e,
998 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1000 } else if ( !saveit && found ) {
1002 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1005 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1007 if ( op->o_tag != LDAP_REQ_ADD ) {
1008 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1009 be_entry_release_rw( op, e, 0 );
1010 op->o_bd->bd_info = (BackendInfo *)on;
1013 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1018 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1020 slap_callback *cb = op->o_callback;
1021 opcookie *opc = cb->sc_private;
1022 slap_overinst *on = opc->son;
1023 syncprov_info_t *si = on->on_bi.bi_private;
1024 syncmatches *sm, *snext;
1025 modtarget *mt, mtdummy;
1027 for (sm = opc->smatches; sm; sm=snext) {
1028 snext = sm->sm_next;
1029 syncprov_free_syncop( sm->sm_op );
1030 op->o_tmpfree( sm, op->o_tmpmemctx );
1033 /* Remove op from lock table */
1035 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1036 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1037 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1039 modinst *mi = mt->mt_mods;
1041 /* If there are more, promote the next one */
1042 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1043 if ( mi->mi_next ) {
1044 mt->mt_mods = mi->mi_next;
1045 mt->mt_op = mt->mt_mods->mi_op;
1046 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1048 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1049 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1050 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1051 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1052 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1056 if ( !BER_BVISNULL( &opc->suuid ))
1057 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1058 if ( !BER_BVISNULL( &opc->sndn ))
1059 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1060 if ( !BER_BVISNULL( &opc->sdn ))
1061 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1062 op->o_callback = cb->sc_next;
1063 op->o_tmpfree(cb, op->o_tmpmemctx);
1067 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1069 syncprov_info_t *si = on->on_bi.bi_private;
1072 struct berval bv[2];
1074 slap_callback cb = {0};
1076 mod.sml_values = bv;
1077 bv[1].bv_val = NULL;
1078 bv[0] = si->si_ctxcsn;
1079 mod.sml_nvalues = NULL;
1080 mod.sml_desc = slap_schema.si_ad_contextCSN;
1081 mod.sml_op = LDAP_MOD_REPLACE;
1082 mod.sml_next = NULL;
1084 cb.sc_response = slap_null_cb;
1086 opm.o_tag = LDAP_REQ_MODIFY;
1087 opm.o_callback = &cb;
1088 opm.orm_modlist = &mod;
1089 opm.o_req_dn = op->o_bd->be_suffix[0];
1090 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1091 orig = opm.o_bd->bd_info;
1092 opm.o_bd->bd_info = on->on_info->oi_orig;
1093 opm.o_bd->be_modify( &opm, rs );
1097 syncprov_add_slog( Operation *op, struct berval *csn )
1099 opcookie *opc = op->o_callback->sc_private;
1100 slap_overinst *on = opc->son;
1101 syncprov_info_t *si = on->on_bi.bi_private;
1105 for ( sl = si->si_logs; sl; sl=sl->sl_next ) {
1106 /* Allocate a record. UUIDs are not NUL-terminated. */
1107 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1110 se->se_tag = op->o_tag;
1112 se->se_uuid.bv_val = (char *)(se+1);
1113 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1114 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1115 se->se_uuid.bv_len = opc->suuid.bv_len;
1117 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1118 se->se_csn.bv_val[csn->bv_len] = '\0';
1119 se->se_csn.bv_len = csn->bv_len;
1121 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1122 if ( sl->sl_head ) {
1123 sl->sl_tail->se_next = se;
1129 while ( sl->sl_num > sl->sl_size ) {
1131 sl->sl_head = se->se_next;
1132 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1133 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1136 if ( !sl->sl_head ) {
1140 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1144 /* Just set a flag if we found the matching entry */
1146 playlog_cb( Operation *op, SlapReply *rs )
1148 if ( rs->sr_type == REP_SEARCH ) {
1149 op->o_callback->sc_private = (void *)1;
1154 /* enter with sl->sl_mutex locked, release before returning */
1156 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1157 struct berval *oldcsn, struct berval *ctxcsn )
1159 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1160 syncprov_info_t *si = on->on_bi.bi_private;
1162 int i, j, ndel, num, nmods, mmods;
1165 if ( !sl->sl_num ) {
1166 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1174 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1175 num * UUID_LEN, op->o_tmpmemctx );
1177 uuids[0].bv_val = (char *)(uuids + num + 1);
1179 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1180 * and everything else at the end. Do this first so we can
1181 * unlock the list mutex.
1183 for ( se=sl->sl_head; se; se=se->se_next ) {
1184 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1185 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1186 if ( se->se_tag == LDAP_REQ_DELETE ) {
1193 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1194 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1195 uuids[j].bv_len = UUID_LEN;
1197 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1201 /* Zero out unused slots */
1202 for ( i=ndel; i < num - nmods; i++ )
1203 uuids[i].bv_len = 0;
1205 /* Mods must be validated to see if they belong in this delete set.
1209 /* Strip any duplicates */
1210 for ( i=0; i<nmods; i++ ) {
1211 for ( j=0; j<ndel; j++ ) {
1212 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1213 uuids[num - 1 - i].bv_len = 0;
1218 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1219 for ( j=0; j<i; j++ ) {
1220 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1221 uuids[num - 1 - i].bv_len = 0;
1230 SlapReply frs = { REP_RESULT };
1233 AttributeAssertion eq;
1234 slap_callback cb = {0};
1238 fop.o_sync_mode = 0;
1239 fop.o_callback = &cb;
1240 fop.ors_limit = NULL;
1241 fop.ors_tlimit = SLAP_NO_LIMIT;
1242 fop.ors_attrs = slap_anlist_all_attributes;
1243 fop.ors_attrsonly = 0;
1244 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1246 af.f_choice = LDAP_FILTER_AND;
1249 mf.f_choice = LDAP_FILTER_EQUALITY;
1251 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1252 mf.f_next = fop.ors_filter;
1254 fop.ors_filter = ⁡
1256 cb.sc_response = playlog_cb;
1257 fop.o_bd->bd_info = on->on_info->oi_orig;
1259 for ( i=ndel; i<num; i++ ) {
1260 if ( uuids[i].bv_len == 0 ) continue;
1262 mf.f_av_value = uuids[i];
1263 cb.sc_private = NULL;
1265 rc = fop.o_bd->be_search( &fop, &frs );
1267 /* If entry was not found, add to delete list */
1268 if ( !cb.sc_private ) {
1269 uuids[ndel++] = uuids[i];
1272 fop.o_bd->bd_info = (BackendInfo *)on;
1275 uuids[ndel].bv_val = NULL;
1276 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1281 syncprov_op_response( Operation *op, SlapReply *rs )
1283 opcookie *opc = op->o_callback->sc_private;
1284 slap_overinst *on = opc->son;
1285 syncprov_info_t *si = on->on_bi.bi_private;
1288 if ( rs->sr_err == LDAP_SUCCESS )
1290 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1291 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1293 /* Update our context CSN */
1295 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1296 slap_get_commit_csn( op, &maxcsn, &curcsn );
1297 if ( !BER_BVISNULL( &maxcsn ) ) {
1298 strcpy( cbuf, maxcsn.bv_val );
1299 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1300 strcpy( si->si_ctxcsnbuf, cbuf );
1301 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1306 if ( si->si_chkops || si->si_chktime ) {
1308 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1312 if ( si->si_chktime &&
1313 (op->o_time - si->si_chklast >= si->si_chktime )) {
1315 si->si_chklast = op->o_time;
1318 syncprov_checkpoint( op, rs, on );
1321 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1323 opc->sctxcsn.bv_len = maxcsn.bv_len;
1324 opc->sctxcsn.bv_val = cbuf;
1326 /* Handle any persistent searches */
1330 case LDAP_REQ_MODIFY:
1331 case LDAP_REQ_MODRDN:
1332 case LDAP_REQ_EXTENDED:
1333 syncprov_matchops( op, opc, 0 );
1335 case LDAP_REQ_DELETE:
1336 /* for each match in opc->smatches:
1339 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1340 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1341 if ( sm->sm_op->s_op->o_abandon )
1343 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1344 LDAP_SYNC_DELETE, 1 );
1346 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1351 /* Add any log records */
1352 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1353 syncprov_add_slog( op, &curcsn );
1357 return SLAP_CB_CONTINUE;
1360 /* We don't use a subentry to store the context CSN any more.
1361 * We expose the current context CSN as an operational attribute
1362 * of the suffix entry.
1365 syncprov_op_compare( Operation *op, SlapReply *rs )
1367 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1368 syncprov_info_t *si = on->on_bi.bi_private;
1369 int rc = SLAP_CB_CONTINUE;
1371 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1372 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1376 struct berval bv[2];
1378 e.e_name = op->o_bd->be_suffix[0];
1379 e.e_nname = op->o_bd->be_nsuffix[0];
1381 BER_BVZERO( &bv[1] );
1382 bv[0] = si->si_ctxcsn;
1384 a.a_desc = slap_schema.si_ad_contextCSN;
1386 a.a_nvals = a.a_vals;
1388 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1390 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1391 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1392 if ( ! rs->sr_err ) {
1393 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1394 goto return_results;
1397 if ( get_assert( op ) &&
1398 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1400 rs->sr_err = LDAP_ASSERTION_FAILED;
1401 goto return_results;
1405 rs->sr_err = LDAP_COMPARE_FALSE;
1407 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1408 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1409 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1410 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1412 rs->sr_err = LDAP_COMPARE_TRUE;
1417 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1419 send_ldap_result( op, rs );
1421 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1422 rs->sr_err = LDAP_SUCCESS;
1431 syncprov_op_mod( Operation *op, SlapReply *rs )
1433 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1434 syncprov_info_t *si = on->on_bi.bi_private;
1436 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1438 (si->si_ops ? sizeof(modinst) : 0 ),
1440 opcookie *opc = (opcookie *)(cb+1);
1442 cb->sc_response = syncprov_op_response;
1443 cb->sc_cleanup = syncprov_op_cleanup;
1444 cb->sc_private = opc;
1445 cb->sc_next = op->o_callback;
1446 op->o_callback = cb;
1448 /* If there are active persistent searches, lock this operation.
1449 * See seqmod.c for the locking logic on its own.
1452 modtarget *mt, mtdummy;
1455 mi = (modinst *)(opc+1);
1458 /* See if we're already modifying this entry... */
1460 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1461 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1463 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1464 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1465 mt->mt_tail->mi_next = mi;
1467 /* wait for this op to get to head of list */
1468 while ( mt->mt_mods != mi ) {
1469 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1470 ldap_pvt_thread_yield();
1471 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1473 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1475 /* Record that we're modifying this entry now */
1476 mt = ch_malloc( sizeof(modtarget) );
1479 mt->mt_op = mi->mi_op;
1480 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1481 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1482 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1486 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1487 syncprov_matchops( op, opc, 1 );
1490 return SLAP_CB_CONTINUE;
1494 syncprov_op_extended( Operation *op, SlapReply *rs )
1496 if ( exop_is_write( op ))
1497 return syncprov_op_mod( op, rs );
1499 return SLAP_CB_CONTINUE;
1502 typedef struct searchstate {
1503 slap_overinst *ss_on;
1509 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1511 if ( rs->sr_ctrls ) {
1512 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1513 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1514 rs->sr_ctrls = NULL;
1520 syncprov_detach_op( Operation *op, syncops *so )
1526 GroupAssertion *g1, *g2;
1528 /* count the search attrs */
1529 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1530 alen += op->ors_attrs[i].an_name.bv_len + 1;
1532 /* Make a new copy of the operation */
1533 size = sizeof(Operation) + sizeof(Opheader) +
1534 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1535 op->o_req_dn.bv_len + 1 +
1536 op->o_req_ndn.bv_len + 1 +
1537 op->o_ndn.bv_len + 1 +
1538 so->s_filterstr.bv_len + 1;
1539 op2 = (Operation *)ch_calloc( 1, size );
1540 op2->o_hdr = (Opheader *)(op2+1);
1542 /* Copy the fields we care about explicitly, leave the rest alone */
1543 *op2->o_hdr = *op->o_hdr;
1544 op2->o_tag = op->o_tag;
1545 op2->o_time = op->o_time;
1546 op2->o_bd = op->o_bd;
1547 op2->o_request = op->o_request;
1550 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1551 ptr = (char *)(op2->ors_attrs+i+1);
1552 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1553 op2->ors_attrs[i] = op->ors_attrs[i];
1554 op2->ors_attrs[i].an_name.bv_val = ptr;
1555 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1557 BER_BVZERO( &op2->ors_attrs[i].an_name );
1559 ptr = (char *)(op2->o_hdr + 1);
1561 op2->o_authz = op->o_authz;
1562 op2->o_ndn.bv_val = ptr;
1563 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1564 op2->o_dn = op2->o_ndn;
1565 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1566 op2->o_req_dn.bv_val = ptr;
1567 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1568 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1569 op2->o_req_ndn.bv_val = ptr;
1570 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1571 op2->ors_filterstr.bv_val = ptr;
1572 strcpy( ptr, so->s_filterstr.bv_val );
1573 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1574 op2->ors_filter = str2filter( ptr );
1577 /* Copy any cached group ACLs individually */
1578 op2->o_groups = NULL;
1579 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1580 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1582 strcpy( g2->ga_ndn, g1->ga_ndn );
1583 g2->ga_next = op2->o_groups;
1587 /* Add op2 to conn so abandon will find us */
1588 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1589 op->o_conn->c_n_ops_executing++;
1590 op->o_conn->c_n_ops_completed--;
1591 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1592 so->s_flags |= PS_IS_DETACHED;
1593 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1597 syncprov_search_response( Operation *op, SlapReply *rs )
1599 searchstate *ss = op->o_callback->sc_private;
1600 slap_overinst *on = ss->ss_on;
1601 syncprov_info_t *si = on->on_bi.bi_private;
1602 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1604 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1606 /* If we got a referral without a referral object, there's
1607 * something missing that we cannot replicate. Just ignore it.
1608 * The consumer will abort because we didn't send the expected
1611 if ( !rs->sr_entry ) {
1612 assert( rs->sr_entry );
1613 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1614 return SLAP_CB_CONTINUE;
1616 if ( srs->sr_state.ctxcsn ) {
1617 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1618 slap_schema.si_ad_entryCSN );
1620 /* Don't send the ctx entry twice */
1621 if ( a && bvmatch( &a->a_nvals[0], srs->sr_state.ctxcsn ) )
1622 return LDAP_SUCCESS;
1624 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1626 rs->sr_ctrls[1] = NULL;
1627 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1628 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1629 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1630 struct berval cookie;
1632 slap_compose_sync_cookie( op, &cookie,
1633 &op->ors_filter->f_and->f_ava->aa_value,
1634 srs->sr_state.sid, srs->sr_state.rid );
1636 /* Is this a regular refresh? */
1638 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1640 rs->sr_ctrls[1] = NULL;
1641 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1642 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1643 LDAP_SYNC_REFRESH_DELETES );
1646 /* It's RefreshAndPersist, transition to Persist phase */
1647 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1648 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1649 &cookie, 1, NULL, 0 );
1650 /* Flush any queued persist messages */
1651 if ( ss->ss_so->s_res ) {
1652 syncres *sr, *srnext;
1657 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1659 for (sr = ss->ss_so->s_res; sr; sr=srnext) {
1660 int rc = LDAP_SUCCESS;
1661 srnext = sr->s_next;
1663 opc.sndn = sr->s_ndn;
1664 opc.suuid = sr->s_uuid;
1665 opc.sctxcsn = sr->s_csn;
1666 opc.sreference = sr->s_isreference;
1669 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
1670 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1671 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
1672 op->o_bd->bd_info = (BackendInfo *)on;
1674 if ( rc == LDAP_SUCCESS )
1675 syncprov_sendresp( op, &opc, ss->ss_so, e,
1679 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1680 be_entry_release_rw( op, e, 0 );
1681 op->o_bd->bd_info = (BackendInfo *)on;
1685 ss->ss_so->s_res = NULL;
1686 ss->ss_so->s_restail = NULL;
1689 /* Turn off the refreshing flag */
1690 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1692 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1694 /* Detach this Op from frontend control */
1695 syncprov_detach_op( op, ss->ss_so );
1697 return LDAP_SUCCESS;
1701 return SLAP_CB_CONTINUE;
1705 syncprov_op_search( Operation *op, SlapReply *rs )
1707 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1708 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1710 int gotstate = 0, nochange = 0, do_present = 1;
1711 Filter *fand, *fava;
1712 syncops *sop = NULL;
1715 struct berval ctxcsn;
1716 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1718 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1720 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1721 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1725 srs = op->o_controls[slap_cids.sc_LDAPsync];
1727 /* If this is a persistent search, set it up right away */
1728 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1738 so.s_flags = PS_IS_REFRESHING;
1739 /* syncprov_findbase expects to be called as a callback... */
1740 sc.sc_private = &opc;
1742 cb = op->o_callback;
1743 op->o_callback = ≻
1744 rs->sr_err = syncprov_findbase( op, &fc );
1745 op->o_callback = cb;
1747 if ( rs->sr_err != LDAP_SUCCESS ) {
1748 send_ldap_result( op, rs );
1751 sop = ch_malloc( sizeof( syncops ));
1753 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1754 sop->s_sid = srs->sr_state.sid;
1755 sop->s_rid = srs->sr_state.rid;
1758 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1759 sop->s_next = si->si_ops;
1761 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1764 /* snapshot the ctxcsn */
1765 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1766 strcpy( csnbuf, si->si_ctxcsnbuf );
1767 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1768 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1769 ctxcsn.bv_val = csnbuf;
1771 /* If we have a cookie, handle the PRESENT lookups */
1772 if ( srs->sr_state.ctxcsn ) {
1775 /* The cookie was validated when it was parsed, just use it */
1777 /* If just Refreshing and nothing has changed, shortcut it */
1778 if ( bvmatch( srs->sr_state.ctxcsn, &ctxcsn )) {
1780 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1781 LDAPControl *ctrls[2];
1785 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1786 NULL, LDAP_SYNC_REFRESH_DELETES );
1787 rs->sr_ctrls = ctrls;
1788 rs->sr_err = LDAP_SUCCESS;
1789 send_ldap_result( op, rs );
1790 rs->sr_ctrls = NULL;
1795 /* Do we have a sessionlog for this search? */
1796 for ( sl=si->si_logs; sl; sl=sl->sl_next )
1797 if ( sl->sl_sid == srs->sr_state.sid ) break;
1799 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1800 if ( ber_bvcmp( srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1802 /* mutex is unlocked in playlog */
1803 syncprov_playlog( op, rs, sl, srs->sr_state.ctxcsn, &ctxcsn );
1805 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1808 /* Is the CSN still present in the database? */
1809 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1810 /* No, so a reload is required */
1811 #if 0 /* the consumer doesn't seem to send this hint */
1812 if ( op->o_sync_rhint == 0 ) {
1813 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1819 /* If changed and doing Present lookup, send Present UUIDs */
1820 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1822 send_ldap_result( op, rs );
1829 /* Append CSN range to search filter, save original filter
1830 * for persistent search evaluation
1833 sop->s_filterstr= op->ors_filterstr;
1836 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1837 fand->f_choice = LDAP_FILTER_AND;
1838 fand->f_next = NULL;
1839 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1840 fava->f_choice = LDAP_FILTER_LE;
1841 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1842 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1843 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1846 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1847 fava = fava->f_next;
1848 fava->f_choice = LDAP_FILTER_GE;
1849 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1850 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1851 ber_dupbv_x( &fava->f_ava->aa_value, srs->sr_state.ctxcsn, op->o_tmpmemctx );
1853 fava->f_next = op->ors_filter;
1854 op->ors_filter = fand;
1855 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1857 /* Let our callback add needed info to returned entries */
1858 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1859 ss = (searchstate *)(cb+1);
1862 ss->ss_present = do_present;
1863 cb->sc_response = syncprov_search_response;
1864 cb->sc_cleanup = syncprov_search_cleanup;
1865 cb->sc_private = ss;
1866 cb->sc_next = op->o_callback;
1867 op->o_callback = cb;
1869 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1870 op->o_sync_mode &= SLAP_CONTROL_MASK;
1873 /* If this is a persistent search and no changes were reported during
1874 * the refresh phase, just invoke the response callback to transition
1875 * us into persist phase
1878 rs->sr_err = LDAP_SUCCESS;
1879 rs->sr_nentries = 0;
1880 send_ldap_result( op, rs );
1883 return SLAP_CB_CONTINUE;
1887 syncprov_operational(
1891 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1892 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1894 if ( rs->sr_entry &&
1895 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1897 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1898 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1899 Attribute *a, **ap = NULL;
1901 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1902 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1907 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1909 a = ch_malloc( sizeof(Attribute));
1910 a->a_desc = slap_schema.si_ad_contextCSN;
1911 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1912 a->a_vals[1].bv_val = NULL;
1913 a->a_nvals = a->a_vals;
1919 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1921 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1923 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1925 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1928 return SLAP_CB_CONTINUE;
1940 slap_overinst *on = (slap_overinst *)be->bd_info;
1941 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1943 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1945 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1946 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1949 si->si_chkops = atoi( argv[1] );
1950 si->si_chktime = atoi( argv[2] ) * 60;
1953 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
1957 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1958 "\"syncprov-sessionlog <sid> <size>\"\n", fname, lineno );
1961 sid = atoi( argv[1] );
1962 if ( sid < 0 || sid > 999 ) {
1964 "%s: line %d: session log id %d is out of range [0..999]\n",
1965 fname, lineno, sid );
1968 size = atoi( argv[2] );
1971 "%s: line %d: session log size %d is negative\n",
1972 fname, lineno, size );
1975 for ( sl = si->si_logs; sl; sl=sl->sl_next ) {
1976 if ( sl->sl_sid == sid ) {
1982 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
1983 sl->sl_mincsn.bv_val = (char *)(sl+1);
1984 sl->sl_mincsn.bv_len = 0;
1988 sl->sl_head = sl->sl_tail = NULL;
1989 sl->sl_next = si->si_logs;
1990 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
1996 return SLAP_CONF_UNKNOWN;
1999 /* Cheating - we have no thread pool context for these functions,
2002 typedef struct thread_keys {
2005 ldap_pvt_thread_pool_keyfree_t *xfree;
2009 /* A fake thread context */
2010 static thread_keys thrctx[MAXKEYS];
2012 /* Read any existing contextCSN from the underlying db.
2013 * Then search for any entries newer than that. If no value exists,
2014 * just generate it. Cache whatever result.
2021 slap_overinst *on = (slap_overinst *) be->bd_info;
2022 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2025 char opbuf[OPERATION_BUFFER_SIZE];
2026 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2027 Operation *op = (Operation *)opbuf;
2032 connection_fake_init( &conn, op, thrctx );
2034 op->o_dn = be->be_rootdn;
2035 op->o_ndn = be->be_rootndn;
2037 ctxcsnbuf[0] = '\0';
2039 op->o_bd->bd_info = on->on_info->oi_orig;
2040 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2041 slap_schema.si_ad_contextCSN, 0, &e );
2044 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2046 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2047 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2048 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2049 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2050 si->si_ctxcsn.bv_len );
2051 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2052 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2054 be_entry_release_rw( op, e, 0 );
2055 op->o_bd->bd_info = (BackendInfo *)on;
2056 op->o_req_dn = be->be_suffix[0];
2057 op->o_req_ndn = be->be_nsuffix[0];
2058 op->ors_scope = LDAP_SCOPE_SUBTREE;
2059 syncprov_findcsn( op, FIND_MAXCSN );
2062 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2063 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2064 &si->si_ctxcsn, 0 );
2067 /* If our ctxcsn is different from what was read from the root
2068 * entry, write the new value out.
2070 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2071 SlapReply rs = {REP_RESULT};
2072 syncprov_checkpoint( op, &rs, on );
2075 op->o_bd->bd_info = (BackendInfo *)on;
2079 /* Write the current contextCSN into the underlying db.
2086 slap_overinst *on = (slap_overinst *) be->bd_info;
2087 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2090 if ( si->si_numops ) {
2092 char opbuf[OPERATION_BUFFER_SIZE];
2093 Operation *op = (Operation *)opbuf;
2094 SlapReply rs = {REP_RESULT};
2096 connection_fake_init( &conn, op, thrctx );
2098 op->o_dn = be->be_rootdn;
2099 op->o_ndn = be->be_rootndn;
2100 syncprov_checkpoint( op, &rs, on );
2102 for ( i=0; thrctx[i].key; i++) {
2103 if ( thrctx[i].xfree )
2104 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2105 thrctx[i].key = NULL;
2116 slap_overinst *on = (slap_overinst *)be->bd_info;
2117 syncprov_info_t *si;
2119 si = ch_calloc(1, sizeof(syncprov_info_t));
2120 on->on_bi.bi_private = si;
2121 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2122 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2123 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2124 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2126 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2127 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2129 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2130 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2136 syncprov_db_destroy(
2140 slap_overinst *on = (slap_overinst *)be->bd_info;
2141 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2144 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2145 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2146 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2153 static int syncprov_parseCtrl (
2162 struct berval cookie = BER_BVNULL;
2166 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2167 rs->sr_text = "Sync control specified multiple times";
2168 return LDAP_PROTOCOL_ERROR;
2171 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2172 rs->sr_text = "Sync control specified with pagedResults control";
2173 return LDAP_PROTOCOL_ERROR;
2176 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2177 rs->sr_text = "Sync control value is empty (or absent)";
2178 return LDAP_PROTOCOL_ERROR;
2181 /* Parse the control value
2182 * syncRequestValue ::= SEQUENCE {
2187 * refreshAndPersist (3)
2189 * cookie syncCookie OPTIONAL
2193 ber = ber_init( &ctrl->ldctl_value );
2195 rs->sr_text = "internal error";
2199 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2200 rs->sr_text = "Sync control : mode decoding error";
2201 return LDAP_PROTOCOL_ERROR;
2205 case LDAP_SYNC_REFRESH_ONLY:
2206 mode = SLAP_SYNC_REFRESH;
2208 case LDAP_SYNC_REFRESH_AND_PERSIST:
2209 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2212 rs->sr_text = "Sync control : unknown update mode";
2213 return LDAP_PROTOCOL_ERROR;
2216 tag = ber_peek_tag( ber, &len );
2218 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2219 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2220 rs->sr_text = "Sync control : cookie decoding error";
2221 return LDAP_PROTOCOL_ERROR;
2224 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2225 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2226 rs->sr_text = "Sync control : rhint decoding error";
2227 return LDAP_PROTOCOL_ERROR;
2230 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2231 rs->sr_text = "Sync control : decoding error";
2232 return LDAP_PROTOCOL_ERROR;
2234 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2235 sr->sr_rhint = rhint;
2236 if (!BER_BVISNULL(&cookie)) {
2237 ber_bvarray_add( &sr->sr_state.octet_str, &cookie );
2238 slap_parse_sync_cookie( &sr->sr_state );
2241 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2243 (void) ber_free( ber, 1 );
2245 op->o_sync = ctrl->ldctl_iscritical
2246 ? SLAP_CONTROL_CRITICAL
2247 : SLAP_CONTROL_NONCRITICAL;
2249 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2251 return LDAP_SUCCESS;
2254 /* This overlay is set up for dynamic loading via moduleload. For static
2255 * configuration, you'll need to arrange for the slap_overinst to be
2256 * initialized and registered by some other function inside slapd.
2259 static slap_overinst syncprov;
2266 rc = register_supported_control( LDAP_CONTROL_SYNC,
2267 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2268 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2269 if ( rc != LDAP_SUCCESS ) {
2270 fprintf( stderr, "Failed to register control %d\n", rc );
2274 syncprov.on_bi.bi_type = "syncprov";
2275 syncprov.on_bi.bi_db_init = syncprov_db_init;
2276 syncprov.on_bi.bi_db_config = syncprov_db_config;
2277 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2278 syncprov.on_bi.bi_db_open = syncprov_db_open;
2279 syncprov.on_bi.bi_db_close = syncprov_db_close;
2281 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2282 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2284 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2285 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2286 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2287 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2288 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2289 syncprov.on_bi.bi_op_search = syncprov_op_search;
2290 syncprov.on_bi.bi_extended = syncprov_op_extended;
2291 syncprov.on_bi.bi_operational = syncprov_operational;
2293 return overlay_register( &syncprov );
2296 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2298 init_module( int argc, char *argv[] )
2300 return syncprov_init();
2302 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2304 #endif /* defined(SLAPD_OVER_SYNCPROV) */