1 /* value.c - routines for dealing with values */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2005 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
17 * Copyright (c) 1995 Regents of the University of Michigan.
18 * All rights reserved.
20 * Redistribution and use in source and binary forms are permitted
21 * provided that this notice is preserved and that due credit is given
22 * to the University of Michigan at Ann Arbor. The name of the University
23 * may not be used to endorse or promote products derived from this
24 * software without specific prior written permission. This software
25 * is provided ``as is'' without express or implied warranty.
33 #include <ac/socket.h>
34 #include <ac/string.h>
49 if ( addvals != NULL ) {
50 for ( ; !BER_BVISNULL( &addvals[nn] ); nn++ )
54 if ( *vals == NULL ) {
55 *vals = (BerVarray) SLAP_MALLOC( (nn + 1)
56 * sizeof(struct berval) );
58 Debug(LDAP_DEBUG_TRACE,
59 "value_add: SLAP_MALLOC failed.\n", 0, 0, 0 );
60 return LBER_ERROR_MEMORY;
65 for ( n = 0; !BER_BVISNULL( &(*vals)[n] ); n++ ) {
68 *vals = (BerVarray) SLAP_REALLOC( (char *) *vals,
69 (n + nn + 1) * sizeof(struct berval) );
71 Debug(LDAP_DEBUG_TRACE,
72 "value_add: SLAP_MALLOC failed.\n", 0, 0, 0 );
73 return LBER_ERROR_MEMORY;
78 for ( ; !BER_BVISNULL( addvals ); v2++, addvals++ ) {
79 ber_dupbv( v2, addvals );
80 if ( BER_BVISNULL( v2 ) ) break;
90 struct berval *addval )
95 if ( *vals == NULL ) {
96 *vals = (BerVarray) SLAP_MALLOC( 2 * sizeof(struct berval) );
98 Debug(LDAP_DEBUG_TRACE,
99 "value_add_one: SLAP_MALLOC failed.\n", 0, 0, 0 );
100 return LBER_ERROR_MEMORY;
105 for ( n = 0; !BER_BVISNULL( &(*vals)[n] ); n++ ) {
108 *vals = (BerVarray) SLAP_REALLOC( (char *) *vals,
109 (n + 2) * sizeof(struct berval) );
110 if( *vals == NULL ) {
111 Debug(LDAP_DEBUG_TRACE,
112 "value_add_one: SLAP_MALLOC failed.\n", 0, 0, 0 );
113 return LBER_ERROR_MEMORY;
118 ber_dupbv(v2, addval);
126 int asserted_value_validate_normalize(
127 AttributeDescription *ad,
139 /* we expect the value to be in the assertion syntax */
140 assert( !SLAP_MR_IS_VALUE_OF_ATTRIBUTE_SYNTAX(usage) );
143 *text = "inappropriate matching request";
144 return LDAP_INAPPROPRIATE_MATCHING;
147 if( !mr->smr_match ) {
148 *text = "requested matching rule not supported";
149 return LDAP_INAPPROPRIATE_MATCHING;
152 if( mr->smr_syntax->ssyn_pretty ) {
153 rc = (mr->smr_syntax->ssyn_pretty)( mr->smr_syntax, in, &pval, ctx );
157 rc = (mr->smr_syntax->ssyn_validate)( mr->smr_syntax, in );
160 if( rc != LDAP_SUCCESS ) {
161 *text = "value does not conform to assertion syntax";
162 return LDAP_INVALID_SYNTAX;
165 if( mr->smr_normalize ) {
166 rc = (mr->smr_normalize)(
167 usage|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX,
168 ad ? ad->ad_type->sat_syntax : NULL,
171 if( pval.bv_val ) ber_memfree_x( pval.bv_val, ctx );
173 if( rc != LDAP_SUCCESS ) {
174 *text = "unable to normalize value for matching";
175 return LDAP_INVALID_SYNTAX;
178 } else if ( pval.bv_val != NULL ) {
182 ber_dupbv_x( out, in, ctx );
191 AttributeDescription *ad,
194 struct berval *v1, /* stored value */
195 void *v2, /* assertion */
200 assert( mr != NULL );
202 if( !mr->smr_match ) {
203 return LDAP_INAPPROPRIATE_MATCHING;
206 rc = (mr->smr_match)( match, flags,
207 ad->ad_type->sat_syntax, mr, v1, v2 );
213 AttributeDescription *ad,
221 struct berval nval = BER_BVNULL;
222 MatchingRule *mr = ad->ad_type->sat_equality;
224 if( mr == NULL || !mr->smr_match ) {
225 return LDAP_INAPPROPRIATE_MATCHING;
228 assert(SLAP_IS_MR_ATTRIBUTE_VALUE_NORMALIZED_MATCH( flags ));
230 if( !SLAP_IS_MR_ASSERTED_VALUE_NORMALIZED_MATCH( flags ) &&
233 rc = (mr->smr_normalize)(
234 flags & (SLAP_MR_TYPE_MASK|SLAP_MR_SUBTYPE_MASK|SLAP_MR_VALUE_OF_SYNTAX),
235 ad ? ad->ad_type->sat_syntax : NULL,
236 mr, val, &nval, ctx );
238 if( rc != LDAP_SUCCESS ) {
239 return LDAP_INVALID_SYNTAX;
243 for ( i = 0; vals[i].bv_val != NULL; i++ ) {
247 rc = value_match( &match, ad, mr, flags,
248 &vals[i], nval.bv_val == NULL ? val : &nval, &text );
250 if( rc == LDAP_SUCCESS && match == 0 ) {
251 slap_sl_free( nval.bv_val, ctx );
256 slap_sl_free( nval.bv_val, ctx );
257 return LDAP_NO_SUCH_ATTRIBUTE;
260 /* assign new indexes to an attribute's ordered values */
262 ordered_value_renumber( Attribute *a, int vals )
264 char *ptr, ibuf[64]; /* many digits */
265 struct berval ibv, tmp, vtmp;
270 for (i=0; i<vals; i++) {
271 ibv.bv_len = sprintf(ibv.bv_val, "{%d}", i);
273 if ( vtmp.bv_val[0] == '{' ) {
274 ptr = ber_bvchr(&vtmp, '}') + 1;
275 assert( ptr != NULL );
276 vtmp.bv_len -= ptr - vtmp.bv_val;
279 tmp.bv_len = ibv.bv_len + vtmp.bv_len;
280 tmp.bv_val = ch_malloc( tmp.bv_len + 1 );
281 strcpy( tmp.bv_val, ibv.bv_val );
282 AC_MEMCPY( tmp.bv_val + ibv.bv_len, vtmp.bv_val, vtmp.bv_len );
283 tmp.bv_val[tmp.bv_len] = '\0';
284 ch_free( a->a_vals[i].bv_val );
287 if ( a->a_nvals && a->a_nvals != a->a_vals ) {
288 vtmp = a->a_nvals[i];
289 if ( vtmp.bv_val[0] == '{' ) {
290 ptr = ber_bvchr(&vtmp, '}') + 1;
291 assert( ptr != NULL );
292 vtmp.bv_len -= ptr - vtmp.bv_val;
295 tmp.bv_len = ibv.bv_len + vtmp.bv_len;
296 tmp.bv_val = ch_malloc( tmp.bv_len + 1 );
297 strcpy( tmp.bv_val, ibv.bv_val );
298 AC_MEMCPY( tmp.bv_val + ibv.bv_len, vtmp.bv_val, vtmp.bv_len );
299 tmp.bv_val[tmp.bv_len] = '\0';
300 ch_free( a->a_nvals[i].bv_val );
306 /* Sort the values in an X-ORDERED VALUES attribute.
307 * If the values have no index, index them in their given order.
308 * If the values have indexes, sort them.
309 * If some are indexed and some are not, return Error.
312 ordered_value_sort( Attribute *a, int do_renumber )
315 int index = 0, noindex = 0, renumber = 0, gotnvals = 0;
318 if ( a->a_nvals && a->a_nvals != a->a_vals )
321 /* count attrs, look for index */
322 for (i=0; a->a_vals[i].bv_val; i++) {
323 if ( a->a_vals[i].bv_val[0] == '{' ) {
326 ptr = ber_bvchr( &a->a_vals[i], '}' );
328 return LDAP_INVALID_SYNTAX;
330 return LDAP_INVALID_SYNTAX;
334 return LDAP_INVALID_SYNTAX;
339 /* If values have indexes, sort the values */
341 int *indexes, j, idx;
345 /* Strip index from normalized values */
346 if ( !a->a_nvals || a->a_vals == a->a_nvals ) {
347 a->a_nvals = ch_malloc( (vals+1)*sizeof(struct berval));
348 BER_BVZERO(a->a_nvals+vals);
349 for ( i=0; i<vals; i++ ) {
350 ptr = ber_bvchr(&a->a_vals[i], '}') + 1;
351 a->a_nvals[i].bv_len = a->a_vals[i].bv_len -
352 (ptr - a->a_vals[i].bv_val);
353 a->a_nvals[i].bv_val = ch_malloc( a->a_nvals[i].bv_len + 1);
354 strcpy(a->a_nvals[i].bv_val, ptr );
357 for ( i=0; i<vals; i++ ) {
358 ptr = ber_bvchr(&a->a_nvals[i], '}') + 1;
359 a->a_nvals[i].bv_len -= ptr - a->a_nvals[i].bv_val;
360 strcpy(a->a_nvals[i].bv_val, ptr);
365 indexes = ch_malloc( vals * sizeof(int) );
366 for ( i=0; i<vals; i++) {
368 indexes[i] = strtol(a->a_vals[i].bv_val+1, &ptr, 0);
371 return LDAP_INVALID_SYNTAX;
376 for ( i=1; i<vals; i++ ) {
379 if ( gotnvals ) ntmp = a->a_nvals[i];
381 while ((j > 0) && (indexes[j-1] > idx)) {
382 indexes[j] = indexes[j-1];
383 a->a_vals[j] = a->a_vals[j-1];
384 if ( gotnvals ) a->a_nvals[j] = a->a_nvals[j-1];
389 if ( gotnvals ) a->a_nvals[j] = ntmp;
392 /* If range is not contiguous, must renumber */
393 if ( indexes[0] != 0 || indexes[vals-1] != vals-1 ) {
401 if ( do_renumber && renumber )
402 ordered_value_renumber( a, vals );
408 * wrapper for validate function
409 * uses the validate function of the syntax after removing
410 * the index, if allowed an present
413 ordered_value_validate(
414 AttributeDescription *ad,
417 struct berval bv = *in;
419 assert( ad->ad_type->sat_syntax != NULL );
420 assert( ad->ad_type->sat_syntax->ssyn_validate != NULL );
422 if ( ad->ad_type->sat_flags & SLAP_AT_ORDERED ) {
424 /* Skip past the assertion index */
425 if ( bv.bv_val[0] == '{' ) {
428 ptr = ber_bvchr( &bv, '}' );
430 return LDAP_INVALID_SYNTAX;
433 bv.bv_len -= ptr - bv.bv_val;
439 return ad->ad_type->sat_syntax->ssyn_validate( ad->ad_type->sat_syntax, in );
443 * wrapper for pretty function
444 * uses the pretty function of the syntax after removing
445 * the index, if allowed and present; in case, it's prepended
446 * to the pretty value
449 ordered_value_pretty(
450 AttributeDescription *ad,
455 struct berval bv = *val,
459 assert( ad->ad_type->sat_syntax != NULL );
460 assert( ad->ad_type->sat_syntax->ssyn_pretty != NULL );
461 assert( val != NULL );
462 assert( out != NULL );
464 if ( ad->ad_type->sat_flags & SLAP_AT_ORDERED ) {
466 /* Skip past the assertion index */
467 if ( bv.bv_val[0] == '{' ) {
470 ptr = ber_bvchr( &bv, '}' );
472 return LDAP_INVALID_SYNTAX;
477 idx.bv_len = ptr - bv.bv_val;
479 bv.bv_len -= idx.bv_len;
486 rc = ad->ad_type->sat_syntax->ssyn_pretty( ad->ad_type->sat_syntax, val, out, ctx );
488 if ( rc == LDAP_SUCCESS && !BER_BVISNULL( &idx ) ) {
491 out->bv_len = idx.bv_len + bv.bv_len;
492 out->bv_val = ber_memalloc_x( out->bv_len + 1, ctx );
494 AC_MEMCPY( out->bv_val, idx.bv_val, idx.bv_len );
495 AC_MEMCPY( &out->bv_val[ idx.bv_len ], bv.bv_val, bv.bv_len + 1 );
497 ber_memfree_x( bv.bv_val, ctx );
504 * wrapper for normalize function
505 * uses the normalize function of the attribute description equality rule
506 * after removing the index, if allowed and present; in case, it's
507 * prepended to the value
510 ordered_value_normalize(
512 AttributeDescription *ad,
515 struct berval *normalized,
518 struct berval bv = *val,
522 assert( ad->ad_type->sat_equality != NULL );
523 assert( ad->ad_type->sat_equality->smr_normalize != NULL );
524 assert( val != NULL );
525 assert( normalized != NULL );
527 if ( ad->ad_type->sat_flags & SLAP_AT_ORDERED ) {
529 /* Skip past the assertion index */
530 if ( bv.bv_val[ 0 ] == '{' ) {
533 ptr = ber_bvchr( &bv, '}' );
535 return LDAP_INVALID_SYNTAX;
540 idx.bv_len = ptr - bv.bv_val;
542 bv.bv_len -= idx.bv_len;
549 rc = ad->ad_type->sat_equality->smr_normalize( usage,
550 ad->ad_type->sat_syntax, mr, val, normalized, ctx );
552 if ( rc == LDAP_SUCCESS && !BER_BVISNULL( &idx ) ) {
555 normalized->bv_len = idx.bv_len + bv.bv_len;
556 normalized->bv_val = ber_memalloc_x( normalized->bv_len + 1, ctx );
558 AC_MEMCPY( normalized->bv_val, idx.bv_val, idx.bv_len );
559 AC_MEMCPY( &normalized->bv_val[ idx.bv_len ], bv.bv_val, bv.bv_len + 1 );
561 ber_memfree_x( bv.bv_val, ctx );
567 /* A wrapper for value match, handles Equality matches for attributes
568 * with ordered values.
573 AttributeDescription *ad,
576 struct berval *v1, /* stored value */
577 struct berval *v2, /* assertion */
580 struct berval bv1, bv2;
582 /* X-ORDERED VALUES equality matching:
583 * If (SLAP_MR_IS_VALUE_OF_ATTRIBUTE_SYNTAX) that means we are
584 * comparing two attribute values. In this case, we want to ignore
585 * the ordering index of both values, we just want to know if their
586 * main values are equal.
588 * If (SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX) then we are comparing
589 * an assertion against an attribute value.
590 * If the assertion has no index, the index of the value is ignored.
591 * If the assertion has only an index, the remainder of the value is
593 * If the assertion has index and value, both are compared.
595 if ( ad->ad_type->sat_flags & SLAP_AT_ORDERED ) {
603 /* Skip past the assertion index */
604 if ( bv2.bv_val[0] == '{' ) {
605 ptr = ber_bvchr( &bv2, '}' );
607 return LDAP_INVALID_SYNTAX;
610 bv2.bv_len -= ptr - bv2.bv_val;
615 if ( SLAP_MR_IS_VALUE_OF_ASSERTION_SYNTAX( flags )) {
616 if ( iv.bv_val[0] == '{' && bv1.bv_val[0] == '{' ) {
617 /* compare index values first */
620 l1 = strtol( bv1.bv_val+1, NULL, 0 );
621 l2 = strtol( iv.bv_val+1, &ptr, 0 );
625 /* If not equal, or we're only comparing the index,
628 if ( ret || ptr == iv.bv_val + iv.bv_len - 1 ) {
629 *match = ( ret < 0 ) ? -1 : (ret > 0 );
634 /* Skip past the attribute index */
635 if ( bv1.bv_val[0] == '{' ) {
636 ptr = ber_bvchr( &bv1, '}' );
638 return LDAP_INVALID_SYNTAX;
641 bv1.bv_len -= ptr - bv1.bv_val;
647 if ( !mr || !mr->smr_match ) {
648 *match = ber_bvcmp( v1, v2 );
652 return value_match( match, ad, mr, flags, v1, v2, text );
658 AttributeDescription *ad,
664 int i, j, k, anum, vnum;
665 BerVarray new, nnew = NULL;
668 for (i=0; !BER_BVISNULL( vals+i ); i++) ;
672 for (i=0; !BER_BVISNULL( a->a_vals+i ); i++) ;
674 ordered_value_sort( a, 0 );
678 for ( ap=&e->e_attrs; *ap; ap = &(*ap)->a_next ) ;
679 a = ch_calloc( 1, sizeof(Attribute) );
684 new = ch_malloc( (anum+vnum+1) * sizeof(struct berval));
685 if ( a->a_nvals && a->a_nvals != a->a_vals ) {
686 nnew = ch_malloc( (anum+vnum+1) * sizeof(struct berval));
687 /* Shouldn't happen... */
688 if ( !nvals ) nvals = vals;
691 AC_MEMCPY( new, a->a_vals, anum * sizeof(struct berval));
693 AC_MEMCPY( nnew, a->a_nvals, anum * sizeof(struct berval));
696 for (i=0; i<vnum; i++) {
700 if ( vals[i].bv_val[0] == '{' ) {
701 k = strtol( vals[i].bv_val+1, &next, 0 );
702 if ( next == vals[i].bv_val + 1 ||
704 next - vals[i].bv_val > vals[i].bv_len )
708 if ( k > anum ) k = -1;
710 /* No index, or index is greater than current number of
711 * values, just tack onto the end
714 ber_dupbv( new+anum, vals+i );
715 if ( nnew ) ber_dupbv( nnew+anum, nvals+i );
717 /* Indexed, push everything else down one and insert */
719 for (j=anum; j>k; j--) {
721 if ( nnew ) nnew[j] = nnew[j-1];
723 ber_dupbv( new+k, vals+i );
724 if ( nnew ) ber_dupbv( nnew+k, nvals+i );
728 BER_BVZERO( new+anum );
729 ch_free( a->a_vals );
732 BER_BVZERO( nnew+anum );
733 ch_free( a->a_nvals );
736 a->a_nvals = a->a_vals;
739 ordered_value_renumber( a, anum );