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 */
88 if( !op->o_caching_on ) {
89 #endif /* LDAP_CACHING */
90 if ( ! access_allowed( op, e,
91 entry, NULL, ACL_WRITE, NULL ) )
94 LDAP_LOG( BACK_LDBM, ERR,
95 "ldbm_back_delete: no write access to entry of (%s)\n",
96 op->o_req_dn.bv_val, 0, 0 );
98 Debug( LDAP_DEBUG_TRACE,
99 "<=- ldbm_back_delete: no write access to entry\n", 0,
103 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
104 "no write access to entry" );
110 if ( !manageDSAit && is_entry_referral( e ) ) {
111 /* parent is a referral, don't allow add */
112 /* parent is an alias, don't allow add */
113 rs->sr_ref = get_entry_referrals( op, e );
116 LDAP_LOG( BACK_LDBM, INFO,
117 "ldbm_back_delete: entry (%s) is a referral.\n", e->e_dn, 0, 0 );
119 Debug( LDAP_DEBUG_TRACE, "entry is referral\n", 0,
123 rs->sr_err = LDAP_REFERRAL;
124 rs->sr_matched = e->e_name.bv_val;
125 send_ldap_result( op, rs );
127 if ( rs->sr_ref ) ber_bvarray_free( rs->sr_ref );
133 if ( has_children( op->o_bd, e ) ) {
135 LDAP_LOG( BACK_LDBM, ERR,
136 "ldbm_back_delete: (%s) is a non-leaf node.\n", op->o_req_dn.bv_val, 0,0);
138 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: non leaf %s\n",
139 op->o_req_dn.bv_val, 0, 0);
142 send_ldap_error( op, rs, LDAP_NOT_ALLOWED_ON_NONLEAF,
143 "subtree delete not supported" );
147 /* delete from parent's id2children entry */
148 if( !be_issuffix( op->o_bd, &e->e_nname ) && (dnParent( &e->e_nname, &pdn ),
150 if( (p = dn2entry_w( op->o_bd, &pdn, NULL )) == NULL) {
152 LDAP_LOG( BACK_LDBM, ERR,
153 "ldbm_back_delete: parent of (%s) does not exist\n", op->o_req_dn, 0, 0 );
155 Debug( LDAP_DEBUG_TRACE,
156 "<=- ldbm_back_delete: parent does not exist\n",
160 send_ldap_error( op, rs, LDAP_OTHER,
161 "could not locate parent of entry" );
165 /* check parent for "children" acl */
166 if ( ! access_allowed( op, p,
167 children, NULL, ACL_WRITE, NULL ) )
170 LDAP_LOG( BACK_LDBM, ERR,
171 "ldbm_back_delete: no access to parent of (%s)\n",
172 op->o_req_dn.bv_val, 0, 0 );
174 Debug( LDAP_DEBUG_TRACE,
175 "<=- ldbm_back_delete: no access to parent\n", 0,
179 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
180 "no write access to parent" );
185 /* no parent, must be root to delete */
186 if( ! be_isroot( op->o_bd, &op->o_ndn ) ) {
187 if ( be_issuffix( op->o_bd, (struct berval *)&slap_empty_bv ) || be_isupdate( op->o_bd, &op->o_ndn ) ) {
188 p = (Entry *)&slap_entry_root;
190 rc = access_allowed( op, p,
191 children, NULL, ACL_WRITE, NULL );
194 /* check parent for "children" acl */
197 LDAP_LOG( BACK_LDBM, ERR,
198 "ldbm_back_delete: no access "
199 "to parent of ("")\n", 0, 0, 0 );
201 Debug( LDAP_DEBUG_TRACE,
202 "<=- ldbm_back_delete: no "
203 "access to parent\n", 0, 0, 0 );
206 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
207 "no write access to parent" );
213 LDAP_LOG( BACK_LDBM, ERR,
214 "ldbm_back_delete: (%s) has no "
215 "parent & not a root.\n", op->o_ndn, 0, 0 );
217 Debug( LDAP_DEBUG_TRACE,
218 "<=- ldbm_back_delete: no parent & "
219 "not root\n", 0, 0, 0);
222 send_ldap_error( op, rs,
223 LDAP_INSUFFICIENT_ACCESS,
231 #endif /* LDAP_CACHING */
233 /* delete from dn2id mapping */
234 if ( dn2id_delete( op->o_bd, &e->e_nname, e->e_id ) != 0 ) {
236 LDAP_LOG( BACK_LDBM, ERR,
237 "ldbm_back_delete: (%s) operations error\n", op->o_req_dn.bv_val, 0, 0 );
239 Debug(LDAP_DEBUG_ARGS,
240 "<=- ldbm_back_delete: operations error %s\n",
241 op->o_req_dn.bv_val, 0, 0);
244 send_ldap_error( op, rs, LDAP_OTHER,
245 "DN index delete failed" );
249 /* delete from disk and cache */
250 if ( id2entry_delete( op->o_bd, e ) != 0 ) {
252 LDAP_LOG( BACK_LDBM, ERR,
253 "ldbm_back_delete: (%s) operations error\n", op->o_req_dn.bv_val, 0, 0 );
255 Debug(LDAP_DEBUG_ARGS,
256 "<=- ldbm_back_delete: operations error %s\n",
257 op->o_req_dn.bv_val, 0, 0);
260 send_ldap_error( op, rs, LDAP_OTHER,
261 "entry delete failed" );
265 /* delete attribute indices */
266 (void) index_entry_del( op, e );
268 rs->sr_err = LDAP_SUCCESS;
269 send_ldap_result( op, rs );
274 /* free parent and writer lock */
275 cache_return_entry_w( &li->li_cache, p );
278 /* free entry and writer lock */
279 cache_return_entry_w( &li->li_cache, e );
281 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);