2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1998-2018 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 );
53 Debug( LDAP_DEBUG_TRACE, "%s do_add\n",
54 op->o_log_prefix, 0, 0 );
57 * Parse the add request. It looks like this:
59 * AddRequest := [APPLICATION 14] SEQUENCE {
60 * name DistinguishedName,
61 * attrs SEQUENCE OF SEQUENCE {
63 * values SET OF AttributeValue
69 if ( ber_scanf( ber, "{m", /*}*/ &dn ) == LBER_ERROR ) {
70 Debug( LDAP_DEBUG_ANY, "%s do_add: ber_scanf failed\n",
71 op->o_log_prefix, 0, 0 );
72 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
73 return SLAPD_DISCONNECT;
76 Debug( LDAP_DEBUG_ARGS, "%s do_add: dn (%s)\n",
77 op->o_log_prefix, dn.bv_val, 0 );
80 for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT;
81 tag = ber_next_element( ber, &len, last ) )
86 tmp.sml_nvalues = NULL;
88 rtag = ber_scanf( ber, "{m{W}}", &tmp.sml_type, &tmp.sml_values );
90 if ( rtag == LBER_ERROR ) {
91 Debug( LDAP_DEBUG_ANY, "%s do_add: decoding error\n",
92 op->o_log_prefix, 0, 0 );
93 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
94 rs->sr_err = SLAPD_DISCONNECT;
98 if ( tmp.sml_values == NULL ) {
99 Debug( LDAP_DEBUG_ANY, "%s do_add: no values for type %s\n",
100 op->o_log_prefix, tmp.sml_type.bv_val, 0 );
101 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
102 "no values for attribute type" );
106 mod = (Modifications *) ch_malloc( sizeof(Modifications) );
107 mod->sml_op = LDAP_MOD_ADD;
109 mod->sml_next = NULL;
110 mod->sml_desc = NULL;
111 mod->sml_type = tmp.sml_type;
112 mod->sml_values = tmp.sml_values;
113 mod->sml_nvalues = NULL;
116 modtail = &mod->sml_next;
119 if ( ber_scanf( ber, /*{*/ "}") == LBER_ERROR ) {
120 Debug( LDAP_DEBUG_ANY, "%s do_add: ber_scanf failed\n",
121 op->o_log_prefix, 0, 0 );
122 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
123 rs->sr_err = SLAPD_DISCONNECT;
127 if ( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) {
128 Debug( LDAP_DEBUG_ANY, "%s do_add: get_ctrls failed\n",
129 op->o_log_prefix, 0, 0 );
133 rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn,
136 if ( rs->sr_err != LDAP_SUCCESS ) {
137 Debug( LDAP_DEBUG_ANY, "%s do_add: invalid dn (%s)\n",
138 op->o_log_prefix, dn.bv_val, 0 );
139 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" );
143 op->ora_e = entry_alloc();
144 ber_dupbv( &op->ora_e->e_name, &op->o_req_dn );
145 ber_dupbv( &op->ora_e->e_nname, &op->o_req_ndn );
147 Statslog( LDAP_DEBUG_STATS, "%s ADD dn=\"%s\"\n",
148 op->o_log_prefix, op->o_req_dn.bv_val, 0, 0, 0 );
150 if ( modlist == NULL ) {
151 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
152 "no attributes provided" );
156 if ( dn_match( &op->ora_e->e_nname, &slap_empty_bv ) ) {
157 /* protocolError may be a more appropriate error */
158 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
159 "root DSE already exists" );
162 } else if ( dn_match( &op->ora_e->e_nname, &frontendDB->be_schemandn ) ) {
163 send_ldap_error( op, rs, LDAP_ALREADY_EXISTS,
164 "subschema subentry already exists" );
168 rs->sr_err = slap_mods_check( op, modlist, &rs->sr_text,
169 textbuf, textlen, NULL );
171 if ( rs->sr_err != LDAP_SUCCESS ) {
172 send_ldap_result( op, rs );
176 /* temporary; remove if not invoking backend function */
177 op->ora_modlist = modlist;
179 /* call this so global overlays/SLAPI have access to ora_e */
180 rs->sr_err = slap_mods2entry( op->ora_modlist, &op->ora_e,
181 1, 0, &rs->sr_text, textbuf, textlen );
182 if ( rs->sr_err != LDAP_SUCCESS ) {
183 send_ldap_result( op, rs );
188 oex = op->o_tmpalloc( sizeof(OpExtraDB), op->o_tmpmemctx );
189 oex->oe.oe_key = (void *)do_add;
191 LDAP_SLIST_INSERT_HEAD(&op->o_extra, &oex->oe, oe_next);
193 op->o_bd = frontendDB;
194 rc = frontendDB->be_add( op, rs );
196 if ( rc == SLAPD_ASYNCOP ) {
201 LDAP_SLIST_REMOVE(&op->o_extra, &oex->oe, OpExtra, oe_next);
203 if ( rc == LDAP_X_TXN_SPECIFY_OKAY ) {
209 if ( op->ora_e != NULL && oex->oe_db != NULL ) {
210 BackendDB *bd = op->o_bd;
212 op->o_bd = oex->oe_db;
214 be_entry_release_w( op, op->ora_e );
220 op->o_tmpfree( oex, op->o_tmpmemctx );
223 if ( modlist != NULL ) {
224 /* in case of error, free the values as well */
225 slap_mods_free( modlist, freevals );
228 if ( op->ora_e != NULL ) {
229 entry_free( op->ora_e );
231 op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx );
232 op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx );
238 fe_op_add( Operation *op, SlapReply *rs )
240 Modifications **modtail = &op->ora_modlist;
242 BackendDB *op_be, *bd = op->o_bd;
243 char textbuf[ SLAP_TEXT_BUFLEN ];
244 size_t textlen = sizeof( textbuf );
247 * We could be serving multiple database backends. Select the
248 * appropriate one, or send a referral to our "referral server"
249 * if we don't hold it.
251 op->o_bd = select_backend( &op->ora_e->e_nname, 1 );
252 if ( op->o_bd == NULL ) {
254 rs->sr_ref = referral_rewrite( default_referral,
255 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT );
256 if ( !rs->sr_ref ) rs->sr_ref = default_referral;
258 rs->sr_err = LDAP_REFERRAL;
259 send_ldap_result( op, rs );
261 if ( rs->sr_ref != default_referral ) {
262 ber_bvarray_free( rs->sr_ref );
265 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
266 "no global superior knowledge" );
271 /* If we've got a glued backend, check the real backend */
273 if ( SLAP_GLUE_INSTANCE( op->o_bd )) {
274 op->o_bd = select_backend( &op->ora_e->e_nname, 0 );
277 /* check restrictions */
278 if( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) {
279 send_ldap_result( op, rs );
283 /* check for referrals */
284 if( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) {
288 rs->sr_err = slap_mods_obsolete_check( op, op->ora_modlist,
289 &rs->sr_text, textbuf, textlen );
291 if ( rs->sr_err != LDAP_SUCCESS ) {
292 send_ldap_result( op, rs );
297 * do the add if 1 && (2 || 3)
298 * 1) there is an add function implemented in this backend;
299 * 2) this backend is master for what it holds;
300 * 3) it's a replica and the dn supplied is the updatedn.
302 if ( op->o_bd->be_add ) {
303 /* do the update here */
304 int repl_user = be_isupdate( op );
305 if ( !SLAP_SINGLE_SHADOW(op->o_bd) || repl_user ) {
306 int update = !BER_BVISEMPTY( &op->o_bd->be_update_ndn );
311 rs->sr_err = slap_mods_no_user_mod_check( op, op->ora_modlist,
312 &rs->sr_text, textbuf, textlen );
314 if ( rs->sr_err != LDAP_SUCCESS ) {
315 send_ldap_result( op, rs );
321 /* go to the last mod */
322 for ( modtail = &op->ora_modlist;
324 modtail = &(*modtail)->sml_next )
326 assert( (*modtail)->sml_op == LDAP_MOD_ADD );
327 assert( (*modtail)->sml_desc != NULL );
331 /* check for unmodifiable attributes */
332 rs->sr_err = slap_mods_no_repl_user_mod_check( op,
333 op->ora_modlist, &rs->sr_text, textbuf, textlen );
334 if ( rs->sr_err != LDAP_SUCCESS ) {
335 send_ldap_result( op, rs );
340 rc = op->o_bd->be_add( op, rs );
341 if ( rc == LDAP_SUCCESS ) {
343 /* NOTE: be_entry_release_w() is
344 * called by do_add(), so that global
345 * overlays on the way back can
346 * at least read the entry */
347 LDAP_SLIST_FOREACH(oex, &op->o_extra, oe_next) {
348 if ( oex->oe_key == (void *)do_add ) {
349 ((OpExtraDB *)oex)->oe_db = op->o_bd;
356 BerVarray defref = NULL;
358 defref = op->o_bd->be_update_refs
359 ? op->o_bd->be_update_refs : default_referral;
361 if ( defref != NULL ) {
362 rs->sr_ref = referral_rewrite( defref,
363 NULL, &op->ora_e->e_name, LDAP_SCOPE_DEFAULT );
364 if ( rs->sr_ref == NULL ) rs->sr_ref = defref;
365 rs->sr_err = LDAP_REFERRAL;
366 if (!rs->sr_ref) rs->sr_ref = default_referral;
367 send_ldap_result( op, rs );
369 if ( rs->sr_ref != default_referral ) {
370 ber_bvarray_free( rs->sr_ref );
373 send_ldap_error( op, rs,
374 LDAP_UNWILLING_TO_PERFORM,
375 "shadow context; no update referral" );
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" );
396 char *textbuf, size_t textlen )
402 assert( (*e)->e_attrs == NULL );
405 for ( tail = &(*e)->e_attrs; *tail != NULL; tail = &(*tail)->a_next )
410 for( ; mods != NULL; mods = mods->sml_next ) {
413 assert( mods->sml_desc != NULL );
415 attr = attr_find( (*e)->e_attrs, mods->sml_desc );
418 #define SLURPD_FRIENDLY
419 #ifdef SLURPD_FRIENDLY
424 * This check allows overlays to override operational
425 * attributes by setting them directly in the entry.
426 * We assume slap_mods_no_user_mod_check() was called
427 * with the user modifications.
434 j = mods->sml_numvals;
435 attr->a_numvals += j;
438 attr->a_vals = ch_realloc( attr->a_vals,
439 sizeof( struct berval ) * (i+j) );
441 /* checked for duplicates in slap_mods_check */
444 for ( j = 0; mods->sml_values[j].bv_val; j++ ) {
445 ber_dupbv( &attr->a_vals[i+j], &mods->sml_values[j] );
447 BER_BVZERO( &attr->a_vals[i+j] );
450 AC_MEMCPY( &attr->a_vals[i], mods->sml_values,
451 sizeof( struct berval ) * j );
454 if( mods->sml_nvalues ) {
455 attr->a_nvals = ch_realloc( attr->a_nvals,
456 sizeof( struct berval ) * (i+j) );
458 for ( j = 0; mods->sml_nvalues[j].bv_val; j++ ) {
459 ber_dupbv( &attr->a_nvals[i+j], &mods->sml_nvalues[j] );
461 BER_BVZERO( &attr->a_nvals[i+j] );
463 AC_MEMCPY( &attr->a_nvals[i], mods->sml_nvalues,
464 sizeof( struct berval ) * j );
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 );
476 return LDAP_TYPE_OR_VALUE_EXISTS;
480 attr = attr_alloc( mods->sml_desc );
482 /* move values to attr structure */
483 i = mods->sml_numvals;
484 attr->a_numvals = mods->sml_numvals;
486 attr->a_vals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
487 for ( i = 0; mods->sml_values[i].bv_val; i++ ) {
488 ber_dupbv( &attr->a_vals[i], &mods->sml_values[i] );
490 BER_BVZERO( &attr->a_vals[i] );
492 attr->a_vals = mods->sml_values;
495 if ( mods->sml_nvalues ) {
497 i = mods->sml_numvals;
498 attr->a_nvals = (BerVarray) ch_calloc( i+1, sizeof( BerValue ));
499 for ( i = 0; mods->sml_nvalues[i].bv_val; i++ ) {
500 ber_dupbv( &attr->a_nvals[i], &mods->sml_nvalues[i] );
502 BER_BVZERO( &attr->a_nvals[i] );
504 attr->a_nvals = mods->sml_nvalues;
507 attr->a_nvals = attr->a_vals;
511 tail = &attr->a_next;
522 Modifications **mods,
524 char *textbuf, size_t textlen )
526 Modifications *modhead = NULL;
528 Modifications **modtail = &modhead;
530 AttributeDescription *a_new_desc;
535 while ( a_new != NULL ) {
536 a_new_desc = a_new->a_desc;
537 mod = (Modifications *) ch_malloc( sizeof( Modifications ));
539 mod->sml_op = LDAP_MOD_REPLACE;
542 mod->sml_type = a_new_desc->ad_cname;
544 count = a_new->a_numvals;
545 mod->sml_numvals = a_new->a_numvals;
547 mod->sml_values = (struct berval*) ch_malloc(
548 (count+1) * sizeof( struct berval) );
550 /* see slap_mods_check() comments...
551 * if a_vals == a_nvals, there is no normalizer.
552 * in this case, mod->sml_nvalues must be left NULL.
554 if ( a_new->a_vals != a_new->a_nvals ) {
555 mod->sml_nvalues = (struct berval*) ch_malloc(
556 (count+1) * sizeof( struct berval) );
558 mod->sml_nvalues = NULL;
561 for ( i = 0; i < count; i++ ) {
562 ber_dupbv(mod->sml_values+i, a_new->a_vals+i);
563 if ( mod->sml_nvalues ) {
564 ber_dupbv( mod->sml_nvalues+i, a_new->a_nvals+i );
568 mod->sml_values[count].bv_val = NULL;
569 mod->sml_values[count].bv_len = 0;
571 if ( mod->sml_nvalues ) {
572 mod->sml_nvalues[count].bv_val = NULL;
573 mod->sml_nvalues[count].bv_len = 0;
576 mod->sml_desc = a_new_desc;
579 modtail = &mod->sml_next;
580 a_new = a_new->a_next;
588 int slap_add_opattrs(
595 struct berval name, timestamp, csn = BER_BVNULL;
596 struct berval nname, tmp;
597 char timebuf[ LDAP_LUTIL_GENTIME_BUFSIZE ];
598 char csnbuf[ LDAP_PVT_CSNSTR_BUFSIZE ];
601 if ( SLAP_LASTMOD( op->o_bd ) ) {
605 timestamp.bv_val = timebuf;
606 a = attr_find( op->ora_e->e_attrs, slap_schema.si_ad_entryCSN );
611 if ( BER_BVISEMPTY( &op->o_csn )) {
614 csn.bv_len = sizeof(csnbuf);
615 slap_get_csn( op, &csn, manage_ctxcsn );
618 slap_queue_csn( op, &csn );
623 ptr = ber_bvchr( &csn, '#' );
625 timestamp.bv_len = STRLENOF("YYYYMMDDHHMMSSZ");
626 AC_MEMCPY( timebuf, csn.bv_val, timestamp.bv_len );
627 timebuf[timestamp.bv_len-1] = 'Z';
628 timebuf[timestamp.bv_len] = '\0';
630 time_t now = slap_get_time();
632 timestamp.bv_len = sizeof(timebuf);
634 slap_timestamp( &now, ×tamp );
637 if ( BER_BVISEMPTY( &op->o_dn ) ) {
638 BER_BVSTR( &name, SLAPD_ANONYMOUS );
645 a = attr_find( op->ora_e->e_attrs,
646 slap_schema.si_ad_entryUUID );
648 char uuidbuf[ LDAP_LUTIL_UUIDSTR_BUFSIZE ];
650 tmp.bv_len = lutil_uuidstr( uuidbuf, sizeof( uuidbuf ) );
651 tmp.bv_val = uuidbuf;
653 attr_merge_normalize_one( op->ora_e,
654 slap_schema.si_ad_entryUUID, &tmp, op->o_tmpmemctx );
657 a = attr_find( op->ora_e->e_attrs,
658 slap_schema.si_ad_creatorsName );
660 attr_merge_one( op->ora_e,
661 slap_schema.si_ad_creatorsName, &name, &nname );
664 a = attr_find( op->ora_e->e_attrs,
665 slap_schema.si_ad_createTimestamp );
667 attr_merge_one( op->ora_e,
668 slap_schema.si_ad_createTimestamp, ×tamp, NULL );
672 attr_merge_one( op->ora_e,
673 slap_schema.si_ad_entryCSN, &csn, NULL );
676 a = attr_find( op->ora_e->e_attrs,
677 slap_schema.si_ad_modifiersName );
679 attr_merge_one( op->ora_e,
680 slap_schema.si_ad_modifiersName, &name, &nname );
683 a = attr_find( op->ora_e->e_attrs,
684 slap_schema.si_ad_modifyTimestamp );
686 attr_merge_one( op->ora_e,
687 slap_schema.si_ad_modifyTimestamp, ×tamp, NULL );