mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-03-01 12:20:49 +00:00
411a3cadfa
* renamed nimbus folder to execution_chain * Renamed "nimbus" references to "execution_chain" * fixed wrongly changed http reference * delete snap types file given that it was deleted before this PR merge * missing 'execution_chain' replacement --------- Co-authored-by: pmmiranda <pedro.miranda@nimbus.team>
120 lines
4.1 KiB
Nim
120 lines
4.1 KiB
Nim
# nimbus-eth1
|
|
# Copyright (c) 2023-2025 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.
|
|
|
|
{.push raises: [].}
|
|
|
|
import
|
|
std/[sets, tables],
|
|
results,
|
|
./kvt_desc,
|
|
../../utils/mergeutils
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions: get function
|
|
# ------------------------------------------------------------------------------
|
|
|
|
func layersLen*(db: KvtTxRef; key: openArray[byte]|seq[byte]): Opt[int] =
|
|
## Returns the size of the value associated with `key`.
|
|
##
|
|
when key isnot seq[byte]:
|
|
let key = @key
|
|
|
|
for w in db.rstack:
|
|
w.sTab.withValue(key, item):
|
|
return Opt.some(item[].len())
|
|
|
|
Opt.none(int)
|
|
|
|
func layersHasKey*(db: KvtTxRef; key: openArray[byte]|seq[byte]): bool =
|
|
## Return `true` if the argument key is cached.
|
|
##
|
|
db.layersLen(key).isSome()
|
|
|
|
func layersGet*(db: KvtTxRef; key: openArray[byte]|seq[byte]): Opt[seq[byte]] =
|
|
## Find an item on the cache layers. An `ok()` result might contain an
|
|
## empty value if it is stored on the cache that way.
|
|
##
|
|
when key isnot seq[byte]:
|
|
let key = @key
|
|
|
|
for w in db.rstack:
|
|
w.sTab.withValue(key, item):
|
|
return Opt.some(item[])
|
|
|
|
Opt.none(seq[byte])
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions: put function
|
|
# ------------------------------------------------------------------------------
|
|
|
|
func layersPut*(db: KvtTxRef; key: openArray[byte]; data: openArray[byte]) =
|
|
## Store a (potentally empty) value on the top layer
|
|
db.layer.sTab[@key] = @data
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc mergeAndReset*(trg, src: var Layer) =
|
|
mergeAndReset(trg.sTab, src.sTab)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
func layersCc*(db: KvtDbRef; level = high(int)): LayerRef =
|
|
## Provide a collapsed copy of layers up to a particular transaction level.
|
|
## If the `level` argument is too large, the maximum transaction level is
|
|
## returned. For the result layer, the `txUid` value set to `0`.
|
|
# let layers = if db.stack.len <= level: db.stack & @[db.top]
|
|
# else: db.stack[0 .. level]
|
|
|
|
# # Set up initial layer (bottom layer)
|
|
# result = LayerRef(sTab: layers[0].sTab)
|
|
|
|
# # Consecutively merge other layers on top
|
|
# for n in 1 ..< layers.len:
|
|
# for (key,val) in layers[n].sTab.pairs:
|
|
# result.sTab[key] = val
|
|
discard # TODO
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public iterators
|
|
# ------------------------------------------------------------------------------
|
|
|
|
iterator layersWalk*(
|
|
db: KvtTxRef;
|
|
seen: var HashSet[seq[byte]];
|
|
): tuple[key: seq[byte], data: seq[byte]] =
|
|
## Walk over all key-value pairs on the cache layers. Note that
|
|
## entries are unsorted.
|
|
##
|
|
## The argument `seen` collects a set of all visited vertex IDs including
|
|
## the one with a zero vertex which are othewise skipped by the iterator.
|
|
## The `seen` argument must not be modified while the iterator is active.
|
|
##
|
|
for w in db.rstack:
|
|
for (key,val) in w.sTab.pairs:
|
|
if key notin seen:
|
|
yield (key,val)
|
|
seen.incl key
|
|
|
|
iterator layersWalk*(
|
|
db: KvtTxRef;
|
|
): tuple[key: seq[byte], data: seq[byte]] =
|
|
## Variant of `layersWalk()`.
|
|
var seen: HashSet[seq[byte]]
|
|
for (key,val) in db.layersWalk seen:
|
|
yield (key,val)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|