2 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
3 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
6 * Copyright (c) 1995 Regents of the University of Michigan.
9 * Redistribution and use in source and binary forms are permitted
10 * provided that this notice is preserved and that due credit is given
11 * to the University of Michigan at Ann Arbor. The name of the University
12 * may not be used to endorse or promote products derived from this
13 * software without specific prior written permission. This software
14 * is provided ``as is'' without express or implied warranty.
22 modify_check_duplicates(
23 AttributeDescription *ad,
29 char *textbuf, size_t textlen )
31 int i, j, numvals = 0, nummods,
32 rc = LDAP_SUCCESS, matched;
34 /* this function is no longer used */
36 BerVarray nvals = NULL, nmods = NULL;
39 * FIXME: better do the following
41 * - count the existing values
42 * - count the new values
44 * - if the existing values are less than the new ones {
45 * - normalize all the existing values
46 * - for each new value {
48 * - check with existing
49 * - cross-check with already normalized new vals
52 * - for each new value {
54 * - cross-check with already normalized new vals
56 * - for each existing value {
58 * - check with already normalized new values
62 * The first case is good when adding a lot of new values,
63 * and significantly at first import of values (e.g. adding
64 * a new group); the latter case seems to be quite important
65 * as well, because it is likely to be the most frequently
66 * used when administering the entry. The current
67 * implementation will always normalize all the existing
68 * values before checking. If there's no duplicate, the
69 * performances should not change; they will in case of error.
72 for ( nummods = 0; mods[ nummods ].bv_val != NULL; nummods++ )
73 /* count new values */ ;
76 for ( numvals = 0; vals[ numvals ].bv_val != NULL; numvals++ )
77 /* count existing values */ ;
79 if ( numvals < nummods ) {
80 nvals = SLAP_CALLOC( numvals + 1, sizeof( struct berval ) );
83 LDAP_LOG( OPERATION, ERR,
84 "modify_check_duplicates: SLAP_CALLOC failed", 0, 0, 0 );
86 Debug( LDAP_DEBUG_ANY,
87 "modify_check_duplicates: SLAP_CALLOC failed", 0, 0, 0 );
92 /* normalize the existing values first */
93 for ( j = 0; vals[ j ].bv_val != NULL; j++ ) {
94 rc = value_normalize( ad, SLAP_MR_EQUALITY,
95 &vals[ j ], &nvals[ j ], text );
97 /* existing attribute values must normalize */
98 assert( rc == LDAP_SUCCESS );
100 if ( rc != LDAP_SUCCESS ) {
101 nvals[ j ].bv_val = NULL;
105 nvals[ j ].bv_val = NULL;
110 * If the existing values are less than the new values,
111 * it is more convenient to normalize all the existing
112 * values and test each new value against them first,
113 * then to other already normalized values
115 nmods = SLAP_CALLOC( nummods + 1, sizeof( struct berval ) );
116 if ( nmods == NULL ) {
118 LDAP_LOG( OPERATION, ERR,
119 "modify_check_duplicates: SLAP_CALLOC failed", 0, 0, 0 );
121 Debug( LDAP_DEBUG_ANY,
122 "modify_check_duplicates: SLAP_CALLOC failed", 0, 0, 0 );
127 for ( i=0; mods[i].bv_val != NULL; i++ ) {
128 rc = value_normalize( ad, SLAP_MR_EQUALITY,
129 &mods[i], &nmods[i], text );
131 if ( rc != LDAP_SUCCESS ) {
132 nmods[i].bv_val = NULL;
136 if ( numvals > 0 && numvals < nummods ) {
137 for ( matched=0, j=0; nvals[j].bv_val; j++ ) {
140 rc = (*mr->smr_match)( &match,
141 SLAP_MR_ATTRIBUTE_SYNTAX_MATCH,
142 ad->ad_type->sat_syntax,
143 mr, &nmods[ i ], &nvals[ j ] );
145 if ( rc != LDAP_SUCCESS ) {
146 nmods[ i + 1 ].bv_val = NULL;
148 snprintf( textbuf, textlen,
149 "%s: matching rule failed",
150 ad->ad_cname.bv_val );
160 snprintf( textbuf, textlen,
161 "%s: value #%d provided more than once",
162 ad->ad_cname.bv_val, i );
163 rc = LDAP_TYPE_OR_VALUE_EXISTS;
164 nmods[ i + 1 ].bv_val = NULL;
169 if ( permissive && matched == j ) {
170 nmods[ i + 1 ].bv_val = NULL;
171 rc = LDAP_TYPE_OR_VALUE_EXISTS;
176 for ( matched = 0, j = 0; j < i; j++ ) {
179 rc = (*mr->smr_match)( &match,
180 SLAP_MR_ATTRIBUTE_SYNTAX_MATCH,
181 ad->ad_type->sat_syntax,
182 mr, &nmods[ i ], &nmods[ j ] );
183 if ( rc != LDAP_SUCCESS ) {
184 nmods[ i + 1 ].bv_val = NULL;
186 snprintf( textbuf, textlen,
187 "%s: matching rule failed",
188 ad->ad_cname.bv_val );
198 snprintf( textbuf, textlen,
199 "%s: value #%d provided more than once",
200 ad->ad_cname.bv_val, j );
201 rc = LDAP_TYPE_OR_VALUE_EXISTS;
202 nmods[ i + 1 ].bv_val = NULL;
207 if ( permissive && matched == j ) {
208 nmods[ i + 1 ].bv_val = NULL;
209 rc = LDAP_TYPE_OR_VALUE_EXISTS;
213 nmods[ i ].bv_val = NULL;
216 * if new values are more than existing values, it is more
217 * convenient to normalize and check all new values first,
218 * then check each new value against existing values, which
219 * can be normalized in place
222 if ( numvals >= nummods ) {
223 for ( j = 0; vals[ j ].bv_val; j++ ) {
224 struct berval asserted;
226 rc = value_normalize( ad, SLAP_MR_EQUALITY,
227 &vals[ j ], &asserted, text );
229 if ( rc != LDAP_SUCCESS ) {
233 for ( matched = 0, i = 0; nmods[ i ].bv_val; i++ ) {
236 rc = (*mr->smr_match)( &match,
237 SLAP_MR_ATTRIBUTE_SYNTAX_MATCH,
238 ad->ad_type->sat_syntax,
239 mr, &nmods[ i ], &asserted );
240 if ( rc != LDAP_SUCCESS ) {
242 snprintf( textbuf, textlen,
243 "%s: matching rule failed",
244 ad->ad_cname.bv_val );
254 snprintf( textbuf, textlen,
255 "%s: value #%d provided more than once",
256 ad->ad_cname.bv_val, j );
257 rc = LDAP_TYPE_OR_VALUE_EXISTS;
262 if ( permissive && matched == i ) {
263 rc = LDAP_TYPE_OR_VALUE_EXISTS;
271 ber_bvarray_free( nvals );
274 ber_bvarray_free( nmods );
287 char *textbuf, size_t textlen
293 MatchingRule *mr = mod->sm_desc->ad_type->sat_equality;
296 switch( mod->sm_op ) {
300 case LDAP_MOD_REPLACE:
308 a = attr_find( e->e_attrs, mod->sm_desc );
311 * With permissive set, as long as the attribute being added
312 * has the same value(s?) as the existing attribute, then the
313 * modify will succeed.
316 /* check if the values we're adding already exist */
317 if( mr == NULL || !mr->smr_match ) {
319 /* do not allow add of additional attribute
320 if no equality rule exists */
322 snprintf( textbuf, textlen,
323 "modify/%s: %s: no equality matching rule",
324 op, mod->sm_desc->ad_cname.bv_val );
325 return LDAP_INAPPROPRIATE_MATCHING;
328 for ( i = 0; mod->sm_bvalues[i].bv_val != NULL; i++ ) {
329 /* test asserted values against existing values */
331 for( matched = 0, j = 0; a->a_vals[j].bv_val != NULL; j++ ) {
332 if ( bvmatch( &mod->sm_bvalues[i], &a->a_vals[j] ) ) {
337 /* value exists already */
339 snprintf( textbuf, textlen,
340 "modify/%s: %s: value #%i already exists",
341 op, mod->sm_desc->ad_cname.bv_val, j );
342 return LDAP_TYPE_OR_VALUE_EXISTS;
345 if ( permissive && matched == j ) {
346 /* values already exist; do nothing */
351 /* test asserted values against themselves */
352 for( j = 0; j < i; j++ ) {
353 if ( bvmatch( &mod->sm_bvalues[i], &mod->sm_bvalues[j] ) ) {
354 /* value exists already */
356 snprintf( textbuf, textlen,
357 "modify/%s: %s: value #%i already exists",
358 op, mod->sm_desc->ad_cname.bv_val, j );
359 return LDAP_TYPE_OR_VALUE_EXISTS;
366 /* no normalization is done in this routine nor
367 * in the matching routines called by this routine.
368 * values are now normalized once on input to the
369 * server (whether from LDAP or from the underlying
371 * This should outperform the old code. No numbers
376 * The original code performs ( n ) normalizations
377 * and ( n * ( n - 1 ) / 2 ) matches, which hide
378 * the same number of normalizations. The new code
379 * performs the same number of normalizations ( n )
380 * and ( n * ( n - 1 ) / 2 ) mem compares, far less
381 * expensive than an entire match, if a match is
382 * equivalent to a normalization and a mem compare ...
384 * This is far more memory expensive than the previous,
385 * but it can heavily improve performances when big
386 * chunks of data are added (typical example is a group
387 * with thousands of DN-syntax members; on my system:
388 * for members of 5-RDN DNs,
390 members orig bvmatch (dirty) new
391 1000 0m38.456s 0m0.553s 0m0.608s
392 2000 2m33.341s 0m0.851s 0m1.003s
394 * Moreover, 100 groups with 10000 members each were
395 * added in 37m27.933s (an analogous LDIF file was
396 * loaded into Active Directory in 38m28.682s, BTW).
398 * Maybe we could switch to the new algorithm when
399 * the number of values overcomes a given threshold?
405 if ( mod->sm_bvalues[1].bv_val == 0 ) {
409 struct berval asserted;
410 rc = value_normalize( mod->sm_desc, SLAP_MR_EQUALITY,
411 &mod->sm_bvalues[ 0 ], &asserted, text );
412 if ( rc != LDAP_SUCCESS ) {
417 for ( matched = 0, i = 0; a->a_vals[ i ].bv_val; i++ ) {
421 if( mod->sm_nvalues ) {
422 rc = value_match( &match, mod->sm_desc, mr,
424 | SLAP_MR_VALUE_OF_ASSERTION_SYNTAX
425 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
426 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
432 rc = value_match( &match, mod->sm_desc, mr,
434 | SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
441 rc = value_match( &match, mod->sm_desc, mr,
442 SLAP_MR_ATTRIBUTE_SYNTAX_MATCH,
448 if( rc == LDAP_SUCCESS && match == 0 ) {
454 free( asserted.bv_val );
457 snprintf( textbuf, textlen,
458 "modify/%s: %s: value #0 already exists",
459 op, mod->sm_desc->ad_cname.bv_val, 0 );
460 return LDAP_TYPE_OR_VALUE_EXISTS;
464 free( asserted.bv_val );
466 if ( permissive && matched == i ) {
467 /* values already exist; do nothing */
473 rc = modify_check_duplicates( mod->sm_desc, mr,
474 a ? a->a_vals : NULL, mod->sm_bvalues,
475 permissive, text, textbuf, textlen );
477 if ( permissive && rc == LDAP_TYPE_OR_VALUE_EXISTS ) {
481 if ( rc != LDAP_SUCCESS ) {
489 if( attr_merge( e, mod->sm_desc, mod->sm_values, mod->sm_nvalues ) != 0 )
491 if( attr_merge( e, mod->sm_desc, mod->sm_bvalues ) != 0 )
494 /* this should return result of attr_merge */
496 snprintf( textbuf, textlen,
497 "modify/%s: %s: merge error",
498 op, mod->sm_desc->ad_cname.bv_val );
506 modify_delete_values(
511 char *textbuf, size_t textlen
514 int i, j, k, rc = LDAP_SUCCESS;
516 MatchingRule *mr = mod->sm_desc->ad_type->sat_equality;
518 BerVarray nvals = NULL;
523 * If permissive is set, then the non-existence of an
524 * attribute is not treated as an error.
527 /* delete the entire attribute */
528 if ( mod->sm_bvalues == NULL ) {
529 rc = attr_delete( &e->e_attrs, mod->sm_desc );
533 } else if( rc != LDAP_SUCCESS ) {
535 snprintf( textbuf, textlen,
536 "modify/delete: %s: no such attribute",
537 mod->sm_desc->ad_cname.bv_val );
538 rc = LDAP_NO_SUCH_ATTRIBUTE;
543 if( mr == NULL || !mr->smr_match ) {
544 /* disallow specific attributes from being deleted if
547 snprintf( textbuf, textlen,
548 "modify/delete: %s: no equality matching rule",
549 mod->sm_desc->ad_cname.bv_val );
550 return LDAP_INAPPROPRIATE_MATCHING;
553 /* delete specific values - find the attribute first */
554 if ( (a = attr_find( e->e_attrs, mod->sm_desc )) == NULL ) {
559 snprintf( textbuf, textlen,
560 "modify/delete: %s: no such attribute",
561 mod->sm_desc->ad_cname.bv_val );
562 return LDAP_NO_SUCH_ATTRIBUTE;
566 /* find each value to delete */
567 for ( j = 0; a->a_vals[ j ].bv_val != NULL; j++ )
568 /* count existing values */ ;
570 nvals = (BerVarray)SLAP_CALLOC( j + 1, sizeof ( struct berval ) );
571 if( nvals == NULL ) {
573 LDAP_LOG( OPERATION, ERR,
574 "modify_delete_values: SLAP_CALLOC failed", 0, 0, 0 );
576 Debug( LDAP_DEBUG_ANY,
577 "modify_delete_values: SLAP_CALLOC failed", 0, 0, 0 );
582 /* normalize existing values */
583 for ( j = 0; a->a_vals[ j ].bv_val != NULL; j++ ) {
584 rc = value_normalize( a->a_desc, SLAP_MR_EQUALITY,
585 &a->a_vals[ j ], &nvals[ j ], text );
587 if ( rc != LDAP_SUCCESS ) {
588 nvals[ j ].bv_val = NULL;
594 for ( i = 0; mod->sm_values[i].bv_val != NULL; i++ ) {
597 struct berval asserted;
599 /* normalize the value to be deleted */
600 rc = value_normalize( mod->sm_desc, SLAP_MR_EQUALITY,
601 &mod->sm_bvalues[ i ], &asserted, text );
603 if( rc != LDAP_SUCCESS ) {
608 for ( j = 0; nvals[ j ].bv_val != NULL; j++ )
610 for ( j = 0; a->a_vals[j].bv_val != NULL; j++ )
616 if ( nvals[j].bv_val == &dummy ) {
622 if( mod->sm_nvalues ) {
623 assert( a->a_nvals );
624 rc = (*mr->smr_match)( &match,
625 SLAP_MR_VALUE_OF_ASSERTION_SYNTAX
626 | SLAP_MR_ASSERTED_VALUE_NORMALIZED_MATCH
627 | SLAP_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH,
628 a->a_desc->ad_type->sat_syntax,
630 &mod->sm_nvalues[i] );
633 assert( a->a_nvals == NULL );
635 rc = (*mr->smr_match)( &match,
636 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
637 a->a_desc->ad_type->sat_syntax,
639 &mod->sm_values[i] );
642 rc = (*mr->smr_match)( &match,
643 SLAP_MR_ATTRIBUTE_SYNTAX_MATCH,
644 a->a_desc->ad_type->sat_syntax,
649 if ( rc != LDAP_SUCCESS ) {
651 free( asserted.bv_val );
654 snprintf( textbuf, textlen,
655 "%s: matching rule failed",
656 mod->sm_desc->ad_cname.bv_val );
666 /* delete value and mark it as dummy */
668 free( a->a_vals[j].bv_val );
669 a->a_vals[j].bv_val = &dummy;
670 if( a->a_nvals != a->a_vals ) {
671 free( a->a_nvals[j].bv_val );
672 a->a_nvals[j].bv_val = &dummy;
675 free( nvals[ j ].bv_val );
676 nvals[ j ].bv_val = &dummy;
683 free( asserted.bv_val );
688 snprintf( textbuf, textlen,
689 "modify/delete: %s: no such value",
690 mod->sm_desc->ad_cname.bv_val );
691 rc = LDAP_NO_SUCH_ATTRIBUTE;
696 /* compact array skipping dummies */
698 for ( k = 0, j = 0; a->a_vals[k].bv_val != NULL; k++ )
700 for ( k = 0, j = 0; nvals[k].bv_val != NULL; j++, k++ )
705 if( a->a_vals[k].bv_val == &dummy ) {
706 assert( a->a_nvals == NULL || a->a_nvals[k].bv_val == &dummy );
710 /* delete and skip dummies */ ;
711 for ( ; nvals[ k ].bv_val == &dummy; k++ ) {
712 free( a->a_vals[ k ].bv_val );
716 a->a_vals[ j ] = a->a_vals[ k ];
718 if (a->a_nvals != a->a_vals) {
719 a->a_nvals[ j ] = a->a_nvals[ k ];
725 if ( a->a_vals[ k ].bv_val == NULL ) {
733 a->a_vals[j].bv_val = NULL;
735 if (a->a_nvals != a->a_vals) a->a_nvals[j].bv_val = NULL;
738 assert( i == k - j );
741 /* if no values remain, delete the entire attribute */
742 if ( a->a_vals[0].bv_val == NULL ) {
743 if ( attr_delete( &e->e_attrs, mod->sm_desc ) ) {
745 snprintf( textbuf, textlen,
746 "modify/delete: %s: no such attribute",
747 mod->sm_desc->ad_cname.bv_val );
748 rc = LDAP_NO_SUCH_ATTRIBUTE;
755 /* delete the remaining normalized values */
756 for ( j = 0; nvals[ j ].bv_val != NULL; j++ ) {
757 if ( nvals[ j ].bv_val != &dummy ) {
758 ber_memfree( nvals[ j ].bv_val );
761 ber_memfree( nvals );
769 modify_replace_values(
774 char *textbuf, size_t textlen
777 (void) attr_delete( &e->e_attrs, mod->sm_desc );
779 if ( mod->sm_bvalues ) {
780 return modify_add_values( e, mod, permissive, text, textbuf, textlen );
792 if ( mod->sm_values != NULL ) ber_bvarray_free( mod->sm_values );
793 mod->sm_values = NULL;
796 if ( mod->sm_nvalues != NULL ) ber_bvarray_free( mod->sm_nvalues );
797 mod->sm_nvalues = NULL;
800 if( freeit ) free( mod );
810 for ( ; ml != NULL; ml = next ) {
813 slap_mod_free( &ml->sml_mod, 0 );