1 /* ctxcsn.c -- Context CSN Management Routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2003-2004 The OpenLDAP Foundation.
6 * Portions Copyright 2003 IBM Corporation.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted only as authorized by the OpenLDAP
13 * A copy of this license is available in the file LICENSE in the
14 * top-level directory of the distribution or, alternatively, at
15 * <http://www.OpenLDAP.org/license.html>.
22 #include <ac/string.h>
23 #include <ac/socket.h>
27 #include "lutil_ldap.h"
29 const struct berval slap_ldapsync_bv = BER_BVC("ldapsync");
30 const struct berval slap_ldapsync_cn_bv = BER_BVC("cn=ldapsync");
35 struct berval *maxcsn,
39 struct slap_csn_entry *csne, *committed_csne = NULL;
46 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
48 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
49 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
50 if ( curcsn ) *curcsn = csne->ce_csn;
51 csne->ce_state = SLAP_CSN_COMMIT;
56 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
57 if ( csne->ce_state == SLAP_CSN_COMMIT ) committed_csne = csne;
58 if ( csne->ce_state == SLAP_CSN_PENDING ) break;
61 if ( committed_csne && maxcsn ) *maxcsn = committed_csne->ce_csn;
62 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
66 slap_rewind_commit_csn( Operation *op )
68 struct slap_csn_entry *csne;
70 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
72 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
73 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
74 csne->ce_state = SLAP_CSN_PENDING;
79 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
83 slap_graduate_commit_csn( Operation *op )
85 struct slap_csn_entry *csne;
87 if ( op == NULL ) return;
88 if ( op->o_bd == NULL ) return;
90 assert( op->o_bd->be_pcl_mutexp != NULL );
92 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
94 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
95 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
96 LDAP_TAILQ_REMOVE( op->o_bd->be_pending_csn_list,
98 ch_free( csne->ce_csn.bv_val );
104 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
109 static struct berval ocbva[] = {
112 BER_BVC("syncProviderSubentry"),
117 slap_create_context_csn_entry(
119 struct berval *context_csn )
126 e = (Entry *) ch_calloc( 1, sizeof( Entry ));
128 attr_merge( e, slap_schema.si_ad_objectClass,
130 attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
132 attr_merge_one( e, slap_schema.si_ad_cn,
133 (struct berval *)&slap_ldapsync_bv, NULL );
136 attr_merge_one( e, slap_schema.si_ad_contextCSN,
140 BER_BVSTR( &bv, "{}" );
141 attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
143 build_new_dn( &e->e_name, &be->be_nsuffix[0],
144 (struct berval *)&slap_ldapsync_cn_bv, NULL );
145 ber_dupbv( &e->e_nname, &e->e_name );
155 struct slap_csn_entry *pending;
157 pending = (struct slap_csn_entry *) ch_calloc( 1,
158 sizeof( struct slap_csn_entry ));
159 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
161 ber_dupbv( &pending->ce_csn, csn );
162 pending->ce_connid = op->o_connid;
163 pending->ce_opid = op->o_opid;
164 pending->ce_state = SLAP_CSN_PENDING;
165 LDAP_TAILQ_INSERT_TAIL( op->o_bd->be_pending_csn_list,
166 pending, ce_csn_link );
167 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
178 if ( csn == NULL ) return LDAP_OTHER;
180 csn->bv_len = lutil_csnstr( csnbuf, len, 0, 0 );
181 csn->bv_val = csnbuf;
184 slap_queue_csn( op, csn );