/* delete.c - ldbm backend delete routine */ /* $OpenLDAP$ */ /* * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved. * COPYING RESTRICTIONS APPLY, see COPYRIGHT file */ #include "portable.h" #include #include #include #include "slap.h" #include "back-ldbm.h" #include "proto-back-ldbm.h" int ldbm_back_delete( Backend *be, Connection *conn, Operation *op, const char *dn, const char *ndn ) { struct ldbminfo *li = (struct ldbminfo *) be->be_private; Entry *matched; char *pdn = NULL; Entry *e, *p = NULL; int rootlock = 0; int rc = -1; int manageDSAit = get_manageDSAit( op ); AttributeDescription *children = slap_schema.si_ad_children; Debug(LDAP_DEBUG_ARGS, "==> ldbm_back_delete: %s\n", dn, 0, 0); /* get entry with writer lock */ if ( (e = dn2entry_w( be, ndn, &matched )) == NULL ) { char *matched_dn = NULL; struct berval **refs = NULL; Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: no such object %s\n", dn, 0, 0); if ( matched != NULL ) { matched_dn = ch_strdup( matched->e_dn ); refs = is_entry_referral( matched ) ? get_entry_referrals( be, conn, op, matched ) : NULL; cache_return_entry_r( &li->li_cache, matched ); } else { refs = default_referral; } send_ldap_result( conn, op, LDAP_REFERRAL, matched_dn, NULL, refs, NULL ); if ( matched != NULL ) { ber_bvecfree( refs ); free( matched_dn ); } return( -1 ); } #ifdef SLAPD_CHILD_MODIFICATION_WITH_ENTRY_ACL if ( ! access_allowed( be, conn, op, e, "entry", NULL, ACL_WRITE ) ) { Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: insufficient access %s\n", dn, 0, 0); send_ldap_result( conn, op, LDAP_INSUFFICIENT_ACCESS, NULL, NULL, NULL, NULL ); goto return_results; } #endif if ( !manageDSAit && is_entry_referral( e ) ) { /* parent is a referral, don't allow add */ /* parent is an alias, don't allow add */ struct berval **refs = get_entry_referrals( be, conn, op, e ); Debug( LDAP_DEBUG_TRACE, "entry is referral\n", 0, 0, 0 ); send_ldap_result( conn, op, LDAP_REFERRAL, e->e_dn, NULL, refs, NULL ); ber_bvecfree( refs ); rc = 1; goto return_results; } if ( has_children( be, e ) ) { Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: non leaf %s\n", dn, 0, 0); send_ldap_result( conn, op, LDAP_NOT_ALLOWED_ON_NONLEAF, NULL, "subtree delete not supported", NULL, NULL ); goto return_results; } /* delete from parent's id2children entry */ if( (pdn = dn_parent( be, e->e_ndn )) != NULL ) { if( (p = dn2entry_w( be, pdn, NULL )) == NULL) { Debug( LDAP_DEBUG_TRACE, "<=- ldbm_back_delete: parent does not exist\n", 0, 0, 0); send_ldap_result( conn, op, LDAP_OTHER, NULL, "could not locate parent of entry", NULL, NULL ); goto return_results; } /* check parent for "children" acl */ if ( ! access_allowed( be, conn, op, p, children, NULL, ACL_WRITE ) ) { Debug( LDAP_DEBUG_TRACE, "<=- ldbm_back_delete: no access to parent\n", 0, 0, 0 ); send_ldap_result( conn, op, LDAP_INSUFFICIENT_ACCESS, NULL, NULL, NULL, NULL ); goto return_results; } } else { /* no parent, must be root to delete */ if( ! be_isroot( be, op->o_ndn ) ) { Debug( LDAP_DEBUG_TRACE, "<=- ldbm_back_delete: no parent & not root\n", 0, 0, 0); send_ldap_result( conn, op, LDAP_INSUFFICIENT_ACCESS, NULL, NULL, NULL, NULL ); goto return_results; } ldap_pvt_thread_mutex_lock(&li->li_root_mutex); rootlock = 1; } /* delete from dn2id mapping */ if ( dn2id_delete( be, e->e_ndn, e->e_id ) != 0 ) { Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: operations error %s\n", dn, 0, 0); send_ldap_result( conn, op, LDAP_OTHER, NULL, "DN index delete failed", NULL, NULL ); goto return_results; } /* delete from disk and cache */ if ( id2entry_delete( be, e ) != 0 ) { Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: operations error %s\n", dn, 0, 0); send_ldap_result( conn, op, LDAP_OTHER, NULL, "entry delete failed", NULL, NULL ); goto return_results; } send_ldap_result( conn, op, LDAP_SUCCESS, NULL, NULL, NULL, NULL ); rc = 0; return_results:; if ( pdn != NULL ) free(pdn); if( p != NULL ) { /* free parent and writer lock */ cache_return_entry_w( &li->li_cache, p ); } if ( rootlock ) { /* release root lock */ ldap_pvt_thread_mutex_unlock(&li->li_root_mutex); } /* free entry and writer lock */ cache_return_entry_w( &li->li_cache, e ); return rc; }