1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
|
#!/usr/bin/python
# Unix SMB/CIFS implementation.
# Copyright (C) Andrew Tridgell 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/>.
#
"""Tests the possibleInferiors generation in the schema_fsmo ldb module"""
import optparse
import sys
# Find right directory when running from source tree
sys.path.insert(0, "bin/python")
import samba
from samba import getopt as options, Ldb
import ldb
parser = optparse.OptionParser("possibleinferiors.py <URL> [<CLASS>]")
sambaopts = options.SambaOptions(parser)
parser.add_option_group(sambaopts)
credopts = options.CredentialsOptions(parser)
parser.add_option_group(credopts)
parser.add_option_group(options.VersionOptions(parser))
parser.add_option("--wspp", action="store_true")
opts, args = parser.parse_args()
if len(args) < 1:
parser.print_usage()
sys.exit(1)
url = args[0]
if (len(args) > 1):
objectclass = args[1]
else:
objectclass = None
def uniq_list(alist):
"""return a unique list"""
set = {}
return [set.setdefault(e,e) for e in alist if e not in set]
lp_ctx = sambaopts.get_loadparm()
creds = credopts.get_credentials(lp_ctx)
db = Ldb(url, credentials=creds, lp=lp_ctx, options=["modules:paged_searches"])
# get the rootDSE
res = db.search(base="", expression="",
scope=ldb.SCOPE_BASE,
attrs=["schemaNamingContext"])
rootDse = res[0]
schema_base = rootDse["schemaNamingContext"][0]
def possible_inferiors_search(db, oc):
"""return the possible inferiors via a search for the possibleInferiors attribute"""
res = db.search(base=schema_base,
expression=("ldapDisplayName=%s" % oc),
attrs=["possibleInferiors"])
poss=[]
if len(res) == 0 or res[0].get("possibleInferiors") is None:
return poss
for item in res[0]["possibleInferiors"]:
poss.append(str(item))
poss = uniq_list(poss)
poss.sort()
return poss;
# see [MS-ADTS] section 3.1.1.4.5.21
# and section 3.1.1.4.2 for this algorithm
# !systemOnly=TRUE
# !objectClassCategory=2
# !objectClassCategory=3
def SUPCLASSES(classinfo, oc):
list = []
if oc == "top":
return list
if classinfo[oc].get("SUPCLASSES") is not None:
return classinfo[oc]["SUPCLASSES"]
res = classinfo[oc]["subClassOf"];
for r in res:
list.append(r)
list.extend(SUPCLASSES(classinfo,r))
classinfo[oc]["SUPCLASSES"] = list
return list
def AUXCLASSES(classinfo, oclist):
list = []
if oclist == []:
return list
for oc in oclist:
if classinfo[oc].get("AUXCLASSES") is not None:
list.extend(classinfo[oc]["AUXCLASSES"])
else:
list2 = []
list2.extend(classinfo[oc]["systemAuxiliaryClass"])
list2.extend(AUXCLASSES(classinfo, classinfo[oc]["systemAuxiliaryClass"]))
list2.extend(classinfo[oc]["auxiliaryClass"])
list2.extend(AUXCLASSES(classinfo, classinfo[oc]["auxiliaryClass"]))
list2.extend(AUXCLASSES(classinfo, SUPCLASSES(classinfo, oc)))
classinfo[oc]["AUXCLASSES"] = list2
list.extend(list2)
return list
def SUBCLASSES(classinfo, oclist):
list = []
for oc in oclist:
list.extend(classinfo[oc]["SUBCLASSES"])
return list
def POSSSUPERIORS(classinfo, oclist):
list = []
for oc in oclist:
if classinfo[oc].get("POSSSUPERIORS") is not None:
list.extend(classinfo[oc]["POSSSUPERIORS"])
else:
list2 = []
list2.extend(classinfo[oc]["systemPossSuperiors"])
list2.extend(classinfo[oc]["possSuperiors"])
list2.extend(POSSSUPERIORS(classinfo, SUPCLASSES(classinfo, oc)))
if opts.wspp:
# the WSPP docs suggest we should do this:
list2.extend(POSSSUPERIORS(classinfo, AUXCLASSES(classinfo, [oc])))
else:
# but testing against w2k3 and w2k8 shows that we need to do this instead
list2.extend(SUBCLASSES(classinfo, list2))
classinfo[oc]["POSSSUPERIORS"] = list2
list.extend(list2)
return list
def pull_classinfo(db):
"""At startup we build a classinfo[] dictionary that holds all the information needed to construct the possible inferiors"""
classinfo = {}
res = db.search(base=schema_base,
expression="objectclass=classSchema",
attrs=["ldapDisplayName", "systemOnly", "objectClassCategory",
"possSuperiors", "systemPossSuperiors",
"auxiliaryClass", "systemAuxiliaryClass", "subClassOf"])
for r in res:
name = str(r["ldapDisplayName"][0])
classinfo[name] = {}
if str(r["systemOnly"]) == "TRUE":
classinfo[name]["systemOnly"] = True
else:
classinfo[name]["systemOnly"] = False
if r.get("objectClassCategory"):
classinfo[name]["objectClassCategory"] = int(r["objectClassCategory"][0])
else:
classinfo[name]["objectClassCategory"] = 0
for a in [ "possSuperiors", "systemPossSuperiors",
"auxiliaryClass", "systemAuxiliaryClass",
"subClassOf" ]:
classinfo[name][a] = []
if r.get(a):
for i in r[a]:
classinfo[name][a].append(str(i))
# build a list of subclasses for each class
def subclasses_recurse(subclasses, oc):
list = subclasses[oc]
for c in list:
list.extend(subclasses_recurse(subclasses, c))
return list
subclasses = {}
for oc in classinfo:
subclasses[oc] = []
for oc in classinfo:
for c in classinfo[oc]["subClassOf"]:
if not c == oc:
subclasses[c].append(oc)
for oc in classinfo:
classinfo[oc]["SUBCLASSES"] = uniq_list(subclasses_recurse(subclasses, oc))
return classinfo
def is_in_list(list, c):
for a in list:
if c == a:
return True
return False
def possible_inferiors_constructed(db, classinfo, c):
list = []
for oc in classinfo:
superiors = POSSSUPERIORS(classinfo, [oc])
if (is_in_list(superiors, c) and
classinfo[oc]["systemOnly"] == False and
classinfo[oc]["objectClassCategory"] != 2 and
classinfo[oc]["objectClassCategory"] != 3):
list.append(oc)
list = uniq_list(list)
list.sort()
return list
def test_class(db, classinfo, oc):
"""test to see if one objectclass returns the correct possibleInferiors"""
print "Testing objectClass %s" % oc
poss1 = possible_inferiors_search(db, oc)
poss2 = possible_inferiors_constructed(db, classinfo, oc)
if poss1 != poss2:
print "Returned incorrect list for objectclass %s" % oc
print "search: %s" % poss1
print "constructed: %s" % poss2
for i in range(0,min(len(poss1),len(poss2))):
print "%30s %30s" % (poss1[i], poss2[i])
exit(1)
def get_object_classes(db):
"""return a list of all object classes"""
list=[]
for item in classinfo:
list.append(item)
return list
classinfo = pull_classinfo(db)
if objectclass is None:
for oc in get_object_classes(db):
test_class(db,classinfo,oc)
else:
test_class(db,classinfo,objectclass)
print "Lists match OK"
|
