mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-15 23:04:34 +00:00
2c35390bdf
* Aristo: Update error return code why: Failing of `Aristo` function `delete()` might fail because there is no such data item on the db. This must return a single error code as is done with `fetch()`. * Ledger: Better error handling why: The `expect()` clauses have been replaced by raising asserts indicating the error from the database backend. Also, `delete()` failures are legitimate if the item to delete does not exist. * Aristo: Delete function must always leave a label on DB for `hashify()` why: The `hashify()` uses the labels left bu `merge()` and `delete()` to compile (and optimise) a scheduler for subsequent hashing. Originally, the labels were not used for deleted entries and `delete()` still had some edge case where the deletion label was not properly handled. * Aristo: Update `hashify()` scheduler, remove buggy optimisation why: Was left over from version without virtual state roots which did not know about account payload leaf vertices referring to storage roots. * Aristo: Label storage trie account in `delete()` similar to `merge()` details; The `delete()` function applied to a non-static state root (assumed to be a storage root) will check the payload of an accounts leaf and mark its Merkle keys to be re-checked when runninh `hashify()` * Aristo: Clean up and re-org recycled vertex IDs in `hashify()` why: Re-organising the recycled vertex IDs list intends to reduce the size of the list. This list is organised as a LIFO (or stack.) By reorganising it in a way so that the least vertex ID numbers are on top, the list will be kept smaller as observed on some examples (less than 30%.) * CoreDb: Accept storage trie deletion requests in non-initialised state why: Due to lazy initialisation, the root vertex ID might not yet exist. So the `Aristo` database handlers would reject this call with an error and this condition needs to be handled by the API (which realises the lazy feature.) * Cosmetics & code massage, prettify logging * fix missing import
101 lines
3.7 KiB
Nim
101 lines
3.7 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.
|
|
|
|
## Handle vertex IDs on the layered Aristo DB delta architecture
|
|
## =============================================================
|
|
|
|
{.push raises: [].}
|
|
|
|
import
|
|
std/[algorithm, sequtils, typetraits],
|
|
"."/[aristo_desc, aristo_layers]
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc vidFetch*(db: AristoDbRef; pristine = false): VertexID =
|
|
## Create a new `VertexID`. Reusable vertex *ID*s are kept in a list where
|
|
## the top entry *ID* has the property that any other *ID* larger is also not
|
|
## not used on the database.
|
|
##
|
|
## The function prefers to return recycled vertex *ID*s if there are any.
|
|
## When the argument `pristine` is set `true`, the function guarantees to
|
|
## return a non-recycled, brand new vertex *ID* which is the preferred mode
|
|
## when creating leaf vertices.
|
|
if db.vGen.len == 0:
|
|
# Note that `VertexID(1)` is the root of the main trie
|
|
db.top.final.vGen = @[VertexID(LEAST_FREE_VID+1)]
|
|
result = VertexID(LEAST_FREE_VID)
|
|
elif db.vGen.len == 1 or pristine:
|
|
result = db.vGen[^1]
|
|
db.top.final.vGen[^1] = result + 1
|
|
else:
|
|
result = db.vGen[^2]
|
|
db.top.final.vGen[^2] = db.top.final.vGen[^1]
|
|
db.top.final.vGen.setLen(db.vGen.len-1)
|
|
doAssert LEAST_FREE_VID <= result.distinctBase
|
|
|
|
|
|
proc vidPeek*(db: AristoDbRef): VertexID =
|
|
## Like `new()` without consuming this *ID*. It will return the *ID* that
|
|
## would be returned by the `new()` function.
|
|
case db.vGen.len:
|
|
of 0:
|
|
VertexID(LEAST_FREE_VID)
|
|
of 1:
|
|
db.vGen[^1]
|
|
else:
|
|
db.vGen[^2]
|
|
|
|
|
|
proc vidDispose*(db: AristoDbRef; vid: VertexID) =
|
|
## Recycle the argument `vtxID` which is useful after deleting entries from
|
|
## the vertex table to prevent the `VertexID` type key values small.
|
|
if LEAST_FREE_VID <= vid.distinctBase:
|
|
if db.vGen.len == 0:
|
|
db.top.final.vGen = @[vid]
|
|
else:
|
|
let topID = db.vGen[^1]
|
|
# Only store smaller numbers: all numberts larger than `topID`
|
|
# are free numbers
|
|
if vid < topID:
|
|
db.top.final.vGen[^1] = vid
|
|
db.top.final.vGen.add topID
|
|
|
|
proc vidReorg*(vGen: seq[VertexID]): seq[VertexID] =
|
|
## Return a compacted version of the argument vertex ID generator state
|
|
## `vGen`. The function removes redundant items from the recycle queue and
|
|
## orders it in a way so that smaller `VertexID` numbers are re-used first.
|
|
##
|
|
if 1 < vGen.len:
|
|
let lst = vGen.mapIt(uint64(it)).sorted(Descending).mapIt(VertexID(it))
|
|
for n in 0 .. lst.len-2:
|
|
if lst[n].uint64 != lst[n+1].uint64 + 1:
|
|
# All elements of the sequence `lst[0]`..`lst[n]` are in decreasing
|
|
# order with distance 1. Only the smallest item is needed and the
|
|
# rest can be removed (as long as distance is 1.)
|
|
#
|
|
# Example:
|
|
# 7, 6, 5, 3.. => 5, 3.. => @[3..] & @[5]
|
|
# ^
|
|
# |
|
|
# n
|
|
#
|
|
return lst[n+1 .. lst.len-1] & @[lst[n]]
|
|
# Entries decrease continuously
|
|
return @[lst[^1]]
|
|
|
|
vGen
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|