openldap/servers/slapd/ctxcsn.c

188 lines
4.3 KiB
C
Raw Normal View History

2003-11-27 09:17:14 +08:00
/* ctxcsn.c -- Context CSN Management Routines */
/* $OpenLDAP$ */
2003-11-27 09:17:14 +08:00
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
2004-01-02 03:15:16 +08:00
* Copyright 2003-2004 The OpenLDAP Foundation.
2003-11-27 09:17:14 +08:00
* Portions Copyright 2003 IBM Corporation.
* All rights reserved.
*
2003-11-27 09:17:14 +08:00
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
2003-11-27 09:17:14 +08:00
* A copy of this license is available in the file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
*/
#include "portable.h"
#include <stdio.h>
#include <ac/string.h>
#include <ac/socket.h>
#include "lutil.h"
#include "slap.h"
#include "lutil_ldap.h"
2003-09-24 06:52:35 +08:00
const struct berval slap_ldapsync_bv = BER_BVC("ldapsync");
const struct berval slap_ldapsync_cn_bv = BER_BVC("cn=ldapsync");
void
slap_get_commit_csn(
Operation *op,
struct berval *maxcsn,
struct berval *curcsn
)
{
struct slap_csn_entry *csne, *committed_csne = NULL;
int i = 0;
if ( maxcsn ) {
BER_BVZERO( maxcsn );
}
2003-09-24 06:52:35 +08:00
ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
2004-05-31 10:01:59 +08:00
LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
2004-04-06 09:48:36 +08:00
if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
if ( curcsn ) *curcsn = csne->ce_csn;
2004-04-06 09:48:36 +08:00
csne->ce_state = SLAP_CSN_COMMIT;
break;
}
}
2004-05-31 10:01:59 +08:00
LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
2004-04-06 09:48:36 +08:00
if ( csne->ce_state == SLAP_CSN_COMMIT ) committed_csne = csne;
if ( csne->ce_state == SLAP_CSN_PENDING ) break;
}
if ( committed_csne && maxcsn ) *maxcsn = committed_csne->ce_csn;
ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
}
void
slap_rewind_commit_csn( Operation *op )
{
struct slap_csn_entry *csne;
ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
2004-05-31 10:01:59 +08:00
LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
2004-04-06 09:48:36 +08:00
if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
csne->ce_state = SLAP_CSN_PENDING;
break;
}
}
ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
}
void
slap_graduate_commit_csn( Operation *op )
{
struct slap_csn_entry *csne;
2004-04-06 09:48:36 +08:00
if ( op == NULL ) return;
if ( op->o_bd == NULL ) return;
2003-10-01 02:01:47 +08:00
assert( op->o_bd->be_pcl_mutexp != NULL );
ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
2004-05-31 10:01:59 +08:00
LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
2004-04-06 09:48:36 +08:00
if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
2004-05-31 10:01:59 +08:00
LDAP_TAILQ_REMOVE( op->o_bd->be_pending_csn_list,
2004-04-06 09:48:36 +08:00
csne, ce_csn_link );
ch_free( csne->ce_csn.bv_val );
ch_free( csne );
break;
}
}
ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
return;
}
static struct berval ocbva[] = {
BER_BVC("top"),
BER_BVC("subentry"),
BER_BVC("syncProviderSubentry"),
2004-10-05 04:55:09 +08:00
BER_BVNULL
};
Entry *
slap_create_context_csn_entry(
Backend *be,
2004-04-06 09:48:36 +08:00
struct berval *context_csn )
{
Entry* e;
int rc;
struct berval bv;
2003-11-30 09:19:40 +08:00
e = (Entry *) ch_calloc( 1, sizeof( Entry ));
2003-11-30 09:19:40 +08:00
attr_merge( e, slap_schema.si_ad_objectClass,
ocbva, NULL );
attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
&ocbva[1], NULL );
attr_merge_one( e, slap_schema.si_ad_cn,
(struct berval *)&slap_ldapsync_bv, NULL );
if ( context_csn ) {
attr_merge_one( e, slap_schema.si_ad_contextCSN,
context_csn, NULL );
2003-09-04 07:47:37 +08:00
}
2004-10-05 04:55:09 +08:00
BER_BVSTR( &bv, "{}" );
attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
2003-11-30 09:19:40 +08:00
build_new_dn( &e->e_name, &be->be_nsuffix[0],
(struct berval *)&slap_ldapsync_cn_bv, NULL );
2003-09-13 03:40:04 +08:00
ber_dupbv( &e->e_nname, &e->e_name );
return e;
}
void
slap_queue_csn(
Operation *op,
struct berval *csn )
{
struct slap_csn_entry *pending;
pending = (struct slap_csn_entry *) ch_calloc( 1,
sizeof( struct slap_csn_entry ));
ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
ber_dupbv( &pending->ce_csn, csn );
pending->ce_connid = op->o_connid;
pending->ce_opid = op->o_opid;
pending->ce_state = SLAP_CSN_PENDING;
LDAP_TAILQ_INSERT_TAIL( op->o_bd->be_pending_csn_list,
pending, ce_csn_link );
ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
}
int
slap_get_csn(
Operation *op,
2003-09-05 03:48:53 +08:00
char *csnbuf,
int len,
struct berval *csn,
2004-04-06 09:48:36 +08:00
int manage_ctxcsn )
{
2003-11-30 09:19:40 +08:00
if ( csn == NULL ) return LDAP_OTHER;
2003-09-29 22:06:48 +08:00
csn->bv_len = lutil_csnstr( csnbuf, len, 0, 0 );
csn->bv_val = csnbuf;
if ( manage_ctxcsn )
slap_queue_csn( op, csn );
return LDAP_SUCCESS;
}