2 Unix SMB/CIFS mplementation.
4 implement possibleInferiors calculation
6 Copyright (C) Andrew Tridgell 2009
7 Copyright (C) Andrew Bartlett <abartlet@samba.org> 2009
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>.
24 This module is a C implementation of the logic in the
25 dsdb/samdb/ldb_modules/tests/possibleInferiors.py code
27 To understand the C code, please see the python code first
31 #include "dsdb/samdb/samdb.h"
35 create the SUPCLASSES() list
37 static char **schema_supclasses(struct dsdb_schema *schema, struct dsdb_class *schema_class)
41 if (schema_class->supclasses) {
42 return schema_class->supclasses;
45 list = str_list_make_empty(schema_class);
47 DEBUG(0,(__location__ " out of memory\n"));
51 /* Cope with 'top SUP top', ie top is subClassOf top */
52 if (strcmp(schema_class->lDAPDisplayName, schema_class->subClassOf) == 0) {
53 schema_class->supclasses = list;
57 if (schema_class->subClassOf) {
59 list = str_list_add_const(list, schema_class->subClassOf);
61 list2 = schema_supclasses(schema,
62 discard_const_p(struct dsdb_class,
63 dsdb_class_by_lDAPDisplayName(schema,
64 schema_class->subClassOf)));
65 list = str_list_append_const(list, list2);
68 schema_class->supclasses = str_list_unique(list);
74 this one is used internally
75 matches SUBCLASSES() python function
77 static char **schema_subclasses(struct dsdb_schema *schema, TALLOC_CTX *mem_ctx, char **oclist)
79 char **list = str_list_make_empty(mem_ctx);
82 for (i=0; oclist && oclist[i]; i++) {
83 struct dsdb_class *schema_class = dsdb_class_by_lDAPDisplayName(schema, oclist[i]);
84 list = str_list_append_const(list, schema_class->subclasses);
91 equivalent of the POSSSUPERIORS() python function
93 static char **schema_posssuperiors(struct dsdb_schema *schema,
94 struct dsdb_class *schema_class)
96 if (schema_class->posssuperiors == NULL) {
97 char **list2 = str_list_make_empty(schema_class);
101 list2 = str_list_append_const(list2, schema_class->systemPossSuperiors);
102 list2 = str_list_append_const(list2, schema_class->possSuperiors);
103 list3 = schema_supclasses(schema, schema_class);
104 for (i=0; list3 && list3[i]; i++) {
105 struct dsdb_class *class2 = dsdb_class_by_lDAPDisplayName(schema, list3[i]);
106 list2 = str_list_append_const(list2, schema_posssuperiors(schema, class2));
108 list2 = str_list_append_const(list2, schema_subclasses(schema, list2, list2));
110 schema_class->posssuperiors = str_list_unique(list2);
113 return schema_class->posssuperiors;
116 static char **schema_subclasses_recurse(struct dsdb_schema *schema, struct dsdb_class *schema_class)
118 char **list = str_list_copy_const(schema_class, schema_class->subclasses_direct);
120 for (i=0;list && list[i]; i++) {
121 struct dsdb_class *schema_class2 = dsdb_class_by_lDAPDisplayName(schema, list[i]);
122 if (schema_class != schema_class2) {
123 list = str_list_append_const(list, schema_subclasses_recurse(schema, schema_class2));
129 static void schema_create_subclasses(struct dsdb_schema *schema)
131 struct dsdb_class *schema_class;
133 for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
134 struct dsdb_class *schema_class2 = dsdb_class_by_lDAPDisplayName(schema, schema_class->subClassOf);
135 if (schema_class != schema_class2) {
136 if (schema_class2->subclasses_direct == NULL) {
137 schema_class2->subclasses_direct = str_list_make_empty(schema_class2);
139 schema_class2->subclasses_direct = str_list_add_const(schema_class2->subclasses_direct,
140 schema_class->lDAPDisplayName);
144 for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
145 schema_class->subclasses = str_list_unique(schema_subclasses_recurse(schema, schema_class));
149 static void schema_fill_possible_inferiors(struct dsdb_schema *schema, struct dsdb_class *schema_class)
151 struct dsdb_class *c2;
153 for (c2=schema->classes; c2; c2=c2->next) {
154 char **superiors = schema_posssuperiors(schema, c2);
155 if (c2->systemOnly == false
156 && c2->objectClassCategory != 2
157 && c2->objectClassCategory != 3
158 && str_list_check(superiors, schema_class->lDAPDisplayName)) {
159 if (schema_class->possibleInferiors == NULL) {
160 schema_class->possibleInferiors = str_list_make_empty(schema_class);
162 schema_class->possibleInferiors = str_list_add_const(schema_class->possibleInferiors,
163 c2->lDAPDisplayName);
166 schema_class->possibleInferiors = str_list_unique(schema_class->possibleInferiors);
170 fill in a string class name from a governs_ID
172 static void schema_fill_from_class_one(struct dsdb_schema *schema, struct dsdb_class *c,
173 const char **s, uint32_t id)
175 if (*s == NULL && id != 0) {
176 struct dsdb_class *c2 = dsdb_class_by_governsID_id(schema, id);
178 *s = c2->lDAPDisplayName;
184 fill in a list of string class names from a governs_ID list
186 static void schema_fill_from_class_list(struct dsdb_schema *schema, struct dsdb_class *c,
187 const char ***s, uint32_t *ids)
189 if (*s == NULL && ids != NULL) {
191 for (i=0;ids[i];i++) ;
192 *s = talloc_array(c, const char *, i+1);
193 for (i=0;ids[i];i++) {
194 struct dsdb_class *c2 = dsdb_class_by_governsID_id(schema, ids[i]);
196 (*s)[i] = c2->lDAPDisplayName;
206 fill in a list of string attribute names from a attributeID list
208 static void schema_fill_from_attribute_list(struct dsdb_schema *schema, struct dsdb_class *c,
209 const char ***s, uint32_t *ids)
211 if (*s == NULL && ids != NULL) {
213 for (i=0;ids[i];i++) ;
214 *s = talloc_array(c, const char *, i+1);
215 for (i=0;ids[i];i++) {
216 struct dsdb_attribute *a = dsdb_attribute_by_attributeID_id(schema, ids[i]);
218 (*s)[i] = a->lDAPDisplayName;
228 if the schema came from DRS then some attributes will be setup as IDs
230 static void schema_fill_from_ids(struct dsdb_schema *schema)
232 struct dsdb_class *c;
233 for (c=schema->classes; c; c=c->next) {
234 schema_fill_from_class_one(schema, c, &c->subClassOf, c->subClassOf_id);
235 schema_fill_from_attribute_list(schema, c, &c->systemMayContain, c->systemMayContain_ids);
236 schema_fill_from_attribute_list(schema, c, &c->systemMustContain, c->systemMustContain_ids);
237 schema_fill_from_attribute_list(schema, c, &c->mustContain, c->mustContain_ids);
238 schema_fill_from_attribute_list(schema, c, &c->mayContain, c->mayContain_ids);
239 schema_fill_from_class_list(schema, c, &c->possSuperiors, c->possSuperiors_ids);
240 schema_fill_from_class_list(schema, c, &c->systemPossSuperiors, c->systemPossSuperiors_ids);
241 schema_fill_from_class_list(schema, c, &c->systemAuxiliaryClass, c->systemAuxiliaryClass_ids);
242 schema_fill_from_class_list(schema, c, &c->auxiliaryClass, c->auxiliaryClass_ids);
246 void schema_fill_constructed(struct dsdb_schema *schema)
248 struct dsdb_class *schema_class;
250 schema_fill_from_ids(schema);
252 schema_create_subclasses(schema);
254 for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
255 schema_fill_possible_inferiors(schema, schema_class);
258 /* free up our internal cache elements */
259 for (schema_class=schema->classes; schema_class; schema_class=schema_class->next) {
260 talloc_free(schema_class->supclasses);
261 talloc_free(schema_class->subclasses_direct);
262 talloc_free(schema_class->subclasses);
263 talloc_free(schema_class->posssuperiors);
264 schema_class->supclasses = NULL;
265 schema_class->subclasses_direct = NULL;
266 schema_class->subclasses = NULL;
267 schema_class->posssuperiors = NULL;