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");
39 struct slap_csn_entry *csne, *committed_csne = NULL;
45 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
47 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
48 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
49 csne->ce_state = SLAP_CSN_COMMIT;
54 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
55 if ( csne->ce_state == SLAP_CSN_COMMIT ) committed_csne = csne;
56 if ( csne->ce_state == SLAP_CSN_PENDING ) break;
59 if ( committed_csne && maxcsn ) *maxcsn = committed_csne->ce_csn;
60 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
64 slap_rewind_commit_csn( Operation *op )
66 struct slap_csn_entry *csne;
68 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
70 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
71 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
72 csne->ce_state = SLAP_CSN_PENDING;
77 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
81 slap_graduate_commit_csn( Operation *op )
83 struct slap_csn_entry *csne;
85 if ( op == NULL ) return;
86 if ( op->o_bd == NULL ) return;
89 /* it is NULL when we get here from the frontendDB;
90 * alternate fix: initialize frontendDB like all other backends */
91 assert( op->o_bd->be_pcl_mutexp != NULL );
94 if ( op->o_bd->be_pcl_mutexp == NULL ) return;
96 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
98 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
99 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
100 LDAP_TAILQ_REMOVE( op->o_bd->be_pending_csn_list,
102 if ( op->o_csn.bv_val == csne->ce_csn.bv_val ) {
103 BER_BVZERO( &op->o_csn );
105 ch_free( csne->ce_csn.bv_val );
111 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
116 static struct berval ocbva[] = {
119 BER_BVC("syncProviderSubentry"),
124 slap_create_context_csn_entry(
126 struct berval *context_csn )
134 attr_merge( e, slap_schema.si_ad_objectClass,
136 attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
138 attr_merge_one( e, slap_schema.si_ad_cn,
139 (struct berval *)&slap_ldapsync_bv, NULL );
142 attr_merge_one( e, slap_schema.si_ad_contextCSN,
146 BER_BVSTR( &bv, "{}" );
147 attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
149 build_new_dn( &e->e_name, &be->be_nsuffix[0],
150 (struct berval *)&slap_ldapsync_cn_bv, NULL );
151 ber_dupbv( &e->e_nname, &e->e_name );
161 struct slap_csn_entry *pending;
163 pending = (struct slap_csn_entry *) ch_calloc( 1,
164 sizeof( struct slap_csn_entry ));
165 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
167 ber_dupbv( &pending->ce_csn, csn );
168 ber_bvreplace_x( &op->o_csn, &pending->ce_csn, op->o_tmpmemctx );
169 pending->ce_connid = op->o_connid;
170 pending->ce_opid = op->o_opid;
171 pending->ce_state = SLAP_CSN_PENDING;
172 LDAP_TAILQ_INSERT_TAIL( op->o_bd->be_pending_csn_list,
173 pending, ce_csn_link );
174 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
183 if ( csn == NULL ) return LDAP_OTHER;
185 /* gmtime doesn't always need a mutex, but lutil_csnstr does */
186 ldap_pvt_thread_mutex_lock( &gmtime_mutex );
187 csn->bv_len = lutil_csnstr( csn->bv_val, csn->bv_len, slap_serverID, 0 );
188 ldap_pvt_thread_mutex_unlock( &gmtime_mutex );
191 slap_queue_csn( op, csn );