2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1998-2004 The OpenLDAP Foundation.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted only as authorized by the OpenLDAP
11 * A copy of this license is available in the file LICENSE in the
12 * top-level directory of the distribution or, alternatively, at
13 * <http://www.OpenLDAP.org/license.html>.
15 /* Portions Copyright (c) 1995 Regents of the University of Michigan.
16 * All rights reserved.
18 * Redistribution and use in source and binary forms are permitted
19 * provided that this notice is preserved and that due credit is given
20 * to the University of Michigan at Ann Arbor. The name of the University
21 * may not be used to endorse or promote products derived from this
22 * software without specific prior written permission. This software
23 * is provided ``as is'' without express or implied warranty.
29 #include <ac/string.h>
31 #include <ac/socket.h>
37 #include "slapi/slapi.h"
39 static void init_add_pblock( Operation *op, struct berval *dn, Entry *e, int manageDSAit );
40 static int call_add_preop_plugins( Operation *op );
41 static void call_add_postop_plugins( Operation *op );
42 #endif /* LDAP_SLAPI */
45 do_add( Operation *op, SlapReply *rs )
47 BerElement *ber = op->o_ber;
49 struct berval dn = BER_BVNULL;
53 Modifications *modlist = NULL;
54 Modifications **modtail = &modlist;
59 LDAP_LOG( OPERATION, ENTRY, "do_add: conn %d enter\n", op->o_connid,0,0 );
61 Debug( LDAP_DEBUG_TRACE, "do_add\n", 0, 0, 0 );
64 * Parse the add request. It looks like this:
66 * AddRequest := [APPLICATION 14] SEQUENCE {
67 * name DistinguishedName,
68 * attrs SEQUENCE OF SEQUENCE {
70 * values SET OF AttributeValue
76 if ( ber_scanf( ber, "{m", /*}*/ &dn ) == LBER_ERROR ) {
78 LDAP_LOG( OPERATION, ERR,
79 "do_add: conn %d ber_scanf failed\n", op->o_connid,0,0 );
81 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
83 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
87 e = (Entry *) ch_calloc( 1, sizeof(Entry) );
89 rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn, op->o_tmpmemctx );
91 if( rs->sr_err != LDAP_SUCCESS ) {
93 LDAP_LOG( OPERATION, ERR,
94 "do_add: conn %d invalid dn (%s)\n", op->o_connid, dn.bv_val, 0 );
96 Debug( LDAP_DEBUG_ANY, "do_add: invalid dn (%s)\n", dn.bv_val, 0, 0 );
98 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" );
102 ber_dupbv( &e->e_name, &op->o_req_dn );
103 ber_dupbv( &e->e_nname, &op->o_req_ndn );
106 LDAP_LOG( OPERATION, ARGS,
107 "do_add: conn %d dn (%s)\n", op->o_connid, e->e_dn, 0 );
109 Debug( LDAP_DEBUG_ARGS, "do_add: dn (%s)\n", e->e_dn, 0, 0 );
113 for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT;
114 tag = ber_next_element( ber, &len, last ) )
119 tmp.sml_nvalues = NULL;
121 rtag = ber_scanf( ber, "{m{W}}", &tmp.sml_type, &tmp.sml_values );
123 if ( rtag == LBER_ERROR ) {
125 LDAP_LOG( OPERATION, ERR,
126 "do_add: conn %d decoding error \n", op->o_connid, 0, 0 );
128 Debug( LDAP_DEBUG_ANY, "do_add: decoding error\n", 0, 0, 0 );
130 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
135 if ( tmp.sml_values == NULL ) {
137 LDAP_LOG( OPERATION, INFO,
138 "do_add: conn %d no values for type %s\n",
139 op->o_connid, tmp.sml_type.bv_val, 0 );
141 Debug( LDAP_DEBUG_ANY, "no values for type %s\n",
142 tmp.sml_type.bv_val, 0, 0 );
144 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
145 "no values for attribute type" );
149 mod = (Modifications *) ch_malloc( sizeof(Modifications) );
150 mod->sml_op = LDAP_MOD_ADD;
151 mod->sml_next = NULL;
152 mod->sml_desc = NULL;
153 mod->sml_type = tmp.sml_type;
154 mod->sml_values = tmp.sml_values;
155 mod->sml_nvalues = NULL;
158 modtail = &mod->sml_next;
161 if ( ber_scanf( ber, /*{*/ "}") == LBER_ERROR ) {
163 LDAP_LOG( OPERATION, ERR,
164 "do_add: conn %d ber_scanf failed\n", op->o_connid, 0, 0 );
166 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
168 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
173 if( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) {
175 LDAP_LOG( OPERATION, INFO,
176 "do_add: conn %d get_ctrls failed\n", op->o_connid, 0, 0 );
178 Debug( LDAP_DEBUG_ANY, "do_add: get_ctrls failed\n", 0, 0, 0 );
183 if ( modlist == NULL ) {
184 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
185 "no attributes provided" );
189 Statslog( LDAP_DEBUG_STATS, "conn=%lu op=%lu ADD dn=\"%s\"\n",
190 op->o_connid, op->o_opid, e->e_name.bv_val, 0, 0 );
192 if( e->e_nname.bv_len == 0 ) {
193 /* protocolError may be a more appropriate error */
194 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
195 "root DSE already exists" );
198 } else if ( bvmatch( &e->e_nname, &global_schemandn ) ) {
199 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
200 "subschema subentry already exists" );
204 manageDSAit = get_manageDSAit( op );
207 * We could be serving multiple database backends. Select the
208 * appropriate one, or send a referral to our "referral server"
209 * if we don't hold it.
211 op->o_bd = select_backend( &e->e_nname, manageDSAit, 0 );
212 if ( op->o_bd == NULL ) {
213 rs->sr_ref = referral_rewrite( default_referral,
214 NULL, &e->e_name, LDAP_SCOPE_DEFAULT );
215 if ( !rs->sr_ref ) rs->sr_ref = default_referral;
217 rs->sr_err = LDAP_REFERRAL;
218 send_ldap_result( op, rs );
220 if ( rs->sr_ref != default_referral ) {
221 ber_bvarray_free( rs->sr_ref );
224 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
225 "no global superior knowledge" );
230 /* check restrictions */
231 if( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) {
232 send_ldap_result( op, rs );
236 /* check for referrals */
237 if( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) {
242 if ( op->o_pb ) init_add_pblock( op, &dn, e, manageDSAit );
243 #endif /* LDAP_SLAPI */
246 * do the add if 1 && (2 || 3)
247 * 1) there is an add function implemented in this backend;
248 * 2) this backend is master for what it holds;
249 * 3) it's a replica and the dn supplied is the updatedn.
251 if ( op->o_bd->be_add ) {
252 /* do the update here */
253 int repl_user = be_isupdate( op );
254 #ifndef SLAPD_MULTIMASTER
255 if ( !SLAP_SHADOW(op->o_bd) || repl_user )
258 int update = op->o_bd->be_update_ndn.bv_len;
259 char textbuf[SLAP_TEXT_BUFLEN];
260 size_t textlen = sizeof textbuf;
261 slap_callback cb = { NULL, slap_replog_cb, NULL, NULL };
263 rs->sr_err = slap_mods_check( modlist, update, &rs->sr_text,
264 textbuf, textlen, NULL );
266 if( rs->sr_err != LDAP_SUCCESS ) {
267 send_ldap_result( op, rs );
272 for( modtail = &modlist;
274 modtail = &(*modtail)->sml_next )
276 assert( (*modtail)->sml_op == LDAP_MOD_ADD );
277 assert( (*modtail)->sml_desc != NULL );
279 rs->sr_err = slap_mods_opattrs( op, modlist, modtail,
280 &rs->sr_text, textbuf, textlen );
281 if( rs->sr_err != LDAP_SUCCESS ) {
282 send_ldap_result( op, rs );
287 rs->sr_err = slap_mods2entry( modlist, &e, repl_user, 0,
288 &rs->sr_text, textbuf, textlen );
289 if( rs->sr_err != LDAP_SUCCESS ) {
290 send_ldap_result( op, rs );
296 * Call the preoperation plugin here, because the entry
297 * will actually contain something.
300 rs->sr_err = call_add_preop_plugins( op );
301 if ( rs->sr_err != LDAP_SUCCESS ) {
302 /* plugin will have sent result */
306 #endif /* LDAP_SLAPI */
309 #ifdef SLAPD_MULTIMASTER
313 cb.sc_next = op->o_callback;
314 op->o_callback = &cb;
316 if ( (op->o_bd->be_add)( op, rs ) == 0 ) {
317 be_entry_release_w( op, e );
321 #ifndef SLAPD_MULTIMASTER
323 BerVarray defref = NULL;
326 * SLAPI_ADD_ENTRY will be empty, but this may be acceptable
327 * on replicas (for now, it involves the minimum code intrusion).
330 rs->sr_err = call_add_preop_plugins( op );
331 if ( rs->sr_err != LDAP_SUCCESS ) {
332 /* plugin will have sent result */
336 #endif /* LDAP_SLAPI */
338 defref = op->o_bd->be_update_refs
339 ? op->o_bd->be_update_refs : default_referral;
341 if ( defref != NULL ) {
342 rs->sr_ref = referral_rewrite( defref,
343 NULL, &e->e_name, LDAP_SCOPE_DEFAULT );
344 if ( rs->sr_ref == NULL ) rs->sr_ref = defref;
345 rs->sr_err = LDAP_REFERRAL;
346 if (!rs->sr_ref) rs->sr_ref = default_referral;
347 send_ldap_result( op, rs );
349 if ( rs->sr_ref != default_referral ) {
350 ber_bvarray_free( rs->sr_ref );
353 send_ldap_error( op, rs,
354 LDAP_UNWILLING_TO_PERFORM,
355 "shadow context; no update referral" );
357 #endif /* SLAPD_MULTIMASTER */
362 rs->sr_err = call_add_preop_plugins( op );
363 if ( rs->sr_err != LDAP_SUCCESS ) {
364 /* plugin will have sent result */
370 LDAP_LOG( OPERATION, INFO,
371 "do_add: conn %d no backend support\n", op->o_connid, 0, 0 );
373 Debug( LDAP_DEBUG_ARGS, " do_add: no backend support\n", 0, 0, 0 );
375 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
376 "operation not supported within namingContext" );
380 if ( op->o_pb ) call_add_postop_plugins( op );
381 #endif /* LDAP_SLAPI */
385 slap_graduate_commit_csn( op );
387 if( modlist != NULL ) {
388 slap_mods_free( modlist );
393 op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx );
394 op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx );
406 char *textbuf, size_t textlen )
408 Attribute **tail = &(*e)->e_attrs;
409 assert( *tail == NULL );
413 for( ; mods != NULL; mods = mods->sml_next ) {
417 assert( mods->sml_op == LDAP_MOD_ADD );
419 assert( mods->sml_desc != NULL );
421 attr = attr_find( (*e)->e_attrs, mods->sml_desc );
424 #define SLURPD_FRIENDLY
425 #ifdef SLURPD_FRIENDLY
429 snprintf( textbuf, textlen,
430 "attribute '%s' provided more than once",
431 mods->sml_desc->ad_cname.bv_val );
432 return LDAP_TYPE_OR_VALUE_EXISTS;
435 for( i=0; attr->a_vals[i].bv_val; i++ ) {
438 for( j=0; mods->sml_values[j].bv_val; j++ ) {
443 attr->a_vals = ch_realloc( attr->a_vals,
444 sizeof( struct berval ) * (i+j) );
446 /* should check for duplicates */
448 AC_MEMCPY( &attr->a_vals[i], mods->sml_values,
449 sizeof( struct berval ) * j );
451 /* trim the mods array */
452 ch_free( mods->sml_values );
453 mods->sml_values = NULL;
455 if( mods->sml_nvalues ) {
456 attr->a_nvals = ch_realloc( attr->a_nvals,
457 sizeof( struct berval ) * (i+j) );
459 AC_MEMCPY( &attr->a_nvals[i], mods->sml_nvalues,
460 sizeof( struct berval ) * j );
462 /* trim the mods array */
463 ch_free( mods->sml_nvalues );
464 mods->sml_nvalues = NULL;
467 attr->a_nvals = attr->a_vals;
472 snprintf( textbuf, textlen,
473 "attribute '%s' provided more than once",
474 mods->sml_desc->ad_cname.bv_val );
475 return LDAP_TYPE_OR_VALUE_EXISTS;
479 if( mods->sml_values[1].bv_val != NULL ) {
480 /* check for duplicates */
482 MatchingRule *mr = mods->sml_desc->ad_type->sat_equality;
484 /* check if the values we're adding already exist */
485 if( mr == NULL || !mr->smr_match ) {
486 for ( i = 0; mods->sml_bvalues[i].bv_val != NULL; i++ ) {
487 /* test asserted values against themselves */
488 for( j = 0; j < i; j++ ) {
489 if ( bvmatch( &mods->sml_bvalues[i],
490 &mods->sml_bvalues[j] ) ) {
491 /* value exists already */
492 snprintf( textbuf, textlen,
493 "%s: value #%d provided more than once",
494 mods->sml_desc->ad_cname.bv_val, j );
495 return LDAP_TYPE_OR_VALUE_EXISTS;
501 int rc = LDAP_SUCCESS;
504 for ( i = 0; mods->sml_values[i].bv_val != NULL; i++ ) {
505 /* test asserted values against themselves */
506 for( j = 0; j < i; j++ ) {
507 rc = value_match( &match, mods->sml_desc, mr,
508 SLAP_MR_EQUALITY | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX
509 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
510 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
512 ? &mods->sml_nvalues[i]
513 : &mods->sml_values[i],
515 ? &mods->sml_nvalues[j]
516 : &mods->sml_values[j],
518 if ( rc == LDAP_SUCCESS && match == 0 ) {
519 /* value exists already */
520 snprintf( textbuf, textlen,
521 "%s: value #%d provided more than once",
522 mods->sml_desc->ad_cname.bv_val, j );
523 return LDAP_TYPE_OR_VALUE_EXISTS;
527 if ( rc != LDAP_SUCCESS ) {
533 attr = ch_calloc( 1, sizeof(Attribute) );
535 /* move ad to attr structure */
536 attr->a_desc = mods->sml_desc;
538 mods->sml_desc = NULL;
540 /* move values to attr structure */
541 /* should check for duplicates */
544 for ( i = 0; mods->sml_values[i].bv_val; i++ ) ;
545 attr->a_vals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
546 for ( i = 0; mods->sml_values[i].bv_val; i++ )
547 ber_dupbv( &attr->a_vals[i], &mods->sml_values[i] );
548 attr->a_vals[i].bv_len = 0;
549 attr->a_vals[i].bv_val = NULL;
551 attr->a_vals = mods->sml_values;
552 mods->sml_values = NULL;
555 if ( mods->sml_nvalues ) {
558 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ ) ;
559 attr->a_nvals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
560 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ )
561 ber_dupbv( &attr->a_nvals[i], &mods->sml_nvalues[i] );
562 attr->a_nvals[i].bv_len = 0;
563 attr->a_nvals[i].bv_val = NULL;
565 attr->a_nvals = mods->sml_nvalues;
566 mods->sml_nvalues = NULL;
569 attr->a_nvals = attr->a_vals;
573 tail = &attr->a_next;
582 Modifications **mods,
584 char *textbuf, size_t textlen )
586 Modifications *modhead = NULL;
588 Modifications **modtail = &modhead;
590 AttributeDescription *a_new_desc;
595 while ( a_new != NULL ) {
596 a_new_desc = a_new->a_desc;
597 mod = (Modifications *) malloc( sizeof( Modifications ));
599 mod->sml_op = LDAP_MOD_REPLACE;
601 mod->sml_type = a_new_desc->ad_cname;
603 for ( count = 0; a_new->a_vals[count].bv_val; count++ );
605 mod->sml_bvalues = (struct berval*) malloc(
606 (count+1) * sizeof( struct berval) );
608 /* see slap_mods_check() comments...
609 * if a_vals == a_nvals, there is no normalizer.
610 * in this case, mod->sml_nvalues must be left NULL.
612 if ( a_new->a_vals != a_new->a_nvals ) {
613 mod->sml_nvalues = (struct berval*) malloc(
614 (count+1) * sizeof( struct berval) );
616 mod->sml_nvalues = NULL;
619 for ( i = 0; i < count; i++ ) {
620 ber_dupbv(mod->sml_bvalues+i, a_new->a_vals+i);
621 if ( mod->sml_nvalues ) {
622 ber_dupbv( mod->sml_nvalues+i, a_new->a_vals+i );
626 mod->sml_bvalues[count].bv_val = 0;
627 mod->sml_bvalues[count].bv_len = 0;
629 if ( mod->sml_nvalues ) {
630 mod->sml_nvalues[count].bv_val = 0;
631 mod->sml_nvalues[count].bv_len = 0;
634 mod->sml_desc = a_new_desc;
637 modtail = &mod->sml_next;
638 a_new = a_new->a_next;
647 static void init_add_pblock( Operation *op,
648 struct berval *dn, Entry *e, int manageDSAit )
650 slapi_int_pblock_set_operation( op->o_pb, op );
651 slapi_pblock_set( op->o_pb, SLAPI_ADD_TARGET, (void *)dn->bv_val );
652 slapi_pblock_set( op->o_pb, SLAPI_ADD_ENTRY, (void *)e );
653 slapi_pblock_set( op->o_pb, SLAPI_MANAGEDSAIT, (void *)manageDSAit );
656 static int call_add_preop_plugins( Operation *op )
660 rc = slapi_int_call_plugins( op->o_bd, SLAPI_PLUGIN_PRE_ADD_FN, op->o_pb );
663 * A preoperation plugin failure will abort the
667 LDAP_LOG( OPERATION, INFO,
668 "do_add: add preoperation plugin failed\n",
671 Debug(LDAP_DEBUG_TRACE,
672 "do_add: add preoperation plugin failed.\n",
676 if (( slapi_pblock_get( op->o_pb, SLAPI_RESULT_CODE,
677 (void *)&rc ) != 0 ) || rc == LDAP_SUCCESS )
688 static void call_add_postop_plugins( Operation *op )
692 rc = slapi_int_call_plugins( op->o_bd, SLAPI_PLUGIN_POST_ADD_FN, op->o_pb );
695 LDAP_LOG( OPERATION, INFO,
696 "do_add: add postoperation plugin failed\n",
699 Debug(LDAP_DEBUG_TRACE,
700 "do_add: add postoperation plugin failed\n",
705 #endif /* LDAP_SLAPI */