mirror of
https://github.com/status-im/nim-dagger.git
synced 2025-01-27 23:17:33 +00:00
d3dbbc75fa
* don't force logging syncs * Add failing test * wip discovery engine * re-add chronicles sinks * wip * move network related stuff to own folder * move peer related stuff to own folder * extract discovery into it's own engine * update imports * move pending blocks into engine module * add top level exports * update imports * update import paths * update imports * support for inflight request filtering and tests * use `remove` instead of `del` * fix sorting in `selectCheapest` * re-org test file structure * fix to use discovery engine * file re-org * fix compilation * fixup discovery to use async handlers * more re-org * rework with support for discovery engine * add logging * use defaults * wip: reworking with discoveryengine * wip: more test fixes * more logging * use ordered table * use `bt` for blocktype Block * fix tests * make tests work with discovery engine * expose all node components * fix to work with discovery engine * wip * propagate cancellation in listBlocks * start/stop disc engine in blockexc engine * remove disc engine start/stop * wire up discovery engine * misc comments and imports * pass discovery to dagger node * set sleep timers * unused imports * misc * don't spawn a task, await it * don't await handlers * trace logging * reduce default sleep time Co-authored-by: Tanguy <tanguy@status.im>
110 lines
2.3 KiB
Nim
110 lines
2.3 KiB
Nim
import std/sugar
|
|
import std/sequtils
|
|
|
|
import pkg/unittest2
|
|
import pkg/libp2p
|
|
|
|
import pkg/dagger/blockexchange/peers
|
|
import pkg/dagger/blockexchange/protobuf/blockexc
|
|
|
|
import ../examples
|
|
|
|
suite "Peer Context Store":
|
|
var
|
|
store: PeerCtxStore
|
|
peerCtx: BlockExcPeerCtx
|
|
|
|
setup:
|
|
store = PeerCtxStore.new()
|
|
peerCtx = BlockExcPeerCtx.example
|
|
store.add(peerCtx)
|
|
|
|
test "Should add peer":
|
|
check peerCtx.id in store
|
|
|
|
test "Should remove peer":
|
|
store.remove(peerCtx.id)
|
|
check peerCtx.id notin store
|
|
|
|
test "Should get peer":
|
|
check store.get(peerCtx.id) == peerCtx
|
|
|
|
suite "Peer Context Store Peer Selection":
|
|
var
|
|
store: PeerCtxStore
|
|
peerCtxs: seq[BlockExcPeerCtx]
|
|
cids: seq[Cid]
|
|
|
|
setup:
|
|
store = PeerCtxStore.new()
|
|
cids = collect(newSeq):
|
|
for i in 0..<10: Cid.example
|
|
|
|
peerCtxs = collect(newSeq):
|
|
for i in 0..<10: BlockExcPeerCtx.example
|
|
|
|
for p in peerCtxs:
|
|
store.add(p)
|
|
|
|
teardown:
|
|
store = nil
|
|
cids = @[]
|
|
peerCtxs = @[]
|
|
|
|
test "Should select peers that have Cid":
|
|
peerCtxs[0].peerPrices = collect(initTable):
|
|
for i, c in cids:
|
|
{ c: i.u256 }
|
|
|
|
peerCtxs[5].peerPrices = collect(initTable):
|
|
for i, c in cids:
|
|
{ c: i.u256 }
|
|
|
|
let
|
|
peers = store.peersHave(cids[0])
|
|
|
|
check peers.len == 2
|
|
check peerCtxs[0] in peers
|
|
check peerCtxs[5] in peers
|
|
|
|
test "Should select cheapest peers for Cid":
|
|
peerCtxs[0].peerPrices = collect(initTable):
|
|
for i, c in cids:
|
|
{ c: (5 + i).u256 }
|
|
|
|
peerCtxs[5].peerPrices = collect(initTable):
|
|
for i, c in cids:
|
|
{ c: (2 + i).u256 }
|
|
|
|
peerCtxs[9].peerPrices = collect(initTable):
|
|
for i, c in cids:
|
|
{ c: i.u256 }
|
|
|
|
let
|
|
peers = store.selectCheapest(cids[0])
|
|
|
|
check peers.len == 3
|
|
check peers[0] == peerCtxs[9]
|
|
check peers[1] == peerCtxs[5]
|
|
check peers[2] == peerCtxs[0]
|
|
|
|
test "Should select peers that want Cid":
|
|
let
|
|
entries = cids.mapIt(
|
|
Entry(
|
|
`block`: it.data.buffer,
|
|
priority: 1,
|
|
cancel: false,
|
|
wantType: WantType.wantBlock,
|
|
sendDontHave: false))
|
|
|
|
peerCtxs[0].peerWants = entries
|
|
peerCtxs[5].peerWants = entries
|
|
|
|
let
|
|
peers = store.peersWant(cids[4])
|
|
|
|
check peers.len == 2
|
|
check peerCtxs[0] in peers
|
|
check peerCtxs[5] in peers
|