mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-17 07:41:46 +00:00
43e5f428af
* Update KVT layers abstraction
details:
modelled after Aristo layers
* Simplified KVT database iterators (removed item counters)
why:
Not needed for production functions
* Simplify KVT merge function `layersCc()`
* Simplified Aristo database iterators (removed item counters)
why:
Not needed for production functions
* 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.
* Update merging layers and label update functions
why:
+ Merging a stack of layers with `layersCc()` could be simplified
+ Merging layers will optimise the reverse `kMap[]` table maps
`pAmk: label->{vid, ..}` by deleting empty mappings `label->{}` where
they are redundant.
+ Updated `layersPutLabel()` for optimising `pAmk[]` tables
87 lines
2.8 KiB
Nim
87 lines
2.8 KiB
Nim
# Nimbus - Types, data structures and shared utilities used in network sync
|
|
#
|
|
# Copyright (c) 2023 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.
|
|
|
|
## Iterators for persistent backend of the Aristo DB
|
|
## =================================================
|
|
##
|
|
## This module automatically pulls in the persistent backend library at the
|
|
## linking stage (e.g. `rocksdb`) which can be avoided for pure memory DB
|
|
## applications by importing `./aristo_walk/memory_only` (rather than
|
|
## `./aristo_walk/persistent`.)
|
|
##
|
|
import
|
|
../aristo_init/[rocks_db, persistent],
|
|
".."/[aristo_desc, aristo_init],
|
|
"."/[walk_private, memory_only]
|
|
|
|
export
|
|
rocks_db,
|
|
memory_only,
|
|
persistent
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public iterators (all in one)
|
|
# ------------------------------------------------------------------------------
|
|
|
|
iterator walkVtxBe*(
|
|
T: type RdbBackendRef;
|
|
db: AristoDbRef;
|
|
): tuple[vid: VertexID, vtx: VertexRef] =
|
|
## Iterate over filtered RocksDB backend vertices. This function depends on
|
|
## the particular backend type name which must match the backend descriptor.
|
|
for (vid,vtx) in walkVtxBeImpl[T](db):
|
|
yield (vid,vtx)
|
|
|
|
iterator walkKeyBe*(
|
|
T: type RdbBackendRef;
|
|
db: AristoDbRef;
|
|
): tuple[vid: VertexID, key: HashKey] =
|
|
## Similar to `walkVtxBe()` but for keys.
|
|
for (vid,key) in walkKeyBeImpl[T](db):
|
|
yield (vid,key)
|
|
|
|
iterator walkFilBe*(
|
|
be: RdbBackendRef;
|
|
): tuple[qid: QueueID, filter: FilterRef] =
|
|
## Iterate over backend filters.
|
|
for (qid,filter) in be.walkFilBeImpl:
|
|
yield (qid,filter)
|
|
|
|
iterator walkFifoBe*(
|
|
be: RdbBackendRef;
|
|
): tuple[qid: QueueID, fid: FilterRef] =
|
|
## Walk filter slots in fifo order.
|
|
for (qid,filter) in be.walkFifoBeImpl:
|
|
yield (qid,filter)
|
|
|
|
# -----------
|
|
|
|
iterator walkPairs*(
|
|
T: type RdbBackendRef;
|
|
db: AristoDbRef;
|
|
): tuple[vid: VertexID, vtx: VertexRef] =
|
|
## Walk over all `(VertexID,VertexRef)` in the database. Note that entries
|
|
## are unsorted.
|
|
for (vid,vtx) in walkPairsImpl[T](db):
|
|
yield (vid,vtx)
|
|
|
|
iterator replicate*(
|
|
T: type RdbBackendRef;
|
|
db: AristoDbRef;
|
|
): tuple[vid: VertexID, key: HashKey, vtx: VertexRef, node: NodeRef] =
|
|
## Variant of `walkPairsImpl()` for legacy applications.
|
|
for (vid,key,vtx,node) in replicateImpl[T](db):
|
|
yield (vid,key,vtx,node)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|