1 /* attr.c - routines for dealing with attributes */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2006 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>.
16 /* Portions Copyright (c) 1995 Regents of the University of Michigan.
17 * All rights reserved.
19 * Redistribution and use in source and binary forms are permitted
20 * provided that this notice is preserved and that due credit is given
21 * to the University of Michigan at Ann Arbor. The name of the University
22 * may not be used to endorse or promote products derived from this
23 * software without specific prior written permission. This software
24 * is provided ``as is'' without express or implied warranty.
37 #include <ac/socket.h>
38 #include <ac/string.h>
44 * Allocate in chunks, minimum of 1000 at a time.
46 #define CHUNK_SIZE 1000
47 typedef struct slap_list {
48 struct slap_list *next;
50 static slap_list *attr_chunks;
51 static Attribute *attr_list;
52 static ldap_pvt_thread_mutex_t attr_mutex;
55 attr_prealloc( int num )
62 s = ch_calloc( 1, sizeof(slap_list) + num * sizeof(Attribute));
63 s->next = attr_chunks;
66 a = (Attribute *)(s+1);
67 for ( ;num>1; num--) {
71 a->a_next = attr_list;
72 attr_list = (Attribute *)(s+1);
78 attr_alloc( AttributeDescription *ad )
82 ldap_pvt_thread_mutex_lock( &attr_mutex );
84 attr_prealloc( CHUNK_SIZE );
86 attr_list = a->a_next;
88 ldap_pvt_thread_mutex_unlock( &attr_mutex );
95 /* Return a list of num attrs */
97 attrs_alloc( int num )
99 Attribute *head = NULL;
102 ldap_pvt_thread_mutex_lock( &attr_mutex );
103 for ( a = &attr_list; *a && num > 0; a = &(*a)->a_next ) {
110 attr_prealloc( num > CHUNK_SIZE ? num : CHUNK_SIZE );
112 for ( ; *a && num > 0; a = &(*a)->a_next ) {
120 ldap_pvt_thread_mutex_unlock( &attr_mutex );
127 attr_clean( Attribute *a )
129 if ( a->a_nvals && a->a_nvals != a->a_vals &&
130 !( a->a_flags & SLAP_ATTR_DONT_FREE_VALS )) {
131 if ( a->a_flags & SLAP_ATTR_DONT_FREE_DATA ) {
134 ber_bvarray_free( a->a_nvals );
137 /* a_vals may be equal to slap_dummy_bv, a static empty berval;
138 * this is used as a placeholder for attributes that do not carry
139 * values, e.g. when proxying search entries with the "attrsonly"
141 if ( a->a_vals != &slap_dummy_bv &&
142 !( a->a_flags & SLAP_ATTR_DONT_FREE_VALS )) {
143 if ( a->a_flags & SLAP_ATTR_DONT_FREE_DATA ) {
146 ber_bvarray_free( a->a_vals );
152 #ifdef LDAP_COMP_MATCH
153 a->a_comp_data = NULL;
159 attr_free( Attribute *a )
162 ldap_pvt_thread_mutex_lock( &attr_mutex );
163 a->a_next = attr_list;
165 ldap_pvt_thread_mutex_unlock( &attr_mutex );
168 #ifdef LDAP_COMP_MATCH
170 comp_tree_free( Attribute *a )
174 for( ; a != NULL ; a = next ) {
176 if ( component_destructor && a->a_comp_data ) {
177 if ( a->a_comp_data->cd_mem_op )
178 component_destructor( a->a_comp_data->cd_mem_op );
179 free ( a->a_comp_data );
186 attrs_free( Attribute *a )
191 for(b = a ; ; b = b->a_next ) {
196 ldap_pvt_thread_mutex_lock( &attr_mutex );
197 b->a_next = attr_list;
199 ldap_pvt_thread_mutex_unlock( &attr_mutex );
204 attr_dup2( Attribute *tmp, Attribute *a )
206 if ( a->a_vals != NULL ) {
209 for ( i = 0; !BER_BVISNULL( &a->a_vals[i] ); i++ ) {
213 tmp->a_vals = ch_malloc( (i + 1) * sizeof(struct berval) );
214 for ( i = 0; !BER_BVISNULL( &a->a_vals[i] ); i++ ) {
215 ber_dupbv( &tmp->a_vals[i], &a->a_vals[i] );
216 if ( BER_BVISNULL( &tmp->a_vals[i] ) ) break;
219 BER_BVZERO( &tmp->a_vals[i] );
221 /* a_nvals must be non null; it may be equal to a_vals */
222 assert( a->a_nvals != NULL );
224 if ( a->a_nvals != a->a_vals ) {
227 tmp->a_nvals = ch_malloc( (i + 1) * sizeof(struct berval) );
228 for ( j = 0; !BER_BVISNULL( &a->a_nvals[j] ); j++ ) {
230 ber_dupbv( &tmp->a_nvals[j], &a->a_nvals[j] );
231 if ( BER_BVISNULL( &tmp->a_nvals[j] ) ) break;
235 BER_BVZERO( &tmp->a_nvals[j] );
238 tmp->a_nvals = tmp->a_vals;
244 attr_dup( Attribute *a )
248 if ( a == NULL) return NULL;
250 tmp = attr_alloc( a->a_desc );
256 attrs_dup( Attribute *a )
259 Attribute *tmp, *anew;
261 if( a == NULL ) return NULL;
264 for( tmp=a,i=0; tmp; tmp=tmp->a_next ) {
268 anew = attrs_alloc( i );
270 for( tmp=anew; a; a=a->a_next ) {
271 tmp->a_desc = a->a_desc;
281 * attr_merge - merge the given type and value with the list of
282 * attributes in attrs.
284 * nvals must be NULL if the attribute has no normalizer.
285 * In this case, a->a_nvals will be set equal to a->a_vals.
287 * returns 0 everything went ok
294 AttributeDescription *desc,
302 for ( a = &e->e_attrs; *a != NULL; a = &(*a)->a_next ) {
303 if ( (*a)->a_desc == desc ) {
309 *a = attr_alloc( desc );
312 * FIXME: if the attribute already exists, the presence
313 * of nvals and the value of (*a)->a_nvals must be consistent
315 assert( ( nvals == NULL && (*a)->a_nvals == (*a)->a_vals )
316 || ( nvals != NULL && (
317 ( (*a)->a_vals == NULL && (*a)->a_nvals == NULL )
318 || ( (*a)->a_nvals != (*a)->a_vals ) ) ) );
321 rc = value_add( &(*a)->a_vals, vals );
323 if ( rc == LDAP_SUCCESS ) {
325 rc = value_add( &(*a)->a_nvals, nvals );
326 /* FIXME: what if rc != LDAP_SUCCESS ? */
328 (*a)->a_nvals = (*a)->a_vals;
336 * if a normalization function is defined for the equality matchingRule
337 * of desc, the value is normalized and stored in nval; otherwise nval
342 AttributeDescription *desc,
347 int rc = LDAP_SUCCESS;
348 BerVarray nvals = NULL;
352 if ( desc->ad_type->sat_equality &&
353 desc->ad_type->sat_equality->smr_normalize )
357 for ( i = 0; !BER_BVISNULL( &vals[i] ); i++ );
359 nvals = slap_sl_calloc( sizeof(struct berval), i + 1, memctx );
360 for ( i = 0; !BER_BVISNULL( &vals[i] ); i++ ) {
361 rc = desc->ad_type->sat_equality->smr_normalize(
362 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
363 desc->ad_type->sat_syntax,
364 desc->ad_type->sat_equality,
365 &vals[i], &nvals[i], memctx );
367 if ( rc != LDAP_SUCCESS ) {
368 BER_BVZERO( &nvals[i + 1] );
372 BER_BVZERO( &nvals[i] );
377 if ( rc != LDAP_SUCCESS && nvals != NULL ) {
378 ber_bvarray_free_x( nvals, memctx );
385 attr_merge_normalize(
387 AttributeDescription *desc,
391 BerVarray nvals = NULL;
394 rc = attr_normalize( desc, vals, &nvals, memctx );
395 if ( rc == LDAP_SUCCESS ) {
396 rc = attr_merge( e, desc, vals, nvals );
397 if ( nvals != NULL ) {
398 ber_bvarray_free_x( nvals, memctx );
408 AttributeDescription *desc,
410 struct berval *nval )
415 for ( a = &e->e_attrs; *a != NULL; a = &(*a)->a_next ) {
416 if ( (*a)->a_desc == desc ) {
422 *a = attr_alloc( desc );
425 rc = value_add_one( &(*a)->a_vals, val );
427 if ( rc == LDAP_SUCCESS ) {
429 rc = value_add_one( &(*a)->a_nvals, nval );
430 /* FIXME: what if rc != LDAP_SUCCESS ? */
432 (*a)->a_nvals = (*a)->a_vals;
439 * if a normalization function is defined for the equality matchingRule
440 * of desc, the value is normalized and stored in nval; otherwise nval
445 AttributeDescription *desc,
450 int rc = LDAP_SUCCESS;
454 if ( desc->ad_type->sat_equality &&
455 desc->ad_type->sat_equality->smr_normalize )
457 rc = desc->ad_type->sat_equality->smr_normalize(
458 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
459 desc->ad_type->sat_syntax,
460 desc->ad_type->sat_equality,
463 if ( rc != LDAP_SUCCESS ) {
472 attr_merge_normalize_one(
474 AttributeDescription *desc,
478 struct berval nval = BER_BVNULL;
479 struct berval *nvalp = NULL;
482 rc = attr_normalize_one( desc, val, &nval, memctx );
483 if ( rc == LDAP_SUCCESS && !BER_BVISNULL( &nval ) ) {
487 rc = attr_merge_one( e, desc, val, nvalp );
488 if ( nvalp != NULL ) {
489 slap_sl_free( nval.bv_val, memctx );
495 * attrs_find - find attribute(s) by AttributeDescription
496 * returns next attribute which is subtype of provided description.
502 AttributeDescription *desc )
504 for ( ; a != NULL; a = a->a_next ) {
505 if ( is_ad_subtype( a->a_desc, desc ) ) {
514 * attr_find - find attribute by type
520 AttributeDescription *desc )
522 for ( ; a != NULL; a = a->a_next ) {
523 if ( a->a_desc == desc ) {
532 * attr_delete - delete the attribute type in list pointed to by attrs
533 * return 0 deleted ok
534 * 1 not found in list a
535 * -1 something bad happened
541 AttributeDescription *desc )
545 for ( a = attrs; *a != NULL; a = &(*a)->a_next ) {
546 if ( (*a)->a_desc == desc ) {
547 Attribute *save = *a;
555 return LDAP_NO_SUCH_ATTRIBUTE;
561 ldap_pvt_thread_mutex_init( &attr_mutex );
570 for ( a=attr_chunks; a; a=attr_chunks ) {
571 attr_chunks = a->next;
574 ldap_pvt_thread_mutex_destroy( &attr_mutex );