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
|
#####################################################################
#
# FakeLDAP Fake LDAP interface to test LDAP functionality
# independently of a running LDAP server
#
# This software is governed by a license. See
# LICENSE.txt for the terms of this license.
#
#####################################################################
__version__='$Revision: 1.3 $'[11:-2]
import ldap, sha, base64
# Module-level stuff
__version__ = '2.fake'
SCOPE_BASE = getattr(ldap, 'SCOPE_BASE')
SCOPE_ONELEVEL = getattr(ldap, 'SCOPE_ONELEVEL')
SCOPE_SUBTREE = getattr(ldap, 'SCOPE_SUBTREE')
MOD_ADD = getattr(ldap, 'MOD_ADD')
MOD_REPLACE = getattr(ldap, 'MOD_REPLACE')
MOD_DELETE = getattr(ldap, 'MOD_DELETE')
OPT_PROTOCOL_VERSION = None
OPT_REFERRALS = None
VERSION2 = None
VERSION3 = None
class LDAPError(Exception): pass
class SERVER_DOWN(Exception): pass
class PROTOCOL_ERROR(Exception): pass
class NO_SUCH_OBJECT(Exception): pass
class INVALID_CREDENTIALS(Exception): pass
class ALREADY_EXISTS(Exception): pass
class SIZELIMIT_EXCEEDED(Exception): pass
class PARTIAL_RESULTS(Exception): pass
REFERRAL = None
TREE = {}
def initialize(conn_str):
""" Initialize a new connection """
return FakeLDAPConnection()
def explode_dn(dn, *ign, **ignored):
""" Get a DN's elements """
return [x.strip() for x in dn.split(',')]
def clearTree():
TREE.clear()
def addTreeItems(dn):
""" Add structure directly to the tree given a DN """
elems = explode_dn(dn)
elems.reverse()
tree_pos = TREE
for elem in elems:
if not tree_pos.has_key(elem):
tree_pos[elem] = {}
tree_pos = tree_pos[elem]
class FakeLDAPConnection:
def __init__(self):
pass
def set_option(self, option, value):
pass
def simple_bind_s(self, binduid, bindpwd):
if binduid.find('Manager') != -1:
return 1
if bindpwd == '':
# Emulate LDAP mis-behavior
return 1
sha_obj = sha.new(bindpwd)
sha_dig = sha_obj.digest()
enc_bindpwd = '{SHA}%s' % base64.encodestring(sha_dig)
enc_bindpwd = enc_bindpwd.strip()
rec = self.search_s(binduid)
rec_pwd = ''
for key, val_list in rec:
if key == 'userPassword':
rec_pwd = val_list[0]
break
if not rec_pwd:
raise INVALID_CREDENTIALS
if enc_bindpwd == rec_pwd:
return 1
else:
raise INVALID_CREDENTIALS
def search_s(self, base, scope=SCOPE_SUBTREE, query='objectClass=*', attrs=[]):
elems = explode_dn(base)
elems.reverse()
tree_pos = TREE
for elem in elems:
if tree_pos.has_key(elem):
tree_pos = tree_pos[elem]
if query == 'objectClass=*':
if scope == SCOPE_BASE and tree_pos.get('dn', '') == base:
return (([base, tree_pos],))
else:
return tree_pos.items()
if query.find('objectClass=groupOfUniqueNames') != -1:
res = []
if query.find('uniqueMember=') == -1:
for key, vals in tree_pos.items():
res.append(('%s,%s' % (key, base), vals))
else:
q_start = query.find('uniqueMember=') + 13
q_end = query.find(')', q_start)
q_val = query[q_start:q_end]
for key, val in tree_pos.items():
if ( val.has_key('uniqueMember') and
q_val in val['uniqueMember'] ):
res.append(('%s,%s' % (key, base), val))
return res
elif query.find('unique') != -1:
res = []
if query.find('*') != -1:
for key, vals in tree_pos.items():
res.append(('%s,%s' % (key, base), vals))
else:
q_start = query.lower().find('uniquemember=') + 13
q_end = query.find(')', q_start)
q_val = query[q_start:q_end]
for key, val in tree_pos.items():
if ( val.has_key('uniqueMember') and
q_val in val['uniqueMember'] ):
res.append(('%s,%s' % (key, base), val))
return res
else:
res = []
q_key, q_val = query.split('=')
for key, val in tree_pos.items():
if val.has_key(q_key) and q_val in val[q_key]:
res.append(('%s,%s' % (key, base), val))
return res
def add_s(self, dn, attr_list):
elems = explode_dn(dn)
elems.reverse()
rdn = elems[-1]
base = elems[:-1]
tree_pos = TREE
for elem in base:
if tree_pos.has_key(elem):
tree_pos = tree_pos[elem]
if tree_pos.has_key(rdn):
raise ALREADY_EXISTS
else:
tree_pos[rdn] = {}
rec = tree_pos[rdn]
for key, val in attr_list:
rec[key] = val
def delete_s(self, dn):
elems = explode_dn(dn)
elems.reverse()
rdn = elems[-1]
base = elems[:-1]
tree_pos = TREE
for elem in base:
if tree_pos.has_key(elem):
tree_pos = tree_pos[elem]
if tree_pos.has_key(rdn):
del tree_pos[rdn]
def modify_s(self, dn, mod_list):
elems = explode_dn(dn)
elems.reverse()
rdn = elems[-1]
base = elems[:-1]
tree_pos = TREE
for elem in base:
if tree_pos.has_key(elem):
tree_pos = tree_pos[elem]
rec = tree_pos.get(rdn)
for mod in mod_list:
if mod[0] == MOD_REPLACE:
rec[mod[1]] = mod[2]
elif mod[0] == MOD_ADD:
cur_val = rec[mod[1]]
cur_val.extend(mod[2])
rec[mod[1]] = cur_val
else:
if rec.has_key(mod[1]):
cur_vals = rec[mod[1]]
for removed in mod[2]:
if removed in cur_vals:
cur_vals.remove(removed)
rec[mod[1]] = cur_vals
tree_pos[rdn] = rec
def modrdn_s(self, dn, new_rdn, *ign):
elems = explode_dn(dn)
elems.reverse()
rdn = elems[-1]
base = elems[:-1]
tree_pos = TREE
for elem in base:
if tree_pos.has_key(elem):
tree_pos = tree_pos[elem]
rec = tree_pos.get(rdn)
del tree_pos[rdn]
tree_pos[new_rdn] = rec
|
