mirror of
https://github.com/logos-messaging/logos-messaging-nim.git
synced 2026-05-18 00:09:52 +00:00
* persistency: per-job SQLite-backed storage layer (singleton, brokered)
Adds a backend-neutral CRUD library at waku/persistency/, plus the
nim-brokers dependency swap that enables it.
Architecture (ports-and-adapters):
* Persistency: process-wide singleton, one root directory.
* Job: one tenant, one DB file, one worker thread, one BrokerContext.
* Backend: SQLite via waku/common/databases/db_sqlite. Uniform schema
kv(category BLOB, key BLOB, payload BLOB) PRIMARY KEY (category, key)
WITHOUT ROWID, WAL mode.
* Writes are fire-and-forget via EventBroker(mt) PersistEvent.
* Reads are async via five RequestBroker(mt) shapes (KvGet, KvExists,
KvScan, KvCount, KvDelete). Reads return Result[T, PersistencyError].
* One storage thread per job; tenants isolated by BrokerContext.
Public surface (waku/persistency/persistency.nim):
Persistency.instance(rootDir) / Persistency.instance() / Persistency.reset()
p.openJob(id) / p.closeJob(id) / p.dropJob(id) / p.close()
p.job(id) / p[id] / p.hasJob(id)
Writes (Job form & string-id form, fire-and-forget):
persist / persistPut / persistDelete / persistEncoded
Reads (Job form & string-id form, async Result):
get / exists / scan / scanPrefix / count / deleteAcked
Key & payload encoding (keys.nim, payload.nim):
* encodePart family + variadic key(...) / payload(...) macros +
single-value toKey / toPayload.
* Primitives: string and openArray[byte] are 2-byte BE length + bytes;
int{8..64} are sign-flipped 8-byte BE; uint{16..64} are 8-byte BE;
bool/byte/char are 1 byte; enums are int64(ord(v)).
* Generic encodePart[T: tuple | object] recurses through fields() so
any composite Nim type is encodable without ceremony.
* Stable across Nim/C compiler upgrades: no sizeof, no memcpy, no
cast on pointers, no host-endianness dependency.
* `rawKey(bytes)` + `persistPut(..., openArray[byte])` let callers
bypass the built-in encoder with their own format (CBOR, protobuf...).
Lifecycle:
* Persistency.new is private; Persistency.instance is the only public
constructor. Same rootDir is idempotent; conflicting rootDir is
peInvalidArgument. Persistency.reset for test/restart paths.
* openJob opens-or-creates the per-job SQLite file; an existing file
is reused with its data preserved.
* Teardown integration: Persistency.instance registers a Teardown
MultiRequestBroker provider that closes all jobs and clears the
singleton slot when Waku.stop() issues Teardown.request.
Internal layering:
types.nim pure value types (Key, KeyRange, KvRow, TxOp,
PersistencyError)
keys.nim encodePart primitives + key(...) macro
payload.nim toPayload + payload(...) macro
schema.nim CREATE TABLE + connection pragmas + user_version
backend_sqlite.nim KvBackend, applyOps (single source of write SQL),
getOne/existsOne/deleteOne, scanRange (asc/desc,
half-open ranges, open-ended stop), countRange
backend_comm.nim EventBroker(mt) PersistEvent + 5 RequestBroker(mt)
declarations; encodeErr/decodeErr boundary helpers
backend_thread.nim startStorageThread / stopStorageThread (shared
allocShared0 arg, cstring dbPath, atomic
ready/shutdown flags); per-thread provider
registration
persistency.nim Persistency + Job types, singleton state, public
facade
../requests/lifecycle_requests.nim
Teardown MultiRequestBroker
Tests (69 cases, all passing):
test_keys.nim sort-order invariants (length-prefix strings,
sign-flipped ints, composite tuples, prefix
range)
test_backend.nim round-trip / replace / delete-return-value /
batched atomicity / asc-desc-half-open-open-
ended scans / category isolation / batch
txDelete
test_lifecycle.nim open-or-create rootDir / non-dir collision /
reopen across sessions / idempotent openJob /
two-tenant parallel isolation / closeJob joins
worker / dropJob removes file / acked delete
test_facade.nim put-then-get / atomic batch / scanPrefix
asc/desc / deleteAcked hit-miss /
fire-and-forget delete / two-tenant facade
isolation
test_encoding.nim tuple/named-tuple/object keys, embedded Key,
enum encoding, field-major composite sort,
payload struct encoding, end-to-end struct
round-trip through SQLite
test_string_lookup.nim peJobNotFound semantics / hasJob / subscript /
persistPut+get via id / reads short-circuit /
writes drop+warn / persistEncoded via id /
scan parity Job-ref vs id
test_singleton.nim idempotent same-rootDir / different-rootDir
rejection / no-arg instance lifecycle / reset
retargets / reset idempotence / Teardown.request
end-to-end
Prerequisite delivered in the same series: replace the in-tree broker
implementation with the external nim-brokers package; update all
broker call-sites (waku_filter_v2, waku_relay, waku_rln_relay,
delivery_service, peer_manager, requests/*, factory/*, api tests, etc.)
to the new package API; chat2 made to compile again.
Note: SDS adapter (Phase 5 of the design) is deferred -- nim-sds is
still developed side-by-side and the persistency layer is intentionally
SDS-agnostic.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
* persistency: pin nim-brokers by URL+commit (workaround for stale registry)
The bare `brokers >= 2.0.1` form cannot resolve on machines where the
local nimble SAT solver enumerates only the registry-recorded 0.1.0 for
brokers. The nim-lang/packages entry for `brokers` carries no per-tag
metadata (only the URL), so until that registry entry is refreshed the
SAT solver clamps the available-versions list to 0.1.0 and rejects the
>= 2.0.1 constraint -- even though pkgs2 and pkgcache both have v2.0.1
cloned locally.
Pinning by URL+commit bypasses the registry path entirely. Inline
comment in waku.nimble documents the situation and the path back to
the bare form once nim-lang/packages is updated.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
* persistency: nph format pass
Run `nph` on all 57 Nim files touched by this PR. Pure formatting:
17 files re-styled, no semantic change. Suite still 69/69.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
* Fix build, add local-storage-path config, lazy init of Persistency from Waku start
* fix: fix nix deps
* fixes for nix build, regenerate deps
* reverting accidental dependency changes
* Fixing deps
* Apply suggestions from code review
Co-authored-by: Ivan FB <128452529+Ivansete-status@users.noreply.github.com>
* persistency tests: migrate to suite / asyncTest / await
Match the in-tree test convention (procSuite -> suite, sync test +
waitFor -> asyncTest + await):
- procSuite "X": -> suite "X":
- For tests doing async work: test -> asyncTest, waitFor -> await.
- Poll helpers (proc waitFor(t: Job, ...) in test_lifecycle.nim,
proc waitUntilExists(...) in test_facade.nim and
test_string_lookup.nim) -> Future[bool] {.async.}, internal
`waitFor X` -> `await X`, internal `sleep(N)` ->
`await sleepAsync(chronos.milliseconds(N))`.
- Renamed test_lifecycle.nim's helper proc from `waitFor(t: Job, ...)`
-> `pollExists(t: Job, ...)`; the previous name shadowed
chronos.waitFor in the chronos macro expansion.
- `chronos.milliseconds(N)` explicitly qualified because `std/times`
also exports `milliseconds` (returning TimeInterval, not Duration).
- `check await x` -> `let okN = await x; check okN` to dodge chronos's
"yield in expr not lowered" with await-as-macro-argument.
- `(await x).foo()` -> `let awN = await x; ... awN.foo() ...` for the
same reason.
waku/persistency/persistency.nim: nph also pulled the proc signatures
across multiple lines; restored explicit `Future[void] {.async.}`
return types after the colon (an intermediate nph pass had elided them).
Suite: 71 / 71 OK against the new async write surface.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
* use idiomatic valueOr instead of ifs
* Reworked persistency shutdown, remove not necessary teardown mechanism
* Use const for DefaultStoragePath
* format to follow coding guidelines - no use of result and explicit returns - no functional change
---------
Co-authored-by: Claude Opus 4.7 <noreply@anthropic.com>
Co-authored-by: Ivan FB <128452529+Ivansete-status@users.noreply.github.com>
155 lines
4.6 KiB
Nim
155 lines
4.6 KiB
Nim
{.used.}
|
|
|
|
import std/[algorithm, options, os, times]
|
|
import chronos, results
|
|
import testutils/unittests
|
|
import waku/persistency/persistency
|
|
|
|
# Reusable byte-wise comparator (Key has its own `<`, but we sometimes
|
|
# want to sort `seq[Key]` here without relying on it for double-checking).
|
|
proc cmpBytes(a, b: Key): int =
|
|
let ab = bytes(a)
|
|
let bb = bytes(b)
|
|
let n = min(ab.len, bb.len)
|
|
for i in 0 ..< n:
|
|
if ab[i] != bb[i]:
|
|
return cmp(ab[i], bb[i])
|
|
cmp(ab.len, bb.len)
|
|
|
|
template str(b: seq[byte]): string =
|
|
var s = newString(b.len)
|
|
for i, x in b:
|
|
s[i] = char(x)
|
|
s
|
|
|
|
# Shared payload types used by multiple tests.
|
|
type
|
|
Mood = enum
|
|
moodCalm
|
|
moodHappy
|
|
moodAngry
|
|
|
|
Header = object
|
|
sender: string
|
|
epoch: int64
|
|
|
|
Msg = object
|
|
header: Header
|
|
mood: Mood
|
|
body: seq[byte]
|
|
|
|
suite "Persistency generic encoding":
|
|
# ── Key macro: composite types ────────────────────────────────────────
|
|
|
|
test "key macro accepts plain tuples":
|
|
let k1 = key(("ch", 1'i64))
|
|
let k2 = key("ch", 1'i64)
|
|
# A plain tuple is encoded field-by-field, so the result is identical
|
|
# to passing the fields directly.
|
|
check k1 == k2
|
|
|
|
test "key macro accepts named tuples":
|
|
type Coord = tuple[lane: string, seqNum: int64]
|
|
let k = key((lane: "a", seqNum: 7'i64))
|
|
let kFlat = key("a", 7'i64)
|
|
check k == kFlat
|
|
|
|
test "key macro accepts a user object":
|
|
let k1 = key(Header(sender: "alice", epoch: 5'i64))
|
|
let k2 = key("alice", 5'i64)
|
|
check k1 == k2
|
|
|
|
test "key macro accepts nested object inside another arg":
|
|
let k1 = key("v1", Header(sender: "alice", epoch: 5'i64))
|
|
let k2 = key("v1", "alice", 5'i64)
|
|
check k1 == k2
|
|
|
|
test "key macro encodes enums":
|
|
let k1 = key(moodAngry)
|
|
let k2 = key(int64(ord(moodAngry)))
|
|
check k1 == k2
|
|
|
|
test "toKey is equivalent to single-arg key()":
|
|
check toKey("x") == key("x")
|
|
check toKey(42'i64) == key(42'i64)
|
|
check toKey(Header(sender: "a", epoch: 1)) == key("a", 1'i64)
|
|
|
|
test "tuple-encoded keys preserve field-major sort order":
|
|
let inputs = @[
|
|
key(("a", 0'i64)),
|
|
key(("a", 1'i64)),
|
|
key(("a", int64.high)),
|
|
key(("b", int64.low)),
|
|
key(("b", 0'i64)),
|
|
]
|
|
var shuffled = @[inputs[3], inputs[0], inputs[4], inputs[2], inputs[1]]
|
|
shuffled.sort(cmpBytes)
|
|
check shuffled == inputs
|
|
|
|
test "embedded Key encodes verbatim":
|
|
let inner = key("a", 7'i64)
|
|
let outer = key("prefix", inner)
|
|
# Expanded: bytes of "prefix" + raw bytes of inner.
|
|
let expanded = key("prefix", "a", 7'i64)
|
|
check outer == expanded
|
|
|
|
# ── Payload macro / toPayload ─────────────────────────────────────────
|
|
|
|
test "toPayload encodes primitives":
|
|
check str(toPayload("hi")).len == 4 # 2-byte len prefix + 2 chars
|
|
check toPayload(42'i64).len == 8
|
|
check toPayload(true) == @[1'u8]
|
|
check toPayload(false) == @[0'u8]
|
|
|
|
test "toPayload encodes objects field-by-field":
|
|
let m = Msg(
|
|
header: Header(sender: "alice", epoch: 9'i64),
|
|
mood: moodHappy,
|
|
body: @[0xAA'u8, 0xBB, 0xCC],
|
|
)
|
|
let p = toPayload(m)
|
|
let pManual = payload("alice", 9'i64, int64(ord(moodHappy)), @[0xAA'u8, 0xBB, 0xCC])
|
|
check p == pManual
|
|
|
|
test "payload macro concatenates parts":
|
|
let p = payload("v1", 1'i64, @[0xDE'u8, 0xAD])
|
|
# Same as building each piece separately.
|
|
var expected: seq[byte] = @[]
|
|
encodePart(expected, "v1")
|
|
encodePart(expected, 1'i64)
|
|
encodePart(expected, @[0xDE'u8, 0xAD])
|
|
check p == expected
|
|
|
|
# ── End-to-end through the facade ─────────────────────────────────────
|
|
|
|
asyncTest "persistEncoded round-trips a struct through SQLite":
|
|
let root = getTempDir() / ("persistency_enc_" & $epochTime().int)
|
|
removeDir(root)
|
|
defer:
|
|
removeDir(root)
|
|
let p = Persistency.instance(root).get()
|
|
defer:
|
|
Persistency.reset()
|
|
let job = p.openJob("t").get()
|
|
|
|
let m = Msg(
|
|
header: Header(sender: "alice", epoch: 1'i64),
|
|
mood: moodHappy,
|
|
body: @[1'u8, 2, 3],
|
|
)
|
|
let k = key("channel-42", m.header.epoch)
|
|
await job.persistEncoded("msg", k, m)
|
|
|
|
# Poll for the row, then read it back as raw bytes.
|
|
let deadline = epochTime() + 1.0
|
|
var got: Option[seq[byte]]
|
|
while epochTime() < deadline:
|
|
let r = await job.get("msg", k)
|
|
check r.isOk
|
|
got = r.get()
|
|
if got.isSome:
|
|
break
|
|
await sleepAsync(chronos.milliseconds(2))
|
|
check got.isSome
|
|
check got.get == toPayload(m)
|