2023-08-07 17:45:23 +00:00
|
|
|
# nimbus-eth1
|
Core db update storage root management for sub tries (#1964)
* Aristo: Re-phrase `LayerDelta` and `LayerFinal` as object references
why:
Avoids copying in some cases
* Fix copyright header
* Aristo: Verify `leafTie.root` function argument for `merge()` proc
why:
Zero root will lead to inconsistent DB entry
* Aristo: Update failure condition for hash labels compiler `hashify()`
why:
Node need not be rejected as long as links are on the schedule. In
that case, `redo[]` is to become `wff.base[]` at a later stage.
This amends an earlier fix, part of #1952 by also testing against
the target nodes of the `wff.base[]` sets.
* Aristo: Add storage root glue record to `hashify()` schedule
why:
An account leaf node might refer to a non-resolvable storage root ID.
Storage root node chains will end up at the storage root. So the link
`storage-root->account-leaf` needs an extra item in the schedule.
* Aristo: fix error code returned by `fetchPayload()`
details:
Final error code is implied by the error code form the `hikeUp()`
function.
* CoreDb: Discard `createOk` argument in API `getRoot()` function
why:
Not needed for the legacy DB. For the `Arsto` DB, a lazy approach is
implemented where a stprage root node is created on-the-fly.
* CoreDb: Prevent `$$` logging in some cases
why:
Logging the function `$$` is not useful when it is used for internal
use, i.e. retrieving an an error text for logging.
* CoreDb: Add `tryHashFn()` to API for pretty printing
why:
Pretty printing must not change the hashification status for the
`Aristo` DB. So there is an independent API wrapper for getting the
node hash which never updated the hashes.
* CoreDb: Discard `update` argument in API `hash()` function
why:
When calling the API function `hash()`, the latest state is always
wanted. For a version that uses the current state as-is without checking,
the function `tryHash()` was added to the backend.
* CoreDb: Update opaque vertex ID objects for the `Aristo` backend
why:
For `Aristo`, vID objects encapsulate a numeric `VertexID`
referencing a vertex (rather than a node hash as used on the
legacy backend.) For storage sub-tries, there might be no initial
vertex known when the descriptor is created. So opaque vertex ID
objects are supported without a valid `VertexID` which will be
initalised on-the-fly when the first item is merged.
* CoreDb: Add pretty printer for opaque vertex ID objects
* Cosmetics, printing profiling data
* CoreDb: Fix segfault in `Aristo` backend when creating MPT descriptor
why:
Missing initialisation error
* CoreDb: Allow MPT to inherit shared context on `Aristo` backend
why:
Creates descriptors with different storage roots for the same
shared `Aristo` DB descriptor.
* Cosmetics, update diagnostic message items for `Aristo` backend
* Fix Copyright year
2024-01-11 19:11:38 +00:00
|
|
|
# Copyright (c) 2023-2024 Status Research & Development GmbH
|
2023-08-07 17:45:23 +00:00
|
|
|
# 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.
|
|
|
|
|
|
|
|
## Aristo DB -- Transaction interface
|
|
|
|
## ==================================
|
|
|
|
##
|
|
|
|
{.push raises: [].}
|
|
|
|
|
|
|
|
import
|
|
|
|
results,
|
2024-05-03 17:38:17 +00:00
|
|
|
./aristo_tx/[tx_fork, tx_frame, tx_stow],
|
|
|
|
"."/[aristo_desc, aristo_get]
|
2024-04-29 20:17:17 +00:00
|
|
|
|
2023-08-07 17:45:23 +00:00
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Public functions, getters
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
2023-08-11 17:23:57 +00:00
|
|
|
func txTop*(db: AristoDbRef): Result[AristoTxRef,AristoError] =
|
2023-08-07 17:45:23 +00:00
|
|
|
## Getter, returns top level transaction if there is any.
|
2024-05-03 17:38:17 +00:00
|
|
|
db.txFrameTop()
|
2023-08-07 17:45:23 +00:00
|
|
|
|
2023-08-11 17:23:57 +00:00
|
|
|
func isTop*(tx: AristoTxRef): bool =
|
2023-08-07 17:45:23 +00:00
|
|
|
## Getter, returns `true` if the argument `tx` referes to the current top
|
|
|
|
## level transaction.
|
2024-05-03 17:38:17 +00:00
|
|
|
tx.txFrameIsTop()
|
2023-08-07 17:45:23 +00:00
|
|
|
|
2024-07-03 15:50:27 +00:00
|
|
|
func txLevel*(tx: AristoTxRef): int =
|
2023-08-11 17:23:57 +00:00
|
|
|
## Getter, positive nesting level of transaction argument `tx`
|
2024-05-03 17:38:17 +00:00
|
|
|
tx.txFrameLevel()
|
2023-08-11 17:23:57 +00:00
|
|
|
|
|
|
|
func level*(db: AristoDbRef): int =
|
|
|
|
## Getter, non-negative nesting level (i.e. number of pending transactions)
|
2024-05-03 17:38:17 +00:00
|
|
|
db.txFrameLevel()
|
2023-08-07 17:45:23 +00:00
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Public functions
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
2023-08-11 17:23:57 +00:00
|
|
|
func to*(tx: AristoTxRef; T: type[AristoDbRef]): T =
|
|
|
|
## Getter, retrieves the parent database descriptor from argument `tx`
|
2023-08-07 17:45:23 +00:00
|
|
|
tx.db
|
|
|
|
|
2024-03-20 15:15:56 +00:00
|
|
|
|
2023-09-18 20:20:28 +00:00
|
|
|
proc forkTx*(
|
2024-05-03 17:38:17 +00:00
|
|
|
db: AristoDbRef;
|
|
|
|
backLevel: int; # Backward location of transaction
|
2023-09-18 20:20:28 +00:00
|
|
|
): Result[AristoDbRef,AristoError] =
|
2024-05-03 17:38:17 +00:00
|
|
|
## Fork a new descriptor obtained from parts of the argument database
|
|
|
|
## as described by arguments `db` and `backLevel`.
|
2023-08-17 13:42:01 +00:00
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
## If the argument `backLevel` is non-negative, the forked descriptor will
|
|
|
|
## provide the database view where the first `backLevel` transaction layers
|
|
|
|
## are stripped and the remaing layers are squashed into a single transaction.
|
Core db and aristo updates for destructor and tx logic (#1894)
* Disable `TransactionID` related functions from `state_db.nim`
why:
Functions `getCommittedStorage()` and `updateOriginalRoot()` from
the `state_db` module are nowhere used. The emulation of a legacy
`TransactionID` type functionality is administratively expensive to
provide by `Aristo` (the legacy DB version is only partially
implemented, anyway).
As there is no other place where `TransactionID`s are used, they will
not be provided by the `Aristo` variant of the `CoreDb`. For the
legacy DB API, nothing will change.
* Fix copyright headers in source code
* Get rid of compiler warning
* Update Aristo code, remove unused `merge()` variant, export `hashify()`
why:
Adapt to upcoming `CoreDb` wrapper
* Remove synced tx feature from `Aristo`
why:
+ This feature allowed to synchronise transaction methods like begin,
commit, and rollback for a group of descriptors.
+ The feature is over engineered and not needed for `CoreDb`, neither
is it complete (some convergence features missing.)
* Add debugging helpers to `Kvt`
also:
Update database iterator, add count variable yield argument similar
to `Aristo`.
* Provide optional destructors for `CoreDb` API
why;
For the upcoming Aristo wrapper, this allows to control when certain
smart destruction and update can take place. The auto destructor works
fine in general when the storage/cache strategy is known and acceptable
when creating descriptors.
* Add update option for `CoreDb` API function `hash()`
why;
The hash function is typically used to get the state root of the MPT.
Due to lazy hashing, this might be not available on the `Aristo` DB.
So the `update` function asks for re-hashing the gurrent state changes
if needed.
* Update API tracking log mode: `info` => `debug
* Use shared `Kvt` descriptor in new Ledger API
why:
No need to create a new descriptor all the time
2023-11-16 19:35:03 +00:00
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
## If `backLevel` is `-1`, a database descriptor with empty transaction
|
2024-06-03 20:10:35 +00:00
|
|
|
## layers will be provided where the `balancer` between database and
|
2024-05-03 17:38:17 +00:00
|
|
|
## transaction layers are kept in place.
|
Core db and aristo updates for destructor and tx logic (#1894)
* Disable `TransactionID` related functions from `state_db.nim`
why:
Functions `getCommittedStorage()` and `updateOriginalRoot()` from
the `state_db` module are nowhere used. The emulation of a legacy
`TransactionID` type functionality is administratively expensive to
provide by `Aristo` (the legacy DB version is only partially
implemented, anyway).
As there is no other place where `TransactionID`s are used, they will
not be provided by the `Aristo` variant of the `CoreDb`. For the
legacy DB API, nothing will change.
* Fix copyright headers in source code
* Get rid of compiler warning
* Update Aristo code, remove unused `merge()` variant, export `hashify()`
why:
Adapt to upcoming `CoreDb` wrapper
* Remove synced tx feature from `Aristo`
why:
+ This feature allowed to synchronise transaction methods like begin,
commit, and rollback for a group of descriptors.
+ The feature is over engineered and not needed for `CoreDb`, neither
is it complete (some convergence features missing.)
* Add debugging helpers to `Kvt`
also:
Update database iterator, add count variable yield argument similar
to `Aristo`.
* Provide optional destructors for `CoreDb` API
why;
For the upcoming Aristo wrapper, this allows to control when certain
smart destruction and update can take place. The auto destructor works
fine in general when the storage/cache strategy is known and acceptable
when creating descriptors.
* Add update option for `CoreDb` API function `hash()`
why;
The hash function is typically used to get the state root of the MPT.
Due to lazy hashing, this might be not available on the `Aristo` DB.
So the `update` function asks for re-hashing the gurrent state changes
if needed.
* Update API tracking log mode: `info` => `debug
* Use shared `Kvt` descriptor in new Ledger API
why:
No need to create a new descriptor all the time
2023-11-16 19:35:03 +00:00
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
## If `backLevel` is `-2`, a database descriptor with empty transaction
|
2024-06-03 20:10:35 +00:00
|
|
|
## layers will be provided without a `balancer`.
|
Core db and aristo updates for destructor and tx logic (#1894)
* Disable `TransactionID` related functions from `state_db.nim`
why:
Functions `getCommittedStorage()` and `updateOriginalRoot()` from
the `state_db` module are nowhere used. The emulation of a legacy
`TransactionID` type functionality is administratively expensive to
provide by `Aristo` (the legacy DB version is only partially
implemented, anyway).
As there is no other place where `TransactionID`s are used, they will
not be provided by the `Aristo` variant of the `CoreDb`. For the
legacy DB API, nothing will change.
* Fix copyright headers in source code
* Get rid of compiler warning
* Update Aristo code, remove unused `merge()` variant, export `hashify()`
why:
Adapt to upcoming `CoreDb` wrapper
* Remove synced tx feature from `Aristo`
why:
+ This feature allowed to synchronise transaction methods like begin,
commit, and rollback for a group of descriptors.
+ The feature is over engineered and not needed for `CoreDb`, neither
is it complete (some convergence features missing.)
* Add debugging helpers to `Kvt`
also:
Update database iterator, add count variable yield argument similar
to `Aristo`.
* Provide optional destructors for `CoreDb` API
why;
For the upcoming Aristo wrapper, this allows to control when certain
smart destruction and update can take place. The auto destructor works
fine in general when the storage/cache strategy is known and acceptable
when creating descriptors.
* Add update option for `CoreDb` API function `hash()`
why;
The hash function is typically used to get the state root of the MPT.
Due to lazy hashing, this might be not available on the `Aristo` DB.
So the `update` function asks for re-hashing the gurrent state changes
if needed.
* Update API tracking log mode: `info` => `debug
* Use shared `Kvt` descriptor in new Ledger API
why:
No need to create a new descriptor all the time
2023-11-16 19:35:03 +00:00
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
## The returned database descriptor will always have transaction level one.
|
|
|
|
## If there were no transactions that could be squashed, an empty
|
|
|
|
## transaction is added.
|
2023-08-17 13:42:01 +00:00
|
|
|
##
|
2023-09-11 20:38:49 +00:00
|
|
|
## Use `aristo_desc.forget()` to clean up this descriptor.
|
2023-08-17 13:42:01 +00:00
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
# Fork top layer (with or without pending transaction)?
|
|
|
|
if backLevel == 0:
|
2024-06-17 12:18:50 +00:00
|
|
|
return db.txForkTop()
|
2024-05-03 17:38:17 +00:00
|
|
|
|
|
|
|
# Fork bottom layer (=> 0 < db.stack.len)
|
|
|
|
if backLevel == db.stack.len:
|
2024-06-17 12:18:50 +00:00
|
|
|
return db.txForkBase()
|
2024-05-03 17:38:17 +00:00
|
|
|
|
|
|
|
# Inspect transaction stack
|
|
|
|
if 0 < backLevel:
|
|
|
|
var tx = db.txRef
|
|
|
|
if tx.isNil or db.stack.len < backLevel:
|
|
|
|
return err(TxLevelTooDeep)
|
|
|
|
|
|
|
|
# Fetch tx of level `backLevel` (seed to skip some items)
|
|
|
|
for _ in 0 ..< backLevel:
|
|
|
|
tx = tx.parent
|
|
|
|
if tx.isNil:
|
|
|
|
return err(TxStackGarbled)
|
2024-06-17 12:18:50 +00:00
|
|
|
return tx.txFork()
|
2024-03-22 17:31:56 +00:00
|
|
|
|
2024-06-03 20:10:35 +00:00
|
|
|
# Plain fork, include `balancer`
|
2024-05-03 17:38:17 +00:00
|
|
|
if backLevel == -1:
|
|
|
|
let xb = ? db.fork(noFilter=false)
|
|
|
|
discard xb.txFrameBegin()
|
|
|
|
return ok(xb)
|
2024-03-22 17:31:56 +00:00
|
|
|
|
2024-05-03 17:38:17 +00:00
|
|
|
# Plain fork, unfiltered backend
|
|
|
|
if backLevel == -2:
|
|
|
|
let xb = ? db.fork(noFilter=true)
|
|
|
|
discard xb.txFrameBegin()
|
|
|
|
return ok(xb)
|
2024-03-22 17:31:56 +00:00
|
|
|
|
2024-05-03 17:38:17 +00:00
|
|
|
err(TxLevelUseless)
|
2024-03-22 17:31:56 +00:00
|
|
|
|
|
|
|
|
2024-05-03 17:38:17 +00:00
|
|
|
proc findTx*(
|
2024-03-21 10:45:57 +00:00
|
|
|
db: AristoDbRef;
|
2024-07-04 13:46:52 +00:00
|
|
|
rvid: RootedVertexID; # Pivot vertex (typically `VertexID(1)`)
|
2024-05-03 17:38:17 +00:00
|
|
|
key: HashKey; # Hash key of pivot vertex
|
|
|
|
): Result[int,AristoError] =
|
2024-03-21 10:45:57 +00:00
|
|
|
## Find the transaction where the vertex with ID `vid` exists and has the
|
|
|
|
## Merkle hash key `key`. If there is no transaction available, search in
|
|
|
|
## the filter and then in the backend.
|
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
## If the above procedure succeeds, an integer indicating the transaction
|
|
|
|
## level integer is returned:
|
|
|
|
##
|
|
|
|
## * `0` -- top level, current layer
|
|
|
|
## * `1`, `2`, ... -- some transaction level further down the stack
|
|
|
|
## * `-1` -- the filter between transaction stack and database backend
|
|
|
|
## * `-2` -- the databse backend
|
|
|
|
##
|
|
|
|
## A successful return code might be used for the `forkTx()` call for
|
|
|
|
## creating a forked descriptor that provides the pair `(vid,key)`.
|
2024-03-21 10:45:57 +00:00
|
|
|
##
|
2024-07-04 13:46:52 +00:00
|
|
|
if not rvid.isValid or
|
2024-03-21 10:45:57 +00:00
|
|
|
not key.isValid:
|
|
|
|
return err(TxArgsUseless)
|
|
|
|
|
2024-03-22 17:31:56 +00:00
|
|
|
if db.txRef.isNil:
|
|
|
|
# Try `(vid,key)` on top layer
|
2024-07-18 21:32:32 +00:00
|
|
|
let topKey = db.top.kMap.getOrVoid rvid
|
2024-03-22 17:31:56 +00:00
|
|
|
if topKey == key:
|
2024-05-03 17:38:17 +00:00
|
|
|
return ok(0)
|
2024-03-21 10:45:57 +00:00
|
|
|
|
2024-03-22 17:31:56 +00:00
|
|
|
else:
|
|
|
|
# Find `(vid,key)` on transaction layers
|
2024-05-03 17:38:17 +00:00
|
|
|
for (n,tx,layer,error) in db.txRef.txFrameWalk:
|
2024-03-22 17:31:56 +00:00
|
|
|
if error != AristoError(0):
|
|
|
|
return err(error)
|
2024-07-18 21:32:32 +00:00
|
|
|
if layer.kMap.getOrVoid(rvid) == key:
|
2024-05-03 17:38:17 +00:00
|
|
|
return ok(n)
|
2024-03-22 17:31:56 +00:00
|
|
|
|
|
|
|
# Try bottom layer
|
2024-07-18 21:32:32 +00:00
|
|
|
let botKey = db.stack[0].kMap.getOrVoid rvid
|
2024-03-22 17:31:56 +00:00
|
|
|
if botKey == key:
|
2024-05-03 17:38:17 +00:00
|
|
|
return ok(db.stack.len)
|
2024-03-22 17:31:56 +00:00
|
|
|
|
2024-06-03 20:10:35 +00:00
|
|
|
# Try `(vid,key)` on balancer
|
|
|
|
if not db.balancer.isNil:
|
2024-07-04 13:46:52 +00:00
|
|
|
let roKey = db.balancer.kMap.getOrVoid rvid
|
2024-03-21 10:45:57 +00:00
|
|
|
if roKey == key:
|
2024-05-03 17:38:17 +00:00
|
|
|
return ok(-1)
|
2024-03-21 10:45:57 +00:00
|
|
|
|
2024-03-22 17:31:56 +00:00
|
|
|
# Try `(vid,key)` on unfiltered backend
|
2024-03-21 10:45:57 +00:00
|
|
|
block:
|
Pre-allocate vids for branches (#2882)
Each branch node may have up to 16 sub-items - currently, these are
given VertexID based when they are first needed leading to a
mostly-random order of vertexid for each subitem.
Here, we pre-allocate all 16 vertex ids such that when a branch subitem
is filled, it already has a vertexid waiting for it. This brings several
important benefits:
* subitems are sorted and "close" in their id sequencing - this means
that when rocksdb stores them, they are likely to end up in the same
data block thus improving read efficiency
* because the ids are consequtive, we can store just the starting id and
a bitmap representing which subitems are in use - this reduces disk
space usage for branches allowing more of them fit into a single disk
read, further improving disk read and caching performance - disk usage
at block 18M is down from 84 to 78gb!
* the in-memory footprint of VertexRef reduced allowing more instances
to fit into caches and less memory to be used overall.
Because of the increased locality of reference, it turns out that we no
longer need to iterate over the entire database to efficiently generate
the hash key database because the normal computation is now faster -
this significantly benefits "live" chain processing as well where each
dirtied key must be accompanied by a read of all branch subitems next to
it - most of the performance benefit in this branch comes from this
locality-of-reference improvement.
On a sample resync, there's already ~20% improvement with later blocks
seeing increasing benefit (because the trie is deeper in later blocks
leading to more benefit from branch read perf improvements)
```
blocks: 18729664, baseline: 190h43m49s, contender: 153h59m0s
Time (total): -36h44m48s, -19.27%
```
Note: clients need to be resynced as the PR changes the on-disk format
R.I.P. little bloom filter - your life in the repo was short but
valuable
2024-12-04 10:42:04 +00:00
|
|
|
let beKey = db.getKeyUbe(rvid, {}).valueOr: (VOID_HASH_KEY, nil)
|
|
|
|
if beKey[0] == key:
|
2024-05-03 17:38:17 +00:00
|
|
|
return ok(-2)
|
2024-03-21 10:45:57 +00:00
|
|
|
|
|
|
|
err(TxNotFound)
|
|
|
|
|
2023-08-07 17:45:23 +00:00
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Public functions: Transaction frame
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
2023-09-15 15:23:53 +00:00
|
|
|
proc txBegin*(db: AristoDbRef): Result[AristoTxRef,AristoError] =
|
2023-08-07 17:45:23 +00:00
|
|
|
## Starts a new transaction.
|
|
|
|
##
|
|
|
|
## Example:
|
|
|
|
## ::
|
|
|
|
## proc doSomething(db: AristoDbRef) =
|
|
|
|
## let tx = db.begin
|
|
|
|
## defer: tx.rollback()
|
|
|
|
## ... continue using db ...
|
|
|
|
## tx.commit()
|
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
db.txFrameBegin()
|
2023-09-15 15:23:53 +00:00
|
|
|
|
2023-08-11 17:23:57 +00:00
|
|
|
proc rollback*(
|
|
|
|
tx: AristoTxRef; # Top transaction on database
|
2023-09-15 15:23:53 +00:00
|
|
|
): Result[void,AristoError] =
|
2023-08-07 17:45:23 +00:00
|
|
|
## Given a *top level* handle, this function discards all database operations
|
|
|
|
## performed for this transactio. The previous transaction is returned if
|
|
|
|
## there was any.
|
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
tx.txFrameRollback()
|
2023-08-11 17:23:57 +00:00
|
|
|
|
|
|
|
proc commit*(
|
|
|
|
tx: AristoTxRef; # Top transaction on database
|
2023-09-15 15:23:53 +00:00
|
|
|
): Result[void,AristoError] =
|
2023-08-07 17:45:23 +00:00
|
|
|
## Given a *top level* handle, this function accepts all database operations
|
|
|
|
## performed through this handle and merges it to the previous layer. The
|
|
|
|
## previous transaction is returned if there was any.
|
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
tx.txFrameCommit()
|
2023-08-07 17:45:23 +00:00
|
|
|
|
|
|
|
proc collapse*(
|
2023-08-11 17:23:57 +00:00
|
|
|
tx: AristoTxRef; # Top transaction on database
|
|
|
|
commit: bool; # Commit if `true`, otherwise roll back
|
2023-09-15 15:23:53 +00:00
|
|
|
): Result[void,AristoError] =
|
2023-08-07 17:45:23 +00:00
|
|
|
## Iterated application of `commit()` or `rollback()` performing the
|
|
|
|
## something similar to
|
|
|
|
## ::
|
2023-08-11 17:23:57 +00:00
|
|
|
## while true:
|
|
|
|
## discard tx.commit() # ditto for rollback()
|
2024-05-03 17:38:17 +00:00
|
|
|
## if db.txTop.isErr: break
|
|
|
|
## tx = db.txTop.value
|
2023-08-07 17:45:23 +00:00
|
|
|
##
|
2024-05-03 17:38:17 +00:00
|
|
|
tx.txFrameCollapse commit
|
2023-08-07 17:45:23 +00:00
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
2024-04-29 20:17:17 +00:00
|
|
|
# Public functions: save to database
|
2023-08-07 17:45:23 +00:00
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
2024-04-29 20:17:17 +00:00
|
|
|
proc persist*(
|
2023-08-11 17:23:57 +00:00
|
|
|
db: AristoDbRef; # Database
|
2024-06-03 20:10:35 +00:00
|
|
|
nxtSid = 0u64; # Next state ID (aka block number)
|
2023-09-15 15:23:53 +00:00
|
|
|
): Result[void,AristoError] =
|
2024-04-29 20:17:17 +00:00
|
|
|
## Persistently store data onto backend database. If the system is running
|
|
|
|
## without a database backend, the function returns immediately with an
|
|
|
|
## error. The same happens if there is a pending transaction.
|
2023-08-11 17:23:57 +00:00
|
|
|
##
|
2024-04-29 20:17:17 +00:00
|
|
|
## The function merges all staged data from the top layer cache onto the
|
2023-08-10 20:01:28 +00:00
|
|
|
## backend stage area. After that, the top layer cache is cleared.
|
|
|
|
##
|
2024-04-29 20:17:17 +00:00
|
|
|
## Finally, the staged data are merged into the physical backend database
|
|
|
|
## and the staged data area is cleared. Wile performing this last step,
|
|
|
|
## the recovery journal is updated (if available.)
|
|
|
|
##
|
2024-07-17 19:27:33 +00:00
|
|
|
## If the argument `nxtSid` is passed non-zero, it will be the ID for the
|
2024-04-29 20:17:17 +00:00
|
|
|
## next recovery journal record. If non-zero, this ID must be greater than
|
|
|
|
## all previous IDs (e.g. block number when stowing after block execution.)
|
|
|
|
##
|
2024-07-17 19:27:33 +00:00
|
|
|
db.txStow(nxtSid, persistent=true)
|
2023-08-10 20:01:28 +00:00
|
|
|
|
2024-04-29 20:17:17 +00:00
|
|
|
proc stow*(
|
|
|
|
db: AristoDbRef; # Database
|
|
|
|
): Result[void,AristoError] =
|
|
|
|
## This function is similar to `persist()` stopping short of performing the
|
2024-05-07 19:59:27 +00:00
|
|
|
## final step storing on the persistent database. It fails if there is a
|
2024-04-29 20:17:17 +00:00
|
|
|
## pending transaction.
|
|
|
|
##
|
|
|
|
## The function merges all staged data from the top layer cache onto the
|
|
|
|
## backend stage area and leaves it there. This function can be seen as
|
|
|
|
## a sort of a bottom level transaction `commit()`.
|
|
|
|
##
|
2024-07-17 19:27:33 +00:00
|
|
|
db.txStow(nxtSid=0u64, persistent=false)
|
2023-08-07 17:45:23 +00:00
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# End
|
|
|
|
# ------------------------------------------------------------------------------
|