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 */
665 syncprov_qresp( opcookie *opc, syncops *so, int mode )
669 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
670 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
672 sr->s_dn.bv_val = (char *)(sr + 1);
673 sr->s_dn.bv_len = opc->sdn.bv_len;
675 sr->s_isreference = opc->sreference;
676 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
677 sr->s_ndn.bv_len = opc->sndn.bv_len;
678 *(sr->s_ndn.bv_val++) = '\0';
679 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
680 sr->s_uuid.bv_len = opc->suuid.bv_len;
681 *(sr->s_uuid.bv_val++) = '\0';
682 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
683 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
684 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
689 so->s_restail->s_next = sr;
692 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
696 /* Play back queued responses */
698 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue );
701 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
703 syncres *sr, *srnext;
709 op->o_bd->bd_info = (BackendInfo *)on->on_info;
710 for (sr = so->s_res; sr; sr=srnext) {
713 opc.sndn = sr->s_ndn;
714 opc.suuid = sr->s_uuid;
715 opc.sctxcsn = sr->s_csn;
716 opc.sreference = sr->s_isreference;
719 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
720 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
727 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );
730 be_entry_release_rw( op, e, 0 );
738 op->o_bd->bd_info = (BackendInfo *)on;
740 so->s_restail = NULL;
744 /* Send a persistent search response */
746 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue )
748 slap_overinst *on = opc->son;
749 syncprov_info_t *si = on->on_bi.bi_private;
751 SlapReply rs = { REP_SEARCH };
752 LDAPControl *ctrls[2];
753 struct berval cookie;
755 Attribute a_uuid = {0};
756 Operation sop = *so->s_op;
759 if ( so->s_op->o_abandon )
760 return SLAPD_ABANDON;
764 sop.o_tmpmemctx = op->o_tmpmemctx;
766 sop.o_controls = op->o_controls;
767 sop.o_private = op->o_private;
769 /* If queueing is allowed */
771 ldap_pvt_thread_mutex_lock( &so->s_mutex );
772 /* If we're still in refresh mode, must queue */
773 if (so->s_flags & PS_IS_REFRESHING) {
774 return syncprov_qresp( opc, so, mode );
776 /* If connection is free but queue is non-empty,
777 * try to flush the queue.
780 rs.sr_err = syncprov_qplay( &sop, on, so );
782 /* If the connection is busy, must queue */
783 if ( sop.o_conn->c_writewaiter || rs.sr_err == LDAP_BUSY ) {
784 return syncprov_qresp( opc, so, mode );
786 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
788 /* Queueing not allowed and conn is busy, give up */
789 if ( sop.o_conn->c_writewaiter )
794 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
796 e_uuid.e_attrs = &a_uuid;
797 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
798 a_uuid.a_nvals = &opc->suuid;
799 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
800 mode, ctrls, 0, 1, &cookie );
803 op->o_bd->bd_info = (BackendInfo *)on->on_info;
807 if ( rs.sr_entry->e_private )
808 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
809 if ( opc->sreference ) {
810 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
811 send_search_reference( &sop, &rs );
812 ber_bvarray_free( rs.sr_ref );
818 case LDAP_SYNC_MODIFY:
820 if ( rs.sr_entry->e_private )
821 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
822 rs.sr_attrs = sop.ors_attrs;
823 send_search_entry( &sop, &rs );
827 case LDAP_SYNC_DELETE:
828 e_uuid.e_attrs = NULL;
829 e_uuid.e_name = opc->sdn;
830 e_uuid.e_nname = opc->sndn;
831 rs.sr_entry = &e_uuid;
832 if ( opc->sreference ) {
833 struct berval bv = BER_BVNULL;
835 send_search_reference( &sop, &rs );
837 send_search_entry( &sop, &rs );
843 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
844 op->o_private = sop.o_private;
846 /* Check queue again here; if we were hanging in a send and eventually
847 * recovered, there may be more to send now. But don't check if the
848 * original psearch has been abandoned.
850 if ( !so->s_op->o_abandon && rs.sr_err == LDAP_SUCCESS && queue
852 ldap_pvt_thread_mutex_lock( &so->s_mutex );
853 rs.sr_err = syncprov_qplay( &sop, on, so );
854 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
860 syncprov_free_syncop( syncops *so )
862 syncres *sr, *srnext;
863 GroupAssertion *ga, *gnext;
865 ldap_pvt_thread_mutex_lock( &so->s_mutex );
867 if ( so->s_inuse > 0 ) {
868 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
871 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
872 if ( so->s_flags & PS_IS_DETACHED ) {
873 filter_free( so->s_op->ors_filter );
874 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
880 ch_free( so->s_base.bv_val );
881 for ( sr=so->s_res; sr; sr=srnext ) {
885 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
890 syncprov_drop_psearch( syncops *so, int lock )
892 if ( so->s_flags & PS_IS_DETACHED ) {
894 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
895 so->s_op->o_conn->c_n_ops_executing--;
896 so->s_op->o_conn->c_n_ops_completed++;
897 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
900 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
902 syncprov_free_syncop( so );
908 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
910 slap_callback *sc = op->o_callback;
911 op->o_callback = sc->sc_next;
912 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
913 op->o_tmpfree( sc, op->o_tmpmemctx );
918 syncprov_op_abandon( Operation *op, SlapReply *rs )
920 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
921 syncprov_info_t *si = on->on_bi.bi_private;
922 syncops *so, *soprev;
924 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
925 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
926 soprev=so, so=so->s_next ) {
927 if ( so->s_op->o_connid == op->o_connid &&
928 so->s_op->o_msgid == op->orn_msgid ) {
929 so->s_op->o_abandon = 1;
930 soprev->s_next = so->s_next;
934 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
936 /* Is this really a Cancel exop? */
937 if ( op->o_tag != LDAP_REQ_ABANDON ) {
938 so->s_op->o_cancel = SLAP_CANCEL_ACK;
939 rs->sr_err = LDAP_CANCELLED;
940 send_ldap_result( so->s_op, rs );
941 if ( so->s_flags & PS_IS_DETACHED ) {
943 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
944 cb->sc_cleanup = syncprov_ab_cleanup;
945 cb->sc_next = op->o_callback;
947 return SLAP_CB_CONTINUE;
950 syncprov_drop_psearch( so, 0 );
952 return SLAP_CB_CONTINUE;
955 /* Find which persistent searches are affected by this operation */
957 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
959 slap_overinst *on = opc->son;
960 syncprov_info_t *si = on->on_bi.bi_private;
963 syncops *ss, *sprev, *snext;
970 fc.fdn = &op->o_req_ndn;
972 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
974 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
975 else dnParent( fc.fdn, &pdn );
976 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
980 if ( op->o_tag != LDAP_REQ_ADD ) {
981 op->o_bd->bd_info = (BackendInfo *)on->on_info;
982 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
983 /* If we're sending responses now, make a copy and unlock the DB */
984 if ( e && !saveit ) {
985 Entry *e2 = entry_dup( e );
986 be_entry_release_rw( op, e, 0 );
989 op->o_bd->bd_info = (BackendInfo *)on;
996 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
997 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
998 opc->sreference = is_entry_referral( e );
1000 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1001 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1003 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1006 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1007 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1008 sprev = ss, ss=snext)
1019 /* If the base of the search is missing, signal a refresh */
1020 rc = syncprov_findbase( op, &fc );
1021 if ( rc != LDAP_SUCCESS ) {
1022 SlapReply rs = {REP_RESULT};
1023 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1024 "search base has changed" );
1025 sprev->s_next = snext;
1026 syncprov_drop_psearch( ss, 1 );
1030 /* If we're sending results now, look for this op in old matches */
1033 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1034 old=sm, sm=sm->sm_next ) {
1035 if ( sm->sm_op == ss ) {
1037 old->sm_next = sm->sm_next;
1038 op->o_tmpfree( sm, op->o_tmpmemctx );
1044 /* check if current o_req_dn is in scope and matches filter */
1045 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1046 LDAP_COMPARE_TRUE ) {
1048 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1049 sm->sm_next = opc->smatches;
1054 /* if found send UPDATE else send ADD */
1056 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1057 syncprov_sendresp( op, opc, ss, &e,
1058 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1059 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1062 } else if ( !saveit && found ) {
1064 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1065 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1066 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1069 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1071 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1072 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1073 be_entry_release_rw( op, e, 0 );
1074 op->o_bd->bd_info = (BackendInfo *)on;
1077 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1082 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1084 slap_callback *cb = op->o_callback;
1085 opcookie *opc = cb->sc_private;
1086 slap_overinst *on = opc->son;
1087 syncprov_info_t *si = on->on_bi.bi_private;
1088 syncmatches *sm, *snext;
1089 modtarget *mt, mtdummy;
1091 for (sm = opc->smatches; sm; sm=snext) {
1092 snext = sm->sm_next;
1093 syncprov_free_syncop( sm->sm_op );
1094 op->o_tmpfree( sm, op->o_tmpmemctx );
1097 /* Remove op from lock table */
1099 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1100 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1102 modinst *mi = mt->mt_mods;
1104 /* If there are more, promote the next one */
1105 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1106 if ( mi->mi_next ) {
1107 mt->mt_mods = mi->mi_next;
1108 mt->mt_op = mt->mt_mods->mi_op;
1109 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1111 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1112 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1113 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1117 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1118 if ( !BER_BVISNULL( &opc->suuid ))
1119 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1120 if ( !BER_BVISNULL( &opc->sndn ))
1121 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1122 if ( !BER_BVISNULL( &opc->sdn ))
1123 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1124 op->o_callback = cb->sc_next;
1125 op->o_tmpfree(cb, op->o_tmpmemctx);
1131 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1133 syncprov_info_t *si = on->on_bi.bi_private;
1136 struct berval bv[2];
1137 slap_callback cb = {0};
1138 int manage = get_manageDSAit(op);
1140 mod.sml_values = bv;
1141 bv[1].bv_val = NULL;
1142 bv[0] = si->si_ctxcsn;
1143 mod.sml_nvalues = NULL;
1144 mod.sml_desc = slap_schema.si_ad_contextCSN;
1145 mod.sml_op = LDAP_MOD_REPLACE;
1146 mod.sml_next = NULL;
1148 cb.sc_response = slap_null_cb;
1150 opm.o_tag = LDAP_REQ_MODIFY;
1151 opm.o_callback = &cb;
1152 opm.orm_modlist = &mod;
1153 opm.o_req_dn = op->o_bd->be_suffix[0];
1154 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1155 opm.o_bd->bd_info = on->on_info->oi_orig;
1156 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1157 opm.o_bd->be_modify( &opm, rs );
1158 opm.o_managedsait = manage;
1162 syncprov_add_slog( Operation *op, struct berval *csn )
1164 opcookie *opc = op->o_callback->sc_private;
1165 slap_overinst *on = opc->son;
1166 syncprov_info_t *si = on->on_bi.bi_private;
1172 /* Allocate a record. UUIDs are not NUL-terminated. */
1173 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1176 se->se_tag = op->o_tag;
1178 se->se_uuid.bv_val = (char *)(se+1);
1179 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1180 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1181 se->se_uuid.bv_len = opc->suuid.bv_len;
1183 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1184 se->se_csn.bv_val[csn->bv_len] = '\0';
1185 se->se_csn.bv_len = csn->bv_len;
1187 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1188 if ( sl->sl_head ) {
1189 sl->sl_tail->se_next = se;
1195 while ( sl->sl_num > sl->sl_size ) {
1197 sl->sl_head = se->se_next;
1198 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1199 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1202 if ( !sl->sl_head ) {
1206 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1210 /* Just set a flag if we found the matching entry */
1212 playlog_cb( Operation *op, SlapReply *rs )
1214 if ( rs->sr_type == REP_SEARCH ) {
1215 op->o_callback->sc_private = (void *)1;
1220 /* enter with sl->sl_mutex locked, release before returning */
1222 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1223 struct berval *oldcsn, struct berval *ctxcsn )
1225 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1226 syncprov_info_t *si = on->on_bi.bi_private;
1228 int i, j, ndel, num, nmods, mmods;
1231 if ( !sl->sl_num ) {
1232 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1240 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1241 num * UUID_LEN, op->o_tmpmemctx );
1243 uuids[0].bv_val = (char *)(uuids + num + 1);
1245 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1246 * and everything else at the end. Do this first so we can
1247 * unlock the list mutex.
1249 for ( se=sl->sl_head; se; se=se->se_next ) {
1250 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1251 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1252 if ( se->se_tag == LDAP_REQ_DELETE ) {
1259 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1260 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1261 uuids[j].bv_len = UUID_LEN;
1263 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1267 /* Zero out unused slots */
1268 for ( i=ndel; i < num - nmods; i++ )
1269 uuids[i].bv_len = 0;
1271 /* Mods must be validated to see if they belong in this delete set.
1275 /* Strip any duplicates */
1276 for ( i=0; i<nmods; i++ ) {
1277 for ( j=0; j<ndel; j++ ) {
1278 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1279 uuids[num - 1 - i].bv_len = 0;
1284 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1285 for ( j=0; j<i; j++ ) {
1286 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1287 uuids[num - 1 - i].bv_len = 0;
1296 SlapReply frs = { REP_RESULT };
1299 #ifdef LDAP_COMP_MATCH
1300 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1302 AttributeAssertion eq;
1304 slap_callback cb = {0};
1308 fop.o_sync_mode = 0;
1309 fop.o_callback = &cb;
1310 fop.ors_limit = NULL;
1311 fop.ors_tlimit = SLAP_NO_LIMIT;
1312 fop.ors_attrs = slap_anlist_all_attributes;
1313 fop.ors_attrsonly = 0;
1314 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1316 af.f_choice = LDAP_FILTER_AND;
1319 mf.f_choice = LDAP_FILTER_EQUALITY;
1321 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1322 mf.f_next = fop.ors_filter;
1324 fop.ors_filter = ⁡
1326 cb.sc_response = playlog_cb;
1327 fop.o_bd->bd_info = on->on_info->oi_orig;
1329 for ( i=ndel; i<num; i++ ) {
1330 if ( uuids[i].bv_len == 0 ) continue;
1332 mf.f_av_value = uuids[i];
1333 cb.sc_private = NULL;
1335 rc = fop.o_bd->be_search( &fop, &frs );
1337 /* If entry was not found, add to delete list */
1338 if ( !cb.sc_private ) {
1339 uuids[ndel++] = uuids[i];
1342 fop.o_bd->bd_info = (BackendInfo *)on;
1345 uuids[ndel].bv_val = NULL;
1346 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1351 syncprov_op_response( Operation *op, SlapReply *rs )
1353 opcookie *opc = op->o_callback->sc_private;
1354 slap_overinst *on = opc->son;
1355 syncprov_info_t *si = on->on_bi.bi_private;
1358 if ( rs->sr_err == LDAP_SUCCESS )
1360 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1361 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1363 /* Update our context CSN */
1365 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1366 slap_get_commit_csn( op, &maxcsn, &curcsn );
1367 if ( !BER_BVISNULL( &maxcsn ) ) {
1368 strcpy( cbuf, maxcsn.bv_val );
1369 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1370 strcpy( si->si_ctxcsnbuf, cbuf );
1371 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1375 /* Don't do any processing for consumer contextCSN updates */
1376 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1377 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1378 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1379 return SLAP_CB_CONTINUE;
1383 if ( si->si_chkops || si->si_chktime ) {
1385 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1389 if ( si->si_chktime &&
1390 (op->o_time - si->si_chklast >= si->si_chktime )) {
1392 si->si_chklast = op->o_time;
1395 syncprov_checkpoint( op, rs, on );
1398 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1400 opc->sctxcsn.bv_len = maxcsn.bv_len;
1401 opc->sctxcsn.bv_val = cbuf;
1403 /* Handle any persistent searches */
1407 case LDAP_REQ_MODIFY:
1408 case LDAP_REQ_MODRDN:
1409 case LDAP_REQ_EXTENDED:
1410 syncprov_matchops( op, opc, 0 );
1412 case LDAP_REQ_DELETE:
1413 /* for each match in opc->smatches:
1416 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1417 if ( sm->sm_op->s_op->o_abandon )
1419 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1420 LDAP_SYNC_DELETE, 1 );
1426 /* Add any log records */
1427 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1428 syncprov_add_slog( op, &curcsn );
1432 return SLAP_CB_CONTINUE;
1435 /* We don't use a subentry to store the context CSN any more.
1436 * We expose the current context CSN as an operational attribute
1437 * of the suffix entry.
1440 syncprov_op_compare( Operation *op, SlapReply *rs )
1442 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1443 syncprov_info_t *si = on->on_bi.bi_private;
1444 int rc = SLAP_CB_CONTINUE;
1446 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1447 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1451 struct berval bv[2];
1453 e.e_name = op->o_bd->be_suffix[0];
1454 e.e_nname = op->o_bd->be_nsuffix[0];
1456 BER_BVZERO( &bv[1] );
1457 bv[0] = si->si_ctxcsn;
1459 a.a_desc = slap_schema.si_ad_contextCSN;
1461 a.a_nvals = a.a_vals;
1463 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1465 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1466 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1467 if ( ! rs->sr_err ) {
1468 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1469 goto return_results;
1472 if ( get_assert( op ) &&
1473 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1475 rs->sr_err = LDAP_ASSERTION_FAILED;
1476 goto return_results;
1480 rs->sr_err = LDAP_COMPARE_FALSE;
1482 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1483 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1484 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1485 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1487 rs->sr_err = LDAP_COMPARE_TRUE;
1492 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1494 send_ldap_result( op, rs );
1496 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1497 rs->sr_err = LDAP_SUCCESS;
1506 syncprov_op_mod( Operation *op, SlapReply *rs )
1508 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1509 syncprov_info_t *si = on->on_bi.bi_private;
1511 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1513 (si->si_ops ? sizeof(modinst) : 0 ),
1515 opcookie *opc = (opcookie *)(cb+1);
1517 cb->sc_response = syncprov_op_response;
1518 cb->sc_cleanup = syncprov_op_cleanup;
1519 cb->sc_private = opc;
1520 cb->sc_next = op->o_callback;
1521 op->o_callback = cb;
1523 /* If there are active persistent searches, lock this operation.
1524 * See seqmod.c for the locking logic on its own.
1527 modtarget *mt, mtdummy;
1530 mi = (modinst *)(opc+1);
1533 /* See if we're already modifying this entry... */
1535 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1536 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1538 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1539 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1540 mt->mt_tail->mi_next = mi;
1542 /* wait for this op to get to head of list */
1543 while ( mt->mt_mods != mi ) {
1544 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1545 ldap_pvt_thread_yield();
1546 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1548 /* clean up if the caller is giving up */
1549 if ( op->o_abandon ) {
1551 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1553 m2->mi_next = mi->mi_next;
1554 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1555 op->o_tmpfree( cb, op->o_tmpmemctx );
1556 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1557 return SLAPD_ABANDON;
1560 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1562 /* Record that we're modifying this entry now */
1563 mt = ch_malloc( sizeof(modtarget) );
1566 mt->mt_op = mi->mi_op;
1567 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1568 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1569 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1573 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1574 syncprov_matchops( op, opc, 1 );
1576 return SLAP_CB_CONTINUE;
1580 syncprov_op_extended( Operation *op, SlapReply *rs )
1582 if ( exop_is_write( op ))
1583 return syncprov_op_mod( op, rs );
1585 return SLAP_CB_CONTINUE;
1588 typedef struct searchstate {
1589 slap_overinst *ss_on;
1595 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1597 if ( rs->sr_ctrls ) {
1598 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1599 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1600 rs->sr_ctrls = NULL;
1606 syncprov_detach_op( Operation *op, syncops *so )
1612 GroupAssertion *g1, *g2;
1614 /* count the search attrs */
1615 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1616 alen += op->ors_attrs[i].an_name.bv_len + 1;
1618 /* Make a new copy of the operation */
1619 size = sizeof(Operation) + sizeof(Opheader) +
1620 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1621 op->o_req_dn.bv_len + 1 +
1622 op->o_req_ndn.bv_len + 1 +
1623 op->o_ndn.bv_len + 1 +
1624 so->s_filterstr.bv_len + 1;
1625 op2 = (Operation *)ch_calloc( 1, size );
1626 op2->o_hdr = (Opheader *)(op2+1);
1628 /* Copy the fields we care about explicitly, leave the rest alone */
1629 *op2->o_hdr = *op->o_hdr;
1630 op2->o_tag = op->o_tag;
1631 op2->o_time = op->o_time;
1632 op2->o_bd = op->o_bd;
1633 op2->o_request = op->o_request;
1636 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1637 ptr = (char *)(op2->ors_attrs+i+1);
1638 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1639 op2->ors_attrs[i] = op->ors_attrs[i];
1640 op2->ors_attrs[i].an_name.bv_val = ptr;
1641 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1643 BER_BVZERO( &op2->ors_attrs[i].an_name );
1645 ptr = (char *)(op2->o_hdr + 1);
1647 op2->o_authz = op->o_authz;
1648 op2->o_ndn.bv_val = ptr;
1649 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1650 op2->o_dn = op2->o_ndn;
1651 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1652 op2->o_req_dn.bv_val = ptr;
1653 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1654 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1655 op2->o_req_ndn.bv_val = ptr;
1656 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1657 op2->ors_filterstr.bv_val = ptr;
1658 strcpy( ptr, so->s_filterstr.bv_val );
1659 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1660 op2->ors_filter = str2filter( ptr );
1663 /* Copy any cached group ACLs individually */
1664 op2->o_groups = NULL;
1665 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1666 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1668 strcpy( g2->ga_ndn, g1->ga_ndn );
1669 g2->ga_next = op2->o_groups;
1673 /* Add op2 to conn so abandon will find us */
1674 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1675 op->o_conn->c_n_ops_executing++;
1676 op->o_conn->c_n_ops_completed--;
1677 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1678 so->s_flags |= PS_IS_DETACHED;
1679 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1683 syncprov_search_response( Operation *op, SlapReply *rs )
1685 searchstate *ss = op->o_callback->sc_private;
1686 slap_overinst *on = ss->ss_on;
1687 syncprov_info_t *si = on->on_bi.bi_private;
1688 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1690 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1692 /* If we got a referral without a referral object, there's
1693 * something missing that we cannot replicate. Just ignore it.
1694 * The consumer will abort because we didn't send the expected
1697 if ( !rs->sr_entry ) {
1698 assert( rs->sr_entry );
1699 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1700 return SLAP_CB_CONTINUE;
1702 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1703 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1704 slap_schema.si_ad_entryCSN );
1706 /* Don't send the ctx entry twice */
1707 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1708 return LDAP_SUCCESS;
1710 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1712 rs->sr_ctrls[1] = NULL;
1713 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1714 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1715 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1716 struct berval cookie;
1718 slap_compose_sync_cookie( op, &cookie,
1719 &op->ors_filter->f_and->f_ava->aa_value,
1720 srs->sr_state.rid );
1722 /* Is this a regular refresh? */
1724 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1726 rs->sr_ctrls[1] = NULL;
1727 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1728 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1729 LDAP_SYNC_REFRESH_DELETES );
1732 /* It's RefreshAndPersist, transition to Persist phase */
1733 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1734 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1735 &cookie, 1, NULL, 0 );
1736 /* Flush any queued persist messages */
1737 if ( ss->ss_so->s_res ) {
1738 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1740 syncprov_qplay( op, on, ss->ss_so );
1743 /* Turn off the refreshing flag */
1744 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1746 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1748 /* Detach this Op from frontend control */
1749 syncprov_detach_op( op, ss->ss_so );
1751 return LDAP_SUCCESS;
1755 return SLAP_CB_CONTINUE;
1759 syncprov_op_search( Operation *op, SlapReply *rs )
1761 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1762 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1764 int gotstate = 0, nochange = 0, do_present = 1;
1765 Filter *fand, *fava;
1766 syncops *sop = NULL;
1769 struct berval ctxcsn;
1770 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1772 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1774 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1775 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1779 srs = op->o_controls[slap_cids.sc_LDAPsync];
1780 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1782 /* If this is a persistent search, set it up right away */
1783 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1793 so.s_flags = PS_IS_REFRESHING;
1794 /* syncprov_findbase expects to be called as a callback... */
1795 sc.sc_private = &opc;
1797 cb = op->o_callback;
1798 op->o_callback = ≻
1799 rs->sr_err = syncprov_findbase( op, &fc );
1800 op->o_callback = cb;
1802 if ( rs->sr_err != LDAP_SUCCESS ) {
1803 send_ldap_result( op, rs );
1806 sop = ch_malloc( sizeof( syncops ));
1808 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1809 sop->s_rid = srs->sr_state.rid;
1812 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1813 sop->s_next = si->si_ops;
1815 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1818 /* snapshot the ctxcsn */
1819 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1820 strcpy( csnbuf, si->si_ctxcsnbuf );
1821 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1822 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1823 ctxcsn.bv_val = csnbuf;
1825 /* If we have a cookie, handle the PRESENT lookups */
1826 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1829 /* The cookie was validated when it was parsed, just use it */
1831 /* If just Refreshing and nothing has changed, shortcut it */
1832 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1834 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1835 LDAPControl *ctrls[2];
1839 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1840 NULL, LDAP_SYNC_REFRESH_DELETES );
1841 rs->sr_ctrls = ctrls;
1842 rs->sr_err = LDAP_SUCCESS;
1843 send_ldap_result( op, rs );
1844 rs->sr_ctrls = NULL;
1849 /* Do we have a sessionlog for this search? */
1852 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1853 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1855 /* mutex is unlocked in playlog */
1856 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1858 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1861 /* Is the CSN still present in the database? */
1862 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1863 /* No, so a reload is required */
1864 #if 0 /* the consumer doesn't seem to send this hint */
1865 if ( op->o_sync_rhint == 0 ) {
1866 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1872 /* If changed and doing Present lookup, send Present UUIDs */
1873 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1875 send_ldap_result( op, rs );
1882 /* Append CSN range to search filter, save original filter
1883 * for persistent search evaluation
1886 sop->s_filterstr= op->ors_filterstr;
1889 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1890 fand->f_choice = LDAP_FILTER_AND;
1891 fand->f_next = NULL;
1892 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1893 fava->f_choice = LDAP_FILTER_LE;
1894 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1895 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1896 #ifdef LDAP_COMP_MATCH
1897 fava->f_ava->aa_cf = NULL;
1899 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1902 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1903 fava = fava->f_next;
1904 fava->f_choice = LDAP_FILTER_GE;
1905 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1906 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1907 #ifdef LDAP_COMP_MATCH
1908 fava->f_ava->aa_cf = NULL;
1910 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1912 fava->f_next = op->ors_filter;
1913 op->ors_filter = fand;
1914 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1916 /* Let our callback add needed info to returned entries */
1917 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1918 ss = (searchstate *)(cb+1);
1921 ss->ss_present = do_present;
1922 cb->sc_response = syncprov_search_response;
1923 cb->sc_cleanup = syncprov_search_cleanup;
1924 cb->sc_private = ss;
1925 cb->sc_next = op->o_callback;
1926 op->o_callback = cb;
1928 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1929 op->o_sync_mode &= SLAP_CONTROL_MASK;
1932 /* If this is a persistent search and no changes were reported during
1933 * the refresh phase, just invoke the response callback to transition
1934 * us into persist phase
1937 rs->sr_err = LDAP_SUCCESS;
1938 rs->sr_nentries = 0;
1939 send_ldap_result( op, rs );
1942 return SLAP_CB_CONTINUE;
1946 syncprov_operational(
1950 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1951 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1953 if ( rs->sr_entry &&
1954 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1956 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1957 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1958 Attribute *a, **ap = NULL;
1960 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1961 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1966 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1968 a = ch_malloc( sizeof(Attribute));
1969 a->a_desc = slap_schema.si_ad_contextCSN;
1970 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1971 a->a_vals[1].bv_val = NULL;
1972 a->a_nvals = a->a_vals;
1978 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1980 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1982 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1984 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1987 return SLAP_CB_CONTINUE;
1999 slap_overinst *on = (slap_overinst *)be->bd_info;
2000 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2002 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
2004 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2005 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
2008 si->si_chkops = atoi( argv[1] );
2009 si->si_chktime = atoi( argv[2] ) * 60;
2012 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
2016 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2017 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
2020 size = atoi( argv[1] );
2023 "%s: line %d: session log size %d is negative\n",
2024 fname, lineno, size );
2029 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2030 sl->sl_mincsn.bv_val = (char *)(sl+1);
2031 sl->sl_mincsn.bv_len = 0;
2033 sl->sl_head = sl->sl_tail = NULL;
2034 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2041 return SLAP_CONF_UNKNOWN;
2044 /* Cheating - we have no thread pool context for these functions,
2047 typedef struct thread_keys {
2050 ldap_pvt_thread_pool_keyfree_t *xfree;
2054 /* A fake thread context */
2055 static thread_keys thrctx[MAXKEYS];
2057 /* Read any existing contextCSN from the underlying db.
2058 * Then search for any entries newer than that. If no value exists,
2059 * just generate it. Cache whatever result.
2066 slap_overinst *on = (slap_overinst *) be->bd_info;
2067 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2070 char opbuf[OPERATION_BUFFER_SIZE];
2071 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2072 Operation *op = (Operation *)opbuf;
2077 if ( slapMode & SLAP_TOOL_MODE ) {
2081 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2086 connection_fake_init( &conn, op, thrctx );
2088 op->o_dn = be->be_rootdn;
2089 op->o_ndn = be->be_rootndn;
2091 ctxcsnbuf[0] = '\0';
2093 op->o_bd->bd_info = on->on_info->oi_orig;
2094 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2095 slap_schema.si_ad_contextCSN, 0, &e );
2098 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2100 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2101 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2102 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2103 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2104 si->si_ctxcsn.bv_len );
2105 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2106 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2108 be_entry_release_rw( op, e, 0 );
2109 op->o_bd->bd_info = (BackendInfo *)on;
2110 op->o_req_dn = be->be_suffix[0];
2111 op->o_req_ndn = be->be_nsuffix[0];
2112 op->ors_scope = LDAP_SCOPE_SUBTREE;
2113 syncprov_findcsn( op, FIND_MAXCSN );
2114 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2115 /* If we're also a consumer, and we didn't find the context entry,
2116 * then don't generate anything, wait for our provider to send it
2122 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2123 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2124 &si->si_ctxcsn, 0 );
2127 /* If our ctxcsn is different from what was read from the root
2128 * entry, write the new value out.
2130 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2131 SlapReply rs = {REP_RESULT};
2132 syncprov_checkpoint( op, &rs, on );
2136 op->o_bd->bd_info = (BackendInfo *)on;
2140 /* Write the current contextCSN into the underlying db.
2147 slap_overinst *on = (slap_overinst *) be->bd_info;
2148 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2151 if ( slapMode & SLAP_TOOL_MODE ) {
2154 if ( si->si_numops ) {
2156 char opbuf[OPERATION_BUFFER_SIZE];
2157 Operation *op = (Operation *)opbuf;
2158 SlapReply rs = {REP_RESULT};
2160 connection_fake_init( &conn, op, thrctx );
2162 op->o_dn = be->be_rootdn;
2163 op->o_ndn = be->be_rootndn;
2164 syncprov_checkpoint( op, &rs, on );
2166 for ( i=0; thrctx[i].key; i++) {
2167 if ( thrctx[i].xfree )
2168 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2169 thrctx[i].key = NULL;
2180 slap_overinst *on = (slap_overinst *)be->bd_info;
2181 syncprov_info_t *si;
2183 si = ch_calloc(1, sizeof(syncprov_info_t));
2184 on->on_bi.bi_private = si;
2185 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2186 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2187 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2188 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2190 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2191 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2193 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2194 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2200 syncprov_db_destroy(
2204 slap_overinst *on = (slap_overinst *)be->bd_info;
2205 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2208 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2209 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2210 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2217 static int syncprov_parseCtrl (
2226 struct berval cookie = BER_BVNULL;
2230 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2231 rs->sr_text = "Sync control specified multiple times";
2232 return LDAP_PROTOCOL_ERROR;
2235 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2236 rs->sr_text = "Sync control specified with pagedResults control";
2237 return LDAP_PROTOCOL_ERROR;
2240 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2241 rs->sr_text = "Sync control value is empty (or absent)";
2242 return LDAP_PROTOCOL_ERROR;
2245 /* Parse the control value
2246 * syncRequestValue ::= SEQUENCE {
2251 * refreshAndPersist (3)
2253 * cookie syncCookie OPTIONAL
2257 ber = ber_init( &ctrl->ldctl_value );
2259 rs->sr_text = "internal error";
2263 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2264 rs->sr_text = "Sync control : mode decoding error";
2265 return LDAP_PROTOCOL_ERROR;
2269 case LDAP_SYNC_REFRESH_ONLY:
2270 mode = SLAP_SYNC_REFRESH;
2272 case LDAP_SYNC_REFRESH_AND_PERSIST:
2273 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2276 rs->sr_text = "Sync control : unknown update mode";
2277 return LDAP_PROTOCOL_ERROR;
2280 tag = ber_peek_tag( ber, &len );
2282 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2283 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2284 rs->sr_text = "Sync control : cookie decoding error";
2285 return LDAP_PROTOCOL_ERROR;
2288 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2289 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2290 rs->sr_text = "Sync control : rhint decoding error";
2291 return LDAP_PROTOCOL_ERROR;
2294 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2295 rs->sr_text = "Sync control : decoding error";
2296 return LDAP_PROTOCOL_ERROR;
2298 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2299 sr->sr_rhint = rhint;
2300 if (!BER_BVISNULL(&cookie)) {
2301 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2302 slap_parse_sync_cookie( &sr->sr_state );
2305 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2307 (void) ber_free( ber, 1 );
2309 op->o_sync = ctrl->ldctl_iscritical
2310 ? SLAP_CONTROL_CRITICAL
2311 : SLAP_CONTROL_NONCRITICAL;
2313 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2315 return LDAP_SUCCESS;
2318 /* This overlay is set up for dynamic loading via moduleload. For static
2319 * configuration, you'll need to arrange for the slap_overinst to be
2320 * initialized and registered by some other function inside slapd.
2323 static slap_overinst syncprov;
2330 rc = register_supported_control( LDAP_CONTROL_SYNC,
2331 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2332 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2333 if ( rc != LDAP_SUCCESS ) {
2334 fprintf( stderr, "Failed to register control %d\n", rc );
2338 syncprov.on_bi.bi_type = "syncprov";
2339 syncprov.on_bi.bi_db_init = syncprov_db_init;
2340 syncprov.on_bi.bi_db_config = syncprov_db_config;
2341 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2342 syncprov.on_bi.bi_db_open = syncprov_db_open;
2343 syncprov.on_bi.bi_db_close = syncprov_db_close;
2345 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2346 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2348 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2349 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2350 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2351 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2352 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2353 syncprov.on_bi.bi_op_search = syncprov_op_search;
2354 syncprov.on_bi.bi_extended = syncprov_op_extended;
2355 syncprov.on_bi.bi_operational = syncprov_operational;
2357 return overlay_register( &syncprov );
2360 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2362 init_module( int argc, char *argv[] )
2364 return syncprov_init();
2366 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2368 #endif /* defined(SLAPD_OVER_SYNCPROV) */