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