2 /* syncprov.c - syncrepl provider */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2004 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
17 * This work was initially developed by Howard Chu for inclusion in
23 #ifdef SLAPD_OVER_SYNCPROV
25 #include <ac/string.h>
29 /* A modify request on a particular entry */
30 typedef struct modinst {
31 struct modinst *mi_next;
35 typedef struct modtarget {
36 struct modinst *mt_mods;
37 struct modinst *mt_tail;
39 ldap_pvt_thread_mutex_t mt_mutex;
42 /* A queued result of a persistent search */
43 typedef struct syncres {
44 struct syncres *s_next;
53 /* Record of a persistent search */
54 typedef struct syncops {
55 struct syncops *s_next;
56 struct berval s_base; /* ndn of search base */
57 ID s_eid; /* entryID of search base */
58 Operation *s_op; /* search op */
61 struct berval s_filterstr;
62 int s_flags; /* search status */
63 int s_inuse; /* reference count */
64 struct syncres *s_res;
65 struct syncres *s_restail;
66 ldap_pvt_thread_mutex_t s_mutex;
69 /* A received sync control */
70 typedef struct sync_control {
71 struct sync_cookie sr_state;
75 #if 0 /* moved back to slap.h */
76 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
78 /* o_sync_mode uses data bits of o_sync */
79 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
81 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
82 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
83 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
84 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
86 #define PS_IS_REFRESHING 0x01
88 /* Record of which searches matched at premodify step */
89 typedef struct syncmatches {
90 struct syncmatches *sm_next;
94 /* The main state for this overlay */
95 typedef struct syncprov_info_t {
97 struct berval si_ctxcsn; /* ldapsync context */
98 int si_chkops; /* checkpointing info */
100 int si_numops; /* number of ops since last checkpoint */
101 time_t si_chklast; /* time of last checkpoint */
102 Avlnode *si_mods; /* entries being modified */
103 ldap_pvt_thread_mutex_t si_csn_mutex;
104 ldap_pvt_thread_mutex_t si_ops_mutex;
105 ldap_pvt_thread_mutex_t si_mods_mutex;
106 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
109 typedef struct opcookie {
111 syncmatches *smatches;
112 struct berval sdn; /* DN of entry, for deletes */
114 struct berval suuid; /* UUID of entry */
115 struct berval sctxcsn;
116 int sreference; /* Is the entry a reference? */
119 typedef struct fbase_cookie {
120 struct berval *fdn; /* DN of a modified entry, for scope testing */
121 syncops *fss; /* persistent search we're testing against */
122 int fbase; /* if TRUE we found the search base and it's still valid */
123 int fscope; /* if TRUE then fdn is within the psearch scope */
126 static AttributeName csn_anlist[2];
127 static AttributeName uuid_anlist[2];
129 /* Build a LDAPsync intermediate state control */
135 int entry_sync_state,
139 struct berval *cookie )
144 const char *text = NULL;
146 BerElementBuffer berbuf;
147 BerElement *ber = (BerElement *)&berbuf;
149 struct berval entryuuid_bv = BER_BVNULL;
151 ber_init2( ber, 0, LBER_USE_DER );
152 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
154 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
156 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
157 AttributeDescription *desc = a->a_desc;
158 if ( desc == slap_schema.si_ad_entryUUID ) {
159 entryuuid_bv = a->a_nvals[0];
164 if ( send_cookie && cookie ) {
165 ber_printf( ber, "{eOON}",
166 entry_sync_state, &entryuuid_bv, cookie );
168 ber_printf( ber, "{eON}",
169 entry_sync_state, &entryuuid_bv );
172 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
173 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
174 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
179 Debug( LDAP_DEBUG_TRACE,
180 "slap_build_sync_ctrl: ber_flatten2 failed\n",
182 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
189 /* Build a LDAPsync final state control */
197 struct berval *cookie,
201 BerElementBuffer berbuf;
202 BerElement *ber = (BerElement *)&berbuf;
204 ber_init2( ber, NULL, LBER_USE_DER );
205 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
207 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
209 ber_printf( ber, "{" );
210 if ( send_cookie && cookie ) {
211 ber_printf( ber, "O", cookie );
213 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
214 ber_printf( ber, "b", refreshDeletes );
216 ber_printf( ber, "N}" );
218 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
219 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
220 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
225 Debug( LDAP_DEBUG_TRACE,
226 "syncprov_done_ctrl: ber_flatten2 failed\n",
228 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
236 /* Generate state based on session log - not implemented yet */
238 syncprov_state_ctrl_from_slog(
241 struct slog_entry *slog_e,
242 int entry_sync_state,
246 struct berval *cookie)
251 const char *text = NULL;
253 BerElementBuffer berbuf;
254 BerElement *ber = (BerElement *)&berbuf;
256 struct berval entryuuid_bv = BER_BVNULL;
258 ber_init2( ber, NULL, LBER_USE_DER );
259 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
261 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
263 entryuuid_bv = slog_e->sl_uuid;
265 if ( send_cookie && cookie ) {
266 ber_printf( ber, "{eOON}",
267 entry_sync_state, &entryuuid_bv, cookie );
269 ber_printf( ber, "{eON}",
270 entry_sync_state, &entryuuid_bv );
273 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
274 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
275 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
280 Debug( LDAP_DEBUG_TRACE,
281 "slap_build_sync_ctrl: ber_flatten2 failed\n",
283 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
296 struct berval *cookie,
301 BerElementBuffer berbuf;
302 BerElement *ber = (BerElement *)&berbuf;
303 struct berval rspdata;
307 ber_init2( ber, NULL, LBER_USE_DER );
308 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
312 case LDAP_TAG_SYNC_NEW_COOKIE:
313 ber_printf( ber, "tO", type, cookie );
315 case LDAP_TAG_SYNC_REFRESH_DELETE:
316 case LDAP_TAG_SYNC_REFRESH_PRESENT:
317 ber_printf( ber, "t{", type );
319 ber_printf( ber, "O", cookie );
321 if ( refreshDone == 0 ) {
322 ber_printf( ber, "b", refreshDone );
324 ber_printf( ber, "N}" );
326 case LDAP_TAG_SYNC_ID_SET:
327 ber_printf( ber, "t{", type );
329 ber_printf( ber, "O", cookie );
331 if ( refreshDeletes == 1 ) {
332 ber_printf( ber, "b", refreshDeletes );
334 ber_printf( ber, "[W]", syncUUIDs );
335 ber_printf( ber, "N}" );
338 Debug( LDAP_DEBUG_TRACE,
339 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
345 ret = ber_flatten2( ber, &rspdata, 0 );
348 Debug( LDAP_DEBUG_TRACE,
349 "syncprov_sendinfo: ber_flatten2 failed\n",
351 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
355 rs->sr_rspoid = LDAP_SYNC_INFO;
356 rs->sr_rspdata = &rspdata;
357 send_ldap_intermediate( op, rs );
358 rs->sr_rspdata = NULL;
364 /* Find a modtarget in an AVL tree */
366 sp_avl_cmp( const void *c1, const void *c2 )
368 const modtarget *m1, *m2;
372 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
375 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
378 /* syncprov_findbase:
379 * finds the true DN of the base of a search (with alias dereferencing) and
380 * checks to make sure the base entry doesn't get replaced with a different
381 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
382 * change is detected, any persistent search on this base must be terminated /
384 * On the first call, we just save the DN and entryID. On subsequent calls
385 * we compare the DN and entryID with the saved values.
388 findbase_cb( Operation *op, SlapReply *rs )
390 slap_callback *sc = op->o_callback;
392 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
393 fbase_cookie *fc = sc->sc_private;
395 /* If no entryID, we're looking for the first time.
396 * Just store whatever we got.
398 if ( fc->fss->s_eid == NOID ) {
400 fc->fss->s_eid = rs->sr_entry->e_id;
401 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
403 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
404 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
406 /* OK, the DN is the same and the entryID is the same. Now
407 * see if the fdn resides in the scope.
410 switch ( fc->fss->s_op->ors_scope ) {
411 case LDAP_SCOPE_BASE:
412 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
414 case LDAP_SCOPE_ONELEVEL: {
416 dnParent( fc->fdn, &pdn );
417 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
419 case LDAP_SCOPE_SUBTREE:
420 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
422 #ifdef LDAP_SCOPE_SUBORDINATE
423 case LDAP_SCOPE_SUBORDINATE:
424 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
425 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
431 if ( rs->sr_err != LDAP_SUCCESS ) {
432 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
438 syncprov_findbase( Operation *op, fbase_cookie *fc )
440 opcookie *opc = op->o_callback->sc_private;
441 slap_overinst *on = opc->son;
442 syncprov_info_t *si = on->on_bi.bi_private;
444 slap_callback cb = {0};
446 SlapReply frs = { REP_RESULT };
451 cb.sc_response = findbase_cb;
454 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
455 fop.o_callback = &cb;
456 fop.o_tag = LDAP_REQ_SEARCH;
457 fop.ors_scope = LDAP_SCOPE_BASE;
458 fop.ors_deref = fc->fss->s_op->ors_deref;
459 fop.ors_limit = NULL;
461 fop.ors_tlimit = SLAP_NO_LIMIT;
462 fop.ors_attrs = slap_anlist_no_attrs;
463 fop.ors_attrsonly = 1;
464 fop.ors_filter = fc->fss->s_op->ors_filter;
465 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
467 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
469 fop.o_bd->bd_info = on->on_info->oi_orig;
470 rc = fop.o_bd->be_search( &fop, &frs );
471 fop.o_bd->bd_info = (BackendInfo *)on;
473 if ( fc->fbase ) return LDAP_SUCCESS;
475 /* If entryID has changed, then the base of this search has
476 * changed. Invalidate the psearch.
478 return LDAP_NO_SUCH_OBJECT;
482 * This function has three different purposes, but they all use a search
483 * that filters on entryCSN so they're combined here.
484 * 1: at startup time, after a contextCSN has been read from the database,
485 * we search for all entries with CSN >= contextCSN in case the contextCSN
486 * was not checkpointed at the previous shutdown.
488 * 2: when the current contextCSN is known and we have a sync cookie, we search
489 * for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
490 * entry is found, the cookie CSN is valid, otherwise it is stale.
492 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
493 * CSN, and generate Present records for them. We always collect this result
494 * in SyncID sets, even if there's only one match.
496 #define FIND_MAXCSN 1
498 #define FIND_PRESENT 3
501 findmax_cb( Operation *op, SlapReply *rs )
503 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
504 struct berval *maxcsn = op->o_callback->sc_private;
505 Attribute *a = attr_find( rs->sr_entry->e_attrs,
506 slap_schema.si_ad_entryCSN );
508 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn )) {
509 maxcsn->bv_len = a->a_vals[0].bv_len;
510 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
517 findcsn_cb( Operation *op, SlapReply *rs )
519 slap_callback *sc = op->o_callback;
521 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
522 sc->sc_private = (void *)1;
527 /* Build a list of entryUUIDs for sending in a SyncID set */
529 typedef struct fpres_cookie {
535 findpres_cb( Operation *op, SlapReply *rs )
537 slap_callback *sc = op->o_callback;
538 fpres_cookie *pc = sc->sc_private;
539 int ret = SLAP_CB_CONTINUE;
541 if ( rs->sr_type == REP_SEARCH ) {
542 ret = slap_build_syncUUID_set( op, &pc->uuids, rs->sr_entry );
546 if ( pc->num == SLAP_SYNCUUID_SET_SIZE ) {
547 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
549 ber_bvarray_free_x( pc->uuids, op->o_tmpmemctx );
556 } else if ( rs->sr_type == REP_RESULT ) {
559 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
561 ber_bvarray_free_x( pc->uuids, op->o_tmpmemctx );
571 syncprov_findcsn( Operation *op, int mode )
573 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
574 syncprov_info_t *si = on->on_bi.bi_private;
576 slap_callback cb = {0};
578 SlapReply frs = { REP_RESULT };
579 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
580 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
581 struct berval fbuf, maxcsn;
583 AttributeAssertion eq;
584 int rc = LDAP_SUCCESS;
585 fpres_cookie pcookie;
589 if ( mode != FIND_MAXCSN ) {
590 srs = op->o_controls[slap_cids.sc_LDAPsync];
592 if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
598 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
602 cf.f_av_desc = slap_schema.si_ad_entryCSN;
607 cf.f_choice = LDAP_FILTER_GE;
608 cf.f_av_value = si->si_ctxcsn;
609 fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)",
610 cf.f_av_value.bv_val );
611 fop.ors_attrsonly = 0;
612 fop.ors_attrs = csn_anlist;
613 fop.ors_slimit = SLAP_NO_LIMIT;
614 cb.sc_private = &maxcsn;
615 cb.sc_response = findmax_cb;
616 maxcsn.bv_val = cbuf;
620 cf.f_choice = LDAP_FILTER_LE;
621 cf.f_av_value = *srs->sr_state.ctxcsn;
622 fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
623 cf.f_av_value.bv_val );
624 fop.ors_attrsonly = 1;
625 fop.ors_attrs = slap_anlist_no_attrs;
627 cb.sc_private = NULL;
628 cb.sc_response = findcsn_cb;
631 cf.f_choice = LDAP_FILTER_LE;
632 cf.f_av_value = *srs->sr_state.ctxcsn;
633 fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
634 cf.f_av_value.bv_val );
635 fop.ors_attrsonly = 0;
636 fop.ors_attrs = uuid_anlist;
637 fop.ors_slimit = SLAP_NO_LIMIT;
638 /* We want pure entries, not referrals */
639 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
640 cb.sc_private = &pcookie;
641 cb.sc_response = findpres_cb;
643 pcookie.uuids = NULL;
646 fop.o_callback = &cb;
647 fop.ors_limit = NULL;
648 fop.ors_tlimit = SLAP_NO_LIMIT;
649 fop.ors_filter = &cf;
650 fop.ors_filterstr = fbuf;
652 fop.o_bd->bd_info = on->on_info->oi_orig;
653 fop.o_bd->be_search( &fop, &frs );
654 fop.o_bd->bd_info = (BackendInfo *)on;
658 if ( maxcsn.bv_len ) {
659 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
660 si->si_ctxcsn.bv_len = maxcsn.bv_len;
664 /* If matching CSN was not found, invalidate the context. */
665 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
674 /* Queue a persistent search response if still in Refresh stage */
676 syncprov_qresp( opcookie *opc, syncops *so, int mode )
680 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
681 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
683 sr->s_dn.bv_val = (char *)(sr + 1);
685 sr->s_isreference = opc->sreference;
686 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
687 *(sr->s_ndn.bv_val++) = '\0';
688 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
689 *(sr->s_uuid.bv_val++) = '\0';
690 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
695 so->s_restail->s_next = sr;
698 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
702 /* Send a persistent search response */
704 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry *e, int mode, int queue )
706 slap_overinst *on = opc->son;
707 syncprov_info_t *si = on->on_bi.bi_private;
709 SlapReply rs = { REP_SEARCH };
710 LDAPControl *ctrls[2];
711 struct berval cookie;
713 Attribute a_uuid = {0};
714 Operation sop = *so->s_op;
719 sop.o_tmpmemctx = op->o_tmpmemctx;
721 sop.o_controls = op->o_controls;
723 if ( queue && (so->s_flags & PS_IS_REFRESHING) ) {
724 ldap_pvt_thread_mutex_lock( &so->s_mutex );
725 if ( so->s_flags & PS_IS_REFRESHING )
726 return syncprov_qresp( opc, so, mode );
727 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
731 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn,
732 so->s_sid, so->s_rid );
734 e_uuid.e_attrs = &a_uuid;
735 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
736 a_uuid.a_nvals = &opc->suuid;
737 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
738 mode, ctrls, 0, 1, &cookie );
744 if ( opc->sreference ) {
745 rs.sr_ref = get_entry_referrals( &sop, e );
746 send_search_reference( &sop, &rs );
747 ber_bvarray_free( rs.sr_ref );
751 case LDAP_SYNC_MODIFY:
752 rs.sr_attrs = sop.ors_attrs;
753 send_search_entry( &sop, &rs );
755 case LDAP_SYNC_DELETE:
756 e_uuid.e_attrs = NULL;
757 e_uuid.e_name = opc->sdn;
758 e_uuid.e_nname = opc->sndn;
759 rs.sr_entry = &e_uuid;
760 if ( opc->sreference ) {
761 struct berval bv = BER_BVNULL;
763 send_search_reference( &sop, &rs );
765 send_search_entry( &sop, &rs );
771 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
777 syncprov_free_syncop( syncops *so )
779 syncres *sr, *srnext;
781 ldap_pvt_thread_mutex_lock( &so->s_mutex );
783 if ( so->s_inuse > 0 ) {
784 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
787 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
788 filter_free( so->s_op->ors_filter );
790 ch_free( so->s_base.bv_val );
791 for ( sr=so->s_res; sr; sr=srnext ) {
795 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
800 syncprov_drop_psearch( syncops *so )
802 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
803 so->s_op->o_conn->c_n_ops_executing--;
804 so->s_op->o_conn->c_n_ops_completed++;
805 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
806 syncprov_free_syncop( so );
810 syncprov_op_abandon( Operation *op, SlapReply *rs )
812 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
813 syncprov_info_t *si = on->on_bi.bi_private;
814 syncops *so, *soprev;
816 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
817 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
818 soprev=so, so=so->s_next ) {
819 if ( so->s_op->o_connid == op->o_connid &&
820 so->s_op->o_msgid == op->orn_msgid ) {
821 so->s_op->o_abandon = 1;
822 soprev->s_next = so->s_next;
826 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
828 /* Is this really a Cancel exop? */
829 if ( op->o_tag != LDAP_REQ_ABANDON ) {
830 rs->sr_err = LDAP_CANCELLED;
831 send_ldap_result( so->s_op, rs );
833 syncprov_drop_psearch( so );
835 return SLAP_CB_CONTINUE;
838 /* Find which persistent searches are affected by this operation */
840 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
842 slap_overinst *on = opc->son;
843 syncprov_info_t *si = on->on_bi.bi_private;
846 syncops *ss, *sprev, *snext;
853 fc.fdn = &op->o_req_ndn;
855 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
857 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
858 else dnParent( fc.fdn, &pdn );
859 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
863 if ( op->o_tag != LDAP_REQ_ADD ) {
864 op->o_bd->bd_info = (BackendInfo *)on->on_info;
865 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
866 op->o_bd->bd_info = (BackendInfo *)on;
872 /* Never replicate these */
873 if ( is_entry_syncConsumerSubentry( e )) {
877 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
878 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
879 opc->sreference = is_entry_referral( e );
881 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
882 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
884 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
887 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
888 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
889 sprev = ss, ss=snext)
900 /* If the base of the search is missing, signal a refresh */
901 rc = syncprov_findbase( op, &fc );
902 if ( rc != LDAP_SUCCESS ) {
903 SlapReply rs = {REP_RESULT};
904 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
905 "search base has changed" );
906 sprev->s_next = snext;
907 syncprov_drop_psearch( ss );
911 /* If we're sending results now, look for this op in old matches */
914 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
915 old=sm, sm=sm->sm_next ) {
916 if ( sm->sm_op == ss ) {
918 old->sm_next = sm->sm_next;
919 op->o_tmpfree( sm, op->o_tmpmemctx );
925 /* check if current o_req_dn is in scope and matches filter */
926 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
927 LDAP_COMPARE_TRUE ) {
929 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
930 sm->sm_next = opc->smatches;
935 /* if found send UPDATE else send ADD */
936 syncprov_sendresp( op, opc, ss, e,
937 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
939 } else if ( !saveit && found ) {
941 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
944 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
946 if ( op->o_tag != LDAP_REQ_ADD ) {
947 op->o_bd->bd_info = (BackendInfo *)on->on_info;
948 be_entry_release_r( op, e );
949 op->o_bd->bd_info = (BackendInfo *)on;
952 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
957 syncprov_op_cleanup( Operation *op, SlapReply *rs )
959 slap_callback *cb = op->o_callback;
960 opcookie *opc = cb->sc_private;
961 slap_overinst *on = opc->son;
962 syncprov_info_t *si = on->on_bi.bi_private;
963 syncmatches *sm, *snext;
964 modtarget *mt, mtdummy;
966 for (sm = opc->smatches; sm; sm=snext) {
968 syncprov_free_syncop( sm->sm_op );
969 op->o_tmpfree( sm, op->o_tmpmemctx );
972 /* Remove op from lock table */
974 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
975 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
976 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
978 modinst *mi = mt->mt_mods;
980 /* If there are more, promote the next one */
981 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
983 mt->mt_mods = mi->mi_next;
984 mt->mt_op = mt->mt_mods->mi_op;
985 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
987 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
988 avl_delete( &si->si_mods, mt, sp_avl_cmp );
989 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
990 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
991 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
995 if ( !BER_BVISNULL( &opc->suuid ))
996 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
997 if ( !BER_BVISNULL( &opc->sndn ))
998 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
999 if ( !BER_BVISNULL( &opc->sdn ))
1000 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1001 op->o_callback = cb->sc_next;
1002 op->o_tmpfree(cb, op->o_tmpmemctx);
1006 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1008 syncprov_info_t *si = on->on_bi.bi_private;
1011 struct berval bv[2];
1013 slap_callback cb = {0};
1015 mod.sml_values = bv;
1016 bv[1].bv_val = NULL;
1017 bv[0] = si->si_ctxcsn;
1018 mod.sml_nvalues = NULL;
1019 mod.sml_desc = slap_schema.si_ad_contextCSN;
1020 mod.sml_op = LDAP_MOD_REPLACE;
1021 mod.sml_next = NULL;
1023 cb.sc_response = slap_null_cb;
1025 opm.o_tag = LDAP_REQ_MODIFY;
1026 opm.o_callback = &cb;
1027 opm.orm_modlist = &mod;
1028 opm.o_req_dn = op->o_bd->be_suffix[0];
1029 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1030 orig = opm.o_bd->bd_info;
1031 opm.o_bd->bd_info = on->on_info->oi_orig;
1032 opm.o_bd->be_modify( &opm, rs );
1036 syncprov_op_response( Operation *op, SlapReply *rs )
1038 opcookie *opc = op->o_callback->sc_private;
1039 slap_overinst *on = opc->son;
1040 syncprov_info_t *si = on->on_bi.bi_private;
1043 if ( rs->sr_err == LDAP_SUCCESS )
1045 struct berval maxcsn;
1046 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1048 /* Update our context CSN */
1050 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1051 slap_get_commit_csn( op, &maxcsn );
1052 if ( !BER_BVISNULL( &maxcsn ) ) {
1053 strcpy( cbuf, maxcsn.bv_val );
1054 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1055 strcpy( si->si_ctxcsnbuf, cbuf );
1056 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1061 if ( si->si_chkops || si->si_chktime ) {
1063 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1067 if ( si->si_chktime &&
1068 (op->o_time - si->si_chklast >= si->si_chktime )) {
1070 si->si_chklast = op->o_time;
1073 syncprov_checkpoint( op, rs, on );
1076 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1078 opc->sctxcsn.bv_len = maxcsn.bv_len;
1079 opc->sctxcsn.bv_val = cbuf;
1081 /* Handle any persistent searches */
1085 case LDAP_REQ_MODIFY:
1086 case LDAP_REQ_MODRDN:
1087 case LDAP_REQ_EXTENDED:
1088 syncprov_matchops( op, opc, 0 );
1090 case LDAP_REQ_DELETE:
1091 /* for each match in opc->smatches:
1094 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1095 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1096 if ( sm->sm_op->s_op->o_abandon )
1098 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1099 LDAP_SYNC_DELETE, 1 );
1101 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1107 return SLAP_CB_CONTINUE;
1110 /* We don't use a subentry to store the context CSN any more.
1111 * We expose the current context CSN as an operational attribute
1112 * of the suffix entry.
1115 syncprov_op_compare( Operation *op, SlapReply *rs )
1117 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1118 syncprov_info_t *si = on->on_bi.bi_private;
1119 int rc = SLAP_CB_CONTINUE;
1121 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1122 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1126 struct berval bv[2];
1128 e.e_name = op->o_bd->be_suffix[0];
1129 e.e_nname = op->o_bd->be_nsuffix[0];
1131 BER_BVZERO( &bv[1] );
1132 bv[0] = si->si_ctxcsn;
1134 a.a_desc = slap_schema.si_ad_contextCSN;
1136 a.a_nvals = a.a_vals;
1138 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1140 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1141 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1142 if ( ! rs->sr_err ) {
1143 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1144 goto return_results;
1147 if ( get_assert( op ) &&
1148 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1150 rs->sr_err = LDAP_ASSERTION_FAILED;
1151 goto return_results;
1155 rs->sr_err = LDAP_COMPARE_FALSE;
1157 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1158 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1159 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1160 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1162 rs->sr_err = LDAP_COMPARE_TRUE;
1167 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1169 send_ldap_result( op, rs );
1171 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1172 rs->sr_err = LDAP_SUCCESS;
1181 syncprov_op_mod( Operation *op, SlapReply *rs )
1183 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1184 syncprov_info_t *si = on->on_bi.bi_private;
1186 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1188 (si->si_ops ? sizeof(modinst) : 0 ),
1190 opcookie *opc = (opcookie *)(cb+1);
1192 cb->sc_response = syncprov_op_response;
1193 cb->sc_cleanup = syncprov_op_cleanup;
1194 cb->sc_private = opc;
1195 cb->sc_next = op->o_callback;
1196 op->o_callback = cb;
1198 /* If there are active persistent searches, lock this operation.
1199 * See seqmod.c for the locking logic on its own.
1202 modtarget *mt, mtdummy;
1205 mi = (modinst *)(opc+1);
1208 /* See if we're already modifying this entry... */
1210 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1211 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1213 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1214 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1215 mt->mt_tail->mi_next = mi;
1217 /* wait for this op to get to head of list */
1218 while ( mt->mt_mods != mi ) {
1219 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1220 ldap_pvt_thread_yield();
1221 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1223 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1225 /* Record that we're modifying this entry now */
1226 mt = ch_malloc( sizeof(modtarget) );
1229 mt->mt_op = mi->mi_op;
1230 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1231 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1232 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1235 if ( op->o_tag != LDAP_REQ_ADD )
1236 syncprov_matchops( op, opc, 1 );
1239 return SLAP_CB_CONTINUE;
1243 syncprov_op_extended( Operation *op, SlapReply *rs )
1245 if ( exop_is_write( op ))
1246 return syncprov_op_mod( op, rs );
1248 return SLAP_CB_CONTINUE;
1251 typedef struct searchstate {
1252 slap_overinst *ss_on;
1257 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1259 if ( rs->sr_ctrls ) {
1260 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1261 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1262 rs->sr_ctrls = NULL;
1268 syncprov_detach_op( Operation *op, syncops *so )
1275 /* count the search attrs */
1276 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1277 alen += op->ors_attrs[i].an_name.bv_len + 1;
1279 /* Make a new copy of the operation */
1280 size = sizeof(Operation) + sizeof(Opheader) +
1281 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1282 op->o_req_dn.bv_len + 1 +
1283 op->o_req_ndn.bv_len + 1 +
1284 op->o_ndn.bv_len + 1 +
1285 so->s_filterstr.bv_len + 1;
1286 op2 = (Operation *)ch_malloc( size );
1288 op2->o_hdr = (Opheader *)(op2+1);
1289 *op2->o_hdr = *op->o_hdr;
1291 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1292 ptr = (char *)(op2->ors_attrs+i+1);
1293 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1294 op2->ors_attrs[i] = op->ors_attrs[i];
1295 op2->ors_attrs[i].an_name.bv_val = ptr;
1296 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1298 BER_BVZERO( &op2->ors_attrs[i].an_name );
1300 ptr = (char *)(op2->o_hdr + 1);
1302 op2->o_ndn.bv_val = ptr;
1303 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1304 op2->o_dn = op2->o_ndn;
1305 op2->o_req_dn.bv_val = ptr;
1306 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1307 op2->o_req_ndn.bv_val = ptr;
1308 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1309 op2->ors_filterstr.bv_val = ptr;
1310 strcpy( ptr, so->s_filterstr.bv_val );
1311 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1312 op2->ors_filter = str2filter( ptr );
1313 op2->o_controls = NULL;
1314 op2->o_callback = NULL;
1317 /* Increment number of ops so that idletimeout ignores us */
1318 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1319 op->o_conn->c_n_ops_executing++;
1320 op->o_conn->c_n_ops_completed--;
1321 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1325 syncprov_search_response( Operation *op, SlapReply *rs )
1327 searchstate *ss = op->o_callback->sc_private;
1328 slap_overinst *on = ss->ss_on;
1329 syncprov_info_t *si = on->on_bi.bi_private;
1330 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1332 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1334 /* If we got a referral without a referral object, there's
1335 * something missing that we cannot replicate. Just ignore it.
1336 * The consumer will abort because we didn't send the expected
1339 if ( !rs->sr_entry ) {
1340 assert( rs->sr_entry );
1341 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1342 return SLAP_CB_CONTINUE;
1344 if ( srs->sr_state.ctxcsn ) {
1345 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1346 slap_schema.si_ad_entryCSN );
1347 /* Don't send the ctx entry twice */
1348 if ( bvmatch( &a->a_nvals[0], srs->sr_state.ctxcsn ))
1349 return LDAP_SUCCESS;
1351 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1353 rs->sr_ctrls[1] = NULL;
1354 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1355 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1356 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1357 struct berval cookie;
1359 slap_compose_sync_cookie( op, &cookie,
1360 &op->ors_filter->f_and->f_ava->aa_value,
1361 srs->sr_state.sid, srs->sr_state.rid );
1363 /* Is this a regular refresh? */
1365 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1367 rs->sr_ctrls[1] = NULL;
1368 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1369 0, 1, &cookie, LDAP_SYNC_REFRESH_PRESENTS );
1372 /* It's RefreshAndPersist, transition to Persist phase */
1373 syncprov_sendinfo( op, rs, rs->sr_nentries ?
1374 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1375 &cookie, 1, NULL, 0 );
1376 /* Flush any queued persist messages */
1377 if ( ss->ss_so->s_res ) {
1378 syncres *sr, *srnext;
1383 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1385 for (sr = ss->ss_so->s_res; sr; sr=srnext) {
1386 int rc = LDAP_SUCCESS;
1387 srnext = sr->s_next;
1389 opc.sndn = sr->s_ndn;
1390 opc.suuid = sr->s_uuid;
1391 opc.sctxcsn = sr->s_csn;
1392 opc.sreference = sr->s_isreference;
1395 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
1396 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1397 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
1398 op->o_bd->bd_info = (BackendInfo *)on;
1400 if ( rc == LDAP_SUCCESS )
1401 syncprov_sendresp( op, &opc, ss->ss_so, e,
1405 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1406 be_entry_release_r( op, e );
1407 op->o_bd->bd_info = (BackendInfo *)on;
1411 ss->ss_so->s_res = NULL;
1412 ss->ss_so->s_restail = NULL;
1415 /* Turn off the refreshing flag */
1416 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1418 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1420 /* Detach this Op from frontend control */
1421 syncprov_detach_op( op, ss->ss_so );
1423 return LDAP_SUCCESS;
1427 return SLAP_CB_CONTINUE;
1431 syncprov_op_search( Operation *op, SlapReply *rs )
1433 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1434 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1436 int gotstate = 0, nochange = 0;
1437 Filter *fand, *fava;
1438 syncops *sop = NULL;
1442 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1444 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1445 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1449 srs = op->o_controls[slap_cids.sc_LDAPsync];
1451 /* If this is a persistent search, set it up right away */
1452 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1462 so.s_flags = PS_IS_REFRESHING;
1463 /* syncprov_findbase expects to be called as a callback... */
1464 sc.sc_private = &opc;
1466 cb = op->o_callback;
1467 op->o_callback = ≻
1468 rs->sr_err = syncprov_findbase( op, &fc );
1469 op->o_callback = cb;
1471 if ( rs->sr_err != LDAP_SUCCESS ) {
1472 send_ldap_result( op, rs );
1475 sop = ch_malloc( sizeof( syncops ));
1477 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1478 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1479 sop->s_sid = srs->sr_state.sid;
1480 sop->s_rid = srs->sr_state.rid;
1481 sop->s_next = si->si_ops;
1484 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1487 /* If we have a cookie, handle the PRESENT lookups
1489 if ( srs->sr_state.ctxcsn ) {
1490 /* Is the CSN in a valid format? */
1491 if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
1492 send_ldap_error( op, rs, LDAP_OTHER, "invalid sync cookie" );
1495 /* Is the CSN still present in the database? */
1496 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1497 /* No, so a reload is required */
1498 #if 0 /* the consumer doesn't seem to send this hint */
1499 if ( op->o_sync_rhint == 0 ) {
1500 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1506 /* If just Refreshing and nothing has changed, shortcut it */
1507 if ( bvmatch( srs->sr_state.ctxcsn, &si->si_ctxcsn )) {
1509 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1510 LDAPControl *ctrls[2];
1514 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1515 NULL, LDAP_SYNC_REFRESH_DELETES );
1516 rs->sr_ctrls = ctrls;
1517 rs->sr_err = LDAP_SUCCESS;
1518 send_ldap_result( op, rs );
1519 rs->sr_ctrls = NULL;
1524 /* If context has changed, check for Present UUIDs */
1525 if ( syncprov_findcsn( op, FIND_PRESENT ) != LDAP_SUCCESS ) {
1526 send_ldap_result( op, rs );
1532 /* Append CSN range to search filter, save original filter
1533 * for persistent search evaluation
1536 sop->s_filterstr= op->ors_filterstr;
1539 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1540 fand->f_choice = LDAP_FILTER_AND;
1541 fand->f_next = NULL;
1542 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1543 fava->f_choice = LDAP_FILTER_LE;
1544 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1545 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1546 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1547 ber_dupbv_x( &fava->f_ava->aa_value, &si->si_ctxcsn, op->o_tmpmemctx );
1548 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1551 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1552 fava = fava->f_next;
1553 fava->f_choice = LDAP_FILTER_GE;
1554 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1555 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1556 ber_dupbv_x( &fava->f_ava->aa_value, srs->sr_state.ctxcsn, op->o_tmpmemctx );
1558 fava->f_next = op->ors_filter;
1559 op->ors_filter = fand;
1560 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1563 /* Let our callback add needed info to returned entries */
1564 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1565 ss = (searchstate *)(cb+1);
1568 cb->sc_response = syncprov_search_response;
1569 cb->sc_cleanup = syncprov_search_cleanup;
1570 cb->sc_private = ss;
1571 cb->sc_next = op->o_callback;
1572 op->o_callback = cb;
1574 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1575 op->o_sync_mode &= SLAP_CONTROL_MASK;
1578 /* If this is a persistent search and no changes were reported during
1579 * the refresh phase, just invoke the response callback to transition
1580 * us into persist phase
1583 rs->sr_err = LDAP_SUCCESS;
1584 rs->sr_nentries = 0;
1585 send_ldap_result( op, rs );
1588 return SLAP_CB_CONTINUE;
1592 syncprov_operational(
1596 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1597 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1599 if ( rs->sr_entry &&
1600 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1602 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1603 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1604 Attribute *a, **ap = NULL;
1606 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1607 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1612 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1614 a = ch_malloc( sizeof(Attribute));
1615 a->a_desc = slap_schema.si_ad_contextCSN;
1616 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1617 a->a_vals[1].bv_val = NULL;
1618 a->a_nvals = a->a_vals;
1624 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1626 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1628 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1630 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1633 return SLAP_CB_CONTINUE;
1645 slap_overinst *on = (slap_overinst *)be->bd_info;
1646 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1648 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1650 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1651 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1654 si->si_chkops = atoi( argv[1] );
1655 si->si_chktime = atoi( argv[2] ) * 60;
1660 return SLAP_CONF_UNKNOWN;
1663 /* Cheating - we have no thread pool context for these functions,
1666 typedef struct thread_keys {
1669 ldap_pvt_thread_pool_keyfree_t *xfree;
1673 /* A fake thread context */
1674 static thread_keys thrctx[MAXKEYS];
1676 /* Read any existing contextCSN from the underlying db.
1677 * Then search for any entries newer than that. If no value exists,
1678 * just generate it. Cache whatever result.
1685 slap_overinst *on = (slap_overinst *) be->bd_info;
1686 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1689 char opbuf[OPERATION_BUFFER_SIZE];
1690 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1691 Operation *op = (Operation *)opbuf;
1696 connection_fake_init( &conn, op, thrctx );
1698 op->o_dn = be->be_rootdn;
1699 op->o_ndn = be->be_rootndn;
1701 ctxcsnbuf[0] = '\0';
1703 op->o_bd->bd_info = on->on_info->oi_orig;
1704 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
1705 slap_schema.si_ad_contextCSN, 0, &e );
1708 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
1710 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
1711 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
1712 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
1713 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
1714 si->si_ctxcsn.bv_len );
1715 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
1716 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
1718 be_entry_release_r( op, e );
1719 op->o_bd->bd_info = (BackendInfo *)on;
1720 op->o_req_dn = be->be_suffix[0];
1721 op->o_req_ndn = be->be_nsuffix[0];
1722 op->ors_scope = LDAP_SCOPE_SUBTREE;
1723 syncprov_findcsn( op, FIND_MAXCSN );
1726 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
1727 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
1728 &si->si_ctxcsn, 0 );
1731 /* If our ctxcsn is different from what was read from the root
1732 * entry, write the new value out.
1734 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
1735 SlapReply rs = {REP_RESULT};
1736 syncprov_checkpoint( op, &rs, on );
1739 op->o_bd->bd_info = (BackendInfo *)on;
1743 /* Write the current contextCSN into the underlying db.
1750 slap_overinst *on = (slap_overinst *) be->bd_info;
1751 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1754 if ( si->si_numops ) {
1756 char opbuf[OPERATION_BUFFER_SIZE];
1757 Operation *op = (Operation *)opbuf;
1758 SlapReply rs = {REP_RESULT};
1760 connection_fake_init( &conn, op, thrctx );
1762 op->o_dn = be->be_rootdn;
1763 op->o_ndn = be->be_rootndn;
1764 syncprov_checkpoint( op, &rs, on );
1766 for ( i=0; thrctx[i].key; i++) {
1767 if ( thrctx[i].xfree )
1768 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
1769 thrctx[i].key = NULL;
1780 slap_overinst *on = (slap_overinst *)be->bd_info;
1781 syncprov_info_t *si;
1783 si = ch_calloc(1, sizeof(syncprov_info_t));
1784 on->on_bi.bi_private = si;
1785 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
1786 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
1787 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
1788 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
1790 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
1791 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
1793 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
1794 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
1800 syncprov_db_destroy(
1804 slap_overinst *on = (slap_overinst *)be->bd_info;
1805 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1808 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
1809 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
1810 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
1817 static int syncprov_parseCtrl (
1826 struct berval cookie = BER_BVNULL;
1830 if ( op->o_sync != SLAP_CONTROL_NONE ) {
1831 rs->sr_text = "Sync control specified multiple times";
1832 return LDAP_PROTOCOL_ERROR;
1835 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
1836 rs->sr_text = "Sync control specified with pagedResults control";
1837 return LDAP_PROTOCOL_ERROR;
1840 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
1841 rs->sr_text = "Sync control value is empty (or absent)";
1842 return LDAP_PROTOCOL_ERROR;
1845 /* Parse the control value
1846 * syncRequestValue ::= SEQUENCE {
1851 * refreshAndPersist (3)
1853 * cookie syncCookie OPTIONAL
1857 ber = ber_init( &ctrl->ldctl_value );
1859 rs->sr_text = "internal error";
1863 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
1864 rs->sr_text = "Sync control : mode decoding error";
1865 return LDAP_PROTOCOL_ERROR;
1869 case LDAP_SYNC_REFRESH_ONLY:
1870 mode = SLAP_SYNC_REFRESH;
1872 case LDAP_SYNC_REFRESH_AND_PERSIST:
1873 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
1876 rs->sr_text = "Sync control : unknown update mode";
1877 return LDAP_PROTOCOL_ERROR;
1880 tag = ber_peek_tag( ber, &len );
1882 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
1883 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
1884 rs->sr_text = "Sync control : cookie decoding error";
1885 return LDAP_PROTOCOL_ERROR;
1888 if ( tag == LDAP_TAG_RELOAD_HINT ) {
1889 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
1890 rs->sr_text = "Sync control : rhint decoding error";
1891 return LDAP_PROTOCOL_ERROR;
1894 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
1895 rs->sr_text = "Sync control : decoding error";
1896 return LDAP_PROTOCOL_ERROR;
1898 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
1899 sr->sr_rhint = rhint;
1900 if (!BER_BVISNULL(&cookie)) {
1901 ber_bvarray_add( &sr->sr_state.octet_str, &cookie );
1902 slap_parse_sync_cookie( &sr->sr_state );
1905 op->o_controls[slap_cids.sc_LDAPsync] = sr;
1907 (void) ber_free( ber, 1 );
1909 op->o_sync = ctrl->ldctl_iscritical
1910 ? SLAP_CONTROL_CRITICAL
1911 : SLAP_CONTROL_NONCRITICAL;
1913 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
1915 return LDAP_SUCCESS;
1918 /* This overlay is set up for dynamic loading via moduleload. For static
1919 * configuration, you'll need to arrange for the slap_overinst to be
1920 * initialized and registered by some other function inside slapd.
1923 static slap_overinst syncprov;
1930 rc = register_supported_control( LDAP_CONTROL_SYNC,
1931 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
1932 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
1933 if ( rc != LDAP_SUCCESS ) {
1934 fprintf( stderr, "Failed to register control %d\n", rc );
1938 syncprov.on_bi.bi_type = "syncprov";
1939 syncprov.on_bi.bi_db_init = syncprov_db_init;
1940 syncprov.on_bi.bi_db_config = syncprov_db_config;
1941 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
1942 syncprov.on_bi.bi_db_open = syncprov_db_open;
1943 syncprov.on_bi.bi_db_close = syncprov_db_close;
1945 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
1946 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
1948 syncprov.on_bi.bi_op_add = syncprov_op_mod;
1949 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
1950 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
1951 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
1952 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
1953 syncprov.on_bi.bi_op_search = syncprov_op_search;
1954 syncprov.on_bi.bi_extended = syncprov_op_extended;
1955 syncprov.on_bi.bi_operational = syncprov_operational;
1957 return overlay_register( &syncprov );
1960 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
1962 init_module( int argc, char *argv[] )
1964 return syncprov_init();
1966 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
1968 #endif /* defined(SLAPD_OVER_SYNCPROV) */