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 BerElementBuffer berbuf;
164 BerElement *ber = (BerElement *)&berbuf;
166 struct berval entryuuid_bv = BER_BVNULL;
168 ber_init2( ber, 0, LBER_USE_DER );
169 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
171 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
173 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
174 AttributeDescription *desc = a->a_desc;
175 if ( desc == slap_schema.si_ad_entryUUID ) {
176 entryuuid_bv = a->a_nvals[0];
181 if ( send_cookie && cookie ) {
182 ber_printf( ber, "{eOON}",
183 entry_sync_state, &entryuuid_bv, cookie );
185 ber_printf( ber, "{eON}",
186 entry_sync_state, &entryuuid_bv );
189 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
190 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
191 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
196 Debug( LDAP_DEBUG_TRACE,
197 "slap_build_sync_ctrl: ber_flatten2 failed\n",
199 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
206 /* Build a LDAPsync final state control */
214 struct berval *cookie,
218 BerElementBuffer berbuf;
219 BerElement *ber = (BerElement *)&berbuf;
221 ber_init2( ber, NULL, LBER_USE_DER );
222 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
224 ctrls[num_ctrls] = op->o_tmpalloc( sizeof ( LDAPControl ), op->o_tmpmemctx );
226 ber_printf( ber, "{" );
227 if ( send_cookie && cookie ) {
228 ber_printf( ber, "O", cookie );
230 if ( refreshDeletes == LDAP_SYNC_REFRESH_DELETES ) {
231 ber_printf( ber, "b", refreshDeletes );
233 ber_printf( ber, "N}" );
235 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
236 ctrls[num_ctrls]->ldctl_iscritical = (op->o_sync == SLAP_CONTROL_CRITICAL);
237 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
242 Debug( LDAP_DEBUG_TRACE,
243 "syncprov_done_ctrl: ber_flatten2 failed\n",
245 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
257 struct berval *cookie,
262 BerElementBuffer berbuf;
263 BerElement *ber = (BerElement *)&berbuf;
264 struct berval rspdata;
268 ber_init2( ber, NULL, LBER_USE_DER );
269 ber_set_option( ber, LBER_OPT_BER_MEMCTX, &op->o_tmpmemctx );
273 case LDAP_TAG_SYNC_NEW_COOKIE:
274 ber_printf( ber, "tO", type, cookie );
276 case LDAP_TAG_SYNC_REFRESH_DELETE:
277 case LDAP_TAG_SYNC_REFRESH_PRESENT:
278 ber_printf( ber, "t{", type );
280 ber_printf( ber, "O", cookie );
282 if ( refreshDone == 0 ) {
283 ber_printf( ber, "b", refreshDone );
285 ber_printf( ber, "N}" );
287 case LDAP_TAG_SYNC_ID_SET:
288 ber_printf( ber, "t{", type );
290 ber_printf( ber, "O", cookie );
292 if ( refreshDeletes == 1 ) {
293 ber_printf( ber, "b", refreshDeletes );
295 ber_printf( ber, "[W]", syncUUIDs );
296 ber_printf( ber, "N}" );
299 Debug( LDAP_DEBUG_TRACE,
300 "syncprov_sendinfo: invalid syncinfo type (%d)\n",
306 ret = ber_flatten2( ber, &rspdata, 0 );
309 Debug( LDAP_DEBUG_TRACE,
310 "syncprov_sendinfo: ber_flatten2 failed\n",
312 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
316 rs->sr_rspoid = LDAP_SYNC_INFO;
317 rs->sr_rspdata = &rspdata;
318 send_ldap_intermediate( op, rs );
319 rs->sr_rspdata = NULL;
325 /* Find a modtarget in an AVL tree */
327 sp_avl_cmp( const void *c1, const void *c2 )
329 const modtarget *m1, *m2;
333 rc = m1->mt_op->o_req_ndn.bv_len - m2->mt_op->o_req_ndn.bv_len;
336 return ber_bvcmp( &m1->mt_op->o_req_ndn, &m2->mt_op->o_req_ndn );
339 /* syncprov_findbase:
340 * finds the true DN of the base of a search (with alias dereferencing) and
341 * checks to make sure the base entry doesn't get replaced with a different
342 * entry (e.g., swapping trees via ModDN, or retargeting an alias). If a
343 * change is detected, any persistent search on this base must be terminated /
345 * On the first call, we just save the DN and entryID. On subsequent calls
346 * we compare the DN and entryID with the saved values.
349 findbase_cb( Operation *op, SlapReply *rs )
351 slap_callback *sc = op->o_callback;
353 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
354 fbase_cookie *fc = sc->sc_private;
356 /* If no entryID, we're looking for the first time.
357 * Just store whatever we got.
359 if ( fc->fss->s_eid == NOID ) {
361 fc->fss->s_eid = rs->sr_entry->e_id;
362 ber_dupbv( &fc->fss->s_base, &rs->sr_entry->e_nname );
364 } else if ( rs->sr_entry->e_id == fc->fss->s_eid &&
365 dn_match( &rs->sr_entry->e_nname, &fc->fss->s_base )) {
367 /* OK, the DN is the same and the entryID is the same. Now
368 * see if the fdn resides in the scope.
371 switch ( fc->fss->s_op->ors_scope ) {
372 case LDAP_SCOPE_BASE:
373 fc->fscope = dn_match( fc->fdn, &rs->sr_entry->e_nname );
375 case LDAP_SCOPE_ONELEVEL: {
377 dnParent( fc->fdn, &pdn );
378 fc->fscope = dn_match( &pdn, &rs->sr_entry->e_nname );
380 case LDAP_SCOPE_SUBTREE:
381 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname );
383 #ifdef LDAP_SCOPE_SUBORDINATE
384 case LDAP_SCOPE_SUBORDINATE:
385 fc->fscope = dnIsSuffix( fc->fdn, &rs->sr_entry->e_nname ) &&
386 !dn_match( fc->fdn, &rs->sr_entry->e_nname );
392 if ( rs->sr_err != LDAP_SUCCESS ) {
393 Debug( LDAP_DEBUG_ANY, "findbase failed! %d\n", rs->sr_err,0,0 );
399 syncprov_findbase( Operation *op, fbase_cookie *fc )
401 opcookie *opc = op->o_callback->sc_private;
402 slap_overinst *on = opc->son;
404 slap_callback cb = {0};
406 SlapReply frs = { REP_RESULT };
411 cb.sc_response = findbase_cb;
414 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync mode */
415 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
416 fop.o_callback = &cb;
417 fop.o_tag = LDAP_REQ_SEARCH;
418 fop.ors_scope = LDAP_SCOPE_BASE;
419 fop.ors_deref = fc->fss->s_op->ors_deref;
420 fop.ors_limit = NULL;
422 fop.ors_tlimit = SLAP_NO_LIMIT;
423 fop.ors_attrs = slap_anlist_no_attrs;
424 fop.ors_attrsonly = 1;
425 fop.ors_filter = fc->fss->s_op->ors_filter;
426 fop.ors_filterstr = fc->fss->s_op->ors_filterstr;
428 fop.o_req_ndn = fc->fss->s_op->o_req_ndn;
430 fop.o_bd->bd_info = on->on_info->oi_orig;
431 rc = fop.o_bd->be_search( &fop, &frs );
432 fop.o_bd->bd_info = (BackendInfo *)on;
434 if ( fc->fbase ) return LDAP_SUCCESS;
436 /* If entryID has changed, then the base of this search has
437 * changed. Invalidate the psearch.
439 return LDAP_NO_SUCH_OBJECT;
443 * This function has three different purposes, but they all use a search
444 * that filters on entryCSN so they're combined here.
445 * 1: at startup time, after a contextCSN has been read from the database,
446 * we search for all entries with CSN >= contextCSN in case the contextCSN
447 * was not checkpointed at the previous shutdown.
449 * 2: when the current contextCSN is known and we have a sync cookie, we search
450 * for one entry with CSN = the cookie CSN. If not found, try <= cookie CSN.
451 * If an entry is found, the cookie CSN is valid, otherwise it is stale.
453 * 3: during a refresh phase, we search for all entries with CSN <= the cookie
454 * CSN, and generate Present records for them. We always collect this result
455 * in SyncID sets, even if there's only one match.
457 #define FIND_MAXCSN 1
459 #define FIND_PRESENT 3
462 findmax_cb( Operation *op, SlapReply *rs )
464 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
465 struct berval *maxcsn = op->o_callback->sc_private;
466 Attribute *a = attr_find( rs->sr_entry->e_attrs,
467 slap_schema.si_ad_entryCSN );
469 if ( a && ber_bvcmp( &a->a_vals[0], maxcsn ) > 0 ) {
470 maxcsn->bv_len = a->a_vals[0].bv_len;
471 strcpy( maxcsn->bv_val, a->a_vals[0].bv_val );
478 findcsn_cb( Operation *op, SlapReply *rs )
480 slap_callback *sc = op->o_callback;
482 if ( rs->sr_type == REP_SEARCH && rs->sr_err == LDAP_SUCCESS ) {
483 sc->sc_private = (void *)1;
488 /* Build a list of entryUUIDs for sending in a SyncID set */
492 typedef struct fpres_cookie {
499 findpres_cb( Operation *op, SlapReply *rs )
501 slap_callback *sc = op->o_callback;
502 fpres_cookie *pc = sc->sc_private;
504 int ret = SLAP_CB_CONTINUE;
506 switch ( rs->sr_type ) {
508 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryUUID );
510 pc->uuids[pc->num].bv_val = pc->last;
511 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
512 pc->uuids[pc->num].bv_len );
514 pc->last = pc->uuids[pc->num].bv_val;
515 pc->uuids[pc->num].bv_val = NULL;
518 if ( pc->num != SLAP_SYNCUUID_SET_SIZE )
524 ret = syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL,
526 pc->uuids[pc->num].bv_val = pc->last;
528 pc->last = pc->uuids[0].bv_val;
538 syncprov_findcsn( Operation *op, int mode )
540 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
541 syncprov_info_t *si = on->on_bi.bi_private;
543 slap_callback cb = {0};
545 SlapReply frs = { REP_RESULT };
546 char buf[LDAP_LUTIL_CSNSTR_BUFSIZE + STRLENOF("(entryCSN<=)")];
547 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
548 struct berval maxcsn;
550 #ifdef LDAP_COMP_MATCH
551 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
553 AttributeAssertion eq = { NULL, BER_BVNULL };
555 int i, rc = LDAP_SUCCESS;
556 fpres_cookie pcookie;
557 sync_control *srs = NULL;
558 int findcsn_retry = 1;
560 if ( mode != FIND_MAXCSN ) {
561 srs = op->o_controls[slap_cids.sc_LDAPsync];
563 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
569 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
570 /* We want pure entries, not referrals */
571 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
574 cf.f_av_desc = slap_schema.si_ad_entryCSN;
577 fop.o_callback = &cb;
578 fop.ors_limit = NULL;
579 fop.ors_tlimit = SLAP_NO_LIMIT;
580 fop.ors_filter = &cf;
581 fop.ors_filterstr.bv_val = buf;
586 cf.f_choice = LDAP_FILTER_GE;
587 cf.f_av_value = si->si_ctxcsn;
588 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
589 cf.f_av_value.bv_val );
590 fop.ors_attrsonly = 0;
591 fop.ors_attrs = csn_anlist;
592 fop.ors_slimit = SLAP_NO_LIMIT;
593 cb.sc_private = &maxcsn;
594 cb.sc_response = findmax_cb;
595 strcpy( cbuf, si->si_ctxcsn.bv_val );
596 maxcsn.bv_val = cbuf;
597 maxcsn.bv_len = si->si_ctxcsn.bv_len;
600 cf.f_av_value = srs->sr_state.ctxcsn;
601 /* Look for exact match the first time */
602 if ( findcsn_retry ) {
603 cf.f_choice = LDAP_FILTER_EQUALITY;
604 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN=%s)",
605 cf.f_av_value.bv_val );
606 /* On retry, look for <= */
608 cf.f_choice = LDAP_FILTER_LE;
609 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
610 cf.f_av_value.bv_val );
612 fop.ors_attrsonly = 1;
613 fop.ors_attrs = slap_anlist_no_attrs;
615 cb.sc_private = NULL;
616 cb.sc_response = findcsn_cb;
619 af.f_choice = LDAP_FILTER_AND;
622 cf.f_choice = LDAP_FILTER_LE;
623 cf.f_av_value = srs->sr_state.ctxcsn;
624 cf.f_next = op->ors_filter;
625 fop.ors_filter = ⁡
626 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
627 fop.ors_attrsonly = 0;
628 fop.ors_attrs = uuid_anlist;
629 fop.ors_slimit = SLAP_NO_LIMIT;
630 cb.sc_private = &pcookie;
631 cb.sc_response = findpres_cb;
634 /* preallocate storage for a full set */
635 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
636 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
638 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
639 pcookie.uuids[0].bv_val = pcookie.last;
640 pcookie.uuids[0].bv_len = UUID_LEN;
641 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
642 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
643 pcookie.uuids[i].bv_len = UUID_LEN;
648 fop.o_bd->bd_info = on->on_info->oi_orig;
649 fop.o_bd->be_search( &fop, &frs );
650 fop.o_bd->bd_info = (BackendInfo *)on;
654 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
655 si->si_ctxcsn.bv_len = maxcsn.bv_len;
658 /* If matching CSN was not found, invalidate the context. */
659 if ( !cb.sc_private ) {
660 /* If we didn't find an exact match, then try for <= */
661 if ( findcsn_retry ) {
665 rc = LDAP_NO_SUCH_OBJECT;
669 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
670 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
677 /* Queue a persistent search response */
679 syncprov_qresp( opcookie *opc, syncops *so, int mode )
683 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
684 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
686 sr->s_dn.bv_val = (char *)(sr + 1);
687 sr->s_dn.bv_len = opc->sdn.bv_len;
689 sr->s_isreference = opc->sreference;
690 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
691 sr->s_ndn.bv_len = opc->sndn.bv_len;
692 *(sr->s_ndn.bv_val++) = '\0';
693 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
694 sr->s_uuid.bv_len = opc->suuid.bv_len;
695 *(sr->s_uuid.bv_val++) = '\0';
696 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
697 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
698 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
703 so->s_restail->s_next = sr;
706 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
710 /* Play back queued responses */
712 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue );
715 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
717 syncres *sr, *srnext;
723 op->o_bd->bd_info = (BackendInfo *)on->on_info;
724 for (sr = so->s_res; sr; sr=srnext) {
727 opc.sndn = sr->s_ndn;
728 opc.suuid = sr->s_uuid;
729 opc.sctxcsn = sr->s_csn;
730 opc.sreference = sr->s_isreference;
733 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
734 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
741 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );
744 be_entry_release_rw( op, e, 0 );
752 op->o_bd->bd_info = (BackendInfo *)on;
754 so->s_restail = NULL;
758 /* Send a persistent search response */
760 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue )
762 slap_overinst *on = opc->son;
764 SlapReply rs = { REP_SEARCH };
765 LDAPControl *ctrls[2];
766 struct berval cookie;
768 Attribute a_uuid = {0};
769 Operation sop = *so->s_op;
772 if ( so->s_op->o_abandon )
773 return SLAPD_ABANDON;
777 sop.o_tmpmemctx = op->o_tmpmemctx;
779 sop.o_controls = op->o_controls;
780 sop.o_private = op->o_private;
782 /* If queueing is allowed */
784 ldap_pvt_thread_mutex_lock( &so->s_mutex );
785 /* If we're still in refresh mode, must queue */
786 if (so->s_flags & PS_IS_REFRESHING) {
787 return syncprov_qresp( opc, so, mode );
789 /* If connection is free but queue is non-empty,
790 * try to flush the queue.
793 rs.sr_err = syncprov_qplay( &sop, on, so );
795 /* If the connection is busy, must queue */
796 if ( sop.o_conn->c_writewaiter || rs.sr_err == LDAP_BUSY ) {
797 return syncprov_qresp( opc, so, mode );
799 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
801 /* If syncprov_qplay returned any other error, bail out. */
806 /* Queueing not allowed and conn is busy, give up */
807 if ( sop.o_conn->c_writewaiter )
812 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
814 e_uuid.e_attrs = &a_uuid;
815 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
816 a_uuid.a_nvals = &opc->suuid;
817 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
818 mode, ctrls, 0, 1, &cookie );
821 op->o_bd->bd_info = (BackendInfo *)on->on_info;
825 if ( rs.sr_entry->e_private )
826 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
827 if ( opc->sreference ) {
828 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
829 send_search_reference( &sop, &rs );
830 ber_bvarray_free( rs.sr_ref );
836 case LDAP_SYNC_MODIFY:
838 if ( rs.sr_entry->e_private )
839 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
840 rs.sr_attrs = sop.ors_attrs;
841 send_search_entry( &sop, &rs );
845 case LDAP_SYNC_DELETE:
846 e_uuid.e_attrs = NULL;
847 e_uuid.e_name = opc->sdn;
848 e_uuid.e_nname = opc->sndn;
849 rs.sr_entry = &e_uuid;
850 if ( opc->sreference ) {
851 struct berval bv = BER_BVNULL;
853 send_search_reference( &sop, &rs );
855 send_search_entry( &sop, &rs );
861 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
862 op->o_private = sop.o_private;
864 /* Check queue again here; if we were hanging in a send and eventually
865 * recovered, there may be more to send now. But don't check if the
866 * original psearch has been abandoned.
868 if ( so->s_op->o_abandon )
869 return SLAPD_ABANDON;
871 if ( rs.sr_err == LDAP_SUCCESS && queue && so->s_res ) {
872 ldap_pvt_thread_mutex_lock( &so->s_mutex );
873 rs.sr_err = syncprov_qplay( &sop, on, so );
874 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
880 syncprov_free_syncop( syncops *so )
882 syncres *sr, *srnext;
883 GroupAssertion *ga, *gnext;
885 ldap_pvt_thread_mutex_lock( &so->s_mutex );
887 if ( so->s_inuse > 0 ) {
888 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
891 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
892 if ( so->s_flags & PS_IS_DETACHED ) {
893 filter_free( so->s_op->ors_filter );
894 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
900 ch_free( so->s_base.bv_val );
901 for ( sr=so->s_res; sr; sr=srnext ) {
905 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
910 syncprov_drop_psearch( syncops *so, int lock )
912 if ( so->s_flags & PS_IS_DETACHED ) {
914 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
915 so->s_op->o_conn->c_n_ops_executing--;
916 so->s_op->o_conn->c_n_ops_completed++;
917 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
920 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
922 syncprov_free_syncop( so );
928 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
930 slap_callback *sc = op->o_callback;
931 op->o_callback = sc->sc_next;
932 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
933 op->o_tmpfree( sc, op->o_tmpmemctx );
938 syncprov_op_abandon( Operation *op, SlapReply *rs )
940 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
941 syncprov_info_t *si = on->on_bi.bi_private;
942 syncops *so, *soprev;
944 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
945 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
946 soprev=so, so=so->s_next ) {
947 if ( so->s_op->o_connid == op->o_connid &&
948 so->s_op->o_msgid == op->orn_msgid ) {
949 so->s_op->o_abandon = 1;
950 soprev->s_next = so->s_next;
954 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
956 /* Is this really a Cancel exop? */
957 if ( op->o_tag != LDAP_REQ_ABANDON ) {
958 so->s_op->o_cancel = SLAP_CANCEL_ACK;
959 rs->sr_err = LDAP_CANCELLED;
960 send_ldap_result( so->s_op, rs );
961 if ( so->s_flags & PS_IS_DETACHED ) {
963 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
964 cb->sc_cleanup = syncprov_ab_cleanup;
965 cb->sc_next = op->o_callback;
967 return SLAP_CB_CONTINUE;
970 syncprov_drop_psearch( so, 0 );
972 return SLAP_CB_CONTINUE;
975 /* Find which persistent searches are affected by this operation */
977 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
979 slap_overinst *on = opc->son;
980 syncprov_info_t *si = on->on_bi.bi_private;
983 syncops *ss, *sprev, *snext;
990 fc.fdn = &op->o_req_ndn;
992 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
994 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
995 else dnParent( fc.fdn, &pdn );
996 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
1000 if ( op->o_tag != LDAP_REQ_ADD ) {
1001 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1002 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
1003 /* If we're sending responses now, make a copy and unlock the DB */
1004 if ( e && !saveit ) {
1005 Entry *e2 = entry_dup( e );
1006 be_entry_release_rw( op, e, 0 );
1009 op->o_bd->bd_info = (BackendInfo *)on;
1016 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1017 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1018 opc->sreference = is_entry_referral( e );
1020 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1021 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1023 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1026 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1027 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1028 sprev = ss, ss=snext)
1039 /* If the base of the search is missing, signal a refresh */
1040 rc = syncprov_findbase( op, &fc );
1041 if ( rc != LDAP_SUCCESS ) {
1042 SlapReply rs = {REP_RESULT};
1043 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1044 "search base has changed" );
1045 sprev->s_next = snext;
1046 syncprov_drop_psearch( ss, 1 );
1050 /* If we're sending results now, look for this op in old matches */
1053 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1054 old=sm, sm=sm->sm_next ) {
1055 if ( sm->sm_op == ss ) {
1057 old->sm_next = sm->sm_next;
1058 op->o_tmpfree( sm, op->o_tmpmemctx );
1064 /* check if current o_req_dn is in scope and matches filter */
1065 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1066 LDAP_COMPARE_TRUE ) {
1068 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1069 sm->sm_next = opc->smatches;
1074 /* if found send UPDATE else send ADD */
1076 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1077 syncprov_sendresp( op, opc, ss, &e,
1078 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1079 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1082 } else if ( !saveit && found ) {
1084 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1085 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1086 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1089 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1091 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1092 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1093 be_entry_release_rw( op, e, 0 );
1094 op->o_bd->bd_info = (BackendInfo *)on;
1097 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1102 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1104 slap_callback *cb = op->o_callback;
1105 opcookie *opc = cb->sc_private;
1106 slap_overinst *on = opc->son;
1107 syncprov_info_t *si = on->on_bi.bi_private;
1108 syncmatches *sm, *snext;
1109 modtarget *mt, mtdummy;
1111 for (sm = opc->smatches; sm; sm=snext) {
1112 snext = sm->sm_next;
1113 syncprov_free_syncop( sm->sm_op );
1114 op->o_tmpfree( sm, op->o_tmpmemctx );
1117 /* Remove op from lock table */
1119 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1120 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1122 modinst *mi = mt->mt_mods;
1124 /* If there are more, promote the next one */
1125 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1126 if ( mi->mi_next ) {
1127 mt->mt_mods = mi->mi_next;
1128 mt->mt_op = mt->mt_mods->mi_op;
1129 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1131 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1132 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1133 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1137 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1138 if ( !BER_BVISNULL( &opc->suuid ))
1139 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1140 if ( !BER_BVISNULL( &opc->sndn ))
1141 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1142 if ( !BER_BVISNULL( &opc->sdn ))
1143 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1144 op->o_callback = cb->sc_next;
1145 op->o_tmpfree(cb, op->o_tmpmemctx);
1151 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1153 syncprov_info_t *si = on->on_bi.bi_private;
1156 struct berval bv[2];
1157 slap_callback cb = {0};
1158 int manage = get_manageDSAit(op);
1160 mod.sml_values = bv;
1161 bv[1].bv_val = NULL;
1162 bv[0] = si->si_ctxcsn;
1163 mod.sml_nvalues = NULL;
1164 mod.sml_desc = slap_schema.si_ad_contextCSN;
1165 mod.sml_op = LDAP_MOD_REPLACE;
1167 mod.sml_next = NULL;
1169 cb.sc_response = slap_null_cb;
1171 opm.o_tag = LDAP_REQ_MODIFY;
1172 opm.o_callback = &cb;
1173 opm.orm_modlist = &mod;
1174 opm.o_req_dn = op->o_bd->be_suffix[0];
1175 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1176 opm.o_bd->bd_info = on->on_info->oi_orig;
1177 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1178 opm.o_bd->be_modify( &opm, rs );
1179 opm.o_managedsait = manage;
1183 syncprov_add_slog( Operation *op, struct berval *csn )
1185 opcookie *opc = op->o_callback->sc_private;
1186 slap_overinst *on = opc->son;
1187 syncprov_info_t *si = on->on_bi.bi_private;
1193 /* Allocate a record. UUIDs are not NUL-terminated. */
1194 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1197 se->se_tag = op->o_tag;
1199 se->se_uuid.bv_val = (char *)(se+1);
1200 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1201 se->se_uuid.bv_len = opc->suuid.bv_len;
1203 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len;
1204 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1205 se->se_csn.bv_val[csn->bv_len] = '\0';
1206 se->se_csn.bv_len = csn->bv_len;
1208 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1209 if ( sl->sl_head ) {
1210 sl->sl_tail->se_next = se;
1216 while ( sl->sl_num > sl->sl_size ) {
1218 sl->sl_head = se->se_next;
1219 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1220 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1223 if ( !sl->sl_head ) {
1227 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1231 /* Just set a flag if we found the matching entry */
1233 playlog_cb( Operation *op, SlapReply *rs )
1235 if ( rs->sr_type == REP_SEARCH ) {
1236 op->o_callback->sc_private = (void *)1;
1241 /* enter with sl->sl_mutex locked, release before returning */
1243 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1244 struct berval *oldcsn, struct berval *ctxcsn )
1246 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1248 int i, j, ndel, num, nmods, mmods;
1251 if ( !sl->sl_num ) {
1252 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1260 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1261 num * UUID_LEN, op->o_tmpmemctx );
1263 uuids[0].bv_val = (char *)(uuids + num + 1);
1265 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1266 * and everything else at the end. Do this first so we can
1267 * unlock the list mutex.
1269 for ( se=sl->sl_head; se; se=se->se_next ) {
1270 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1271 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1272 if ( se->se_tag == LDAP_REQ_DELETE ) {
1279 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1280 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1281 uuids[j].bv_len = UUID_LEN;
1283 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1287 /* Zero out unused slots */
1288 for ( i=ndel; i < num - nmods; i++ )
1289 uuids[i].bv_len = 0;
1291 /* Mods must be validated to see if they belong in this delete set.
1295 /* Strip any duplicates */
1296 for ( i=0; i<nmods; i++ ) {
1297 for ( j=0; j<ndel; j++ ) {
1298 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1299 uuids[num - 1 - i].bv_len = 0;
1304 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1305 for ( j=0; j<i; j++ ) {
1306 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1307 uuids[num - 1 - i].bv_len = 0;
1316 SlapReply frs = { REP_RESULT };
1319 #ifdef LDAP_COMP_MATCH
1320 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1322 AttributeAssertion eq;
1324 slap_callback cb = {0};
1328 fop.o_sync_mode = 0;
1329 fop.o_callback = &cb;
1330 fop.ors_limit = NULL;
1331 fop.ors_tlimit = SLAP_NO_LIMIT;
1332 fop.ors_attrs = slap_anlist_all_attributes;
1333 fop.ors_attrsonly = 0;
1334 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1336 af.f_choice = LDAP_FILTER_AND;
1339 mf.f_choice = LDAP_FILTER_EQUALITY;
1341 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1342 mf.f_next = fop.ors_filter;
1344 fop.ors_filter = ⁡
1346 cb.sc_response = playlog_cb;
1347 fop.o_bd->bd_info = on->on_info->oi_orig;
1349 for ( i=ndel; i<num; i++ ) {
1350 if ( uuids[i].bv_len == 0 ) continue;
1352 mf.f_av_value = uuids[i];
1353 cb.sc_private = NULL;
1355 rc = fop.o_bd->be_search( &fop, &frs );
1357 /* If entry was not found, add to delete list */
1358 if ( !cb.sc_private ) {
1359 uuids[ndel++] = uuids[i];
1362 fop.o_bd->bd_info = (BackendInfo *)on;
1365 uuids[ndel].bv_val = NULL;
1366 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1371 syncprov_op_response( Operation *op, SlapReply *rs )
1373 opcookie *opc = op->o_callback->sc_private;
1374 slap_overinst *on = opc->son;
1375 syncprov_info_t *si = on->on_bi.bi_private;
1378 if ( rs->sr_err == LDAP_SUCCESS )
1380 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1381 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1383 /* Update our context CSN */
1385 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1386 slap_get_commit_csn( op, &maxcsn, &curcsn );
1387 if ( !BER_BVISNULL( &maxcsn ) ) {
1388 strcpy( cbuf, maxcsn.bv_val );
1389 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1390 strcpy( si->si_ctxcsnbuf, cbuf );
1391 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1395 /* Don't do any processing for consumer contextCSN updates */
1396 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1397 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1398 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1399 return SLAP_CB_CONTINUE;
1403 if ( si->si_chkops || si->si_chktime ) {
1405 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1409 if ( si->si_chktime &&
1410 (op->o_time - si->si_chklast >= si->si_chktime )) {
1412 si->si_chklast = op->o_time;
1415 syncprov_checkpoint( op, rs, on );
1418 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1420 opc->sctxcsn.bv_len = maxcsn.bv_len;
1421 opc->sctxcsn.bv_val = cbuf;
1423 /* Handle any persistent searches */
1427 case LDAP_REQ_MODIFY:
1428 case LDAP_REQ_MODRDN:
1429 case LDAP_REQ_EXTENDED:
1430 syncprov_matchops( op, opc, 0 );
1432 case LDAP_REQ_DELETE:
1433 /* for each match in opc->smatches:
1436 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1437 if ( sm->sm_op->s_op->o_abandon )
1439 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1440 LDAP_SYNC_DELETE, 1 );
1446 /* Add any log records */
1447 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1448 syncprov_add_slog( op, &curcsn );
1452 return SLAP_CB_CONTINUE;
1455 /* We don't use a subentry to store the context CSN any more.
1456 * We expose the current context CSN as an operational attribute
1457 * of the suffix entry.
1460 syncprov_op_compare( Operation *op, SlapReply *rs )
1462 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1463 syncprov_info_t *si = on->on_bi.bi_private;
1464 int rc = SLAP_CB_CONTINUE;
1466 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1467 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1471 struct berval bv[2];
1473 e.e_name = op->o_bd->be_suffix[0];
1474 e.e_nname = op->o_bd->be_nsuffix[0];
1476 BER_BVZERO( &bv[1] );
1477 bv[0] = si->si_ctxcsn;
1479 a.a_desc = slap_schema.si_ad_contextCSN;
1481 a.a_nvals = a.a_vals;
1483 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1485 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1486 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1487 if ( ! rs->sr_err ) {
1488 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1489 goto return_results;
1492 if ( get_assert( op ) &&
1493 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1495 rs->sr_err = LDAP_ASSERTION_FAILED;
1496 goto return_results;
1500 rs->sr_err = LDAP_COMPARE_FALSE;
1502 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1503 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1504 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1505 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1507 rs->sr_err = LDAP_COMPARE_TRUE;
1512 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1514 send_ldap_result( op, rs );
1516 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1517 rs->sr_err = LDAP_SUCCESS;
1526 syncprov_op_mod( Operation *op, SlapReply *rs )
1528 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1529 syncprov_info_t *si = on->on_bi.bi_private;
1531 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1533 (si->si_ops ? sizeof(modinst) : 0 ),
1535 opcookie *opc = (opcookie *)(cb+1);
1537 cb->sc_response = syncprov_op_response;
1538 cb->sc_cleanup = syncprov_op_cleanup;
1539 cb->sc_private = opc;
1540 cb->sc_next = op->o_callback;
1541 op->o_callback = cb;
1543 /* If there are active persistent searches, lock this operation.
1544 * See seqmod.c for the locking logic on its own.
1547 modtarget *mt, mtdummy;
1550 mi = (modinst *)(opc+1);
1553 /* See if we're already modifying this entry... */
1555 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1556 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1558 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1559 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1560 mt->mt_tail->mi_next = mi;
1562 /* wait for this op to get to head of list */
1563 while ( mt->mt_mods != mi ) {
1564 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1565 ldap_pvt_thread_yield();
1566 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1568 /* clean up if the caller is giving up */
1569 if ( op->o_abandon ) {
1571 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1573 m2->mi_next = mi->mi_next;
1574 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1575 op->o_tmpfree( cb, op->o_tmpmemctx );
1576 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1577 return SLAPD_ABANDON;
1580 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1582 /* Record that we're modifying this entry now */
1583 mt = ch_malloc( sizeof(modtarget) );
1586 mt->mt_op = mi->mi_op;
1587 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1588 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1589 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1593 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1594 syncprov_matchops( op, opc, 1 );
1596 return SLAP_CB_CONTINUE;
1600 syncprov_op_extended( Operation *op, SlapReply *rs )
1602 if ( exop_is_write( op ))
1603 return syncprov_op_mod( op, rs );
1605 return SLAP_CB_CONTINUE;
1608 typedef struct searchstate {
1609 slap_overinst *ss_on;
1612 struct berval ss_ctxcsn;
1613 char ss_csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1617 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1619 if ( rs->sr_ctrls ) {
1620 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1621 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1622 rs->sr_ctrls = NULL;
1628 syncprov_detach_op( Operation *op, syncops *so )
1634 GroupAssertion *g1, *g2;
1636 /* count the search attrs */
1637 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1638 alen += op->ors_attrs[i].an_name.bv_len + 1;
1640 /* Make a new copy of the operation */
1641 size = sizeof(Operation) + sizeof(Opheader) +
1642 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1643 op->o_req_dn.bv_len + 1 +
1644 op->o_req_ndn.bv_len + 1 +
1645 op->o_ndn.bv_len + 1 +
1646 so->s_filterstr.bv_len + 1;
1647 op2 = (Operation *)ch_calloc( 1, size );
1648 op2->o_hdr = (Opheader *)(op2+1);
1650 /* Copy the fields we care about explicitly, leave the rest alone */
1651 *op2->o_hdr = *op->o_hdr;
1652 op2->o_tag = op->o_tag;
1653 op2->o_time = op->o_time;
1654 op2->o_bd = op->o_bd;
1655 op2->o_request = op->o_request;
1658 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1659 ptr = (char *)(op2->ors_attrs+i+1);
1660 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1661 op2->ors_attrs[i] = op->ors_attrs[i];
1662 op2->ors_attrs[i].an_name.bv_val = ptr;
1663 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1665 BER_BVZERO( &op2->ors_attrs[i].an_name );
1667 ptr = (char *)(op2->o_hdr + 1);
1669 op2->o_authz = op->o_authz;
1670 op2->o_ndn.bv_val = ptr;
1671 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1672 op2->o_dn = op2->o_ndn;
1673 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1674 op2->o_req_dn.bv_val = ptr;
1675 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1676 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1677 op2->o_req_ndn.bv_val = ptr;
1678 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1679 op2->ors_filterstr.bv_val = ptr;
1680 strcpy( ptr, so->s_filterstr.bv_val );
1681 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1682 op2->ors_filter = str2filter( ptr );
1685 /* Copy any cached group ACLs individually */
1686 op2->o_groups = NULL;
1687 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1688 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1690 strcpy( g2->ga_ndn, g1->ga_ndn );
1691 g2->ga_next = op2->o_groups;
1695 /* Add op2 to conn so abandon will find us */
1696 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1697 op->o_conn->c_n_ops_executing++;
1698 op->o_conn->c_n_ops_completed--;
1699 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1700 so->s_flags |= PS_IS_DETACHED;
1701 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1705 syncprov_search_response( Operation *op, SlapReply *rs )
1707 searchstate *ss = op->o_callback->sc_private;
1708 slap_overinst *on = ss->ss_on;
1709 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1711 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1713 /* If we got a referral without a referral object, there's
1714 * something missing that we cannot replicate. Just ignore it.
1715 * The consumer will abort because we didn't send the expected
1718 if ( !rs->sr_entry ) {
1719 assert( rs->sr_entry != NULL );
1720 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1721 return SLAP_CB_CONTINUE;
1723 a = attr_find( rs->sr_entry->e_attrs, slap_schema.si_ad_entryCSN );
1725 /* Make sure entry is less than the snaphot'd contextCSN */
1726 if ( ber_bvcmp( &a->a_nvals[0], &ss->ss_ctxcsn ) > 0 )
1727 return LDAP_SUCCESS;
1729 /* Don't send the ctx entry twice */
1730 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn ) &&
1731 bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1732 return LDAP_SUCCESS;
1734 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1736 rs->sr_ctrls[1] = NULL;
1737 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1738 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1739 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1740 struct berval cookie;
1742 slap_compose_sync_cookie( op, &cookie, &ss->ss_ctxcsn,
1743 srs->sr_state.rid );
1745 /* Is this a regular refresh? */
1747 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1749 rs->sr_ctrls[1] = NULL;
1750 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1751 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1752 LDAP_SYNC_REFRESH_DELETES );
1755 /* It's RefreshAndPersist, transition to Persist phase */
1756 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1757 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1758 &cookie, 1, NULL, 0 );
1759 /* Flush any queued persist messages */
1760 if ( ss->ss_so->s_res ) {
1761 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1763 syncprov_qplay( op, on, ss->ss_so );
1766 /* Turn off the refreshing flag */
1767 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1769 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1771 /* Detach this Op from frontend control */
1772 syncprov_detach_op( op, ss->ss_so );
1774 return LDAP_SUCCESS;
1778 return SLAP_CB_CONTINUE;
1782 syncprov_op_search( Operation *op, SlapReply *rs )
1784 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1785 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1787 int gotstate = 0, nochange = 0, do_present = 1;
1788 syncops *sop = NULL;
1791 struct berval ctxcsn;
1792 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1794 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1796 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1797 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1801 srs = op->o_controls[slap_cids.sc_LDAPsync];
1802 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1804 /* If this is a persistent search, set it up right away */
1805 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1815 so.s_flags = PS_IS_REFRESHING;
1816 /* syncprov_findbase expects to be called as a callback... */
1817 sc.sc_private = &opc;
1819 cb = op->o_callback;
1820 op->o_callback = ≻
1821 rs->sr_err = syncprov_findbase( op, &fc );
1822 op->o_callback = cb;
1824 if ( rs->sr_err != LDAP_SUCCESS ) {
1825 send_ldap_result( op, rs );
1828 sop = ch_malloc( sizeof( syncops ));
1830 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1831 sop->s_rid = srs->sr_state.rid;
1834 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1835 sop->s_next = si->si_ops;
1837 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1840 /* snapshot the ctxcsn */
1841 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1842 strcpy( csnbuf, si->si_ctxcsnbuf );
1843 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1844 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1845 ctxcsn.bv_val = csnbuf;
1847 /* If we have a cookie, handle the PRESENT lookups */
1848 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1851 /* The cookie was validated when it was parsed, just use it */
1853 /* If just Refreshing and nothing has changed, shortcut it */
1854 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1856 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1857 LDAPControl *ctrls[2];
1861 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1862 NULL, LDAP_SYNC_REFRESH_DELETES );
1863 rs->sr_ctrls = ctrls;
1864 rs->sr_err = LDAP_SUCCESS;
1865 send_ldap_result( op, rs );
1866 rs->sr_ctrls = NULL;
1871 /* Do we have a sessionlog for this search? */
1874 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1875 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1877 /* mutex is unlocked in playlog */
1878 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1880 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1883 /* Is the CSN still present in the database? */
1884 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1885 /* No, so a reload is required */
1886 #if 0 /* the consumer doesn't seem to send this hint */
1887 if ( op->o_sync_rhint == 0 ) {
1888 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1894 /* If changed and doing Present lookup, send Present UUIDs */
1895 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1897 send_ldap_result( op, rs );
1904 /* Append CSN range to search filter, save original filter
1905 * for persistent search evaluation
1908 sop->s_filterstr= op->ors_filterstr;
1911 /* If something changed, find the changes */
1912 if ( gotstate && !nochange ) {
1913 Filter *fand, *fava;
1915 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1916 fand->f_choice = LDAP_FILTER_AND;
1917 fand->f_next = NULL;
1918 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1920 fava->f_choice = LDAP_FILTER_GE;
1921 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1922 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1923 #ifdef LDAP_COMP_MATCH
1924 fava->f_ava->aa_cf = NULL;
1926 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1927 fava->f_next = op->ors_filter;
1928 op->ors_filter = fand;
1929 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1932 /* Let our callback add needed info to returned entries */
1933 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1934 ss = (searchstate *)(cb+1);
1937 ss->ss_present = do_present;
1938 ss->ss_ctxcsn.bv_len = ctxcsn.bv_len;
1939 ss->ss_ctxcsn.bv_val = ss->ss_csnbuf;
1940 strcpy( ss->ss_ctxcsn.bv_val, ctxcsn.bv_val );
1941 cb->sc_response = syncprov_search_response;
1942 cb->sc_cleanup = syncprov_search_cleanup;
1943 cb->sc_private = ss;
1944 cb->sc_next = op->o_callback;
1945 op->o_callback = cb;
1947 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1948 op->o_sync_mode &= SLAP_CONTROL_MASK;
1951 /* If this is a persistent search and no changes were reported during
1952 * the refresh phase, just invoke the response callback to transition
1953 * us into persist phase
1956 rs->sr_err = LDAP_SUCCESS;
1957 rs->sr_nentries = 0;
1958 send_ldap_result( op, rs );
1961 return SLAP_CB_CONTINUE;
1965 syncprov_operational(
1969 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1970 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1972 if ( rs->sr_entry &&
1973 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1975 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1976 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1977 Attribute *a, **ap = NULL;
1979 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1980 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1985 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1987 a = ch_malloc( sizeof(Attribute));
1988 a->a_desc = slap_schema.si_ad_contextCSN;
1989 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1990 a->a_vals[1].bv_val = NULL;
1991 a->a_nvals = a->a_vals;
1997 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1999 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
2001 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
2003 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
2006 return SLAP_CB_CONTINUE;
2014 static ConfigDriver sp_cf_gen;
2016 static ConfigTable spcfg[] = {
2017 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2018 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2019 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2020 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2021 { "syncprov-sessionlog", "ops", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2022 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2023 "DESC 'Session log size in ops' "
2024 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2025 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2028 static ConfigOCs spocs[] = {
2029 { "( OLcfgOvOc:1.1 "
2030 "NAME 'olcSyncProvConfig' "
2031 "DESC 'SyncRepl Provider configuration' "
2032 "SUP olcOverlayConfig "
2033 "MAY ( olcSpCheckpoint $ olcSpSessionlog ) )",
2034 Cft_Overlay, spcfg },
2039 sp_cf_gen(ConfigArgs *c)
2041 slap_overinst *on = (slap_overinst *)c->bi;
2042 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2045 if ( c->op == SLAP_CONFIG_EMIT ) {
2046 switch ( c->type ) {
2048 if ( si->si_chkops || si->si_chktime ) {
2050 bv.bv_len = sprintf( c->msg, "%d %d",
2051 si->si_chkops, si->si_chktime );
2053 value_add_one( &c->rvalue_vals, &bv );
2059 if ( si->si_logs ) {
2060 c->value_int = si->si_logs->sl_size;
2067 } else if ( c->op == LDAP_MOD_DELETE ) {
2068 switch ( c->type ) {
2075 si->si_logs->sl_size = 0;
2077 rc = LDAP_NO_SUCH_ATTRIBUTE;
2082 switch ( c->type ) {
2084 si->si_chkops = atoi( c->argv[1] );
2085 si->si_chktime = atoi( c->argv[2] ) * 60;
2089 int size = c->value_int;
2092 sprintf( c->msg, "%s size %d is negative",
2094 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2095 return ARG_BAD_CONF;
2099 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2100 sl->sl_mincsn.bv_val = (char *)(sl+1);
2101 sl->sl_mincsn.bv_len = 0;
2103 sl->sl_head = sl->sl_tail = NULL;
2104 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2114 /* Cheating - we have no thread pool context for these functions,
2117 typedef struct thread_keys {
2120 ldap_pvt_thread_pool_keyfree_t *xfree;
2124 /* A fake thread context */
2125 static thread_keys thrctx[MAXKEYS];
2127 /* ITS#3456 we cannot run this search on the main thread, must use a
2128 * child thread in order to insure we have a big enough stack.
2135 syncprov_findcsn( ptr, FIND_MAXCSN );
2139 /* Read any existing contextCSN from the underlying db.
2140 * Then search for any entries newer than that. If no value exists,
2141 * just generate it. Cache whatever result.
2148 slap_overinst *on = (slap_overinst *) be->bd_info;
2149 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2152 char opbuf[OPERATION_BUFFER_SIZE];
2153 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2154 Operation *op = (Operation *)opbuf;
2159 if ( slapMode & SLAP_TOOL_MODE ) {
2163 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2168 connection_fake_init( &conn, op, thrctx );
2170 op->o_dn = be->be_rootdn;
2171 op->o_ndn = be->be_rootndn;
2173 ctxcsnbuf[0] = '\0';
2175 op->o_bd->bd_info = on->on_info->oi_orig;
2176 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2177 slap_schema.si_ad_contextCSN, 0, &e );
2180 ldap_pvt_thread_t tid;
2182 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2184 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2185 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2186 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2187 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2188 si->si_ctxcsn.bv_len );
2189 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2190 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2192 be_entry_release_rw( op, e, 0 );
2193 op->o_bd->bd_info = (BackendInfo *)on;
2194 op->o_req_dn = be->be_suffix[0];
2195 op->o_req_ndn = be->be_nsuffix[0];
2196 op->ors_scope = LDAP_SCOPE_SUBTREE;
2197 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2198 ldap_pvt_thread_join( tid, NULL );
2199 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2200 /* If we're also a consumer, and we didn't find the context entry,
2201 * then don't generate anything, wait for our provider to send it
2207 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2208 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2209 &si->si_ctxcsn, 0 );
2212 /* If our ctxcsn is different from what was read from the root
2213 * entry, make sure we do a checkpoint on close
2215 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2220 op->o_bd->bd_info = (BackendInfo *)on;
2224 /* Write the current contextCSN into the underlying db.
2231 slap_overinst *on = (slap_overinst *) be->bd_info;
2232 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2235 if ( slapMode & SLAP_TOOL_MODE ) {
2238 if ( si->si_numops ) {
2240 char opbuf[OPERATION_BUFFER_SIZE];
2241 Operation *op = (Operation *)opbuf;
2242 SlapReply rs = {REP_RESULT};
2244 connection_fake_init( &conn, op, thrctx );
2246 op->o_dn = be->be_rootdn;
2247 op->o_ndn = be->be_rootndn;
2248 syncprov_checkpoint( op, &rs, on );
2250 for ( i=0; thrctx[i].key; i++) {
2251 if ( thrctx[i].xfree )
2252 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2253 thrctx[i].key = NULL;
2264 slap_overinst *on = (slap_overinst *)be->bd_info;
2265 syncprov_info_t *si;
2267 si = ch_calloc(1, sizeof(syncprov_info_t));
2268 on->on_bi.bi_private = si;
2269 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2270 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2271 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2272 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2274 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2275 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2277 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2278 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2284 syncprov_db_destroy(
2288 slap_overinst *on = (slap_overinst *)be->bd_info;
2289 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2292 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2293 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2294 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2301 static int syncprov_parseCtrl (
2307 BerElementBuffer berbuf;
2308 BerElement *ber = (BerElement *)&berbuf;
2311 struct berval cookie = BER_BVNULL;
2315 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2316 rs->sr_text = "Sync control specified multiple times";
2317 return LDAP_PROTOCOL_ERROR;
2320 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2321 rs->sr_text = "Sync control specified with pagedResults control";
2322 return LDAP_PROTOCOL_ERROR;
2325 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2326 rs->sr_text = "Sync control value is empty (or absent)";
2327 return LDAP_PROTOCOL_ERROR;
2330 /* Parse the control value
2331 * syncRequestValue ::= SEQUENCE {
2336 * refreshAndPersist (3)
2338 * cookie syncCookie OPTIONAL
2342 ber_init2( ber, &ctrl->ldctl_value, 0 );
2344 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2345 rs->sr_text = "Sync control : mode decoding error";
2346 return LDAP_PROTOCOL_ERROR;
2350 case LDAP_SYNC_REFRESH_ONLY:
2351 mode = SLAP_SYNC_REFRESH;
2353 case LDAP_SYNC_REFRESH_AND_PERSIST:
2354 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2357 rs->sr_text = "Sync control : unknown update mode";
2358 return LDAP_PROTOCOL_ERROR;
2361 tag = ber_peek_tag( ber, &len );
2363 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2364 if (( ber_scanf( ber, /*{*/ "m", &cookie )) == LBER_ERROR ) {
2365 rs->sr_text = "Sync control : cookie decoding error";
2366 return LDAP_PROTOCOL_ERROR;
2369 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2370 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2371 rs->sr_text = "Sync control : rhint decoding error";
2372 return LDAP_PROTOCOL_ERROR;
2375 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2376 rs->sr_text = "Sync control : decoding error";
2377 return LDAP_PROTOCOL_ERROR;
2379 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2380 sr->sr_rhint = rhint;
2381 if (!BER_BVISNULL(&cookie)) {
2382 ber_dupbv_x( &sr->sr_state.octet_str, &cookie, op->o_tmpmemctx );
2383 slap_parse_sync_cookie( &sr->sr_state, op->o_tmpmemctx );
2384 if ( sr->sr_state.rid == -1 ) {
2385 rs->sr_text = "Sync control : cookie parsing error";
2386 return LDAP_PROTOCOL_ERROR;
2390 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2392 op->o_sync = ctrl->ldctl_iscritical
2393 ? SLAP_CONTROL_CRITICAL
2394 : SLAP_CONTROL_NONCRITICAL;
2396 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2398 return LDAP_SUCCESS;
2401 /* This overlay is set up for dynamic loading via moduleload. For static
2402 * configuration, you'll need to arrange for the slap_overinst to be
2403 * initialized and registered by some other function inside slapd.
2406 static slap_overinst syncprov;
2413 rc = register_supported_control( LDAP_CONTROL_SYNC,
2414 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2415 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2416 if ( rc != LDAP_SUCCESS ) {
2417 Debug( LDAP_DEBUG_ANY,
2418 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2422 syncprov.on_bi.bi_type = "syncprov";
2423 syncprov.on_bi.bi_db_init = syncprov_db_init;
2424 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2425 syncprov.on_bi.bi_db_open = syncprov_db_open;
2426 syncprov.on_bi.bi_db_close = syncprov_db_close;
2428 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2429 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2431 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2432 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2433 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2434 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2435 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2436 syncprov.on_bi.bi_op_search = syncprov_op_search;
2437 syncprov.on_bi.bi_extended = syncprov_op_extended;
2438 syncprov.on_bi.bi_operational = syncprov_operational;
2440 syncprov.on_bi.bi_cf_ocs = spocs;
2442 rc = config_register_schema( spcfg, spocs );
2443 if ( rc ) return rc;
2445 return overlay_register( &syncprov );
2448 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2450 init_module( int argc, char *argv[] )
2452 return syncprov_init();
2454 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2456 #endif /* defined(SLAPD_OVER_SYNCPROV) */