2 /* syncprov.c - syncrepl provider */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2004 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
17 * This work was initially developed by Howard Chu for inclusion in
23 #ifdef SLAPD_OVER_SYNCPROV
25 #include <ac/string.h>
29 /* A modify request on a particular entry */
30 typedef struct modinst {
31 struct modinst *mi_next;
35 typedef struct modtarget {
36 struct modinst *mt_mods;
37 struct modinst *mt_tail;
39 ldap_pvt_thread_mutex_t mt_mutex;
42 /* A queued result of a persistent search */
43 typedef struct syncres {
44 struct syncres *s_next;
53 /* Record of a persistent search */
54 typedef struct syncops {
55 struct syncops *s_next;
56 struct berval s_base; /* ndn of search base */
57 ID s_eid; /* entryID of search base */
58 Operation *s_op; /* search op */
61 struct berval s_filterstr;
62 int s_flags; /* search status */
63 int s_inuse; /* reference count */
64 struct syncres *s_res;
65 struct syncres *s_restail;
66 ldap_pvt_thread_mutex_t s_mutex;
69 /* A received sync control */
70 typedef struct sync_control {
71 struct sync_cookie sr_state;
75 #if 0 /* moved back to slap.h */
76 #define o_sync o_ctrlflag[slap_cids.sc_LDAPsync]
78 /* o_sync_mode uses data bits of o_sync */
79 #define o_sync_mode o_ctrlflag[slap_cids.sc_LDAPsync]
81 #define SLAP_SYNC_NONE (LDAP_SYNC_NONE<<SLAP_CONTROL_SHIFT)
82 #define SLAP_SYNC_REFRESH (LDAP_SYNC_REFRESH_ONLY<<SLAP_CONTROL_SHIFT)
83 #define SLAP_SYNC_PERSIST (LDAP_SYNC_RESERVED<<SLAP_CONTROL_SHIFT)
84 #define SLAP_SYNC_REFRESH_AND_PERSIST (LDAP_SYNC_REFRESH_AND_PERSIST<<SLAP_CONTROL_SHIFT)
86 #define PS_IS_REFRESHING 0x01
88 /* Record of which searches matched at premodify step */
89 typedef struct syncmatches {
90 struct syncmatches *sm_next;
94 /* 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 sessionlog *sl_next;
105 struct berval sl_mincsn;
110 ldap_pvt_thread_mutex_t sl_mutex;
113 /* The main state for this overlay */
114 typedef struct syncprov_info_t {
116 struct berval si_ctxcsn; /* ldapsync context */
117 int si_chkops; /* checkpointing info */
119 int si_numops; /* number of ops since last checkpoint */
120 time_t si_chklast; /* time of last checkpoint */
121 Avlnode *si_mods; /* entries being modified */
123 ldap_pvt_thread_mutex_t si_csn_mutex;
124 ldap_pvt_thread_mutex_t si_ops_mutex;
125 ldap_pvt_thread_mutex_t si_mods_mutex;
126 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
129 typedef struct opcookie {
131 syncmatches *smatches;
132 struct berval sdn; /* DN of entry, for deletes */
134 struct berval suuid; /* UUID of entry */
135 struct berval sctxcsn;
136 int sreference; /* Is the entry a reference? */
139 typedef struct fbase_cookie {
140 struct berval *fdn; /* DN of a modified entry, for scope testing */
141 syncops *fss; /* persistent search we're testing against */
142 int fbase; /* if TRUE we found the search base and it's still valid */
143 int fscope; /* if TRUE then fdn is within the psearch scope */
146 static AttributeName csn_anlist[2];
147 static AttributeName uuid_anlist[2];
149 /* Build a LDAPsync intermediate state control */
155 int entry_sync_state,
159 struct berval *cookie )
164 const char *text = NULL;
166 BerElementBuffer berbuf;
167 BerElement *ber = (BerElement *)&berbuf;
169 struct berval entryuuid_bv = BER_BVNULL;
171 ber_init2( ber, 0, LBER_USE_DER );
172 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
174 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
176 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
177 AttributeDescription *desc = a->a_desc;
178 if ( desc == slap_schema.si_ad_entryUUID ) {
179 entryuuid_bv = a->a_nvals[0];
184 if ( send_cookie && cookie ) {
185 ber_printf( ber, "{eOON}",
186 entry_sync_state, &entryuuid_bv, cookie );
188 ber_printf( ber, "{eON}",
189 entry_sync_state, &entryuuid_bv );
192 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
193 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
194 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
199 Debug( LDAP_DEBUG_TRACE,
200 "slap_build_sync_ctrl: ber_flatten2 failed\n",
202 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
209 /* Build a LDAPsync final state control */
217 struct berval *cookie,
221 BerElementBuffer berbuf;
222 BerElement *ber = (BerElement *)&berbuf;
224 ber_init2( ber, NULL, LBER_USE_DER );
225 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
227 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
229 ber_printf( ber, "{" );
230 if ( send_cookie && cookie ) {
231 ber_printf( ber, "O", cookie );
233 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
234 ber_printf( ber, "b", refreshDeletes );
236 ber_printf( ber, "N}" );
238 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
239 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
240 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
245 Debug( LDAP_DEBUG_TRACE,
246 "syncprov_done_ctrl: ber_flatten2 failed\n",
248 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
256 /* Generate state based on session log - not implemented yet */
258 syncprov_state_ctrl_from_slog(
261 struct slog_entry *slog_e,
262 int entry_sync_state,
266 struct berval *cookie)
271 const char *text = NULL;
273 BerElementBuffer berbuf;
274 BerElement *ber = (BerElement *)&berbuf;
276 struct berval entryuuid_bv = BER_BVNULL;
278 ber_init2( ber, NULL, LBER_USE_DER );
279 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
281 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
283 entryuuid_bv = slog_e->sl_uuid;
285 if ( send_cookie && cookie ) {
286 ber_printf( ber, "{eOON}",
287 entry_sync_state, &entryuuid_bv, cookie );
289 ber_printf( ber, "{eON}",
290 entry_sync_state, &entryuuid_bv );
293 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
294 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
295 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
300 Debug( LDAP_DEBUG_TRACE,
301 "slap_build_sync_ctrl: ber_flatten2 failed\n",
303 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
316 struct berval *cookie,
321 BerElementBuffer berbuf;
322 BerElement *ber = (BerElement *)&berbuf;
323 struct berval rspdata;
327 ber_init2( ber, NULL, LBER_USE_DER );
328 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
332 case LDAP_TAG_SYNC_NEW_COOKIE:
333 ber_printf( ber, "tO", type, cookie );
335 case LDAP_TAG_SYNC_REFRESH_DELETE:
336 case LDAP_TAG_SYNC_REFRESH_PRESENT:
337 ber_printf( ber, "t{", type );
339 ber_printf( ber, "O", cookie );
341 if ( refreshDone == 0 ) {
342 ber_printf( ber, "b", refreshDone );
344 ber_printf( ber, "N}" );
346 case LDAP_TAG_SYNC_ID_SET:
347 ber_printf( ber, "t{", type );
349 ber_printf( ber, "O", cookie );
351 if ( refreshDeletes == 1 ) {
352 ber_printf( ber, "b", refreshDeletes );
354 ber_printf( ber, "[W]", syncUUIDs );
355 ber_printf( ber, "N}" );
358 Debug( LDAP_DEBUG_TRACE,
359 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
365 ret = ber_flatten2( ber, &rspdata, 0 );
368 Debug( LDAP_DEBUG_TRACE,
369 "syncprov_sendinfo: ber_flatten2 failed\n",
371 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
375 rs->sr_rspoid = LDAP_SYNC_INFO;
376 rs->sr_rspdata = &rspdata;
377 send_ldap_intermediate( op, rs );
378 rs->sr_rspdata = NULL;
384 /* Find a modtarget in an AVL tree */
386 sp_avl_cmp( const void *c1, const void *c2 )
388 const modtarget *m1, *m2;
392 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
395 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
398 /* syncprov_findbase:
399 * finds the true DN of the base of a search (with alias dereferencing) and
400 * checks to make sure the base entry doesn't get replaced with a different
401 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
402 * change is detected, any persistent search on this base must be terminated /
404 * On the first call, we just save the DN and entryID. On subsequent calls
405 * we compare the DN and entryID with the saved values.
408 findbase_cb( Operation *op, SlapReply *rs )
410 slap_callback *sc = op->o_callback;
412 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
413 fbase_cookie *fc = sc->sc_private;
415 /* If no entryID, we're looking for the first time.
416 * Just store whatever we got.
418 if ( fc->fss->s_eid == NOID ) {
420 fc->fss->s_eid = rs->sr_entry->e_id;
421 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
423 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
424 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
426 /* OK, the DN is the same and the entryID is the same. Now
427 * see if the fdn resides in the scope.
430 switch ( fc->fss->s_op->ors_scope ) {
431 case LDAP_SCOPE_BASE:
432 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
434 case LDAP_SCOPE_ONELEVEL: {
436 dnParent( fc->fdn, &pdn );
437 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
439 case LDAP_SCOPE_SUBTREE:
440 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
442 #ifdef LDAP_SCOPE_SUBORDINATE
443 case LDAP_SCOPE_SUBORDINATE:
444 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
445 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
451 if ( rs->sr_err != LDAP_SUCCESS ) {
452 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
458 syncprov_findbase( Operation *op, fbase_cookie *fc )
460 opcookie *opc = op->o_callback->sc_private;
461 slap_overinst *on = opc->son;
462 syncprov_info_t *si = on->on_bi.bi_private;
464 slap_callback cb = {0};
466 SlapReply frs = { REP_RESULT };
471 cb.sc_response = findbase_cb;
474 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
475 fop.o_callback = &cb;
476 fop.o_tag = LDAP_REQ_SEARCH;
477 fop.ors_scope = LDAP_SCOPE_BASE;
478 fop.ors_deref = fc->fss->s_op->ors_deref;
479 fop.ors_limit = NULL;
481 fop.ors_tlimit = SLAP_NO_LIMIT;
482 fop.ors_attrs = slap_anlist_no_attrs;
483 fop.ors_attrsonly = 1;
484 fop.ors_filter = fc->fss->s_op->ors_filter;
485 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
487 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
489 fop.o_bd->bd_info = on->on_info->oi_orig;
490 rc = fop.o_bd->be_search( &fop, &frs );
491 fop.o_bd->bd_info = (BackendInfo *)on;
493 if ( fc->fbase ) return LDAP_SUCCESS;
495 /* If entryID has changed, then the base of this search has
496 * changed. Invalidate the psearch.
498 return LDAP_NO_SUCH_OBJECT;
502 * This function has three different purposes, but they all use a search
503 * that filters on entryCSN so they're combined here.
504 * 1: at startup time, after a contextCSN has been read from the database,
505 * we search for all entries with CSN >= contextCSN in case the contextCSN
506 * was not checkpointed at the previous shutdown.
508 * 2: when the current contextCSN is known and we have a sync cookie, we search
509 * for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
510 * entry is found, the cookie CSN is valid, otherwise it is stale.
512 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
513 * CSN, and generate Present records for them. We always collect this result
514 * in SyncID sets, even if there's only one match.
516 #define FIND_MAXCSN 1
518 #define FIND_PRESENT 3
521 findmax_cb( Operation *op, SlapReply *rs )
523 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
524 struct berval *maxcsn = op->o_callback->sc_private;
525 Attribute *a = attr_find( rs->sr_entry->e_attrs,
526 slap_schema.si_ad_entryCSN );
528 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn )) {
529 maxcsn->bv_len = a->a_vals[0].bv_len;
530 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
537 findcsn_cb( Operation *op, SlapReply *rs )
539 slap_callback *sc = op->o_callback;
541 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
542 sc->sc_private = (void *)1;
547 /* Build a list of entryUUIDs for sending in a SyncID set */
551 typedef struct fpres_cookie {
558 findpres_cb( Operation *op, SlapReply *rs )
560 slap_callback *sc = op->o_callback;
561 fpres_cookie *pc = sc->sc_private;
563 int ret = SLAP_CB_CONTINUE;
565 switch ( rs->sr_type ) {
567 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
569 pc->uuids[pc->num].bv_val = pc->last;
570 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
571 pc->uuids[pc->num].bv_len );
573 pc->last = pc->uuids[pc->num].bv_val;
574 pc->uuids[pc->num].bv_val = NULL;
577 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
583 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
585 pc->uuids[pc->num].bv_val = pc->last;
587 pc->last = pc->uuids[0].bv_val;
597 syncprov_findcsn( Operation *op, int mode )
599 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
600 syncprov_info_t *si = on->on_bi.bi_private;
602 slap_callback cb = {0};
604 SlapReply frs = { REP_RESULT };
605 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
606 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
607 struct berval fbuf, maxcsn;
609 AttributeAssertion eq;
610 int i, rc = LDAP_SUCCESS;
611 fpres_cookie pcookie;
614 if ( mode != FIND_MAXCSN ) {
615 srs = op->o_controls[slap_cids.sc_LDAPsync];
617 if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
623 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
627 cf.f_av_desc = slap_schema.si_ad_entryCSN;
630 fop.o_callback = &cb;
631 fop.ors_limit = NULL;
632 fop.ors_tlimit = SLAP_NO_LIMIT;
633 fop.ors_filter = &cf;
634 fop.ors_filterstr = fbuf;
638 cf.f_choice = LDAP_FILTER_GE;
639 cf.f_av_value = si->si_ctxcsn;
640 fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)",
641 cf.f_av_value.bv_val );
642 fop.ors_attrsonly = 0;
643 fop.ors_attrs = csn_anlist;
644 fop.ors_slimit = SLAP_NO_LIMIT;
645 cb.sc_private = &maxcsn;
646 cb.sc_response = findmax_cb;
647 maxcsn.bv_val = cbuf;
651 cf.f_choice = LDAP_FILTER_LE;
652 cf.f_av_value = *srs->sr_state.ctxcsn;
653 fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
654 cf.f_av_value.bv_val );
655 fop.ors_attrsonly = 1;
656 fop.ors_attrs = slap_anlist_no_attrs;
658 cb.sc_private = NULL;
659 cb.sc_response = findcsn_cb;
662 af.f_choice = LDAP_FILTER_AND;
665 cf.f_choice = LDAP_FILTER_LE;
666 cf.f_av_value = *srs->sr_state.ctxcsn;
667 cf.f_next = op->ors_filter;
668 fop.ors_filter = ⁡
669 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
670 fop.ors_attrsonly = 0;
671 fop.ors_attrs = uuid_anlist;
672 fop.ors_slimit = SLAP_NO_LIMIT;
673 /* We want pure entries, not referrals */
674 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
675 cb.sc_private = &pcookie;
676 cb.sc_response = findpres_cb;
679 /* preallocate storage for a full set */
680 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
681 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
683 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
684 pcookie.uuids[0].bv_val = pcookie.last;
685 pcookie.uuids[0].bv_len = UUID_LEN;
686 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
687 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
688 pcookie.uuids[i].bv_len = UUID_LEN;
693 fop.o_bd->bd_info = on->on_info->oi_orig;
694 fop.o_bd->be_search( &fop, &frs );
695 fop.o_bd->bd_info = (BackendInfo *)on;
699 if ( maxcsn.bv_len ) {
700 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
701 si->si_ctxcsn.bv_len = maxcsn.bv_len;
705 /* If matching CSN was not found, invalidate the context. */
706 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
709 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
710 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
717 /* Queue a persistent search response if still in Refresh stage */
719 syncprov_qresp( opcookie *opc, syncops *so, int mode )
723 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
724 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
726 sr->s_dn.bv_val = (char *)(sr + 1);
728 sr->s_isreference = opc->sreference;
729 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
730 *(sr->s_ndn.bv_val++) = '\0';
731 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
732 *(sr->s_uuid.bv_val++) = '\0';
733 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
738 so->s_restail->s_next = sr;
741 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
745 /* Send a persistent search response */
747 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry *e, int mode, int queue )
749 slap_overinst *on = opc->son;
750 syncprov_info_t *si = on->on_bi.bi_private;
752 SlapReply rs = { REP_SEARCH };
753 LDAPControl *ctrls[2];
754 struct berval cookie;
756 Attribute a_uuid = {0};
757 Operation sop = *so->s_op;
762 sop.o_tmpmemctx = op->o_tmpmemctx;
764 sop.o_controls = op->o_controls;
766 if ( queue && (so->s_flags & PS_IS_REFRESHING) ) {
767 ldap_pvt_thread_mutex_lock( &so->s_mutex );
768 if ( so->s_flags & PS_IS_REFRESHING )
769 return syncprov_qresp( opc, so, mode );
770 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
774 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn,
775 so->s_sid, so->s_rid );
777 e_uuid.e_attrs = &a_uuid;
778 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
779 a_uuid.a_nvals = &opc->suuid;
780 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
781 mode, ctrls, 0, 1, &cookie );
787 if ( opc->sreference ) {
788 rs.sr_ref = get_entry_referrals( &sop, e );
789 send_search_reference( &sop, &rs );
790 ber_bvarray_free( rs.sr_ref );
794 case LDAP_SYNC_MODIFY:
795 rs.sr_attrs = sop.ors_attrs;
796 send_search_entry( &sop, &rs );
798 case LDAP_SYNC_DELETE:
799 e_uuid.e_attrs = NULL;
800 e_uuid.e_name = opc->sdn;
801 e_uuid.e_nname = opc->sndn;
802 rs.sr_entry = &e_uuid;
803 if ( opc->sreference ) {
804 struct berval bv = BER_BVNULL;
806 send_search_reference( &sop, &rs );
808 send_search_entry( &sop, &rs );
814 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
820 syncprov_free_syncop( syncops *so )
822 syncres *sr, *srnext;
824 ldap_pvt_thread_mutex_lock( &so->s_mutex );
826 if ( so->s_inuse > 0 ) {
827 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
830 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
831 filter_free( so->s_op->ors_filter );
833 ch_free( so->s_base.bv_val );
834 for ( sr=so->s_res; sr; sr=srnext ) {
838 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
843 syncprov_drop_psearch( syncops *so )
845 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
846 so->s_op->o_conn->c_n_ops_executing--;
847 so->s_op->o_conn->c_n_ops_completed++;
848 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
849 syncprov_free_syncop( so );
853 syncprov_op_abandon( Operation *op, SlapReply *rs )
855 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
856 syncprov_info_t *si = on->on_bi.bi_private;
857 syncops *so, *soprev;
859 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
860 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
861 soprev=so, so=so->s_next ) {
862 if ( so->s_op->o_connid == op->o_connid &&
863 so->s_op->o_msgid == op->orn_msgid ) {
864 so->s_op->o_abandon = 1;
865 soprev->s_next = so->s_next;
869 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
871 /* Is this really a Cancel exop? */
872 if ( op->o_tag != LDAP_REQ_ABANDON ) {
873 rs->sr_err = LDAP_CANCELLED;
874 send_ldap_result( so->s_op, rs );
876 syncprov_drop_psearch( so );
878 return SLAP_CB_CONTINUE;
881 /* Find which persistent searches are affected by this operation */
883 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
885 slap_overinst *on = opc->son;
886 syncprov_info_t *si = on->on_bi.bi_private;
889 syncops *ss, *sprev, *snext;
896 fc.fdn = &op->o_req_ndn;
898 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
900 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
901 else dnParent( fc.fdn, &pdn );
902 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
906 if ( op->o_tag != LDAP_REQ_ADD ) {
907 op->o_bd->bd_info = (BackendInfo *)on->on_info;
908 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
909 op->o_bd->bd_info = (BackendInfo *)on;
915 /* Never replicate these */
916 if ( is_entry_syncConsumerSubentry( e )) {
920 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
921 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
922 opc->sreference = is_entry_referral( e );
924 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
925 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
927 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
930 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
931 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
932 sprev = ss, ss=snext)
943 /* If the base of the search is missing, signal a refresh */
944 rc = syncprov_findbase( op, &fc );
945 if ( rc != LDAP_SUCCESS ) {
946 SlapReply rs = {REP_RESULT};
947 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
948 "search base has changed" );
949 sprev->s_next = snext;
950 syncprov_drop_psearch( ss );
954 /* If we're sending results now, look for this op in old matches */
957 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
958 old=sm, sm=sm->sm_next ) {
959 if ( sm->sm_op == ss ) {
961 old->sm_next = sm->sm_next;
962 op->o_tmpfree( sm, op->o_tmpmemctx );
968 /* check if current o_req_dn is in scope and matches filter */
969 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
970 LDAP_COMPARE_TRUE ) {
972 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
973 sm->sm_next = opc->smatches;
978 /* if found send UPDATE else send ADD */
979 syncprov_sendresp( op, opc, ss, e,
980 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
982 } else if ( !saveit && found ) {
984 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
987 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
989 if ( op->o_tag != LDAP_REQ_ADD ) {
990 op->o_bd->bd_info = (BackendInfo *)on->on_info;
991 be_entry_release_r( op, e );
992 op->o_bd->bd_info = (BackendInfo *)on;
995 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1000 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1002 slap_callback *cb = op->o_callback;
1003 opcookie *opc = cb->sc_private;
1004 slap_overinst *on = opc->son;
1005 syncprov_info_t *si = on->on_bi.bi_private;
1006 syncmatches *sm, *snext;
1007 modtarget *mt, mtdummy;
1009 for (sm = opc->smatches; sm; sm=snext) {
1010 snext = sm->sm_next;
1011 syncprov_free_syncop( sm->sm_op );
1012 op->o_tmpfree( sm, op->o_tmpmemctx );
1015 /* Remove op from lock table */
1017 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1018 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1019 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1021 modinst *mi = mt->mt_mods;
1023 /* If there are more, promote the next one */
1024 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1025 if ( mi->mi_next ) {
1026 mt->mt_mods = mi->mi_next;
1027 mt->mt_op = mt->mt_mods->mi_op;
1028 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1030 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1031 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1032 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1033 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1034 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1038 if ( !BER_BVISNULL( &opc->suuid ))
1039 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1040 if ( !BER_BVISNULL( &opc->sndn ))
1041 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1042 if ( !BER_BVISNULL( &opc->sdn ))
1043 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1044 op->o_callback = cb->sc_next;
1045 op->o_tmpfree(cb, op->o_tmpmemctx);
1049 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1051 syncprov_info_t *si = on->on_bi.bi_private;
1054 struct berval bv[2];
1056 slap_callback cb = {0};
1058 mod.sml_values = bv;
1059 bv[1].bv_val = NULL;
1060 bv[0] = si->si_ctxcsn;
1061 mod.sml_nvalues = NULL;
1062 mod.sml_desc = slap_schema.si_ad_contextCSN;
1063 mod.sml_op = LDAP_MOD_REPLACE;
1064 mod.sml_next = NULL;
1066 cb.sc_response = slap_null_cb;
1068 opm.o_tag = LDAP_REQ_MODIFY;
1069 opm.o_callback = &cb;
1070 opm.orm_modlist = &mod;
1071 opm.o_req_dn = op->o_bd->be_suffix[0];
1072 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1073 orig = opm.o_bd->bd_info;
1074 opm.o_bd->bd_info = on->on_info->oi_orig;
1075 opm.o_bd->be_modify( &opm, rs );
1079 syncprov_add_slog( Operation *op, struct berval *csn )
1081 opcookie *opc = op->o_callback->sc_private;
1082 slap_overinst *on = opc->son;
1083 syncprov_info_t *si = on->on_bi.bi_private;
1087 for ( sl = si->si_logs; sl; sl=sl->sl_next ) {
1088 /* Allocate a record. UUIDs are not NUL-terminated. */
1089 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1092 se->se_tag = op->o_tag;
1094 se->se_uuid.bv_val = (char *)(se+1);
1095 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1096 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1097 se->se_uuid.bv_len = opc->suuid.bv_len;
1099 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1100 se->se_csn.bv_val[csn->bv_len] = '\0';
1101 se->se_csn.bv_len = csn->bv_len;
1103 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1104 if ( sl->sl_head ) {
1105 sl->sl_tail->se_next = se;
1111 while ( sl->sl_num > sl->sl_size ) {
1113 sl->sl_head = se->se_next;
1114 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1115 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1118 if ( !sl->sl_head ) {
1122 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1126 /* Just set a flag if we found the matching entry */
1128 playlog_cb( Operation *op, SlapReply *rs )
1130 if ( rs->sr_type == REP_SEARCH ) {
1131 op->o_callback->sc_private = (void *)1;
1136 /* enter with sl->sl_mutex locked, release before returning */
1138 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1139 struct berval *oldcsn, struct berval *ctxcsn )
1141 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1142 syncprov_info_t *si = on->on_bi.bi_private;
1144 int i, j, ndel, num, nmods, mmods;
1151 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1152 num * UUID_LEN, op->o_tmpmemctx );
1154 uuids[0].bv_val = (char *)(uuids + num + 1);
1156 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1157 * and everything else at the end. Do this first so we can
1158 * unlock the list mutex.
1160 for ( se=sl->sl_head; se; se=se->se_next ) {
1161 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1162 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1163 if ( se->se_tag == LDAP_REQ_DELETE ) {
1170 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1171 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1172 uuids[j].bv_len = UUID_LEN;
1174 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1178 /* Mods must be validated to see if they belong in this delete set.
1182 /* Strip any duplicates */
1183 for ( i=0; i<nmods; i++ ) {
1184 for ( j=0; j<ndel; j++ ) {
1185 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1186 uuids[num - 1 - i].bv_len = 0;
1191 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1192 for ( j=0; j<i; j++ ) {
1193 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1194 uuids[num - 1 - i].bv_len = 0;
1203 SlapReply frs = { REP_RESULT };
1206 AttributeAssertion eq;
1207 slap_callback cb = {0};
1211 fop.o_sync_mode = 0;
1212 fop.o_callback = &cb;
1213 fop.ors_limit = NULL;
1215 fop.ors_tlimit = SLAP_NO_LIMIT;
1216 fop.ors_attrs = slap_anlist_all_attributes;
1217 fop.ors_attrsonly = 0;
1218 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1220 af.f_choice = LDAP_FILTER_AND;
1223 mf.f_choice = LDAP_FILTER_EQUALITY;
1225 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1226 mf.f_next = fop.ors_filter;
1228 fop.ors_filter = ⁡
1230 cb.sc_response = playlog_cb;
1232 for ( i=0; i<nmods; i++ ) {
1233 if ( uuids[num - 1 - 1].bv_len == 0 ) continue;
1235 mf.f_av_value = uuids[num -1 -i];
1236 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
1237 fop.o_bd->bd_info = on->on_info->oi_orig;
1238 cb.sc_private = NULL;
1239 rc = fop.o_bd->be_search( &fop, &frs );
1240 fop.o_bd->bd_info = (BackendInfo *)on;
1241 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
1243 /* If entry was not found, add to delete list */
1244 if ( !cb.sc_private ) {
1245 uuids[ndel++] = uuids[num - 1 - i];
1250 uuids[ndel].bv_val = NULL;
1251 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1256 syncprov_op_response( Operation *op, SlapReply *rs )
1258 opcookie *opc = op->o_callback->sc_private;
1259 slap_overinst *on = opc->son;
1260 syncprov_info_t *si = on->on_bi.bi_private;
1263 if ( rs->sr_err == LDAP_SUCCESS )
1265 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1266 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1268 /* Update our context CSN */
1270 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1271 slap_get_commit_csn( op, &maxcsn, &curcsn );
1272 if ( !BER_BVISNULL( &maxcsn ) ) {
1273 strcpy( cbuf, maxcsn.bv_val );
1274 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1275 strcpy( si->si_ctxcsnbuf, cbuf );
1276 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1281 if ( si->si_chkops || si->si_chktime ) {
1283 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1287 if ( si->si_chktime &&
1288 (op->o_time - si->si_chklast >= si->si_chktime )) {
1290 si->si_chklast = op->o_time;
1293 syncprov_checkpoint( op, rs, on );
1296 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1298 opc->sctxcsn.bv_len = maxcsn.bv_len;
1299 opc->sctxcsn.bv_val = cbuf;
1301 /* Handle any persistent searches */
1305 case LDAP_REQ_MODIFY:
1306 case LDAP_REQ_MODRDN:
1307 case LDAP_REQ_EXTENDED:
1308 syncprov_matchops( op, opc, 0 );
1310 case LDAP_REQ_DELETE:
1311 /* for each match in opc->smatches:
1314 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1315 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1316 if ( sm->sm_op->s_op->o_abandon )
1318 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1319 LDAP_SYNC_DELETE, 1 );
1321 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1326 /* Add any log records */
1327 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1328 syncprov_add_slog( op, &curcsn );
1332 return SLAP_CB_CONTINUE;
1335 /* We don't use a subentry to store the context CSN any more.
1336 * We expose the current context CSN as an operational attribute
1337 * of the suffix entry.
1340 syncprov_op_compare( Operation *op, SlapReply *rs )
1342 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1343 syncprov_info_t *si = on->on_bi.bi_private;
1344 int rc = SLAP_CB_CONTINUE;
1346 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1347 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1351 struct berval bv[2];
1353 e.e_name = op->o_bd->be_suffix[0];
1354 e.e_nname = op->o_bd->be_nsuffix[0];
1356 BER_BVZERO( &bv[1] );
1357 bv[0] = si->si_ctxcsn;
1359 a.a_desc = slap_schema.si_ad_contextCSN;
1361 a.a_nvals = a.a_vals;
1363 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1365 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1366 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1367 if ( ! rs->sr_err ) {
1368 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1369 goto return_results;
1372 if ( get_assert( op ) &&
1373 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1375 rs->sr_err = LDAP_ASSERTION_FAILED;
1376 goto return_results;
1380 rs->sr_err = LDAP_COMPARE_FALSE;
1382 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1383 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1384 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1385 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1387 rs->sr_err = LDAP_COMPARE_TRUE;
1392 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1394 send_ldap_result( op, rs );
1396 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1397 rs->sr_err = LDAP_SUCCESS;
1406 syncprov_op_mod( Operation *op, SlapReply *rs )
1408 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1409 syncprov_info_t *si = on->on_bi.bi_private;
1411 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1413 (si->si_ops ? sizeof(modinst) : 0 ),
1415 opcookie *opc = (opcookie *)(cb+1);
1417 cb->sc_response = syncprov_op_response;
1418 cb->sc_cleanup = syncprov_op_cleanup;
1419 cb->sc_private = opc;
1420 cb->sc_next = op->o_callback;
1421 op->o_callback = cb;
1423 /* If there are active persistent searches, lock this operation.
1424 * See seqmod.c for the locking logic on its own.
1427 modtarget *mt, mtdummy;
1430 mi = (modinst *)(opc+1);
1433 /* See if we're already modifying this entry... */
1435 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1436 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1438 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1439 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1440 mt->mt_tail->mi_next = mi;
1442 /* wait for this op to get to head of list */
1443 while ( mt->mt_mods != mi ) {
1444 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1445 ldap_pvt_thread_yield();
1446 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1448 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1450 /* Record that we're modifying this entry now */
1451 mt = ch_malloc( sizeof(modtarget) );
1454 mt->mt_op = mi->mi_op;
1455 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1456 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1457 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1461 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1462 syncprov_matchops( op, opc, 1 );
1465 return SLAP_CB_CONTINUE;
1469 syncprov_op_extended( Operation *op, SlapReply *rs )
1471 if ( exop_is_write( op ))
1472 return syncprov_op_mod( op, rs );
1474 return SLAP_CB_CONTINUE;
1477 typedef struct searchstate {
1478 slap_overinst *ss_on;
1484 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1486 if ( rs->sr_ctrls ) {
1487 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1488 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1489 rs->sr_ctrls = NULL;
1495 syncprov_detach_op( Operation *op, syncops *so )
1502 /* count the search attrs */
1503 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1504 alen += op->ors_attrs[i].an_name.bv_len + 1;
1506 /* Make a new copy of the operation */
1507 size = sizeof(Operation) + sizeof(Opheader) +
1508 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1509 op->o_req_dn.bv_len + 1 +
1510 op->o_req_ndn.bv_len + 1 +
1511 op->o_ndn.bv_len + 1 +
1512 so->s_filterstr.bv_len + 1;
1513 op2 = (Operation *)ch_malloc( size );
1515 op2->o_hdr = (Opheader *)(op2+1);
1516 *op2->o_hdr = *op->o_hdr;
1518 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1519 ptr = (char *)(op2->ors_attrs+i+1);
1520 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1521 op2->ors_attrs[i] = op->ors_attrs[i];
1522 op2->ors_attrs[i].an_name.bv_val = ptr;
1523 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1525 BER_BVZERO( &op2->ors_attrs[i].an_name );
1527 ptr = (char *)(op2->o_hdr + 1);
1529 op2->o_ndn.bv_val = ptr;
1530 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1531 op2->o_dn = op2->o_ndn;
1532 op2->o_req_dn.bv_val = ptr;
1533 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1534 op2->o_req_ndn.bv_val = ptr;
1535 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1536 op2->ors_filterstr.bv_val = ptr;
1537 strcpy( ptr, so->s_filterstr.bv_val );
1538 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1539 op2->ors_filter = str2filter( ptr );
1540 op2->o_controls = NULL;
1541 op2->o_callback = NULL;
1544 /* Increment number of ops so that idletimeout ignores us */
1545 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1546 op->o_conn->c_n_ops_executing++;
1547 op->o_conn->c_n_ops_completed--;
1548 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1552 syncprov_search_response( Operation *op, SlapReply *rs )
1554 searchstate *ss = op->o_callback->sc_private;
1555 slap_overinst *on = ss->ss_on;
1556 syncprov_info_t *si = on->on_bi.bi_private;
1557 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1559 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1561 /* If we got a referral without a referral object, there's
1562 * something missing that we cannot replicate. Just ignore it.
1563 * The consumer will abort because we didn't send the expected
1566 if ( !rs->sr_entry ) {
1567 assert( rs->sr_entry );
1568 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1569 return SLAP_CB_CONTINUE;
1571 if ( srs->sr_state.ctxcsn ) {
1572 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1573 slap_schema.si_ad_entryCSN );
1574 /* Don't send the ctx entry twice */
1575 if ( bvmatch( &a->a_nvals[0], srs->sr_state.ctxcsn ))
1576 return LDAP_SUCCESS;
1578 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1580 rs->sr_ctrls[1] = NULL;
1581 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1582 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1583 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1584 struct berval cookie;
1586 slap_compose_sync_cookie( op, &cookie,
1587 &op->ors_filter->f_and->f_ava->aa_value,
1588 srs->sr_state.sid, srs->sr_state.rid );
1590 /* Is this a regular refresh? */
1592 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1594 rs->sr_ctrls[1] = NULL;
1595 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1596 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1597 LDAP_SYNC_REFRESH_DELETES );
1600 /* It's RefreshAndPersist, transition to Persist phase */
1601 syncprov_sendinfo( op, rs, ss->ss_present ?
1602 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1603 &cookie, 1, NULL, 0 );
1604 /* Flush any queued persist messages */
1605 if ( ss->ss_so->s_res ) {
1606 syncres *sr, *srnext;
1611 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1613 for (sr = ss->ss_so->s_res; sr; sr=srnext) {
1614 int rc = LDAP_SUCCESS;
1615 srnext = sr->s_next;
1617 opc.sndn = sr->s_ndn;
1618 opc.suuid = sr->s_uuid;
1619 opc.sctxcsn = sr->s_csn;
1620 opc.sreference = sr->s_isreference;
1623 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
1624 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1625 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
1626 op->o_bd->bd_info = (BackendInfo *)on;
1628 if ( rc == LDAP_SUCCESS )
1629 syncprov_sendresp( op, &opc, ss->ss_so, e,
1633 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1634 be_entry_release_r( op, e );
1635 op->o_bd->bd_info = (BackendInfo *)on;
1639 ss->ss_so->s_res = NULL;
1640 ss->ss_so->s_restail = NULL;
1643 /* Turn off the refreshing flag */
1644 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1646 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1648 /* Detach this Op from frontend control */
1649 syncprov_detach_op( op, ss->ss_so );
1651 return LDAP_SUCCESS;
1655 return SLAP_CB_CONTINUE;
1659 syncprov_op_search( Operation *op, SlapReply *rs )
1661 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1662 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1664 int gotstate = 0, nochange = 0, do_present = 1;
1665 Filter *fand, *fava;
1666 syncops *sop = NULL;
1669 struct berval ctxcsn;
1670 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1672 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1674 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1675 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1679 srs = op->o_controls[slap_cids.sc_LDAPsync];
1681 /* If this is a persistent search, set it up right away */
1682 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1692 so.s_flags = PS_IS_REFRESHING;
1693 /* syncprov_findbase expects to be called as a callback... */
1694 sc.sc_private = &opc;
1696 cb = op->o_callback;
1697 op->o_callback = ≻
1698 rs->sr_err = syncprov_findbase( op, &fc );
1699 op->o_callback = cb;
1701 if ( rs->sr_err != LDAP_SUCCESS ) {
1702 send_ldap_result( op, rs );
1705 sop = ch_malloc( sizeof( syncops ));
1707 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1708 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1709 sop->s_sid = srs->sr_state.sid;
1710 sop->s_rid = srs->sr_state.rid;
1711 sop->s_next = si->si_ops;
1714 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1717 /* snapshot the ctxcsn */
1718 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1719 strcpy( csnbuf, si->si_ctxcsnbuf );
1720 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1721 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1722 ctxcsn.bv_val = csnbuf;
1724 /* If we have a cookie, handle the PRESENT lookups */
1725 if ( srs->sr_state.ctxcsn ) {
1728 /* Is the CSN in a valid format? */
1729 if ( srs->sr_state.ctxcsn->bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
1730 send_ldap_error( op, rs, LDAP_OTHER, "invalid sync cookie" );
1733 /* If just Refreshing and nothing has changed, shortcut it */
1734 if ( bvmatch( srs->sr_state.ctxcsn, &ctxcsn )) {
1736 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1737 LDAPControl *ctrls[2];
1741 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1742 NULL, LDAP_SYNC_REFRESH_DELETES );
1743 rs->sr_ctrls = ctrls;
1744 rs->sr_err = LDAP_SUCCESS;
1745 send_ldap_result( op, rs );
1746 rs->sr_ctrls = NULL;
1751 /* Do we have a sessionlog for this search? */
1752 for ( sl=si->si_logs; sl; sl=sl->sl_next )
1753 if ( sl->sl_sid == srs->sr_state.sid ) break;
1755 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1756 if ( ber_bvcmp( srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1758 /* mutex is unlocked in playlog */
1759 syncprov_playlog( op, rs, sl, srs->sr_state.ctxcsn, &ctxcsn );
1761 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1764 /* Is the CSN still present in the database? */
1765 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1766 /* No, so a reload is required */
1767 #if 0 /* the consumer doesn't seem to send this hint */
1768 if ( op->o_sync_rhint == 0 ) {
1769 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1775 /* If changed and doing Present lookup, send Present UUIDs */
1776 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1778 send_ldap_result( op, rs );
1784 /* Append CSN range to search filter, save original filter
1785 * for persistent search evaluation
1788 sop->s_filterstr= op->ors_filterstr;
1791 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1792 fand->f_choice = LDAP_FILTER_AND;
1793 fand->f_next = NULL;
1794 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1795 fava->f_choice = LDAP_FILTER_LE;
1796 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1797 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1798 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1801 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1802 fava = fava->f_next;
1803 fava->f_choice = LDAP_FILTER_GE;
1804 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1805 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1806 ber_dupbv_x( &fava->f_ava->aa_value, srs->sr_state.ctxcsn, op->o_tmpmemctx );
1808 fava->f_next = op->ors_filter;
1809 op->ors_filter = fand;
1810 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1813 /* Let our callback add needed info to returned entries */
1814 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1815 ss = (searchstate *)(cb+1);
1818 ss->ss_present = do_present;
1819 cb->sc_response = syncprov_search_response;
1820 cb->sc_cleanup = syncprov_search_cleanup;
1821 cb->sc_private = ss;
1822 cb->sc_next = op->o_callback;
1823 op->o_callback = cb;
1825 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1826 op->o_sync_mode &= SLAP_CONTROL_MASK;
1829 /* If this is a persistent search and no changes were reported during
1830 * the refresh phase, just invoke the response callback to transition
1831 * us into persist phase
1834 rs->sr_err = LDAP_SUCCESS;
1835 rs->sr_nentries = 0;
1836 send_ldap_result( op, rs );
1839 return SLAP_CB_CONTINUE;
1843 syncprov_operational(
1847 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1848 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1850 if ( rs->sr_entry &&
1851 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1853 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1854 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1855 Attribute *a, **ap = NULL;
1857 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1858 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1863 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1865 a = ch_malloc( sizeof(Attribute));
1866 a->a_desc = slap_schema.si_ad_contextCSN;
1867 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1868 a->a_vals[1].bv_val = NULL;
1869 a->a_nvals = a->a_vals;
1875 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1877 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1879 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1881 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1884 return SLAP_CB_CONTINUE;
1896 slap_overinst *on = (slap_overinst *)be->bd_info;
1897 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1899 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1901 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1902 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1905 si->si_chkops = atoi( argv[1] );
1906 si->si_chktime = atoi( argv[2] ) * 60;
1909 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
1913 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1914 "\"syncprov-sessionlog <sid> <size>\"\n", fname, lineno );
1917 sid = atoi( argv[1] );
1918 if ( sid < 0 || sid > 999 ) {
1920 "%s: line %d: session log id %d is out of range [0..999]\n",
1921 fname, lineno, sid );
1924 size = atoi( argv[2] );
1927 "%s: line %d: session log size %d is negative\n",
1928 fname, lineno, size );
1931 for ( sl = si->si_logs; sl; sl=sl->sl_next ) {
1932 if ( sl->sl_sid == sid ) {
1938 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
1939 sl->sl_mincsn.bv_val = (char *)(sl+1);
1940 sl->sl_mincsn.bv_len = 0;
1944 sl->sl_head = sl->sl_tail = NULL;
1945 sl->sl_next = si->si_logs;
1946 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
1952 return SLAP_CONF_UNKNOWN;
1955 /* Cheating - we have no thread pool context for these functions,
1958 typedef struct thread_keys {
1961 ldap_pvt_thread_pool_keyfree_t *xfree;
1965 /* A fake thread context */
1966 static thread_keys thrctx[MAXKEYS];
1968 /* Read any existing contextCSN from the underlying db.
1969 * Then search for any entries newer than that. If no value exists,
1970 * just generate it. Cache whatever result.
1977 slap_overinst *on = (slap_overinst *) be->bd_info;
1978 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1981 char opbuf[OPERATION_BUFFER_SIZE];
1982 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1983 Operation *op = (Operation *)opbuf;
1988 connection_fake_init( &conn, op, thrctx );
1990 op->o_dn = be->be_rootdn;
1991 op->o_ndn = be->be_rootndn;
1993 ctxcsnbuf[0] = '\0';
1995 op->o_bd->bd_info = on->on_info->oi_orig;
1996 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
1997 slap_schema.si_ad_contextCSN, 0, &e );
2000 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2002 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2003 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2004 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2005 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2006 si->si_ctxcsn.bv_len );
2007 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2008 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2010 be_entry_release_r( op, e );
2011 op->o_bd->bd_info = (BackendInfo *)on;
2012 op->o_req_dn = be->be_suffix[0];
2013 op->o_req_ndn = be->be_nsuffix[0];
2014 op->ors_scope = LDAP_SCOPE_SUBTREE;
2015 syncprov_findcsn( op, FIND_MAXCSN );
2018 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2019 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2020 &si->si_ctxcsn, 0 );
2023 /* If our ctxcsn is different from what was read from the root
2024 * entry, write the new value out.
2026 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2027 SlapReply rs = {REP_RESULT};
2028 syncprov_checkpoint( op, &rs, on );
2031 op->o_bd->bd_info = (BackendInfo *)on;
2035 /* Write the current contextCSN into the underlying db.
2042 slap_overinst *on = (slap_overinst *) be->bd_info;
2043 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2046 if ( si->si_numops ) {
2048 char opbuf[OPERATION_BUFFER_SIZE];
2049 Operation *op = (Operation *)opbuf;
2050 SlapReply rs = {REP_RESULT};
2052 connection_fake_init( &conn, op, thrctx );
2054 op->o_dn = be->be_rootdn;
2055 op->o_ndn = be->be_rootndn;
2056 syncprov_checkpoint( op, &rs, on );
2058 for ( i=0; thrctx[i].key; i++) {
2059 if ( thrctx[i].xfree )
2060 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2061 thrctx[i].key = NULL;
2072 slap_overinst *on = (slap_overinst *)be->bd_info;
2073 syncprov_info_t *si;
2075 si = ch_calloc(1, sizeof(syncprov_info_t));
2076 on->on_bi.bi_private = si;
2077 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2078 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2079 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2080 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2082 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2083 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2085 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2086 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2092 syncprov_db_destroy(
2096 slap_overinst *on = (slap_overinst *)be->bd_info;
2097 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2100 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2101 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2102 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2109 static int syncprov_parseCtrl (
2118 struct berval cookie = BER_BVNULL;
2122 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2123 rs->sr_text = "Sync control specified multiple times";
2124 return LDAP_PROTOCOL_ERROR;
2127 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2128 rs->sr_text = "Sync control specified with pagedResults control";
2129 return LDAP_PROTOCOL_ERROR;
2132 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2133 rs->sr_text = "Sync control value is empty (or absent)";
2134 return LDAP_PROTOCOL_ERROR;
2137 /* Parse the control value
2138 * syncRequestValue ::= SEQUENCE {
2143 * refreshAndPersist (3)
2145 * cookie syncCookie OPTIONAL
2149 ber = ber_init( &ctrl->ldctl_value );
2151 rs->sr_text = "internal error";
2155 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2156 rs->sr_text = "Sync control : mode decoding error";
2157 return LDAP_PROTOCOL_ERROR;
2161 case LDAP_SYNC_REFRESH_ONLY:
2162 mode = SLAP_SYNC_REFRESH;
2164 case LDAP_SYNC_REFRESH_AND_PERSIST:
2165 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2168 rs->sr_text = "Sync control : unknown update mode";
2169 return LDAP_PROTOCOL_ERROR;
2172 tag = ber_peek_tag( ber, &len );
2174 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2175 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2176 rs->sr_text = "Sync control : cookie decoding error";
2177 return LDAP_PROTOCOL_ERROR;
2180 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2181 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2182 rs->sr_text = "Sync control : rhint decoding error";
2183 return LDAP_PROTOCOL_ERROR;
2186 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2187 rs->sr_text = "Sync control : decoding error";
2188 return LDAP_PROTOCOL_ERROR;
2190 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2191 sr->sr_rhint = rhint;
2192 if (!BER_BVISNULL(&cookie)) {
2193 ber_bvarray_add( &sr->sr_state.octet_str, &cookie );
2194 slap_parse_sync_cookie( &sr->sr_state );
2197 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2199 (void) ber_free( ber, 1 );
2201 op->o_sync = ctrl->ldctl_iscritical
2202 ? SLAP_CONTROL_CRITICAL
2203 : SLAP_CONTROL_NONCRITICAL;
2205 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2207 return LDAP_SUCCESS;
2210 /* This overlay is set up for dynamic loading via moduleload. For static
2211 * configuration, you'll need to arrange for the slap_overinst to be
2212 * initialized and registered by some other function inside slapd.
2215 static slap_overinst syncprov;
2222 rc = register_supported_control( LDAP_CONTROL_SYNC,
2223 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2224 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2225 if ( rc != LDAP_SUCCESS ) {
2226 fprintf( stderr, "Failed to register control %d\n", rc );
2230 syncprov.on_bi.bi_type = "syncprov";
2231 syncprov.on_bi.bi_db_init = syncprov_db_init;
2232 syncprov.on_bi.bi_db_config = syncprov_db_config;
2233 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2234 syncprov.on_bi.bi_db_open = syncprov_db_open;
2235 syncprov.on_bi.bi_db_close = syncprov_db_close;
2237 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2238 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2240 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2241 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2242 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2243 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2244 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2245 syncprov.on_bi.bi_op_search = syncprov_op_search;
2246 syncprov.on_bi.bi_extended = syncprov_op_extended;
2247 syncprov.on_bi.bi_operational = syncprov_operational;
2249 return overlay_register( &syncprov );
2252 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2254 init_module( int argc, char *argv[] )
2256 return syncprov_init();
2258 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2260 #endif /* defined(SLAPD_OVER_SYNCPROV) */