1 ## Copyright 2002-2003 Andrew Loewenstern, All Rights Reserved
2 # see LICENSE.txt for license information
6 from const import reactor
9 from khash import intify
10 from knode import KNode as Node
11 from ktable import KTable, K
14 """ base class for some long running asynchronous proccesses like finding nodes or values """
15 def __init__(self, table, target, callback):
18 self.num = intify(target)
22 self.callback = callback
26 def sort(a, b, num=self.num):
27 """ this function is for sorting nodes relative to the ID we are looking for """
28 x, y = num ^ a.num, num ^ b.num
36 def goWithNodes(self, t):
41 FIND_NODE_TIMEOUT = 15
43 class FindNode(ActionBase):
44 """ find node action merits it's own class as it is a long running stateful process """
45 def handleGotNodes(self, dict):
46 _krpc_sender = dict['_krpc_sender']
49 sender = dict["sender"]
50 sender['port'] = _krpc_sender[1]
51 sender = Node().initWithDict(sender)
52 sender.conn = self.table.udp.connectionForAddr((sender.host, sender.port))
53 self.table.table.insertNode(sender)
54 if self.finished or self.answered.has_key(sender.id):
55 # a day late and a dollar short
57 self.outstanding = self.outstanding - 1
58 self.answered[sender.id] = 1
60 n = Node().initWithDict(node)
61 n.conn = self.table.udp.connectionForAddr((n.host, n.port))
62 if not self.found.has_key(n.id):
68 send messages to new peers, if necessary
72 l = self.found.values()
75 if node.id == self.target:
77 return self.callback([node])
78 if (not self.queried.has_key(node.id)) and node.id != self.table.node.id:
79 #xxxx t.timeout = time.time() + FIND_NODE_TIMEOUT
80 df = node.findNode(self.target, self.table.node.senderDict())
81 df.addCallbacks(self.handleGotNodes, self.makeMsgFailed(node))
82 self.outstanding = self.outstanding + 1
83 self.queried[node.id] = 1
84 if self.outstanding >= const.CONCURRENT_REQS:
86 assert(self.outstanding) >=0
87 if self.outstanding == 0:
90 reactor.callFromThread(self.callback, l[:K])
92 def makeMsgFailed(self, node):
93 def defaultGotNodes(err, self=self, node=node):
94 print ">>> find failed %s/%s" % (node.host, node.port)
95 self.table.table.nodeFailed(node)
96 self.outstanding = self.outstanding - 1
98 return defaultGotNodes
100 def goWithNodes(self, nodes):
102 this starts the process, our argument is a transaction with t.extras being our list of nodes
103 it's a transaction since we got called from the dispatcher
106 if node.id == self.table.node.id:
109 self.found[node.id] = node
114 GET_VALUE_TIMEOUT = 15
115 class GetValue(FindNode):
116 """ get value task """
117 def handleGotNodes(self, dict):
118 _krpc_sender = dict['_krpc_sender']
120 sender = dict["sender"]
121 sender['port'] = _krpc_sender[1]
122 sender = Node().initWithDict(sender)
123 sender.conn = self.table.udp.connectionForAddr((sender.host, sender.port))
124 self.table.table.insertNode(sender)
125 if self.finished or self.answered.has_key(sender.id):
126 # a day late and a dollar short
128 self.outstanding = self.outstanding - 1
129 self.answered[sender.id] = 1
131 # if we have any closer than what we already got, query them
132 if dict.has_key('nodes'):
133 for node in dict['nodes']:
134 n = Node().initWithDict(node)
135 n.conn = self.table.udp.connectionForAddr((n.host, n.port))
136 if not self.found.has_key(n.id):
138 elif dict.has_key('values'):
139 def x(y, z=self.results):
145 z = len(dict['values'])
146 v = filter(None, map(x, dict['values']))
148 reactor.callFromThread(self.callback, v)
155 l = self.found.values()
159 if (not self.queried.has_key(node.id)) and node.id != self.table.node.id:
160 #xxx t.timeout = time.time() + GET_VALUE_TIMEOUT
161 df = node.findValue(self.target, self.table.node.senderDict())
162 df.addCallback(self.handleGotNodes)
163 df.addErrback(self.makeMsgFailed(node))
164 self.outstanding = self.outstanding + 1
165 self.queried[node.id] = 1
166 if self.outstanding >= const.CONCURRENT_REQS:
168 assert(self.outstanding) >=0
169 if self.outstanding == 0:
170 ## all done, didn't find it!!
172 reactor.callFromThread(self.callback,[])
175 def goWithNodes(self, nodes, found=None):
181 if node.id == self.table.node.id:
184 self.found[node.id] = node
189 class StoreValue(ActionBase):
190 def __init__(self, table, target, value, callback):
191 ActionBase.__init__(self, table, target, callback)
195 def storedValue(self, t, node):
196 self.outstanding -= 1
197 self.table.insertNode(node)
200 self.stored.append(t)
201 if len(self.stored) >= const.STORE_REDUNDANCY:
203 self.callback(self.stored)
205 if not len(self.stored) + self.outstanding >= const.STORE_REDUNDANCY:
208 def storeFailed(self, t, node):
209 print ">>> store failed %s/%s" % (node.host, node.port)
210 self.table.nodeFailed(node)
211 self.outstanding -= 1
219 num = const.CONCURRENT_REQS - self.outstanding
220 if num > const.STORE_REDUNDANCY:
221 num = const.STORE_REDUNDANCY
224 node = self.nodes.pop()
226 if self.outstanding == 0:
228 self.callback(self.stored)
230 if not node.id == self.table.node.id:
231 self.outstanding += 1
232 df = node.storeValue(self.target, self.value, self.table.node.senderDict())
233 df.addCallback(self.storedValue, node=node)
234 df.addErrback(self.storeFailed, node=node)
236 def goWithNodes(self, nodes):
238 self.nodes.sort(self.sort)
243 def __init__(self, store):
245 reactor.callLater(const.KEINITIAL_DELAY, self.doExpire)
248 self.cut = "%0.6f" % (time() - const.KE_AGE)
252 c = self.store.cursor()
253 s = "delete from kv where time < '%s';" % self.cut
255 reactor.callLater(const.KE_DELAY, self.doExpire)