1 /* delete.c - ldbm backend delete routine */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
12 #include <ac/string.h>
13 #include <ac/socket.h>
16 #include "back-ldbm.h"
17 #include "proto-back-ldbm.h"
24 struct ldbminfo *li = (struct ldbminfo *) op->o_bd->be_private;
29 int manageDSAit = get_manageDSAit( op );
30 AttributeDescription *children = slap_schema.si_ad_children;
31 AttributeDescription *entry = slap_schema.si_ad_entry;
34 LDAP_LOG( BACK_LDBM, ENTRY, "ldbm_back_delete: %s\n", op->o_req_dn.bv_val, 0, 0 );
36 Debug(LDAP_DEBUG_ARGS, "==> ldbm_back_delete: %s\n", op->o_req_dn.bv_val, 0, 0);
39 /* grab giant lock for writing */
40 ldap_pvt_thread_rdwr_wlock(&li->li_giant_rwlock);
42 /* get entry with writer lock */
43 e = dn2entry_w( op->o_bd, &op->o_req_ndn, &matched );
45 #ifdef LDAP_SYNCREPL /* FIXME : dn2entry() should return non-glue entry */
46 if ( e == NULL || ( !manageDSAit && is_entry_glue( e ))) {
51 LDAP_LOG( BACK_LDBM, INFO,
52 "ldbm_back_delete: no such object %s\n", op->o_req_dn.bv_val, 0, 0 );
54 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: no such object %s\n",
55 op->o_req_dn.bv_val, 0, 0);
58 if ( matched != NULL ) {
59 rs->sr_matched = ch_strdup( matched->e_dn );
60 rs->sr_ref = is_entry_referral( matched )
61 ? get_entry_referrals( op, matched )
63 cache_return_entry_r( &li->li_cache, matched );
67 BerVarray deref = op->o_bd->syncinfo ?
68 op->o_bd->syncinfo->provideruri_bv : default_referral;
70 BerVarray deref = default_referral;
72 rs->sr_ref = referral_rewrite( deref, NULL, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
75 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
77 rs->sr_err = LDAP_REFERRAL;
78 send_ldap_result( op, rs );
80 if ( rs->sr_ref ) ber_bvarray_free( rs->sr_ref );
81 free( (char *)rs->sr_matched );
86 /* check entry for "entry" acl */
87 if ( ! access_allowed( op, e,
88 entry, NULL, ACL_WRITE, NULL ) )
91 LDAP_LOG( BACK_LDBM, ERR,
92 "ldbm_back_delete: no write access to entry of (%s)\n",
93 op->o_req_dn.bv_val, 0, 0 );
95 Debug( LDAP_DEBUG_TRACE,
96 "<=- ldbm_back_delete: no write access to entry\n", 0,
100 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
101 "no write access to entry" );
107 if ( !manageDSAit && is_entry_referral( e ) ) {
108 /* parent is a referral, don't allow add */
109 /* parent is an alias, don't allow add */
110 rs->sr_ref = get_entry_referrals( op, e );
113 LDAP_LOG( BACK_LDBM, INFO,
114 "ldbm_back_delete: entry (%s) is a referral.\n", e->e_dn, 0, 0 );
116 Debug( LDAP_DEBUG_TRACE, "entry is referral\n", 0,
120 rs->sr_err = LDAP_REFERRAL;
121 rs->sr_matched = e->e_name.bv_val;
122 send_ldap_result( op, rs );
124 if ( rs->sr_ref ) ber_bvarray_free( rs->sr_ref );
130 if ( has_children( op->o_bd, e ) ) {
132 LDAP_LOG( BACK_LDBM, ERR,
133 "ldbm_back_delete: (%s) is a non-leaf node.\n", op->o_req_dn.bv_val, 0,0);
135 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: non leaf %s\n",
136 op->o_req_dn.bv_val, 0, 0);
139 send_ldap_error( op, rs, LDAP_NOT_ALLOWED_ON_NONLEAF,
140 "subtree delete not supported" );
144 /* delete from parent's id2children entry */
145 if( !be_issuffix( op->o_bd, &e->e_nname ) && (dnParent( &e->e_nname, &pdn ),
147 if( (p = dn2entry_w( op->o_bd, &pdn, NULL )) == NULL) {
149 LDAP_LOG( BACK_LDBM, ERR,
150 "ldbm_back_delete: parent of (%s) does not exist\n", op->o_req_dn, 0, 0 );
152 Debug( LDAP_DEBUG_TRACE,
153 "<=- ldbm_back_delete: parent does not exist\n",
157 send_ldap_error( op, rs, LDAP_OTHER,
158 "could not locate parent of entry" );
162 /* check parent for "children" acl */
163 if ( ! access_allowed( op, p,
164 children, NULL, ACL_WRITE, NULL ) )
167 LDAP_LOG( BACK_LDBM, ERR,
168 "ldbm_back_delete: no access to parent of (%s)\n",
169 op->o_req_dn.bv_val, 0, 0 );
171 Debug( LDAP_DEBUG_TRACE,
172 "<=- ldbm_back_delete: no access to parent\n", 0,
176 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
177 "no write access to parent" );
182 /* no parent, must be root to delete */
183 if( ! be_isroot( op->o_bd, &op->o_ndn ) ) {
184 if ( be_issuffix( op->o_bd, (struct berval *)&slap_empty_bv ) || be_isupdate( op->o_bd, &op->o_ndn ) ) {
185 p = (Entry *)&slap_entry_root;
187 rc = access_allowed( op, p,
188 children, NULL, ACL_WRITE, NULL );
191 /* check parent for "children" acl */
194 LDAP_LOG( BACK_LDBM, ERR,
195 "ldbm_back_delete: no access "
196 "to parent of ("")\n", 0, 0, 0 );
198 Debug( LDAP_DEBUG_TRACE,
199 "<=- ldbm_back_delete: no "
200 "access to parent\n", 0, 0, 0 );
203 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
204 "no write access to parent" );
210 LDAP_LOG( BACK_LDBM, ERR,
211 "ldbm_back_delete: (%s) has no "
212 "parent & not a root.\n", op->o_ndn, 0, 0 );
214 Debug( LDAP_DEBUG_TRACE,
215 "<=- ldbm_back_delete: no parent & "
216 "not root\n", 0, 0, 0);
219 send_ldap_error( op, rs,
220 LDAP_INSUFFICIENT_ACCESS,
227 /* delete from dn2id mapping */
228 if ( dn2id_delete( op->o_bd, &e->e_nname, e->e_id ) != 0 ) {
230 LDAP_LOG( BACK_LDBM, ERR,
231 "ldbm_back_delete: (%s) operations error\n", op->o_req_dn.bv_val, 0, 0 );
233 Debug(LDAP_DEBUG_ARGS,
234 "<=- ldbm_back_delete: operations error %s\n",
235 op->o_req_dn.bv_val, 0, 0);
238 send_ldap_error( op, rs, LDAP_OTHER,
239 "DN index delete failed" );
243 /* delete from disk and cache */
244 if ( id2entry_delete( op->o_bd, e ) != 0 ) {
246 LDAP_LOG( BACK_LDBM, ERR,
247 "ldbm_back_delete: (%s) operations error\n", op->o_req_dn.bv_val, 0, 0 );
249 Debug(LDAP_DEBUG_ARGS,
250 "<=- ldbm_back_delete: operations error %s\n",
251 op->o_req_dn.bv_val, 0, 0);
254 send_ldap_error( op, rs, LDAP_OTHER,
255 "entry delete failed" );
259 /* delete attribute indices */
260 (void) index_entry_del( op, e );
262 rs->sr_err = LDAP_SUCCESS;
263 send_ldap_result( op, rs );
268 /* free parent and writer lock */
269 cache_return_entry_w( &li->li_cache, p );
272 /* free entry and writer lock */
273 cache_return_entry_w( &li->li_cache, e );
275 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);