mirror of
https://github.com/status-im/nim-dagger.git
synced 2025-03-01 06:40:54 +00:00
a609baea26
* adding basic retry functionality * avoid duplicate requests and batch them * fix cancelling blocks * properly resolve blocks * minor cleanup - use `self` * avoid useless asyncSpawn * track retries * limit max inflight and set libp2p maxIncomingStreams * cleanup * add basic yield in readLoop * use tuple instead of object * cleanup imports and logs * increase defaults * wip * fix prefetch batching * cleanup * decrease timeouts to speedup tests * remove outdated test * add retry tests * should track retries * remove useless test * use correct block address (index was off by 1) * remove duplicate noop proc * add BlockHandle type * Use BlockHandle type * add fetchLocal to control batching from local store * add format target * revert deps * adjust quotaMaxBytes * cleanup imports and logs * revert deps * cleanup blocks on cancelled * terminate erasure and prefetch jobs on stream end * split storing and retrieving data into separate tests * track `b.discoveryLoop` future * misc * remove useless check
91 lines
2.5 KiB
Nim
91 lines
2.5 KiB
Nim
## Nim-Codex
|
|
## Copyright (c) 2022 Status Research & Development GmbH
|
|
## Licensed under either of
|
|
## * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE))
|
|
## * MIT license ([LICENSE-MIT](LICENSE-MIT))
|
|
## at your option.
|
|
## This file may not be copied, modified, or distributed except according to
|
|
## those terms.
|
|
|
|
import std/sequtils
|
|
import std/tables
|
|
import std/algorithm
|
|
import std/sequtils
|
|
|
|
import pkg/upraises
|
|
|
|
push:
|
|
{.upraises: [].}
|
|
|
|
import pkg/chronos
|
|
import pkg/libp2p
|
|
|
|
import ../protobuf/blockexc
|
|
import ../../blocktype
|
|
import ../../logutils
|
|
|
|
import ./peercontext
|
|
export peercontext
|
|
|
|
logScope:
|
|
topics = "codex peerctxstore"
|
|
|
|
type
|
|
PeerCtxStore* = ref object of RootObj
|
|
peers*: OrderedTable[PeerId, BlockExcPeerCtx]
|
|
|
|
PeersForBlock* = tuple[with: seq[BlockExcPeerCtx], without: seq[BlockExcPeerCtx]]
|
|
|
|
iterator items*(self: PeerCtxStore): BlockExcPeerCtx =
|
|
for p in self.peers.values:
|
|
yield p
|
|
|
|
proc contains*(a: openArray[BlockExcPeerCtx], b: PeerId): bool =
|
|
## Convenience method to check for peer precense
|
|
##
|
|
|
|
a.anyIt(it.id == b)
|
|
|
|
func peerIds*(self: PeerCtxStore): seq[PeerId] =
|
|
toSeq(self.peers.keys)
|
|
|
|
func contains*(self: PeerCtxStore, peerId: PeerId): bool =
|
|
peerId in self.peers
|
|
|
|
func add*(self: PeerCtxStore, peer: BlockExcPeerCtx) =
|
|
self.peers[peer.id] = peer
|
|
|
|
func remove*(self: PeerCtxStore, peerId: PeerId) =
|
|
self.peers.del(peerId)
|
|
|
|
func get*(self: PeerCtxStore, peerId: PeerId): BlockExcPeerCtx =
|
|
self.peers.getOrDefault(peerId, nil)
|
|
|
|
func len*(self: PeerCtxStore): int =
|
|
self.peers.len
|
|
|
|
func peersHave*(self: PeerCtxStore, address: BlockAddress): seq[BlockExcPeerCtx] =
|
|
toSeq(self.peers.values).filterIt(it.peerHave.anyIt(it == address))
|
|
|
|
func peersHave*(self: PeerCtxStore, cid: Cid): seq[BlockExcPeerCtx] =
|
|
toSeq(self.peers.values).filterIt(it.peerHave.anyIt(it.cidOrTreeCid == cid))
|
|
|
|
func peersWant*(self: PeerCtxStore, address: BlockAddress): seq[BlockExcPeerCtx] =
|
|
toSeq(self.peers.values).filterIt(it.peerWants.anyIt(it == address))
|
|
|
|
func peersWant*(self: PeerCtxStore, cid: Cid): seq[BlockExcPeerCtx] =
|
|
toSeq(self.peers.values).filterIt(it.peerWants.anyIt(it.address.cidOrTreeCid == cid))
|
|
|
|
proc getPeersForBlock*(self: PeerCtxStore, address: BlockAddress): PeersForBlock =
|
|
var res: PeersForBlock = (@[], @[])
|
|
for peer in self:
|
|
if peer.peerHave.anyIt(it == address):
|
|
res.with.add(peer)
|
|
else:
|
|
res.without.add(peer)
|
|
res
|
|
|
|
proc new*(T: type PeerCtxStore): PeerCtxStore =
|
|
## create new instance of a peer context store
|
|
PeerCtxStore(peers: initOrderedTable[PeerId, BlockExcPeerCtx]())
|