def run(self):
"""
Starts the thread
Needs to be split into more methods
"""
with self.runningLock:
peerCandidateSet = set()
while self.running:
#print("short",self.parent.shortPeers)
##print("myinfo",self.parent.info)
##print("Worker Tick Start")
#"Notify all my short peers"
with self.parent.peersLock:
##print("got peer lock")
peerCandidateSet.update( set(self.parent.shortPeers[:]+self.parent.longPeers[:]))
#print(peerCandidateSet)
peerCandidateSet = set(filter(self.parent.info.__ne__, peerCandidateSet)) #everyone who is not me
assert(self.parent.info not in peerCandidateSet) #everyone who is not me
##print("thinking")
#"Re-evaluate my peerlist"
with self.parent.notifiedLock: #functionize into handleNotifies
peerCandidateSet.update(set(self.parent.notifiedMe))
def pingCheck(p):
if not self.parent.network.ping(p) == True:
peerCandidateSet.remove(p)
#print("Ping Failed",p)
threads = Threadpool(10)
for x in threads.map(pingCheck,set(peerCandidateSet)):
pass
points = []
locDict = {}
##print(peers_2_keep)
for p in set(peerCandidateSet):
l = space.idToPoint(2,p.id)
points.append(l)
locDict[l] = p
locDict[self.parent.loc] = self.parent.info
newShortLocsList = space.getDelaunayPeers(points,self.parent.loc)
newShortPeersList = [locDict[x] for x in newShortLocsList]
leftoversList = list(peerCandidateSet-set(newShortPeersList))
if len(newShortPeersList)<MIN_SHORTPEERS and len(leftoversList)>0:
leftoverLocsList = list(set(points)-set(newShortLocsList))
sortedLeftoverLocsList = sorted(leftoverLocsList)
needed = min((len(leftoversList),MIN_SHORTPEERS-len(newShortPeersList)))
newShortPeerLocsList = sortedLeftoverLocsList[:needed]
newShortPeersList += [locDict[x] for x in newShortPeerLocsList]
if needed < len(leftoversList):
leftoversList = [locDict[x] for x in sortedLeftoverLocsList[needed:]]
if len(leftoversList) > MAX_LONGPEERS:
leftoversList = random.sample(leftoversList,MAX_LONGPEERS)
peerCandidateSet = set()
def notifyAndGet(p):
try:
self.parent.network.notify(p,self.parent.info)
newpeers = self.parent.network.getPeers(p)
peerCandidateSet.update(set(newpeers))
except DialFailed:
#print("DIAL FAILED",p)
with self.parent.peersLock:
if p in self.parent.shortPeers:
self.parent.shortPeers.remove(p)
if p in self.parent.longPeers:
self.parent.longPeers.remove(p)
#with self.parent.notifiedLock:
# self.parent.notifiedMe = []
threads = Threadpool(10)
#print("about to map")
for x in threads.map(notifyAndGet,set(newShortPeersList)):
pass
#print("done mapping")
trigger_change = False
with self.parent.peersLock:
if self.parent.shortPeers != newShortPeersList:
trigger_change = True #consider reducing this to a copy, and compare outside the lock
self.parent.shortPeers = newShortPeersList
self.parent.longPeers = leftoversList
self.parent.seekCandidates = points + [self.parent.loc]
self.parent.locPeerDict = locDict
with self.parent.notifiedLock:
self.parent.notifiedMe = []
if trigger_change or random.random()<0.0:
self.parent.onResponsibilityChange()
time.sleep(MAINTENANCE_SLEEP_PERIOD)
