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) {
714 opc.sndn = sr->s_ndn;
715 opc.suuid = sr->s_uuid;
716 opc.sctxcsn = sr->s_csn;
717 opc.sreference = sr->s_isreference;
720 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
721 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
728 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );
731 be_entry_release_rw( op, e, 0 );
739 op->o_bd->bd_info = (BackendInfo *)on;
741 so->s_restail = NULL;
745 /* Send a persistent search response */
747 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue )
749 slap_overinst *on = opc->son;
750 syncprov_info_t *si = on->on_bi.bi_private;
752 SlapReply rs = { REP_SEARCH };
753 LDAPControl *ctrls[2];
754 struct berval cookie;
756 Attribute a_uuid = {0};
757 Operation sop = *so->s_op;
762 sop.o_tmpmemctx = op->o_tmpmemctx;
764 sop.o_controls = op->o_controls;
765 sop.o_private = op->o_private;
767 /* If queueing is allowed */
769 ldap_pvt_thread_mutex_lock( &so->s_mutex );
770 /* If we're still in refresh mode, must queue */
771 if (so->s_flags & PS_IS_REFRESHING) {
772 return syncprov_qresp( opc, so, mode );
774 /* If connection is free but queue is non-empty,
775 * try to flush the queue.
778 rs.sr_err = syncprov_qplay( &sop, on, so );
780 /* If the connection is busy, must queue */
781 if ( sop.o_conn->c_writewaiter || rs.sr_err == LDAP_BUSY ) {
782 return syncprov_qresp( opc, so, mode );
784 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
786 /* Queueing not allowed and conn is busy, give up */
787 if ( sop.o_conn->c_writewaiter )
792 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
794 e_uuid.e_attrs = &a_uuid;
795 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
796 a_uuid.a_nvals = &opc->suuid;
797 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
798 mode, ctrls, 0, 1, &cookie );
801 op->o_bd->bd_info = (BackendInfo *)on->on_info;
805 if ( rs.sr_entry->e_private )
806 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
807 if ( opc->sreference ) {
808 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
809 send_search_reference( &sop, &rs );
810 ber_bvarray_free( rs.sr_ref );
816 case LDAP_SYNC_MODIFY:
818 if ( rs.sr_entry->e_private )
819 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
820 rs.sr_attrs = sop.ors_attrs;
821 send_search_entry( &sop, &rs );
825 case LDAP_SYNC_DELETE:
826 e_uuid.e_attrs = NULL;
827 e_uuid.e_name = opc->sdn;
828 e_uuid.e_nname = opc->sndn;
829 rs.sr_entry = &e_uuid;
830 if ( opc->sreference ) {
831 struct berval bv = BER_BVNULL;
833 send_search_reference( &sop, &rs );
835 send_search_entry( &sop, &rs );
841 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
842 op->o_private = sop.o_private;
844 /* Check queue again here; if we were hanging in a send and eventually
845 * recovered, there may be more to send now.
847 if ( rs.sr_err == LDAP_SUCCESS && queue && so->s_res ) {
848 ldap_pvt_thread_mutex_lock( &so->s_mutex );
849 rs.sr_err = syncprov_qplay( &sop, on, so );
850 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
856 syncprov_free_syncop( syncops *so )
858 syncres *sr, *srnext;
859 GroupAssertion *ga, *gnext;
861 ldap_pvt_thread_mutex_lock( &so->s_mutex );
863 if ( so->s_inuse > 0 ) {
864 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
867 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
868 if ( so->s_flags & PS_IS_DETACHED ) {
869 filter_free( so->s_op->ors_filter );
870 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
876 ch_free( so->s_base.bv_val );
877 for ( sr=so->s_res; sr; sr=srnext ) {
881 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
886 syncprov_drop_psearch( syncops *so, int lock )
888 if ( so->s_flags & PS_IS_DETACHED ) {
890 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
891 so->s_op->o_conn->c_n_ops_executing--;
892 so->s_op->o_conn->c_n_ops_completed++;
893 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
896 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
898 syncprov_free_syncop( so );
904 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
906 slap_callback *sc = op->o_callback;
907 op->o_callback = sc->sc_next;
908 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
909 op->o_tmpfree( sc, op->o_tmpmemctx );
914 syncprov_op_abandon( Operation *op, SlapReply *rs )
916 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
917 syncprov_info_t *si = on->on_bi.bi_private;
918 syncops *so, *soprev;
920 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
921 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
922 soprev=so, so=so->s_next ) {
923 if ( so->s_op->o_connid == op->o_connid &&
924 so->s_op->o_msgid == op->orn_msgid ) {
925 so->s_op->o_abandon = 1;
926 soprev->s_next = so->s_next;
930 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
932 /* Is this really a Cancel exop? */
933 if ( op->o_tag != LDAP_REQ_ABANDON ) {
934 so->s_op->o_cancel = SLAP_CANCEL_ACK;
935 rs->sr_err = LDAP_CANCELLED;
936 send_ldap_result( so->s_op, rs );
937 if ( so->s_flags & PS_IS_DETACHED ) {
939 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
940 cb->sc_cleanup = syncprov_ab_cleanup;
941 cb->sc_next = op->o_callback;
943 return SLAP_CB_CONTINUE;
946 syncprov_drop_psearch( so, 0 );
948 return SLAP_CB_CONTINUE;
951 /* Find which persistent searches are affected by this operation */
953 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
955 slap_overinst *on = opc->son;
956 syncprov_info_t *si = on->on_bi.bi_private;
959 syncops *ss, *sprev, *snext;
966 fc.fdn = &op->o_req_ndn;
968 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
970 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
971 else dnParent( fc.fdn, &pdn );
972 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
976 if ( op->o_tag != LDAP_REQ_ADD ) {
977 op->o_bd->bd_info = (BackendInfo *)on->on_info;
978 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
979 /* If we're sending responses now, make a copy and unlock the DB */
980 if ( e && !saveit ) {
981 Entry *e2 = entry_dup( e );
982 be_entry_release_rw( op, e, 0 );
985 op->o_bd->bd_info = (BackendInfo *)on;
992 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
993 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
994 opc->sreference = is_entry_referral( e );
996 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
997 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
999 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1002 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1003 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1004 sprev = ss, ss=snext)
1015 /* If the base of the search is missing, signal a refresh */
1016 rc = syncprov_findbase( op, &fc );
1017 if ( rc != LDAP_SUCCESS ) {
1018 SlapReply rs = {REP_RESULT};
1019 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1020 "search base has changed" );
1021 sprev->s_next = snext;
1022 syncprov_drop_psearch( ss, 1 );
1026 /* If we're sending results now, look for this op in old matches */
1029 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1030 old=sm, sm=sm->sm_next ) {
1031 if ( sm->sm_op == ss ) {
1033 old->sm_next = sm->sm_next;
1034 op->o_tmpfree( sm, op->o_tmpmemctx );
1040 /* check if current o_req_dn is in scope and matches filter */
1041 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1042 LDAP_COMPARE_TRUE ) {
1044 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1045 sm->sm_next = opc->smatches;
1050 /* if found send UPDATE else send ADD */
1052 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1053 syncprov_sendresp( op, opc, ss, &e,
1054 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1055 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1058 } else if ( !saveit && found ) {
1060 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1061 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1062 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1065 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1067 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1068 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1069 be_entry_release_rw( op, e, 0 );
1070 op->o_bd->bd_info = (BackendInfo *)on;
1073 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1078 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1080 slap_callback *cb = op->o_callback;
1081 opcookie *opc = cb->sc_private;
1082 slap_overinst *on = opc->son;
1083 syncprov_info_t *si = on->on_bi.bi_private;
1084 syncmatches *sm, *snext;
1085 modtarget *mt, mtdummy;
1087 for (sm = opc->smatches; sm; sm=snext) {
1088 snext = sm->sm_next;
1089 syncprov_free_syncop( sm->sm_op );
1090 op->o_tmpfree( sm, op->o_tmpmemctx );
1093 /* Remove op from lock table */
1095 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1096 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1098 modinst *mi = mt->mt_mods;
1100 /* If there are more, promote the next one */
1101 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1102 if ( mi->mi_next ) {
1103 mt->mt_mods = mi->mi_next;
1104 mt->mt_op = mt->mt_mods->mi_op;
1105 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1107 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1108 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1109 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1113 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1114 if ( !BER_BVISNULL( &opc->suuid ))
1115 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1116 if ( !BER_BVISNULL( &opc->sndn ))
1117 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1118 if ( !BER_BVISNULL( &opc->sdn ))
1119 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1120 op->o_callback = cb->sc_next;
1121 op->o_tmpfree(cb, op->o_tmpmemctx);
1127 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1129 syncprov_info_t *si = on->on_bi.bi_private;
1132 struct berval bv[2];
1133 slap_callback cb = {0};
1134 int manage = get_manageDSAit(op);
1136 mod.sml_values = bv;
1137 bv[1].bv_val = NULL;
1138 bv[0] = si->si_ctxcsn;
1139 mod.sml_nvalues = NULL;
1140 mod.sml_desc = slap_schema.si_ad_contextCSN;
1141 mod.sml_op = LDAP_MOD_REPLACE;
1142 mod.sml_next = NULL;
1144 cb.sc_response = slap_null_cb;
1146 opm.o_tag = LDAP_REQ_MODIFY;
1147 opm.o_callback = &cb;
1148 opm.orm_modlist = &mod;
1149 opm.o_req_dn = op->o_bd->be_suffix[0];
1150 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1151 opm.o_bd->bd_info = on->on_info->oi_orig;
1152 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1153 opm.o_bd->be_modify( &opm, rs );
1154 opm.o_managedsait = manage;
1158 syncprov_add_slog( Operation *op, struct berval *csn )
1160 opcookie *opc = op->o_callback->sc_private;
1161 slap_overinst *on = opc->son;
1162 syncprov_info_t *si = on->on_bi.bi_private;
1168 /* Allocate a record. UUIDs are not NUL-terminated. */
1169 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1172 se->se_tag = op->o_tag;
1174 se->se_uuid.bv_val = (char *)(se+1);
1175 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1176 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1177 se->se_uuid.bv_len = opc->suuid.bv_len;
1179 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1180 se->se_csn.bv_val[csn->bv_len] = '\0';
1181 se->se_csn.bv_len = csn->bv_len;
1183 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1184 if ( sl->sl_head ) {
1185 sl->sl_tail->se_next = se;
1191 while ( sl->sl_num > sl->sl_size ) {
1193 sl->sl_head = se->se_next;
1194 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1195 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1198 if ( !sl->sl_head ) {
1202 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1206 /* Just set a flag if we found the matching entry */
1208 playlog_cb( Operation *op, SlapReply *rs )
1210 if ( rs->sr_type == REP_SEARCH ) {
1211 op->o_callback->sc_private = (void *)1;
1216 /* enter with sl->sl_mutex locked, release before returning */
1218 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1219 struct berval *oldcsn, struct berval *ctxcsn )
1221 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1222 syncprov_info_t *si = on->on_bi.bi_private;
1224 int i, j, ndel, num, nmods, mmods;
1227 if ( !sl->sl_num ) {
1228 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1236 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1237 num * UUID_LEN, op->o_tmpmemctx );
1239 uuids[0].bv_val = (char *)(uuids + num + 1);
1241 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1242 * and everything else at the end. Do this first so we can
1243 * unlock the list mutex.
1245 for ( se=sl->sl_head; se; se=se->se_next ) {
1246 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1247 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1248 if ( se->se_tag == LDAP_REQ_DELETE ) {
1255 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1256 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1257 uuids[j].bv_len = UUID_LEN;
1259 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1263 /* Zero out unused slots */
1264 for ( i=ndel; i < num - nmods; i++ )
1265 uuids[i].bv_len = 0;
1267 /* Mods must be validated to see if they belong in this delete set.
1271 /* Strip any duplicates */
1272 for ( i=0; i<nmods; i++ ) {
1273 for ( j=0; j<ndel; j++ ) {
1274 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1275 uuids[num - 1 - i].bv_len = 0;
1280 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1281 for ( j=0; j<i; j++ ) {
1282 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1283 uuids[num - 1 - i].bv_len = 0;
1292 SlapReply frs = { REP_RESULT };
1295 #ifdef LDAP_COMP_MATCH
1296 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1298 AttributeAssertion eq;
1300 slap_callback cb = {0};
1304 fop.o_sync_mode = 0;
1305 fop.o_callback = &cb;
1306 fop.ors_limit = NULL;
1307 fop.ors_tlimit = SLAP_NO_LIMIT;
1308 fop.ors_attrs = slap_anlist_all_attributes;
1309 fop.ors_attrsonly = 0;
1310 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1312 af.f_choice = LDAP_FILTER_AND;
1315 mf.f_choice = LDAP_FILTER_EQUALITY;
1317 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1318 mf.f_next = fop.ors_filter;
1320 fop.ors_filter = ⁡
1322 cb.sc_response = playlog_cb;
1323 fop.o_bd->bd_info = on->on_info->oi_orig;
1325 for ( i=ndel; i<num; i++ ) {
1326 if ( uuids[i].bv_len == 0 ) continue;
1328 mf.f_av_value = uuids[i];
1329 cb.sc_private = NULL;
1331 rc = fop.o_bd->be_search( &fop, &frs );
1333 /* If entry was not found, add to delete list */
1334 if ( !cb.sc_private ) {
1335 uuids[ndel++] = uuids[i];
1338 fop.o_bd->bd_info = (BackendInfo *)on;
1341 uuids[ndel].bv_val = NULL;
1342 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1347 syncprov_op_response( Operation *op, SlapReply *rs )
1349 opcookie *opc = op->o_callback->sc_private;
1350 slap_overinst *on = opc->son;
1351 syncprov_info_t *si = on->on_bi.bi_private;
1354 if ( rs->sr_err == LDAP_SUCCESS )
1356 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1357 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1359 /* Update our context CSN */
1361 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1362 slap_get_commit_csn( op, &maxcsn, &curcsn );
1363 if ( !BER_BVISNULL( &maxcsn ) ) {
1364 strcpy( cbuf, maxcsn.bv_val );
1365 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1366 strcpy( si->si_ctxcsnbuf, cbuf );
1367 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1371 /* Don't do any processing for consumer contextCSN updates */
1372 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1373 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1374 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1375 return SLAP_CB_CONTINUE;
1379 if ( si->si_chkops || si->si_chktime ) {
1381 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1385 if ( si->si_chktime &&
1386 (op->o_time - si->si_chklast >= si->si_chktime )) {
1388 si->si_chklast = op->o_time;
1391 syncprov_checkpoint( op, rs, on );
1394 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1396 opc->sctxcsn.bv_len = maxcsn.bv_len;
1397 opc->sctxcsn.bv_val = cbuf;
1399 /* Handle any persistent searches */
1403 case LDAP_REQ_MODIFY:
1404 case LDAP_REQ_MODRDN:
1405 case LDAP_REQ_EXTENDED:
1406 syncprov_matchops( op, opc, 0 );
1408 case LDAP_REQ_DELETE:
1409 /* for each match in opc->smatches:
1412 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1413 if ( sm->sm_op->s_op->o_abandon )
1415 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1416 LDAP_SYNC_DELETE, 1 );
1422 /* Add any log records */
1423 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1424 syncprov_add_slog( op, &curcsn );
1428 return SLAP_CB_CONTINUE;
1431 /* We don't use a subentry to store the context CSN any more.
1432 * We expose the current context CSN as an operational attribute
1433 * of the suffix entry.
1436 syncprov_op_compare( Operation *op, SlapReply *rs )
1438 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1439 syncprov_info_t *si = on->on_bi.bi_private;
1440 int rc = SLAP_CB_CONTINUE;
1442 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1443 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1447 struct berval bv[2];
1449 e.e_name = op->o_bd->be_suffix[0];
1450 e.e_nname = op->o_bd->be_nsuffix[0];
1452 BER_BVZERO( &bv[1] );
1453 bv[0] = si->si_ctxcsn;
1455 a.a_desc = slap_schema.si_ad_contextCSN;
1457 a.a_nvals = a.a_vals;
1459 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1461 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1462 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1463 if ( ! rs->sr_err ) {
1464 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1465 goto return_results;
1468 if ( get_assert( op ) &&
1469 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1471 rs->sr_err = LDAP_ASSERTION_FAILED;
1472 goto return_results;
1476 rs->sr_err = LDAP_COMPARE_FALSE;
1478 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1479 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1480 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1481 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1483 rs->sr_err = LDAP_COMPARE_TRUE;
1488 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1490 send_ldap_result( op, rs );
1492 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1493 rs->sr_err = LDAP_SUCCESS;
1502 syncprov_op_mod( Operation *op, SlapReply *rs )
1504 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1505 syncprov_info_t *si = on->on_bi.bi_private;
1507 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1509 (si->si_ops ? sizeof(modinst) : 0 ),
1511 opcookie *opc = (opcookie *)(cb+1);
1513 cb->sc_response = syncprov_op_response;
1514 cb->sc_cleanup = syncprov_op_cleanup;
1515 cb->sc_private = opc;
1516 cb->sc_next = op->o_callback;
1517 op->o_callback = cb;
1519 /* If there are active persistent searches, lock this operation.
1520 * See seqmod.c for the locking logic on its own.
1523 modtarget *mt, mtdummy;
1526 mi = (modinst *)(opc+1);
1529 /* See if we're already modifying this entry... */
1531 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1532 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1534 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1535 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1536 mt->mt_tail->mi_next = mi;
1538 /* wait for this op to get to head of list */
1539 while ( mt->mt_mods != mi ) {
1540 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1541 ldap_pvt_thread_yield();
1542 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1544 /* clean up if the caller is giving up */
1545 if ( op->o_abandon ) {
1547 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1549 m2->mi_next = mi->mi_next;
1550 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1551 op->o_tmpfree( cb, op->o_tmpmemctx );
1552 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1553 return SLAPD_ABANDON;
1556 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1558 /* Record that we're modifying this entry now */
1559 mt = ch_malloc( sizeof(modtarget) );
1562 mt->mt_op = mi->mi_op;
1563 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1564 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1565 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1569 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1570 syncprov_matchops( op, opc, 1 );
1572 return SLAP_CB_CONTINUE;
1576 syncprov_op_extended( Operation *op, SlapReply *rs )
1578 if ( exop_is_write( op ))
1579 return syncprov_op_mod( op, rs );
1581 return SLAP_CB_CONTINUE;
1584 typedef struct searchstate {
1585 slap_overinst *ss_on;
1591 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1593 if ( rs->sr_ctrls ) {
1594 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1595 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1596 rs->sr_ctrls = NULL;
1602 syncprov_detach_op( Operation *op, syncops *so )
1608 GroupAssertion *g1, *g2;
1610 /* count the search attrs */
1611 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1612 alen += op->ors_attrs[i].an_name.bv_len + 1;
1614 /* Make a new copy of the operation */
1615 size = sizeof(Operation) + sizeof(Opheader) +
1616 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1617 op->o_req_dn.bv_len + 1 +
1618 op->o_req_ndn.bv_len + 1 +
1619 op->o_ndn.bv_len + 1 +
1620 so->s_filterstr.bv_len + 1;
1621 op2 = (Operation *)ch_calloc( 1, size );
1622 op2->o_hdr = (Opheader *)(op2+1);
1624 /* Copy the fields we care about explicitly, leave the rest alone */
1625 *op2->o_hdr = *op->o_hdr;
1626 op2->o_tag = op->o_tag;
1627 op2->o_time = op->o_time;
1628 op2->o_bd = op->o_bd;
1629 op2->o_request = op->o_request;
1632 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1633 ptr = (char *)(op2->ors_attrs+i+1);
1634 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1635 op2->ors_attrs[i] = op->ors_attrs[i];
1636 op2->ors_attrs[i].an_name.bv_val = ptr;
1637 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1639 BER_BVZERO( &op2->ors_attrs[i].an_name );
1641 ptr = (char *)(op2->o_hdr + 1);
1643 op2->o_authz = op->o_authz;
1644 op2->o_ndn.bv_val = ptr;
1645 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1646 op2->o_dn = op2->o_ndn;
1647 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1648 op2->o_req_dn.bv_val = ptr;
1649 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1650 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1651 op2->o_req_ndn.bv_val = ptr;
1652 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1653 op2->ors_filterstr.bv_val = ptr;
1654 strcpy( ptr, so->s_filterstr.bv_val );
1655 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1656 op2->ors_filter = str2filter( ptr );
1659 /* Copy any cached group ACLs individually */
1660 op2->o_groups = NULL;
1661 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1662 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1664 strcpy( g2->ga_ndn, g1->ga_ndn );
1665 g2->ga_next = op2->o_groups;
1669 /* Add op2 to conn so abandon will find us */
1670 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1671 op->o_conn->c_n_ops_executing++;
1672 op->o_conn->c_n_ops_completed--;
1673 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1674 so->s_flags |= PS_IS_DETACHED;
1675 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1679 syncprov_search_response( Operation *op, SlapReply *rs )
1681 searchstate *ss = op->o_callback->sc_private;
1682 slap_overinst *on = ss->ss_on;
1683 syncprov_info_t *si = on->on_bi.bi_private;
1684 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1686 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1688 /* If we got a referral without a referral object, there's
1689 * something missing that we cannot replicate. Just ignore it.
1690 * The consumer will abort because we didn't send the expected
1693 if ( !rs->sr_entry ) {
1694 assert( rs->sr_entry );
1695 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1696 return SLAP_CB_CONTINUE;
1698 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1699 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1700 slap_schema.si_ad_entryCSN );
1702 /* Don't send the ctx entry twice */
1703 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1704 return LDAP_SUCCESS;
1706 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1708 rs->sr_ctrls[1] = NULL;
1709 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1710 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1711 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1712 struct berval cookie;
1714 slap_compose_sync_cookie( op, &cookie,
1715 &op->ors_filter->f_and->f_ava->aa_value,
1716 srs->sr_state.rid );
1718 /* Is this a regular refresh? */
1720 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1722 rs->sr_ctrls[1] = NULL;
1723 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1724 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1725 LDAP_SYNC_REFRESH_DELETES );
1728 /* It's RefreshAndPersist, transition to Persist phase */
1729 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1730 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1731 &cookie, 1, NULL, 0 );
1732 /* Flush any queued persist messages */
1733 if ( ss->ss_so->s_res ) {
1734 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1736 syncprov_qplay( op, on, ss->ss_so );
1739 /* Turn off the refreshing flag */
1740 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1742 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1744 /* Detach this Op from frontend control */
1745 syncprov_detach_op( op, ss->ss_so );
1747 return LDAP_SUCCESS;
1751 return SLAP_CB_CONTINUE;
1755 syncprov_op_search( Operation *op, SlapReply *rs )
1757 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1758 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1760 int gotstate = 0, nochange = 0, do_present = 1;
1761 Filter *fand, *fava;
1762 syncops *sop = NULL;
1765 struct berval ctxcsn;
1766 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1768 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1770 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1771 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1775 srs = op->o_controls[slap_cids.sc_LDAPsync];
1776 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1778 /* If this is a persistent search, set it up right away */
1779 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1789 so.s_flags = PS_IS_REFRESHING;
1790 /* syncprov_findbase expects to be called as a callback... */
1791 sc.sc_private = &opc;
1793 cb = op->o_callback;
1794 op->o_callback = ≻
1795 rs->sr_err = syncprov_findbase( op, &fc );
1796 op->o_callback = cb;
1798 if ( rs->sr_err != LDAP_SUCCESS ) {
1799 send_ldap_result( op, rs );
1802 sop = ch_malloc( sizeof( syncops ));
1804 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1805 sop->s_rid = srs->sr_state.rid;
1808 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1809 sop->s_next = si->si_ops;
1811 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1814 /* snapshot the ctxcsn */
1815 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1816 strcpy( csnbuf, si->si_ctxcsnbuf );
1817 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1818 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1819 ctxcsn.bv_val = csnbuf;
1821 /* If we have a cookie, handle the PRESENT lookups */
1822 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1825 /* The cookie was validated when it was parsed, just use it */
1827 /* If just Refreshing and nothing has changed, shortcut it */
1828 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1830 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1831 LDAPControl *ctrls[2];
1835 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1836 NULL, LDAP_SYNC_REFRESH_DELETES );
1837 rs->sr_ctrls = ctrls;
1838 rs->sr_err = LDAP_SUCCESS;
1839 send_ldap_result( op, rs );
1840 rs->sr_ctrls = NULL;
1845 /* Do we have a sessionlog for this search? */
1848 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1849 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1851 /* mutex is unlocked in playlog */
1852 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1854 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1857 /* Is the CSN still present in the database? */
1858 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1859 /* No, so a reload is required */
1860 #if 0 /* the consumer doesn't seem to send this hint */
1861 if ( op->o_sync_rhint == 0 ) {
1862 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1868 /* If changed and doing Present lookup, send Present UUIDs */
1869 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1871 send_ldap_result( op, rs );
1878 /* Append CSN range to search filter, save original filter
1879 * for persistent search evaluation
1882 sop->s_filterstr= op->ors_filterstr;
1885 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1886 fand->f_choice = LDAP_FILTER_AND;
1887 fand->f_next = NULL;
1888 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1889 fava->f_choice = LDAP_FILTER_LE;
1890 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1891 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1892 #ifdef LDAP_COMP_MATCH
1893 fava->f_ava->aa_cf = NULL;
1895 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1898 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1899 fava = fava->f_next;
1900 fava->f_choice = LDAP_FILTER_GE;
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, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1908 fava->f_next = op->ors_filter;
1909 op->ors_filter = fand;
1910 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1912 /* Let our callback add needed info to returned entries */
1913 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1914 ss = (searchstate *)(cb+1);
1917 ss->ss_present = do_present;
1918 cb->sc_response = syncprov_search_response;
1919 cb->sc_cleanup = syncprov_search_cleanup;
1920 cb->sc_private = ss;
1921 cb->sc_next = op->o_callback;
1922 op->o_callback = cb;
1924 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1925 op->o_sync_mode &= SLAP_CONTROL_MASK;
1928 /* If this is a persistent search and no changes were reported during
1929 * the refresh phase, just invoke the response callback to transition
1930 * us into persist phase
1933 rs->sr_err = LDAP_SUCCESS;
1934 rs->sr_nentries = 0;
1935 send_ldap_result( op, rs );
1938 return SLAP_CB_CONTINUE;
1942 syncprov_operational(
1946 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1947 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1949 if ( rs->sr_entry &&
1950 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1952 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1953 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1954 Attribute *a, **ap = NULL;
1956 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1957 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1962 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1964 a = ch_malloc( sizeof(Attribute));
1965 a->a_desc = slap_schema.si_ad_contextCSN;
1966 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1967 a->a_vals[1].bv_val = NULL;
1968 a->a_nvals = a->a_vals;
1974 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1976 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1978 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1980 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1983 return SLAP_CB_CONTINUE;
1995 slap_overinst *on = (slap_overinst *)be->bd_info;
1996 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1998 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
2000 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2001 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
2004 si->si_chkops = atoi( argv[1] );
2005 si->si_chktime = atoi( argv[2] ) * 60;
2008 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
2012 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2013 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
2016 size = atoi( argv[1] );
2019 "%s: line %d: session log size %d is negative\n",
2020 fname, lineno, size );
2025 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2026 sl->sl_mincsn.bv_val = (char *)(sl+1);
2027 sl->sl_mincsn.bv_len = 0;
2029 sl->sl_head = sl->sl_tail = NULL;
2030 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2037 return SLAP_CONF_UNKNOWN;
2040 /* Cheating - we have no thread pool context for these functions,
2043 typedef struct thread_keys {
2046 ldap_pvt_thread_pool_keyfree_t *xfree;
2050 /* A fake thread context */
2051 static thread_keys thrctx[MAXKEYS];
2053 /* Read any existing contextCSN from the underlying db.
2054 * Then search for any entries newer than that. If no value exists,
2055 * just generate it. Cache whatever result.
2062 slap_overinst *on = (slap_overinst *) be->bd_info;
2063 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2066 char opbuf[OPERATION_BUFFER_SIZE];
2067 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2068 Operation *op = (Operation *)opbuf;
2073 if ( slapMode & SLAP_TOOL_MODE ) {
2077 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2082 connection_fake_init( &conn, op, thrctx );
2084 op->o_dn = be->be_rootdn;
2085 op->o_ndn = be->be_rootndn;
2087 ctxcsnbuf[0] = '\0';
2089 op->o_bd->bd_info = on->on_info->oi_orig;
2090 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2091 slap_schema.si_ad_contextCSN, 0, &e );
2094 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2096 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2097 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2098 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2099 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2100 si->si_ctxcsn.bv_len );
2101 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2102 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2104 be_entry_release_rw( op, e, 0 );
2105 op->o_bd->bd_info = (BackendInfo *)on;
2106 op->o_req_dn = be->be_suffix[0];
2107 op->o_req_ndn = be->be_nsuffix[0];
2108 op->ors_scope = LDAP_SCOPE_SUBTREE;
2109 syncprov_findcsn( op, FIND_MAXCSN );
2110 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2111 /* If we're also a consumer, and we didn't find the context entry,
2112 * then don't generate anything, wait for our provider to send it
2118 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2119 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2120 &si->si_ctxcsn, 0 );
2123 /* If our ctxcsn is different from what was read from the root
2124 * entry, write the new value out.
2126 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2127 SlapReply rs = {REP_RESULT};
2128 syncprov_checkpoint( op, &rs, on );
2132 op->o_bd->bd_info = (BackendInfo *)on;
2136 /* Write the current contextCSN into the underlying db.
2143 slap_overinst *on = (slap_overinst *) be->bd_info;
2144 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2147 if ( slapMode & SLAP_TOOL_MODE ) {
2150 if ( si->si_numops ) {
2152 char opbuf[OPERATION_BUFFER_SIZE];
2153 Operation *op = (Operation *)opbuf;
2154 SlapReply rs = {REP_RESULT};
2156 connection_fake_init( &conn, op, thrctx );
2158 op->o_dn = be->be_rootdn;
2159 op->o_ndn = be->be_rootndn;
2160 syncprov_checkpoint( op, &rs, on );
2162 for ( i=0; thrctx[i].key; i++) {
2163 if ( thrctx[i].xfree )
2164 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2165 thrctx[i].key = NULL;
2176 slap_overinst *on = (slap_overinst *)be->bd_info;
2177 syncprov_info_t *si;
2179 si = ch_calloc(1, sizeof(syncprov_info_t));
2180 on->on_bi.bi_private = si;
2181 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2182 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2183 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2184 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2186 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2187 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2189 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2190 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2196 syncprov_db_destroy(
2200 slap_overinst *on = (slap_overinst *)be->bd_info;
2201 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2204 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2205 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2206 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2213 static int syncprov_parseCtrl (
2222 struct berval cookie = BER_BVNULL;
2226 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2227 rs->sr_text = "Sync control specified multiple times";
2228 return LDAP_PROTOCOL_ERROR;
2231 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2232 rs->sr_text = "Sync control specified with pagedResults control";
2233 return LDAP_PROTOCOL_ERROR;
2236 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2237 rs->sr_text = "Sync control value is empty (or absent)";
2238 return LDAP_PROTOCOL_ERROR;
2241 /* Parse the control value
2242 * syncRequestValue ::= SEQUENCE {
2247 * refreshAndPersist (3)
2249 * cookie syncCookie OPTIONAL
2253 ber = ber_init( &ctrl->ldctl_value );
2255 rs->sr_text = "internal error";
2259 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2260 rs->sr_text = "Sync control : mode decoding error";
2261 return LDAP_PROTOCOL_ERROR;
2265 case LDAP_SYNC_REFRESH_ONLY:
2266 mode = SLAP_SYNC_REFRESH;
2268 case LDAP_SYNC_REFRESH_AND_PERSIST:
2269 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2272 rs->sr_text = "Sync control : unknown update mode";
2273 return LDAP_PROTOCOL_ERROR;
2276 tag = ber_peek_tag( ber, &len );
2278 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2279 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2280 rs->sr_text = "Sync control : cookie decoding error";
2281 return LDAP_PROTOCOL_ERROR;
2284 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2285 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2286 rs->sr_text = "Sync control : rhint decoding error";
2287 return LDAP_PROTOCOL_ERROR;
2290 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2291 rs->sr_text = "Sync control : decoding error";
2292 return LDAP_PROTOCOL_ERROR;
2294 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2295 sr->sr_rhint = rhint;
2296 if (!BER_BVISNULL(&cookie)) {
2297 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2298 slap_parse_sync_cookie( &sr->sr_state );
2301 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2303 (void) ber_free( ber, 1 );
2305 op->o_sync = ctrl->ldctl_iscritical
2306 ? SLAP_CONTROL_CRITICAL
2307 : SLAP_CONTROL_NONCRITICAL;
2309 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2311 return LDAP_SUCCESS;
2314 /* This overlay is set up for dynamic loading via moduleload. For static
2315 * configuration, you'll need to arrange for the slap_overinst to be
2316 * initialized and registered by some other function inside slapd.
2319 static slap_overinst syncprov;
2326 rc = register_supported_control( LDAP_CONTROL_SYNC,
2327 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2328 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2329 if ( rc != LDAP_SUCCESS ) {
2330 fprintf( stderr, "Failed to register control %d\n", rc );
2334 syncprov.on_bi.bi_type = "syncprov";
2335 syncprov.on_bi.bi_db_init = syncprov_db_init;
2336 syncprov.on_bi.bi_db_config = syncprov_db_config;
2337 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2338 syncprov.on_bi.bi_db_open = syncprov_db_open;
2339 syncprov.on_bi.bi_db_close = syncprov_db_close;
2341 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2342 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2344 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2345 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2346 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2347 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2348 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2349 syncprov.on_bi.bi_op_search = syncprov_op_search;
2350 syncprov.on_bi.bi_extended = syncprov_op_extended;
2351 syncprov.on_bi.bi_operational = syncprov_operational;
2353 return overlay_register( &syncprov );
2356 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2358 init_module( int argc, char *argv[] )
2360 return syncprov_init();
2362 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2364 #endif /* defined(SLAPD_OVER_SYNCPROV) */