/
delta.py
278 lines (231 loc) · 7.83 KB
/
delta.py
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
"""
Changes to the content of one single LDAP entry.
(This means these do not belong here: adding or deleting of entries,
changing of location in tree)
"""
from ldaptor import attributeset
from ldaptor.protocols import pureldap, pureber
from ldaptor.protocols.ldap import ldif, distinguishedname
class Modification(attributeset.LDAPAttributeSet):
def patch(self, entry):
raise NotImplementedError(
'%s.patch not implemented' % self.__class__.__name__)
_LDAP_OP = None
def asLDAP(self):
if self._LDAP_OP is None:
raise NotImplementedError("%s.asLDAP not implemented"
% self.__class__.__name__)
tmplist = list(self)
newlist = []
for x in range(len(tmplist)):
if (isinstance(tmplist[x], unicode)):
value = tmplist[x].encode('utf-8')
newlist.append(value)
else:
value = tmplist[x]
newlist.append(value)
return str(pureber.BERSequence([
pureber.BEREnumerated(self._LDAP_OP),
pureber.BERSequence([ pureldap.LDAPAttributeDescription(self.key),
pureber.BERSet(map(pureldap.LDAPString, newlist)),
]),
]))
def __eq__(self, other):
if not isinstance(other, self.__class__):
return False
return super(Modification, self).__eq__(other)
class Add(Modification):
_LDAP_OP = 0
def patch(self, entry):
if self.key in entry:
entry[self.key].update(self)
else:
entry[self.key] = self
def asLDIF(self):
r=[]
values = list(self)
values.sort()
r.append(ldif.attributeAsLDIF('add', self.key))
for v in values:
r.append(ldif.attributeAsLDIF(self.key, v))
r.append('-\n')
return ''.join(r)
class Delete(Modification):
_LDAP_OP = 1
def patch(self, entry):
if not self:
del entry[self.key]
else:
for v in self:
entry[self.key].remove(v)
def asLDIF(self):
r=[]
values = list(self)
values.sort()
r.append(ldif.attributeAsLDIF('delete', self.key))
for v in values:
r.append(ldif.attributeAsLDIF(self.key, v))
r.append('-\n')
return ''.join(r)
class Replace(Modification):
_LDAP_OP = 2
def patch(self, entry):
if self:
entry[self.key] = self
else:
try:
del entry[self.key]
except KeyError:
pass
def asLDIF(self):
r=[]
values = list(self)
values.sort()
r.append(ldif.attributeAsLDIF('replace', self.key))
for v in values:
r.append(ldif.attributeAsLDIF(self.key, v))
r.append('-\n')
return ''.join(r)
class Operation(object):
def patch(self, root):
"""
Find the correct entry in IConnectedLDAPEntry and patch it.
@param root: IConnectedLDAPEntry that is at the root of the
subtree the patch applies to.
@returns: Deferred with None or failure.
"""
raise NotImplementedError(
'%s.patch not implemented' % self.__class__.__name__)
class ModifyOp(Operation):
def __init__(self, dn, modifications=[]):
if not isinstance(dn, distinguishedname.DistinguishedName):
dn=distinguishedname.DistinguishedName(stringValue=dn)
self.dn = dn
self.modifications = modifications[:]
def asLDIF(self):
r = []
r.append(ldif.attributeAsLDIF('dn', str(self.dn)))
r.append(ldif.attributeAsLDIF('changetype', 'modify'))
for m in self.modifications:
r.append(m.asLDIF())
r.append("\n")
return ''.join(r)
def asLDAP(self):
return pureldap.LDAPModifyRequest(
object=str(self.dn),
modification=[x.asLDAP() for x in self.modifications])
@classmethod
def _getClassFromOp(class_, op):
for mod in [Add, Delete, Replace]:
if op == mod._LDAP_OP:
return mod
return None
@classmethod
def fromLDAP(class_, request):
if not isinstance(request, pureldap.LDAPModifyRequest):
raise RuntimeError("%s.fromLDAP needs an LDAPModifyRequest"
% class_.__name__)
dn = request.object
result = []
for op, mods in request.modification:
op = op.value
klass = class_._getClassFromOp(op)
if klass is None:
raise RuntimeError("Unknown LDAP op number %r in %s.fromLDAP"
% (op, class_.__name__))
key, vals = mods
key = key.value
vals = [x.value for x in vals]
m = klass(key, vals)
result.append(m)
return class_(dn, result)
def patch(self, root):
d = root.lookup(self.dn)
def gotEntry(entry, modifications):
for mod in self.modifications:
mod.patch(entry)
return entry
d.addCallback(gotEntry, self.modifications)
return d
def __repr__(self):
return (self.__class__.__name__
+ '('
+ 'dn=%r' % str(self.dn)
+ ', '
+ 'modifications=%r' % self.modifications
+ ')')
def __eq__(self, other):
if not isinstance(other, self.__class__):
return NotImplemented
if self.dn != other.dn:
return 0
if self.modifications != other.modifications:
return 0
return 1
def __hash__(self):
# We use the LDIF representation as similar objects
# should have the same LDIF.
return hash(self.asLDIF())
def __ne__(self, other):
return not self==other
class AddOp(Operation):
def __init__(self, entry):
self.entry = entry
def asLDIF(self):
l = str(self.entry).splitlines()
assert l[0].startswith('dn:')
l[1:1] = [ldif.attributeAsLDIF('changetype', 'add').rstrip('\n')]
return ''.join([x+'\n' for x in l])
def patch(self, root):
d = root.lookup(self.entry.dn.up())
def gotParent(parent, entry):
parent.addChild(entry.dn.split()[0], entry)
d.addCallback(gotParent, self.entry)
return d
def __repr__(self):
return (self.__class__.__name__
+ '('
+ '%r' % self.entry
+ ')')
def __eq__(self, other):
if not isinstance(other, self.__class__):
return NotImplemented
if self.entry != other.entry:
return False
return True
def __ne__(self, other):
return not self == other
def __hash__(self):
# Use the LDIF representions as equal operations should
# have the same LDIF.
return hash(self.asLDIF())
class DeleteOp(Operation):
def __init__(self, dn):
self.dn = dn
def asLDIF(self):
r = []
r.append(ldif.attributeAsLDIF('dn', str(self.dn)))
r.append(ldif.attributeAsLDIF('changetype', 'delete'))
r.append("\n")
return ''.join(r)
def patch(self, root):
d = root.lookup(self.dn)
def gotEntry(entry):
return entry.delete()
d.addCallback(gotEntry)
return d
def __repr__(self):
return (self.__class__.__name__
+ '('
+ '%r' % self.dn
+ ')')
def __eq__(self, other):
if not isinstance(other, self.__class__):
return NotImplemented
if self.dn != other.dn:
return False
return True
def __ne__(self, other):
return not self==other
def __hash__(self):
return hash(self.dn)