1 /* ctxcsn.c -- Context CSN Management Routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2003-2005 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;
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 if ( curcsn ) *curcsn = csne->ce_csn;
50 csne->ce_state = SLAP_CSN_COMMIT;
55 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
56 if ( csne->ce_state == SLAP_CSN_COMMIT ) committed_csne = csne;
57 if ( csne->ce_state == SLAP_CSN_PENDING ) break;
60 if ( committed_csne && maxcsn ) *maxcsn = committed_csne->ce_csn;
61 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
65 slap_rewind_commit_csn( Operation *op )
67 struct slap_csn_entry *csne;
69 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
71 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
72 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
73 csne->ce_state = SLAP_CSN_PENDING;
78 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
82 slap_graduate_commit_csn( Operation *op )
84 struct slap_csn_entry *csne;
86 if ( op == NULL ) return;
87 if ( op->o_bd == NULL ) return;
90 /* it is NULL when we get here from the frontendDB;
91 * alternate fix: initialize frontendDB like all other backends */
92 assert( op->o_bd->be_pcl_mutexp != NULL );
95 if ( op->o_bd->be_pcl_mutexp == NULL ) return;
97 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
99 LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
100 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
101 LDAP_TAILQ_REMOVE( op->o_bd->be_pending_csn_list,
103 ch_free( csne->ce_csn.bv_val );
109 ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
114 static struct berval ocbva[] = {
117 BER_BVC("syncProviderSubentry"),
122 slap_create_context_csn_entry(
124 struct berval *context_csn )
130 e = (Entry *) ch_calloc( 1, sizeof( Entry ));
132 attr_merge( e, slap_schema.si_ad_objectClass,
134 attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
136 attr_merge_one( e, slap_schema.si_ad_cn,
137 (struct berval *)&slap_ldapsync_bv, NULL );
140 attr_merge_one( e, slap_schema.si_ad_contextCSN,
144 BER_BVSTR( &bv, "{}" );
145 attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
147 build_new_dn( &e->e_name, &be->be_nsuffix[0],
148 (struct berval *)&slap_ldapsync_cn_bv, NULL );
149 ber_dupbv( &e->e_nname, &e->e_name );
159 struct slap_csn_entry *pending;
161 pending = (struct slap_csn_entry *) ch_calloc( 1,
162 sizeof( struct slap_csn_entry ));
163 ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
165 ber_dupbv( &pending->ce_csn, csn );
166 pending->ce_connid = op->o_connid;
167 pending->ce_opid = op->o_opid;
168 pending->ce_state = SLAP_CSN_PENDING;
169 LDAP_TAILQ_INSERT_TAIL( op->o_bd->be_pending_csn_list,
170 pending, ce_csn_link );
171 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( csnbuf, len, 0, 0 );
188 #ifndef HAVE_GMTIME_R
189 ldap_pvt_thread_mutex_unlock( &gmtime_mutex );
191 csn->bv_val = csnbuf;
194 slap_queue_csn( op, csn );