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;
47 Modifications *modlist = NULL;
48 Modifications **modtail = &modlist;
50 char textbuf[ SLAP_TEXT_BUFLEN ];
51 size_t textlen = sizeof( textbuf );
53 Debug( LDAP_DEBUG_TRACE, "do_modify\n", 0, 0, 0 );
56 * Parse the modify request. It looks like this:
58 * ModifyRequest := [APPLICATION 6] SEQUENCE {
59 * name DistinguishedName,
60 * mods SEQUENCE OF SEQUENCE {
61 * operation ENUMERATED {
66 * modification SEQUENCE {
68 * values SET OF AttributeValue
74 if ( ber_scanf( op->o_ber, "{m" /*}*/, &dn ) == LBER_ERROR ) {
75 Debug( LDAP_DEBUG_ANY, "do_modify: ber_scanf failed\n", 0, 0, 0 );
77 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR, "decoding error" );
78 return SLAPD_DISCONNECT;
81 Debug( LDAP_DEBUG_ARGS, "do_modify: dn (%s)\n", dn.bv_val, 0, 0 );
83 /* collect modifications & save for later */
84 for ( tag = ber_first_element( op->o_ber, &len, &last );
86 tag = ber_next_element( op->o_ber, &len, last ) )
89 Modifications tmp, *mod;
91 tmp.sml_nvalues = NULL;
93 if ( ber_scanf( op->o_ber, "{e{m[W]}}", &mop,
94 &tmp.sml_type, &tmp.sml_values ) == LBER_ERROR )
96 send_ldap_discon( op, rs, LDAP_PROTOCOL_ERROR,
97 "decoding modlist error" );
98 rs->sr_err = SLAPD_DISCONNECT;
102 mod = (Modifications *) ch_malloc( sizeof(Modifications) );
105 mod->sml_type = tmp.sml_type;
106 mod->sml_values = tmp.sml_values;
107 mod->sml_nvalues = NULL;
108 mod->sml_desc = NULL;
109 mod->sml_next = NULL;
114 if ( mod->sml_values == NULL ) {
115 Debug( LDAP_DEBUG_ANY,
116 "do_modify: modify/add operation (%ld) requires values\n",
119 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
120 "modify/add operation requires values" );
126 case LDAP_MOD_DELETE:
127 case LDAP_MOD_REPLACE:
130 case LDAP_MOD_INCREMENT:
131 if( op->o_protocol >= LDAP_VERSION3 ) {
133 if ( mod->sml_values == NULL ) {
134 Debug( LDAP_DEBUG_ANY, "do_modify: "
135 "modify/increment operation (%ld) requires value\n",
138 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
139 "modify/increment operation requires value" );
143 if ( !BER_BVISNULL( &mod->sml_values[ 1 ] ) ) {
144 Debug( LDAP_DEBUG_ANY, "do_modify: modify/increment "
145 "operation (%ld) requires single value\n",
148 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
149 "modify/increment operation requires single value" );
158 Debug( LDAP_DEBUG_ANY,
159 "do_modify: unrecognized modify operation (%ld)\n",
162 send_ldap_error( op, rs, LDAP_PROTOCOL_ERROR,
163 "unrecognized modify operation" );
168 modtail = &mod->sml_next;
172 if( get_ctrls( op, rs, 1 ) != LDAP_SUCCESS ) {
173 Debug( LDAP_DEBUG_ANY, "do_modify: get_ctrls failed\n", 0, 0, 0 );
177 rs->sr_err = dnPrettyNormal( NULL, &dn, &op->o_req_dn, &op->o_req_ndn,
179 if( rs->sr_err != LDAP_SUCCESS ) {
180 Debug( LDAP_DEBUG_ANY,
181 "do_modify: invalid dn (%s)\n", dn.bv_val, 0, 0 );
182 send_ldap_error( op, rs, LDAP_INVALID_DN_SYNTAX, "invalid DN" );
186 rs->sr_err = slap_mods_check( op, modlist,
187 &rs->sr_text, textbuf, textlen, NULL );
189 if ( rs->sr_err != LDAP_SUCCESS ) {
190 send_ldap_result( op, rs );
194 /* FIXME: needs review */
195 op->orm_modlist = modlist;
196 op->orm_increment = increment;
198 op->o_bd = frontendDB;
199 rs->sr_err = frontendDB->be_modify( op, rs );
202 if( rs->sr_err == LDAP_X_TXN_SPECIFY_OKAY ) {
209 op->o_tmpfree( op->o_req_dn.bv_val, op->o_tmpmemctx );
210 op->o_tmpfree( op->o_req_ndn.bv_val, op->o_tmpmemctx );
211 if ( op->orm_modlist != NULL ) slap_mods_free( op->orm_modlist, 1 );
217 fe_op_modify( Operation *op, SlapReply *rs )
223 BackendDB *op_be, *bd = op->o_bd;
224 char textbuf[ SLAP_TEXT_BUFLEN ];
225 size_t textlen = sizeof( textbuf );
227 if ( BER_BVISEMPTY( &op->o_req_ndn ) ) {
228 Debug( LDAP_DEBUG_ANY, "do_modify: root dse!\n", 0, 0, 0 );
230 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
231 "modify upon the root DSE not supported" );
234 } else if ( bvmatch( &op->o_req_ndn, &frontendDB->be_schemandn ) ) {
235 Debug( LDAP_DEBUG_ANY, "do_modify: subschema subentry!\n", 0, 0, 0 );
237 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
238 "modification of subschema subentry not supported" );
243 Debug( LDAP_DEBUG_ARGS, "modifications:\n", 0, 0, 0 );
245 for ( tmp = op->orm_modlist; tmp != NULL; tmp = tmp->sml_next ) {
246 Debug( LDAP_DEBUG_ARGS, "\t%s: %s\n",
247 tmp->sml_op == LDAP_MOD_ADD ? "add" :
248 (tmp->sml_op == LDAP_MOD_INCREMENT ? "increment" :
249 (tmp->sml_op == LDAP_MOD_DELETE ? "delete" :
250 "replace")), tmp->sml_type.bv_val, 0 );
252 if ( tmp->sml_values == NULL ) {
253 Debug( LDAP_DEBUG_ARGS, "%s\n",
254 "\t\tno values", NULL, NULL );
255 } else if ( BER_BVISNULL( &tmp->sml_values[ 0 ] ) ) {
256 Debug( LDAP_DEBUG_ARGS, "%s\n",
257 "\t\tzero values", NULL, NULL );
258 } else if ( BER_BVISNULL( &tmp->sml_values[ 1 ] ) ) {
259 Debug( LDAP_DEBUG_ARGS, "%s, length %ld\n",
260 "\t\tone value", (long) tmp->sml_values[0].bv_len, NULL );
262 Debug( LDAP_DEBUG_ARGS, "%s\n",
263 "\t\tmultiple values", NULL, NULL );
267 if ( StatslogTest( LDAP_DEBUG_STATS ) ) {
268 char abuf[BUFSIZ/2], *ptr = abuf;
271 Statslog( LDAP_DEBUG_STATS, "%s MOD dn=\"%s\"\n",
272 op->o_log_prefix, op->o_req_dn.bv_val, 0, 0, 0 );
274 for ( tmp = op->orm_modlist; tmp != NULL; tmp = tmp->sml_next ) {
275 if (len + 1 + tmp->sml_type.bv_len > sizeof(abuf)) {
276 Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
277 op->o_log_prefix, abuf, 0, 0, 0 );
282 if( 1 + tmp->sml_type.bv_len > sizeof(abuf)) {
283 Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
284 op->o_log_prefix, tmp->sml_type.bv_val, 0, 0, 0 );
292 ptr = lutil_strcopy(ptr, tmp->sml_type.bv_val);
293 len += tmp->sml_type.bv_len;
296 Statslog( LDAP_DEBUG_STATS, "%s MOD attr=%s\n",
297 op->o_log_prefix, abuf, 0, 0, 0 );
300 #endif /* LDAP_DEBUG */
302 manageDSAit = get_manageDSAit( op );
305 * We could be serving multiple database backends. Select the
306 * appropriate one, or send a referral to our "referral server"
307 * if we don't hold it.
309 op->o_bd = select_backend( &op->o_req_ndn, manageDSAit, 1 );
310 if ( op->o_bd == NULL ) {
312 rs->sr_ref = referral_rewrite( default_referral,
313 NULL, &op->o_req_dn, LDAP_SCOPE_DEFAULT );
315 rs->sr_ref = default_referral;
318 if ( rs->sr_ref != NULL ) {
319 rs->sr_err = LDAP_REFERRAL;
320 send_ldap_result( op, rs );
322 if ( rs->sr_ref != default_referral ) {
323 ber_bvarray_free( rs->sr_ref );
327 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
328 "no global superior knowledge" );
333 /* If we've got a glued backend, check the real backend */
335 if ( SLAP_GLUE_INSTANCE( op->o_bd )) {
336 op->o_bd = select_backend( &op->o_req_ndn, manageDSAit, 0 );
339 /* check restrictions */
340 if ( backend_check_restrictions( op, rs, NULL ) != LDAP_SUCCESS ) {
341 send_ldap_result( op, rs );
345 /* check for referrals */
346 if ( backend_check_referrals( op, rs ) != LDAP_SUCCESS ) {
350 rs->sr_err = slap_mods_obsolete_check( op, op->orm_modlist,
351 &rs->sr_text, textbuf, textlen );
352 if ( rs->sr_err != LDAP_SUCCESS ) {
353 send_ldap_result( op, rs );
357 /* check for modify/increment support */
358 if ( op->orm_increment && !SLAP_INCREMENT( op->o_bd ) ) {
359 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
360 "modify/increment not supported in context" );
364 * do the modify if 1 && (2 || 3)
365 * 1) there is a modify function implemented in this backend;
366 * 2) this backend is master for what it holds;
367 * 3) it's a replica and the dn supplied is the update_ndn.
369 if ( op->o_bd->be_modify ) {
370 /* do the update here */
371 int repl_user = be_isupdate( op );
374 * Multimaster slapd does not have to check for replicator dn
375 * because it accepts each modify request
377 if ( !SLAP_SINGLE_SHADOW(op->o_bd) || repl_user ) {
378 int update = !BER_BVISEMPTY( &op->o_bd->be_update_ndn );
379 slap_callback cb = { NULL, slap_replog_cb, NULL, NULL };
384 rs->sr_err = slap_mods_no_user_mod_check( op, op->orm_modlist,
385 &rs->sr_text, textbuf, textlen );
386 if ( rs->sr_err != LDAP_SUCCESS ) {
387 send_ldap_result( op, rs );
393 /* but multimaster slapd logs only the ones
394 * not from a replicator user */
395 cb.sc_next = op->o_callback;
396 op->o_callback = &cb;
398 op->o_bd->be_modify( op, rs );
400 } else { /* send a referral */
401 BerVarray defref = op->o_bd->be_update_refs
402 ? op->o_bd->be_update_refs : default_referral;
403 if ( defref != NULL ) {
404 rs->sr_ref = referral_rewrite( defref,
406 LDAP_SCOPE_DEFAULT );
407 if ( rs->sr_ref == NULL ) {
408 /* FIXME: must duplicate, because
409 * overlays may muck with it */
412 rs->sr_err = LDAP_REFERRAL;
413 send_ldap_result( op, rs );
414 if ( rs->sr_ref != defref ) {
415 ber_bvarray_free( rs->sr_ref );
419 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
420 "shadow context; no update referral" );
425 send_ldap_error( op, rs, LDAP_UNWILLING_TO_PERFORM,
426 "operation not supported within namingContext" );
435 * Obsolete constraint checking.
438 slap_mods_obsolete_check(
445 if( get_relax( op ) ) return LDAP_SUCCESS;
447 for ( ; ml != NULL; ml = ml->sml_next ) {
448 if ( is_at_obsolete( ml->sml_desc->ad_type ) &&
449 (( ml->sml_op != LDAP_MOD_REPLACE &&
450 ml->sml_op != LDAP_MOD_DELETE ) ||
451 ml->sml_values != NULL ))
454 * attribute is obsolete,
455 * only allow replace/delete with no values
457 snprintf( textbuf, textlen,
458 "%s: attribute is obsolete",
459 ml->sml_type.bv_val );
461 return LDAP_CONSTRAINT_VIOLATION;
469 * No-user-modification constraint checking.
472 slap_mods_no_user_mod_check(
479 for ( ; ml != NULL; ml = ml->sml_next ) {
480 if ( !is_at_no_user_mod( ml->sml_desc->ad_type ) ) {
484 if ( get_relax( op ) ) {
485 if ( ml->sml_desc->ad_type->sat_flags & SLAP_AT_MANAGEABLE ) {
486 ml->sml_flags |= SLAP_MOD_MANAGING;
490 /* attribute not manageable */
491 snprintf( textbuf, textlen,
492 "%s: no-user-modification attribute not manageable",
493 ml->sml_type.bv_val );
496 /* user modification disallowed */
497 snprintf( textbuf, textlen,
498 "%s: no user modification allowed",
499 ml->sml_type.bv_val );
503 return LDAP_CONSTRAINT_VIOLATION;
510 slap_mods_no_repl_user_mod_check(
520 for ( mods = ml; mods != NULL; mods = mods->sml_next ) {
521 assert( mods->sml_op == LDAP_MOD_ADD );
523 /* check doesn't already appear */
524 for ( modp = ml; modp != NULL; modp = modp->sml_next ) {
525 if ( mods->sml_desc == modp->sml_desc && mods != modp ) {
526 snprintf( textbuf, textlen,
527 "attribute '%s' provided more than once",
528 mods->sml_desc->ad_cname.bv_val );
530 return LDAP_TYPE_OR_VALUE_EXISTS;
539 * Do basic attribute type checking and syntax validation.
551 for( ; ml != NULL; ml = ml->sml_next ) {
552 AttributeDescription *ad = NULL;
554 /* convert to attribute description */
555 if ( ml->sml_desc == NULL ) {
556 rc = slap_bv2ad( &ml->sml_type, &ml->sml_desc, text );
557 if( rc != LDAP_SUCCESS ) {
558 if ( get_no_schema_check( op )) {
559 rc = slap_bv2undef_ad( &ml->sml_type, &ml->sml_desc,
563 if( rc != LDAP_SUCCESS ) {
564 snprintf( textbuf, textlen, "%s: %s",
565 ml->sml_type.bv_val, *text );
573 if( slap_syntax_is_binary( ad->ad_type->sat_syntax )
574 && !slap_ad_is_binary( ad ))
576 /* attribute requires binary transfer */
577 snprintf( textbuf, textlen,
578 "%s: requires ;binary transfer",
579 ml->sml_type.bv_val );
581 return LDAP_UNDEFINED_TYPE;
584 if( !slap_syntax_is_binary( ad->ad_type->sat_syntax )
585 && slap_ad_is_binary( ad ))
587 /* attribute does not require binary transfer */
588 snprintf( textbuf, textlen,
589 "%s: disallows ;binary transfer",
590 ml->sml_type.bv_val );
592 return LDAP_UNDEFINED_TYPE;
595 if( slap_ad_is_tag_range( ad )) {
596 /* attribute requires binary transfer */
597 snprintf( textbuf, textlen,
598 "%s: inappropriate use of tag range option",
599 ml->sml_type.bv_val );
601 return LDAP_UNDEFINED_TYPE;
605 if ( is_at_obsolete( ad->ad_type ) &&
606 (( ml->sml_op != LDAP_MOD_REPLACE &&
607 ml->sml_op != LDAP_MOD_DELETE ) ||
608 ml->sml_values != NULL ))
611 * attribute is obsolete,
612 * only allow replace/delete with no values
614 snprintf( textbuf, textlen,
615 "%s: attribute is obsolete",
616 ml->sml_type.bv_val );
618 return LDAP_CONSTRAINT_VIOLATION;
622 if ( ml->sml_op == LDAP_MOD_INCREMENT &&
623 #ifdef SLAPD_REAL_SYNTAX
624 !is_at_syntax( ad->ad_type, SLAPD_REAL_SYNTAX ) &&
626 !is_at_syntax( ad->ad_type, SLAPD_INTEGER_SYNTAX ) )
629 * attribute values must be INTEGER or REAL
631 snprintf( textbuf, textlen,
632 "%s: attribute syntax inappropriate for increment",
633 ml->sml_type.bv_val );
635 return LDAP_CONSTRAINT_VIOLATION;
641 if( ml->sml_values != NULL ) {
643 slap_syntax_validate_func *validate =
644 ad->ad_type->sat_syntax->ssyn_validate;
645 slap_syntax_transform_func *pretty =
646 ad->ad_type->sat_syntax->ssyn_pretty;
648 if( !pretty && !validate ) {
649 *text = "no validator for syntax";
650 snprintf( textbuf, textlen,
651 "%s: no validator for syntax %s",
653 ad->ad_type->sat_syntax->ssyn_oid );
655 return LDAP_INVALID_SYNTAX;
659 * check that each value is valid per syntax
660 * and pretty if appropriate
662 for ( nvals = 0; !BER_BVISNULL( &ml->sml_values[nvals] ); nvals++ ) {
666 rc = ordered_value_pretty( ad,
667 &ml->sml_values[nvals], &pval, ctx );
669 rc = ordered_value_validate( ad,
670 &ml->sml_values[nvals], ml->sml_op );
674 snprintf( textbuf, textlen,
675 "%s: value #%ld invalid per syntax",
676 ml->sml_type.bv_val, (long) nvals );
678 return LDAP_INVALID_SYNTAX;
682 ber_memfree_x( ml->sml_values[nvals].bv_val, ctx );
683 ml->sml_values[nvals] = pval;
688 * a rough single value check... an additional check is needed
689 * to catch add of single value to existing single valued attribute
691 if ((ml->sml_op == LDAP_MOD_ADD || ml->sml_op == LDAP_MOD_REPLACE)
692 && nvals > 1 && is_at_single_value( ad->ad_type ))
694 snprintf( textbuf, textlen,
695 "%s: multiple values provided",
696 ml->sml_type.bv_val );
698 return LDAP_CONSTRAINT_VIOLATION;
701 /* if the type has a normalizer, generate the
702 * normalized values. otherwise leave them NULL.
704 * this is different from the rule for attributes
705 * in an entry - in an attribute list, the normalized
706 * value is set equal to the non-normalized value
707 * when there is no normalizer.
709 if( nvals && ad->ad_type->sat_equality &&
710 ad->ad_type->sat_equality->smr_normalize )
712 ml->sml_nvalues = ber_memalloc_x(
713 (nvals+1)*sizeof(struct berval), ctx );
715 for ( nvals = 0; !BER_BVISNULL( &ml->sml_values[nvals] ); nvals++ ) {
716 rc = ordered_value_normalize(
717 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
719 ad->ad_type->sat_equality,
720 &ml->sml_values[nvals], &ml->sml_nvalues[nvals], ctx );
722 Debug( LDAP_DEBUG_ANY,
723 "<= str2entry NULL (ssyn_normalize %d)\n",
725 snprintf( textbuf, textlen,
726 "%s: value #%ld normalization failed",
727 ml->sml_type.bv_val, (long) nvals );
733 BER_BVZERO( &ml->sml_nvalues[nvals] );
736 /* check for duplicates, but ignore Deletes.
738 if( nvals > 1 && ml->sml_op != LDAP_MOD_DELETE ) {
739 #define SLAP_MODS_CHECK_QUICKSORT
740 #ifndef SLAP_MODS_CHECK_QUICKSORT
742 MatchingRule *mr = ad->ad_type->sat_equality;
744 for ( i = 1; i < nvals ; i++ ) {
745 /* test asserted values against themselves */
746 for( j = 0; j < i; j++ ) {
747 rc = ordered_value_match( &match, ml->sml_desc, mr,
749 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX
750 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
751 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
753 ? &ml->sml_nvalues[i]
754 : &ml->sml_values[i],
756 ? &ml->sml_nvalues[j]
757 : &ml->sml_values[j],
759 if ( rc == LDAP_SUCCESS && match == 0 ) {
760 /* value exists already */
761 snprintf( textbuf, textlen,
762 "%s: value #%d provided more than once",
763 ml->sml_desc->ad_cname.bv_val, j );
765 return LDAP_TYPE_OR_VALUE_EXISTS;
767 } else if ( rc != LDAP_SUCCESS ) {
772 #else /* SLAP_MODS_CHECK_QUICKSORT */
774 /* Quicksort + Insertion sort for small arrays */
777 #define SWAP(a,b,tmp) tmp=(a);(a)=(b);(b)=tmp
778 #define COMP(a,b) match=0; rc = ordered_value_match( &match, \
779 ml->sml_desc, mr, SLAP_MR_EQUALITY \
780 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX \
781 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH \
782 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH, \
785 MatchingRule *mr = ad->ad_type->sat_equality;
786 int istack[sizeof(int)*16];
787 int i,j,k,l,ir,jstack, rc, match, *ix, itmp;
788 struct berval a, *cv;
790 /* If PRESERVE_ORDER is defined only the index array is sorted; the
791 * actual values are left in their incoming order. Otherwise, the
792 * only reason to keep the index array is to identify the offending
793 * value when duplicates are found.
795 #define PRESERVE_ORDER
796 #ifndef PRESERVE_ORDER
797 struct berval va, *v, *nv, bvtmp;
800 #define EXCH(x,y) SWAP(ix[x],ix[y],itmp); SWAP(cv[x],cv[y],bvtmp); \
801 if (nv) {SWAP(v[x],v[y],bvtmp);}
802 #define SETA(x) itmp = ix[x]; a = cv[x]; if (nv) va=v[x]
803 #define GETA(x) ix[x] = itmp; cv[x] = a; if (nv) v[x]=va
804 #define SET(x,y) ix[x] = ix[y]; cv[x] = cv[y]; if (nv) v[x]=v[y]
807 nv = ml->sml_nvalues;
809 #else /* PRESERVE_ORDER */
812 #define EXCH(x,y) SWAP(ix[x],ix[y],itmp)
813 #define SETA(x) itmp = ix[x]; a = cv[itmp]
814 #define GETA(x) ix[x] = itmp;
815 #define SET(x,y) ix[x] = ix[y]
817 #endif /* PRESERVE_ORDER */
819 cv = ml->sml_nvalues ? ml->sml_nvalues : ml->sml_values;
820 if ( ad == slap_schema.si_ad_objectClass )
821 mr = NULL; /* shortcut matching */
823 /* record indices to preserve input ordering */
824 ix = slap_sl_malloc( nvals * sizeof(int), ctx );
825 for (i=0; i<nvals; i++) ix[i] = i;
832 if (ir - l < SMALL) { /* Insertion sort */
834 for (j=l+1;j<=ir;j++) {
836 for (i=j-1;i>=0;i--) {
843 if ( match == 0 ) goto done;
845 if ( jstack == 0 ) break;
846 if ( match == 0 ) break;
847 ir = istack[jstack--];
848 l = istack[jstack--];
850 k = (l + ir) >> 1; /* Choose median of left, center, right */
852 COMP( cv[IX(l)], cv[IX(ir)] );
855 } else if ( match == 0 ) {
859 COMP( cv[IX(l+1)], cv[IX(ir)] );
862 } else if ( match == 0 ) {
866 COMP( cv[IX(l)], cv[IX(l+1)] );
869 } else if ( match == 0 ) {
879 COMP( cv[IX(i)], a );
880 } while( match < 0 );
883 COMP( cv[IX(j)], a );
901 istack[jstack-1] = i;
905 istack[jstack-1] = l;
914 slap_sl_free( ix, ctx );
916 if ( rc != LDAP_SUCCESS ) {
918 } else if ( match == 0 ) {
919 /* value exists already */
922 snprintf( textbuf, textlen,
923 "%s: value #%d provided more than once",
924 ml->sml_desc->ad_cname.bv_val, j );
926 return LDAP_TYPE_OR_VALUE_EXISTS;
928 #endif /* SLAP_MODS_CHECK_QUICKSORT */
936 /* Enter with bv->bv_len = sizeof buffer, returns with
937 * actual length of string
939 void slap_timestamp( time_t *tm, struct berval *bv )
945 ltm = gmtime_r( tm, <m_buf );
947 ldap_pvt_thread_mutex_lock( &gmtime_mutex );
951 bv->bv_len = lutil_gentime( bv->bv_val, bv->bv_len, ltm );
953 #ifndef HAVE_GMTIME_R
954 ldap_pvt_thread_mutex_unlock( &gmtime_mutex );
958 /* Called for all modify and modrdn ops. If the current op was replicated
959 * from elsewhere, all of the attrs should already be present.
961 void slap_mods_opattrs(
963 Modifications **modsp,
966 struct berval name, timestamp, csn = BER_BVNULL;
968 char timebuf[ LDAP_LUTIL_GENTIME_BUFSIZE ];
969 char csnbuf[ LDAP_LUTIL_CSNSTR_BUFSIZE ];
970 Modifications *mod, **modtail, *modlast;
971 int gotcsn = 0, gotmname = 0, gotmtime = 0;
973 if ( SLAP_LASTMOD( op->o_bd ) ) {
975 timestamp.bv_val = timebuf;
976 for ( modtail = modsp; *modtail; modtail = &(*modtail)->sml_next ) {
977 if ( (*modtail)->sml_op != LDAP_MOD_ADD &&
978 (*modtail)->sml_op != LDAP_MOD_REPLACE ) continue;
979 if ( (*modtail)->sml_desc == slap_schema.si_ad_entryCSN ) {
980 csn = (*modtail)->sml_values[0];
983 if ( (*modtail)->sml_desc == slap_schema.si_ad_modifiersName ) {
986 if ( (*modtail)->sml_desc == slap_schema.si_ad_modifyTimestamp ) {
990 if ( BER_BVISEMPTY( &op->o_csn )) {
993 csn.bv_len = sizeof( csnbuf );
994 slap_get_csn( op, &csn, manage_ctxcsn );
997 slap_queue_csn( op, &csn );
1002 ptr = ber_bvchr( &csn, '#' );
1004 timestamp.bv_len = ptr - csn.bv_val;
1005 if ( timestamp.bv_len >= sizeof( timebuf )) /* ?!? */
1006 timestamp.bv_len = sizeof( timebuf ) - 1;
1007 AC_MEMCPY( timebuf, csn.bv_val, timestamp.bv_len );
1008 timebuf[timestamp.bv_len] = '\0';
1010 time_t now = slap_get_time();
1012 timestamp.bv_len = sizeof(timebuf);
1014 slap_timestamp( &now, ×tamp );
1017 if ( BER_BVISEMPTY( &op->o_dn ) ) {
1018 BER_BVSTR( &name, SLAPD_ANONYMOUS );
1026 mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
1027 mod->sml_op = LDAP_MOD_REPLACE;
1028 mod->sml_flags = SLAP_MOD_INTERNAL;
1029 mod->sml_next = NULL;
1030 BER_BVZERO( &mod->sml_type );
1031 mod->sml_desc = slap_schema.si_ad_entryCSN;
1032 mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1033 ber_dupbv( &mod->sml_values[0], &csn );
1034 BER_BVZERO( &mod->sml_values[1] );
1035 assert( !BER_BVISNULL( &mod->sml_values[0] ) );
1036 mod->sml_nvalues = NULL;
1039 modtail = &mod->sml_next;
1043 mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
1044 mod->sml_op = LDAP_MOD_REPLACE;
1045 mod->sml_flags = SLAP_MOD_INTERNAL;
1046 mod->sml_next = NULL;
1047 BER_BVZERO( &mod->sml_type );
1048 mod->sml_desc = slap_schema.si_ad_modifiersName;
1049 mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1050 ber_dupbv( &mod->sml_values[0], &name );
1051 BER_BVZERO( &mod->sml_values[1] );
1052 assert( !BER_BVISNULL( &mod->sml_values[0] ) );
1054 (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1055 ber_dupbv( &mod->sml_nvalues[0], &nname );
1056 BER_BVZERO( &mod->sml_nvalues[1] );
1057 assert( !BER_BVISNULL( &mod->sml_nvalues[0] ) );
1059 modtail = &mod->sml_next;
1063 mod = (Modifications *) ch_malloc( sizeof( Modifications ) );
1064 mod->sml_op = LDAP_MOD_REPLACE;
1065 mod->sml_flags = SLAP_MOD_INTERNAL;
1066 mod->sml_next = NULL;
1067 BER_BVZERO( &mod->sml_type );
1068 mod->sml_desc = slap_schema.si_ad_modifyTimestamp;
1069 mod->sml_values = (BerVarray) ch_malloc( 2 * sizeof( struct berval ) );
1070 ber_dupbv( &mod->sml_values[0], ×tamp );
1071 BER_BVZERO( &mod->sml_values[1] );
1072 assert( !BER_BVISNULL( &mod->sml_values[0] ) );
1073 mod->sml_nvalues = NULL;
1075 modtail = &mod->sml_next;