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 /* If syncprov_qplay returned any other error, bail out. */
793 /* Queueing not allowed and conn is busy, give up */
794 if ( sop.o_conn->c_writewaiter )
799 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
801 e_uuid.e_attrs = &a_uuid;
802 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
803 a_uuid.a_nvals = &opc->suuid;
804 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
805 mode, ctrls, 0, 1, &cookie );
808 op->o_bd->bd_info = (BackendInfo *)on->on_info;
812 if ( rs.sr_entry->e_private )
813 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
814 if ( opc->sreference ) {
815 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
816 send_search_reference( &sop, &rs );
817 ber_bvarray_free( rs.sr_ref );
823 case LDAP_SYNC_MODIFY:
825 if ( rs.sr_entry->e_private )
826 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
827 rs.sr_attrs = sop.ors_attrs;
828 send_search_entry( &sop, &rs );
832 case LDAP_SYNC_DELETE:
833 e_uuid.e_attrs = NULL;
834 e_uuid.e_name = opc->sdn;
835 e_uuid.e_nname = opc->sndn;
836 rs.sr_entry = &e_uuid;
837 if ( opc->sreference ) {
838 struct berval bv = BER_BVNULL;
840 send_search_reference( &sop, &rs );
842 send_search_entry( &sop, &rs );
848 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
849 op->o_private = sop.o_private;
851 /* Check queue again here; if we were hanging in a send and eventually
852 * recovered, there may be more to send now. But don't check if the
853 * original psearch has been abandoned.
855 if ( so->s_op->o_abandon )
856 return SLAPD_ABANDON;
858 if ( rs.sr_err == LDAP_SUCCESS && queue && so->s_res ) {
859 ldap_pvt_thread_mutex_lock( &so->s_mutex );
860 rs.sr_err = syncprov_qplay( &sop, on, so );
861 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
867 syncprov_free_syncop( syncops *so )
869 syncres *sr, *srnext;
870 GroupAssertion *ga, *gnext;
872 ldap_pvt_thread_mutex_lock( &so->s_mutex );
874 if ( so->s_inuse > 0 ) {
875 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
878 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
879 if ( so->s_flags & PS_IS_DETACHED ) {
880 filter_free( so->s_op->ors_filter );
881 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
887 ch_free( so->s_base.bv_val );
888 for ( sr=so->s_res; sr; sr=srnext ) {
892 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
897 syncprov_drop_psearch( syncops *so, int lock )
899 if ( so->s_flags & PS_IS_DETACHED ) {
901 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
902 so->s_op->o_conn->c_n_ops_executing--;
903 so->s_op->o_conn->c_n_ops_completed++;
904 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
907 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
909 syncprov_free_syncop( so );
915 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
917 slap_callback *sc = op->o_callback;
918 op->o_callback = sc->sc_next;
919 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
920 op->o_tmpfree( sc, op->o_tmpmemctx );
925 syncprov_op_abandon( Operation *op, SlapReply *rs )
927 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
928 syncprov_info_t *si = on->on_bi.bi_private;
929 syncops *so, *soprev;
931 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
932 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
933 soprev=so, so=so->s_next ) {
934 if ( so->s_op->o_connid == op->o_connid &&
935 so->s_op->o_msgid == op->orn_msgid ) {
936 so->s_op->o_abandon = 1;
937 soprev->s_next = so->s_next;
941 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
943 /* Is this really a Cancel exop? */
944 if ( op->o_tag != LDAP_REQ_ABANDON ) {
945 so->s_op->o_cancel = SLAP_CANCEL_ACK;
946 rs->sr_err = LDAP_CANCELLED;
947 send_ldap_result( so->s_op, rs );
948 if ( so->s_flags & PS_IS_DETACHED ) {
950 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
951 cb->sc_cleanup = syncprov_ab_cleanup;
952 cb->sc_next = op->o_callback;
954 return SLAP_CB_CONTINUE;
957 syncprov_drop_psearch( so, 0 );
959 return SLAP_CB_CONTINUE;
962 /* Find which persistent searches are affected by this operation */
964 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
966 slap_overinst *on = opc->son;
967 syncprov_info_t *si = on->on_bi.bi_private;
970 syncops *ss, *sprev, *snext;
977 fc.fdn = &op->o_req_ndn;
979 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
981 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
982 else dnParent( fc.fdn, &pdn );
983 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
987 if ( op->o_tag != LDAP_REQ_ADD ) {
988 op->o_bd->bd_info = (BackendInfo *)on->on_info;
989 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
990 /* If we're sending responses now, make a copy and unlock the DB */
991 if ( e && !saveit ) {
992 Entry *e2 = entry_dup( e );
993 be_entry_release_rw( op, e, 0 );
996 op->o_bd->bd_info = (BackendInfo *)on;
1003 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1004 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1005 opc->sreference = is_entry_referral( e );
1007 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1008 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1010 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1013 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1014 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1015 sprev = ss, ss=snext)
1026 /* If the base of the search is missing, signal a refresh */
1027 rc = syncprov_findbase( op, &fc );
1028 if ( rc != LDAP_SUCCESS ) {
1029 SlapReply rs = {REP_RESULT};
1030 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1031 "search base has changed" );
1032 sprev->s_next = snext;
1033 syncprov_drop_psearch( ss, 1 );
1037 /* If we're sending results now, look for this op in old matches */
1040 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1041 old=sm, sm=sm->sm_next ) {
1042 if ( sm->sm_op == ss ) {
1044 old->sm_next = sm->sm_next;
1045 op->o_tmpfree( sm, op->o_tmpmemctx );
1051 /* check if current o_req_dn is in scope and matches filter */
1052 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1053 LDAP_COMPARE_TRUE ) {
1055 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1056 sm->sm_next = opc->smatches;
1061 /* if found send UPDATE else send ADD */
1063 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1064 syncprov_sendresp( op, opc, ss, &e,
1065 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1066 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1069 } else if ( !saveit && found ) {
1071 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1072 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1073 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1076 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1078 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1079 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1080 be_entry_release_rw( op, e, 0 );
1081 op->o_bd->bd_info = (BackendInfo *)on;
1084 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1089 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1091 slap_callback *cb = op->o_callback;
1092 opcookie *opc = cb->sc_private;
1093 slap_overinst *on = opc->son;
1094 syncprov_info_t *si = on->on_bi.bi_private;
1095 syncmatches *sm, *snext;
1096 modtarget *mt, mtdummy;
1098 for (sm = opc->smatches; sm; sm=snext) {
1099 snext = sm->sm_next;
1100 syncprov_free_syncop( sm->sm_op );
1101 op->o_tmpfree( sm, op->o_tmpmemctx );
1104 /* Remove op from lock table */
1106 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1107 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1109 modinst *mi = mt->mt_mods;
1111 /* If there are more, promote the next one */
1112 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1113 if ( mi->mi_next ) {
1114 mt->mt_mods = mi->mi_next;
1115 mt->mt_op = mt->mt_mods->mi_op;
1116 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1118 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1119 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1120 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1124 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1125 if ( !BER_BVISNULL( &opc->suuid ))
1126 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1127 if ( !BER_BVISNULL( &opc->sndn ))
1128 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1129 if ( !BER_BVISNULL( &opc->sdn ))
1130 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1131 op->o_callback = cb->sc_next;
1132 op->o_tmpfree(cb, op->o_tmpmemctx);
1138 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1140 syncprov_info_t *si = on->on_bi.bi_private;
1143 struct berval bv[2];
1144 slap_callback cb = {0};
1145 int manage = get_manageDSAit(op);
1147 mod.sml_values = bv;
1148 bv[1].bv_val = NULL;
1149 bv[0] = si->si_ctxcsn;
1150 mod.sml_nvalues = NULL;
1151 mod.sml_desc = slap_schema.si_ad_contextCSN;
1152 mod.sml_op = LDAP_MOD_REPLACE;
1153 mod.sml_next = NULL;
1155 cb.sc_response = slap_null_cb;
1157 opm.o_tag = LDAP_REQ_MODIFY;
1158 opm.o_callback = &cb;
1159 opm.orm_modlist = &mod;
1160 opm.o_req_dn = op->o_bd->be_suffix[0];
1161 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1162 opm.o_bd->bd_info = on->on_info->oi_orig;
1163 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1164 opm.o_bd->be_modify( &opm, rs );
1165 opm.o_managedsait = manage;
1169 syncprov_add_slog( Operation *op, struct berval *csn )
1171 opcookie *opc = op->o_callback->sc_private;
1172 slap_overinst *on = opc->son;
1173 syncprov_info_t *si = on->on_bi.bi_private;
1179 /* Allocate a record. UUIDs are not NUL-terminated. */
1180 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1183 se->se_tag = op->o_tag;
1185 se->se_uuid.bv_val = (char *)(se+1);
1186 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1187 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1188 se->se_uuid.bv_len = opc->suuid.bv_len;
1190 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1191 se->se_csn.bv_val[csn->bv_len] = '\0';
1192 se->se_csn.bv_len = csn->bv_len;
1194 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1195 if ( sl->sl_head ) {
1196 sl->sl_tail->se_next = se;
1202 while ( sl->sl_num > sl->sl_size ) {
1204 sl->sl_head = se->se_next;
1205 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1206 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1209 if ( !sl->sl_head ) {
1213 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1217 /* Just set a flag if we found the matching entry */
1219 playlog_cb( Operation *op, SlapReply *rs )
1221 if ( rs->sr_type == REP_SEARCH ) {
1222 op->o_callback->sc_private = (void *)1;
1227 /* enter with sl->sl_mutex locked, release before returning */
1229 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1230 struct berval *oldcsn, struct berval *ctxcsn )
1232 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1233 syncprov_info_t *si = on->on_bi.bi_private;
1235 int i, j, ndel, num, nmods, mmods;
1238 if ( !sl->sl_num ) {
1239 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1247 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1248 num * UUID_LEN, op->o_tmpmemctx );
1250 uuids[0].bv_val = (char *)(uuids + num + 1);
1252 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1253 * and everything else at the end. Do this first so we can
1254 * unlock the list mutex.
1256 for ( se=sl->sl_head; se; se=se->se_next ) {
1257 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1258 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1259 if ( se->se_tag == LDAP_REQ_DELETE ) {
1266 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1267 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1268 uuids[j].bv_len = UUID_LEN;
1270 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1274 /* Zero out unused slots */
1275 for ( i=ndel; i < num - nmods; i++ )
1276 uuids[i].bv_len = 0;
1278 /* Mods must be validated to see if they belong in this delete set.
1282 /* Strip any duplicates */
1283 for ( i=0; i<nmods; i++ ) {
1284 for ( j=0; j<ndel; j++ ) {
1285 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1286 uuids[num - 1 - i].bv_len = 0;
1291 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1292 for ( j=0; j<i; j++ ) {
1293 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1294 uuids[num - 1 - i].bv_len = 0;
1303 SlapReply frs = { REP_RESULT };
1306 #ifdef LDAP_COMP_MATCH
1307 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1309 AttributeAssertion eq;
1311 slap_callback cb = {0};
1315 fop.o_sync_mode = 0;
1316 fop.o_callback = &cb;
1317 fop.ors_limit = NULL;
1318 fop.ors_tlimit = SLAP_NO_LIMIT;
1319 fop.ors_attrs = slap_anlist_all_attributes;
1320 fop.ors_attrsonly = 0;
1321 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1323 af.f_choice = LDAP_FILTER_AND;
1326 mf.f_choice = LDAP_FILTER_EQUALITY;
1328 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1329 mf.f_next = fop.ors_filter;
1331 fop.ors_filter = ⁡
1333 cb.sc_response = playlog_cb;
1334 fop.o_bd->bd_info = on->on_info->oi_orig;
1336 for ( i=ndel; i<num; i++ ) {
1337 if ( uuids[i].bv_len == 0 ) continue;
1339 mf.f_av_value = uuids[i];
1340 cb.sc_private = NULL;
1342 rc = fop.o_bd->be_search( &fop, &frs );
1344 /* If entry was not found, add to delete list */
1345 if ( !cb.sc_private ) {
1346 uuids[ndel++] = uuids[i];
1349 fop.o_bd->bd_info = (BackendInfo *)on;
1352 uuids[ndel].bv_val = NULL;
1353 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1358 syncprov_op_response( Operation *op, SlapReply *rs )
1360 opcookie *opc = op->o_callback->sc_private;
1361 slap_overinst *on = opc->son;
1362 syncprov_info_t *si = on->on_bi.bi_private;
1365 if ( rs->sr_err == LDAP_SUCCESS )
1367 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1368 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1370 /* Update our context CSN */
1372 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1373 slap_get_commit_csn( op, &maxcsn, &curcsn );
1374 if ( !BER_BVISNULL( &maxcsn ) ) {
1375 strcpy( cbuf, maxcsn.bv_val );
1376 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1377 strcpy( si->si_ctxcsnbuf, cbuf );
1378 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1382 /* Don't do any processing for consumer contextCSN updates */
1383 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1384 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1385 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1386 return SLAP_CB_CONTINUE;
1390 if ( si->si_chkops || si->si_chktime ) {
1392 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1396 if ( si->si_chktime &&
1397 (op->o_time - si->si_chklast >= si->si_chktime )) {
1399 si->si_chklast = op->o_time;
1402 syncprov_checkpoint( op, rs, on );
1405 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1407 opc->sctxcsn.bv_len = maxcsn.bv_len;
1408 opc->sctxcsn.bv_val = cbuf;
1410 /* Handle any persistent searches */
1414 case LDAP_REQ_MODIFY:
1415 case LDAP_REQ_MODRDN:
1416 case LDAP_REQ_EXTENDED:
1417 syncprov_matchops( op, opc, 0 );
1419 case LDAP_REQ_DELETE:
1420 /* for each match in opc->smatches:
1423 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1424 if ( sm->sm_op->s_op->o_abandon )
1426 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1427 LDAP_SYNC_DELETE, 1 );
1433 /* Add any log records */
1434 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1435 syncprov_add_slog( op, &curcsn );
1439 return SLAP_CB_CONTINUE;
1442 /* We don't use a subentry to store the context CSN any more.
1443 * We expose the current context CSN as an operational attribute
1444 * of the suffix entry.
1447 syncprov_op_compare( Operation *op, SlapReply *rs )
1449 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1450 syncprov_info_t *si = on->on_bi.bi_private;
1451 int rc = SLAP_CB_CONTINUE;
1453 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1454 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1458 struct berval bv[2];
1460 e.e_name = op->o_bd->be_suffix[0];
1461 e.e_nname = op->o_bd->be_nsuffix[0];
1463 BER_BVZERO( &bv[1] );
1464 bv[0] = si->si_ctxcsn;
1466 a.a_desc = slap_schema.si_ad_contextCSN;
1468 a.a_nvals = a.a_vals;
1470 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1472 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1473 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1474 if ( ! rs->sr_err ) {
1475 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1476 goto return_results;
1479 if ( get_assert( op ) &&
1480 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1482 rs->sr_err = LDAP_ASSERTION_FAILED;
1483 goto return_results;
1487 rs->sr_err = LDAP_COMPARE_FALSE;
1489 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1490 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1491 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1492 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1494 rs->sr_err = LDAP_COMPARE_TRUE;
1499 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1501 send_ldap_result( op, rs );
1503 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1504 rs->sr_err = LDAP_SUCCESS;
1513 syncprov_op_mod( Operation *op, SlapReply *rs )
1515 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1516 syncprov_info_t *si = on->on_bi.bi_private;
1518 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1520 (si->si_ops ? sizeof(modinst) : 0 ),
1522 opcookie *opc = (opcookie *)(cb+1);
1524 cb->sc_response = syncprov_op_response;
1525 cb->sc_cleanup = syncprov_op_cleanup;
1526 cb->sc_private = opc;
1527 cb->sc_next = op->o_callback;
1528 op->o_callback = cb;
1530 /* If there are active persistent searches, lock this operation.
1531 * See seqmod.c for the locking logic on its own.
1534 modtarget *mt, mtdummy;
1537 mi = (modinst *)(opc+1);
1540 /* See if we're already modifying this entry... */
1542 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1543 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1545 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1546 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1547 mt->mt_tail->mi_next = mi;
1549 /* wait for this op to get to head of list */
1550 while ( mt->mt_mods != mi ) {
1551 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1552 ldap_pvt_thread_yield();
1553 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1555 /* clean up if the caller is giving up */
1556 if ( op->o_abandon ) {
1558 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1560 m2->mi_next = mi->mi_next;
1561 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1562 op->o_tmpfree( cb, op->o_tmpmemctx );
1563 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1564 return SLAPD_ABANDON;
1567 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1569 /* Record that we're modifying this entry now */
1570 mt = ch_malloc( sizeof(modtarget) );
1573 mt->mt_op = mi->mi_op;
1574 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1575 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1576 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1580 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1581 syncprov_matchops( op, opc, 1 );
1583 return SLAP_CB_CONTINUE;
1587 syncprov_op_extended( Operation *op, SlapReply *rs )
1589 if ( exop_is_write( op ))
1590 return syncprov_op_mod( op, rs );
1592 return SLAP_CB_CONTINUE;
1595 typedef struct searchstate {
1596 slap_overinst *ss_on;
1602 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1604 if ( rs->sr_ctrls ) {
1605 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1606 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1607 rs->sr_ctrls = NULL;
1613 syncprov_detach_op( Operation *op, syncops *so )
1619 GroupAssertion *g1, *g2;
1621 /* count the search attrs */
1622 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1623 alen += op->ors_attrs[i].an_name.bv_len + 1;
1625 /* Make a new copy of the operation */
1626 size = sizeof(Operation) + sizeof(Opheader) +
1627 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1628 op->o_req_dn.bv_len + 1 +
1629 op->o_req_ndn.bv_len + 1 +
1630 op->o_ndn.bv_len + 1 +
1631 so->s_filterstr.bv_len + 1;
1632 op2 = (Operation *)ch_calloc( 1, size );
1633 op2->o_hdr = (Opheader *)(op2+1);
1635 /* Copy the fields we care about explicitly, leave the rest alone */
1636 *op2->o_hdr = *op->o_hdr;
1637 op2->o_tag = op->o_tag;
1638 op2->o_time = op->o_time;
1639 op2->o_bd = op->o_bd;
1640 op2->o_request = op->o_request;
1643 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1644 ptr = (char *)(op2->ors_attrs+i+1);
1645 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1646 op2->ors_attrs[i] = op->ors_attrs[i];
1647 op2->ors_attrs[i].an_name.bv_val = ptr;
1648 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1650 BER_BVZERO( &op2->ors_attrs[i].an_name );
1652 ptr = (char *)(op2->o_hdr + 1);
1654 op2->o_authz = op->o_authz;
1655 op2->o_ndn.bv_val = ptr;
1656 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1657 op2->o_dn = op2->o_ndn;
1658 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1659 op2->o_req_dn.bv_val = ptr;
1660 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1661 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1662 op2->o_req_ndn.bv_val = ptr;
1663 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1664 op2->ors_filterstr.bv_val = ptr;
1665 strcpy( ptr, so->s_filterstr.bv_val );
1666 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1667 op2->ors_filter = str2filter( ptr );
1670 /* Copy any cached group ACLs individually */
1671 op2->o_groups = NULL;
1672 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1673 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1675 strcpy( g2->ga_ndn, g1->ga_ndn );
1676 g2->ga_next = op2->o_groups;
1680 /* Add op2 to conn so abandon will find us */
1681 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1682 op->o_conn->c_n_ops_executing++;
1683 op->o_conn->c_n_ops_completed--;
1684 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1685 so->s_flags |= PS_IS_DETACHED;
1686 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1690 syncprov_search_response( Operation *op, SlapReply *rs )
1692 searchstate *ss = op->o_callback->sc_private;
1693 slap_overinst *on = ss->ss_on;
1694 syncprov_info_t *si = on->on_bi.bi_private;
1695 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1697 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1699 /* If we got a referral without a referral object, there's
1700 * something missing that we cannot replicate. Just ignore it.
1701 * The consumer will abort because we didn't send the expected
1704 if ( !rs->sr_entry ) {
1705 assert( rs->sr_entry );
1706 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1707 return SLAP_CB_CONTINUE;
1709 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1710 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1711 slap_schema.si_ad_entryCSN );
1713 /* Don't send the ctx entry twice */
1714 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1715 return LDAP_SUCCESS;
1717 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1719 rs->sr_ctrls[1] = NULL;
1720 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1721 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1722 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1723 struct berval cookie;
1725 slap_compose_sync_cookie( op, &cookie,
1726 &op->ors_filter->f_and->f_ava->aa_value,
1727 srs->sr_state.rid );
1729 /* Is this a regular refresh? */
1731 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1733 rs->sr_ctrls[1] = NULL;
1734 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1735 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1736 LDAP_SYNC_REFRESH_DELETES );
1739 /* It's RefreshAndPersist, transition to Persist phase */
1740 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1741 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1742 &cookie, 1, NULL, 0 );
1743 /* Flush any queued persist messages */
1744 if ( ss->ss_so->s_res ) {
1745 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1747 syncprov_qplay( op, on, ss->ss_so );
1750 /* Turn off the refreshing flag */
1751 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1753 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1755 /* Detach this Op from frontend control */
1756 syncprov_detach_op( op, ss->ss_so );
1758 return LDAP_SUCCESS;
1762 return SLAP_CB_CONTINUE;
1766 syncprov_op_search( Operation *op, SlapReply *rs )
1768 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1769 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1771 int gotstate = 0, nochange = 0, do_present = 1;
1772 Filter *fand, *fava;
1773 syncops *sop = NULL;
1776 struct berval ctxcsn;
1777 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1779 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1781 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1782 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1786 srs = op->o_controls[slap_cids.sc_LDAPsync];
1787 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1789 /* If this is a persistent search, set it up right away */
1790 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1800 so.s_flags = PS_IS_REFRESHING;
1801 /* syncprov_findbase expects to be called as a callback... */
1802 sc.sc_private = &opc;
1804 cb = op->o_callback;
1805 op->o_callback = ≻
1806 rs->sr_err = syncprov_findbase( op, &fc );
1807 op->o_callback = cb;
1809 if ( rs->sr_err != LDAP_SUCCESS ) {
1810 send_ldap_result( op, rs );
1813 sop = ch_malloc( sizeof( syncops ));
1815 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1816 sop->s_rid = srs->sr_state.rid;
1819 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1820 sop->s_next = si->si_ops;
1822 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1825 /* snapshot the ctxcsn */
1826 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1827 strcpy( csnbuf, si->si_ctxcsnbuf );
1828 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1829 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1830 ctxcsn.bv_val = csnbuf;
1832 /* If we have a cookie, handle the PRESENT lookups */
1833 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1836 /* The cookie was validated when it was parsed, just use it */
1838 /* If just Refreshing and nothing has changed, shortcut it */
1839 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1841 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1842 LDAPControl *ctrls[2];
1846 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1847 NULL, LDAP_SYNC_REFRESH_DELETES );
1848 rs->sr_ctrls = ctrls;
1849 rs->sr_err = LDAP_SUCCESS;
1850 send_ldap_result( op, rs );
1851 rs->sr_ctrls = NULL;
1856 /* Do we have a sessionlog for this search? */
1859 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1860 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1862 /* mutex is unlocked in playlog */
1863 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1865 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1868 /* Is the CSN still present in the database? */
1869 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1870 /* No, so a reload is required */
1871 #if 0 /* the consumer doesn't seem to send this hint */
1872 if ( op->o_sync_rhint == 0 ) {
1873 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1879 /* If changed and doing Present lookup, send Present UUIDs */
1880 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1882 send_ldap_result( op, rs );
1889 /* Append CSN range to search filter, save original filter
1890 * for persistent search evaluation
1893 sop->s_filterstr= op->ors_filterstr;
1896 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1897 fand->f_choice = LDAP_FILTER_AND;
1898 fand->f_next = NULL;
1899 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1900 fava->f_choice = LDAP_FILTER_LE;
1901 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1902 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1903 #ifdef LDAP_COMP_MATCH
1904 fava->f_ava->aa_cf = NULL;
1906 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1909 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1910 fava = fava->f_next;
1911 fava->f_choice = LDAP_FILTER_GE;
1912 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1913 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1914 #ifdef LDAP_COMP_MATCH
1915 fava->f_ava->aa_cf = NULL;
1917 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1919 fava->f_next = op->ors_filter;
1920 op->ors_filter = fand;
1921 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1923 /* Let our callback add needed info to returned entries */
1924 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1925 ss = (searchstate *)(cb+1);
1928 ss->ss_present = do_present;
1929 cb->sc_response = syncprov_search_response;
1930 cb->sc_cleanup = syncprov_search_cleanup;
1931 cb->sc_private = ss;
1932 cb->sc_next = op->o_callback;
1933 op->o_callback = cb;
1935 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1936 op->o_sync_mode &= SLAP_CONTROL_MASK;
1939 /* If this is a persistent search and no changes were reported during
1940 * the refresh phase, just invoke the response callback to transition
1941 * us into persist phase
1944 rs->sr_err = LDAP_SUCCESS;
1945 rs->sr_nentries = 0;
1946 send_ldap_result( op, rs );
1949 return SLAP_CB_CONTINUE;
1953 syncprov_operational(
1957 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1958 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1960 if ( rs->sr_entry &&
1961 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1963 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1964 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1965 Attribute *a, **ap = NULL;
1967 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1968 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1973 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1975 a = ch_malloc( sizeof(Attribute));
1976 a->a_desc = slap_schema.si_ad_contextCSN;
1977 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1978 a->a_vals[1].bv_val = NULL;
1979 a->a_nvals = a->a_vals;
1985 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1987 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1989 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1991 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1994 return SLAP_CB_CONTINUE;
2006 slap_overinst *on = (slap_overinst *)be->bd_info;
2007 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2009 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
2011 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2012 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
2015 si->si_chkops = atoi( argv[1] );
2016 si->si_chktime = atoi( argv[2] ) * 60;
2019 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
2023 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2024 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
2027 size = atoi( argv[1] );
2030 "%s: line %d: session log size %d is negative\n",
2031 fname, lineno, size );
2036 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2037 sl->sl_mincsn.bv_val = (char *)(sl+1);
2038 sl->sl_mincsn.bv_len = 0;
2040 sl->sl_head = sl->sl_tail = NULL;
2041 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2048 return SLAP_CONF_UNKNOWN;
2051 /* Cheating - we have no thread pool context for these functions,
2054 typedef struct thread_keys {
2057 ldap_pvt_thread_pool_keyfree_t *xfree;
2061 /* A fake thread context */
2062 static thread_keys thrctx[MAXKEYS];
2064 /* Read any existing contextCSN from the underlying db.
2065 * Then search for any entries newer than that. If no value exists,
2066 * just generate it. Cache whatever result.
2073 slap_overinst *on = (slap_overinst *) be->bd_info;
2074 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2077 char opbuf[OPERATION_BUFFER_SIZE];
2078 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2079 Operation *op = (Operation *)opbuf;
2084 if ( slapMode & SLAP_TOOL_MODE ) {
2088 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2093 connection_fake_init( &conn, op, thrctx );
2095 op->o_dn = be->be_rootdn;
2096 op->o_ndn = be->be_rootndn;
2098 ctxcsnbuf[0] = '\0';
2100 op->o_bd->bd_info = on->on_info->oi_orig;
2101 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2102 slap_schema.si_ad_contextCSN, 0, &e );
2105 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2107 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2108 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2109 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2110 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2111 si->si_ctxcsn.bv_len );
2112 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2113 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2115 be_entry_release_rw( op, e, 0 );
2116 op->o_bd->bd_info = (BackendInfo *)on;
2117 op->o_req_dn = be->be_suffix[0];
2118 op->o_req_ndn = be->be_nsuffix[0];
2119 op->ors_scope = LDAP_SCOPE_SUBTREE;
2120 syncprov_findcsn( op, FIND_MAXCSN );
2121 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2122 /* If we're also a consumer, and we didn't find the context entry,
2123 * then don't generate anything, wait for our provider to send it
2129 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2130 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2131 &si->si_ctxcsn, 0 );
2134 /* If our ctxcsn is different from what was read from the root
2135 * entry, write the new value out.
2137 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2138 SlapReply rs = {REP_RESULT};
2139 syncprov_checkpoint( op, &rs, on );
2143 op->o_bd->bd_info = (BackendInfo *)on;
2147 /* Write the current contextCSN into the underlying db.
2154 slap_overinst *on = (slap_overinst *) be->bd_info;
2155 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2158 if ( slapMode & SLAP_TOOL_MODE ) {
2161 if ( si->si_numops ) {
2163 char opbuf[OPERATION_BUFFER_SIZE];
2164 Operation *op = (Operation *)opbuf;
2165 SlapReply rs = {REP_RESULT};
2167 connection_fake_init( &conn, op, thrctx );
2169 op->o_dn = be->be_rootdn;
2170 op->o_ndn = be->be_rootndn;
2171 syncprov_checkpoint( op, &rs, on );
2173 for ( i=0; thrctx[i].key; i++) {
2174 if ( thrctx[i].xfree )
2175 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2176 thrctx[i].key = NULL;
2187 slap_overinst *on = (slap_overinst *)be->bd_info;
2188 syncprov_info_t *si;
2190 si = ch_calloc(1, sizeof(syncprov_info_t));
2191 on->on_bi.bi_private = si;
2192 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2193 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2194 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2195 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2197 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2198 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2200 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2201 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2207 syncprov_db_destroy(
2211 slap_overinst *on = (slap_overinst *)be->bd_info;
2212 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2215 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2216 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2217 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2224 static int syncprov_parseCtrl (
2233 struct berval cookie = BER_BVNULL;
2237 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2238 rs->sr_text = "Sync control specified multiple times";
2239 return LDAP_PROTOCOL_ERROR;
2242 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2243 rs->sr_text = "Sync control specified with pagedResults control";
2244 return LDAP_PROTOCOL_ERROR;
2247 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2248 rs->sr_text = "Sync control value is empty (or absent)";
2249 return LDAP_PROTOCOL_ERROR;
2252 /* Parse the control value
2253 * syncRequestValue ::= SEQUENCE {
2258 * refreshAndPersist (3)
2260 * cookie syncCookie OPTIONAL
2264 ber = ber_init( &ctrl->ldctl_value );
2266 rs->sr_text = "internal error";
2270 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2271 rs->sr_text = "Sync control : mode decoding error";
2272 return LDAP_PROTOCOL_ERROR;
2276 case LDAP_SYNC_REFRESH_ONLY:
2277 mode = SLAP_SYNC_REFRESH;
2279 case LDAP_SYNC_REFRESH_AND_PERSIST:
2280 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2283 rs->sr_text = "Sync control : unknown update mode";
2284 return LDAP_PROTOCOL_ERROR;
2287 tag = ber_peek_tag( ber, &len );
2289 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2290 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2291 rs->sr_text = "Sync control : cookie decoding error";
2292 return LDAP_PROTOCOL_ERROR;
2295 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2296 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2297 rs->sr_text = "Sync control : rhint decoding error";
2298 return LDAP_PROTOCOL_ERROR;
2301 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2302 rs->sr_text = "Sync control : decoding error";
2303 return LDAP_PROTOCOL_ERROR;
2305 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2306 sr->sr_rhint = rhint;
2307 if (!BER_BVISNULL(&cookie)) {
2308 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2309 slap_parse_sync_cookie( &sr->sr_state );
2312 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2314 (void) ber_free( ber, 1 );
2316 op->o_sync = ctrl->ldctl_iscritical
2317 ? SLAP_CONTROL_CRITICAL
2318 : SLAP_CONTROL_NONCRITICAL;
2320 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2322 return LDAP_SUCCESS;
2325 /* This overlay is set up for dynamic loading via moduleload. For static
2326 * configuration, you'll need to arrange for the slap_overinst to be
2327 * initialized and registered by some other function inside slapd.
2330 static slap_overinst syncprov;
2337 rc = register_supported_control( LDAP_CONTROL_SYNC,
2338 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2339 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2340 if ( rc != LDAP_SUCCESS ) {
2341 fprintf( stderr, "Failed to register control %d\n", rc );
2345 syncprov.on_bi.bi_type = "syncprov";
2346 syncprov.on_bi.bi_db_init = syncprov_db_init;
2347 syncprov.on_bi.bi_db_config = syncprov_db_config;
2348 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2349 syncprov.on_bi.bi_db_open = syncprov_db_open;
2350 syncprov.on_bi.bi_db_close = syncprov_db_close;
2352 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2353 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2355 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2356 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2357 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2358 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2359 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2360 syncprov.on_bi.bi_op_search = syncprov_op_search;
2361 syncprov.on_bi.bi_extended = syncprov_op_extended;
2362 syncprov.on_bi.bi_operational = syncprov_operational;
2364 return overlay_register( &syncprov );
2367 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2369 init_module( int argc, char *argv[] )
2371 return syncprov_init();
2373 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2375 #endif /* defined(SLAPD_OVER_SYNCPROV) */