mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-16 07:14:15 +00:00
5a5cc6295e
* bump rockdb * Rename `KVT` objects related to filters according to `Aristo` naming details: filter* => delta* roFilter => balancer * Compulsory error handling if `persistent()` fails * Add return code to `reCentre()` why: Might eventually fail if re-centring is blocked. Some logic will be added in subsequent patch sets. * Add column families from earlier session to rocksdb in opening procedure why: All previously used CFs must be declared when re-opening an existing database. * Update `init()` and add rocksdb `reinit()` methods for changing parameters why: Opening a set column families (with different open options) must span at least the ones that are already on disk. * Provide write-trigger-event interface into `Aristo` backend why: This allows to save data from a guest application (think `KVT`) to get synced with the write cycle so the guest and `Aristo` save all atomically. * Use `KVT` with new column family interface from `Aristo` * Remove obsolete guest interface * Implement `KVT` piggyback on `Aristo` backend * CoreDb: Add separate `KVT`/`Aristo` backend mode for debugging * Remove `rocks_db` import from `persist()` function why: Some systems (i.p `fluffy` and friends) use the `Aristo` memory backend emulation and do not link against rocksdb when building the application. So this should fix that problem.
54 lines
1.7 KiB
Nim
54 lines
1.7 KiB
Nim
# Nimbus
|
|
# Copyright (c) 2021-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.
|
|
|
|
import results, eth/common, ../../nimbus/db/era1_db
|
|
|
|
var noisy* = false
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public undump
|
|
# ------------------------------------------------------------------------------
|
|
|
|
iterator undumpBlocksEra1*(
|
|
dir: string,
|
|
least = low(uint64), # First block to extract
|
|
stopAfter = high(uint64), # Last block to extract
|
|
doAssertOk = false;
|
|
): seq[EthBlock] =
|
|
let db = Era1DbRef.init(dir, "mainnet").expect("Era files present")
|
|
defer:
|
|
db.dispose()
|
|
|
|
# TODO it would be a lot more natural for this iterator to return 1 block at
|
|
# a time and let the consumer do the chunking
|
|
const blocksPerYield = 192
|
|
var tmp = newSeqOfCap[EthBlock](blocksPerYield)
|
|
|
|
for i in 0 ..< stopAfter:
|
|
var bck = db.getEthBlock(least + i).valueOr:
|
|
if doAssertOk:
|
|
doAssert i > 0, "expected at least one block"
|
|
break
|
|
|
|
tmp.add move(bck)
|
|
|
|
# Genesis block requires a chunk of its own, for compatibility with current
|
|
# test setup (a bit weird, that...)
|
|
if tmp.len mod blocksPerYield == 0 or tmp[0].header.blockNumber == 0:
|
|
yield tmp
|
|
tmp.setLen(0)
|
|
|
|
if tmp.len > 0:
|
|
yield tmp
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|