]> git.sur5r.net Git - openldap/blob - servers/slapd/back-ldbm/delete.c
Suck in latest changes from -devel. Besides the usually lint removal,
[openldap] / servers / slapd / back-ldbm / delete.c
1 /* delete.c - ldbm backend delete routine */
2
3 #include "portable.h"
4
5 #include <stdio.h>
6
7 #include <ac/string.h>
8 #include <ac/socket.h>
9
10 #include "slap.h"
11 #include "back-ldbm.h"
12 #include "proto-back-ldbm.h"
13
14 int
15 ldbm_back_delete(
16     Backend     *be,
17     Connection  *conn,
18     Operation   *op,
19     char        *dn
20 )
21 {
22         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
23         char            *matched;
24         char            *pdn = NULL;
25         Entry           *e, *p;
26
27         Debug(LDAP_DEBUG_ARGS, "==> ldbm_back_delete: %s\n", dn, 0, 0);
28
29         /* get entry with writer lock */
30         if ( (e = dn2entry_w( be, dn, &matched )) == NULL ) {
31                 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: no such object %s\n",
32                         dn, 0, 0);
33                 send_ldap_result( conn, op, LDAP_NO_SUCH_OBJECT, matched, "" );
34                 if ( matched != NULL ) {
35                         free( matched );
36                 }
37                 return( -1 );
38         }
39
40         Debug (LDAP_DEBUG_TRACE,
41                 "rdwr_Xchk: readers_reading: %d writer_writing: %d\n",
42                 e->e_rdwr.readers_reading, e->e_rdwr.writer_writing, 0);
43
44         /* check for deleted */
45
46         if ( has_children( be, e ) ) {
47                 Debug(LDAP_DEBUG_ARGS, "<=- ldbm_back_delete: non leaf %s\n",
48                         dn, 0, 0);
49                 send_ldap_result( conn, op, LDAP_NOT_ALLOWED_ON_NONLEAF, "",
50                     "" );
51                 goto error_return;
52         }
53
54         if ( ! access_allowed( be, conn, op, e, "entry", NULL, op->o_dn,
55             ACL_WRITE ) ) {
56                 Debug(LDAP_DEBUG_ARGS,
57                         "<=- ldbm_back_delete: insufficient access %s\n",
58                         dn, 0, 0);
59                 send_ldap_result( conn, op, LDAP_INSUFFICIENT_ACCESS, "", "" );
60                 goto error_return;
61         }
62
63         Debug (LDAP_DEBUG_TRACE,
64                 "rdwr_Xchk: readers_reading: %d writer_writing: %d\n",
65                 e->e_rdwr.readers_reading, e->e_rdwr.writer_writing, 0);
66
67         /* XXX delete from parent's id2children entry XXX */
68         pdn = dn_parent( be, dn );
69         p = dn2entry_r( be, pdn, &matched );
70         if ( id2children_remove( be, p, e ) != 0 ) {
71                 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, "","" );
72                 goto error_return;
73         }
74
75         /* delete from dn2id mapping */
76         if ( dn2id_delete( be, e->e_dn ) != 0 ) {
77                 Debug(LDAP_DEBUG_ARGS,
78                         "<=- ldbm_back_delete: operations error %s\n",
79                         dn, 0, 0);
80                 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, "", "" );
81                 goto error_return;
82         }
83
84         /* delete from disk and cache */
85         if ( id2entry_delete( be, e ) != 0 ) {
86                 Debug(LDAP_DEBUG_ARGS,
87                         "<=- ldbm_back_delete: operations error %s\n",
88                         dn, 0, 0);
89                 send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR, "", "" );
90                 goto error_return;
91         }
92
93         /* free entry and writer lock */
94         cache_return_entry_w( &li->li_cache, e );
95         if ( p != NULL )
96                 cache_return_entry_r( &li->li_cache, p );
97
98         if ( matched != NULL ) free(matched);
99
100         send_ldap_result( conn, op, LDAP_SUCCESS, "", "" );
101
102         return( 0 );
103
104 error_return:;
105         /* free entry and writer lock */
106         cache_return_entry_w( &li->li_cache, e );
107
108         if( p != NULL )
109                 cache_return_entry_r( &li->li_cache, p );
110
111         if ( matched != NULL ) free(matched);
112
113         return( -1 );
114 }