parent
8e8ea41dc4
commit
1a7afed062
|
@ -401,7 +401,7 @@ nodeCacheVerifyThread nodeSTM = forever $ do
|
|||
)
|
||||
(\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
|
||||
-- do this for each node
|
||||
-- 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_ (nodeCacheVerifyThread nodeSTM) $
|
||||
concurrently_ (convergenceSampleThread nodeSTM) $
|
||||
concurrently_ (lookupCacheCleanup $ parentRealNode ns) $
|
||||
concurrently_ (lookupCacheCleanup nodeSTM) $
|
||||
concurrently_
|
||||
(sendThread sock sendQ)
|
||||
(recvThread sock recvQ)
|
||||
|
|
Loading…
Reference in a new issue