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;
924 /* Never replicate these */
925 if ( is_entry_syncConsumerSubentry( e )) {
929 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
930 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
931 opc->sreference = is_entry_referral( e );
933 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
934 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
936 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
939 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
940 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
941 sprev = ss, ss=snext)
952 /* If the base of the search is missing, signal a refresh */
953 rc = syncprov_findbase( op, &fc );
954 if ( rc != LDAP_SUCCESS ) {
955 SlapReply rs = {REP_RESULT};
956 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
957 "search base has changed" );
958 sprev->s_next = snext;
959 syncprov_drop_psearch( ss, 1 );
963 /* If we're sending results now, look for this op in old matches */
966 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
967 old=sm, sm=sm->sm_next ) {
968 if ( sm->sm_op == ss ) {
970 old->sm_next = sm->sm_next;
971 op->o_tmpfree( sm, op->o_tmpmemctx );
977 /* check if current o_req_dn is in scope and matches filter */
978 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
979 LDAP_COMPARE_TRUE ) {
981 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
982 sm->sm_next = opc->smatches;
987 /* if found send UPDATE else send ADD */
988 syncprov_sendresp( op, opc, ss, e,
989 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
991 } else if ( !saveit && found ) {
993 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
996 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
998 if ( op->o_tag != LDAP_REQ_ADD ) {
999 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1000 be_entry_release_rw( op, e, 0 );
1001 op->o_bd->bd_info = (BackendInfo *)on;
1004 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1009 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1011 slap_callback *cb = op->o_callback;
1012 opcookie *opc = cb->sc_private;
1013 slap_overinst *on = opc->son;
1014 syncprov_info_t *si = on->on_bi.bi_private;
1015 syncmatches *sm, *snext;
1016 modtarget *mt, mtdummy;
1018 for (sm = opc->smatches; sm; sm=snext) {
1019 snext = sm->sm_next;
1020 syncprov_free_syncop( sm->sm_op );
1021 op->o_tmpfree( sm, op->o_tmpmemctx );
1024 /* Remove op from lock table */
1026 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1027 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1028 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1030 modinst *mi = mt->mt_mods;
1032 /* If there are more, promote the next one */
1033 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1034 if ( mi->mi_next ) {
1035 mt->mt_mods = mi->mi_next;
1036 mt->mt_op = mt->mt_mods->mi_op;
1037 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1039 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1040 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1041 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1042 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1043 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1047 if ( !BER_BVISNULL( &opc->suuid ))
1048 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1049 if ( !BER_BVISNULL( &opc->sndn ))
1050 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1051 if ( !BER_BVISNULL( &opc->sdn ))
1052 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1053 op->o_callback = cb->sc_next;
1054 op->o_tmpfree(cb, op->o_tmpmemctx);
1058 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1060 syncprov_info_t *si = on->on_bi.bi_private;
1063 struct berval bv[2];
1065 slap_callback cb = {0};
1067 mod.sml_values = bv;
1068 bv[1].bv_val = NULL;
1069 bv[0] = si->si_ctxcsn;
1070 mod.sml_nvalues = NULL;
1071 mod.sml_desc = slap_schema.si_ad_contextCSN;
1072 mod.sml_op = LDAP_MOD_REPLACE;
1073 mod.sml_next = NULL;
1075 cb.sc_response = slap_null_cb;
1077 opm.o_tag = LDAP_REQ_MODIFY;
1078 opm.o_callback = &cb;
1079 opm.orm_modlist = &mod;
1080 opm.o_req_dn = op->o_bd->be_suffix[0];
1081 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1082 orig = opm.o_bd->bd_info;
1083 opm.o_bd->bd_info = on->on_info->oi_orig;
1084 opm.o_bd->be_modify( &opm, rs );
1088 syncprov_add_slog( Operation *op, struct berval *csn )
1090 opcookie *opc = op->o_callback->sc_private;
1091 slap_overinst *on = opc->son;
1092 syncprov_info_t *si = on->on_bi.bi_private;
1098 /* Allocate a record. UUIDs are not NUL-terminated. */
1099 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1102 se->se_tag = op->o_tag;
1104 se->se_uuid.bv_val = (char *)(se+1);
1105 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1106 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1107 se->se_uuid.bv_len = opc->suuid.bv_len;
1109 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1110 se->se_csn.bv_val[csn->bv_len] = '\0';
1111 se->se_csn.bv_len = csn->bv_len;
1113 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1114 if ( sl->sl_head ) {
1115 sl->sl_tail->se_next = se;
1121 while ( sl->sl_num > sl->sl_size ) {
1123 sl->sl_head = se->se_next;
1124 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1125 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1128 if ( !sl->sl_head ) {
1132 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1136 /* Just set a flag if we found the matching entry */
1138 playlog_cb( Operation *op, SlapReply *rs )
1140 if ( rs->sr_type == REP_SEARCH ) {
1141 op->o_callback->sc_private = (void *)1;
1146 /* enter with sl->sl_mutex locked, release before returning */
1148 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1149 struct berval *oldcsn, struct berval *ctxcsn )
1151 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1152 syncprov_info_t *si = on->on_bi.bi_private;
1154 int i, j, ndel, num, nmods, mmods;
1157 if ( !sl->sl_num ) {
1158 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1166 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1167 num * UUID_LEN, op->o_tmpmemctx );
1169 uuids[0].bv_val = (char *)(uuids + num + 1);
1171 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1172 * and everything else at the end. Do this first so we can
1173 * unlock the list mutex.
1175 for ( se=sl->sl_head; se; se=se->se_next ) {
1176 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1177 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1178 if ( se->se_tag == LDAP_REQ_DELETE ) {
1185 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1186 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1187 uuids[j].bv_len = UUID_LEN;
1189 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1193 /* Zero out unused slots */
1194 for ( i=ndel; i < num - nmods; i++ )
1195 uuids[i].bv_len = 0;
1197 /* Mods must be validated to see if they belong in this delete set.
1201 /* Strip any duplicates */
1202 for ( i=0; i<nmods; i++ ) {
1203 for ( j=0; j<ndel; j++ ) {
1204 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1205 uuids[num - 1 - i].bv_len = 0;
1210 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1211 for ( j=0; j<i; j++ ) {
1212 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1213 uuids[num - 1 - i].bv_len = 0;
1222 SlapReply frs = { REP_RESULT };
1225 AttributeAssertion eq;
1226 slap_callback cb = {0};
1230 fop.o_sync_mode = 0;
1231 fop.o_callback = &cb;
1232 fop.ors_limit = NULL;
1233 fop.ors_tlimit = SLAP_NO_LIMIT;
1234 fop.ors_attrs = slap_anlist_all_attributes;
1235 fop.ors_attrsonly = 0;
1236 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1238 af.f_choice = LDAP_FILTER_AND;
1241 mf.f_choice = LDAP_FILTER_EQUALITY;
1243 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1244 mf.f_next = fop.ors_filter;
1246 fop.ors_filter = ⁡
1248 cb.sc_response = playlog_cb;
1249 fop.o_bd->bd_info = on->on_info->oi_orig;
1251 for ( i=ndel; i<num; i++ ) {
1252 if ( uuids[i].bv_len == 0 ) continue;
1254 mf.f_av_value = uuids[i];
1255 cb.sc_private = NULL;
1257 rc = fop.o_bd->be_search( &fop, &frs );
1259 /* If entry was not found, add to delete list */
1260 if ( !cb.sc_private ) {
1261 uuids[ndel++] = uuids[i];
1264 fop.o_bd->bd_info = (BackendInfo *)on;
1267 uuids[ndel].bv_val = NULL;
1268 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1273 syncprov_op_response( Operation *op, SlapReply *rs )
1275 opcookie *opc = op->o_callback->sc_private;
1276 slap_overinst *on = opc->son;
1277 syncprov_info_t *si = on->on_bi.bi_private;
1280 if ( rs->sr_err == LDAP_SUCCESS )
1282 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1283 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1285 /* Update our context CSN */
1287 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1288 slap_get_commit_csn( op, &maxcsn, &curcsn );
1289 if ( !BER_BVISNULL( &maxcsn ) ) {
1290 strcpy( cbuf, maxcsn.bv_val );
1291 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1292 strcpy( si->si_ctxcsnbuf, cbuf );
1293 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1298 if ( si->si_chkops || si->si_chktime ) {
1300 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1304 if ( si->si_chktime &&
1305 (op->o_time - si->si_chklast >= si->si_chktime )) {
1307 si->si_chklast = op->o_time;
1310 syncprov_checkpoint( op, rs, on );
1313 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1315 opc->sctxcsn.bv_len = maxcsn.bv_len;
1316 opc->sctxcsn.bv_val = cbuf;
1318 /* Handle any persistent searches */
1322 case LDAP_REQ_MODIFY:
1323 case LDAP_REQ_MODRDN:
1324 case LDAP_REQ_EXTENDED:
1325 syncprov_matchops( op, opc, 0 );
1327 case LDAP_REQ_DELETE:
1328 /* for each match in opc->smatches:
1331 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1332 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1333 if ( sm->sm_op->s_op->o_abandon )
1335 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1336 LDAP_SYNC_DELETE, 1 );
1338 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1343 /* Add any log records */
1344 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1345 syncprov_add_slog( op, &curcsn );
1349 return SLAP_CB_CONTINUE;
1352 /* We don't use a subentry to store the context CSN any more.
1353 * We expose the current context CSN as an operational attribute
1354 * of the suffix entry.
1357 syncprov_op_compare( Operation *op, SlapReply *rs )
1359 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1360 syncprov_info_t *si = on->on_bi.bi_private;
1361 int rc = SLAP_CB_CONTINUE;
1363 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1364 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1368 struct berval bv[2];
1370 e.e_name = op->o_bd->be_suffix[0];
1371 e.e_nname = op->o_bd->be_nsuffix[0];
1373 BER_BVZERO( &bv[1] );
1374 bv[0] = si->si_ctxcsn;
1376 a.a_desc = slap_schema.si_ad_contextCSN;
1378 a.a_nvals = a.a_vals;
1380 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1382 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1383 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1384 if ( ! rs->sr_err ) {
1385 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1386 goto return_results;
1389 if ( get_assert( op ) &&
1390 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1392 rs->sr_err = LDAP_ASSERTION_FAILED;
1393 goto return_results;
1397 rs->sr_err = LDAP_COMPARE_FALSE;
1399 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1400 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1401 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1402 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1404 rs->sr_err = LDAP_COMPARE_TRUE;
1409 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1411 send_ldap_result( op, rs );
1413 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1414 rs->sr_err = LDAP_SUCCESS;
1423 syncprov_op_mod( Operation *op, SlapReply *rs )
1425 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1426 syncprov_info_t *si = on->on_bi.bi_private;
1428 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1430 (si->si_ops ? sizeof(modinst) : 0 ),
1432 opcookie *opc = (opcookie *)(cb+1);
1434 cb->sc_response = syncprov_op_response;
1435 cb->sc_cleanup = syncprov_op_cleanup;
1436 cb->sc_private = opc;
1437 cb->sc_next = op->o_callback;
1438 op->o_callback = cb;
1440 /* If there are active persistent searches, lock this operation.
1441 * See seqmod.c for the locking logic on its own.
1444 modtarget *mt, mtdummy;
1447 mi = (modinst *)(opc+1);
1450 /* See if we're already modifying this entry... */
1452 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1453 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1455 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1456 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1457 mt->mt_tail->mi_next = mi;
1459 /* wait for this op to get to head of list */
1460 while ( mt->mt_mods != mi ) {
1461 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1462 ldap_pvt_thread_yield();
1463 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1465 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1467 /* Record that we're modifying this entry now */
1468 mt = ch_malloc( sizeof(modtarget) );
1471 mt->mt_op = mi->mi_op;
1472 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1473 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1474 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1478 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1479 syncprov_matchops( op, opc, 1 );
1482 return SLAP_CB_CONTINUE;
1486 syncprov_op_extended( Operation *op, SlapReply *rs )
1488 if ( exop_is_write( op ))
1489 return syncprov_op_mod( op, rs );
1491 return SLAP_CB_CONTINUE;
1494 typedef struct searchstate {
1495 slap_overinst *ss_on;
1501 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1503 if ( rs->sr_ctrls ) {
1504 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1505 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1506 rs->sr_ctrls = NULL;
1512 syncprov_detach_op( Operation *op, syncops *so )
1518 GroupAssertion *g1, *g2;
1520 /* count the search attrs */
1521 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1522 alen += op->ors_attrs[i].an_name.bv_len + 1;
1524 /* Make a new copy of the operation */
1525 size = sizeof(Operation) + sizeof(Opheader) +
1526 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1527 op->o_req_dn.bv_len + 1 +
1528 op->o_req_ndn.bv_len + 1 +
1529 op->o_ndn.bv_len + 1 +
1530 so->s_filterstr.bv_len + 1;
1531 op2 = (Operation *)ch_calloc( 1, size );
1532 op2->o_hdr = (Opheader *)(op2+1);
1534 /* Copy the fields we care about explicitly, leave the rest alone */
1535 *op2->o_hdr = *op->o_hdr;
1536 op2->o_tag = op->o_tag;
1537 op2->o_time = op->o_time;
1538 op2->o_bd = op->o_bd;
1539 op2->o_request = op->o_request;
1542 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1543 ptr = (char *)(op2->ors_attrs+i+1);
1544 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1545 op2->ors_attrs[i] = op->ors_attrs[i];
1546 op2->ors_attrs[i].an_name.bv_val = ptr;
1547 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1549 BER_BVZERO( &op2->ors_attrs[i].an_name );
1551 ptr = (char *)(op2->o_hdr + 1);
1553 op2->o_authz = op->o_authz;
1554 op2->o_ndn.bv_val = ptr;
1555 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1556 op2->o_dn = op2->o_ndn;
1557 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1558 op2->o_req_dn.bv_val = ptr;
1559 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1560 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1561 op2->o_req_ndn.bv_val = ptr;
1562 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1563 op2->ors_filterstr.bv_val = ptr;
1564 strcpy( ptr, so->s_filterstr.bv_val );
1565 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1566 op2->ors_filter = str2filter( ptr );
1569 /* Copy any cached group ACLs individually */
1570 op2->o_groups = NULL;
1571 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1572 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1574 strcpy( g2->ga_ndn, g1->ga_ndn );
1575 g2->ga_next = op2->o_groups;
1579 /* Add op2 to conn so abandon will find us */
1580 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1581 op->o_conn->c_n_ops_executing++;
1582 op->o_conn->c_n_ops_completed--;
1583 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1584 so->s_flags |= PS_IS_DETACHED;
1585 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1589 syncprov_search_response( Operation *op, SlapReply *rs )
1591 searchstate *ss = op->o_callback->sc_private;
1592 slap_overinst *on = ss->ss_on;
1593 syncprov_info_t *si = on->on_bi.bi_private;
1594 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1596 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1598 /* If we got a referral without a referral object, there's
1599 * something missing that we cannot replicate. Just ignore it.
1600 * The consumer will abort because we didn't send the expected
1603 if ( !rs->sr_entry ) {
1604 assert( rs->sr_entry );
1605 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1606 return SLAP_CB_CONTINUE;
1608 if ( srs->sr_state.ctxcsn ) {
1609 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1610 slap_schema.si_ad_entryCSN );
1612 /* Don't send the ctx entry twice */
1613 if ( a && bvmatch( &a->a_nvals[0], srs->sr_state.ctxcsn ) )
1614 return LDAP_SUCCESS;
1616 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1618 rs->sr_ctrls[1] = NULL;
1619 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1620 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1621 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1622 struct berval cookie;
1624 slap_compose_sync_cookie( op, &cookie,
1625 &op->ors_filter->f_and->f_ava->aa_value,
1626 srs->sr_state.rid );
1628 /* Is this a regular refresh? */
1630 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1632 rs->sr_ctrls[1] = NULL;
1633 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1634 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1635 LDAP_SYNC_REFRESH_DELETES );
1638 /* It's RefreshAndPersist, transition to Persist phase */
1639 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1640 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1641 &cookie, 1, NULL, 0 );
1642 /* Flush any queued persist messages */
1643 if ( ss->ss_so->s_res ) {
1644 syncres *sr, *srnext;
1649 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1651 for (sr = ss->ss_so->s_res; sr; sr=srnext) {
1652 int rc = LDAP_SUCCESS;
1653 srnext = sr->s_next;
1655 opc.sndn = sr->s_ndn;
1656 opc.suuid = sr->s_uuid;
1657 opc.sctxcsn = sr->s_csn;
1658 opc.sreference = sr->s_isreference;
1661 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
1662 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1663 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
1664 op->o_bd->bd_info = (BackendInfo *)on;
1666 if ( rc == LDAP_SUCCESS )
1667 syncprov_sendresp( op, &opc, ss->ss_so, e,
1671 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1672 be_entry_release_rw( op, e, 0 );
1673 op->o_bd->bd_info = (BackendInfo *)on;
1677 ss->ss_so->s_res = NULL;
1678 ss->ss_so->s_restail = NULL;
1681 /* Turn off the refreshing flag */
1682 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1684 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1686 /* Detach this Op from frontend control */
1687 syncprov_detach_op( op, ss->ss_so );
1689 return LDAP_SUCCESS;
1693 return SLAP_CB_CONTINUE;
1697 syncprov_op_search( Operation *op, SlapReply *rs )
1699 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1700 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1702 int gotstate = 0, nochange = 0, do_present = 1;
1703 Filter *fand, *fava;
1704 syncops *sop = NULL;
1707 struct berval ctxcsn;
1708 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1710 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1712 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1713 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1717 srs = op->o_controls[slap_cids.sc_LDAPsync];
1719 /* If this is a persistent search, set it up right away */
1720 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1730 so.s_flags = PS_IS_REFRESHING;
1731 /* syncprov_findbase expects to be called as a callback... */
1732 sc.sc_private = &opc;
1734 cb = op->o_callback;
1735 op->o_callback = ≻
1736 rs->sr_err = syncprov_findbase( op, &fc );
1737 op->o_callback = cb;
1739 if ( rs->sr_err != LDAP_SUCCESS ) {
1740 send_ldap_result( op, rs );
1743 sop = ch_malloc( sizeof( syncops ));
1745 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1746 sop->s_rid = srs->sr_state.rid;
1749 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1750 sop->s_next = si->si_ops;
1752 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1755 /* snapshot the ctxcsn */
1756 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1757 strcpy( csnbuf, si->si_ctxcsnbuf );
1758 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1759 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1760 ctxcsn.bv_val = csnbuf;
1762 /* If we have a cookie, handle the PRESENT lookups */
1763 if ( srs->sr_state.ctxcsn ) {
1766 /* The cookie was validated when it was parsed, just use it */
1768 /* If just Refreshing and nothing has changed, shortcut it */
1769 if ( bvmatch( srs->sr_state.ctxcsn, &ctxcsn )) {
1771 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1772 LDAPControl *ctrls[2];
1776 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1777 NULL, LDAP_SYNC_REFRESH_DELETES );
1778 rs->sr_ctrls = ctrls;
1779 rs->sr_err = LDAP_SUCCESS;
1780 send_ldap_result( op, rs );
1781 rs->sr_ctrls = NULL;
1786 /* Do we have a sessionlog for this search? */
1789 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1790 if ( ber_bvcmp( srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1792 /* mutex is unlocked in playlog */
1793 syncprov_playlog( op, rs, sl, srs->sr_state.ctxcsn, &ctxcsn );
1795 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1798 /* Is the CSN still present in the database? */
1799 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1800 /* No, so a reload is required */
1801 #if 0 /* the consumer doesn't seem to send this hint */
1802 if ( op->o_sync_rhint == 0 ) {
1803 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1809 /* If changed and doing Present lookup, send Present UUIDs */
1810 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1812 send_ldap_result( op, rs );
1819 /* Append CSN range to search filter, save original filter
1820 * for persistent search evaluation
1823 sop->s_filterstr= op->ors_filterstr;
1826 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1827 fand->f_choice = LDAP_FILTER_AND;
1828 fand->f_next = NULL;
1829 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1830 fava->f_choice = LDAP_FILTER_LE;
1831 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1832 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1833 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1836 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1837 fava = fava->f_next;
1838 fava->f_choice = LDAP_FILTER_GE;
1839 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1840 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1841 ber_dupbv_x( &fava->f_ava->aa_value, srs->sr_state.ctxcsn, op->o_tmpmemctx );
1843 fava->f_next = op->ors_filter;
1844 op->ors_filter = fand;
1845 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1847 /* Let our callback add needed info to returned entries */
1848 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1849 ss = (searchstate *)(cb+1);
1852 ss->ss_present = do_present;
1853 cb->sc_response = syncprov_search_response;
1854 cb->sc_cleanup = syncprov_search_cleanup;
1855 cb->sc_private = ss;
1856 cb->sc_next = op->o_callback;
1857 op->o_callback = cb;
1859 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1860 op->o_sync_mode &= SLAP_CONTROL_MASK;
1863 /* If this is a persistent search and no changes were reported during
1864 * the refresh phase, just invoke the response callback to transition
1865 * us into persist phase
1868 rs->sr_err = LDAP_SUCCESS;
1869 rs->sr_nentries = 0;
1870 send_ldap_result( op, rs );
1873 return SLAP_CB_CONTINUE;
1877 syncprov_operational(
1881 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1882 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1884 if ( rs->sr_entry &&
1885 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1887 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1888 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1889 Attribute *a, **ap = NULL;
1891 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1892 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1897 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1899 a = ch_malloc( sizeof(Attribute));
1900 a->a_desc = slap_schema.si_ad_contextCSN;
1901 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1902 a->a_vals[1].bv_val = NULL;
1903 a->a_nvals = a->a_vals;
1909 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1911 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1913 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1915 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1918 return SLAP_CB_CONTINUE;
1930 slap_overinst *on = (slap_overinst *)be->bd_info;
1931 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1933 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1935 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1936 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1939 si->si_chkops = atoi( argv[1] );
1940 si->si_chktime = atoi( argv[2] ) * 60;
1943 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
1947 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1948 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
1951 size = atoi( argv[1] );
1954 "%s: line %d: session log size %d is negative\n",
1955 fname, lineno, size );
1960 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
1961 sl->sl_mincsn.bv_val = (char *)(sl+1);
1962 sl->sl_mincsn.bv_len = 0;
1964 sl->sl_head = sl->sl_tail = NULL;
1965 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
1972 return SLAP_CONF_UNKNOWN;
1975 /* Cheating - we have no thread pool context for these functions,
1978 typedef struct thread_keys {
1981 ldap_pvt_thread_pool_keyfree_t *xfree;
1985 /* A fake thread context */
1986 static thread_keys thrctx[MAXKEYS];
1988 /* Read any existing contextCSN from the underlying db.
1989 * Then search for any entries newer than that. If no value exists,
1990 * just generate it. Cache whatever result.
1997 slap_overinst *on = (slap_overinst *) be->bd_info;
1998 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2001 char opbuf[OPERATION_BUFFER_SIZE];
2002 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2003 Operation *op = (Operation *)opbuf;
2008 connection_fake_init( &conn, op, thrctx );
2010 op->o_dn = be->be_rootdn;
2011 op->o_ndn = be->be_rootndn;
2013 ctxcsnbuf[0] = '\0';
2015 op->o_bd->bd_info = on->on_info->oi_orig;
2016 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2017 slap_schema.si_ad_contextCSN, 0, &e );
2020 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2022 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2023 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2024 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2025 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2026 si->si_ctxcsn.bv_len );
2027 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2028 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2030 be_entry_release_rw( op, e, 0 );
2031 op->o_bd->bd_info = (BackendInfo *)on;
2032 op->o_req_dn = be->be_suffix[0];
2033 op->o_req_ndn = be->be_nsuffix[0];
2034 op->ors_scope = LDAP_SCOPE_SUBTREE;
2035 syncprov_findcsn( op, FIND_MAXCSN );
2038 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2039 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2040 &si->si_ctxcsn, 0 );
2043 /* If our ctxcsn is different from what was read from the root
2044 * entry, write the new value out.
2046 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2047 SlapReply rs = {REP_RESULT};
2048 syncprov_checkpoint( op, &rs, on );
2051 op->o_bd->bd_info = (BackendInfo *)on;
2055 /* Write the current contextCSN into the underlying db.
2062 slap_overinst *on = (slap_overinst *) be->bd_info;
2063 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2066 if ( si->si_numops ) {
2068 char opbuf[OPERATION_BUFFER_SIZE];
2069 Operation *op = (Operation *)opbuf;
2070 SlapReply rs = {REP_RESULT};
2072 connection_fake_init( &conn, op, thrctx );
2074 op->o_dn = be->be_rootdn;
2075 op->o_ndn = be->be_rootndn;
2076 syncprov_checkpoint( op, &rs, on );
2078 for ( i=0; thrctx[i].key; i++) {
2079 if ( thrctx[i].xfree )
2080 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2081 thrctx[i].key = NULL;
2092 slap_overinst *on = (slap_overinst *)be->bd_info;
2093 syncprov_info_t *si;
2095 si = ch_calloc(1, sizeof(syncprov_info_t));
2096 on->on_bi.bi_private = si;
2097 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2098 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2099 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2100 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2102 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2103 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2105 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2106 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2112 syncprov_db_destroy(
2116 slap_overinst *on = (slap_overinst *)be->bd_info;
2117 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2120 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2121 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2122 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2129 static int syncprov_parseCtrl (
2138 struct berval cookie = BER_BVNULL;
2142 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2143 rs->sr_text = "Sync control specified multiple times";
2144 return LDAP_PROTOCOL_ERROR;
2147 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2148 rs->sr_text = "Sync control specified with pagedResults control";
2149 return LDAP_PROTOCOL_ERROR;
2152 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2153 rs->sr_text = "Sync control value is empty (or absent)";
2154 return LDAP_PROTOCOL_ERROR;
2157 /* Parse the control value
2158 * syncRequestValue ::= SEQUENCE {
2163 * refreshAndPersist (3)
2165 * cookie syncCookie OPTIONAL
2169 ber = ber_init( &ctrl->ldctl_value );
2171 rs->sr_text = "internal error";
2175 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2176 rs->sr_text = "Sync control : mode decoding error";
2177 return LDAP_PROTOCOL_ERROR;
2181 case LDAP_SYNC_REFRESH_ONLY:
2182 mode = SLAP_SYNC_REFRESH;
2184 case LDAP_SYNC_REFRESH_AND_PERSIST:
2185 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2188 rs->sr_text = "Sync control : unknown update mode";
2189 return LDAP_PROTOCOL_ERROR;
2192 tag = ber_peek_tag( ber, &len );
2194 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2195 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2196 rs->sr_text = "Sync control : cookie decoding error";
2197 return LDAP_PROTOCOL_ERROR;
2200 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2201 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2202 rs->sr_text = "Sync control : rhint decoding error";
2203 return LDAP_PROTOCOL_ERROR;
2206 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2207 rs->sr_text = "Sync control : decoding error";
2208 return LDAP_PROTOCOL_ERROR;
2210 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2211 sr->sr_rhint = rhint;
2212 if (!BER_BVISNULL(&cookie)) {
2213 ber_bvarray_add( &sr->sr_state.octet_str, &cookie );
2214 slap_parse_sync_cookie( &sr->sr_state );
2217 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2219 (void) ber_free( ber, 1 );
2221 op->o_sync = ctrl->ldctl_iscritical
2222 ? SLAP_CONTROL_CRITICAL
2223 : SLAP_CONTROL_NONCRITICAL;
2225 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2227 return LDAP_SUCCESS;
2230 /* This overlay is set up for dynamic loading via moduleload. For static
2231 * configuration, you'll need to arrange for the slap_overinst to be
2232 * initialized and registered by some other function inside slapd.
2235 static slap_overinst syncprov;
2242 rc = register_supported_control( LDAP_CONTROL_SYNC,
2243 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2244 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2245 if ( rc != LDAP_SUCCESS ) {
2246 fprintf( stderr, "Failed to register control %d\n", rc );
2250 syncprov.on_bi.bi_type = "syncprov";
2251 syncprov.on_bi.bi_db_init = syncprov_db_init;
2252 syncprov.on_bi.bi_db_config = syncprov_db_config;
2253 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2254 syncprov.on_bi.bi_db_open = syncprov_db_open;
2255 syncprov.on_bi.bi_db_close = syncprov_db_close;
2257 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2258 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2260 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2261 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2262 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2263 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2264 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2265 syncprov.on_bi.bi_op_search = syncprov_op_search;
2266 syncprov.on_bi.bi_extended = syncprov_op_extended;
2267 syncprov.on_bi.bi_operational = syncprov_operational;
2269 return overlay_register( &syncprov );
2272 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2274 init_module( int argc, char *argv[] )
2276 return syncprov_init();
2278 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2280 #endif /* defined(SLAPD_OVER_SYNCPROV) */