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
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
|
# The contents of this file are subject to the BitTorrent Open Source License
# Version 1.1 (the License). You may not copy or use this file, in either
# source code or executable form, except in compliance with the License. You
# may obtain a copy of the License at http://www.bittorrent.com/license/.
#
# Software distributed under the License is distributed on an AS IS basis,
# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
# for the specific language governing rights and limitations under the
# License.
from BitTorrent.platform import bttime as time
import const
from khash import intify
from ktable import KTable, K
from util import unpackNodes
from krpc import KRPCProtocolError, KRPCSelfNodeError
from bisect import insort
class NodeWrap(object):
def __init__(self, node, target):
self.num = target
self.node = node
def __cmp__(self, o):
""" this function is for sorting nodes relative to the ID we are looking for """
x, y = self.num ^ o.num, self.num ^ self.node.num
if x > y:
return 1
elif x < y:
return -1
return 0
class ActionBase(object):
""" base class for some long running asynchronous proccesses like finding nodes or values """
def __init__(self, table, target, callback, callLater):
self.table = table
self.target = target
self.callLater = callLater
self.num = intify(target)
self.found = {}
self.foundq = []
self.queried = {}
self.queriedip = {}
self.answered = {}
self.callback = callback
self.outstanding = 0
self.finished = 0
def sort(self, a, b):
""" this function is for sorting nodes relative to the ID we are looking for """
x, y = self.num ^ a.num, self.num ^ b.num
if x > y:
return 1
elif x < y:
return -1
return 0
def shouldQuery(self, node):
if node.id == self.table.node.id:
return False
elif (node.host, node.port) not in self.queriedip and node.id not in self.queried:
self.queriedip[(node.host, node.port)] = 1
self.queried[node.id] = 1
return True
return False
def _cleanup(self):
self.foundq = None
self.found = None
self.queried = None
self.queriedip = None
def goWithNodes(self, t):
pass
FIND_NODE_TIMEOUT = 15
class FindNode(ActionBase):
""" find node action merits it's own class as it is a long running stateful process """
def handleGotNodes(self, dict):
_krpc_sender = dict['_krpc_sender']
dict = dict['rsp']
sender = {'id' : dict["id"]}
sender['port'] = _krpc_sender[1]
sender['host'] = _krpc_sender[0]
sender = self.table.Node().initWithDict(sender)
try:
l = unpackNodes(dict.get("nodes", []))
if not self.answered.has_key(sender.id):
self.answered[sender.id] = sender
except:
l = []
self.table.invalidateNode(sender)
if self.finished:
# a day late and a dollar short
return
self.outstanding = self.outstanding - 1
for node in l:
n = self.table.Node().initWithDict(node)
if not self.found.has_key(n.id):
self.found[n.id] = n
insort(self.foundq, NodeWrap(n, self.num))
self.table.insertNode(n, contacted=0)
self.schedule()
def schedule(self):
"""
send messages to new peers, if necessary
"""
if self.finished:
return
l = [wrapper.node for wrapper in self.foundq[:K]]
for node in l:
if node.id == self.target:
self.finished=1
return self.callback([node])
if self.shouldQuery(node):
#xxxx t.timeout = time.time() + FIND_NODE_TIMEOUT
try:
df = node.findNode(self.target, self.table.node.id)
except KRPCSelfNodeError:
pass
else:
df.addCallbacks(self.handleGotNodes, self.makeMsgFailed(node))
self.outstanding = self.outstanding + 1
if self.outstanding >= const.CONCURRENT_REQS:
break
assert(self.outstanding) >=0
if self.outstanding == 0:
## all done!!
self.finished=1
self._cleanup()
self.callLater(self.callback, 0, (l[:K],))
def makeMsgFailed(self, node):
return self._defaultGotNodes
def _defaultGotNodes(self, err):
self.outstanding = self.outstanding - 1
self.schedule()
def goWithNodes(self, nodes):
"""
this starts the process, our argument is a transaction with t.extras being our list of nodes
it's a transaction since we got called from the dispatcher
"""
for node in nodes:
if node.id == self.table.node.id:
continue
else:
self.found[node.id] = node
insort(self.foundq, NodeWrap(node, self.num))
self.schedule()
get_value_timeout = 15
class GetValue(FindNode):
def __init__(self, table, target, callback, callLater, find="findValue"):
FindNode.__init__(self, table, target, callback, callLater)
self.findValue = find
""" get value task """
def handleGotNodes(self, dict):
_krpc_sender = dict['_krpc_sender']
dict = dict['rsp']
sender = {'id' : dict["id"]}
sender['port'] = _krpc_sender[1]
sender['host'] = _krpc_sender[0]
sender = self.table.Node().initWithDict(sender)
if self.finished or self.answered.has_key(sender.id):
# a day late and a dollar short
return
self.outstanding = self.outstanding - 1
self.answered[sender.id] = sender
# go through nodes
# if we have any closer than what we already got, query them
if dict.has_key('nodes'):
try:
l = unpackNodes(dict.get('nodes',[]))
except:
l = []
del(self.answered[sender.id])
for node in l:
n = self.table.Node().initWithDict(node)
if not self.found.has_key(n.id):
self.table.insertNode(n)
self.found[n.id] = n
insort(self.foundq, NodeWrap(n, self.num))
elif dict.has_key('values'):
def x(y, z=self.results):
if not z.has_key(y):
z[y] = 1
return y
else:
return None
z = len(dict.get('values', []))
v = filter(None, map(x, dict.get('values',[])))
if(len(v)):
self.callLater(self.callback, 0, (v,))
self.schedule()
## get value
def schedule(self):
if self.finished:
return
for node in [wrapper.node for wrapper in self.foundq[:K]]:
if self.shouldQuery(node):
#xxx t.timeout = time.time() + GET_VALUE_TIMEOUT
try:
f = getattr(node, self.findValue)
except AttributeError:
print ">>> findValue %s doesn't have a %s method!" % (node, self.findValue)
else:
try:
df = f(self.target, self.table.node.id)
df.addCallback(self.handleGotNodes)
df.addErrback(self.makeMsgFailed(node))
self.outstanding = self.outstanding + 1
self.queried[node.id] = 1
except KRPCSelfNodeError:
pass
if self.outstanding >= const.CONCURRENT_REQS:
break
assert(self.outstanding) >=0
if self.outstanding == 0:
## all done, didn't find it!!
self.finished=1
self._cleanup()
self.callLater(self.callback,0, ([],))
## get value
def goWithNodes(self, nodes, found=None):
self.results = {}
if found:
for n in found:
self.results[n] = 1
for node in nodes:
if node.id == self.table.node.id:
continue
else:
self.found[node.id] = node
insort(self.foundq, NodeWrap(node, self.num))
self.schedule()
class StoreValue(ActionBase):
def __init__(self, table, target, value, callback, callLater, store="storeValue"):
ActionBase.__init__(self, table, target, callback, callLater)
self.value = value
self.stored = []
self.store = store
def storedValue(self, t, node):
self.outstanding -= 1
if self.finished:
return
self.stored.append(t)
if len(self.stored) >= const.STORE_REDUNDANCY:
self.finished=1
self.callback(self.stored)
else:
if not len(self.stored) + self.outstanding >= const.STORE_REDUNDANCY:
self.schedule()
return t
def storeFailed(self, t, node):
self.outstanding -= 1
if self.finished:
return t
self.schedule()
return t
def schedule(self):
if self.finished:
return
num = const.CONCURRENT_REQS - self.outstanding
if num > const.STORE_REDUNDANCY - len(self.stored):
num = const.STORE_REDUNDANCY - len(self.stored)
if num == 0 and not self.finished:
self.finished=1
self.callback(self.stored)
while num > 0:
try:
node = self.nodes.pop()
except IndexError:
if self.outstanding == 0:
self.finished = 1
self._cleanup()
self.callback(self.stored)
return
else:
if not node.id == self.table.node.id:
try:
f = getattr(node, self.store)
except AttributeError:
print ">>> %s doesn't have a %s method!" % (node, self.store)
else:
try:
df = f(self.target, self.value, self.table.node.id)
except KRPCProtocolError:
self.table.table.invalidateNode(node)
except KRPCSelfNodeError:
pass
else:
df.addCallback(self.storedValue,(),{'node':node})
df.addErrback(self.storeFailed, (), {'node':node})
self.outstanding += 1
num -= 1
def goWithNodes(self, nodes):
self.nodes = nodes
self.nodes.sort(self.sort)
self.schedule()
class GetAndStore(GetValue):
def __init__(self, table, target, value, callback, storecallback, callLater, find="findValue", store="storeValue"):
self.store = store
self.value = value
self.cb2 = callback
self.storecallback = storecallback
def cb(res):
self.cb2(res)
if not(res):
n = StoreValue(self.table, self.target, self.value, self.doneStored, self.callLater, self.store)
n.goWithNodes(self.answered.values())
GetValue.__init__(self, table, target, cb, callLater, find)
def doneStored(self, dict):
self.storecallback(dict)
class KeyExpirer:
def __init__(self, store, callLater):
self.store = store
self.callLater = callLater
self.callLater(self.doExpire, const.KEINITIAL_DELAY)
def doExpire(self):
self.cut = time() - const.KE_AGE
self.store.expire(self.cut)
self.callLater(self.doExpire, const.KE_DELAY)
|