mirror of https://github.com/status-im/nim-eth.git
81 lines
2.8 KiB
Nim
81 lines
2.8 KiB
Nim
import
|
|
random, unittest, chronos, sequtils, chronicles,
|
|
eth/keys, eth/p2p/enode, eth/trie/db,
|
|
eth/p2p/discoveryv5/[discovery_db, enr, node, types, routing_table],
|
|
eth/p2p/discoveryv5/protocol as discv5_protocol,
|
|
./p2p_test_helper
|
|
|
|
proc initDiscoveryNode*(privKey: PrivateKey, address: Address,
|
|
bootnodes: seq[Record]): discv5_protocol.Protocol =
|
|
var db = DiscoveryDB.init(newMemoryDB())
|
|
result = newProtocol(privKey, db,
|
|
parseIpAddress("127.0.0.1"),
|
|
address.tcpPort, address.udpPort)
|
|
|
|
for node in bootnodes:
|
|
result.addNode(node)
|
|
|
|
result.open()
|
|
|
|
proc nodeIdInNodes(id: NodeId, nodes: openarray[Node]): bool =
|
|
for n in nodes:
|
|
if id == n.id: return true
|
|
|
|
suite "Discovery v5 Tests":
|
|
asyncTest "Random nodes":
|
|
let
|
|
bootNodeKey = initPrivateKey("a2b50376a79b1a8c8a3296485572bdfbf54708bb46d3c25d73d2723aaaf6a617")
|
|
bootNodeAddr = localAddress(20301)
|
|
bootNode = initDiscoveryNode(bootNodeKey, bootNodeAddr, @[])
|
|
|
|
let nodeKeys = [
|
|
initPrivateKey("a2b50376a79b1a8c8a3296485572bdfbf54708bb46d3c25d73d2723aaaf6a618"),
|
|
initPrivateKey("a2b50376a79b1a8c8a3296485572bdfbf54708bb46d3c25d73d2723aaaf6a619"),
|
|
initPrivateKey("a2b50376a79b1a8c8a3296485572bdfbf54708bb46d3c25d73d2723aaaf6a620")
|
|
]
|
|
var nodeAddrs = newSeqOfCap[Address](nodeKeys.len)
|
|
for i in 0 ..< nodeKeys.len: nodeAddrs.add(localAddress(20302 + i))
|
|
|
|
var nodes = zip(nodeKeys, nodeAddrs).mapIt(
|
|
initDiscoveryNode(it.a, it.b, @[bootNode.localNode.record]))
|
|
nodes.add(bootNode)
|
|
|
|
for node in nodes:
|
|
let discovered = await node.lookupRandom()
|
|
check discovered.len < nodes.len
|
|
debug "Lookup from random id", node = node.localNode, discovered
|
|
|
|
# Check for each node if the other nodes shows up in the routing table
|
|
for i in nodes:
|
|
for j in nodes:
|
|
if j != i:
|
|
check(nodeIdInNodes(i.localNode.id, j.randomNodes(nodes.len - 1)))
|
|
|
|
for node in nodes:
|
|
await node.closeWait()
|
|
|
|
asyncTest "Lookup targets":
|
|
const
|
|
nodeCount = 17
|
|
|
|
let
|
|
bootNodeKey = newPrivateKey()
|
|
bootNodeAddr = localAddress(20301)
|
|
bootNode = initDiscoveryNode(bootNodeKey, bootNodeAddr, @[])
|
|
|
|
var nodes = newSeqOfCap[discv5_protocol.Protocol](nodeCount)
|
|
nodes.add(bootNode)
|
|
for i in 1 ..< nodeCount:
|
|
nodes.add(initDiscoveryNode(newPrivateKey(), localAddress(20301 + i),
|
|
@[bootNode.localNode.record]))
|
|
|
|
for i in 0..<nodeCount-1:
|
|
let target = nodes[i]
|
|
let discovered = await nodes[nodeCount-1].lookup(target.localNode.id)
|
|
debug "Lookup result", target = target.localNode, discovered
|
|
# if lookUp would return ordered on distance we could check discovered[0]
|
|
check discovered.contains(target.localNode)
|
|
|
|
for node in nodes:
|
|
await node.closeWait()
|