mirror of
https://github.com/logos-storage/logos-storage-nim.git
synced 2026-01-02 13:33:10 +00:00
1cac3e2a11
* cleanup imports and logs * add BlockHandle type * revert deps * refactor: async error handling and future tracking improvements - Update async procedures to use explicit raises annotation - Modify TrackedFutures to handle futures with no raised exceptions - Replace `asyncSpawn` with explicit future tracking - Update test suites to use `unittest2` - Standardize error handling across network and async components - Remove deprecated error handling patterns This commit introduces a more robust approach to async error handling and future management, improving type safety and reducing potential runtime errors. * bump nim-serde * remove asyncSpawn * rework background downloads and prefetch * imporove logging * refactor: enhance async procedures with error handling and raise annotations * misc cleanup * misc * refactor: implement allFinishedFailed to aggregate future results with success and failure tracking * refactor: update error handling in reader procedures to raise ChunkerError and CancelledError * refactor: improve error handling in wantListHandler and accountHandler procedures * refactor: simplify LPStreamReadError creation by consolidating parameters * refactor: enhance error handling in AsyncStreamWrapper to catch unexpected errors * refactor: enhance error handling in advertiser and discovery loops to improve resilience * misc * refactor: improve code structure and readability * remove cancellation from addSlotToQueue * refactor: add assertion for unexpected errors in local store checks * refactor: prevent tracking of finished futures and improve test assertions * refactor: improve error handling in local store checks * remove usage of msgDetail * feat: add initial implementation of discovery engine and related components * refactor: improve task scheduling logic by removing unnecessary break statement * break after scheduling a task * make taskHandler cancelable * refactor: update async handlers to raise CancelledError * refactor(advertiser): streamline error handling and improve task flow in advertise loops * fix: correct spelling of "divisible" in error messages and comments * refactor(discovery): simplify discovery task loop and improve error handling * refactor(engine): filter peers before processing in cancelBlocks procedure
108 lines
2.5 KiB
Nim
108 lines
2.5 KiB
Nim
import std/sugar
|
|
import std/sequtils
|
|
|
|
import pkg/unittest2
|
|
import pkg/libp2p
|
|
|
|
import pkg/codex/blockexchange/peers
|
|
import pkg/codex/blockexchange/protobuf/blockexc
|
|
import pkg/codex/blockexchange/protobuf/presence
|
|
|
|
import ../helpers
|
|
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]
|
|
addresses: seq[BlockAddress]
|
|
|
|
setup:
|
|
store = PeerCtxStore.new()
|
|
addresses = collect(newSeq):
|
|
for i in 0 ..< 10:
|
|
BlockAddress(leaf: false, cid: Cid.example)
|
|
|
|
peerCtxs = collect(newSeq):
|
|
for i in 0 ..< 10:
|
|
BlockExcPeerCtx.example
|
|
|
|
for p in peerCtxs:
|
|
store.add(p)
|
|
|
|
teardown:
|
|
store = nil
|
|
addresses = @[]
|
|
peerCtxs = @[]
|
|
|
|
test "Should select peers that have Cid":
|
|
peerCtxs[0].blocks = collect(initTable):
|
|
for i, a in addresses:
|
|
{a: Presence(address: a, price: i.u256)}
|
|
|
|
peerCtxs[5].blocks = collect(initTable):
|
|
for i, a in addresses:
|
|
{a: Presence(address: a, price: i.u256)}
|
|
|
|
let peers = store.peersHave(addresses[0])
|
|
|
|
check peers.len == 2
|
|
check peerCtxs[0] in peers
|
|
check peerCtxs[5] in peers
|
|
|
|
test "Should select peers that want Cid":
|
|
let entries = addresses.mapIt(
|
|
WantListEntry(
|
|
address: it,
|
|
priority: 1,
|
|
cancel: false,
|
|
wantType: WantType.WantBlock,
|
|
sendDontHave: false,
|
|
)
|
|
)
|
|
|
|
peerCtxs[0].peerWants = entries
|
|
peerCtxs[5].peerWants = entries
|
|
|
|
let peers = store.peersWant(addresses[4])
|
|
|
|
check peers.len == 2
|
|
check peerCtxs[0] in peers
|
|
check peerCtxs[5] in peers
|
|
|
|
test "Should return peers with and without block":
|
|
let address = addresses[2]
|
|
|
|
peerCtxs[1].blocks[address] = Presence(address: address, price: 0.u256)
|
|
peerCtxs[2].blocks[address] = Presence(address: address, price: 0.u256)
|
|
|
|
let peers = store.getPeersForBlock(address)
|
|
|
|
for i, pc in peerCtxs:
|
|
if i == 1 or i == 2:
|
|
check pc in peers.with
|
|
check pc notin peers.without
|
|
else:
|
|
check pc notin peers.with
|
|
check pc in peers.without
|