3 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
7 * Copyright (c) 1995 Regents of the University of Michigan.
10 * Redistribution and use in source and binary forms are permitted
11 * provided that this notice is preserved and that due credit is given
12 * to the University of Michigan at Ann Arbor. The name of the University
13 * may not be used to endorse or promote products derived from this
14 * software without specific prior written permission. This software
15 * is provided ``as is'' without express or implied warranty.
21 #include <ac/string.h>
23 #include <ac/socket.h>
28 static int slap_mods2entry(
34 do_add( Connection *conn, Operation *op )
36 BerElement *ber = op->o_ber;
42 LDAPModList *modlist = NULL;
43 LDAPModList **modtail = &modlist;
44 Modifications *mods = NULL;
46 int rc = LDAP_SUCCESS;
50 LDAP_LOG(( "operation", LDAP_LEVEL_ENTRY,
51 "do_add: conn %d enter\n", conn->c_connid ));
53 Debug( LDAP_DEBUG_TRACE, "do_add\n", 0, 0, 0 );
56 * Parse the add request. It looks like this:
58 * AddRequest := [APPLICATION 14] SEQUENCE {
59 * name DistinguishedName,
60 * attrs SEQUENCE OF SEQUENCE {
62 * values SET OF AttributeValue
68 if ( ber_scanf( ber, "{a", /*}*/ &dn ) == LBER_ERROR ) {
70 LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
71 "do_add: conn %d ber_scanf failed\n", conn->c_connid ));
73 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
75 send_ldap_disconnect( conn, op,
76 LDAP_PROTOCOL_ERROR, "decoding error" );
80 e = (Entry *) ch_calloc( 1, sizeof(Entry) );
82 e->e_dn = dn_pretty( dn );
83 e->e_ndn = dn_normalize( dn );
87 if ( e->e_ndn == NULL ) {
89 LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
90 "do_add: conn %d invalid dn (%s)\n", conn->c_connid, dn ));
92 Debug( LDAP_DEBUG_ANY, "do_add: invalid dn (%s)\n", dn, 0, 0 );
94 send_ldap_result( conn, op, rc = LDAP_INVALID_DN_SYNTAX, NULL,
95 "invalid DN", NULL, NULL );
100 LDAP_LOG(( "operation", LDAP_LEVEL_ARGS,
101 "do_add: conn %d ndn (%s)\n", conn->c_connid, e->e_ndn ));
103 Debug( LDAP_DEBUG_ARGS, "do_add: ndn (%s)\n", e->e_ndn, 0, 0 );
107 for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT;
108 tag = ber_next_element( ber, &len, last ) )
110 LDAPModList *mod = (LDAPModList *) ch_malloc( sizeof(LDAPModList) );
111 mod->ml_op = LDAP_MOD_ADD;
114 rc = ber_scanf( ber, "{a{V}}", &mod->ml_type, &mod->ml_bvalues );
116 if ( rc == LBER_ERROR ) {
118 LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
119 "do_add: conn %d decoding error \n", conn->c_connid ));
121 Debug( LDAP_DEBUG_ANY, "do_add: decoding error\n", 0, 0, 0 );
123 send_ldap_disconnect( conn, op,
124 LDAP_PROTOCOL_ERROR, "decoding error" );
130 if ( mod->ml_bvalues == NULL ) {
132 LDAP_LOG(( "operation", LDAP_LEVEL_INFO,
133 "do_add: conn %d no values for type %s\n",
134 conn->c_connid, mod->ml_type ));
136 Debug( LDAP_DEBUG_ANY, "no values for type %s\n",
137 mod->ml_type, 0, 0 );
139 send_ldap_result( conn, op, rc = LDAP_PROTOCOL_ERROR,
140 NULL, "no values for attribute type", NULL, NULL );
141 free( mod->ml_type );
147 modtail = &mod->ml_next;
150 if ( ber_scanf( ber, /*{*/ "}") == LBER_ERROR ) {
152 LDAP_LOG(( "operation", LDAP_LEVEL_ERR,
153 "do_add: conn %d ber_scanf failed\n", conn->c_connid ));
155 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
157 send_ldap_disconnect( conn, op,
158 LDAP_PROTOCOL_ERROR, "decoding error" );
163 if( (rc = get_ctrls( conn, op, 1 )) != LDAP_SUCCESS ) {
165 LDAP_LOG(( "operation", LDAP_LEVEL_INFO,
166 "do_add: conn %d get_ctrls failed\n", conn->c_connid ));
168 Debug( LDAP_DEBUG_ANY, "do_add: get_ctrls failed\n", 0, 0, 0 );
173 if ( modlist == NULL ) {
174 send_ldap_result( conn, op, rc = LDAP_PROTOCOL_ERROR,
175 NULL, "no attributes provided", NULL, NULL );
179 Statslog( LDAP_DEBUG_STATS, "conn=%ld op=%d ADD dn=\"%s\"\n",
180 op->o_connid, op->o_opid, e->e_ndn, 0, 0 );
182 if( e->e_ndn == NULL || *e->e_ndn == '\0' ) {
183 /* protocolError may be a more appropriate error */
184 send_ldap_result( conn, op, rc = LDAP_ALREADY_EXISTS,
185 NULL, "root DSE already exists",
189 #if defined( SLAPD_SCHEMA_DN )
190 } else if ( strcasecmp( e->e_ndn, SLAPD_SCHEMA_DN ) == 0 ) {
191 /* protocolError may be a more appropriate error */
192 send_ldap_result( conn, op, rc = LDAP_ALREADY_EXISTS,
193 NULL, "subschema subentry already exists",
199 manageDSAit = get_manageDSAit( op );
202 * We could be serving multiple database backends. Select the
203 * appropriate one, or send a referral to our "referral server"
204 * if we don't hold it.
206 be = select_backend( e->e_ndn, manageDSAit, 0 );
208 struct berval **ref = referral_rewrite( default_referral,
209 NULL, e->e_dn, LDAP_SCOPE_DEFAULT );
211 send_ldap_result( conn, op, rc = LDAP_REFERRAL,
212 NULL, NULL, ref ? ref : default_referral, NULL );
218 /* check restrictions */
219 rc = backend_check_restrictions( be, conn, op, NULL, &text ) ;
220 if( rc != LDAP_SUCCESS ) {
221 send_ldap_result( conn, op, rc,
222 NULL, text, NULL, NULL );
226 /* check for referrals */
227 rc = backend_check_referrals( be, conn, op, e->e_dn, e->e_ndn );
228 if ( rc != LDAP_SUCCESS ) {
233 * do the add if 1 && (2 || 3)
234 * 1) there is an add function implemented in this backend;
235 * 2) this backend is master for what it holds;
236 * 3) it's a replica and the dn supplied is the updatedn.
239 /* do the update here */
240 int repl_user = be_isupdate(be, op->o_ndn );
241 #ifndef SLAPD_MULTIMASTER
242 if ( be->be_update_ndn == NULL || repl_user )
245 int update = be->be_update_ndn != NULL;
246 char textbuf[SLAP_TEXT_BUFLEN];
247 size_t textlen = sizeof textbuf;
249 rc = slap_modlist2mods( modlist, update, &mods, &text,
252 if( rc != LDAP_SUCCESS ) {
253 send_ldap_result( conn, op, rc,
254 NULL, text, NULL, NULL );
258 if ( (be->be_lastmod == ON || (be->be_lastmod == UNDEFINED &&
259 global_lastmod == ON)) && !repl_user )
261 Modifications **modstail;
262 for( modstail = &mods;
264 modstail = &(*modstail)->sml_next )
266 assert( (*modstail)->sml_op == LDAP_MOD_ADD );
267 assert( (*modstail)->sml_desc != NULL );
269 rc = slap_mods_opattrs( op, mods, modstail, &text );
270 if( rc != LDAP_SUCCESS ) {
271 send_ldap_result( conn, op, rc,
272 NULL, text, NULL, NULL );
277 rc = slap_mods2entry( mods, &e, &text );
278 if( rc != LDAP_SUCCESS ) {
279 send_ldap_result( conn, op, rc,
280 NULL, text, NULL, NULL );
284 if ( (*be->be_add)( be, conn, op, e ) == 0 ) {
285 #ifdef SLAPD_MULTIMASTER
289 replog( be, op, e->e_dn, e->e_ndn, e );
291 be_entry_release_w( be, conn, op, e );
295 #ifndef SLAPD_MULTIMASTER
297 struct berval **defref = be->be_update_refs
298 ? be->be_update_refs : default_referral;
299 struct berval **ref = referral_rewrite( defref,
300 NULL, e->e_dn, LDAP_SCOPE_DEFAULT );
302 send_ldap_result( conn, op, rc = LDAP_REFERRAL, NULL, NULL,
303 ref ? ref : defref, NULL );
310 LDAP_LOG(( "operation", LDAP_LEVEL_INFO,
311 "do_add: conn %d no backend support\n", conn->c_connid ));
313 Debug( LDAP_DEBUG_ARGS, " do_add: no backend support\n", 0, 0, 0 );
315 send_ldap_result( conn, op, rc = LDAP_UNWILLING_TO_PERFORM,
316 NULL, "operation not supported within namingContext", NULL, NULL );
320 if( modlist != NULL ) {
321 slap_modlist_free( modlist );
324 slap_mods_free( mods );
333 static int slap_mods2entry(
338 Attribute **tail = &(*e)->e_attrs;
339 assert( *tail == NULL );
341 for( ; mods != NULL; mods = mods->sml_next ) {
344 assert( mods->sml_op == LDAP_MOD_ADD );
345 assert( mods->sml_desc != NULL );
347 attr = attr_find( (*e)->e_attrs, mods->sml_desc );
350 #define SLURPD_FRIENDLY
351 #ifdef SLURPD_FRIENDLY
354 for( i=0; attr->a_vals[i]; i++ ) {
357 for( j=0; mods->sml_bvalues[j]; j++ ) {
362 attr->a_vals = ch_realloc( attr->a_vals,
363 sizeof( struct berval * ) * (i+j) );
365 /* should check for duplicates */
366 AC_MEMCPY( &attr->a_vals[i], mods->sml_bvalues,
367 sizeof( struct berval * ) * j );
369 /* trim the mods array */
370 ch_free( mods->sml_bvalues );
371 mods->sml_bvalues = NULL;
375 *text = "attribute provided more than once";
376 return LDAP_TYPE_OR_VALUE_EXISTS;
380 attr = ch_calloc( 1, sizeof(Attribute) );
382 /* move ad to attr structure */
383 attr->a_desc = mods->sml_desc;
384 mods->sml_desc = NULL;
386 /* move values to attr structure */
387 /* should check for duplicates */
388 attr->a_vals = mods->sml_bvalues;
389 mods->sml_bvalues = NULL;
392 tail = &attr->a_next;