schmittlauch/Hash2Pub
1
0
Fork 1
Code Issues 47 Pull requests Releases Wiki Activity

finish restructuring fediMainThreads

Browse source 
contributes to #34
This commit is contained in:
Trolli Schmittlauch 2020-09-21 02:22:46 +02:00
parent 8e8ea41dc4
commit 1a7afed062
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/Hash2Pub/FediChord.hs
View file

@ -401,7 +401,7 @@ nodeCacheVerifyThread nodeSTM = forever $ do
) )
(\vss -> (\vss ->
if cacheNode `notElem` vss if cacheNode `notElem` vss
then queueDeleteEntry (getNid cacheNode) firstVS then queueDeleteEntry (getNid cacheNode) cacheQ
-- after verifying a node, check whether it can be a closer neighbour -- after verifying a node, check whether it can be a closer neighbour
-- do this for each node -- do this for each node
-- TODO: optimisation: place all LocalNodeStates on the cache ring and check whether any of them is the predecessor/ successor -- TODO: optimisation: place all LocalNodeStates on the cache ring and check whether any of them is the predecessor/ successor
@ -661,7 +661,7 @@ fediMainThreads sock nodeSTM = do
concurrently_ (stabiliseThread nodeSTM) $ concurrently_ (stabiliseThread nodeSTM) $
concurrently_ (nodeCacheVerifyThread nodeSTM) $ concurrently_ (nodeCacheVerifyThread nodeSTM) $
concurrently_ (convergenceSampleThread nodeSTM) $ concurrently_ (convergenceSampleThread nodeSTM) $
concurrently_ (lookupCacheCleanup $ parentRealNode ns) $ concurrently_ (lookupCacheCleanup nodeSTM) $
concurrently_ concurrently_
(sendThread sock sendQ) (sendThread sock sendQ)
(recvThread sock recvQ) (recvThread sock recvQ)