]> git.sur5r.net Git - openldap/blob - servers/slapd/ctxcsn.c
35e474b26986bb644f54c4b9cdc21df62325042c
[openldap] / servers / slapd / ctxcsn.c
1 /* ctxcsn.c -- Context CSN Management Routines */
2 /* $OpenLDAP$ */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4  *
5  * Copyright 2003-2004 The OpenLDAP Foundation.
6  * Portions Copyright 2003 IBM Corporation.
7  * All rights reserved.
8  *
9  * Redistribution and use in source and binary forms, with or without
10  * modification, are permitted only as authorized by the OpenLDAP
11  * Public License.
12  *
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>.
16  */
17
18 #include "portable.h"
19
20 #include <stdio.h>
21
22 #include <ac/string.h>
23 #include <ac/socket.h>
24
25 #include "lutil.h"
26 #include "slap.h"
27 #include "lutil_ldap.h"
28
29 const struct berval slap_ldapsync_bv = BER_BVC("ldapsync");
30 const struct berval slap_ldapsync_cn_bv = BER_BVC("cn=ldapsync");
31
32 void
33 slap_get_commit_csn(
34         Operation *op,
35         struct berval *maxcsn,
36         struct berval *curcsn
37 )
38 {
39         struct slap_csn_entry *csne, *committed_csne = NULL;
40         int i = 0;
41
42         if ( maxcsn ) {
43                 BER_BVZERO( maxcsn );
44         }
45
46         ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
47
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;
52                         break;
53                 }
54         }
55
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;
59         }
60
61         if ( committed_csne && maxcsn ) *maxcsn = committed_csne->ce_csn;
62         ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
63 }
64
65 void
66 slap_rewind_commit_csn( Operation *op )
67 {
68         struct slap_csn_entry *csne;
69
70         ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
71
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;
75                         break;
76                 }
77         }
78
79         ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
80 }
81
82 void
83 slap_graduate_commit_csn( Operation *op )
84 {
85         struct slap_csn_entry *csne;
86
87         if ( op == NULL ) return;
88         if ( op->o_bd == NULL ) return;
89
90         assert( op->o_bd->be_pcl_mutexp != NULL );
91
92         ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
93
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,
97                                 csne, ce_csn_link );
98                         ch_free( csne->ce_csn.bv_val );
99                         ch_free( csne );
100                         break;
101                 }
102         }
103
104         ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
105
106         return;
107 }
108
109 static struct berval ocbva[] = {
110         BER_BVC("top"),
111         BER_BVC("subentry"),
112         BER_BVC("syncProviderSubentry"),
113         BER_BVNULL
114 };
115
116 Entry *
117 slap_create_context_csn_entry(
118         Backend *be,
119         struct berval *context_csn )
120 {
121         Entry* e;
122         int rc;
123
124         struct berval bv;
125
126         e = (Entry *) ch_calloc( 1, sizeof( Entry ));
127
128         attr_merge( e, slap_schema.si_ad_objectClass,
129                 ocbva, NULL );
130         attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
131                 &ocbva[1], NULL );
132         attr_merge_one( e, slap_schema.si_ad_cn,
133                 (struct berval *)&slap_ldapsync_bv, NULL );
134
135         if ( context_csn ) {
136                 attr_merge_one( e, slap_schema.si_ad_contextCSN,
137                         context_csn, NULL );
138         }
139
140         BER_BVSTR( &bv, "{}" );
141         attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
142
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 );
146
147         return e;
148 }
149
150 void
151 slap_queue_csn(
152         Operation *op,
153         struct berval *csn )
154 {
155         struct slap_csn_entry *pending;
156
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 );
160
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 );
168 }
169
170 int
171 slap_get_csn(
172         Operation *op,
173         char *csnbuf,
174         int     len,
175         struct berval *csn,
176         int manage_ctxcsn )
177 {
178         if ( csn == NULL ) return LDAP_OTHER;
179
180         csn->bv_len = lutil_csnstr( csnbuf, len, 0, 0 );
181         csn->bv_val = csnbuf;
182
183         if ( manage_ctxcsn )
184                 slap_queue_csn( op, csn );
185
186         return LDAP_SUCCESS;
187 }