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

revert some func back to proc; unused by nim-eth tests (#629)

This commit is contained in:
tersec 2023-08-02 23:00:49 +00:00 committed by GitHub
parent 01ae82fd70
commit d217d309eb
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -189,11 +189,11 @@ func ipLimitDec(r: var RoutingTable, b: KBucket, n: Node) =
b.ipLimits.dec(ip) b.ipLimits.dec(ip)
r.ipLimits.dec(ip) r.ipLimits.dec(ip)
func add(k: KBucket, n: Node) = proc add(k: KBucket, n: Node) =
k.nodes.add(n) k.nodes.add(n)
routing_table_nodes.inc() routing_table_nodes.inc()
func remove(k: KBucket, n: Node): bool = proc remove(k: KBucket, n: Node): bool =
let i = k.nodes.find(n) let i = k.nodes.find(n)
if i != -1: if i != -1:
routing_table_nodes.dec() routing_table_nodes.dec()
@ -398,13 +398,13 @@ proc addNode*(r: var RoutingTable, n: Node): NodeStatus =
# When bucket doesn't get split the node is added to the replacement cache # When bucket doesn't get split the node is added to the replacement cache
return r.addReplacement(bucket, n) return r.addReplacement(bucket, n)
func removeNode*(r: var RoutingTable, n: Node) = proc removeNode*(r: var RoutingTable, n: Node) =
## Remove the node `n` from the routing table. ## Remove the node `n` from the routing table.
let b = r.bucketForNode(n.id) let b = r.bucketForNode(n.id)
if b.remove(n): if b.remove(n):
ipLimitDec(r, b, n) ipLimitDec(r, b, n)
func replaceNode*(r: var RoutingTable, n: Node) = proc replaceNode*(r: var RoutingTable, n: Node) =
## Replace node `n` with last entry in the replacement cache. If there are ## Replace node `n` with last entry in the replacement cache. If there are
## no entries in the replacement cache, node `n` will simply be removed. ## no entries in the replacement cache, node `n` will simply be removed.
# TODO: Kademlia paper recommends here to not remove nodes if there are no # TODO: Kademlia paper recommends here to not remove nodes if there are no
@ -490,7 +490,7 @@ func moveRight[T](arr: var openArray[T], a, b: int) =
shallowCopy(arr[i + 1], arr[i]) shallowCopy(arr[i + 1], arr[i])
shallowCopy(arr[a], t) shallowCopy(arr[a], t)
func setJustSeen*(r: RoutingTable, n: Node) = proc setJustSeen*(r: RoutingTable, n: Node) =
## Move `n` to the head (most recently seen) of its bucket. ## Move `n` to the head (most recently seen) of its bucket.
## If `n` is not in the routing table, do nothing. ## If `n` is not in the routing table, do nothing.
let b = r.bucketForNode(n.id) let b = r.bucketForNode(n.id)