]> git.sur5r.net Git - openldap/blob - servers/slapd/back-ldbm/add.c
Use Entry's e_ndn instead of recomputing it.
[openldap] / servers / slapd / back-ldbm / add.c
1 /* add.c - ldap ldbm back-end add routine */
2
3 #include "portable.h"
4
5 #include <stdio.h>
6
7 #include <ac/socket.h>
8 #include <ac/string.h>
9
10 #include "slap.h"
11 #include "back-ldbm.h"
12 #include "proto-back-ldbm.h"
13
14 int
15 ldbm_back_add(
16     Backend     *be,
17     Connection  *conn,
18     Operation   *op,
19     Entry       *e
20 )
21 {
22         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
23         char            *dn, *pdn;
24         Entry           *p = NULL;
25         int                     rootlock = 0;
26         int                     rc = -1; 
27
28         dn = e->e_ndn;
29
30         Debug(LDAP_DEBUG_ARGS, "==> ldbm_back_add: %s\n", dn, 0, 0);
31
32         /* nobody else can add until we lock our parent */
33         pthread_mutex_lock(&li->li_add_mutex);
34
35         if ( ( dn2id( be, dn ) ) != NOID ) {
36                 pthread_mutex_unlock(&li->li_add_mutex);
37                 entry_free( e );
38                 send_ldap_result( conn, op, LDAP_ALREADY_EXISTS, "", "" );
39                 return( -1 );
40         }
41
42         if ( global_schemacheck && oc_schema_check( e ) != 0 ) {
43                 pthread_mutex_unlock(&li->li_add_mutex);
44
45                 Debug( LDAP_DEBUG_TRACE, "entry failed schema check\n",
46                         0, 0, 0 );
47
48                 entry_free( e );
49                 send_ldap_result( conn, op, LDAP_OBJECT_CLASS_VIOLATION, "",
50                     "" );
51                 return( -1 );
52         }
53
54         /*
55          * Get the parent dn and see if the corresponding entry exists.
56          * If the parent does not exist, only allow the "root" user to
57          * add the entry.
58          */
59
60         if ( (pdn = dn_parent( be, dn )) != NULL ) {
61                 char *matched = NULL;
62
63                 /* get parent with writer lock */
64                 if ( (p = dn2entry_w( be, pdn, &matched )) == NULL ) {
65                         pthread_mutex_unlock(&li->li_add_mutex);
66                         Debug( LDAP_DEBUG_TRACE, "parent does not exist\n", 0,
67                             0, 0 );
68                         send_ldap_result( conn, op, LDAP_NO_SUCH_OBJECT,
69                             matched, "" );
70
71                         if ( matched != NULL ) {
72                                 free( matched );
73                         }
74
75                         entry_free( e );
76                         free( pdn );
77                         return -1;
78                 }
79
80                 /* don't need the add lock anymore */
81                 pthread_mutex_unlock(&li->li_add_mutex);
82
83                 free(pdn);
84
85                 if ( matched != NULL ) {
86                         free( matched );
87                 }
88
89                 if ( ! access_allowed( be, conn, op, p, "children", NULL,
90                     op->o_dn, ACL_WRITE ) )
91                 {
92                         Debug( LDAP_DEBUG_TRACE, "no access to parent\n", 0,
93                             0, 0 );
94                         send_ldap_result( conn, op, LDAP_INSUFFICIENT_ACCESS,
95                             "", "" );
96
97                         /* free parent and writer lock */
98                         cache_return_entry_w( &li->li_cache, p ); 
99
100                         entry_free( e );
101                         return -1;
102                 }
103
104         } else {
105                 /* no parent, must be adding entry to root */
106                 if ( ! be_isroot( be, op->o_dn ) ) {
107                         pthread_mutex_unlock(&li->li_add_mutex);
108                         Debug( LDAP_DEBUG_TRACE, "no parent & not root\n", 0,
109                             0, 0 );
110                         send_ldap_result( conn, op, LDAP_INSUFFICIENT_ACCESS,
111                             "", "" );
112
113                         entry_free( e );
114                         return -1;
115                 }
116
117                 /*
118                  * no parent, acquire the root write lock
119                  * and release the add lock.
120                  */
121                 pthread_mutex_lock(&li->li_root_mutex);
122                 pthread_mutex_unlock(&li->li_add_mutex);
123                 rootlock=1;
124         }
125
126         /*
127          * Try to add the entry to the cache, assign it a new dnid
128          * and mark it locked.  This should only fail if the entry
129          * already exists.
130          */
131
132         e->e_id = next_id( be );
133         if ( cache_add_entry_lock( &li->li_cache, e, ENTRY_STATE_CREATING ) != 0 ) {
134                 if( p != NULL) {
135                         /* free parent and writer lock */
136                         cache_return_entry_w( &li->li_cache, p ); 
137                 } else if ( rootlock ) {
138                         /* release root lock */
139                         pthread_mutex_unlock(&li->li_root_mutex);
140                 }
141
142                 Debug( LDAP_DEBUG_ANY, "cache_add_entry_lock failed\n", 0, 0,
143                     0 );
144                 next_id_return( be, e->e_id );
145                 
146                 /* XXX this should be ok, no other thread should have access
147                  * because e hasn't been added to the cache yet
148                  */
149                 entry_free( e );
150                 send_ldap_result( conn, op, LDAP_ALREADY_EXISTS, "", "" );
151                 return( -1 );
152         }
153
154         /* acquire writer lock */
155         entry_rdwr_lock(e, 1);
156
157         /*
158          * add it to the id2children index for the parent
159          */
160
161         if ( id2children_add( be, p, e ) != 0 ) {
162                 Debug( LDAP_DEBUG_TRACE, "id2children_add failed\n", 0,
163                     0, 0 );
164                 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, "", "" );
165
166                 goto return_results;
167         }
168
169         /*
170          * Add the entry to the attribute indexes, then add it to
171          * the id2children index, dn2id index, and the id2entry index.
172          */
173
174         /* attribute indexes */
175         if ( index_add_entry( be, e ) != 0 ) {
176                 Debug( LDAP_DEBUG_TRACE, "index_add_entry failed\n", 0,
177                     0, 0 );
178                 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, "", "" );
179
180                 goto return_results;
181         }
182
183         /* dn2id index */
184         if ( dn2id_add( be, dn, e->e_id ) != 0 ) {
185                 Debug( LDAP_DEBUG_TRACE, "dn2id_add failed\n", 0,
186                     0, 0 );
187                 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, "", "" );
188
189                 goto return_results;
190         }
191
192         /* id2entry index */
193         if ( id2entry_add( be, e ) != 0 ) {
194                 Debug( LDAP_DEBUG_TRACE, "id2entry_add failed\n", 0,
195                     0, 0 );
196                 (void) dn2id_delete( be, dn );
197                 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, "", "" );
198
199                 goto return_results;
200         }
201
202         send_ldap_result( conn, op, LDAP_SUCCESS, "", "" );
203         rc = 0;
204
205 return_results:;
206         cache_set_state( &li->li_cache, e, 0 );
207
208         if (p != NULL) {
209                 /* free parent and writer lock */
210                 cache_return_entry_w( &li->li_cache, p ); 
211
212         } else if ( rootlock ) {
213                 /* release root lock */
214                 pthread_mutex_unlock(&li->li_root_mutex);
215         }
216
217         /* free entry and writer lock */
218         cache_return_entry_w( &li->li_cache, e ); 
219
220         return( rc );
221 }