]> git.sur5r.net Git - openldap/blob - servers/slapd/ctxcsn.c
declare oc_bvfind_undef()
[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         ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
91
92         LDAP_TAILQ_FOREACH( csne, op->o_bd->be_pending_csn_list, ce_csn_link ) {
93                 if ( csne->ce_opid == op->o_opid && csne->ce_connid == op->o_connid ) {
94                         LDAP_TAILQ_REMOVE( op->o_bd->be_pending_csn_list,
95                                 csne, ce_csn_link );
96                         ch_free( csne->ce_csn.bv_val );
97                         ch_free( csne );
98                         break;
99                 }
100         }
101
102         ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
103
104         return;
105 }
106
107 static struct berval ocbva[] = {
108         BER_BVC("top"),
109         BER_BVC("subentry"),
110         BER_BVC("syncProviderSubentry"),
111         BER_BVNULL
112 };
113
114 Entry *
115 slap_create_context_csn_entry(
116         Backend *be,
117         struct berval *context_csn )
118 {
119         Entry* e;
120         int rc;
121
122         struct berval bv;
123
124         e = (Entry *) ch_calloc( 1, sizeof( Entry ));
125
126         attr_merge( e, slap_schema.si_ad_objectClass,
127                 ocbva, NULL );
128         attr_merge_one( e, slap_schema.si_ad_structuralObjectClass,
129                 &ocbva[1], NULL );
130         attr_merge_one( e, slap_schema.si_ad_cn,
131                 (struct berval *)&slap_ldapsync_bv, NULL );
132
133         if ( context_csn ) {
134                 attr_merge_one( e, slap_schema.si_ad_contextCSN,
135                         context_csn, NULL );
136         }
137
138         BER_BVSTR( &bv, "{}" );
139         attr_merge_one( e, slap_schema.si_ad_subtreeSpecification, &bv, NULL );
140
141         build_new_dn( &e->e_name, &be->be_nsuffix[0],
142                 (struct berval *)&slap_ldapsync_cn_bv, NULL );
143         ber_dupbv( &e->e_nname, &e->e_name );
144
145         return e;
146 }
147
148 void
149 slap_queue_csn(
150         Operation *op,
151         struct berval *csn )
152 {
153         struct slap_csn_entry *pending;
154
155         pending = (struct slap_csn_entry *) ch_calloc( 1,
156                         sizeof( struct slap_csn_entry ));
157         ldap_pvt_thread_mutex_lock( op->o_bd->be_pcl_mutexp );
158
159         ber_dupbv( &pending->ce_csn, csn );
160         pending->ce_connid = op->o_connid;
161         pending->ce_opid = op->o_opid;
162         pending->ce_state = SLAP_CSN_PENDING;
163         LDAP_TAILQ_INSERT_TAIL( op->o_bd->be_pending_csn_list,
164                 pending, ce_csn_link );
165         ldap_pvt_thread_mutex_unlock( op->o_bd->be_pcl_mutexp );
166 }
167
168 int
169 slap_get_csn(
170         Operation *op,
171         char *csnbuf,
172         int     len,
173         struct berval *csn,
174         int manage_ctxcsn )
175 {
176         if ( csn == NULL ) return LDAP_OTHER;
177
178         csn->bv_len = lutil_csnstr( csnbuf, len, 0, 0 );
179         csn->bv_val = csnbuf;
180
181         if ( manage_ctxcsn )
182                 slap_queue_csn( op, csn );
183
184         return LDAP_SUCCESS;
185 }