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" );
254 /* Generate state based on session log - not implemented yet */
256 syncprov_state_ctrl_from_slog(
259 struct slog_entry *slog_e,
260 int entry_sync_state,
264 struct berval *cookie)
269 const char *text = NULL;
271 BerElementBuffer berbuf;
272 BerElement *ber = (BerElement *)&berbuf;
274 struct berval entryuuid_bv = BER_BVNULL;
276 ber_init2( ber, NULL, LBER_USE_DER );
277 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
279 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
281 entryuuid_bv = slog_e->sl_uuid;
283 if ( send_cookie && cookie ) {
284 ber_printf( ber, "{eOON}",
285 entry_sync_state, &entryuuid_bv, cookie );
287 ber_printf( ber, "{eON}",
288 entry_sync_state, &entryuuid_bv );
291 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
292 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
293 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
298 Debug( LDAP_DEBUG_TRACE,
299 "slap_build_sync_ctrl: ber_flatten2 failed\n",
301 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
314 struct berval *cookie,
319 BerElementBuffer berbuf;
320 BerElement *ber = (BerElement *)&berbuf;
321 struct berval rspdata;
325 ber_init2( ber, NULL, LBER_USE_DER );
326 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
330 case LDAP_TAG_SYNC_NEW_COOKIE:
331 ber_printf( ber, "tO", type, cookie );
333 case LDAP_TAG_SYNC_REFRESH_DELETE:
334 case LDAP_TAG_SYNC_REFRESH_PRESENT:
335 ber_printf( ber, "t{", type );
337 ber_printf( ber, "O", cookie );
339 if ( refreshDone == 0 ) {
340 ber_printf( ber, "b", refreshDone );
342 ber_printf( ber, "N}" );
344 case LDAP_TAG_SYNC_ID_SET:
345 ber_printf( ber, "t{", type );
347 ber_printf( ber, "O", cookie );
349 if ( refreshDeletes == 1 ) {
350 ber_printf( ber, "b", refreshDeletes );
352 ber_printf( ber, "[W]", syncUUIDs );
353 ber_printf( ber, "N}" );
356 Debug( LDAP_DEBUG_TRACE,
357 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
363 ret = ber_flatten2( ber, &rspdata, 0 );
366 Debug( LDAP_DEBUG_TRACE,
367 "syncprov_sendinfo: ber_flatten2 failed\n",
369 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
373 rs->sr_rspoid = LDAP_SYNC_INFO;
374 rs->sr_rspdata = &rspdata;
375 send_ldap_intermediate( op, rs );
376 rs->sr_rspdata = NULL;
382 /* Find a modtarget in an AVL tree */
384 sp_avl_cmp( const void *c1, const void *c2 )
386 const modtarget *m1, *m2;
390 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
393 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
396 /* syncprov_findbase:
397 * finds the true DN of the base of a search (with alias dereferencing) and
398 * checks to make sure the base entry doesn't get replaced with a different
399 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
400 * change is detected, any persistent search on this base must be terminated /
402 * On the first call, we just save the DN and entryID. On subsequent calls
403 * we compare the DN and entryID with the saved values.
406 findbase_cb( Operation *op, SlapReply *rs )
408 slap_callback *sc = op->o_callback;
410 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
411 fbase_cookie *fc = sc->sc_private;
413 /* If no entryID, we're looking for the first time.
414 * Just store whatever we got.
416 if ( fc->fss->s_eid == NOID ) {
418 fc->fss->s_eid = rs->sr_entry->e_id;
419 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
421 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
422 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
424 /* OK, the DN is the same and the entryID is the same. Now
425 * see if the fdn resides in the scope.
428 switch ( fc->fss->s_op->ors_scope ) {
429 case LDAP_SCOPE_BASE:
430 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
432 case LDAP_SCOPE_ONELEVEL: {
434 dnParent( fc->fdn, &pdn );
435 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
437 case LDAP_SCOPE_SUBTREE:
438 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
440 #ifdef LDAP_SCOPE_SUBORDINATE
441 case LDAP_SCOPE_SUBORDINATE:
442 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
443 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
449 if ( rs->sr_err != LDAP_SUCCESS ) {
450 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
456 syncprov_findbase( Operation *op, fbase_cookie *fc )
458 opcookie *opc = op->o_callback->sc_private;
459 slap_overinst *on = opc->son;
460 syncprov_info_t *si = on->on_bi.bi_private;
462 slap_callback cb = {0};
464 SlapReply frs = { REP_RESULT };
469 cb.sc_response = findbase_cb;
472 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
473 fop.o_callback = &cb;
474 fop.o_tag = LDAP_REQ_SEARCH;
475 fop.ors_scope = LDAP_SCOPE_BASE;
476 fop.ors_deref = fc->fss->s_op->ors_deref;
477 fop.ors_limit = NULL;
479 fop.ors_tlimit = SLAP_NO_LIMIT;
480 fop.ors_attrs = slap_anlist_no_attrs;
481 fop.ors_attrsonly = 1;
482 fop.ors_filter = fc->fss->s_op->ors_filter;
483 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
485 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
487 fop.o_bd->bd_info = on->on_info->oi_orig;
488 rc = fop.o_bd->be_search( &fop, &frs );
489 fop.o_bd->bd_info = (BackendInfo *)on;
491 if ( fc->fbase ) return LDAP_SUCCESS;
493 /* If entryID has changed, then the base of this search has
494 * changed. Invalidate the psearch.
496 return LDAP_NO_SUCH_OBJECT;
500 * This function has three different purposes, but they all use a search
501 * that filters on entryCSN so they're combined here.
502 * 1: at startup time, after a contextCSN has been read from the database,
503 * we search for all entries with CSN >= contextCSN in case the contextCSN
504 * was not checkpointed at the previous shutdown.
506 * 2: when the current contextCSN is known and we have a sync cookie, we search
507 * for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
508 * entry is found, the cookie CSN is valid, otherwise it is stale.
510 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
511 * CSN, and generate Present records for them. We always collect this result
512 * in SyncID sets, even if there's only one match.
514 #define FIND_MAXCSN 1
516 #define FIND_PRESENT 3
519 findmax_cb( Operation *op, SlapReply *rs )
521 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
522 struct berval *maxcsn = op->o_callback->sc_private;
523 Attribute *a = attr_find( rs->sr_entry->e_attrs,
524 slap_schema.si_ad_entryCSN );
526 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
527 maxcsn->bv_len = a->a_vals[0].bv_len;
528 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
535 findcsn_cb( Operation *op, SlapReply *rs )
537 slap_callback *sc = op->o_callback;
539 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
540 sc->sc_private = (void *)1;
545 /* Build a list of entryUUIDs for sending in a SyncID set */
549 typedef struct fpres_cookie {
556 findpres_cb( Operation *op, SlapReply *rs )
558 slap_callback *sc = op->o_callback;
559 fpres_cookie *pc = sc->sc_private;
561 int ret = SLAP_CB_CONTINUE;
563 switch ( rs->sr_type ) {
565 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
567 pc->uuids[pc->num].bv_val = pc->last;
568 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
569 pc->uuids[pc->num].bv_len );
571 pc->last = pc->uuids[pc->num].bv_val;
572 pc->uuids[pc->num].bv_val = NULL;
575 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
581 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
583 pc->uuids[pc->num].bv_val = pc->last;
585 pc->last = pc->uuids[0].bv_val;
595 syncprov_findcsn( Operation *op, int mode )
597 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
598 syncprov_info_t *si = on->on_bi.bi_private;
600 slap_callback cb = {0};
602 SlapReply frs = { REP_RESULT };
603 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
604 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
605 struct berval fbuf, maxcsn;
607 #ifdef LDAP_COMP_MATCH
608 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
610 AttributeAssertion eq = { NULL, BER_BVNULL };
612 int i, rc = LDAP_SUCCESS;
613 fpres_cookie pcookie;
614 sync_control *srs = NULL;
616 if ( mode != FIND_MAXCSN ) {
617 srs = op->o_controls[slap_cids.sc_LDAPsync];
619 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
625 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
629 cf.f_av_desc = slap_schema.si_ad_entryCSN;
632 fop.o_callback = &cb;
633 fop.ors_limit = NULL;
634 fop.ors_tlimit = SLAP_NO_LIMIT;
635 fop.ors_filter = &cf;
636 fop.ors_filterstr = fbuf;
640 cf.f_choice = LDAP_FILTER_GE;
641 cf.f_av_value = si->si_ctxcsn;
642 fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)",
643 cf.f_av_value.bv_val );
644 fop.ors_attrsonly = 0;
645 fop.ors_attrs = csn_anlist;
646 fop.ors_slimit = SLAP_NO_LIMIT;
647 cb.sc_private = &maxcsn;
648 cb.sc_response = findmax_cb;
649 strcpy( cbuf, si->si_ctxcsn.bv_val );
650 maxcsn.bv_val = cbuf;
651 maxcsn.bv_len = si->si_ctxcsn.bv_len;
654 cf.f_choice = LDAP_FILTER_LE;
655 cf.f_av_value = srs->sr_state.ctxcsn;
656 fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
657 cf.f_av_value.bv_val );
658 fop.ors_attrsonly = 1;
659 fop.ors_attrs = slap_anlist_no_attrs;
661 cb.sc_private = NULL;
662 cb.sc_response = findcsn_cb;
665 af.f_choice = LDAP_FILTER_AND;
668 cf.f_choice = LDAP_FILTER_LE;
669 cf.f_av_value = srs->sr_state.ctxcsn;
670 cf.f_next = op->ors_filter;
671 fop.ors_filter = ⁡
672 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
673 fop.ors_attrsonly = 0;
674 fop.ors_attrs = uuid_anlist;
675 fop.ors_slimit = SLAP_NO_LIMIT;
676 /* We want pure entries, not referrals */
677 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
678 cb.sc_private = &pcookie;
679 cb.sc_response = findpres_cb;
682 /* preallocate storage for a full set */
683 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
684 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
686 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
687 pcookie.uuids[0].bv_val = pcookie.last;
688 pcookie.uuids[0].bv_len = UUID_LEN;
689 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
690 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
691 pcookie.uuids[i].bv_len = UUID_LEN;
696 fop.o_bd->bd_info = on->on_info->oi_orig;
697 fop.o_bd->be_search( &fop, &frs );
698 fop.o_bd->bd_info = (BackendInfo *)on;
702 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
703 si->si_ctxcsn.bv_len = maxcsn.bv_len;
706 /* If matching CSN was not found, invalidate the context. */
707 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
710 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
711 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
718 /* Queue a persistent search response if still in Refresh stage */
720 syncprov_qresp( opcookie *opc, syncops *so, int mode )
724 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
725 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
727 sr->s_dn.bv_val = (char *)(sr + 1);
729 sr->s_isreference = opc->sreference;
730 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
731 *(sr->s_ndn.bv_val++) = '\0';
732 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
733 *(sr->s_uuid.bv_val++) = '\0';
734 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
739 so->s_restail->s_next = sr;
742 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
746 /* Send a persistent search response */
748 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry *e, int mode, int queue )
750 slap_overinst *on = opc->son;
751 syncprov_info_t *si = on->on_bi.bi_private;
753 SlapReply rs = { REP_SEARCH };
754 LDAPControl *ctrls[2];
755 struct berval cookie;
757 Attribute a_uuid = {0};
758 Operation sop = *so->s_op;
763 sop.o_tmpmemctx = op->o_tmpmemctx;
765 sop.o_controls = op->o_controls;
767 if ( queue && (so->s_flags & PS_IS_REFRESHING) ) {
768 ldap_pvt_thread_mutex_lock( &so->s_mutex );
769 if ( so->s_flags & PS_IS_REFRESHING )
770 return syncprov_qresp( opc, so, mode );
771 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
775 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
777 e_uuid.e_attrs = &a_uuid;
778 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
779 a_uuid.a_nvals = &opc->suuid;
780 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
781 mode, ctrls, 0, 1, &cookie );
787 if ( opc->sreference ) {
788 rs.sr_ref = get_entry_referrals( &sop, e );
789 send_search_reference( &sop, &rs );
790 ber_bvarray_free( rs.sr_ref );
794 case LDAP_SYNC_MODIFY:
795 rs.sr_attrs = sop.ors_attrs;
796 send_search_entry( &sop, &rs );
798 case LDAP_SYNC_DELETE:
799 e_uuid.e_attrs = NULL;
800 e_uuid.e_name = opc->sdn;
801 e_uuid.e_nname = opc->sndn;
802 rs.sr_entry = &e_uuid;
803 if ( opc->sreference ) {
804 struct berval bv = BER_BVNULL;
806 send_search_reference( &sop, &rs );
808 send_search_entry( &sop, &rs );
814 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
820 syncprov_free_syncop( syncops *so )
822 syncres *sr, *srnext;
823 GroupAssertion *ga, *gnext;
825 ldap_pvt_thread_mutex_lock( &so->s_mutex );
827 if ( so->s_inuse > 0 ) {
828 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
831 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
832 if ( so->s_flags & PS_IS_DETACHED ) {
833 filter_free( so->s_op->ors_filter );
834 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
840 ch_free( so->s_base.bv_val );
841 for ( sr=so->s_res; sr; sr=srnext ) {
845 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
850 syncprov_drop_psearch( syncops *so, int lock )
852 if ( so->s_flags & PS_IS_DETACHED ) {
854 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
855 so->s_op->o_conn->c_n_ops_executing--;
856 so->s_op->o_conn->c_n_ops_completed++;
857 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
860 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
862 syncprov_free_syncop( so );
868 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
870 slap_callback *sc = op->o_callback;
871 op->o_callback = sc->sc_next;
872 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
873 op->o_tmpfree( sc, op->o_tmpmemctx );
878 syncprov_op_abandon( Operation *op, SlapReply *rs )
880 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
881 syncprov_info_t *si = on->on_bi.bi_private;
882 syncops *so, *soprev;
884 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
885 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
886 soprev=so, so=so->s_next ) {
887 if ( so->s_op->o_connid == op->o_connid &&
888 so->s_op->o_msgid == op->orn_msgid ) {
889 so->s_op->o_abandon = 1;
890 soprev->s_next = so->s_next;
894 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
896 /* Is this really a Cancel exop? */
897 if ( op->o_tag != LDAP_REQ_ABANDON ) {
898 so->s_op->o_cancel = SLAP_CANCEL_ACK;
899 rs->sr_err = LDAP_CANCELLED;
900 send_ldap_result( so->s_op, rs );
901 if ( so->s_flags & PS_IS_DETACHED ) {
903 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
904 cb->sc_cleanup = syncprov_ab_cleanup;
905 cb->sc_next = op->o_callback;
907 return SLAP_CB_CONTINUE;
910 syncprov_drop_psearch( so, 0 );
912 return SLAP_CB_CONTINUE;
915 /* Find which persistent searches are affected by this operation */
917 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
919 slap_overinst *on = opc->son;
920 syncprov_info_t *si = on->on_bi.bi_private;
923 syncops *ss, *sprev, *snext;
930 fc.fdn = &op->o_req_ndn;
932 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
934 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
935 else dnParent( fc.fdn, &pdn );
936 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
940 if ( op->o_tag != LDAP_REQ_ADD ) {
941 op->o_bd->bd_info = (BackendInfo *)on->on_info;
942 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
943 op->o_bd->bd_info = (BackendInfo *)on;
950 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
951 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
952 opc->sreference = is_entry_referral( e );
954 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
955 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
957 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
960 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
961 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
962 sprev = ss, ss=snext)
973 /* If the base of the search is missing, signal a refresh */
974 rc = syncprov_findbase( op, &fc );
975 if ( rc != LDAP_SUCCESS ) {
976 SlapReply rs = {REP_RESULT};
977 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
978 "search base has changed" );
979 sprev->s_next = snext;
980 syncprov_drop_psearch( ss, 1 );
984 /* If we're sending results now, look for this op in old matches */
987 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
988 old=sm, sm=sm->sm_next ) {
989 if ( sm->sm_op == ss ) {
991 old->sm_next = sm->sm_next;
992 op->o_tmpfree( sm, op->o_tmpmemctx );
998 /* check if current o_req_dn is in scope and matches filter */
999 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1000 LDAP_COMPARE_TRUE ) {
1002 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1003 sm->sm_next = opc->smatches;
1008 /* if found send UPDATE else send ADD */
1009 syncprov_sendresp( op, opc, ss, e,
1010 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1012 } else if ( !saveit && found ) {
1014 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1017 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1019 if ( op->o_tag != LDAP_REQ_ADD ) {
1020 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1021 be_entry_release_rw( op, e, 0 );
1022 op->o_bd->bd_info = (BackendInfo *)on;
1025 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1030 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1032 slap_callback *cb = op->o_callback;
1033 opcookie *opc = cb->sc_private;
1034 slap_overinst *on = opc->son;
1035 syncprov_info_t *si = on->on_bi.bi_private;
1036 syncmatches *sm, *snext;
1037 modtarget *mt, mtdummy;
1039 for (sm = opc->smatches; sm; sm=snext) {
1040 snext = sm->sm_next;
1041 syncprov_free_syncop( sm->sm_op );
1042 op->o_tmpfree( sm, op->o_tmpmemctx );
1045 /* Remove op from lock table */
1047 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1048 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1049 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1051 modinst *mi = mt->mt_mods;
1053 /* If there are more, promote the next one */
1054 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1055 if ( mi->mi_next ) {
1056 mt->mt_mods = mi->mi_next;
1057 mt->mt_op = mt->mt_mods->mi_op;
1058 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1060 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1061 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1062 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1063 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1064 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1068 if ( !BER_BVISNULL( &opc->suuid ))
1069 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1070 if ( !BER_BVISNULL( &opc->sndn ))
1071 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1072 if ( !BER_BVISNULL( &opc->sdn ))
1073 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1074 op->o_callback = cb->sc_next;
1075 op->o_tmpfree(cb, op->o_tmpmemctx);
1081 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1083 syncprov_info_t *si = on->on_bi.bi_private;
1086 struct berval bv[2];
1088 slap_callback cb = {0};
1090 mod.sml_values = bv;
1091 bv[1].bv_val = NULL;
1092 bv[0] = si->si_ctxcsn;
1093 mod.sml_nvalues = NULL;
1094 mod.sml_desc = slap_schema.si_ad_contextCSN;
1095 mod.sml_op = LDAP_MOD_REPLACE;
1096 mod.sml_next = NULL;
1098 cb.sc_response = slap_null_cb;
1100 opm.o_tag = LDAP_REQ_MODIFY;
1101 opm.o_callback = &cb;
1102 opm.orm_modlist = &mod;
1103 opm.o_req_dn = op->o_bd->be_suffix[0];
1104 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1105 orig = opm.o_bd->bd_info;
1106 opm.o_bd->bd_info = on->on_info->oi_orig;
1107 opm.o_bd->be_modify( &opm, rs );
1111 syncprov_add_slog( Operation *op, struct berval *csn )
1113 opcookie *opc = op->o_callback->sc_private;
1114 slap_overinst *on = opc->son;
1115 syncprov_info_t *si = on->on_bi.bi_private;
1121 /* Allocate a record. UUIDs are not NUL-terminated. */
1122 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1125 se->se_tag = op->o_tag;
1127 se->se_uuid.bv_val = (char *)(se+1);
1128 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1129 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1130 se->se_uuid.bv_len = opc->suuid.bv_len;
1132 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1133 se->se_csn.bv_val[csn->bv_len] = '\0';
1134 se->se_csn.bv_len = csn->bv_len;
1136 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1137 if ( sl->sl_head ) {
1138 sl->sl_tail->se_next = se;
1144 while ( sl->sl_num > sl->sl_size ) {
1146 sl->sl_head = se->se_next;
1147 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1148 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1151 if ( !sl->sl_head ) {
1155 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1159 /* Just set a flag if we found the matching entry */
1161 playlog_cb( Operation *op, SlapReply *rs )
1163 if ( rs->sr_type == REP_SEARCH ) {
1164 op->o_callback->sc_private = (void *)1;
1169 /* enter with sl->sl_mutex locked, release before returning */
1171 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1172 struct berval *oldcsn, struct berval *ctxcsn )
1174 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1175 syncprov_info_t *si = on->on_bi.bi_private;
1177 int i, j, ndel, num, nmods, mmods;
1180 if ( !sl->sl_num ) {
1181 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1189 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1190 num * UUID_LEN, op->o_tmpmemctx );
1192 uuids[0].bv_val = (char *)(uuids + num + 1);
1194 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1195 * and everything else at the end. Do this first so we can
1196 * unlock the list mutex.
1198 for ( se=sl->sl_head; se; se=se->se_next ) {
1199 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1200 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1201 if ( se->se_tag == LDAP_REQ_DELETE ) {
1208 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1209 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1210 uuids[j].bv_len = UUID_LEN;
1212 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1216 /* Zero out unused slots */
1217 for ( i=ndel; i < num - nmods; i++ )
1218 uuids[i].bv_len = 0;
1220 /* Mods must be validated to see if they belong in this delete set.
1224 /* Strip any duplicates */
1225 for ( i=0; i<nmods; i++ ) {
1226 for ( j=0; j<ndel; j++ ) {
1227 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1228 uuids[num - 1 - i].bv_len = 0;
1233 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1234 for ( j=0; j<i; j++ ) {
1235 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1236 uuids[num - 1 - i].bv_len = 0;
1245 SlapReply frs = { REP_RESULT };
1248 #ifdef LDAP_COMP_MATCH
1249 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1251 AttributeAssertion eq;
1253 slap_callback cb = {0};
1257 fop.o_sync_mode = 0;
1258 fop.o_callback = &cb;
1259 fop.ors_limit = NULL;
1260 fop.ors_tlimit = SLAP_NO_LIMIT;
1261 fop.ors_attrs = slap_anlist_all_attributes;
1262 fop.ors_attrsonly = 0;
1263 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1265 af.f_choice = LDAP_FILTER_AND;
1268 mf.f_choice = LDAP_FILTER_EQUALITY;
1270 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1271 mf.f_next = fop.ors_filter;
1273 fop.ors_filter = ⁡
1275 cb.sc_response = playlog_cb;
1276 fop.o_bd->bd_info = on->on_info->oi_orig;
1278 for ( i=ndel; i<num; i++ ) {
1279 if ( uuids[i].bv_len == 0 ) continue;
1281 mf.f_av_value = uuids[i];
1282 cb.sc_private = NULL;
1284 rc = fop.o_bd->be_search( &fop, &frs );
1286 /* If entry was not found, add to delete list */
1287 if ( !cb.sc_private ) {
1288 uuids[ndel++] = uuids[i];
1291 fop.o_bd->bd_info = (BackendInfo *)on;
1294 uuids[ndel].bv_val = NULL;
1295 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1300 syncprov_op_response( Operation *op, SlapReply *rs )
1302 opcookie *opc = op->o_callback->sc_private;
1303 slap_overinst *on = opc->son;
1304 syncprov_info_t *si = on->on_bi.bi_private;
1307 if ( rs->sr_err == LDAP_SUCCESS )
1309 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1310 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1312 /* Update our context CSN */
1314 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1315 slap_get_commit_csn( op, &maxcsn, &curcsn );
1316 if ( !BER_BVISNULL( &maxcsn ) ) {
1317 strcpy( cbuf, maxcsn.bv_val );
1318 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1319 strcpy( si->si_ctxcsnbuf, cbuf );
1320 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1324 /* Don't do any processing for consumer contextCSN updates */
1325 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1326 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1327 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1328 return SLAP_CB_CONTINUE;
1332 if ( si->si_chkops || si->si_chktime ) {
1334 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1338 if ( si->si_chktime &&
1339 (op->o_time - si->si_chklast >= si->si_chktime )) {
1341 si->si_chklast = op->o_time;
1344 syncprov_checkpoint( op, rs, on );
1347 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1349 opc->sctxcsn.bv_len = maxcsn.bv_len;
1350 opc->sctxcsn.bv_val = cbuf;
1352 /* Handle any persistent searches */
1356 case LDAP_REQ_MODIFY:
1357 case LDAP_REQ_MODRDN:
1358 case LDAP_REQ_EXTENDED:
1359 syncprov_matchops( op, opc, 0 );
1361 case LDAP_REQ_DELETE:
1362 /* for each match in opc->smatches:
1365 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1366 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1367 if ( sm->sm_op->s_op->o_abandon )
1369 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1370 LDAP_SYNC_DELETE, 1 );
1372 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1377 /* Add any log records */
1378 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1379 syncprov_add_slog( op, &curcsn );
1383 return SLAP_CB_CONTINUE;
1386 /* We don't use a subentry to store the context CSN any more.
1387 * We expose the current context CSN as an operational attribute
1388 * of the suffix entry.
1391 syncprov_op_compare( Operation *op, SlapReply *rs )
1393 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1394 syncprov_info_t *si = on->on_bi.bi_private;
1395 int rc = SLAP_CB_CONTINUE;
1397 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1398 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1402 struct berval bv[2];
1404 e.e_name = op->o_bd->be_suffix[0];
1405 e.e_nname = op->o_bd->be_nsuffix[0];
1407 BER_BVZERO( &bv[1] );
1408 bv[0] = si->si_ctxcsn;
1410 a.a_desc = slap_schema.si_ad_contextCSN;
1412 a.a_nvals = a.a_vals;
1414 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1416 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1417 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1418 if ( ! rs->sr_err ) {
1419 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1420 goto return_results;
1423 if ( get_assert( op ) &&
1424 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1426 rs->sr_err = LDAP_ASSERTION_FAILED;
1427 goto return_results;
1431 rs->sr_err = LDAP_COMPARE_FALSE;
1433 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1434 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1435 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1436 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1438 rs->sr_err = LDAP_COMPARE_TRUE;
1443 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1445 send_ldap_result( op, rs );
1447 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1448 rs->sr_err = LDAP_SUCCESS;
1457 syncprov_op_mod( Operation *op, SlapReply *rs )
1459 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1460 syncprov_info_t *si = on->on_bi.bi_private;
1462 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1464 (si->si_ops ? sizeof(modinst) : 0 ),
1466 opcookie *opc = (opcookie *)(cb+1);
1468 cb->sc_response = syncprov_op_response;
1469 cb->sc_cleanup = syncprov_op_cleanup;
1470 cb->sc_private = opc;
1471 cb->sc_next = op->o_callback;
1472 op->o_callback = cb;
1474 /* If there are active persistent searches, lock this operation.
1475 * See seqmod.c for the locking logic on its own.
1478 modtarget *mt, mtdummy;
1481 mi = (modinst *)(opc+1);
1484 /* See if we're already modifying this entry... */
1486 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1487 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1489 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1490 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1491 mt->mt_tail->mi_next = mi;
1493 /* wait for this op to get to head of list */
1494 while ( mt->mt_mods != mi ) {
1495 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1496 ldap_pvt_thread_yield();
1497 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1499 /* clean up if the caller is giving up */
1500 if ( op->o_abandon ) {
1502 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1504 m2->mi_next = mi->mi_next;
1505 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1506 op->o_tmpfree( cb, op->o_tmpmemctx );
1507 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1508 return SLAPD_ABANDON;
1511 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1513 /* Record that we're modifying this entry now */
1514 mt = ch_malloc( sizeof(modtarget) );
1517 mt->mt_op = mi->mi_op;
1518 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1519 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1520 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1524 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1525 syncprov_matchops( op, opc, 1 );
1528 return SLAP_CB_CONTINUE;
1532 syncprov_op_extended( Operation *op, SlapReply *rs )
1534 if ( exop_is_write( op ))
1535 return syncprov_op_mod( op, rs );
1537 return SLAP_CB_CONTINUE;
1540 typedef struct searchstate {
1541 slap_overinst *ss_on;
1547 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1549 if ( rs->sr_ctrls ) {
1550 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1551 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1552 rs->sr_ctrls = NULL;
1558 syncprov_detach_op( Operation *op, syncops *so )
1564 GroupAssertion *g1, *g2;
1566 /* count the search attrs */
1567 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1568 alen += op->ors_attrs[i].an_name.bv_len + 1;
1570 /* Make a new copy of the operation */
1571 size = sizeof(Operation) + sizeof(Opheader) +
1572 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1573 op->o_req_dn.bv_len + 1 +
1574 op->o_req_ndn.bv_len + 1 +
1575 op->o_ndn.bv_len + 1 +
1576 so->s_filterstr.bv_len + 1;
1577 op2 = (Operation *)ch_calloc( 1, size );
1578 op2->o_hdr = (Opheader *)(op2+1);
1580 /* Copy the fields we care about explicitly, leave the rest alone */
1581 *op2->o_hdr = *op->o_hdr;
1582 op2->o_tag = op->o_tag;
1583 op2->o_time = op->o_time;
1584 op2->o_bd = op->o_bd;
1585 op2->o_request = op->o_request;
1588 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1589 ptr = (char *)(op2->ors_attrs+i+1);
1590 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1591 op2->ors_attrs[i] = op->ors_attrs[i];
1592 op2->ors_attrs[i].an_name.bv_val = ptr;
1593 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1595 BER_BVZERO( &op2->ors_attrs[i].an_name );
1597 ptr = (char *)(op2->o_hdr + 1);
1599 op2->o_authz = op->o_authz;
1600 op2->o_ndn.bv_val = ptr;
1601 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1602 op2->o_dn = op2->o_ndn;
1603 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1604 op2->o_req_dn.bv_val = ptr;
1605 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1606 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1607 op2->o_req_ndn.bv_val = ptr;
1608 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1609 op2->ors_filterstr.bv_val = ptr;
1610 strcpy( ptr, so->s_filterstr.bv_val );
1611 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1612 op2->ors_filter = str2filter( ptr );
1615 /* Copy any cached group ACLs individually */
1616 op2->o_groups = NULL;
1617 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1618 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1620 strcpy( g2->ga_ndn, g1->ga_ndn );
1621 g2->ga_next = op2->o_groups;
1625 /* Add op2 to conn so abandon will find us */
1626 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1627 op->o_conn->c_n_ops_executing++;
1628 op->o_conn->c_n_ops_completed--;
1629 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1630 so->s_flags |= PS_IS_DETACHED;
1631 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1635 syncprov_search_response( Operation *op, SlapReply *rs )
1637 searchstate *ss = op->o_callback->sc_private;
1638 slap_overinst *on = ss->ss_on;
1639 syncprov_info_t *si = on->on_bi.bi_private;
1640 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1642 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1644 /* If we got a referral without a referral object, there's
1645 * something missing that we cannot replicate. Just ignore it.
1646 * The consumer will abort because we didn't send the expected
1649 if ( !rs->sr_entry ) {
1650 assert( rs->sr_entry );
1651 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1652 return SLAP_CB_CONTINUE;
1654 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1655 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1656 slap_schema.si_ad_entryCSN );
1658 /* Don't send the ctx entry twice */
1659 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1660 return LDAP_SUCCESS;
1662 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1664 rs->sr_ctrls[1] = NULL;
1665 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1666 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1667 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1668 struct berval cookie;
1670 slap_compose_sync_cookie( op, &cookie,
1671 &op->ors_filter->f_and->f_ava->aa_value,
1672 srs->sr_state.rid );
1674 /* Is this a regular refresh? */
1676 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1678 rs->sr_ctrls[1] = NULL;
1679 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1680 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1681 LDAP_SYNC_REFRESH_DELETES );
1684 /* It's RefreshAndPersist, transition to Persist phase */
1685 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1686 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1687 &cookie, 1, NULL, 0 );
1688 /* Flush any queued persist messages */
1689 if ( ss->ss_so->s_res ) {
1690 syncres *sr, *srnext;
1695 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1697 for (sr = ss->ss_so->s_res; sr; sr=srnext) {
1698 int rc = LDAP_SUCCESS;
1699 srnext = sr->s_next;
1701 opc.sndn = sr->s_ndn;
1702 opc.suuid = sr->s_uuid;
1703 opc.sctxcsn = sr->s_csn;
1704 opc.sreference = sr->s_isreference;
1707 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
1708 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1709 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
1710 op->o_bd->bd_info = (BackendInfo *)on;
1712 if ( rc == LDAP_SUCCESS )
1713 syncprov_sendresp( op, &opc, ss->ss_so, e,
1717 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1718 be_entry_release_rw( op, e, 0 );
1719 op->o_bd->bd_info = (BackendInfo *)on;
1723 ss->ss_so->s_res = NULL;
1724 ss->ss_so->s_restail = NULL;
1727 /* Turn off the refreshing flag */
1728 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1730 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1732 /* Detach this Op from frontend control */
1733 syncprov_detach_op( op, ss->ss_so );
1735 return LDAP_SUCCESS;
1739 return SLAP_CB_CONTINUE;
1743 syncprov_op_search( Operation *op, SlapReply *rs )
1745 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1746 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1748 int gotstate = 0, nochange = 0, do_present = 1;
1749 Filter *fand, *fava;
1750 syncops *sop = NULL;
1753 struct berval ctxcsn;
1754 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1756 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1758 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1759 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1763 srs = op->o_controls[slap_cids.sc_LDAPsync];
1765 /* If this is a persistent search, set it up right away */
1766 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1776 so.s_flags = PS_IS_REFRESHING;
1777 /* syncprov_findbase expects to be called as a callback... */
1778 sc.sc_private = &opc;
1780 cb = op->o_callback;
1781 op->o_callback = ≻
1782 rs->sr_err = syncprov_findbase( op, &fc );
1783 op->o_callback = cb;
1785 if ( rs->sr_err != LDAP_SUCCESS ) {
1786 send_ldap_result( op, rs );
1789 sop = ch_malloc( sizeof( syncops ));
1791 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1792 sop->s_rid = srs->sr_state.rid;
1795 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1796 sop->s_next = si->si_ops;
1798 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1801 /* snapshot the ctxcsn */
1802 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1803 strcpy( csnbuf, si->si_ctxcsnbuf );
1804 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1805 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1806 ctxcsn.bv_val = csnbuf;
1808 /* If we have a cookie, handle the PRESENT lookups */
1809 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1812 /* The cookie was validated when it was parsed, just use it */
1814 /* If just Refreshing and nothing has changed, shortcut it */
1815 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1817 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1818 LDAPControl *ctrls[2];
1822 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1823 NULL, LDAP_SYNC_REFRESH_DELETES );
1824 rs->sr_ctrls = ctrls;
1825 rs->sr_err = LDAP_SUCCESS;
1826 send_ldap_result( op, rs );
1827 rs->sr_ctrls = NULL;
1832 /* Do we have a sessionlog for this search? */
1835 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1836 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1838 /* mutex is unlocked in playlog */
1839 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1841 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1844 /* Is the CSN still present in the database? */
1845 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1846 /* No, so a reload is required */
1847 #if 0 /* the consumer doesn't seem to send this hint */
1848 if ( op->o_sync_rhint == 0 ) {
1849 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1855 /* If changed and doing Present lookup, send Present UUIDs */
1856 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1858 send_ldap_result( op, rs );
1865 /* Append CSN range to search filter, save original filter
1866 * for persistent search evaluation
1869 sop->s_filterstr= op->ors_filterstr;
1872 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1873 fand->f_choice = LDAP_FILTER_AND;
1874 fand->f_next = NULL;
1875 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1876 fava->f_choice = LDAP_FILTER_LE;
1877 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1878 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1879 #ifdef LDAP_COMP_MATCH
1880 fava->f_ava->aa_cf = NULL;
1882 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1885 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1886 fava = fava->f_next;
1887 fava->f_choice = LDAP_FILTER_GE;
1888 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1889 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1890 #ifdef LDAP_COMP_MATCH
1891 fava->f_ava->aa_cf = NULL;
1893 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1895 fava->f_next = op->ors_filter;
1896 op->ors_filter = fand;
1897 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1899 /* Let our callback add needed info to returned entries */
1900 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1901 ss = (searchstate *)(cb+1);
1904 ss->ss_present = do_present;
1905 cb->sc_response = syncprov_search_response;
1906 cb->sc_cleanup = syncprov_search_cleanup;
1907 cb->sc_private = ss;
1908 cb->sc_next = op->o_callback;
1909 op->o_callback = cb;
1911 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1912 op->o_sync_mode &= SLAP_CONTROL_MASK;
1915 /* If this is a persistent search and no changes were reported during
1916 * the refresh phase, just invoke the response callback to transition
1917 * us into persist phase
1920 rs->sr_err = LDAP_SUCCESS;
1921 rs->sr_nentries = 0;
1922 send_ldap_result( op, rs );
1925 return SLAP_CB_CONTINUE;
1929 syncprov_operational(
1933 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1934 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1936 if ( rs->sr_entry &&
1937 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1939 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1940 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1941 Attribute *a, **ap = NULL;
1943 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1944 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1949 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1951 a = ch_malloc( sizeof(Attribute));
1952 a->a_desc = slap_schema.si_ad_contextCSN;
1953 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1954 a->a_vals[1].bv_val = NULL;
1955 a->a_nvals = a->a_vals;
1961 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1963 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1965 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1967 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1970 return SLAP_CB_CONTINUE;
1982 slap_overinst *on = (slap_overinst *)be->bd_info;
1983 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1985 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1987 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1988 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1991 si->si_chkops = atoi( argv[1] );
1992 si->si_chktime = atoi( argv[2] ) * 60;
1995 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
1999 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2000 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
2003 size = atoi( argv[1] );
2006 "%s: line %d: session log size %d is negative\n",
2007 fname, lineno, size );
2012 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2013 sl->sl_mincsn.bv_val = (char *)(sl+1);
2014 sl->sl_mincsn.bv_len = 0;
2016 sl->sl_head = sl->sl_tail = NULL;
2017 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2024 return SLAP_CONF_UNKNOWN;
2027 /* Cheating - we have no thread pool context for these functions,
2030 typedef struct thread_keys {
2033 ldap_pvt_thread_pool_keyfree_t *xfree;
2037 /* A fake thread context */
2038 static thread_keys thrctx[MAXKEYS];
2040 /* Read any existing contextCSN from the underlying db.
2041 * Then search for any entries newer than that. If no value exists,
2042 * just generate it. Cache whatever result.
2049 slap_overinst *on = (slap_overinst *) be->bd_info;
2050 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2053 char opbuf[OPERATION_BUFFER_SIZE];
2054 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2055 Operation *op = (Operation *)opbuf;
2060 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2065 connection_fake_init( &conn, op, thrctx );
2067 op->o_dn = be->be_rootdn;
2068 op->o_ndn = be->be_rootndn;
2070 ctxcsnbuf[0] = '\0';
2072 op->o_bd->bd_info = on->on_info->oi_orig;
2073 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2074 slap_schema.si_ad_contextCSN, 0, &e );
2077 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2079 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2080 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2081 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2082 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2083 si->si_ctxcsn.bv_len );
2084 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2085 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2087 be_entry_release_rw( op, e, 0 );
2088 op->o_bd->bd_info = (BackendInfo *)on;
2089 op->o_req_dn = be->be_suffix[0];
2090 op->o_req_ndn = be->be_nsuffix[0];
2091 op->ors_scope = LDAP_SCOPE_SUBTREE;
2092 syncprov_findcsn( op, FIND_MAXCSN );
2095 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2096 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2097 &si->si_ctxcsn, 0 );
2100 /* If our ctxcsn is different from what was read from the root
2101 * entry, write the new value out.
2103 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2104 SlapReply rs = {REP_RESULT};
2105 syncprov_checkpoint( op, &rs, on );
2108 op->o_bd->bd_info = (BackendInfo *)on;
2112 /* Write the current contextCSN into the underlying db.
2119 slap_overinst *on = (slap_overinst *) be->bd_info;
2120 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2123 if ( si->si_numops ) {
2125 char opbuf[OPERATION_BUFFER_SIZE];
2126 Operation *op = (Operation *)opbuf;
2127 SlapReply rs = {REP_RESULT};
2129 connection_fake_init( &conn, op, thrctx );
2131 op->o_dn = be->be_rootdn;
2132 op->o_ndn = be->be_rootndn;
2133 syncprov_checkpoint( op, &rs, on );
2135 for ( i=0; thrctx[i].key; i++) {
2136 if ( thrctx[i].xfree )
2137 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2138 thrctx[i].key = NULL;
2149 slap_overinst *on = (slap_overinst *)be->bd_info;
2150 syncprov_info_t *si;
2152 si = ch_calloc(1, sizeof(syncprov_info_t));
2153 on->on_bi.bi_private = si;
2154 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2155 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2156 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2157 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2159 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2160 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2162 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2163 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2169 syncprov_db_destroy(
2173 slap_overinst *on = (slap_overinst *)be->bd_info;
2174 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2177 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2178 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2179 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2186 static int syncprov_parseCtrl (
2195 struct berval cookie = BER_BVNULL;
2199 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2200 rs->sr_text = "Sync control specified multiple times";
2201 return LDAP_PROTOCOL_ERROR;
2204 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2205 rs->sr_text = "Sync control specified with pagedResults control";
2206 return LDAP_PROTOCOL_ERROR;
2209 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2210 rs->sr_text = "Sync control value is empty (or absent)";
2211 return LDAP_PROTOCOL_ERROR;
2214 /* Parse the control value
2215 * syncRequestValue ::= SEQUENCE {
2220 * refreshAndPersist (3)
2222 * cookie syncCookie OPTIONAL
2226 ber = ber_init( &ctrl->ldctl_value );
2228 rs->sr_text = "internal error";
2232 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2233 rs->sr_text = "Sync control : mode decoding error";
2234 return LDAP_PROTOCOL_ERROR;
2238 case LDAP_SYNC_REFRESH_ONLY:
2239 mode = SLAP_SYNC_REFRESH;
2241 case LDAP_SYNC_REFRESH_AND_PERSIST:
2242 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2245 rs->sr_text = "Sync control : unknown update mode";
2246 return LDAP_PROTOCOL_ERROR;
2249 tag = ber_peek_tag( ber, &len );
2251 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2252 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2253 rs->sr_text = "Sync control : cookie decoding error";
2254 return LDAP_PROTOCOL_ERROR;
2257 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2258 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2259 rs->sr_text = "Sync control : rhint decoding error";
2260 return LDAP_PROTOCOL_ERROR;
2263 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2264 rs->sr_text = "Sync control : decoding error";
2265 return LDAP_PROTOCOL_ERROR;
2267 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2268 sr->sr_rhint = rhint;
2269 if (!BER_BVISNULL(&cookie)) {
2270 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2271 slap_parse_sync_cookie( &sr->sr_state );
2274 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2276 (void) ber_free( ber, 1 );
2278 op->o_sync = ctrl->ldctl_iscritical
2279 ? SLAP_CONTROL_CRITICAL
2280 : SLAP_CONTROL_NONCRITICAL;
2282 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2284 return LDAP_SUCCESS;
2287 /* This overlay is set up for dynamic loading via moduleload. For static
2288 * configuration, you'll need to arrange for the slap_overinst to be
2289 * initialized and registered by some other function inside slapd.
2292 static slap_overinst syncprov;
2299 rc = register_supported_control( LDAP_CONTROL_SYNC,
2300 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2301 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2302 if ( rc != LDAP_SUCCESS ) {
2303 fprintf( stderr, "Failed to register control %d\n", rc );
2307 syncprov.on_bi.bi_type = "syncprov";
2308 syncprov.on_bi.bi_db_init = syncprov_db_init;
2309 syncprov.on_bi.bi_db_config = syncprov_db_config;
2310 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2311 syncprov.on_bi.bi_db_open = syncprov_db_open;
2312 syncprov.on_bi.bi_db_close = syncprov_db_close;
2314 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2315 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2317 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2318 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2319 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2320 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2321 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2322 syncprov.on_bi.bi_op_search = syncprov_op_search;
2323 syncprov.on_bi.bi_extended = syncprov_op_extended;
2324 syncprov.on_bi.bi_operational = syncprov_operational;
2326 return overlay_register( &syncprov );
2329 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2331 init_module( int argc, char *argv[] )
2333 return syncprov_init();
2335 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2337 #endif /* defined(SLAPD_OVER_SYNCPROV) */