]> git.sur5r.net Git - openldap/blob - servers/slapd/back-ldbm/delete.c
Fixes for NO_THREADS
[openldap] / servers / slapd / back-ldbm / delete.c
1 /* delete.c - ldbm backend delete routine */
2 /* $OpenLDAP$ */
3 /*
4  * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5  * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
6  */
7
8 #include "portable.h"
9
10 #include <stdio.h>
11
12 #include <ac/string.h>
13 #include <ac/socket.h>
14
15 #include "slap.h"
16 #include "back-ldbm.h"
17 #include "proto-back-ldbm.h"
18
19 int
20 ldbm_back_delete(
21     Backend     *be,
22     Connection  *conn,
23     Operation   *op,
24     struct berval       *dn,
25     struct berval       *ndn
26 )
27 {
28         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
29         Entry   *matched;
30         struct berval   pdn;
31         Entry   *e, *p = NULL;
32         int     rc = -1;
33         int             manageDSAit = get_manageDSAit( op );
34         AttributeDescription *children = slap_schema.si_ad_children;
35
36 #ifdef NEW_LOGGING
37         LDAP_LOG( BACK_LDBM, ENTRY, "ldbm_back_delete: %s\n", dn->bv_val, 0, 0 );
38 #else
39         Debug(LDAP_DEBUG_ARGS, "==> ldbm_back_delete: %s\n", dn->bv_val, 0, 0);
40 #endif
41
42         /* grab giant lock for writing */
43         ldap_pvt_thread_rdwr_wlock(&li->li_giant_rwlock);
44
45         /* get entry with writer lock */
46         if ( (e = dn2entry_w( be, ndn, &matched )) == NULL ) {
47                 char *matched_dn = NULL;
48                 BerVarray refs;
49
50 #ifdef NEW_LOGGING
51                 LDAP_LOG( BACK_LDBM, INFO, 
52                         "ldbm_back_delete: no such object %s\n", dn->bv_val, 0, 0 );
53 #else
54                 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: no such object %s\n",
55                         dn->bv_val, 0, 0);
56 #endif
57
58                 if ( matched != NULL ) {
59                         matched_dn = ch_strdup( matched->e_dn );
60                         refs = is_entry_referral( matched )
61                                 ? get_entry_referrals( be, conn, op, matched )
62                                 : NULL;
63                         cache_return_entry_r( &li->li_cache, matched );
64
65                 } else {
66                         refs = referral_rewrite( default_referral,
67                                 NULL, dn, LDAP_SCOPE_DEFAULT );
68                 }
69
70                 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
71
72                 send_ldap_result( conn, op, LDAP_REFERRAL,
73                         matched_dn, NULL, refs, NULL );
74
75                 if ( refs ) ber_bvarray_free( refs );
76                 free( matched_dn );
77
78                 return( -1 );
79         }
80
81     if ( !manageDSAit && is_entry_referral( e ) ) {
82                 /* parent is a referral, don't allow add */
83                 /* parent is an alias, don't allow add */
84                 BerVarray refs = get_entry_referrals( be,
85                         conn, op, e );
86
87 #ifdef NEW_LOGGING
88                 LDAP_LOG( BACK_LDBM, INFO, 
89                         "ldbm_back_delete: entry (%s) is a referral.\n", e->e_dn, 0, 0 );
90 #else
91                 Debug( LDAP_DEBUG_TRACE, "entry is referral\n", 0,
92                     0, 0 );
93 #endif
94
95                 send_ldap_result( conn, op, LDAP_REFERRAL,
96                     e->e_dn, NULL, refs, NULL );
97
98                 if ( refs ) ber_bvarray_free( refs );
99
100                 rc = 1;
101                 goto return_results;
102         }
103
104
105         if ( has_children( be, e ) ) {
106 #ifdef NEW_LOGGING
107                 LDAP_LOG( BACK_LDBM, ERR, 
108                            "ldbm_back_delete: (%s) is a non-leaf node.\n", dn->bv_val, 0,0);
109 #else
110                 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: non leaf %s\n",
111                         dn->bv_val, 0, 0);
112 #endif
113
114                 send_ldap_result( conn, op, LDAP_NOT_ALLOWED_ON_NONLEAF,
115                         NULL, "subtree delete not supported", NULL, NULL );
116                 goto return_results;
117         }
118
119         /* delete from parent's id2children entry */
120         if( !be_issuffix( be, &e->e_nname ) && (dnParent( &e->e_nname, &pdn ),
121                 pdn.bv_len) ) {
122                 if( (p = dn2entry_w( be, &pdn, NULL )) == NULL) {
123 #ifdef NEW_LOGGING
124                         LDAP_LOG( BACK_LDBM, ERR, 
125                                 "ldbm_back_delete: parent of (%s) does not exist\n", dn, 0, 0 );
126 #else
127                         Debug( LDAP_DEBUG_TRACE,
128                                 "<=- ldbm_back_delete: parent does not exist\n",
129                                 0, 0, 0);
130 #endif
131
132                         send_ldap_result( conn, op, LDAP_OTHER,
133                                 NULL, "could not locate parent of entry", NULL, NULL );
134                         goto return_results;
135                 }
136
137                 /* check parent for "children" acl */
138                 if ( ! access_allowed( be, conn, op, p,
139                         children, NULL, ACL_WRITE, NULL ) )
140                 {
141 #ifdef NEW_LOGGING
142                         LDAP_LOG( BACK_LDBM, ERR, 
143                                 "ldbm_back_delete: no access to parent of (%s)\n", 
144                                 dn->bv_val, 0, 0 );
145 #else
146                         Debug( LDAP_DEBUG_TRACE,
147                                 "<=- ldbm_back_delete: no access to parent\n", 0,
148                                 0, 0 );
149 #endif
150
151                         send_ldap_result( conn, op, LDAP_INSUFFICIENT_ACCESS,
152                                 NULL, NULL, NULL, NULL );
153                         goto return_results;
154                 }
155
156         } else {
157                 /* no parent, must be root to delete */
158                 if( ! be_isroot( be, &op->o_ndn ) ) {
159                         if ( be_issuffix( be, (struct berval *)&slap_empty_bv ) || be_isupdate( be, &op->o_ndn ) ) {
160                                 p = (Entry *)&slap_entry_root;
161                                 
162                                 rc = access_allowed( be, conn, op, p,
163                                         children, NULL, ACL_WRITE, NULL );
164                                 p = NULL;
165                                                                 
166                                 /* check parent for "children" acl */
167                                 if ( ! rc ) {
168 #ifdef NEW_LOGGING
169                                         LDAP_LOG( BACK_LDBM, ERR,
170                                                 "ldbm_back_delete: no access "
171                                                 "to parent of ("")\n", 0, 0, 0 );
172 #else
173                                         Debug( LDAP_DEBUG_TRACE,
174                                                 "<=- ldbm_back_delete: no "
175                                                 "access to parent\n", 0, 0, 0 );
176 #endif
177
178                                         send_ldap_result( conn, op, 
179                                                 LDAP_INSUFFICIENT_ACCESS,
180                                                 NULL, NULL, NULL, NULL );
181                                         goto return_results;
182                                 }
183
184                         } else {
185 #ifdef NEW_LOGGING
186                                 LDAP_LOG( BACK_LDBM, ERR, 
187                                         "ldbm_back_delete: (%s) has no "
188                                         "parent & not a root.\n", dn, 0, 0 );
189 #else
190                                 Debug( LDAP_DEBUG_TRACE,
191                                         "<=- ldbm_back_delete: no parent & "
192                                         "not root\n", 0, 0, 0);
193 #endif
194
195                                 send_ldap_result( conn, op, 
196                                         LDAP_INSUFFICIENT_ACCESS,
197                                         NULL, NULL, NULL, NULL );
198                                 goto return_results;
199                         }
200                 }
201         }
202
203         /* delete from dn2id mapping */
204         if ( dn2id_delete( be, &e->e_nname, e->e_id ) != 0 ) {
205 #ifdef NEW_LOGGING
206                 LDAP_LOG( BACK_LDBM, ERR, 
207                         "ldbm_back_delete: (%s) operations error\n", dn->bv_val, 0, 0 );
208 #else
209                 Debug(LDAP_DEBUG_ARGS,
210                         "<=- ldbm_back_delete: operations error %s\n",
211                         dn->bv_val, 0, 0);
212 #endif
213
214                 send_ldap_result( conn, op, LDAP_OTHER,
215                         NULL, "DN index delete failed", NULL, NULL );
216                 goto return_results;
217         }
218
219         /* delete from disk and cache */
220         if ( id2entry_delete( be, e ) != 0 ) {
221 #ifdef NEW_LOGGING
222                 LDAP_LOG( BACK_LDBM, ERR, 
223                         "ldbm_back_delete: (%s) operations error\n", dn->bv_val, 0, 0 );
224 #else
225                 Debug(LDAP_DEBUG_ARGS,
226                         "<=- ldbm_back_delete: operations error %s\n",
227                         dn->bv_val, 0, 0);
228 #endif
229
230                 send_ldap_result( conn, op, LDAP_OTHER,
231                         NULL, "entry delete failed", NULL, NULL );
232                 goto return_results;
233         }
234
235         /* delete attribute indices */
236         (void) index_entry_del( be, e, e->e_attrs );
237
238         send_ldap_result( conn, op, LDAP_SUCCESS,
239                 NULL, NULL, NULL, NULL );
240         rc = 0;
241
242 return_results:;
243         if( p != NULL ) {
244                 /* free parent and writer lock */
245                 cache_return_entry_w( &li->li_cache, p );
246         }
247
248         /* free entry and writer lock */
249         cache_return_entry_w( &li->li_cache, e );
250
251         ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
252
253         return rc;
254 }