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>
37 do_add( Operation *op, SlapReply *rs )
39 BerElement *ber = op->o_ber;
41 struct berval dn = BER_BVNULL;
44 Modifications *modlist = NULL;
45 Modifications **modtail = &modlist;
47 char textbuf[ SLAP_TEXT_BUFLEN ];
48 size_t textlen = sizeof( textbuf );
51 Debug( LDAP_DEBUG_TRACE, "do_add\n", 0, 0, 0 );
53 * Parse the add request. It looks like this:
55 * AddRequest := [APPLICATION 14] SEQUENCE {
56 * name DistinguishedName,
57 * attrs SEQUENCE OF SEQUENCE {
59 * values SET OF AttributeValue
65 if ( ber_scanf( ber, "{m", /*}*/ &dn ) == LBER_ERROR ) {
66 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
67 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
68 return SLAPD_DISCONNECT;
71 op->ora_e = (Entry *) ch_calloc( 1, sizeof(Entry) );
73 rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn,
76 if ( rs->sr_err != LDAP_SUCCESS ) {
77 Debug( LDAP_DEBUG_ANY, "do_add: invalid dn (%s)\n", dn.bv_val, 0, 0 );
78 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" );
82 ber_dupbv( &op->ora_e->e_name, &op->o_req_dn );
83 ber_dupbv( &op->ora_e->e_nname, &op->o_req_ndn );
85 Debug( LDAP_DEBUG_ARGS, "do_add: dn (%s)\n", op->ora_e->e_dn, 0, 0 );
88 for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT;
89 tag = ber_next_element( ber, &len, last ) )
94 tmp.sml_nvalues = NULL;
96 rtag = ber_scanf( ber, "{m{W}}", &tmp.sml_type, &tmp.sml_values );
98 if ( rtag == LBER_ERROR ) {
99 Debug( LDAP_DEBUG_ANY, "do_add: decoding error\n", 0, 0, 0 );
100 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
101 rs->sr_err = SLAPD_DISCONNECT;
105 if ( tmp.sml_values == NULL ) {
106 Debug( LDAP_DEBUG_ANY, "no values for type %s\n",
107 tmp.sml_type.bv_val, 0, 0 );
108 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
109 "no values for attribute type" );
113 mod = (Modifications *) ch_malloc( sizeof(Modifications) );
114 mod->sml_op = LDAP_MOD_ADD;
116 mod->sml_next = NULL;
117 mod->sml_desc = NULL;
118 mod->sml_type = tmp.sml_type;
119 mod->sml_values = tmp.sml_values;
120 mod->sml_nvalues = NULL;
123 modtail = &mod->sml_next;
126 if ( ber_scanf( ber, /*{*/ "}") == LBER_ERROR ) {
127 Debug( LDAP_DEBUG_ANY, "do_add: ber_scanf failed\n", 0, 0, 0 );
128 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
129 rs->sr_err = SLAPD_DISCONNECT;
133 if ( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) {
134 Debug( LDAP_DEBUG_ANY, "do_add: get_ctrls failed\n", 0, 0, 0 );
138 if ( modlist == NULL ) {
139 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
140 "no attributes provided" );
144 Statslog( LDAP_DEBUG_STATS, "%s ADD dn=\"%s\"\n",
145 op->o_log_prefix, op->ora_e->e_name.bv_val, 0, 0, 0 );
147 if ( dn_match( &op->ora_e->e_nname, &slap_empty_bv ) ) {
148 /* protocolError may be a more appropriate error */
149 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
150 "root DSE already exists" );
153 } else if ( dn_match( &op->ora_e->e_nname, &frontendDB->be_schemandn ) ) {
154 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
155 "subschema subentry already exists" );
159 rs->sr_err = slap_mods_check( modlist, &rs->sr_text,
160 textbuf, textlen, NULL );
162 if ( rs->sr_err != LDAP_SUCCESS ) {
163 send_ldap_result( op, rs );
167 /* temporary; remove if not invoking backend function */
168 op->ora_modlist = modlist;
170 /* call this so global overlays/SLAPI have access to ora_e */
171 rs->sr_err = slap_mods2entry( op->ora_modlist, &op->ora_e,
172 1, 0, &rs->sr_text, textbuf, textlen );
173 if ( rs->sr_err != LDAP_SUCCESS ) {
174 send_ldap_result( op, rs );
178 op->o_bd = frontendDB;
179 rc = frontendDB->be_add( op, rs );
181 if ( op->ora_e != NULL && op->o_private != NULL ) {
182 BackendDB *bd = op->o_bd;
184 op->o_bd = (BackendDB *)op->o_private;
185 op->o_private = NULL;
187 be_entry_release_w( op, op->ora_e );
191 op->o_private = NULL;
196 if ( modlist != NULL ) {
199 if ( rc != 0 && op->ora_e == NULL ) {
203 /* in case of error, free the values as well */
204 slap_mods_free( modlist, freevals );
207 if ( op->ora_e != NULL ) {
208 entry_free( op->ora_e );
210 op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx );
211 op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx );
217 fe_op_add( Operation *op, SlapReply *rs )
220 Modifications *modlist = op->ora_modlist;
221 Modifications **modtail = &modlist;
224 char textbuf[ SLAP_TEXT_BUFLEN ];
225 size_t textlen = sizeof( textbuf );
227 manageDSAit = get_manageDSAit( op );
230 * We could be serving multiple database backends. Select the
231 * appropriate one, or send a referral to our "referral server"
232 * if we don't hold it.
234 op->o_bd = select_backend( &op->ora_e->e_nname, manageDSAit, 1 );
235 if ( op->o_bd == NULL ) {
236 rs->sr_ref = referral_rewrite( default_referral,
237 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT );
238 if ( !rs->sr_ref ) rs->sr_ref = default_referral;
240 rs->sr_err = LDAP_REFERRAL;
241 op->o_bd = frontendDB;
242 send_ldap_result( op, rs );
245 if ( rs->sr_ref != default_referral ) {
246 ber_bvarray_free( rs->sr_ref );
249 op->o_bd = frontendDB;
250 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
251 "no global superior knowledge" );
257 /* If we've got a glued backend, check the real backend */
259 if ( SLAP_GLUE_INSTANCE( op->o_bd )) {
260 op->o_bd = select_backend( &op->ora_e->e_nname, manageDSAit, 0 );
263 /* check restrictions */
264 if( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) {
265 send_ldap_result( op, rs );
269 /* check for referrals */
270 if( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) {
274 rs->sr_err = slap_mods_obsolete_check( op, modlist,
275 &rs->sr_text, textbuf, textlen );
277 if ( rs->sr_err != LDAP_SUCCESS ) {
278 send_ldap_result( op, rs );
283 * do the add if 1 && (2 || 3)
284 * 1) there is an add function implemented in this backend;
285 * 2) this backend is master for what it holds;
286 * 3) it's a replica and the dn supplied is the updatedn.
288 if ( op->o_bd->be_add ) {
289 /* do the update here */
290 int repl_user = be_isupdate( op );
291 #ifndef SLAPD_MULTIMASTER
292 if ( !SLAP_SHADOW(op->o_bd) || repl_user )
295 int update = !BER_BVISEMPTY( &op->o_bd->be_update_ndn );
296 slap_callback cb = { NULL, slap_replog_cb, NULL, NULL };
301 rs->sr_err = slap_mods_no_user_mod_check( op, modlist,
302 &rs->sr_text, textbuf, textlen );
304 if ( rs->sr_err != LDAP_SUCCESS ) {
305 send_ldap_result( op, rs );
311 /* go to the last mod */
312 for ( modtail = &modlist;
314 modtail = &(*modtail)->sml_next )
316 assert( (*modtail)->sml_op == LDAP_MOD_ADD );
317 assert( (*modtail)->sml_desc != NULL );
321 /* check for duplicate values */
322 rs->sr_err = slap_mods_no_repl_user_mod_check( op,
323 modlist, &rs->sr_text, textbuf, textlen );
324 if ( rs->sr_err != LDAP_SUCCESS ) {
325 send_ldap_result( op, rs );
329 rs->sr_err = slap_mods2entry( *modtail, &op->ora_e,
330 0, 0, &rs->sr_text, textbuf, textlen );
331 if ( rs->sr_err != LDAP_SUCCESS ) {
332 send_ldap_result( op, rs );
337 #ifdef SLAPD_MULTIMASTER
341 cb.sc_next = op->o_callback;
342 op->o_callback = &cb;
344 rc = op->o_bd->be_add( op, rs );
345 if ( rc == LDAP_SUCCESS ) {
346 /* NOTE: be_entry_release_w() is
347 * called by do_add(), so that global
348 * overlays on the way back can
349 * at least read the entry */
350 op->o_private = op->o_bd;
353 #ifndef SLAPD_MULTIMASTER
355 BerVarray defref = NULL;
357 defref = op->o_bd->be_update_refs
358 ? op->o_bd->be_update_refs : default_referral;
360 if ( defref != NULL ) {
361 rs->sr_ref = referral_rewrite( defref,
362 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT );
363 if ( rs->sr_ref == NULL ) rs->sr_ref = defref;
364 rs->sr_err = LDAP_REFERRAL;
365 if (!rs->sr_ref) rs->sr_ref = default_referral;
366 send_ldap_result( op, rs );
368 if ( rs->sr_ref != default_referral ) {
369 ber_bvarray_free( rs->sr_ref );
372 send_ldap_error( op, rs,
373 LDAP_UNWILLING_TO_PERFORM,
374 "shadow context; no update referral" );
376 #endif /* SLAPD_MULTIMASTER */
379 Debug( LDAP_DEBUG_ARGS, " do_add: no backend support\n", 0, 0, 0 );
380 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
381 "operation not supported within namingContext" );
395 char *textbuf, size_t textlen )
400 assert( (*e)->e_attrs == NULL );
403 for ( tail = &(*e)->e_attrs; *tail != NULL; tail = &(*tail)->a_next )
408 for( ; mods != NULL; mods = mods->sml_next ) {
411 assert( mods->sml_desc != NULL );
413 attr = attr_find( (*e)->e_attrs, mods->sml_desc );
416 #define SLURPD_FRIENDLY
417 #ifdef SLURPD_FRIENDLY
422 * This check allows overlays to override operational
423 * attributes by setting them directly in the entry.
424 * We assume slap_mods_no_user_mod_check() was called
425 * with the user modifications.
431 for( i=0; attr->a_vals[i].bv_val; i++ ) {
434 for( j=0; mods->sml_values[j].bv_val; j++ ) {
439 attr->a_vals = ch_realloc( attr->a_vals,
440 sizeof( struct berval ) * (i+j) );
442 /* should check for duplicates */
445 for ( j = 0; mods->sml_values[j].bv_val; j++ ) {
446 ber_dupbv( &attr->a_vals[i+j], &mods->sml_values[j] );
448 BER_BVZERO( &attr->a_vals[i+j] );
451 AC_MEMCPY( &attr->a_vals[i], mods->sml_values,
452 sizeof( struct berval ) * j );
455 if( mods->sml_nvalues ) {
456 attr->a_nvals = ch_realloc( attr->a_nvals,
457 sizeof( struct berval ) * (i+j) );
459 for ( j = 0; mods->sml_nvalues[j].bv_val; j++ ) {
460 ber_dupbv( &attr->a_nvals[i+j], &mods->sml_nvalues[j] );
462 BER_BVZERO( &attr->a_nvals[i+j] );
464 AC_MEMCPY( &attr->a_nvals[i], mods->sml_nvalues,
465 sizeof( struct berval ) * j );
468 attr->a_nvals = attr->a_vals;
473 snprintf( textbuf, textlen,
474 "attribute '%s' provided more than once",
475 mods->sml_desc->ad_cname.bv_val );
476 return LDAP_TYPE_OR_VALUE_EXISTS;
480 if( mods->sml_values[1].bv_val != NULL ) {
481 /* check for duplicates */
483 MatchingRule *mr = mods->sml_desc->ad_type->sat_equality;
485 for ( i = 1; mods->sml_values[i].bv_val != NULL; i++ ) {
486 /* test asserted values against themselves */
487 for( j = 0; j < i; j++ ) {
488 rc = ordered_value_match( &match, mods->sml_desc, mr,
490 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX
491 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
492 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
494 ? &mods->sml_nvalues[i]
495 : &mods->sml_values[i],
497 ? &mods->sml_nvalues[j]
498 : &mods->sml_values[j],
501 if ( rc == LDAP_SUCCESS && match == 0 ) {
502 /* value exists already */
503 snprintf( textbuf, textlen,
504 "%s: value #%d provided more than once",
505 mods->sml_desc->ad_cname.bv_val, j );
506 return LDAP_TYPE_OR_VALUE_EXISTS;
508 } else if ( rc != LDAP_SUCCESS ) {
515 attr = ch_calloc( 1, sizeof(Attribute) );
517 /* move ad to attr structure */
518 attr->a_desc = mods->sml_desc;
520 /* move values to attr structure */
521 /* should check for duplicates */
524 for ( i = 0; mods->sml_values[i].bv_val; i++ ) /* EMPTY */;
525 attr->a_vals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
526 for ( i = 0; mods->sml_values[i].bv_val; i++ ) {
527 ber_dupbv( &attr->a_vals[i], &mods->sml_values[i] );
529 BER_BVZERO( &attr->a_vals[i] );
531 attr->a_vals = mods->sml_values;
534 if ( mods->sml_nvalues ) {
537 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ ) /* EMPTY */;
538 attr->a_nvals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
539 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ ) {
540 ber_dupbv( &attr->a_nvals[i], &mods->sml_nvalues[i] );
542 BER_BVZERO( &attr->a_nvals[i] );
544 attr->a_nvals = mods->sml_nvalues;
547 attr->a_nvals = attr->a_vals;
551 tail = &attr->a_next;
562 Modifications **mods,
564 char *textbuf, size_t textlen )
566 Modifications *modhead = NULL;
568 Modifications **modtail = &modhead;
570 AttributeDescription *a_new_desc;
575 while ( a_new != NULL ) {
576 a_new_desc = a_new->a_desc;
577 mod = (Modifications *) malloc( sizeof( Modifications ));
579 mod->sml_op = LDAP_MOD_REPLACE;
582 mod->sml_type = a_new_desc->ad_cname;
584 for ( count = 0; a_new->a_vals[count].bv_val; count++ ) /* EMPTY */;
586 mod->sml_values = (struct berval*) malloc(
587 (count+1) * sizeof( struct berval) );
589 /* see slap_mods_check() comments...
590 * if a_vals == a_nvals, there is no normalizer.
591 * in this case, mod->sml_nvalues must be left NULL.
593 if ( a_new->a_vals != a_new->a_nvals ) {
594 mod->sml_nvalues = (struct berval*) malloc(
595 (count+1) * sizeof( struct berval) );
597 mod->sml_nvalues = NULL;
600 for ( i = 0; i < count; i++ ) {
601 ber_dupbv(mod->sml_values+i, a_new->a_vals+i);
602 if ( mod->sml_nvalues ) {
603 ber_dupbv( mod->sml_nvalues+i, a_new->a_nvals+i );
607 mod->sml_values[count].bv_val = NULL;
608 mod->sml_values[count].bv_len = 0;
610 if ( mod->sml_nvalues ) {
611 mod->sml_nvalues[count].bv_val = NULL;
612 mod->sml_nvalues[count].bv_len = 0;
615 mod->sml_desc = a_new_desc;
618 modtail = &mod->sml_next;
619 a_new = a_new->a_next;
627 int slap_add_opattrs(
634 struct berval name, timestamp, csn = BER_BVNULL;
635 struct berval nname, tmp;
636 char timebuf[ LDAP_LUTIL_GENTIME_BUFSIZE ];
637 char csnbuf[ LDAP_LUTIL_CSNSTR_BUFSIZE ];
640 a = attr_find( op->ora_e->e_attrs,
641 slap_schema.si_ad_structuralObjectClass );
647 oc = attr_find( op->ora_e->e_attrs, slap_schema.si_ad_objectClass );
649 rc = structural_class( oc->a_vals, &tmp, NULL, text,
651 if( rc != LDAP_SUCCESS ) return rc;
653 attr_merge_one( op->ora_e, slap_schema.si_ad_structuralObjectClass,
658 if ( SLAP_LASTMOD( op->o_bd ) ) {
660 timestamp.bv_val = timebuf;
661 if ( BER_BVISEMPTY( &op->o_csn )) {
662 if ( SLAP_SHADOW( op->o_bd ))
665 csn.bv_len = sizeof(csnbuf);
666 slap_get_csn( op, &csn, manage_ctxcsn );
670 ptr = strchr( csn.bv_val, '#' );
672 timestamp.bv_len = ptr - csn.bv_val;
673 if ( timestamp.bv_len >= sizeof(timebuf) )
674 timestamp.bv_len = sizeof(timebuf) - 1;
675 strncpy( timebuf, csn.bv_val, timestamp.bv_len );
676 timebuf[timestamp.bv_len] = '\0';
678 time_t now = slap_get_time();
680 timestamp.bv_len = sizeof(timebuf);
682 slap_timestamp( &now, ×tamp );
685 if ( BER_BVISEMPTY( &op->o_dn ) ) {
686 BER_BVSTR( &name, SLAPD_ANONYMOUS );
693 a = attr_find( op->ora_e->e_attrs,
694 slap_schema.si_ad_entryUUID );
696 char uuidbuf[ LDAP_LUTIL_UUIDSTR_BUFSIZE ];
698 tmp.bv_len = lutil_uuidstr( uuidbuf, sizeof( uuidbuf ) );
699 tmp.bv_val = uuidbuf;
701 attr_merge_normalize_one( op->ora_e,
702 slap_schema.si_ad_entryUUID, &tmp, op->o_tmpmemctx );
705 a = attr_find( op->ora_e->e_attrs,
706 slap_schema.si_ad_creatorsName );
708 attr_merge_one( op->ora_e,
709 slap_schema.si_ad_creatorsName, &name, &nname );
712 a = attr_find( op->ora_e->e_attrs,
713 slap_schema.si_ad_createTimestamp );
715 attr_merge_one( op->ora_e,
716 slap_schema.si_ad_createTimestamp, ×tamp, NULL );
719 a = attr_find( op->ora_e->e_attrs,
720 slap_schema.si_ad_entryCSN );
722 attr_merge_one( op->ora_e,
723 slap_schema.si_ad_entryCSN, &csn, NULL );
726 a = attr_find( op->ora_e->e_attrs,
727 slap_schema.si_ad_modifiersName );
729 attr_merge_one( op->ora_e,
730 slap_schema.si_ad_modifiersName, &name, &nname );
733 a = attr_find( op->ora_e->e_attrs,
734 slap_schema.si_ad_modifyTimestamp );
736 attr_merge_one( op->ora_e,
737 slap_schema.si_ad_modifyTimestamp, ×tamp, NULL );