2022-03-16 09:13:17 +00:00
|
|
|
# Nimbus
|
Core db and aristo updates for destructor and tx logic (#1894)
* Disable `TransactionID` related functions from `state_db.nim`
why:
Functions `getCommittedStorage()` and `updateOriginalRoot()` from
the `state_db` module are nowhere used. The emulation of a legacy
`TransactionID` type functionality is administratively expensive to
provide by `Aristo` (the legacy DB version is only partially
implemented, anyway).
As there is no other place where `TransactionID`s are used, they will
not be provided by the `Aristo` variant of the `CoreDb`. For the
legacy DB API, nothing will change.
* Fix copyright headers in source code
* Get rid of compiler warning
* Update Aristo code, remove unused `merge()` variant, export `hashify()`
why:
Adapt to upcoming `CoreDb` wrapper
* Remove synced tx feature from `Aristo`
why:
+ This feature allowed to synchronise transaction methods like begin,
commit, and rollback for a group of descriptors.
+ The feature is over engineered and not needed for `CoreDb`, neither
is it complete (some convergence features missing.)
* Add debugging helpers to `Kvt`
also:
Update database iterator, add count variable yield argument similar
to `Aristo`.
* Provide optional destructors for `CoreDb` API
why;
For the upcoming Aristo wrapper, this allows to control when certain
smart destruction and update can take place. The auto destructor works
fine in general when the storage/cache strategy is known and acceptable
when creating descriptors.
* Add update option for `CoreDb` API function `hash()`
why;
The hash function is typically used to get the state root of the MPT.
Due to lazy hashing, this might be not available on the `Aristo` DB.
So the `update` function asks for re-hashing the gurrent state changes
if needed.
* Update API tracking log mode: `info` => `debug
* Use shared `Kvt` descriptor in new Ledger API
why:
No need to create a new descriptor all the time
2023-11-16 19:35:03 +00:00
|
|
|
# Copyright (c) 2022-2023 Status Research & Development GmbH
|
2022-03-16 09:13:17 +00:00
|
|
|
# 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.
|
|
|
|
|
|
|
|
## Pretty printing, an alternative to `$` for debugging
|
|
|
|
## ----------------------------------------------------
|
|
|
|
##
|
|
|
|
## minimal dependencies, avoiding circular import
|
|
|
|
|
|
|
|
import
|
|
|
|
std/[sequtils, strformat, strutils, tables, times],
|
2022-08-18 20:41:03 +00:00
|
|
|
eth/common,
|
2023-10-25 14:03:09 +00:00
|
|
|
stew/byteutils,
|
2022-08-04 08:04:30 +00:00
|
|
|
../../nimbus/constants
|
2022-03-16 09:13:17 +00:00
|
|
|
|
|
|
|
export
|
|
|
|
sequtils, strformat, strutils
|
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Helpers
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
|
|
|
proc reGroup(q: openArray[int]; itemsPerSegment = 16): seq[seq[int]] =
|
|
|
|
var top = 0
|
|
|
|
while top < q.len:
|
|
|
|
let w = top
|
|
|
|
top = min(w + itemsPerSegment, q.len)
|
|
|
|
result.add q[w ..< top]
|
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Public functions, units pretty printer
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
2022-08-12 15:42:07 +00:00
|
|
|
proc ppUs*(elapsed: Duration): string =
|
|
|
|
result = $elapsed.inMicroseconds
|
|
|
|
let ns = elapsed.inNanoseconds mod 1_000 # fraction of a micro second
|
|
|
|
if ns != 0:
|
|
|
|
# to rounded deca milli seconds
|
|
|
|
let du = (ns + 5i64) div 10i64
|
|
|
|
result &= &".{du:02}"
|
|
|
|
result &= "us"
|
|
|
|
|
2022-03-16 09:13:17 +00:00
|
|
|
proc ppMs*(elapsed: Duration): string =
|
2022-04-08 04:54:11 +00:00
|
|
|
result = $elapsed.inMilliseconds
|
2022-08-12 15:42:07 +00:00
|
|
|
let ns = elapsed.inNanoseconds mod 1_000_000 # fraction of a milli second
|
2022-03-16 09:13:17 +00:00
|
|
|
if ns != 0:
|
|
|
|
# to rounded deca milli seconds
|
|
|
|
let dm = (ns + 5_000i64) div 10_000i64
|
|
|
|
result &= &".{dm:02}"
|
|
|
|
result &= "ms"
|
|
|
|
|
|
|
|
proc ppSecs*(elapsed: Duration): string =
|
|
|
|
result = $elapsed.inSeconds
|
2022-08-12 15:42:07 +00:00
|
|
|
let ns = elapsed.inNanoseconds mod 1_000_000_000 # fraction of a second
|
2022-03-16 09:13:17 +00:00
|
|
|
if ns != 0:
|
2022-08-12 15:42:07 +00:00
|
|
|
# round up
|
2022-03-16 09:13:17 +00:00
|
|
|
let ds = (ns + 5_000_000i64) div 10_000_000i64
|
|
|
|
result &= &".{ds:02}"
|
|
|
|
result &= "s"
|
|
|
|
|
2022-08-12 15:42:07 +00:00
|
|
|
proc ppMins*(elapsed: Duration): string =
|
|
|
|
result = $elapsed.inMinutes
|
|
|
|
let ns = elapsed.inNanoseconds mod 60_000_000_000 # fraction of a minute
|
|
|
|
if ns != 0:
|
|
|
|
# round up
|
|
|
|
let dm = (ns + 500_000_000i64) div 1_000_000_000i64
|
|
|
|
result &= &":{dm:02}"
|
|
|
|
result &= "m"
|
|
|
|
|
2022-03-16 09:13:17 +00:00
|
|
|
proc toKMG*[T](s: T): string =
|
|
|
|
proc subst(s: var string; tag, new: string): bool =
|
|
|
|
if tag.len < s.len and s[s.len - tag.len ..< s.len] == tag:
|
|
|
|
s = s[0 ..< s.len - tag.len] & new
|
|
|
|
return true
|
|
|
|
result = $s
|
|
|
|
for w in [("000", "K"),("000K","M"),("000M","G"),("000G","T"),
|
|
|
|
("000T","P"),("000P","E"),("000E","Z"),("000Z","Y")]:
|
|
|
|
if not result.subst(w[0],w[1]):
|
|
|
|
return
|
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Public functions, pretty printer
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
|
|
|
proc pp*(s: string; hex = false): string =
|
|
|
|
if hex:
|
|
|
|
let n = (s.len + 1) div 2
|
|
|
|
(if s.len < 20: s else: s[0 .. 5] & ".." & s[s.len-8 .. s.len-1]) &
|
|
|
|
"[" & (if 0 < n: "#" & $n else: "") & "]"
|
|
|
|
elif s.len <= 30:
|
|
|
|
s
|
|
|
|
else:
|
|
|
|
(if (s.len and 1) == 0: s[0 ..< 8] else: "0" & s[0 ..< 7]) &
|
|
|
|
"..(" & $s.len & ").." & s[s.len-16 ..< s.len]
|
|
|
|
|
|
|
|
proc pp*(q: openArray[int]; itemsPerLine: int; lineSep: string): string =
|
|
|
|
doAssert q == q.reGroup(itemsPerLine).concat
|
|
|
|
q.reGroup(itemsPerLine)
|
|
|
|
.mapIt(it.mapIt(&"0x{it:02x}").join(", "))
|
|
|
|
.join("," & lineSep)
|
|
|
|
|
|
|
|
proc pp*(a: MDigest[256]; collapse = true): string =
|
|
|
|
if not collapse:
|
2023-11-08 12:18:32 +00:00
|
|
|
a.data.toHex
|
2022-08-04 08:04:30 +00:00
|
|
|
elif a == ZERO_HASH256:
|
|
|
|
"ZERO_HASH256"
|
2022-09-03 18:15:35 +00:00
|
|
|
elif a == EMPTY_ROOT_HASH:
|
|
|
|
"EMPTY_ROOT_HASH"
|
2022-08-04 08:04:30 +00:00
|
|
|
elif a == EMPTY_UNCLE_HASH:
|
|
|
|
"EMPTY_UNCLE_HASH"
|
|
|
|
elif a == EMPTY_SHA3:
|
|
|
|
"EMPTY_SHA3"
|
|
|
|
elif a == ZERO_HASH256:
|
|
|
|
"ZERO_HASH256"
|
2022-03-16 09:13:17 +00:00
|
|
|
else:
|
2023-11-08 12:18:32 +00:00
|
|
|
a.data.toHex.join[56 .. 63]
|
2022-03-16 09:13:17 +00:00
|
|
|
|
|
|
|
proc pp*(a: openArray[MDigest[256]]; collapse = true): string =
|
|
|
|
"@[" & a.toSeq.mapIt(it.pp).join(" ") & "]"
|
|
|
|
|
|
|
|
proc pp*(q: openArray[int]; itemsPerLine: int; indent: int): string =
|
|
|
|
q.pp(itemsPerLine = itemsPerLine, lineSep = "\n" & " ".repeat(max(1,indent)))
|
|
|
|
|
|
|
|
proc pp*(q: openArray[byte]; noHash = false): string =
|
|
|
|
if q.len == 32 and not noHash:
|
|
|
|
var a: array[32,byte]
|
|
|
|
for n in 0..31: a[n] = q[n]
|
|
|
|
MDigest[256](data: a).pp
|
|
|
|
else:
|
2023-11-08 12:18:32 +00:00
|
|
|
q.toHex.pp(hex = true)
|
2022-03-16 09:13:17 +00:00
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Elapsed time pretty printer
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
|
|
|
template showElapsed*(noisy: bool; info: string; code: untyped) =
|
|
|
|
block:
|
|
|
|
let start = getTime()
|
2022-08-12 15:42:07 +00:00
|
|
|
block:
|
|
|
|
code
|
2022-03-16 09:13:17 +00:00
|
|
|
if noisy:
|
|
|
|
let elpd {.inject.} = getTime() - start
|
|
|
|
if 0 < times.inSeconds(elpd):
|
|
|
|
echo "*** ", info, &": {elpd.ppSecs:>4}"
|
|
|
|
else:
|
|
|
|
echo "*** ", info, &": {elpd.ppMs:>4}"
|
|
|
|
|
2022-08-12 15:42:07 +00:00
|
|
|
template showElapsed*(
|
|
|
|
noisy: bool;
|
|
|
|
info: string;
|
|
|
|
elapsed: Duration;
|
|
|
|
code: untyped) =
|
|
|
|
block:
|
|
|
|
let start = getTime()
|
|
|
|
block:
|
|
|
|
code
|
|
|
|
block:
|
|
|
|
let now = getTime()
|
|
|
|
elapsed = now - start
|
|
|
|
if noisy:
|
|
|
|
let elpd {.inject.} = elapsed
|
|
|
|
if 0 < times.inSeconds(elpd):
|
|
|
|
echo "*** ", info, &": {elpd.ppSecs:>4}"
|
|
|
|
else:
|
|
|
|
echo "*** ", info, &": {elpd.ppMs:>4}"
|
|
|
|
|
2022-03-16 09:13:17 +00:00
|
|
|
template catchException*(info: string; trace: bool; code: untyped) =
|
|
|
|
block:
|
|
|
|
try:
|
|
|
|
code
|
|
|
|
except CatchableError as e:
|
|
|
|
if trace:
|
|
|
|
echo "*** ", info, ": exception ", e.name, "(", e.msg, ")"
|
|
|
|
echo " ", e.getStackTrace.strip.replace("\n","\n ")
|
|
|
|
|
|
|
|
template catchException*(info: string; code: untyped) =
|
|
|
|
catchException(info, false, code)
|
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# End
|
|
|
|
# ------------------------------------------------------------------------------
|