1 /* oc.c - object class routines */
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>.
22 #include <ac/string.h>
23 #include <ac/socket.h>
27 int is_object_subclass(
33 if( sub == NULL || sup == NULL ) return 0;
36 Debug( LDAP_DEBUG_TRACE, "is_object_subclass(%s,%s) %d\n",
37 sup->soc_oid, sub->soc_oid, sup == sub );
44 if( sub->soc_sups == NULL ) {
48 for( i=0; sub->soc_sups[i] != NULL; i++ ) {
49 if( is_object_subclass( sup, sub->soc_sups[i] ) ) {
57 int is_entry_objectclass(
63 * set_flags should only be true if oc is one of operational
64 * object classes which we support objectClass flags for
65 * (e.g., referral, alias, ...). See <slap.h>.
71 assert( !( e == NULL || oc == NULL ) );
72 assert( ( flags & SLAP_OCF_MASK ) != SLAP_OCF_MASK );
74 if( e == NULL || oc == NULL ) {
78 if( flags == SLAP_OCF_SET_FLAGS && ( e->e_ocflags & SLAP_OC__END ) )
80 /* flags are set, use them */
81 return (e->e_ocflags & oc->soc_flags & SLAP_OC__MASK) != 0;
85 * find objectClass attribute
87 attr = attr_find( e->e_attrs, slap_schema.si_ad_objectClass );
89 /* no objectClass attribute */
90 Debug( LDAP_DEBUG_ANY, "is_entry_objectclass(\"%s\", \"%s\") "
91 "no objectClass attribute\n",
92 e->e_dn == NULL ? "" : e->e_dn,
93 oc->soc_oclass.oc_oid, 0 );
98 for( bv=attr->a_vals; bv->bv_val; bv++ ) {
99 ObjectClass *objectClass = oc_bvfind( bv );
101 if ( objectClass == NULL ) {
102 /* FIXME: is this acceptable? */
106 if ( !( flags & SLAP_OCF_SET_FLAGS ) ) {
107 if ( objectClass == oc ) {
111 if ( ( flags & SLAP_OCF_CHECK_SUP )
112 && is_object_subclass( oc, objectClass ) )
118 e->e_ocflags |= objectClass->soc_flags;
121 /* mark flags as set */
122 e->e_ocflags |= SLAP_OC__END;
124 return ( e->e_ocflags & oc->soc_flags & SLAP_OC__MASK ) != 0;
129 struct berval oir_name;
133 static Avlnode *oc_index = NULL;
134 static Avlnode *oc_cache = NULL;
135 static LDAP_STAILQ_HEAD(OCList, slap_object_class) oc_list
136 = LDAP_STAILQ_HEAD_INITIALIZER(oc_list);
143 const struct oindexrec *oir1 = v_oir1, *oir2 = v_oir2;
144 int i = oir1->oir_name.bv_len - oir2->oir_name.bv_len;
146 return strcasecmp( oir1->oir_name.bv_val, oir2->oir_name.bv_val );
154 const struct berval *name = v_name;
155 const struct oindexrec *oir = v_oir;
156 int i = name->bv_len - oir->oir_name.bv_len;
158 return strncasecmp( name->bv_val, oir->oir_name.bv_val, name->bv_len );
162 oc_find( const char *ocname )
166 bv.bv_val = (char *)ocname;
167 bv.bv_len = strlen( ocname );
169 return( oc_bvfind( &bv ) );
173 oc_bvfind( struct berval *ocname )
175 struct oindexrec *oir;
178 oir = avl_find( oc_cache, ocname, oc_index_name_cmp );
179 if ( oir ) return oir->oir_oc;
181 oir = avl_find( oc_index, ocname, oc_index_name_cmp );
185 avl_insert( &oc_cache, (caddr_t) oir,
186 oc_index_cmp, avl_dup_error );
188 return( oir->oir_oc );
194 static LDAP_STAILQ_HEAD(OCUList, slap_object_class) oc_undef_list
195 = LDAP_STAILQ_HEAD_INITIALIZER(oc_undef_list);
198 oc_bvfind_undef( struct berval *ocname )
200 ObjectClass *oc = oc_bvfind( ocname );
206 LDAP_STAILQ_FOREACH( oc, &oc_undef_list, soc_next ) {
207 int d = oc->soc_cname.bv_len - ocname->bv_len;
213 if ( strcasecmp( oc->soc_cname.bv_val, ocname->bv_val ) == 0 ) {
222 oc = ch_malloc( sizeof( ObjectClass ) + ocname->bv_len + 1 );
223 memset( oc, 0, sizeof( ObjectClass ) );
225 oc->soc_cname.bv_len = ocname->bv_len;
226 oc->soc_cname.bv_val = (char *)&oc[ 1 ];
227 AC_MEMCPY( oc->soc_cname.bv_val, ocname->bv_val, ocname->bv_len );
229 LDAP_STAILQ_NEXT( oc, soc_next ) = NULL;
230 LDAP_STAILQ_INSERT_HEAD( &oc_undef_list, oc, soc_next );
244 AttributeType **satp;
250 sat = at_find(*attrs1);
253 return SLAP_SCHERR_ATTR_NOT_FOUND;
256 if( is_at_operational( sat )) (*op)++;
258 if ( at_find_in_list(sat, soc->soc_required) < 0) {
259 if ( at_append_to_list(sat, &soc->soc_required) ) {
261 return SLAP_SCHERR_OUTOFMEM;
266 /* Now delete duplicates from the allowed list */
267 for ( satp = soc->soc_required; *satp; satp++ ) {
268 i = at_find_in_list(*satp,soc->soc_allowed);
270 at_delete_from_list(i, &soc->soc_allowed);
290 sat = at_find(*attrs1);
293 return SLAP_SCHERR_ATTR_NOT_FOUND;
296 if( is_at_operational( sat )) (*op)++;
298 if ( at_find_in_list(sat, soc->soc_required) < 0 &&
299 at_find_in_list(sat, soc->soc_allowed) < 0 ) {
300 if ( at_append_to_list(sat, &soc->soc_allowed) ) {
302 return SLAP_SCHERR_OUTOFMEM;
325 if ( !soc->soc_sups ) {
326 /* We are at the first recursive level */
334 soc->soc_sups = (ObjectClass **)ch_calloc(nsups,
335 sizeof(ObjectClass *));
341 soc1 = oc_find(*sups1);
344 return SLAP_SCHERR_CLASS_NOT_FOUND;
347 /* check object class usage
348 * abstract classes can only sup abstract classes
349 * structural classes can not sup auxiliary classes
350 * auxiliary classes can not sup structural classes
352 if( soc->soc_kind != soc1->soc_kind
353 && soc1->soc_kind != LDAP_SCHEMA_ABSTRACT )
356 return SLAP_SCHERR_CLASS_BAD_SUP;
359 if( soc1->soc_obsolete && !soc->soc_obsolete ) {
361 return SLAP_SCHERR_CLASS_BAD_SUP;
364 if( soc->soc_flags & SLAP_OC_OPERATIONAL ) (*op)++;
367 soc->soc_sups[nsups] = soc1;
370 code = oc_add_sups( soc, soc1->soc_sup_oids, op, err );
371 if ( code ) return code;
373 code = oc_create_required( soc, soc1->soc_at_oids_must, op, err );
374 if ( code ) return code;
376 code = oc_create_allowed( soc, soc1->soc_at_oids_may, op, err );
377 if ( code ) return code;
392 avl_free(oc_index, ldap_memfree);
393 while( !LDAP_STAILQ_EMPTY(&oc_list) ) {
394 o = LDAP_STAILQ_FIRST(&oc_list);
395 LDAP_STAILQ_REMOVE_HEAD(&oc_list, soc_next);
397 if (o->soc_sups) ldap_memfree(o->soc_sups);
398 if (o->soc_required) ldap_memfree(o->soc_required);
399 if (o->soc_allowed) ldap_memfree(o->soc_allowed);
400 if (o->soc_oidmacro) ldap_memfree(o->soc_oidmacro);
401 ldap_objectclass_free((LDAPObjectClass *)o);
404 while( !LDAP_STAILQ_EMPTY(&oc_undef_list) ) {
405 o = LDAP_STAILQ_FIRST(&oc_undef_list);
406 LDAP_STAILQ_REMOVE_HEAD(&oc_undef_list, soc_next);
408 ch_free( (ObjectClass *)o );
413 * check whether the two ObjectClasses actually __are__ identical,
414 * or rather inconsistent
419 ObjectClass *new_soc )
421 if ( new_soc->soc_oid != NULL ) {
422 if ( soc->soc_oid == NULL ) {
423 return SLAP_SCHERR_CLASS_INCONSISTENT;
426 if ( strcmp( soc->soc_oid, new_soc->soc_oid ) != 0 ) {
427 return SLAP_SCHERR_CLASS_INCONSISTENT;
431 if ( soc->soc_oid != NULL ) {
432 return SLAP_SCHERR_CLASS_INCONSISTENT;
436 if ( new_soc->soc_names ) {
439 if ( soc->soc_names == NULL ) {
440 return SLAP_SCHERR_CLASS_INCONSISTENT;
443 for ( i = 0; new_soc->soc_names[ i ]; i++ ) {
444 if ( soc->soc_names[ i ] == NULL ) {
445 return SLAP_SCHERR_CLASS_INCONSISTENT;
448 if ( strcasecmp( soc->soc_names[ i ],
449 new_soc->soc_names[ i ] ) != 0 )
451 return SLAP_SCHERR_CLASS_INCONSISTENT;
455 if ( soc->soc_names != NULL ) {
456 return SLAP_SCHERR_CLASS_INCONSISTENT;
460 return SLAP_SCHERR_CLASS_DUP;
468 struct oindexrec *oir;
471 if ( soc->soc_oid ) {
472 oir = (struct oindexrec *)
473 ch_calloc( 1, sizeof(struct oindexrec) );
474 oir->oir_name.bv_val = soc->soc_oid;
475 oir->oir_name.bv_len = strlen( soc->soc_oid );
478 assert( oir->oir_name.bv_val != NULL );
479 assert( oir->oir_oc != NULL );
481 if ( avl_insert( &oc_index, (caddr_t) oir,
482 oc_index_cmp, avl_dup_error ) )
484 ObjectClass *old_soc;
489 old_soc = oc_bvfind( &oir->oir_name );
490 assert( old_soc != NULL );
491 rc = oc_check_dup( old_soc, soc );
497 /* FIX: temporal consistency check */
498 assert( oc_bvfind( &oir->oir_name ) != NULL );
501 if ( (names = soc->soc_names) ) {
503 oir = (struct oindexrec *)
504 ch_calloc( 1, sizeof(struct oindexrec) );
505 oir->oir_name.bv_val = *names;
506 oir->oir_name.bv_len = strlen( *names );
509 assert( oir->oir_name.bv_val != NULL );
510 assert( oir->oir_oc != NULL );
512 if ( avl_insert( &oc_index, (caddr_t) oir,
513 oc_index_cmp, avl_dup_error ) )
515 ObjectClass *old_soc;
520 old_soc = oc_bvfind( &oir->oir_name );
521 assert( old_soc != NULL );
522 rc = oc_check_dup( old_soc, soc );
528 /* FIX: temporal consistency check */
529 assert( oc_bvfind(&oir->oir_name) != NULL );
534 LDAP_STAILQ_INSERT_TAIL( &oc_list, soc, soc_next );
551 if ( oc->oc_names != NULL ) {
554 for( i=0; oc->oc_names[i]; i++ ) {
555 if( !slap_valid_descr( oc->oc_names[i] ) ) {
556 return SLAP_SCHERR_BAD_DESCR;
561 if ( !OID_LEADCHAR( oc->oc_oid[0] )) {
562 /* Expand OID macros */
563 char *oid = oidm_find( oc->oc_oid );
566 return SLAP_SCHERR_OIDM;
568 if ( oid != oc->oc_oid ) {
574 soc = (ObjectClass *) ch_calloc( 1, sizeof(ObjectClass) );
575 AC_MEMCPY( &soc->soc_oclass, oc, sizeof(LDAPObjectClass) );
577 soc->soc_oidmacro = oidm;
578 if( oc->oc_names != NULL ) {
579 soc->soc_cname.bv_val = soc->soc_names[0];
581 soc->soc_cname.bv_val = soc->soc_oid;
583 soc->soc_cname.bv_len = strlen( soc->soc_cname.bv_val );
585 if( soc->soc_sup_oids == NULL &&
586 soc->soc_kind == LDAP_SCHEMA_STRUCTURAL )
588 /* structural object classes implicitly inherit from 'top' */
589 static char *top_oids[] = { SLAPD_TOP_OID, NULL };
590 code = oc_add_sups( soc, top_oids, &op, err );
592 code = oc_add_sups( soc, soc->soc_sup_oids, &op, err );
595 if ( code != 0 ) return code;
596 if( user && op ) return SLAP_SCHERR_CLASS_BAD_SUP;
598 code = oc_create_required( soc, soc->soc_at_oids_must, &op, err );
599 if ( code != 0 ) return code;
601 code = oc_create_allowed( soc, soc->soc_at_oids_may, &op, err );
602 if ( code != 0 ) return code;
604 if( user && op ) return SLAP_SCHERR_CLASS_BAD_USAGE;
606 if( !user ) soc->soc_flags |= SLAP_OC_HARDCODE;
608 code = oc_insert(soc,err);
609 if ( code == 0 && rsoc )
615 oc_unparse( BerVarray *res, ObjectClass *start, ObjectClass *end, int sys )
619 struct berval bv, *bva = NULL, idx;
623 start = LDAP_STAILQ_FIRST( &oc_list );
625 /* count the result size */
627 for ( oc=start; oc; oc=LDAP_STAILQ_NEXT(oc, soc_next)) {
628 if ( sys && !(oc->soc_flags & SLAP_OC_HARDCODE)) continue;
630 if ( oc == end ) break;
635 bva = ch_malloc( (num+1) * sizeof(struct berval) );
643 for ( oc=start; oc; oc=LDAP_STAILQ_NEXT(oc, soc_next)) {
644 LDAPObjectClass loc, *locp;
645 if ( sys && !(oc->soc_flags & SLAP_OC_HARDCODE)) continue;
646 if ( oc->soc_oidmacro ) {
647 loc = oc->soc_oclass;
648 loc.oc_oid = oc->soc_oidmacro;
651 locp = &oc->soc_oclass;
653 if ( ldap_objectclass2bv( locp, &bv ) == NULL ) {
654 ber_bvarray_free( bva );
657 idx.bv_len = sprintf(idx.bv_val, "{%d}", i);
659 bva[i].bv_len = idx.bv_len + bv.bv_len;
660 bva[i].bv_val = ch_malloc( bva[i].bv_len + 1 );
661 strcpy( bva[i].bv_val, ibuf );
662 strcpy( bva[i].bv_val + idx.bv_len, bv.bv_val );
664 bva[i].bv_val = NULL;
665 ldap_memfree( bv.bv_val );
666 if ( oc == end ) break;
672 oc_schema_info( Entry *e )
674 AttributeDescription *ad_objectClasses = slap_schema.si_ad_objectClasses;
679 LDAP_STAILQ_FOREACH( oc, &oc_list, soc_next ) {
680 if( oc->soc_flags & SLAP_OC_HIDE ) continue;
682 if ( ldap_objectclass2bv( &oc->soc_oclass, &val ) == NULL ) {
686 nval = oc->soc_cname;
689 Debug( LDAP_DEBUG_TRACE, "Merging oc [%ld] %s (%s)\n",
690 (long) val.bv_len, val.bv_val, nval.bv_val );
693 if( attr_merge_one( e, ad_objectClasses, &val, &nval ) ) {
696 ldap_memfree( val.bv_val );