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 if ( (e = dn2entry_w( op->o_bd, &op->o_req_ndn, &matched )) == NULL ) {
45 LDAP_LOG( BACK_LDBM, INFO,
46 "ldbm_back_delete: no such object %s\n", op->o_req_dn.bv_val, 0, 0 );
48 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: no such object %s\n",
49 op->o_req_dn.bv_val, 0, 0);
52 if ( matched != NULL ) {
53 rs->sr_matched = ch_strdup( matched->e_dn );
54 rs->sr_ref = is_entry_referral( matched )
55 ? get_entry_referrals( op, matched )
57 cache_return_entry_r( &li->li_cache, matched );
60 rs->sr_ref = referral_rewrite( default_referral,
61 NULL, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
64 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
66 rs->sr_err = LDAP_REFERRAL;
67 send_ldap_result( op, rs );
69 if ( rs->sr_ref ) ber_bvarray_free( rs->sr_ref );
70 free( (char *)rs->sr_matched );
75 /* check entry for "entry" acl */
77 if( !op->o_caching_on ) {
78 #endif /* LDAP_CACHING */
79 if ( ! access_allowed( op, e,
80 entry, NULL, ACL_WRITE, NULL ) )
83 LDAP_LOG( BACK_LDBM, ERR,
84 "ldbm_back_delete: no write access to entry of (%s)\n",
85 op->o_req_dn.bv_val, 0, 0 );
87 Debug( LDAP_DEBUG_TRACE,
88 "<=- ldbm_back_delete: no write access to entry\n", 0,
92 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
93 "no write access to entry" );
99 if ( !manageDSAit && is_entry_referral( e ) ) {
100 /* parent is a referral, don't allow add */
101 /* parent is an alias, don't allow add */
102 rs->sr_ref = get_entry_referrals( op, e );
105 LDAP_LOG( BACK_LDBM, INFO,
106 "ldbm_back_delete: entry (%s) is a referral.\n", e->e_dn, 0, 0 );
108 Debug( LDAP_DEBUG_TRACE, "entry is referral\n", 0,
112 rs->sr_err = LDAP_REFERRAL;
113 rs->sr_matched = e->e_name.bv_val;
114 send_ldap_result( op, rs );
116 if ( rs->sr_ref ) ber_bvarray_free( rs->sr_ref );
122 if ( has_children( op->o_bd, e ) ) {
124 LDAP_LOG( BACK_LDBM, ERR,
125 "ldbm_back_delete: (%s) is a non-leaf node.\n", op->o_req_dn.bv_val, 0,0);
127 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: non leaf %s\n",
128 op->o_req_dn.bv_val, 0, 0);
131 send_ldap_error( op, rs, LDAP_NOT_ALLOWED_ON_NONLEAF,
132 "subtree delete not supported" );
136 /* delete from parent's id2children entry */
137 if( !be_issuffix( op->o_bd, &e->e_nname ) && (dnParent( &e->e_nname, &pdn ),
139 if( (p = dn2entry_w( op->o_bd, &pdn, NULL )) == NULL) {
141 LDAP_LOG( BACK_LDBM, ERR,
142 "ldbm_back_delete: parent of (%s) does not exist\n", op->o_req_dn. 0, 0 );
144 Debug( LDAP_DEBUG_TRACE,
145 "<=- ldbm_back_delete: parent does not exist\n",
149 send_ldap_error( op, rs, LDAP_OTHER,
150 "could not locate parent of entry" );
154 /* check parent for "children" acl */
155 if ( ! access_allowed( op, p,
156 children, NULL, ACL_WRITE, NULL ) )
159 LDAP_LOG( BACK_LDBM, ERR,
160 "ldbm_back_delete: no access to parent of (%s)\n",
161 op->o_req_dn.bv_val, 0, 0 );
163 Debug( LDAP_DEBUG_TRACE,
164 "<=- ldbm_back_delete: no access to parent\n", 0,
168 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
169 "no write access to parent" );
174 /* no parent, must be root to delete */
175 if( ! be_isroot( op->o_bd, &op->o_ndn ) ) {
176 if ( be_issuffix( op->o_bd, (struct berval *)&slap_empty_bv ) || be_isupdate( op->o_bd, &op->o_ndn ) ) {
177 p = (Entry *)&slap_entry_root;
179 rc = access_allowed( op, p,
180 children, NULL, ACL_WRITE, NULL );
183 /* check parent for "children" acl */
186 LDAP_LOG( BACK_LDBM, ERR,
187 "ldbm_back_delete: no access "
188 "to parent of ("")\n", 0, 0, 0 );
190 Debug( LDAP_DEBUG_TRACE,
191 "<=- ldbm_back_delete: no "
192 "access to parent\n", 0, 0, 0 );
195 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
196 "no write access to parent" );
202 LDAP_LOG( BACK_LDBM, ERR,
203 "ldbm_back_delete: (%s) has no "
204 "parent & not a root.\n", dn, 0, 0 );
206 Debug( LDAP_DEBUG_TRACE,
207 "<=- ldbm_back_delete: no parent & "
208 "not root\n", 0, 0, 0);
211 send_ldap_error( op, rs,
212 LDAP_INSUFFICIENT_ACCESS,
220 #endif /* LDAP_CACHING */
222 /* delete from dn2id mapping */
223 if ( dn2id_delete( op->o_bd, &e->e_nname, e->e_id ) != 0 ) {
225 LDAP_LOG( BACK_LDBM, ERR,
226 "ldbm_back_delete: (%s) operations error\n", op->o_req_dn.bv_val, 0, 0 );
228 Debug(LDAP_DEBUG_ARGS,
229 "<=- ldbm_back_delete: operations error %s\n",
230 op->o_req_dn.bv_val, 0, 0);
233 send_ldap_error( op, rs, LDAP_OTHER,
234 "DN index delete failed" );
238 /* delete from disk and cache */
239 if ( id2entry_delete( op->o_bd, e ) != 0 ) {
241 LDAP_LOG( BACK_LDBM, ERR,
242 "ldbm_back_delete: (%s) operations error\n", op->o_req_dn.bv_val, 0, 0 );
244 Debug(LDAP_DEBUG_ARGS,
245 "<=- ldbm_back_delete: operations error %s\n",
246 op->o_req_dn.bv_val, 0, 0);
249 send_ldap_error( op, rs, LDAP_OTHER,
250 "entry delete failed" );
254 /* delete attribute indices */
255 (void) index_entry_del( op->o_bd, e );
257 rs->sr_err = LDAP_SUCCESS;
258 send_ldap_result( op, rs );
263 /* free parent and writer lock */
264 cache_return_entry_w( &li->li_cache, p );
267 /* free entry and writer lock */
268 cache_return_entry_w( &li->li_cache, e );
270 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);