2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1998-2005 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>
36 #include "slapi/slapi.h"
38 static void init_add_pblock( Operation *op, struct berval *dn, Entry *e,
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;
52 Modifications *modlist = NULL;
53 Modifications **modtail = &modlist;
55 char textbuf[ SLAP_TEXT_BUFLEN ];
56 size_t textlen = sizeof( textbuf );
59 Debug( LDAP_DEBUG_TRACE, "do_add\n", 0, 0, 0 );
61 * Parse the add request. It looks like this:
63 * AddRequest := [APPLICATION 14] SEQUENCE {
64 * name DistinguishedName,
65 * attrs SEQUENCE OF SEQUENCE {
67 * values SET OF AttributeValue
73 if ( ber_scanf( ber, "{m", /*}*/ &dn ) == LBER_ERROR ) {
74 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
75 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
76 return SLAPD_DISCONNECT;
79 op->ora_e = (Entry *) ch_calloc( 1, sizeof(Entry) );
81 rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn,
84 if ( rs->sr_err != LDAP_SUCCESS ) {
85 Debug( LDAP_DEBUG_ANY, "do_add: invalid dn (%s)\n", dn.bv_val, 0, 0 );
86 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" );
90 ber_dupbv( &op->ora_e->e_name, &op->o_req_dn );
91 ber_dupbv( &op->ora_e->e_nname, &op->o_req_ndn );
93 Debug( LDAP_DEBUG_ARGS, "do_add: dn (%s)\n", op->ora_e->e_dn, 0, 0 );
96 for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT;
97 tag = ber_next_element( ber, &len, last ) )
102 tmp.sml_nvalues = NULL;
104 rtag = ber_scanf( ber, "{m{W}}", &tmp.sml_type, &tmp.sml_values );
106 if ( rtag == LBER_ERROR ) {
107 Debug( LDAP_DEBUG_ANY, "do_add: decoding error\n", 0, 0, 0 );
108 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
109 rs->sr_err = SLAPD_DISCONNECT;
113 if ( tmp.sml_values == NULL ) {
114 Debug( LDAP_DEBUG_ANY, "no values for type %s\n",
115 tmp.sml_type.bv_val, 0, 0 );
116 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
117 "no values for attribute type" );
121 mod = (Modifications *) ch_malloc( sizeof(Modifications) );
122 mod->sml_op = LDAP_MOD_ADD;
123 mod->sml_next = NULL;
124 mod->sml_desc = NULL;
125 mod->sml_type = tmp.sml_type;
126 mod->sml_values = tmp.sml_values;
127 mod->sml_nvalues = NULL;
130 modtail = &mod->sml_next;
133 if ( ber_scanf( ber, /*{*/ "}") == LBER_ERROR ) {
134 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
135 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
136 rs->sr_err = SLAPD_DISCONNECT;
140 if ( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) {
141 Debug( LDAP_DEBUG_ANY, "do_add: get_ctrls failed\n", 0, 0, 0 );
145 if ( modlist == NULL ) {
146 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
147 "no attributes provided" );
151 Statslog( LDAP_DEBUG_STATS, "%s ADD dn=\"%s\"\n",
152 op->o_log_prefix, op->ora_e->e_name.bv_val, 0, 0, 0 );
154 if ( dn_match( &op->ora_e->e_nname, &slap_empty_bv ) ) {
155 /* protocolError may be a more appropriate error */
156 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
157 "root DSE already exists" );
160 } else if ( dn_match( &op->ora_e->e_nname, &frontendDB->be_schemandn ) ) {
161 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
162 "subschema subentry already exists" );
166 rs->sr_err = slap_mods_check( modlist, &rs->sr_text,
167 textbuf, textlen, NULL );
169 if ( rs->sr_err != LDAP_SUCCESS ) {
170 send_ldap_result( op, rs );
174 /* temporary; remove if not invoking backend function */
175 op->ora_modlist = modlist;
177 op->o_bd = frontendDB;
178 rc = frontendDB->be_add( op, rs );
181 be_entry_release_w( op, op->ora_e );
188 slap_graduate_commit_csn( op );
190 if ( modlist != NULL ) {
191 slap_mods_free( modlist );
193 if ( op->ora_e != NULL ) {
194 entry_free( op->ora_e );
196 op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx );
197 op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx );
203 fe_op_add( Operation *op, SlapReply *rs )
206 Modifications *modlist = op->ora_modlist;
207 Modifications **modtail = &modlist;
211 manageDSAit = get_manageDSAit( op );
214 * We could be serving multiple database backends. Select the
215 * appropriate one, or send a referral to our "referral server"
216 * if we don't hold it.
218 op->o_bd = select_backend( &op->ora_e->e_nname, manageDSAit, 1 );
219 if ( op->o_bd == NULL ) {
220 rs->sr_ref = referral_rewrite( default_referral,
221 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT );
222 if ( !rs->sr_ref ) rs->sr_ref = default_referral;
224 rs->sr_err = LDAP_REFERRAL;
225 op->o_bd = frontendDB;
226 send_ldap_result( op, rs );
229 if ( rs->sr_ref != default_referral ) {
230 ber_bvarray_free( rs->sr_ref );
233 op->o_bd = frontendDB;
234 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
235 "no global superior knowledge" );
241 /* If we've got a glued backend, check the real backend */
243 if ( SLAP_GLUE_INSTANCE( op->o_bd )) {
244 op->o_bd = select_backend( &op->ora_e->e_nname, manageDSAit, 0 );
247 /* check restrictions */
248 if( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) {
249 send_ldap_result( op, rs );
253 /* check for referrals */
254 if( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) {
259 if ( op->o_pb ) init_add_pblock( op, &op->o_req_dn, op->ora_e, manageDSAit );
260 #endif /* LDAP_SLAPI */
263 * do the add if 1 && (2 || 3)
264 * 1) there is an add function implemented in this backend;
265 * 2) this backend is master for what it holds;
266 * 3) it's a replica and the dn supplied is the updatedn.
268 if ( op->o_bd->be_add ) {
269 /* do the update here */
270 int repl_user = be_isupdate( op );
271 #ifndef SLAPD_MULTIMASTER
272 if ( !SLAP_SHADOW(op->o_bd) || repl_user )
275 int update = !BER_BVISEMPTY( &op->o_bd->be_update_ndn );
276 char textbuf[ SLAP_TEXT_BUFLEN ];
277 size_t textlen = sizeof( textbuf );
278 slap_callback cb = { NULL, slap_replog_cb, NULL, NULL };
283 rs->sr_err = slap_mods_no_update_check( modlist,
287 if ( rs->sr_err != LDAP_SUCCESS ) {
288 send_ldap_result( op, rs );
294 /* go to the last mod */
295 for ( modtail = &modlist;
297 modtail = &(*modtail)->sml_next )
299 assert( (*modtail)->sml_op == LDAP_MOD_ADD );
300 assert( (*modtail)->sml_desc != NULL );
303 rs->sr_err = slap_mods_opattrs( op, modlist,
304 modtail, &rs->sr_text,
305 textbuf, textlen, 1 );
306 if ( rs->sr_err != LDAP_SUCCESS ) {
307 send_ldap_result( op, rs );
312 rs->sr_err = slap_mods2entry( modlist, &op->ora_e,
313 repl_user, 0, &rs->sr_text, textbuf, textlen );
314 if ( rs->sr_err != LDAP_SUCCESS ) {
315 send_ldap_result( op, rs );
321 * Call the preoperation plugin here, because the entry
322 * will actually contain something.
325 rs->sr_err = call_add_preop_plugins( op );
326 if ( rs->sr_err != LDAP_SUCCESS ) {
327 /* plugin will have sent result */
331 #endif /* LDAP_SLAPI */
333 #ifdef SLAPD_MULTIMASTER
337 cb.sc_next = op->o_callback;
338 op->o_callback = &cb;
340 rc = op->o_bd->be_add( op, rs );
342 /* NOTE: be_entry_release_w() is
343 * called by do_add(), so that global
344 * overlays on the way back can
345 * at least read the entry */
349 #ifndef SLAPD_MULTIMASTER
351 BerVarray defref = NULL;
354 * SLAPI_ADD_ENTRY will be empty, but this may be acceptable
355 * on replicas (for now, it involves the minimum code intrusion).
358 rs->sr_err = call_add_preop_plugins( op );
359 if ( rs->sr_err != LDAP_SUCCESS ) {
360 /* plugin will have sent result */
364 #endif /* LDAP_SLAPI */
366 defref = op->o_bd->be_update_refs
367 ? op->o_bd->be_update_refs : default_referral;
369 if ( defref != NULL ) {
370 rs->sr_ref = referral_rewrite( defref,
371 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT );
372 if ( rs->sr_ref == NULL ) rs->sr_ref = defref;
373 rs->sr_err = LDAP_REFERRAL;
374 if (!rs->sr_ref) rs->sr_ref = default_referral;
375 send_ldap_result( op, rs );
377 if ( rs->sr_ref != default_referral ) {
378 ber_bvarray_free( rs->sr_ref );
381 send_ldap_error( op, rs,
382 LDAP_UNWILLING_TO_PERFORM,
383 "shadow context; no update referral" );
385 #endif /* SLAPD_MULTIMASTER */
390 rs->sr_err = call_add_preop_plugins( op );
391 if ( rs->sr_err != LDAP_SUCCESS ) {
392 /* plugin will have sent result */
397 Debug( LDAP_DEBUG_ARGS, " do_add: no backend support\n", 0, 0, 0 );
398 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
399 "operation not supported within namingContext" );
403 if ( op->o_pb ) call_add_postop_plugins( op );
404 #endif /* LDAP_SLAPI */
417 char *textbuf, size_t textlen )
419 Attribute **tail = &(*e)->e_attrs;
420 assert( *tail == NULL );
424 for( ; mods != NULL; mods = mods->sml_next ) {
428 assert( mods->sml_op == LDAP_MOD_ADD );
430 assert( mods->sml_desc != NULL );
432 attr = attr_find( (*e)->e_attrs, mods->sml_desc );
435 #define SLURPD_FRIENDLY
436 #ifdef SLURPD_FRIENDLY
440 snprintf( textbuf, textlen,
441 "attribute '%s' provided more than once",
442 mods->sml_desc->ad_cname.bv_val );
443 return LDAP_TYPE_OR_VALUE_EXISTS;
446 for( i=0; attr->a_vals[i].bv_val; i++ ) {
449 for( j=0; mods->sml_values[j].bv_val; j++ ) {
454 attr->a_vals = ch_realloc( attr->a_vals,
455 sizeof( struct berval ) * (i+j) );
457 /* should check for duplicates */
460 for ( j = 0; mods->sml_values[j].bv_val; j++ ) {
461 ber_dupbv( &attr->a_vals[i+j], &mods->sml_values[j] );
463 BER_BVZERO( &attr->a_vals[i+j] );
465 AC_MEMCPY( &attr->a_vals[i], mods->sml_values,
466 sizeof( struct berval ) * j );
467 ch_free( mods->sml_values );
468 mods->sml_values = NULL;
471 if( mods->sml_nvalues ) {
472 attr->a_nvals = ch_realloc( attr->a_nvals,
473 sizeof( struct berval ) * (i+j) );
475 for ( j = 0; mods->sml_nvalues[j].bv_val; j++ ) {
476 ber_dupbv( &attr->a_nvals[i+j], &mods->sml_nvalues[j] );
478 BER_BVZERO( &attr->a_nvals[i+j] );
480 AC_MEMCPY( &attr->a_nvals[i], mods->sml_nvalues,
481 sizeof( struct berval ) * j );
482 ch_free( mods->sml_nvalues );
483 mods->sml_nvalues = NULL;
486 attr->a_nvals = attr->a_vals;
491 snprintf( textbuf, textlen,
492 "attribute '%s' provided more than once",
493 mods->sml_desc->ad_cname.bv_val );
494 return LDAP_TYPE_OR_VALUE_EXISTS;
498 if( mods->sml_values[1].bv_val != NULL ) {
499 /* check for duplicates */
501 MatchingRule *mr = mods->sml_desc->ad_type->sat_equality;
503 /* check if the values we're adding already exist */
504 if( mr == NULL || !mr->smr_match ) {
505 for ( i = 1; mods->sml_values[i].bv_val != NULL; i++ ) {
506 /* test asserted values against themselves */
507 for( j = 0; j < i; j++ ) {
508 if ( bvmatch( &mods->sml_values[i],
509 &mods->sml_values[j] ) )
511 /* value exists already */
512 snprintf( textbuf, textlen,
513 "%s: value #%d provided more than once",
514 mods->sml_desc->ad_cname.bv_val, j );
515 return LDAP_TYPE_OR_VALUE_EXISTS;
524 for ( i = 1; mods->sml_values[i].bv_val != NULL; i++ ) {
525 /* test asserted values against themselves */
526 for( j = 0; j < i; j++ ) {
527 rc = value_match( &match, mods->sml_desc, mr,
529 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX
530 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
531 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
533 ? &mods->sml_nvalues[i]
534 : &mods->sml_values[i],
536 ? &mods->sml_nvalues[j]
537 : &mods->sml_values[j],
540 if ( rc == LDAP_SUCCESS && match == 0 ) {
541 /* value exists already */
542 snprintf( textbuf, textlen,
543 "%s: value #%d provided more than once",
544 mods->sml_desc->ad_cname.bv_val, j );
545 return LDAP_TYPE_OR_VALUE_EXISTS;
547 } else if ( rc != LDAP_SUCCESS ) {
555 attr = ch_calloc( 1, sizeof(Attribute) );
557 /* move ad to attr structure */
558 attr->a_desc = mods->sml_desc;
559 if ( !dup ) mods->sml_desc = NULL;
561 /* move values to attr structure */
562 /* should check for duplicates */
565 for ( i = 0; mods->sml_values[i].bv_val; i++ ) /* EMPTY */;
566 attr->a_vals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
567 for ( i = 0; mods->sml_values[i].bv_val; i++ ) {
568 ber_dupbv( &attr->a_vals[i], &mods->sml_values[i] );
570 BER_BVZERO( &attr->a_vals[i] );
572 attr->a_vals = mods->sml_values;
573 mods->sml_values = NULL;
576 if ( mods->sml_nvalues ) {
579 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ ) /* EMPTY */;
580 attr->a_nvals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
581 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ ) {
582 ber_dupbv( &attr->a_nvals[i], &mods->sml_nvalues[i] );
584 BER_BVZERO( &attr->a_nvals[i] );
586 attr->a_nvals = mods->sml_nvalues;
587 mods->sml_nvalues = NULL;
590 attr->a_nvals = attr->a_vals;
594 tail = &attr->a_next;
605 Modifications **mods,
607 char *textbuf, size_t textlen )
609 Modifications *modhead = NULL;
611 Modifications **modtail = &modhead;
613 AttributeDescription *a_new_desc;
618 while ( a_new != NULL ) {
619 a_new_desc = a_new->a_desc;
620 mod = (Modifications *) malloc( sizeof( Modifications ));
622 mod->sml_op = LDAP_MOD_REPLACE;
624 mod->sml_type = a_new_desc->ad_cname;
626 for ( count = 0; a_new->a_vals[count].bv_val; count++ ) /* EMPTY */;
628 mod->sml_values = (struct berval*) malloc(
629 (count+1) * sizeof( struct berval) );
631 /* see slap_mods_check() comments...
632 * if a_vals == a_nvals, there is no normalizer.
633 * in this case, mod->sml_nvalues must be left NULL.
635 if ( a_new->a_vals != a_new->a_nvals ) {
636 mod->sml_nvalues = (struct berval*) malloc(
637 (count+1) * sizeof( struct berval) );
639 mod->sml_nvalues = NULL;
642 for ( i = 0; i < count; i++ ) {
643 ber_dupbv(mod->sml_values+i, a_new->a_vals+i);
644 if ( mod->sml_nvalues ) {
645 ber_dupbv( mod->sml_nvalues+i, a_new->a_nvals+i );
649 mod->sml_values[count].bv_val = NULL;
650 mod->sml_values[count].bv_len = 0;
652 if ( mod->sml_nvalues ) {
653 mod->sml_nvalues[count].bv_val = NULL;
654 mod->sml_nvalues[count].bv_len = 0;
657 mod->sml_desc = a_new_desc;
660 modtail = &mod->sml_next;
661 a_new = a_new->a_next;
670 static void init_add_pblock( Operation *op,
671 struct berval *dn, Entry *e, int manageDSAit )
673 slapi_int_pblock_set_operation( op->o_pb, op );
674 slapi_pblock_set( op->o_pb, SLAPI_ADD_TARGET, (void *)dn->bv_val );
675 slapi_pblock_set( op->o_pb, SLAPI_ADD_ENTRY, (void *)e );
676 slapi_pblock_set( op->o_pb, SLAPI_MANAGEDSAIT, (void *)manageDSAit );
679 static int call_add_preop_plugins( Operation *op )
683 rc = slapi_int_call_plugins( op->o_bd, SLAPI_PLUGIN_PRE_ADD_FN, op->o_pb );
686 * A preoperation plugin failure will abort the
689 Debug(LDAP_DEBUG_TRACE,
690 "do_add: add preoperation plugin failed.\n",
693 if (( slapi_pblock_get( op->o_pb, SLAPI_RESULT_CODE,
694 (void *)&rc ) != 0 ) || rc == LDAP_SUCCESS )
705 static void call_add_postop_plugins( Operation *op )
709 rc = slapi_int_call_plugins( op->o_bd, SLAPI_PLUGIN_POST_ADD_FN, op->o_pb );
711 Debug(LDAP_DEBUG_TRACE,
712 "do_add: add postoperation plugin failed\n",
716 #endif /* LDAP_SLAPI */