2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1998-2007 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.
30 #include <ac/socket.h>
31 #include <ac/string.h>
43 struct berval dn = BER_BVNULL;
44 char textbuf[ SLAP_TEXT_BUFLEN ];
45 size_t textlen = sizeof( textbuf );
50 Debug( LDAP_DEBUG_TRACE, "%s do_modify\n",
51 op->o_log_prefix, 0, 0 );
53 * Parse the modify request. It looks like this:
55 * ModifyRequest := [APPLICATION 6] SEQUENCE {
56 * name DistinguishedName,
57 * mods SEQUENCE OF SEQUENCE {
58 * operation ENUMERATED {
63 * modification SEQUENCE {
65 * values SET OF AttributeValue
71 if ( ber_scanf( op->o_ber, "{m" /*}*/, &dn ) == LBER_ERROR ) {
72 Debug( LDAP_DEBUG_ANY, "%s do_modify: ber_scanf failed\n",
73 op->o_log_prefix, 0, 0 );
74 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
75 return SLAPD_DISCONNECT;
78 Debug( LDAP_DEBUG_ARGS, "%s do_modify: dn (%s)\n",
79 op->o_log_prefix, dn.bv_val, 0 );
81 rs->sr_err = slap_parse_modlist( op, rs, op->o_ber, &op->oq_modify );
82 if ( rs->sr_err != LDAP_SUCCESS ) {
83 Debug( LDAP_DEBUG_ANY, "%s do_modify: slap_parse_modlist failed err=%d msg=%s\n",
84 op->o_log_prefix, rs->sr_err, rs->sr_text );
88 if( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) {
89 Debug( LDAP_DEBUG_ANY, "%s do_modify: get_ctrls failed\n",
90 op->o_log_prefix, 0, 0 );
94 rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn,
96 if( rs->sr_err != LDAP_SUCCESS ) {
97 Debug( LDAP_DEBUG_ANY, "%s do_modify: invalid dn (%s)\n",
98 op->o_log_prefix, dn.bv_val, 0 );
99 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" );
103 op->orm_no_opattrs = 0;
106 Debug( LDAP_DEBUG_ARGS, "%s modifications:\n",
107 op->o_log_prefix, 0, 0 );
109 for ( tmp = op->orm_modlist; tmp != NULL; tmp = tmp->sml_next ) {
110 Debug( LDAP_DEBUG_ARGS, "\t%s: %s\n",
111 tmp->sml_op == LDAP_MOD_ADD ? "add" :
112 (tmp->sml_op == LDAP_MOD_INCREMENT ? "increment" :
113 (tmp->sml_op == LDAP_MOD_DELETE ? "delete" :
114 "replace")), tmp->sml_type.bv_val, 0 );
116 if ( tmp->sml_values == NULL ) {
117 Debug( LDAP_DEBUG_ARGS, "%s\n",
118 "\t\tno values", NULL, NULL );
119 } else if ( BER_BVISNULL( &tmp->sml_values[ 0 ] ) ) {
120 Debug( LDAP_DEBUG_ARGS, "%s\n",
121 "\t\tzero values", NULL, NULL );
122 } else if ( BER_BVISNULL( &tmp->sml_values[ 1 ] ) ) {
123 Debug( LDAP_DEBUG_ARGS, "%s, length %ld\n",
124 "\t\tone value", (long) tmp->sml_values[0].bv_len, NULL );
126 Debug( LDAP_DEBUG_ARGS, "%s\n",
127 "\t\tmultiple values", NULL, NULL );
131 if ( StatslogTest( LDAP_DEBUG_STATS ) ) {
132 char abuf[BUFSIZ/2], *ptr = abuf;
135 Statslog( LDAP_DEBUG_STATS, "%s MOD dn=\"%s\"\n",
136 op->o_log_prefix, op->o_req_dn.bv_val, 0, 0, 0 );
138 for ( tmp = op->orm_modlist; tmp != NULL; tmp = tmp->sml_next ) {
139 if (len + 1 + tmp->sml_type.bv_len > sizeof(abuf)) {
140 Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
141 op->o_log_prefix, abuf, 0, 0, 0 );
146 if( 1 + tmp->sml_type.bv_len > sizeof(abuf)) {
147 Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
148 op->o_log_prefix, tmp->sml_type.bv_val, 0, 0, 0 );
156 ptr = lutil_strcopy(ptr, tmp->sml_type.bv_val);
157 len += tmp->sml_type.bv_len;
160 Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
161 op->o_log_prefix, abuf, 0, 0, 0 );
164 #endif /* LDAP_DEBUG */
166 rs->sr_err = slap_mods_check( op, op->orm_modlist,
167 &rs->sr_text, textbuf, textlen, NULL );
169 if ( rs->sr_err != LDAP_SUCCESS ) {
170 send_ldap_result( op, rs );
174 op->o_bd = frontendDB;
175 rs->sr_err = frontendDB->be_modify( op, rs );
178 if( rs->sr_err == LDAP_X_TXN_SPECIFY_OKAY ) {
185 op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx );
186 op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx );
187 if ( op->orm_modlist != NULL ) slap_mods_free( op->orm_modlist, 1 );
193 fe_op_modify( Operation *op, SlapReply *rs )
195 BackendDB *op_be, *bd = op->o_bd;
196 char textbuf[ SLAP_TEXT_BUFLEN ];
197 size_t textlen = sizeof( textbuf );
199 if ( BER_BVISEMPTY( &op->o_req_ndn ) ) {
200 Debug( LDAP_DEBUG_ANY, "%s do_modify: root dse!\n",
201 op->o_log_prefix, 0, 0 );
202 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
203 "modify upon the root DSE not supported" );
206 } else if ( bvmatch( &op->o_req_ndn, &frontendDB->be_schemandn ) ) {
207 Debug( LDAP_DEBUG_ANY, "%s do_modify: subschema subentry!\n",
208 op->o_log_prefix, 0, 0 );
209 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
210 "modification of subschema subentry not supported" );
215 * We could be serving multiple database backends. Select the
216 * appropriate one, or send a referral to our "referral server"
217 * if we don't hold it.
219 op->o_bd = select_backend( &op->o_req_ndn, 1 );
220 if ( op->o_bd == NULL ) {
222 rs->sr_ref = referral_rewrite( default_referral,
223 NULL, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
225 rs->sr_ref = default_referral;
228 if ( rs->sr_ref != NULL ) {
229 rs->sr_err = LDAP_REFERRAL;
230 send_ldap_result( op, rs );
232 if ( rs->sr_ref != default_referral ) {
233 ber_bvarray_free( rs->sr_ref );
237 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
238 "no global superior knowledge" );
243 /* If we've got a glued backend, check the real backend */
245 if ( SLAP_GLUE_INSTANCE( op->o_bd )) {
246 op->o_bd = select_backend( &op->o_req_ndn, 0 );
249 /* check restrictions */
250 if ( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) {
251 send_ldap_result( op, rs );
255 /* check for referrals */
256 if ( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) {
260 rs->sr_err = slap_mods_obsolete_check( op, op->orm_modlist,
261 &rs->sr_text, textbuf, textlen );
262 if ( rs->sr_err != LDAP_SUCCESS ) {
263 send_ldap_result( op, rs );
267 /* check for modify/increment support */
268 if ( op->orm_increment && !SLAP_INCREMENT( op->o_bd ) ) {
269 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
270 "modify/increment not supported in context" );
274 * do the modify if 1 && (2 || 3)
275 * 1) there is a modify function implemented in this backend;
276 * 2) this backend is master for what it holds;
277 * 3) it's a replica and the dn supplied is the update_ndn.
279 if ( op->o_bd->be_modify ) {
280 /* do the update here */
281 int repl_user = be_isupdate( op );
284 * Multimaster slapd does not have to check for replicator dn
285 * because it accepts each modify request
287 if ( !SLAP_SINGLE_SHADOW(op->o_bd) || repl_user ) {
288 int update = !BER_BVISEMPTY( &op->o_bd->be_update_ndn );
293 rs->sr_err = slap_mods_no_user_mod_check( op, op->orm_modlist,
294 &rs->sr_text, textbuf, textlen );
295 if ( rs->sr_err != LDAP_SUCCESS ) {
296 send_ldap_result( op, rs );
300 op->o_bd->be_modify( op, rs );
302 } else { /* send a referral */
303 BerVarray defref = op->o_bd->be_update_refs
304 ? op->o_bd->be_update_refs : default_referral;
305 if ( defref != NULL ) {
306 rs->sr_ref = referral_rewrite( defref,
308 LDAP_SCOPE_DEFAULT );
309 if ( rs->sr_ref == NULL ) {
310 /* FIXME: must duplicate, because
311 * overlays may muck with it */
314 rs->sr_err = LDAP_REFERRAL;
315 send_ldap_result( op, rs );
316 if ( rs->sr_ref != defref ) {
317 ber_bvarray_free( rs->sr_ref );
321 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
322 "shadow context; no update referral" );
327 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
328 "operation not supported within namingContext" );
337 * Obsolete constraint checking.
340 slap_mods_obsolete_check(
347 if( get_relax( op ) ) return LDAP_SUCCESS;
349 for ( ; ml != NULL; ml = ml->sml_next ) {
350 if ( is_at_obsolete( ml->sml_desc->ad_type ) &&
351 (( ml->sml_op != LDAP_MOD_REPLACE &&
352 ml->sml_op != LDAP_MOD_DELETE ) ||
353 ml->sml_values != NULL ))
356 * attribute is obsolete,
357 * only allow replace/delete with no values
359 snprintf( textbuf, textlen,
360 "%s: attribute is obsolete",
361 ml->sml_type.bv_val );
363 return LDAP_CONSTRAINT_VIOLATION;
371 * No-user-modification constraint checking.
374 slap_mods_no_user_mod_check(
381 for ( ; ml != NULL; ml = ml->sml_next ) {
382 if ( !is_at_no_user_mod( ml->sml_desc->ad_type ) ) {
386 if ( get_relax( op ) ) {
387 if ( ml->sml_desc->ad_type->sat_flags & SLAP_AT_MANAGEABLE ) {
388 ml->sml_flags |= SLAP_MOD_MANAGING;
392 /* attribute not manageable */
393 snprintf( textbuf, textlen,
394 "%s: no-user-modification attribute not manageable",
395 ml->sml_type.bv_val );
398 /* user modification disallowed */
399 snprintf( textbuf, textlen,
400 "%s: no user modification allowed",
401 ml->sml_type.bv_val );
405 return LDAP_CONSTRAINT_VIOLATION;
412 slap_mods_no_repl_user_mod_check(
422 for ( mods = ml; mods != NULL; mods = mods->sml_next ) {
423 assert( mods->sml_op == LDAP_MOD_ADD );
425 /* check doesn't already appear */
426 for ( modp = ml; modp != NULL; modp = modp->sml_next ) {
427 if ( mods->sml_desc == modp->sml_desc && mods != modp ) {
428 snprintf( textbuf, textlen,
429 "attribute '%s' provided more than once",
430 mods->sml_desc->ad_cname.bv_val );
432 return LDAP_TYPE_OR_VALUE_EXISTS;
441 * Do basic attribute type checking and syntax validation.
453 for( ; ml != NULL; ml = ml->sml_next ) {
454 AttributeDescription *ad = NULL;
456 /* convert to attribute description */
457 if ( ml->sml_desc == NULL ) {
458 rc = slap_bv2ad( &ml->sml_type, &ml->sml_desc, text );
459 if( rc != LDAP_SUCCESS ) {
460 if ( get_no_schema_check( op )) {
461 rc = slap_bv2undef_ad( &ml->sml_type, &ml->sml_desc,
465 if( rc != LDAP_SUCCESS ) {
466 snprintf( textbuf, textlen, "%s: %s",
467 ml->sml_type.bv_val, *text );
475 if( slap_syntax_is_binary( ad->ad_type->sat_syntax )
476 && !slap_ad_is_binary( ad ))
478 /* attribute requires binary transfer */
479 snprintf( textbuf, textlen,
480 "%s: requires ;binary transfer",
481 ml->sml_type.bv_val );
483 return LDAP_UNDEFINED_TYPE;
486 if( !slap_syntax_is_binary( ad->ad_type->sat_syntax )
487 && slap_ad_is_binary( ad ))
489 /* attribute does not require binary transfer */
490 snprintf( textbuf, textlen,
491 "%s: disallows ;binary transfer",
492 ml->sml_type.bv_val );
494 return LDAP_UNDEFINED_TYPE;
497 if( slap_ad_is_tag_range( ad )) {
498 /* attribute requires binary transfer */
499 snprintf( textbuf, textlen,
500 "%s: inappropriate use of tag range option",
501 ml->sml_type.bv_val );
503 return LDAP_UNDEFINED_TYPE;
507 if ( is_at_obsolete( ad->ad_type ) &&
508 (( ml->sml_op != LDAP_MOD_REPLACE &&
509 ml->sml_op != LDAP_MOD_DELETE ) ||
510 ml->sml_values != NULL ))
513 * attribute is obsolete,
514 * only allow replace/delete with no values
516 snprintf( textbuf, textlen,
517 "%s: attribute is obsolete",
518 ml->sml_type.bv_val );
520 return LDAP_CONSTRAINT_VIOLATION;
524 if ( ml->sml_op == LDAP_MOD_INCREMENT &&
525 #ifdef SLAPD_REAL_SYNTAX
526 !is_at_syntax( ad->ad_type, SLAPD_REAL_SYNTAX ) &&
528 !is_at_syntax( ad->ad_type, SLAPD_INTEGER_SYNTAX ) )
531 * attribute values must be INTEGER or REAL
533 snprintf( textbuf, textlen,
534 "%s: attribute syntax inappropriate for increment",
535 ml->sml_type.bv_val );
537 return LDAP_CONSTRAINT_VIOLATION;
543 if( ml->sml_values != NULL ) {
545 slap_syntax_validate_func *validate =
546 ad->ad_type->sat_syntax->ssyn_validate;
547 slap_syntax_transform_func *pretty =
548 ad->ad_type->sat_syntax->ssyn_pretty;
550 if( !pretty && !validate ) {
551 *text = "no validator for syntax";
552 snprintf( textbuf, textlen,
553 "%s: no validator for syntax %s",
555 ad->ad_type->sat_syntax->ssyn_oid );
557 return LDAP_INVALID_SYNTAX;
561 * check that each value is valid per syntax
562 * and pretty if appropriate
564 for ( nvals = 0; !BER_BVISNULL( &ml->sml_values[nvals] ); nvals++ ) {
568 rc = ordered_value_pretty( ad,
569 &ml->sml_values[nvals], &pval, ctx );
571 rc = ordered_value_validate( ad,
572 &ml->sml_values[nvals], ml->sml_op );
576 snprintf( textbuf, textlen,
577 "%s: value #%ld invalid per syntax",
578 ml->sml_type.bv_val, (long) nvals );
580 return LDAP_INVALID_SYNTAX;
584 ber_memfree_x( ml->sml_values[nvals].bv_val, ctx );
585 ml->sml_values[nvals] = pval;
590 * a rough single value check... an additional check is needed
591 * to catch add of single value to existing single valued attribute
593 if ((ml->sml_op == LDAP_MOD_ADD || ml->sml_op == LDAP_MOD_REPLACE)
594 && nvals > 1 && is_at_single_value( ad->ad_type ))
596 snprintf( textbuf, textlen,
597 "%s: multiple values provided",
598 ml->sml_type.bv_val );
600 return LDAP_CONSTRAINT_VIOLATION;
603 /* if the type has a normalizer, generate the
604 * normalized values. otherwise leave them NULL.
606 * this is different from the rule for attributes
607 * in an entry - in an attribute list, the normalized
608 * value is set equal to the non-normalized value
609 * when there is no normalizer.
611 if( nvals && ad->ad_type->sat_equality &&
612 ad->ad_type->sat_equality->smr_normalize )
614 ml->sml_nvalues = ber_memalloc_x(
615 (nvals+1)*sizeof(struct berval), ctx );
617 for ( nvals = 0; !BER_BVISNULL( &ml->sml_values[nvals] ); nvals++ ) {
618 rc = ordered_value_normalize(
619 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
621 ad->ad_type->sat_equality,
622 &ml->sml_values[nvals], &ml->sml_nvalues[nvals], ctx );
624 Debug( LDAP_DEBUG_ANY,
625 "<= str2entry NULL (ssyn_normalize %d)\n",
627 snprintf( textbuf, textlen,
628 "%s: value #%ld normalization failed",
629 ml->sml_type.bv_val, (long) nvals );
635 BER_BVZERO( &ml->sml_nvalues[nvals] );
638 /* check for duplicates, but ignore Deletes.
640 if( nvals > 1 && ml->sml_op != LDAP_MOD_DELETE ) {
641 #define SLAP_MODS_CHECK_QUICKSORT
642 #ifndef SLAP_MODS_CHECK_QUICKSORT
644 MatchingRule *mr = ad->ad_type->sat_equality;
646 for ( i = 1; i < nvals ; i++ ) {
647 /* test asserted values against themselves */
648 for( j = 0; j < i; j++ ) {
649 rc = ordered_value_match( &match, ml->sml_desc, mr,
651 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX
652 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
653 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
655 ? &ml->sml_nvalues[i]
656 : &ml->sml_values[i],
658 ? &ml->sml_nvalues[j]
659 : &ml->sml_values[j],
661 if ( rc == LDAP_SUCCESS && match == 0 ) {
662 /* value exists already */
663 snprintf( textbuf, textlen,
664 "%s: value #%d provided more than once",
665 ml->sml_desc->ad_cname.bv_val, j );
667 return LDAP_TYPE_OR_VALUE_EXISTS;
669 } else if ( rc != LDAP_SUCCESS ) {
674 #else /* SLAP_MODS_CHECK_QUICKSORT */
676 /* Quicksort + Insertion sort for small arrays */
679 #define SWAP(a,b,tmp) tmp=(a);(a)=(b);(b)=tmp
680 #define COMP(a,b) match=0; rc = ordered_value_match( &match, \
681 ml->sml_desc, mr, SLAP_MR_EQUALITY \
682 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX \
683 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH \
684 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH, \
687 MatchingRule *mr = ad->ad_type->sat_equality;
688 int istack[sizeof(int)*16];
689 int i, j, k, l, ir, jstack, match, *ix, itmp;
690 struct berval a, *cv;
692 /* If PRESERVE_ORDER is defined only the index array is sorted; the
693 * actual values are left in their incoming order. Otherwise, the
694 * only reason to keep the index array is to identify the offending
695 * value when duplicates are found.
697 #define PRESERVE_ORDER
698 #ifndef PRESERVE_ORDER
699 struct berval va, *v, *nv, bvtmp;
702 #define EXCH(x,y) SWAP(ix[x],ix[y],itmp); SWAP(cv[x],cv[y],bvtmp); \
703 if (nv) {SWAP(v[x],v[y],bvtmp);}
704 #define SETA(x) itmp = ix[x]; a = cv[x]; if (nv) va=v[x]
705 #define GETA(x) ix[x] = itmp; cv[x] = a; if (nv) v[x]=va
706 #define SET(x,y) ix[x] = ix[y]; cv[x] = cv[y]; if (nv) v[x]=v[y]
709 nv = ml->sml_nvalues;
711 #else /* PRESERVE_ORDER */
714 #define EXCH(x,y) SWAP(ix[x],ix[y],itmp)
715 #define SETA(x) itmp = ix[x]; a = cv[itmp]
716 #define GETA(x) ix[x] = itmp;
717 #define SET(x,y) ix[x] = ix[y]
719 #endif /* PRESERVE_ORDER */
721 cv = ml->sml_nvalues ? ml->sml_nvalues : ml->sml_values;
722 if ( ad == slap_schema.si_ad_objectClass )
723 mr = NULL; /* shortcut matching */
725 /* record indices to preserve input ordering */
726 ix = slap_sl_malloc( nvals * sizeof(int), ctx );
727 for (i=0; i<nvals; i++) ix[i] = i;
734 if (ir - l < SMALL) { /* Insertion sort */
736 for (j=l+1;j<=ir;j++) {
738 for (i=j-1;i>=0;i--) {
745 if ( match == 0 ) goto done;
747 if ( jstack == 0 ) break;
748 if ( match == 0 ) break;
749 ir = istack[jstack--];
750 l = istack[jstack--];
752 k = (l + ir) >> 1; /* Choose median of left, center, right */
754 COMP( cv[IX(l)], cv[IX(ir)] );
757 } else if ( match == 0 ) {
761 COMP( cv[IX(l+1)], cv[IX(ir)] );
764 } else if ( match == 0 ) {
768 COMP( cv[IX(l)], cv[IX(l+1)] );
771 } else if ( match == 0 ) {
781 COMP( cv[IX(i)], a );
782 } while( match < 0 );
785 COMP( cv[IX(j)], a );
803 istack[jstack-1] = i;
807 istack[jstack-1] = l;
816 slap_sl_free( ix, ctx );
818 if ( rc != LDAP_SUCCESS ) {
820 } else if ( match == 0 ) {
821 /* value exists already */
824 snprintf( textbuf, textlen,
825 "%s: value #%d provided more than once",
826 ml->sml_desc->ad_cname.bv_val, j );
828 return LDAP_TYPE_OR_VALUE_EXISTS;
830 #endif /* SLAP_MODS_CHECK_QUICKSORT */
838 /* Enter with bv->bv_len = sizeof buffer, returns with
839 * actual length of string
841 void slap_timestamp( time_t *tm, struct berval *bv )
847 ltm = gmtime_r( tm, <m_buf );
849 ldap_pvt_thread_mutex_lock( &gmtime_mutex );
853 bv->bv_len = lutil_gentime( bv->bv_val, bv->bv_len, ltm );
855 #ifndef HAVE_GMTIME_R
856 ldap_pvt_thread_mutex_unlock( &gmtime_mutex );
860 /* Called for all modify and modrdn ops. If the current op was replicated
861 * from elsewhere, all of the attrs should already be present.
863 void slap_mods_opattrs(
865 Modifications **modsp,
868 struct berval name, timestamp, csn = BER_BVNULL;
870 char timebuf[ LDAP_LUTIL_GENTIME_BUFSIZE ];
871 char csnbuf[ LDAP_LUTIL_CSNSTR_BUFSIZE ];
872 Modifications *mod, **modtail, *modlast;
873 int gotcsn = 0, gotmname = 0, gotmtime = 0;
875 if ( SLAP_LASTMOD( op->o_bd ) && !op->orm_no_opattrs ) {
877 timestamp.bv_val = timebuf;
878 for ( modtail = modsp; *modtail; modtail = &(*modtail)->sml_next ) {
879 if ( (*modtail)->sml_op != LDAP_MOD_ADD &&
880 (*modtail)->sml_op != SLAP_MOD_SOFTADD &&
881 (*modtail)->sml_op != LDAP_MOD_REPLACE )
886 if ( (*modtail)->sml_desc == slap_schema.si_ad_entryCSN )
888 csn = (*modtail)->sml_values[0];
891 } else if ( (*modtail)->sml_desc == slap_schema.si_ad_modifiersName )
895 } else if ( (*modtail)->sml_desc == slap_schema.si_ad_modifyTimestamp )
901 if ( BER_BVISEMPTY( &op->o_csn )) {
904 csn.bv_len = sizeof( csnbuf );
905 slap_get_csn( op, &csn, manage_ctxcsn );
908 if ( manage_ctxcsn ) {
909 slap_queue_csn( op, &csn );
917 ptr = ber_bvchr( &csn, '#' );
919 timestamp.bv_len = STRLENOF("YYYYMMDDHHMMSSZ");
920 AC_MEMCPY( timebuf, csn.bv_val, timestamp.bv_len );
921 timebuf[timestamp.bv_len-1] = 'Z';
922 timebuf[timestamp.bv_len] = '\0';
925 time_t now = slap_get_time();
927 timestamp.bv_len = sizeof(timebuf);
929 slap_timestamp( &now, ×tamp );
932 if ( BER_BVISEMPTY( &op->o_dn ) ) {
933 BER_BVSTR( &name, SLAPD_ANONYMOUS );
942 mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
943 mod->sml_op = LDAP_MOD_REPLACE;
944 mod->sml_flags = SLAP_MOD_INTERNAL;
945 mod->sml_next = NULL;
946 BER_BVZERO( &mod->sml_type );
947 mod->sml_desc = slap_schema.si_ad_entryCSN;
948 mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
949 ber_dupbv( &mod->sml_values[0], &csn );
950 BER_BVZERO( &mod->sml_values[1] );
951 assert( !BER_BVISNULL( &mod->sml_values[0] ) );
952 mod->sml_nvalues = NULL;
955 modtail = &mod->sml_next;
959 mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
960 mod->sml_op = LDAP_MOD_REPLACE;
961 mod->sml_flags = SLAP_MOD_INTERNAL;
962 mod->sml_next = NULL;
963 BER_BVZERO( &mod->sml_type );
964 mod->sml_desc = slap_schema.si_ad_modifiersName;
965 mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
966 ber_dupbv( &mod->sml_values[0], &name );
967 BER_BVZERO( &mod->sml_values[1] );
968 assert( !BER_BVISNULL( &mod->sml_values[0] ) );
970 (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
971 ber_dupbv( &mod->sml_nvalues[0], &nname );
972 BER_BVZERO( &mod->sml_nvalues[1] );
973 assert( !BER_BVISNULL( &mod->sml_nvalues[0] ) );
975 modtail = &mod->sml_next;
979 mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
980 mod->sml_op = LDAP_MOD_REPLACE;
981 mod->sml_flags = SLAP_MOD_INTERNAL;
982 mod->sml_next = NULL;
983 BER_BVZERO( &mod->sml_type );
984 mod->sml_desc = slap_schema.si_ad_modifyTimestamp;
985 mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
986 ber_dupbv( &mod->sml_values[0], ×tamp );
987 BER_BVZERO( &mod->sml_values[1] );
988 assert( !BER_BVISNULL( &mod->sml_values[0] ) );
989 mod->sml_nvalues = NULL;
991 modtail = &mod->sml_next;
1006 Modifications **modtail = &ms->rs_mods.rs_modlist;
1008 ms->rs_mods.rs_modlist = NULL;
1009 ms->rs_increment = 0;
1011 rs->sr_err = LDAP_SUCCESS;
1013 /* collect modifications & save for later */
1014 for ( tag = ber_first_element( ber, &len, &last );
1015 tag != LBER_DEFAULT;
1016 tag = ber_next_element( ber, &len, last ) )
1019 Modifications tmp, *mod;
1021 tmp.sml_nvalues = NULL;
1023 if ( ber_scanf( ber, "{e{m[W]}}", &mop,
1024 &tmp.sml_type, &tmp.sml_values ) == LBER_ERROR )
1026 rs->sr_text = "decoding modlist error";
1027 rs->sr_err = LDAP_PROTOCOL_ERROR;
1031 mod = (Modifications *) ch_malloc( sizeof(Modifications) );
1034 mod->sml_type = tmp.sml_type;
1035 mod->sml_values = tmp.sml_values;
1036 mod->sml_nvalues = NULL;
1037 mod->sml_desc = NULL;
1038 mod->sml_next = NULL;
1043 if ( mod->sml_values == NULL ) {
1044 rs->sr_text = "modify/add operation requires values";
1045 rs->sr_err = LDAP_PROTOCOL_ERROR;
1051 case LDAP_MOD_DELETE:
1052 case LDAP_MOD_REPLACE:
1055 case LDAP_MOD_INCREMENT:
1056 if( op->o_protocol >= LDAP_VERSION3 ) {
1058 if ( mod->sml_values == NULL ) {
1059 rs->sr_text = "modify/increment operation requires value";
1060 rs->sr_err = LDAP_PROTOCOL_ERROR;
1064 if ( !BER_BVISNULL( &mod->sml_values[ 1 ] ) ) {
1065 rs->sr_text = "modify/increment operation requires single value";
1066 rs->sr_err = LDAP_PROTOCOL_ERROR;
1075 rs->sr_text = "unrecognized modify operation";
1076 rs->sr_err = LDAP_PROTOCOL_ERROR;
1080 modtail = &mod->sml_next;
1085 if ( rs->sr_err != LDAP_SUCCESS ) {
1086 slap_mods_free( ms->rs_mods.rs_modlist, 1 );
1087 ms->rs_mods.rs_modlist = NULL;
1088 ms->rs_increment = 0;