status-im
/
nim-eth
mirror of https://github.com/status-im/nim-eth.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity

Add limit to the replacement cache

This commit is contained in:
kdeme 2020-06-05 16:43:18 +02:00
parent 61feae0f21
commit 7e35b329b4
1 changed files with 14 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
eth/p2p/discoveryv5/routing_table.nim
View File

@ -18,6 +18,7 @@ type
const const
BUCKET_SIZE* = 16 BUCKET_SIZE* = 16
REPLACEMENT_CACHE_SIZE* = 8
BITS_PER_HOP = 8 BITS_PER_HOP = 8
ID_SIZE = 256 ID_SIZE = 256
@ -64,14 +65,18 @@ proc head(k: KBucket): Node {.inline.} = k.nodes[0]
proc add(k: KBucket, n: Node): Node = proc add(k: KBucket, n: Node): Node =
## Try to add the given node to this bucket. ## Try to add the given node to this bucket.
## If the node is already present, it is moved to the tail of the list, and we return nil. ## If the node is already present, it is moved to the tail of the list, and
## nil is returned.
## If the node is not already present and the bucket has fewer than k entries, it is inserted ## If the node is not already present and the bucket has fewer than k entries,
## at the tail of the list, and we return nil. ## it is inserted at the tail of the list, and nil is returned.
## If the bucket is full, we add the node to the bucket's replacement cache and return the ## If the bucket is full, the node is added to the bucket's replacement cache
## node at the head of the list (i.e. the least recently seen), which should be evicted if it ## and the node at the head of the list (i.e. the least recently seen), which
## fails to respond to a ping. ## should be evicted if it fails to respond to a ping, is returned.
## If the replacement cache is also full, the node at the head of the
## list is returned. The new node is nowhere stored and thus lost.
k.lastUpdated = epochTime() k.lastUpdated = epochTime()
let nodeIdx = k.nodes.find(n) let nodeIdx = k.nodes.find(n)
if nodeIdx != -1: if nodeIdx != -1:
@ -79,9 +84,11 @@ proc add(k: KBucket, n: Node): Node =
k.nodes.add(n) k.nodes.add(n)
elif k.len < BUCKET_SIZE: elif k.len < BUCKET_SIZE:
k.nodes.add(n) k.nodes.add(n)
else: elif k.replacementCache.len < REPLACEMENT_CACHE_SIZE:
k.replacementCache.add(n) k.replacementCache.add(n)
return k.head return k.head
else:
return k.head
return nil return nil
proc removeNode(k: KBucket, n: Node) = proc removeNode(k: KBucket, n: Node) =