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 syncops *shead; /* head of si_ops when we started */
135 int sreference; /* Is the entry a reference? */
138 typedef struct fbase_cookie {
139 struct berval *fdn; /* DN of a modified entry, for scope testing */
140 syncops *fss; /* persistent search we're testing against */
141 int fbase; /* if TRUE we found the search base and it's still valid */
142 int fscope; /* if TRUE then fdn is within the psearch scope */
145 static AttributeName csn_anlist[2];
146 static AttributeName uuid_anlist[2];
148 /* Build a LDAPsync intermediate state control */
154 int entry_sync_state,
158 struct berval *cookie )
163 const char *text = NULL;
165 BerElementBuffer berbuf;
166 BerElement *ber = (BerElement *)&berbuf;
168 struct berval entryuuid_bv = BER_BVNULL;
170 ber_init2( ber, 0, LBER_USE_DER );
171 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
173 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
175 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
176 AttributeDescription *desc = a->a_desc;
177 if ( desc == slap_schema.si_ad_entryUUID ) {
178 entryuuid_bv = a->a_nvals[0];
183 if ( send_cookie && cookie ) {
184 ber_printf( ber, "{eOON}",
185 entry_sync_state, &entryuuid_bv, cookie );
187 ber_printf( ber, "{eON}",
188 entry_sync_state, &entryuuid_bv );
191 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
192 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
193 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
198 Debug( LDAP_DEBUG_TRACE,
199 "slap_build_sync_ctrl: ber_flatten2 failed\n",
201 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
208 /* Build a LDAPsync final state control */
216 struct berval *cookie,
220 BerElementBuffer berbuf;
221 BerElement *ber = (BerElement *)&berbuf;
223 ber_init2( ber, NULL, LBER_USE_DER );
224 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
226 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
228 ber_printf( ber, "{" );
229 if ( send_cookie && cookie ) {
230 ber_printf( ber, "O", cookie );
232 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
233 ber_printf( ber, "b", refreshDeletes );
235 ber_printf( ber, "N}" );
237 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
238 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
239 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
244 Debug( LDAP_DEBUG_TRACE,
245 "syncprov_done_ctrl: ber_flatten2 failed\n",
247 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
259 struct berval *cookie,
264 BerElementBuffer berbuf;
265 BerElement *ber = (BerElement *)&berbuf;
266 struct berval rspdata;
270 ber_init2( ber, NULL, LBER_USE_DER );
271 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
275 case LDAP_TAG_SYNC_NEW_COOKIE:
276 ber_printf( ber, "tO", type, cookie );
278 case LDAP_TAG_SYNC_REFRESH_DELETE:
279 case LDAP_TAG_SYNC_REFRESH_PRESENT:
280 ber_printf( ber, "t{", type );
282 ber_printf( ber, "O", cookie );
284 if ( refreshDone == 0 ) {
285 ber_printf( ber, "b", refreshDone );
287 ber_printf( ber, "N}" );
289 case LDAP_TAG_SYNC_ID_SET:
290 ber_printf( ber, "t{", type );
292 ber_printf( ber, "O", cookie );
294 if ( refreshDeletes == 1 ) {
295 ber_printf( ber, "b", refreshDeletes );
297 ber_printf( ber, "[W]", syncUUIDs );
298 ber_printf( ber, "N}" );
301 Debug( LDAP_DEBUG_TRACE,
302 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
308 ret = ber_flatten2( ber, &rspdata, 0 );
311 Debug( LDAP_DEBUG_TRACE,
312 "syncprov_sendinfo: ber_flatten2 failed\n",
314 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
318 rs->sr_rspoid = LDAP_SYNC_INFO;
319 rs->sr_rspdata = &rspdata;
320 send_ldap_intermediate( op, rs );
321 rs->sr_rspdata = NULL;
327 /* Find a modtarget in an AVL tree */
329 sp_avl_cmp( const void *c1, const void *c2 )
331 const modtarget *m1, *m2;
335 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
338 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
341 /* syncprov_findbase:
342 * finds the true DN of the base of a search (with alias dereferencing) and
343 * checks to make sure the base entry doesn't get replaced with a different
344 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
345 * change is detected, any persistent search on this base must be terminated /
347 * On the first call, we just save the DN and entryID. On subsequent calls
348 * we compare the DN and entryID with the saved values.
351 findbase_cb( Operation *op, SlapReply *rs )
353 slap_callback *sc = op->o_callback;
355 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
356 fbase_cookie *fc = sc->sc_private;
358 /* If no entryID, we're looking for the first time.
359 * Just store whatever we got.
361 if ( fc->fss->s_eid == NOID ) {
363 fc->fss->s_eid = rs->sr_entry->e_id;
364 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
366 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
367 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
369 /* OK, the DN is the same and the entryID is the same. Now
370 * see if the fdn resides in the scope.
373 switch ( fc->fss->s_op->ors_scope ) {
374 case LDAP_SCOPE_BASE:
375 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
377 case LDAP_SCOPE_ONELEVEL: {
379 dnParent( fc->fdn, &pdn );
380 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
382 case LDAP_SCOPE_SUBTREE:
383 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
385 #ifdef LDAP_SCOPE_SUBORDINATE
386 case LDAP_SCOPE_SUBORDINATE:
387 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
388 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
394 if ( rs->sr_err != LDAP_SUCCESS ) {
395 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
401 syncprov_findbase( Operation *op, fbase_cookie *fc )
403 opcookie *opc = op->o_callback->sc_private;
404 slap_overinst *on = opc->son;
405 syncprov_info_t *si = on->on_bi.bi_private;
407 slap_callback cb = {0};
409 SlapReply frs = { REP_RESULT };
414 cb.sc_response = findbase_cb;
417 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
418 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
419 fop.o_callback = &cb;
420 fop.o_tag = LDAP_REQ_SEARCH;
421 fop.ors_scope = LDAP_SCOPE_BASE;
422 fop.ors_deref = fc->fss->s_op->ors_deref;
423 fop.ors_limit = NULL;
425 fop.ors_tlimit = SLAP_NO_LIMIT;
426 fop.ors_attrs = slap_anlist_no_attrs;
427 fop.ors_attrsonly = 1;
428 fop.ors_filter = fc->fss->s_op->ors_filter;
429 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
431 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
433 fop.o_bd->bd_info = on->on_info->oi_orig;
434 rc = fop.o_bd->be_search( &fop, &frs );
435 fop.o_bd->bd_info = (BackendInfo *)on;
437 if ( fc->fbase ) return LDAP_SUCCESS;
439 /* If entryID has changed, then the base of this search has
440 * changed. Invalidate the psearch.
442 return LDAP_NO_SUCH_OBJECT;
446 * This function has three different purposes, but they all use a search
447 * that filters on entryCSN so they're combined here.
448 * 1: at startup time, after a contextCSN has been read from the database,
449 * we search for all entries with CSN >= contextCSN in case the contextCSN
450 * was not checkpointed at the previous shutdown.
452 * 2: when the current contextCSN is known and we have a sync cookie, we search
453 * for one entry with CSN <= the cookie CSN. (Used to search for =.) If an
454 * entry is found, the cookie CSN is valid, otherwise it is stale.
456 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
457 * CSN, and generate Present records for them. We always collect this result
458 * in SyncID sets, even if there's only one match.
460 #define FIND_MAXCSN 1
462 #define FIND_PRESENT 3
465 findmax_cb( Operation *op, SlapReply *rs )
467 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
468 struct berval *maxcsn = op->o_callback->sc_private;
469 Attribute *a = attr_find( rs->sr_entry->e_attrs,
470 slap_schema.si_ad_entryCSN );
472 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
473 maxcsn->bv_len = a->a_vals[0].bv_len;
474 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
481 findcsn_cb( Operation *op, SlapReply *rs )
483 slap_callback *sc = op->o_callback;
485 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
486 sc->sc_private = (void *)1;
491 /* Build a list of entryUUIDs for sending in a SyncID set */
495 typedef struct fpres_cookie {
502 findpres_cb( Operation *op, SlapReply *rs )
504 slap_callback *sc = op->o_callback;
505 fpres_cookie *pc = sc->sc_private;
507 int ret = SLAP_CB_CONTINUE;
509 switch ( rs->sr_type ) {
511 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
513 pc->uuids[pc->num].bv_val = pc->last;
514 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
515 pc->uuids[pc->num].bv_len );
517 pc->last = pc->uuids[pc->num].bv_val;
518 pc->uuids[pc->num].bv_val = NULL;
521 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
527 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
529 pc->uuids[pc->num].bv_val = pc->last;
531 pc->last = pc->uuids[0].bv_val;
541 syncprov_findcsn( Operation *op, int mode )
543 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
544 syncprov_info_t *si = on->on_bi.bi_private;
546 slap_callback cb = {0};
548 SlapReply frs = { REP_RESULT };
549 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
550 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
551 struct berval fbuf, maxcsn;
553 #ifdef LDAP_COMP_MATCH
554 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
556 AttributeAssertion eq = { NULL, BER_BVNULL };
558 int i, rc = LDAP_SUCCESS;
559 fpres_cookie pcookie;
560 sync_control *srs = NULL;
562 if ( mode != FIND_MAXCSN ) {
563 srs = op->o_controls[slap_cids.sc_LDAPsync];
565 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
571 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
572 /* We want pure entries, not referrals */
573 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
577 cf.f_av_desc = slap_schema.si_ad_entryCSN;
580 fop.o_callback = &cb;
581 fop.ors_limit = NULL;
582 fop.ors_tlimit = SLAP_NO_LIMIT;
583 fop.ors_filter = &cf;
584 fop.ors_filterstr = fbuf;
588 cf.f_choice = LDAP_FILTER_GE;
589 cf.f_av_value = si->si_ctxcsn;
590 fbuf.bv_len = sprintf( buf, "(entryCSN>=%s)",
591 cf.f_av_value.bv_val );
592 fop.ors_attrsonly = 0;
593 fop.ors_attrs = csn_anlist;
594 fop.ors_slimit = SLAP_NO_LIMIT;
595 cb.sc_private = &maxcsn;
596 cb.sc_response = findmax_cb;
597 strcpy( cbuf, si->si_ctxcsn.bv_val );
598 maxcsn.bv_val = cbuf;
599 maxcsn.bv_len = si->si_ctxcsn.bv_len;
602 cf.f_choice = LDAP_FILTER_LE;
603 cf.f_av_value = srs->sr_state.ctxcsn;
604 fbuf.bv_len = sprintf( buf, "(entryCSN<=%s)",
605 cf.f_av_value.bv_val );
606 fop.ors_attrsonly = 1;
607 fop.ors_attrs = slap_anlist_no_attrs;
609 cb.sc_private = NULL;
610 cb.sc_response = findcsn_cb;
613 af.f_choice = LDAP_FILTER_AND;
616 cf.f_choice = LDAP_FILTER_LE;
617 cf.f_av_value = srs->sr_state.ctxcsn;
618 cf.f_next = op->ors_filter;
619 fop.ors_filter = ⁡
620 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
621 fop.ors_attrsonly = 0;
622 fop.ors_attrs = uuid_anlist;
623 fop.ors_slimit = SLAP_NO_LIMIT;
624 cb.sc_private = &pcookie;
625 cb.sc_response = findpres_cb;
628 /* preallocate storage for a full set */
629 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
630 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
632 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
633 pcookie.uuids[0].bv_val = pcookie.last;
634 pcookie.uuids[0].bv_len = UUID_LEN;
635 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
636 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
637 pcookie.uuids[i].bv_len = UUID_LEN;
642 fop.o_bd->bd_info = on->on_info->oi_orig;
643 fop.o_bd->be_search( &fop, &frs );
644 fop.o_bd->bd_info = (BackendInfo *)on;
648 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
649 si->si_ctxcsn.bv_len = maxcsn.bv_len;
652 /* If matching CSN was not found, invalidate the context. */
653 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
656 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
657 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
664 /* Queue a persistent search response */
666 syncprov_qresp( opcookie *opc, syncops *so, int mode )
670 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
671 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
673 sr->s_dn.bv_val = (char *)(sr + 1);
674 sr->s_dn.bv_len = opc->sdn.bv_len;
676 sr->s_isreference = opc->sreference;
677 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
678 sr->s_ndn.bv_len = opc->sndn.bv_len;
679 *(sr->s_ndn.bv_val++) = '\0';
680 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
681 sr->s_uuid.bv_len = opc->suuid.bv_len;
682 *(sr->s_uuid.bv_val++) = '\0';
683 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
684 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
685 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
690 so->s_restail->s_next = sr;
693 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
697 /* Play back queued responses */
699 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue );
702 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
704 syncres *sr, *srnext;
710 op->o_bd->bd_info = (BackendInfo *)on->on_info;
711 for (sr = so->s_res; sr; sr=srnext) {
715 opc.sndn = sr->s_ndn;
716 opc.suuid = sr->s_uuid;
717 opc.sctxcsn = sr->s_csn;
718 opc.sreference = sr->s_isreference;
721 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
722 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
729 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );
732 be_entry_release_rw( op, e, 0 );
740 op->o_bd->bd_info = (BackendInfo *)on;
742 so->s_restail = NULL;
746 /* Send a persistent search response */
748 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue )
750 slap_overinst *on = opc->son;
751 syncprov_info_t *si = on->on_bi.bi_private;
753 SlapReply rs = { REP_SEARCH };
754 LDAPControl *ctrls[2];
755 struct berval cookie;
757 Attribute a_uuid = {0};
758 Operation sop = *so->s_op;
763 sop.o_tmpmemctx = op->o_tmpmemctx;
765 sop.o_controls = op->o_controls;
766 sop.o_private = op->o_private;
768 /* If queueing is allowed */
770 ldap_pvt_thread_mutex_lock( &so->s_mutex );
771 /* If we're still in refresh mode, must queue */
772 if (so->s_flags & PS_IS_REFRESHING) {
773 return syncprov_qresp( opc, so, mode );
775 /* If connection is free but queue is non-empty,
776 * try to flush the queue.
779 rs.sr_err = syncprov_qplay( &sop, on, so );
781 /* If the connection is busy, must queue */
782 if ( sop.o_conn->c_writewaiter || rs.sr_err == LDAP_BUSY ) {
783 return syncprov_qresp( opc, so, mode );
785 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
787 /* Queueing not allowed and conn is busy, give up */
788 if ( sop.o_conn->c_writewaiter )
793 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
795 e_uuid.e_attrs = &a_uuid;
796 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
797 a_uuid.a_nvals = &opc->suuid;
798 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
799 mode, ctrls, 0, 1, &cookie );
802 op->o_bd->bd_info = (BackendInfo *)on->on_info;
806 if ( rs.sr_entry->e_private )
807 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
808 if ( opc->sreference ) {
809 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
810 send_search_reference( &sop, &rs );
811 ber_bvarray_free( rs.sr_ref );
817 case LDAP_SYNC_MODIFY:
819 if ( rs.sr_entry->e_private )
820 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
821 rs.sr_attrs = sop.ors_attrs;
822 send_search_entry( &sop, &rs );
826 case LDAP_SYNC_DELETE:
827 e_uuid.e_attrs = NULL;
828 e_uuid.e_name = opc->sdn;
829 e_uuid.e_nname = opc->sndn;
830 rs.sr_entry = &e_uuid;
831 if ( opc->sreference ) {
832 struct berval bv = BER_BVNULL;
834 send_search_reference( &sop, &rs );
836 send_search_entry( &sop, &rs );
842 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
843 op->o_private = sop.o_private;
849 syncprov_free_syncop( syncops *so )
851 syncres *sr, *srnext;
852 GroupAssertion *ga, *gnext;
854 ldap_pvt_thread_mutex_lock( &so->s_mutex );
856 if ( so->s_inuse > 0 ) {
857 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
860 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
861 if ( so->s_flags & PS_IS_DETACHED ) {
862 filter_free( so->s_op->ors_filter );
863 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
869 ch_free( so->s_base.bv_val );
870 for ( sr=so->s_res; sr; sr=srnext ) {
874 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
879 syncprov_drop_psearch( syncops *so, int lock )
881 if ( so->s_flags & PS_IS_DETACHED ) {
883 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
884 so->s_op->o_conn->c_n_ops_executing--;
885 so->s_op->o_conn->c_n_ops_completed++;
886 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
889 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
891 syncprov_free_syncop( so );
897 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
899 slap_callback *sc = op->o_callback;
900 op->o_callback = sc->sc_next;
901 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
902 op->o_tmpfree( sc, op->o_tmpmemctx );
907 syncprov_op_abandon( Operation *op, SlapReply *rs )
909 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
910 syncprov_info_t *si = on->on_bi.bi_private;
911 syncops *so, *soprev;
913 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
914 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
915 soprev=so, so=so->s_next ) {
916 if ( so->s_op->o_connid == op->o_connid &&
917 so->s_op->o_msgid == op->orn_msgid ) {
918 so->s_op->o_abandon = 1;
919 soprev->s_next = so->s_next;
923 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
925 /* Is this really a Cancel exop? */
926 if ( op->o_tag != LDAP_REQ_ABANDON ) {
927 so->s_op->o_cancel = SLAP_CANCEL_ACK;
928 rs->sr_err = LDAP_CANCELLED;
929 send_ldap_result( so->s_op, rs );
930 if ( so->s_flags & PS_IS_DETACHED ) {
932 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
933 cb->sc_cleanup = syncprov_ab_cleanup;
934 cb->sc_next = op->o_callback;
936 return SLAP_CB_CONTINUE;
939 syncprov_drop_psearch( so, 0 );
941 return SLAP_CB_CONTINUE;
944 /* Find which persistent searches are affected by this operation */
946 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
948 slap_overinst *on = opc->son;
949 syncprov_info_t *si = on->on_bi.bi_private;
952 syncops *ss, *sprev, *snext;
959 fc.fdn = &op->o_req_ndn;
961 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
963 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
964 else dnParent( fc.fdn, &pdn );
965 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
969 if ( op->o_tag != LDAP_REQ_ADD ) {
970 op->o_bd->bd_info = (BackendInfo *)on->on_info;
971 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
972 op->o_bd->bd_info = (BackendInfo *)on;
979 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
980 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
981 opc->sreference = is_entry_referral( e );
983 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
984 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
986 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
990 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
991 opc->shead = si->si_ops;
993 for (ss = opc->shead, sprev = (syncops *)&si->si_ops; ss;
994 sprev = ss, ss=snext)
1005 /* If the base of the search is missing, signal a refresh */
1006 rc = syncprov_findbase( op, &fc );
1007 if ( rc != LDAP_SUCCESS ) {
1008 SlapReply rs = {REP_RESULT};
1009 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1010 "search base has changed" );
1011 sprev->s_next = snext;
1012 syncprov_drop_psearch( ss, 1 );
1016 /* If we're sending results now, look for this op in old matches */
1019 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1020 old=sm, sm=sm->sm_next ) {
1021 if ( sm->sm_op == ss ) {
1023 old->sm_next = sm->sm_next;
1024 op->o_tmpfree( sm, op->o_tmpmemctx );
1030 /* check if current o_req_dn is in scope and matches filter */
1031 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1032 LDAP_COMPARE_TRUE ) {
1034 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1035 sm->sm_next = opc->smatches;
1040 /* if found send UPDATE else send ADD */
1041 syncprov_sendresp( op, opc, ss, &e,
1042 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1044 } else if ( !saveit && found ) {
1046 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1050 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1052 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1053 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1054 be_entry_release_rw( op, e, 0 );
1055 op->o_bd->bd_info = (BackendInfo *)on;
1058 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1063 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1065 slap_callback *cb = op->o_callback;
1066 opcookie *opc = cb->sc_private;
1067 slap_overinst *on = opc->son;
1068 syncprov_info_t *si = on->on_bi.bi_private;
1069 syncmatches *sm, *snext;
1070 modtarget *mt, mtdummy;
1072 for (sm = opc->smatches; sm; sm=snext) {
1073 snext = sm->sm_next;
1074 syncprov_free_syncop( sm->sm_op );
1075 op->o_tmpfree( sm, op->o_tmpmemctx );
1078 /* Remove op from lock table */
1080 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1081 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1082 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1084 modinst *mi = mt->mt_mods;
1086 /* If there are more, promote the next one */
1087 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1088 if ( mi->mi_next ) {
1089 mt->mt_mods = mi->mi_next;
1090 mt->mt_op = mt->mt_mods->mi_op;
1091 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1093 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1094 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1095 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1096 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1097 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1101 if ( !BER_BVISNULL( &opc->suuid ))
1102 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1103 if ( !BER_BVISNULL( &opc->sndn ))
1104 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1105 if ( !BER_BVISNULL( &opc->sdn ))
1106 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1107 op->o_callback = cb->sc_next;
1108 op->o_tmpfree(cb, op->o_tmpmemctx);
1114 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1116 syncprov_info_t *si = on->on_bi.bi_private;
1119 struct berval bv[2];
1120 slap_callback cb = {0};
1121 int manage = get_manageDSAit(op);
1123 mod.sml_values = bv;
1124 bv[1].bv_val = NULL;
1125 bv[0] = si->si_ctxcsn;
1126 mod.sml_nvalues = NULL;
1127 mod.sml_desc = slap_schema.si_ad_contextCSN;
1128 mod.sml_op = LDAP_MOD_REPLACE;
1129 mod.sml_next = NULL;
1131 cb.sc_response = slap_null_cb;
1133 opm.o_tag = LDAP_REQ_MODIFY;
1134 opm.o_callback = &cb;
1135 opm.orm_modlist = &mod;
1136 opm.o_req_dn = op->o_bd->be_suffix[0];
1137 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1138 opm.o_bd->bd_info = on->on_info->oi_orig;
1139 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1140 opm.o_bd->be_modify( &opm, rs );
1141 opm.o_managedsait = manage;
1145 syncprov_add_slog( Operation *op, struct berval *csn )
1147 opcookie *opc = op->o_callback->sc_private;
1148 slap_overinst *on = opc->son;
1149 syncprov_info_t *si = on->on_bi.bi_private;
1155 /* Allocate a record. UUIDs are not NUL-terminated. */
1156 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1159 se->se_tag = op->o_tag;
1161 se->se_uuid.bv_val = (char *)(se+1);
1162 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1163 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1164 se->se_uuid.bv_len = opc->suuid.bv_len;
1166 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1167 se->se_csn.bv_val[csn->bv_len] = '\0';
1168 se->se_csn.bv_len = csn->bv_len;
1170 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1171 if ( sl->sl_head ) {
1172 sl->sl_tail->se_next = se;
1178 while ( sl->sl_num > sl->sl_size ) {
1180 sl->sl_head = se->se_next;
1181 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1182 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1185 if ( !sl->sl_head ) {
1189 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1193 /* Just set a flag if we found the matching entry */
1195 playlog_cb( Operation *op, SlapReply *rs )
1197 if ( rs->sr_type == REP_SEARCH ) {
1198 op->o_callback->sc_private = (void *)1;
1203 /* enter with sl->sl_mutex locked, release before returning */
1205 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1206 struct berval *oldcsn, struct berval *ctxcsn )
1208 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1209 syncprov_info_t *si = on->on_bi.bi_private;
1211 int i, j, ndel, num, nmods, mmods;
1214 if ( !sl->sl_num ) {
1215 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1223 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1224 num * UUID_LEN, op->o_tmpmemctx );
1226 uuids[0].bv_val = (char *)(uuids + num + 1);
1228 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1229 * and everything else at the end. Do this first so we can
1230 * unlock the list mutex.
1232 for ( se=sl->sl_head; se; se=se->se_next ) {
1233 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1234 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1235 if ( se->se_tag == LDAP_REQ_DELETE ) {
1242 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1243 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1244 uuids[j].bv_len = UUID_LEN;
1246 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1250 /* Zero out unused slots */
1251 for ( i=ndel; i < num - nmods; i++ )
1252 uuids[i].bv_len = 0;
1254 /* Mods must be validated to see if they belong in this delete set.
1258 /* Strip any duplicates */
1259 for ( i=0; i<nmods; i++ ) {
1260 for ( j=0; j<ndel; j++ ) {
1261 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1262 uuids[num - 1 - i].bv_len = 0;
1267 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1268 for ( j=0; j<i; j++ ) {
1269 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1270 uuids[num - 1 - i].bv_len = 0;
1279 SlapReply frs = { REP_RESULT };
1282 #ifdef LDAP_COMP_MATCH
1283 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1285 AttributeAssertion eq;
1287 slap_callback cb = {0};
1291 fop.o_sync_mode = 0;
1292 fop.o_callback = &cb;
1293 fop.ors_limit = NULL;
1294 fop.ors_tlimit = SLAP_NO_LIMIT;
1295 fop.ors_attrs = slap_anlist_all_attributes;
1296 fop.ors_attrsonly = 0;
1297 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1299 af.f_choice = LDAP_FILTER_AND;
1302 mf.f_choice = LDAP_FILTER_EQUALITY;
1304 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1305 mf.f_next = fop.ors_filter;
1307 fop.ors_filter = ⁡
1309 cb.sc_response = playlog_cb;
1310 fop.o_bd->bd_info = on->on_info->oi_orig;
1312 for ( i=ndel; i<num; i++ ) {
1313 if ( uuids[i].bv_len == 0 ) continue;
1315 mf.f_av_value = uuids[i];
1316 cb.sc_private = NULL;
1318 rc = fop.o_bd->be_search( &fop, &frs );
1320 /* If entry was not found, add to delete list */
1321 if ( !cb.sc_private ) {
1322 uuids[ndel++] = uuids[i];
1325 fop.o_bd->bd_info = (BackendInfo *)on;
1328 uuids[ndel].bv_val = NULL;
1329 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1334 syncprov_op_response( Operation *op, SlapReply *rs )
1336 opcookie *opc = op->o_callback->sc_private;
1337 slap_overinst *on = opc->son;
1338 syncprov_info_t *si = on->on_bi.bi_private;
1341 if ( rs->sr_err == LDAP_SUCCESS )
1343 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1344 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1346 /* Update our context CSN */
1348 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1349 slap_get_commit_csn( op, &maxcsn, &curcsn );
1350 if ( !BER_BVISNULL( &maxcsn ) ) {
1351 strcpy( cbuf, maxcsn.bv_val );
1352 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1353 strcpy( si->si_ctxcsnbuf, cbuf );
1354 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1358 /* Don't do any processing for consumer contextCSN updates */
1359 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1360 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1361 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1362 return SLAP_CB_CONTINUE;
1366 if ( si->si_chkops || si->si_chktime ) {
1368 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1372 if ( si->si_chktime &&
1373 (op->o_time - si->si_chklast >= si->si_chktime )) {
1375 si->si_chklast = op->o_time;
1378 syncprov_checkpoint( op, rs, on );
1381 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1383 opc->sctxcsn.bv_len = maxcsn.bv_len;
1384 opc->sctxcsn.bv_val = cbuf;
1386 /* Handle any persistent searches */
1390 case LDAP_REQ_MODIFY:
1391 case LDAP_REQ_MODRDN:
1392 case LDAP_REQ_EXTENDED:
1393 syncprov_matchops( op, opc, 0 );
1395 case LDAP_REQ_DELETE:
1396 /* for each match in opc->smatches:
1399 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1400 if ( sm->sm_op->s_op->o_abandon )
1402 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1403 LDAP_SYNC_DELETE, 1 );
1409 /* Add any log records */
1410 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1411 syncprov_add_slog( op, &curcsn );
1415 return SLAP_CB_CONTINUE;
1418 /* We don't use a subentry to store the context CSN any more.
1419 * We expose the current context CSN as an operational attribute
1420 * of the suffix entry.
1423 syncprov_op_compare( 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;
1427 int rc = SLAP_CB_CONTINUE;
1429 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1430 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1434 struct berval bv[2];
1436 e.e_name = op->o_bd->be_suffix[0];
1437 e.e_nname = op->o_bd->be_nsuffix[0];
1439 BER_BVZERO( &bv[1] );
1440 bv[0] = si->si_ctxcsn;
1442 a.a_desc = slap_schema.si_ad_contextCSN;
1444 a.a_nvals = a.a_vals;
1446 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1448 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1449 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1450 if ( ! rs->sr_err ) {
1451 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1452 goto return_results;
1455 if ( get_assert( op ) &&
1456 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1458 rs->sr_err = LDAP_ASSERTION_FAILED;
1459 goto return_results;
1463 rs->sr_err = LDAP_COMPARE_FALSE;
1465 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1466 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1467 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1468 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1470 rs->sr_err = LDAP_COMPARE_TRUE;
1475 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1477 send_ldap_result( op, rs );
1479 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1480 rs->sr_err = LDAP_SUCCESS;
1489 syncprov_op_mod( Operation *op, SlapReply *rs )
1491 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1492 syncprov_info_t *si = on->on_bi.bi_private;
1494 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1496 (si->si_ops ? sizeof(modinst) : 0 ),
1498 opcookie *opc = (opcookie *)(cb+1);
1500 cb->sc_response = syncprov_op_response;
1501 cb->sc_cleanup = syncprov_op_cleanup;
1502 cb->sc_private = opc;
1503 cb->sc_next = op->o_callback;
1504 op->o_callback = cb;
1506 /* If there are active persistent searches, lock this operation.
1507 * See seqmod.c for the locking logic on its own.
1510 modtarget *mt, mtdummy;
1513 mi = (modinst *)(opc+1);
1516 /* See if we're already modifying this entry... */
1518 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1519 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1521 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1522 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1523 mt->mt_tail->mi_next = mi;
1525 /* wait for this op to get to head of list */
1526 while ( mt->mt_mods != mi ) {
1527 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1528 ldap_pvt_thread_yield();
1529 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1531 /* clean up if the caller is giving up */
1532 if ( op->o_abandon ) {
1534 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1536 m2->mi_next = mi->mi_next;
1537 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1538 op->o_tmpfree( cb, op->o_tmpmemctx );
1539 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1540 return SLAPD_ABANDON;
1543 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1545 /* Record that we're modifying this entry now */
1546 mt = ch_malloc( sizeof(modtarget) );
1549 mt->mt_op = mi->mi_op;
1550 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1551 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1552 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1556 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1557 syncprov_matchops( op, opc, 1 );
1559 return SLAP_CB_CONTINUE;
1563 syncprov_op_extended( Operation *op, SlapReply *rs )
1565 if ( exop_is_write( op ))
1566 return syncprov_op_mod( op, rs );
1568 return SLAP_CB_CONTINUE;
1571 typedef struct searchstate {
1572 slap_overinst *ss_on;
1578 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1580 if ( rs->sr_ctrls ) {
1581 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1582 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1583 rs->sr_ctrls = NULL;
1589 syncprov_detach_op( Operation *op, syncops *so )
1595 GroupAssertion *g1, *g2;
1597 /* count the search attrs */
1598 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1599 alen += op->ors_attrs[i].an_name.bv_len + 1;
1601 /* Make a new copy of the operation */
1602 size = sizeof(Operation) + sizeof(Opheader) +
1603 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1604 op->o_req_dn.bv_len + 1 +
1605 op->o_req_ndn.bv_len + 1 +
1606 op->o_ndn.bv_len + 1 +
1607 so->s_filterstr.bv_len + 1;
1608 op2 = (Operation *)ch_calloc( 1, size );
1609 op2->o_hdr = (Opheader *)(op2+1);
1611 /* Copy the fields we care about explicitly, leave the rest alone */
1612 *op2->o_hdr = *op->o_hdr;
1613 op2->o_tag = op->o_tag;
1614 op2->o_time = op->o_time;
1615 op2->o_bd = op->o_bd;
1616 op2->o_request = op->o_request;
1619 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1620 ptr = (char *)(op2->ors_attrs+i+1);
1621 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1622 op2->ors_attrs[i] = op->ors_attrs[i];
1623 op2->ors_attrs[i].an_name.bv_val = ptr;
1624 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1626 BER_BVZERO( &op2->ors_attrs[i].an_name );
1628 ptr = (char *)(op2->o_hdr + 1);
1630 op2->o_authz = op->o_authz;
1631 op2->o_ndn.bv_val = ptr;
1632 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1633 op2->o_dn = op2->o_ndn;
1634 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1635 op2->o_req_dn.bv_val = ptr;
1636 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1637 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1638 op2->o_req_ndn.bv_val = ptr;
1639 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1640 op2->ors_filterstr.bv_val = ptr;
1641 strcpy( ptr, so->s_filterstr.bv_val );
1642 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1643 op2->ors_filter = str2filter( ptr );
1646 /* Copy any cached group ACLs individually */
1647 op2->o_groups = NULL;
1648 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1649 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1651 strcpy( g2->ga_ndn, g1->ga_ndn );
1652 g2->ga_next = op2->o_groups;
1656 /* Add op2 to conn so abandon will find us */
1657 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1658 op->o_conn->c_n_ops_executing++;
1659 op->o_conn->c_n_ops_completed--;
1660 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1661 so->s_flags |= PS_IS_DETACHED;
1662 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1666 syncprov_search_response( Operation *op, SlapReply *rs )
1668 searchstate *ss = op->o_callback->sc_private;
1669 slap_overinst *on = ss->ss_on;
1670 syncprov_info_t *si = on->on_bi.bi_private;
1671 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1673 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1675 /* If we got a referral without a referral object, there's
1676 * something missing that we cannot replicate. Just ignore it.
1677 * The consumer will abort because we didn't send the expected
1680 if ( !rs->sr_entry ) {
1681 assert( rs->sr_entry );
1682 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1683 return SLAP_CB_CONTINUE;
1685 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1686 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1687 slap_schema.si_ad_entryCSN );
1689 /* Don't send the ctx entry twice */
1690 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1691 return LDAP_SUCCESS;
1693 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1695 rs->sr_ctrls[1] = NULL;
1696 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1697 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1698 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1699 struct berval cookie;
1701 slap_compose_sync_cookie( op, &cookie,
1702 &op->ors_filter->f_and->f_ava->aa_value,
1703 srs->sr_state.rid );
1705 /* Is this a regular refresh? */
1707 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1709 rs->sr_ctrls[1] = NULL;
1710 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1711 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1712 LDAP_SYNC_REFRESH_DELETES );
1715 /* It's RefreshAndPersist, transition to Persist phase */
1716 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1717 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1718 &cookie, 1, NULL, 0 );
1719 /* Flush any queued persist messages */
1720 if ( ss->ss_so->s_res ) {
1721 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1723 syncprov_qplay( op, on, ss->ss_so );
1726 /* Turn off the refreshing flag */
1727 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1729 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1731 /* Detach this Op from frontend control */
1732 syncprov_detach_op( op, ss->ss_so );
1734 return LDAP_SUCCESS;
1738 return SLAP_CB_CONTINUE;
1742 syncprov_op_search( Operation *op, SlapReply *rs )
1744 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1745 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1747 int gotstate = 0, nochange = 0, do_present = 1;
1748 Filter *fand, *fava;
1749 syncops *sop = NULL;
1752 struct berval ctxcsn;
1753 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1755 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1757 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1758 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1762 srs = op->o_controls[slap_cids.sc_LDAPsync];
1763 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1765 /* If this is a persistent search, set it up right away */
1766 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1776 so.s_flags = PS_IS_REFRESHING;
1777 /* syncprov_findbase expects to be called as a callback... */
1778 sc.sc_private = &opc;
1780 cb = op->o_callback;
1781 op->o_callback = ≻
1782 rs->sr_err = syncprov_findbase( op, &fc );
1783 op->o_callback = cb;
1785 if ( rs->sr_err != LDAP_SUCCESS ) {
1786 send_ldap_result( op, rs );
1789 sop = ch_malloc( sizeof( syncops ));
1791 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1792 sop->s_rid = srs->sr_state.rid;
1795 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1796 sop->s_next = si->si_ops;
1798 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1801 /* snapshot the ctxcsn */
1802 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1803 strcpy( csnbuf, si->si_ctxcsnbuf );
1804 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1805 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1806 ctxcsn.bv_val = csnbuf;
1808 /* If we have a cookie, handle the PRESENT lookups */
1809 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1812 /* The cookie was validated when it was parsed, just use it */
1814 /* If just Refreshing and nothing has changed, shortcut it */
1815 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1817 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1818 LDAPControl *ctrls[2];
1822 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1823 NULL, LDAP_SYNC_REFRESH_DELETES );
1824 rs->sr_ctrls = ctrls;
1825 rs->sr_err = LDAP_SUCCESS;
1826 send_ldap_result( op, rs );
1827 rs->sr_ctrls = NULL;
1832 /* Do we have a sessionlog for this search? */
1835 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1836 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1838 /* mutex is unlocked in playlog */
1839 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1841 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1844 /* Is the CSN still present in the database? */
1845 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1846 /* No, so a reload is required */
1847 #if 0 /* the consumer doesn't seem to send this hint */
1848 if ( op->o_sync_rhint == 0 ) {
1849 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1855 /* If changed and doing Present lookup, send Present UUIDs */
1856 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1858 send_ldap_result( op, rs );
1865 /* Append CSN range to search filter, save original filter
1866 * for persistent search evaluation
1869 sop->s_filterstr= op->ors_filterstr;
1872 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1873 fand->f_choice = LDAP_FILTER_AND;
1874 fand->f_next = NULL;
1875 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1876 fava->f_choice = LDAP_FILTER_LE;
1877 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1878 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1879 #ifdef LDAP_COMP_MATCH
1880 fava->f_ava->aa_cf = NULL;
1882 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1885 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1886 fava = fava->f_next;
1887 fava->f_choice = LDAP_FILTER_GE;
1888 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1889 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1890 #ifdef LDAP_COMP_MATCH
1891 fava->f_ava->aa_cf = NULL;
1893 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1895 fava->f_next = op->ors_filter;
1896 op->ors_filter = fand;
1897 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1899 /* Let our callback add needed info to returned entries */
1900 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1901 ss = (searchstate *)(cb+1);
1904 ss->ss_present = do_present;
1905 cb->sc_response = syncprov_search_response;
1906 cb->sc_cleanup = syncprov_search_cleanup;
1907 cb->sc_private = ss;
1908 cb->sc_next = op->o_callback;
1909 op->o_callback = cb;
1911 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1912 op->o_sync_mode &= SLAP_CONTROL_MASK;
1915 /* If this is a persistent search and no changes were reported during
1916 * the refresh phase, just invoke the response callback to transition
1917 * us into persist phase
1920 rs->sr_err = LDAP_SUCCESS;
1921 rs->sr_nentries = 0;
1922 send_ldap_result( op, rs );
1925 return SLAP_CB_CONTINUE;
1929 syncprov_operational(
1933 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1934 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1936 if ( rs->sr_entry &&
1937 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1939 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1940 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1941 Attribute *a, **ap = NULL;
1943 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1944 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1949 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1951 a = ch_malloc( sizeof(Attribute));
1952 a->a_desc = slap_schema.si_ad_contextCSN;
1953 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1954 a->a_vals[1].bv_val = NULL;
1955 a->a_nvals = a->a_vals;
1961 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1963 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1965 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1967 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1970 return SLAP_CB_CONTINUE;
1982 slap_overinst *on = (slap_overinst *)be->bd_info;
1983 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1985 if ( strcasecmp( argv[ 0 ], "syncprov-checkpoint" ) == 0 ) {
1987 fprintf( stderr, "%s: line %d: wrong number of arguments in "
1988 "\"syncprov-checkpoint <ops> <minutes>\"\n", fname, lineno );
1991 si->si_chkops = atoi( argv[1] );
1992 si->si_chktime = atoi( argv[2] ) * 60;
1995 } else if ( strcasecmp( argv[0], "syncprov-sessionlog" ) == 0 ) {
1999 fprintf( stderr, "%s: line %d: wrong number of arguments in "
2000 "\"syncprov-sessionlog <size>\"\n", fname, lineno );
2003 size = atoi( argv[1] );
2006 "%s: line %d: session log size %d is negative\n",
2007 fname, lineno, size );
2012 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2013 sl->sl_mincsn.bv_val = (char *)(sl+1);
2014 sl->sl_mincsn.bv_len = 0;
2016 sl->sl_head = sl->sl_tail = NULL;
2017 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2024 return SLAP_CONF_UNKNOWN;
2027 /* Cheating - we have no thread pool context for these functions,
2030 typedef struct thread_keys {
2033 ldap_pvt_thread_pool_keyfree_t *xfree;
2037 /* A fake thread context */
2038 static thread_keys thrctx[MAXKEYS];
2040 /* Read any existing contextCSN from the underlying db.
2041 * Then search for any entries newer than that. If no value exists,
2042 * just generate it. Cache whatever result.
2049 slap_overinst *on = (slap_overinst *) be->bd_info;
2050 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2053 char opbuf[OPERATION_BUFFER_SIZE];
2054 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2055 Operation *op = (Operation *)opbuf;
2060 if ( slapMode & SLAP_TOOL_MODE ) {
2064 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2069 connection_fake_init( &conn, op, thrctx );
2071 op->o_dn = be->be_rootdn;
2072 op->o_ndn = be->be_rootndn;
2074 ctxcsnbuf[0] = '\0';
2076 op->o_bd->bd_info = on->on_info->oi_orig;
2077 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2078 slap_schema.si_ad_contextCSN, 0, &e );
2081 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2083 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2084 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2085 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2086 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2087 si->si_ctxcsn.bv_len );
2088 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2089 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2091 be_entry_release_rw( op, e, 0 );
2092 op->o_bd->bd_info = (BackendInfo *)on;
2093 op->o_req_dn = be->be_suffix[0];
2094 op->o_req_ndn = be->be_nsuffix[0];
2095 op->ors_scope = LDAP_SCOPE_SUBTREE;
2096 syncprov_findcsn( op, FIND_MAXCSN );
2097 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2098 /* If we're also a consumer, and we didn't find the context entry,
2099 * then don't generate anything, wait for our provider to send it
2105 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2106 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2107 &si->si_ctxcsn, 0 );
2110 /* If our ctxcsn is different from what was read from the root
2111 * entry, write the new value out.
2113 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2114 SlapReply rs = {REP_RESULT};
2115 syncprov_checkpoint( op, &rs, on );
2119 op->o_bd->bd_info = (BackendInfo *)on;
2123 /* Write the current contextCSN into the underlying db.
2130 slap_overinst *on = (slap_overinst *) be->bd_info;
2131 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2134 if ( slapMode & SLAP_TOOL_MODE ) {
2137 if ( si->si_numops ) {
2139 char opbuf[OPERATION_BUFFER_SIZE];
2140 Operation *op = (Operation *)opbuf;
2141 SlapReply rs = {REP_RESULT};
2143 connection_fake_init( &conn, op, thrctx );
2145 op->o_dn = be->be_rootdn;
2146 op->o_ndn = be->be_rootndn;
2147 syncprov_checkpoint( op, &rs, on );
2149 for ( i=0; thrctx[i].key; i++) {
2150 if ( thrctx[i].xfree )
2151 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2152 thrctx[i].key = NULL;
2163 slap_overinst *on = (slap_overinst *)be->bd_info;
2164 syncprov_info_t *si;
2166 si = ch_calloc(1, sizeof(syncprov_info_t));
2167 on->on_bi.bi_private = si;
2168 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2169 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2170 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2171 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2173 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2174 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2176 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2177 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2183 syncprov_db_destroy(
2187 slap_overinst *on = (slap_overinst *)be->bd_info;
2188 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2191 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2192 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2193 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2200 static int syncprov_parseCtrl (
2209 struct berval cookie = BER_BVNULL;
2213 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2214 rs->sr_text = "Sync control specified multiple times";
2215 return LDAP_PROTOCOL_ERROR;
2218 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2219 rs->sr_text = "Sync control specified with pagedResults control";
2220 return LDAP_PROTOCOL_ERROR;
2223 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2224 rs->sr_text = "Sync control value is empty (or absent)";
2225 return LDAP_PROTOCOL_ERROR;
2228 /* Parse the control value
2229 * syncRequestValue ::= SEQUENCE {
2234 * refreshAndPersist (3)
2236 * cookie syncCookie OPTIONAL
2240 ber = ber_init( &ctrl->ldctl_value );
2242 rs->sr_text = "internal error";
2246 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2247 rs->sr_text = "Sync control : mode decoding error";
2248 return LDAP_PROTOCOL_ERROR;
2252 case LDAP_SYNC_REFRESH_ONLY:
2253 mode = SLAP_SYNC_REFRESH;
2255 case LDAP_SYNC_REFRESH_AND_PERSIST:
2256 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2259 rs->sr_text = "Sync control : unknown update mode";
2260 return LDAP_PROTOCOL_ERROR;
2263 tag = ber_peek_tag( ber, &len );
2265 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2266 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2267 rs->sr_text = "Sync control : cookie decoding error";
2268 return LDAP_PROTOCOL_ERROR;
2271 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2272 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2273 rs->sr_text = "Sync control : rhint decoding error";
2274 return LDAP_PROTOCOL_ERROR;
2277 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2278 rs->sr_text = "Sync control : decoding error";
2279 return LDAP_PROTOCOL_ERROR;
2281 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2282 sr->sr_rhint = rhint;
2283 if (!BER_BVISNULL(&cookie)) {
2284 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2285 slap_parse_sync_cookie( &sr->sr_state );
2288 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2290 (void) ber_free( ber, 1 );
2292 op->o_sync = ctrl->ldctl_iscritical
2293 ? SLAP_CONTROL_CRITICAL
2294 : SLAP_CONTROL_NONCRITICAL;
2296 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2298 return LDAP_SUCCESS;
2301 /* This overlay is set up for dynamic loading via moduleload. For static
2302 * configuration, you'll need to arrange for the slap_overinst to be
2303 * initialized and registered by some other function inside slapd.
2306 static slap_overinst syncprov;
2313 rc = register_supported_control( LDAP_CONTROL_SYNC,
2314 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2315 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2316 if ( rc != LDAP_SUCCESS ) {
2317 fprintf( stderr, "Failed to register control %d\n", rc );
2321 syncprov.on_bi.bi_type = "syncprov";
2322 syncprov.on_bi.bi_db_init = syncprov_db_init;
2323 syncprov.on_bi.bi_db_config = syncprov_db_config;
2324 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2325 syncprov.on_bi.bi_db_open = syncprov_db_open;
2326 syncprov.on_bi.bi_db_close = syncprov_db_close;
2328 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2329 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2331 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2332 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2333 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2334 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2335 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2336 syncprov.on_bi.bi_op_search = syncprov_op_search;
2337 syncprov.on_bi.bi_extended = syncprov_op_extended;
2338 syncprov.on_bi.bi_operational = syncprov_operational;
2340 return overlay_register( &syncprov );
2343 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2345 init_module( int argc, char *argv[] )
2347 return syncprov_init();
2349 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2351 #endif /* defined(SLAPD_OVER_SYNCPROV) */