openldap/servers/slapd/oc.c

513 lines
10 KiB
C
Raw Normal View History

/* oc.c - object class routines */
/* $OpenLDAP$ */
/*
2002-01-05 05:17:25 +08:00
* Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
#include "portable.h"
#include <stdio.h>
#include <ac/ctype.h>
#include <ac/string.h>
#include <ac/socket.h>
#include "slap.h"
#include "ldap_pvt.h"
int is_object_subclass(
ObjectClass *sup,
ObjectClass *sub )
{
int i;
if( sub == NULL || sup == NULL ) return 0;
#if 1
Debug( LDAP_DEBUG_TRACE, "is_object_subclass(%s,%s) %d\n",
sup->soc_oid, sub->soc_oid, sup == sub );
#endif
if( sup == sub ) {
return 1;
}
if( sub->soc_sups == NULL ) {
return 0;
}
for( i=0; sub->soc_sups[i] != NULL; i++ ) {
if( is_object_subclass( sup, sub->soc_sups[i] ) ) {
return 1;
}
}
return 0;
}
int is_entry_objectclass(
Entry* e,
ObjectClass *oc,
int set_flags )
{
Attribute *attr;
2002-01-02 19:00:36 +08:00
struct berval *bv;
AttributeDescription *objectClass = slap_schema.si_ad_objectClass;
assert(!( e == NULL || oc == NULL ));
2000-05-19 10:44:47 +08:00
if( e == NULL || oc == NULL ) {
return 0;
2000-05-19 10:44:47 +08:00
}
if( set_flags && ( e->e_ocflags & SLAP_OC__END )) {
2002-05-29 14:14:55 +08:00
return (e->e_ocflags & oc->soc_flags) ? 1 : 0;
}
/*
* find objectClass attribute
*/
attr = attr_find(e->e_attrs, objectClass);
if( attr == NULL ) {
/* no objectClass attribute */
2001-01-16 03:17:29 +08:00
#ifdef NEW_LOGGING
2001-09-17 06:02:50 +08:00
LDAP_LOG(( "operation", LDAP_LEVEL_ERR, "is_entry_objectclass: "
"dn(%s), oid (%s), no objectClass attribute.\n",
e->e_dn == NULL ? "" : e->e_dn,
oc->soc_oclass.oc_oid ));
2001-01-16 03:17:29 +08:00
#else
2000-05-19 10:44:47 +08:00
Debug( LDAP_DEBUG_ANY, "is_entry_objectclass(\"%s\", \"%s\") "
"no objectClass attribute\n",
e->e_dn == NULL ? "" : e->e_dn,
oc->soc_oclass.oc_oid, 0 );
2001-01-16 03:17:29 +08:00
#endif
return 0;
}
2002-01-02 19:00:36 +08:00
for( bv=attr->a_vals; bv->bv_val; bv++ ) {
ObjectClass *objectClass = oc_bvfind( bv );
if ( objectClass == oc && !set_flags ) {
return 1;
}
if ( objectClass != NULL ) {
e->e_ocflags |= objectClass->soc_flags;
}
}
e->e_ocflags |= SLAP_OC__END; /* We've finished this */
return (e->e_ocflags & oc->soc_flags);
}
struct oindexrec {
2001-12-28 19:45:25 +08:00
struct berval oir_name;
ObjectClass *oir_oc;
};
static Avlnode *oc_index = NULL;
static ObjectClass *oc_list = NULL;
static int
oc_index_cmp(
struct oindexrec *oir1,
struct oindexrec *oir2 )
{
2001-12-28 19:45:25 +08:00
int i = oir1->oir_name.bv_len - oir2->oir_name.bv_len;
if (i)
return i;
return strcasecmp( oir1->oir_name.bv_val, oir2->oir_name.bv_val );
}
static int
oc_index_name_cmp(
2001-12-28 19:45:25 +08:00
struct berval *name,
struct oindexrec *oir )
{
2001-12-28 19:45:25 +08:00
int i = name->bv_len - oir->oir_name.bv_len;
if (i)
return i;
return strncasecmp( name->bv_val, oir->oir_name.bv_val, name->bv_len );
}
ObjectClass *
oc_find( const char *ocname )
{
2001-12-28 19:45:25 +08:00
struct berval bv;
2001-12-28 19:45:25 +08:00
bv.bv_val = (char *)ocname;
bv.bv_len = strlen( ocname );
2001-12-28 19:45:25 +08:00
return( oc_bvfind( &bv ) );
}
ObjectClass *
oc_bvfind( struct berval *ocname )
{
struct oindexrec *oir;
oir = (struct oindexrec *) avl_find( oc_index, ocname,
2001-12-28 19:45:25 +08:00
(AVL_CMP) oc_index_name_cmp );
if ( oir != NULL ) {
return( oir->oir_oc );
}
return( NULL );
}
static int
oc_create_required(
ObjectClass *soc,
char **attrs,
int *op,
const char **err )
{
char **attrs1;
AttributeType *sat;
AttributeType **satp;
int i;
if ( attrs ) {
attrs1 = attrs;
while ( *attrs1 ) {
sat = at_find(*attrs1);
if ( !sat ) {
*err = *attrs1;
return SLAP_SCHERR_ATTR_NOT_FOUND;
}
if( is_at_operational( sat )) (*op)++;
if ( at_find_in_list(sat, soc->soc_required) < 0) {
if ( at_append_to_list(sat, &soc->soc_required) ) {
*err = *attrs1;
return SLAP_SCHERR_OUTOFMEM;
}
}
attrs1++;
}
/* Now delete duplicates from the allowed list */
for ( satp = soc->soc_required; *satp; satp++ ) {
i = at_find_in_list(*satp,soc->soc_allowed);
if ( i >= 0 ) {
at_delete_from_list(i, &soc->soc_allowed);
}
}
}
return 0;
}
static int
oc_create_allowed(
ObjectClass *soc,
char **attrs,
int *op,
const char **err )
{
char **attrs1;
AttributeType *sat;
if ( attrs ) {
attrs1 = attrs;
while ( *attrs1 ) {
sat = at_find(*attrs1);
if ( !sat ) {
*err = *attrs1;
return SLAP_SCHERR_ATTR_NOT_FOUND;
}
if( is_at_operational( sat )) (*op)++;
if ( at_find_in_list(sat, soc->soc_required) < 0 &&
at_find_in_list(sat, soc->soc_allowed) < 0 ) {
if ( at_append_to_list(sat, &soc->soc_allowed) ) {
*err = *attrs1;
return SLAP_SCHERR_OUTOFMEM;
}
}
attrs1++;
}
}
return 0;
}
static int
oc_add_sups(
ObjectClass *soc,
char **sups,
int *op,
const char **err )
{
int code;
ObjectClass *soc1;
int nsups;
char **sups1;
int add_sups = 0;
if ( sups ) {
if ( !soc->soc_sups ) {
/* We are at the first recursive level */
add_sups = 1;
nsups = 1;
sups1 = sups;
while ( *sups1 ) {
nsups++;
sups1++;
}
2000-03-10 03:15:48 +08:00
soc->soc_sups = (ObjectClass **)ch_calloc(nsups,
sizeof(ObjectClass *));
}
nsups = 0;
sups1 = sups;
while ( *sups1 ) {
soc1 = oc_find(*sups1);
if ( !soc1 ) {
*err = *sups1;
return SLAP_SCHERR_CLASS_NOT_FOUND;
}
/* check object class usage
* abstract classes can only sup abstract classes
* structural classes can not sup auxiliary classes
* auxiliary classes can not sup structural classes
*/
if( soc->soc_kind != soc1->soc_kind
&& soc1->soc_kind != LDAP_SCHEMA_ABSTRACT )
{
*err = *sups1;
return SLAP_SCHERR_CLASS_BAD_USAGE;
}
if( soc->soc_flags & SLAP_OC_OPERATIONAL ) (*op)++;
if ( add_sups ) {
soc->soc_sups[nsups] = soc1;
}
code = oc_add_sups( soc, soc1->soc_sup_oids, op, err );
if ( code ) return code;
code = oc_create_required( soc, soc1->soc_at_oids_must, op, err );
if ( code ) return code;
code = oc_create_allowed( soc, soc1->soc_at_oids_may, op, err );
if ( code ) return code;
nsups++;
sups1++;
}
}
return 0;
}
void
oc_destroy( void )
{
ObjectClass *o, *n;
avl_free(oc_index, ldap_memfree);
for (o=oc_list; o; o=n)
{
n = o->soc_next;
2001-12-31 14:44:36 +08:00
if (o->soc_sups) ldap_memfree(o->soc_sups);
if (o->soc_required) ldap_memfree(o->soc_required);
if (o->soc_allowed) ldap_memfree(o->soc_allowed);
ldap_objectclass_free((LDAPObjectClass *)o);
}
}
static int
oc_insert(
ObjectClass *soc,
const char **err
)
{
ObjectClass **ocp;
struct oindexrec *oir;
char **names;
ocp = &oc_list;
while ( *ocp != NULL ) {
ocp = &(*ocp)->soc_next;
}
*ocp = soc;
if ( soc->soc_oid ) {
oir = (struct oindexrec *)
ch_calloc( 1, sizeof(struct oindexrec) );
2001-12-28 19:45:25 +08:00
oir->oir_name.bv_val = soc->soc_oid;
oir->oir_name.bv_len = strlen( soc->soc_oid );
oir->oir_oc = soc;
2001-12-28 19:45:25 +08:00
assert( oir->oir_name.bv_val );
assert( oir->oir_oc );
if ( avl_insert( &oc_index, (caddr_t) oir,
(AVL_CMP) oc_index_cmp,
(AVL_DUP) avl_dup_error ) )
{
*err = soc->soc_oid;
ldap_memfree(oir);
return SLAP_SCHERR_CLASS_DUP;
}
/* FIX: temporal consistency check */
2001-12-28 19:45:25 +08:00
assert( oc_bvfind(&oir->oir_name) != NULL );
}
if ( (names = soc->soc_names) ) {
while ( *names ) {
oir = (struct oindexrec *)
ch_calloc( 1, sizeof(struct oindexrec) );
2001-12-28 19:45:25 +08:00
oir->oir_name.bv_val = *names;
oir->oir_name.bv_len = strlen( *names );
oir->oir_oc = soc;
2001-12-28 19:45:25 +08:00
assert( oir->oir_name.bv_val );
assert( oir->oir_oc );
if ( avl_insert( &oc_index, (caddr_t) oir,
(AVL_CMP) oc_index_cmp,
(AVL_DUP) avl_dup_error ) )
{
*err = *names;
ldap_memfree(oir);
return SLAP_SCHERR_CLASS_DUP;
}
/* FIX: temporal consistency check */
2001-12-28 19:45:25 +08:00
assert( oc_bvfind(&oir->oir_name) != NULL );
names++;
}
}
return 0;
}
int
oc_add(
LDAPObjectClass *oc,
int user,
const char **err
)
{
ObjectClass *soc;
int code;
int op = 0;
2001-06-08 06:47:02 +08:00
if ( oc->oc_names != NULL ) {
int i;
for( i=0; oc->oc_names[i]; i++ ) {
if( !slap_valid_descr( oc->oc_names[i] ) ) {
return SLAP_SCHERR_BAD_DESCR;
}
}
}
if ( !OID_LEADCHAR( oc->oc_oid[0] )) {
/* Expand OID macros */
char *oid = oidm_find( oc->oc_oid );
if ( !oid ) {
*err = oc->oc_oid;
return SLAP_SCHERR_OIDM;
}
if ( oid != oc->oc_oid ) {
ldap_memfree( oc->oc_oid );
oc->oc_oid = oid;
}
}
soc = (ObjectClass *) ch_calloc( 1, sizeof(ObjectClass) );
AC_MEMCPY( &soc->soc_oclass, oc, sizeof(LDAPObjectClass) );
if( soc->soc_sup_oids == NULL &&
soc->soc_kind == LDAP_SCHEMA_STRUCTURAL )
{
/* structural object classes implicitly inherit from 'top' */
static char *top_oids[] = { SLAPD_TOP_OID, NULL };
code = oc_add_sups( soc, top_oids, &op, err );
} else {
code = oc_add_sups( soc, soc->soc_sup_oids, &op, err );
}
if ( code != 0 ) return code;
code = oc_create_required( soc, soc->soc_at_oids_must, &op, err );
if ( code != 0 ) return code;
code = oc_create_allowed( soc, soc->soc_at_oids_may, &op, err );
if ( code != 0 ) return code;
if( user && op ) return SLAP_SCHERR_CLASS_BAD_SUP;
code = oc_insert(soc,err);
return code;
}
#ifdef LDAP_DEBUG
static void
oc_print( ObjectClass *oc )
{
int i;
const char *mid;
printf( "objectclass %s\n", ldap_objectclass2name( &oc->soc_oclass ) );
if ( oc->soc_required != NULL ) {
mid = "\trequires ";
for ( i = 0; oc->soc_required[i] != NULL; i++, mid = "," )
printf( "%s%s", mid,
ldap_attributetype2name( &oc->soc_required[i]->sat_atype ) );
printf( "\n" );
}
if ( oc->soc_allowed != NULL ) {
mid = "\tallows ";
for ( i = 0; oc->soc_allowed[i] != NULL; i++, mid = "," )
printf( "%s%s", mid,
ldap_attributetype2name( &oc->soc_allowed[i]->sat_atype ) );
printf( "\n" );
}
}
#endif
#if defined( SLAPD_SCHEMA_DN )
int
oc_schema_info( Entry *e )
{
2002-01-02 19:00:36 +08:00
struct berval vals[2];
ObjectClass *oc;
AttributeDescription *ad_objectClasses = slap_schema.si_ad_objectClasses;
2002-01-02 19:00:36 +08:00
vals[1].bv_val = NULL;
for ( oc = oc_list; oc; oc = oc->soc_next ) {
2002-01-02 19:00:36 +08:00
if ( ldap_objectclass2bv( &oc->soc_oclass, vals ) == NULL ) {
return -1;
}
2002-05-29 14:14:55 +08:00
if( oc->soc_flags & SLAP_OC_HIDE ) continue;
#if 0
Debug( LDAP_DEBUG_TRACE, "Merging oc [%ld] %s\n",
2002-01-02 19:00:36 +08:00
(long) vals[0].bv_len, vals[0].bv_val, 0 );
#endif
attr_merge( e, ad_objectClasses, vals );
2002-01-02 19:00:36 +08:00
ldap_memfree( vals[0].bv_val );
}
return 0;
}
#endif