mirror of
https://github.com/status-im/nim-dagger.git
synced 2025-03-01 06:40:54 +00:00
* 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
184 lines
5.3 KiB
Nim
184 lines
5.3 KiB
Nim
## Nim-Codex
|
|
## Copyright (c) 2021 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.
|
|
|
|
{.push raises: [].}
|
|
|
|
import std/tables
|
|
import std/monotimes
|
|
import std/strutils
|
|
|
|
import pkg/chronos
|
|
import pkg/libp2p
|
|
import pkg/metrics
|
|
|
|
import ../protobuf/blockexc
|
|
import ../../blocktype
|
|
import ../../logutils
|
|
|
|
logScope:
|
|
topics = "codex pendingblocks"
|
|
|
|
declareGauge(
|
|
codex_block_exchange_pending_block_requests,
|
|
"codex blockexchange pending block requests",
|
|
)
|
|
declareGauge(
|
|
codex_block_exchange_retrieval_time_us, "codex blockexchange block retrieval time us"
|
|
)
|
|
|
|
const
|
|
DefaultBlockRetries* = 3000
|
|
DefaultRetryInterval* = 500.millis
|
|
|
|
type
|
|
RetriesExhaustedError* = object of CatchableError
|
|
BlockHandle* = Future[Block].Raising([CancelledError, RetriesExhaustedError])
|
|
|
|
BlockReq* = object
|
|
handle*: BlockHandle
|
|
inFlight*: bool
|
|
blockRetries*: int
|
|
startTime*: int64
|
|
|
|
PendingBlocksManager* = ref object of RootObj
|
|
blockRetries*: int = DefaultBlockRetries
|
|
retryInterval*: Duration = DefaultRetryInterval
|
|
blocks*: Table[BlockAddress, BlockReq] # pending Block requests
|
|
|
|
proc updatePendingBlockGauge(p: PendingBlocksManager) =
|
|
codex_block_exchange_pending_block_requests.set(p.blocks.len.int64)
|
|
|
|
proc getWantHandle*(
|
|
self: PendingBlocksManager, address: BlockAddress, inFlight = false
|
|
): Future[Block] {.async: (raw: true, raises: [CancelledError, RetriesExhaustedError]).} =
|
|
## Add an event for a block
|
|
##
|
|
|
|
self.blocks.withValue(address, blk):
|
|
return blk[].handle
|
|
do:
|
|
let blk = BlockReq(
|
|
handle: newFuture[Block]("pendingBlocks.getWantHandle"),
|
|
inFlight: inFlight,
|
|
blockRetries: self.blockRetries,
|
|
startTime: getMonoTime().ticks,
|
|
)
|
|
self.blocks[address] = blk
|
|
let handle = blk.handle
|
|
|
|
proc cleanUpBlock(data: pointer) {.raises: [].} =
|
|
self.blocks.del(address)
|
|
self.updatePendingBlockGauge()
|
|
|
|
handle.addCallback(cleanUpBlock)
|
|
handle.cancelCallback = proc(data: pointer) {.raises: [].} =
|
|
if not handle.finished:
|
|
handle.removeCallback(cleanUpBlock)
|
|
cleanUpBlock(nil)
|
|
|
|
self.updatePendingBlockGauge()
|
|
return handle
|
|
|
|
proc getWantHandle*(
|
|
self: PendingBlocksManager, cid: Cid, inFlight = false
|
|
): Future[Block] {.async: (raw: true, raises: [CancelledError, RetriesExhaustedError]).} =
|
|
self.getWantHandle(BlockAddress.init(cid), inFlight)
|
|
|
|
proc resolve*(
|
|
self: PendingBlocksManager, blocksDelivery: seq[BlockDelivery]
|
|
) {.gcsafe, raises: [].} =
|
|
## Resolve pending blocks
|
|
##
|
|
|
|
for bd in blocksDelivery:
|
|
self.blocks.withValue(bd.address, blockReq):
|
|
if not blockReq[].handle.finished:
|
|
trace "Resolving pending block", address = bd.address
|
|
let
|
|
startTime = blockReq[].startTime
|
|
stopTime = getMonoTime().ticks
|
|
retrievalDurationUs = (stopTime - startTime) div 1000
|
|
|
|
blockReq.handle.complete(bd.blk)
|
|
|
|
codex_block_exchange_retrieval_time_us.set(retrievalDurationUs)
|
|
|
|
if retrievalDurationUs > 500000:
|
|
warn "High block retrieval time", retrievalDurationUs, address = bd.address
|
|
else:
|
|
trace "Block handle already finished", address = bd.address
|
|
|
|
func retries*(self: PendingBlocksManager, address: BlockAddress): int =
|
|
self.blocks.withValue(address, pending):
|
|
result = pending[].blockRetries
|
|
do:
|
|
result = 0
|
|
|
|
func decRetries*(self: PendingBlocksManager, address: BlockAddress) =
|
|
self.blocks.withValue(address, pending):
|
|
pending[].blockRetries -= 1
|
|
|
|
func retriesExhausted*(self: PendingBlocksManager, address: BlockAddress): bool =
|
|
self.blocks.withValue(address, pending):
|
|
result = pending[].blockRetries <= 0
|
|
|
|
func setInFlight*(self: PendingBlocksManager, address: BlockAddress, inFlight = true) =
|
|
## Set inflight status for a block
|
|
##
|
|
|
|
self.blocks.withValue(address, pending):
|
|
pending[].inFlight = inFlight
|
|
|
|
func isInFlight*(self: PendingBlocksManager, address: BlockAddress): bool =
|
|
## Check if a block is in flight
|
|
##
|
|
|
|
self.blocks.withValue(address, pending):
|
|
result = pending[].inFlight
|
|
|
|
func contains*(self: PendingBlocksManager, cid: Cid): bool =
|
|
BlockAddress.init(cid) in self.blocks
|
|
|
|
func contains*(self: PendingBlocksManager, address: BlockAddress): bool =
|
|
address in self.blocks
|
|
|
|
iterator wantList*(self: PendingBlocksManager): BlockAddress =
|
|
for a in self.blocks.keys:
|
|
yield a
|
|
|
|
iterator wantListBlockCids*(self: PendingBlocksManager): Cid =
|
|
for a in self.blocks.keys:
|
|
if not a.leaf:
|
|
yield a.cid
|
|
|
|
iterator wantListCids*(self: PendingBlocksManager): Cid =
|
|
var yieldedCids = initHashSet[Cid]()
|
|
for a in self.blocks.keys:
|
|
let cid = a.cidOrTreeCid
|
|
if cid notin yieldedCids:
|
|
yieldedCids.incl(cid)
|
|
yield cid
|
|
|
|
iterator wantHandles*(self: PendingBlocksManager): Future[Block] =
|
|
for v in self.blocks.values:
|
|
yield v.handle
|
|
|
|
proc wantListLen*(self: PendingBlocksManager): int =
|
|
self.blocks.len
|
|
|
|
func len*(self: PendingBlocksManager): int =
|
|
self.blocks.len
|
|
|
|
func new*(
|
|
T: type PendingBlocksManager,
|
|
retries = DefaultBlockRetries,
|
|
interval = DefaultRetryInterval,
|
|
): PendingBlocksManager =
|
|
PendingBlocksManager(blockRetries: retries, retryInterval: interval)
|