3 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
6 /* at.c - routines for dealing with attribute types */
14 #include <ac/socket.h>
15 #include <ac/string.h>
26 for( ; at != NULL; at = at->sat_sup ) {
27 if( at->sat_syntax_oid ) {
28 return ( strcmp( at->sat_syntax_oid, oid ) == 0 );
39 for( ; sub != NULL; sub = sub->sat_sup ) {
40 if( sub == sup ) return 1;
47 struct berval air_name;
48 AttributeType *air_at;
51 static Avlnode *attr_index = NULL;
52 static AttributeType *attr_list = NULL;
56 struct aindexrec *air1,
57 struct aindexrec *air2
60 int i = air1->air_name.bv_len - air2->air_name.bv_len;
63 return (strcasecmp( air1->air_name.bv_val, air2->air_name.bv_val ));
72 int i = type->bv_len - air->air_name.bv_len;
75 return (strncasecmp( type->bv_val, air->air_name.bv_val,
86 bv.bv_val = (char *)name;
87 bv.bv_len = strlen( name );
89 return at_bvfind( &bv );
97 struct aindexrec *air;
99 air = (struct aindexrec *) avl_find( attr_index, name,
100 (AVL_CMP) attr_index_name_cmp );
102 return air != NULL ? air->air_at : NULL;
108 AttributeType ***listp
111 AttributeType **list;
112 AttributeType **list1;
118 list = ch_calloc(size, sizeof(AttributeType *));
130 list1 = ch_realloc(list, size*sizeof(AttributeType *));
145 AttributeType ***listp
148 AttributeType **list;
149 AttributeType **list1;
157 for ( i=0; list[i]; i++ )
162 for ( i=pos, j=pos+1; list[j]; i++, j++ ) {
166 /* Tell the runtime this can be shrinked */
167 list1 = ch_realloc(list, (i+1)*sizeof(AttributeType **));
186 for ( i=0; list[i]; i++ ) {
187 if ( sat == list[i] ) {
197 AttributeType *a, *n;
198 avl_free(attr_index, ldap_memfree);
200 for (a=attr_list; a; a=n) {
202 if (a->sat_subtypes) ldap_memfree(a->sat_subtypes);
203 ad_destroy(a->sat_ad);
204 ldap_pvt_thread_mutex_destroy(&a->sat_ad_mutex);
205 ldap_attributetype_free((LDAPAttributeType *)a);
207 ad_destroy(slap_schema.si_at_undefined->sat_ad);
217 struct aindexrec *air;
221 while ( *atp != NULL ) {
222 atp = &(*atp)->sat_next;
226 if ( sat->sat_oid ) {
227 air = (struct aindexrec *)
228 ch_calloc( 1, sizeof(struct aindexrec) );
229 air->air_name.bv_val = sat->sat_oid;
230 air->air_name.bv_len = strlen(sat->sat_oid);
232 if ( avl_insert( &attr_index, (caddr_t) air,
233 (AVL_CMP) attr_index_cmp,
234 (AVL_DUP) avl_dup_error ) ) {
237 return SLAP_SCHERR_DUP_ATTR;
239 /* FIX: temporal consistency check */
240 at_bvfind(&air->air_name);
243 if ( (names = sat->sat_names) ) {
245 air = (struct aindexrec *)
246 ch_calloc( 1, sizeof(struct aindexrec) );
247 air->air_name.bv_val = *names;
248 air->air_name.bv_len = strlen(*names);
250 if ( avl_insert( &attr_index, (caddr_t) air,
251 (AVL_CMP) attr_index_cmp,
252 (AVL_DUP) avl_dup_error ) ) {
255 return SLAP_SCHERR_DUP_ATTR;
257 /* FIX: temporal consistency check */
258 at_bvfind(&air->air_name);
268 LDAPAttributeType *at,
278 if ( at->at_names && at->at_names[0] ) {
281 for( i=0; at->at_names[i]; i++ ) {
282 if( !slap_valid_descr( at->at_names[i] ) ) {
283 return SLAP_SCHERR_BAD_DESCR;
287 cname = at->at_names[0];
289 } else if ( at->at_oid ) {
292 return SLAP_SCHERR_ATTR_INCOMPLETE;
295 if ( at->at_collective ) {
296 return SLAP_SCHERR_NOT_SUPPORTED;
299 sat = (AttributeType *) ch_calloc( 1, sizeof(AttributeType) );
300 AC_MEMCPY( &sat->sat_atype, at, sizeof(LDAPAttributeType));
302 sat->sat_cname.bv_val = cname;
303 sat->sat_cname.bv_len = strlen( cname );
304 ldap_pvt_thread_mutex_init(&sat->sat_ad_mutex);
306 if ( at->at_sup_oid ) {
307 AttributeType *supsat = at_find(at->at_sup_oid);
309 if ( (supsat == NULL ) ) {
310 *err = at->at_sup_oid;
311 return SLAP_SCHERR_ATTR_NOT_FOUND;
314 sat->sat_sup = supsat;
316 if ( at_append_to_list(sat, &supsat->sat_subtypes) ) {
318 return SLAP_SCHERR_OUTOFMEM;
323 * Inherit definitions from superiors. We only check the
324 * direct superior since that one has already inherited from
327 if ( sat->sat_sup ) {
328 sat->sat_syntax = sat->sat_sup->sat_syntax;
329 sat->sat_equality = sat->sat_sup->sat_equality;
330 sat->sat_approx = sat->sat_sup->sat_approx;
331 sat->sat_ordering = sat->sat_sup->sat_ordering;
332 sat->sat_substr = sat->sat_sup->sat_substr;
335 if ( at->at_syntax_oid ) {
336 if ( (syn = syn_find(sat->sat_syntax_oid)) ) {
337 sat->sat_syntax = syn;
339 *err = sat->sat_syntax_oid;
340 return SLAP_SCHERR_SYN_NOT_FOUND;
344 } else if ( sat->sat_syntax == NULL ) {
345 return SLAP_SCHERR_ATTR_INCOMPLETE;
348 if ( sat->sat_equality_oid ) {
349 if ( (mr = mr_find(sat->sat_equality_oid)) ) {
350 sat->sat_equality = mr;
351 sat->sat_approx = mr->smr_associated;
353 *err = sat->sat_equality_oid;
354 return SLAP_SCHERR_MR_NOT_FOUND;
359 if ( sat->sat_ordering_oid ) {
360 if ( (mr = mr_find(sat->sat_ordering_oid)) ) {
361 sat->sat_ordering = mr;
363 *err = sat->sat_ordering_oid;
364 return SLAP_SCHERR_MR_NOT_FOUND;
368 if ( sat->sat_substr_oid ) {
369 if ( (mr = mr_find(sat->sat_substr_oid)) ) {
370 sat->sat_substr = mr;
372 *err = sat->sat_substr_oid;
373 return SLAP_SCHERR_MR_NOT_FOUND;
377 code = at_insert(sat,err);
383 at_index_printnode( struct aindexrec *air )
387 air->air_name.bv_val,
388 ldap_attributetype2str(&air->air_at->sat_atype) );
393 at_index_print( void )
395 printf("Printing attribute type index:\n");
396 (void) avl_apply( attr_index, (AVL_APPLY) at_index_printnode,
397 0, -1, AVL_INORDER );
401 #if defined( SLAPD_SCHEMA_DN )
403 at_schema_info( Entry *e )
405 struct berval vals[2];
408 AttributeDescription *ad_attributeTypes = slap_schema.si_ad_attributeTypes;
410 vals[1].bv_val = NULL;
412 for ( at = attr_list; at; at = at->sat_next ) {
413 if ( ldap_attributetype2bv( &at->sat_atype, vals ) == NULL ) {
417 Debug( LDAP_DEBUG_TRACE, "Merging at [%ld] %s\n",
418 (long) vals[0].bv_len, vals[0].bv_val, 0 );
420 attr_merge( e, ad_attributeTypes, vals );
421 ldap_memfree( vals[0].bv_val );