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>
30 /* A modify request on a particular entry */
31 typedef struct modinst {
32 struct modinst *mi_next;
36 typedef struct modtarget {
37 struct modinst *mt_mods;
38 struct modinst *mt_tail;
40 ldap_pvt_thread_mutex_t mt_mutex;
43 /* A queued result of a persistent search */
44 typedef struct syncres {
45 struct syncres *s_next;
54 /* Record of a persistent search */
55 typedef struct syncops {
56 struct syncops *s_next;
57 struct berval s_base; /* ndn of search base */
58 ID s_eid; /* entryID of search base */
59 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
87 #define PS_IS_DETACHED 0x02
89 /* Record of which searches matched at premodify step */
90 typedef struct syncmatches {
91 struct syncmatches *sm_next;
95 /* Session log data */
96 typedef struct slog_entry {
97 struct slog_entry *se_next;
98 struct berval se_uuid;
103 typedef struct sessionlog {
104 struct berval sl_mincsn;
109 ldap_pvt_thread_mutex_t sl_mutex;
112 /* The main state for this overlay */
113 typedef struct syncprov_info_t {
115 struct berval si_ctxcsn; /* ldapsync context */
116 int si_chkops; /* checkpointing info */
118 int si_numops; /* number of ops since last checkpoint */
119 time_t si_chklast; /* time of last checkpoint */
120 Avlnode *si_mods; /* entries being modified */
122 ldap_pvt_thread_mutex_t si_csn_mutex;
123 ldap_pvt_thread_mutex_t si_ops_mutex;
124 ldap_pvt_thread_mutex_t si_mods_mutex;
125 char si_ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
128 typedef struct opcookie {
130 syncmatches *smatches;
131 struct berval sdn; /* DN of entry, for deletes */
133 struct berval suuid; /* UUID of entry */
134 struct berval sctxcsn;
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) {
714 opc.sndn = sr->s_ndn;
715 opc.suuid = sr->s_uuid;
716 opc.sctxcsn = sr->s_csn;
717 opc.sreference = sr->s_isreference;
720 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
721 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
728 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );
731 be_entry_release_rw( op, e, 0 );
739 op->o_bd->bd_info = (BackendInfo *)on;
741 so->s_restail = NULL;
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;
760 if ( so->s_op->o_abandon )
761 return SLAPD_ABANDON;
765 sop.o_tmpmemctx = op->o_tmpmemctx;
767 sop.o_controls = op->o_controls;
768 sop.o_private = op->o_private;
770 /* If queueing is allowed */
772 ldap_pvt_thread_mutex_lock( &so->s_mutex );
773 /* If we're still in refresh mode, must queue */
774 if (so->s_flags & PS_IS_REFRESHING) {
775 return syncprov_qresp( opc, so, mode );
777 /* If connection is free but queue is non-empty,
778 * try to flush the queue.
781 rs.sr_err = syncprov_qplay( &sop, on, so );
783 /* If the connection is busy, must queue */
784 if ( sop.o_conn->c_writewaiter || rs.sr_err == LDAP_BUSY ) {
785 return syncprov_qresp( opc, so, mode );
787 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
789 /* If syncprov_qplay returned any other error, bail out. */
794 /* Queueing not allowed and conn is busy, give up */
795 if ( sop.o_conn->c_writewaiter )
800 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
802 e_uuid.e_attrs = &a_uuid;
803 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
804 a_uuid.a_nvals = &opc->suuid;
805 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
806 mode, ctrls, 0, 1, &cookie );
809 op->o_bd->bd_info = (BackendInfo *)on->on_info;
813 if ( rs.sr_entry->e_private )
814 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
815 if ( opc->sreference ) {
816 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
817 send_search_reference( &sop, &rs );
818 ber_bvarray_free( rs.sr_ref );
824 case LDAP_SYNC_MODIFY:
826 if ( rs.sr_entry->e_private )
827 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
828 rs.sr_attrs = sop.ors_attrs;
829 send_search_entry( &sop, &rs );
833 case LDAP_SYNC_DELETE:
834 e_uuid.e_attrs = NULL;
835 e_uuid.e_name = opc->sdn;
836 e_uuid.e_nname = opc->sndn;
837 rs.sr_entry = &e_uuid;
838 if ( opc->sreference ) {
839 struct berval bv = BER_BVNULL;
841 send_search_reference( &sop, &rs );
843 send_search_entry( &sop, &rs );
849 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
850 op->o_private = sop.o_private;
852 /* Check queue again here; if we were hanging in a send and eventually
853 * recovered, there may be more to send now. But don't check if the
854 * original psearch has been abandoned.
856 if ( so->s_op->o_abandon )
857 return SLAPD_ABANDON;
859 if ( rs.sr_err == LDAP_SUCCESS && queue && so->s_res ) {
860 ldap_pvt_thread_mutex_lock( &so->s_mutex );
861 rs.sr_err = syncprov_qplay( &sop, on, so );
862 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
868 syncprov_free_syncop( syncops *so )
870 syncres *sr, *srnext;
871 GroupAssertion *ga, *gnext;
873 ldap_pvt_thread_mutex_lock( &so->s_mutex );
875 if ( so->s_inuse > 0 ) {
876 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
879 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
880 if ( so->s_flags & PS_IS_DETACHED ) {
881 filter_free( so->s_op->ors_filter );
882 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
888 ch_free( so->s_base.bv_val );
889 for ( sr=so->s_res; sr; sr=srnext ) {
893 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
898 syncprov_drop_psearch( syncops *so, int lock )
900 if ( so->s_flags & PS_IS_DETACHED ) {
902 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
903 so->s_op->o_conn->c_n_ops_executing--;
904 so->s_op->o_conn->c_n_ops_completed++;
905 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
908 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
910 syncprov_free_syncop( so );
916 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
918 slap_callback *sc = op->o_callback;
919 op->o_callback = sc->sc_next;
920 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
921 op->o_tmpfree( sc, op->o_tmpmemctx );
926 syncprov_op_abandon( Operation *op, SlapReply *rs )
928 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
929 syncprov_info_t *si = on->on_bi.bi_private;
930 syncops *so, *soprev;
932 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
933 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
934 soprev=so, so=so->s_next ) {
935 if ( so->s_op->o_connid == op->o_connid &&
936 so->s_op->o_msgid == op->orn_msgid ) {
937 so->s_op->o_abandon = 1;
938 soprev->s_next = so->s_next;
942 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
944 /* Is this really a Cancel exop? */
945 if ( op->o_tag != LDAP_REQ_ABANDON ) {
946 so->s_op->o_cancel = SLAP_CANCEL_ACK;
947 rs->sr_err = LDAP_CANCELLED;
948 send_ldap_result( so->s_op, rs );
949 if ( so->s_flags & PS_IS_DETACHED ) {
951 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
952 cb->sc_cleanup = syncprov_ab_cleanup;
953 cb->sc_next = op->o_callback;
955 return SLAP_CB_CONTINUE;
958 syncprov_drop_psearch( so, 0 );
960 return SLAP_CB_CONTINUE;
963 /* Find which persistent searches are affected by this operation */
965 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
967 slap_overinst *on = opc->son;
968 syncprov_info_t *si = on->on_bi.bi_private;
971 syncops *ss, *sprev, *snext;
978 fc.fdn = &op->o_req_ndn;
980 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
982 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
983 else dnParent( fc.fdn, &pdn );
984 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
988 if ( op->o_tag != LDAP_REQ_ADD ) {
989 op->o_bd->bd_info = (BackendInfo *)on->on_info;
990 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
991 /* If we're sending responses now, make a copy and unlock the DB */
992 if ( e && !saveit ) {
993 Entry *e2 = entry_dup( e );
994 be_entry_release_rw( op, e, 0 );
997 op->o_bd->bd_info = (BackendInfo *)on;
1004 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1005 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1006 opc->sreference = is_entry_referral( e );
1008 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1009 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1011 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1014 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1015 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1016 sprev = ss, ss=snext)
1027 /* If the base of the search is missing, signal a refresh */
1028 rc = syncprov_findbase( op, &fc );
1029 if ( rc != LDAP_SUCCESS ) {
1030 SlapReply rs = {REP_RESULT};
1031 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1032 "search base has changed" );
1033 sprev->s_next = snext;
1034 syncprov_drop_psearch( ss, 1 );
1038 /* If we're sending results now, look for this op in old matches */
1041 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1042 old=sm, sm=sm->sm_next ) {
1043 if ( sm->sm_op == ss ) {
1045 old->sm_next = sm->sm_next;
1046 op->o_tmpfree( sm, op->o_tmpmemctx );
1052 /* check if current o_req_dn is in scope and matches filter */
1053 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1054 LDAP_COMPARE_TRUE ) {
1056 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1057 sm->sm_next = opc->smatches;
1062 /* if found send UPDATE else send ADD */
1064 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1065 syncprov_sendresp( op, opc, ss, &e,
1066 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1067 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1070 } else if ( !saveit && found ) {
1072 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1073 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1074 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1077 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1079 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1080 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1081 be_entry_release_rw( op, e, 0 );
1082 op->o_bd->bd_info = (BackendInfo *)on;
1085 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1090 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1092 slap_callback *cb = op->o_callback;
1093 opcookie *opc = cb->sc_private;
1094 slap_overinst *on = opc->son;
1095 syncprov_info_t *si = on->on_bi.bi_private;
1096 syncmatches *sm, *snext;
1097 modtarget *mt, mtdummy;
1099 for (sm = opc->smatches; sm; sm=snext) {
1100 snext = sm->sm_next;
1101 syncprov_free_syncop( sm->sm_op );
1102 op->o_tmpfree( sm, op->o_tmpmemctx );
1105 /* Remove op from lock table */
1107 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1108 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1110 modinst *mi = mt->mt_mods;
1112 /* If there are more, promote the next one */
1113 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1114 if ( mi->mi_next ) {
1115 mt->mt_mods = mi->mi_next;
1116 mt->mt_op = mt->mt_mods->mi_op;
1117 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1119 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1120 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1121 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1125 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1126 if ( !BER_BVISNULL( &opc->suuid ))
1127 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1128 if ( !BER_BVISNULL( &opc->sndn ))
1129 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1130 if ( !BER_BVISNULL( &opc->sdn ))
1131 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1132 op->o_callback = cb->sc_next;
1133 op->o_tmpfree(cb, op->o_tmpmemctx);
1139 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1141 syncprov_info_t *si = on->on_bi.bi_private;
1144 struct berval bv[2];
1145 slap_callback cb = {0};
1146 int manage = get_manageDSAit(op);
1148 mod.sml_values = bv;
1149 bv[1].bv_val = NULL;
1150 bv[0] = si->si_ctxcsn;
1151 mod.sml_nvalues = NULL;
1152 mod.sml_desc = slap_schema.si_ad_contextCSN;
1153 mod.sml_op = LDAP_MOD_REPLACE;
1155 mod.sml_next = NULL;
1157 cb.sc_response = slap_null_cb;
1159 opm.o_tag = LDAP_REQ_MODIFY;
1160 opm.o_callback = &cb;
1161 opm.orm_modlist = &mod;
1162 opm.o_req_dn = op->o_bd->be_suffix[0];
1163 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1164 opm.o_bd->bd_info = on->on_info->oi_orig;
1165 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1166 opm.o_bd->be_modify( &opm, rs );
1167 opm.o_managedsait = manage;
1171 syncprov_add_slog( Operation *op, struct berval *csn )
1173 opcookie *opc = op->o_callback->sc_private;
1174 slap_overinst *on = opc->son;
1175 syncprov_info_t *si = on->on_bi.bi_private;
1181 /* Allocate a record. UUIDs are not NUL-terminated. */
1182 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1185 se->se_tag = op->o_tag;
1187 se->se_uuid.bv_val = (char *)(se+1);
1188 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1189 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1190 se->se_uuid.bv_len = opc->suuid.bv_len;
1192 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1193 se->se_csn.bv_val[csn->bv_len] = '\0';
1194 se->se_csn.bv_len = csn->bv_len;
1196 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1197 if ( sl->sl_head ) {
1198 sl->sl_tail->se_next = se;
1204 while ( sl->sl_num > sl->sl_size ) {
1206 sl->sl_head = se->se_next;
1207 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1208 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1211 if ( !sl->sl_head ) {
1215 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1219 /* Just set a flag if we found the matching entry */
1221 playlog_cb( Operation *op, SlapReply *rs )
1223 if ( rs->sr_type == REP_SEARCH ) {
1224 op->o_callback->sc_private = (void *)1;
1229 /* enter with sl->sl_mutex locked, release before returning */
1231 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1232 struct berval *oldcsn, struct berval *ctxcsn )
1234 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1235 syncprov_info_t *si = on->on_bi.bi_private;
1237 int i, j, ndel, num, nmods, mmods;
1240 if ( !sl->sl_num ) {
1241 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1249 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1250 num * UUID_LEN, op->o_tmpmemctx );
1252 uuids[0].bv_val = (char *)(uuids + num + 1);
1254 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1255 * and everything else at the end. Do this first so we can
1256 * unlock the list mutex.
1258 for ( se=sl->sl_head; se; se=se->se_next ) {
1259 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1260 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1261 if ( se->se_tag == LDAP_REQ_DELETE ) {
1268 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1269 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1270 uuids[j].bv_len = UUID_LEN;
1272 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1276 /* Zero out unused slots */
1277 for ( i=ndel; i < num - nmods; i++ )
1278 uuids[i].bv_len = 0;
1280 /* Mods must be validated to see if they belong in this delete set.
1284 /* Strip any duplicates */
1285 for ( i=0; i<nmods; i++ ) {
1286 for ( j=0; j<ndel; j++ ) {
1287 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1288 uuids[num - 1 - i].bv_len = 0;
1293 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1294 for ( j=0; j<i; j++ ) {
1295 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1296 uuids[num - 1 - i].bv_len = 0;
1305 SlapReply frs = { REP_RESULT };
1308 #ifdef LDAP_COMP_MATCH
1309 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1311 AttributeAssertion eq;
1313 slap_callback cb = {0};
1317 fop.o_sync_mode = 0;
1318 fop.o_callback = &cb;
1319 fop.ors_limit = NULL;
1320 fop.ors_tlimit = SLAP_NO_LIMIT;
1321 fop.ors_attrs = slap_anlist_all_attributes;
1322 fop.ors_attrsonly = 0;
1323 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1325 af.f_choice = LDAP_FILTER_AND;
1328 mf.f_choice = LDAP_FILTER_EQUALITY;
1330 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1331 mf.f_next = fop.ors_filter;
1333 fop.ors_filter = ⁡
1335 cb.sc_response = playlog_cb;
1336 fop.o_bd->bd_info = on->on_info->oi_orig;
1338 for ( i=ndel; i<num; i++ ) {
1339 if ( uuids[i].bv_len == 0 ) continue;
1341 mf.f_av_value = uuids[i];
1342 cb.sc_private = NULL;
1344 rc = fop.o_bd->be_search( &fop, &frs );
1346 /* If entry was not found, add to delete list */
1347 if ( !cb.sc_private ) {
1348 uuids[ndel++] = uuids[i];
1351 fop.o_bd->bd_info = (BackendInfo *)on;
1354 uuids[ndel].bv_val = NULL;
1355 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1360 syncprov_op_response( Operation *op, SlapReply *rs )
1362 opcookie *opc = op->o_callback->sc_private;
1363 slap_overinst *on = opc->son;
1364 syncprov_info_t *si = on->on_bi.bi_private;
1367 if ( rs->sr_err == LDAP_SUCCESS )
1369 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1370 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1372 /* Update our context CSN */
1374 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1375 slap_get_commit_csn( op, &maxcsn, &curcsn );
1376 if ( !BER_BVISNULL( &maxcsn ) ) {
1377 strcpy( cbuf, maxcsn.bv_val );
1378 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1379 strcpy( si->si_ctxcsnbuf, cbuf );
1380 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1384 /* Don't do any processing for consumer contextCSN updates */
1385 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1386 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1387 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1388 return SLAP_CB_CONTINUE;
1392 if ( si->si_chkops || si->si_chktime ) {
1394 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1398 if ( si->si_chktime &&
1399 (op->o_time - si->si_chklast >= si->si_chktime )) {
1401 si->si_chklast = op->o_time;
1404 syncprov_checkpoint( op, rs, on );
1407 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1409 opc->sctxcsn.bv_len = maxcsn.bv_len;
1410 opc->sctxcsn.bv_val = cbuf;
1412 /* Handle any persistent searches */
1416 case LDAP_REQ_MODIFY:
1417 case LDAP_REQ_MODRDN:
1418 case LDAP_REQ_EXTENDED:
1419 syncprov_matchops( op, opc, 0 );
1421 case LDAP_REQ_DELETE:
1422 /* for each match in opc->smatches:
1425 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1426 if ( sm->sm_op->s_op->o_abandon )
1428 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1429 LDAP_SYNC_DELETE, 1 );
1435 /* Add any log records */
1436 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1437 syncprov_add_slog( op, &curcsn );
1441 return SLAP_CB_CONTINUE;
1444 /* We don't use a subentry to store the context CSN any more.
1445 * We expose the current context CSN as an operational attribute
1446 * of the suffix entry.
1449 syncprov_op_compare( Operation *op, SlapReply *rs )
1451 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1452 syncprov_info_t *si = on->on_bi.bi_private;
1453 int rc = SLAP_CB_CONTINUE;
1455 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1456 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1460 struct berval bv[2];
1462 e.e_name = op->o_bd->be_suffix[0];
1463 e.e_nname = op->o_bd->be_nsuffix[0];
1465 BER_BVZERO( &bv[1] );
1466 bv[0] = si->si_ctxcsn;
1468 a.a_desc = slap_schema.si_ad_contextCSN;
1470 a.a_nvals = a.a_vals;
1472 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1474 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1475 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1476 if ( ! rs->sr_err ) {
1477 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1478 goto return_results;
1481 if ( get_assert( op ) &&
1482 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1484 rs->sr_err = LDAP_ASSERTION_FAILED;
1485 goto return_results;
1489 rs->sr_err = LDAP_COMPARE_FALSE;
1491 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1492 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1493 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1494 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1496 rs->sr_err = LDAP_COMPARE_TRUE;
1501 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1503 send_ldap_result( op, rs );
1505 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1506 rs->sr_err = LDAP_SUCCESS;
1515 syncprov_op_mod( Operation *op, SlapReply *rs )
1517 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1518 syncprov_info_t *si = on->on_bi.bi_private;
1520 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1522 (si->si_ops ? sizeof(modinst) : 0 ),
1524 opcookie *opc = (opcookie *)(cb+1);
1526 cb->sc_response = syncprov_op_response;
1527 cb->sc_cleanup = syncprov_op_cleanup;
1528 cb->sc_private = opc;
1529 cb->sc_next = op->o_callback;
1530 op->o_callback = cb;
1532 /* If there are active persistent searches, lock this operation.
1533 * See seqmod.c for the locking logic on its own.
1536 modtarget *mt, mtdummy;
1539 mi = (modinst *)(opc+1);
1542 /* See if we're already modifying this entry... */
1544 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1545 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1547 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1548 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1549 mt->mt_tail->mi_next = mi;
1551 /* wait for this op to get to head of list */
1552 while ( mt->mt_mods != mi ) {
1553 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1554 ldap_pvt_thread_yield();
1555 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1557 /* clean up if the caller is giving up */
1558 if ( op->o_abandon ) {
1560 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1562 m2->mi_next = mi->mi_next;
1563 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1564 op->o_tmpfree( cb, op->o_tmpmemctx );
1565 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1566 return SLAPD_ABANDON;
1569 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1571 /* Record that we're modifying this entry now */
1572 mt = ch_malloc( sizeof(modtarget) );
1575 mt->mt_op = mi->mi_op;
1576 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1577 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1578 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1582 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1583 syncprov_matchops( op, opc, 1 );
1585 return SLAP_CB_CONTINUE;
1589 syncprov_op_extended( Operation *op, SlapReply *rs )
1591 if ( exop_is_write( op ))
1592 return syncprov_op_mod( op, rs );
1594 return SLAP_CB_CONTINUE;
1597 typedef struct searchstate {
1598 slap_overinst *ss_on;
1604 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1606 if ( rs->sr_ctrls ) {
1607 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1608 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1609 rs->sr_ctrls = NULL;
1615 syncprov_detach_op( Operation *op, syncops *so )
1621 GroupAssertion *g1, *g2;
1623 /* count the search attrs */
1624 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1625 alen += op->ors_attrs[i].an_name.bv_len + 1;
1627 /* Make a new copy of the operation */
1628 size = sizeof(Operation) + sizeof(Opheader) +
1629 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1630 op->o_req_dn.bv_len + 1 +
1631 op->o_req_ndn.bv_len + 1 +
1632 op->o_ndn.bv_len + 1 +
1633 so->s_filterstr.bv_len + 1;
1634 op2 = (Operation *)ch_calloc( 1, size );
1635 op2->o_hdr = (Opheader *)(op2+1);
1637 /* Copy the fields we care about explicitly, leave the rest alone */
1638 *op2->o_hdr = *op->o_hdr;
1639 op2->o_tag = op->o_tag;
1640 op2->o_time = op->o_time;
1641 op2->o_bd = op->o_bd;
1642 op2->o_request = op->o_request;
1645 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1646 ptr = (char *)(op2->ors_attrs+i+1);
1647 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1648 op2->ors_attrs[i] = op->ors_attrs[i];
1649 op2->ors_attrs[i].an_name.bv_val = ptr;
1650 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1652 BER_BVZERO( &op2->ors_attrs[i].an_name );
1654 ptr = (char *)(op2->o_hdr + 1);
1656 op2->o_authz = op->o_authz;
1657 op2->o_ndn.bv_val = ptr;
1658 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1659 op2->o_dn = op2->o_ndn;
1660 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1661 op2->o_req_dn.bv_val = ptr;
1662 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1663 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1664 op2->o_req_ndn.bv_val = ptr;
1665 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1666 op2->ors_filterstr.bv_val = ptr;
1667 strcpy( ptr, so->s_filterstr.bv_val );
1668 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1669 op2->ors_filter = str2filter( ptr );
1672 /* Copy any cached group ACLs individually */
1673 op2->o_groups = NULL;
1674 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1675 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1677 strcpy( g2->ga_ndn, g1->ga_ndn );
1678 g2->ga_next = op2->o_groups;
1682 /* Add op2 to conn so abandon will find us */
1683 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1684 op->o_conn->c_n_ops_executing++;
1685 op->o_conn->c_n_ops_completed--;
1686 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1687 so->s_flags |= PS_IS_DETACHED;
1688 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1692 syncprov_search_response( Operation *op, SlapReply *rs )
1694 searchstate *ss = op->o_callback->sc_private;
1695 slap_overinst *on = ss->ss_on;
1696 syncprov_info_t *si = on->on_bi.bi_private;
1697 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1699 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1701 /* If we got a referral without a referral object, there's
1702 * something missing that we cannot replicate. Just ignore it.
1703 * The consumer will abort because we didn't send the expected
1706 if ( !rs->sr_entry ) {
1707 assert( rs->sr_entry );
1708 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1709 return SLAP_CB_CONTINUE;
1711 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1712 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1713 slap_schema.si_ad_entryCSN );
1715 /* Don't send the ctx entry twice */
1716 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1717 return LDAP_SUCCESS;
1719 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1721 rs->sr_ctrls[1] = NULL;
1722 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1723 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1724 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1725 struct berval cookie;
1727 slap_compose_sync_cookie( op, &cookie,
1728 &op->ors_filter->f_and->f_ava->aa_value,
1729 srs->sr_state.rid );
1731 /* Is this a regular refresh? */
1733 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1735 rs->sr_ctrls[1] = NULL;
1736 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1737 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1738 LDAP_SYNC_REFRESH_DELETES );
1741 /* It's RefreshAndPersist, transition to Persist phase */
1742 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1743 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1744 &cookie, 1, NULL, 0 );
1745 /* Flush any queued persist messages */
1746 if ( ss->ss_so->s_res ) {
1747 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1749 syncprov_qplay( op, on, ss->ss_so );
1752 /* Turn off the refreshing flag */
1753 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1755 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1757 /* Detach this Op from frontend control */
1758 syncprov_detach_op( op, ss->ss_so );
1760 return LDAP_SUCCESS;
1764 return SLAP_CB_CONTINUE;
1768 syncprov_op_search( Operation *op, SlapReply *rs )
1770 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1771 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1773 int gotstate = 0, nochange = 0, do_present = 1;
1774 Filter *fand, *fava;
1775 syncops *sop = NULL;
1778 struct berval ctxcsn;
1779 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1781 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1783 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1784 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1788 srs = op->o_controls[slap_cids.sc_LDAPsync];
1789 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1791 /* If this is a persistent search, set it up right away */
1792 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1802 so.s_flags = PS_IS_REFRESHING;
1803 /* syncprov_findbase expects to be called as a callback... */
1804 sc.sc_private = &opc;
1806 cb = op->o_callback;
1807 op->o_callback = ≻
1808 rs->sr_err = syncprov_findbase( op, &fc );
1809 op->o_callback = cb;
1811 if ( rs->sr_err != LDAP_SUCCESS ) {
1812 send_ldap_result( op, rs );
1815 sop = ch_malloc( sizeof( syncops ));
1817 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1818 sop->s_rid = srs->sr_state.rid;
1821 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1822 sop->s_next = si->si_ops;
1824 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1827 /* snapshot the ctxcsn */
1828 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1829 strcpy( csnbuf, si->si_ctxcsnbuf );
1830 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1831 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1832 ctxcsn.bv_val = csnbuf;
1834 /* If we have a cookie, handle the PRESENT lookups */
1835 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1838 /* The cookie was validated when it was parsed, just use it */
1840 /* If just Refreshing and nothing has changed, shortcut it */
1841 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1843 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1844 LDAPControl *ctrls[2];
1848 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1849 NULL, LDAP_SYNC_REFRESH_DELETES );
1850 rs->sr_ctrls = ctrls;
1851 rs->sr_err = LDAP_SUCCESS;
1852 send_ldap_result( op, rs );
1853 rs->sr_ctrls = NULL;
1858 /* Do we have a sessionlog for this search? */
1861 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1862 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1864 /* mutex is unlocked in playlog */
1865 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1867 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1870 /* Is the CSN still present in the database? */
1871 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1872 /* No, so a reload is required */
1873 #if 0 /* the consumer doesn't seem to send this hint */
1874 if ( op->o_sync_rhint == 0 ) {
1875 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1881 /* If changed and doing Present lookup, send Present UUIDs */
1882 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1884 send_ldap_result( op, rs );
1891 /* Append CSN range to search filter, save original filter
1892 * for persistent search evaluation
1895 sop->s_filterstr= op->ors_filterstr;
1898 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1899 fand->f_choice = LDAP_FILTER_AND;
1900 fand->f_next = NULL;
1901 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1902 fava->f_choice = LDAP_FILTER_LE;
1903 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1904 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1905 #ifdef LDAP_COMP_MATCH
1906 fava->f_ava->aa_cf = NULL;
1908 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1911 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1912 fava = fava->f_next;
1913 fava->f_choice = LDAP_FILTER_GE;
1914 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1915 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1916 #ifdef LDAP_COMP_MATCH
1917 fava->f_ava->aa_cf = NULL;
1919 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1921 fava->f_next = op->ors_filter;
1922 op->ors_filter = fand;
1923 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1925 /* Let our callback add needed info to returned entries */
1926 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1927 ss = (searchstate *)(cb+1);
1930 ss->ss_present = do_present;
1931 cb->sc_response = syncprov_search_response;
1932 cb->sc_cleanup = syncprov_search_cleanup;
1933 cb->sc_private = ss;
1934 cb->sc_next = op->o_callback;
1935 op->o_callback = cb;
1937 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1938 op->o_sync_mode &= SLAP_CONTROL_MASK;
1941 /* If this is a persistent search and no changes were reported during
1942 * the refresh phase, just invoke the response callback to transition
1943 * us into persist phase
1946 rs->sr_err = LDAP_SUCCESS;
1947 rs->sr_nentries = 0;
1948 send_ldap_result( op, rs );
1951 return SLAP_CB_CONTINUE;
1955 syncprov_operational(
1959 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1960 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1962 if ( rs->sr_entry &&
1963 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1965 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1966 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1967 Attribute *a, **ap = NULL;
1969 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1970 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1975 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1977 a = ch_malloc( sizeof(Attribute));
1978 a->a_desc = slap_schema.si_ad_contextCSN;
1979 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1980 a->a_vals[1].bv_val = NULL;
1981 a->a_nvals = a->a_vals;
1987 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1989 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1991 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1993 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1996 return SLAP_CB_CONTINUE;
2004 static ConfigDriver sp_cf_gen;
2006 static ConfigTable spcfg[] = {
2007 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2008 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2009 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2010 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2011 { "syncprov-sessionlog", "size", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2012 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2013 "DESC 'Session log size in ops' "
2014 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2015 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2018 static ConfigOCs spocs[] = {
2019 { "( OLcfgOvOc:1.1 "
2020 "NAME 'olcSyncProvConfig' "
2021 "DESC 'SyncRepl Provider configuration' "
2022 "SUP olcOverlayConfig "
2023 "MAY ( olcSpCheckpoint $ olcSpSessionlog ) )",
2024 Cft_Overlay, spcfg },
2029 sp_cf_gen(ConfigArgs *c)
2031 slap_overinst *on = (slap_overinst *)c->bi;
2032 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2035 if ( c->op == SLAP_CONFIG_EMIT ) {
2036 switch ( c->type ) {
2038 if ( si->si_chkops || si->si_chktime ) {
2040 bv.bv_len = sprintf( c->msg, "%d %d",
2041 si->si_chkops, si->si_chktime );
2043 value_add_one( &c->rvalue_vals, &bv );
2049 if ( si->si_logs ) {
2050 c->value_int = si->si_logs->sl_size;
2057 } else if ( c->op == LDAP_MOD_DELETE ) {
2058 switch ( c->type ) {
2065 si->si_logs->sl_size = 0;
2067 rc = LDAP_NO_SUCH_ATTRIBUTE;
2072 switch ( c->type ) {
2074 si->si_chkops = atoi( c->argv[1] );
2075 si->si_chktime = atoi( c->argv[2] ) * 60;
2079 int size = c->value_int;
2082 sprintf( c->msg, "%s size %d is negative",
2084 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2085 return ARG_BAD_CONF;
2089 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2090 sl->sl_mincsn.bv_val = (char *)(sl+1);
2091 sl->sl_mincsn.bv_len = 0;
2093 sl->sl_head = sl->sl_tail = NULL;
2094 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2104 /* Cheating - we have no thread pool context for these functions,
2107 typedef struct thread_keys {
2110 ldap_pvt_thread_pool_keyfree_t *xfree;
2114 /* A fake thread context */
2115 static thread_keys thrctx[MAXKEYS];
2117 /* ITS#3456 we cannot run this search on the main thread, must use a
2118 * child thread in order to insure we have a big enough stack.
2125 syncprov_findcsn( ptr, FIND_MAXCSN );
2129 /* Read any existing contextCSN from the underlying db.
2130 * Then search for any entries newer than that. If no value exists,
2131 * just generate it. Cache whatever result.
2138 slap_overinst *on = (slap_overinst *) be->bd_info;
2139 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2142 char opbuf[OPERATION_BUFFER_SIZE];
2143 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2144 Operation *op = (Operation *)opbuf;
2149 if ( slapMode & SLAP_TOOL_MODE ) {
2153 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2158 connection_fake_init( &conn, op, thrctx );
2160 op->o_dn = be->be_rootdn;
2161 op->o_ndn = be->be_rootndn;
2163 ctxcsnbuf[0] = '\0';
2165 op->o_bd->bd_info = on->on_info->oi_orig;
2166 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2167 slap_schema.si_ad_contextCSN, 0, &e );
2170 ldap_pvt_thread_t tid;
2172 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2174 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2175 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2176 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2177 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2178 si->si_ctxcsn.bv_len );
2179 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2180 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2182 be_entry_release_rw( op, e, 0 );
2183 op->o_bd->bd_info = (BackendInfo *)on;
2184 op->o_req_dn = be->be_suffix[0];
2185 op->o_req_ndn = be->be_nsuffix[0];
2186 op->ors_scope = LDAP_SCOPE_SUBTREE;
2187 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2188 ldap_pvt_thread_join( tid, NULL );
2189 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2190 /* If we're also a consumer, and we didn't find the context entry,
2191 * then don't generate anything, wait for our provider to send it
2197 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2198 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2199 &si->si_ctxcsn, 0 );
2202 /* If our ctxcsn is different from what was read from the root
2203 * entry, make sure we do a checkpoint on close
2205 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2210 op->o_bd->bd_info = (BackendInfo *)on;
2214 /* Write the current contextCSN into the underlying db.
2221 slap_overinst *on = (slap_overinst *) be->bd_info;
2222 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2225 if ( slapMode & SLAP_TOOL_MODE ) {
2228 if ( si->si_numops ) {
2230 char opbuf[OPERATION_BUFFER_SIZE];
2231 Operation *op = (Operation *)opbuf;
2232 SlapReply rs = {REP_RESULT};
2234 connection_fake_init( &conn, op, thrctx );
2236 op->o_dn = be->be_rootdn;
2237 op->o_ndn = be->be_rootndn;
2238 syncprov_checkpoint( op, &rs, on );
2240 for ( i=0; thrctx[i].key; i++) {
2241 if ( thrctx[i].xfree )
2242 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2243 thrctx[i].key = NULL;
2254 slap_overinst *on = (slap_overinst *)be->bd_info;
2255 syncprov_info_t *si;
2257 si = ch_calloc(1, sizeof(syncprov_info_t));
2258 on->on_bi.bi_private = si;
2259 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2260 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2261 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2262 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2264 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2265 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2267 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2268 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2274 syncprov_db_destroy(
2278 slap_overinst *on = (slap_overinst *)be->bd_info;
2279 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2282 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2283 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2284 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2291 static int syncprov_parseCtrl (
2300 struct berval cookie = BER_BVNULL;
2304 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2305 rs->sr_text = "Sync control specified multiple times";
2306 return LDAP_PROTOCOL_ERROR;
2309 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2310 rs->sr_text = "Sync control specified with pagedResults control";
2311 return LDAP_PROTOCOL_ERROR;
2314 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2315 rs->sr_text = "Sync control value is empty (or absent)";
2316 return LDAP_PROTOCOL_ERROR;
2319 /* Parse the control value
2320 * syncRequestValue ::= SEQUENCE {
2325 * refreshAndPersist (3)
2327 * cookie syncCookie OPTIONAL
2331 ber = ber_init( &ctrl->ldctl_value );
2333 rs->sr_text = "internal error";
2337 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2338 rs->sr_text = "Sync control : mode decoding error";
2339 return LDAP_PROTOCOL_ERROR;
2343 case LDAP_SYNC_REFRESH_ONLY:
2344 mode = SLAP_SYNC_REFRESH;
2346 case LDAP_SYNC_REFRESH_AND_PERSIST:
2347 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2350 rs->sr_text = "Sync control : unknown update mode";
2351 return LDAP_PROTOCOL_ERROR;
2354 tag = ber_peek_tag( ber, &len );
2356 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2357 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2358 rs->sr_text = "Sync control : cookie decoding error";
2359 return LDAP_PROTOCOL_ERROR;
2362 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2363 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2364 rs->sr_text = "Sync control : rhint decoding error";
2365 return LDAP_PROTOCOL_ERROR;
2368 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2369 rs->sr_text = "Sync control : decoding error";
2370 return LDAP_PROTOCOL_ERROR;
2372 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2373 sr->sr_rhint = rhint;
2374 if (!BER_BVISNULL(&cookie)) {
2375 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2376 slap_parse_sync_cookie( &sr->sr_state );
2379 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2381 (void) ber_free( ber, 1 );
2383 op->o_sync = ctrl->ldctl_iscritical
2384 ? SLAP_CONTROL_CRITICAL
2385 : SLAP_CONTROL_NONCRITICAL;
2387 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2389 return LDAP_SUCCESS;
2392 /* This overlay is set up for dynamic loading via moduleload. For static
2393 * configuration, you'll need to arrange for the slap_overinst to be
2394 * initialized and registered by some other function inside slapd.
2397 static slap_overinst syncprov;
2404 rc = register_supported_control( LDAP_CONTROL_SYNC,
2405 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2406 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2407 if ( rc != LDAP_SUCCESS ) {
2408 Debug( LDAP_DEBUG_ANY,
2409 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2413 syncprov.on_bi.bi_type = "syncprov";
2414 syncprov.on_bi.bi_db_init = syncprov_db_init;
2415 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2416 syncprov.on_bi.bi_db_open = syncprov_db_open;
2417 syncprov.on_bi.bi_db_close = syncprov_db_close;
2419 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2420 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2422 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2423 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2424 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2425 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2426 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2427 syncprov.on_bi.bi_op_search = syncprov_op_search;
2428 syncprov.on_bi.bi_extended = syncprov_op_extended;
2429 syncprov.on_bi.bi_operational = syncprov_operational;
2431 syncprov.on_bi.bi_cf_ocs = spocs;
2433 rc = config_register_schema( spcfg, spocs );
2434 if ( rc ) return rc;
2436 return overlay_register( &syncprov );
2439 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2441 init_module( int argc, char *argv[] )
2443 return syncprov_init();
2445 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2447 #endif /* defined(SLAPD_OVER_SYNCPROV) */