2024-05-07 19:59:27 +00:00
|
|
|
# nimbus-eth1
|
|
|
|
# Copyright (c) 2023-2024 Status Research & Development GmbH
|
|
|
|
# Licensed under either of
|
|
|
|
# * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or
|
|
|
|
# http://www.apache.org/licenses/LICENSE-2.0)
|
|
|
|
# * MIT license ([LICENSE-MIT](LICENSE-MIT) or
|
|
|
|
# http://opensource.org/licenses/MIT)
|
|
|
|
# at your option. This file may not be copied, modified, or distributed
|
|
|
|
# except according to those terms.
|
|
|
|
|
|
|
|
## Kvt DB -- Filter management
|
|
|
|
## ===========================
|
|
|
|
##
|
|
|
|
|
|
|
|
import
|
2024-07-26 05:32:01 +00:00
|
|
|
std/tables,
|
2024-05-07 19:59:27 +00:00
|
|
|
results,
|
|
|
|
./kvt_desc,
|
|
|
|
./kvt_desc/desc_backend,
|
2024-06-13 18:15:11 +00:00
|
|
|
./kvt_delta/[delta_merge, delta_reverse]
|
2024-05-07 19:59:27 +00:00
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Public functions
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
2024-07-18 21:32:32 +00:00
|
|
|
proc deltaPersistentOk*(db: KvtDbRef): bool =
|
2024-06-13 18:15:11 +00:00
|
|
|
## Check whether the balancer filter can be merged into the backend
|
2024-05-07 19:59:27 +00:00
|
|
|
not db.backend.isNil and db.isCentre
|
|
|
|
|
|
|
|
|
2024-07-18 21:32:32 +00:00
|
|
|
proc deltaPersistent*(
|
2024-05-07 19:59:27 +00:00
|
|
|
db: KvtDbRef; # Database
|
|
|
|
reCentreOk = false;
|
|
|
|
): Result[void,KvtError] =
|
|
|
|
## Resolve (i.e. move) the backend filter into the physical backend database.
|
|
|
|
##
|
|
|
|
## This needs write permission on the backend DB for the argument `db`
|
|
|
|
## descriptor (see the function `aristo_desc.isCentre()`.) With the argument
|
|
|
|
## flag `reCentreOk` passed `true`, write permission will be temporarily
|
|
|
|
## acquired when needed.
|
|
|
|
##
|
|
|
|
## Other non-centre descriptors are updated so there is no visible database
|
|
|
|
## change for these descriptors.
|
|
|
|
##
|
|
|
|
let be = db.backend
|
|
|
|
if be.isNil:
|
|
|
|
return err(FilBackendMissing)
|
|
|
|
|
|
|
|
# Blind or missing filter
|
2024-06-13 18:15:11 +00:00
|
|
|
if db.balancer.isNil:
|
2024-05-07 19:59:27 +00:00
|
|
|
return ok()
|
|
|
|
|
|
|
|
# Make sure that the argument `db` is at the centre so the backend is in
|
|
|
|
# read-write mode for this peer.
|
|
|
|
let parent = db.getCentre
|
|
|
|
if db != parent:
|
|
|
|
if not reCentreOk:
|
|
|
|
return err(FilBackendRoMode)
|
2024-06-13 18:15:11 +00:00
|
|
|
? db.reCentre()
|
2024-05-07 19:59:27 +00:00
|
|
|
# Always re-centre to `parent` (in case `reCentreOk` was set)
|
2024-06-13 18:15:11 +00:00
|
|
|
defer: discard parent.reCentre()
|
2024-05-07 19:59:27 +00:00
|
|
|
|
2024-07-18 21:32:32 +00:00
|
|
|
# Update forked balancers here do that errors are detected early (if any.)
|
|
|
|
if 0 < db.nForked:
|
|
|
|
let rev = db.revFilter(db.balancer).valueOr:
|
|
|
|
return err(error[1])
|
|
|
|
if 0 < rev.sTab.len: # Can an empty `rev` happen at all?
|
|
|
|
var unsharedRevOk = true
|
|
|
|
for w in db.forked:
|
|
|
|
if not w.db.balancer.isValid:
|
|
|
|
unsharedRevOk = false
|
|
|
|
# The `rev` filter can be modified if one can make sure that it is
|
|
|
|
# not shared (i.e. only previously merged into the w.db.balancer.)
|
|
|
|
# Note that it is trivially true for a single fork.
|
|
|
|
let modLowerOk = w.isLast and unsharedRevOk
|
|
|
|
w.db.balancer = deltaMerge(
|
|
|
|
w.db.balancer, modUpperOk=false, rev, modLowerOk=modLowerOk)
|
|
|
|
|
2024-05-07 19:59:27 +00:00
|
|
|
# Store structural single trie entries
|
2024-06-13 18:15:11 +00:00
|
|
|
let writeBatch = ? be.putBegFn()
|
2024-07-26 05:32:01 +00:00
|
|
|
for k,v in db.balancer.sTab:
|
|
|
|
be.putKvpFn(writeBatch, k, v)
|
2024-05-07 19:59:27 +00:00
|
|
|
? be.putEndFn writeBatch
|
|
|
|
|
2024-07-18 21:32:32 +00:00
|
|
|
# Done with balancer, all saved to backend
|
|
|
|
db.balancer = LayerRef(nil)
|
2024-05-07 19:59:27 +00:00
|
|
|
|
|
|
|
ok()
|
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# End
|
|
|
|
# ------------------------------------------------------------------------------
|