mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-21 03:10:25 +08:00
5b856458a2
Use AC_FMEMCPY where appropriate (-llber)
377 lines
6.8 KiB
C
377 lines
6.8 KiB
C
/* $OpenLDAP$ */
|
|
/*
|
|
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
*/
|
|
/* at.c - routines for dealing with attribute types */
|
|
|
|
#include "portable.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <ac/ctype.h>
|
|
#include <ac/errno.h>
|
|
#include <ac/socket.h>
|
|
#include <ac/string.h>
|
|
#include <ac/time.h>
|
|
|
|
#include "ldap_pvt.h"
|
|
#include "slap.h"
|
|
|
|
|
|
int is_at_syntax(
|
|
AttributeType *at,
|
|
const char *oid )
|
|
{
|
|
for( ; at != NULL; at = at->sat_sup ) {
|
|
if( at->sat_syntax_oid ) {
|
|
return ( strcmp( at->sat_syntax_oid, oid ) == 0 );
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int is_at_subtype(
|
|
AttributeType *sub,
|
|
AttributeType *sup )
|
|
{
|
|
for( ; sub != NULL; sub = sub->sat_sup ) {
|
|
if( sub == sup ) return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
struct aindexrec {
|
|
char *air_name;
|
|
AttributeType *air_at;
|
|
};
|
|
|
|
static Avlnode *attr_index = NULL;
|
|
static AttributeType *attr_list = NULL;
|
|
|
|
static int
|
|
attr_index_cmp(
|
|
struct aindexrec *air1,
|
|
struct aindexrec *air2
|
|
)
|
|
{
|
|
return (strcasecmp( air1->air_name, air2->air_name ));
|
|
}
|
|
|
|
static int
|
|
attr_index_name_cmp(
|
|
const char *type,
|
|
struct aindexrec *air
|
|
)
|
|
{
|
|
return (strcasecmp( type, air->air_name ));
|
|
}
|
|
|
|
AttributeType *
|
|
at_find(
|
|
const char *name
|
|
)
|
|
{
|
|
struct aindexrec *air;
|
|
|
|
air = (struct aindexrec *) avl_find( attr_index, name,
|
|
(AVL_CMP) attr_index_name_cmp );
|
|
|
|
return air != NULL ? air->air_at : NULL;
|
|
}
|
|
|
|
int
|
|
at_append_to_list(
|
|
AttributeType *sat,
|
|
AttributeType ***listp
|
|
)
|
|
{
|
|
AttributeType **list;
|
|
AttributeType **list1;
|
|
int size;
|
|
|
|
list = *listp;
|
|
if ( !list ) {
|
|
size = 2;
|
|
list = calloc(size, sizeof(AttributeType *));
|
|
if ( !list ) {
|
|
return -1;
|
|
}
|
|
} else {
|
|
size = 0;
|
|
list1 = *listp;
|
|
while ( *list1 ) {
|
|
size++;
|
|
list1++;
|
|
}
|
|
size += 2;
|
|
list1 = realloc(list, size*sizeof(AttributeType *));
|
|
if ( !list1 ) {
|
|
return -1;
|
|
}
|
|
list = list1;
|
|
}
|
|
list[size-2] = sat;
|
|
list[size-1] = NULL;
|
|
*listp = list;
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
at_delete_from_list(
|
|
int pos,
|
|
AttributeType ***listp
|
|
)
|
|
{
|
|
AttributeType **list;
|
|
AttributeType **list1;
|
|
int i;
|
|
int j;
|
|
|
|
if ( pos < 0 ) {
|
|
return -2;
|
|
}
|
|
list = *listp;
|
|
for ( i=0; list[i]; i++ )
|
|
;
|
|
if ( pos >= i ) {
|
|
return -2;
|
|
}
|
|
for ( i=pos, j=pos+1; list[j]; i++, j++ ) {
|
|
list[i] = list[j];
|
|
}
|
|
list[i] = NULL;
|
|
/* Tell the runtime this can be shrinked */
|
|
list1 = realloc(list, (i+1)*sizeof(AttributeType **));
|
|
if ( !list1 ) {
|
|
return -1;
|
|
}
|
|
*listp = list1;
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
at_find_in_list(
|
|
AttributeType *sat,
|
|
AttributeType **list
|
|
)
|
|
{
|
|
int i;
|
|
|
|
if ( !list ) {
|
|
return -1;
|
|
}
|
|
for ( i=0; list[i]; i++ ) {
|
|
if ( sat == list[i] ) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
static int
|
|
at_insert(
|
|
AttributeType *sat,
|
|
const char **err
|
|
)
|
|
{
|
|
AttributeType **atp;
|
|
struct aindexrec *air;
|
|
char **names;
|
|
|
|
atp = &attr_list;
|
|
while ( *atp != NULL ) {
|
|
atp = &(*atp)->sat_next;
|
|
}
|
|
*atp = sat;
|
|
|
|
if ( sat->sat_oid ) {
|
|
air = (struct aindexrec *)
|
|
ch_calloc( 1, sizeof(struct aindexrec) );
|
|
air->air_name = sat->sat_oid;
|
|
air->air_at = sat;
|
|
if ( avl_insert( &attr_index, (caddr_t) air,
|
|
(AVL_CMP) attr_index_cmp,
|
|
(AVL_DUP) avl_dup_error ) ) {
|
|
*err = sat->sat_oid;
|
|
ldap_memfree(air);
|
|
return SLAP_SCHERR_DUP_ATTR;
|
|
}
|
|
/* FIX: temporal consistency check */
|
|
at_find(air->air_name);
|
|
}
|
|
|
|
if ( (names = sat->sat_names) ) {
|
|
while ( *names ) {
|
|
air = (struct aindexrec *)
|
|
ch_calloc( 1, sizeof(struct aindexrec) );
|
|
air->air_name = ch_strdup(*names);
|
|
air->air_at = sat;
|
|
if ( avl_insert( &attr_index, (caddr_t) air,
|
|
(AVL_CMP) attr_index_cmp,
|
|
(AVL_DUP) avl_dup_error ) ) {
|
|
*err = *names;
|
|
ldap_memfree(air->air_name);
|
|
ldap_memfree(air);
|
|
return SLAP_SCHERR_DUP_ATTR;
|
|
}
|
|
/* FIX: temporal consistency check */
|
|
at_find(air->air_name);
|
|
names++;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
at_add(
|
|
LDAPAttributeType *at,
|
|
const char **err
|
|
)
|
|
{
|
|
AttributeType *sat;
|
|
MatchingRule *mr;
|
|
Syntax *syn;
|
|
int code;
|
|
char *cname;
|
|
|
|
if ( at->at_names && at->at_names[0] ) {
|
|
cname = at->at_names[0];
|
|
} else if ( at->at_oid ) {
|
|
cname = at->at_oid;
|
|
} else {
|
|
cname = "";
|
|
return SLAP_SCHERR_ATTR_INCOMPLETE;
|
|
}
|
|
sat = (AttributeType *) ch_calloc( 1, sizeof(AttributeType) );
|
|
AC_MEMCPY( &sat->sat_atype, at, sizeof(LDAPAttributeType));
|
|
|
|
sat->sat_cname = cname;
|
|
|
|
if ( at->at_sup_oid ) {
|
|
AttributeType *supsat = at_find(at->at_sup_oid);
|
|
|
|
if ( (supsat == NULL ) ) {
|
|
*err = at->at_sup_oid;
|
|
return SLAP_SCHERR_ATTR_NOT_FOUND;
|
|
}
|
|
|
|
sat->sat_sup = supsat;
|
|
|
|
if ( at_append_to_list(sat, &supsat->sat_subtypes) ) {
|
|
*err = cname;
|
|
return SLAP_SCHERR_OUTOFMEM;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Inherit definitions from superiors. We only check the
|
|
* direct superior since that one has already inherited from
|
|
* its own superiorss
|
|
*/
|
|
if ( sat->sat_sup ) {
|
|
sat->sat_syntax = sat->sat_sup->sat_syntax;
|
|
sat->sat_equality = sat->sat_sup->sat_equality;
|
|
sat->sat_ordering = sat->sat_sup->sat_ordering;
|
|
sat->sat_substr = sat->sat_sup->sat_substr;
|
|
}
|
|
|
|
if ( at->at_syntax_oid ) {
|
|
if ( (syn = syn_find(sat->sat_syntax_oid)) ) {
|
|
sat->sat_syntax = syn;
|
|
} else {
|
|
*err = sat->sat_syntax_oid;
|
|
return SLAP_SCHERR_SYN_NOT_FOUND;
|
|
}
|
|
|
|
|
|
} else if ( sat->sat_syntax == NULL ) {
|
|
return SLAP_SCHERR_ATTR_INCOMPLETE;
|
|
}
|
|
|
|
if ( sat->sat_equality_oid ) {
|
|
if ( (mr = mr_find(sat->sat_equality_oid)) ) {
|
|
sat->sat_equality = mr;
|
|
sat->sat_approx = mr->smr_associated;
|
|
} else {
|
|
*err = sat->sat_equality_oid;
|
|
return SLAP_SCHERR_MR_NOT_FOUND;
|
|
}
|
|
|
|
}
|
|
|
|
if ( sat->sat_ordering_oid ) {
|
|
if ( (mr = mr_find(sat->sat_ordering_oid)) ) {
|
|
sat->sat_ordering = mr;
|
|
} else {
|
|
*err = sat->sat_ordering_oid;
|
|
return SLAP_SCHERR_MR_NOT_FOUND;
|
|
}
|
|
}
|
|
|
|
if ( sat->sat_substr_oid ) {
|
|
if ( (mr = mr_find(sat->sat_substr_oid)) ) {
|
|
sat->sat_substr = mr;
|
|
} else {
|
|
*err = sat->sat_substr_oid;
|
|
return SLAP_SCHERR_MR_NOT_FOUND;
|
|
}
|
|
}
|
|
|
|
code = at_insert(sat,err);
|
|
return code;
|
|
}
|
|
|
|
#ifdef LDAP_DEBUG
|
|
static int
|
|
at_index_printnode( struct aindexrec *air )
|
|
{
|
|
|
|
printf("%s = %s\n",
|
|
air->air_name,
|
|
ldap_attributetype2str(&air->air_at->sat_atype) );
|
|
return( 0 );
|
|
}
|
|
|
|
static void
|
|
at_index_print( void )
|
|
{
|
|
printf("Printing attribute type index:\n");
|
|
(void) avl_apply( attr_index, (AVL_APPLY) at_index_printnode,
|
|
0, -1, AVL_INORDER );
|
|
}
|
|
#endif
|
|
|
|
#if defined( SLAPD_SCHEMA_DN )
|
|
int
|
|
at_schema_info( Entry *e )
|
|
{
|
|
struct berval val;
|
|
struct berval *vals[2];
|
|
AttributeType *at;
|
|
|
|
AttributeDescription *ad_attributeTypes = slap_schema.si_ad_attributeTypes;
|
|
|
|
vals[0] = &val;
|
|
vals[1] = NULL;
|
|
|
|
for ( at = attr_list; at; at = at->sat_next ) {
|
|
val.bv_val = ldap_attributetype2str( &at->sat_atype );
|
|
if ( val.bv_val == NULL ) {
|
|
return -1;
|
|
}
|
|
val.bv_len = strlen( val.bv_val );
|
|
#if 0
|
|
Debug( LDAP_DEBUG_TRACE, "Merging at [%ld] %s\n",
|
|
(long) val.bv_len, val.bv_val, 0 );
|
|
#endif
|
|
attr_merge( e, ad_attributeTypes, vals );
|
|
ldap_memfree( val.bv_val );
|
|
}
|
|
return 0;
|
|
}
|
|
#endif
|