mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-02-22 16:58:21 +00:00
8dd038144b
* Remove `dirty` set from structural objects why: Not used anymore, the tree is dirty by default. * Rename `aristo_hashify` -> `aristo_compute` * Remove cruft, update comments, cosmetics, etc. * Simplify `SavedState` object why: The key chaining have become obsolete after extra lazy hashing. There is some available space for a state hash to be maintained in future. details: Accept the legacy `SavedState` object serialisation format for a while (which will be overwritten by new format.)
67 lines
2.1 KiB
Nim
67 lines
2.1 KiB
Nim
# 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.
|
|
|
|
import
|
|
std/tables,
|
|
eth/common,
|
|
results,
|
|
".."/[aristo_desc, aristo_get]
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc revFilter*(
|
|
db: AristoDbRef; # Database
|
|
filter: LayerDeltaRef; # Filter to revert
|
|
): Result[LayerDeltaRef,(VertexID,AristoError)] =
|
|
## Assemble reverse filter for the `filter` argument, i.e. changes to the
|
|
## backend that reverse the effect of applying the this read-only filter.
|
|
##
|
|
## This read-only filter is calculated against the current unfiltered
|
|
## backend (excluding optionally installed read-only filter.)
|
|
##
|
|
# Register MPT state roots for reverting back
|
|
let rev = LayerDeltaRef()
|
|
|
|
# Get vid generator state on backend
|
|
block:
|
|
let rc = db.getTuvUbe()
|
|
if rc.isOk:
|
|
rev.vTop = rc.value
|
|
elif rc.error != GetTuvNotFound:
|
|
return err((VertexID(0), rc.error))
|
|
|
|
# Calculate reverse changes for the `sTab[]` structural table
|
|
for vid in filter.sTab.keys:
|
|
let rc = db.getVtxUbe vid
|
|
if rc.isOk:
|
|
rev.sTab[vid] = rc.value
|
|
elif rc.error == GetVtxNotFound:
|
|
rev.sTab[vid] = VertexRef(nil)
|
|
else:
|
|
return err((vid,rc.error))
|
|
|
|
# Calculate reverse changes for the `kMap` sequence.
|
|
for vid in filter.kMap.keys:
|
|
let rc = db.getKeyUbe vid
|
|
if rc.isOk:
|
|
rev.kMap[vid] = rc.value
|
|
elif rc.error == GetKeyNotFound:
|
|
rev.kMap[vid] = VOID_HASH_KEY
|
|
else:
|
|
return err((vid,rc.error))
|
|
|
|
ok(rev)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|