1 /* modrdn.c - ldbm backend modrdn routine */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2005 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
16 /* Portions Copyright 1999, Juan C. Gomez, All rights reserved.
17 * This software is not subject to any license of Silicon Graphics
18 * Inc. or Purdue University.
20 * Redistribution and use in source and binary forms are permitted
21 * without restriction or fee of any kind as long as this notice
29 #include <ac/string.h>
30 #include <ac/socket.h>
33 #include "back-ldbm.h"
34 #include "proto-back-ldbm.h"
41 AttributeDescription *children = slap_schema.si_ad_children;
42 AttributeDescription *entry = slap_schema.si_ad_entry;
43 struct ldbminfo *li = (struct ldbminfo *) op->o_bd->be_private;
44 struct berval p_dn, p_ndn;
45 struct berval new_dn = BER_BVNULL, new_ndn = BER_BVNULL;
46 struct berval old_ndn = BER_BVNULL;
49 /* LDAP v2 supporting correct attribute handling. */
52 char textbuf[SLAP_TEXT_BUFLEN];
53 size_t textlen = sizeof textbuf;
54 /* Added to support newSuperior */
55 Entry *np = NULL; /* newSuperior Entry */
56 struct berval *np_ndn = NULL; /* newSuperior ndn */
57 struct berval *new_parent_dn = NULL; /* np_dn, p_dn, or NULL */
58 /* Used to interface with ldbm_modify_internal() */
59 int manageDSAit = get_manageDSAit( op );
61 Debug( LDAP_DEBUG_TRACE,
62 "==>ldbm_back_modrdn: dn: %s newSuperior=%s\n",
63 op->o_req_dn.bv_len ? op->o_req_dn.bv_val : "NULL",
64 ( op->oq_modrdn.rs_newSup && op->oq_modrdn.rs_newSup->bv_len )
65 ? op->oq_modrdn.rs_newSup->bv_val : "NULL", 0 );
67 if ( !SLAP_SHADOW( op->o_bd ))
68 slap_mods_opattrs( op, &op->orr_modlist, 1 );
70 /* grab giant lock for writing */
71 ldap_pvt_thread_rdwr_wlock(&li->li_giant_rwlock);
73 e = dn2entry_w( op->o_bd, &op->o_req_ndn, &matched );
75 /* get entry with writer lock */
76 /* FIXME: dn2entry() should return non-glue entry */
77 if (( e == NULL ) || ( !manageDSAit && e && is_entry_glue( e ))) {
78 if ( matched != NULL ) {
79 rs->sr_matched = strdup( matched->e_dn );
80 rs->sr_ref = is_entry_referral( matched )
81 ? get_entry_referrals( op, matched )
83 cache_return_entry_r( &li->li_cache, matched );
85 rs->sr_ref = referral_rewrite( default_referral, NULL,
86 &op->o_req_dn, LDAP_SCOPE_DEFAULT );
89 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
91 rs->sr_err = LDAP_REFERRAL;
92 send_ldap_result( op, rs );
94 if ( rs->sr_ref ) ber_bvarray_free( rs->sr_ref );
95 free( (char *)rs->sr_matched );
97 rs->sr_matched = NULL;
101 /* check entry for "entry" acl */
102 if ( ! access_allowed( op, e, entry, NULL, ACL_WRITE, NULL ) )
104 Debug( LDAP_DEBUG_TRACE,
105 "<=- ldbm_back_modrdn: no write access to entry\n", 0,
108 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
109 "no write access to entry" );
114 if (!manageDSAit && is_entry_referral( e ) ) {
115 /* parent is a referral, don't allow add */
116 /* parent is an alias, don't allow add */
117 rs->sr_ref = get_entry_referrals( op, e );
119 Debug( LDAP_DEBUG_TRACE, "entry %s is referral\n", e->e_dn,
122 rs->sr_err = LDAP_REFERRAL;
123 rs->sr_matched = e->e_name.bv_val;
124 send_ldap_result( op, rs );
126 if ( rs->sr_ref ) ber_bvarray_free( rs->sr_ref );
128 rs->sr_matched = NULL;
132 if ( has_children( op->o_bd, e ) ) {
133 Debug( LDAP_DEBUG_TRACE, "entry %s has children\n", e->e_dn,
136 send_ldap_error( op, rs, LDAP_NOT_ALLOWED_ON_NONLEAF,
137 "subtree rename not supported" );
141 if ( be_issuffix( op->o_bd, &e->e_nname ) ) {
142 p_ndn = slap_empty_bv ;
144 dnParent( &e->e_nname, &p_ndn );
147 if ( p_ndn.bv_len != 0 ) {
148 /* Make sure parent entry exist and we can write its
152 if( (p = dn2entry_w( op->o_bd, &p_ndn, NULL )) == NULL) {
153 Debug( LDAP_DEBUG_TRACE, "parent does not exist\n",
156 send_ldap_error( op, rs, LDAP_OTHER,
157 "parent entry does not exist" );
162 p = (Entry *)&slap_entry_root;
165 /* check parent for "children" acl */
166 rs->sr_err = access_allowed( op, p, children, NULL,
167 op->oq_modrdn.rs_newSup != NULL ?
168 ACL_WDEL : ACL_WRITE,
171 if ( BER_BVISEMPTY( &p_ndn ))
176 Debug( LDAP_DEBUG_TRACE, "no access to parent\n", 0,
179 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
184 Debug( LDAP_DEBUG_TRACE,
185 "ldbm_back_modrdn: wr to children of entry %s OK\n",
186 p_ndn.bv_val, 0, 0 );
188 if ( p_ndn.bv_val == slap_empty_bv.bv_val ) {
189 p_dn = slap_empty_bv;
191 dnParent( &e->e_name, &p_dn );
194 Debug( LDAP_DEBUG_TRACE, "ldbm_back_modrdn: parent dn=%s\n",
197 new_parent_dn = &p_dn; /* New Parent unless newSuperior given */
199 if ( op->oq_modrdn.rs_newSup != NULL ) {
200 Debug( LDAP_DEBUG_TRACE,
201 "ldbm_back_modrdn: new parent \"%s\" requested...\n",
202 op->oq_modrdn.rs_newSup->bv_val, 0, 0 );
204 np_ndn = op->oq_modrdn.rs_nnewSup;
206 /* newSuperior == oldParent? */
207 if ( dn_match( &p_ndn, np_ndn ) ) {
208 Debug( LDAP_DEBUG_TRACE, "ldbm_back_modrdn: "
209 "new parent\"%s\" seems to be the same as the "
210 "old parent \"%s\"\n",
211 op->oq_modrdn.rs_newSup->bv_val, p_dn.bv_val, 0 );
213 op->oq_modrdn.rs_newSup = NULL; /* ignore newSuperior */
217 if ( op->oq_modrdn.rs_newSup != NULL ) {
218 /* newSuperior == entry being moved?, if so ==> ERROR */
219 /* Get Entry with dn=newSuperior. Does newSuperior exist? */
221 if ( op->oq_modrdn.rs_nnewSup->bv_len ) {
222 if( (np = dn2entry_w( op->o_bd, np_ndn, NULL )) == NULL) {
223 Debug( LDAP_DEBUG_TRACE,
224 "ldbm_back_modrdn: newSup(ndn=%s) not here!\n",
225 np_ndn->bv_val, 0, 0);
227 send_ldap_error( op, rs, LDAP_NO_SUCH_OBJECT,
228 "newSuperior not found" );
232 Debug( LDAP_DEBUG_TRACE,
233 "ldbm_back_modrdn: wr to new parent OK np=%p, id=%ld\n",
234 (void *) np, np->e_id, 0 );
236 /* check newSuperior for "children" acl */
237 if ( !access_allowed( op, np, children, NULL,
240 Debug( LDAP_DEBUG_TRACE,
241 "ldbm_back_modrdn: no wr to newSup children\n",
244 send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS, NULL );
248 if ( is_entry_alias( np ) ) {
249 /* parent is an alias, don't allow add */
250 Debug( LDAP_DEBUG_TRACE, "entry is alias\n", 0, 0, 0 );
253 send_ldap_error( op, rs, LDAP_ALIAS_PROBLEM,
254 "newSuperior is an alias" );
259 if ( is_entry_referral( np ) ) {
260 /* parent is a referral, don't allow add */
261 Debug( LDAP_DEBUG_TRACE, "entry (%s) is referral\n",
264 send_ldap_error( op, rs, LDAP_OTHER,
265 "newSuperior is a referral" );
271 if ( be_issuffix( op->o_bd, (struct berval *)&slap_empty_bv )
272 || be_shadow_update( op ) ) {
274 np = (Entry *)&slap_entry_root;
276 can_access = access_allowed( op, np,
277 children, NULL, ACL_WADD, NULL );
280 /* check parent for "children" acl */
281 if ( ! can_access ) {
282 Debug( LDAP_DEBUG_TRACE,
283 "<=- ldbm_back_modrdn: no "
284 "access to new superior\n", 0, 0, 0 );
286 send_ldap_error( op, rs,
287 LDAP_INSUFFICIENT_ACCESS,
293 Debug( LDAP_DEBUG_TRACE,
294 "<=- ldbm_back_modrdn: \"\" "
295 "not allowed as new superior\n",
298 send_ldap_error( op, rs,
299 LDAP_INSUFFICIENT_ACCESS,
305 Debug( LDAP_DEBUG_TRACE,
306 "ldbm_back_modrdn: wr to new parent's children OK\n",
309 new_parent_dn = op->oq_modrdn.rs_newSup;
312 /* Build target dn and make sure target entry doesn't exist already. */
313 build_new_dn( &new_dn, new_parent_dn, &op->oq_modrdn.rs_newrdn, NULL );
314 dnNormalize( 0, NULL, NULL, &new_dn, &new_ndn, NULL );
316 Debug( LDAP_DEBUG_TRACE, "ldbm_back_modrdn: new ndn=%s\n",
317 new_ndn.bv_val, 0, 0 );
319 /* check for abandon */
320 if ( op->o_abandon ) {
321 rs->sr_err = SLAPD_ABANDON;
325 if ( ( rc_id = dn2id ( op->o_bd, &new_ndn, &id ) ) || id != NOID ) {
326 /* if (rc_id) something bad happened to ldbm cache */
327 rs->sr_err = rc_id ? LDAP_OTHER : LDAP_ALREADY_EXISTS;
328 send_ldap_result( op, rs );
332 Debug( LDAP_DEBUG_TRACE,
333 "ldbm_back_modrdn: new ndn=%s does not exist\n",
334 new_ndn.bv_val, 0, 0 );
336 Debug( LDAP_DEBUG_TRACE, "ldbm_back_modrdn: DN_X500\n",
339 assert( op->orr_modlist != NULL );
341 /* check for abandon */
342 if ( op->o_abandon ) {
343 rs->sr_err = SLAPD_ABANDON;
347 (void) cache_delete_entry( &li->li_cache, e );
350 old_ndn = e->e_nname;
352 e->e_nname = new_ndn;
353 new_dn.bv_val = NULL;
354 new_ndn.bv_val = NULL;
356 /* NOTE: after this you must not free new_dn or new_ndn!
357 * They are used by cache.
360 /* modify memory copy of entry */
361 rs->sr_err = ldbm_modify_internal( op, op->orr_modlist, e,
362 &rs->sr_text, textbuf, textlen );
363 switch ( rs->sr_err ) {
368 send_ldap_result( op, rs );
375 * NOTE: the backend MUST delete then add the entry,
376 * otherwise indexing may get hosed
377 * FIXME: if a new ID was used, the add could be done first.
378 * that would be safer.
382 if ( dn2id_delete( op->o_bd, &old_ndn, e->e_id ) != 0 ) {
383 send_ldap_error( op, rs, LDAP_OTHER,
384 "DN index delete fail" );
389 if ( dn2id_add( op->o_bd, &e->e_nname, e->e_id ) != 0 ) {
390 /* try to repair old entry - probably hopeless */
391 if( dn2id_add( op->o_bd, &old_ndn, e->e_id) != 0 ) {
392 send_ldap_error( op, rs, LDAP_OTHER,
393 "DN index add and repair failed" );
395 send_ldap_error( op, rs, LDAP_OTHER,
396 "DN index add failed" );
402 if ( id2entry_add( op->o_bd, e ) != 0 ) {
405 rc = dn2id_delete( op->o_bd, &e->e_nname, e->e_id );
406 rc |= dn2id_add( op->o_bd, &old_ndn, e->e_id );
408 send_ldap_error( op, rs, LDAP_OTHER,
409 "entry update and repair failed" );
411 send_ldap_error( op, rs, LDAP_OTHER,
412 "entry update failed" );
417 (void) cache_update_entry( &li->li_cache, e );
419 rs->sr_err = LDAP_SUCCESS;
421 send_ldap_result( op, rs );
422 cache_entry_commit( e );
425 if( new_dn.bv_val != NULL ) free( new_dn.bv_val );
426 if( new_ndn.bv_val != NULL ) free( new_ndn.bv_val );
427 if( old_ndn.bv_val != NULL ) free( old_ndn.bv_val );
429 /* LDAP v3 Support */
431 /* free new parent and writer lock */
432 cache_return_entry_w( &li->li_cache, np );
436 /* free parent and writer lock */
437 cache_return_entry_w( &li->li_cache, p );
440 /* free entry and writer lock */
441 cache_return_entry_w( &li->li_cache, e );
442 ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
444 return( rs->sr_err );