4 Copyright (C) Andrew Bartlett <abartlet@samba.org> 2006-2007
5 Copyright (C) Stefan Metzmacher <metze@samba.org> 2007
6 Copyright (C) Simo Sorce <idra@samba.org> 2008
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>.
25 * Component: ldb subtree delete (prevention) module
27 * Description: Prevent deletion of a subtree in LDB
29 * Author: Andrew Bartlett
32 #include "ldb_module.h"
34 struct subtree_delete_context {
35 struct ldb_module *module;
36 struct ldb_request *req;
41 static struct subtree_delete_context *subdel_ctx_init(struct ldb_module *module,
42 struct ldb_request *req)
44 struct ldb_context *ldb;
45 struct subtree_delete_context *ac;
47 ldb = ldb_module_get_ctx(module);
49 ac = talloc_zero(req, struct subtree_delete_context);
61 static int subtree_delete_search_callback(struct ldb_request *req,
62 struct ldb_reply *ares)
64 struct ldb_context *ldb;
65 struct subtree_delete_context *ac;
68 ac = talloc_get_type(req->context, struct subtree_delete_context);
69 ldb = ldb_module_get_ctx(ac->module);
72 ret = LDB_ERR_OPERATIONS_ERROR;
75 if (ares->error != LDB_SUCCESS) {
76 return ldb_module_done(ac->req, ares->controls,
77 ares->response, ares->error);
89 case LDB_REPLY_REFERRAL:
98 if (ac->num_children > 0) {
99 ldb_asprintf_errstring(ldb,
100 "Cannot delete %s, not a leaf node "
101 "(has %d children)\n",
102 ldb_dn_get_linearized(ac->req->op.del.dn),
104 return ldb_module_done(ac->req, NULL, NULL,
105 LDB_ERR_NOT_ALLOWED_ON_NON_LEAF);
108 /* ok no children, let the original request through */
109 ret = ldb_next_request(ac->module, ac->req);
114 if (ret != LDB_SUCCESS) {
115 return ldb_module_done(ac->req, NULL, NULL, ret);
121 static int subtree_delete(struct ldb_module *module, struct ldb_request *req)
123 struct ldb_context *ldb;
124 static const char * const attrs[2] = { "distinguishedName", NULL };
125 struct ldb_request *search_req;
126 struct subtree_delete_context *ac;
129 if (ldb_dn_is_special(req->op.rename.olddn)) {
130 /* do not manipulate our control entries */
131 return ldb_next_request(module, req);
134 ldb = ldb_module_get_ctx(module);
136 /* This gets complex: We need to:
137 - Do a search for all entires under this entry
138 - Wait for these results to appear
139 - In the callback for each result, count the children (if any)
140 - return an error if there are any
143 ac = subdel_ctx_init(module, req);
145 return LDB_ERR_OPERATIONS_ERROR;
148 /* we do not really need to find all descendents,
149 * if there is even one single direct child, that's
150 * enough to bail out */
151 ret = ldb_build_search_req(&search_req, ldb, ac,
152 req->op.del.dn, LDB_SCOPE_ONELEVEL,
153 "(objectClass=*)", attrs,
155 ac, subtree_delete_search_callback,
157 if (ret != LDB_SUCCESS) {
161 return ldb_next_request(module, search_req);
164 const struct ldb_module_ops ldb_subtree_delete_module_ops = {
165 .name = "subtree_delete",
166 .del = subtree_delete,