1 /* ad.c - routines for dealing with attribute descriptions */
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>.
23 #include <ac/socket.h>
24 #include <ac/string.h>
30 static AttributeName anlist_no_attrs[] = {
31 { BER_BVC( LDAP_NO_ATTRS ), NULL, 0, NULL },
32 { BER_BVNULL, NULL, 0, NULL }
35 static AttributeName anlist_all_user_attributes[] = {
36 { BER_BVC( LDAP_ALL_USER_ATTRIBUTES ), NULL, 0, NULL },
37 { BER_BVNULL, NULL, 0, NULL }
40 static AttributeName anlist_all_operational_attributes[] = {
41 { BER_BVC( LDAP_ALL_OPERATIONAL_ATTRIBUTES ), NULL, 0, NULL },
42 { BER_BVNULL, NULL, 0, NULL }
45 static AttributeName anlist_all_attributes[] = {
46 { BER_BVC( LDAP_ALL_USER_ATTRIBUTES ), NULL, 0, NULL },
47 { BER_BVC( LDAP_ALL_OPERATIONAL_ATTRIBUTES ), NULL, 0, NULL },
48 { BER_BVNULL, NULL, 0, NULL }
51 AttributeName *slap_anlist_no_attrs = anlist_no_attrs;
52 AttributeName *slap_anlist_all_user_attributes = anlist_all_user_attributes;
53 AttributeName *slap_anlist_all_operational_attributes = anlist_all_operational_attributes;
54 AttributeName *slap_anlist_all_attributes = anlist_all_attributes;
56 typedef struct Attr_option {
57 struct berval name; /* option name or prefix */
58 int prefix; /* NAME is a tag and range prefix */
61 static Attr_option lang_option = { { sizeof("lang-")-1, "lang-" }, 1 };
63 /* Options sorted by name, and number of options */
64 static Attr_option *options = &lang_option;
65 static int option_count = 1;
67 static Attr_option *ad_find_option_definition( const char *opt, int optlen );
69 static int ad_keystring(
74 if( !AD_LEADCHAR( bv->bv_val[0] ) ) {
78 for( i=1; i<bv->bv_len; i++ ) {
79 if( !AD_CHAR( bv->bv_val[i] ) ) {
86 void ad_destroy( AttributeDescription *ad )
88 AttributeDescription *n;
90 for (; ad != NULL; ad = n) {
96 /* Is there an AttributeDescription for this type that uses these tags? */
97 AttributeDescription * ad_find_tags(
101 AttributeDescription *ad;
103 ldap_pvt_thread_mutex_lock( &type->sat_ad_mutex );
104 for (ad = type->sat_ad; ad; ad=ad->ad_next)
106 if (ad->ad_tags.bv_len == tags->bv_len &&
107 !strcasecmp(ad->ad_tags.bv_val, tags->bv_val))
110 ldap_pvt_thread_mutex_unlock( &type->sat_ad_mutex );
116 AttributeDescription **ad,
120 bv.bv_val = (char *) str;
121 bv.bv_len = strlen( str );
123 return slap_bv2ad( &bv, ad, text );
126 static char *strchrlen(
133 for( i=0; p[i]; i++ ) {
136 return (char *) &p[i];
146 AttributeDescription **ad,
149 int rtn = LDAP_UNDEFINED_TYPE;
150 AttributeDescription desc, *d2;
151 char *name, *options;
156 /* hardcoded limits for speed */
157 #define MAX_TAGGING_OPTIONS 128
158 struct berval tags[MAX_TAGGING_OPTIONS+1];
159 #define MAX_TAGS_LEN 1024
160 char tagbuf[MAX_TAGS_LEN];
162 assert( ad != NULL );
163 assert( *ad == NULL ); /* temporary */
165 if( bv == NULL || BER_BVISNULL( bv ) || BER_BVISEMPTY( bv ) ) {
166 *text = "empty AttributeDescription";
170 /* make sure description is IA5 */
171 if( ad_keystring( bv ) ) {
172 *text = "AttributeDescription contains inappropriate characters";
176 /* find valid base attribute type; parse in place */
177 memset( &desc, 0, sizeof( desc ) );
180 options = strchr( name, ';' );
181 if ( options != NULL && ( options - name ) < bv->bv_len ) {
182 /* don't go past the end of the berval! */
183 desc.ad_cname.bv_len = options - name;
187 desc.ad_type = at_bvfind( &desc.ad_cname );
188 if( desc.ad_type == NULL ) {
189 *text = "attribute type undefined";
193 if( is_at_operational( desc.ad_type ) && options != NULL ) {
194 *text = "operational attribute with options undefined";
199 * parse options in place
202 memset( tags, 0, sizeof( tags ));
205 for( opt=options; opt != NULL; opt=next ) {
208 next = strchrlen( opt, ';', &optlen );
211 *text = "zero length option is invalid";
214 } else if ( optlen == sizeof("binary")-1 &&
215 strncasecmp( opt, "binary", sizeof("binary")-1 ) == 0 )
218 if( slap_ad_is_binary( &desc ) ) {
219 *text = "option \"binary\" specified multiple times";
223 if( !slap_syntax_is_binary( desc.ad_type->sat_syntax )) {
224 /* not stored in binary, disallow option */
225 *text = "option \"binary\" not supported with type";
229 desc.ad_flags |= SLAP_DESC_BINARY;
232 } else if ( ad_find_option_definition( opt, optlen ) ) {
235 if( opt[optlen-1] == '-' ) {
236 desc.ad_flags |= SLAP_DESC_TAG_RANGE;
239 if( ntags >= MAX_TAGGING_OPTIONS ) {
240 *text = "too many tagging options";
245 * tags should be presented in sorted order,
246 * so run the array in reverse.
248 for( i=ntags-1; i>=0; i-- ) {
251 rc = strncasecmp( opt, tags[i].bv_val,
252 (unsigned) optlen < tags[i].bv_len
253 ? optlen : tags[i].bv_len );
255 if( rc == 0 && (unsigned)optlen == tags[i].bv_len ) {
256 /* duplicate (ignore) */
259 } else if ( rc > 0 ||
260 ( rc == 0 && (unsigned)optlen > tags[i].bv_len ))
262 AC_MEMCPY( &tags[i+2], &tags[i+1],
263 (ntags-i-1)*sizeof(struct berval) );
264 tags[i+1].bv_val = opt;
265 tags[i+1].bv_len = optlen;
271 AC_MEMCPY( &tags[1], &tags[0],
272 ntags*sizeof(struct berval) );
274 tags[0].bv_val = opt;
275 tags[0].bv_len = optlen;
278 tagslen += optlen + 1;
282 *text = "unrecognized option";
290 if( tagslen > MAX_TAGS_LEN ) {
291 *text = "tagging options too long";
295 desc.ad_tags.bv_val = tagbuf;
298 for( i=0; i<ntags; i++ ) {
299 AC_MEMCPY( &desc.ad_tags.bv_val[tagslen],
300 tags[i].bv_val, tags[i].bv_len );
302 tagslen += tags[i].bv_len;
303 desc.ad_tags.bv_val[tagslen++] = ';';
306 desc.ad_tags.bv_val[--tagslen] = '\0';
307 desc.ad_tags.bv_len = tagslen;
310 /* see if a matching description is already cached */
311 for (d2 = desc.ad_type->sat_ad; d2; d2=d2->ad_next) {
312 if( d2->ad_flags != desc.ad_flags ) {
315 if( d2->ad_tags.bv_len != desc.ad_tags.bv_len ) {
318 if( d2->ad_tags.bv_len == 0 ) {
321 if( strncasecmp( d2->ad_tags.bv_val, desc.ad_tags.bv_val,
322 desc.ad_tags.bv_len ) == 0 )
328 /* Not found, add new one */
331 ldap_pvt_thread_mutex_lock( &desc.ad_type->sat_ad_mutex );
332 /* check again now that we've locked */
333 for (d2 = desc.ad_type->sat_ad; d2; d2=d2->ad_next) {
334 if (d2->ad_flags != desc.ad_flags)
336 if (d2->ad_tags.bv_len != desc.ad_tags.bv_len)
338 if (d2->ad_tags.bv_len == 0)
340 if (strncasecmp(d2->ad_tags.bv_val, desc.ad_tags.bv_val,
341 desc.ad_tags.bv_len) == 0)
345 ldap_pvt_thread_mutex_unlock( &desc.ad_type->sat_ad_mutex );
349 /* Allocate a single contiguous block. If there are no
350 * options, we just need space for the AttrDesc structure.
351 * Otherwise, we need to tack on the full name length +
352 * options length, + maybe tagging options length again.
354 if (desc.ad_tags.bv_len || desc.ad_flags != SLAP_DESC_NONE) {
355 dlen = desc.ad_type->sat_cname.bv_len + 1;
356 if (desc.ad_tags.bv_len) {
357 dlen += 1+desc.ad_tags.bv_len;
359 if( slap_ad_is_binary( &desc ) ) {
360 dlen += sizeof(";binary")+desc.ad_tags.bv_len;
364 d2 = ch_malloc(sizeof(AttributeDescription) + dlen);
366 d2->ad_type = desc.ad_type;
367 d2->ad_flags = desc.ad_flags;
368 d2->ad_cname.bv_len = desc.ad_type->sat_cname.bv_len;
369 d2->ad_tags.bv_len = desc.ad_tags.bv_len;
372 d2->ad_cname.bv_val = d2->ad_type->sat_cname.bv_val;
373 d2->ad_tags.bv_val = NULL;
377 d2->ad_cname.bv_val = (char *)(d2+1);
378 strcpy(d2->ad_cname.bv_val, d2->ad_type->sat_cname.bv_val);
379 cp = d2->ad_cname.bv_val + d2->ad_cname.bv_len;
380 if( slap_ad_is_binary( &desc ) ) {
383 if( desc.ad_tags.bv_len ) {
384 lp = desc.ad_tags.bv_val;
385 while( strncasecmp(lp, "binary", sizeof("binary")-1) < 0
386 && (lp = strchr( lp, ';' )) != NULL )
388 if( lp != desc.ad_tags.bv_val ) {
391 ? lp - desc.ad_tags.bv_val - 1
392 : strlen( desc.ad_tags.bv_val ));
393 cp = lutil_strncopy(cp, desc.ad_tags.bv_val, j);
396 cp = lutil_strcopy(cp, ";binary");
399 cp = lutil_strcopy(cp, lp);
401 d2->ad_cname.bv_len = cp - d2->ad_cname.bv_val;
402 if( desc.ad_tags.bv_len )
403 ldap_pvt_str2lower(op);
408 if( desc.ad_tags.bv_len ) {
409 lp = d2->ad_cname.bv_val + d2->ad_cname.bv_len + j;
412 d2->ad_tags.bv_val = lp;
413 strcpy(lp, desc.ad_tags.bv_val);
414 ldap_pvt_str2lower(lp);
416 d2->ad_cname.bv_len += 1 + desc.ad_tags.bv_len;
419 /* Add new desc to list. We always want the bare Desc with
420 * no options to stay at the head of the list, assuming
421 * that one will be used most frequently.
423 if (desc.ad_type->sat_ad == NULL || dlen == 0) {
424 d2->ad_next = desc.ad_type->sat_ad;
425 desc.ad_type->sat_ad = d2;
427 d2->ad_next = desc.ad_type->sat_ad->ad_next;
428 desc.ad_type->sat_ad->ad_next = d2;
430 ldap_pvt_thread_mutex_unlock( &desc.ad_type->sat_ad_mutex );
442 static int is_ad_subtags(
443 struct berval *subtagsbv,
444 struct berval *suptagsbv )
446 const char *suptags, *supp, *supdelimp;
447 const char *subtags, *subp, *subdelimp;
450 subtags =subtagsbv->bv_val;
451 suptags =suptagsbv->bv_val;
453 for( supp=suptags ; supp; supp=supdelimp ) {
454 supdelimp = strchrlen( supp, ';', &suplen );
455 if( supdelimp ) supdelimp++;
457 for( subp=subtags ; subp; subp=subdelimp ) {
458 subdelimp = strchrlen( subp, ';', &sublen );
459 if( subdelimp ) subdelimp++;
462 ? ( suplen-1 == sublen && supp[suplen-1] == '-'
463 && strncmp( supp, subp, sublen ) == 0 )
464 : ( ( suplen == sublen || supp[suplen-1] == '-' )
465 && strncmp( supp, subp, suplen ) == 0 ) )
478 AttributeDescription *sub,
479 AttributeDescription *super
485 for ( a = sub->ad_type; a; a=a->sat_sup ) {
486 if ( a == super->ad_type ) break;
492 /* ensure sub does support all flags of super */
493 lr = sub->ad_tags.bv_len ? SLAP_DESC_TAG_RANGE : 0;
494 if(( super->ad_flags & ( sub->ad_flags | lr )) != super->ad_flags ) {
498 /* check for tagging options */
499 if ( super->ad_tags.bv_len == 0 )
501 if ( sub->ad_tags.bv_len == 0 )
504 return is_ad_subtags( &sub->ad_tags, &super->ad_tags );
508 AttributeDescription *desc,
509 AttributeName *attrs )
511 if (! attrs ) return 0;
513 for( ; attrs->an_name.bv_val; attrs++ ) {
517 if ( attrs->an_desc ) {
520 if ( desc == attrs->an_desc ) {
525 * EXTENSION: if requested description is preceeded by
526 * a '-' character, do not match on subtypes.
528 if ( attrs->an_name.bv_val[0] == '-' ) {
532 /* Is this a subtype of the requested attr? */
533 for (a = desc->ad_type; a; a=a->sat_sup) {
534 if ( a == attrs->an_desc->ad_type )
540 /* Does desc support all the requested flags? */
541 lr = desc->ad_tags.bv_len ? SLAP_DESC_TAG_RANGE : 0;
542 if(( attrs->an_desc->ad_flags & (desc->ad_flags | lr))
543 != attrs->an_desc->ad_flags ) {
546 /* Do the descs have compatible tags? */
547 if ( attrs->an_desc->ad_tags.bv_len == 0 ) {
550 if ( desc->ad_tags.bv_len == 0) {
553 if ( is_ad_subtags( &desc->ad_tags,
554 &attrs->an_desc->ad_tags ) ) {
560 if ( ber_bvccmp( &attrs->an_name, '*' ) ) {
561 if ( !is_at_operational( desc->ad_type ) ) {
567 if ( ber_bvccmp( &attrs->an_name, '+' ) ) {
568 if ( is_at_operational( desc->ad_type ) ) {
575 * EXTENSION: see if requested description is @objectClass
576 * if so, return attributes which the class requires/allows
577 * else if requested description is !objectClass, return
578 * attributes which the class does not require/allow
581 if( oc == NULL && attrs->an_name.bv_val ) {
582 switch( attrs->an_name.bv_val[0] ) {
583 case '@': /* @objectClass */
584 case '+': /* +objectClass (deprecated) */
585 case '!': { /* exclude */
586 struct berval ocname;
587 ocname.bv_len = attrs->an_name.bv_len - 1;
588 ocname.bv_val = &attrs->an_name.bv_val[1];
589 oc = oc_bvfind( &ocname );
590 attrs->an_oc_exclude = 0;
591 if ( oc && attrs->an_name.bv_val[0] == '!' ) {
592 attrs->an_oc_exclude = 1;
596 default: /* old (deprecated) way */
597 oc = oc_bvfind( &attrs->an_name );
602 if ( attrs->an_oc_exclude ) {
603 if ( oc == slap_schema.si_oc_extensibleObject ) {
604 /* extensibleObject allows the return of anything */
608 if( oc->soc_required ) {
609 /* allow return of required attributes */
612 for ( i = 0; oc->soc_required[i] != NULL; i++ ) {
613 for (a = desc->ad_type; a; a=a->sat_sup) {
614 if ( a == oc->soc_required[i] ) {
621 if( oc->soc_allowed ) {
622 /* allow return of allowed attributes */
624 for ( i = 0; oc->soc_allowed[i] != NULL; i++ ) {
625 for (a = desc->ad_type; a; a=a->sat_sup) {
626 if ( a == oc->soc_allowed[i] ) {
636 if ( oc == slap_schema.si_oc_extensibleObject ) {
637 /* extensibleObject allows the return of anything */
641 if( oc->soc_required ) {
642 /* allow return of required attributes */
645 for ( i = 0; oc->soc_required[i] != NULL; i++ ) {
646 for (a = desc->ad_type; a; a=a->sat_sup) {
647 if ( a == oc->soc_required[i] ) {
654 if( oc->soc_allowed ) {
655 /* allow return of allowed attributes */
657 for ( i = 0; oc->soc_allowed[i] != NULL; i++ ) {
658 for (a = desc->ad_type; a; a=a->sat_sup) {
659 if ( a == oc->soc_allowed[i] ) {
667 /* short-circuit this search next time around */
668 if (!slap_schema.si_at_undefined->sat_ad) {
670 slap_bv2undef_ad(&attrs->an_name,
671 &attrs->an_desc, &text, 0);
674 slap_schema.si_at_undefined->sat_ad;
683 int slap_str2undef_ad(
685 AttributeDescription **ad,
690 bv.bv_val = (char *) str;
691 bv.bv_len = strlen( str );
693 return slap_bv2undef_ad( &bv, ad, text, flags );
696 int slap_bv2undef_ad(
698 AttributeDescription **ad,
702 AttributeDescription *desc;
705 assert( ad != NULL );
707 if( bv == NULL || bv->bv_len == 0 ) {
708 *text = "empty AttributeDescription";
709 return LDAP_UNDEFINED_TYPE;
712 /* make sure description is IA5 */
713 if( ad_keystring( bv ) ) {
714 *text = "AttributeDescription contains inappropriate characters";
715 return LDAP_UNDEFINED_TYPE;
718 /* use the appropriate type */
719 if ( flags & SLAP_AD_PROXIED ) {
720 at = slap_schema.si_at_proxied;
723 at = slap_schema.si_at_undefined;
726 for( desc = at->sat_ad; desc; desc=desc->ad_next ) {
727 if( desc->ad_cname.bv_len == bv->bv_len &&
728 !strcasecmp( desc->ad_cname.bv_val, bv->bv_val ) )
735 if ( flags & SLAP_AD_NOINSERT ) {
737 return LDAP_UNDEFINED_TYPE;
740 desc = ch_malloc(sizeof(AttributeDescription) + 1 +
743 desc->ad_flags = SLAP_DESC_NONE;
744 BER_BVZERO( &desc->ad_tags );
746 desc->ad_cname.bv_len = bv->bv_len;
747 desc->ad_cname.bv_val = (char *)(desc+1);
748 strcpy(desc->ad_cname.bv_val, bv->bv_val);
750 /* canonical to upper case */
751 ldap_pvt_str2upper( desc->ad_cname.bv_val );
753 /* shouldn't we protect this for concurrency? */
755 ldap_pvt_thread_mutex_lock( &ad_undef_mutex );
756 desc->ad_next = desc->ad_type->sat_ad;
757 desc->ad_type->sat_ad = desc;
758 ldap_pvt_thread_mutex_unlock( &ad_undef_mutex );
775 AttributeDescription **u_ad;
777 for ( u_ad = &at->sat_ad; *u_ad; ) {
780 ber_str2bv( name, 0, 0, &bv );
782 /* remove iff undef == name or undef == name;tag */
783 if ( (*u_ad)->ad_cname.bv_len >= bv.bv_len
784 && strncasecmp( (*u_ad)->ad_cname.bv_val, bv.bv_val, bv.bv_len ) == 0
785 && ( (*u_ad)->ad_cname.bv_val[ bv.bv_len ] == '\0'
786 || (*u_ad)->ad_cname.bv_val[ bv.bv_len ] == ';' ) )
788 AttributeDescription *tmp = *u_ad;
790 *u_ad = (*u_ad)->ad_next;
795 u_ad = &(*u_ad)->ad_next;
803 slap_ad_undef_remove(
808 ldap_pvt_thread_mutex_lock( &ad_undef_mutex );
810 rc = undef_remove( slap_schema.si_at_undefined, name );
812 rc = undef_remove( slap_schema.si_at_proxied, name );
815 ldap_pvt_thread_mutex_unlock( &ad_undef_mutex );
826 if( a == NULL ) return 0;
828 for ( ; a->an_name.bv_val; a++ ) {
829 if ( a->an_name.bv_len != s->bv_len) continue;
830 if ( strcasecmp( s->bv_val, a->an_name.bv_val ) == 0 ) {
839 * Convert a delimited string into a list of AttributeNames; add
840 * on to an existing list if it was given. If the string is not
841 * a valid attribute name, if a '-' is prepended it is skipped
842 * and the remaining name is tried again; if a '@' (or '+') is
843 * prepended, an objectclass name is searched instead; if a '!'
844 * is prepended, the objectclass name is negated.
846 * NOTE: currently, if a valid attribute name is not found, the
847 * same string is also checked as valid objectclass name; however,
848 * this behavior is deprecated.
851 str2anlist( AttributeName *an, char *in, const char *brkstr )
860 /* find last element in list */
863 for ( i = 0; !BER_BVISNULL( &an[ i ].an_name ) ; i++)
867 /* protect the input string from strtok */
868 str = ch_strdup( in );
870 /* Count words in string */
872 for ( s = str; *s; s++ ) {
873 if ( strchr( brkstr, *s ) != NULL ) {
878 an = ch_realloc( an, ( i + j + 1 ) * sizeof( AttributeName ) );
879 BER_BVZERO( &an[i + j].an_name );
881 for ( s = ldap_pvt_strtok( str, brkstr, &lasts );
883 s = ldap_pvt_strtok( NULL, brkstr, &lasts ) )
885 anew->an_desc = NULL;
887 anew->an_oc_exclude = 0;
888 ber_str2bv(s, 0, 1, &anew->an_name);
889 slap_bv2ad(&anew->an_name, &anew->an_desc, &text);
890 if ( !anew->an_desc ) {
891 switch( anew->an_name.bv_val[0] ) {
893 struct berval adname;
894 adname.bv_len = anew->an_name.bv_len - 1;
895 adname.bv_val = &anew->an_name.bv_val[1];
896 slap_bv2ad(&adname, &anew->an_desc, &text);
897 if ( !anew->an_desc ) {
903 case '+': /* (deprecated) */
905 struct berval ocname;
906 ocname.bv_len = anew->an_name.bv_len - 1;
907 ocname.bv_val = &anew->an_name.bv_val[1];
908 anew->an_oc = oc_bvfind( &ocname );
909 if ( !anew->an_oc ) {
913 if ( anew->an_name.bv_val[0] == '!' ) {
914 anew->an_oc_exclude = 1;
919 /* old (deprecated) way */
920 anew->an_oc = oc_bvfind( &anew->an_name );
921 if ( !anew->an_oc ) {
929 BER_BVZERO( &anew->an_name );
934 for ( i = 0; an[i].an_name.bv_val; i++ ) {
935 free( an[i].an_name.bv_val );
939 * overwrites input string
947 char **anlist2charray_x( AttributeName *an, int dup, void *ctx )
953 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ )
955 attrs = (char **) slap_sl_malloc( (i + 1) * sizeof(char *), ctx );
956 for ( i = 0; !BER_BVISNULL( &an[i].an_name ); i++ ) {
958 attrs[i] = ch_strdup( an[i].an_name.bv_val );
960 attrs[i] = an[i].an_name.bv_val;
970 char **anlist2charray( AttributeName *an, int dup )
972 return anlist2charray_x( an, dup, NULL );
976 anlist2attrs( AttributeName * anlist )
983 attrs = anlist2charray( anlist, 1 );
985 for ( i = 0; anlist[i].an_name.bv_val; i++ ) {
986 if ( ( oc = anlist[i].an_oc ) ) {
987 for ( j = 0; oc->soc_required && oc->soc_required[j]; j++ ) ;
989 for ( j = 0; oc->soc_allowed && oc->soc_allowed[j]; j++ ) ;
1000 attrs = (char **) ch_realloc( attrs, (i + k + 1) * sizeof( char * ));
1002 for ( i = 0; anlist[i].an_name.bv_val; i++ ) {
1003 if ( ( oc = anlist[i].an_oc ) ) {
1004 for ( j = 0; oc->soc_required && oc->soc_required[j]; j++ ) {
1005 attrs[n++] = ch_strdup(
1006 oc->soc_required[j]->sat_cname.bv_val );
1008 for ( j = 0; oc->soc_allowed && oc->soc_allowed[j]; j++ ) {
1009 attrs[n++] = ch_strdup(
1010 oc->soc_allowed[j]->sat_cname.bv_val );
1019 while ( attrs && attrs[i] ) {
1020 if ( *attrs[i] == '@' ) {
1021 for ( j = i; attrs[j]; j++ ) {
1023 ch_free( attrs[i] );
1024 attrs[j] = attrs[j+1];
1031 for ( i = 0; attrs && attrs[i]; i++ ) {
1033 while ( attrs && attrs[j] ) {
1034 if ( !strcmp( attrs[i], attrs[j] )) {
1035 for ( k = j; attrs && attrs[k]; k++ ) {
1037 ch_free( attrs[j] );
1038 attrs[k] = attrs[k+1];
1047 attrs = (char **) ch_realloc( attrs, (i+1) * sizeof( char * ));
1054 file2anlist( AttributeName *an, const char *fname, const char *brkstr )
1060 size_t lmax = LBUFSIZ;
1062 fp = fopen( fname, "r" );
1064 Debug( LDAP_DEBUG_ANY,
1065 "get_attrs_from_file: failed to open attribute list file "
1066 "\"%s\": %s\n", fname, strerror(errno), 0 );
1070 lcur = line = (char *) ch_malloc( lmax );
1072 Debug( LDAP_DEBUG_ANY,
1073 "get_attrs_from_file: could not allocate memory\n",
1079 while ( fgets( lcur, LBUFSIZ, fp ) != NULL ) {
1080 if ( ( c = strchr( lcur, '\n' ) ) ) {
1083 } else if ( *(c-1) == '\r' ) {
1090 line = (char *) ch_realloc( line, lmax );
1092 Debug( LDAP_DEBUG_ANY,
1093 "get_attrs_from_file: could not allocate memory\n",
1098 lcur = line + strlen( line );
1101 an = str2anlist( an, line, brkstr );
1112 /* Define an attribute option. */
1114 ad_define_option( const char *name, const char *fname, int lineno )
1117 unsigned int optlen;
1119 if ( options == &lang_option ) {
1128 if ( !DESC_CHAR( name[optlen] ) ) {
1129 Debug( LDAP_DEBUG_ANY,
1130 "%s: line %d: illegal option name \"%s\"\n",
1131 fname, lineno, name );
1134 } while ( name[++optlen] );
1136 options = ch_realloc( options,
1137 (option_count+1) * sizeof(Attr_option) );
1139 if ( strcasecmp( name, "binary" ) == 0
1140 || ad_find_option_definition( name, optlen ) ) {
1141 Debug( LDAP_DEBUG_ANY,
1142 "%s: line %d: option \"%s\" is already defined\n",
1143 fname, lineno, name );
1147 for ( i = option_count; i; --i ) {
1148 if ( strcasecmp( name, options[i-1].name.bv_val ) >= 0 )
1150 options[i] = options[i-1];
1153 options[i].name.bv_val = ch_strdup( name );
1154 options[i].name.bv_len = optlen;
1155 options[i].prefix = (name[optlen-1] == '-');
1157 if ( i != option_count &&
1158 options[i].prefix &&
1159 optlen < options[i+1].name.bv_len &&
1160 strncasecmp( name, options[i+1].name.bv_val, optlen ) == 0 ) {
1161 Debug( LDAP_DEBUG_ANY,
1162 "%s: line %d: option \"%s\" overrides previous option\n",
1163 fname, lineno, name );
1171 /* Find the definition of the option name or prefix matching the arguments */
1172 static Attr_option *
1173 ad_find_option_definition( const char *opt, int optlen )
1175 int top = 0, bot = option_count;
1176 while ( top < bot ) {
1177 int mid = (top + bot) / 2;
1178 int mlen = options[mid].name.bv_len;
1179 char *mname = options[mid].name.bv_val;
1181 if ( optlen < mlen ) {
1182 j = strncasecmp( opt, mname, optlen ) - 1;
1184 j = strncasecmp( opt, mname, mlen );
1185 if ( j==0 && (optlen==mlen || options[mid].prefix) )
1186 return &options[mid];
1196 MatchingRule *ad_mr(
1197 AttributeDescription *ad,
1200 switch( usage & SLAP_MR_TYPE_MASK ) {
1202 case SLAP_MR_EQUALITY:
1203 return ad->ad_type->sat_equality;
1205 case SLAP_MR_ORDERING:
1206 return ad->ad_type->sat_ordering;
1208 case SLAP_MR_SUBSTR:
1209 return ad->ad_type->sat_substr;
1213 assert( 0 /* ad_mr: bad usage */);