mirror of
https://github.com/logos-storage/logos-storage-nim.git
synced 2026-01-03 05:53:07 +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
71 lines
2.2 KiB
Nim
71 lines
2.2 KiB
Nim
import std/strutils
|
|
|
|
import pkg/chronos
|
|
import pkg/stew/byteutils
|
|
import pkg/questionable/results
|
|
import pkg/codex/stores/cachestore
|
|
import pkg/codex/chunker
|
|
|
|
import ./commonstoretests
|
|
|
|
import ../../asynctest
|
|
import ../helpers
|
|
|
|
suite "Cache Store":
|
|
var
|
|
newBlock, newBlock1, newBlock2, newBlock3: Block
|
|
store: CacheStore
|
|
|
|
setup:
|
|
newBlock = Block.new("New Kids on the Block".toBytes()).tryGet()
|
|
newBlock1 = Block.new("1".repeat(100).toBytes()).tryGet()
|
|
newBlock2 = Block.new("2".repeat(100).toBytes()).tryGet()
|
|
newBlock3 = Block.new("3".repeat(100).toBytes()).tryGet()
|
|
store = CacheStore.new()
|
|
|
|
test "constructor":
|
|
# cache size cannot be smaller than chunk size
|
|
expect ValueError:
|
|
discard CacheStore.new(cacheSize = 1, chunkSize = 2)
|
|
|
|
store = CacheStore.new(cacheSize = 100, chunkSize = 1)
|
|
check store.currentSize == 0'nb
|
|
|
|
store = CacheStore.new(@[newBlock1, newBlock2, newBlock3])
|
|
check store.currentSize == 300'nb
|
|
|
|
# initial cache blocks total more than cache size, currentSize should
|
|
# never exceed max cache size
|
|
store = CacheStore.new(
|
|
blocks = @[newBlock1, newBlock2, newBlock3], cacheSize = 200, chunkSize = 1
|
|
)
|
|
check store.currentSize == 200'nb
|
|
|
|
# cache size cannot be less than chunks size
|
|
expect ValueError:
|
|
discard CacheStore.new(cacheSize = 99, chunkSize = 100)
|
|
|
|
test "putBlock":
|
|
(await store.putBlock(newBlock1)).tryGet()
|
|
check (await store.hasBlock(newBlock1.cid)).tryGet()
|
|
|
|
# block size bigger than entire cache
|
|
store = CacheStore.new(cacheSize = 99, chunkSize = 98)
|
|
(await store.putBlock(newBlock1)).tryGet()
|
|
check not (await store.hasBlock(newBlock1.cid)).tryGet()
|
|
|
|
# block being added causes removal of LRU block
|
|
store =
|
|
CacheStore.new(@[newBlock1, newBlock2, newBlock3], cacheSize = 200, chunkSize = 1)
|
|
check:
|
|
not (await store.hasBlock(newBlock1.cid)).tryGet()
|
|
(await store.hasBlock(newBlock2.cid)).tryGet()
|
|
(await store.hasBlock(newBlock2.cid)).tryGet()
|
|
store.currentSize.int == newBlock2.data.len + newBlock3.data.len # 200
|
|
|
|
commonBlockStoreTests(
|
|
"Cache",
|
|
proc(): BlockStore =
|
|
BlockStore(CacheStore.new(cacheSize = 1000, chunkSize = 1)),
|
|
)
|