1
0
mirror of https://github.com/samba-team/samba.git synced 2025-01-24 02:04:21 +03:00
samba-mirror/source4/dsdb/schema/schema_inferiors.c
Andrew Tridgell ae8515d31b fixed the pull of drs schema elements
The previous code incorrectly assumed that attributes such as 
subClassOf come over the wire as strings. In fact they come over as 32
bit integers which refer to goversIDs. We have to post-process these
as it sometimes happens that a governsID comes over the wire before
the record that defines what it means.
2009-07-02 14:55:38 +10:00

270 lines
8.3 KiB
C

/*
Unix SMB/CIFS mplementation.
implement possibleInferiors calculation
Copyright (C) Andrew Tridgell 2009
Copyright (C) Andrew Bartlett <abartlet@samba.org> 2009
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
This module is a C implementation of the logic in the
dsdb/samdb/ldb_modules/tests/possibleInferiors.py code
To understand the C code, please see the python code first
*/
#include "includes.h"
#include "dsdb/samdb/samdb.h"
/*
create the SUPCLASSES() list
*/
static char **schema_supclasses(struct dsdb_schema *schema, struct dsdb_class *schema_class)
{
char **list;
if (schema_class->supclasses) {
return schema_class->supclasses;
}
list = str_list_make_empty(schema_class);
if (list == NULL) {
DEBUG(0,(__location__ " out of memory\n"));
return NULL;
}
/* Cope with 'top SUP top', ie top is subClassOf top */
if (strcmp(schema_class->lDAPDisplayName, schema_class->subClassOf) == 0) {
schema_class->supclasses = list;
return list;
}
if (schema_class->subClassOf) {
const char **list2;
list = str_list_add_const(list, schema_class->subClassOf);
list2 = schema_supclasses(schema,
discard_const_p(struct dsdb_class,
dsdb_class_by_lDAPDisplayName(schema,
schema_class->subClassOf)));
list = str_list_append_const(list, list2);
}
schema_class->supclasses = str_list_unique(list);
return list;
}
/*
this one is used internally
matches SUBCLASSES() python function
*/
static char **schema_subclasses(struct dsdb_schema *schema, TALLOC_CTX *mem_ctx, char **oclist)
{
char **list = str_list_make_empty(mem_ctx);
int i;
for (i=0; oclist && oclist[i]; i++) {
struct dsdb_class *schema_class = dsdb_class_by_lDAPDisplayName(schema, oclist[i]);
list = str_list_append_const(list, schema_class->subclasses);
}
return list;
}
/*
equivalent of the POSSSUPERIORS() python function
*/
static char **schema_posssuperiors(struct dsdb_schema *schema,
struct dsdb_class *schema_class)
{
if (schema_class->posssuperiors == NULL) {
char **list2 = str_list_make_empty(schema_class);
char **list3;
int i;
list2 = str_list_append_const(list2, schema_class->systemPossSuperiors);
list2 = str_list_append_const(list2, schema_class->possSuperiors);
list3 = schema_supclasses(schema, schema_class);
for (i=0; list3 && list3[i]; i++) {
struct dsdb_class *class2 = dsdb_class_by_lDAPDisplayName(schema, list3[i]);
list2 = str_list_append_const(list2, schema_posssuperiors(schema, class2));
}
list2 = str_list_append_const(list2, schema_subclasses(schema, list2, list2));
schema_class->posssuperiors = str_list_unique(list2);
}
return schema_class->posssuperiors;
}
static char **schema_subclasses_recurse(struct dsdb_schema *schema, struct dsdb_class *schema_class)
{
char **list = str_list_copy_const(schema_class, schema_class->subclasses_direct);
int i;
for (i=0;list && list[i]; i++) {
struct dsdb_class *schema_class2 = dsdb_class_by_lDAPDisplayName(schema, list[i]);
if (schema_class != schema_class2) {
list = str_list_append_const(list, schema_subclasses_recurse(schema, schema_class2));
}
}
return list;
}
static void schema_create_subclasses(struct dsdb_schema *schema)
{
struct dsdb_class *schema_class;
for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
struct dsdb_class *schema_class2 = dsdb_class_by_lDAPDisplayName(schema, schema_class->subClassOf);
if (schema_class != schema_class2) {
if (schema_class2->subclasses_direct == NULL) {
schema_class2->subclasses_direct = str_list_make_empty(schema_class2);
}
schema_class2->subclasses_direct = str_list_add_const(schema_class2->subclasses_direct,
schema_class->lDAPDisplayName);
}
}
for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
schema_class->subclasses = str_list_unique(schema_subclasses_recurse(schema, schema_class));
}
}
static void schema_fill_possible_inferiors(struct dsdb_schema *schema, struct dsdb_class *schema_class)
{
struct dsdb_class *c2;
for (c2=schema->classes; c2; c2=c2->next) {
char **superiors = schema_posssuperiors(schema, c2);
if (c2->systemOnly == false
&& c2->objectClassCategory != 2
&& c2->objectClassCategory != 3
&& str_list_check(superiors, schema_class->lDAPDisplayName)) {
if (schema_class->possibleInferiors == NULL) {
schema_class->possibleInferiors = str_list_make_empty(schema_class);
}
schema_class->possibleInferiors = str_list_add_const(schema_class->possibleInferiors,
c2->lDAPDisplayName);
}
}
schema_class->possibleInferiors = str_list_unique(schema_class->possibleInferiors);
}
/*
fill in a string class name from a governs_ID
*/
static void schema_fill_from_class_one(struct dsdb_schema *schema, struct dsdb_class *c,
const char **s, uint32_t id)
{
if (*s == NULL && id != 0) {
struct dsdb_class *c2 = dsdb_class_by_governsID_id(schema, id);
if (c2) {
*s = c2->lDAPDisplayName;
}
}
}
/*
fill in a list of string class names from a governs_ID list
*/
static void schema_fill_from_class_list(struct dsdb_schema *schema, struct dsdb_class *c,
const char ***s, uint32_t *ids)
{
if (*s == NULL && ids != NULL) {
int i;
for (i=0;ids[i];i++) ;
*s = talloc_array(c, const char *, i+1);
for (i=0;ids[i];i++) {
struct dsdb_class *c2 = dsdb_class_by_governsID_id(schema, ids[i]);
if (c2) {
(*s)[i] = c2->lDAPDisplayName;
} else {
(*s)[i] = NULL;
}
}
(*s)[i] = NULL;
}
}
/*
fill in a list of string attribute names from a attributeID list
*/
static void schema_fill_from_attribute_list(struct dsdb_schema *schema, struct dsdb_class *c,
const char ***s, uint32_t *ids)
{
if (*s == NULL && ids != NULL) {
int i;
for (i=0;ids[i];i++) ;
*s = talloc_array(c, const char *, i+1);
for (i=0;ids[i];i++) {
struct dsdb_attribute *a = dsdb_attribute_by_attributeID_id(schema, ids[i]);
if (a) {
(*s)[i] = a->lDAPDisplayName;
} else {
(*s)[i] = NULL;
}
}
(*s)[i] = NULL;
}
}
/*
if the schema came from DRS then some attributes will be setup as IDs
*/
static void schema_fill_from_ids(struct dsdb_schema *schema)
{
struct dsdb_class *c;
for (c=schema->classes; c; c=c->next) {
schema_fill_from_class_one(schema, c, &c->subClassOf, c->subClassOf_id);
schema_fill_from_attribute_list(schema, c, &c->systemMayContain, c->systemMayContain_ids);
schema_fill_from_attribute_list(schema, c, &c->systemMustContain, c->systemMustContain_ids);
schema_fill_from_attribute_list(schema, c, &c->mustContain, c->mustContain_ids);
schema_fill_from_attribute_list(schema, c, &c->mayContain, c->mayContain_ids);
schema_fill_from_class_list(schema, c, &c->possSuperiors, c->possSuperiors_ids);
schema_fill_from_class_list(schema, c, &c->systemPossSuperiors, c->systemPossSuperiors_ids);
schema_fill_from_class_list(schema, c, &c->systemAuxiliaryClass, c->systemAuxiliaryClass_ids);
schema_fill_from_class_list(schema, c, &c->auxiliaryClass, c->auxiliaryClass_ids);
}
}
void schema_fill_constructed(struct dsdb_schema *schema)
{
struct dsdb_class *schema_class;
schema_fill_from_ids(schema);
schema_create_subclasses(schema);
for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
schema_fill_possible_inferiors(schema, schema_class);
}
/* free up our internal cache elements */
for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
talloc_free(schema_class->supclasses);
talloc_free(schema_class->subclasses_direct);
talloc_free(schema_class->subclasses);
talloc_free(schema_class->posssuperiors);
schema_class->supclasses = NULL;
schema_class->subclasses_direct = NULL;
schema_class->subclasses = NULL;
schema_class->posssuperiors = NULL;
}
}