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. (Used to search for =.) If an
451 * 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;
559 if ( mode != FIND_MAXCSN ) {
560 srs = op->o_controls[slap_cids.sc_LDAPsync];
562 if ( srs->sr_state.ctxcsn.bv_len >= LDAP_LUTIL_CSNSTR_BUFSIZE ) {
568 fop.o_sync_mode &= SLAP_CONTROL_MASK; /* turn off sync_mode */
569 /* We want pure entries, not referrals */
570 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
573 cf.f_av_desc = slap_schema.si_ad_entryCSN;
576 fop.o_callback = &cb;
577 fop.ors_limit = NULL;
578 fop.ors_tlimit = SLAP_NO_LIMIT;
579 fop.ors_filter = &cf;
580 fop.ors_filterstr.bv_val = buf;
584 cf.f_choice = LDAP_FILTER_GE;
585 cf.f_av_value = si->si_ctxcsn;
586 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN>=%s)",
587 cf.f_av_value.bv_val );
588 fop.ors_attrsonly = 0;
589 fop.ors_attrs = csn_anlist;
590 fop.ors_slimit = SLAP_NO_LIMIT;
591 cb.sc_private = &maxcsn;
592 cb.sc_response = findmax_cb;
593 strcpy( cbuf, si->si_ctxcsn.bv_val );
594 maxcsn.bv_val = cbuf;
595 maxcsn.bv_len = si->si_ctxcsn.bv_len;
598 cf.f_choice = LDAP_FILTER_LE;
599 cf.f_av_value = srs->sr_state.ctxcsn;
600 fop.ors_filterstr.bv_len = sprintf( buf, "(entryCSN<=%s)",
601 cf.f_av_value.bv_val );
602 fop.ors_attrsonly = 1;
603 fop.ors_attrs = slap_anlist_no_attrs;
605 cb.sc_private = NULL;
606 cb.sc_response = findcsn_cb;
609 af.f_choice = LDAP_FILTER_AND;
612 cf.f_choice = LDAP_FILTER_LE;
613 cf.f_av_value = srs->sr_state.ctxcsn;
614 cf.f_next = op->ors_filter;
615 fop.ors_filter = ⁡
616 filter2bv_x( &fop, fop.ors_filter, &fop.ors_filterstr );
617 fop.ors_attrsonly = 0;
618 fop.ors_attrs = uuid_anlist;
619 fop.ors_slimit = SLAP_NO_LIMIT;
620 cb.sc_private = &pcookie;
621 cb.sc_response = findpres_cb;
624 /* preallocate storage for a full set */
625 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
626 sizeof(struct berval) + SLAP_SYNCUUID_SET_SIZE * UUID_LEN,
628 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
629 pcookie.uuids[0].bv_val = pcookie.last;
630 pcookie.uuids[0].bv_len = UUID_LEN;
631 for (i=1; i<SLAP_SYNCUUID_SET_SIZE; i++) {
632 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
633 pcookie.uuids[i].bv_len = UUID_LEN;
638 fop.o_bd->bd_info = on->on_info->oi_orig;
639 fop.o_bd->be_search( &fop, &frs );
640 fop.o_bd->bd_info = (BackendInfo *)on;
644 strcpy( si->si_ctxcsnbuf, maxcsn.bv_val );
645 si->si_ctxcsn.bv_len = maxcsn.bv_len;
648 /* If matching CSN was not found, invalidate the context. */
649 if ( !cb.sc_private ) rc = LDAP_NO_SUCH_OBJECT;
652 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
653 op->o_tmpfree( fop.ors_filterstr.bv_val, op->o_tmpmemctx );
660 /* Queue a persistent search response */
662 syncprov_qresp( opcookie *opc, syncops *so, int mode )
666 sr = ch_malloc(sizeof(syncres) + opc->suuid.bv_len + 1 +
667 opc->sdn.bv_len + 1 + opc->sndn.bv_len + 1 + opc->sctxcsn.bv_len + 1 );
669 sr->s_dn.bv_val = (char *)(sr + 1);
670 sr->s_dn.bv_len = opc->sdn.bv_len;
672 sr->s_isreference = opc->sreference;
673 sr->s_ndn.bv_val = lutil_strcopy( sr->s_dn.bv_val, opc->sdn.bv_val );
674 sr->s_ndn.bv_len = opc->sndn.bv_len;
675 *(sr->s_ndn.bv_val++) = '\0';
676 sr->s_uuid.bv_val = lutil_strcopy( sr->s_ndn.bv_val, opc->sndn.bv_val );
677 sr->s_uuid.bv_len = opc->suuid.bv_len;
678 *(sr->s_uuid.bv_val++) = '\0';
679 sr->s_csn.bv_val = lutil_strcopy( sr->s_uuid.bv_val, opc->suuid.bv_val );
680 sr->s_csn.bv_len = opc->sctxcsn.bv_len;
681 strcpy( sr->s_csn.bv_val, opc->sctxcsn.bv_val );
686 so->s_restail->s_next = sr;
689 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
693 /* Play back queued responses */
695 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue );
698 syncprov_qplay( Operation *op, slap_overinst *on, syncops *so )
700 syncres *sr, *srnext;
706 op->o_bd->bd_info = (BackendInfo *)on->on_info;
707 for (sr = so->s_res; sr; sr=srnext) {
710 opc.sndn = sr->s_ndn;
711 opc.suuid = sr->s_uuid;
712 opc.sctxcsn = sr->s_csn;
713 opc.sreference = sr->s_isreference;
716 if ( sr->s_mode != LDAP_SYNC_DELETE ) {
717 rc = be_entry_get_rw( op, &opc.sndn, NULL, NULL, 0, &e );
724 rc = syncprov_sendresp( op, &opc, so, &e, sr->s_mode, 0 );
727 be_entry_release_rw( op, e, 0 );
735 op->o_bd->bd_info = (BackendInfo *)on;
737 so->s_restail = NULL;
741 /* Send a persistent search response */
743 syncprov_sendresp( Operation *op, opcookie *opc, syncops *so, Entry **e, int mode, int queue )
745 slap_overinst *on = opc->son;
747 SlapReply rs = { REP_SEARCH };
748 LDAPControl *ctrls[2];
749 struct berval cookie;
751 Attribute a_uuid = {0};
752 Operation sop = *so->s_op;
755 if ( so->s_op->o_abandon )
756 return SLAPD_ABANDON;
760 sop.o_tmpmemctx = op->o_tmpmemctx;
762 sop.o_controls = op->o_controls;
763 sop.o_private = op->o_private;
765 /* If queueing is allowed */
767 ldap_pvt_thread_mutex_lock( &so->s_mutex );
768 /* If we're still in refresh mode, must queue */
769 if (so->s_flags & PS_IS_REFRESHING) {
770 return syncprov_qresp( opc, so, mode );
772 /* If connection is free but queue is non-empty,
773 * try to flush the queue.
776 rs.sr_err = syncprov_qplay( &sop, on, so );
778 /* If the connection is busy, must queue */
779 if ( sop.o_conn->c_writewaiter || rs.sr_err == LDAP_BUSY ) {
780 return syncprov_qresp( opc, so, mode );
782 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
784 /* If syncprov_qplay returned any other error, bail out. */
789 /* Queueing not allowed and conn is busy, give up */
790 if ( sop.o_conn->c_writewaiter )
795 slap_compose_sync_cookie( op, &cookie, &opc->sctxcsn, so->s_rid );
797 e_uuid.e_attrs = &a_uuid;
798 a_uuid.a_desc = slap_schema.si_ad_entryUUID;
799 a_uuid.a_nvals = &opc->suuid;
800 rs.sr_err = syncprov_state_ctrl( &sop, &rs, &e_uuid,
801 mode, ctrls, 0, 1, &cookie );
804 op->o_bd->bd_info = (BackendInfo *)on->on_info;
808 if ( rs.sr_entry->e_private )
809 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
810 if ( opc->sreference ) {
811 rs.sr_ref = get_entry_referrals( &sop, rs.sr_entry );
812 send_search_reference( &sop, &rs );
813 ber_bvarray_free( rs.sr_ref );
819 case LDAP_SYNC_MODIFY:
821 if ( rs.sr_entry->e_private )
822 rs.sr_flags = REP_ENTRY_MUSTRELEASE;
823 rs.sr_attrs = sop.ors_attrs;
824 send_search_entry( &sop, &rs );
828 case LDAP_SYNC_DELETE:
829 e_uuid.e_attrs = NULL;
830 e_uuid.e_name = opc->sdn;
831 e_uuid.e_nname = opc->sndn;
832 rs.sr_entry = &e_uuid;
833 if ( opc->sreference ) {
834 struct berval bv = BER_BVNULL;
836 send_search_reference( &sop, &rs );
838 send_search_entry( &sop, &rs );
844 op->o_tmpfree( rs.sr_ctrls[0], op->o_tmpmemctx );
845 op->o_private = sop.o_private;
847 /* Check queue again here; if we were hanging in a send and eventually
848 * recovered, there may be more to send now. But don't check if the
849 * original psearch has been abandoned.
851 if ( so->s_op->o_abandon )
852 return SLAPD_ABANDON;
854 if ( rs.sr_err == LDAP_SUCCESS && queue && so->s_res ) {
855 ldap_pvt_thread_mutex_lock( &so->s_mutex );
856 rs.sr_err = syncprov_qplay( &sop, on, so );
857 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
863 syncprov_free_syncop( syncops *so )
865 syncres *sr, *srnext;
866 GroupAssertion *ga, *gnext;
868 ldap_pvt_thread_mutex_lock( &so->s_mutex );
870 if ( so->s_inuse > 0 ) {
871 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
874 ldap_pvt_thread_mutex_unlock( &so->s_mutex );
875 if ( so->s_flags & PS_IS_DETACHED ) {
876 filter_free( so->s_op->ors_filter );
877 for ( ga = so->s_op->o_groups; ga; ga=gnext ) {
883 ch_free( so->s_base.bv_val );
884 for ( sr=so->s_res; sr; sr=srnext ) {
888 ldap_pvt_thread_mutex_destroy( &so->s_mutex );
893 syncprov_drop_psearch( syncops *so, int lock )
895 if ( so->s_flags & PS_IS_DETACHED ) {
897 ldap_pvt_thread_mutex_lock( &so->s_op->o_conn->c_mutex );
898 so->s_op->o_conn->c_n_ops_executing--;
899 so->s_op->o_conn->c_n_ops_completed++;
900 LDAP_STAILQ_REMOVE( &so->s_op->o_conn->c_ops, so->s_op, slap_op,
903 ldap_pvt_thread_mutex_unlock( &so->s_op->o_conn->c_mutex );
905 syncprov_free_syncop( so );
911 syncprov_ab_cleanup( Operation *op, SlapReply *rs )
913 slap_callback *sc = op->o_callback;
914 op->o_callback = sc->sc_next;
915 syncprov_drop_psearch( op->o_callback->sc_private, 0 );
916 op->o_tmpfree( sc, op->o_tmpmemctx );
921 syncprov_op_abandon( Operation *op, SlapReply *rs )
923 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
924 syncprov_info_t *si = on->on_bi.bi_private;
925 syncops *so, *soprev;
927 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
928 for ( so=si->si_ops, soprev = (syncops *)&si->si_ops; so;
929 soprev=so, so=so->s_next ) {
930 if ( so->s_op->o_connid == op->o_connid &&
931 so->s_op->o_msgid == op->orn_msgid ) {
932 so->s_op->o_abandon = 1;
933 soprev->s_next = so->s_next;
937 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
939 /* Is this really a Cancel exop? */
940 if ( op->o_tag != LDAP_REQ_ABANDON ) {
941 so->s_op->o_cancel = SLAP_CANCEL_ACK;
942 rs->sr_err = LDAP_CANCELLED;
943 send_ldap_result( so->s_op, rs );
944 if ( so->s_flags & PS_IS_DETACHED ) {
946 cb = op->o_tmpcalloc( 1, sizeof(slap_callback), op->o_tmpmemctx );
947 cb->sc_cleanup = syncprov_ab_cleanup;
948 cb->sc_next = op->o_callback;
950 return SLAP_CB_CONTINUE;
953 syncprov_drop_psearch( so, 0 );
955 return SLAP_CB_CONTINUE;
958 /* Find which persistent searches are affected by this operation */
960 syncprov_matchops( Operation *op, opcookie *opc, int saveit )
962 slap_overinst *on = opc->son;
963 syncprov_info_t *si = on->on_bi.bi_private;
966 syncops *ss, *sprev, *snext;
973 fc.fdn = &op->o_req_ndn;
975 if ( op->o_tag == LDAP_REQ_MODRDN && !saveit ) {
977 if ( op->orr_nnewSup ) pdn = *op->orr_nnewSup;
978 else dnParent( fc.fdn, &pdn );
979 build_new_dn( &newdn, &pdn, &op->orr_nnewrdn, op->o_tmpmemctx );
983 if ( op->o_tag != LDAP_REQ_ADD ) {
984 op->o_bd->bd_info = (BackendInfo *)on->on_info;
985 rc = be_entry_get_rw( op, fc.fdn, NULL, NULL, 0, &e );
986 /* If we're sending responses now, make a copy and unlock the DB */
987 if ( e && !saveit ) {
988 Entry *e2 = entry_dup( e );
989 be_entry_release_rw( op, e, 0 );
992 op->o_bd->bd_info = (BackendInfo *)on;
999 ber_dupbv_x( &opc->sdn, &e->e_name, op->o_tmpmemctx );
1000 ber_dupbv_x( &opc->sndn, &e->e_nname, op->o_tmpmemctx );
1001 opc->sreference = is_entry_referral( e );
1003 if ( saveit || op->o_tag == LDAP_REQ_ADD ) {
1004 a = attr_find( e->e_attrs, slap_schema.si_ad_entryUUID );
1006 ber_dupbv_x( &opc->suuid, &a->a_nvals[0], op->o_tmpmemctx );
1009 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1010 for (ss = si->si_ops, sprev = (syncops *)&si->si_ops; ss;
1011 sprev = ss, ss=snext)
1022 /* If the base of the search is missing, signal a refresh */
1023 rc = syncprov_findbase( op, &fc );
1024 if ( rc != LDAP_SUCCESS ) {
1025 SlapReply rs = {REP_RESULT};
1026 send_ldap_error( ss->s_op, &rs, LDAP_SYNC_REFRESH_REQUIRED,
1027 "search base has changed" );
1028 sprev->s_next = snext;
1029 syncprov_drop_psearch( ss, 1 );
1033 /* If we're sending results now, look for this op in old matches */
1036 for ( sm=opc->smatches, old=(syncmatches *)&opc->smatches; sm;
1037 old=sm, sm=sm->sm_next ) {
1038 if ( sm->sm_op == ss ) {
1040 old->sm_next = sm->sm_next;
1041 op->o_tmpfree( sm, op->o_tmpmemctx );
1047 /* check if current o_req_dn is in scope and matches filter */
1048 if ( fc.fscope && test_filter( op, e, ss->s_op->ors_filter ) ==
1049 LDAP_COMPARE_TRUE ) {
1051 sm = op->o_tmpalloc( sizeof(syncmatches), op->o_tmpmemctx );
1052 sm->sm_next = opc->smatches;
1057 /* if found send UPDATE else send ADD */
1059 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1060 syncprov_sendresp( op, opc, ss, &e,
1061 found ? LDAP_SYNC_MODIFY : LDAP_SYNC_ADD, 1 );
1062 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1065 } else if ( !saveit && found ) {
1067 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1068 syncprov_sendresp( op, opc, ss, NULL, LDAP_SYNC_DELETE, 1 );
1069 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1072 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1074 if ( op->o_tag != LDAP_REQ_ADD && e ) {
1075 op->o_bd->bd_info = (BackendInfo *)on->on_info;
1076 be_entry_release_rw( op, e, 0 );
1077 op->o_bd->bd_info = (BackendInfo *)on;
1080 op->o_tmpfree( fc.fdn->bv_val, op->o_tmpmemctx );
1085 syncprov_op_cleanup( Operation *op, SlapReply *rs )
1087 slap_callback *cb = op->o_callback;
1088 opcookie *opc = cb->sc_private;
1089 slap_overinst *on = opc->son;
1090 syncprov_info_t *si = on->on_bi.bi_private;
1091 syncmatches *sm, *snext;
1092 modtarget *mt, mtdummy;
1094 for (sm = opc->smatches; sm; sm=snext) {
1095 snext = sm->sm_next;
1096 syncprov_free_syncop( sm->sm_op );
1097 op->o_tmpfree( sm, op->o_tmpmemctx );
1100 /* Remove op from lock table */
1102 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1103 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1105 modinst *mi = mt->mt_mods;
1107 /* If there are more, promote the next one */
1108 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1109 if ( mi->mi_next ) {
1110 mt->mt_mods = mi->mi_next;
1111 mt->mt_op = mt->mt_mods->mi_op;
1112 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1114 avl_delete( &si->si_mods, mt, sp_avl_cmp );
1115 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1116 ldap_pvt_thread_mutex_destroy( &mt->mt_mutex );
1120 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1121 if ( !BER_BVISNULL( &opc->suuid ))
1122 op->o_tmpfree( opc->suuid.bv_val, op->o_tmpmemctx );
1123 if ( !BER_BVISNULL( &opc->sndn ))
1124 op->o_tmpfree( opc->sndn.bv_val, op->o_tmpmemctx );
1125 if ( !BER_BVISNULL( &opc->sdn ))
1126 op->o_tmpfree( opc->sdn.bv_val, op->o_tmpmemctx );
1127 op->o_callback = cb->sc_next;
1128 op->o_tmpfree(cb, op->o_tmpmemctx);
1134 syncprov_checkpoint( Operation *op, SlapReply *rs, slap_overinst *on )
1136 syncprov_info_t *si = on->on_bi.bi_private;
1139 struct berval bv[2];
1140 slap_callback cb = {0};
1141 int manage = get_manageDSAit(op);
1143 mod.sml_values = bv;
1144 bv[1].bv_val = NULL;
1145 bv[0] = si->si_ctxcsn;
1146 mod.sml_nvalues = NULL;
1147 mod.sml_desc = slap_schema.si_ad_contextCSN;
1148 mod.sml_op = LDAP_MOD_REPLACE;
1150 mod.sml_next = NULL;
1152 cb.sc_response = slap_null_cb;
1154 opm.o_tag = LDAP_REQ_MODIFY;
1155 opm.o_callback = &cb;
1156 opm.orm_modlist = &mod;
1157 opm.o_req_dn = op->o_bd->be_suffix[0];
1158 opm.o_req_ndn = op->o_bd->be_nsuffix[0];
1159 opm.o_bd->bd_info = on->on_info->oi_orig;
1160 opm.o_managedsait = SLAP_CONTROL_NONCRITICAL;
1161 opm.o_bd->be_modify( &opm, rs );
1162 opm.o_managedsait = manage;
1166 syncprov_add_slog( Operation *op, struct berval *csn )
1168 opcookie *opc = op->o_callback->sc_private;
1169 slap_overinst *on = opc->son;
1170 syncprov_info_t *si = on->on_bi.bi_private;
1176 /* Allocate a record. UUIDs are not NUL-terminated. */
1177 se = ch_malloc( sizeof( slog_entry ) + opc->suuid.bv_len +
1180 se->se_tag = op->o_tag;
1182 se->se_uuid.bv_val = (char *)(se+1);
1183 se->se_csn.bv_val = se->se_uuid.bv_val + opc->suuid.bv_len + 1;
1184 AC_MEMCPY( se->se_uuid.bv_val, opc->suuid.bv_val, opc->suuid.bv_len );
1185 se->se_uuid.bv_len = opc->suuid.bv_len;
1187 AC_MEMCPY( se->se_csn.bv_val, csn->bv_val, csn->bv_len );
1188 se->se_csn.bv_val[csn->bv_len] = '\0';
1189 se->se_csn.bv_len = csn->bv_len;
1191 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1192 if ( sl->sl_head ) {
1193 sl->sl_tail->se_next = se;
1199 while ( sl->sl_num > sl->sl_size ) {
1201 sl->sl_head = se->se_next;
1202 strcpy( sl->sl_mincsn.bv_val, se->se_csn.bv_val );
1203 sl->sl_mincsn.bv_len = se->se_csn.bv_len;
1206 if ( !sl->sl_head ) {
1210 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1214 /* Just set a flag if we found the matching entry */
1216 playlog_cb( Operation *op, SlapReply *rs )
1218 if ( rs->sr_type == REP_SEARCH ) {
1219 op->o_callback->sc_private = (void *)1;
1224 /* enter with sl->sl_mutex locked, release before returning */
1226 syncprov_playlog( Operation *op, SlapReply *rs, sessionlog *sl,
1227 struct berval *oldcsn, struct berval *ctxcsn )
1229 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1231 int i, j, ndel, num, nmods, mmods;
1234 if ( !sl->sl_num ) {
1235 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1243 uuids = op->o_tmpalloc( (num+1) * sizeof( struct berval ) +
1244 num * UUID_LEN, op->o_tmpmemctx );
1246 uuids[0].bv_val = (char *)(uuids + num + 1);
1248 /* Make a copy of the relevant UUIDs. Put the Deletes up front
1249 * and everything else at the end. Do this first so we can
1250 * unlock the list mutex.
1252 for ( se=sl->sl_head; se; se=se->se_next ) {
1253 if ( ber_bvcmp( &se->se_csn, oldcsn ) < 0 ) continue;
1254 if ( ber_bvcmp( &se->se_csn, ctxcsn ) > 0 ) break;
1255 if ( se->se_tag == LDAP_REQ_DELETE ) {
1262 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
1263 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
1264 uuids[j].bv_len = UUID_LEN;
1266 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1270 /* Zero out unused slots */
1271 for ( i=ndel; i < num - nmods; i++ )
1272 uuids[i].bv_len = 0;
1274 /* Mods must be validated to see if they belong in this delete set.
1278 /* Strip any duplicates */
1279 for ( i=0; i<nmods; i++ ) {
1280 for ( j=0; j<ndel; j++ ) {
1281 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
1282 uuids[num - 1 - i].bv_len = 0;
1287 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
1288 for ( j=0; j<i; j++ ) {
1289 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
1290 uuids[num - 1 - i].bv_len = 0;
1299 SlapReply frs = { REP_RESULT };
1302 #ifdef LDAP_COMP_MATCH
1303 AttributeAssertion eq = { NULL, BER_BVNULL, NULL };
1305 AttributeAssertion eq;
1307 slap_callback cb = {0};
1311 fop.o_sync_mode = 0;
1312 fop.o_callback = &cb;
1313 fop.ors_limit = NULL;
1314 fop.ors_tlimit = SLAP_NO_LIMIT;
1315 fop.ors_attrs = slap_anlist_all_attributes;
1316 fop.ors_attrsonly = 0;
1317 fop.o_managedsait = SLAP_CONTROL_CRITICAL;
1319 af.f_choice = LDAP_FILTER_AND;
1322 mf.f_choice = LDAP_FILTER_EQUALITY;
1324 mf.f_av_desc = slap_schema.si_ad_entryUUID;
1325 mf.f_next = fop.ors_filter;
1327 fop.ors_filter = ⁡
1329 cb.sc_response = playlog_cb;
1330 fop.o_bd->bd_info = on->on_info->oi_orig;
1332 for ( i=ndel; i<num; i++ ) {
1333 if ( uuids[i].bv_len == 0 ) continue;
1335 mf.f_av_value = uuids[i];
1336 cb.sc_private = NULL;
1338 rc = fop.o_bd->be_search( &fop, &frs );
1340 /* If entry was not found, add to delete list */
1341 if ( !cb.sc_private ) {
1342 uuids[ndel++] = uuids[i];
1345 fop.o_bd->bd_info = (BackendInfo *)on;
1348 uuids[ndel].bv_val = NULL;
1349 syncprov_sendinfo( op, rs, LDAP_TAG_SYNC_ID_SET, NULL, 0, uuids, 1 );
1354 syncprov_op_response( Operation *op, SlapReply *rs )
1356 opcookie *opc = op->o_callback->sc_private;
1357 slap_overinst *on = opc->son;
1358 syncprov_info_t *si = on->on_bi.bi_private;
1361 if ( rs->sr_err == LDAP_SUCCESS )
1363 struct berval maxcsn = BER_BVNULL, curcsn = BER_BVNULL;
1364 char cbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1366 /* Update our context CSN */
1368 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1369 slap_get_commit_csn( op, &maxcsn, &curcsn );
1370 if ( !BER_BVISNULL( &maxcsn ) ) {
1371 strcpy( cbuf, maxcsn.bv_val );
1372 if ( ber_bvcmp( &maxcsn, &si->si_ctxcsn ) > 0 ) {
1373 strcpy( si->si_ctxcsnbuf, cbuf );
1374 si->si_ctxcsn.bv_len = maxcsn.bv_len;
1378 /* Don't do any processing for consumer contextCSN updates */
1379 if ( SLAP_SYNC_SHADOW( op->o_bd ) &&
1380 op->o_msgid == SLAP_SYNC_UPDATE_MSGID ) {
1381 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1382 return SLAP_CB_CONTINUE;
1386 if ( si->si_chkops || si->si_chktime ) {
1388 if ( si->si_chkops && si->si_numops >= si->si_chkops ) {
1392 if ( si->si_chktime &&
1393 (op->o_time - si->si_chklast >= si->si_chktime )) {
1395 si->si_chklast = op->o_time;
1398 syncprov_checkpoint( op, rs, on );
1401 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1403 opc->sctxcsn.bv_len = maxcsn.bv_len;
1404 opc->sctxcsn.bv_val = cbuf;
1406 /* Handle any persistent searches */
1410 case LDAP_REQ_MODIFY:
1411 case LDAP_REQ_MODRDN:
1412 case LDAP_REQ_EXTENDED:
1413 syncprov_matchops( op, opc, 0 );
1415 case LDAP_REQ_DELETE:
1416 /* for each match in opc->smatches:
1419 for ( sm = opc->smatches; sm; sm=sm->sm_next ) {
1420 if ( sm->sm_op->s_op->o_abandon )
1422 syncprov_sendresp( op, opc, sm->sm_op, NULL,
1423 LDAP_SYNC_DELETE, 1 );
1429 /* Add any log records */
1430 if ( si->si_logs && op->o_tag != LDAP_REQ_ADD ) {
1431 syncprov_add_slog( op, &curcsn );
1435 return SLAP_CB_CONTINUE;
1438 /* We don't use a subentry to store the context CSN any more.
1439 * We expose the current context CSN as an operational attribute
1440 * of the suffix entry.
1443 syncprov_op_compare( Operation *op, SlapReply *rs )
1445 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1446 syncprov_info_t *si = on->on_bi.bi_private;
1447 int rc = SLAP_CB_CONTINUE;
1449 if ( dn_match( &op->o_req_ndn, op->o_bd->be_nsuffix ) &&
1450 op->oq_compare.rs_ava->aa_desc == slap_schema.si_ad_contextCSN )
1454 struct berval bv[2];
1456 e.e_name = op->o_bd->be_suffix[0];
1457 e.e_nname = op->o_bd->be_nsuffix[0];
1459 BER_BVZERO( &bv[1] );
1460 bv[0] = si->si_ctxcsn;
1462 a.a_desc = slap_schema.si_ad_contextCSN;
1464 a.a_nvals = a.a_vals;
1466 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1468 rs->sr_err = access_allowed( op, &e, op->oq_compare.rs_ava->aa_desc,
1469 &op->oq_compare.rs_ava->aa_value, ACL_COMPARE, NULL );
1470 if ( ! rs->sr_err ) {
1471 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
1472 goto return_results;
1475 if ( get_assert( op ) &&
1476 ( test_filter( op, &e, get_assertion( op ) ) != LDAP_COMPARE_TRUE ) )
1478 rs->sr_err = LDAP_ASSERTION_FAILED;
1479 goto return_results;
1483 rs->sr_err = LDAP_COMPARE_FALSE;
1485 if ( value_find_ex( op->oq_compare.rs_ava->aa_desc,
1486 SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH |
1487 SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH,
1488 a.a_nvals, &op->oq_compare.rs_ava->aa_value, op->o_tmpmemctx ) == 0 )
1490 rs->sr_err = LDAP_COMPARE_TRUE;
1495 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1497 send_ldap_result( op, rs );
1499 if( rs->sr_err == LDAP_COMPARE_FALSE || rs->sr_err == LDAP_COMPARE_TRUE ) {
1500 rs->sr_err = LDAP_SUCCESS;
1509 syncprov_op_mod( Operation *op, SlapReply *rs )
1511 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1512 syncprov_info_t *si = on->on_bi.bi_private;
1514 slap_callback *cb = op->o_tmpcalloc(1, sizeof(slap_callback)+
1516 (si->si_ops ? sizeof(modinst) : 0 ),
1518 opcookie *opc = (opcookie *)(cb+1);
1520 cb->sc_response = syncprov_op_response;
1521 cb->sc_cleanup = syncprov_op_cleanup;
1522 cb->sc_private = opc;
1523 cb->sc_next = op->o_callback;
1524 op->o_callback = cb;
1526 /* If there are active persistent searches, lock this operation.
1527 * See seqmod.c for the locking logic on its own.
1530 modtarget *mt, mtdummy;
1533 mi = (modinst *)(opc+1);
1536 /* See if we're already modifying this entry... */
1538 ldap_pvt_thread_mutex_lock( &si->si_mods_mutex );
1539 mt = avl_find( si->si_mods, &mtdummy, sp_avl_cmp );
1541 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1542 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1543 mt->mt_tail->mi_next = mi;
1545 /* wait for this op to get to head of list */
1546 while ( mt->mt_mods != mi ) {
1547 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1548 ldap_pvt_thread_yield();
1549 ldap_pvt_thread_mutex_lock( &mt->mt_mutex );
1551 /* clean up if the caller is giving up */
1552 if ( op->o_abandon ) {
1554 for ( m2 = mt->mt_mods; m2->mi_next != mi;
1556 m2->mi_next = mi->mi_next;
1557 if ( mt->mt_tail == mi ) mt->mt_tail = m2;
1558 op->o_tmpfree( cb, op->o_tmpmemctx );
1559 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1560 return SLAPD_ABANDON;
1563 ldap_pvt_thread_mutex_unlock( &mt->mt_mutex );
1565 /* Record that we're modifying this entry now */
1566 mt = ch_malloc( sizeof(modtarget) );
1569 mt->mt_op = mi->mi_op;
1570 ldap_pvt_thread_mutex_init( &mt->mt_mutex );
1571 avl_insert( &si->si_mods, mt, sp_avl_cmp, avl_dup_error );
1572 ldap_pvt_thread_mutex_unlock( &si->si_mods_mutex );
1576 if (( si->si_ops || si->si_logs ) && op->o_tag != LDAP_REQ_ADD )
1577 syncprov_matchops( op, opc, 1 );
1579 return SLAP_CB_CONTINUE;
1583 syncprov_op_extended( Operation *op, SlapReply *rs )
1585 if ( exop_is_write( op ))
1586 return syncprov_op_mod( op, rs );
1588 return SLAP_CB_CONTINUE;
1591 typedef struct searchstate {
1592 slap_overinst *ss_on;
1598 syncprov_search_cleanup( Operation *op, SlapReply *rs )
1600 if ( rs->sr_ctrls ) {
1601 op->o_tmpfree( rs->sr_ctrls[0], op->o_tmpmemctx );
1602 op->o_tmpfree( rs->sr_ctrls, op->o_tmpmemctx );
1603 rs->sr_ctrls = NULL;
1609 syncprov_detach_op( Operation *op, syncops *so )
1615 GroupAssertion *g1, *g2;
1617 /* count the search attrs */
1618 for (i=0; op->ors_attrs && !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1619 alen += op->ors_attrs[i].an_name.bv_len + 1;
1621 /* Make a new copy of the operation */
1622 size = sizeof(Operation) + sizeof(Opheader) +
1623 (i ? ( (i+1) * sizeof(AttributeName) + alen) : 0) +
1624 op->o_req_dn.bv_len + 1 +
1625 op->o_req_ndn.bv_len + 1 +
1626 op->o_ndn.bv_len + 1 +
1627 so->s_filterstr.bv_len + 1;
1628 op2 = (Operation *)ch_calloc( 1, size );
1629 op2->o_hdr = (Opheader *)(op2+1);
1631 /* Copy the fields we care about explicitly, leave the rest alone */
1632 *op2->o_hdr = *op->o_hdr;
1633 op2->o_tag = op->o_tag;
1634 op2->o_time = op->o_time;
1635 op2->o_bd = op->o_bd;
1636 op2->o_request = op->o_request;
1639 op2->ors_attrs = (AttributeName *)(op2->o_hdr + 1);
1640 ptr = (char *)(op2->ors_attrs+i+1);
1641 for (i=0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++) {
1642 op2->ors_attrs[i] = op->ors_attrs[i];
1643 op2->ors_attrs[i].an_name.bv_val = ptr;
1644 ptr = lutil_strcopy( ptr, op->ors_attrs[i].an_name.bv_val ) + 1;
1646 BER_BVZERO( &op2->ors_attrs[i].an_name );
1648 ptr = (char *)(op2->o_hdr + 1);
1650 op2->o_authz = op->o_authz;
1651 op2->o_ndn.bv_val = ptr;
1652 ptr = lutil_strcopy(ptr, op->o_ndn.bv_val) + 1;
1653 op2->o_dn = op2->o_ndn;
1654 op2->o_req_dn.bv_len = op->o_req_dn.bv_len;
1655 op2->o_req_dn.bv_val = ptr;
1656 ptr = lutil_strcopy(ptr, op->o_req_dn.bv_val) + 1;
1657 op2->o_req_ndn.bv_len = op->o_req_ndn.bv_len;
1658 op2->o_req_ndn.bv_val = ptr;
1659 ptr = lutil_strcopy(ptr, op->o_req_ndn.bv_val) + 1;
1660 op2->ors_filterstr.bv_val = ptr;
1661 strcpy( ptr, so->s_filterstr.bv_val );
1662 op2->ors_filterstr.bv_len = so->s_filterstr.bv_len;
1663 op2->ors_filter = str2filter( ptr );
1666 /* Copy any cached group ACLs individually */
1667 op2->o_groups = NULL;
1668 for ( g1=op->o_groups; g1; g1=g1->ga_next ) {
1669 g2 = ch_malloc( sizeof(GroupAssertion) + g1->ga_len );
1671 strcpy( g2->ga_ndn, g1->ga_ndn );
1672 g2->ga_next = op2->o_groups;
1676 /* Add op2 to conn so abandon will find us */
1677 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
1678 op->o_conn->c_n_ops_executing++;
1679 op->o_conn->c_n_ops_completed--;
1680 LDAP_STAILQ_INSERT_TAIL( &op->o_conn->c_ops, op2, o_next );
1681 so->s_flags |= PS_IS_DETACHED;
1682 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
1686 syncprov_search_response( Operation *op, SlapReply *rs )
1688 searchstate *ss = op->o_callback->sc_private;
1689 slap_overinst *on = ss->ss_on;
1690 sync_control *srs = op->o_controls[slap_cids.sc_LDAPsync];
1692 if ( rs->sr_type == REP_SEARCH || rs->sr_type == REP_SEARCHREF ) {
1693 /* If we got a referral without a referral object, there's
1694 * something missing that we cannot replicate. Just ignore it.
1695 * The consumer will abort because we didn't send the expected
1698 if ( !rs->sr_entry ) {
1699 assert( rs->sr_entry != NULL );
1700 Debug( LDAP_DEBUG_ANY, "bogus referral in context\n",0,0,0 );
1701 return SLAP_CB_CONTINUE;
1703 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1704 Attribute *a = attr_find( rs->sr_entry->e_attrs,
1705 slap_schema.si_ad_entryCSN );
1707 /* Don't send the ctx entry twice */
1708 if ( a && bvmatch( &a->a_nvals[0], &srs->sr_state.ctxcsn ) )
1709 return LDAP_SUCCESS;
1711 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1713 rs->sr_ctrls[1] = NULL;
1714 rs->sr_err = syncprov_state_ctrl( op, rs, rs->sr_entry,
1715 LDAP_SYNC_ADD, rs->sr_ctrls, 0, 0, NULL );
1716 } else if ( rs->sr_type == REP_RESULT && rs->sr_err == LDAP_SUCCESS ) {
1717 struct berval cookie;
1719 slap_compose_sync_cookie( op, &cookie,
1720 &op->ors_filter->f_and->f_ava->aa_value,
1721 srs->sr_state.rid );
1723 /* Is this a regular refresh? */
1725 rs->sr_ctrls = op->o_tmpalloc( sizeof(LDAPControl *)*2,
1727 rs->sr_ctrls[1] = NULL;
1728 rs->sr_err = syncprov_done_ctrl( op, rs, rs->sr_ctrls,
1729 0, 1, &cookie, ss->ss_present ? LDAP_SYNC_REFRESH_PRESENTS :
1730 LDAP_SYNC_REFRESH_DELETES );
1733 /* It's RefreshAndPersist, transition to Persist phase */
1734 syncprov_sendinfo( op, rs, ( ss->ss_present && rs->sr_nentries ) ?
1735 LDAP_TAG_SYNC_REFRESH_PRESENT : LDAP_TAG_SYNC_REFRESH_DELETE,
1736 &cookie, 1, NULL, 0 );
1737 /* Flush any queued persist messages */
1738 if ( ss->ss_so->s_res ) {
1739 ldap_pvt_thread_mutex_lock( &ss->ss_so->s_mutex );
1741 syncprov_qplay( op, on, ss->ss_so );
1744 /* Turn off the refreshing flag */
1745 ss->ss_so->s_flags ^= PS_IS_REFRESHING;
1747 ldap_pvt_thread_mutex_unlock( &ss->ss_so->s_mutex );
1749 /* Detach this Op from frontend control */
1750 syncprov_detach_op( op, ss->ss_so );
1752 return LDAP_SUCCESS;
1756 return SLAP_CB_CONTINUE;
1760 syncprov_op_search( Operation *op, SlapReply *rs )
1762 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1763 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1765 int gotstate = 0, nochange = 0, do_present = 1;
1766 Filter *fand, *fava;
1767 syncops *sop = NULL;
1770 struct berval ctxcsn;
1771 char csnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
1773 if ( !(op->o_sync_mode & SLAP_SYNC_REFRESH) ) return SLAP_CB_CONTINUE;
1775 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1776 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR, "illegal value for derefAliases" );
1780 srs = op->o_controls[slap_cids.sc_LDAPsync];
1781 op->o_managedsait = SLAP_CONTROL_NONCRITICAL;
1783 /* If this is a persistent search, set it up right away */
1784 if ( op->o_sync_mode & SLAP_SYNC_PERSIST ) {
1794 so.s_flags = PS_IS_REFRESHING;
1795 /* syncprov_findbase expects to be called as a callback... */
1796 sc.sc_private = &opc;
1798 cb = op->o_callback;
1799 op->o_callback = ≻
1800 rs->sr_err = syncprov_findbase( op, &fc );
1801 op->o_callback = cb;
1803 if ( rs->sr_err != LDAP_SUCCESS ) {
1804 send_ldap_result( op, rs );
1807 sop = ch_malloc( sizeof( syncops ));
1809 ldap_pvt_thread_mutex_init( &sop->s_mutex );
1810 sop->s_rid = srs->sr_state.rid;
1813 ldap_pvt_thread_mutex_lock( &si->si_ops_mutex );
1814 sop->s_next = si->si_ops;
1816 ldap_pvt_thread_mutex_unlock( &si->si_ops_mutex );
1819 /* snapshot the ctxcsn */
1820 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1821 strcpy( csnbuf, si->si_ctxcsnbuf );
1822 ctxcsn.bv_len = si->si_ctxcsn.bv_len;
1823 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1824 ctxcsn.bv_val = csnbuf;
1826 /* If we have a cookie, handle the PRESENT lookups */
1827 if ( !BER_BVISNULL( &srs->sr_state.ctxcsn )) {
1830 /* The cookie was validated when it was parsed, just use it */
1832 /* If just Refreshing and nothing has changed, shortcut it */
1833 if ( bvmatch( &srs->sr_state.ctxcsn, &ctxcsn )) {
1835 if ( !(op->o_sync_mode & SLAP_SYNC_PERSIST) ) {
1836 LDAPControl *ctrls[2];
1840 syncprov_done_ctrl( op, rs, ctrls, 0, 0,
1841 NULL, LDAP_SYNC_REFRESH_DELETES );
1842 rs->sr_ctrls = ctrls;
1843 rs->sr_err = LDAP_SUCCESS;
1844 send_ldap_result( op, rs );
1845 rs->sr_ctrls = NULL;
1850 /* Do we have a sessionlog for this search? */
1853 ldap_pvt_thread_mutex_lock( &sl->sl_mutex );
1854 if ( ber_bvcmp( &srs->sr_state.ctxcsn, &sl->sl_mincsn ) >= 0 ) {
1856 /* mutex is unlocked in playlog */
1857 syncprov_playlog( op, rs, sl, &srs->sr_state.ctxcsn, &ctxcsn );
1859 ldap_pvt_thread_mutex_unlock( &sl->sl_mutex );
1862 /* Is the CSN still present in the database? */
1863 if ( syncprov_findcsn( op, FIND_CSN ) != LDAP_SUCCESS ) {
1864 /* No, so a reload is required */
1865 #if 0 /* the consumer doesn't seem to send this hint */
1866 if ( op->o_sync_rhint == 0 ) {
1867 send_ldap_error( op, rs, LDAP_SYNC_REFRESH_REQUIRED, "sync cookie is stale" );
1873 /* If changed and doing Present lookup, send Present UUIDs */
1874 if ( do_present && syncprov_findcsn( op, FIND_PRESENT ) !=
1876 send_ldap_result( op, rs );
1883 /* Append CSN range to search filter, save original filter
1884 * for persistent search evaluation
1887 sop->s_filterstr= op->ors_filterstr;
1890 fand = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1891 fand->f_choice = LDAP_FILTER_AND;
1892 fand->f_next = NULL;
1893 fava = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1894 fava->f_choice = LDAP_FILTER_LE;
1895 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1896 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1897 #ifdef LDAP_COMP_MATCH
1898 fava->f_ava->aa_cf = NULL;
1900 ber_dupbv_x( &fava->f_ava->aa_value, &ctxcsn, op->o_tmpmemctx );
1903 fava->f_next = op->o_tmpalloc( sizeof(Filter), op->o_tmpmemctx );
1904 fava = fava->f_next;
1905 fava->f_choice = LDAP_FILTER_GE;
1906 fava->f_ava = op->o_tmpalloc( sizeof(AttributeAssertion), op->o_tmpmemctx );
1907 fava->f_ava->aa_desc = slap_schema.si_ad_entryCSN;
1908 #ifdef LDAP_COMP_MATCH
1909 fava->f_ava->aa_cf = NULL;
1911 ber_dupbv_x( &fava->f_ava->aa_value, &srs->sr_state.ctxcsn, op->o_tmpmemctx );
1913 fava->f_next = op->ors_filter;
1914 op->ors_filter = fand;
1915 filter2bv_x( op, op->ors_filter, &op->ors_filterstr );
1917 /* Let our callback add needed info to returned entries */
1918 cb = op->o_tmpcalloc(1, sizeof(slap_callback)+sizeof(searchstate), op->o_tmpmemctx);
1919 ss = (searchstate *)(cb+1);
1922 ss->ss_present = do_present;
1923 cb->sc_response = syncprov_search_response;
1924 cb->sc_cleanup = syncprov_search_cleanup;
1925 cb->sc_private = ss;
1926 cb->sc_next = op->o_callback;
1927 op->o_callback = cb;
1929 #if 0 /* I don't think we need to shortcircuit back-bdb any more */
1930 op->o_sync_mode &= SLAP_CONTROL_MASK;
1933 /* If this is a persistent search and no changes were reported during
1934 * the refresh phase, just invoke the response callback to transition
1935 * us into persist phase
1938 rs->sr_err = LDAP_SUCCESS;
1939 rs->sr_nentries = 0;
1940 send_ldap_result( op, rs );
1943 return SLAP_CB_CONTINUE;
1947 syncprov_operational(
1951 slap_overinst *on = (slap_overinst *)op->o_bd->bd_info;
1952 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
1954 if ( rs->sr_entry &&
1955 dn_match( &rs->sr_entry->e_nname, op->o_bd->be_nsuffix )) {
1957 if ( SLAP_OPATTRS( rs->sr_attr_flags ) ||
1958 ad_inlist( slap_schema.si_ad_contextCSN, rs->sr_attrs )) {
1959 Attribute *a, **ap = NULL;
1961 for ( a=rs->sr_entry->e_attrs; a; a=a->a_next ) {
1962 if ( a->a_desc == slap_schema.si_ad_contextCSN )
1967 for ( ap = &rs->sr_operational_attrs; *ap; ap=&(*ap)->a_next );
1969 a = ch_malloc( sizeof(Attribute));
1970 a->a_desc = slap_schema.si_ad_contextCSN;
1971 a->a_vals = ch_malloc( 2 * sizeof(struct berval));
1972 a->a_vals[1].bv_val = NULL;
1973 a->a_nvals = a->a_vals;
1979 ldap_pvt_thread_mutex_lock( &si->si_csn_mutex );
1981 strcpy( a->a_vals[0].bv_val, si->si_ctxcsnbuf );
1983 ber_dupbv( &a->a_vals[0], &si->si_ctxcsn );
1985 ldap_pvt_thread_mutex_unlock( &si->si_csn_mutex );
1988 return SLAP_CB_CONTINUE;
1996 static ConfigDriver sp_cf_gen;
1998 static ConfigTable spcfg[] = {
1999 { "syncprov-checkpoint", "ops> <minutes", 3, 3, 0, ARG_MAGIC|SP_CHKPT,
2000 sp_cf_gen, "( OLcfgOvAt:1.1 NAME 'olcSpCheckpoint' "
2001 "DESC 'ContextCSN checkpoint interval in ops and minutes' "
2002 "SYNTAX OMsDirectoryString SINGLE-VALUE )", NULL, NULL },
2003 { "syncprov-sessionlog", "size", 2, 2, 0, ARG_INT|ARG_MAGIC|SP_SESSL,
2004 sp_cf_gen, "( OLcfgOvAt:1.2 NAME 'olcSpSessionlog' "
2005 "DESC 'Session log size in ops' "
2006 "SYNTAX OMsInteger SINGLE-VALUE )", NULL, NULL },
2007 { NULL, NULL, 0, 0, 0, ARG_IGNORED }
2010 static ConfigOCs spocs[] = {
2011 { "( OLcfgOvOc:1.1 "
2012 "NAME 'olcSyncProvConfig' "
2013 "DESC 'SyncRepl Provider configuration' "
2014 "SUP olcOverlayConfig "
2015 "MAY ( olcSpCheckpoint $ olcSpSessionlog ) )",
2016 Cft_Overlay, spcfg },
2021 sp_cf_gen(ConfigArgs *c)
2023 slap_overinst *on = (slap_overinst *)c->bi;
2024 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2027 if ( c->op == SLAP_CONFIG_EMIT ) {
2028 switch ( c->type ) {
2030 if ( si->si_chkops || si->si_chktime ) {
2032 bv.bv_len = sprintf( c->msg, "%d %d",
2033 si->si_chkops, si->si_chktime );
2035 value_add_one( &c->rvalue_vals, &bv );
2041 if ( si->si_logs ) {
2042 c->value_int = si->si_logs->sl_size;
2049 } else if ( c->op == LDAP_MOD_DELETE ) {
2050 switch ( c->type ) {
2057 si->si_logs->sl_size = 0;
2059 rc = LDAP_NO_SUCH_ATTRIBUTE;
2064 switch ( c->type ) {
2066 si->si_chkops = atoi( c->argv[1] );
2067 si->si_chktime = atoi( c->argv[2] ) * 60;
2071 int size = c->value_int;
2074 sprintf( c->msg, "%s size %d is negative",
2076 Debug( LDAP_DEBUG_CONFIG, "%s: %s\n", c->log, c->msg, 0 );
2077 return ARG_BAD_CONF;
2081 sl = ch_malloc( sizeof( sessionlog ) + LDAP_LUTIL_CSNSTR_BUFSIZE );
2082 sl->sl_mincsn.bv_val = (char *)(sl+1);
2083 sl->sl_mincsn.bv_len = 0;
2085 sl->sl_head = sl->sl_tail = NULL;
2086 ldap_pvt_thread_mutex_init( &sl->sl_mutex );
2096 /* Cheating - we have no thread pool context for these functions,
2099 typedef struct thread_keys {
2102 ldap_pvt_thread_pool_keyfree_t *xfree;
2106 /* A fake thread context */
2107 static thread_keys thrctx[MAXKEYS];
2109 /* ITS#3456 we cannot run this search on the main thread, must use a
2110 * child thread in order to insure we have a big enough stack.
2117 syncprov_findcsn( ptr, FIND_MAXCSN );
2121 /* Read any existing contextCSN from the underlying db.
2122 * Then search for any entries newer than that. If no value exists,
2123 * just generate it. Cache whatever result.
2130 slap_overinst *on = (slap_overinst *) be->bd_info;
2131 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2134 char opbuf[OPERATION_BUFFER_SIZE];
2135 char ctxcsnbuf[LDAP_LUTIL_CSNSTR_BUFSIZE];
2136 Operation *op = (Operation *)opbuf;
2141 if ( slapMode & SLAP_TOOL_MODE ) {
2145 rc = overlay_register_control( be, LDAP_CONTROL_SYNC );
2150 connection_fake_init( &conn, op, thrctx );
2152 op->o_dn = be->be_rootdn;
2153 op->o_ndn = be->be_rootndn;
2155 ctxcsnbuf[0] = '\0';
2157 op->o_bd->bd_info = on->on_info->oi_orig;
2158 rc = be_entry_get_rw( op, be->be_nsuffix, NULL,
2159 slap_schema.si_ad_contextCSN, 0, &e );
2162 ldap_pvt_thread_t tid;
2164 a = attr_find( e->e_attrs, slap_schema.si_ad_contextCSN );
2166 si->si_ctxcsn.bv_len = a->a_nvals[0].bv_len;
2167 if ( si->si_ctxcsn.bv_len >= sizeof(si->si_ctxcsnbuf ))
2168 si->si_ctxcsn.bv_len = sizeof(si->si_ctxcsnbuf)-1;
2169 strncpy( si->si_ctxcsnbuf, a->a_nvals[0].bv_val,
2170 si->si_ctxcsn.bv_len );
2171 si->si_ctxcsnbuf[si->si_ctxcsn.bv_len] = '\0';
2172 strcpy( ctxcsnbuf, si->si_ctxcsnbuf );
2174 be_entry_release_rw( op, e, 0 );
2175 op->o_bd->bd_info = (BackendInfo *)on;
2176 op->o_req_dn = be->be_suffix[0];
2177 op->o_req_ndn = be->be_nsuffix[0];
2178 op->ors_scope = LDAP_SCOPE_SUBTREE;
2179 ldap_pvt_thread_create( &tid, 0, syncprov_db_otask, op );
2180 ldap_pvt_thread_join( tid, NULL );
2181 } else if ( SLAP_SYNC_SHADOW( op->o_bd )) {
2182 /* If we're also a consumer, and we didn't find the context entry,
2183 * then don't generate anything, wait for our provider to send it
2189 if ( BER_BVISEMPTY( &si->si_ctxcsn ) ) {
2190 slap_get_csn( op, si->si_ctxcsnbuf, sizeof(si->si_ctxcsnbuf),
2191 &si->si_ctxcsn, 0 );
2194 /* If our ctxcsn is different from what was read from the root
2195 * entry, make sure we do a checkpoint on close
2197 if ( strcmp( si->si_ctxcsnbuf, ctxcsnbuf )) {
2202 op->o_bd->bd_info = (BackendInfo *)on;
2206 /* Write the current contextCSN into the underlying db.
2213 slap_overinst *on = (slap_overinst *) be->bd_info;
2214 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2217 if ( slapMode & SLAP_TOOL_MODE ) {
2220 if ( si->si_numops ) {
2222 char opbuf[OPERATION_BUFFER_SIZE];
2223 Operation *op = (Operation *)opbuf;
2224 SlapReply rs = {REP_RESULT};
2226 connection_fake_init( &conn, op, thrctx );
2228 op->o_dn = be->be_rootdn;
2229 op->o_ndn = be->be_rootndn;
2230 syncprov_checkpoint( op, &rs, on );
2232 for ( i=0; thrctx[i].key; i++) {
2233 if ( thrctx[i].xfree )
2234 thrctx[i].xfree( thrctx[i].key, thrctx[i].data );
2235 thrctx[i].key = NULL;
2246 slap_overinst *on = (slap_overinst *)be->bd_info;
2247 syncprov_info_t *si;
2249 si = ch_calloc(1, sizeof(syncprov_info_t));
2250 on->on_bi.bi_private = si;
2251 ldap_pvt_thread_mutex_init( &si->si_csn_mutex );
2252 ldap_pvt_thread_mutex_init( &si->si_ops_mutex );
2253 ldap_pvt_thread_mutex_init( &si->si_mods_mutex );
2254 si->si_ctxcsn.bv_val = si->si_ctxcsnbuf;
2256 csn_anlist[0].an_desc = slap_schema.si_ad_entryCSN;
2257 csn_anlist[0].an_name = slap_schema.si_ad_entryCSN->ad_cname;
2259 uuid_anlist[0].an_desc = slap_schema.si_ad_entryUUID;
2260 uuid_anlist[0].an_name = slap_schema.si_ad_entryUUID->ad_cname;
2266 syncprov_db_destroy(
2270 slap_overinst *on = (slap_overinst *)be->bd_info;
2271 syncprov_info_t *si = (syncprov_info_t *)on->on_bi.bi_private;
2274 ldap_pvt_thread_mutex_destroy( &si->si_mods_mutex );
2275 ldap_pvt_thread_mutex_destroy( &si->si_ops_mutex );
2276 ldap_pvt_thread_mutex_destroy( &si->si_csn_mutex );
2283 static int syncprov_parseCtrl (
2292 struct berval cookie = BER_BVNULL;
2296 if ( op->o_sync != SLAP_CONTROL_NONE ) {
2297 rs->sr_text = "Sync control specified multiple times";
2298 return LDAP_PROTOCOL_ERROR;
2301 if ( op->o_pagedresults != SLAP_CONTROL_NONE ) {
2302 rs->sr_text = "Sync control specified with pagedResults control";
2303 return LDAP_PROTOCOL_ERROR;
2306 if ( BER_BVISEMPTY( &ctrl->ldctl_value ) ) {
2307 rs->sr_text = "Sync control value is empty (or absent)";
2308 return LDAP_PROTOCOL_ERROR;
2311 /* Parse the control value
2312 * syncRequestValue ::= SEQUENCE {
2317 * refreshAndPersist (3)
2319 * cookie syncCookie OPTIONAL
2323 ber = ber_init( &ctrl->ldctl_value );
2325 rs->sr_text = "internal error";
2329 if ( (tag = ber_scanf( ber, "{i" /*}*/, &mode )) == LBER_ERROR ) {
2330 rs->sr_text = "Sync control : mode decoding error";
2331 return LDAP_PROTOCOL_ERROR;
2335 case LDAP_SYNC_REFRESH_ONLY:
2336 mode = SLAP_SYNC_REFRESH;
2338 case LDAP_SYNC_REFRESH_AND_PERSIST:
2339 mode = SLAP_SYNC_REFRESH_AND_PERSIST;
2342 rs->sr_text = "Sync control : unknown update mode";
2343 return LDAP_PROTOCOL_ERROR;
2346 tag = ber_peek_tag( ber, &len );
2348 if ( tag == LDAP_TAG_SYNC_COOKIE ) {
2349 if (( ber_scanf( ber, /*{*/ "o", &cookie )) == LBER_ERROR ) {
2350 rs->sr_text = "Sync control : cookie decoding error";
2351 return LDAP_PROTOCOL_ERROR;
2354 if ( tag == LDAP_TAG_RELOAD_HINT ) {
2355 if (( ber_scanf( ber, /*{*/ "b", &rhint )) == LBER_ERROR ) {
2356 rs->sr_text = "Sync control : rhint decoding error";
2357 return LDAP_PROTOCOL_ERROR;
2360 if (( ber_scanf( ber, /*{*/ "}")) == LBER_ERROR ) {
2361 rs->sr_text = "Sync control : decoding error";
2362 return LDAP_PROTOCOL_ERROR;
2364 sr = op->o_tmpcalloc( 1, sizeof(struct sync_control), op->o_tmpmemctx );
2365 sr->sr_rhint = rhint;
2366 if (!BER_BVISNULL(&cookie)) {
2367 ber_dupbv( &sr->sr_state.octet_str, &cookie );
2368 slap_parse_sync_cookie( &sr->sr_state );
2371 op->o_controls[slap_cids.sc_LDAPsync] = sr;
2373 (void) ber_free( ber, 1 );
2375 op->o_sync = ctrl->ldctl_iscritical
2376 ? SLAP_CONTROL_CRITICAL
2377 : SLAP_CONTROL_NONCRITICAL;
2379 op->o_sync_mode |= mode; /* o_sync_mode shares o_sync */
2381 return LDAP_SUCCESS;
2384 /* This overlay is set up for dynamic loading via moduleload. For static
2385 * configuration, you'll need to arrange for the slap_overinst to be
2386 * initialized and registered by some other function inside slapd.
2389 static slap_overinst syncprov;
2396 rc = register_supported_control( LDAP_CONTROL_SYNC,
2397 SLAP_CTRL_HIDE|SLAP_CTRL_SEARCH, NULL,
2398 syncprov_parseCtrl, &slap_cids.sc_LDAPsync );
2399 if ( rc != LDAP_SUCCESS ) {
2400 Debug( LDAP_DEBUG_ANY,
2401 "syncprov_init: Failed to register control %d\n", rc, 0, 0 );
2405 syncprov.on_bi.bi_type = "syncprov";
2406 syncprov.on_bi.bi_db_init = syncprov_db_init;
2407 syncprov.on_bi.bi_db_destroy = syncprov_db_destroy;
2408 syncprov.on_bi.bi_db_open = syncprov_db_open;
2409 syncprov.on_bi.bi_db_close = syncprov_db_close;
2411 syncprov.on_bi.bi_op_abandon = syncprov_op_abandon;
2412 syncprov.on_bi.bi_op_cancel = syncprov_op_abandon;
2414 syncprov.on_bi.bi_op_add = syncprov_op_mod;
2415 syncprov.on_bi.bi_op_compare = syncprov_op_compare;
2416 syncprov.on_bi.bi_op_delete = syncprov_op_mod;
2417 syncprov.on_bi.bi_op_modify = syncprov_op_mod;
2418 syncprov.on_bi.bi_op_modrdn = syncprov_op_mod;
2419 syncprov.on_bi.bi_op_search = syncprov_op_search;
2420 syncprov.on_bi.bi_extended = syncprov_op_extended;
2421 syncprov.on_bi.bi_operational = syncprov_operational;
2423 syncprov.on_bi.bi_cf_ocs = spocs;
2425 rc = config_register_schema( spcfg, spocs );
2426 if ( rc ) return rc;
2428 return overlay_register( &syncprov );
2431 #if SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC
2433 init_module( int argc, char *argv[] )
2435 return syncprov_init();
2437 #endif /* SLAPD_OVER_SYNCPROV == SLAPD_MOD_DYNAMIC */
2439 #endif /* defined(SLAPD_OVER_SYNCPROV) */