openldap/servers/slapd/back-ldbm/add.c

329 lines
8.2 KiB
C
Raw Normal View History

1998-08-09 08:43:13 +08:00
/* add.c - ldap ldbm back-end add routine */
/* $OpenLDAP$ */
2003-11-29 05:08:20 +08:00
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
2005-01-02 04:49:32 +08:00
* Copyright 1998-2005 The OpenLDAP Foundation.
2003-11-29 05:08:20 +08:00
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
* A copy of this license is available in the file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
1999-08-07 07:07:46 +08:00
*/
1998-08-09 08:43:13 +08:00
1998-10-25 09:41:42 +08:00
#include "portable.h"
1998-08-09 08:43:13 +08:00
#include <stdio.h>
1998-10-25 09:41:42 +08:00
#include <ac/socket.h>
#include <ac/string.h>
1998-08-09 08:43:13 +08:00
#include "slap.h"
#include "back-ldbm.h"
#include "proto-back-ldbm.h"
1998-08-09 08:43:13 +08:00
int
ldbm_back_add(
Operation *op,
SlapReply *rs )
1998-08-09 08:43:13 +08:00
{
struct ldbminfo *li = (struct ldbminfo *) op->o_bd->be_private;
2002-01-01 21:31:20 +08:00
struct berval pdn;
Entry *p = NULL;
ID id = NOID;
2000-05-24 02:20:38 +08:00
AttributeDescription *children = slap_schema.si_ad_children;
AttributeDescription *entry = slap_schema.si_ad_entry;
char textbuf[SLAP_TEXT_BUFLEN];
size_t textlen = sizeof textbuf;
#ifdef LDBM_SUBENTRIES
int subentry;
#endif
2003-12-31 12:26:17 +08:00
Debug(LDAP_DEBUG_ARGS, "==> ldbm_back_add: %s\n",
op->o_req_dn.bv_val, 0, 0);
2003-12-31 12:26:17 +08:00
rs->sr_err = entry_schema_check( op->o_bd, op->oq_add.rs_e, NULL,
&rs->sr_text, textbuf, textlen );
if ( rs->sr_err != LDAP_SUCCESS ) {
2000-04-25 21:07:14 +08:00
Debug( LDAP_DEBUG_TRACE, "entry failed schema check: %s\n",
rs->sr_text, 0, 0 );
2001-01-18 01:01:19 +08:00
send_ldap_result( op, rs );
return rs->sr_err;
1998-08-09 08:43:13 +08:00
}
#ifdef LDBM_SUBENTRIES
subentry = is_entry_subentry( op->oq_add.rs_e );
#endif
if ( !access_allowed( op, op->oq_add.rs_e,
entry, NULL, ACL_WRITE, NULL ) )
{
Debug( LDAP_DEBUG_TRACE, "no write access to entry\n", 0,
0, 0 );
send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
"no write access to entry" );
return LDAP_INSUFFICIENT_ACCESS;
}
/* grab giant lock for writing */
ldap_pvt_thread_rdwr_wlock(&li->li_giant_rwlock);
2003-12-31 12:26:17 +08:00
rs->sr_err = dn2id( op->o_bd, &op->o_req_ndn, &id );
if ( rs->sr_err || id != NOID ) {
/* if (rs->sr_err) something bad happened to ldbm cache */
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
rs->sr_err = rs->sr_err ? LDAP_OTHER : LDAP_ALREADY_EXISTS;
send_ldap_result( op, rs );
return rs->sr_err;
}
1998-08-09 08:43:13 +08:00
/*
* Get the parent dn and see if the corresponding entry exists.
* If the parent does not exist, only allow the "root" user to
* add the entry.
*/
if ( be_issuffix( op->o_bd, &op->o_req_ndn ) ) {
pdn = slap_empty_bv;
} else {
dnParent( &op->o_req_ndn, &pdn );
}
if( pdn.bv_len ) {
Entry *matched = NULL;
/* get parent with writer lock */
if ( (p = dn2entry_w( op->o_bd, &pdn, &matched )) == NULL ) {
1998-08-09 08:43:13 +08:00
if ( matched != NULL ) {
rs->sr_matched = ch_strdup( matched->e_dn );
rs->sr_ref = is_entry_referral( matched )
? get_entry_referrals( op, matched )
: NULL;
cache_return_entry_r( &li->li_cache, matched );
} else {
rs->sr_ref = referral_rewrite( default_referral,
NULL, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
}
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
Debug( LDAP_DEBUG_TRACE, "parent does not exist\n",
0, 0, 0 );
2001-01-18 01:01:19 +08:00
2003-12-31 12:26:17 +08:00
rs->sr_text = rs->sr_ref
? "parent is referral" : "parent does not exist";
rs->sr_err = LDAP_REFERRAL;
send_ldap_result( op, rs );
ber_bvarray_free( rs->sr_ref );
free( (char *)rs->sr_matched );
2003-09-27 15:36:20 +08:00
rs->sr_ref = NULL;
rs->sr_matched = NULL;
return rs->sr_err;
1998-08-09 08:43:13 +08:00
}
2003-12-31 12:26:17 +08:00
if ( ! access_allowed( op, p, children, NULL, ACL_WRITE, NULL ) ) {
/* free parent and writer lock */
cache_return_entry_w( &li->li_cache, p );
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
2000-04-25 21:07:14 +08:00
Debug( LDAP_DEBUG_TRACE, "no write access to parent\n", 0,
1998-08-09 08:43:13 +08:00
0, 0 );
2001-01-18 01:01:19 +08:00
send_ldap_error( op, rs, LDAP_INSUFFICIENT_ACCESS,
"no write access to parent" );
return LDAP_INSUFFICIENT_ACCESS;
}
#ifdef LDBM_SUBENTRIES
if ( is_entry_subentry( p )) {
Debug( LDAP_DEBUG_TRACE, "bdb_add: parent is subentry\n",
0, 0, 0 );
rs->sr_err = LDAP_OBJECT_CLASS_VIOLATION;
rs->sr_text = "parent is a subentry";
goto return_results;
}
#endif
if ( is_entry_alias( p ) ) {
/* parent is an alias, don't allow add */
/* free parent and writer lock */
cache_return_entry_w( &li->li_cache, p );
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
Debug( LDAP_DEBUG_TRACE, "parent is alias\n", 0,
0, 0 );
2001-01-18 01:01:19 +08:00
send_ldap_error( op, rs, LDAP_ALIAS_PROBLEM,
"parent is an alias" );
return LDAP_ALIAS_PROBLEM;
1998-08-09 08:43:13 +08:00
}
if ( is_entry_referral( p ) ) {
/* parent is a referral, don't allow add */
rs->sr_matched = ch_strdup( p->e_dn );
rs->sr_ref = is_entry_referral( p )
? get_entry_referrals( op, p )
: NULL;
/* free parent and writer lock */
cache_return_entry_w( &li->li_cache, p );
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
Debug( LDAP_DEBUG_TRACE, "parent is referral\n", 0,
0, 0 );
rs->sr_err = LDAP_REFERRAL;
send_ldap_result( op, rs );
2001-01-18 01:01:19 +08:00
ber_bvarray_free( rs->sr_ref );
free( (char *)rs->sr_matched );
2003-09-27 15:36:20 +08:00
rs->sr_ref = NULL;
rs->sr_matched = NULL;
return rs->sr_err;
}
#ifdef LDBM_SUBENTRIES
if ( subentry ) {
/* FIXME: */
/* parent must be an administrative point of the required kind */
}
#endif
1998-08-09 08:43:13 +08:00
} else {
2003-10-13 06:34:14 +08:00
assert( pdn.bv_val == NULL || *pdn.bv_val == '\0' );
if (( !be_isroot(op) && !be_shadow_update(op) )
2004-04-08 01:32:37 +08:00
&& !is_entry_glue( op->oq_add.rs_e ))
{
2003-10-12 14:32:44 +08:00
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
2003-10-12 14:32:44 +08:00
Debug( LDAP_DEBUG_TRACE, "%s add denied\n",
pdn.bv_val == NULL ? "suffix" : "entry at root", 0, 0 );
2003-10-12 14:32:44 +08:00
send_ldap_error( op, rs, LDAP_NO_SUCH_OBJECT, NULL );
return LDAP_NO_SUCH_OBJECT;
}
1998-08-09 08:43:13 +08:00
}
if ( next_id( op->o_bd, &op->oq_add.rs_e->e_id ) ) {
2000-09-13 05:16:03 +08:00
if( p != NULL) {
/* free parent and writer lock */
cache_return_entry_w( &li->li_cache, p );
}
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
2000-09-13 05:16:03 +08:00
Debug( LDAP_DEBUG_ANY, "ldbm_add: next_id failed\n",
0, 0, 0 );
2001-01-18 01:01:19 +08:00
send_ldap_error( op, rs, LDAP_OTHER,
"next_id add failed" );
2000-09-13 05:16:03 +08:00
return LDAP_OTHER;
2000-09-13 05:16:03 +08:00
}
/*
* Try to add the entry to the cache, assign it a new dnid.
*/
2003-12-31 12:26:17 +08:00
rs->sr_err = cache_add_entry_rw( &li->li_cache, op->oq_add.rs_e,
CACHE_WRITE_LOCK );
if ( rs->sr_err != 0 ) {
if( p != NULL) {
/* free parent and writer lock */
cache_return_entry_w( &li->li_cache, p );
}
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
Debug( LDAP_DEBUG_ANY, "cache_add_entry_lock failed\n", 0, 0,
0 );
2001-01-18 01:01:19 +08:00
rs->sr_text = rs->sr_err > 0 ? NULL : "cache add failed";
rs->sr_err = rs->sr_err > 0 ? LDAP_ALREADY_EXISTS : LDAP_OTHER;
send_ldap_result( op, rs );
return rs->sr_err;
}
rs->sr_err = -1;
1998-08-09 08:43:13 +08:00
/* attribute indexes */
2003-04-11 09:29:28 +08:00
if ( index_entry_add( op, op->oq_add.rs_e ) != LDAP_SUCCESS ) {
Debug( LDAP_DEBUG_TRACE, "index_entry_add failed\n", 0,
1998-08-09 08:43:13 +08:00
0, 0 );
send_ldap_error( op, rs, LDAP_OTHER,
"index generation failed" );
goto return_results;
1998-08-09 08:43:13 +08:00
}
/* dn2id index */
2003-12-31 12:26:17 +08:00
if ( dn2id_add( op->o_bd, &op->oq_add.rs_e->e_nname,
op->oq_add.rs_e->e_id ) != 0 )
{
1998-08-09 08:43:13 +08:00
Debug( LDAP_DEBUG_TRACE, "dn2id_add failed\n", 0,
0, 0 );
/* FIXME: delete attr indices? */
2001-01-18 01:01:19 +08:00
send_ldap_error( op, rs, LDAP_OTHER,
"DN index generation failed" );
goto return_results;
1998-08-09 08:43:13 +08:00
}
/* id2entry index */
if ( id2entry_add( op->o_bd, op->oq_add.rs_e ) != 0 ) {
1998-08-09 08:43:13 +08:00
Debug( LDAP_DEBUG_TRACE, "id2entry_add failed\n", 0,
0, 0 );
2001-01-18 01:01:19 +08:00
/* FIXME: delete attr indices? */
2003-12-31 12:26:17 +08:00
(void) dn2id_delete( op->o_bd, &op->oq_add.rs_e->e_nname,
op->oq_add.rs_e->e_id );
send_ldap_error( op, rs, LDAP_OTHER,
"entry store failed" );
goto return_results;
1998-08-09 08:43:13 +08:00
}
rs->sr_err = LDAP_SUCCESS;
2003-09-27 15:36:20 +08:00
rs->sr_text = NULL;
send_ldap_result( op, rs );
/* marks the entry as committed, so it is added to the cache;
* otherwise it is removed from the cache, but not destroyed;
* it will be destroyed by the caller */
cache_entry_commit( op->oq_add.rs_e );
return_results:;
if (p != NULL) {
/* free parent and writer lock */
cache_return_entry_w( &li->li_cache, p );
}
if ( rs->sr_err ) {
/*
* in case of error, writer lock is freed
* and entry's private data is destroyed.
* otherwise, this is done when entry is released
*/
cache_return_entry_w( &li->li_cache, op->oq_add.rs_e );
ldap_pvt_thread_rdwr_wunlock(&li->li_giant_rwlock);
}
return( rs->sr_err );
1998-08-09 08:43:13 +08:00
}