X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=servers%2Fslapd%2Fschema.c;h=bd1601ce0da03b76c69c08a3afba93f3b84c9248;hb=ae3f784d5b8b022fc8bb5ecd2e612d9b1cdd13ed;hp=72340523eee60eb94160b210e55ebc05fbb218da;hpb=3c598e89fb34a892d369a138daa8c3314294493c;p=openldap diff --git a/servers/slapd/schema.c b/servers/slapd/schema.c index 72340523ee..bd1601ce0d 100644 --- a/servers/slapd/schema.c +++ b/servers/slapd/schema.c @@ -2,7 +2,7 @@ /* $OpenLDAP$ */ /* This work is part of OpenLDAP Software . * - * Copyright 1998-2004 The OpenLDAP Foundation. + * Copyright 1998-2005 The OpenLDAP Foundation. * All rights reserved. * * Redistribution and use in source and binary forms, with or without @@ -23,7 +23,6 @@ #include #include "slap.h" -#include "ldap_pvt.h" #include "lutil.h" @@ -46,13 +45,8 @@ schema_info( Entry **entry, const char **text ) e = (Entry *) SLAP_CALLOC( 1, sizeof(Entry) ); if( e == NULL ) { /* Out of memory, do something about it */ -#ifdef NEW_LOGGING - LDAP_LOG( OPERATION, ERR, - "schema_info: SLAP_CALLOC failed - out of memory.\n", 0, 0,0 ); -#else Debug( LDAP_DEBUG_ANY, "schema_info: SLAP_CALLOC failed - out of memory.\n", 0, 0, 0 ); -#endif *text = "out of memory"; return LDAP_OTHER; } @@ -61,31 +55,24 @@ schema_info( Entry **entry, const char **text ) /* backend-specific schema info should be created by the * backend itself */ - ber_dupbv( &e->e_name, &global_schemadn ); - ber_dupbv( &e->e_nname, &global_schemandn ); + ber_dupbv( &e->e_name, &frontendDB->be_schemadn ); + ber_dupbv( &e->e_nname, &frontendDB->be_schemandn ); e->e_private = NULL; - vals[0].bv_val = "subentry"; - vals[0].bv_len = sizeof("subentry")-1; - if( attr_merge_one( e, ad_structuralObjectClass, vals, vals ) ) - { + BER_BVSTR( &vals[0], "subentry" ); + if( attr_merge_one( e, ad_structuralObjectClass, vals, NULL ) ) { /* Out of memory, do something about it */ entry_free( e ); *text = "out of memory"; return LDAP_OTHER; } - vals[0].bv_val = "top"; - vals[0].bv_len = sizeof("top")-1; - vals[1].bv_val = "subentry"; - vals[1].bv_len = sizeof("subentry")-1; - vals[2].bv_val = "subschema"; - vals[2].bv_len = sizeof("subschema")-1; - vals[3].bv_val = "extensibleObject"; - vals[3].bv_len = sizeof("extensibleObject")-1; - vals[4].bv_val = NULL; - if( attr_merge( e, ad_objectClass, vals, vals ) ) - { + BER_BVSTR( &vals[0], "top" ); + BER_BVSTR( &vals[1], "subentry" ); + BER_BVSTR( &vals[2], "subschema" ); + BER_BVSTR( &vals[3], "extensibleObject" ); + BER_BVZERO( &vals[4] ); + if ( attr_merge( e, ad_objectClass, vals, NULL ) ) { /* Out of memory, do something about it */ entry_free( e ); *text = "out of memory"; @@ -95,7 +82,7 @@ schema_info( Entry **entry, const char **text ) { int rc; AttributeDescription *desc = NULL; - struct berval rdn = global_schemadn; + struct berval rdn = frontendDB->be_schemadn; vals[0].bv_val = strchr( rdn.bv_val, '=' ); if( vals[0].bv_val == NULL ) { @@ -115,14 +102,13 @@ schema_info( Entry **entry, const char **text ) return LDAP_OTHER; } - nvals[0].bv_val = strchr( global_schemandn.bv_val, '=' ); + nvals[0].bv_val = strchr( frontendDB->be_schemandn.bv_val, '=' ); assert( nvals[0].bv_val ); nvals[0].bv_val++; - nvals[0].bv_len = global_schemandn.bv_len - - (nvals[0].bv_val - global_schemandn.bv_val); + nvals[0].bv_len = frontendDB->be_schemandn.bv_len - + (nvals[0].bv_val - frontendDB->be_schemandn.bv_val); - if( attr_merge_one( e, desc, vals, nvals ) ) - { + if ( attr_merge_one( e, desc, vals, nvals ) ) { /* Out of memory, do something about it */ entry_free( e ); *text = "out of memory"; @@ -162,15 +148,13 @@ schema_info( Entry **entry, const char **text ) vals[0].bv_val = timebuf; vals[0].bv_len = strlen( timebuf ); - if( attr_merge_one( e, ad_createTimestamp, vals, vals ) ) - { + if( attr_merge_one( e, ad_createTimestamp, vals, NULL ) ) { /* Out of memory, do something about it */ entry_free( e ); *text = "out of memory"; return LDAP_OTHER; } - if( attr_merge_one( e, ad_modifyTimestamp, vals, vals ) ) - { + if( attr_merge_one( e, ad_modifyTimestamp, vals, NULL ) ) { /* Out of memory, do something about it */ entry_free( e ); *text = "out of memory";