1 /* ctxcsn.c -- Context CSN Management Routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2003-2007 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");
38 struct slap_csn_entry *csne, *committed_csne = NULL;
44 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
46 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
47 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
48 csne->ce_state = SLAP_CSN_COMMIT;
53 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
54 if ( csne->ce_state == SLAP_CSN_COMMIT ) committed_csne = csne;
55 if ( csne->ce_state == SLAP_CSN_PENDING ) break;
58 if ( committed_csne && maxcsn ) *maxcsn = committed_csne->ce_csn;
59 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
63 slap_rewind_commit_csn( Operation *op )
65 struct slap_csn_entry *csne;
67 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
69 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
70 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
71 csne->ce_state = SLAP_CSN_PENDING;
76 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
80 slap_graduate_commit_csn( Operation *op )
82 struct slap_csn_entry *csne;
84 if ( op == NULL ) return;
85 if ( op->o_bd == NULL ) return;
88 /* it is NULL when we get here from the frontendDB;
89 * alternate fix: initialize frontendDB like all other backends */
90 assert( op->o_bd->be_pcl_mutexp != NULL );
93 if ( op->o_bd->be_pcl_mutexp == NULL ) return;
95 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
97 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
98 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
99 LDAP_TAILQ_REMOVE( op->o_bd->be_pending_csn_list,
101 if ( op->o_csn.bv_val == csne->ce_csn.bv_val ) {
102 BER_BVZERO( &op->o_csn );
104 ch_free( csne->ce_csn.bv_val );
110 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
115 static struct berval ocbva[] = {
118 BER_BVC("syncProviderSubentry"),
123 slap_create_context_csn_entry(
125 struct berval *context_csn )
133 attr_merge( e, slap_schema.si_ad_objectClass,
135 attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
137 attr_merge_one( e, slap_schema.si_ad_cn,
138 (struct berval *)&slap_ldapsync_bv, NULL );
141 attr_merge_one( e, slap_schema.si_ad_contextCSN,
145 BER_BVSTR( &bv, "{}" );
146 attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
148 build_new_dn( &e->e_name, &be->be_nsuffix[0],
149 (struct berval *)&slap_ldapsync_cn_bv, NULL );
150 ber_dupbv( &e->e_nname, &e->e_name );
160 struct slap_csn_entry *pending;
162 pending = (struct slap_csn_entry *) ch_calloc( 1,
163 sizeof( struct slap_csn_entry ));
164 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
166 ber_dupbv( &pending->ce_csn, csn );
167 ber_bvreplace_x( &op->o_csn, &pending->ce_csn, op->o_tmpmemctx );
168 pending->ce_connid = op->o_connid;
169 pending->ce_opid = op->o_opid;
170 pending->ce_state = SLAP_CSN_PENDING;
171 LDAP_TAILQ_INSERT_TAIL( op->o_bd->be_pending_csn_list,
172 pending, ce_csn_link );
173 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
182 if ( csn == NULL ) return LDAP_OTHER;
184 #ifndef HAVE_GMTIME_R
185 ldap_pvt_thread_mutex_lock( &gmtime_mutex );
187 csn->bv_len = lutil_csnstr( csn->bv_val, csn->bv_len, 0, 0 );
188 #ifndef HAVE_GMTIME_R
189 ldap_pvt_thread_mutex_unlock( &gmtime_mutex );
193 slap_queue_csn( op, csn );