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 AttributeAssertion eq;
608 int i, rc = LDAP_SUCCESS;
609 fpres_cookie pcookie;
612 if ( mode != FIND_MAXCSN ) {
613 srs = op->o_controls[slap_cids.sc_LDAPsync];
615 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
621 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
625 cf.f_av_desc = slap_schema.si_ad_entryCSN;
628 fop.o_callback = &cb;
629 fop.ors_limit = NULL;
630 fop.ors_tlimit = SLAP_NO_LIMIT;
631 fop.ors_filter = &cf;
632 fop.ors_filterstr = fbuf;
636 cf.f_choice = LDAP_FILTER_GE;
637 cf.f_av_value = si->si_ctxcsn;
638 fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)",
639 cf.f_av_value.bv_val );
640 fop.ors_attrsonly = 0;
641 fop.ors_attrs = csn_anlist;
642 fop.ors_slimit = SLAP_NO_LIMIT;
643 cb.sc_private = &maxcsn;
644 cb.sc_response = findmax_cb;
645 strcpy( cbuf, si->si_ctxcsn.bv_val );
646 maxcsn.bv_val = cbuf;
647 maxcsn.bv_len = si->si_ctxcsn.bv_len;
650 cf.f_choice = LDAP_FILTER_LE;
651 cf.f_av_value = srs->sr_state.ctxcsn;
652 fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
653 cf.f_av_value.bv_val );
654 fop.ors_attrsonly = 1;
655 fop.ors_attrs = slap_anlist_no_attrs;
657 cb.sc_private = NULL;
658 cb.sc_response = findcsn_cb;
661 af.f_choice = LDAP_FILTER_AND;
664 cf.f_choice = LDAP_FILTER_LE;
665 cf.f_av_value = srs->sr_state.ctxcsn;
666 cf.f_next = op->ors_filter;
667 fop.ors_filter = ⁡
668 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
669 fop.ors_attrsonly = 0;
670 fop.ors_attrs = uuid_anlist;
671 fop.ors_slimit = SLAP_NO_LIMIT;
672 /* We want pure entries, not referrals */
673 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
674 cb.sc_private = &pcookie;
675 cb.sc_response = findpres_cb;
678 /* preallocate storage for a full set */
679 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
680 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
682 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
683 pcookie.uuids[0].bv_val = pcookie.last;
684 pcookie.uuids[0].bv_len = UUID_LEN;
685 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
686 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
687 pcookie.uuids[i].bv_len = UUID_LEN;
692 fop.o_bd->bd_info = on->on_info->oi_orig;
693 fop.o_bd->be_search( &fop, &frs );
694 fop.o_bd->bd_info = (BackendInfo *)on;
698 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
699 si->si_ctxcsn.bv_len = maxcsn.bv_len;
702 /* If matching CSN was not found, invalidate the context. */
703 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
706 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
707 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
714 /* Queue a persistent search response if still in Refresh stage */
716 syncprov_qresp( opcookie *opc, syncops *so, int mode )
720 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
721 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
723 sr->s_dn.bv_val = (char *)(sr + 1);
725 sr->s_isreference = opc->sreference;
726 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
727 *(sr->s_ndn.bv_val++) = '\0';
728 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
729 *(sr->s_uuid.bv_val++) = '\0';
730 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
735 so->s_restail->s_next = sr;
738 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
742 /* Send a persistent search response */
744 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry *e, int mode, int queue )
746 slap_overinst *on = opc->son;
747 syncprov_info_t *si = on->on_bi.bi_private;
749 SlapReply rs = { REP_SEARCH };
750 LDAPControl *ctrls[2];
751 struct berval cookie;
753 Attribute a_uuid = {0};
754 Operation sop = *so->s_op;
759 sop.o_tmpmemctx = op->o_tmpmemctx;
761 sop.o_controls = op->o_controls;
763 if ( queue && (so->s_flags & PS_IS_REFRESHING) ) {
764 ldap_pvt_thread_mutex_lock( &so->s_mutex );
765 if ( so->s_flags & PS_IS_REFRESHING )
766 return syncprov_qresp( opc, so, mode );
767 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
771 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
773 e_uuid.e_attrs = &a_uuid;
774 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
775 a_uuid.a_nvals = &opc->suuid;
776 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
777 mode, ctrls, 0, 1, &cookie );
783 if ( opc->sreference ) {
784 rs.sr_ref = get_entry_referrals( &sop, e );
785 send_search_reference( &sop, &rs );
786 ber_bvarray_free( rs.sr_ref );
790 case LDAP_SYNC_MODIFY:
791 rs.sr_attrs = sop.ors_attrs;
792 send_search_entry( &sop, &rs );
794 case LDAP_SYNC_DELETE:
795 e_uuid.e_attrs = NULL;
796 e_uuid.e_name = opc->sdn;
797 e_uuid.e_nname = opc->sndn;
798 rs.sr_entry = &e_uuid;
799 if ( opc->sreference ) {
800 struct berval bv = BER_BVNULL;
802 send_search_reference( &sop, &rs );
804 send_search_entry( &sop, &rs );
810 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
816 syncprov_free_syncop( syncops *so )
818 syncres *sr, *srnext;
819 GroupAssertion *ga, *gnext;
821 ldap_pvt_thread_mutex_lock( &so->s_mutex );
823 if ( so->s_inuse > 0 ) {
824 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
827 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
828 if ( so->s_flags & PS_IS_DETACHED ) {
829 filter_free( so->s_op->ors_filter );
830 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
836 ch_free( so->s_base.bv_val );
837 for ( sr=so->s_res; sr; sr=srnext ) {
841 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
846 syncprov_drop_psearch( syncops *so, int lock )
848 if ( so->s_flags & PS_IS_DETACHED ) {
850 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
851 so->s_op->o_conn->c_n_ops_executing--;
852 so->s_op->o_conn->c_n_ops_completed++;
853 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
856 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
858 syncprov_free_syncop( so );
862 syncprov_op_abandon( Operation *op, SlapReply *rs )
864 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
865 syncprov_info_t *si = on->on_bi.bi_private;
866 syncops *so, *soprev;
868 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
869 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
870 soprev=so, so=so->s_next ) {
871 if ( so->s_op->o_connid == op->o_connid &&
872 so->s_op->o_msgid == op->orn_msgid ) {
873 so->s_op->o_abandon = 1;
874 soprev->s_next = so->s_next;
878 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
880 /* Is this really a Cancel exop? */
881 if ( op->o_tag != LDAP_REQ_ABANDON ) {
882 rs->sr_err = LDAP_CANCELLED;
883 send_ldap_result( so->s_op, rs );
885 syncprov_drop_psearch( so, 0 );
887 return SLAP_CB_CONTINUE;
890 /* Find which persistent searches are affected by this operation */
892 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
894 slap_overinst *on = opc->son;
895 syncprov_info_t *si = on->on_bi.bi_private;
898 syncops *ss, *sprev, *snext;
905 fc.fdn = &op->o_req_ndn;
907 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
909 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
910 else dnParent( fc.fdn, &pdn );
911 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
915 if ( op->o_tag != LDAP_REQ_ADD ) {
916 op->o_bd->bd_info = (BackendInfo *)on->on_info;
917 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
918 op->o_bd->bd_info = (BackendInfo *)on;
925 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
926 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
927 opc->sreference = is_entry_referral( e );
929 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
930 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
932 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
935 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
936 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
937 sprev = ss, ss=snext)
948 /* If the base of the search is missing, signal a refresh */
949 rc = syncprov_findbase( op, &fc );
950 if ( rc != LDAP_SUCCESS ) {
951 SlapReply rs = {REP_RESULT};
952 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
953 "search base has changed" );
954 sprev->s_next = snext;
955 syncprov_drop_psearch( ss, 1 );
959 /* If we're sending results now, look for this op in old matches */
962 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
963 old=sm, sm=sm->sm_next ) {
964 if ( sm->sm_op == ss ) {
966 old->sm_next = sm->sm_next;
967 op->o_tmpfree( sm, op->o_tmpmemctx );
973 /* check if current o_req_dn is in scope and matches filter */
974 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
975 LDAP_COMPARE_TRUE ) {
977 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
978 sm->sm_next = opc->smatches;
983 /* if found send UPDATE else send ADD */
984 syncprov_sendresp( op, opc, ss, e,
985 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
987 } else if ( !saveit && found ) {
989 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
992 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
994 if ( op->o_tag != LDAP_REQ_ADD ) {
995 op->o_bd->bd_info = (BackendInfo *)on->on_info;
996 be_entry_release_rw( op, e, 0 );
997 op->o_bd->bd_info = (BackendInfo *)on;
1000 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1005 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1007 slap_callback *cb = op->o_callback;
1008 opcookie *opc = cb->sc_private;
1009 slap_overinst *on = opc->son;
1010 syncprov_info_t *si = on->on_bi.bi_private;
1011 syncmatches *sm, *snext;
1012 modtarget *mt, mtdummy;
1014 for (sm = opc->smatches; sm; sm=snext) {
1015 snext = sm->sm_next;
1016 syncprov_free_syncop( sm->sm_op );
1017 op->o_tmpfree( sm, op->o_tmpmemctx );
1020 /* Remove op from lock table */
1022 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1023 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1024 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1026 modinst *mi = mt->mt_mods;
1028 /* If there are more, promote the next one */
1029 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1030 if ( mi->mi_next ) {
1031 mt->mt_mods = mi->mi_next;
1032 mt->mt_op = mt->mt_mods->mi_op;
1033 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1035 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1036 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1037 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1038 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1039 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1043 if ( !BER_BVISNULL( &opc->suuid ))
1044 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1045 if ( !BER_BVISNULL( &opc->sndn ))
1046 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1047 if ( !BER_BVISNULL( &opc->sdn ))
1048 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1049 op->o_callback = cb->sc_next;
1050 op->o_tmpfree(cb, op->o_tmpmemctx);
1054 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1056 syncprov_info_t *si = on->on_bi.bi_private;
1059 struct berval bv[2];
1061 slap_callback cb = {0};
1063 mod.sml_values = bv;
1064 bv[1].bv_val = NULL;
1065 bv[0] = si->si_ctxcsn;
1066 mod.sml_nvalues = NULL;
1067 mod.sml_desc = slap_schema.si_ad_contextCSN;
1068 mod.sml_op = LDAP_MOD_REPLACE;
1069 mod.sml_next = NULL;
1071 cb.sc_response = slap_null_cb;
1073 opm.o_tag = LDAP_REQ_MODIFY;
1074 opm.o_callback = &cb;
1075 opm.orm_modlist = &mod;
1076 opm.o_req_dn = op->o_bd->be_suffix[0];
1077 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1078 orig = opm.o_bd->bd_info;
1079 opm.o_bd->bd_info = on->on_info->oi_orig;
1080 opm.o_bd->be_modify( &opm, rs );
1084 syncprov_add_slog( Operation *op, struct berval *csn )
1086 opcookie *opc = op->o_callback->sc_private;
1087 slap_overinst *on = opc->son;
1088 syncprov_info_t *si = on->on_bi.bi_private;
1094 /* Allocate a record. UUIDs are not NUL-terminated. */
1095 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1098 se->se_tag = op->o_tag;
1100 se->se_uuid.bv_val = (char *)(se+1);
1101 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1102 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1103 se->se_uuid.bv_len = opc->suuid.bv_len;
1105 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1106 se->se_csn.bv_val[csn->bv_len] = '\0';
1107 se->se_csn.bv_len = csn->bv_len;
1109 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1110 if ( sl->sl_head ) {
1111 sl->sl_tail->se_next = se;
1117 while ( sl->sl_num > sl->sl_size ) {
1119 sl->sl_head = se->se_next;
1120 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1121 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1124 if ( !sl->sl_head ) {
1128 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1132 /* Just set a flag if we found the matching entry */
1134 playlog_cb( Operation *op, SlapReply *rs )
1136 if ( rs->sr_type == REP_SEARCH ) {
1137 op->o_callback->sc_private = (void *)1;
1142 /* enter with sl->sl_mutex locked, release before returning */
1144 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1145 struct berval *oldcsn, struct berval *ctxcsn )
1147 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1148 syncprov_info_t *si = on->on_bi.bi_private;
1150 int i, j, ndel, num, nmods, mmods;
1153 if ( !sl->sl_num ) {
1154 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1162 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1163 num * UUID_LEN, op->o_tmpmemctx );
1165 uuids[0].bv_val = (char *)(uuids + num + 1);
1167 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1168 * and everything else at the end. Do this first so we can
1169 * unlock the list mutex.
1171 for ( se=sl->sl_head; se; se=se->se_next ) {
1172 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1173 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1174 if ( se->se_tag == LDAP_REQ_DELETE ) {
1181 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1182 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1183 uuids[j].bv_len = UUID_LEN;
1185 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1189 /* Zero out unused slots */
1190 for ( i=ndel; i < num - nmods; i++ )
1191 uuids[i].bv_len = 0;
1193 /* Mods must be validated to see if they belong in this delete set.
1197 /* Strip any duplicates */
1198 for ( i=0; i<nmods; i++ ) {
1199 for ( j=0; j<ndel; j++ ) {
1200 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1201 uuids[num - 1 - i].bv_len = 0;
1206 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1207 for ( j=0; j<i; j++ ) {
1208 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1209 uuids[num - 1 - i].bv_len = 0;
1218 SlapReply frs = { REP_RESULT };
1221 AttributeAssertion eq;
1222 slap_callback cb = {0};
1226 fop.o_sync_mode = 0;
1227 fop.o_callback = &cb;
1228 fop.ors_limit = NULL;
1229 fop.ors_tlimit = SLAP_NO_LIMIT;
1230 fop.ors_attrs = slap_anlist_all_attributes;
1231 fop.ors_attrsonly = 0;
1232 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1234 af.f_choice = LDAP_FILTER_AND;
1237 mf.f_choice = LDAP_FILTER_EQUALITY;
1239 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1240 mf.f_next = fop.ors_filter;
1242 fop.ors_filter = ⁡
1244 cb.sc_response = playlog_cb;
1245 fop.o_bd->bd_info = on->on_info->oi_orig;
1247 for ( i=ndel; i<num; i++ ) {
1248 if ( uuids[i].bv_len == 0 ) continue;
1250 mf.f_av_value = uuids[i];
1251 cb.sc_private = NULL;
1253 rc = fop.o_bd->be_search( &fop, &frs );
1255 /* If entry was not found, add to delete list */
1256 if ( !cb.sc_private ) {
1257 uuids[ndel++] = uuids[i];
1260 fop.o_bd->bd_info = (BackendInfo *)on;
1263 uuids[ndel].bv_val = NULL;
1264 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1269 syncprov_op_response( Operation *op, SlapReply *rs )
1271 opcookie *opc = op->o_callback->sc_private;
1272 slap_overinst *on = opc->son;
1273 syncprov_info_t *si = on->on_bi.bi_private;
1276 if ( rs->sr_err == LDAP_SUCCESS )
1278 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1279 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1281 /* Update our context CSN */
1283 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1284 slap_get_commit_csn( op, &maxcsn, &curcsn );
1285 if ( !BER_BVISNULL( &maxcsn ) ) {
1286 strcpy( cbuf, maxcsn.bv_val );
1287 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1288 strcpy( si->si_ctxcsnbuf, cbuf );
1289 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1293 /* Don't do any processing for consumer contextCSN updates */
1294 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1295 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1296 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1297 return SLAP_CB_CONTINUE;
1301 if ( si->si_chkops || si->si_chktime ) {
1303 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1307 if ( si->si_chktime &&
1308 (op->o_time - si->si_chklast >= si->si_chktime )) {
1310 si->si_chklast = op->o_time;
1313 syncprov_checkpoint( op, rs, on );
1316 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1318 opc->sctxcsn.bv_len = maxcsn.bv_len;
1319 opc->sctxcsn.bv_val = cbuf;
1321 /* Handle any persistent searches */
1325 case LDAP_REQ_MODIFY:
1326 case LDAP_REQ_MODRDN:
1327 case LDAP_REQ_EXTENDED:
1328 syncprov_matchops( op, opc, 0 );
1330 case LDAP_REQ_DELETE:
1331 /* for each match in opc->smatches:
1334 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1335 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1336 if ( sm->sm_op->s_op->o_abandon )
1338 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1339 LDAP_SYNC_DELETE, 1 );
1341 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1346 /* Add any log records */
1347 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1348 syncprov_add_slog( op, &curcsn );
1352 return SLAP_CB_CONTINUE;
1355 /* We don't use a subentry to store the context CSN any more.
1356 * We expose the current context CSN as an operational attribute
1357 * of the suffix entry.
1360 syncprov_op_compare( Operation *op, SlapReply *rs )
1362 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1363 syncprov_info_t *si = on->on_bi.bi_private;
1364 int rc = SLAP_CB_CONTINUE;
1366 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1367 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1371 struct berval bv[2];
1373 e.e_name = op->o_bd->be_suffix[0];
1374 e.e_nname = op->o_bd->be_nsuffix[0];
1376 BER_BVZERO( &bv[1] );
1377 bv[0] = si->si_ctxcsn;
1379 a.a_desc = slap_schema.si_ad_contextCSN;
1381 a.a_nvals = a.a_vals;
1383 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1385 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1386 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1387 if ( ! rs->sr_err ) {
1388 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1389 goto return_results;
1392 if ( get_assert( op ) &&
1393 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1395 rs->sr_err = LDAP_ASSERTION_FAILED;
1396 goto return_results;
1400 rs->sr_err = LDAP_COMPARE_FALSE;
1402 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1403 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1404 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1405 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1407 rs->sr_err = LDAP_COMPARE_TRUE;
1412 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1414 send_ldap_result( op, rs );
1416 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1417 rs->sr_err = LDAP_SUCCESS;
1426 syncprov_op_mod( Operation *op, SlapReply *rs )
1428 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1429 syncprov_info_t *si = on->on_bi.bi_private;
1431 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1433 (si->si_ops ? sizeof(modinst) : 0 ),
1435 opcookie *opc = (opcookie *)(cb+1);
1437 cb->sc_response = syncprov_op_response;
1438 cb->sc_cleanup = syncprov_op_cleanup;
1439 cb->sc_private = opc;
1440 cb->sc_next = op->o_callback;
1441 op->o_callback = cb;
1443 /* If there are active persistent searches, lock this operation.
1444 * See seqmod.c for the locking logic on its own.
1447 modtarget *mt, mtdummy;
1450 mi = (modinst *)(opc+1);
1453 /* See if we're already modifying this entry... */
1455 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1456 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1458 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1459 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1460 mt->mt_tail->mi_next = mi;
1462 /* wait for this op to get to head of list */
1463 while ( mt->mt_mods != mi ) {
1464 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1465 ldap_pvt_thread_yield();
1466 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1468 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1470 /* Record that we're modifying this entry now */
1471 mt = ch_malloc( sizeof(modtarget) );
1474 mt->mt_op = mi->mi_op;
1475 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1476 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1477 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1481 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1482 syncprov_matchops( op, opc, 1 );
1485 return SLAP_CB_CONTINUE;
1489 syncprov_op_extended( Operation *op, SlapReply *rs )
1491 if ( exop_is_write( op ))
1492 return syncprov_op_mod( op, rs );
1494 return SLAP_CB_CONTINUE;
1497 typedef struct searchstate {
1498 slap_overinst *ss_on;
1504 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1506 if ( rs->sr_ctrls ) {
1507 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1508 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1509 rs->sr_ctrls = NULL;
1515 syncprov_detach_op( Operation *op, syncops *so )
1521 GroupAssertion *g1, *g2;
1523 /* count the search attrs */
1524 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1525 alen += op->ors_attrs[i].an_name.bv_len + 1;
1527 /* Make a new copy of the operation */
1528 size = sizeof(Operation) + sizeof(Opheader) +
1529 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1530 op->o_req_dn.bv_len + 1 +
1531 op->o_req_ndn.bv_len + 1 +
1532 op->o_ndn.bv_len + 1 +
1533 so->s_filterstr.bv_len + 1;
1534 op2 = (Operation *)ch_calloc( 1, size );
1535 op2->o_hdr = (Opheader *)(op2+1);
1537 /* Copy the fields we care about explicitly, leave the rest alone */
1538 *op2->o_hdr = *op->o_hdr;
1539 op2->o_tag = op->o_tag;
1540 op2->o_time = op->o_time;
1541 op2->o_bd = op->o_bd;
1542 op2->o_request = op->o_request;
1545 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1546 ptr = (char *)(op2->ors_attrs+i+1);
1547 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1548 op2->ors_attrs[i] = op->ors_attrs[i];
1549 op2->ors_attrs[i].an_name.bv_val = ptr;
1550 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1552 BER_BVZERO( &op2->ors_attrs[i].an_name );
1554 ptr = (char *)(op2->o_hdr + 1);
1556 op2->o_authz = op->o_authz;
1557 op2->o_ndn.bv_val = ptr;
1558 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1559 op2->o_dn = op2->o_ndn;
1560 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1561 op2->o_req_dn.bv_val = ptr;
1562 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1563 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1564 op2->o_req_ndn.bv_val = ptr;
1565 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1566 op2->ors_filterstr.bv_val = ptr;
1567 strcpy( ptr, so->s_filterstr.bv_val );
1568 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1569 op2->ors_filter = str2filter( ptr );
1572 /* Copy any cached group ACLs individually */
1573 op2->o_groups = NULL;
1574 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1575 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1577 strcpy( g2->ga_ndn, g1->ga_ndn );
1578 g2->ga_next = op2->o_groups;
1582 /* Add op2 to conn so abandon will find us */
1583 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1584 op->o_conn->c_n_ops_executing++;
1585 op->o_conn->c_n_ops_completed--;
1586 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1587 so->s_flags |= PS_IS_DETACHED;
1588 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1592 syncprov_search_response( Operation *op, SlapReply *rs )
1594 searchstate *ss = op->o_callback->sc_private;
1595 slap_overinst *on = ss->ss_on;
1596 syncprov_info_t *si = on->on_bi.bi_private;
1597 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1599 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1601 /* If we got a referral without a referral object, there's
1602 * something missing that we cannot replicate. Just ignore it.
1603 * The consumer will abort because we didn't send the expected
1606 if ( !rs->sr_entry ) {
1607 assert( rs->sr_entry );
1608 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1609 return SLAP_CB_CONTINUE;
1611 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1612 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1613 slap_schema.si_ad_entryCSN );
1615 /* Don't send the ctx entry twice */
1616 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1617 return LDAP_SUCCESS;
1619 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1621 rs->sr_ctrls[1] = NULL;
1622 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1623 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1624 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1625 struct berval cookie;
1627 slap_compose_sync_cookie( op, &cookie,
1628 &op->ors_filter->f_and->f_ava->aa_value,
1629 srs->sr_state.rid );
1631 /* Is this a regular refresh? */
1633 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1635 rs->sr_ctrls[1] = NULL;
1636 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1637 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1638 LDAP_SYNC_REFRESH_DELETES );
1641 /* It's RefreshAndPersist, transition to Persist phase */
1642 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1643 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1644 &cookie, 1, NULL, 0 );
1645 /* Flush any queued persist messages */
1646 if ( ss->ss_so->s_res ) {
1647 syncres *sr, *srnext;
1652 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1654 for (sr = ss->ss_so->s_res; sr; sr=srnext) {
1655 int rc = LDAP_SUCCESS;
1656 srnext = sr->s_next;
1658 opc.sndn = sr->s_ndn;
1659 opc.suuid = sr->s_uuid;
1660 opc.sctxcsn = sr->s_csn;
1661 opc.sreference = sr->s_isreference;
1664 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
1665 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1666 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
1667 op->o_bd->bd_info = (BackendInfo *)on;
1669 if ( rc == LDAP_SUCCESS )
1670 syncprov_sendresp( op, &opc, ss->ss_so, e,
1674 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1675 be_entry_release_rw( op, e, 0 );
1676 op->o_bd->bd_info = (BackendInfo *)on;
1680 ss->ss_so->s_res = NULL;
1681 ss->ss_so->s_restail = NULL;
1684 /* Turn off the refreshing flag */
1685 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1687 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1689 /* Detach this Op from frontend control */
1690 syncprov_detach_op( op, ss->ss_so );
1692 return LDAP_SUCCESS;
1696 return SLAP_CB_CONTINUE;
1700 syncprov_op_search( Operation *op, SlapReply *rs )
1702 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1703 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1705 int gotstate = 0, nochange = 0, do_present = 1;
1706 Filter *fand, *fava;
1707 syncops *sop = NULL;
1710 struct berval ctxcsn;
1711 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1713 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1715 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1716 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1720 srs = op->o_controls[slap_cids.sc_LDAPsync];
1722 /* If this is a persistent search, set it up right away */
1723 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1733 so.s_flags = PS_IS_REFRESHING;
1734 /* syncprov_findbase expects to be called as a callback... */
1735 sc.sc_private = &opc;
1737 cb = op->o_callback;
1738 op->o_callback = ≻
1739 rs->sr_err = syncprov_findbase( op, &fc );
1740 op->o_callback = cb;
1742 if ( rs->sr_err != LDAP_SUCCESS ) {
1743 send_ldap_result( op, rs );
1746 sop = ch_malloc( sizeof( syncops ));
1748 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1749 sop->s_rid = srs->sr_state.rid;
1752 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1753 sop->s_next = si->si_ops;
1755 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1758 /* snapshot the ctxcsn */
1759 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1760 strcpy( csnbuf, si->si_ctxcsnbuf );
1761 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1762 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1763 ctxcsn.bv_val = csnbuf;
1765 /* If we have a cookie, handle the PRESENT lookups */
1766 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1769 /* The cookie was validated when it was parsed, just use it */
1771 /* If just Refreshing and nothing has changed, shortcut it */
1772 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1774 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1775 LDAPControl *ctrls[2];
1779 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1780 NULL, LDAP_SYNC_REFRESH_DELETES );
1781 rs->sr_ctrls = ctrls;
1782 rs->sr_err = LDAP_SUCCESS;
1783 send_ldap_result( op, rs );
1784 rs->sr_ctrls = NULL;
1789 /* Do we have a sessionlog for this search? */
1792 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1793 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1795 /* mutex is unlocked in playlog */
1796 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1798 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1801 /* Is the CSN still present in the database? */
1802 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1803 /* No, so a reload is required */
1804 #if 0 /* the consumer doesn't seem to send this hint */
1805 if ( op->o_sync_rhint == 0 ) {
1806 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1812 /* If changed and doing Present lookup, send Present UUIDs */
1813 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1815 send_ldap_result( op, rs );
1822 /* Append CSN range to search filter, save original filter
1823 * for persistent search evaluation
1826 sop->s_filterstr= op->ors_filterstr;
1829 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1830 fand->f_choice = LDAP_FILTER_AND;
1831 fand->f_next = NULL;
1832 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1833 fava->f_choice = LDAP_FILTER_LE;
1834 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1835 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1836 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1839 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1840 fava = fava->f_next;
1841 fava->f_choice = LDAP_FILTER_GE;
1842 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1843 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1844 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1846 fava->f_next = op->ors_filter;
1847 op->ors_filter = fand;
1848 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1850 /* Let our callback add needed info to returned entries */
1851 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1852 ss = (searchstate *)(cb+1);
1855 ss->ss_present = do_present;
1856 cb->sc_response = syncprov_search_response;
1857 cb->sc_cleanup = syncprov_search_cleanup;
1858 cb->sc_private = ss;
1859 cb->sc_next = op->o_callback;
1860 op->o_callback = cb;
1862 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1863 op->o_sync_mode &= SLAP_CONTROL_MASK;
1866 /* If this is a persistent search and no changes were reported during
1867 * the refresh phase, just invoke the response callback to transition
1868 * us into persist phase
1871 rs->sr_err = LDAP_SUCCESS;
1872 rs->sr_nentries = 0;
1873 send_ldap_result( op, rs );
1876 return SLAP_CB_CONTINUE;
1880 syncprov_operational(
1884 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1885 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1887 if ( rs->sr_entry &&
1888 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1890 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1891 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1892 Attribute *a, **ap = NULL;
1894 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1895 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1900 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1902 a = ch_malloc( sizeof(Attribute));
1903 a->a_desc = slap_schema.si_ad_contextCSN;
1904 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1905 a->a_vals[1].bv_val = NULL;
1906 a->a_nvals = a->a_vals;
1912 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1914 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1916 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1918 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1921 return SLAP_CB_CONTINUE;
1933 slap_overinst *on = (slap_overinst *)be->bd_info;
1934 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1936 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1938 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1939 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1942 si->si_chkops = atoi( argv[1] );
1943 si->si_chktime = atoi( argv[2] ) * 60;
1946 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
1950 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1951 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
1954 size = atoi( argv[1] );
1957 "%s: line %d: session log size %d is negative\n",
1958 fname, lineno, size );
1963 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
1964 sl->sl_mincsn.bv_val = (char *)(sl+1);
1965 sl->sl_mincsn.bv_len = 0;
1967 sl->sl_head = sl->sl_tail = NULL;
1968 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
1975 return SLAP_CONF_UNKNOWN;
1978 /* Cheating - we have no thread pool context for these functions,
1981 typedef struct thread_keys {
1984 ldap_pvt_thread_pool_keyfree_t *xfree;
1988 /* A fake thread context */
1989 static thread_keys thrctx[MAXKEYS];
1991 /* Read any existing contextCSN from the underlying db.
1992 * Then search for any entries newer than that. If no value exists,
1993 * just generate it. Cache whatever result.
2000 slap_overinst *on = (slap_overinst *) be->bd_info;
2001 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2004 char opbuf[OPERATION_BUFFER_SIZE];
2005 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2006 Operation *op = (Operation *)opbuf;
2011 connection_fake_init( &conn, op, thrctx );
2013 op->o_dn = be->be_rootdn;
2014 op->o_ndn = be->be_rootndn;
2016 ctxcsnbuf[0] = '\0';
2018 op->o_bd->bd_info = on->on_info->oi_orig;
2019 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2020 slap_schema.si_ad_contextCSN, 0, &e );
2023 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2025 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2026 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2027 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2028 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2029 si->si_ctxcsn.bv_len );
2030 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2031 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2033 be_entry_release_rw( op, e, 0 );
2034 op->o_bd->bd_info = (BackendInfo *)on;
2035 op->o_req_dn = be->be_suffix[0];
2036 op->o_req_ndn = be->be_nsuffix[0];
2037 op->ors_scope = LDAP_SCOPE_SUBTREE;
2038 syncprov_findcsn( op, FIND_MAXCSN );
2041 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2042 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2043 &si->si_ctxcsn, 0 );
2046 /* If our ctxcsn is different from what was read from the root
2047 * entry, write the new value out.
2049 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2050 SlapReply rs = {REP_RESULT};
2051 syncprov_checkpoint( op, &rs, on );
2054 op->o_bd->bd_info = (BackendInfo *)on;
2058 /* Write the current contextCSN into the underlying db.
2065 slap_overinst *on = (slap_overinst *) be->bd_info;
2066 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2069 if ( si->si_numops ) {
2071 char opbuf[OPERATION_BUFFER_SIZE];
2072 Operation *op = (Operation *)opbuf;
2073 SlapReply rs = {REP_RESULT};
2075 connection_fake_init( &conn, op, thrctx );
2077 op->o_dn = be->be_rootdn;
2078 op->o_ndn = be->be_rootndn;
2079 syncprov_checkpoint( op, &rs, on );
2081 for ( i=0; thrctx[i].key; i++) {
2082 if ( thrctx[i].xfree )
2083 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2084 thrctx[i].key = NULL;
2095 slap_overinst *on = (slap_overinst *)be->bd_info;
2096 syncprov_info_t *si;
2098 si = ch_calloc(1, sizeof(syncprov_info_t));
2099 on->on_bi.bi_private = si;
2100 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2101 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2102 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2103 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2105 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2106 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2108 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2109 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2115 syncprov_db_destroy(
2119 slap_overinst *on = (slap_overinst *)be->bd_info;
2120 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2123 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2124 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2125 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2132 static int syncprov_parseCtrl (
2141 struct berval cookie = BER_BVNULL;
2145 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2146 rs->sr_text = "Sync control specified multiple times";
2147 return LDAP_PROTOCOL_ERROR;
2150 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2151 rs->sr_text = "Sync control specified with pagedResults control";
2152 return LDAP_PROTOCOL_ERROR;
2155 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2156 rs->sr_text = "Sync control value is empty (or absent)";
2157 return LDAP_PROTOCOL_ERROR;
2160 /* Parse the control value
2161 * syncRequestValue ::= SEQUENCE {
2166 * refreshAndPersist (3)
2168 * cookie syncCookie OPTIONAL
2172 ber = ber_init( &ctrl->ldctl_value );
2174 rs->sr_text = "internal error";
2178 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2179 rs->sr_text = "Sync control : mode decoding error";
2180 return LDAP_PROTOCOL_ERROR;
2184 case LDAP_SYNC_REFRESH_ONLY:
2185 mode = SLAP_SYNC_REFRESH;
2187 case LDAP_SYNC_REFRESH_AND_PERSIST:
2188 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2191 rs->sr_text = "Sync control : unknown update mode";
2192 return LDAP_PROTOCOL_ERROR;
2195 tag = ber_peek_tag( ber, &len );
2197 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2198 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2199 rs->sr_text = "Sync control : cookie decoding error";
2200 return LDAP_PROTOCOL_ERROR;
2203 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2204 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2205 rs->sr_text = "Sync control : rhint decoding error";
2206 return LDAP_PROTOCOL_ERROR;
2209 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2210 rs->sr_text = "Sync control : decoding error";
2211 return LDAP_PROTOCOL_ERROR;
2213 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2214 sr->sr_rhint = rhint;
2215 if (!BER_BVISNULL(&cookie)) {
2216 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2217 slap_parse_sync_cookie( &sr->sr_state );
2220 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2222 (void) ber_free( ber, 1 );
2224 op->o_sync = ctrl->ldctl_iscritical
2225 ? SLAP_CONTROL_CRITICAL
2226 : SLAP_CONTROL_NONCRITICAL;
2228 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2230 return LDAP_SUCCESS;
2233 /* This overlay is set up for dynamic loading via moduleload. For static
2234 * configuration, you'll need to arrange for the slap_overinst to be
2235 * initialized and registered by some other function inside slapd.
2238 static slap_overinst syncprov;
2245 rc = register_supported_control( LDAP_CONTROL_SYNC,
2246 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2247 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2248 if ( rc != LDAP_SUCCESS ) {
2249 fprintf( stderr, "Failed to register control %d\n", rc );
2253 syncprov.on_bi.bi_type = "syncprov";
2254 syncprov.on_bi.bi_db_init = syncprov_db_init;
2255 syncprov.on_bi.bi_db_config = syncprov_db_config;
2256 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2257 syncprov.on_bi.bi_db_open = syncprov_db_open;
2258 syncprov.on_bi.bi_db_close = syncprov_db_close;
2260 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2261 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2263 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2264 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2265 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2266 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2267 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2268 syncprov.on_bi.bi_op_search = syncprov_op_search;
2269 syncprov.on_bi.bi_extended = syncprov_op_extended;
2270 syncprov.on_bi.bi_operational = syncprov_operational;
2272 return overlay_register( &syncprov );
2275 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2277 init_module( int argc, char *argv[] )
2279 return syncprov_init();
2281 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2283 #endif /* defined(SLAPD_OVER_SYNCPROV) */